mlfoundations-dev/Codeforces-Python-Submissions_processed

problem_id stringlengths 32 32	name stringlengths 2 54	problem stringlengths 204 5.28k	solutions sequencelengths 1 5.17k	test_cases stringlengths 38 86.7k	difficulty stringclasses 1 value	language stringclasses 1 value	source stringclasses 1 value	num_solutions int64 1 5.17k
cecc17339e00c6d82bab06b3a807d63d	Delete Them	Polycarp is a beginner programmer. He is studying how to use a command line. Polycarp faced the following problem. There are n files in a directory and he needs to delete some of them. Polycarp wants to run a single delete command with filename pattern as an argument. All the files to be deleted should match the pattern and all other files shouldn't match the pattern. Polycarp doesn't know about an asterisk '', the only special character he knows is a question mark '?' which matches any single character. All other characters in the pattern match themselves only. Formally, a pattern matches a filename if and only if they have equal lengths and all characters in the corresponding positions are equal except when the character in the pattern is '?', in which case the corresponding filename character does not matter. For example, the filename pattern "a?ba?": - matches filenames "aabaa", "abba.", "a.ba9" and "a.ba."; - does not match filenames "aaba", "abaab", "aabaaa" and "aabaa.". Help Polycarp find a pattern which matches files to be deleted and only them or report if there is no such pattern. The first line of the input contains two integers n* and m (1<=≤<=m<=≤<=n<=≤<=100) — the total number of files and the number of files to be deleted. The following n lines contain filenames, single filename per line. All filenames are non-empty strings containing only lowercase English letters, digits and dots ('.'). The length of each filename doesn't exceed 100. It is guaranteed that all filenames are distinct. The last line of the input contains m distinct integer numbers in ascending order a1,<=a2,<=...,<=am (1<=≤<=ai<=≤<=n) — indices of files to be deleted. All files are indexed from 1 to n in order of their appearance in the input. If the required pattern exists, print "Yes" in the first line of the output. The second line should contain the required pattern. If there are multiple solutions, print any of them. If the required pattern doesn't exist, print the only line containing "No". Sample Input 3 2 ab ac cd 1 2 5 3 test tezt test. .est tes. 1 4 5 4 4 a b c dd 1 2 3 4 6 3 .svn .git .... ... .. . 1 2 3 Sample Output Yes a? Yes ?es? No Yes .???	[ "n,m=map(int,input().split())\r\n\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n\ta.append(input())\r\n\t\r\nt=list(map(int,input().split()))\r\nflag=0\r\nx=len(a[t[0]-1])\r\nfor i in t:\r\n\tb.append(a[i-1])\r\n\tif len(a[i-1])!=x:\r\n\t\tflag=1\r\n\t\tbreak\r\n\r\ns=''\r\nif flag!=1:\r\n\tfor i in range(x):\r\n\t\tl=b[0][i]\r\n\t\tabc=0\r\n\t\tfor j in range(m):\r\n\t\t\tif b[j][i]!=l:\r\n\t\t\t\tabc=1\r\n\t\t\t\tbreak\r\n\t\tif(abc==0):\r\n\t\t\ts+=l\r\n\t\telse:\r\n\t\t\ts+='?'\r\n\t\r\n\t\r\n\tfor i in range(n):\r\n\t\tif i+1 not in t:\r\n\t\t\tif len(a[i])==x:\r\n\t\t\t\tflag=1\r\n\t\t\t\tfor j in range(x):\r\n\t\t\t\t\tif(s[j]=='?'):\r\n\t\t\t\t\t\tpass\r\n\t\t\t\t\telif(s[j]!=a[i][j]):\r\n\t\t\t\t\t\tflag=0\r\n\t\t\t\t\t\tbreak\r\n\t\t\r\n\t\tif flag==1:\r\n\t\t\tbreak\r\n\t\t\r\n\tif flag==1:\r\n\t\tprint(\"No\")\r\n\t\r\n\telse:\r\n\t\tprint(\"Yes\")\r\n\t\tprint(s)\r\n\r\nelse:\r\n\tprint(\"No\")\r\n\t", "n, m = map(int, input().split())\r\nfiles = []\r\nfor _ in range(n):\r\n files.append(input())\r\ntoDelete = list(map(lambda s: int(s) - 1, input().split()))\r\npattern = files[toDelete[0]]\r\nL = len(pattern)\r\nfor i in toDelete:\r\n if len(files[i]) != L:\r\n print('No')\r\n exit(0)\r\n for j in range(L):\r\n if pattern[j] != '?' and pattern[j] != files[i][j]:\r\n pattern = pattern[:j] + '?' + pattern[j + 1:]\r\nfor i in range(n):\r\n file = files[i]\r\n if i in toDelete or len(file) != L:\r\n continue\r\n match = True\r\n for j in range(L):\r\n if pattern[j] != '?' and pattern[j] != file[j]:\r\n match = False\r\n break\r\n if match:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\nprint(pattern)", "m,n=list(map(int,input().split()))\r\ns=[input().strip() for i in range(m)]\r\na=list(map(lambda x:int(x)-1,input().split()))\r\nstmpl=s[a[0]]\r\nf=1\r\ndef peres(s1,s2):\r\n\treturn ''.join([i if i==j else '?' for i,j in zip(s1,s2)])\r\nfor i in a:\r\n\tif len(stmpl)!=len(s[i]):\r\n\t\tf=0\r\n\t\tbreak\r\n\tstmpl=peres(stmpl,s[i])\r\nfor i,e in enumerate(s):\r\n\tif i in a:\r\n\t\tcontinue\r\n\tif len(stmpl)==len(e) and stmpl==peres(stmpl,e):\r\n\t\tf=0\r\n\t\tbreak\r\nif f:\r\n\tprint('Yes')\r\n\tprint(stmpl)\r\nelse:\r\n\tprint('No')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nind=map(int,input().split())\r\nind = list(ind)\r\nse = set(ind)\r\nle = len(l[ind[0]-1])\r\nflag=1\r\nfor i in range(m):\r\n if(len(l[ind[i]-1])!=le):\r\n flag=0\r\n break\r\nif flag==1:\r\n s = \"\"\r\n for j in range(le):\r\n flagc=1\r\n c=l[ind[0]-1][j]\r\n for i in range(m):\r\n if l[ind[i]-1][j]!=c:\r\n flagc=0\r\n break\r\n if flagc==0:\r\n s=s+\"?\"\r\n else:\r\n s=s+c\r\n d =[]\r\n for i in range(n):\r\n if i+1 not in se:\r\n if len(l[i])==le:\r\n d.append(l[i])\r\n \r\n for word in d:\r\n flagw=1\r\n for i in range(le):\r\n if s[i]!='?' and s[i]!=word[i]:\r\n flagw=0\r\n break\r\n if flagw==1:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"Yes\")\r\n print(s)\r\nelse:\r\n print(\"No\")\r\n \r\n", "n,m = map(int,input().split())\nv = []\nfor i in range(n):\n v.append(input())\ndele = list(map(int,input().split()))\nresult = 'Yes'\nchoose = []\nseen = [0]n\nLen = len(v[dele[0]-1])\npattenr = list(v[dele[0]-1])\nseen[dele[0]-1] = 1\nfor i in dele[1:]:\n if len(v[i-1]) != Len:\n result = 'No'\n break\n seen[i-1] = 1\n for cu, j in enumerate(v[i-1]):\n if j != pattenr[cu]:\n pattenr[cu] = '?'\nfor i in range(n):\n yy = 0\n if seen[i] == 0 and len(v[i]) == Len:\n for cu,j in enumerate(v[i]):\n if pattenr[cu] != '?' and pattenr[cu] != j:\n break\n yy+=1\n if yy == Len:\n result = 'No'\n break\n\nprint(result)\nif result != 'No':\n print(''.join(pattenr))\n\n", "[m, n] = [int(x) for x in input().split()]\r\n\r\nstrings = []\r\n\r\nfor i in range(m):\r\n strings.append(input())\r\n\r\nto_delete_index = [int(x)-1 for x in input().split()]\r\nto_delete = [strings[int(x)] for x in to_delete_index]\r\n\r\nbase_len = len(to_delete[0])\r\nfor s in to_delete:\r\n if len(s) != base_len:\r\n print('No')\r\n exit()\r\n\r\nmatch_string = \"\"\r\nfor i in range(base_len):\r\n match = to_delete[0][i]\r\n for s in to_delete:\r\n if s[i] != match:\r\n match = \"?\"\r\n break\r\n match_string += match\r\n\r\ndef match(s, match_string):\r\n if len(s) != len(match_string):\r\n return False\r\n\r\n for i in range(len(s)):\r\n if match_string[i] == \"?\":\r\n continue\r\n if match_string[i] != s[i]:\r\n return False\r\n return True\r\n\r\nfor i in range(len(strings)):\r\n if i in to_delete_index:\r\n continue\r\n if match(strings[i], match_string):\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\nprint(match_string)\r\n\r\n\r\n\r\n", "n, m = map(int,input().split())\nw = [input() for _ in range(n)]\ntodel = [w[i-1] for i in map(int, input().split())]\nif len(set(map(len,todel))) != 1:\n print('No')\nelse:\n pat = ''.join(['?' if len(set([todel[j][p] for j in range(m)])) != 1 else todel[0][p] for p in range(len(todel[0]))])\n ok = True\n for x in w:\n if len(x) != len(pat):\n continue\n if not x in todel:\n mat = True\n for i in range(len(pat)):\n if pat[i] != '?' and pat[i] != x[i]:\n mat = False\n break\n if mat:\n ok = False\n break\n if not ok:\n print('No')\n else:\n print('Yes')\n print(pat)\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nb = [int(_) for _ in input().split()]\r\np = list(a[b[0] - 1])\r\nfor i in range(1, len(b)):\r\n s = a[b[i] - 1]\r\n if len(s) != len(p):\r\n print(\"No\")\r\n raise SystemExit\r\n for j in range(len(s)):\r\n if s[j] != p[j] and p[j] != '?':\r\n p[j] = '?'\r\nk = 0\r\nf = False\r\nfor i in range(n):\r\n if k < m and i + 1 == b[k]:\r\n k += 1\r\n continue\r\n s = a[i]\r\n if len(s) == len(p):\r\n f = True\r\n for j in range(len(s)):\r\n if s[j] != p[j] and p[j] != '?':\r\n f = False\r\n break\r\n if f:\r\n print(\"No\")\r\n raise SystemExit\r\nprint(\"Yes\")\r\nprint(''.join(p))", "n, m = map(int, input().split())\r\nf = [input() for _ in range(n)]\r\nd = set(map(int, input().split()))\r\nc = {}\r\nl = 0\r\nfor x in d:\r\n l = len(f[x - 1])\r\n c[l] = 1\r\nif len(c) > 1:\r\n print('No')\r\nelse:\r\n t = ['?'] l\r\n for i in range(l):\r\n c = {}\r\n ch = ''\r\n for x in d:\r\n ch = f[x - 1][i]\r\n c[ch] = 1\r\n if 1 == len(c):\r\n t[i] = ch\r\n for i in range(n):\r\n if (i + 1) not in d:\r\n if len(f[i]) == l:\r\n ok = 0\r\n for j in range(l):\r\n if t[j] != '?' and f[i][j] != t[j]:\r\n ok = 1\r\n break\r\n if not ok:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\n print(''.join(t))\r\n", "__author__ = 'Think'\r\ndef check(s, password):\r\n\tif len(s)!=len(password):\r\n\t\treturn False\r\n\tfor i in range(len(password)):\r\n\t\tif password[i]!=\"?\":\r\n\t\t\tif password[i]!=s[i]:\r\n\t\t\t\treturn False\r\n\treturn True\r\n\r\nn, m=[int(i) for i in input().split()]\r\nfilenames=[]\r\nfor i in range(n):\r\n\tfilenames.append(input())\r\ndeleted_indices=[int(i)-1 for i in input().split()]\r\ndeleted=[]\r\nfails=False\r\nfor i in deleted_indices:\r\n\tdeleted.append(filenames[i])\r\nlength=len(deleted[0])\r\nfor s in deleted[1:]:\r\n\tif len(s)!=length:\r\n\t\tfails=True\r\n\t\tprint(\"No\")\r\n\t\tbreak\r\nif not fails:\r\n\tanswer=list(deleted[0])\r\n\tfor i in range(length):\r\n\t\tfor s in deleted[1:]:\r\n\t\t\tif s[i]!=answer[i]:\r\n\t\t\t\tanswer[i]=\"?\"\r\n\t\t\t\tbreak\r\n\tfor index in range(n):\r\n\t\tif index not in deleted_indices:\r\n\t\t\tif check(filenames[index], answer):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\tfails=True\r\n\t\t\t\tbreak\r\n\tif not fails:\r\n\t\tprint(\"Yes\")\r\n\t\tfor s in answer:\r\n\t\t\tprint(s, end=\"\")\r\n\t\tprint()\r\n", "N, M = map(int, input().split())\r\nwords = [input().strip() for _ in range(N)]\r\ngoods = []\r\nbads = []\r\nA = set(map(int, input().split()))\r\nfor i in range(N):\r\n if i+1 in A:\r\n goods.append(words[i])\r\n else:\r\n bads.append(words[i])\r\n\r\nif len(goods) == 0:\r\n print(\"Yes\")\r\n print(\"d238hgdu239dg923d9238hdi239dbobxdosaiodg9w8do2\")\r\n exit(0)\r\n\r\nfor good in goods:\r\n if len(good) != len(goods[0]):\r\n print(\"No\")\r\n exit()\r\n\r\nans = \"\"\r\nfor i in range(len(goods[0])):\r\n if all(good[i] == goods[0][i] for good in goods):\r\n ans += goods[0][i]\r\n else:\r\n ans += \"?\"\r\n\r\nfor bad in bads:\r\n if len(bad) == len(ans):\r\n if all(ans[i] == \"?\" or ans[i] == bad[i] for i in range(len(ans))):\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\nslova = []\nfor i in range(n):\n slova.append(input())\nna_zmazanie = [int(x)-1 for x in input().split()]\n\ndlzka_zmazanych = len(slova[na_zmazanie[0]])\nfor i in na_zmazanie:\n if len(slova[i]) != dlzka_zmazanych:\n print(\"No\")\n exit(0)\n\nzmaz = [False] * n\nfor i in na_zmazanie:\n zmaz[i] = True\nmatchujuce_nie_na_zmazanie = [i for i in range(n) if zmaz[i] == False and len(slova[i]) == dlzka_zmazanych] \n\npattern = \"\"\nfor i in range(0, dlzka_zmazanych):\n znak_prveho = slova[na_zmazanie[0]][i]\n for x in na_zmazanie:\n if slova[x][i] != znak_prveho:\n pattern += \"?\"\n break\n else:\n pattern += znak_prveho\n nove_matchujuce = []\n for y in matchujuce_nie_na_zmazanie:\n if slova[y][i] == znak_prveho: \n nove_matchujuce.append(y)\n matchujuce_nie_na_zmazanie = nove_matchujuce\n\nif len(matchujuce_nie_na_zmazanie) == 0:\n print(\"Yes\")\n print(pattern)\nelse:\n print(\"No\")\n", "import sys, threading, bisect, math, copy, itertools\r\n\r\nfrom heapq import heappush, heappop\r\nfrom functools import cmp_to_key as ctk, lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\n\r\nreadline = sys.stdin.readline\r\nread = lambda : list(map(int, readline().split()))\r\nreadstr = lambda : readline().rstrip()\r\n\r\n# dfv åªè½ä¸ºåºæ¬æ°æ®ç±»å\r\nalloc = lambda dfv, s: len(s) != 1 and [alloc(dfv, s[1:]) for _ in range(int(s[0]))] or [dfv] * int(s[0])\r\nshow = lambda arr: print(\" \".join(map(str, arr)))\r\n\r\n\r\ndef main():\r\n\r\n\r\n def check(a, b):\r\n if len(a) != len(b): return False\r\n for i in range(len(a)):\r\n if b[i] == '?': continue\r\n if a[i] != b[i]: return False\r\n return True\r\n\r\n INF = float('inf')\r\n MOD = 10 9 + 7\r\n dfd = defaultdict(int)\r\n # dq = deque()\r\n n, m = read()\r\n arr = [readstr() for _ in range(n)]\r\n det = read()\r\n k = len(arr[det[0] - 1])\r\n res = \"\"\r\n for i in range(k):\r\n cnt = set()\r\n for idx in det:\r\n idx -= 1\r\n if len(arr[idx]) != k:\r\n print('No')\r\n exit()\r\n cnt.add(arr[idx][i])\r\n if len(cnt) != 1: res += '?'\r\n else: res += cnt.pop()\r\n st = set(det)\r\n if res == \"\":\r\n print('No')\r\n exit()\r\n for i in range(n):\r\n if i + 1 not in st:\r\n s = arr[i]\r\n if check(s, res):\r\n print('No')\r\n exit()\r\n if len(res) == 0: print('No')\r\n else:\r\n print('Yes')\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain()\r\n\r\n# threading.stack_size((10 8))\r\n# t = threading.Thread(target=main)\r\n# t.start()\r\n# t.join()", "a,b=map(int,input().split())\r\nk=[input() for _ in \" \"*a]\r\nz=[i-1 for i in map(int,input().split())]\r\np=set()\r\nfor i in z:p.add(len(k[i]))\r\nif len(p)>1:exit(print(\"No\"))\r\nn=list(p)[0];s=k[z[0]];ans=''\r\nfor i in range(n):\r\n for j in range(b):\r\n if s[i]!=k[z[j]][i]:ans+='?';break\r\n else:ans+=s[i]\r\nok=1;p=-1\r\nfor i in k:\r\n p+=1\r\n if p in z:continue\r\n if len(i)==n:\r\n ko=1\r\n for j in range(n):\r\n if ans[j]!='?' and ans[j]!=i[j]:ko=0\r\n if ko:ok=0\r\nif ok:print(\"Yes\");print(ans)\r\nelse:print(\"No\")\r\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\nstrings = []\r\nfor i in range(n):\r\n f = stdin.readline().strip()\r\n strings.append(f)\r\n\r\nans = []\r\nchallengers = []\r\nused = set()\r\nfor a in list(map(int, stdin.readline().split())):\r\n challengers.append(strings[a - 1])\r\n used.add(a - 1)\r\nchallengers.sort()\r\n\r\nif len(challengers[0]) == len(challengers[-1]):\r\n challenger = list(challengers[0])\r\n length = len(challengers[0])\r\n for i in range(1, m):\r\n for j in range(length):\r\n if challenger[j] != challengers[i][j]:\r\n challenger[j] = '?'\r\n \r\n label = 1\r\n for i in range(n):\r\n if i in used or length != len(strings[i]):\r\n continue\r\n for j in range(length):\r\n if challenger[j] == '?':\r\n continue\r\n if challenger[j] != strings[i][j]:\r\n break\r\n else:\r\n label = 0\r\n \r\n if not label:\r\n stdout.write('No')\r\n else:\r\n stdout.write('Yes\\n' + ''.join(challenger))\r\nelse:\r\n stdout.write('No')", "n = int(input().split()[0])\r\n\r\nall_files = [str(input()) for i in range(n)]\r\n\r\nindex_to_del = [int(i) - 1 for i in (input().split())]\r\n\r\ndef find_pattern(all_files, index_to_del):\r\n for i in index_to_del[1:]:\r\n if len(all_files[i]) != len(all_files[index_to_del[0]]):\r\n\r\n return \"No\"\r\n pattern = ''\r\n for i in range(len(all_files[index_to_del[0]])):\r\n added = False\r\n for j in (index_to_del[1:]):\r\n if all_files[j][i] != all_files[index_to_del[0]][i]:\r\n if not added:\r\n pattern += '?'\r\n added = True\r\n if not added:\r\n pattern += all_files[index_to_del[0]][i]\r\n\r\n\r\n for i in range(len(all_files)):\r\n if i not in index_to_del:\r\n if len(all_files[i]) == len(pattern):\r\n matching_chars = []\r\n for index in range(len(pattern)):\r\n matching_chars.append(all_files[i][index] == pattern[index] or pattern[index] == '?')\r\n if all(matching_chars):\r\n return \"No\"\r\n\r\n print(\"Yes\")\r\n return pattern\r\n\r\n\r\nprint(find_pattern(all_files, index_to_del))\r\n", "import sys\r\n\r\nif __name__ == '__main__':\r\n n = input().split()\r\n n, m = int(n[0]), int(n[1])\r\n _l = list()\r\n for _ in range(n):\r\n _l.append(input())\r\n _ms = [int(x) - 1 for x in input().split()]\r\n common = list(_l[_ms[0]])\r\n reqlen = len(common)\r\n for indx in _ms[1:]:\r\n curr = _l[indx]\r\n clen = len(curr)\r\n if clen != reqlen:\r\n print('No')\r\n sys.exit(0)\r\n for i in range(len(curr)):\r\n if curr[i] != common[i]:\r\n common[i] = '?'\r\n for i in range(len(_l)):\r\n if i not in _ms:\r\n curr = _l[i]\r\n if len(curr) != reqlen:\r\n continue\r\n good = False\r\n for j in range(reqlen):\r\n if common[j] == '?':\r\n continue\r\n if common[j] != curr[j]:\r\n good = True\r\n if not good:\r\n print('No')\r\n sys.exit(0)\r\n print('Yes')\r\n print(''.join(common))", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nindices = set(map(lambda x: int(x)-1, input().split()))\r\n\r\nlengths = set([len(s[i]) for i in indices])\r\nif len(lengths) != 1:\r\n\tprint(\"No\")\r\n\texit(0)\r\n\r\nnon_indices = set(range(n)) - indices\r\n\r\nl = lengths.pop()\r\n\r\nans = []\r\n\r\nfor j in range(l):\r\n\tch = set()\r\n\tfor i in indices:\r\n\t\tch.add(s[i][j])\r\n\tif len(ch) == 1:\r\n\t\tans.append(ch.pop())\r\n\telse:\r\n\t\tans.append('?')\r\n\r\nans = \"\".join(ans)\r\n\r\nfor i in non_indices:\r\n\tgood = True\r\n\tif len(s[i]) != l:\r\n\t\tcontinue\r\n\tfor j in range(l):\r\n\t\tif ans[j] == '?':\r\n\t\t\tpass\r\n\t\telif ans[j] != s[i][j]:\r\n\t\t\tgood = False\r\n\t\t\tbreak\r\n\tif good:\r\n\t\tprint(\"No\")\r\n\t\texit(0)\r\n\r\nprint(\"Yes\")\r\nprint(ans)", "#!/bin/python\nimport sys\ncounter = 0\nallstrs = []\ndef firstnum (inpu):\n out = \"\"\n for char in inpu:\n if char == ' ':\n break\n out += char\n return int(out)\ndef secondnum (inpu):\n first = True\n out = \"\"\n for char in inpu:\n if char == ' ' and not(first):\n break\n elif char == ' ' and first:\n first = False\n out += char\n return int(out)\n\n\nfor line in sys.stdin:\n if counter == 0:\n counter += 1\n else:\n allstrs.append(line)\n\nremovalfiles = []\n\nremovalfilesnums = list(map(int, allstrs[allstrs.__len__() - 1].split(\" \")))\nfor i in range(0, removalfilesnums.__len__() - 0):\n removalfiles.append(allstrs[removalfilesnums[i] - 1])\nremovalfiles = [s.strip('\\n') for s in removalfiles]\n\nfor ff in removalfiles:\n if removalfiles[0].__len__() != ff.__len__():\n print(\"No\")\n sys.exit(0)\n\noutString = \"\"\nfor ii in range(0, removalfiles[0].__len__()):\n broke = False\n for ff in removalfiles:\n if ff[ii] != removalfiles[0][ii]:\n broke = True\n outString += '?'\n break\n if not broke:\n outString += removalfiles[0][ii]\n\nchecklist = [s.strip('\\n') for s in [allstrs[i] for i in range(0, allstrs.__len__()) if i + 1 not in removalfilesnums]]\nfor line in checklist:\n test = False\n if line.__len__() == outString.__len__():\n test = True\n for charLine, charOut in zip(line, outString):\n if charLine != charOut and charOut != '?':\n test = False\n if test:\n print(\"No\")\n sys.exit(0)\nprint(\"Yes\")\nprint(outString)\n", "import sys\r\nimport re\r\n\r\n[words, selected] = input().split(\" \")\r\n[words, selected] = [int(words), int(selected)]\r\nwordBuffer = []\r\nselectedWords = []\r\n\r\nfor i in range(words):\r\n wordBuffer.append(input())\r\nbuffer = input().split(\" \")\r\nfor i in buffer:\r\n selectedWords.append(wordBuffer[int(i) - 1])\r\n\r\nfor i in range(len(selectedWords)):\r\n if (i > 0 and len(selectedWords[i - 1]) != len(selectedWords[i])):\r\n print(\"No\")\r\n exit()\r\n\r\nreg = \"\"\r\nres = \"\"\r\nfor letter in range(len(selectedWords[0])):\r\n isQuested = False\r\n for i in range(selected):\r\n if (i > 0 and selectedWords[i - 1][letter] != selectedWords[i][letter]):\r\n reg += \".\"\r\n res += \"?\"\r\n isQuested = True\r\n break\r\n if (isQuested == False):\r\n if (selectedWords[0][letter] == \".\"):\r\n reg += \"\\\\\" + selectedWords[0][letter]\r\n else:\r\n reg += selectedWords[0][letter]\r\n res += selectedWords[0][letter]\r\n\r\nmatches = 0\r\nfor i in wordBuffer:\r\n if (re.fullmatch(reg, i) != None):\r\n matches += 1\r\n\r\nif (matches == selected):\r\n print(\"Yes\\n\" + res)\r\nelse:\r\n print(\"No\")\r\n" ]	{"inputs": ["3 2\nab\nac\ncd\n1 2", "5 3\ntest\ntezt\ntest.\n.est\ntes.\n1 4 5", "4 4\na\nb\nc\ndd\n1 2 3 4", "6 3\n.svn\n.git\n....\n...\n..\n.\n1 2 3", "4 2\n.b\n.c\ndbt\ne.\n2 4", "27 27\na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\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", "27 26\na\nb\nc\nd\nee\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\n1 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27", "27 26\na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nkq\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\n1 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27", "1 1\nuevim.mrr\n1", "2 1\nkbfyvezmy\nsbfammwcy\n1", "5 3\nlmljeqklg\nlclydkkxj\nuylscbk.g\neplpqakme\nablibhkfg\n1 3 5", "5 4\nabacaba\naaaaaaa\naaaaaab\naaaaaac\naaaaaad\n2 3 4 5", "5 4\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n2 3 4 5", "5 5\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n1 2 3 4 5", "5 3\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n2 3 4", "5 4\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\nabacaba\n1 2 3 4", "5 3\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 3 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 3 4 5", "5 5\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 2 3 4 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeee\n1 2 3 4", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\neeeeeeeee\ndddddddddd\n1 2 3 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\neeeeeeeee\ncccccccccc\ndddddddddd\n1 2 4 5", "5 4\naaaaaaaaaa\neeeeeeeee\nbbbbbbbbbb\ncccccccccc\ndddddddddd\n1 3 4 5", "5 4\neeeeeeeee\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\n2 3 4 5", "2 1\na\nb\n1", "2 1\na\nb\n2", "2 2\na\nb\n1 2", "2 1\naa\nb\n1", "2 1\naa\nb\n2", "2 2\naa\nb\n1 2", "2 1\nb\naa\n1", "2 1\nb\naa\n2", "2 2\nb\naa\n1 2", "2 1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaac\n1"], "outputs": ["Yes\na?", "Yes\n?es?", "No", "Yes\n.???", "No", "Yes\n?", "Yes\n?", "No", "Yes\nuevim.mrr", "Yes\nkbfyvezmy", "Yes\n??l???k?g", "Yes\naaaaaa?", "Yes\n?aaaaa?", "Yes\n??a?a??", "No", "Yes\n?aaaaa?", "No", "No", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\na", "Yes\nb", "Yes\n?", "Yes\naa", "Yes\nb", "No", "Yes\nb", "Yes\naa", "No", "Yes\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab"]}	UNKNOWN	PYTHON3	CODEFORCES	20
cedb194ead074bf927d95693dde3edb3	none	Edo has got a collection of n refrigerator magnets! He decided to buy a refrigerator and hang the magnets on the door. The shop can make the refrigerator with any size of the door that meets the following restrictions: the refrigerator door must be rectangle, and both the length and the width of the door must be positive integers. Edo figured out how he wants to place the magnets on the refrigerator. He introduced a system of coordinates on the plane, where each magnet is represented as a rectangle with sides parallel to the coordinate axes. Now he wants to remove no more than k magnets (he may choose to keep all of them) and attach all remaining magnets to the refrigerator door, and the area of the door should be as small as possible. A magnet is considered to be attached to the refrigerator door if its center lies on the door or on its boundary. The relative positions of all the remaining magnets must correspond to the plan. Let us explain the last two sentences. Let's suppose we want to hang two magnets on the refrigerator. If the magnet in the plan has coordinates of the lower left corner (x1, y1) and the upper right corner (x2, y2), then its center is located at (, ) (may not be integers). By saying the relative position should correspond to the plan we mean that the only available operation is translation, i.e. the vector connecting the centers of two magnets in the original plan, must be equal to the vector connecting the centers of these two magnets on the refrigerator. The sides of the refrigerator door must also be parallel to coordinate axes. The first line contains two integers n and k (1<=≤<=n<=≤<=100<=000, 0<=≤<=k<=≤<=min(10,<=n<=-<=1)) — the number of magnets that Edo has and the maximum number of magnets Edo may not place on the refrigerator. Next n lines describe the initial plan of placing magnets. Each line contains four integers x1,<=y1,<=x2,<=y2 (1<=≤<=x1<=<<=x2<=≤<=109, 1<=≤<=y1<=<<=y2<=≤<=109) — the coordinates of the lower left and upper right corners of the current magnet. The magnets can partially overlap or even fully coincide. Print a single integer — the minimum area of the door of refrigerator, which can be used to place at least n<=-<=k magnets, preserving the relative positions. Sample Input 3 1 1 1 2 2 2 2 3 3 3 3 4 4 4 1 1 1 2 2 1 9 2 10 9 9 10 10 9 1 10 2 3 0 1 1 2 2 1 1 1000000000 1000000000 1 3 8 12 Sample Output 1 64 249999999000000001	[ "from math import ceil\n\n\ndef add(c, k, s, i0, di):\n i = i0\n while len(s) < k:\n s.add(c[i])\n i += di\n\n\ndef fst(c, s, i0, di):\n i = i0\n while c[i] in s:\n i += di\n return c[i]\n\n\ndef doors(ms, k):\n cs = [((m[2]+m[0])/2, (m[3]+m[1])/2, i) for i, m in enumerate(ms)]\n cx = sorted(cs, key=lambda t: t[0])\n cy = sorted(cs, key=lambda t: t[1])\n\n for kl in range(k+1):\n s1 = set(cx[:kl])\n for kr in range(k+1-kl):\n s2 = s1 \| set(cx[-kr:] if kr else [])\n add(cy, kl+kr, s2, -kr-1, -1)\n for ku in range(k+1-kl-kr):\n s3 = s2 \| set(cy[:ku])\n add(cy, kl+kr+ku, s3, ku, 1)\n\n kd = k-kl-kr-ku\n s4 = s3 \| set(cy[-kd:] if kd else [])\n add(cy, kl+kr+ku+kd, s4, -kd-1, -1)\n\n minx = fst(cx, s4, kl, 1)[0]\n maxx = fst(cx, s4, -kr-1, -1)[0]\n miny = fst(cy, s4, ku, 1)[1]\n maxy = fst(cy, s4, -kd-1, -1)[1]\n a = max(ceil(maxx-minx), 1) * max(ceil(maxy-miny), 1)\n yield a\n\n\ndef min_door(ms, k):\n return min(doors(ms, k))\n\n\ndef quad(i):\n a, b, c, d = i\n return a, b, c, d\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n ms = (quad(map(int, input().split())) for _ in range(n))\n print(min_door(ms, k))\n", "from sys import\n#\ndef check(u, d, l, r):\n used = [pointsx[i][1] for i in range(l)]\n used += [pointsx[-1 - i][1] for i in range(r)]\n used += [pointsy[i][1] for i in range(u)]\n used += [pointsy[-1 - i][1] for i in range(d)]\n if len(set(used)) > k:\n return DOHERA\n dx = pointsx[-1 - r][0] - pointsx[l][0]\n dy = pointsy[-1 - d][0] - pointsy[u][0]\n dx += dx & 1\n dy += dy & 1\n dx = max(2, dx)\n dy = max(2, dy)\n return dx dy\n#\n(n, k) = map(int, input().split())\npointsx = []\npointsy = []\nDOHERA = 10 ** 228\nfor i in range(n):\n a = list(map(int, input().split()))\n pointsx += [(a[0] + a[2], i)]\n pointsy += [(a[1] + a[3], i)]\n(pointsx, pointsy) = (sorted(pointsx), sorted(pointsy))\nans = DOHERA\nfor u in range(0, k + 1):\n for d in range(0, k + 1):\n for l in range(0, k + 1):\n for r in range(0, k + 1):\n if l + r <= k and u + d <= k:\n ans = min(ans, check(u, d, l, r))\nprint(ans // 4)\n\n\n\n# Made By Mostafa_Khaled" ]	{"inputs": ["3 1\n1 1 2 2\n2 2 3 3\n3 3 4 4", "4 1\n1 1 2 2\n1 9 2 10\n9 9 10 10\n9 1 10 2", "3 0\n1 1 2 2\n1 1 1000000000 1000000000\n1 3 8 12", "11 8\n9 1 11 5\n2 2 8 12\n3 8 23 10\n2 1 10 5\n7 1 19 5\n1 8 3 10\n1 5 3 9\n1 2 3 4\n1 2 3 4\n4 2 12 16\n8 5 12 9", "20 5\n1 12 21 22\n9 10 15 20\n10 12 12 20\n1 1 25 29\n5 10 21 22\n4 9 16 25\n12 10 14 24\n3 3 19 27\n3 4 23 28\n9 1 11 31\n9 14 17 18\n8 12 14 20\n8 11 18 19\n12 3 14 29\n7 8 13 22\n6 4 16 30\n11 3 13 27\n9 16 15 18\n6 13 14 21\n9 12 15 22", "1 0\n1 1 100 100", "1 0\n1 1 2 2", "1 0\n1 1 4 4", "2 1\n1 1 1000000000 1000000000\n100 200 200 300", "2 1\n1 1 1000000000 2\n1 1 2 1000000000", "2 1\n1 1 999999999 1000000000\n1 1 1000000000 999999999", "1 0\n1 1 1000000000 1000000000", "1 0\n100 300 400 1000", "1 0\n2 2 3 3"], "outputs": ["1", "64", "249999999000000001", "4", "4", "1", "1", "1", "1", "1", "1", "1", "1", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	2
cedf23f9cd9f0334094c4c443a3b28cd	Sum	Vasya studies positional numeral systems. Unfortunately, he often forgets to write the base of notation in which the expression is written. Once he saw a note in his notebook saying a<=+<=b<==<=?, and that the base of the positional notation wasn’t written anywhere. Now Vasya has to choose a base p and regard the expression as written in the base p positional notation. Vasya understood that he can get different results with different bases, and some bases are even invalid. For example, expression 78<=+<=87 in the base 16 positional notation is equal to FF16, in the base 15 positional notation it is equal to 11015, in the base 10 one — to 16510, in the base 9 one — to 1769, and in the base 8 or lesser-based positional notations the expression is invalid as all the numbers should be strictly less than the positional notation base. Vasya got interested in what is the length of the longest possible expression value. Help him to find this length. The length of a number should be understood as the number of numeric characters in it. For example, the length of the longest answer for 78<=+<=87<==<=? is 3. It is calculated like that in the base 15 (11015), base 10 (16510), base 9 (1769) positional notations, for example, and in some other ones. The first letter contains two space-separated numbers a and b (1<=≤<=a,<=b<=≤<=1000) which represent the given summands. Print a single number — the length of the longest answer. Sample Input 78 87 1 1 Sample Output 3 2	[ "import math\n\n# For some reason, wrong answer... FCKING EPSILON log(1000, 10) = 2.9999999...\n# Intuition: The lowest base will produce the longest number\n\nEPSILON = 0.00000001\n\na, b = [int(i) for i in input().split()]\n\n# Assuming no wacky letters\ndef highest_digit(number):\n return max([int(c) for c in str(number)])\n \ndef length_in_base(number, base):\n if number == 0:\n return 1\n\n # SCREW YOU EPSILON\n return math.floor(math.log(number, base) + 1 + EPSILON)\n\ndef solve_problem(a, b):\n highest = max(highest_digit(a), highest_digit(b))\n base_to_be_used = highest + 1\n\n a_in_base = int(str(a), base_to_be_used)\n b_in_base = int(str(b), base_to_be_used)\n\n the_sum = a_in_base + b_in_base\n\n length = length_in_base(the_sum, base_to_be_used)\n\n return length\n \n\nanswer = solve_problem(a, b)\nprint(answer)\n\n'''\n# Brute Force 1000 x 1000 == 1000000\n\nfirst_list = []\nfor a in range(1, 1000):\n for b in range(1, 1000):\n first_list.append(solve_problem(a, b))\n\nimport numpy\n\ndef solve2(a, b):\n B = max([int(c) for c in (str(a)+str(b))]) + 1\n\n #a_in_base = numpy.base_repr(a, B)\n #b_in_base = numpy.base_repr(b, B)\n\n a_val = int(str(a), B)\n b_val = int(str(b), B)\n\n the_sum = a_val + b_val\n\n the_sum_in_base = numpy.base_repr(the_sum, B)\n\n return len(the_sum_in_base)\n\n\nsecond_list = []\nfor a in range(1, 1000):\n for b in range(1, 1000):\n second_list.append(solve2(a, b))\n\nprint(first_list == second_list)\n\n# Good idea, but fails because \"all the numbers should be strictly less than the positional notation base.\"\n#if set(str(a)) == {'1'} and set(str(b)) == {'1'}:\n# print(len(str(a)) + len(str(b)))\n#else:\n# print(answer)\n'''\n \t\t \t \t\t\t\t\t \t\t \t \t\t\t \t\t \t\t", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(a, b):\r\n a = str(a)\r\n b = str(b)\r\n c = max(max(a), max(b))\r\n c = int(c) + 1\r\n a = (4-len(a))'0'+a\r\n b = (4-len(b))'0'+b\r\n d = 0\r\n cur = 1\r\n for i in range(4):\r\n d += (int(a[3-i])+int(b[3-i]))cur\r\n cur = c\r\n ans = 0\r\n while d:\r\n d = d//(c)\r\n ans += 1\r\n return ans\r\n\r\na, b = get_ints()\r\nprint(solve(a,b))", "\r\nsa, sb = input().strip().split()\r\n\r\nbase = max(int(c) for c in sa + sb) + 1\r\n\r\na = int(sa); b = int(sb)\r\n\r\nans = 0; prev = 0\r\nwhile a + b + prev:\r\n prev = (a % 10 + b % 10 + prev) // base\r\n a //= 10; b //= 10\r\n ans += 1\r\n\r\nprint(ans)", "# LUOGU_RID: 113950280\na,b=input().split();x=int(max(a+b))+1;s,v=int(a,x)+int(b,x),0\r\nwhile s:s,v=s//x,v+1\r\nprint(v)", "x,y = input().split()\r\nmx = 0\r\nfor i in x :\r\n mx = max(mx,int(i))\r\nfor i in y :\r\n mx = max(mx,int(i))\r\nmx += 1\r\nsm = int(x,mx)\r\nsm += int(y,mx)\r\nout = \"\"\r\nwhile sm > 0 :\r\n out += str(sm%mx)\r\n sm //= mx\r\nprint(len(out))", "a,b=list(map(int,input().split()))\r\nk=int(max(str(a)+str(b)))+1\r\ncarry=0\r\nl=max(len(str(a)),len(str(b)))\r\nfor itr in range(l):\r\n if a%10+b%10+carry<k: carry=0\r\n else: carry=1\r\n a//=10\r\n b//=10\r\n #print(a,b)\r\nif carry: print(l+1)\r\nelse: print(l)", "import math\r\n\r\n\r\ndef findBase(line):\r\n ans = 1\r\n for item in line:\r\n if item == ' ':\r\n continue\r\n temp = int(item)\r\n if ans < temp:\r\n ans = temp\r\n return ans + 1\r\n\r\n\r\ndef toDecimalfromBase(line: str, base: int) -> int:\r\n ans, i, _len, exp = 0, 0, len(line), len(line) - 1\r\n while i < _len:\r\n ans += int(line[i]) pow(base, exp)\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\ndef convertToBase(num: int, base: int) -> str:\r\n ans = ''\r\n while num > 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\nline = input()\r\nbase = findBase(line)\r\nnum1str, num2str = line.split()\r\n\r\nnum1 = toDecimalfromBase(num1str, base)\r\nnum2 = toDecimalfromBase(num2str, base)\r\n\r\nsummary = num1 + num2\r\nprint(len(convertToBase(summary, base)))\r\n# print(convertToBase(summary, base))\r\n# print(summary)\r\n\r\n'''\r\n124\r\n1010\r\n\r\n78 87\r\n\r\n124 345\r\n\r\n101 110 = 1000 =\r\n\r\n'''\r\n", "a, b = input().strip().split()\na_int = int(a)\nb_int = int(b)\nsum_ab_str = a + b\n\nbase = max(int(c) for c in sum_ab_str) + 1\n\nsol = 0\nba = 0\nwhile a_int + b_int + ba:\n sum_dig = (a_int % 10) + (b_int % 10) + ba\n ba = (sum_dig) // base\n a_int //= 10\n b_int //= 10\n sol += 1\n\nprint(sol)\n\t\t \t\t\t \t\t \t \t \t\t \t\t \t\t", "a,b=map(int, input().split())\r\nmax1=a%10\r\nch1=a\r\nch2=b\r\nwhile a>0:\r\n if a%10>max1:\r\n max1=a%10\r\n a=a//10\r\nmax2=b%10\r\nwhile b>0:\r\n if b%10>max2:\r\n max2=b%10\r\n b=b//10\r\nc=max(max1,max2)\r\nc+=1\r\nch1=int(str(ch1),c)\r\nch2=int(str(ch2),c)\r\nsum=ch1+ch2\r\ni=0\r\nwhile ci<sum:\r\n i+=1\r\nif ci==sum:\r\n i+=1\r\nprint(i)\r\n ", "def to_Decimal(n, b):\r\n n = n[::-1]\r\n d = 0\r\n\r\n for i in range(len(n)):\r\n d += int(n[i]) * (b*i)\r\n\r\n return d\r\n\r\n\r\ndef Convert(n, b):\r\n x = ''\r\n while not n == 0:\r\n x += str(n % b)\r\n n = n//b\r\n return x[::-1]\r\n\r\n\r\nn1, n2 = input().split()\r\nbase = int(max(str(n1) + str(n2))) + 1\r\nn1 = to_Decimal(n1, base)\r\nn2 = to_Decimal(n2, base)\r\n\r\nprint(len(Convert(n1+n2, base)))\r\n", "a, b = tuple(input().split())\n\nbase = max([int(let) for let in a+b]) + 1\n\nn1 = n2 = 0\n\npotencia = 1\nfor let in a[::-1]:\n n1 += int(let)potencia\n potencia = base\npotencia = 1\nfor let in b[::-1]:\n n2 += int(let)potencia\n potencia = base\n\nn = n1 + n2\ncontador = 0\npotencia = 1\n\nwhile potencia <= n:\n potencia = base\n contador += 1\n\nprint(contador)\n \t \t\t\t\t \t \t\t \t \t\t\t \t \t\t\t\t", "a,b=map(int,input().split())\r\nta=a \r\ntb=b \r\naa=0\r\nbb=0\r\nwhile a>0:\r\n\taa=max(aa,a%10)\r\n\ta=a//10 \r\nwhile b>0:\r\n\tbb=max(bb,b%10)\r\n\tb=b//10 \r\nbase=max(aa,bb)+1 \r\nans=0\r\np=1\r\nwhile ta>0:\r\n\ta+=(p(ta%10))\r\n\tp=base \r\n\tta=ta//10\r\np=1\r\nwhile tb>0:\r\n\tb+=(p(tb%10))\r\n\tp=base\r\n\ttb=tb//10\r\nc=(a+b)\r\nwhile c>0:\r\n\tc=c//base\r\n\tans+=1\r\nprint(ans)", "from math import \na, b = input().split()\nd = max(ord(c)-ord('0') for c in (a+b))+1\nr, c = int(a, d)+int(b, d), 0\nwhile r:\n\tc += 1\n\tr //= d\nprint(c)\n", "a , b = (list)(map(int , input().split()))\r\na = [int(x) for x in str(a)]\r\nb = [int(x) for x in str(b)]\r\nif len(a) > len(b) :\r\n a , b = b , a\r\ndiff = len(b) - len(a)\r\nwhile diff > 0 :\r\n diff -= 1\r\n a = [0] + a\r\n \r\ni = max(max(a) , max(b))\r\nn = len(a)\r\n\r\nmax_ = 0\r\nfor base in range(i + 1 , 1500) :\r\n len_ = 0\r\n carry = 0\r\n for index in range(n - 1 , -1 , -1) :\r\n sum = carry + a[index] + b[index]\r\n carry = sum // base\r\n len_ += 1\r\n if carry > 0 : len_ += 1\r\n max_ = max(max_ , len_)\r\n \r\nprint(max_)", "def count_digits_in_new_base(number,new_base):\n if number == 0:\n return 1\n digits = 0\n while number >=1:\n digits += 1\n number = int(number/new_base)\n return digits\n\ndef get_min_base(number):\n digits = list(str(number))\n min_base = int(max(digits))+1 # The minimum base = Maximum digit in the number + 1\n return min_base\n\ndef get_integer_value_for_given_base(number,base):\n result = 0\n weight = 1 \n while number >=1:\n remainder = number%10\n result += remainder weight\n weight = base\n number = int(number/10)\n return result\n\n\ndef find_length_of_longest_expression(a, b):\n # The minimum base should be greater than any digit in a and b.\n min_base = max(get_min_base(a),get_min_base(b))\n\n # Find decimal SUM of inputs, based on the min_base\n sum = get_integer_value_for_given_base(a,min_base)+get_integer_value_for_given_base(b,min_base)\n\n # Count number of digits in the sum\n value = count_digits_in_new_base(sum,min_base)\n return value\n\nv = [int(x) for x in input().split(' ')]\na = v[0]\nb = v[1]\nprint(find_length_of_longest_expression(a,b))", "def change_base(num, base):\n\tpower_set = 0\n\tresult = 0\n\tfor i in str(num)[::-1]:\n\t\tresult += int(i) (base) ** power_set\n\t\tpower_set += 1\n\treturn result\n\ndef count_len(num, base):\n\tcopy_num = num + 0\n\tlen_num = 0\n\twhile copy_num != 0:\n\t\tcopy_num = copy_num // base\n\t\tlen_num += 1\n\treturn len_num\n\ndef sum_bases(a,b):\n\tstr_nums = str(a)+str(b)\n\tmax_num = int(str_nums[0])\n\tfor i in str_nums:\n\t\tif int(i) > max_num:\n\t\t\tmax_num = int(i)\n\tif max_num == 0:\n\t\treturn 1\n\tmax_num += 1\n\tsum_bases = (change_base(a, max_num)+change_base(b, max_num))\n\tprint(count_len(sum_bases, max_num))\n\nnums = input().split()\nsum_bases(nums[0],nums[1])\n \t \t \t \t \t\t\t\t \t\t \t\t\t", "def any2dec(num_original,base_original):\r\n num_original = str(num_original)\r\n base_original = int(base_original)\r\n dic = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\n dec = 0\r\n dec_temp = list(num_original)\r\n dec_temp.reverse()\r\n for x,i in enumerate(dec_temp):\r\n dec += dic.index(i) * base_original*(x)\r\n return str(dec)\r\n\r\n\r\ndef dec2any(dec,base_final):\r\n base_final = int(base_final)\r\n dec = int(dec)\r\n dic = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\n numero_final_temp = []\r\n numero_final = ''\r\n while True:\r\n temp_numero_final = dec%base_final\r\n numero_final_temp.append(temp_numero_final)\r\n if int(dec/base_final) == 0:\r\n break\r\n dec = int(dec/base_final)\r\n numero_final_temp.reverse()\r\n for i in numero_final_temp:\r\n numero_final += dic[i] \r\n return numero_final\r\n\r\ndef main():\r\n v = input().split()\r\n a = [int(i) for i in list(v[0])]\r\n b = [int(i) for i in list(v[1])]\r\n \r\n base = max(max(a), max(b))+1\r\n \r\n va = any2dec(v[0], base)\r\n vb = any2dec(v[1], base)\r\n \r\n ans = int(va)+int(vb)\r\n print(len(dec2any(ans, base)))\r\n\r\nmain()", "def baseN(num,b,numerals=\"0123456789abcdefghijklmnopqrstuvwxyz\"):\n return ((num == 0) and numerals[0]) or (baseN(num // b, b, numerals).lstrip(numerals[0]) + numerals[num % b])\n\n\nclass CodeforcesTask49BSolution:\n def __init__(self):\n self.result = ''\n self.expression = []\n\n def read_input(self):\n self.expression = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n nums = str(self.expression[0]) + str(self.expression[1])\n base = max([int(c) for c in nums]) + 1\n num1 = int(str(self.expression[0]), base)\n num2 = int(str(self.expression[1]), base)\n self.result = str(len(baseN(num1 + num2, base)))\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask49BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def converter(number, base):\r\n #split number in figures\r\n figures = [int(i,base) for i in str(number)]\r\n #invert oder of figures (lowest count first)\r\n figures = figures[::-1]\r\n result = 0\r\n #loop over all figures\r\n for i in range(len(figures)):\r\n #add the contirbution of the i-th figure\r\n result += figures[i]base*i\r\n return result\r\ndef dec_to_base(num,base): #Maximum base - 36\r\n base_num = \"\"\r\n while num>0:\r\n dig = int(num%base)\r\n if dig<10:\r\n base_num += str(dig)\r\n else:\r\n base_num += chr(ord('A')+dig-10) #Using uppercase letters\r\n num //= base\r\n base_num = base_num[::-1] #To reverse the string\r\n return base_num\r\na,b = map(int,input().split())\r\nlista = []\r\nstrA=str(a)\r\nstrB=str(b)\r\nstrA=strA+strB\r\nstrA.upper()\r\nfor i in strA:\r\n if i == 'A':\r\n lista.append(10)\r\n elif i == 'B':\r\n lista.append(11)\r\n elif i == 'C':\r\n lista.append(12)\r\n elif i == 'D':\r\n lista.append(13)\r\n elif i == 'E':\r\n lista.append(14)\r\n elif i == 'F':\r\n lista.append(15)\r\n elif i == 'G':\r\n lista.append(16)\r\n elif i == 'H':\r\n lista.append(17)\r\n elif i == 'I':\r\n lista.append(18)\r\n elif i == 'J':\r\n lista.append(19)\r\n elif i == 'K':\r\n lista.append(20)\r\n elif i == 'L':\r\n lista.append(21)\r\n elif i == 'M':\r\n lista.append(22)\r\n elif i == 'N':\r\n lista.append(23)\r\n elif i == 'O':\r\n lista.append(24)\r\n elif i == 'P':\r\n lista.append(25)\r\n elif i == 'Q':\r\n lista.append(26)\r\n elif i == 'R':\r\n lista.append(27)\r\n elif i == 'S':\r\n lista.append(28)\r\n elif i == 'T':\r\n lista.append(29)\r\n elif i == 'U':\r\n lista.append(30)\r\n elif i == 'V':\r\n lista.append(31)\r\n elif i == 'W':\r\n lista.append(32)\r\n elif i == 'X':\r\n lista.append(33)\r\n elif i == 'Y':\r\n lista.append(34)\r\n elif i == 'Z':\r\n lista.append(35)\r\n else:\r\n lista.append(int(i))\r\nB=max(lista)+1\r\na=converter(a,B)\r\nb=converter(b,B)\r\nsum=a+b\r\nres = dec_to_base(sum,B)\r\nprint(len(str(res)))\r\n\r\n", "jaja = input().split(\" \")\na = jaja[0]\nb = jaja[1]\nmayor = 0\nfor xd in jaja:\n for d in xd:\n if int(d) > mayor:\n mayor = int(d)\nbase = mayor+1\nvalora = 0\nvalorb = 0\nfor j in range(len(a)):\n valora = valora + int(a[j])base*(len(a)-1-j)\nfor k in range(len(b)):\n valorb = valorb + int(b[k])base(len(b)-1-k)\nsuma = valora+valorb\nm = 0\nwhile basem <= suma:\n m = m+1\nprint(m)\n\t \t\t \t\t \t \t\t \t \t \t \t", "a, b = map(str, input().split())\r\np = 0\r\nfor c in a:\r\n p = max(p, int(c))\r\nfor c in b:\r\n p = max(p, int(c))\r\np += 1\r\nn = max(len(a), len(b))\r\na = list(a)\r\nb = list(b)\r\na.reverse()\r\nb.reverse()\r\nx = [0](n+1)\r\nfor i in range(n):\r\n if i < len(a):\r\n x[i] += int(a[i])\r\n if i < len(b):\r\n x[i] += int(b[i])\r\n q, r = divmod(x[i], p)\r\n x[i] = r\r\n x[i+1] = q\r\nif x[-1] != 0:\r\n print(n+1)\r\nelse:\r\n print(n)\r\n", "\nfrom collections import defaultdict\nimport math\nimport re \n\nf, s = input().split()\n\n\ndef dec_to_base(num,base): #Maximum base - 36\n base_num = \"\"\n while num>0:\n dig = int(num%base)\n if dig<10:\n base_num += str(dig)\n else:\n base_num += chr(ord('A')+dig-10) #Using uppercase letters\n num //= base\n base_num = base_num[::-1] #To reverse the string\n return base_num\n\n\nmax_digit = 0\n\nfor digit in f:\n max_digit = max(max_digit, int(digit))\nfor digit in s:\n max_digit = max(max_digit, int(digit))\n\nmax_digit += 1\n\nvalue = int(f, max_digit) + int(s, max_digit)\nvalue = dec_to_base(value, max_digit)\nprint(len(value))", "from collections import \r\n\r\nletters = '0123456789ABCDEF'\r\n\r\n\r\ndef todecimal(s, base):\r\n res = 0\r\n for i in range(len(s)):\r\n res = (res * base) + letters.find(s[i])\r\n return res\r\n\r\n\r\ndef tobase(s, base):\r\n res = deque([])\r\n if s == 0:\r\n return 0\r\n while (s != 0):\r\n res.appendleft(letters[s % base])\r\n s //= base\r\n return ''.join(res)\r\n\r\n\r\na, b = map(int, input().split())\r\nma = max(int(max(list(str(a)))), int(max(list(str(b))))) + 1\r\na, b = todecimal(str(a), ma), todecimal(str(b), ma)\r\nans = a + b\r\n\r\nprint(len(tobase(ans, ma)))\r\n", "info = input().split()\n\ndef cambiodebase(n, b):\n if n == 0:\n return [0]\n digits = []\n while n > 0:\n digits.append(str(n % b))\n n //= b\n return digits\n\ndef base10(n,c):\n total = 0\n m = len(n)\n for i in range(len(n)):\n total += int(n[i])(c(m-i-1))\n return total\n\n\n\na = info[0]\nb = info[1]\nc = max(list(map(int,list(a+b)))) + 1\nn = base10(a,c) + base10(b,c)\n\nprint(len(cambiodebase(n,c)))\n \t \t\t \t \t\t \t \t\t \t\t\t \t\t", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\ndef base_to_ten(s, base):\r\n ans = 0\r\n power = 0\r\n for c in s.decode()[::-1]:\r\n ans += (ord(c) - 48) (base ** power)\r\n power += 1\r\n return ans\r\n\r\n\r\nline = stdin.buffer.readline()\r\nbase = int(chr(max(line))) + 1\r\n\r\n\r\na, b = line.split()\r\n\r\nx = base_to_ten(a, base) + base_to_ten(b, base)\r\n\r\n\r\nlst = []\r\n\r\nwhile x:\r\n lst.append(str(x % base))\r\n x = x // base\r\n\r\nprint (len(lst))", "sizdvch=list(map(str,input().split()))\r\nisch=[]\r\nperch=int(sizdvch[0])\r\nvtoch=int(sizdvch[1])\r\nvivo=[]\r\nfor i in range(2):\r\n for j in range(len(sizdvch[i])):\r\n isch.append(int(sizdvch[i][j]))\r\nmaxch=max(isch)\r\nminsis=maxch+1\r\nif minsis == 10:\r\n print(len(str(perch+vtoch)))\r\nelse:\r\n for i in range(2):\r\n n = sizdvch[i]\r\n dlin=len(n)\r\n n1=0\r\n ndp=''\r\n for j in range(dlin):\r\n ndp=n[j]\r\n n1 = n1 + (int(ndp) * minsis*(dlin - j -1))\r\n vivo.append(n1)\r\n sumvivo=sum(vivo)\r\n b=''\r\n while sumvivo > 0 :\r\n if sumvivo%minsis < 10:\r\n b = str(sumvivo%minsis)+b\r\n else:\r\n if sumvivo%minsis == 10: b = 'A'+b\r\n if sumvivo%minsis == 11: b = 'B'+b\r\n if sumvivo%minsis == 12: b = 'C'+b\r\n if sumvivo%minsis == 13: b = 'D'+b\r\n if sumvivo%minsis == 14: b = 'E'+b\r\n if sumvivo%minsis == 15: b = 'F'+b\r\n sumvivo = sumvivo // minsis\r\n print(len(b))\r\n", "\na, b = input().split()\nsol=0\nfor i in range(10, 1, -1):\n try:\n c = int(a, i)+int(b, i)\n s = 0\n while c:\n c//=i\n s+=1\n sol=max(s, sol)\n except ValueError:\n break\nprint(sol)\n", "def s():\r\n\t[a,b] = input().split()\r\n\tm = int(max(max(a),max(b)))+1\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tc = 0\r\n\tr = 0\r\n\twhile a or b or c:\r\n\t\tr += 1\r\n\t\tc = (a%10+b%10+c)//m\r\n\t\ta//=10\r\n\t\tb//=10\r\n\tprint(r)\r\ns()", "def findBase(line):\r\n ans = 1\r\n for item in line:\r\n if ans < int(item):\r\n ans = int(item)\r\n return ans + 1\r\n\r\n\r\ndef toDecimal(line, base):\r\n _len = len(line)\r\n ans, i, exp = 0, 0, _len - 1\r\n\r\n while i < _len:\r\n ans += int(line[i]) pow(base, exp)\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\ndef toBase(num, base):\r\n ans = ''\r\n while num != 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\ns1, s2 = input().split(' ')\r\nbase = findBase(s1 + s2)\r\nnum1, num2 = toDecimal(s1, base), toDecimal(s2, base)\r\nprint(len(toBase(num1 + num2, base)))\r\n\r\n'''\r\n78 + 87 = FF base 16\r\n\r\n78 = 716^1 + 816^0 = 120\r\n87 = 816^1 + 716^0 = 135\r\n\r\n120 + 135 = 255\r\n\r\n255 : 16 = 15 (15)\r\n15 : 16 = 0 (15)\r\n\r\n10 -> 'A'\r\n11 -> 'B'\r\n12 -> 'C'\r\n13 -> 'D'\r\n14 -> 'E'\r\n15 -> 'F'\r\n---------------------------------------------\r\n78 + 87 = 176 base 9\r\n\r\n10\r\n78 = 79^1 + 89^0 = 63 + 8 = 71\r\n87 = 89^1 + 79^0 = 72 + 7 = 79\r\n\r\n71 + 79 = 150\r\n\r\n150 : 9 = 16 (6)\r\n16 : 9 = 1 (7)\r\n1 : 9 = 0 (1)\r\n'''\r\n", "import sys\r\n\r\ndef largest(x):\r\n ret = 0\r\n while x > 0:\r\n ret = max(ret, x%10)\r\n x //= 10\r\n return ret\r\n\r\ndef tobase(x, base):\r\n ret = 0\r\n p=1\r\n while x>0:\r\n ret+=(x%10)p\r\n p=base\r\n x //= 10\r\n return ret\r\n\r\n\r\ndef digitsNum(x, base):\r\n ret = 0\r\n while x>0:\r\n ret += 1\r\n x //= base\r\n return ret\r\n\r\nn, m= map(int, sys.stdin.read().split())\r\nbase = max(largest(n),largest(m)) + 1\r\nx = tobase(n, base) + tobase(m, base)\r\nprint(digitsNum(x, base))", "def convertir(numero, base):\n resultado = ''\n while numero > 0:\n residuo = numero % base\n if residuo < 10:\n resultado = str(residuo) + resultado\n else:\n resultado = chr(ord('A') + residuo - 10) + resultado\n numero //= base\n return resultado\n\nnum1, num2 = input().split()\nmaximo = max(max(num1), max(num2))\n\nlargo = 0\nfor base in range(16, int(maximo), -1):\n suma = int(num1, base) + int(num2, base)\n largo = max(largo, len(convertir(suma, base)))\n\nprint(largo)\n \t\t \t\t\t \t\t\t \t\t \t \t \t\t", "def convert10tob( N, b):\r\n s=\"\"\r\n while(N!=0):\r\n s+=str(N%b)\r\n N//=b\r\n return s[::-1]\r\nn,m=map(str,input().split())\r\nmx=''\r\nfor i in n:\r\n mx=max(mx,i)\r\nfor i in m:\r\n mx=max(mx,i)\r\nmx=int(mx)\r\nk=int(m,mx+1)\r\ny=int(n,mx+1)\r\nz=str(k+y)\r\nprint(len(convert10tob(int(z),mx+1)))", "#!/usr/bin/env python3\r\n\r\n(a,b) = input().split()\r\nhighest_digit = max(int(digit) for digit in a+b)\r\nchosen_base = highest_digit + 1\r\ntotal = int(a, base=chosen_base) + int(b, base=chosen_base)\r\nnr_digits = 0\r\nwhile (total > 0):\r\n nr_digits+= 1\r\n total = total // chosen_base\r\n\r\nprint(nr_digits)", "def nti(a,x):\r\n r=''\r\n u='0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n while a>0:\r\n r+=u[a%x]\r\n a=a//x\r\n if r=='':r='0'\r\n return r[::-1]\r\na,b=input().split()\r\ns=int(max(a+b))+1\r\nprint(len(nti(int(a,s)+int(b,s),s)))\r\n", "a=input().split()\r\nf=int(max(a[0]+a[1]))+1\r\nt=((int(a[0],f)+int(a[1],f)))\r\ny=0\r\nwhile t:\r\n y+=1\r\n t//=f\r\nprint(y)", "def n_positional_value_to_decimal(n, a):\n lista = [int(number) for number in str(a)]\n value = 0\n for i in range(len(lista) - 1, -1, -1):\n value += lista[i] * n ** (len(lista) - 1 - i)\n return value\n\n\ndef decimal_to_n_positional_value(n, a):\n lista = []\n while a > 0:\n lista.append(a % n)\n a = a // n\n lista.reverse()\n return len(lista)\n\ninp = input()\nnumbers = inp.split(\" \")\nlista = []\nfor number in numbers:\n for i in range(len(number)):\n lista.append(int(number[i]))\nnumbers = [int(x) for x in numbers]\n\nminimo = max(lista)\nmaximo = 0\nfor i in range(minimo + 1, 1000):\n if decimal_to_n_positional_value(i, n_positional_value_to_decimal(i, numbers[0]) + n_positional_value_to_decimal(i, numbers[1])) > maximo:\n maximo = decimal_to_n_positional_value(i, n_positional_value_to_decimal(i, numbers[0]) + n_positional_value_to_decimal(i, numbers[1]))\n\nprint(maximo)\n \t\t\t\t \t \t\t\t\t \t \t \t \t\t\t\t", "def findBase(line):\r\n ans = 1\r\n for item in line:\r\n if item == ' ':\r\n continue\r\n helper = ord(item) - 48\r\n if ans < helper:\r\n ans = helper\r\n return ans + 1\r\n\r\n\r\ndef convertInBase(num, base):\r\n ans = ''\r\n while num != 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\ndef convertToDecimal(s, base):\r\n ans, _len = 0, len(s)\r\n exp = _len - 1\r\n i = 0\r\n while i < _len:\r\n ans += int(s[i]) * base ** exp\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\nline = input()\r\nbase = findBase(line)\r\ns1, s2 = line.split(' ')\r\nnum1 = convertToDecimal(s1, base)\r\nnum2 = convertToDecimal(s2, base)\r\nnum3 = num1 + num2\r\nans = convertInBase(num3, base)\r\nprint(len(ans))\r\n", "from audioop import reverse\r\n\r\n\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return 1\r\n digits = 0\r\n while n:\r\n digits+=1\r\n n //= b\r\n return digits\r\n\r\n\r\nbase = 0\r\na,b = input().split()\r\nfor i in a+b:\r\n base=max(base, int(i)+1)\r\n\r\na=a[::-1]\r\nb=b[::-1]\r\nn1,n2=0,0\r\nfor i in range(len(a)):\r\n n1+= int(a[i])pow(base, i)\r\n\r\nfor i in range(len(b)):\r\n n2+= int(b[i])pow(base, i)\r\n\r\nprint(numberToBase(n1+n2, base))", "ax, bx = map(str, input().split())\r\nd = max([ord(c) - ord('0') for c in ax] + [ord(c) - ord('0') for c in bx]) + 1\r\nad, bd = 0, 0\r\nfor dig in ax:\r\n ad = ad * d + (ord(dig) - ord('0')) % 10\r\nfor dig in bx:\r\n bd = bd * d + (ord(dig) - ord('0')) % 10\r\nc = ad + bd\r\nans = 0\r\nwhile c > 0:\r\n ans += 1\r\n c //= d\r\nprint(ans)", "import sys\r\n\r\ndef digitsNum(x, base):\r\n ret = 0\r\n while x>0:\r\n ret += 1\r\n x //= base\r\n return ret\r\n\r\nn, m= sys.stdin.read().split()\r\n\r\nbase = int(max(max(n), max(m)))+1\r\nn = int(n, base)\r\nm = int(m, base)\r\n\r\nprint(digitsNum(n+m, base))", "def basechange(n, base):\n new_number = []\n q = n\n while (q >= base):\n new_number.append(q%base)\n q = q//base\n new_number.append(q)\n return new_number\n\ndef to_base_10(n, base):\n string_n = str(n)\n total = 0\n for i, number in enumerate(string_n[::-1]):\n total += (base*i) int(number)\n return total\n\n\nnumber1, number2 = map(int, input().strip().split(' '))\nmax_n = max(max(str(number1)), max(str(number2)))\n# smallest base possible is max_n + 1\nprint(len(basechange(to_base_10(number1, int(max_n) + 1) + to_base_10(number2, int(max_n) + 1), int(max_n) + 1)))\n\t\t \t\t\t\t\t\t \t\t\t \t \t\t", "a, b = input().split()\r\ncarry = 0\r\nbase = int(max(a + b)) + 1\r\nres = ''\r\nwhile a or b or carry:\r\n s = int(a[-1:] or '0') + int(b[-1:] or '0') + carry\r\n a, b = a[:-1], b[:-1]\r\n carry, num = divmod(s, base)\r\n res = str(num) + res\r\n\r\nprint(len(res))\n# Sat Oct 15 2022 10:29:40 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\r\nm = 0\r\nfor i in str(a):\r\n m = max(m, int(i))\r\nfor i in str(b):\r\n m = max(m, int(i))\r\nm += 1\r\n\r\nf = 0\r\ns = 0\r\nt = 1\r\nfor i in str(a)[::-1]:\r\n f += int(i) * t\r\n t = m\r\nt = 1\r\nfor i in str(b)[::-1]:\r\n s += int(i) t\r\n t = m\r\n\r\nfin = f + s\r\nt = 1\r\nans = 0\r\nwhile t m <= fin:\r\n ans += 1\r\n t = m\r\n\r\nprint(ans + 1)\r\n", "a, b = input().split()\r\nbase = int(max(max(a), max(b))) + 1\r\na, b = int(a, base), int(b, base)\r\nans, s = 0, a + b\r\nwhile s:\r\n s //= base\r\n ans += 1\r\nprint(ans)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na, b = input().split()\r\nbase = max(max(map(int, a)), max(map(int, b))) + 1\r\nans = 0\r\nrem = 0\r\na, b = int(a), int(b)\r\nwhile a or b or rem:\r\n ans += 1\r\n rem += (a % 10) + (b % 10)\r\n a, b = a // 10, b // 10\r\n rem //= base\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\ns = set()\r\nfor i in list(str(a)):\r\n s.add(int(i))\r\nfor i in list(str(b)):\r\n s.add(int(i))\r\nm = 0\r\nfor i in s:\r\n m = max(m, i)\r\nm += 1\r\nans = 0\r\nfor i in range(m, 20):\r\n a0, b0 = list(str(a)), list(str(b))\r\n a1, b1 = 0, 0\r\n j = 1\r\n while a0:\r\n a1 += j int(a0.pop())\r\n j = i\r\n j = 1\r\n while b0:\r\n b1 += j int(b0.pop())\r\n j = i\r\n c = a1 + b1\r\n x = 1\r\n ans0 = 0\r\n while x <= c:\r\n ans0 += 1\r\n x = i\r\n ans = max(ans, ans0)\r\nprint(ans)", "l=input().split(' ')\r\na,b=int(l[0]),int(l[1])\r\n\r\ndef sum_base(base, args):\r\n def numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n # at this point, digits[::-1] is the list of digits of n at base b\r\n return int(''.join(map(str, digits[::-1]))) # convert a list of digits into a int\r\n \r\n # first, convert all number to base 10 and take the sum\r\n sum_base10 = sum([int(str(number), base) for number in args])\r\n \r\n # second, convert the base10 sum into base b with the function numberToBase define above\r\n return numberToBase(sum_base10, base)\r\n\r\nbiggest_numeral = '0'\r\n\r\nfor item in str(a) + str(b):\r\n\tif item > biggest_numeral:\r\n\t\tbiggest_numeral = item\r\n\r\nif '0' <= biggest_numeral <= '9':\r\n\tbiggest_numeral = int(biggest_numeral)\r\nelse:\r\n\tbiggest_numeral = ord(biggest_numeral) - ord('A') + 10\r\n\r\n\r\nprint( len(\r\n\r\n\tstr(\r\n\t\tsum_base(biggest_numeral + 1,a,b)\r\n\t)\r\n))\r\n\r\n", "a, b = input().split()\r\nx = int(max(a + b)) + 1\r\ns, v = int(a, x) + int(b, x), 0\r\nwhile s:\r\n s, v = s // x, v + 1\r\nprint(v)\r\n", "#encoding:utf-8\r\nimport math\r\n\r\nstrs = input()\r\ntmp = strs.split(' ')\r\na = tmp[0]\r\nb = tmp[1]\r\naL = list(a)\r\nbL = list(b)\r\naL.reverse()\r\nbL.reverse()\r\nstrL = list(strs.replace(\" \", \"\"))\r\nbigest = 0\r\nfor i in strL:\r\n if bigest < int(i):\r\n bigest = int(i)\r\nbase = bigest + 1\r\n\r\nif len(aL)>len(bL) :\r\n lenAB = len(aL)\r\nelse:\r\n lenAB = len(bL)\r\nnewNum = []\r\nnextAdd = 0\r\nj = 0\r\nwhile (j<lenAB or nextAdd != 0):\r\n if j >= len(aL):\r\n aL.append(0)\r\n if j >= len(bL):\r\n bL.append(0)\r\n newNum.append((int(aL[j]) + int(bL[j]) + nextAdd) % base)\r\n nextAdd = int((int(aL[j]) + int(bL[j]) + nextAdd) / base)\r\n j += 1\r\n \r\n \r\nprint (len(newNum))", "a,b=input().split()\r\nm1=-1\r\nm2=-1\r\nfor i in a:\r\n m1=max(m1,int(i))\r\nfor i in b:\r\n m2=max(m2,int(i))\r\nm=max(m1,m2)\r\nbase=m+1\r\nlen_a = len(a)\r\nlen_b = len(b)\r\ns = \"\";\r\nsum = \"\";\r\ndiff = abs(len_a - len_b);\r\nfor i in range(1,diff+1):\r\n s += \"0\"\r\nif (len_a < len_b):\r\n a = s + a\r\nelse:\r\n b = s + b;\r\ncarry = 0;\r\nfor i in range(max(len_a, len_b) - 1,-1,-1):\r\n curr=carry+(ord(a[i])-ord('0'))+(ord(b[i])-ord('0'));\r\n carry = curr // base\r\n curr = curr % base;\r\n sum = chr(curr + ord('0')) + sum\r\n\r\nif (carry > 0):\r\n sum = chr(carry + ord('0')) + sum;\r\nprint(len(sum))", "import math\n\ndef add_base(a, b, base):\n # print(base)\n a = int(a, base = base)\n b = int(b, base = base)\n # print(\"a\",a)\n # print(\"b\",b)\n res = a + b\n # print(\"res\",res)\n nu = ''\n while res:\n nu = str(res % base) + nu\n res = math.floor(res / base)\n # print(\"nu\", nu)\n return len(nu)\n\ndef main():\n a, b = input().split()\n st = str(a) + str(b)\n max_ord = 0\n for i in st:\n if max_ord < (ord(i) - 48):\n max_ord = (ord(i) - 48)\n base = max_ord + 1\n ans = add_base(a, b, base)\n print(ans)\n\nif __name__ == '__main__':\n main()\n", "def from_p_to_q(p, q, number):\n flag = False\n number = list(str(number))\n if number[0] == '-':\n number.pop(0)\n flag = True\n processed_num = list()\n for elem in number:\n if elem in ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']:\n processed_num.append(str(ord(elem) - 55))\n else:\n processed_num.append(elem)\n num_10 = 0\n const = 0\n for elem in processed_num[::-1]:\n num_10 += int(elem)(pconst)\n const += 1\n num_q = list()\n while num_10 >= q:\n num_q.append(num_10 % q)\n num_10 = num_10 // q\n if num_q != 0:\n num_q.append(num_10)\n processed_num_q = list()\n for elem in num_q:\n if elem >= 10:\n processed_num_q.append(str(chr(elem + 55)))\n else:\n processed_num_q.append(str(elem))\n processed_num_q = processed_num_q[::-1]\n if flag:\n processed_num_q.insert(0, '-')\n return \"\".join(processed_num_q)\n\ndef from_q_n_to_q_m(q, n, m, number):\n flag = False\n result = str()\n number = list(str(number))\n if number[0] == '-':\n number.pop(0)\n flag = True\n if len(number) % m > 0:\n multiplier = len(number) // m + 1\n for elem in range(len(number) % m):\n number = number[::-1]\n number.append('0')\n number = number[::-1]\n else:\n multiplier = len(number) // m\n c = 0\n for elem in range(multiplier):\n result = result + from_p_to_q(qn, q**m, ''.join(number[c:c+m]))\n c += m\n if flag:\n return '-' + result\n else:\n return result\n \n\nnums = input().split()\na = '0123456789'\nall_nums = list(a) + ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\nbase = max([all_nums.index(max(i, key=all_nums.index)) + 1 for i in nums])\nprint(len(from_p_to_q(10, base, int(from_p_to_q(base, 10, nums[0])) + int(from_p_to_q(base, 10, nums[1])))))\n# Wed Nov 24 2021 11:10:49 GMT+0000 (Coordinated Universal Time)\n" ]	{"inputs": ["78 87", "1 1", "9 7", "11 11", "43 21", "84 89", "12 34", "99 11", "11 99", "99 99", "1 2", "1 3", "2 1", "2 2", "2 3", "3 1", "3 2", "3 3", "1 466", "1 1000", "1 999", "149 1", "999 1", "1000 1", "998 998", "998 999", "998 1000", "999 998", "999 999", "999 1000", "1000 998", "1000 999", "1000 1000", "1000 539", "999 619", "2 511", "877 2", "379 999", "247 1000", "555 555", "208 997", "633 581", "411 517", "836 101", "262 685", "39 269", "464 205", "890 789", "667 373", "840 975", "810 413", "133 851", "104 938", "427 376", "398 815", "721 253", "692 339", "15 778", "986 216", "450 277", "333 1", "499 499", "79 1", "87 1", "47 8", "87 8", "1 11"], "outputs": ["3", "2", "2", "3", "3", "3", "3", "3", "3", "3", "2", "2", "2", "2", "2", "2", "2", "2", "3", "4", "4", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "5", "4", "4", "3", "3", "4", "4", "4", "4", "4", "4", "4", "4", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "3", "4", "3", "4", "3", "2", "2", "2", "3", "3"]}	UNKNOWN	PYTHON3	CODEFORCES	52
cee4791929f0bd6034bfc5e68fc4deda	Vanya and Label	While walking down the street Vanya saw a label "Hide&Seek". Because he is a programmer, he used & as a bitwise AND for these two words represented as a integers in base 64 and got new word. Now Vanya thinks of some string s and wants to know the number of pairs of words of length \|s\| (length of s), such that their bitwise AND is equal to s. As this number can be large, output it modulo 109<=+<=7. To represent the string as a number in numeral system with base 64 Vanya uses the following rules: - digits from '0' to '9' correspond to integers from 0 to 9; - letters from 'A' to 'Z' correspond to integers from 10 to 35; - letters from 'a' to 'z' correspond to integers from 36 to 61; - letter '-' correspond to integer 62; - letter '_' correspond to integer 63. The only line of the input contains a single word s (1<=≤<=\|s\|<=≤<=100<=000), consisting of digits, lowercase and uppercase English letters, characters '-' and '_'. Print a single integer — the number of possible pairs of words, such that their bitwise AND is equal to string s modulo 109<=+<=7. Sample Input z V_V Codeforces Sample Output 3 9 130653412	[ "print(3*sum(6-bin({'-':62,'_':63}.get(c,ord(c)-7(c>'9')-6(c>'Z')-48)).count('1') for c in input())%1000000007)", "import string\r\nfrom itertools import chain\r\nfrom os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef dec_to_bin(x: int, n: int) -> str:\r\n return bin(x)[2:].zfill(n)\r\n\r\n\r\ndef solution():\r\n mod = 10 ** 9 + 7\r\n s = input()\r\n d = {c: i for i, c in enumerate((chain.from_iterable(('0123456789', string.ascii_uppercase, string.ascii_lowercase, '-_'))))}\r\n ans = 1\r\n for c in s:\r\n for bit in dec_to_bin(d[c], 6):\r\n if bit == '0':\r\n ans = (ans * 3) % mod\r\n print(ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def char2int(a):\r\n x = ord(a)\r\n if ord('0') <= x <= ord('9'):\r\n return x - ord('0')\r\n if ord('A') <= x <= ord('Z'):\r\n return x - ord('A') + 10 \r\n if ord('a') <= x <= ord('z'):\r\n return x - ord('a') + 36\r\n if a == '-':\r\n return 62\r\n else:\r\n return 63\r\n \r\nzeros = 0\r\nfor z in input():\r\n zeros += 6\r\n num = format(char2int(z), \"b\")\r\n for i in num:\r\n if i == '1':\r\n zeros -= 1\r\n\r\nprint((3zeros) % (109 + 7))\r\n " ]	{"inputs": ["z", "V_V", "Codeforces", "zHsIINYjVtU71kmM9E", "fRRNAdMvLFTX21T0FG5gyn7NG0SaIvzGG_g_SO", "Lb1T3sA4BcTx4KAgLIsl-dNOGDvimpxZOxJfMz6VC3nQkB3Y780qqX_1dnjjb59H9X", "2kdYy5-G2-TL5dtLRKcp0ScPGQMrEjwsXuxJHZb4EOd7g7NSQYiAuX2O40PKVyMGEQ1WzW6TvQqbrM1O6e3TdduRsk", "kuCerLoRuMSm6wa_YM", "_", "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_", "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_", "__________", "___________________________________________________________________X________________________________", "Bq", "UhXl", "oXyg5", "6"], "outputs": ["3", "9", "130653412", "130312847", "547121709", "680590434", "39961202", "172815616", "1", "803556829", "188799173", "1", "81", "729", "19683", "43046721", "81"]}	UNKNOWN	PYTHON3	CODEFORCES	3
ceedf38faa444936a913b20e9cd7d9c4	Connected Components	We already know of the large corporation where Polycarpus works as a system administrator. The computer network there consists of n computers and m cables that connect some pairs of computers. In other words, the computer network can be represented as some non-directed graph with n nodes and m edges. Let's index the computers with integers from 1 to n, let's index the cables with integers from 1 to m. Polycarpus was given an important task — check the reliability of his company's network. For that Polycarpus decided to carry out a series of k experiments on the computer network, where the i-th experiment goes as follows: 1. Temporarily disconnect the cables with indexes from li to ri, inclusive (the other cables remain connected). 1. Count the number of connected components in the graph that is defining the computer network at that moment. 1. Re-connect the disconnected cables with indexes from li to ri (that is, restore the initial network). Help Polycarpus carry out all experiments and for each print the number of connected components in the graph that defines the computer network through the given experiment. Isolated vertex should be counted as single component. The first line contains two space-separated integers n, m (2<=≤<=n<=≤<=500; 1<=≤<=m<=≤<=104) — the number of computers and the number of cables, correspondingly. The following m lines contain the cables' description. The i-th line contains space-separated pair of integers xi, yi (1<=≤<=xi,<=yi<=≤<=n; xi<=≠<=yi) — the numbers of the computers that are connected by the i-th cable. Note that a pair of computers can be connected by multiple cables. The next line contains integer k (1<=≤<=k<=≤<=2·104) — the number of experiments. Next k lines contain the experiments' descriptions. The i-th line contains space-separated integers li, ri (1<=≤<=li<=≤<=ri<=≤<=m) — the numbers of the cables that Polycarpus disconnects during the i-th experiment. Print k numbers, the i-th number represents the number of connected components of the graph that defines the computer network during the i-th experiment. Sample Input 6 5 1 2 5 4 2 3 3 1 3 6 6 1 3 2 5 1 5 5 5 2 4 3 3 Sample Output 4 5 6 3 4 2	[ "import os,sys,collections,heapq,itertools,functools\r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2 \r\nfrom copy import copy \r\nfrom io import BytesIO, IOBase \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = IOWrapper(sys.stdin).readline \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass UF:\r\n def __init__(self,n,cp=None):\r\n if cp: self.Fa = cp.Fa[:]\r\n else : self.Fa = [n] + [-1] * n \r\n def getroot(self,i):\r\n root = i \r\n while self.Fa[root] >= 0 :\r\n root =self.Fa[root] \r\n while i != root : \r\n nex,self.Fa[i] =self.Fa[i], root \r\n i = nex\r\n return root \r\n def union(self,a,b):\r\n ra,rb = self.getroot(a),self.getroot(b) \r\n if ra != rb: \r\n self.Fa[0] -= 1 \r\n if self.Fa[ra] < self.Fa[rb] : \r\n ra,rb = rb,ra\r\n self.Fa[rb] += self.Fa[ra] \r\n self.Fa[ra] = rb \r\ndef solution():\r\n BLOCK = 60\r\n n, m = readis() \r\n edges = [[0,0]] + [readis() for _ in range(m)]\r\n L = UF(n)\r\n mp = {}\r\n for i in range(m+1):\r\n if i: L.union(edges[i])\r\n if i % BLOCK == 0:\r\n mp[(i,m+1)] = UF(n,L) \r\n R = UF(n,L) \r\n for j in range(m,i,-1):\r\n R.union(edges[j])\r\n if j % BLOCK == 0 :\r\n mp[(i,j)] = UF(n,R) \r\n res=[]\r\n for _ in range(readi()):\r\n a,b = readis() \r\n l = (a-1)//BLOCK * BLOCK\r\n r = min(m+1,ceil((b+1)/BLOCK)BLOCK) \r\n uf = UF(n,mp[(l,r)])\r\n for i in range(l+1,a): uf.union(edges[i])\r\n for i in range(r-1,b,-1): uf.union(edges[i])\r\n res.append(uf.Fa[0])\r\n print(res,sep='\\n')\r\nfor i in range( 1 ):\r\n solution() ", "import os,sys,collections,heapq,itertools,functools\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2\r\nimport operator \r\nfrom copy import copy \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass UF:\r\n def __init__(self,n,cp=None):\r\n if cp: self.Fa = cp.Fa[:]\r\n else : self.Fa = [n] + [-1] * n \r\n def getroot(self,i):\r\n root = i \r\n while self.Fa[root] >= 0 :\r\n root =self.Fa[root] \r\n while i != root : \r\n tmp = self.Fa[i]\r\n self.Fa[i] = root \r\n i = tmp \r\n return root \r\n def union(self,a,b):\r\n ra,rb = self.getroot(a),self.getroot(b) \r\n if ra != rb: \r\n self.Fa[0] -= 1 \r\n if self.Fa[ra] < self.Fa[rb] : \r\n ra,rb = rb,ra\r\n self.Fa[rb] += self.Fa[ra] \r\n self.Fa[ra] = rb \r\ndef solution():\r\n n, m = readis() \r\n edges = [[0,0]] + [readis() for _ in range(m)]\r\n L = UF(n)\r\n mp = {}\r\n for i in range(m+1):\r\n if i: L.union(edges[i])\r\n if i % 50 == 0:\r\n mp[(i,m+1)] = UF(n,L) \r\n R = UF(n,L) \r\n for j in range(m,i,-1):\r\n R.union(edges[j])\r\n if j % 50 == 0 :\r\n mp[(i,j)] = UF(n,R) \r\n for _ in range(readi()):\r\n a,b = readis() \r\n l = (a-1)//50 * 50\r\n r = min(m+1,ceil((b+1)/50)50) \r\n uf = UF(n,mp[(l,r)])\r\n for i in range(l+1,a): uf.union(edges[i])\r\n for i in range(r-1,b,-1): uf.union(*edges[i])\r\n print(uf.Fa[0])\r\nfor i in range( 1 ):\r\n solution() " ]	{"inputs": ["6 5\n1 2\n5 4\n2 3\n3 1\n3 6\n6\n1 3\n2 5\n1 5\n5 5\n2 4\n3 3", "2 1\n2 1\n2\n1 1\n1 1", "3 2\n3 2\n3 1\n4\n1 1\n1 2\n2 2\n2 2", "3 3\n2 3\n3 1\n2 1\n5\n2 3\n3 3\n2 2\n2 2\n2 2", "4 5\n1 4\n2 1\n4 3\n2 1\n3 4\n5\n4 5\n2 4\n4 4\n1 3\n4 4", "5 4\n3 2\n5 2\n5 3\n2 3\n8\n4 4\n1 1\n3 4\n1 1\n3 3\n3 4\n3 4\n4 4", "8 10\n8 6\n8 7\n8 3\n3 7\n4 8\n1 6\n5 1\n8 7\n6 8\n1 6\n13\n1 10\n2 6\n3 3\n5 5\n2 2\n1 3\n10 10\n7 7\n2 4\n3 6\n2 7\n9 9\n3 6", "10 10\n7 5\n5 9\n10 9\n8 7\n5 10\n4 2\n8 2\n9 1\n2 8\n10 7\n10\n10 10\n7 9\n2 6\n1 5\n4 7\n9 9\n7 7\n2 6\n6 9\n10 10", "7 14\n7 1\n1 5\n6 4\n7 6\n2 4\n2 4\n7 2\n3 1\n7 6\n6 7\n5 3\n5 4\n1 3\n6 2\n40\n2 3\n14 14\n13 14\n13 13\n7 9\n1 13\n12 14\n14 14\n12 12\n6 10\n6 14\n8 8\n14 14\n9 10\n8 9\n8 11\n9 9\n2 3\n1 11\n13 14\n4 11\n2 9\n1 10\n6 11\n3 3\n4 12\n5 11\n8 8\n7 14\n13 13\n14 14\n14 14\n8 12\n14 14\n8 8\n7 7\n2 11\n10 12\n4 5\n9 10"], "outputs": ["4\n5\n6\n3\n4\n2", "2\n2", "2\n3\n2\n2", "2\n1\n1\n1\n1", "1\n2\n1\n2\n1", "3\n3\n3\n3\n3\n3\n3\n3", "8\n4\n2\n3\n2\n2\n2\n3\n3\n4\n5\n2\n4", "3\n5\n6\n6\n5\n3\n3\n6\n6\n3", "1\n1\n1\n1\n1\n6\n1\n1\n1\n1\n2\n1\n1\n1\n1\n1\n1\n1\n4\n1\n1\n1\n3\n1\n1\n2\n1\n1\n2\n1\n1\n1\n1\n1\n1\n1\n3\n1\n1\n1"]}	UNKNOWN	PYTHON3	CODEFORCES	2
cefd9888a7d526cca46b7a86b3deefbb	Hot Days	The official capital and the cultural capital of Berland are connected by a single road running through n regions. Each region has a unique climate, so the i-th (1<=≤<=i<=≤<=n) region has a stable temperature of ti degrees in summer. This summer a group of m schoolchildren wants to get from the official capital to the cultural capital to visit museums and sights. The trip organizers transport the children between the cities in buses, but sometimes it is very hot. Specifically, if the bus is driving through the i-th region and has k schoolchildren, then the temperature inside the bus is ti<=+<=k degrees. Of course, nobody likes it when the bus is hot. So, when the bus drives through the i-th region, if it has more than Ti degrees inside, each of the schoolchild in the bus demands compensation for the uncomfortable conditions. The compensation is as large as xi rubles and it is charged in each region where the temperature in the bus exceeds the limit. To save money, the organizers of the trip may arbitrarily add or remove extra buses in the beginning of the trip, and between regions (of course, they need at least one bus to pass any region). The organizers can also arbitrarily sort the children into buses, however, each of buses in the i-th region will cost the organizers costi rubles. Please note that sorting children into buses takes no money. Your task is to find the minimum number of rubles, which the organizers will have to spend to transport all schoolchildren. The first input line contains two integers n and m (1<=≤<=n<=≤<=105; 1<=≤<=m<=≤<=106) — the number of regions on the way and the number of schoolchildren in the group, correspondingly. Next n lines contain four integers each: the i-th line contains ti, Ti, xi and costi (1<=≤<=ti,<=Ti,<=xi,<=costi<=≤<=106). The numbers in the lines are separated by single spaces. Print the only integer — the minimum number of roubles the organizers will have to spend to transport all schoolchildren. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier. Sample Input 2 10 30 35 1 100 20 35 10 10 3 100 10 30 1000 1 5 10 1000 3 10 40 1000 100000 Sample Output 120 200065	[ "import sys\n\n\nn, m = map(int, sys.stdin.readline().split())\n\nans = 0\n\nfor _ in range(n):\n ti, Ti, xi, ci = map(int, sys.stdin.readline().split())\n cost = xi * m * (ti + m > Ti) + ci\n if ti < Ti:\n cost2 = ci * ((m - 1) // (Ti - ti) + 1)\n cost = min(cost, cost2)\n \n ans += cost\n\nprint(ans)\n\n \t \t \t\t\t \t\t \t \t \t\t \t", "import math;\n\ns = input()\na = s.find(\" \")\nn = int(s[0:a])\nstudents = int(s[a+1:len(s)])\n\nsum = 0\n\nfor i in range(n):\n s = input()\n a = s.find(\" \")\n temp = int(s[0:a])\n s = s[a+1:len(s)]\n\n a = s.find(\" \")\n maxTemp = int(s[0:a])\n s = s[a+1:len(s)]\n\n a = s.find(\" \")\n studentsCost = int(s[0:a])\n s = s[a+1:len(s)]\n\n busCost = int(s)\n\n if temp + students < maxTemp:\n oneBus = busCost\n else:\n oneBus = busCost + students * studentsCost\n if temp < maxTemp:\n diffTemp = maxTemp - temp\n nBuses = math.ceil(students / diffTemp)\n if nBuses != 0:\n busesCost = nBuses * busCost\n else:\n busesCost = oneBus\n else:\n busesCost = oneBus\n sum += min(oneBus, busesCost)\n\nprint(sum)\n\n\t\t \t\t \t\t\t \t \t\t \t\t \t" ]	{"inputs": ["2 10\n30 35 1 100\n20 35 10 10", "3 100\n10 30 1000 1\n5 10 1000 3\n10 40 1000 100000", "10 1\n8 6 3 4\n9 10 7 7\n1 3 9 5\n10 9 4 2\n1 10 2 10\n1 1 8 5\n5 5 9 2\n5 8 4 3\n4 4 9 7\n5 7 5 10", "5 5\n100 29 49 77\n34 74 41 8\n32 21 24 91\n45 52 16 51\n50 87 90 94", "1 1000000\n4 4 6 2", "20 102\n73 79 75 27\n13 15 62 47\n74 75 85 86\n49 81 23 69\n43 17 45 27\n35 14 90 35\n51 74 35 33\n54 66 46 24\n33 76 49 3\n34 53 25 76\n69 72 76 31\n41 31 8 48\n49 48 85 24\n19 2 59 83\n19 31 51 86\n31 10 45 76\n56 47 79 86\n49 33 15 1\n77 89 26 64\n7 52 76 77"], "outputs": ["120", "200065", "88", "686", "6000002", "59201"]}	UNKNOWN	PYTHON3	CODEFORCES	2
cf1cc557666d64e45d88d252152147db	Restore Graph	Valera had an undirected connected graph without self-loops and multiple edges consisting of n vertices. The graph had an interesting property: there were at most k edges adjacent to each of its vertices. For convenience, we will assume that the graph vertices were indexed by integers from 1 to n. One day Valera counted the shortest distances from one of the graph vertices to all other ones and wrote them out in array d. Thus, element d[i] of the array shows the shortest distance from the vertex Valera chose to vertex number i. Then something irreparable terrible happened. Valera lost the initial graph. However, he still has the array d. Help him restore the lost graph. The first line contains two space-separated integers n and k (1<=≤<=k<=<<=n<=≤<=105). Number n shows the number of vertices in the original graph. Number k shows that at most k edges were adjacent to each vertex in the original graph. The second line contains space-separated integers d[1],<=d[2],<=...,<=d[n] (0<=≤<=d[i]<=<<=n). Number d[i] shows the shortest distance from the vertex Valera chose to the vertex number i. If Valera made a mistake in his notes and the required graph doesn't exist, print in the first line number -1. Otherwise, in the first line print integer m (0<=≤<=m<=≤<=106) — the number of edges in the found graph. In each of the next m lines print two space-separated integers ai and bi (1<=≤<=ai,<=bi<=≤<=n; ai<=≠<=bi), denoting the edge that connects vertices with numbers ai and bi. The graph shouldn't contain self-loops and multiple edges. If there are multiple possible answers, print any of them. Sample Input 3 2 0 1 1 4 2 2 0 1 3 3 1 0 0 0 Sample Output 3 1 2 1 3 3 2 3 1 3 1 4 2 3 -1	[ "import sys\r\nn, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ng = [k] * n\r\nmaxi = max(a)\r\nans = []\r\nif a.count(0) != 1:\r\n print(-1)\r\n sys.exit()\r\ni = 1\r\nf = a.index(0)\r\nres = [f]\r\nx = [[] for y in range(maxi + 1)]\r\nfor v in range(n):\r\n x[a[v]].append(v)\r\nwhile i <= maxi:\r\n t = x[i]\r\n w = len(t)\r\n z = 0\r\n for o in res:\r\n z += g[o]\r\n if z < w:\r\n print(-1)\r\n sys.exit()\r\n u = 0\r\n for l in res:\r\n while w > 0 and g[l] > 0:\r\n g[l] -= 1\r\n g[t[u]] -= 1\r\n w -= 1\r\n ans.append([l, t[u]])\r\n u += 1\r\n res = t\r\n i += 1\r\nprint(len(ans))\r\nfor row in ans:\r\n print(row[0] + 1, row[1] + 1)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nr=[[d[i],i] for i in range(n)]\r\nr.sort()\r\nif r[0][0]!=0 or r[1][0]==0:\r\n print(-1)\r\n exit()\r\nv=[[] for i in range(n+1)]\r\ncnt=[0]n\r\nv[0].append(r[0][1])\r\nedges=[]\r\nfor rank,ver in r[1:]:\r\n if len(v[rank-1])==0:\r\n print(-1)\r\n exit()\r\n edges.append([v[rank-1][-1]+1,ver+1])\r\n v[rank].append(ver)\r\n cnt[v[rank-1][-1]]+=1\r\n cnt[ver]+=1\r\n if cnt[v[rank-1][-1]]==k:\r\n v[rank-1].pop()\r\n if cnt[ver]==k:\r\n v[rank].pop()\r\nprint(len(edges))\r\nfor x in edges:\r\n print(x)", "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\nimport bisect\r\n# input = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(108)\r\n# sys.setrecursionlimit(106)\r\n\r\n\r\ndef main():\r\n n, k = rl()\r\n d = rl()\r\n d = list(zip(d, range(1, n+1)))\r\n d.sort()\r\n if d[0][0] != 0:\r\n print(-1)\r\n else:\r\n u = 0\r\n pos = True\r\n res = []\r\n c = Counter()\r\n\r\n for v in range(1, n):\r\n if c[d[u][1]] >= k:\r\n u += 1\r\n while u < v and d[v][0] != d[u][0]+1:\r\n u += 1\r\n\r\n if u == v or c[d[u][1]] >= k or c[d[v][1]] >= k:\r\n print(-1)\r\n pos = False\r\n break\r\n res.append((d[u][1], d[v][1]))\r\n c[d[u][1]] += 1\r\n c[d[v][1]] += 1\r\n if pos:\r\n print(len(res))\r\n for i in res:\r\n print(i)\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "n,k=map(int,input().split())\r\nd=zip( list(map(int,input().split())),range(0,n) )\r\nd=sorted(d)\r\n\r\nlast=0\r\ndu=[0]n\r\nfa=[0]n\r\nflag=1\r\nfor j in range(1,n):\r\n while last<j and ( du[last]==k or d[last][0]+1!=d[j][0] ):\r\n last+=1\r\n if last==j or d[0][0]!=0:\r\n print(-1)\r\n break\r\n fa[j]=last\r\n du[j]+=1\r\n du[last]+=1\r\nelse:\r\n print(n-1)\r\n for j in range(1,n):\r\n print(d[fa[j]][1]+1,d[j][1]+1)", "from sys import stdin\nfrom heapq import heappush, heappop\nfrom collections import deque\n\ndef r(): return stdin.readline().strip()\ndef r_t(tp): return map(tp, r().strip().split())\ndef r_l(tp): return list(r_t(tp))\n\ndef solve(n,k,d):\n s, E, deg = -1, [], [0 for _ in range(n)]\n for i in range(n):\n if d[i]==0 and s==-1: s=i\n elif d[i]==0: return [-1]\n if s==-1: return [-1]\n\n next = []\n for u in range(n):\n if u!=s: heappush(next,(d[u],u))\n f = [deque([]) for _ in range(n)]\n f[0].appendleft(s)\n\n while next:\n dist, u = heappop(next)\n #print(u,dist, f, deg)\n if not f[dist-1]: return [-1]\n v = f[dist-1].pop()\n #print(v)\n deg[v]+=1; deg[u]+=1\n if deg[v]<k: f[dist-1].appendleft(v)\n if deg[u]<k: f[dist].appendleft(u)\n E.append((u,v))\n\n return E\n\n\ndef main():\n n, k = r_t(int)\n d = r_l(int)\n ans = solve(n, k, d)\n if ans==[-1]: print(-1)\n else:\n print(len(ans))\n for u,v in ans: print(u+1,v+1)\n\nmain()\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nnodes=[[] for i in range(n)]\r\nfor i in range(n):\r\n nodes[arr[i]].append([i+1,0])\r\nedges=[]\r\ny=1\r\nmx=0\r\nfor i in range(1,max(arr)+1):\r\n if(len(nodes[i-1])==0 or len(nodes[i])==0):\r\n y=0\r\n break\r\n else:\r\n nd=nodes[i-1]\r\n nd2=nodes[i]\r\n for j in range(len(nd2)):\r\n nodes[i-1][j%len(nd)][1]+=1\r\n nodes[i][j][1]+=1\r\n mx=max(mx,nodes[i-1][j%len(nd)][1],nodes[i][j][1])\r\n edges.append((nodes[i-1][j%len(nd)][0],nodes[i][j][0]))\r\nif(not y or arr.count(0)>1 or mx>k):\r\n print(-1)\r\nelse:\r\n print(len(edges))\r\n for i in edges:\r\n print(i)\r\n \r\n", "def solve(n,k,d):\r\n\tdist = [[] for i in range(n)]\r\n\tfor u in range(n):\r\n\t\tdist[d[u]].append(u)\r\n\tif len(dist[0])!=1:\r\n\t\treturn []\r\n\r\n\tans = []\r\n\tfor t in range(1,n):\r\n\t\tnxt = []\r\n\t\tj = 0\r\n\t\tlim = k if t==1 else (k-1)\r\n\t\tctr = 0\r\n\t\tfor u in dist[t]:\r\n\t\t\tif ctr==lim:\r\n\t\t\t\tctr = 0\r\n\t\t\t\tj += 1\r\n\t\t\tif j==len(dist[t-1]):\r\n\t\t\t\treturn []\r\n\t\t\telse:\r\n\t\t\t\tans.append((dist[t-1][j]+1,u+1))\r\n\t\t\t\tctr += 1\r\n\treturn ans\r\n\r\nn, k = map(int,input().split())\r\nd = [int(x) for x in input().split()]\r\nans = solve(n,k,d)\r\nif ans==[]:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(ans))\r\n\tfor e in ans:\r\n\t\tprint(*e)\r\n" ]	{"inputs": ["3 2\n0 1 1", "4 2\n2 0 1 3", "3 1\n0 0 0", "5 3\n0 2 1 2 1", "7 3\n2 2 0 1 3 2 1", "9 4\n2 1 1 3 1 2 2 1 0", "3 1\n0 1 2", "2 1\n1 0", "2 1\n1 1", "2 1\n0 0", "4 2\n0 1 0 1", "5 3\n3 1 4 2 1", "5 4\n1 2 2 2 3", "4 3\n1 1 1 2", "4 3\n1 2 2 3", "4 3\n1 2 3 3", "7 6\n1 1 2 2 3 3 3", "10 5\n0 1 1 1 1 1 1 2 2 2", "5 4\n0 1 1 1 4"], "outputs": ["2\n1 2\n1 3", "3\n1 3\n1 4\n2 3", "-1", "4\n1 3\n1 5\n2 5\n4 5", "6\n1 7\n2 7\n3 4\n3 7\n4 6\n5 6", "8\n1 8\n2 9\n3 9\n4 7\n5 9\n6 8\n7 8\n8 9", "-1", "1\n1 2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	7
cf438485b6500f7040d2da54b017d318	The Queue	Finally! Vasya have come of age and that means he can finally get a passport! To do it, he needs to visit the passport office, but it's not that simple. There's only one receptionist at the passport office and people can queue up long before it actually opens. Vasya wants to visit the passport office tomorrow. He knows that the receptionist starts working after ts minutes have passed after midnight and closes after tf minutes have passed after midnight (so that (tf<=-<=1) is the last minute when the receptionist is still working). The receptionist spends exactly t minutes on each person in the queue. If the receptionist would stop working within t minutes, he stops serving visitors (other than the one he already serves). Vasya also knows that exactly n visitors would come tomorrow. For each visitor Vasya knows the point of time when he would come to the passport office. Each visitor queues up and doesn't leave until he was served. If the receptionist is free when a visitor comes (in particular, if the previous visitor was just served and the queue is empty), the receptionist begins to serve the newcomer immediately. For each visitor, the point of time when he would come to the passport office is positive. Vasya can come to the office at the time zero (that is, at midnight) if he needs so, but he can come to the office only at integer points of time. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and stand in the queue after the last of them. Vasya wants to come at such point of time that he will be served by the receptionist, and he would spend the minimum possible time in the queue. Help him! The first line contains three integers: the point of time when the receptionist begins to work ts, the point of time when the receptionist stops working tf and the time the receptionist spends on each visitor t. The second line contains one integer n — the amount of visitors (0<=≤<=n<=≤<=100<=000). The third line contains positive integers in non-decreasing order — the points of time when the visitors arrive to the passport office. All times are set in minutes and do not exceed 1012; it is guaranteed that ts<=<<=tf. It is also guaranteed that Vasya can arrive at the passport office at such a point of time that he would be served by the receptionist. Print single non-negative integer — the point of time when Vasya should arrive at the passport office. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and queues up the last. If there are many answers, you can print any of them. Sample Input 10 15 2 2 10 13 8 17 3 4 3 4 5 8 Sample Output 122	[ "begin, end, time = list(map(int, input().split()))\r\nn = int(input())\r\nif n == 1:\r\n print(begin)\r\nelif n > 0:\r\n ar = list(map(int, input().split()))\r\n ar.sort()\r\n i = 0\r\n ar.append(end - time + 1)\r\n n += 1\r\n\r\n num = begin\r\n ans = begin - ar[0] + 1\r\n fin_ans = ar[0] - 1\r\n while i < n:\r\n num = max(num + time, ar[i] + time)\r\n while i + 1 < n and ar[i + 1] == ar[i]:\r\n i += 1\r\n num += time\r\n i += 1\r\n if i < n and num - ar[i] + 1 < ans and max(ar[i] - 1, num) + time <= end:\r\n ans = num - ar[i] + 1\r\n fin_ans = ar[i] - 1\r\n\r\n print(fin_ans)\r\n\r\nelse:\r\n print(begin)\r\n", "def solve():\n s = [int(x) for x in input().split()]\n ts, tf, t = s[0], s[1], s[2]\n n = int(input())\n\n if n == 0:\n return ts\n\n v = [int(x) for x in input().split()]\n v0 = v[0]\n\n if v0 > ts:\n return ts \n \n ans, ansv = 1e15, 1e15\n now = ts\n\n for i in range(len(v)):\n if max(0, now-v[i]+1) < ansv and v[i]-1+t <= tf:\n ansv = max(0, now - v[i] + 1)\n ans = v[i] - 1\n now = max(now, v[i]) + t\n if now+t <= tf:\n return now\n else:\n return ans\n\ndef main():\n output = solve()\n print(output)\n\nmain()\n\n#\n \t\t \t \t\t\t \t\t \t \t \t \t \t \t \t\t\t", "f = lambda: map(int, input().split())\r\na, b, t = f()\r\nk, = f()\r\ns = d = 1e12\r\nfor q in (f() if k else []):\r\n if q > a: s = a\r\n if q > a or a + t > b: break\r\n elif a - q < d: s, d = q - 1, a - q\r\n a += t\r\nprint(s if a + t > b else a)", "ts, tf, t = map(int, input().split())\r\nN=int(input())\r\nif N == 0:\r\n print(ts)\r\nelse:\r\n ba = list(map(int, input().split()))\r\n ends = ts\r\n mi = 10**12\r\n mis = 0\r\n \r\n if ba[0] > 0:\r\n mi = ts - ba[0] + 1\r\n mis = ba[0] - 1\r\n for i in range(N):\r\n if ba[i] <= ends:\r\n ends += t\r\n if i == N - 1:\r\n continue\r\n if ba[i] == ba[i + 1]:\r\n continue\r\n \r\n if ends + t <= tf and ends - (ba[i + 1] - 1) < mi:\r\n mi = ends - (ba[i + 1] - 1)\r\n mis = ba[i + 1] - 1\r\n if ends + t <= tf:\r\n print(ends)\r\n else:\r\n print(mis)# 1698314251.2987468" ]	{"inputs": ["10 15 2\n2\n10 13", "8 17 3\n4\n3 4 5 8", "7 14 3\n2\n1 2", "30 70 10\n3\n30 32 35", "21 56 7\n5\n1 2 3 4 5", "10 1000000000 25\n20\n1 1 5 7 8 10 12 22 44 47 73 77 82 83 89 141 142 168 195 199", "30 60 3\n10\n1 5 6 10 12 13 18 23 24 25", "61 1000000000 13\n55\n29 72 85 94 103 123 125 144 147 153 154 184 189 192 212 234 247 265 292 296 299 304 309 365 378 379 393 401 414 417 421 427 439 441 480 500 509 515 522 539 571 582 623 630 634 635 643 649 654 679 680 686 747 748 775", "117 120 3\n0", "37 3813 32\n117\n1 1 4 5 6 8 10 13 13 16 18 19 20 23 30 32 33 38 49 59 66 69 96 157 160 183 205 292 301 320 349 360 370 372 384 400 410 413 423 434 434 445 451 463 464 490 494 496 497 517 528 532 556 572 607 647 668 689 708 729 748 806 819 879 905 905 915 925 928 931 959 970 1133 1146 1150 1156 1172 1189 1193 1218 1228 1233 1247 1297 1383 1447 1468 1512 1539 1550 1634 1635 1702 1836 1845 1866 1880 2068 2082 2143 2146 2167 2234 2239 2277 2331 2351 2432 2478 2592 2684 2863 2885 3043 3141 3258 3426", "100000000000 200000000000 10000000000\n10\n1 1 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000", "1 2 1\n0", "50 230 10\n20\n50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240", "100000000000 100000000005 2\n0", "333 500 5\n1\n3000"], "outputs": ["12", "2", "0", "60", "0", "510", "4", "360", "117", "3781", "109999999999", "1", "49", "100000000000", "333"]}	UNKNOWN	PYTHON3	CODEFORCES	4
cf4da4092ec76b45e3e4ddde8e8a0056	Infinite Sequence	Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1<==<=a), and the difference between any two neighbouring elements is equal to c (si<=-<=si<=-<=1<==<=c). In particular, Vasya wonders if his favourite integer b appears in this sequence, that is, there exists a positive integer i, such that si<==<=b. Of course, you are the person he asks for a help. The first line of the input contain three integers a, b and c (<=-<=109<=≤<=a,<=b,<=c<=≤<=109) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively. If b appears in the sequence s print "YES" (without quotes), otherwise print "NO" (without quotes). Sample Input 1 7 3 10 10 0 1 -4 5 0 60 50 Sample Output YES YES NO NO	[ "a, b, c = map(int, input().split())\r\nd = b - a\r\nif a == b:\r\n print(\"YES\")\r\nelif d > 0 and c > 0 and float(d / c).is_integer():\r\n print(\"YES\")\r\nelif d < 0 and c < 0 and float(d / c).is_integer():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int, input().split())\r\nif(c==0 and a==b):\r\n print('YES')\r\nelif(c==0):\r\n print('NO')\r\nelif((b-a)%c==0 and (b-a)//c>=0):\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c = map(int, input().rstrip().split(\" \"))\r\nif b < a and c > 0:\r\n print(\"NO\")\r\nelif c==0:\r\n if b!=a:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif b > a and c < 0:\r\n print(\"NO\")\r\nelse:\r\n if (b - a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a, b, c = map(int,input().split())\r\nif (a == b) or (c != 0 and ((b >= a and c > 0) or (b <= a and c < 0)) and (b - a) % c == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nif c==0 and a==b:\r\n print(\"yes\")\r\nelif c!=0 and ((b-a)/c)==int((b-a)/c) and ((b-a)/c)>=0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "a, b, c = [int(i) for i in input().split()]\r\nif b == a:\r\n print ('YES')\r\nelse:\r\n if c == 0:\r\n print ('NO')\r\n else:\r\n if c > 0 and a > b:\r\n print ('NO')\r\n elif c < 0 and a < b:\r\n print ('NO')\r\n else:\r\n if abs (a - b)%c == 0:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\n", "a,b,c = map(int,input().split())\r\nd = []\r\nif b < a and c >= 0:\r\n print(\"NO\")\r\nelif a < b and c <= 0:\r\n print(\"NO\")\r\nelif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif abs(a-b) % c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A = input().split()\r\nfor i in range(len(A)):\r\n A[i] = int(A[i])\r\na,b,c = A\r\n\r\nif c==0:\r\n if a == b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nelse:\r\n d = (b-a)//c\r\n ost = (b-a)/c-(b-a)//c\r\n if ost == 0:\r\n if d>=0:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\n else:\r\n print ('NO')", "from math import\r\n\r\na,b,c=map(int,input().split())\r\nsex=a\r\nfuck=b\r\nsuck=c\r\n\r\nif(suck==0 and sex==fuck):\r\n print(\"YES\")\r\nelif(suck==0 and sex!=fuck):\r\n print(\"NO\")\r\nelif((fuck-sex)%suck==0 and (fuck-sex)/suck>=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a, b, c = list(map(int, input().split()))\r\n\r\nif a == b:\r\n print(\"YES\")\r\nelif c == 0 and a != b:\r\n print(\"NO\")\r\nelse:\r\n sovpad = (b - a) % c\r\n sovpad_div = (b - a) / c\r\n if sovpad == 0 and sovpad_div > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\na,s,d = input().split()\na=int(a)\ns=int(s)\nd = int(d)\ndef check(a,s,d):\n\tif(d!=0):\n\t\tn = ((s-a)/d) + 1\n\t\tj = n%1\n\t\tif(j==0.0):\n\t\t\tif(n>0):\n\t\t\t\treturn \"YES\"\n\tif(d==0):\n\t\tif(a==s):\n\t\t\treturn \"YES\"\n\treturn \"NO\"\nprint(check(a,s,d))", "a, b, c = map(int, input().split(' '))\r\nif c == 0:\r\n print('YES' if a == b else 'NO')\r\nelse:\r\n kth = (b - a) // c if (b - a) % c == 0 else -1\r\n print('YES' if kth >= 0 else 'NO')\r\n", "a, b, c = map(int, input().split())\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a==b:\r\n print('YES')\r\nelif (c<0 and b-a>0)or (c>0 and b-a<0) or (b-a)%c != 0:\r\n print('NO')\r\nelif (b-a)%c == 0 :\r\n print('YES')\r\n", "s= input(\"\").split(' ')\na=int(s[0])\nb= int(s[1])\nc= int(s[2])\ncounter=0\nif c==0 and b==a:\n\tprint(\"YES\")\nelif c==0 and b!=a:\n\tprint(\"NO\")\nelse:\n\tmax1=(b-a)/c\n\tmax2= int (max1)\n\tif max1<0:\n\t\tprint(\"NO\")\n\telif max2==max1:\t\n\t\tprint (\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n", "'''input\n0 60 50\n'''\na, b, c = map(int, input().split())\nif a == b:\n\tprint(\"YES\")\nelif c == 0:\n\tprint(\"NO\")\nelif (b-a) % c == 0 and b > a and c > 0:\n\tprint(\"YES\")\nelif (b-a) % c == 0 and a > b and c < 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "a=list(map(int,input().split()))\r\na1=a[0]\r\nd=a[-1]\r\nreq=a[1]\r\nif d==0:\r\n if a1==req:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if (req-a1)%d==0:\r\n k=(req-a1)//d\r\n if k+1>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "p,q,r = map(int,input().split())\r\nif r>0:\r\n if (p>q):\r\n print(\"NO\")\r\n exit(0)\r\nelif r==0:\r\n if (p!=q):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n exit(0)\r\nelif (q>p):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nif not (q-p)%r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a,b,c = map(int,input().split())\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif int((b-a)/c+1)==(b-a)/c+1 and (b-a)/c+1>=1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c=map(int,input().split())\r\nif c==0:print([\"NO\",\"YES\"][a==b])\r\nelif c>0:\r\n\tif b<a:print(\"NO\")\r\n\telse:print([\"NO\",\"YES\"][(b-a)%c==0])\r\nelse:\r\n\tif b>a:print(\"NO\")\r\n\telse:print([\"NO\",\"YES\"][(b-a)%c==0])", "a,b,c = map(int,input().split())\r\ndef ispos():\r\n\tpos = 0\r\n\tif a==b :\r\n\t\treturn 1\r\n\tif c==0 :\r\n\t\treturn 0\r\n\tif a<b and c<0:\r\n\t\treturn 0\r\n\tif a>b and c>0:\r\n\t\treturn 0\r\n\tif (b-a)%c == 0:\r\n\t\treturn 1\r\n\telse : return 0\r\nans = \"YES\" if ispos() == 1 else \"NO\"\r\nprint(ans)\r\n\t", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print('YES')\r\nelse:\r\n if c==0:\r\n print('NO')\r\n else:\r\n n=(b-a)/c\r\n if int(n)==n and n>=0:\r\n print('YES')\r\n else:\r\n print('NO')", "a, b, c = map(int, input().split())\r\nif (c == 0 and a == b):\r\n\tprint(\"YES\")\r\n\texit(0)\r\nelif(c == 0 and a != b):\r\n\tprint(\"NO\")\r\n\texit(0)\r\nb -= a\r\nif (b % c == 0 and b // c >= 0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b,c=map(int,input().split())\r\nif b<a and c>=0:\r\n print(\"NO\")\r\nelif a<b and c<=0:\r\n print(\"NO\")\r\nelif c==0:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif abs(a-b)%c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = list(map(int,input().split()))\r\nif c==0:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif (b-a)%c==0 and (b-a)//c >= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=[int(x) for x in input().split()]\r\n\r\nif (c!=0 and (b-a)/c>=0 and (b-a)%c==0) or (c==0 and a==b):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\ndef solve():\n a,b,c = map(int, input().split())\n if c==0:\n if a==b:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n lo=1\n hi=1018 + 10\n while lo<=hi:\n mid = (lo+hi)//2\n amid = a+(mid-1)c\n if amid==b:\n print(\"YES\")\n return\n if c>0:\n if amid>b:\n hi=mid-1\n else:\n lo=mid+1\n else:\n if amid>b:\n lo=mid+1\n else:\n hi=mid-1\n print(\"NO\")\n\nsolve()\n\n\t\t \t\t\t \t\t \t\t\t\t \t \t\t \t", "a , b , c = map(int,input().split())\r\nif c > 0:\r\n if (b - a) % c == 0 and b >= a:\r\n print('YES')\r\n exit(0)\r\nif c < 0:\r\n if (b - a) % c == 0 and b <= a:\r\n print('YES')\r\n exit(0) \r\nif c == 0:\r\n if a == b:\r\n print('YES')\r\n exit(0)\r\n \r\nprint('NO')", "s=input()\r\ns=s.split()\r\ns=list(map(int,s))\r\na=s[1]-s[0]\r\nb=s[2]\r\nif ab>0:\r\n if a%b==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif ab<0:\r\n print('NO')\r\nelse:\r\n if a==0:\r\n print('YES')\r\n else:\r\n print('NO')", "print(''.join([\"YES\" if (c == 0 and a == b) or (c != 0 and (b - a) % c == 0 and (b - a) // c >= 0) else \"NO\" for a, b, c in [map(int, input().split())]]))\r\n", "a, an, d = [int(j) for j in input().split()]\r\nif d == 0:\r\n if a == an:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = ((an - a) / d) + 1\r\n if n > 0 and int(n) == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a,b,c=map(int, input().split())\r\nprint(\"YES\" if (c==0 and a==b) or (c!=0 and (b-a)%c==0 and (b-a)/c>=0) else \"NO\")", "a,b,c = map(int,input().split())\r\nif c == 0: print(\"NO\") if a != b else print(\"YES\")\r\nelse:\r\n\tprint(\"YES\") if (b-a)//c >= 0 and (b-a)%c == 0 else print(\"NO\")", "a,b,c=map(int, input().split())\r\nb-=a\r\nif c == 0:\r\n if b==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse: \r\n if b * c < 0:\r\n print(\"NO\")\r\n else:\r\n if b % c == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a,c,d=map(int,input().split())\nif d!=0:\n n=((c-a)/d)+1\n if int(n)==n and n>0:\n print('YES')\n else:\n print('NO')\nelse:\n if a==c:\n print('YES')\n else:\n print('NO')\n", "# print(-5//5)\r\na,b,c=map(int,input().split(' '))\r\nif( a<b and c<0) or (b<a and c>0):\r\n print('NO')\r\n quit()\r\n\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else :\r\n print('NO')\r\n quit()\r\nd=(b-a)//c\r\n# print(d)\r\nif dc+a==b:\r\n print(\"YES\")\r\nelse :\r\n print('NO')\r\n", "import sys\nstart, value, increment = map(int, sys.stdin.readline().strip().split())\n\nif start == value:\n print (\"YES\")\n exit()\n\nif value > start and increment > 0 and value%increment == start%increment:\n print (\"YES\")\n exit()\n\nif value < start and increment < 0 and value%increment == start% increment:\n print (\"YES\")\n exit()\n\nprint(\"NO\")\n# 1488583572329\n", "a, b, c = [int(i) for i in input().split()]\r\n\r\nif (c == 0):\r\n if (a == b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif ((b - a) % c == 0):\r\n if ((b - a) / c >= 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a, b, c = [int(x) for x in input().split(' ')]\r\nans = 'NO'\r\nif c == 0:\r\n if a == b:\r\n ans = 'YES'\r\nelif c > 0:\r\n if b >= a and b % c == a % c:\r\n ans = 'YES'\r\nelse:\r\n if b <= a and b % c == a % c:\r\n ans = 'YES'\r\nprint(ans)\r\n", "[a, b, c] = [int(x) for x in input().split()]\r\n\r\ndef runcodeifcpositive():\r\n if c==0:\r\n print(\"YES\") if a==b else print(\"NO\")\r\n elif b<a:\r\n print(\"NO\")\r\n elif a<0:\r\n x = a+a(-1)\r\n y = b+a(-1)\r\n if y%c == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n elif a>=0:\r\n if (b-a)%c == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\ndef runcodeifcnegative():\r\n [x, y, z] = [a-1, b-1, c-1]\r\n if c==0:\r\n print(\"YES\") if x==y else print(\"NO\")\r\n elif y<x:\r\n print(\"NO\")\r\n elif x<0:\r\n e = x+x(-1)\r\n f = y+x(-1)\r\n if f%z == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n elif x>=0:\r\n if (y-x)%z == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\nif c>=0: runcodeifcpositive()\r\nelse:\r\n runcodeifcnegative()\r\n", "def infinite(a,b,c):\r\n if c==0 and (b-a)==0:\r\n return(\"YES\")\r\n elif (b-a)!=0 and c==0:\r\n return(\"NO\")\r\n if (b-a)<0 and c>=0:\r\n return(\"NO\")\r\n elif b-a>0 and c<0:\r\n return(\"NO\")\r\n if (b-a)%c==0:\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\na,b,c = input().strip().split()\r\nprint(infinite(int(a),int(b),int(c)))", "tres = map(int,input().split())\n\na = next(tres)\nb = next(tres)\nc = next(tres)\n\n# casos c igual a 0\nif (c == 0 and a == b): print(\"YES\")\nelif (c == 0 and a != b): print(\"NO\")\n\n# casos no es posible llegar a b\nelif (a > b and c > 0): print(\"NO\")\nelif (a < b and c < 0): print(\"NO\")\n\n# casos no se llega al numero b deseado\nelif (b%c == a%c): print(\"YES\")\nelse: print(\"NO\")\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\na, b, c = map(int, input().split())\r\n\r\nif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if b > a and c < 0 or a > b and c > 0:\r\n print(\"NO\")\r\n elif a% c == b%c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input().split()\r\na,b,c = a\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\n \r\nif not c:\r\n if a==b:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\nelif b%c == a%c and ((b >= a and c > 0) or (b <= a and c < 0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, find, c = map(int, input().split())\r\n\r\nif c == 0:\r\n if a == find:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if (find - a) % c == 0 and (find - a) // c >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[a, b, c] = list(map(int, input().split()))\r\nd = b-a\r\nif a == b:\r\n print(\"YES\")\r\n exit(0)\r\nif (d > 0 and c <= 0) or (d < 0 and c >= 0):\r\n print(\"NO\")\r\n exit(0)\r\nd = abs(d)\r\nc = abs(c)\r\nif d%c != 0:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "a,b,c = map(int, input().split())\r\nif c != 0:\r\n k = (b - a)/c\r\n if int(k) == k and k >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES' if a == b else 'NO')", "import sys\r\na,b,c=map(int,sys.stdin.readline().split())\r\nif (a>b and c>0) or(a<b and c<0):\r\n print(\"NO\")\r\nelse:\r\n if a==b:\r\n print(\"YES\")\r\n elif c!=0 and(b-a)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a,b,c=map(int,input().split()) \r\nif c<0:\r\n if a<b:\r\n print(\"NO\")\r\n else:\r\n if abs(b-a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif c>0:\r\n if a>b:\r\n print(\"NO\")\r\n else:\r\n if abs(b-a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if a!=b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "def main():\r\n\ta, b, c = map(int, input().split())\r\n\r\n\tif b == a:\r\n\t\tprint(\"YES\")\r\n\t\texit(0)\r\n\r\n\tif (b>a and c<=0) or (b<a and c>=0):\r\n\t\tprint('NO')\r\n\t\texit(0)\r\n\r\n\tdiff = abs(a - b)\r\n\tif diff % abs(c) == 0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a,b,c=map(int,input().split())\r\nif c>0:\r\n if b>=a and (b-a)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif c<0:\r\n if b<=a and(a-b)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif c==0:\r\n if a!=b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "a,b,c = map(int,input().split(' '))\r\nif a==b or (c!=0 and (b-a)//c>=0 and (b-a)%c==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/python3\na,b,c = [int(x) for x in input().split()]\nflag = 1\nif (b > a and c < 0):\n\tprint(\"NO\")\nelif (b < a and c > 0):\n\tprint(\"NO\")\nelse :\n\tif (not(c == 0) and (b-a)%c == 0):\n\t\tprint(\"YES\")\n\telif (c == 0 and b == a):\n\t\tprint(\"YES\")\n\telse :\n\t \tprint(\"NO\")\n", "def solve(a, b, c):\n\tif a == b:\n\t\treturn \"YES\"\n\tif c == 0:\n\t\treturn \"NO\"\n\tk = (b - a) // c\n\tif k < 0:\n\t\treturn \"NO\"\n\tif a + k * c != b:\n\t\treturn \"NO\"\n\treturn \"YES\"\n\na, b, c = map(int, input().split())\n\nprint(solve(a, b, c))\n", "def main():\n\ta,b,c = input().split()\n\ta,b,c = int(a),int(b),int(c)\n\tif b - a >= 0 and c > 0:\n\t\tb -= a\n\t\tif b % c == 0:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif b - a <= 0 and c < 0:\n\t\tb = a - b\n\t\tc -= 2 * c\n\t\tif b % c == 0:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif c == 0:\n\t\tif a == b:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif (b - a <= 0 and c > 0) or (b - a >= 0 and c < 0):\n\t\tprint(\"NO\")\nif __name__ == '__main__':\n\tmain()", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nif not c:\r\n ans = \"YES\" if a == b else \"NO\"\r\nelse:\r\n if c < 0:\r\n a, b = b, a\r\n c = -1\r\n ans = \"YES\" if not (a - b) % c and a <= b else \"NO\"\r\nprint(ans)", "lis=input().split()\na=int(lis[0])\nb=int(lis[1])\nc=int(lis[2])\nif(b-a<0):\n\tif(c<0):\n\t\td=-(b-a)\n\t\tdc=-c\n\t\tif(d%dc==0):\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\telse:\n\t\tprint ('NO')\t\t\t\nelif(b==a):\n\tprint('YES')\nelse:\n\tif(c>0):\n\t\tif((b-a)%c==0):\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\telse:\n\t\tprint('NO')\n\t\n", "def main():\n a, b, c = (int(x) for x in input().strip().split(\" \"))\n\n if(b < a and c > 0):\n print(\"NO\")\n return\n \n if(b > a and c < 0):\n print(\"NO\")\n return\n\n if(c == 0):\n if(a == b):\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n if((b-a) % c == 0):\n print(\"YES\")\n return\n \n print(\"NO\")\n\nmain()", "l=list(map(int,input().split()))\r\na,b,c=l[0],l[1],l[2]\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if c>0:\r\n if b>=a and (b-a)%c==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n c=-1\r\n if b<=a and (a-b)%c==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "a, b, c = map(int, input().split(\" \"))\r\nif c != 0:\r\n k = (b - a) / c\r\n if k < 0 or k != int(k):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif a == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int,input().split())\r\n\r\nif c == 0:\r\n if a == b :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse:\r\n pos = (b - a) / c\r\n\r\n if pos.is_integer() and pos >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n", "a,b,c=(int(i) for i in input().split())\r\nif(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(c>0 and b<a):\r\n print(\"NO\")\r\nelif(c<0 and b>a):\r\n print(\"NO\")\r\nelse:\r\n n=((b-a)/c)+1\r\n if(n==int(n)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nfor _ in range(1):\r\n a,b,c=map(int,input().split())\r\n \r\n if (c != 0 and (b - a) % c == 0 and (b - a)c >= 0) or (c == 0 and a == b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n \r\n ", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nfor _ in range(1):\r\n a,b,c=M()\r\n if c==0 or a==b:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if a>b:\r\n if d%c==0 and c<0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if d%c==0 and c>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n", "a,b,c=map(int,input().split())\r\nif(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n f=(b-a)/c\r\n if(f-int(f)>0 or f<0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a,s,d = map(int,input().split())\r\ndef check(a,s,d):\r\n if(d!=0):\r\n n = ((s-a)/d+1)\r\n j = n%1\r\n if(j==0.0):\r\n if(n>0):\r\n return (\"YES\")\r\n if(d==0):\r\n if(a==s):\r\n return (\"YES\")\r\n return \"NO\"\r\nprint(check(a,s,d))", "(a,b,c) = list(int(x) for x in input().split())\r\nif c>0 and b>=a:\r\n if (b-a)%c==0:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\nelif c<0 and b<=a:\r\n if (a-b)%abs(c)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif c==0 and a==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\nfrom operator import mul\r\nfrom functools import reduce\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\n########### ----- MAIN FUNCTION ---- ##########\r\ndef main():\r\n\ta,b,c = invr()\r\n\tx = b-a\r\n\tif c==0:\r\n\t\tif a==b:\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn \r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn \r\n\tif x%c==0 and x//c>=0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n\r\n", "a,b,c=map(int,input().split())\r\nif c==0: print(\"YES\") if a==b else print(\"NO\")\r\nelse :print(\"YES\") if ((b-a)%c==0) and ((b>=a and c>=0) or (b<=a and c<=0)) else print(\"NO\")", "from re import \nfrom sys import stderr\ndef readint():\n return int(input())\ndef readfloat():\n return float(input())\ndef readarray(N, foo=input):\n return [foo() for i in range(N)]\ndef readlinearray(foo=int):\n return map(foo, input().split())\n\ndef NOD(a, b):\n while b:\n a,b = b, a%b\n return a\n\ndef gen_primes(max):\n primes = [1](max+1)\n for i in range(2, max+1):\n if primes[i]:\n for j in range(i+i, max+1, i):\n primes[j] = 0\n primes[0] = 0\n return [x for x in range(max+1) if primes[x]]\n\ndef is_prime(N):\n i = 3\n if not(N % 2):\n return 0\n while ii < N:\n if not(N % i):\n return 0\n i += 3\n return 1\n\na, b, c = readlinearray()\nb -= a\n\nif b == 0 or (c != 0 and c * b > 0 and b % c == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a, b, c = map(int, input().split(' '))\r\nif ((a != b and c == 0) or (b > a and c < 0)):\r\n print(\"NO\")\r\nelif ((a == b) or (b > a and c > 0 and ((b - a) % c == 0)) or (a > b and c < 0 and ((a - b) % c == 0))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ninput1 = [int(elem) for elem in sys.stdin.readline().strip().split()]\n\nif input1[1] == input1[0]:\n print (\"YES\") \n \nelif input1[1] > input1[0] and input1[2] > 0 and input1[1]%input1[2] == input1[0]%input1[2]:\n print (\"YES\")\n \nelif input1[1] < input1[0] and input1[2] < 0 and input1[1]%input1[2] == input1[0]%input1[2]:\n print (\"YES\")\n\nelse:\n print(\"NO\")\n# 1488583300073\n", "\r\nimport sys\r\n# مگو\r\nInput = sys.stdin.readline\r\n# N = int(Input())\r\n# منی\r\na, b, c = map(int, Input().split()) # نگهت\r\nif a is b:\r\n# ترین\r\n exit(print('YES'))\r\n# تو دل\r\nz = (b-a)\r\nif z * c > 0 and z % c == 0:\r\n exit(print('YES'))\r\nprint('NO')\r\n# راز\r\n# میدارم\r\n", "a, b, c = map(int, input().split())\r\nba = b - a\r\ntry:\r\n print(('NO', 'YES')[ba % c == 0 and ba // c >= 0])\r\nexcept:\r\n print(('YES', 'NO')[b != a])\r\n", "a,b,c=map(int,input().split())\r\nif(a==b):\r\n print(\"YES\")\r\nelif(a!=b and c==0):\r\n print(\"NO\")\r\nelif((b-a)%c==0 and ((b-a)/c>0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nif __name__ == '__main__':\r\n values = [int(x) for x in input().split()]\r\n\r\n if values[2] == 0 :\r\n print('YES' if values[0] == values[1] else 'NO')\r\n else:\r\n print('YES' if (values[1]-values[0])//(values[2]) >= 0 and (values[1]-values[0])%(values[2]) == 0 else 'NO')\r\n", "a,b,c = map(int,input().split())\r\nif c == 0:print(\"YNEOS\"[a!=b::2])\r\nelse:print(\"YNEOS\"[not ((b-a) % c == 0 and (b-a) /c >=0)::2])", "a,b,c = map(int, input().split())\r\nif (a!=b and c==0):\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint (\"YES\") if (a==b or ((b-a)%c==0 and (abs(b-a)/abs(c))==((b-a)/c))) else print (\"NO\")\r\n", "a, b, c = map(int, input().split())\r\n\r\nif(b==a):\r\n print('YES')\r\nelif(b>a):\r\n if(c>0 and (b-a)%c==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if(c<0 and (a-b)%(abs(c))==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from sys import stdin\r\n\r\ndef main():\r\n numbers = stdin.readline().split()\r\n a, b, c = int(numbers[0]), int(numbers[1]), int(numbers[2])\r\n r = False\r\n if c == 0:\r\n r = a == b\r\n else:\r\n r = (b - a) // c >= 0 and (b - a) % c == 0\r\n if r:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nmain()\r\n", "a, b, c = map(int, input().split())\n\ndif = b - a\n\nif c == 0:\n\tif dif == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nelse:\n\tif dif == 0:\n\t\tprint('YES')\n\telif dif > 0 and c > 0 and dif % c == 0:\n\t\tprint('YES')\n\telif dif < 0 and c < 0 and dif % c == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n", "a, b, c = map(int, input().split())\r\nif c == 0:\r\n print([\"NO\",\"YES\"][a == b])\r\nelse:\r\n d = b - a\r\n print([\"NO\",\"YES\"][d % c == 0 and d // c >= 0])", "a,b,c=map(int,input().split())\r\nif(b==a):\r\n print(\"YES\")\r\n exit()\r\nelif(b>a):\r\n if(c>0):\r\n if((b-a)%(c)==0):\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\nelif(b<a):\r\n if(c<0):\r\n if((b-a)%(c)==0):\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()", "a,b,c=map(int,input().split())\r\nif(b-a>0 and c>0):\r\n if(round((b-a)%c)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif(b-a<0 and c<0):\r\n if(round((a-b)%abs(c))):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif(a==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math as m\na,b,c=(map(int,input().split()))\nd=0\nif(c==0):\n\tif a==b:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\nelse:\n\tif c<0:\n\t\td=a-b\n\telse:\n\t\td=b-a\n\tif (d<0) or d%c!=0:\n\t\tprint(\"NO\")\n\telse :\n\t\tprint(\"YES\")", "s=[int(n) for n in input().split()]\r\na=s[0]\r\nd=s[2]\r\nx=s[1]\r\nif d!=0:\r\n\tz=((x-a)/d)+1\r\n\tif z==int(z) and z>0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tif a==x:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "a, b, c = map(int, input().split())\r\n\r\nif (b > a and c < 0) or (b < a and c > 0) or (b != a and c == 0):\r\n print('NO')\r\nelif b == a and c == 0:\r\n print('YES')\r\nelse:\r\n print('NO' if (b - a) % c else 'YES')", "a,b,c = map(int, input().split())\r\nap = b - a\r\nif(a == b):\r\n print(\"YES\")\r\nelif(c == 0):\r\n print(\"NO\") \r\nelif(ap % c == 0 and ap//c >= 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f(a, b, c):\r\n if c == 0:\r\n return a == b\r\n else:\r\n return (b - a) % c == 0 and (b - a) // c >= 0\r\nprint('YES' if f(map(int, input().split())) else 'NO')", "#!/usr/bin/env python3\n\ndef s(a):\n if a < 0:\n return -1\n return 1\n\nif __name__ == '__main__':\n a, b, c = map(int, input().split())\n\n\n if c == 0:\n if a == b:\n print('YES')\n else:\n print('NO')\n elif a < b and c < 0:\n print('NO')\n elif a > b and c > 0:\n print('NO')\n else:\n dif = b - a\n if dif % c == 0:\n print('YES')\n else:\n print('NO')\n \n\n", "a,b,c=map(int,input().split())\r\nif(b<a) and (c>0):\r\n\tprint(\"NO\")\r\nelif(b>a) and (c<0):\r\n\tprint(\"NO\")\r\nelif(c==0):\r\n\tif (a==b):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tb=b-a\r\n\tif(b%c==0):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "l=list(map(int,input().split(\" \")))\na=l[0]\nb=l[1]\nc=l[2]\nd=b-a\nif d==0:\n\tprint(\"YES\")\nelif c!=0:\n\tif d%c==0 and dc>0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tprint(\"NO\")\n\n", "a,b,c=list(map(int,input().split()));print([\"NO\",\"YES\"][(b-a==0)or(((b-a)c>0)and((b-a)%c==0))])\r\n", "q,w,e=map(int,input().split())\r\na=w-q\r\nif q==w:\r\n print ('YES')\r\nelif e==0:\r\n print('NO')\r\nelif ae>=0:\r\n if a%e==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a,b,c = map(int, input().split())\nprint(\"YES\" if a == b or c != 0 and (b-a) // c >= 0 and (b-a)%c == 0 else \"NO\")", "[a,b,c] = list(map(int, input().split(\" \")))\nr = a == b or (c != 0 and (b-a)c > 0 and (b-a)%c == 0)\nprint(\"YES\" if r else \"NO\")\n", "a,b,c = map(float, input().split(\" \"))\r\n\r\nif c == 0:\r\n\tif a == b: print(\"YES\")\r\n\telse: print(\"NO\")\r\nelse:\r\n\tcheck = (b-a)/c+1\r\n\tif check >= 1 and check % 1 == 0: print(\"YES\")\r\n\telse: print(\"NO\")", "x=list(map(int,input().split()))\na=x[0]\nb=x[1]\nc=x[2]\nif c==0:\n\tif a==b:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\t\n\nelse:\n\tif (b-a)%c==0 and (b-a)/c>=0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\t", "a , b , c = [int(x) for x in input().split()]\r\nif c != 0:\r\n num = (b - a)/c\r\n if num == round(num) and round(num) >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "z = input().split()\r\nx = list(map(int, z))\r\na, b, c = x[0], x[1], x[2]\r\n\r\nif a < b and c < 0:\r\n print(\"NO\")\r\n exit(0)\r\nif a > b and c > 0:\r\n print(\"NO\")\r\n exit(0)\r\nif (a != b) and c == 0:\r\n print(\"NO\")\r\n exit(0)\r\nif a == b:\r\n print(\"YES\")\r\n exit(0)\r\nif (b - a) % c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c=(int(x) for x in input().split())\nprint('YES' if c==0 and a==b or c!=0 and (b-a)%c==0 and (b-a)//c>=0 else 'NO')", "#@author: behradm\n\ndef main():\n a, b, c = list(map(int, input().split()))\n\n if(c == 0):\n if(a == b):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if((c < 0 and b > a) or (c > 0 and b < a)):\n print(\"NO\")\n return 0;\n\n if(a % c == b % c):\n print(\"YES\")\n else:\n print(\"NO\")\n\nif(__name__ == \"__main__\"):\n main()\n", "a,b,c = input().split();\r\na=int(a)\r\nb=int(b);\r\nc=int(c);\r\n\r\nif c==0 :\r\n if a!=b :\r\n print(\"NO\");\r\n else :\r\n print(\"YES\");\r\nelif c<0 :\r\n if b>a:\r\n print(\"NO\");\r\n elif b==a:\r\n print(\"YES\");\r\n elif(a-b)%(-c)!=0:\r\n print(\"NO\")\r\n else :\r\n print(\"YES\");\r\nelse :\r\n if b<a:\r\n print(\"NO\");\r\n elif b==a:\r\n print(\"YES\");\r\n elif(b-a)%(c)!=0:\r\n print(\"NO\")\r\n else :\r\n print(\"YES\");\r\n \r\n", "## a + (n-1) c\r\n#b-a / c\r\na , b , c = map(int , input().split())\r\nif c == 0 :\r\n if b == a :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelif(b < a and c > 0) or (b > a and c < 0) :\r\n print(\"NO\")\r\nelse :\r\n print(['NO','YES'][(b-a) % c == 0 ])", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print(\"YES\")\r\nelif b>a and c<=0:\r\n print(\"NO\")\r\nelif a>b and c>=0:\r\n print(\"NO\")\r\nelif (b-a)%c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "a, b, c = map(int, input().split(\" \"))\ntry:\n n = (b - a) / c + 1\n if (int(n) == n) and n > 0: print(\"YES\")\n else: print(\"NO\")\nexcept ZeroDivisionError:\n if a == b: print(\"YES\")\n else: print(\"NO\")\n", "def miis():\r\n return map(int, input().split())\r\n\r\na, b, c = miis()\r\nif a == b:\r\n print(\"YES\")\r\nelif c == 0:\r\n print(\"YES\" if b == a else \"NO\")\r\nelse:\r\n print(\"YES\" if (a-b)%c == 0 and (c>0)==(a-b<0) else \"NO\")\r\n", "a,b,c=map(int,input().split())\r\nf=0\r\nif(a==b):\r\n f=1\r\nelif(c==0):\r\n f=0\r\nelif(((b-a)<0 and c>0) or ((b-a)>0 and c<0)):\r\n f=0\r\nelif((b-a)%c==0):\r\n f=1\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b, c = (int(x) for x in input().split())\r\nprint(\"NO\" if (a < b and c <= 0) or (a > b and c >= 0) or (c and (b-a) % c) else \"YES\")", "a, b, c = [int(i) for i in input().split()]\r\nif (c != 0 and (b - a) % c == 0 and (b - a)c >= 0) or (c == 0 and a == b): print('YES')\r\nelse: print('NO')", "a = input().split()\na,b,c = a\na = int(a)\nb = int(b)\nc = int(c)\n\nif not c:\n if a==b:\n print(\"YES\")\n else: \n print(\"NO\")\nelif b%c == a%c and ((b >= a and c > 0) or (b <= a and c < 0)):\n print(\"YES\")\nelse:\n print(\"NO\")", "import math\r\n\r\ndef get_primes(prime_supr):\r\n\r\n is_prime = [0]2 + [1]prime_supr\r\n\r\n for i in range(2,int(math.sqrt(prime_supr)) + 1):\r\n if is_prime[i]:\r\n for j in range(i i, prime_supr + 1, i):\r\n is_prime[j] = 0\r\n\r\n return is_prime\r\n\r\nget_int = lambda: map(int, input().split())\r\n\r\na, b, c = get_int()\r\n\r\nif c!=0:\r\n x = (b - a) / c\r\n print(['YES', 'NO'][int(x) != x or x < 0])\r\nelse:\r\n print(['YES', 'NO'][b != a])", "\r\na,b,c=map(int,input().split())\r\nif ((c!=0 and (b-a)c > 0 and (b-a) % c == 0)) or a == b:print('YES')\r\nelse:print('NO')", "a,b,c = map(int,input().split())\r\nif c==0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = ((b - a)/c)+1\r\n if n<=0 or (n2//2 != n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "#true=1 false=0\r\n#675A\r\na,b,c=map(int,input().split())\r\nif c==0:\r\n print(['No','Yes'][a==b])\r\nelse :\r\n print(['No','Yes'][(b-a)//c>=0 and (b-a)%c==0])", "line = input()\r\nlin = list(map(int, line.split()))\r\nflag = 1\r\n\r\ntmp = (lin[1] - lin[0])\r\nif lin[2] == 0:\r\n\tif tmp == 0:\r\n\t\tflag = 0\r\nelif tmp >=0 and lin[2] > 0:\r\n\tflag = tmp %lin[2]\r\nelif tmp<=0 and lin[2] <0:\r\n\tflag = abs(tmp) %abs(lin[2])\r\nif flag == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b,c = map(int,input().split())\r\n\r\nif c != 0:\r\n\trem = (b - a) % c\r\n\tdivisor = (b - a)/c\r\n\tif divisor >= 0 and rem == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\nelse:\r\n\tif a == b:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "import math\r\na,b,c=map(int,input().split())\r\nif c!=0:\r\n val=((b-a)/c)+1\r\n \r\n if math.ceil(val)==math.floor(val) and int(val)>=1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')", "x=list(map(int, input().split()))\r\na=x[0]\r\nb=x[1]\r\nc=x[2]\r\nif a==b:\r\n print(\"YES\")\r\nelif a>b:\r\n if c>=0:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if d%abs(c)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if c<=0:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if d%abs(c)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a, b, c = tuple(map(int, input().split()))\r\n\r\nif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = (b - a) // c\r\n if n >= 0 and a + n * c == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def algrorythm(a,b,c):\r\n\ttry:\r\n\t\tif (a - b) % c ==0:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\texcept:\r\n\t\tif a == b:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\r\nm = [int(i) for i in input().split()]\r\na,b,c = m[0],m[1],m[2]\r\n\r\nif c >= 0:\r\n\tif b >= a:\r\n\t\talgrorythm(a,b,c)\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tif b <= a:\r\n\t\talgrorythm(a,b,c)\r\n\telse:\r\n\t\tprint('NO')\r\n", "def f(l):\r\n a,b,c = l\r\n if c==0:\r\n return a==b\r\n return (b-a)%c==0 and (b-a)//c>=0\r\n\r\nl = list(map(int,input().split()))\r\nprint('YES' if f(l) else 'NO')\r\n", "a, b, c = map(int, input().split())\r\n\r\nif c:\r\n div, mod = divmod(b - a, c)\r\n print('NO' if mod or div < 0 else 'YES')\r\nelse:\r\n print('YES' if a == b else 'NO')", "a,b,c = map(int, input().split())\r\nif a == b:\r\n print('YES')\r\nelif (b-a)c > 0 and (b-a)%c == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c=map(int,input().split())\r\nt=1010\r\nif c<0:t=-1\r\nif c==0:print([\"NO\",\"YES\"][a==b])\r\nelse: print([\"NO\",\"YES\"][b in range(a,t,c)])", "a, b, c = map(int, input().split())\r\n\r\nif a == b: print('YES')\r\nelif c == 0 or b > a and c < 0 or b < a and c > 0: print('NO')\r\nelse:\r\n c = abs(c)\r\n\r\n if (b-a) % c == 0: print('YES')\r\n else: print('NO')\r\n", "import sys\na, b, c = map(int, sys.stdin.readline().split())\nif c == 0:\n if b == a:\n print('YES')\n else:\n print('NO')\nelif (b-a)%c == 0:\n if (b-a)*c >= 0:\n print('YES')\n else:\n print('NO')\nelse:\n print('NO') \n", "def YES():\r\n\tprint('YES')\r\n\texit()\r\n\t\r\ndef NO():\r\n\tprint('NO')\r\n\texit()\r\n\r\na,b,c = [int(x) for x in input().split(' ')]\r\n\r\nd = b - a\r\n\r\nif d == 0: YES()\r\n\r\nif c == 0: NO()\r\n\r\nif (d > 0 and c < 0) or (d < 0 and c > 0): NO()\r\nif d % c == 0: YES()\r\nNO()", "abc = input().split(\" \")\r\na = int(abc[0])\r\nb = int(abc[1])\r\nc = int(abc[2])\r\nif c < 0:\r\n\tif b > a:\r\n\t\tprint(\"NO\")\r\n\telif (b-a)%c == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelif c > 0:\r\n\tif b < a:\r\n\t\tprint(\"NO\")\r\n\telif (b-a)%c == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelif c == 0:\r\n\tif b==a:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n", "a,b,c=map(int,input().split())\r\nif b==a:print('YES')\r\nelif b>a:\r\n if c>0:\r\n if (b-a)%c==0:print('YES')\r\n else:print('NO')\r\n else:print('NO')\r\nelse:\r\n if c<0:\r\n if (b-a)%c==0:print('YES')\r\n else:print('NO')\r\n else:print('NO')", "Seq_Element, myNum, incr = [int(x) for x in input().split()]\r\nif incr == 0: print(\"YES\") if Seq_Element == myNum else print(\"NO\")\r\nelif (incr < 0 and Seq_Element < myNum) or (incr > 0 and Seq_Element > myNum):\r\n print(\"NO\")\r\nelse:\r\n if (myNum - Seq_Element)%incr != 0:\r\n print(\"NO\")\r\n else: print(\"YES\")", "a,b,c=map(int, input().split())\r\nif (c==0 and a==b) or (c!=0 and (b-a)%c==0 and (b-a)/c>=0) :\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b, c = map(int, input().strip().split())\nif a == b:\n\tprint('YES')\nelif c == 0:\n\tprint('NO')\nelse:\n\tn = ((b-a)/c)+1\n\tif n == int(n) and n > 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO') ", "a,b,c=tuple(map(int,input().split()))\r\nif c==0:\r\n print('Yes' if a==b else 'No')\r\nelse:\r\n if b%c==a%c and (b==a or (b-a)//abs(b-a)==c//abs(c)):\r\n print('Yes')\r\n else:\r\n print('No')", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\ndef solve():\r\n\ta,b,c = map(int, input().split())\r\n\tif a == b: return True\r\n\tif not c: return False\r\n\tif a>b and c>0: return False\r\n\tif b>a and c<0: return False\r\n\treturn not (b-a)%c\r\n\r\n\r\nprint(\"NYOE S\"[solve()::2])", "st=[int(i) for i in input().split(\" \")]\r\na=st[0]\r\nb=st[1]\r\nc=st[2]\r\nb=b-a\r\nif c!=0:\r\n if b%c==0 and b//c>=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif b==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c=map(int, input().split())\r\nif a==b or (c!=0 and (b-a)//c>=0 and (b-a)%c==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n" ]	{"inputs": ["1 7 3", "10 10 0", "1 -4 5", "0 60 50", "1 -4 -5", "0 1 0", "10 10 42", "-1000000000 1000000000 -1", "10 16 4", "-1000000000 1000000000 5", "1000000000 -1000000000 5", "1000000000 -1000000000 0", "1000000000 1000000000 0", "115078364 -899474523 -1", "-245436499 416383245 992", "-719636354 536952440 2", "-198350539 963391024 68337739", "-652811055 875986516 1091", "119057893 -516914539 -39748277", "989140430 731276607 -36837689", "677168390 494583489 -985071853", "58090193 777423708 395693923", "479823846 -403424770 -653472589", "-52536829 -132023273 -736287999", "-198893776 740026818 -547885271", "-2 -2 -2", "-2 -2 -1", "-2 -2 0", "-2 -2 1", "-2 -2 2", "-2 -1 -2", "-2 -1 -1", "-2 -1 0", "-2 -1 1", "-2 -1 2", "-2 0 -2", "-2 0 -1", "-2 0 0", "-2 0 1", "-2 0 2", "-2 1 -2", "-2 1 -1", "-2 1 0", "-2 1 1", "-2 1 2", "-2 2 -2", "-2 2 -1", "-2 2 0", "-2 2 1", "-2 2 2", "-1 -2 -2", "-1 -2 -1", "-1 -2 0", "-1 -2 1", "-1 -2 2", "-1 -1 -2", "-1 -1 -1", "-1 -1 0", "-1 -1 1", "-1 -1 2", "-1 0 -2", "-1 0 -1", "-1 0 0", "-1 0 1", "-1 0 2", "-1 1 -2", "-1 1 -1", "-1 1 0", "-1 1 1", "-1 1 2", "-1 2 -2", "-1 2 -1", "-1 2 0", "-1 2 1", "-1 2 2", "0 -2 -2", "0 -2 -1", "0 -2 0", "0 -2 1", "0 -2 2", "0 -1 -2", "0 -1 -1", "0 -1 0", "0 -1 1", "0 -1 2", "0 0 -2", "0 0 -1", "0 0 0", "0 0 1", "0 0 2", "0 1 -2", "0 1 -1", "0 1 0", "0 1 1", "0 1 2", "0 2 -2", "0 2 -1", "0 2 0", "0 2 1", "0 2 2", "1 -2 -2", "1 -2 -1", "1 -2 0", "1 -2 1", "1 -2 2", "1 -1 -2", "1 -1 -1", "1 -1 0", "1 -1 1", "1 -1 2", "1 0 -2", "1 0 -1", "1 0 0", "1 0 1", "1 0 2", "1 1 -2", "1 1 -1", "1 1 0", "1 1 1", "1 1 2", "1 2 -2", "1 2 -1", "1 2 0", "1 2 1", "1 2 2", "2 -2 -2", "2 -2 -1", "2 -2 0", "2 -2 1", "2 -2 2", "2 -1 -2", "2 -1 -1", "2 -1 0", "2 -1 1", "2 -1 2", "2 0 -2", "2 0 -1", "2 0 0", "2 0 1", "2 0 2", "2 1 -2", "2 1 -1", "2 1 0", "2 1 1", "2 1 2", "2 2 -2", "2 2 -1", "2 2 0", "2 2 1", "2 2 2", "-1000000000 1000000000 1", "-1000000000 1000000000 2", "1000000000 -1000000000 -1", "5 2 3", "2 1 -1", "3 2 1", "0 -5 -3", "2 5 5", "0 10 1", "15 5 -5", "2 1 1", "20 10 0", "20 15 5", "1 6 1", "1000000000 0 -1000000000", "1 1 -5", "4 6 1", "-5 -10 -5", "2 0 0", "10 9 -1", "-2 -1 -1", "1 13 3", "2 3 0", "1 1 -1", "5 -10 -5", "5 3 1", "1 1000000000 1", "-1000000000 1000000000 1000000000"], "outputs": ["YES", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	136
cf4fdddf06155690a7e8cf32013d2821	Set of Points	Convexity of a set of points on the plane is the size of the largest subset of points that form a convex polygon. Your task is to build a set of n points with the convexity of exactly m. Your set of points should not contain three points that lie on a straight line. The single line contains two integers n and m (3<=≤<=m<=≤<=100,<=m<=≤<=n<=≤<=2m). If there is no solution, print "-1". Otherwise, print n pairs of integers — the coordinates of points of any set with the convexity of m. The coordinates shouldn't exceed 108 in their absolute value. Sample Input 4 3 6 3 6 6 7 4 Sample Output 0 0 3 0 0 3 1 1 -1 10 0 -10 0 10 1 9 1 9 -1 0 -2 176166 6377 709276 539564 654734 174109 910147 434207 790497 366519 606663 21061 859328 886001	[ "n, m = map(int, input().split())\r\n\r\n\r\nif m == 3:\r\n if n >= 5:\r\n print(-1)\r\n exit(0)\r\n print(0, 0)\r\n print(2, 0)\r\n print(1, 1)\r\n if n >= 4:\r\n print(1, 2)\r\n exit(0)\r\n\r\n\r\nfor i in range(m):\r\n print(i, 107 + i2)\r\n\r\nfor i in range(n - m):\r\n print(i, -107 - i2)\r\n" ]	{"inputs": ["4 3", "6 3", "6 6", "7 4", "3 3", "5 3", "4 4", "5 4", "6 4", "8 4", "8 6", "10 5", "5 5", "10 6", "11 7", "16 8", "9 5", "200 100", "199 100", "198 100", "102 100", "101 100", "100 100", "198 99", "197 99", "100 99", "99 99", "50 37", "150 100", "181 95", "100 50", "101 99", "6 5", "7 5", "8 5", "43 24", "49 30", "55 36", "77 39", "80 42"], "outputs": ["0 0\n3 0\n0 3\n1 1", "-1", "10 0\n-10 0\n10 1\n9 1\n9 -1\n0 -2", "176166 6377\n709276 539564\n654734 174109\n910147 434207\n790497 366519\n606663 21061\n859328 886001", "10000000 0\n-4999999 8660254\n-5000000 -8660254", "-1", "0 0\n1 1\n3 1\n4 0", "0 0\n1 1\n3 1\n4 0\n0 3", "0 0\n1 1\n3 1\n4 0\n0 3\n1 2", "0 0\n1 1\n3 1\n4 0\n0 3\n1 2\n3 2\n4 3", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n20000000 0\n12469796 15636628", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704\n-16180338 -11755704\n6180338 -19021130", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n20000000 0\n12469796 15636628\n-4450418 19498558\n-18019376 8677674", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n6234898 -7818314\n20000000 0\n12469796 15636628\n-4450418 19498558\n-18019376 8677674", "10000000 0\n7660444 6427876\n1736481 9848077\n-4999999 8660254\n-9396926 3420201\n-9396926 -3420201\n-5000000 -8660254\n1736481 -9848077\n20000000 0\n15320888 12855752\n3472962 19696154\n-9999998 17320508\n-18793852 6840402\n-18793852 -6840402\n-10000000 -17320508\n3472962 -19696154", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704\n-16180338 -11755704", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9856159 1690008\n9428774 3331397\n8730141 4876949\n7780357 6282199\n6606747 7506723\n5243072 8515291\n3728564 9278890\n2106792 9775552\n424412 9990989\n-1270178 9919004\n-2928227 9561667\n-4502037 8929258\n-5946331 8039971\n-7219560 6919388\n-8285096 5599747\n-9112284 4119012\n-9677329 2519780\n-9963974 848059\n-9963974 -848059\n-9677329 -2519780\n-9112284 -4119012\n-8285096 -5599747\n-7219560 -6919388\n-5946331 -8039971\n-4502037 -8929258\n-2928227 -9561667\n-1270178 -9919004\n424412 -9990989\n...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9978136 660905\n9912640 1318921\n9803799 1971170\n9652089 2614799\n9458172 3246994\n9222897 3864991\n8947293 4466088\n8632564 5047655\n8280088 5607150\n7891405 6142127\n7468214 6650245\n7012367 7129284\n6525857 7577148\n6010811 7991879\n5469481 8371664\n4904235 8714842\n4317543 9019912\n3711972 9285540\n3090169 9510565\n2454854 9694002\n1808805 9835050\n1154846 9933092\n495837 9987699\n-165339 9998633\n-825793 9965844\n-1482636 9889478\n-2132996 9769868\n-2774029 9607536\n-3402931 9403193\n-401...", "10000000 0\n9924205 1228882\n9697969 2439137\n9324722 3612416\n8810121 4730935\n8161969 5777738\n7390089 6736956\n6506183 7594049\n5523649 8336023\n4457383 8951632\n3323547 9431544\n2139330 9768483\n922683 9957341\n-307950 9995257\n-1533916 9881654\n-2736629 9618256\n-3897858 9209055\n-4999999 8660254\n-6026346 7980172\n-6961339 7179119\n-7790805 6269238\n-8502171 5264321\n-9084652 4179603\n-9529420 3031526\n-9829730 1837495\n-9981033 615609\n-9981033 -615609\n-9829730 -1837495\n-9529420 -3031526\n-9084652...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704", "10000000 0\n9685831 2486898\n8763066 4817536\n7289686 6845471\n5358267 8443279\n3090169 9510565\n627905 9980267\n-1873813 9822872\n-4257792 9048270\n-6374239 7705132\n-8090169 5877852\n-9297764 3681245\n-9921147 1253332\n-9921147 -1253332\n-9297764 -3681245\n-8090169 -5877852\n-6374239 -7705132\n-4257792 -9048270\n-1873813 -9822872\n627905 -9980267\n3090169 -9510565\n5358267 -8443279\n7289686 -6845471\n8763066 -4817536\n20000000 0\n19371662 4973796\n17526132 9635072\n14579372 13690942\n10716534 16886558\n6...", "10000000 0\n9795299 2012985\n9189578 3943558\n8207634 5712682\n6889669 7247927\n5289640 8486442\n3473052 9377521\n1514277 9884683\n-506491 9987165\n-2506525 9680771\n-4403941 8978045\n-6121059 7907757\n-7587581 6513724\n-8743466 4853019\n-9541392 2993631\n-9948693 1011683\n-9948693 -1011683\n-9541392 -2993631\n-8743466 -4853019\n-7587581 -6513724\n-6121059 -7907757\n-4403941 -8978045\n-2506525 -9680771\n-506491 -9987165\n1514277 -9884683\n3473052 -9377521\n5289640 -8486442\n6889669 -7247927\n8207634 -57126...", "10000000 0\n9856159 1690008\n9428774 3331397\n8730141 4876949\n7780357 6282199\n6606747 7506723\n5243072 8515291\n3728564 9278890\n2106792 9775552\n424412 9990989\n-1270178 9919004\n-2928227 9561667\n-4502037 8929258\n-5946331 8039971\n-7219560 6919388\n-8285096 5599747\n-9112284 4119012\n-9677329 2519780\n-9963974 848059\n-9963974 -848059\n-9677329 -2519780\n-9112284 -4119012\n-8285096 -5599747\n-7219560 -6919388\n-5946331 -8039971\n-4502037 -8929258\n-2928227 -9561667\n-1270178 -9919004\n424412 -9990989\n...", "10000000 0\n9870502 1604112\n9485364 3166679\n8854560 4647231\n7994427 6007422\n6927243 7212024\n5680647 8229838\n4286925 9034504\n2782174 9605181\n1205366 9927088\n-402659 9991889\n-2000256 9797906\n-3546048 9350162\n-4999999 8660254\n-6324453 7746049\n-7485107 6631226\n-8451900 5344658\n-9199794 3919666\n-9709418 2393156\n-9967573 804665\n-9967573 -804665\n-9709418 -2393156\n-9199794 -3919666\n-8451900 -5344658\n-7485107 -6631226\n-6324453 -7746049\n-5000000 -8660254\n-3546048 -9350162\n-2000256 -9797906...", "10000000 0\n9893433 1456011\n9576005 2880990\n9054482 4244566\n8339978 5517677\n7447721 6673188\n6396730 7686471\n5209403 8535930\n3911047 9203461\n2529333 9674836\n1093712 9940009\n-365220 9993328\n-1816368 9833656\n-3228804 9464397\n-4572423 8893421\n-5818589 8132897\n-6940741 7199034\n-7914964 6111737\n-8720494 4894178\n-9340161 3572308\n-9760758 2174301\n-9973322 729953\n-9973322 -729953\n-9760758 -2174301\n-9340161 -3572308\n-8720494 -4894178\n-7914964 -6111737\n-6940741 -7199034\n-5818589 -8132897\n-..."]}	UNKNOWN	PYTHON3	CODEFORCES	1
cf61c7272e1736a69a692641b0e542a9	Okabe and Future Gadget Laboratory	Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an n by n square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every x,<=y such that 1<=≤<=x,<=y<=≤<=n and ax,<=y<=≠<=1, there should exist two indices s and t so that ax,<=y<==<=ax,<=s<=+<=at,<=y, where ai,<=j denotes the integer in i-th row and j-th column. Help Okabe determine whether a given lab is good! The first line of input contains the integer n (1<=≤<=n<=≤<=50) — the size of the lab. The next n lines contain n space-separated integers denoting a row of the grid. The j-th integer in the i-th row is ai,<=j (1<=≤<=ai,<=j<=≤<=105). Print "Yes" if the given lab is good and "No" otherwise. You can output each letter in upper or lower case. Sample Input 3 1 1 2 2 3 1 6 4 1 3 1 5 2 1 1 1 1 2 3 Sample Output Yes No	[ "n=int(input())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nflag=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if( l[i][j]==1 )or any(l[i][j]-l[x][j] in l[i] for x in range(n)):\r\n continue\r\n else:\r\n print('No')\r\n flag=1\r\n break\r\n if(flag==1):\r\n break\r\nelse:\r\n print('Yes') \r\n ", "n=int(input())\na=[list(map(int,input().split())) for i in range(n)]\nfor i in range(n):\n\tfor j in range(n):\n\t\tflag=0\n\t\tif(a[i][j]==1):\n\t\t\tcontinue\n\t\tfor k in range(n):\n\t\t\tfor kk in range(n):\n\t\t\t\tif(a[i][k]+a[kk][j]==a[i][j]):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\t\t\tif flag:\n\t\t\t break\n\t\tif not flag:\n\t\t print(\"No\")\n\t\t exit(0)\nprint(\"Yes\")\n", "from typing import Counter\r\n\r\n\r\nn = int(input())\r\na = []\r\nrc = []\r\ncc = [Counter() for _ in range(n)]\r\nrg = range(n)\r\n\r\nfor _ in rg:\r\n l = [int(x) for x in input().split()]\r\n c = Counter(l)\r\n rc.append(c)\r\n for i in rg:\r\n cc[i][l[i]] += 1\r\n a.append(l)\r\n\r\nbn = n - 1\r\n\r\ngood = True\r\n\r\nfor r in rg:\r\n for c in rg:\r\n val = a[r][c]\r\n if val != 1:\r\n rc[r][val] -= 1\r\n cc[c][val] -= 1\r\n brk = False\r\n looking = True\r\n for k, v in rc[r].items():\r\n if v != 0:\r\n for kk, vv in cc[c].items():\r\n if vv != 0:\r\n if k + kk == val:\r\n looking = False\r\n brk = True\r\n break\r\n if brk:\r\n break\r\n if looking:\r\n good = False\r\n break\r\n rc[r][val] += 1\r\n cc[c][val] += 1\r\n if not good:\r\n break\r\n\r\nif good:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\nn=int(input())\r\n\r\na=[0]50\r\n\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n fl=0\r\n for k in range(n):\r\n for t in range(n):\r\n if a[i][j]==a[i][k]+a[t][j]:\r\n fl=1\r\n\r\n if fl==0:\r\n print(\"No\")\r\n quit()\r\n\r\nprint(\"Yes\")\r\n\r\n", "n = int(input().split()[0])\ntab = [[] for _ in range(n)]\nfor i in range(n):\n for inp in input().rstrip().split():\n tab[i].append(int(inp))\n\ntabt = list(map(list,zip(tab)))\ncnt = 0\nfor i, line in enumerate(tab):\n for j, column in enumerate(tabt):\n for a in line:\n for b in column:\n if tab[i][j] == 1 or tab[i][j] == a + b:\n cnt += 1\n break\n else:\n continue\n break\n\nif cnt == nn:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\na = [[int(j) for j in input().split(' ')] for i in range(n)]\n\ndef check(a,n):\n for i in range(len(a)):\n for j in range(len(a)):\n v = a[i][j]\n if v == 1:\n continue\n s = [a[i][x] + a[y][j] for x in range(n) for y in range(n)]\n if v not in s:\n return False\n return True\n\n# check(a,n)\nprint('Yes' if check(a, n) else 'No')\n", "n = int(input())\r\n\r\nlab = []\r\n\r\n\r\ndef is_valid_cell(i,j):\r\n row = lab[i]\r\n column = [lab[i][j] - lab[x][j] for x in range(n)]\r\n for each in column:\r\n if each in row:\r\n return True\r\n return False\r\n\r\nfor i in range(n):\r\n line = [int(x) for x in input().split(' ')]\r\n lab.append(line)\r\n\r\nresult = 'YES'\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (lab[i][j] != 1):\r\n if (not is_valid_cell(i,j)):\r\n result = 'NO'\r\n break\r\n else:\r\n continue\r\n break\r\n\r\nprint(result)", "from itertools import product\r\n\r\nn = int(input())\r\nA = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nfor i,j in product(range(n), repeat=2):\r\n if A[i][j] > 1 and all(A[i][k]+A[m][j]!=A[i][j]\r\n for k,m in product(range(n), repeat=2)):\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "#!/bin/python3\nimport sys\nimport time\nimport heapq\nimport collections\nfrom io import StringIO\n\ntest_cases = [\n (\"\"\"\n3\n1 1 2\n2 3 1\n6 4 1\n\"\"\", \"\"\"\nYes\n\"\"\"),\n (\"\"\"\n3\n1 5 2\n1 1 1\n1 2 3\n\"\"\", \"\"\"\nNo\n\"\"\"),\n]\n\n\ndef solve():\n return \"TEST\"\n\n\ndef debug(args, *kwargs):\n print(args, *kwargs, file=sys.stderr)\n\n\ndef check(rows, cols):\n for i, row in enumerate(rows):\n for j, el in enumerate(row):\n if el != 1:\n found = False\n for k, add_in_row in enumerate(row):\n add_in_col = el - add_in_row\n n = cols[j].get(add_in_col, 0)\n if k != j and (n > 0 and add_in_col != el or n > 1 and add_in_col == el):\n found = True\n break\n if not found:\n return False\n return True\n\n\ndef main():\n n = int(input())\n rows = []\n cols = []\n for i in range(n):\n rows.append([int(el) for el in input().split()])\n for i in range(n):\n # cols.append([row[i] for row in rows])\n d = {}\n for row in rows:\n d[row[i]] = d.get(row[i], 0) + 1\n cols.append(d)\n result = check(rows, cols)\n print('Yes' if result else 'No')\n\n\ndef test(s, check):\n s = s.strip()\n check = check.strip()\n sys.stdin = StringIO(s)\n sys.stdout = out = StringIO()\n start_time = time.time()\n try:\n main()\n finally:\n exec_time = time.time() - start_time\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n out.seek(0)\n result = out.read().strip()\n status = \"SUCCESS\" if result == check else \"FAILURE\"\n message = \"status: {}, exec_time: {:.3f}\".format(status, exec_time)\n debug(message)\n\n\ndef test_all():\n for s, check in test_cases:\n test(s, check)\n\n\nif __name__ == '__main__':\n if len(sys.argv) > 1 and sys.argv[1] == '-t':\n test_all()\n else:\n main()\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\ndef check(i, j):\n for r in range(n):\n for c in range(n):\n if a[i][c] + a[r][j] == a[i][j]:\n return 1\n return 0\nn = int(input())\na = [[] for _ in range(n)]\nfor i in range(n):\n a[i] = list(rint())\n\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1:\n continue\n if check(i,j) == 0:\n print(\"No\")\n exit()\n\nprint(\"Yes\")\n\n\n\n", "def test(a):\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == 1:\r\n continue\r\n flag = 0\r\n for k in range(len(a[i])):\r\n if (a[i][j]-a[k][j]) in a[i]:\r\n flag = 1\r\n break\r\n if flag == 0:\r\n return \"No\"\r\n return \"Yes\"\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list()\r\n for _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n print(test(a))\r\n", "\r\n\r\n\r\n\r\nt=[]\r\n\r\ns=[]\r\na=int(input())\r\nfor k in range(a):\r\n t.append(list(map(int,input().split())))\r\n\r\n\r\nfor j in range(a):\r\n p=[]\r\n for y in range(a):\r\n p.append(t[y][j])\r\n\r\n s.append(p)\r\n\r\n\r\nh=0\r\nfor b in range(a):\r\n for c in range(a):\r\n if t[b][c]!=1:\r\n z=0\r\n l=t[b][c]\r\n for v in range(1,l):\r\n if v in t[b]:\r\n if l-v in s[c]:\r\n z+=1\r\n \r\n if v in s[c]:\r\n if l-v in t[b]:\r\n z+=1\r\n if z==0:\r\n print('No')\r\n h+=1\r\n break\r\n if h>0:\r\n break\r\n if h>0:\r\n break\r\n\r\nif h==0:\r\n print('Yes')\r\n", "import re\r\nimport sys\r\nimport math\r\nimport string\r\n\r\n\r\nt=int(input())\r\nl=[]\r\ni=1\r\nwhile i<=t:\r\n g=list(map(int,input().strip().split(\" \")))\r\n l.append(g)\r\n i=i+1\r\n \r\ni=0\r\nwhile i<t:\r\n j=0\r\n while j<t:\r\n a=l[i][j]\r\n k=0\r\n f=1\r\n if a!=1:\r\n while k<t:\r\n if a-l[k][j]>0 and (a-l[k][j]) in l[i]:\r\n f=1\r\n break\r\n k=k+1\r\n else:\r\n f=2\r\n break\r\n j=j+1\r\n if f==2:\r\n break\r\n i=i+1\r\n\r\nif f==1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n = int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\n# print(l)\r\na,b= 0,0\r\nfor i in range(len(l)):\r\n\tfor j in range(len(l)):\r\n\t\tif l[i][j] != 1:\r\n\t\t\ta += 1\r\n\t\t\tfor k in range(len(l)):\r\n\t\t\t\tflag = 0\r\n\t\t\t\tfor m in range(len(l)):\r\n\t\t\t\t\tif l[i][k] == l[i][j] or l[m][j] == l[i][j]:\r\n\t\t\t\t\t\tcontinue\r\n\t\t\t\t\tif l[i][k]+l[m][j] == l[i][j]:\r\n\t\t\t\t\t\tb+=1\r\n\t\t\t\t\t\tflag = 1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag == 1:\r\n\t\t\t\t\tbreak\r\n# print(a,b)\r\nif a == b:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n x.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]!=1:\r\n r=0\r\n for k in range(n):\r\n for l in range(n):\r\n if x[i][k]+x[l][j]==x[i][j]:\r\n r=1\r\n if r==0:\r\n print('No')\r\n exit()\r\nprint(\"Yes\")\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a+=[list(map(int,input().split()))]\r\nfor i in range(n):\r\n for j in range(n):\r\n b=a[i][j]\r\n if b!=1:\r\n for k in range(n):\r\n if b-a[k][j] in a[i]:\r\n b=0\r\n break\r\n if b:\r\n print('No')\r\n quit()\r\nprint('Yes')\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　（´<_｀）　 Welcome to My Coding Space !\r\n# 　　　　（ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　　 \|　\| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　\|　 \|\r\n# 　＿_(__ﾆつ/　＿/ .\| .\|＿＿＿＿\r\n# 　　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？\r\n# BINARY SEARCH ?\r\n# CHANGE TO GRAPH?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\ngrid = M(n)\r\ntag = False\r\nfor i in r(n):\r\n for j in r(n):\r\n if grid[i][j] != 1:\r\n tt = False\r\n for k in r(n):\r\n for l in r(n):\r\n if grid[i][k] + grid[l][j] == grid[i][j]:\r\n tt = True\r\n break\r\n if tt:\r\n break\r\n if not tt:\r\n pb(0)\r\n exit(0)\r\npb(1)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tc=0\r\n\t\tif a[i][j]==1:\r\n\t\t\tcontinue\r\n\t\tfor k in range(n):\r\n\t\t\tfor l in range(n):\r\n\t\t\t\tif a[i][j]==a[i][k]+a[l][j]:\r\n\t\t\t\t\tc=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif c:\r\n\t\t\t\tbreak\r\n\t\tif not c:\r\n\t\t\tprint('No')\r\n\t\t\texit(0)\r\nprint('Yes')\r\n\t\t\t\t\t ", "n = int(input().strip())\na = [[int(num) for num in input().strip().split()] for _ in range(n)]\n\nans = 'Yes'\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1: continue\n found = False\n for k in range(n):\n for l in range(n):\n if a[i][l] + a[k][j] == a[i][j]:\n found = True\n break\n if found: break\n if not found:\n ans = 'No'\n break\n if ans == 'No': break\nprint(ans)\n", "n= int(input())\na=[]\no=True\nfor _ in range(n):\n a+=[[int(f)for f in input().split()]]\nfor x in range(n):\n for y in range(n):\n s=False\n tr=list(range(n))\n tc=list(range(n))\n tr.remove(x)\n tc.remove(y)\n if a[x][y]!=1:\n for r in tr:\n for c in tc:\n if a[r][y]+a[x][c]==a[x][y]:\n s=True\n else:\n s=True\n if s==False:\n print('NO')\n exit()\nprint('YES')\n", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn = I()\r\ngrid = [IL() for i in range(n)]\r\nans = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j]==1:\r\n continue\r\n set1 = set([grid[i][j] - grid[ii][j] for ii in range(n)])\r\n set2 = set([grid[i][jj] for jj in range(n)])\r\n if len(set1.intersection(set2)) == 0:\r\n ans = False\r\n\r\nprint(\"Yes\" if ans else \"No\")", "if __name__ == \"__main__\":\n\tn = int(input())\n\tarr =[]\n\tfor i in range(n):\n\t\tli = list(map(int,input().split()))\n\t\tarr.append(li)\n\ttc = 0\n\tvc = 0\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif arr[i][j]>1:\n\t\t\t\ttc+=1\n\t\t\t\tfor k in range(n):\n\t\t\t\t\tdiff = arr[i][j]-arr[k][j]\n\t\t\t\t\tif diff in arr[i]:\n\t\t\t\t\t\tvc+=1\n\t\t\t\t\t\tbreak\n\tif tc==vc:\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")\n", "import sys\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef write(a):\r\n sys.stdout.write(a)\r\ndef check(a, n, i, j):\r\n s = a[i][j]\r\n x = []\r\n y = []\r\n for ix in range(n):\r\n if ix != i:\r\n y += [a[ix][j]]\r\n for jx in range(n):\r\n if jx != j:\r\n x += [a[i][jx]]\r\n for i in x:\r\n for j in y:\r\n if i + j == s:\r\n return True\r\n return False\r\ndef solve(a, n):\r\n for i in range(n):\r\n for j in range(n):\r\n if(a[i][j] != 1):\r\n if not(check(a, n, i, j)):\r\n return \"No\"\r\n return \"Yes\"\r\ndef main():\r\n n = int(input())\r\n a = [[int(j) for j in read().split()] for i in range(n)]\r\n print(solve(a, n))\r\nmain()\r\n", "w = [list(map(int, input().split())) for _ in range(int(input()))]\r\ns = list(map(set, zip(w)))\r\nr = True\r\n\r\nfor i in w:\r\n r &= all(a < 2 or any(a - c in b for c in i) for a, b in zip(i, s))\r\nprint(\"NO\" if r == 0 else \"YES\")", "n=int(input())\r\na=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i][j]!=1):\r\n f=0\r\n no=a[i][j]\r\n for k in range(n):\r\n for l in range(n):\r\n if(no==a[i][k]+a[l][j]):\r\n f=1\r\n if(f==0):\r\n print(\"No\")\r\n quit()\r\nprint(\"Yes\")\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor x in range(n):\r\n for y in range(n):\r\n if a[x][y]==1: continue\r\n ans=\"No\"\r\n for s in range(n):\r\n for t in range(n):\r\n if a[x][y]==a[x][s]+a[t][y]:\r\n ans=\"Yes\"\r\n break\r\n if ans==\"Yes\":break\r\n if ans==\"No\":\r\n print(ans)\r\n exit(0)\r\nprint(\"Yes\")\r\n", "#!/usr/bin/env python3\n\ndef solve():\n n = get(int)\n lab = [get([int]) for i in range(n)]\n labT = list(zip(lab))\n for r, row in enumerate(lab):\n for c, elem in enumerate(row):\n if elem == 1: continue\n col = labT[c]\n good = False\n for a in row[:c] + row[c+1:]:\n for b in col[:r] + col[r+1:]:\n if a+b == elem:\n good = True\n break\n if not good:\n return 'NO'\n\n return 'YES'\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n3\n1 1 2\n2 3 1\n6 4 1\n\nYES\n\n3\n1 5 2\n1 1 1\n1 2 3\n\nNO\n\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nimport re\nimport sys\nimport math\nimport heapq\nfrom heapq import heapify, heappop, heappush\nimport bisect\nimport string\nfrom bisect import bisect_left, bisect_right\nimport operator\nfrom operator import itemgetter, attrgetter\nimport itertools\nimport collections\n\ninf = float('inf')\nsys.setrecursionlimit(10000)\n\n\ndef tree():\n return collections.defaultdict(tree)\n\n\ndef cache(func): # Decorator for memoizing a function\n cache_dict = {}\n\n def _cached_func(args, _get_cache=False):\n if _get_cache:\n return cache_dict\n if args in cache_dict:\n return cache_dict[args]\n cache_dict[args] = func(args)\n return cache_dict[args]\n return _cached_func\n\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n _p, print = print, lambda a, b: None\n _p(solve())\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\narr=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(arr[i][j]!=1):\r\n\t\t\tv=0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor f in range(n):\r\n\t\t\t\t\tif(arr[i][j]==arr[i][k]+arr[f][j]):\r\n\t\t\t\t\t\tv+=1\r\n\t\t\tif(v==0):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint(\"Yes\")", "#def proverka(b, k, m, p):\r\n# for i in range()\r\n\r\nn = int(input()) \r\na = []\r\nfor i in range(n):\r\n a.append([int(j) for j in input().split()])\r\nflag = \"Yes\" \r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i][j] != 1):\r\n f = False\r\n for k in range(n):\r\n if(f):\r\n break\r\n for z in range(n):\r\n if(a[k][j] + a[i][z] == a[i][j]):\r\n f = True\r\n if(f):\r\n break\r\n if(not(f)):\r\n flag = \"No\"\r\n\r\nprint(flag)", "# IAWT\r\nn = int(input())\r\nl = [list(map(int, input().split())) for i in range(n)]\r\nc = []\r\nfor i in range(n):\r\n cul = []\r\n for u in range(n):\r\n cul.append(l[u][i])\r\n c.append(cul)\r\n\r\ndef is_good(i, j):\r\n if l[i][j] == 1: return True\r\n row = l[i][:j] + l[i][j+1:]\r\n cul = c[j][:i] + c[j][i+1:]\r\n for a in row:\r\n if (l[i][j] - a) in cul:\r\n return True\r\n return False\r\n\r\ndef f():\r\n for i in range(n):\r\n for j in range(n):\r\n if not is_good(i, j):\r\n print('No')\r\n return\r\n print('Yes')\r\n\r\nf()\r\n\r\n", "n, s = int(input()), 'Yes'\r\na = [list(map(int, input().split(' '))) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n f = False\r\n for x in range(n):\r\n for y in range(n):\r\n if a[i][j] == a[i][y] + a[x][j]:\r\n f = True\r\n if not f:\r\n s = 'No'\r\nprint(s)\r\n", "n = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data += [list(map(int, input().split()))]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] == 1:\r\n t = True\r\n continue\r\n t = False\r\n for k in range(n):\r\n for m in range(n):\r\n if data[i][k] + data[m][j] == data[i][j]:\r\n t = True\r\n break\r\n if not t:\r\n print(\"No\")\r\n break\r\n if not t:\r\n break\r\nif t:\r\n print(\"Yes\")\r\n", "n=int(input())\r\nl,d,f=[],0,0\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif l[i][j]>1:\r\n\t\t\tflag=0\r\n\t\t\td+=1\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor p in range(n):\r\n\t\t\t\t\tif l[i][p]+l[k][j]==l[i][j]:\r\n\t\t\t\t\t\tf+=1\r\n\t\t\t\t\t\tflag=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag==1:break\r\nprint(['NO','YES'][d==f])", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append([int(j) for j in input().split()])\r\n\r\ndef isThere(i,j,n):\r\n for x in range(n):\r\n for y in range(n):\r\n if (arr[x][j] + arr[i][y]) == arr[i][j]:\r\n return True\r\n return False\r\n\r\nanswer = \"Yes\"\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if not arr[i][j] == 1:\r\n if not isThere(i,j,n):\r\n answer = \"No\"\r\n\r\nprint(answer)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\ncheck1=1\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n check=1\r\n for k in range(n):\r\n for t in range(n):\r\n if a[i][t]+a[k][j]==a[i][j]:\r\n check=0\r\n if check==1:\r\n check1=0\r\n break\r\nif check1==0:\r\n print('No')\r\nelse:\r\n print('Yes')", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = [int(i) for i in input().split()]\r\n a.append(b)\r\ncan = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n for k in range(n):\r\n if a[i][j] - a[k][j] in a[i]:\r\n break\r\n else:\r\n can = False\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nt=[];flag=True\r\nfor i in range(n):\r\n t.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if t[i][j]==1:\r\n continue\r\n else:\r\n p=False\r\n for x in range(n):\r\n if p:break\r\n for y in range(n):\r\n if x!=j and y!=i:\r\n if t[y][j]+t[i][x]==t[i][j]:\r\n p=True\r\n break\r\n if p:break\r\n else:\r\n flag=False\r\nif flag:print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\n\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef good_num(i, j):\r\n for r in range(n):\r\n if r != j:\r\n for c in range(n):\r\n if c != i:\r\n if arr[i][j] == arr[i][r] + arr[c][j]:\r\n return True\r\n\r\n return False\r\n\r\n\r\nflag = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == 1:\r\n continue\r\n if not good_num(i, j):\r\n flag = True\r\n print('No')\r\n break\r\n if flag:\r\n break\r\n\r\nif not flag:\r\n print('Yes')\r\n\r\n\r\n\r\n\r\n", "# Codeforces Round #420 (Div. 2)\r\n# 821A\r\nn = int(input())\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n grid.append(list(map(int, input().split())))\r\n\r\ngood = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 1:\r\n continue\r\n else:\r\n foundSum = False\r\n for s in range(n):\r\n for t in range(n):\r\n if grid[i][s]+grid[t][j] == grid[i][j]:\r\n foundSum = True\r\n break\r\n if foundSum:\r\n break\r\n if not foundSum:\r\n good = False\r\n if not good:\r\n break\r\n if not good:\r\n break\r\n \r\nif good:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=109+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n l=[LI() for _ in range(n)]\n\n for i in range(n):\n for j in range(n):\n x=l[i][j]\n if x==1:\n continue\n d={}\n for k in range(n):\n if k!=j:\n d[l[i][k]]=l[i][k]\n f=False\n # print(d)\n for k in range(n):\n if k!=i:\n if x-l[k][j] in d:\n f=True\n if not f:\n return 'No'\n\n return 'Yes'\n\n# main()\nprint(main())\n", "sets=[]\n\nn = int(input())\n\nArr = [[0 for j in range(n)] for i in range(n)]\n\nfor i in range(n):\n s = input().split()\n c = set()\n for j in range(n):\n a=int(s[j])\n Arr[i][j]=a\n c.add(a)\n sets.append(c)\n\ndef check_arr():\n for i in range(n):\n for j in range(n):\n if Arr[i][j]==1:\n continue\n if not check_row(i,j):\n return False\n return True\n\n\n\ndef check_row(i,j):\n a = Arr[i][j]\n for k in range(n):\n if k == i:\n continue\n if ((a - Arr[k][j]) in sets[i]):\n return True\n return False\n\nif (check_arr()):\n print(\"Yes\")\nelse:\n print(\"No\")", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\ndef check(a,n,x,y):\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if a[x][y]!=a[x][i] and a[x][y]!=a[j][y]:\r\n if a[x][y] == a[x][i] + a[j][y]:\r\n return True\r\n return False\r\n # print()\r\n\r\n#write your code here\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n inp = input()\r\n inp = inp.split(\" \")\r\n inp = [ int(x) for x in inp]\r\n a.append(inp);\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n if a[x][y] != 1:\r\n if check(a,n,x,y) ==False:\r\n print(\"No\")\r\n exit();\r\n\r\nprint(\"Yes\")\r\n\r\n\r\n \r\n\r\nif(path.exists('input.txt')):\r\n sys.stdin.close()\r\n sys.stdout.close()", "def int_input():\r\n return map(int, input().split())\r\n\r\n\r\nn = int(input())\r\nmatr = [list(int_input()) for i in range(n)]\r\n\r\ngood = True\r\nfor row in range(n):\r\n nums = set(matr[row])\r\n for col in range(n):\r\n num = matr[row][col]\r\n if num == 1:\r\n continue\r\n cur_good = False\r\n for i in range(n):\r\n cur_good \|= num - matr[i][col] in nums\r\n good &= cur_good\r\n\r\nprint('Yes' if good else 'No')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef solve(A):\r\n n = len(A)\r\n for i in range(n):\r\n for j in range(n):\r\n if A[i][j] != 1:\r\n flag = False\r\n for k in range(n):\r\n for l in range(n):\r\n if A[i][k] + A[l][j] == A[i][j]:\r\n flag = True\r\n if flag == False:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(list(map(int, input().split())))\r\n if solve(A):\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n n = int(inp[0])\r\n l1 = [[int(i) for i in j.split()] for j in inp[1:]]\r\n l2 = list(zip(l1))\r\n for i in range(n):\r\n for j in range(n):\r\n if l1[i][j] != 1:\r\n if all(l1[i][j] - t not in l2[j][:i] + l2[j][i+1:] for t in l1[i][:j] + l1[i][j+1:]):\r\n return 'No'\r\n return 'Yes'\r\n\r\nprint(main())\r\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n mat = []\r\n for i in range(n):\r\n mat.append(list(map(int, stdin.readline().split())))\r\n for i in range(n):\r\n for j in range(n):\r\n st = True\r\n for u in range(n):\r\n for k in range(n):\r\n if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\r\n st = False\r\n break\r\n if not st: break\r\n if st:\r\n return False\r\n return True\r\n\r\n\r\nprint('Yes' if main() else 'No')\r\n", "n = int(input())\r\ntable = []\r\nfor i in range(n):\r\n table.append([int(x) for x in input().split(' ')])\r\nres = True\r\nfor x in range(n):\r\n for y in range(n):\r\n a = table[x][y]\r\n found = a == 1\r\n for s in range(n):\r\n for t in range(n):\r\n found = found or (table[x][s] + table[t][y] == a)\r\n res = res and found\r\nprint('Yes' if res else 'No')", "n = int(input())\nlaboratory = [[int(number) for number in input().split()] for _ in range(n)]\n\ndef get_row(i):\n return list(laboratory[i])\n\ndef get_col(i):\n return [laboratory[j][i] for j in range(n)]\n\ndef get_except(lst, i):\n return lst[:i] + lst[i+1:]\n\ndef good_lab():\n for i in range(n):\n for j in range(n):\n this_val = laboratory[i][j]\n if this_val != 1:\n row_vals = get_except(get_row(i), j)\n col_vals = get_except(get_col(j), i)\n if not any([this_val - r in col_vals for r in row_vals]):\n return False\n return True\n\nprint(\"Yes\") if good_lab() else print(\"No\")\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl3=list(map(int,input().split()))\r\n\tl.append(l3)\r\ndef f(l,n):\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif l[i][j]!=1:\r\n\t\t\t\tlx=[]\r\n\t\t\t\tfor k in range(n):\r\n\t\t\t\t\tl2=list(map(lambda x: x+l[k][j],l[i]))\r\n\t\t\t\t\tlx.extend(l2)\r\n\t\t\t\tif l[i][j] not in lx:\r\n\t\t\t\t\treturn \"No\"\r\n\treturn \"Yes\"\r\nprint(f(l,n))", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\nok = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n check = False\n for k in range(n):\n for l in range(n):\n if a[i][j] == a[i][k] + a[l][j]:\n check = True\n if check:\n break\n if check:\n break\n ok &= check\nprint(\"Yes\" if ok else \"No\")\n", "from itertools import chain\r\ni=lambda:[map(int,input().split())]\r\nn=i()[0]\r\na=[i()for _ in[0]n]\r\nb=[zip(a)]\r\nprint('NYOE S'[all(x<2 or any(x==y+z for y in a[i//n] for z in b[i%n]) for i,x in enumerate(chain(a)))::2])", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n k.append(list(map(int,input().split())))\r\nk1=tuple(zip(k))\r\nm=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k[i][j]!=1:\r\n g=False\r\n for l in k[i]:\r\n for z in k1[j]:\r\n if l+z==k[i][j]:\r\n m.append(1)\r\n g=True\r\n break\r\n if g:\r\n break\r\n else:\r\n m.append(1)\r\n\r\nif len(m)==nn:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n \r\n", "n = int(input())\r\nx = []\r\nfor i in range(n):\r\n x.append(list(map(int, input().split())))\r\n\r\nflag1 = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j] != 1:\r\n flag2 = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i or l != j:\r\n if x[k][j] + x[i][l] == x[i][j]:\r\n flag2 = True\r\n break\r\n if flag2:\r\n break\r\n if not flag2:\r\n flag1 = True\r\n print(\"no\")\r\n break\r\n if flag1:\r\n break\r\nif not flag1:\r\n print(\"yes\")\r\n", "n = int(input())\narr = [[int(x) for x in input().split()] for i in range(n)]\n\nres = True\nfor i in range(n):\n for j in range(n):\n if arr[i][j] == 1: continue\n\n val = False\n for a in range(n):\n x = arr[i][a]\n for b in range(n):\n y = arr[b][j]\n\n if x+y == arr[i][j]:\n val = True\n \n if not val:\n res = False\n\nif res: print(\"Yes\")\nelse: print(\"No\")", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n flag = False\r\n if a[i][j] != 1:\r\n for k in range(n):\r\n for l in range(n):\r\n if a[i][j] == a[k][j] + a[i][l]:\r\n ans += 1\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n else:\r\n ans += 1\r\nprint('Yes') if ans == n ** 2 else print('No')\r\n", "n, = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int,input().split())))\r\n\r\nrow=[ set() for _ in range(n)]\r\ncol = [set() for _ in range(n)]\r\n\r\ndata=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n data.append([arr[i][j],i,j])\r\ndata.sort()\r\n\r\nans = \"YES\"\r\nfor v,r,c in data:\r\n if v>1:\r\n for rt in row[r]:\r\n if v-rt in col[c]:\r\n break\r\n else:\r\n ans = \"NO\"\r\n break;\r\n row[r].add(v)\r\n col[c].add(v)\r\n\r\nprint(ans)", "n = int(input())\r\nd = []\r\nfor i in range(n):\r\n\td.append(list(map(int, input().split())))\r\nfl = True\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\te = d[i][j]\r\n\t\tif(e != 1):\r\n\t\t\ta = set()\r\n\t\t\tf = False\r\n\t\t\tfor i1 in range(n):\r\n\t\t\t\tif(i != i1):\r\n\t\t\t\t\ta.add(d[i1][j])\r\n\t\t\tfor j1 in range(n):\r\n\t\t\t\tif(j != j1):\r\n\t\t\t\t\tif(e - d[i][j1] in a):\r\n\t\t\t\t\t\tf = True\r\n\t\telse:\r\n\t\t\tf = True\r\n\t\tfl = f and fl\r\nif(fl):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a = [list(map(int, input().split())) for i in range(int(input()))]\nn = len(a)\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n found = False\n for i2 in range(n):\n for j2 in range(n):\n if a[i][j] == a[i][j2] + a[i2][j]:\n found = True\n if not found:\n print('No\\n')\n exit()\nprint('Yes')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]==1:\r\n continue\r\n exist=False\r\n for x in range(n):\r\n for y in range(n):\r\n if a[x][j]+a[i][y]==a[i][j]:\r\n exist=True\r\n break\r\n if exist:\r\n break\r\n if not exist:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n", "n = int(input())\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n tr = False\r\n for k in range(n):\r\n if a[i][j]-a[i][k] in [a[z][j] for z in range(n)]:\r\n tr = True\r\n break\r\n if not(tr):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n \r\n", "def d4c(lab, n):\r\n for i in range(n):\r\n for j in range(n):\r\n x = lab[i][j]\r\n if x == 1:\r\n continue\r\n f = 0\r\n for k in range(n):\r\n if k != i:\r\n for l in range(n):\r\n if l != j:\r\n if lab[i][l] + lab[k][j] == x:\r\n f = 1\r\n continue\r\n if f != 1:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nn = int(input())\r\nlab = []\r\nfor _ in range(n):\r\n lab.append(list(map(int, input().split())))\r\nprint(d4c(lab, n))", "n = int(input())\r\na = [list(map(int,input().split())) for i in range(n)]\r\nc,g = 0,0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j] !=1:\r\n\t\t\tc+=1\r\n\t\t\tf=0\r\n\t\t\tfor h in range(n):\r\n\t\t\t\tfor k in range(n):\r\n\t\t\t\t\tif a[i][j]==a[i][h]+a[k][j]:\r\n\t\t\t\t\t\tg+=1\r\n\t\t\t\t\t\tf=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif f==1:\r\n\t\t\t\t\tbreak\r\nprint(['No','Yes'][g==c])", "## 1.\r\n\r\nn = int(input())\r\nma = []\r\nans = True\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n ma.append(row)\r\nfor i in range(n):\r\n for j in range(n):\r\n if ma[i][j] != 1:\r\n find = False\r\n d = {}\r\n for x in range(n):\r\n if x != j:\r\n dif = ma[i][j] - ma[i][x]\r\n d[dif] = 1\r\n for x in range(n):\r\n if x != i and ma[x][j] in d:\r\n find = True \r\n if not find:\r\n ans = False\r\nif ans:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\ns = []\nfor k in range(n):\n s.append([int(i) for i in input().split()])\nt = 0\nfor i in range(n):\n for j in range(n):\n l = 0\n if s[i][j] !=1:\n for x in range(n):\n for y in range(n):\n if s[i][x]+ s[y][j] == s[i][j]:\n l = 1\n if not l:\n t = 1\nif t:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n = int(input())\r\nh = [[int(i) for i in input().split()] for j in range(n)]\r\ng = False\r\nfor i in range(len(h)):\r\n for j in range(len(h)):\r\n if h[i][j] != 1:\r\n s = h[i][j]\r\n g = False\r\n for o in range(n):\r\n a = h[i][o]\r\n for p in range(n):\r\n b = h[p][j]\r\n if (a + b) == s:\r\n g = True\r\n break\r\n if g:\r\n break\r\n else:\r\n print(\"No\")\r\n exit()\r\nprint(\"YES\")", "\r\ndef check(i,j):\r\n\tcur = tbl[i][j]\r\n\tif cur==1: return 1\r\n\tgood = 0\r\n\tfor k in range(n):\r\n\t\tif tbl[k][j]>=cur: continue\r\n\t\tfor l in range(n):\r\n\t\t\ttk = tbl[k][j]+tbl[i][l]\r\n\t\t\tif tk==cur:\r\n\t\t\t\tgood = 1\r\n\t\t\t\tbreak\r\n\treturn good\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\ntbl = []\r\nfor i in range(n):\r\n\ttbl.append([int(i) for i in input().split()])\r\n\r\nbr = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tisgood = check(i, j)\r\n\t\tif not isgood:\r\n\t\t\tbr = 1\r\n\t\t\tbreak\r\n\tif br: break\r\nif br:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')\r\n", "'''input\n3\n1 5 2\n1 1 1\n1 2 3\n'''\nn = int(input())\na = [list(map(int, input().split())) for _ in range(n)]\nb = list(zip(a))\nfor r in range(n):\n\tfor c in range(n):\n\t\tif a[r][c] != 1:\n\t\t\tif not any(a[r][c] - x in list(b[c]) for x in a[r]):\n\t\t\t\tprint(\"NO\")\n\t\t\t\tquit()\nprint(\"YES\")\n", "n=int(input())\r\na = []\r\nfor i in range(n): a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n t=1\r\n for x in range(n):\r\n for y in range(n):\r\n if a[i][x]+a[y][j]==a[i][j]:\r\n t=0\r\n if t:\r\n exit(print('No'))\r\nprint(\"Yes\")", "a=[];n=int(input());c=[];f=0;z1=[];j=-1\r\nfor _ in \" \"n:\r\n for i in map(int,input().split()):\r\n j+=1;z1+=[i]\r\n if i!=1:c+=[(f,j,i)]\r\n f+=1;a+=[z1];z1=[];j=-1\r\nfor _ in c:\r\n if not(any(a[_[0]][i]+a[j][_[1]]==_[2] for i in range(n) for j in range(n))):print(\"NO\");exit()\r\nprint(\"yes\")", "n = int(input())\r\ngrid = [[int(c) for c in input().split()] for _ in range(n)]\r\n\r\n\r\ndef has_sum(lst, target):\r\n memo = set()\r\n for e in lst:\r\n if e in memo:\r\n return True\r\n else:\r\n memo.add(target-e)\r\n return False\r\n\r\n\r\nfor r in range(n):\r\n for c in range(n):\r\n curr = grid[r][c]\r\n if curr != 1:\r\n row = [grid[r][cc] for cc in range(n) if cc != c]\r\n col = [grid[rr][c] for rr in range(n) if rr != r]\r\n found = False\r\n for rr in row:\r\n if not found:\r\n for cc in col:\r\n if rr + cc == curr:\r\n found = True\r\n break\r\n else:\r\n break\r\n if not found:\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')\r\n", "# cook your dish here\ndef main():\n N=int(input())\n A=[]\n import bisect\n for _ in range(N):\n A+=[list(map(int,input().strip().split(' ')))]\n check=1\n for i in range(N):\n if check==0:\n break\n for j in range(N):\n if check==0:\n break\n if A[i][j]!=1:\n temp=sorted(A[i])\n OK=0\n for k in range(N):\n remain=A[i][j]-A[k][j]\n if remain>0:\n if bisect.bisect_left(temp,remain)!=bisect.bisect_right(temp,remain):\n OK=1\n break\n if OK==0:\n check=0\n break\n\n\n\n if check==0:\n print('No')\n else:\n print('Yes')\nmain()", "n = int(input())\ngrid = [ [int(x) for x in input().split()] for _ in range(n)]\n\n\ndef check(x, y):\n\trow = set(grid[x][:y] + grid[x][y+1:])\n\tfor i in range(n):\n\t\tif i == x:\n\t\t\tcontinue\n\t\tif grid[x][y] - grid[i][y] in row:\n\t\t\treturn True\n\treturn False\n\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif grid[i][j] != 1 and not check(i, j):\n\t\t\tprint(\"NO\")\n\t\t\texit()\nprint(\"YES\")", "m = [list(map(int, input().split())) for _ in range(int(input()))]\r\nt, r = list(map(set, zip(m))), True\r\nfor row in m:\r\n r &= all(x < 2 or any(x - a in c for a in row) for x, c in zip(row, t))\r\nprint((\"No\", \"Yes\")[r])", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(j) for j in input().split()])\r\nif (n==1 and l[0][0]==1):\r\n print ('Yes')\r\nelif (n==1 and l[0][0]!=1):\r\n print ('No')\r\nelse:\r\n f=0\r\n for i in range(n):\r\n for j in range(n):\r\n flag=0\r\n if (l[i][j]!=1):\r\n for k in range(n):\r\n for m in range(n):\r\n if (k!=j or m!=j):\r\n if (l[i][j]== (l[k][j]+l[i][m])):\r\n flag=1\r\n break\r\n if (flag==1):\r\n break\r\n if (flag==0):\r\n f=1\r\n break\r\n if (f==1):\r\n break\r\n if (f==1):\r\n print ('No')\r\n else:\r\n print ('Yes')\r\n\r\n\r\n", "n=int(input().strip())\r\nmatrix=[]\r\nfor _ in range(n):\r\n matrix.append(list(map(int,input().strip().split())))\r\ndef check(matrix,n):\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]!=1:\r\n found=0\r\n for p in range(0,n):\r\n difference=matrix[i][j]-matrix[i][p]\r\n if found==1:\r\n break\r\n for q in range(n):\r\n if difference==matrix[q][j]:\r\n found=1\r\n break\r\n if found==0:\r\n return \"NO\"\r\n return \"Yes\"\r\nprint(check(matrix,n))\r\n", "def is_sum(i, j):\n\tv = l[i][j]\n\tfor k in range(i):\n\t\tif l[k][j] < v:\n\t\t\tif (v - l[k][j]) in l[i]:\n\t\t\t\treturn True\n\tfor k in range(i+1, n):\n\t\tif l[k][j] < v:\n\t\t\tif (v - l[k][j]) in l[i]:\n\t\t\t\treturn True\n\treturn False\n\ndef f(l):\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif l[i][j] != 1:\n\t\t\t\tif not is_sum(i, j):\n\t\t\t\t\treturn False\n\treturn True\n\nn = int(input())\nl = []\nfor _ in range(n):\n\tl.append(list(map(int, input().split())))\nif f(l):\n\tprint('Yes')\nelse:\n\tprint('No')\n", "#!/usr/bin/python\r\nimport random\r\nimport math\r\nimport sys\r\nn = int(input())\r\n\r\nl = [[0 for x in range(n)] for y in range(n)]\r\n\r\nfor i in range(0,n):\r\n t = [int(x) for x in input().split()]\r\n for j in range(0,n):\r\n l[i][j] = t[j]\r\nflag = 0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if l[i][j] != 1:\r\n flag = 0\r\n for k in range(0,n):\r\n if k == j:\r\n continue\r\n else:\r\n value = l[i][k]\r\n for s in range(0,n):\r\n if s == i:\r\n continue\r\n else:\r\n test = l[s][j]\r\n if value + test == l[i][j]:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n break\r\n if flag == 0:\r\n print (\"NO\")\r\n sys.exit()\r\n\r\nprint (\"YES\")\r\n", "def cal(a,i,j,n):\n for k in range(n):\n for kk in range(n):\n if a[i][j]==a[i][k]+a[kk][j]:\n return True\n return False\n \n\nn=int(input())\na=[]\nfor i in range(n):\n a.append([map(int,input().split())])\nfor i in range(n):\n for j in range(n):\n if a[i][j]!=1:\n if cal(a,i,j,n)==False:\n print(\"No\")\n exit()\nprint(\"Yes\")", "def bsearh(arr,val):\n\tarr.sort()\n\tmid=(n-1)//2\n\tl=0\n\tr=n-1\n\twhile(l<r):\n\t\tif(arr[mid]==val):\n\t\t\treturn 1\n\t\telif(arr[mid]<val):\n\t\t\tr=mid+1\n\t\telse:\n\t\t\tl=mid-1\n\treturn 0\n\nn=int(input())\narr=[]\nfor i in range(n):\n\tarr1=list(map(int,input().split()))\n\tarr.append(arr1)\nflag=0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif(arr[i][j]!=1):\n\t\t\tflag1=0\n\t\t\tfor k in range(n):\n\t\t\t\tfor l in range(n):\n\t\t\t\t\tif(arr[i][k]+arr[l][j]==arr[i][j]):\n\t\t\t\t\t\tflag1=1\n\t\t\t\t\t\tbreak\n\t\t\t\tif(flag1==1):\n\t\t\t\t\tbreak\n\t\t\tif(flag1==0):\n\t\t\t\tflag=1\n\t\t\t\tbreak\n\tif(flag!=0):\n\t\tbreak\nif(flag==0):\n\tprint('YES')\nelse:\n\tprint(\"NO\")", "n = int(input())\r\nrows = []\r\nfor x in range(n):\r\n string = input()\r\n row = string.split(\" \")\r\n for y in range(n):\r\n row[y] = int(row[y])\r\n rows.append(row)\r\ncolumns = []\r\nfor x in range(n):\r\n column = []\r\n for y in range(n):\r\n column.append(rows[y][x])\r\n columns.append(column)\r\nresults = \"Yes\"\r\nfor x in range(n):\r\n a = 0\r\n while a < n:\r\n r = rows[x][a]\r\n if r != 1:\r\n b = 0\r\n while b < n:\r\n c = columns[a][b]\r\n s = 0\r\n while s < n:\r\n t = rows[x][s]\r\n condition = b == x and s == y\r\n if c == r - t and not condition:\r\n break\r\n s += 1\r\n if s != n:\r\n break\r\n b += 1\r\n if b == n:\r\n break\r\n a += 1\r\n if a != n:\r\n results = \"No\"\r\n break\r\nprint(results)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n a.append(list_input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n continue\r\n found = False\r\n for p in range(n):\r\n for q in range(n):\r\n if a[i][p]+a[q][j] == a[i][j] and p != j and q != i:\r\n found = True\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\n\r\n", "n=int(input())\r\nM=[list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if M[i][j]!=1 :\r\n c=1\r\n for i1 in range(n) :\r\n for j1 in range(n) :\r\n if M[i][j]==M[i1][j]+M[i][j1] :\r\n c=0\r\n break\r\n if c==1 :\r\n print('No')\r\n exit()\r\n \r\nprint('Yes')\r\n \r\n \r\n \r\n", "n=input()\r\nn=int(n)\r\n\r\na=[]\r\nfor i in range(n):\r\n x=input().split()\r\n x=[int(p) for p in x]\r\n a.append(x)\r\n\r\ncan=True\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n p=False\r\n for ii in range(n):\r\n for jj in range(n):\r\n if a[i][jj]+a[ii][j]==a[i][j]:\r\n p=True\r\n if p==False:\r\n can=False\r\n\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def fin(s, row, column):\n\tfor i in row:\n\t\tfor j in column:\n\t\t\tif i+j == s:\n\t\t\t\treturn True\n\treturn False\n\nn = int(input())\na = []\nfor i in range(n):\n\tk = input().split(' ')\n\tk = list(map(int,k))\n\ta.append(k)\n\nans = True\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[i][j] == 1:\n\t\t\tcontinue\n\t\telse:\n\t\t\ts = a[i][j]\n\t\t\trow = a[i]\n\t\t\tcolumn = []\n\t\t\tfor t in range(n):\n\t\t\t\tcolumn.append(a[t][j])\n\t\t\tans = fin(s,row,column)\n\t\t\tif ans == False:\n\t\t\t\tbreak\n\tif ans == False:\n\t\tbreak\n\nif ans==True:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "n = int(input()); f = False\r\nm = [[int(x) for x in input().split()] for _ in n * ' ']\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] != 1:\r\n for s in range(i, i+1):\r\n for t in range(n):\r\n for l in range(n):\r\n for k in range(j, j+1):\r\n if m[s][t] + m[l][k] == m[i][j]:\r\n f = True; break\r\n else:\r\n f = False\r\n if f: break\r\n if f: break\r\n if f: break\r\n else:\r\n print('NO')\r\n if m[i][j] != 1 and (not f):\r\n break\r\n if m[i][j] != 1 and (not f):\r\n break\r\nelse:\r\n print('YES')", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\ndef check(x, y):\r\n for i in range(n):\r\n for j in range(n):\r\n if i != x and j != y and a[i][y] + a[x][j] == a[x][y]:\r\n return True\r\n return False\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1 and not check(i, j):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")", "from sys import exit\nn = int(input())\nl = []\nfor i in range(n):\n l.append(list(map(int, input().split())))\nfor i in range(n):\n for j in range(n):\n if l[i][j] != 1:\n flag = False\n for d in range(n):\n for k in range(n):\n if d != j and k != i and l[i][d] + l[k][j] == l[i][j]:\n flag = True\n if not flag:\n print(\"NO\")\n exit(0)\nprint(\"YES\")", "N = int(input())\r\nmatrix = []\r\nfor i in range(N):\r\n matrix.append(list(map(int, input().split())))\r\nfor x in range(N):\r\n for y in range(N):\r\n if matrix[x][y]!=1:\r\n for s in range(N):\r\n for t in range(N):\r\n if matrix[x][s]+matrix[t][y]==matrix[x][y]: break\r\n else: continue\r\n break\r\n else: print('No'); break\r\n else: continue\r\n break\r\nelse: print('Yes')\r\n", "#!/usr/bin/env python\n# -- coding: utf-8 --\n\nimport sys\n\n\ndef main():\n iterator = iter(sys.stdin.read().split())\n n = int(next(iterator))\n a = [[0] * n for _ in range(n)]\n for i in range(n):\n for j in range(n):\n a[i][j] = int(next(iterator))\n for i in range(n):\n for j in range(n):\n x = a[i][j]\n if x == 1:\n continue\n flag = False\n for p in range(n):\n for q in range(n):\n if a[i][p] + a[q][j] == x:\n flag = True\n if not flag:\n print('No')\n return\n print('Yes')\n\n\nif __name__ == '__main__':\n main()\n", "# A. Okabe and Future Gadget Laboratory\n\nn = int(input())\na = list()\n\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfound_bad = False\nfor i in range(n):\n if found_bad:\n break\n\n for j in range(n):\n\n target = a[i][j]\n\n if found_bad:\n break\n\n if target != 1:\n row = a[i].copy()\n del row[j]\n\n column = list()\n for k in range(n):\n if k != i:\n column.append(a[k][j])\n\n found_target = False\n for x in row:\n if found_target:\n break\n for y in column:\n if x + y == target:\n found_target = True\n break\n if not found_target:\n found_bad = True\n\nprint(\"Yes\" if not found_bad else \"No\")\n", "n = int(input())\r\n\r\nmat = []\r\nfor i in range(n):\r\n line = [int(x) for x in input().split()]\r\n mat.append(line)\r\n\r\ncheck1 = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if mat[i][j] != 1:\r\n check = 1\r\n for k in range(n):\r\n for t in range(n):\r\n if mat[i][t]+mat[k][j] == mat[i][j]:\r\n check = 0\r\n if check == 1:\r\n check1 = 0\r\n break\r\nif check1 == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "n = int(input())\nm = []\nfor _ in range(n):\n m.append(list(map(int, input().split())))\n\nans = True\nfor i in range(n):\n for j in range(n):\n if m[i][j] != 1:\n found = False\n for x in range(n):\n for y in range(n):\n if x != i and y != j and m[i][y] + m[x][j] == m[i][j]:\n found = True\n if not found:\n ans = False\nif ans:\n print('Yes')\nelse:\n print('No')\n \n", "import sys\r\n\r\ndef is_good(lab):\r\n n = len(lab)\r\n for i in range(n):\r\n for j in range(n):\r\n v = lab[i][j]\r\n if v > 1 and all(x + y != v for x in lab[i] for y in (lab[k][j] for k in range(n))):\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nlab = [[int(i) for i in input().split()] for _ in range(n)]\r\n\r\nprint('Yes' if is_good(lab) else 'No')\r\n", "n = int(input())\r\nmat = [list(map(int,input().split())) for i in range(n)]\r\nc = []\r\nfor i in range(n):\r\n c.append(set())\r\n for j in range(n):\r\n c[i].add(mat[j][i])\r\nans = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n curr = mat[i][j]\r\n if curr==1:continue\r\n for k in range(n):\r\n if curr-mat[i][k] in c[j]:\r\n break\r\n else:\r\n #print(curr,i,j)\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "I = lambda : map(int, input().split())\nn, = I()\narr = []\nfor i in range(0, n):\n arr.append(list(I()))\n\nfor x in range(0, n):\n for y in range(0, n):\n if arr[x][y] != 1:\n found = False\n for s in range(0, n):\n for t in range(0, n):\n if arr[x][y] == arr[x][s] + arr[t][y]:\n found = True\n if not found:\n print(\"No\")\n exit(0)\nprint(\"Yes\")", "n = int(input())\r\nl=[]\r\narr = []\r\nfor i in range(n):\r\n l = input().split()\r\n l = list(map(int, l)) \r\n arr.append(l)\r\n\r\n\r\n\r\ndef f(n,arr):\r\n for i in range(n):\r\n for j in range(n):\r\n if(arr[i][j]!=1):\r\n lst = [1 if(arr[i][j]== (arr[i][s] +arr[t][j])) else 0 for s in range(n) if s!=j for t in range(n) if t!=i]\r\n \r\n if(sum(lst)==0): \r\n return 'No'\r\n \r\n if(i==n-1 &j==n-1):\r\n return 'yes'\r\n\r\nprint(f(n,arr))", "def func(arr):\r\n for i in range(n):\r\n for j in range(n):\r\n if arr[i][j]!=1:\r\n check = 0\r\n for k in range(n):\r\n if arr[i][j]-arr[k][j] in arr[i]:\r\n check = 1\r\n break\r\n if check==0:\r\n return False\r\n return True\r\n \r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nif func(arr):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n lstTemp = list(map(int, input().split()))\r\n arr.append(lstTemp)\r\nok = True\r\nfor z in range(n):\r\n lst = arr[z]\r\n for tNumIndxRow in range(n):\r\n numTemp = lst[tNumIndxRow]\r\n if(numTemp > 1):\r\n okTemp = False\r\n for tNumIndxSameRow in range(n):\r\n if(tNumIndxRow != tNumIndxSameRow):\r\n tnr = lst[tNumIndxSameRow]\r\n for tNumIndxCol in range(n):\r\n if(z != tNumIndxCol):\r\n tnc = arr[tNumIndxCol][tNumIndxRow]\r\n tempAns = tnr + tnc\r\n if(tempAns == numTemp):\r\n okTemp = True\r\n break\r\n if(okTemp == True):\r\n break\r\n if(okTemp == False):\r\n ok = False\r\n break\r\n if(ok == False):\r\n break\r\nprint(\"YES\" if ok else \"NO\")", "def r():\r\n return list(map(int, input().split()))\r\nn = int(input())\r\nmatr = [r() for i in range(n)]\r\nans = True\r\ncolumns = list(map(set,zip(matr)))\r\nfor row in matr:\r\n\tans &= all(x == 1 or any(x - a in row for a in col) for x, col in zip(row, columns))\r\nprint(\"Yes\" if ans else \"No\")", "def solve(mat):\r\n for i in range(len(mat)):\r\n for j in range(len(mat)):\r\n if mat[i][j] != 1:\r\n can = False\r\n for k in range(len(mat)):\r\n for l in range(len(mat)):\r\n if mat[i][l] + mat[k][j] == mat[i][j]:\r\n can = True\r\n break\r\n if can:\r\n break\r\n if not can:\r\n print('No')\r\n return\r\n \r\n print('Yes')\r\n\r\nn = int(input())\r\nmat = [list(map(int, input().split())) for i in range(n)]\r\nsolve(mat)\r\n", "a=[];x=int(input())\r\nfor i in range(x):\r\n\ta.append(list(map(int,input().split())))\r\nfor i in range(x):\r\n\tb=[]\r\n\tfor t in range(x):\r\n\t\tk=-1\r\n\t\tif a[i][t]>1:\r\n\t\t\tb=[a[k][t] for k in range(x) if a[k][t]<a[i][t]]\r\n\t\t\tfor v in range(x):\r\n\t\t\t\tif a[i][v]<a[i][t] and a[i][t]-a[i][v] in b:\r\n\t\t\t\t\tk=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif k!=1:exit(print('No'))\r\nprint('YES')", "row = []\r\nmat = []\r\n\r\n\r\ndef finder(x,i,j):\r\n flag = 0\r\n for b in range(0,n):\r\n #print(mat[i][b])\r\n \r\n for a in range(0,n):\r\n if mat[i][b] + mat[a][j] == x:\r\n flag =1\r\n break\r\n \r\n if flag:\r\n break\r\n \r\n if flag:\r\n return 1\r\n else:\r\n return 0\r\n \r\n\r\nn = int(input()) \r\n\r\nfor i in range(0,n):\r\n row = [int(x) for x in input().split()]\r\n mat.append(row)\r\n\r\n#print(mat)\r\nans = 0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n #print(mat[i][j])\r\n if mat[i][j]!=1:\r\n ans = ans + finder(mat[i][j],i,j)\r\n else:\r\n ans = ans + 1\r\n\r\nif ans == nn :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n ", "import sys\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(el) for el in input().split()])\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n cnt += 1 \r\n continue\r\n for k in range(n):\r\n f = False\r\n for l in range(n):\r\n if a[i][k] + a[l][j] == a[i][j]:\r\n f = True\r\n break\r\n if f:\r\n cnt += 1\r\n break\r\n\r\nif n * n == cnt: \r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nT = [[] for i in range(n)]\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n T[i] = a\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if T[i][j] != 1:\r\n flag1 = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i and l != j and T[i][j] == T[k][j] + T[i][l]:\r\n flag1 = True\r\n\r\n if not flag1:\r\n flag = False\r\n\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\nmat = []\nfor i in range(n):\n a = [int(x) for x in input().split()]\n mat.append(a)\n\nisp = 1\nfor i in range(n):\n for j in range(n):\n if mat[i][j] == 1:\n continue\n isb = 0\n for k in range(n):\n for m in range(n):\n if mat[i][j] == mat[i][k] + mat[m][j]:\n isb = 1\n if isb == 0:\n isp = 0\n break\n\nif(isp > 0):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]==1:\r\n\t\t\tcontinue\r\n\t\tval = False\r\n\t\tfor k in range(n):\r\n\t\t\tfor l in range(n):\r\n\t\t\t\tif (a[i][k]+a[l][j]==a[i][j]):\r\n\t\t\t\t\tval = True\r\n\t\tif val==False:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit(0)\r\nprint(\"Yes\")\r\n\t\t\t\t\r\n\t\t\r\n", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn = int(input())\r\nL = [[int(x) for x in input().split()] for _ in range(0, n)]\r\n\r\nvalid = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if L[i][j] != 1 :\r\n found = False\r\n for a in range(n) :\r\n for b in range(n) :\r\n if L[i][b] + L[a][j] == L[i][j]: found = True\r\n if (not found) : valid = False\r\n\r\nif valid : print(\"YES\")\r\nelse : print(\"NO\")\r\n\r\n\r\n", "#!/usr/bin/env python3\nimport sys\n\ndef main():\n n = int(sys.stdin.readline())\n mat = [None for __ in range(n)]\n for indx in range(n):\n mat[indx] = list(map(int, sys.stdin.readline().split()))\n\n good = True\n for row in range(n):\n for col in range(n):\n if mat[row][col] == 1:\n continue\n else:\n good &= check_this_element(mat, row, col)\n if good:\n print(\"Yes\")\n else:\n print(\"No\")\n\ndef check_this_element(mat, row, col):\n n = len(mat)\n for _row in range(n):\n for _col in range(n):\n if mat[_row][col] + mat[row][_col] == mat[row][col]:\n return True\n return False\n\nif __name__ == '__main__':\n main()\n", "m = []\nfor i in range(int(input())):\n m.append(list(map(int, input().split())))\n\ndef solve():\n for row in range(len(m)):\n for column in range(len(m)):\n if m[row][column] == 1:\n continue\n\n r = set(m[row])\n r.remove(m[row][column])\n c = set()\n for i in range(len(m)):\n c.add(m[i][column])\n c.remove(m[row][column])\n\n found = False\n for item in r:\n if m[row][column] - item in c:\n found = True\n break\n if not found:\n return \"No\"\n return \"Yes\"\n \nprint(solve())", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\nans = \"Yes\"\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] > 1:\r\n can_make = 0\r\n for k in range(n):\r\n for q in range(n):\r\n if a[i][k] + a[q][j] == a[i][j]:\r\n can_make = True\r\n\r\n if not can_make:\r\n ans = \"No\"\r\n\r\nprint(ans)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\n\r\n\r\ndef get_x(i, n, arr):\r\n return arr[i][n]\r\n\r\n\r\ndef get_y(j, n, arr):\r\n return arr[n][j]\r\n\r\n\r\ndef is_good(i, j, arr, n):\r\n for k in range(n):\r\n for p in range(n):\r\n if (get_x(i, k, arr)+get_y(j, p, arr)) == arr[i][j] and (j != k and i != p):\r\n return True\r\n return False\r\nres = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if is_good(i, j, arr, n) or arr[i][j]==1:\r\n pass\r\n else:\r\n res =\"NO\"\r\n\r\n\r\n\r\nprint(res)", "def main():\n n = int(input())\n l = list(list(map(int, input().split())) for _ in range(n))\n cols = list(map(set, zip(l)))\n for row in l:\n for t, col in zip(row, cols):\n if t != 1:\n for a in row:\n if t - a in col:\n break\n else:\n print(\"No\")\n return\n print(\"Yes\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\nans = \"Yes\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] != 1:\r\n tf = False\r\n for s in range(n):\r\n for t in range(n):\r\n if m[i][s] + m[t][j] == m[i][j]:\r\n tf = True\r\n break\r\n if not tf:\r\n ans = \"No\"\r\n break\r\n if ans == \"No\":\r\n break\r\nprint(ans)\r\n", "def is_good(matrix, n, i, j):\n if matrix[i][j] == 1:\n return True\n\n row = [matrix[i][s] for s in range(n) if s != j]\n col = [matrix[t][j] for t in range(n) if t != i]\n\n for r in row:\n for c in col:\n if r + c == matrix[i][j]:\n return True\n\n return False\n\n\ndef main():\n n = int(input())\n matrix = [[]] n\n\n for i in range(n):\n matrix[i] = [int(_) for _ in input().split()]\n\n found = False\n\n for i in range(n):\n if found:\n break\n\n for j in range(n):\n if found:\n break\n\n found = not is_good(matrix, n, i, j)\n\n print('No' if found else 'Yes')\n\n\nif __name__ == '__main__':\n main()\n", "def run(a,n):\r\n flag = 0\r\n for i in range(n):\r\n for j in range(n):\r\n flag = 0\r\n if a[i][j]==1:\r\n flag=1\r\n for p in range(n):\r\n for q in range(n):\r\n if a[i][p]+a[q][j]==a[i][j]:\r\n flag = 1\r\n if flag!=1:\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n \r\nn = int(input())\r\na=[]\r\nfor _ in range(n):\r\n a.append(list(map(int,input().split())))\r\nrun(a,n)\r\n\r\n", "def check(grid, i, j, n):\r\n for ii in range(n):\r\n for jj in range(n):\r\n if grid[i][j] == grid[ii][j] + grid[i][jj]:\r\n return True\r\n return False\r\n\r\n\r\nn, grid, flag = int(input()), list(), 0\r\nfor i in range(n):\r\n grid.extend([list(map(int, input().split()))])\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] != 1:\r\n if check(grid, i, j, n) is False:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from itertools import \nn=int(input())\nf=[list(map(int,input().split())) for _ in range(n)]\nfor i,j in product(range(n),range(n)):\n x=f[i][j]\n if x==1: continue\n if not any(a+b==x for a, b in product(chain(f[i][:j], f[i][j+1:]),(f[k][j] for k in chain(range(i), range(i+1,n))))):\n print(\"No\")\n exit(0)\nprint(\"Yes\")\n", "n = int(input())\r\nL = [list(map(int, input().split())) for _ in range(n)]\r\nfor i, X in enumerate(L):\r\n for j, Y in enumerate(X):\r\n if Y == 1 or any(Y - L[t][j] in X for t in range(n)): continue\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "n = int(input())\r\nl = []\r\n\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n l.append(a)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j] != 1 :\r\n flag = 0\r\n for x in range(n):\r\n for y in range(n):\r\n if l[i][j] == l[i][x] + l[y][j]:\r\n flag +=1\r\n\r\n if flag == 0 :\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nanswer = \"Yes\"\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1:\n continue\n cur = \"No\"\n for c in range(n):\n for k in range(n):\n if a[c][j] + a[i][k] == a[i][j]:\n cur = \"Yes\"\n if cur == \"No\":\n answer = \"No\"\nprint(answer)\n", "\r\nn = int(input())\r\n\r\nrows = cols = n\r\n\r\nlab_mat = [[0 for i in range(cols)] for j in range(rows)]\r\n\r\n\r\nfor i in range(rows):\r\n row_input = input().split()\r\n for j in range(cols):\r\n lab_mat[i][j] = int(row_input[j])\r\n\r\n\r\ndef column(matrix, i):\r\n return [row[i] for row in matrix]\r\n\r\ngood_flag = [[False for i in range(cols)] for j in range(rows)]\r\n\r\nfor i in range(rows):\r\n\r\n for j in range(cols):\r\n\r\n element = lab_mat[i][j]\r\n\r\n if element == 1:\r\n good_flag[i][j] = True\r\n continue\r\n else:\r\n\r\n for x in lab_mat[i]:\r\n\r\n for y in column(lab_mat, j):\r\n if element == x + y:\r\n good_flag[i][j] = True\r\n break\r\n\r\n if not good_flag:\r\n good_flag[i][j] = False\r\n break\r\n\r\nflag_sum = 0\r\nfor i in range(rows):\r\n for j in range(cols):\r\n flag_sum += good_flag[i][j]\r\n\r\nif flag_sum == n * 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n=int(input());a=[]\r\nfor i in range(n):a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n r=0\r\n for k in range(n):\r\n for l in range(n):\r\n if a[i][k]+a[l][j]==a[i][j]:r=1\r\n if r==0:print('No');exit()\r\nprint(\"Yes\")", "# Uses python3\r\nfrom sys import stdin, stdout\r\nimport cProfile\r\n\r\nprintHeap = str()\r\ntest = False\r\nmemory_constrained = False\r\n\r\n\r\ndef display(string_to_print):\r\n stdout.write(str(string_to_print) + \"\\n\")\r\n\r\n\r\ndef test_print(output):\r\n if test:\r\n stdout.write(str(output) + \"\\n\")\r\n\r\n\r\ndef display_list(list1, sep=\" \"):\r\n stdout.write(sep.join(map(str, list1)) + \"\\n\")\r\n\r\n\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\nmemory = dict()\r\n\r\n\r\ndef clear_cache():\r\n global memory\r\n memory = dict()\r\n\r\n\r\ndef cached_fn(fn, args):\r\n global memory\r\n if args in memory:\r\n return memory[args]\r\n else:\r\n result = fn(args)\r\n memory[args] = result\r\n return result\r\n\r\n\r\n# ----------------------------------------------------------------------------------- MAIN PROGRAM\r\nimport math, copy\r\n\r\n\r\ndef calc(a, b, op):\r\n return a-b if op==\"-\" else a+b if op == \"+\" else ab if (op==\"X\" or op==\"\") else a//b\r\n\r\n\r\ndef chkGood(arr,i,j,n):\r\n g = False\r\n for i1 in range(n):\r\n if g: break\r\n if i1==i: continue\r\n for j1 in range(n):\r\n if j1==j: continue\r\n if arr[i1][j] + arr[i][j1] == arr[i][j]:\r\n g = True\r\n break\r\n return g\r\n\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n arr = [[0 for _ in range(n)] for _ in range(n)]\r\n for i in range (n):\r\n arr[i] = get_list()\r\n good = True\r\n for i in range (n):\r\n if not good: break\r\n for j in range(n):\r\n ele = arr [i][j]\r\n if ele!=1:\r\n if not chkGood(arr,i,j,n):\r\n good = False\r\n break\r\n print (\"Yes\") if good else print(\"No\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n# --------------------------------------------------------------------------------------------- END\r\n\r\n\r\ncProfile.run('main()') if test else main()", "n = int(input())\r\nlab = [[int(s) for s in input().split(' ')] for i in range(n)]\r\ndb = False\r\nfor i in range(n):\r\n if db:\r\n break\r\n for j in range(n):\r\n elem = lab[i][j]\r\n if elem == 1:\r\n answer = True\r\n else:\r\n answer = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i and l != j and lab[i][l] + lab[k][j] == elem:\r\n answer = True\r\n if not answer:\r\n db = True\r\n break\r\nif answer:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans = ans + 1\r\n continue\r\n ans += 1 + min(abs(a[i][j] - a[i][k] - a[t][j]) for k in range(0, n) for t in range(0, n))\r\nif ans == n * n:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int, input().split())))\r\nx=1\r\nfor i in range(n):\r\n if x==-1:break\r\n for j in range(n):\r\n if x==-1: break\r\n if l[i][j]!=1:\r\n c=0\r\n for k in range(n):\r\n for m in range(n):\r\n\r\n if l[k][j]+l[i][m]==l[i][j]:\r\n c=1\r\n break\r\n break\r\n if c==0: \r\n x=-1\r\nif x==-1: print(\"No\")\r\nelse: print(\"Yes\")\r\n ", "def findSum(n, r,c, lim, grid):\r\n for i in range(lim):\r\n for j in range(lim):\r\n if grid[r][i] + grid[j][c] == n: return True\r\n\r\n return False\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n grid = []\r\n \r\n for i in range(n):\r\n grid.append([ int(n) for n in input().split()])\r\n \r\n \r\n for r in range(n):\r\n for c in range(n):\r\n if grid[r][c] == 1: continue\r\n if not findSum(grid[r][c], r, c, n,grid):\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = [[int(i) for i in input().split()] for _ in range(n)]\r\nb = [set(a[i]) for i in range(n)]\r\nif all(all(a[i][j] == 1 or any(a[i][j] - a[k][j] in b[i] for k in range(n)) for j in range(n)) for i in range(n)):\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "\r\nn=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\ns=list(map(set,a))\r\nflag=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]!=1:\r\n\t\t\tf=0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tif a[i][j]-a[k][j] in s[i]:\r\n\t\t\t\t\tf=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif f==0:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\tif flag==1:\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "n = int(input())\na = []\ni = 0\nwhile i < n :\n temp = list(map(int,input().strip().split(' ')))\n a.append(temp)\n i+=1\ncount = 0\nskipLoop = False\nfor i in range(0,n):\n for j in range(0,n):\n if a[i][j] == 1:\n count += 1\n else:\n for k in range(0,n):\n for l in range(0,n):\n if l != i and j != k:\n if a[i][k] + a[l][j] == a[i][j]:\n count += 1\n skipLoop = True\n break\n if skipLoop:\n skipLoop = False\n break\nif count == nn:\n print(\"Yes\")\nelse:\n print(\"No\")\n \n \n ", "n = int(input())\nA = [list(map(int, input().split())) for _ in range(n)]\n\ndef hasSum(col,row,x):\n for y in col:\n for z in row:\n if y + z == x:\n return True\n return False\n\ndef solve(n,A):\n for i in range(n):\n for j in range(n):\n x = A[i][j]\n if x != 1:\n col = [row[j] for row in A]\n row = A[i]\n if not hasSum(col,row, x):\n print('No')\n return\n print('Yes')\n\n\n\nsolve(n,A)", "# python 3.5.2 @ameniawy\r\n\r\nn = int(input())\r\nlab = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef check(i, j):\r\n val = lab[i][j]\r\n for p in range(n):\r\n row = lab[i][p]\r\n for q in range(n):\r\n if val == row + lab[q][j]:\r\n return True\r\n return False\r\n\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if lab[i][j] != 1:\r\n if not check(i, j):\r\n flag = False\r\n break\r\nprint(\"Yes\") if flag else print(\"No\")", "n = int(input())\r\nflag = False\r\nA = [0] n \r\nfor i in range(n):\r\n\tA[i] = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i][j] == 1:\r\n continue\r\n for x in range(n):\r\n for y in range(n):\r\n if A[i][y] + A[x][j] == A[i][j]:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n print(\"No\")\r\n exit(0)\r\n flag = False\r\nprint(\"Yes\")\r\nexit(0)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nt=True\r\ni=0\r\nwhile i<n and t:\r\n j=0\r\n while j<n and t:\r\n s=0\r\n q=False\r\n while s<n and t and not q:\r\n r=0\r\n while r<n and t and not q:\r\n if a[i][j]==a[i][s]+a[r][j] and a[i][j]!=1:\r\n q=True\r\n elif a[i][j]==1:\r\n q=True\r\n r+=1\r\n s+=1\r\n if q==False:\r\n t=False\r\n j+=1\r\n i+=1\r\n\r\nif t==True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] != 1:\r\n found = False\r\n for k in range(n):\r\n for l in range(n):\r\n if grid[i][j] == grid[i][k] + grid[l][j]:\r\n found = True\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\n", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]!=1:\r\n\t\t\tvalue = False\r\n\t\t\tfor i1 in range(n):\r\n\t\t\t\tfor j1 in range(n):\r\n\t\t\t\t\tif a[i][j1]+a[i1][j]==a[i][j]:\r\n\t\t\t\t\t\tvalue = True\r\n\t\t\tif value == False:\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint(\"Yes\")", "\r\ndef checker(x,n,a,b):\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif a[i]+b[j]==x:\r\n\t\t\t\treturn True\r\n\t\t\telse:\r\n\t\t\t\tcontinue\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tl.append(a)\r\nz=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tx=l[i][j]\r\n\t\tb=l[i]\r\n\t\tc=[]\r\n\t\tfor k in range(n):\r\n\t\t\tc.append(l[k][j])\r\n\t\tif x==1:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif checker(x,n,b,c):\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tz=1\r\n\t\t\t\tbreak\r\n\tif z==1:\r\n\t\tbreak\r\nif z==1:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")\r\n", "\r\n\r\nn = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n\r\nans = True\r\n\r\nfor i in range(n):\r\n if not ans:\r\n break\r\n\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n continue\r\n\r\n flag = False\r\n\r\n for s in range(n):\r\n for t in range(n):\r\n if a[i][j] == a[i][s] + a[t][j]:\r\n flag = True\r\n\r\n if not flag:\r\n ans = False\r\n # print(i, j)\r\n break\r\n\r\n\r\nif ans:\r\n print('Yes')\r\n\r\nelse:\r\n print('No')", "n = int(input())\ntbl = []\nfor i in range(n):\n tbl.append(list(map(int, input().split())))\n\nout = False\nfor i, row in enumerate(tbl):\n for j in range(len(row)):\n out = False\n e = row[j]\n if e == 1:\n out = True\n continue\n for j1, e1 in enumerate(row):\n if j1 != j:\n for i1 in range(n):\n if e1 + tbl[i1][j] == e:\n out = True\n break\n if out:\n break\n if not out:\n print('No')\n break\n if not out:\n break\nif out:\n print('Yes')", "def is_good_lab():\n for x in range(num):\n for i in range(num): \n if lab[x][i]!=1:\n sum_found = False\n for j in range(num):\n sum_found = False\n # print (str(lab[x][i]) + \" - \" + str(lab[j][i]) + \" = \" + str(mapa[x]))\n if str(lab[x][i]-lab[j][i]) in mapa[x]:\n sum_found = True\n break\n if not sum_found:\n return False\n \n return True\n\nnum = int(input())\nlab = [[0 for x in range(num)] for y in range(num)] \nt=0\nmapa = {}\nfor i in range(num):\n row = input()\n row = row.split(' ')\n mapa[i] = {}\n for n, value in enumerate(row):\n lab[i][n] = int(value)\n mapa[i][value] = ''\n\nprint(\"Yes\" if is_good_lab() else \"No\")\n\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/821/A\n\nn = int(input())\n\nl_r = list()\nfor _ in range(n):\n l_r.append([int(x) for x in input().split()])\n\nl_s_c = list(set() for _ in range(n))\nl_s_r = list(set() for _ in range(n))\n\nfor i in range(n):\n for j in range(n):\n l_s_c[j].add(l_r[i][j])\n l_s_r[i].add(l_r[i][j])\n\nfor i in range(n):\n for j in range(n):\n if l_r[i][j] == 1:\n continue\n\n f = False\n for v in l_s_c[j]:\n if l_r[i][j] - v in l_s_r[i]:\n f = True\n break\n if not f:\n print(\"No\")\n quit()\nprint(\"Yes\")", "n=int(input())\r\na=[list(map(int, input().split())) for i in range(n)]\r\n#print(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n val=0\r\n if(a[i][j]==1):\r\n continue\r\n for k in range(n):\r\n for l in range(n):\r\n if(a[i][j]==a[i][k]+a[l][j]):\r\n val=1\r\n break\r\n if val:\r\n break\r\n if not val:\r\n print(\"No\")\r\n exit(0)\r\n \r\n \r\nprint(\"Yes\")\r\n", "def solve(n, m):\n for i in range(n):\n line = m[i]\n for j in range(n):\n if m[i][j] == 1: continue\n column = [m[k][j] for k in range(n)]\n found = False\n for k in line:\n for t in column:\n if k + t == m[i][j]:\n found = True\n break\n if found: break\n if not found: return \"No\"\n return \"Yes\"\n\n\ndef main():\n n = int(input())\n m = [list(map(int, input().split())) for _ in range(n)]\n print(solve(n, m))\n\n\nmain()\n", "n = int(input())\r\nm = [list(map(int, input().split())) for i in range(n)]\r\nfl = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] == 1:\r\n continue\r\n cur = []\r\n for x in range(n):\r\n for y in range(n):\r\n if j == x or y == i:\r\n continue\r\n cur.append(m[i][x] + m[y][j])\r\n if m[i][j] not in cur:\r\n fl = 0\r\nif fl:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\nfl=[list(map(int,input().split())) for i in range(n)]\nok=True\nfor i in range(n):\n for j in range(n):\n if fl[i][j]!=1:\n sok=False\n k=m=0\n while not sok and (k<n):\n m=0\n while not sok and (m<n):\n sok=(j!=m)and(i!=k)and(fl[i][j]==fl[k][j]+fl[i][m])\n m+=1\n k+=1\n ok=sokok\nif ok:\n print('Yes')\nelse:\n print('No')\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nans = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] != 1:\r\n chk = False\r\n for k in range(n):\r\n for l in range(n):\r\n if data[i][k] + data[l][j] == data[i][j]:\r\n chk = True\r\n break\r\n if not chk:\r\n ans = False\r\n break\r\n\r\nprint(\"YES\" if ans else \"NO\")", "n = int(input())\r\nlab = []\r\n\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n lab.append([])\r\n for j in range(n):\r\n lab[i].append(line[j])\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n x = lab[i][j]\r\n if x != 1:\r\n local_flag = False\r\n for a in [lab[i][y] for y in range(n)]:\r\n for b in [lab[y][j] for y in range(n)]:\r\n if x == a + b:\r\n local_flag = True\r\n if not local_flag:\r\n flag = False\r\n\r\nprint('Yes') if flag else print('No')\r\n", "n = int(input())\r\n\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\ndata_t = [[0] n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n data_t[j][i] = data[i][j]\r\n\r\ndef sums(row1, row2):\r\n result = []\r\n for v1 in row1:\r\n for v2 in row2:\r\n result.append(v1 + v2)\r\n return result\r\n\r\nfail = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] == 1:\r\n continue \r\n #print('i', i, 'j', j, data[i][j], data[i], data_t[j], sums(data[i], data_t[j]))\r\n if data[i][j] not in sums(data[i], data_t[j]):\r\n fail = True\r\n break\r\n if fail:\r\n break\r\n\r\nprint(('Yes', 'No')[fail])\r\n", "cases = int(input())\r\nn = cases\r\nmatrix = []\r\nwhile cases:\r\n cases -= 1\r\n row = list(map(int, input().split()))\r\n\r\n matrix.append(row)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] == 1:\r\n continue\r\n broken = False\r\n for k in range(n):\r\n for m in range(n):\r\n if matrix[i][k] + matrix[m][j] == matrix[i][j]:\r\n broken = True\r\n if not broken:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n", "N = int(input())\ntable = []\nfor i in range(N):\n table.append(list(map(int, input().split())))\n\nfor i in range(N):\n for j in range(N):\n if table[i][j] == 1:\n continue\n flg = False\n for s in range(N):\n for t in range(N):\n if table[i][j] == table[i][s] + table[t][j]:\n flg = True\n break\n if not flg:\n print(\"No\")\n exit()\nprint(\"Yes\")\n", "# Time : 2017-6-26 10:30\r\n# Auther : Anjone\r\n# URL : http://codeforces.com/contest/821/problem/A\r\nn = int(input())\r\narr = [ list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif( arr[i][j] != 1):\r\n\t\t\tcnt = 0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor l in range(n):\r\n\t\t\t\t\tif(arr[i][k] + arr[l][j] == arr[i][j]):\r\n\t\t\t\t\t\tcnt += 1\r\n\t\t\tif(cnt == 0):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint (\"Yes\")", "n = int(input())\r\naij = [list(map(int,input().split())) for i in range(n)]\r\nans = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if aij[i][j] != 1:\r\n flag = 0\r\n for i2 in range(n):\r\n for j2 in range(n):\r\n if i2 != i and j2 != j and aij[i2][j] + aij[i][j2] == aij[i][j]:\r\n flag = 1\r\n \r\n if flag == 0:\r\n ans = \"NO\"\r\nprint(ans)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n mat = [[z for z in map(int,x.split())] for x in wtf[1:]]\r\n ans = 0\r\n for i in range(n):\r\n if ans == -1:\r\n break\r\n for j in range(n):\r\n if mat[i][j] != 1:\r\n f = False\r\n for l in range(n):\r\n if l != i:\r\n if mat[i][j]-mat[l][j] in mat[i]:\r\n f = True\r\n break\r\n if f is False:\r\n ans = -1\r\n print('Yes' if ans == 0 else 'No')\r\n", "def isClean(n, grid, rows, cols):\n for i in range(n):\n for j in range(n):\n idx = in+j\n if grid[idx] != 1:\n isValid = False\n for row_v in rows[i]:\n if grid[idx]-row_v in cols[j]:\n isValid = True\n break\n if not isValid:\n print('No')\n return\n print('Yes')\n\nn = int(input().strip())\ngrid = []\nfor i in range(n):\n row = list(map(int, input().strip().split(' ')))\n grid.extend(row)\n\nrows = [set() for _ in range(n)]\ncols = [set() for _ in range(n)]\n\nfor i in range(n):\n for j in range(n):\n idx = in+j\n rows[i].add(grid[idx])\n cols[j].add(grid[idx])\n\nisClean(n, grid, rows, cols)\n", "n = int(input())\nlab = list()\nfor _ in range(n):\n\tlab.append(list(map(int, input().split())))\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif lab[i][j] != 1:\n\t\t\tfor k in range(n):\n\t\t\t\tif lab[i][j] - lab[k][j] in lab[i]:\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tprint(\"No\")\n\t\t\t\texit()\n\nprint(\"Yes\")\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n grid.append([int(x) for x in input().split()])\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 1:\r\n continue\r\n found = False\r\n for x in range(n):\r\n for y in range(n):\r\n if grid[i][x] + grid[y][j] == grid[i][j]:\r\n found = True\r\n break\r\n if not found:\r\n print(\"No\")\r\n exit()\r\n \r\nprint(\"Yes\")", "import sys\n\ndef main(input):\n n = int(next(input))\n matrix = []\n for _ in range(n):\n matrix.append(list(map(int, next(input).split())))\n \n failed = False\n for i in range(n):\n for j in range(n):\n if matrix[i][j] == 1:\n continue\n found = False\n for x in range(n):\n for y in range(n):\n if matrix[i][x] + matrix[y][j] == matrix[i][j]:\n found = True\n if not found:\n failed = True\n print('Yes' if not failed else 'No')\nif __name__ == '__main__':\n main(iter(sys.stdin.readlines()))", "def check(r, c, x):\n rtn = False\n rs = [a[r][i] for i in range(n) if i != c]\n cs = [a[i][c] for i in range(n) if i != r]\n for r in rs:\n for c in cs:\n if r + c == x:\n rtn = True\n break\n return rtn\n\nn = int(input())\na = [list(map(int, input().split()))for _ in range(n)]\n\nans = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n ans &= check(i, j, a[i][j])\n\nprint('Yes' if ans else 'No')\n", "from sys import \r\nn=int(input())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j]>1:\r\n a=0\r\n for ii in range(n):\r\n for jj in range(n):\r\n if l[i][jj]+l[ii][j]==l[i][j]:\r\n a+=1\r\n \r\n break\r\n if a: break\r\n else:\r\n print(\"No\"); exit()\r\nprint(\"Yes\")", "n=int(input())\r\nA=[]\r\nfor i in range(n):\r\n A += [list(map(int,input().split()))]\r\n\r\nv=True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i][j] != 1:\r\n f = False\r\n for x in range(n):\r\n for y in range(n):\r\n if A[x][j] + A[i][y]==A[i][j]:\r\n f = True\r\n break\r\n if f: break\r\n if not f:\r\n v = False\r\n break\r\n if not v: break\r\nif v:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "def main():\n read = lambda: tuple(map(int, input().split()))\n R = range(read()[0])\n m = [read() for i in R]\n b, d = 0, 0\n for x in R:\n for y in R:\n if m[y][x] > 1:\n b += 1\n f = False\n for t in R:\n if f: break\n for s in R:\n if m[y][x] == m[y][s] + m[t][x]:\n d += 1\n f = True\n break\n \n print(\"Yes\" if b == d else \"No\")\nmain()\n", "import sys\n\ndef find(l, c, v):\n\tfor li in range(n):\n\t\tfor co in range(n):\n\t\t\tif not (co == c and li == l):\n\t\t\t\tif labo[li][c] + labo[l][co] == v:\n\t\t\t\t\treturn True\n\treturn False\n\nn = int(sys.stdin.readline())\n\nlabo = [list(map(int, sys.stdin.readline().split()))for loop in range(n)]\ncontinuer = True\nfor l in range(n):\n\tif continuer:\n\t\tfor c in range(n):\n\t\t\tif continuer:\n\t\t\t\tif labo[l][c] != 1:\n\t\t\t\t\tif not find(l, c, labo[l][c]):\n\t\t\t\t\t\tcontinuer = False\nif continuer:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "import sys \n\ndef main():\n n = int(input())\n x = []\n for i in range(n):\n y = list(map(int,sys.stdin.readline().split()))\n x.append(y)\n\n for i in range(n):\n for j in range(n):\n if x[i][j] == 1:\n continue\n found = False\n for o in range(n):\n a = x[i][o]\n if o == j:\n continue\n for p in range(n):\n if p ==i:\n continue\n b = x[p][j]\n if a+b == x[i][j]:\n found = True\n break\n if found:\n break\n if not found:\n print(\"No\")\n return\n print(\"Yes\")\n \n\nmain()\n", "read = lambda: map(int, input().split())\nn = int(input())\na = [list(read()) for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n for k in range(n):\n if a[i][j] - a[k][j] in a[i]:\n break\n else:\n print('No')\n exit()\nprint('Yes')", "def transpose(a):\r\n b=[i[:] for i in a]\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):b[i][j]=a[j][i]\r\n return b\r\n\r\nn=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\nat=transpose(a)\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j]!=1:\r\n sum=[k+l for k in a[i] for l in at[j]]\r\n if a[i][j] not in sum:\r\n print('NO')\r\n exit()\r\nprint('YES')", "from collections import Counter, deque, defaultdict\nimport math, sys\ninput = sys.stdin.readline\n\n\ndef check(r, c, grid, n):\n total = grid[r][c]\n for i in range(n):\n num1 = grid[i][c]\n # grid[i]\n for j in range(n):\n num2 = grid[r][j]\n if num2 + num1 == total:\n return True\n return False\n\n\n\nn = int(input())\ngrid = [list(map(int, input().split())) for i in range(n)]\n\nans = True\nfor i in range(n):\n for j in range(n):\n if grid[i][j] != 1:\n ans &= check(i, j, grid, n)\nprint(\"YES\" if ans else \"NO\")\n\n \n\n\n\n", "n = int(input())\r\nw = []\r\nfor _ in range(n):\r\n w += list(map(int, input().split()))\r\n\r\nans = \"YES\"\r\nfor i in range(nn):\r\n if w[i] != 1:\r\n c = 0\r\n for j in range(i-i%n, i-i%n+n):\r\n if j != i:\r\n for k in range(i%n, n*n, n):\r\n if k != i:\r\n if w[j] + w[k] == w[i]:\r\n c += 1\r\n if c == 0:\r\n ans = \"NO\"\r\n break\r\n\r\nprint(ans)\r\n", "#! python3\n\ndef is_good(a, n, i, j):\n c = set([])\n for x in range(n):\n c.add(a[i][j] - a[i][x])\n for x in range(n):\n if a[x][j] in c:\n return True\n return False\n\nn = int(input())\na = []\nfor _ in range(n):\n a.append([int(x) for x in input().strip().split(' ')])\n\ngood = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1 and not is_good(a, n, i, j):\n good = False\n break\nif good:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nind=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j]!=1:\r\n ind.append([i,j])\r\n#print(ind)\r\ncheck=[]\r\nfor [i,j] in ind:\r\n flag=0\r\n for x in range(n):\r\n for y in range(n):\r\n if l[i][x]+l[y][j]==l[i][j]:\r\n check.append('Yes')\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\n#print(check)\r\nif len(check)==len(ind):\r\n print('Yes')\r\nelse:\r\n print('No')", "n=int(input())\r\ndata=[ list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n mark=0\r\n if data[i][j]!=1:\r\n for k in range(n):\r\n flag=0\r\n if k==i:\r\n continue\r\n for l in range(n):\r\n if l==j:\r\n continue\r\n if data[i][j]==data[k][j]+data[i][l]:\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n else:\r\n mark=1\r\n print('No')\r\n break\r\n if mark:\r\n break\r\nelse:\r\n print('Yes')\r\n", "\r\nn = int(input())\r\nl = []\r\nlc = [] \r\nfor _ in range(n):\r\n\tlc.append([])\r\nfor _ in range(n):\r\n\tli = list(map(int, input().split()))\r\n\tl.append(li)\r\n\r\n\tfor i in range(n):\r\n\t\tlc[i].append(li[i])\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif l[i][j] != 1:\r\n\t\t\tco = 0\r\n\t\t\tfor k in l[i]:\r\n\t\t\t\tfor m in lc[j]:\r\n\t\t\t\t\tif k + m == l[i][j]:\r\n\t\t\t\t\t\tco = 1\r\n\r\n\t\t\tif co == 0:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\n\r\nprint('YES')\r\n\r\n\r\n\r\n\r\n" ]	{"inputs": ["3\n1 1 2\n2 3 1\n6 4 1", "3\n1 5 2\n1 1 1\n1 2 3", "1\n1", "4\n1 1 1 1\n1 11 1 2\n2 5 1 4\n3 9 4 1", "4\n1 1 1 1\n1 7 1 1\n1 3 1 2\n2 6 3 1", "4\n1 1 1 1\n1 12 1 2\n4 4 1 3\n5 10 6 1", "4\n1 1 1 1\n1 13 1 2\n4 5 1 3\n5 11 6 1", "4\n1 1 1 1\n1 13 1 2\n4 5 1 3\n7 11 6 1", "4\n1 1 1 1\n1 14 1 6\n4 5 1 5\n3 8 2 1", "10\n3 2 6 5 1 2 1 1 2 1\n1 2 2 3 1 4 1 1 1 1\n1 1 3 1 2 2 2 1 1 1\n1 3 1 2 1 2 1 1 1 1\n12 1 4 3 3 1 1 1 2 1\n8 1 1 1 1 3 6 5 1 3\n1 1 1 2 4 1 3 2 1 1\n1 1 1 1 1 1 1 2 1 1\n1 2 1 1 1 1 1 1 1 1\n2 1 1 1 1 1 1 1 1 2", "4\n1 2 3 5\n1 1 1 1\n1 1 1 1\n1 1 1 1", "1\n2", "3\n1 1 4\n1 1 2\n1 1 2", "1\n5", "3\n1 2 1\n2 2 3\n1 3 1", "3\n2 1 1\n2 1 1\n2 1 1", "1\n60000"], "outputs": ["Yes", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No"]}	UNKNOWN	PYTHON3	CODEFORCES	171
cf630697f1a656cbd30ea39d80be45d2	Orchestra	Paul is at the orchestra. The string section is arranged in an r<=×<=c rectangular grid and is filled with violinists with the exception of n violists. Paul really likes violas, so he would like to take a picture including at least k of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take. Two pictures are considered to be different if the coordinates of corresponding rectangles are different. The first line of input contains four space-separated integers r, c, n, k (1<=≤<=r,<=c,<=n<=≤<=10, 1<=≤<=k<=≤<=n) — the number of rows and columns of the string section, the total number of violas, and the minimum number of violas Paul would like in his photograph, respectively. The next n lines each contain two integers xi and yi (1<=≤<=xi<=≤<=r, 1<=≤<=yi<=≤<=c): the position of the i-th viola. It is guaranteed that no location appears more than once in the input. Print a single integer — the number of photographs Paul can take which include at least k violas. Sample Input 2 2 1 1 1 2 3 2 3 3 1 1 3 1 2 2 3 2 3 2 1 1 3 1 2 2 Sample Output 4 1 4	[ "f = lambda: map(int, input().split())\r\nr, c, n, k = f()\r\nt = [list(f()) for i in range(n)]\r\ns = 0\r\nfor i in range(1, r + 1):\r\n for j in range(i, r + 1):\r\n for u in range(1, c + 1):\r\n for v in range(u, c + 1):\r\n s += sum([i <= x <= j and u <= y <= v for x, y in t]) >= k\r\nprint(s)", "r,c,n,p = map(int,input().split())\nresp = 0\nm = []\n\nfor i in range(r):\n\taux = []\n\tfor j in range(c):\n\t\taux.append(False)\n\tm.append(aux[:])\n\n\nfor i in range(n):\n\tx,y = map(int,input().split())\n\n\tm[x-1][y-1] = True\n\nfor i in range(r):\n\tfor j in range(c):\n\t\tfor a in range(r,i,-1):\n\t\t\tfor b in range(c,j,-1):\t\t\t\t\n\t\t\t\tcont = 0\n\t\t\t\tfor k in range(i,a):\n\t\t\t\t\tfor l in range(j,b):\n\t\t\t\t\t\tif m[k][l]:\n\t\t\t\t\t\t\tcont += 1\t\t\n\t\t\t\tif cont>=p:\n\t\t\t\t\tresp += 1\n\nprint(resp)", "from collections import defaultdict as Matrix\r\nfrom itertools import product\r\n\r\nr, c, n, k = map(int, input().split())\r\n\r\ndp = Matrix(int)\r\nfor _ in range(n):\r\n x, y = [int(cc) - 1 for cc in input().split()]\r\n for x0, y0 in product(range(x+1), range(y+1)):\r\n for x1, y1 in product(range(x, r), range(y, c)):\r\n if x0 <= x <= x1 and y0 <= y <= y1:\r\n dp[(x0, y0, x1, y1)] += 1\r\n\r\nans = sum(1 for v in dp.values() if v >= k)\r\nprint(ans)", "r, c, n, k = map(int, input().split())\r\ng = set([tuple(map(int, input().split())) for _ in range(n)])\r\nret = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for l in range(1, r-i+1):\r\n for w in range(1, c-j+1):\r\n count = 0\r\n for a in range(i, i+l):\r\n for b in range(j, j+w):\r\n if (a+1, b+1) in g:\r\n count += 1\r\n if count >= k:\r\n ret += 1\r\nprint(ret)\r\n", "from collections import Counter\r\n\r\nr, c, n, k = map(int, input().split())\r\n\r\ndp = Counter()\r\nfor _ in range(n):\r\n x, y = [int(cc) - 1 for cc in input().split()]\r\n for x0 in range(x + 1):\r\n for y0 in range(y + 1):\r\n for x1 in range(x, r):\r\n for y1 in range(y, c):\r\n dp[(x0, y0, x1, y1)] += 1\r\n\r\nans = sum(1 for v in dp.values() if v >= k)\r\nprint(ans)\r\n", "def count_possible_pictures(r, c, n, k, violists):\r\n count = 0\r\n\r\n for top in range(1, r + 1):\r\n for bottom in range(top, r + 1):\r\n for left in range(1, c + 1):\r\n for right in range(left, c + 1):\r\n violists_inside = sum(1 for x, y in violists if top <= x <= bottom and left <= y <= right)\r\n if violists_inside >= k:\r\n count += 1\r\n\r\n return count\r\n\r\n# Read input\r\nr, c, n, k = map(int, input().split())\r\nviolists = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result\r\nresult = count_possible_pictures(r, c, n, k, violists)\r\nprint(result)", "a,b,c,d = map(int, input().split())\r\nA = [0] * a\r\nfor i in range(len(A)):\r\n A[i] = [0] * b\r\n\r\nfor i in range(c):\r\n per1, per2 = map(int, input().split())\r\n A[per1-1][per2-1] = 1\r\nans = 0\r\nfor i in range(a):\r\n for j in range(b):\r\n for k in range(i, a):\r\n for t in range(j, b):\r\n cou = 0\r\n for s in range(i, k+1):\r\n for m in range(j, t+1):\r\n if A[s][m] == 1:\r\n cou+=1\r\n if cou>= d:\r\n ans+=1\r\nprint(ans)", "r,c,n,k = map(int, input().split())\r\n\r\nG = [[0]c for i in range(0,r)]\r\nfor i in range(0, n):\r\n a,b = map(int, input().split())\r\n a-=1\r\n b-=1\r\n G[a][b] = True\r\nans = 0\r\nfor x in range(0,r):\r\n for y in range(0,c):\r\n for y1 in range(y + 1, c + 1):\r\n for x1 in range(x + 1, r + 1):\r\n num = 0;\r\n for cl in range(y, y1):\r\n for rw in range(x, x1):\r\n if G[rw][cl]:\r\n num += 1\r\n if num >= k:\r\n ans+=1\r\n \r\nprint(ans)\r\n", "r,c,n,k = map(int,input().split())\r\nxy = [list(map(int,input().split())) for i in range(n)]\r\nfield = [[0]c for i in range(r)]\r\nfor i in range(n):\r\n field[xy[i][0]-1][xy[i][1]-1] = 1\r\nnum = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for i2 in range(i,r):\r\n for j2 in range(j,c):\r\n num2 = 0\r\n for i3 in range(i,i2+1):\r\n for j3 in range(j,j2+1):\r\n if field[i3][j3] == 1:\r\n num2 += 1\r\n if num2 >= k:\r\n num += 1\r\nprint(num)\r\n", "from decimal import \r\nimport math\r\nimport sys\r\nrasp_final=\"\"\r\ndef transformare_baza(numar,baza):\r\n transformare=\"\"\r\n while numar>=baza:\r\n rest=numar%baza\r\n numar=numar//baza\r\n transformare+=str(rest)\r\n transformare+=str(numar)\r\n noua_baza=transformare[::-1]\r\n return noua_baza\r\n\r\n\r\n\r\n \r\n#c=int(input())\r\nfor z in range(0,1):\r\n #print(c)\r\n r,c,n,k=list(map(int,input().split()))\r\n #stringul=input()\r\n #n=int(input())\r\n #lista=input()\r\n #lista=list(map(int,input().split()))\r\n matrix=[]\r\n a=[]\r\n \r\n for i in range(0,r):\r\n a=[]\r\n for j in range(0,c):\r\n a.append(\"\")\r\n matrix.append(a)\r\n \r\n for i in range(0,n):\r\n rx,cx=list(map(int,input().split()))\r\n matrix[rx-1][cx-1]=\"#\"\r\n \r\n cate=0 \r\n for i in range(0,r):\r\n for j in range(0,c):\r\n \r\n for ii in range(i,r):\r\n for jj in range(j,c):\r\n #print(i,j,'ii=',ii,'jj=',jj)\r\n suma=0\r\n for iii in range(i,ii+1):\r\n for jjj in range(j,jj+1):\r\n #print(ii,jj,matrix[ii][jj])\r\n if matrix[iii][jjj]=='#':\r\n suma+=1\r\n if suma>=k:\r\n cate+=1\r\n \r\n \r\n #print(matrix) \r\n print(cate) \r\n \r\n ", "string, column, cnt, mincnt = map(int, input().split())\r\nmaps = [['' for i in range(column)] for j in range(string)]\r\nfor i in range(cnt):\r\n a, b = map(int, input().split())\r\n maps[a - 1][b - 1] = '#'\r\nans = 0\r\nfor i in range(string):\r\n for j in range(column):\r\n for i1 in range(i, string):\r\n for j1 in range(j, column):\r\n num = 0\r\n for s in range(i, i1 + 1):\r\n for c in range(j, j1 + 1):\r\n if maps[s][c] == '#':\r\n num += 1\r\n if num >= mincnt:\r\n ans += 1\r\nprint(ans)", "import math\r\nimport string\r\n\r\n\r\ndef special_printer(l):\r\n for i in l:\r\n print(i)\r\n\r\n\r\ndef main_function():\r\n r, c, n, g = [int(i) for i in input().split(\" \")]\r\n table = [[0 for i in range(c)] for i in range(r)]\r\n for j in range(n):\r\n x, y = [int(i) - 1 for i in input().split(\" \")]\r\n table[x][y] = 1\r\n #special_printer(table)\r\n main_counter = 0\r\n for i in range(r):\r\n for j in range(i, r):\r\n for h in range(c):\r\n for u in range(h, c):\r\n counter = 0\r\n for f in range(i, j + 1):\r\n for v in range(h, u + 1):\r\n if table[f][v] == 1:\r\n counter += 1\r\n if counter >= g:\r\n main_counter += 1\r\n\r\n print(main_counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "r, c, n, k = [int(i) for i in input().split()]\r\na = [[0] r for i in range(c)]\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n a[y - 1][x - 1] = 1\r\nct1 = 0\r\nfor i in range(c):\r\n for j in range(r):\r\n for s in range(i + 1, c + 1):\r\n for t in range(j + 1, r + 1):\r\n ct = 0\r\n for u in range(i, s):\r\n for v in range(j, t):\r\n if a[u][v] == 1:\r\n ct += 1\r\n if ct >= k:\r\n ct1 += 1\r\nprint(ct1)", "r,c,n,k = map(int,input().split())\r\na = [[0]20 for i in range(20)]\r\nfor i in range(n):\r\n\tx,y = map(int,input().split())\r\n\ta[x-1][y-1] = 1\r\nans = 0\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tfor i2 in range(i, r):\r\n\t\t\tfor j2 in range(j, c):\r\n\t\t\t\tnum = 0\r\n\t\t\t\tfor i3 in range(i, i2+1):\r\n\t\t\t\t\tfor j3 in range(j, j2+1):\r\n\t\t\t\t\t\tif a[i3][j3]: num += 1\r\n\t\t\t\tif num >= k:\r\n\t\t\t\t\tans += 1\r\nprint(ans)\r\n", "r, c, n, k = map(int, input().split())\r\np = []\r\nfor i in range(r):\r\n p.append([0] c)\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p[x - 1][y - 1] = 1\r\nans = 0\r\nfor i in range(r):\r\n for t in range(c):\r\n for e in range(r):\r\n for g in range(c):\r\n col = 0\r\n for h in range(i, e + 1):\r\n for f in range(t, g + 1):\r\n col += p[h][f]\r\n if col >= k:\r\n ans += 1\r\nprint(ans)\r\n", "r, c, n, k = list(map(int, input().split()))\r\nalt = []\r\ncount = 0\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n alt.append([a - 1, b - 1])\r\nfor x1 in range(r):\r\n for x2 in range(x1 + 1):\r\n for y1 in range(c):\r\n for y2 in range(y1 + 1):\r\n d = 0\r\n for i in range(n):\r\n if (alt[i][0] <= x1 and alt[i][0] >= x2 and alt[i][1] <= y1 and alt[i][1] >= y2):\r\n d += 1\r\n if d >= k:\r\n count += 1\r\nprint(count)", "r, c, n, k = list(map(int, input().split()))\r\nA = [2] * n\r\nfor i in range(n):\r\n A[i] = list(map(int, input().split()))\r\nanswer = 0\r\nfor i1 in range(1, r + 1):\r\n for j1 in range(1, c + 1):\r\n for i2 in range(i1, r + 1):\r\n for j2 in range(j1, c + 1):\r\n t = 0\r\n for i in range(n):\r\n if i1 <= A[i][0] <= i2 and j1 <= A[i][1] <= j2:\r\n t += 1\r\n answer += (t >= k)\r\nprint(answer)", "readInts=lambda: list(map(int, input().split()))\r\npos=[]\r\nr,c,n,k=readInts()\r\nfor i in range (n):\r\n x,y=readInts()\r\n pos.append([x-1,y-1])\r\nret=0\r\nfor i in range (r):\r\n for j in range(c):\r\n for ii in range(i,r):\r\n for jj in range(j,c):\r\n cnt=0\r\n for it in range(n):\r\n x,y=pos[it]\r\n if x>=i and x<=ii and y>=j and y<=jj:\r\n cnt+=1\r\n if cnt>=k:\r\n ret+=1\r\nprint(ret)", "r,c,n,k=map(int,input().split())\r\ngrid=[]\r\nfor i in range(r):\r\n grid.append([0]c)\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n grid[x-1][y-1]=1\r\ncorx=[]\r\ncory=[]\r\nfor i in range(r+1):\r\n for t in range(r+1):\r\n if t>i:\r\n corx.append([i,t])\r\nfor i in range(c+1):\r\n for t in range(c+1):\r\n if t>i:\r\n cory.append([i,t])\r\nresult=0\r\nfor i in corx:\r\n for t in cory:\r\n pht=0\r\n for a in grid[i[0]:i[1]]:\r\n for m in a[t[0]:t[1]]:\r\n if m==1:\r\n pht+=1\r\n if pht>=k:\r\n result+=1\r\nprint(result)", "def main():\n from itertools import combinations\n r, c, n, k = map(int, input().split())\n r += 1\n c += 1\n l = [[0] c for _ in range(r)]\n for _ in range(n):\n y, x = map(int, input().split())\n for i in range(y, r):\n row = l[i]\n for j in range(x, c):\n row[j] += 1\n print(sum(l[y][x] + l[i][j] - l[y][j] - l[i][x] >= k\n for i, y in combinations(range(r), 2)\n for j, x in combinations(range(c), 2)))\n\n\nif __name__ == '__main__':\n main()\n", "r, c, n, k = map(int, input().split())\r\nalist = [[0 for _ in range(c)] for _ in range(r)]\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n alist[x - 1][y - 1] = 1\r\n\r\nalist = [\"\".join(map(str, i)) for i in alist]\r\ncount = 0\r\n\r\nfor rows in range(r):\r\n for cols in range(c):\r\n \r\n for i in range(r - rows):\r\n for j in range(c - cols):\r\n astring = \"\".join([sub[j:j+cols+1] for sub in alist[i:i+rows+1]])\r\n \r\n if astring.count(\"1\") >= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "r, c, n, k = map(int, input().split())\r\nd = [[0 for j in range(c+1)] for i in range(r+1)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n d[x][y] = 1\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n d[i][j] = d[i][j] + d[i-1][j] + d[i][j-1] - d[i-1][j-1]\r\na = 0\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n for x in range(i,r+1):\r\n for y in range(j,c+1):\r\n if d[x][y] - d[x][j-1] - d[i-1][y] + d[i-1][j-1] >= k:\r\n a += 1\r\n\r\nprint(a)\r\n", "r, c, n, k = map(int, input().split())\n\nboard = [[0 for col in range(c)] for row in range(r)]\nfor i in range(n):\n x, y = map(lambda x: int(x)-1, input().split())\n board[x][y] = 1\n\nphotos = 0\nfor x1 in range(r):\n for y1 in range(c):\n for x2 in range(x1, r):\n for y2 in range(y1, c):\n s = 0\n for row in range(x1, x2+1):\n s += sum(board[row][y1:y2+1])\n if s >= k:\n photos += 1\n\nprint(photos)\n", "r, c, n, k = map(int, input().split())\nA = [[0] * c for i in range(r)]\nfor i in range(n):\n a, b = map(int, input().split())\n A[a - 1][b - 1] = 1\n\nf = 0\ng = 0\nans = 0\nfor i in range(r):\n for j in range(c):\n for i2 in range(r - i):\n for j2 in range(c - j):\n cnt = 0\n for i3 in range(i, i + i2 + 1):\n for j3 in range(j, j + j2 + 1):\n #print(i3, j3)\n cnt += int(A[i3][j3] == 1)\n if cnt >= k:\n ans += 1\nprint(ans)", "def count(a,b,c,d):\n return sum([arr[i][j] for i in range(a,c + 1) for j in range(b,d + 1)])\n\ndef solve(r,c,n,m):\n ans = 0\n for i in range(1,r + 1):\n for j in range(1,c + 1):\n for k in range(i,r + 1):\n for l in range(j,c + 1):\n x = count(i,j,k,l)\n if x >= m:\n ans += 1\n return ans\n\nr,c,n,k = map(int,input().split())\n\narr = [[0 for i in range(20)] for j in range(20)]\n\nfor i in range(n):\n x,y = map(int,input().split())\n arr[x][y] = 1\n\nprint(solve(r,c,n,k))\n", "#!/usr/bin/env python3\n\nr, c, n, k = [int(x) for x in input().split()]\nmin_x, min_y, max_x, max_y = r, c, 1, 1\n\nalts = []\nfor i in range(0, n):\n x, y = [int(i) for i in input().split()]\n alts.append((x, y))\n\nphoto_count = 0\nfor x in range(1, r + 1):\n for y in range(1, c + 1):\n for w in range(1, r - (x - 1) + 1):\n for h in range(1, c - (y - 1) + 1):\n # print('x == {0}, y = {1}, w = {2}, l = {3}'.format(x, y, w, h))\n alt_count = 0\n for alt in alts:\n if x <= alt[0] <= x + w - 1 and y <= alt[1] <= y + h - 1:\n alt_count += 1\n # print('yay!')\n\n if alt_count >= k:\n photo_count += 1\n break\nprint(photo_count)\n", "read = lambda: map(int, input().split())\r\nr, c, n, k = read()\r\na = [[0] * (c + 1) for i in range(r + 1)]\r\nfor i in range(n):\r\n x, y = read()\r\n a[x][y] = 1\r\nd = [[0] * (c + 1) for i in range(r + 1)]\r\nfor i in range(1, r + 1):\r\n for j in range(1, c + 1):\r\n if a[i][j]: d[i][j] += 1\r\n if i == j == 0: continue\r\n p1 = d[i - 1][j] if i else 0\r\n p2 = d[i][j - 1] if j else 0\r\n p3 = d[i - 1][j - 1] if i and j else 0\r\n d[i][j] += p1 + p2 - p3\r\ncnt = 0\r\nfor x1 in range(r + 1):\r\n for y1 in range(c + 1):\r\n for x2 in range(x1 + 1, r + 1):\r\n for y2 in range(y1 + 1, c + 1):\r\n cur = d[x2][y2] - d[x2][y1] - d[x1][y2] + d[x1][y1]\r\n if cur >= k: cnt += 1\r\nprint(cnt)\r\n", "r, c, n, k = map(int, input().split())\r\ndata = [[False for i in range(c)] for j in range(r)]\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\tx -= 1\r\n\ty -= 1\r\n\tdata[x][y] = True\r\nans = 0\r\nfor a in range(r+1):\r\n\tfor b in range(c+1):\r\n\t\tfor e in range(r):\r\n\t\t\tfor d in range(c):\r\n\t\t\t\tcnt = 0\r\n\t\t\t\tflag = False\r\n\t\t\t\tfor i in range(a):\r\n\t\t\t\t\tfor j in range(b):\r\n\t\t\t\t\t\tif 0 <= e+i < r and 0 <= d+j < c:\r\n\t\t\t\t\t\t\tif data[e+i][d+j]:\r\n\t\t\t\t\t\t\t\tcnt += 1\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tflag = True\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\tif flag:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tif cnt >= k:\r\n\t\t\t\t\tans += 1\r\nprint(ans)\r\n\r\n\r\n", "def cnt(x1, y1, x2, y2):\r\n ans = 0\r\n for i in range(y2, y1 + 1):\r\n for j in range(x1, x2 + 1):\r\n if lst[i][j] == 1:\r\n ans += 1\r\n return ans \r\n \r\n\r\nh, w, n, kk = map(int, input().split())\r\nanss = 0\r\nlst = [[0] * 20 for i in range(20)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n lst[x - 1][y - 1] = 1\r\nfor i in range(h):\r\n for j in range(w):\r\n for k in range(h):\r\n for z in range(w):\r\n if cnt(j, i, z, k) >= kk:\r\n anss += 1\r\nprint(anss) \r\n \r\n", "f = lambda: map(int, input().split())\r\nr, c, n, k = f()\r\nt = [[0] * (c + 1) for i in range(r + 1)]\r\nfor j in range(n):\r\n y, x = f()\r\n t[y][x] = 1\r\nfor y in range(r):\r\n p = t[y + 1]\r\n for x in range(c): p[x + 1] += p[x]\r\n t[y + 1] = [a + b for a, b in zip(p, t[y])]\r\ns = (c * c + c) * (r * r + r) >> 2\r\nfor y in range(r):\r\n for x in range(c):\r\n for a in range(1, c - x + 1):\r\n for b in range(1, r - y + 1):\r\n if t[y + b][x + a] + t[y][x] - t[y + b][x] - t[y][x + a] >= k: break\r\n s -= 1\r\nprint(s)", "# Counts the number of violists given a fixed initial position.\r\ndef count(orchestra, x1, y1, x2, y2):\r\n\trv = 0\r\n\t\r\n\tfor i in range(x1, x2+1):\r\n\t\tfor j in range(y1, y2+1):\r\n\t\t\tif orchestra[i][j] == 1:\r\n\t\t\t\trv += 1\r\n\t\t\t\r\n\treturn rv\r\n\r\ndef doit(r, c, n, k, pos):\r\n\torchestra = [[0 for x in range(c)] for x in range(r)] \r\n\r\n\t# Set where the violists are.\r\n\tfor i in pos:\r\n\t\torchestra[i[0]-1][i[1]-1] = 1\r\n\t\r\n\trv = 0\r\n\t\r\n\tfor i1 in range(r):\r\n\t\tfor i2 in range(c):\r\n\t\t\tfor i3 in range(i1, r):\r\n\t\t\t\tfor i4 in range(i2, c):\r\n\t\t\t\t\tif count(orchestra, i1, i2, i3, i4) >= k:\r\n\t\t\t\t\t\trv += 1\r\n\t\t\t\t\t\t\r\n\treturn rv\r\n\r\n\r\nif __name__ == '__main__':\r\n\targs = list(map(int, input().split()))\r\n\tr = args[0]\r\n\tc = args[1]\r\n\tn = args[2]\r\n\tk = args[3]\r\n\tpos = []\r\n\t\r\n\tfor i in range(n):\r\n\t\tz = list(map(int, input().split()))\r\n\t\tx = z[0]\r\n\t\ty = z[1]\r\n\t\tpos.append([x,y])\r\n\t\t\r\n\tprint(doit(r, c, n, k, pos))", "r,c,n,k=map(int,input().split())\r\nd=[[0 for i in range(c+1)] for _ in range(r+1)]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n d[x][y]=1\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n d[i][j]=d[i][j]+d[i][j-1]+d[i-1][j]-d[i-1][j-1]\r\ncount=0\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n for x in range(i,r+1):\r\n for y in range(j,c+1):\r\n if d[x][y]-d[x][j-1]-d[i-1][y]+d[i-1][j-1]>=k:\r\n count+=1\r\nprint(count)", "dhuang=0\r\na,b,c,d=map(int,input().split(' '))\r\nhuang = [['']b for _ in range(a)]\r\nfor i in range(c):\r\n x,y=map(int,input().split(' '))\r\n huang[x-1][y-1] = '#'\r\nfor i in range(a):\r\n for j in range(b):\r\n for k in range(i, a):\r\n for l in range(j, b):\r\n ct=0\r\n for m in range(i, k+1):\r\n for n in range(j, l+1):\r\n if huang[m][n]=='#':\r\n ct+=1\r\n if ct>=d:\r\n dhuang+=1\r\nprint(dhuang)\r\n", "L = lambda: [map(int, input().split())]\r\n\r\nr, c, n, k = L()\r\nA = [L() for _ in range(n)]\r\n\r\nprint(sum(sum(a<=x<=b and f<=y<=g for x,y in A) >= k for a in range(1, r+1)\r\n for b in range(a, r+1)\r\n for f in range(1, c+1)\r\n for g in range(f, c+1)))", "r, c, n, k = map(int, input().split())\na = [tuple(map(int, input().split())) for _ in range(n)]\nans = 0\nfor x1 in range(1, r + 1):\n for x2 in range(x1, r + 1):\n for y1 in range(1, c + 1):\n for y2 in range(y1, c + 1):\n if len([1 for x, y in a if x1 <= x <= x2 and y1 <= y <= y2]) >= k:\n ans += 1\nprint(ans)\n\t\t\t \t \t \t\t \t \t\t\t\t\t\t", "r,c,n,k=map(int,input().split())\na=[[0 for i in range(0,c)] for j in range(0,r)]\nfor i in range(0,n):\n\tx,y=map(int,input().split())\n\tx=x-1\n\ty=y-1\n\ta[x][y]=1\nans=0\nfor i in range(0,r):\n\tfor j in range(0,c):\n\t\tfor u in range(i,r):\n\t\t\tfor v in range(j,c):\n\t\t\t\tt=0\n\t\t\t\tfor x in range(i,u+1):\n\t\t\t\t\tfor y in range(j,v+1):\n\t\t\t\t\t\tt+=a[x][y]\n\t\t\t\tif t>=k:\n\t\t\t\t\tans=ans+1\nprint(ans)\n", "r, c, n, k = map(int, input().split())\r\na = [[0 for i in range(0, c)] for j in range(0, r)]\r\nfor i in range(0, n):\r\n x, y = map(int, input().split())\r\n x = x - 1\r\n y = y - 1\r\n a[x][y] = 1\r\nans = 0\r\nfor i in range(0, r):\r\n for j in range(0, c):\r\n for u in range(i, r):\r\n for v in range(j, c):\r\n t = 0\r\n for x in range(i, u + 1):\r\n for y in range(j, v + 1):\r\n t += a[x][y]\r\n if t >= k:\r\n ans = ans + 1\r\nprint(ans);", "# You lost the game.\nr,c,n,k = map(int, input().split())\nV = [list(map(int, input().split())) for _ in range(n)]\n\nG = [[0 for _ in range(c)] for _ in range(r)]\nfor i in range(n):\n G[V[i][0]-1][V[i][1]-1] = 1\n\n\nT = [[0 for _ in range(c)] for _ in range(r)]\nT[0][0] = G[0][0]\nfor i in range(1,r):\n T[i][0] = G[i][0]\nfor i in range(r):\n for j in range(1,c):\n T[i][j] = T[i][j-1] + G[i][j]\nfor i in range(1,r):\n for j in range(c):\n T[i][j] += T[i-1][j]\nnb = 0\nfor x1 in range(c):\n for x2 in range(x1,c):\n for y1 in range(r):\n for y2 in range(y1,r):\n s = T[y2][x2]\n if x1 > 0:\n s -= T[y2][x1-1]\n if y1 > 0:\n s -= T[y1-1][x2]\n if x1 > 0 and y1 > 0:\n s += T[y1-1][x1-1]\n if s >= k:\n nb += 1\nprint(nb)\n", "def count(orchestra, initial, final):\r\n\tnum = 0\r\n\tfor i in range(initial[0], final[0]+1):\r\n\t\tfor j in range(initial[1], final[1]+1):\r\n\t\t\tif orchestra[i][j] == 1:\r\n\t\t\t\tnum += 1\r\n\r\n\treturn num\r\n\r\ndef getNumber(orchestra, initial, minimum):\r\n\tnum = 0\r\n\r\n\tfor i in range(initial[0], r):\r\n\t\tfor j in range(initial[1], c):\r\n\t\t\tfinal = [i, j]\r\n\t\t\tcounter = count(orchestra, initial, final)\r\n\r\n\t\t\tif counter >= k:\r\n\t\t\t\tnum += 1\r\n\r\n\tif initial[0] == len(orchestra):\r\n\t\treturn num\r\n\tif initial[1] == len(orchestra[0])-1:\r\n\t\tinitial[0] += 1\r\n\t\tinitial[1] = 0\r\n\telse:\r\n\t\tinitial[1] += 1\r\n\r\n\treturn num + getNumber(orchestra, initial, minimum)\r\n\r\nargs = list(map(int, input().split()))\r\nr = args[0]\r\nc = args[1]\r\nn = args[2]\r\nk = args[3]\r\n\r\npositions = []\r\n\r\n\r\nfor i in range(n):\r\n\tx = list(map(int, input().split()))\r\n\tpositions.append([x[0], x[1]])\r\n\r\norchestra = [[0]c for i in range(r)]\r\n\r\nfor i in positions:\r\n\torchestra[i[0]-1][i[1]-1] = 1\r\n\r\nprint(getNumber(orchestra, [0, 0], k))", "w,h,v,n = map(int, input().split())\r\nV = [[False]h for _ in range(w)]\r\nfor _ in range(v):\r\n x,y = map(int, input().split())\r\n V[x-1][y-1] = True\r\n\r\ndef calc(a, b, c, d):\r\n s = 0\r\n for x in range(a,c+1):\r\n for y in range(b, d+1):\r\n s += V[x][y];\r\n if s >= n: return s\r\n return s\r\n\r\nC = 0\r\nfor x1 in range(w):\r\n for y1 in range(h):\r\n for x2 in range(x1, w):\r\n for y2 in range(y1, h):\r\n if calc(x1, y1, x2, y2) >= n:\r\n C += 1\r\nprint(C)\r\n", "b, a, n, k = map(int, input().split())\r\ndata = [[0 for i in range(a)]for j in range(b)]\r\nfor i in range(n):\r\n xi, yi = map(int, input().split())\r\n xi -= 1\r\n yi -= 1\r\n data[xi][yi] = 1\r\nanswer = 0\r\nfor i in range(b):\r\n for j in range(a):\r\n for x in range(i, b):\r\n for y in range(j, a):\r\n counter = 0\r\n for x1 in range(min(i, x), max(i, x) + 1):\r\n for y1 in range(min(j, y), max(j, y) + 1):\r\n counter += data[x1][y1]\r\n if counter >= k:\r\n answer += 1\r\nprint(answer)", "r,c,n,k=map(int,input().split())\r\nviolas = set([tuple(map(int,input().split())) for i in range(n)])\r\nans = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for l in range(1, r-i+1):\r\n for w in range(1, c-j+1):\r\n ctr = 0\r\n for a in range(i, i+l):\r\n for b in range(j, j+w):\r\n if (a+1, b+1) in violas:\r\n ctr += 1\r\n if ctr >= k:\r\n ans += 1\r\nprint(ans)\r\n\r\n", "#they are all inclusive\nR, C, N, K = map(int, input().split())\nv = []\nfor i in range(N):\n v.append(tuple(map(int, input().split())))\nans = 0\nfor sr in range(1, R+1):\n for sc in range(1, C+1):\n for er in range(sr, R+1):\n for ec in range(sc, C+1):\n cnt = 0\n for x, y in v:\n if sr <= x <= er and sc <= y <= ec:\n cnt += 1\n if cnt >= K:\n ans += 1\nprint(ans)\n", "r, c, n, k = map(int, input().split())\r\na = []\r\nq = 0\r\nfor i in range(r):\r\n a.append([0] c)\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[x - 1][y - 1] = 1\r\nfor i in range(r):\r\n for j in range(c):\r\n for m in range(r - i + 1):\r\n for p in range(c - j + 1):\r\n s = 0\r\n for d in range(i, i + m):\r\n for b in range(j, j + p):\r\n s += a[d][b]\r\n if s >= k:\r\n q += 1\r\nprint(q)", "r, c, n, k = [int(x) for x in input().split()]\nmus = [[0 for j in range(c)] for i in range(r)]\nfor t in range(n):\n x, y = [int(s)-1 for s in input().split()]\n mus[x][y] = 1\nans = 0\nfor i1 in range(r):\n for i2 in range(i1, r):\n for j1 in range(c):\n for j2 in range(j1, c):\n S = 0\n for x in range(i1, i2+1):\n for y in range(j1, j2+1):\n S += mus[x][y]\n if S >= k:\n ans += 1\nprint(ans)\n", "r, c, n, k = input().split()\r\nr, c, n, k = int(r), int(c), int(n), int(k)\r\n\r\nviolas = []\r\n\r\nfor _ in range(n):\r\n x, y = input().split()\r\n x, y = int(x) - 1, int(y) - 1\r\n violas.append((y,x))\r\n\r\ndef count_violas(x1, y1, x2, y2):\r\n global violas\r\n s = 0\r\n for x, y in violas:\r\n if x >= x1 and x <= x2 and y >= y1 and y <= y2:\r\n s += 1\r\n return s\r\n\r\nans = 0\r\nfor x1 in range(c):\r\n for y1 in range(r):\r\n for x2 in range(x1, c):\r\n for y2 in range(y1, r):\r\n if count_violas(x1, y1, x2, y2) >= k:\r\n ans += 1\r\n\r\nprint(ans)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\nimport time\n\na = []\n\n(r, c, n, k) = (int(i) for i in input().split())\n\nfor i in range(n):\n a.append([int(i)-1 for i in input().split()])\n\nstart = time.time()\nans = 0\n\nfor x1 in range(r):\n for y1 in range(c):\n for x0 in range(x1+1):\n for y0 in range(y1+1):\n now = 0\n for i in range(n):\n if (a[i][0] >= x0) and (a[i][0] <= x1) and (a[i][1] >= y0) and (a[i][1] <= y1):\n now +=1\n\n if now >= k:\n ans += 1\n\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "import io\nimport sys\nimport time\nimport random\n#~ start = time.clock()\n#~ test = '''2 2 1 1\n#~ 1 2'''\n#~ test = '''3 2 3 3\n#~ 1 1\n#~ 3 1\n#~ 2 2'''\n#~ test = '''3 2 3 2\n#~ 1 1\n#~ 3 1\n#~ 2 2'''\n\n#~ sys.stdin = io.StringIO(test)\n\nr,c,n,k = map(int,input().split()) # row column number-of-violists\ndata = [ [0 for i in range(c)] for j in range(r) ]\n#~ print(r,c,n,k)\n\nfor i in range(n):\n x,y = map(int,input().split()) # row column\n data[x-1][y-1] = 1\n\nnviolists = [ [0 for i in range(c)] for j in range(r) ]\n\nfor r1 in range(r):\n count = 0\n for c1 in range(c):\n count += data[r1][c1]\n nviolists[r1][c1] = (nviolists[r1-1][c1] if r1>0 else 0) \\\n + count\n #~ print(r1,c1,nviolists[r1][c1],nviolists[r1][c1-1])\n #~ print(nviolists)\n\ncount = 0\nfor r1 in range(r):\n for r2 in range(r1,r):\n for c1 in range(c):\n for c2 in range(c1,c):\n # between (r1,c1) and (r2,c2)\n \n vcount = nviolists[r2][c2] \\\n - (nviolists[r1-1][c2] if r1>0 else 0) \\\n - (nviolists[r2][c1-1] if c1>0 else 0) \\\n + (nviolists[r1-1][c1-1] if r1c1>0 else 0)\n if vcount>=k:\n #~ print( (r1,c1), (r2,c2) )\n count +=1 \n \n\nprint(count) \n#~ dur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "s = input()\r\nS = s.split()\r\nx = int(S[0])\r\ny = int(S[1])\r\nn = int(S[2])\r\nk = int(S[3])\r\na = [[\"\" for i in range(x)]for j in range(y)]\r\nfor i in range(n):\r\n alt = input()\r\n ALT = alt.split()\r\n a[int(ALT[1]) - 1][int(ALT[0]) - 1] = \"#\"\r\nanswer = 0\r\nfor x1 in range(x):\r\n for y1 in range(y):\r\n for x2 in range(x1, x):\r\n for y2 in range(y1, y):\r\n count = 0\r\n for i in range(x1, x2+1):\r\n for j in range(y1, y2+1):\r\n if a[j][i] == \"#\":\r\n count+=1\r\n if count >= k:\r\n answer+=1\r\nprint(answer)\r\n", "def check(x1, y1, x2, y2):\r\n global dp\r\n cnt = 0\r\n for i in range(x2, x1 + 1):\r\n for j in range(y2, y1 + 1):\r\n cnt += dp[i][j]\r\n return cnt\r\n\r\n\r\n#n = int(input())\r\nr, c, n, k = map(int, input().split())\r\n#s = list(map(int, input().split()))\r\ndp = [[0] * c for i in range(r)]\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n dp[a - 1][b - 1] = 1\r\nanswer = 0\r\nfor x1 in range(r):\r\n for y1 in range(c):\r\n for x2 in range(x1 + 1):\r\n for y2 in range(y1 + 1):\r\n cnt = check(x1, y1, x2, y2)\r\n #print(cnt, x1, y1, x2, y2)\r\n if cnt >= k:\r\n answer += 1\r\nprint(answer)\r\n ", "r, c, n, k = map(int, input().split())\r\n\r\nM = [[''] c for i in range(r)]\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n M[x-1][y-1] = '#'\r\n\r\ndef contain(M, k, x1, y1, x2, y2):\r\n for i in range(x1, x2+1):\r\n for j in range(y1, y2+1):\r\n if M[i][j] == '#':\r\n k -= 1\r\n return k <= 0\r\n\r\nans = 0\r\nfor x1 in range(r):\r\n for y1 in range(c):\r\n for x2 in range(x1, r): \r\n for y2 in range(y1, c):\r\n if contain(M, k, x1, y1, x2, y2):\r\n ans += 1\r\nprint(ans)", "r, c, n, k = map(int, input().split())\r\ng, v = [[False] * c for i in range(r)], 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n g[x - 1][y - 1] = True\r\nfor a in range(r):\r\n for b in range(c):\r\n for e in range(a, r):\r\n for f in range(b, c):\r\n x = sum(g[i][j] for i in range(a, e + 1) for j in range(b, f + 1))\r\n if x >= k:\r\n v += 1\r\nprint(v)", "grid = lambda:map(int, input().split()) \n\nrows , columns , n , k = grid() \n\nt = [ list ( grid()) for i in range ( n )] \n\ns = 0 \n\nfor i in range(1 , rows + 1):\n for j in range(i , rows + 1):\n for u in range(1 , columns + 1):\n for v in range(u , columns + 1):\n s += sum([i <= x <= j and u <= y <= v for x , y in t]) >= k \n\nprint(s)\n", "r,c,n,k = map(int,input().split())\r\ns = [[0] * c for i in range(r)]\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n s[x-1][y-1] = 1\r\nres = 0\r\nfor br in range(r):\r\n for bc in range(c):\r\n for er in range(br,r):\r\n for ec in range(bc,c):\r\n counter = 0\r\n for i in range(br, er+1):\r\n for j in range(bc, ec+1):\r\n if s[i][j] == 1: counter += 1\r\n if counter >= k : res += 1\r\n \r\nprint(res)" ]	{"inputs": ["2 2 1 1\n1 2", "3 2 3 3\n1 1\n3 1\n2 2", "3 2 3 2\n1 1\n3 1\n2 2", "1 1 1 1\n1 1", "10 10 10 10\n6 1\n3 8\n10 6\n10 3\n10 4\n8 9\n2 3\n5 7\n5 9\n5 1", "10 10 10 1\n8 2\n9 10\n6 8\n10 7\n1 8\n4 4\n6 3\n2 3\n8 8\n7 2", "5 9 2 2\n4 6\n1 5", "6 4 10 2\n2 3\n2 1\n1 2\n6 1\n1 4\n4 4\n2 4\n1 1\n6 3\n4 2", "8 2 4 4\n3 2\n3 1\n2 2\n7 1", "2 6 2 2\n1 2\n1 5", "7 5 3 1\n5 5\n4 5\n1 4", "10 10 10 6\n3 4\n10 9\n6 5\n4 9\n2 10\n10 10\n9 8\n8 2\n5 6\n1 5", "10 10 10 4\n5 7\n9 7\n5 8\n3 7\n8 9\n6 10\n3 2\n10 8\n4 1\n8 10", "10 10 10 1\n8 10\n2 9\n1 10\n3 1\n8 5\n10 1\n4 10\n10 2\n5 3\n9 3", "10 10 10 3\n2 7\n6 3\n10 2\n2 4\n7 8\n1 2\n3 1\n7 6\n6 8\n9 7", "10 10 10 2\n4 4\n1 7\n10 5\n2 8\n5 5\n6 9\n7 3\n9 5\n5 3\n6 6", "10 10 10 10\n8 2\n1 4\n9 9\n5 2\n1 7\n1 5\n3 10\n6 9\n7 8\n3 3", "10 10 10 10\n1 9\n5 2\n5 1\n8 5\n9 10\n10 2\n5 4\n4 3\n3 6\n1 5", "10 10 10 10\n5 6\n4 4\n8 9\n5 7\n9 2\n6 4\n7 3\n6 10\n10 3\n3 8", "10 10 10 1\n9 3\n7 5\n8 2\n3 8\n1 6\n3 9\n7 3\n10 4\n5 3\n1 3", "10 10 10 1\n1 10\n10 8\n7 4\n7 2\n1 3\n6 6\n10 1\n2 7\n9 3\n3 10", "10 10 10 1\n4 5\n9 6\n3 6\n6 10\n5 2\n1 7\n4 9\n10 8\n8 1\n2 9"], "outputs": ["4", "1", "4", "1", "4", "2073", "40", "103", "4", "8", "135", "78", "414", "1787", "751", "1416", "4", "1", "6", "1987", "1991", "2082"]}	UNKNOWN	PYTHON3	CODEFORCES	54
cf63babc63476bee39388e4e1d25d2b4	Trees	On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1<=≤<=i<=≤<=n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. This means that the heights of trees on ends (the 1st one and the n-th one) should be equal to each other, the heights of the 2-nd and the (n<=-<=1)-th tree must also be equal to each other, at that the height of the 2-nd tree should be larger than the height of the first tree by 1, and so on. In other words, the heights of the trees, standing at equal distance from the edge (of one end of the sequence) must be equal to each other, and with the increasing of the distance from the edge by 1 the tree height must also increase by 1. For example, the sequences "2 3 4 5 5 4 3 2" and "1 2 3 2 1" are beautiful, and '1 3 3 1" and "1 2 3 1" are not. Changing the height of a tree is a very expensive operation, using advanced technologies invented by Berland scientists. In one operation you can choose any tree and change its height to any number, either increase or decrease. Note that even after the change the height should remain a positive integer, i. e, it can't be less than or equal to zero. Identify the smallest number of changes of the trees' height needed for the sequence of their heights to become beautiful. The first line contains integer n (1<=≤<=n<=≤<=105) which is the number of trees. The second line contains integers ai (1<=≤<=ai<=≤<=105) which are the heights of the trees. Print a single number which is the minimal number of trees whose heights will have to be changed for the sequence to become beautiful. Sample Input 3 2 2 2 4 1 2 2 1 Sample Output 1 0	[ "n=int(input())\r\na= list(map(int, input().split()))\r\n \r\nx=[n]100001\r\nfor i in range(n):\r\n x[a[i]-min(n-i-1,i)]-=1\r\nprint (min(x[1:]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = [n]100001\r\n\r\nfor i in range(n):\r\n x[a[i]-min(n-i-1, i)]-=1\r\nprint(min(x[1:]))", "n=int(input());\r\nx=[n]49;\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n x[a[i]-min(i,n-i-1)]-=1\r\nprint(min(x[1:76]))", "n = int(input())\r\na = [0] 100005\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[l[i] - min(i, n - i - 1)] += 1\r\nprint(n - max(a[1::]))", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[0]n\r\nfrom collections import Counter\r\nc=Counter()\r\nfor i in range(n//2):\r\n b[i]=b[n-i-1]=i+1\r\nif n%2: b[n//2]=n//2+1\r\nfor i in range(n):\r\n if a[i]>=b[i]: c[a[i]-b[i]]+=1\r\nans=n-max(c.values())\r\nprint(ans)\r\n", "# LUOGU_RID: 99389245\nn = int(input())\r\ns = 0\r\nt = [0]100005\r\nms = list(map(int,input().split()))\r\na = 0\r\nfor i in ms:\r\n a += 1\r\n i -= min(a,n-a+1)\r\n if i >= 0:\r\n t[i-1] += 1\r\n s = max(s,t[i-1])\r\nprint(n-s)\r\n", "# LUOGU_RID: 111554051\nfrom sys import stdin \nfrom collections import defaultdict \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nn = int(input()) \nlst = [0] + list(get()) \nd = defaultdict(int) \nres = 0 \n\nfor i in range(1, n + 1) : \n\n t = lst[i] \n t -= min(i, n - i + 1) \n\n if t >= 0 : \n d[t] += 1\n res = max(res, d[t]) \n\nprint(n - res)" ]	{"inputs": ["3\n2 2 2", "4\n1 2 2 1", "3\n61452 50974 73849", "4\n86002 1199 86003 86002", "5\n92605 92606 41969 98774 92605", "10\n1 1 2 3 4 4 3 2 1 10", "10\n73905 73906 73907 85732 73909 73909 73908 73907 73906 73905", "10\n60718 99414 65042 65043 65044 38495 95782 65042 65041 65040", "7\n1 2 3 7 6 5 4", "5\n4 5 6 5 1", "1\n100000", "5\n1 1 1 1 1", "7\n1 2 3 7 6 5 4", "1\n2727", "5\n1 2 3 2 4", "9\n100 12 13 14 15 14 13 12 11", "5\n2 4 5 4 2", "5\n3 3 4 3 2"], "outputs": ["1", "0", "2", "1", "2", "9", "1", "4", "3", "1", "0", "3", "3", "0", "1", "1", "2", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	7
cf6b0edd29a966dde1de8aa4a4467b6b	Mike and Geometry Problem	Mike wants to prepare for IMO but he doesn't know geometry, so his teacher gave him an interesting geometry problem. Let's define f([l,<=r])<==<=r<=-<=l<=+<=1 to be the number of integer points in the segment [l,<=r] with l<=≤<=r (say that ). You are given two integers n and k and n closed intervals [li,<=ri] on OX axis and you have to find: In other words, you should find the sum of the number of integer points in the intersection of any k of the segments. As the answer may be very large, output it modulo 1000000007 (109<=+<=7). Mike can't solve this problem so he needs your help. You will help him, won't you? The first line contains two integers n and k (1<=≤<=k<=≤<=n<=≤<=200<=000) — the number of segments and the number of segments in intersection groups respectively. Then n lines follow, the i-th line contains two integers li,<=ri (<=-<=109<=≤<=li<=≤<=ri<=≤<=109), describing i-th segment bounds. Print one integer number — the answer to Mike's problem modulo 1000000007 (109<=+<=7) in the only line. Sample Input 3 2 1 2 1 3 2 3 3 3 1 3 1 3 1 3 3 1 1 2 2 3 3 4 Sample Output 5 3 6	[ "from collections import defaultdict\r\n\r\nmod=10*9+7\r\nMAXN=300001\r\n\r\ndef power(a,b):\r\n\r\n res=1\r\n while b>0:\r\n if b&1:\r\n res=(resa)%mod\r\n b>>=1\r\n a=(aa)%mod\r\n \r\n return res\r\n\r\nfact=[1 for _ in range(MAXN)]\r\ninv_fact=[1 for _ in range(MAXN)]\r\n\r\nfor i in range(2,MAXN):\r\n fact[i]=(fact[i-1]i)%mod\r\n inv_fact[i]=power(fact[i],mod-2)\r\n\r\ndef ncr(n,r):\r\n if n<r:\r\n return 0\r\n return (((fact[n]inv_fact[r])%mod)inv_fact[n-r])%mod\r\n\r\nn,k=map(int,input().split())\r\n\r\nmp=defaultdict(int)\r\n\r\nend_points=[]\r\n\r\nfor _ in range(n):\r\n l,r=map(int,input().split())\r\n mp[l]+=1\r\n mp[r+1]-=1\r\n\r\nend_points=list(mp.keys())\r\n\r\nend_points.sort()\r\n\r\nans=0\r\ncurr=0\r\n\r\nfor i in range(len(end_points)-1):\r\n curr+=mp[end_points[i]]\r\n ans+=(end_points[i+1]-end_points[i])ncr(curr,k)\r\n if ans>=mod:\r\n ans%=mod\r\n\r\nprint(ans)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef comb(n, r):\r\n return fact[n] inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nl = n + 5\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\nlr = [tuple(map(int, input().split())) for _ in range(n)]\r\ns = set()\r\nfor l, r in lr:\r\n s.add(l)\r\n s.add(r + 1)\r\ns = list(s)\r\ns.sort()\r\nd = dict()\r\nm = len(s)\r\nfor i in range(m):\r\n d[s[i]] = i\r\ncnt = [0] * m\r\nfor l, r in lr:\r\n cnt[d[l]] += 1\r\n cnt[d[r + 1]] -= 1\r\nfor i in range(1, m):\r\n cnt[i] += cnt[i - 1]\r\nans = 0\r\nfor i in range(m - 1):\r\n ans += comb(cnt[i], k) * (s[i + 1] - s[i]) % mod\r\n ans %= mod\r\nprint(ans)", "M=10*9+7\r\nR=210*5\r\nFact=[1](R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(iFact[i-1])%M\r\nFacthyp=[1](R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]Facthyp[n-k]Facthyp[k])%M\r\nn,k=[int(e) for e in input().split()]\r\nE=[]\r\nfor i in range(n):\r\n l,r=[int(e) for e in input().split()]\r\n r+=1\r\n E.append([l,1])\r\n E.append([r,-1])\r\nE.sort()\r\ny=0\r\ni=0\r\nc=0\r\nwhile i<len(E)-1 and E[i][0]<E[-1][0]:\r\n j=i\r\n while j<len(E) and E[j][0]==E[i][0]:\r\n c+=E[j][1]\r\n j+=1\r\n y+=C(c,k)(E[j][0]-E[i][0])\r\n y%=M\r\n i=j\r\nprint(y)", "MOD = 10*9 + 7\r\n\r\nfrom sys import stderr\r\n\r\ndef readints():\r\n return [int(fld) for fld in input().strip().split()]\r\n\r\ndef combk(n, k, MOD=MOD, tbl=[]):\r\n if len(tbl) < k:\r\n tbl += [0] k + [1]\r\n while n >= len(tbl):\r\n tbl.append(tbl[-1] * len(tbl) * pow(len(tbl) - k, MOD-2, MOD) % MOD)\r\n return tbl[n]\r\n\r\ndef main():\r\n n, k = readints()\r\n pairs = [readints() for _ in range(n)]\r\n oplist = [p for l, r in pairs for p in (2l, 2r+1)]\r\n oplist.sort()\r\n count = total = 0\r\n pos = oplist[0] // 2\r\n for op in oplist:\r\n if op & 1:\r\n i, delta = (op+1)//2, -1\r\n else:\r\n i, delta = op//2, 1\r\n total = (total + combk(count, k) * (i - pos)) % MOD\r\n pos = i\r\n count += delta\r\n print(total)\r\n\r\nmain()" ]	{"inputs": ["3 2\n1 2\n1 3\n2 3", "3 3\n1 3\n1 3\n1 3", "3 1\n1 2\n2 3\n3 4", "1 1\n45 70", "1 1\n-35 -8", "1 1\n-79 -51", "2 2\n26 99\n-56 40", "9 6\n-44 -29\n-11 85\n11 84\n-63 1\n75 89\n-37 61\n14 73\n78 88\n-22 -18", "2 2\n-93 -22\n12 72"], "outputs": ["5", "3", "6", "26", "28", "29", "15", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	4
cf86a8bbd6a48bb925bc9ed62354e875	World Cup	The last stage of Football World Cup is played using the play-off system. There are n teams left in this stage, they are enumerated from 1 to n. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the fourth, the fifth — with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over. Arkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids a and b can meet. The only line contains three integers n, a and b (2<=≤<=n<=≤<=256, 1<=≤<=a,<=b<=≤<=n) — the total number of teams, and the ids of the teams that Arkady is interested in. It is guaranteed that n is such that in each round an even number of team advance, and that a and b are not equal. In the only line print "Final!" (without quotes), if teams a and b can meet in the Final. Otherwise, print a single integer — the number of the round in which teams a and b can meet. The round are enumerated from 1. Sample Input 4 1 2 8 2 6 8 7 5 Sample Output 1 Final! 2	[ "x=input().split()\nx=[int(i) for i in x]\nx.sort()\nturn = 1\nwhile(not(x[0]%2==1 and x[1]%2==0 and (x[1]-x[0])==1)):\n\t#print(x[0],x[1])\n\tx[0]=(x[0])//2 + x[0]%2\n\tx[1]=(x[1])//2 + x[1]%2\n\tturn+=1\ncount = 1\nprod=2\nwhile(prod != x[2]):\n\tprod=prod2\n\tcount+=1\nif(count==turn):\n\tprint(\"Final!\")\nelse:\n\tprint(turn)\n", "v, a, b = list(map(int, input().split()))\r\nc = []\r\nm = True\r\ng = 0\r\nfor i in range(v):\r\n c.append([i + 1])\r\nfor i in range(8):\r\n g += 1\r\n for h in range(int(v / 2)):\r\n if len(c) == 2:\r\n print(\"Final!\")\r\n m = False\r\n break\r\n for l in range(len(c[h + 1])):\r\n c[h].append(c[h + 1][l])\r\n c.remove(c[h + 1])\r\n if len(set(c[h]).intersection([a, b])) == 2:\r\n m = False\r\n print(g)\r\n break\r\n if m == False:\r\n break\r\n v = v / 2\r\n", "n,a,b=[int(i) for i in input().split()]\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(i)\r\nnd=0\r\nwhile len(ans)>=2:\r\n newans=[]\r\n for i in range(0,len(ans)-1,2):\r\n if (ans[i]==a and ans[i+1]==b) or (ans[i]==b and ans[i+1]==a):\r\n if (len(ans)==2):\r\n print('Final!')\r\n else:\r\n print(nd+1)\r\n break\r\n elif ans[i]==a or ans[i+1]==a:\r\n newans.append(a)\r\n elif ans[i]==b or ans[i+1]==b:\r\n newans.append(b)\r\n else:\r\n newans.append(ans[i])\r\n nd+=1\r\n ans=newans\r\n", "n, a, b, i, z = map(int, input().split() + [1, 0])\r\nwhile i < n:\r\n if (a - 1)//i == (b - 1)//i:\r\n exit(print(z))\r\n i, z = i 2, z + 1\r\nprint('Final!')", "n, a, b = map(int, input().split())\na -= 1\nb -= 1\na += n\nb += n\n\nres = 0\nwhile a != b:\n # print(a, b)\n a //= 2\n b //= 2\n res += 1\nif a == 1:\n print('Final!')\nelse:\n print(res)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\ncnt = 0\r\nlg = 0\r\nwhile (1 << lg) != n:\r\n lg += 1\r\nfor i in range(lg - 1, -1, -1):\r\n if ((a >> i) & 1) == ((b >> i) & 1):\r\n cnt += 1\r\n else:\r\n break\r\nif cnt == 0:\r\n print('Final!')\r\nelse:\r\n print(lg - cnt)", "import math\n\n\nline = input()\nn, a, b = list(map(int, line.strip().split()))\ntotal = int(math.log2(n))\n\n#print(n, a, b)\nif a > b:\n a, b = b, a\nl, r = 1, n\ncount = 0\nwhile True:\n mid = (l + r) // 2\n if a <= mid and b > mid:\n break\n if a > mid:\n l = mid + 1\n elif b <= mid:\n r = mid\n count += 1\n\nif count == 0:\n print(\"Final!\")\nelse:\n print(total - count)\n\n\n\t\t \t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t\t", "n, a, b = map(int, input().split())\nd = bin((a-1)^(b-1))\nr = len(d) - d.find('1', 2)\nprint('Final!' if r == (n-1).bit_length() else r)\n\n \t \t \t\t \t\t\t \t \t", "def solve():\n dd = input()\n d = dd.split()\n n, a, b = int(d[0]), int(d[1]), int(d[2]),\n count = 1\n while n >= 2:\n m = min(a, b)\n g = max(a, b)\n if m % 2 == 1 and g % 2 == 0 and g == m + 1:\n if n == 2:\n print(\"Final!\")\n else:\n print(count)\n break\n a = a // 2 + 1 if a % 2 == 1 else a / 2\n b = b // 2 + 1 if b % 2 == 1 else b / 2\n count += 1\n n /= 2\n\n\n# main\nif __name__ == \"__main__\":\n solve()\n", "import math\r\nn, a, b = map(int, input().split())\r\n\r\nrmax = int(math.log(n, 2))\r\nr = 1\r\na -= 1\r\nb -= 1\r\nfor i in range(rmax):\r\n if a == b:\r\n break\r\n a = a // 2\r\n b = b // 2\r\n r += 1\r\nif r-1 == rmax:\r\n print(\"Final!\")\r\nelse:\r\n print(r-1)\r\n\r\n", "n, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\n\r\nd = abs(b-a)\r\ni = 1\r\n\r\nwhile (a//(2i) != b//(2i)):\r\n i += 1\r\n\r\nif 2i == n:\r\n print('Final!')\r\nelse:\r\n print(i)", "#931B - World Cup\r\ninp = input().split(' ')\r\nn, a, b = int(inp[0]), int(inp[1]), int(inp[2])\r\na,b = min(a,b) - 1, max(a,b) - 1\r\nrnd, res = 0, -1\r\nwhile (n > 1):\r\n k = n // 2\r\n rnd += 1\r\n if (a < k and b >= k and res == -1):\r\n res = rnd\r\n n,a,b = k, a%k, b%k\r\nif res == 1:\r\n print('Final!')\r\nelse:\r\n print(rnd - res + 1)", "'''input\r\n8 7 5\r\n'''\r\nfrom math import log2 as ln\r\nn, a, b = [int(i) for i in input().split(\" \")]\r\na, b = sorted([a, b])\r\nfn = ln(n)\r\nl = [i for i in range(1, n + 1)]\r\nans = 0\r\nt = 0\r\nfor _ in range(10):\r\n\tm = []\r\n\tif len(l) == 0:\r\n\t\tbreak\r\n\tans += 1\r\n\tfor i in range(0, len(l) - 1, 2):\r\n\t\tif [l[i], l[i + 1]] == [a, b]:\r\n\t\t\tt = 1\r\n\t\t\tbreak\r\n\t\telif l[i] == a:\r\n\t\t\tm.append(a)\r\n\t\telif l[i] == b:\r\n\t\t\tm.append(b)\r\n\t\telif l[i + 1] == a:\r\n\t\t\tm.append(a)\r\n\t\telif l[i + 1] == b:\r\n\t\t\tm.append(b)\r\n\t\telse:\r\n\t\t\tm.append(l[i])\r\n\tif t == 1:\r\n\t\tbreak\r\n\tl = m.copy()\r\nif ans == fn:\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(ans)\t\r\n\r\n\r\n\t\t\r\n\t\r\n\r\n", "n, a, b = (int(x) for x in input().split())\r\na -= 1\r\nb -= 1\r\nans = 0\r\nwhile True:\r\n a = a // 2\r\n b = b // 2\r\n ans += 1\r\n if a == b:\r\n if n == 2:\r\n print(\"Final!\")\r\n else:\r\n print(ans)\r\n break\r\n n = n // 2", "from sys import stdin,stdout\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):\n n,a,b=lst()\n t=[i for i in range(1,n+1)]\n ans=1;f=0\n while 1:\n new=[]\n for i in range(0,len(t),2):\n if t[i] in [a,b] and t[i+1] in [a,b]:\n f=1\n break\n elif t[i] in [a,b] and t[i+1] not in [a,b]:\n new+=[t[i]]\n elif t[i] not in [a, b] and t[i + 1] in [a, b]:\n new += [t[i+1]]\n else:new+=[t[i]]\n if f:break\n t=new.copy()\n ans+=1\n print('Final!' if len(t)==2 else ans)\n\t \t\t\t \t\t\t \t \t\t\t\t\t \t", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\na, b, c = map(int, input().split())\ncnt = 0\nb += a - 1\nc += a - 1\nwhile b != c:\n b >>= 1\n c >>= 1\n cnt += 1\nif b == 1:\n print(\"Final!\")\nelse:\n print(cnt)\n", "import base64\nimport zlib\ns=\"\"\"eJxtkE2OwyAMhfc+hbsCqkz6t4vEtpcYzYKoJLKUOggTaXr7cYcm6qLePGzeZ56ge5pzwTGWFESA\naisPAbjFfhnR4zVMEgFoQDNPj3sy6P0KtKqLxGxdB6ilYCvlRqzcnCJbU6KUltg4eG4cMFNYzVnZ\nzPhNXCw5HOaMhIoSp6VY10qaSPVHSW4wNNjr1n8eAn55PEFfZSNz4DHaU3M5vp7Q0OFwsOf9npz3\n/Xqsly9DHe08d7CNn5VyDbYNo/5D98FirsRh2pk3568GPzr4A0+bXMk=\n\"\"\"\nexec(zlib.decompress(base64.decodebytes(s.encode())).decode())\n\n", "n, a, b = [int(x) for x in input().split()]\r\nif a > b:\r\n a,b=b,a\r\n\r\nimport math as m\r\n# for i in [2,4,8,16,32,64,128,256]:\r\n# print(int(m.log2(i)))\r\nrounds = int(m.log2(n))\r\nmr = rounds\r\nlft, rgt = 1, n\r\n\r\nwhile True:\r\n mdl = (lft + rgt) // 2\r\n if a <= mdl and b > mdl:\r\n break\r\n rounds -= 1\r\n if a <= mdl and b <= mdl:\r\n rgt = mdl\r\n elif a > mdl and b > mdl:\r\n lft = mdl + 1\r\n\r\nif rounds == mr:\r\n print('Final!')\r\nelse:\r\n print(rounds)", "n, a, b, = map(int, input().split())\r\na, b = min(a,b), max(a, b)\r\ni = 1\r\nst = 1\r\nwhile 2 st != n:\r\n st += 1\r\nl, r = 0, n\r\nwhile True:\r\n m = (l + r)//2\r\n if a <= m and b > m :\r\n if i == 1:\r\n print('Final!')\r\n else:\r\n print(st-i +1)\r\n break\r\n else:\r\n if m > a:\r\n r = m\r\n else:\r\n l = m\r\n i += 1", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\ncount = 0\r\nwhile a != b:\r\n count += 1\r\n a //= 2\r\n b //= 2\r\nprint(\"Final!\" if 1<<count == n else count)", "n,a,b=map(int,input().split())\r\na,b,r=a-1,b-1,0\r\nwhile a!=b:\r\n a//=2\r\n b//=2\r\n r+=1\r\nprint(r if 2r<n else 'Final!')", "from math import log2, ceil\r\n\r\nn, a, b = map(int, input().split())\r\na, b = a - 1, b - 1\r\nround = 0\r\nwhile a != b:\r\n round += 1\r\n a, b = a // 2, b // 2\r\nif round == int(ceil(log2(n))):\r\n print(\"Final!\")\r\nelse:\r\n print(round)\r\n", "n, a, b = map(int, input().split())\r\n#arr = list(map(int, input().split()))\r\nif (min(a, b) <= n // 2 and max(a, b) > n // 2):\r\n print('Final!')\r\nelse:\r\n el = a\r\n a = min(a, b)\r\n b = max(el, b)\r\n num1 = (a + 1) // 2\r\n num2 = (b + 1) // 2 \r\n rou = 1\r\n while num1 != num2:\r\n num1 =(num1 + 1) // 2\r\n num2 =(num2 + 1) // 2\r\n rou += 1\r\n print(rou)", "from math import log2\r\n\r\nn, a, b = map(int, input().split())\r\n\r\ncnt = 0\r\nwhile a != b:\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n cnt += 1\r\nif (cnt == log2(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "import math\r\n\r\nn,a,b=map(int,input().split(' '))\r\nrounds=math.log(n,2)\r\nr=int(rounds)\r\nfor i in range(1,int(rounds)+1):\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n if(a==b):\r\n if(i==r):\r\n print('Final!')\r\n break\r\n else:\r\n print(i)\r\n break", "n, a, b = map(int, input().split())\r\n \r\nprint(((a-1)^(b-1)).bit_length() % (n.bit_length()-1) or 'Final!')", "import math\r\nn,a,b=map(int,input().split())\r\na,b=min(a,b),max(a,b)\r\nl=[i+1 for i in range(n)]\r\nres=True\r\nrese=int(math.log2(n))\r\ns=int(math.log2(n))\r\nwhile res:\r\n if len(l)==2:\r\n break\r\n if a in l[:n//2] and b in l[n//2:]:\r\n break\r\n else :\r\n s-=1 \r\n if a in l[:n//2]:\r\n l=l[:n//2]\r\n else:\r\n l=l[n//2:]\r\n n//=2\r\nif s==rese :\r\n print('Final!')\r\nelse:\r\n print(s)\r\n\r\n\r\n", "import math;n,a,b=map(int,input().split())\r\nfor i in range(1,8):\r\n a=math.ceil(a/2);b=math.ceil(b/2)\r\n if a==b:print([i,\"Final!\"][2i==n]);exit(0)\r\nprint(\"Final!\")", "import math\ndef solve(n,a,b):\n\tr = math.log2(n)\n\tc=0;\n\tl = [i for i in range(1,n+1)]\n\t#print(l)\n\twhile(1):\n\t\tc += 1\n\t\t#print(c)\n\t\tif l.index(a)%2==0 and l.index(b)%2==1 and l.index(b)- l.index(a)==1:\n\t\t\tif c==r:\n\t\t\t\treturn 'Final!'\n\t\t\telse:\n\t\t\t\treturn c\n\t\tfor i in range(0,len(l)-1,2):\n\t\t\t#print(len(l))\n\t\t\tif l[i]==a or l[i]==b:\n\t\t\t\tl[i+1]=0\n\t\t\telse:\n\t\t\t\tl[i]=0\n\t\tl=list(filter((0).__ne__, l))\n\nn,a,b = map(int,input().split(' '))\nif a>b:\n\ta,b=b,a\nprint (solve(n,a,b))", "n, a, b = map(int, input().split())\r\nmas = [i for i in range(1,n+1)]\r\nr = 0\r\nans = 0\r\nwhile len(mas)>2 and ans == 0:\r\n mas1 = [0] * (len(mas) // 2)\r\n r += 1\r\n for i in range(0, len(mas), 2):\r\n if (mas[i] == a and mas[i + 1] == b) or (mas[i] == b and mas[i + 1] == a):\r\n ans = r\r\n elif mas[i + 1] == a or mas[i + 1] == b:\r\n mas1[i // 2] = mas[i + 1]\r\n else:\r\n mas1[i // 2 ] = mas[i]\r\n mas = mas1.copy()\r\nif len(mas) == 2 and ((mas[0] == a and mas[1] == b) or (mas[0] == b and mas[1] == a)):\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n#https://t.me/+hgXBq0GzhsgwZTJi пиарю свой тг канал)", "import math\n\nn, a, b = map(int, input().split(\" \"))\n\n# teams = [i+1 for i in range(n)]\n# tuple_list = [(i, i+1) for i in range(1, len(teams), 2)]\n\n# a_index, b_index = None, None\n\n# for index, t in enumerate(tuple_list):\n# if a in t: a_index = index\n# if b in t: b_index = index\n\n# diff = int(math.log2(abs(a_index - b_index)))\n\n# final_round = int(math.log2(n))\n# print(final_round)\n\n# meet_round = 1 + diff\n# print(\"Final!\" if meet_round == final_round else meet_round)\n\nround = 0\n\nwhile a != b:\n a = int((a+1)/2)\n b = int((b+1)/2)\n round += 1\n\nif 1 << round == n: print(\"Final!\")\nelse: print(round)\n\n\n\n", "n, a, b = map(int, input().split())\na -= 1\nb -= 1\nn = len(bin(n)) - 3\ni = 0\nwhile a != b:\n a >>= 1\n b >>= 1\n i += 1\nprint('Final!' if i == n else i)\n", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nc = 1\r\nwhile n > 2 and a // 2 != b // 2:\r\n a //= 2\r\n b //= 2\r\n c += 1\r\n n //= 2\r\nif n == 2:\r\n print(\"Final!\")\r\nelse:\r\n print(c)", "import sys\r\nn,a,b=map(int,input().split())\r\na-=1\r\nb-=1\r\ni=0\r\nwhile n>2:\r\n a//=2\r\n b//=2\r\n n//=2\r\n if a==b:\r\n print(i+1)\r\n sys.exit()\r\n i+=1\r\n \r\nprint('Final!')\r\n", "n,a,b=map(int,input().split())\r\nx=list(range(1,n+1))\r\ny=[]\r\nj=0\r\nwhile len(x)>2:\r\n for i in range(0,n,2):\r\n if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:\r\n print(j+1)\r\n exit()\r\n if x[i+1]==a or x[i+1]==b:\r\n y.append(x[i+1])\r\n else:\r\n y.append(x[i])\r\n x=y.copy()\r\n y=[]\r\n n//=2\r\n j+=1\r\nprint('Final!')\r\n \r\n \r\n \r\n\r\n", "import math\n\nn,a,b = input().split()\n\nn,a,b = int(n), int(a), int(b)\n\na-=1\nb-=1\n\na=format(a, '010b')\nb=format(b, '010b')\n\nfor i in range(len(a)):\n\tif (a[i]!=b[i]):\n\t\tif (len(a)-i==math.log(n,2)):\n\t\t\tprint('Final!')\n\t\telse:\n\t\t\tprint(len(a)-i)\n\t\tbreak", "n, a, b = map(int, input().split())\r\nif a > b:a, b = b, a\r\ndp = [[j for j in range(1, n + 1)] for i in range(n)]\r\nok = row = 1\r\nn //= 2\r\ndone = False\r\nif b%2==0 and a%2==1 and (b-a)==1 and n != 1:\r\n print(1)\r\nelif b%2==0 and a%2==1 and (b-a)==1 and n == 1:\r\n print(\"Final!\")\r\nelse:\r\n while n != 2 and not done:\r\n idx = 0\r\n chk = jmp = lol = 1\r\n while idx < n:\r\n if a in dp[row-1][jmp-1:jmp+1]:toSet = a\r\n elif b in dp[row-1][jmp-1:jmp+1]:toSet = b\r\n else:toSet = 0\r\n dp[row][idx] = toSet\r\n if chk%2==0:\r\n if dp[row][lol - 1] == a and dp[row][lol] == b:\r\n done = True\r\n lol += 2\r\n idx += 1\r\n chk += 1\r\n jmp += 2\r\n ok += 1\r\n if done:break\r\n n //= 2\r\n row += 1\r\n print(ok if n != 2 else \"Final!\")", "from math import \r\n\r\nn, a, b = map(int, input().split())\r\nl = 0\r\nr = n\r\nrounds = 0\r\nwhile 2 * rounds != n:\r\n rounds += 1\r\ncur = rounds\r\na, b = min(a, b), max(a, b)\r\nwhile True:\r\n m = (l + r) // 2\r\n if a <= m and b > m:\r\n break\r\n else:\r\n cur -= 1\r\n if a <= m and b <= m:\r\n r = m\r\n else:\r\n l = m\r\nif cur == rounds:\r\n print(\"Final!\")\r\nelse:\r\n print(cur)", "n,a,b = list(map(int,input().split()))\r\na-=1\r\nb-=1\r\niter = 0\r\nwhile a!=b:\r\n iter+=1\r\n a//=2\r\n b//=2\r\nif (2iter == n):\r\n print(\"Final!\")\r\nelse:\r\n print(iter)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\nres = 0;\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n res += 1\r\nif 2 res == n:\r\n print('Final!')\r\nelse:\r\n print(res)", "n, a, b = map(int, input().split())\nprint(((a - 1) ^ (b - 1)).bit_length() % (n.bit_length() - 1) or 'Final!')", "n,a,b=list(map(int,input().split()))\r\na-=1\r\nb-=1\r\nx=0\r\nwhile n>2:\r\n a//=2\r\n b//=2\r\n n//=2\r\n x+=1\r\n if a==b:\r\n print(x)\r\n break\r\nelse:\r\n print('Final!')", "#!/usr/bin/env python3\n\nimport sys\n\n[n, a, b] = map(int, sys.stdin.readline().strip().split())\n\ndef log2(n):\n\tif n == 1:\n\t\treturn 0\n\telse:\n\t\treturn log2(n // 2) + 1\n\ndef zf(x, d):\n\treturn bin(x)[2:].zfill(d)\n\ndef common_suffix_len(a, b):\n\ti = 0\n\tfor ca, cb in zip(a, b):\n\t\tif ca != cb:\n\t\t\tbreak\n\t\ti += 1\n\treturn i\n\nd = log2(n)\n\nsl = common_suffix_len(zf(a - 1, d), zf(b - 1, d))\nif sl == 0:\n\tprint ('Final!')\nelse:\n\tprint (d - sl)\n", "a, b, c = input().split(' ')\r\na, b, c = int(a), int(b), int (c)\r\nh = 0\r\nf = 1\r\nwhile (a > 1):\r\n h += 1\r\n a = a // 2\r\n if b > a and c > a:\r\n b -= a\r\n c -= a\r\n if f == 1 and((b <= a and c > a) or (b > a and c <= a)):\r\n g = h - 1\r\n f = 0\r\nif g == 0:\r\n print(\"Final!\")\r\nelse:\r\n print(h - g)\r\n \r\n\r\n\r\n\r\n\r\n", "n,a,b=map(int,input().split())\r\na,b,c=a-1,b-1,0\r\nwhile a!=b:\r\n\ta,b,c=a//2,b//2,c+1\r\nif 2*c==n:\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(c)", "n, a, b = map(int, input().split())\r\na, b, v = a - 1, b - 1, 0\r\nwhile a != b:\r\n a, b, v = a >> 1, b >> 1, v + 1\r\nprint('Final!' if n == 1 << v else v)", "n,a,b=map(int,input().split())\r\nif n==2:\r\n print(\"Final!\")\r\n exit(0)\r\na,b=min(a,b),max(a,b)\r\n#print(a,b)\r\nl=list(range(1,n+1))\r\nans=1\r\n\r\nfor i in range(0,len(l),2):\r\n if l[i]==a and l[i+1]==b:\r\n print(ans)\r\n exit(0)\r\nwhile True:\r\n l2=[]\r\n ans+=1\r\n for i in range(0,len(l),2):\r\n if l[i+1]==a or l[i+1]==b:\r\n l2.append(l[i+1])\r\n else:\r\n l2.append(l[i])\r\n if len(l2)==2:\r\n print(\"Final!\")\r\n exit(0)\r\n for i in range(0,len(l2),2):\r\n if l2[i]==a and l2[i+1]==b:\r\n print(ans)\r\n exit(0)\r\n l=l2\r\n ", "import math\r\n\r\ndef powerTwo(n):\r\n power = 0\r\n while(math.pow(2, power) != n):\r\n power += 1\r\n return power\r\n \r\nn, a, b = map(int, input().split())\r\nrounds = 0\r\nwhile ( a != b):\r\n if ( a % 2 != 0):\r\n a += 1\r\n if ( b % 2 != 0):\r\n b += 1\r\n rounds += 1\r\n a //= 2\r\n b //= 2\r\nif (rounds == powerTwo(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(rounds)", "n, a, b = map(int, input().split())\r\n\r\na, b = min(a, b), max(a, b)\r\n\r\nl = 1\r\nr = n\r\n\r\np = 1\r\nf = 0\r\nwhile p < n:\r\n\tp = 2\r\n\tf += 1\r\n\r\ncur = 0\r\n\r\nwhile l < r:\r\n\tm = (l + r) // 2\r\n\r\n\tif l <= a <= m and m < b <= r:\r\n\t\tbreak\r\n\r\n\tif b <= m:\r\n\t\tr = m\r\n\telse:\r\n\t\tl = m + 1\r\n\tcur += 1\r\n\r\nif cur == 0:\r\n\tprint('Final!')\r\nelse:\r\n\tprint(f - cur)\r\n", "n,a,b=map(int,input().split())\r\ndef dq(a,b,l,r,dem):\r\n if a<l or b>r:\r\n return 1000000000\r\n if a<=(l+r)//2 and b>(l+r)//2:\r\n return dem\r\n return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))\r\nif a>b:\r\n a,b=b,a\r\nsv=0\r\n_n=n\r\nwhile _n!=1:\r\n sv=sv+1\r\n _n=_n/2\r\nif sv==sv-dq(a,b,1,n,0):\r\n print(\"Final!\")\r\nelse:\r\n print(sv-dq(a,b,1,n,0))", "a, b, c = map(int, input().split())\r\ncnt = 0\r\nb += a - 1\r\nc += a - 1\r\nwhile b != c:\r\n b >>= 1\r\n c >>= 1\r\n cnt += 1\r\nif b == 1:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n", "import math\r\nn,a,b=map(int,input().split())\r\nk=math.log(n,2)\r\nfor i in range(1,9):\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n if a==b:\r\n break\r\nif i==int(k):\r\n print('Final!')\r\nelse:\r\n print(i//1)\r\n ", "import math\nn,a,b = list(map(int, input().split()))\nm = int(math.log(n,2))\nfor x in range(1,m+1):\n #print(math.ceil(a/(2x)), math.ceil(b/(2x)))\n if math.ceil(a/(2x))== math.ceil(b/(2x)):\n if (x==m):\n print(\"Final!\")\n else:\n print(x)\n exit()\n", "a = list(map(int, input().split()))\nn = a[0]\nf = a[1]\ns = a[2]\na = []\nfor i in range(n):\n a.append(i + 1)\ncount = 0\nwhile len(a) != 2:\n count += 1\n size = len(a)\n index = 0\n temp = []\n for i in range(0, size, 2):\n index += 1\n if (a[i] == f and a[i+1] == s) or (a[i] == s and a[i+1] == f):\n print(count)\n exit()\n elif a[i] == f or a[i] == s:\n temp.append(a[i])\n else:\n temp.append(a[i+1])\n a = temp\n\nprint('Final!')", "a,b,c=[int(i) for i in input().split()]\nr=0\nb-=1\nc-=1\nwhile b!=c:\n b//=2\n c//=2\n r+=1\nif 2*r==a:\n print(\"Final!\")\nelse:\n print(r)\n \t \t\t\t \t \t \t\t \t \t", "n, a, b = map(int, input().split())\nA = [i for i in range(1, n + 1)]\nci = 0\nwhile len(A) > 2:\n ci += 1\n B = []\n for i in range(0, len(A), 2):\n if {A[i], A[i + 1]} == {a, b}:\n print(ci)\n exit(0)\n elif A[i] in {a, b}:\n B.append(A[i])\n else:\n B.append(A[i + 1])\n A = B\nprint('Final!')", "import math\n\n\ndef read():\n return [int(v) for v in input().split()]\n\n\ndef solve(l, n):\n q = 2\n r = []\n l -= 1\n while q <= n:\n r.append(l // q)\n q = 2\n return r\n\n\ndef main():\n n, a, b = read()\n a1, b1 = solve(a, n), solve(b, n)\n\n for i in range(len(a1)):\n if a1[i] == b1[i]:\n if i == len(a1) - 1:\n print('Final!')\n else:\n print(i+1)\n return\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b=[int(i) for i in input().split()]\r\nnd=0\r\nwhile True:\r\n if a%2!=0:\r\n a=(a+1)//2\r\n else:\r\n a=a//2\r\n if b%2!=0:\r\n b=(b+1)//2\r\n else:\r\n b=b//2\r\n if a==b:\r\n nd+=1\r\n break\r\n nd+=1\r\nnk=0\r\nwhile n>2:\r\n n=n//2\r\n nk+=1\r\nif (nk+1)==nd:\r\n print('Final!')\r\nelse:\r\n print(nd)\r\n", "read = lambda: map(int, input().split())\r\nn, a, b = read()\r\ncnt = 0\r\na += n - 1\r\nb += n - 1\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n cnt += 1\r\nif 2 ** cnt == n:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "'''n,cur = map(int,input().split())\nfr = []\nfor i in range(n):\n fr.append(list(map(int,input().split())) + [i + 1])\nfr.sort()\nprint(fr)\nlast = []\ni = 0\nres = []\nwhile i < n and fr[i][0] <= cur:\n if fr[i][1] >= 0:\n cur += fr[i][1]\n res.append(fr[i][2])\n else:\n last.append([fr[i][1],fr[i][0],fr[i][2]])\n i += 1\nfor i in range(len(last)):\n\nprint(len(res))\nprint(res)'''\n\nn,a,b = map(int,input().split())\na -= 1\nb -= 1\na //= 2\nb //= 2\nres = 1\nwhile a != b:\n a //= 2\n b //= 2\n n //= 2\n res += 1\nif n == 2:\n print(\"Final!\")\nelse:\n print(res)", "n, a, b = map(int, input().split())\r\nflag = 2\r\na -= 1\r\nb -= 1\r\ni = 1\r\nwhile flag < n:\r\n if a // flag == b // flag:\r\n print(i)\r\n break\r\n i += 1\r\n flag = 2\r\nelse:\r\n print('Final!')\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nteams = []\r\nfor i in range(n):\r\n teams.append(i + 1)\r\nans = 0\r\nround = 1\r\ntempLst = []\r\nfounded = False\r\nfinal = False\r\nwhile True:\r\n for x in range(0, len(teams), 2):\r\n first = teams[x]\r\n second = teams[x + 1]\r\n if((first == a and second == b) or (first == b and second == a)):\r\n ans = round\r\n founded = True\r\n if(len(teams) == 2):\r\n final = True\r\n break\r\n if(first == a and second != b):\r\n tempLst.append(first)\r\n elif(first == b and second != a):\r\n tempLst.append(first)\r\n elif(second == a and first != b):\r\n tempLst.append(second)\r\n elif(second == b and first != a):\r\n tempLst.append(second)\r\n elif(first != b and second != a):\r\n tempLst.append(first)\r\n if(founded == False):\r\n teams.clear()\r\n teams += tempLst\r\n tempLst.clear()\r\n if(len(teams) > 0):\r\n round += 1\r\n else:\r\n break\r\n else:\r\n break\r\nif(final):\r\n print(\"Final!\")\r\nelse:\r\n print(ans)\r\n", "import math\n\nn, a, b = map(int, input().split())\nrounds = int(math.log(n, 2))\n\na -= 1\nb -= 1\na = (\"000000000000\" + bin(a)[2:])[-8:]\nb = (\"000000000000\" + bin(b)[2:])[-8:]\nfor i, x, y in zip(range(100), a, b):\n if x != y:\n if (len(a) - i == rounds):\n print(\"Final!\")\n else:\n print(len(a) - i)\n break", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nq = []\r\nfor i in range(n // 2):\r\n q.append(((2 i, 2 * i + 1), 1))\r\n\r\ndef wi(p):\r\n if a in p and b in p:\r\n return True\r\n return False\r\n\r\ndef ch(p):\r\n if a in p:\r\n return a\r\n if b in p:\r\n return b\r\n return p[0]\r\n\r\nwhile 1:\r\n if len(q) == 1:\r\n print('Final!')\r\n exit()\r\n p1 = q[0][0]\r\n p2 = q[1][0]\r\n if wi(p1):\r\n print(q[0][1])\r\n exit()\r\n if wi(p2):\r\n print(q[1][1])\r\n exit()\r\n q.append(((ch(p1), ch(p2)), q[0][1] + 1))\r\n del q[0]\r\n del q[0]\r\n", "from collections import deque,Counter\nfrom math import \nimport sys\nimport random\nfrom bisect import \nfrom functools import reduce\nfrom sys import stdin\nimport copy\ninput = lambda: sys.stdin.readline().rstrip()\nn,a,b = map(int,input().split())\npika = copy.deepcopy(n)\nids = [i for i in range(1,n+1)]\nr = 1\nwhile n:\n temp = []\n for i in range(1,len(ids),2):\n x,y = ids[i-1],ids[i]\n if (x == a and y==b) or (y==a and x==b):\n print(\"Final!\" if 2r == pika else r)\n sys.exit()\n if x==a or x==b:\n temp.append(x)\n elif y==a or y==b:\n temp.append(y)\n else:\n temp.append(x)\n ids = temp\n r+=1\n n>>=1\n", "import math\r\n\r\nstr_data = input().split()\r\n\r\ncount = int(str_data[0])\r\na1 = int(str_data[1])\r\na2 = int(str_data[2])\r\n\r\nmax_rounds = math.log(count, 2)\r\nk1 = min(a1, a2)\r\nk2 = max(a1, a2)\r\n\r\ndelimeter = count / 2\r\ncount /= 2\r\nres = int(max_rounds)\r\nwhile not (k1 <= delimeter < k2):\r\n res -= 1\r\n count /= 2\r\n if delimeter < k1:\r\n delimeter += count\r\n else:\r\n delimeter -= count\r\n\r\nif res == max_rounds:\r\n print('Final!')\r\nelse:\r\n print(res)\r\n", "a,b,c=map(int,input().split())\r\ns=0\r\nwhile(c!=b):\r\n c=(c+1)//2\r\n b=(b+1)//2\r\n s+=1\r\n a//=2\r\nif a>1:print(s)\r\nelse:print(\"Final!\")", "import math\r\n\r\n\r\nn, a, b = map(int, input().split())\r\nold_n = n\r\n\r\nif a > b:\r\n a += b\r\n b = a - b\r\n a -= b\r\n\r\nteams = [i for i in range(1, n + 1)]\r\nround = 0\r\nwhile len(teams) != 1:\r\n round += 1\r\n for i in range(0, n, 2):\r\n if teams[i] == a and teams[i + 1] == b:\r\n break\r\n if teams[i] == a or teams[i] == b:\r\n teams[i + 1] = -1\r\n else:\r\n teams[i] = -1\r\n try:\r\n for i in range(n // 2):\r\n teams.remove(-1)\r\n n //= 2\r\n except ValueError:\r\n break\r\nif round == math.log2(old_n):\r\n print('Final!')\r\nelse:\r\n print(round)\r\n", "import math\r\nn,a,b=map(int,input().split())\r\narr=[i for i in range(1,n+1)] \r\ni,r=0,1\r\n#print(arr)\r\nwhile True:\r\n\tarr1=[]\r\n\tfor i in range(0,len(arr),2):\r\n\t\tif (arr[i]==a and arr[i+1]==b) or (arr[i]==b and arr[i+1]==a):\r\n\t\t\tif len(arr)==2:\r\n\t\t\t\tprint(\"Final!\")\r\n\t\t\telse:\r\n\t\t\t\tprint(r) \r\n\t\t\texit(0)\r\n\t\telse:\r\n\t\t\tif arr[i+1]==a or arr[i]==a:\r\n\t\t\t\tarr1.append(a) \r\n\t\t\telif arr[i+1]==b or arr[i]==b:\r\n\t\t\t\tarr1.append(b) \r\n\t\t\telse:\r\n\t\t\t\tarr1.append(arr[i])\r\n\tarr=arr1\r\n\tr+=1\r\n\t#print(arr)\r\n\t\t", "a,b,c=map(int,input().split(' '))\r\npwr=0\r\nwhile a!=1:\r\n pwr+=1\r\n a=a//2\r\nans=1\r\nfor j in range(1,pwr):\r\n if (b-1)//(2j)!=(c-1)//(2*j):\r\n ans+=1\r\nif ans==pwr:\r\n print(\"Final!\")\r\nelse:\r\n print(ans)", "import math\r\n\r\nn, a, b = map(int, input().split())\r\nlst = [i for i in range(1, n + 1)]\r\nclst = []\r\nf = 0\r\ncnt = 0\r\nfound = 0\r\nfinal = 0\r\nwhile len(clst) != 1 and len(lst) != 1:\r\n if len(clst) == 2 or len(lst) == 2:\r\n final = 1\r\n if f == 0:\r\n for i in range(0, n, 2):\r\n if i + 1 < n:\r\n if sorted([lst[i], lst[i + 1]]) == sorted([a, b]):\r\n found = 1\r\n break\r\n if lst[i] in [a, b]:\r\n clst.append(lst[i])\r\n elif i + 1 < n and lst[i + 1] in [a, b]:\r\n clst.append(lst[i + 1])\r\n else:\r\n clst.append(lst[i])\r\n f = 1\r\n lst = []\r\n n = math.ceil(n / 2)\r\n else:\r\n for i in range(0, n, 2):\r\n if i + 1 < n:\r\n if sorted([clst[i], clst[i + 1]]) == sorted([a, b]):\r\n found = 1\r\n break\r\n if clst[i] in [a, b]:\r\n lst.append(clst[i])\r\n elif i + 1 < n and clst[i + 1] in [a, b]:\r\n lst.append(clst[i + 1])\r\n else:\r\n lst.append(clst[i])\r\n clst = []\r\n n = math.ceil(n / 2)\r\n f = 0\r\n cnt += 1\r\n if found == 1:\r\n break\r\nprint(cnt if final == 0 else \"Final!\")", "import math\n\nn, a, b = map(int, input().split())\ni = 2\na, b = min(a, b), max(a, b)\nwhile True:\n if a <= n // i < b:\n break\n if a > n // i:\n a -= n // i\n b -= n // i\n i = 2\nans = math.log(n, 2) - math.log(i, 2) + 1\nif math.log(i, 2) == 1:\n print(\"Final!\")\nelse:\n print(int(ans))", "n, a, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\nr = 1\r\nwhile 2 r < n:\r\n r += 1\r\nleft = 1\r\nright = n\r\nans = r\r\nmid = (left + right) // 2\r\nwhile not (a <= mid and b > mid):\r\n ans -= 1\r\n if b <= mid:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n mid = (left + right) // 2\r\nif ans == r:\r\n print('Final!')\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\nm = len(bin((a - 1) ^ (b - 1))) - 2\nprint('Final!' if m == len(bin(n)) - 3 else m)\n", "n,a,b = map(int,input().split())\r\nz = 0\r\nq = 0\r\nwhile a != b:\r\n z += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\nwhile n != 1:\r\n n //= 2\r\n q += 1\r\nif z == q:\r\n print(\"Final!\")\r\nelse:\r\n print(z)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\ncnt = 1\r\nwhile (a > 0 or b > 0):\r\n a = a // 2\r\n b = b // 2\r\n if (a == b):\r\n if (n > 2):\r\n print(cnt)\r\n else:\r\n print('Final!')\r\n break\r\n cnt += 1\r\n n = n // 2", "n, a, b = [int(k) for k in input().split() if k]\na -= 1\nb -= 1\npower = 1\nwhile a // (2 power) != b // (2 power):\n power += 1\nif 2 power >= n:\n print(\"Final!\")\nelse:\n print(power)", "#!/usr/bin/env python3\n\ndef qlog2(x):\n def __qlog2(x, a):\n return a if x == 1 else __qlog2(x >> 1, a + 1)\n return __qlog2(x, 0)\n\ndef getrnd(a, b):\n c = 0\n while a != b:\n a >>= 1\n b >>= 1\n c += 1\n return c\n\ndef m(n, a, b):\n r = getrnd(a - 1, b - 1)\n maxr = qlog2(n)\n return \"Final!\" if maxr == r else str(r)\n\nif __name__ == \"__main__\":\n print(m(map(int, input().split())))\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a, b = map(int, input().split())\r\np = 2\r\nans = 1\r\nwhile p <= n:\r\n l = 1\r\n ok = 0\r\n while l <= n:\r\n r = l + p - 1\r\n if l <= a <= r and l <= b <= r:\r\n ok = 1\r\n break\r\n l = r + 1\r\n if ok:\r\n break\r\n ans += 1\r\n p = 2\r\nif pow(2, ans) == n:\r\n ans = \"Final!\"\r\nprint(ans)", "n, a, b = map(int, input().split())\r\na, b = min(a, b), max(a, b)\r\nsum = 0;\r\nwhile a != b:\r\n if(n == 2):\r\n print('Final!')\r\n break\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n n = n // 2\r\n sum += 1\r\nelse:\r\n print(sum)", "import math\r\nn,a,b = map(int,input().split())\r\nroun = 1\r\nf = 1\r\nwhile(roun!=int(math.log(n,2))):\r\n a = (a+1)//2\r\n b = (b+1)//2\r\n if(a==b):\r\n f = 0\r\n print(roun)\r\n break\r\n roun+=1\r\nif(f):\r\n print('Final!')\r\n \r\n \r\n ", "import math\r\n\r\n\r\nclass CodeforcesTask931BSolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_a_b = []\r\n\r\n def read_input(self):\r\n self.n_a_b = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n result = 0\r\n table = [x + 1 for x in range(self.n_a_b[0])]\r\n for r in range(int(math.log2(self.n_a_b[0]))):\r\n ntable = [0 for x in range(self.n_a_b[0] // 2 ** (r + 1))]\r\n for x in range(len(table) // 2):\r\n winner = table[x * 2]\r\n if table[x * 2 + 1] in self.n_a_b[1:]:\r\n if winner in self.n_a_b[1:]:\r\n result = r + 1\r\n else:\r\n winner = table[x * 2 + 1]\r\n ntable[x] = winner\r\n table = ntable\r\n if result == int(math.log2(self.n_a_b[0])):\r\n self.result = \"Final!\"\r\n else:\r\n self.result = str(result)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask931BSolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n, a, b = [int(s) for s in input().split()]\r\nk = 0\r\na -= 1\r\nb -= 1\r\nwhile a != b:\r\n k += 1\r\n a //= 2\r\n b //= 2\r\nif 2k == n:\r\n print(\"Final!\")\r\nelse:\r\n print(k)", "c,a,b=input().split()\r\nc=int(c)\r\nlevel=0\r\nwhile c!=1:\r\n level+=1\r\n c//=2\r\na=int(a)-1\r\nb=int(b)-1\r\nroundik=0\r\nwhile a!=b:\r\n roundik+=1\r\n a//=2\r\n b//=2\r\nif roundik==level:\r\n print(\"Final!\")\r\nelse:\r\n print(roundik)", "def main():\r\n n, a, b = [int(x) for x in input().split()]\r\n r = 0\r\n a -= 1\r\n b -= 1\r\n while a != b:\r\n a >>= 1\r\n b >>= 1\r\n r += 1\r\n if 2r == n:\r\n print(\"Final!\")\r\n else:\r\n print(r)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\ndef rec(a,b,count):\r\n if a//2 == b//2:\r\n return count\r\n else:\r\n return rec(a//2,b//2,count+1)\r\n\r\nn,a,b = input().split()\r\nres = rec(int(a)-1,int(b)-1,1)\r\nif res==math.log2(int(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(res)", "s = input().split()\r\nn, a, b = int(s[0]), int(s[1]), int(s[2])\r\n\r\narr = [0 for i in range(n)]\r\n\r\narr[a - 1] = 1\r\narr[b - 1] = 1\r\nk = 0\r\nwhile (len(arr) != 0):\r\n for i in range(0, len(arr), 2):\r\n arr[i] = arr[i] + arr[i + 1]\r\n if len(arr) == 2 and arr[i] == 2:\r\n print('Final!')\r\n exit(0)\r\n elif (arr[i] == 2):\r\n print(k + 1)\r\n exit(0)\r\n arr = arr[::2]\r\n k += 1\r\n", "import math\r\n\r\n\r\ndef recursive_function(s, e, a, b, c):\r\n if (s <= a <= e and s <= b <= e):\r\n c.append(1)\r\n recursive_function(s, (s + e) // 2, a, b, c)\r\n recursive_function(((s + e)// 2) + 1, e, a, b, c)\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n total_number_of_rounds = 0\r\n x = n\r\n while x > 1:\r\n x = x // 2\r\n counter += 1\r\n c = []\r\n recursive_function(1, n, a, b, c)\r\n g = len(c)\r\n if g - 1 == 0:\r\n print(\"Final!\")\r\n else:\r\n print(counter - g + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#main_function()", "n,a,b =map(int,input().split())\r\na+=n-1\r\nb+=n-1\r\ncnt = 0\r\nwhile a!=b:\r\n a=a//2\r\n b=b//2\r\n cnt+=1\r\nif 2cnt==n:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n \r\n \r\n\r\n\r\n", "import sys\r\nfrom math import log\r\ninput = sys.stdin.readline\r\ndef prog():\r\n n,a,b = map(int,input().split())\r\n a -= 1\r\n b -= 1\r\n match = 0\r\n while a != b:\r\n a //= 2\r\n b //= 2\r\n match += 1\r\n if 1 << match == n:\r\n print('Final!')\r\n else:\r\n print(match)\r\nprog()\r\n", "n, a, b = map(int, input().split())\r\nflag = -1\r\nfor i in range(10):\r\n if (2 (i + 1) >= n):\r\n break\r\n a += 2 i\r\n b += 2 i\r\n if (a // (2 (i + 1)) == b // (2 (i + 1))):\r\n flag = i + 1\r\n break\r\nif (flag == -1):\r\n print(\"Final!\")\r\nelse:\r\n print(flag)", "n, a, b = map(int, input().split())\n\na -= 1\nb -= 1\nmask = 1\nround = 1\n\nwhile a != b:\n if a & ~mask == b & ~mask:\n break\n round += 1\n mask = (mask << 1) + 1\n\nprint('Final!' if mask + 1 == n else round)", "def make_tour(people):\r\n teams = []\r\n people.sort()\r\n for i in range(len(people)):\r\n if i % 2 == 0:\r\n teams.append([people[i]])\r\n else:\r\n teams[-1].append(people[i])\r\n return teams\r\n\r\n\r\nn, a, b = map(int, input().split())\r\npeople = []\r\nind = 1\r\nfl = True\r\nfor i in range(1, n + 1):\r\n people.append(i)\r\nwhile True:\r\n teams = make_tour(people)\r\n if len(teams) == 1:\r\n break\r\n for i in range(len(teams)):\r\n if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:\r\n fl = False\r\n print(ind)\r\n break\r\n elif teams[i][0] == a or teams[i][1] == a:\r\n teams[i] = [a]\r\n elif teams[i][0] == b or teams[i][1] == b:\r\n teams[i] = [b]\r\n else:\r\n teams[i] = [teams[i][0]]\r\n if not fl:\r\n break\r\n people = []\r\n for i in range(len(teams)):\r\n for j in range(len(teams[i])):\r\n people.append(teams[i][j])\r\n ind += 1\r\nif fl:\r\n print('Final!')", "n, a, b = map(int, input().split())\nif b > a:\n a, b = b, a\nmas = [i for i in range(1, n+1)]\n\nrnd = 1\nwhile len(mas) >= 2:\n for i in range(len(mas)//2):\n if (mas[i] == b) and (mas[i+1] == a):\n if len(mas) == 2:\n print('Final!')\n mas.pop(0)\n else:\n print(rnd)\n mas.pop(i)\n break\n elif (mas[i] == a) or (mas[i] == b):\n mas.pop(i+1)\n elif (mas[i+1] == a) or (mas[i+1] == b):\n mas.pop(i)\n else:\n mas.pop(i)\n rnd += 1", "from collections import deque\nimport math\nn, a, b = map(int, input().split())\n\n\nteams = [x for x in range(1, n+1)]\nround = 1\ngood = True\nwhile len(teams) > 2 and good:\n temp = []\n for i in range(0, len(teams), 2):\n t1 = teams[i]\n t2 = teams[i+1]\n if (t1 == a and t2 == b) or (t1 == b and t2 == a):\n good = False\n break\n elif t1 == a or t1 == b:\n temp.append(t1)\n elif t2 == a or t2 == b:\n temp.append(t2)\n else:\n temp.append(t1)\n teams = temp\n if good:\n round += 1\nprint(\"Final!\" if round == math.log2(n) else round)\n\n", "import math\r\nn, a, b = [int(el) for el in input().split()]\r\nm=int(math.log(n,2))\r\nfor i in range(1, m+1):\r\n if (a-1)//(2i) == (b-1)//(2i):\r\n if i == m:\r\n print('Final!')\r\n else:\r\n print(i)\r\n break", "def check(n,a,b):\r\n c=n/2\r\n if (b>c and a<=c) or (a>c and b<=c):\r\n return(n)\r\n else:\r\n if a<=c and b<=c:\r\n z=check(c,a,b)\r\n if a>c and b>c:\r\n z=check(c,a-c,b-c)\r\n return z\r\n \r\nn, a ,b= map(int, input().split())\r\nz=check(n,a,b); i=0\r\nif z==n:\r\n print('Final!')\r\nelse:\r\n while z!=1:\r\n z/=2\r\n i+=1\r\n print(i)", "n,a,b=map(int, input().split())\npar=[]\nif a>b:\n\ta,b=b,a\nfor i in range(1,n+1):\n\tpar.append(i)\nrnd=0\nwhile n>=2:\n\tn//=2\n\trnd+=1\nans=1\nwhile True:\n\tt1=par.index(a)\n\tt2=par.index(b)\n\tm=len(par)\n\tif t1==t2-1 and not t1%2:\n\t\tif ans==rnd:\n\t\t\tprint('Final!')\n\t\telse:\n\t\t\tprint(ans)\n\t\texit(0)\n\tans+=1\n\trmi=[]\n\tfor i in range(0,m,2):\n\t\tif par[i]==a or par[i]==b:\n\t\t\trmi.append(par[i+1])\n\t\telse:\n\t\t\trmi.append(par[i])\n\tfor i in rmi:\n\t\tpar.remove(i)", "n, a, b = [int(i) for i in input().split()]\r\na -= 1\r\nb -= 1\r\nresult = 0\r\nwhile a != b:\r\n a >>= 1\r\n b >>= 1\r\n result += 1\r\nif n == 1 << result:\r\n print(\"Final!\")\r\nelse:\r\n print(result)\r\n", "n, a, b = [int(x) - 1 for x in input().split()]\nn += 1\nd = 2\nost_1 = a // d\nost_2 = b // d\nr = 1\nwhile ost_1 != ost_2 and d != n:\n d = 2\n ost_1 = a // d\n ost_2 = b // d\n r += 1\nif d == n:\n print('Final!')\nelse:\n print(r)", "from math import \r\nn,a,b = map(int,input().split())\r\nl = 0\r\nr = n\r\nans = 1\r\ntotal = log2(n)\r\nwhile r > l + 1: \r\n m = (l + r) // 2\r\n if m >= a and m>=b: \r\n r = m\r\n elif m<a and m<b: \r\n l = m\r\n else:\r\n if ans==1:\r\n print('Final!')\r\n else:\r\n print(int(total)-ans+1)\r\n break\r\n ans+=1\r\n", "n, a, b = map(int, input().split())\r\nans = 0\r\na-=1\r\nb-=1\r\n\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n ans += 1\r\nif 2*ans == n:\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n", "# -- coding: utf-8 --\r\n# http://codeforces.com/contest/931/problem/B\r\n\r\ndef match_num(n):\r\n return (n + 1) // 2\r\n\r\ndef rec(r, teams, t1, t2):\r\n if (teams == 2):\r\n return 'Final!'\r\n \r\n m1 = match_num(t1)\r\n m2 = match_num(t2)\r\n \r\n if m1 == m2:\r\n return r\r\n \r\n return rec(r+1, teams//2, m1, m2)\r\n \r\n\r\ndef problem():\r\n \r\n in1 = input()\r\n# in1 = '8 7 5'\r\n \r\n args = list(map(int, in1.split()))\r\n\r\n teams = args[0]\r\n t1 = args[1]\r\n t2 = args[2]\r\n\r\n result = rec(1, teams, t1, t2) \r\n\r\n return result\r\n\r\n \r\nprint(problem())\r\n#problem()", "from math import\r\n\r\nf=input().split()\r\nn=int(f[0])\r\na=bin(int(f[1])-1)[2:]\r\nb=bin(int(f[2])-1)[2:]\r\n\r\nfor i in range(8-len(a)):\r\n a=\"0\"+a\r\nfor i in range(8-len(b)):\r\n b=\"0\"+b\r\nc=\"\"\r\nfor i in range(8):\r\n c=c+str(int(a[i])^int(b[i]))\r\n\r\nc=str(int(c))\r\nif len(c)==log(n, 2):\r\n print('Final!')\r\nelse:\r\n print(len(c))\r\n", "import math\nn,a,b = map(int,input().split())\na,b = min(a,b),max(a,b)\nn1 = math.log(n,2)\nr = 1\nc = n/2\nwhile 1:\n if a<=c and b>c:\n break\n else:\n r+=1\n if b<=c:\n c = c/2\n elif a>c:\n a = a-c\n b = b-c\n c = c/2\nif r==1:\n print('Final!')\nelse:\n print(int(n1-r+1))\n", "n,a,b=map(int,input().split())\r\nc=1\r\nimport math\r\nwhile True:\r\n a=a/2\r\n b=b/2\r\n if math.ceil(a)==math.ceil(b):\r\n if 2*c==n:\r\n c=\"Final!\"\r\n print(c)\r\n break\r\n c+=1\r\n", "import math\r\n\r\narr = list(map(int, input().split()))\r\nn = arr[0]\r\nrounds = math.log2(n)\r\na = arr[1]\r\na = int((a%2 + a)/2)\r\nb = arr[2]\r\nb = int((b%2 + b)/2)\r\nroundCount = 1\r\n\r\nwhile a!=b:\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n roundCount+=1\r\n\r\nif roundCount == rounds:\r\n print (\"Final!\")\r\nelse:\r\n print (roundCount)", "n, a, b = map(int, input().split())\nz = 0\na -= 1\nb -= 1\narr = [1] (2 * n)\narr[n + a] = 2\narr[n + b] = -2\nz = [0] * (2 * n)\ni = n - 1\n#print(arr)\nwhile i >= 1:\n #print(i, 2 * i, len(z))\n arr[i] = arr[i * 2] * arr[i * 2 + 1]\n z[i] = z[i * 2] + 1\n if arr[i] == -4:\n break\n i -= 1\nz = z[i]\n#print(z)\nif 2 z == n:\n print(\"Final!\")\nelse:\n print(z)", "import math\r\nn,a,b=map(int,input().split())\r\nnummatches=int((math.log(n))/(math.log(2)))\r\nA=[]\r\nfor i in range(1,n+1):\r\n A.append(int(i))\r\nround=0\r\nif a>b:\r\n tmp=b\r\n b=a\r\n a=tmp\r\ndef spel(A,a,b):\r\n global round\r\n round+=1\r\n if b>a:\r\n if len(A)==2:\r\n return 'Final!'\r\n elif A.index(a)%2==0 and A.index(b)==A.index(a)+1:\r\n return round\r\n else:\r\n for k in range(0,len(A),2):\r\n if A[k]!=a and A[k]!=b:\r\n A[int(k)]=0\r\n elif A[k]==a or A[k]==b:\r\n A[int(k)+1]=0\r\n while 0 in A:\r\n A.remove(0)\r\n return spel(A,a,b) \r\nprint(spel(A,a,b))\r\n\r\n \r\n\r\n \r\n", "import sys\nimport itertools as it\nimport math\n\nn,a,b = map(int, sys.stdin.readline().split())\n\na-=1\nb-=1\nlogn = int(math.log2(n))\n\nfor k in range(logn):\n if a&(1<<(logn-k-1)) != b&(1<<(logn-k-1)):\n if k==0:\n print('Final!')\n else:\n print(logn-k)\n break\n", "import math\nn, a, b = map(int, input().split())\ni = 1\nf = int(math.log(n, 2))\na -= 1\nb -= 1\nk = f\nfor i in range(f-1, 0, -1):\n\tif a//pow(2, i) != b//pow(2, i):\n\t\tbreak\n\tk -= 1\nif k == f:\n\tprint(\"Final!\")\nelse:\n\tprint(k)\n", "n, a, b = map(int, input().split())\r\nans = 0\r\na -= 1\r\nb -= 1\r\nwhile n > 2:\r\n n //= 2\r\n a //= 2\r\n b //= 2\r\n ans += 1\r\n if a == b:\r\n print(ans)\r\n break\r\nelse:\r\n print(\"Final!\")", "rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}\n\np=list(map(int,input().split()))\nfinal=rounds[p[0]]\ncount=0\nif(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):\n\t\tm=p[1]-1\n\t\tn=p[2]-1\n\t\twhile(m!=n):\n\t\t\tm=m//2\n\t\t\tn=n//2\n\t\t\tcount=count+1\n\t\tif(count==final):\n\t\t\tprint(\"Final!\")\n\t\telse:\n\t\t\tprint(count)\nelse:\n\tprint(\"Final!\")", "from math import log2\r\n\r\n\r\ndef bin_(x):\r\n l_ = ln\r\n\r\n return str(bin(x))[2:].zfill(l_)\r\n\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nln = int(log2(n)) + 1\r\n\r\na_, b_ = bin_(a - 1), bin_(b - 1)\r\n\r\nfor i in range(ln):\r\n if a_[i] != b_[i]:\r\n ans = i\r\n break\r\n\r\nelse:\r\n ans = 0\r\n\r\nprint((ln - ans, 'Final!')[(ln - ans) % (ln - 1) == 0])\r\n", "import math\r\nn,a,b=map(int,input().split())\r\nx=max(a,b)\r\ny=min(a,b)\r\nif x>(n/2) and y<=(n/2):\r\n print(\"Final!\")\r\n exit(0)\r\nelse:\r\n z=math.log(n,2) \r\n while(n!=1):\r\n if y>(n/2):\r\n y-=(n/2)\r\n x-=(n/2)\r\n #print(x,y)\r\n if x>(n/2) and y<=(n/2):\r\n print(int(z))\r\n exit(0)\r\n n=n/2\r\n z-=1\r\n", "def divide(l, r, a, b):\n m = (l + r) // 2\n if a <= m and b > m:\n return 1\n elif b <= m:\n return divide(l, m, a, b) + 1\n elif a > m:\n return divide(m + 1, r, a, b) + 1\n\n\nn, a, b = map(int, input().split())\nif a > b:\n a, b = b, a\n\nnum = divide(1, n, a, b)\ncnt = 0\nwhile n > 0:\n cnt += 1\n n = n >> 1\n\nif num == 1:\n print(\"Final!\")\nelse:\n print(cnt - num)\n", "n, a, b = (int(x) for x in input().split())\r\narr = [i for i in range(1, n + 1)]\r\n# arr[0:2] = [4]\r\n# print(arr)\r\nround = 0\r\nflag = True\r\nwhile len(arr) > 2 and flag:\r\n # print(arr)\r\n round += 1\r\n i = 0\r\n while i < len(arr) - 1:\r\n if a in arr[i:i + 2]:\r\n if b in arr[i:i + 2]:\r\n print(round)\r\n flag = False\r\n break\r\n else:\r\n arr[i:i + 2] = [a]\r\n elif b in arr[i:i + 2]:\r\n arr[i:i + 2] = [b]\r\n else:\r\n arr[i:i + 2] = [arr[i]]\r\n i += 1\r\nif len(arr) == 2 and flag:\r\n print('Final!')\r\n", "from math import ceil\r\n\r\nn, a, b = map(int, input().split())\r\nmax = max(a, b)\r\nmin = min(a, b)\r\nround = 0\r\nwhile(True):\r\n round += 1\r\n max = ceil(max/2)\r\n min = ceil(min/2)\r\n if max == min:\r\n break\r\n\r\nif 2round == n:\r\n print('Final!')\r\nelse:\r\n print(round)", "import math\r\n\r\nn, a, b = tuple(map(int, input().split()))\r\n\r\n\r\n\r\n\r\ndef mr(k,n):\r\n a = [0]\r\n for i in range(n//k):\r\n a.extend([i]k)\r\n return a\r\n\r\n\r\nrounds = {r : mr(2r, 258) for r in range(1,10)}\r\n#print(len(rounds[1]))\r\n\r\ndef sol(a, b):\r\n for i in range(1, 10):\r\n if rounds[i][a] == rounds[i][b]:\r\n return i\r\n return 0\r\n\r\na = sol(a,b)\r\n\r\n\r\nprint(a if a != int(math.log(n,2)) else \"Final!\")", "n, a, b = map(int, input().split())\nif a > b:\n a, b = b, a\nif a <= n // 2 and b > n // 2:\n print('Final!')\nelse:\n a += n - 1\n b += n - 1\n for i in range(100):\n if a == b:\n print(i)\n break\n a //= 2\n b //= 2\n", "from math import log,ceil\r\nn,a,b=map(int,input().split())\r\nround_=1\r\nfinal=log(n,2)\r\n\r\na,b=min(a,b),max(a,b)\r\nwhile(abs(a-b)!=1 or (a%2==0 and b%2==1)):\r\n a=ceil(a/2)\r\n b=ceil(b/2)\r\n round_+=1\r\nif( round_==final) :\r\n print(\"Final!\")\r\nelse:\r\n print(round_)", "n,a,b=map(int,input().split())\nc=0\na -= 1\nb -= 1\nwhile a != b:\n a //= 2\n b //= 2\n c += 1\nif 2c == n:\n print('Final!')\nelse:\n print(c)\n", "n, a, b = list(map(int, input().split()))\r\np2 = 0\r\nwhile 2 * p2 != n:\r\n\tp2 += 1\r\n\r\nr = 0\r\nwhile a != b:\r\n\ta = round(a/2 + 0.001)\r\n\tb = round(b/2 + 0.001)\r\n\tr += 1\r\nif(r == p2):\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(r)", "# \r\n# \r\n# \r\n# * * Author:Aditya Joshi\r\n# * \r\n# \r\n\r\nn, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\nr = 0\r\n\r\nwhile a != b:\r\n\r\n a //= 2\r\n\r\n b //= 2\r\n\r\n r += 1\r\nif 2 * r < n:\r\n print(r)\r\nelse:\r\n print(\"Final!\")\r\n", "def main():\r\n n, a, b = map(int, input().split())\r\n\r\n a, b = min(a, b), max(a, b)\r\n a -= 1\r\n b -= 1\r\n\r\n parts = list(range(n))\r\n\r\n r = 1\r\n\r\n while True:\r\n new_parts = list()\r\n for i in range(0, len(parts), 2):\r\n if parts[i] in {a, b} and parts[i + 1] in {a, b}:\r\n if len(parts) == 2:\r\n print(\"Final!\")\r\n return\r\n else:\r\n print(r)\r\n return\r\n winner = parts[i] if parts[i] in {a, b} else parts[i + 1]\r\n new_parts.append(winner)\r\n parts = new_parts\r\n r += 1\r\n\r\n\r\nmain()\r\n", "n, a, b = [int(s) for s in input().split()]\r\na -= 1\r\nb -= 1\r\nl = 0\r\nwhile a != b:\r\n l -=- 1\r\n a //= 2\r\n b //= 2\r\nprint(l if 2*l != n else 'Final!')", "from copy import \r\ndef main():\r\n n, a, b = map(int,input().split())\r\n t = list(range(1, n + 1))\r\n for i in range(1, 100):\r\n j = 0\r\n # print(t)\r\n t2 = []\r\n while j + 1 < len(t):\r\n k = 0\r\n if (t[j] == a or t[j] == b):\r\n t2.append(t[j])\r\n k += 1\r\n if t[j + 1] == b or t[j + 1] == a:\r\n t2.append(t[j + 1])\r\n k += 1\r\n if k == 0:\r\n t2.append(t[j + 1])\r\n elif k == 2:\r\n if (len(t) == 2):\r\n print(\"Final!\")\r\n else:\r\n print(i)\r\n return\r\n j += 2\r\n t = deepcopy(t2)\r\nmain()\r\n", "n, a, b = [int(i) for i in input().split()]\r\nfinal = ''\r\nrount = 0\r\nif a > b:\r\n if a >= n // 2 + 1 and b <= n / 2:\r\n final = 'Final!'\r\nelse:\r\n if b >= n // 2 + 1 and a <= n / 2:\r\n final = 'Final!'\r\nif final == 'Final!':\r\n print(final)\r\nelse:\r\n while a != b:\r\n a = a // 2 + a % 2\r\n b = b // 2 + b % 2\r\n rount += 1\r\n print(rount)\r\n\r\n", "# UCSD fa22 Week 7\n# pyright: strict\nimport sys\ninput = sys.stdin.readline\nflush = sys.stdout.flush\niil = lambda: [int(x) for x in input().split()]\n\ntests = 1\nfor _ in range(tests):\n n, a,b = iil()\n a -= 1\n b -= 1\n c=0\n while a != b:\n a //= 2\n b //= 2\n n //= 2\n c+= 1\n if n == 1:\n print(\"Final!\")\n else:\n print(c)\n\t\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t", "\r\n\r\n\r\n\r\nn,a,b = map(int,input().split())\r\n\r\na-=1\r\nb-=1\r\n\r\n\r\nans=0\r\n\r\nwhile True:\r\n a//=2\r\n b//=2\r\n ans+=1\r\n\r\n if a==b:\r\n if n==2:\r\n print('Final!')\r\n else:\r\n print(ans)\r\n break\r\n n//=2\r\n", "import math\r\nn,a,b=map(int,input().split())\r\ns=1\r\ne=n\r\ncnt=0\r\n\r\ndef round(s,e,a,b,cnt,n):\r\n cnt+=1\r\n m=(s+e)//2\r\n if s<=a<=m and m+1<=b<=e: \r\n if cnt==1:\r\n print(\"Final!\")\r\n else:\r\n print(int(math.log2(n)-cnt+1))\r\n elif s<=a<=m and s<=b<=m:\r\n round(s,m,a,b,cnt,n)\r\n elif m+1<=a<=e and m+1<=b<=e:\r\n round(m+1,e,a,b,cnt,n)\r\nround(s,e,min(a,b),max(a,b),cnt,n)", "from math import log2\nn, a, b=map(int, input().split())\nn=int(log2(n))\nfor i in range(1,n+1):\n if (a-1)//(2i)==(b-1)//(2i):\n if i==n:\n print(\"Final!\")\n else:\n print(i)\n break;\n\n#print(n)", "n, a, b = map(int, input().split())\r\n\r\nrounds = 2 (n + 1) - 1\r\nt = [set([i, i + 1]) for i in range(1, n, 2)]\r\nbr = 0\r\nans = 1\r\nwhile 1:\r\n #print(t)\r\n for i in range(len(t)):\r\n if a in t[i] and b in t[i]:\r\n br = 1\r\n break\r\n if br:\r\n break\r\n x = len(t)\r\n while x:\r\n x -= 2\r\n t.append(t[0] ^ t[1])\r\n #print(t)\r\n t.remove(t[1])\r\n t.remove(t[0])\r\n #print(t)\r\n ans += 1\r\nif len(t) == 1:\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n \r\n", "n,a,b = map(int,input().split())\r\nx = max(a,b)\r\ny = min(a,b)\r\nn = int(n/2)\r\nc = 0\r\n\r\nif y <= n and x> n:\r\n print(\"Final!\")\r\n \r\nelse:\r\n while a != b:\r\n c += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n print(c) \r\n", "import sys\r\nn,a,b = (int(x) for x in input().split())\r\nif a > b:\r\n a,b = b,a\r\nr = 0\r\nfor i in range(1,9):\r\n if 2i == n:\r\n r = i\r\n break\r\nfor j in range(1,9):\r\n len = 2 ** j\r\n if(j == r):\r\n print(\"Final!\")\r\n sys.exit()\r\n for i in range(1,n + 1,len):\r\n if(a >= i and a < i + len and b>= i and b < i + len):\r\n print(j)\r\n sys.exit()", "n, a, b = map(int, input().split())\nr = 1\nmx = 2\nwhile 1:\n\tr1 = (a+mx-1)//mx\n\tr2 = (b+mx-1)//mx\n\tif r1 == r2:\n\t\tif mx == n:\n\t\t\tprint(\"Final!\")\n\t\telse:\n\t\t\tprint(r)\n\t\tbreak\n\tmx=2 \n\tr+=1", "from math import ceil, log2\r\nn,a,b= map(int, input().split())\r\nans=1\r\nb,a= max(a,b), min(a,b)\r\nwhile ceil(b/pow(2,ans))!=ceil(a/pow(2,ans)):\r\n ans+=1\r\nif ans==log2(n): print(\"Final!\")\r\nelse: print(ans)\r\n", "import math\nimport sys\n\n\ndef main():\n n, a, b = map(int, sys.stdin.readline().split())\n a -= 1\n b -= 1\n\n total_rounds = int(math.log2(n))\n for r in range(1, total_rounds + 1):\n pow2 = 2 * r\n if a // pow2 == b // pow2:\n if r == total_rounds:\n print('Final!')\n else:\n print(r)\n return\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nx=list(map(int,input().split()))\r\nm,a,b=x[0],x[1],x[2]\r\nif a>b:\r\n a,b=b,a\r\nn=0\r\nwhile b-a>1 or (a%2==0 and b%2>0):\r\n a=int(math.ceil(a/2.0))\r\n b=int(math.ceil(b/2.0))\r\n n+=1\r\n m//=2\r\nif m <= 2:\r\n print('Final!')\r\nelse:\r\n print(n+1)\r\n ", "from math import log2\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nans = int(log2(a ^ b) + 1)\r\nif 2 ** ans == n:\r\n print('Final!')\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().strip().split())\r\nif a > b:\r\n a, b = b, a\r\n\r\nr = 1\r\nt = [i+1 for i in range(n)]\r\nwhile True:\r\n s = list()\r\n for i in range(0, len(t), 2):\r\n if t[i] == a and t[i+1] == b:\r\n if len(t) == 2:\r\n print('Final!')\r\n else:\r\n print(r)\r\n exit(0)\r\n elif t[i] == a or t[i+1] == a:\r\n s.append(a)\r\n elif t[i] == b or t[i+1] == b:\r\n s.append(b)\r\n else:\r\n s.append(t[i]) \r\n t = s\r\n r += 1", "from math import log\r\n\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nmax_r = int(log(n, 2)) #n would be power of 2 , bcz there will alaways be even no of matches\r\n #n n//2 n/4......1\r\nc = 0\r\nwhile a // 2 != b // 2: #if a//2==b//2 thwy will be next to each other and then they will fight and one of them will win\r\n a //= 2\r\n b //= 2\r\n n //= 2\r\n c += 1\r\nc += 1\r\n\r\n#our target is that these 2 teams would meet in final,so whatever match they play they will win,,untill unless they both\r\n#are opponent to each other\r\n\r\nprint(\"Final!\" if c == max_r else c)\r\n", "import os.path\r\nimport sys\r\nfrom math import \r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef inp(): return sys.stdin.readline().strip()\r\n\r\nn,a,b=map(int,inp().split())\r\na-=1\r\nb-=1\r\nmatch=0\r\nwhile a!=b:\r\n a//=2\r\n b//=2\r\n match+=1\r\nif (1<<match)==n:\r\n print(\"Final!\")\r\nelse: print(match)", "v, f, s = map(int, input().split())\r\nf, s = f-1, s-1\r\na = list(range(v))\r\nx = []\r\ni = 0\r\nz = True\r\ng = 1\r\nwhile z:\r\n for i in range(0, v, 2):\r\n if a[i+1] == f and a[i] == s or a[i+1] == s and a[i] == f:\r\n print([g, \"Final!\"][v == 2])\r\n exit(0)\r\n elif a[i+1] != f and a[i] == s or a[i+1] != s and a[i] == f:\r\n x.append(a[i])\r\n elif a[i+1] == f and a[i] != s or a[i+1] == s and a[i] != f:\r\n x.append(a[i+1])\r\n else:\r\n x.append(a[i+1])\r\n a = x\r\n v = v//2\r\n x = []\r\n g += 1\r\n", "n, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\nc = 1\r\n\r\nwhile a > 0 or b > 0:\r\n a //= 2\r\n b //= 2\r\n if a == b:\r\n if n > 2:\r\n print(c)\r\n else:\r\n print(\"Final!\")\r\n break\r\n c += 1\r\n n //= 2\r\n", "n,a,b=map(int,input().split())\r\ncnt=0\r\na-=1\r\nb-=1\r\nwhile a!=b:\r\n a=a//2\r\n b=b//2\r\n cnt+=1\r\nprint(cnt if 2cnt<n else 'Final!')", "n, a, b = map(int, input().split())\r\nfor i in range(8):\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n if 2 * (i + 1) == n:\r\n print('Final!')\r\n break\r\n elif a == b:\r\n print(i + 1)\r\n break", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2*(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]2self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2i], self.seg[2i+1])\n\n def update(self, k, x):\n k += self.num\n self.seg[k] = x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2k], self.seg[2k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n res = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n res = self.segfunc(res, self.seg[r])\n if l & 1:\n res = self.segfunc(res, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n return res\n\ndef segfunc(x, y):\n if x <= y:\n return x\n else:\n return y\n\nide_ele = 1018\n\nclass LCA:\n def __init__(self, g, root):\n # g: adjacency list\n # root\n self.n = len(g)\n self.root = root\n\n s = [self.root]\n self.parent = [-1]self.n\n self.child = [[] for _ in range(self.n)]\n visit = [-1]self.n\n visit[self.root] = 0\n while s:\n v = s.pop()\n for u in g[v]:\n if visit[u] == -1:\n self.parent[u] = v\n self.child[v].append(u)\n visit[u] = 0\n s.append(u)\n\n # Euler tour\n tank = [self.root]\n self.eulerTour = []\n self.left = [0]self.n\n self.right = [-1]self.n\n self.depth = [-1]self.n\n\n eulerNum = -1\n de = -1\n\n while tank:\n v = tank.pop()\n if v >= 0:\n eulerNum += 1\n self.eulerTour.append(v)\n self.left[v] = eulerNum\n self.right[v] = eulerNum\n tank.append(~v)\n de += 1\n self.depth[v] = de\n for u in self.child[v]:\n tank.append(u)\n else:\n de -= 1\n if ~v != self.root:\n self.eulerTour.append(self.parent[~v])\n eulerNum += 1\n self.right[self.parent[~v]] = eulerNum\n\n #A = [self.depth[e] for e in self.eulerTour]\n A = [0](2self.n-1)\n for i, e in enumerate(self.eulerTour):\n A[i] = self.depth[e](2self.n-1)+i\n self.seg = SegTree(A, ide_ele, segfunc)\n\n def getLCA(self, u, v):\n # u, v: 0-indexed\n p = min(self.left[u], self.left[v])\n q = max(self.right[u], self.left[v])+1\n m = self.seg.query(p, q)\n return self.eulerTour[m%(2self.n-1)]\n\n\nn, a, b = map(int, input().split())\na, b = a-1, b-1\ncur = n-1\nL = []\nfor i in range(n):\n if i%2 == 1:\n continue\n else:\n L.append((i, i+1))\nL.reverse()\nedge = []\nd = 0\nwhile n!= 1:\n n //= 2\n d += 1\n nL = []\n for i in range(n):\n cur += 1\n u, v = L.pop()\n edge.append((cur, u))\n edge.append((cur, v))\n nL.append(cur)\n if len(nL) == 1:\n break\n L = []\n for i in range(n):\n if i%2 == 1:\n continue\n else:\n L.append((nL[i], nL[i+1]))\n#print(edge)\ng = [[] for i in range(cur+1)]\nfor u, v in edge:\n g[u].append(v)\nlca = LCA(g, root=cur)\nl = lca.getLCA(a, b)\np = lca.depth[a]-lca.depth[l]\n#print(p)\n#print(d)\nif p == d:\n print('Final!')\nelse:\n print(p)\n", "def f(n, aim):\r\n xs = [x for x in range(1, n+1)]\r\n rn = 1\r\n while len(xs) > 2:\r\n new_xs = []\r\n for i in range(len(xs)//2):\r\n f, l = xs[2i], xs[2i+1]\r\n if f in aim and l in aim:\r\n return rn\r\n new_xs.append(f if f in aim else l)\r\n xs = new_xs\r\n rn+=1\r\n return \"Final!\"\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nprint(f(n, [a, b]))\r\n", "# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n# code\r\n\r\nfrom math import log2 as lg\r\ndef f(n,a,b,l,u):\r\n if n <= 1:\r\n return\r\n if a >= l and a <= n//2 + l - 1 and b >= n//2 + l and b <= u:\r\n if n == final:\r\n print('Final!')\r\n else:\r\n print(int(lg(n)))\r\n else:\r\n if b <= n//2 + l - 1:\r\n f(n//2,a,b,l,n//2 + l - 1)\r\n else:\r\n f(n//2,a,b,n//2 + l , u)\r\nif __name__ == \"__main__\":\r\n n,a,b = map(int,input().split())\r\n final = n\r\n if a > b:\r\n a,b = b,a\r\n f(n,a,b,1,n)", "arr = input().split(' ')\r\nn = int(arr[0])\r\na = int(arr[1])\r\nb = int(arr[2])\r\na -= 1\r\nb -= 1\r\nra = a//2\r\nrb = b//2\r\nc = 1\r\nwhile ra!=rb:\r\n ra = ra//2\r\n rb = rb//2\r\n c += 1\r\nif(pow(2,c)==n): print(\"Final!\")\r\nelse: print(c)", "n,a,b = map(int, input().strip().split())\r\na -= 1\r\nb -= 1\r\nans = 1\r\npwr = 2\r\nwhile 1:\r\n if a // pwr == b // pwr:\r\n if pwr == n:\r\n print(\"Final!\")\r\n else:\r\n print(ans)\r\n break\r\n pwr = 2\r\n ans += 1", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn,a,b=map(int,input().split())\r\n\r\nl=0\r\np=1\r\n\r\nwhile(2p<=n):\r\n p=2\r\n l+=1\r\n\r\ncnt=0\r\nwhile(a!=b):\r\n cnt+=1\r\n a=(a+1)//2\r\n b=(b+1)//2\r\n \r\n\r\nif cnt==l:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n\r\n\r\n", "from math import log\r\n\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nmax_r = int(log(n, 2))\r\nc = 0\r\nwhile a // 2 != b // 2:\r\n a //= 2\r\n b //= 2\r\n n //= 2\r\n c += 1\r\nc += 1\r\nprint(\"Final!\" if c == max_r else c)\r\n", "import sys,math\r\nn,a,b=map(int,sys.stdin.readline().split())\r\na-=1 \r\nb-=1 \r\nans=0\r\nflag=True\r\nwhile(n>2):\r\n a//=2 \r\n b//=2 \r\n ans+=1\r\n if a==b:\r\n print(ans)\r\n flag=False\r\n break\r\n n//=2\r\nif flag:\r\n print(\"Final!\")\r\n", "import sys\r\nfrom math import log\r\ninput = sys.stdin.readline\r\nn,a,b = map(int,input().split())\r\nx = [[i] for i in range(1,n+1)]\r\nfor i in range(int(log(n,2))):\r\n for z in x:\r\n if a in z and b in z:\r\n print(i)\r\n sys.exit(0)\r\n new = []\r\n for k in range(0,len(x)//2):\r\n new.append(x[k2]+x[k2+1])\r\n x = new[:]\r\nprint(\"Final!\")\r\n", "n, a, b = map(int, input().split())\r\nc = 0\r\nwhile a != b:\r\n c += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\nif 2 ** c == n:\r\n print('Final!')\r\nelse:\r\n print(c)", "z = list(input().split())\r\nn = int (z[0])\r\na = int (z[1])\r\nb = int (z[2])\r\nif a%2==0:\r\n a=a\r\nelse:\r\n a=a+1\r\nif b%2==0:\r\n b=b\r\nelse:\r\n b=b+1\r\ns1=abs(b-a)\r\nk=0\r\nwhile a!=b:\r\n a=a/2\r\n b=b/2\r\n k=k+1\r\n if a%2==0:\r\n a=a\r\n else:\r\n a=a+1\r\n if b%2==0:\r\n b=b\r\n else:\r\n b=b+1\r\nd=0\r\nwhile n>=2:\r\n n=n/2\r\n d=d+1\r\n \r\nif k+1==d:\r\n print('Final!')\r\nelse:\r\n print(k+1)", "n, a, b = map(int, input().split())\r\na, b = sorted([a, b])\r\nl = [range(1, n + 1)]\r\nres = 1\r\nwhile l:\r\n for i in range(len(l) // 2):\r\n if l[i] == a and l[i + 1] == b:\r\n print(res if len(l) != 2 else \"Final!\")\r\n exit()\r\n if l[i] == a or l[i] == b:\r\n del l[i + 1]\r\n else:\r\n del l[i]\r\n res += 1\r\nprint(res)", "n,a,b = list(map(int,input().strip().split(' ')))\n\nteams = list(range(1,n+1))\nrno = 1\n\nif a > b:\n\ta,b = b,a\n\nwhile True:\n\tif len(teams) == 2:\n\t\tprint('Final!')\n\t\texit(0)\n\telse:\n\t\tnteams = []\n\t\tfor i in range(0,len(teams),2):\n\t\t\tmatch = [teams[i],teams[i+1]]\n\t\t\tif [a,b] == match:\n\t\t\t\tprint(rno)\n\t\t\t\texit(0)\n\t\t\telif a in match:\n\t\t\t\tnteams.append(a)\n\t\t\telif b in match:\n\t\t\t\tnteams.append(b)\n\t\t\telse:\n\t\t\t\tnteams.append(match[1])\n\t\tteams = nteams\n\t\trno += 1\n", "import math\r\nn,a,b=map(int,input().split())\r\nc=0\r\nwhile a!=b:\r\n a=(a+1)//2\r\n b=(b+1)//2\r\n c+=1\r\n n=n//2\r\nif n==1:\r\n print(\"Final!\")\r\nelse:\r\n print(c)", "n, a, b = map(int, input().split())\r\ncnt = 0\r\na-=1\r\nb-=1\r\nwhile a != b:\r\n a//=2\r\n b//=2\r\n n//=2\r\n cnt += 1\r\nif n == 1:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "#!/bin/python3\r\n\r\nimport math, sys\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nfinal = int(math.log2(n))\r\nteams = list(range(1, n+1))\r\n\r\n#print('expecting', final, 'rounds', file=sys.stderr)\r\n#print(teams, file=sys.stderr)\r\nfor round in range(1, final+1):\r\n #print('start round', round, file=sys.stderr)\r\n new_teams = []\r\n a_in, b_in = False, False\r\n for x, y in zip(range(0, len(teams), 2), range(1, len(teams), 2)):\r\n t1, t2 = teams[x], teams[y]\r\n #print(t1, t2, file=sys.stderr)\r\n if {t1, t2} == {a, b}:\r\n #print('(early exit)', file=sys.stderr)\r\n print('Final!' if round == final else round)\r\n sys.exit(0)\r\n elif (a == t1 or a == t2) and not a_in:\r\n #print('ADD A', file=sys.stderr)\r\n new_teams.append(a)\r\n a_in = True\r\n elif (b == t1 or b == t2) and not b_in:\r\n #print('ADD B', file=sys.stderr)\r\n new_teams.append(b)\r\n b_in = True\r\n else:\r\n new_teams.append(t1) # whatever\r\n if len(new_teams) == 0 and set(teams) == {a,b}:\r\n #print('no new set after round', file=sys.stderr)\r\n print('Final!' if round == final else round)\r\n sys.exit(0)\r\n teams = new_teams\r\n #print('after round', round, teams, file=sys.stderr)\r\n", "import math\r\nn,a,b = map(int,input().split())\r\nif(b<a):\r\n a,b = b,a\r\nlogans = 0\r\nnn = n\r\nwhile(nn>1):\r\n logans+=1\r\n nn//=2\r\n#print(logans)\r\nans = logans\r\nwhile(True):\r\n if(a<=n//2 and b>n//2):\r\n if(ans==logans):\r\n print(\"Final!\")\r\n break\r\n else:\r\n print(ans)\r\n break\r\n elif(a<=n//2 and b<=n//2):\r\n ans-=1\r\n n//=2\r\n elif(a>n//2 and b>n//2):\r\n a-=(n//2)\r\n b-=(n//2)\r\n #ans-=1\r\n n//2\r\n \r\n# else:\r\n# for i in range(logans):\r\n# if((a+(2i))==b or (a+(2i)-1)==b):\r\n# print(i+1)\r\n# break\r\n ", "import sys\n\ndef solve(n, a, b):\n k = 0\n while a != b:\n k += 1\n a = (a + 1) // 2\n b = (b + 1) // 2\n return \"Final!\" if 2 * k == n else k\n\nif __name__ == '__main__':\n line = sys.stdin.readline()\n n, a, b = [int(v) for v in line.split(' ')]\n res = solve(n, a, b)\n print(res)\n\n# assert solve(2, 1, 2) == \"Final!\"\n# assert solve(4, 1, 2) == 1\n# assert solve(8, 2, 6) == \"Final!\"\n# assert solve(8, 7, 5) == 2\n", "from math import log2\r\nn, a, b = [int(z) for z in input().split()]\r\nl = int(log2(n))\r\nnew = [0] * 256\r\nnew[a - 1] = 1\r\nnew[b - 1] = 1\r\ncur = []\r\ncnt = 1\r\nwhile True:\r\n for i in range(0, len(new) - 1, 2):\r\n cur.append(new[i] + new[i + 1])\r\n for i in range(len(cur)):\r\n if cur[i] == 2:\r\n if cnt == l:\r\n print(\"Final!\")\r\n else:\r\n print(cnt)\r\n exit(0)\r\n cnt += 1\r\n new = cur\r\n cur = []\r\n ", "n, a, b = map(int, input().split())\r\nnum = 0\r\na += n - 2\r\nb += n - 2\r\nwhile a != b:\r\n a = (a - 1) // 2\r\n b = (b - 1) // 2\r\n num += 1\r\n\r\nif 2 num == n:\r\n print(\"Final!\")\r\nelse:\r\n print(num)", "j=list(map(int,input().split()))\r\nn=j[0]\r\na=j[1]\r\nb=j[2]\r\nm=0\r\nl=1\r\nr=n\r\nk=0\r\np=0\r\nwhile n>1:\r\n n=n//2\r\n m=m+1\r\np=m\r\n \r\nwhile True:\r\n k=(l+r)//2\r\n if a>k and b<=k:\r\n if m==p:\r\n print('Final!')\r\n break\r\n else:\r\n print(m)\r\n break\r\n if a<=k and b>k:\r\n if m==p:\r\n print('Final!')\r\n break\r\n else:\r\n print(m)\r\n break\r\n \r\n if a<=k and b<=k:\r\n r=k\r\n m=m-1\r\n if a>k and b>k:\r\n l=k+1\r\n m=m-1\r\n", "from math import ceil\r\nn,a,b=map(int,input().split())\r\nr,p=1,1\r\nwhile ceil(a/2p)!=ceil(b/2p):\r\n p+=1\r\nif 2(p)==n:print(\"Final!\")\r\nelse:print(p)", "import math\n\nn, a, b = map(int, input().split())\n\na, b = min(a, b), max(a, b)\n\nr = list(range(1, n + 1))\n\n\nit = 0\n\nwhile True:\n r1 = []\n for i, j in zip([iter(r)] 2):\n if i in (a, b):\n if j in (a, b):\n break\n r1.append(i)\n elif j in (a, b):\n r1.append(j)\n else:\n r1.append(i)\n else:\n it += 1\n r = r1.copy()\n continue\n it += 1\n break\n\nprint(it if it != int(math.log2(n)) else \"Final!\")\n\n\n\n", "n,a,b=map(int,input().split())\r\na,b,n=bin(a-1)[2:],bin(b-1)[2:],bin(n-1)[2:]\r\na,b='0'(len(n)-len(a))+a,'0'(len(n)-len(b))+b\r\nfor i in range(len(n)):\r\n if a[i]!=b[i]:\r\n if i==0:\r\n print('Final!')\r\n else:\r\n print(len(n)-i)\r\n quit()\r\n \r\n", "line = input().split(' ')\r\n\r\nn = int(line[0])\r\na = int(line[1])\r\nb = int(line[2])\r\n\r\nteams = list(range(1, n+1))\r\n\r\nrounds=0\r\n\r\nwhile len(teams) > 2:\r\n rounds+=1\r\n \r\n new_teams=[]\r\n\r\n for index in range(0, len(teams)//2):\r\n x = teams[index2]\r\n y = teams[index2 + 1]\r\n\r\n if x==a and y==b or x==b and y==a:\r\n break\r\n\r\n if a in [x, y]:\r\n new_teams.append(a)\r\n\r\n else:\r\n if b in [x, y]:\r\n new_teams.append(b)\r\n\r\n else:\r\n new_teams.append(max(x, y))\r\n\r\n else:\r\n teams=new_teams\r\n continue\r\n\r\n break\r\n \r\nelse:\r\n print(\"Final!\")\r\n\r\nif len(teams) > 2:\r\n print(rounds)\r\n", "n,a,b=map(int,input().split())\r\n\r\na,b,r=a-1,b-1,0\r\n\r\nwhile a!=b:\r\n\r\n a//=2\r\n\r\n b//=2\r\n\r\n r+=1\r\n\r\nprint(r if 2**r<n else 'Final!')\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled" ]	{"inputs": ["4 1 2", "8 2 6", "8 7 5", "128 30 98", "256 128 256", "256 2 127", "2 1 2", "2 2 1", "4 1 3", "4 1 4", "4 2 1", "4 2 3", "4 2 4", "4 3 1", "4 3 2", "4 3 4", "4 4 1", "4 4 2", "4 4 3", "8 8 7", "8 8 5", "8 8 1", "16 4 3", "16 2 4", "16 14 11", "16 3 11", "32 10 9", "32 25 28", "32 22 18", "32 17 25", "32 18 3", "64 40 39", "64 60 58", "64 34 37", "64 26 24", "64 50 43", "64 17 42", "128 116 115", "128 35 33", "128 61 59", "128 116 123", "128 17 15", "128 124 77", "128 4 80", "256 224 223", "256 24 22", "256 199 196", "256 148 159", "256 178 166", "256 75 97", "256 185 200", "256 3 238", "256 128 129", "256 255 129", "256 255 128", "256 129 256", "128 98 69", "128 47 83", "16 2 3", "64 32 30", "8 4 5", "8 7 8", "8 2 3", "8 2 5"], "outputs": ["1", "Final!", "2", "Final!", "Final!", "7", "Final!", "Final!", "Final!", "Final!", "1", "Final!", "Final!", "Final!", "Final!", "1", "Final!", "Final!", "1", "1", "2", "Final!", "1", "2", "3", "Final!", "1", "2", "3", "4", "Final!", "1", "2", "3", "4", "5", "Final!", "1", "2", "3", "4", "5", "6", "Final!", "1", "2", "3", "4", "5", "6", "7", "Final!", "Final!", "7", "Final!", "7", "6", "Final!", "2", "2", "Final!", "1", "2", "Final!"]}	UNKNOWN	PYTHON3	CODEFORCES	173
cf9bfbf389d9d8bdc2c282638d92b467	Dasha and Very Difficult Problem	Dasha logged into the system and began to solve problems. One of them is as follows: Given two sequences a and b of length n each you need to write a sequence c of length n, the i-th element of which is calculated as follows: ci<==<=bi<=-<=ai. About sequences a and b we know that their elements are in the range from l to r. More formally, elements satisfy the following conditions: l<=≤<=ai<=≤<=r and l<=≤<=bi<=≤<=r. About sequence c we know that all its elements are distinct. Dasha wrote a solution to that problem quickly, but checking her work on the standard test was not so easy. Due to an error in the test system only the sequence a and the compressed sequence of the sequence c were known from that test. Let's give the definition to a compressed sequence. A compressed sequence of sequence c of length n is a sequence p of length n, so that pi equals to the number of integers which are less than or equal to ci in the sequence c. For example, for the sequence c<==<=[250,<=200,<=300,<=100,<=50] the compressed sequence will be p<==<=[4,<=3,<=5,<=2,<=1]. Pay attention that in c all integers are distinct. Consequently, the compressed sequence contains all integers from 1 to n inclusively. Help Dasha to find any sequence b for which the calculated compressed sequence of sequence c is correct. The first line contains three integers n, l, r (1<=≤<=n<=≤<=105,<=1<=≤<=l<=≤<=r<=≤<=109) — the length of the sequence and boundaries of the segment where the elements of sequences a and b are. The next line contains n integers a1,<=<=a2,<=<=...,<=<=an (l<=≤<=ai<=≤<=r) — the elements of the sequence a. The next line contains n distinct integers p1,<=<=p2,<=<=...,<=<=pn (1<=≤<=pi<=≤<=n) — the compressed sequence of the sequence c. If there is no the suitable sequence b, then in the only line print "-1". Otherwise, in the only line print n integers — the elements of any suitable sequence b. Sample Input 5 1 5 1 1 1 1 1 3 1 5 4 2 4 2 9 3 4 8 9 3 2 1 4 6 1 5 1 1 1 1 1 1 2 3 5 4 1 6 Sample Output 3 1 5 4 2 2 2 2 9 -1	[ "n,l,r = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nP = list(map(int,input().split()))\r\ns = [0] * n\r\nper=0\r\nfor j in range(n):\r\n s[P[j] - 1] = j\r\nb = [0] * n\r\nb[s[0]] = l\r\nfor j in range(1,n):\r\n last = b[s[j-1]] - A[s[j-1]]\r\n nexs = last+1\r\n \r\n if r - A[s[j]] > last:\r\n b[s[j]] = max(nexs +A[s[j]],l)\r\n else:\r\n per = 1\r\n break\r\nif per == 1:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str,b)))", "n, l, r = [int(el) for el in input().split()]\r\na = [int(el) for el in input().split()]\r\np = [int(el) for el in input().split()]\r\n\r\nb = [a[i] + p[i] for i in range(n)]\r\nmx = max(b)\r\nmn = min(b)\r\nif mx <= r:\r\n\tprint(' '.join([str(el) for el in b]))\r\nelse:\r\n\tdiff = mx - r\r\n\tif mn - diff >= l:\r\n\t\tprint(' '.join([str(el - diff) for el in b]))\r\n\telse:\r\n\t\tprint(-1)\r\n", "R = lambda: map(int, input().split())\r\nn, l, r = R()\r\na, d = list(R()), list(R())\r\nb = [av + cv for av, cv in zip(a, d)]\r\nmi = min(b)\r\nif mi < l:\r\n b = [bv + l - mi for bv in b]\r\nmx = max(b)\r\nif mx > r:\r\n b = [bv - (mx - r) for bv in b]\r\nif l <= min(b) <= max(b) <= r:\r\n print(' '.join(map(str, b)))\r\nelse:\r\n print(-1)", "f = lambda: map(int, input().split())\r\nn, l, r = f()\r\nb = [x + y for x, y in zip(f(), f())]\r\nu, v = l - min(b), r - max(b)\r\nprint(-1 if u > v else ' '.join(str(q + u) for q in b))", "n, l, r = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\ns = set()\r\n\r\nx = []\r\nfor i in range(len(a)):\r\n\tx.append([p[i], i])\r\n\r\nx.sort()\r\nmx = -1000000000000\r\nfor i in range(n):\r\n\tp[x[i][1]] = max(l, mx + a[x[i][1]] + 1)\r\n\tif p[x[i][1]] > r:\r\n\t\tprint('-1')\r\n\t\texit(0)\r\n\tmx = p[x[i][1]] - a[x[i][1]]\r\n\r\nidx = 0\r\nfor i in p:\r\n\tif idx != 0:\r\n\t\tprint(\"\", i, end=\"\")\r\n\telse:\r\n\t\tprint(i, end=\"\")\r\n\t\tidx = 1\r\nprint('')\r\n", "import sys\r\n\r\nN, L, R = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * N\r\nc = list(map(int, input().split()))\r\nd = [i for i in range(N)]\r\n\r\nz = [list(t) for t in zip(c, a, b, d)]\r\nz = sorted(z)\r\n\r\nz[0][2] = L\r\nlast = z[0][2] - z[0][1]\r\n\r\nfor i in range(1, N):\r\n z[i][2] = max(last + 1 + z[i][1], L)\r\n if z[i][2] > R:\r\n print(-1)\r\n sys.exit()\r\n last = z[i][2] - z[i][1]\r\n\r\nz = sorted(z, key=lambda t: t[3])\r\n_, _, res, _ = zip(z)\r\nprint(res)\r\n", "\ndef read_ints():\n return list(map(int, input().split()))\n\ndef solve(n,l,r,a,p):\n pai = [(p[i], a[i], i) for i in range(n)]\n pai.sort()\n bi = [(l,pai[0][2])]\n for i in range(1,n):\n p,aa,idx = pai[i]\n b = max(l, bi[i-1][0] - pai[i-1][1] + aa + 1)\n if b > r:\n return [-1]\n bi.append((b,idx))\n bi.sort(key = lambda x: x[1])\n return [b for b,_ in bi]\n \n\nn,l,r = read_ints()\na = read_ints()\np = read_ints()\nresult = solve(n,l,r,a,p)\nprint(' '.join(map(str,result)))", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\np = list(map(int, input().split()))\n\nans = [0] * n\norder = [0] * n\n\nfor i in range(n):\n order[p[i] - 1] = i\n\ncur = -10*19\nfor o in order:\n bi = max(l, cur + 1 + a[o])\n if bi > r:\n print(-1)\n exit()\n\n ans[o] = bi\n cur = bi - a[o]\n \nprint(ans)", "n, l, r = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\nseg = [0] * n\r\nfor i in range(n):\r\n seg[i] = [l - a[i], r - a[i]]\r\n \r\nsegments = [0] * n\r\nfor i in range(n):\r\n segments[p[i] - 1] = seg[i]\r\n\r\nc = [0] * n\r\ncan = True\r\nl = -(10 ** 18)\r\nfor i in range(n):\r\n if l >= segments[i][1]:\r\n can = False\r\n break\r\n \r\n if segments[i][0] > l:\r\n l = segments[i][0]\r\n else:\r\n l = l + 1\r\n \r\n c[i] = l\r\n \r\nif not can:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n print(c[p[i] - 1] + a[i], end = ' ')", "n, l, r = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\norder = dict()\r\n\r\nfor i in range(len(p)):\r\n order[p[i]] = i\r\n\r\ncurr = -100000000000\r\nb = [-1] * n\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n b[order[i]] = l\r\n curr = b[order[i]] - a[order[i]]\r\n continue\r\n b[order[i]] = max(l, curr + 1 + a[order[i]])\r\n curr = b[order[i]] - a[order[i]]\r\n \r\nfor i in b:\r\n if i > r:\r\n print(-1)\r\n exit()\r\nprint(b)\r\n", "n, l, r = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\npos = []\r\nb = [0] n\r\nfor i in range(n):\r\n pos.append((p[i], i))\r\npos.sort()\r\nb[pos[0][1]] = l\r\nc = [0] * n\r\nc[pos[0][1]] = l - a[pos[0][1]]\r\ncur = c[pos[0][1]]\r\nfor i in range(1, n):\r\n b[pos[i][1]] = cur + 1 + a[pos[i][1]]\r\n cur += 1\r\nm = min(b)\r\nfor i in range(n):\r\n b[i] += (l - m)\r\nif max(b) > r:\r\n print(-1)\r\n exit()\r\nprint(b)", "import os, sys\r\nfrom io import BytesIO, IOBase\r\nfrom math import log2, ceil, sqrt, gcd\r\nfrom _collections import deque\r\nimport heapq as hp\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import cos, sin\r\nfrom itertools import permutations\r\nfrom operator import itemgetter\r\n\r\nsys.setrecursionlimit(5 10 ** 4)\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\npi = 3.1415926535\r\nmod = 998244353\r\n\r\nn, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = [0] * n\r\nck = [i for i in range(n)]\r\nck.sort(key=lambda x: b[x])\r\nlast = -float('inf')\r\nbol=True\r\nfor i in ck:\r\n f=l\r\n ls=r\r\n while f<ls:\r\n mid=(f+ls)//2\r\n if mid-a[i]>last:\r\n ls=mid\r\n else:\r\n f = mid+1\r\n if f-a[i]>last:\r\n ans[i] = f\r\n last = f-a[i]\r\n else:\r\n bol=False\r\n\r\nif not bol:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "from operator import itemgetter\n\nn, l, r = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\np = [int(i) for i in input().split()]\nA = sorted([[a[i], p[i], i, 0] for i in range(n)], key = itemgetter(1))\n\nA[0][3] = l\nc = A[0][3] - A[0][0]\nfor i in range(1, n):\n A[i][3] = max(l, A[i][0]+c+1)\n c = A[i][3] - A[i][0]\n if A[i][3] > r:\n print(-1)\n break\nelse:\n A = sorted(A, key = itemgetter(2))\n for i in range(n):\n print(A[i][3], end=\" \")", "n,l,r = map(int, input().split())\r\nA = [int(i) for i in input().split()]\r\nCord = [int(i) for i in input().split()]\r\nCinv = [0 for _ in range(n)]\r\nfor i in range(n):\r\n Cinv[Cord[i]-1] = i \r\n\r\npmin = -1018\r\nB = [0 for _ in range(n)]\r\nans = True\r\nfor i in range(n):\r\n ad = max(l, pmin+A[Cinv[i]]+1)\r\n B[Cinv[i]] = ad\r\n pmin = B[Cinv[i]]-A[Cinv[i]]\r\n if ad > r:\r\n ans = False\r\n\r\nif ans:\r\n print(B)\r\nelse:\r\n print(-1)\r\n", "n,l,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nc=[]\r\nfor j in range(n):\r\n c.append([p[j],j])\r\nc.sort()\r\nj=0\r\nb=[0](n)\r\npre=-float(\"inf\")\r\nf=0\r\nwhile(j<n):\r\n i=c[j][1]\r\n if l-a[i]>=pre:\r\n b[i]=l\r\n pre=l-a[i]+1\r\n else:\r\n q=pre+a[i]\r\n if q<=r:\r\n b[i]=q\r\n pre=q-a[i]+1\r\n\r\n else:\r\n f=1\r\n break\r\n j+=1\r\nif f==1:\r\n print(-1)\r\nelse:\r\n print(b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, L, R = map(int, input().split())\r\na = [map(int, input().split())]\r\np = sorted((e, i) for i, e in enumerate(map(int, input().split())))\r\nprev = -float('inf')\r\nres = [0] n\r\nfor _, i in p:\r\n l = max(a[i] + prev, L - 1) + 1\r\n if l > R:\r\n print(-1)\r\n exit()\r\n res[i] = l\r\n prev = l - a[i]\r\nprint(res)", "read=lambda: map(int,input().split())\nn,l,r=read()\nmn=l\nA=[-i for i in list(read())]\nB=[0]n\nC=list(enumerate(list(read())))\nC.sort(key=lambda x:x[-1])\nC=[i for i,j in C]\nfor i in range(n):\n B[C[i]]=mn-A[C[i]]\n mn+=1\nd=min(B)\nB=[i-(d-l) for i in B]\nif r-1+l>=n and max(B)<=r and min(B)>=l:print(B)\nelse:print(-1)\n\n\n", "read = lambda: map(int, input().split())\r\nn, l, r = read()\r\na = list(read())\r\np = list(read())\r\nd = [i for i in range(n)]\r\nd.sort(key = lambda x: p[x])\r\ncur = l - a[d[0]]\r\nb = [0] n\r\nfor ind in d:\r\n b[ind] = a[ind] + cur\r\n if b[ind] < l:\r\n cur = l - a[ind]\r\n b[ind] = l\r\n cur += 1\r\nif max(b) > r: \r\n print(-1)\r\n exit()\r\nprint(' '.join(map(str, b)))", "R= lambda: map(int,input().split())\r\nn,l,r= R()\r\na,d=list(R()),list(R())\r\nb=[l for _ in range(n)]\r\nc=[0 for _ in range(n)]\r\nfor i in range(n):\r\n c[d[i]-1]=i\r\ndif=l-a[c[0]]\r\nfor x in c[1:]:\r\n if b[x]-a[x]<=dif: \r\n b[x]=a[x]+dif+1\r\n dif=b[x]-a[x]\r\n if b[x]>r:\r\n print(\"-1\")\r\n exit()\r\nprint(\" \".join(map(str,b)))\r\n \r\n \r\n \r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, l, r = map(int, input().split())\r\na, p = [[int(x) for x in input().split()] for _ in range(2)]\r\nsor, mi, b = sorted(range(n), key=p.__getitem__), l - r, [0] * n\r\n\r\nfor _ in range(n):\r\n i = sor[_]\r\n b[i] = max(l, a[i] + mi)\r\n if b[i] > r:\r\n exit(print(-1))\r\n\r\n mi = b[i] - a[i] + 1\r\n\r\nprint(b)\r\n", "import sys\r\nn, l, r = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\npp = [i for i in range(n)]\r\npp.sort(key = lambda x : p[x] -1)\r\nb = [0] * n\r\nb[pp[0]] = r\r\nc = [pp[0]] * n\r\nc[pp[0]] = b[pp[0]] - a[pp[0]]\r\nfor j in range(1, n):\r\n i = pp[j]\r\n b[i] = a[i] + c[pp[j - 1]] - 1\r\n if b[i] < l:\r\n print(-1)\r\n sys.exit(0)\r\n if b[i] > r:\r\n b[i] = r\r\n #print('b[i] = r')\r\n c[i] = b[i] - a[i]\r\nprint(' '.join([str(i) for i in b]))\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nq = [0] * n\r\nfor i in range(n):\r\n q[p[i] - 1] = i\r\ninf = pow(10, 9) + 1\r\nu = -inf\r\nans = [0] * n\r\nok = 1\r\nfor i in q:\r\n ai = a[i]\r\n v = l - ai\r\n d = max(0, u - v + 1)\r\n if l + d <= r:\r\n ans[i] = l + d\r\n u = l + d - ai\r\n else:\r\n ok = 0\r\n break\r\nif not ok:\r\n ans = [-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\nout = [-1] * n\r\np = list(map(int, input().split()))\r\npp = [(p[i],i) for i in range(n)]\r\npp.sort()\r\n\r\ncurr = -(l+r)\r\nfor v, i in pp:\r\n best = curr + 1 + a[i]\r\n if best < l:\r\n best = l\r\n out[i] = best\r\n curr = best - a[i]\r\n\r\nif max(out) > r:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str,out)))\r\n \r\n", "inp = [int(i) for i in input().strip().split()]\r\nn = inp[0]\r\nl = inp[1]\r\nr = inp[2]\r\na = [int(i) for i in input().strip().split()]\r\nc = [int(i) for i in input().strip().split()]\r\nb = []\r\nmn = 2000000009\r\nmx = -2000000009\r\nfor i in range(n) :\r\n\tb.append(a[i] + c[i] - 1)\r\n\tif b[i] < mn :\r\n\t\tmn = b[i]\r\n\tif b[i] > mx :\r\n\t\tmx = b[i]\r\nif mn >= l and mx <= r :\r\n\tfor i in b :\r\n\t\tprint(i, end = \" \")\r\nelse :\r\n\treq = mx - r\r\n\tif mn - req < l :\r\n\t\tprint(-1)\r\n\telse :\r\n\t\tfor i in b :\r\n\t\t\tprint(i - req, end = \" \")\r\n\r\n" ]	{"inputs": ["5 1 5\n1 1 1 1 1\n3 1 5 4 2", "4 2 9\n3 4 8 9\n3 2 1 4", "6 1 5\n1 1 1 1 1 1\n2 3 5 4 1 6", "5 1 7\n1 4 4 6 5\n5 2 1 4 3", "5 10 100\n12 14 15 11 13\n4 2 1 5 3", "2 1 1000000000\n1000000000 1\n2 1", "2 1 1000000000\n1000000000 1\n1 2", "5 1 5\n1 1 1 1 1\n1 2 3 4 5", "5 1 5\n1 1 1 1 1\n2 3 1 5 4", "1 1000000000 1000000000\n1000000000\n1", "6 3 7\n6 7 5 5 5 5\n2 1 4 3 5 6", "3 5 100\n10 50 100\n3 2 1", "10 1 10\n9 2 9 5 5 2 6 8 2 8\n2 10 1 6 7 8 5 3 9 4", "30 100 200\n102 108 122 116 107 145 195 145 119 110 187 196 140 174 104 190 193 181 118 127 157 111 139 175 173 191 181 105 142 166\n30 26 20 23 27 15 2 14 21 25 6 1 17 10 29 5 3 7 22 19 13 24 18 9 11 4 8 28 16 12", "50 10 15\n13 14 12 14 12 15 13 10 11 11 15 10 14 11 14 12 11 10 10 13 11 13 12 15 14 15 13 15 13 10 12 10 15 15 10 14 11 11 10 14 11 12 13 12 10 11 13 15 14 11\n20 10 25 13 29 6 24 47 37 39 2 44 12 33 9 26 35 49 46 19 38 23 30 5 16 4 21 7 18 45 28 43 1 8 48 15 36 40 50 11 32 27 22 31 42 41 17 3 14 34", "10 8 10\n8 10 10 9 8 10 10 10 10 10\n9 5 6 8 10 2 7 3 1 4", "50 1 50\n6 20 27 26 46 35 41 41 4 12 48 13 20 5 35 7 37 3 18 17 22 42 28 1 30 46 38 38 42 29 33 42 8 45 22 40 11 33 12 15 16 49 30 19 29 40 5 12 32 22\n47 27 35 40 31 26 42 19 11 49 37 3 41 34 36 30 16 44 12 4 46 20 14 39 32 25 18 1 21 6 2 17 48 7 5 24 29 33 50 43 8 15 28 23 22 13 45 38 10 9", "11 5 11\n9 8 7 5 7 5 9 5 10 5 7\n3 4 6 9 5 11 2 10 1 8 7"], "outputs": ["3 1 5 4 2 ", "2 2 2 9 ", "-1", "2 2 1 6 4 ", "10 10 10 10 10 ", "-1", "1 1 ", "1 2 3 4 5 ", "2 3 1 5 4 ", "1000000000 ", "3 3 4 3 5 6 ", "5 5 5 ", "2 3 1 2 3 1 2 2 2 3 ", "100 100 100 100 100 101 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 101 100 100 100 ", "-1", "-1", "-1", "6 6 7 8 6 10 5 9 5 7 8 "]}	UNKNOWN	PYTHON3	CODEFORCES	24
cfa14502e4800d652733f9b4ec565760	Permutation	"Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him. The sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once. You are given an arbitrary sequence a1,<=a2,<=...,<=an containing n integers. Each integer is not less than 1 and not greater than 5000. Determine what minimum number of elements Polycarpus needs to change to get a permutation (he should not delete or add numbers). In a single change he can modify any single sequence element (i. e. replace it with another integer). The first line of the input data contains an integer n (1<=≤<=n<=≤<=5000) which represents how many numbers are in the sequence. The second line contains a sequence of integers ai (1<=≤<=ai<=≤<=5000,<=1<=≤<=i<=≤<=n). Print the only number — the minimum number of changes needed to get the permutation. Sample Input 3 3 1 2 2 2 2 5 5 3 3 3 1 Sample Output 0 1 2	[ "n = int(input())\r\na = input().split()\r\nd = {}\r\nfor i in a:\r\n t = int(i)\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\nres = 0\r\nfor i in range(1, n+1):\r\n if i not in d:\r\n res += 1\r\nprint(res)\r\n", "n=int(input())\r\na={map(int,input().split())}\r\nk=0\r\nfor i in range(1,n+1):\r\n if i not in a:k+=1\r\nprint(k)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nhashmap = [0] 5001\r\nfor x in arr:\r\n\thashmap[x] = 1\r\ncnt = 0\r\nfor x in range(n):\r\n\tif(hashmap[x+1] == 0):\r\n\t\tcnt = cnt + 1\r\nprint(cnt)\r\n", "n = int(input())\r\nmass = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(1, n + 1):\r\n\tif i not in mass:\r\n\t\tk += 1\r\nprint(k)", "n = int(input())\ncount = (n + 1) * [ 0 ]\nfor a in map(int, input().split()):\n if a <= n:\n count[a] += 1\nresult = 0\nfor a in count[1:(n + 1)]:\n if a == 0:\n result += 1\nprint(result)\n", "n = int(input())\na = set(list(map(int,input().split())))\nprint(len(set(range(1,n+1))-a))", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n permutation = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n hash = [0 for i in range(n + 1)]\r\n for i in permutation:\r\n if i <= n:\r\n hash[i] += 1\r\n else:\r\n counter += 1\r\n for i in range(len(hash)):\r\n if i != 0:\r\n if hash[i] > 0:\r\n counter += hash[i] - 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\nans = n\r\nA = set(map(int, input().split()))\r\nfor i in range(1, n + 1):\r\n if i in A:\r\n ans -= 1\r\nprint(ans)", "n = int(input())\r\nlista = [int(i) for i in input().split() if int(i) <= n]\r\nprint(n - len(set(lista)))\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import Counter\r\nn=int(input()) ; arr=list(map(int,input().split())) ; count=Counter(arr) ; dic=dict() ; c=0\r\nfor i in range(1,5001):\r\n dic[i]=0\r\nfor i in count:\r\n dic[i]=count[i]\r\nfor i in range(1,n+1):\r\n if dic[i]==0:\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nnl=[]\r\nc=0\r\nfor i in l:\r\n if i not in nl:\r\n if i>=1 and i<=n:\r\n nl.append(i)\r\n c+=1\r\nprint(n-c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = set(a)\r\ncount = len(a) - len(b)\r\nfor i in b:\r\n if i>n:\r\n count = count+1\r\n else:\r\n pass \r\nprint(count)", "n = int(input())\r\n\r\ns = input().split(' ')\r\n\r\na = [0] * (len(s)+1)\r\n\r\nsum = 0\r\n\r\nfor i in s:\r\n j = int(i)\r\n if j <= len(s):\r\n if a[j] == 0:\r\n a[j] = 1\r\n else:\r\n sum += 1\r\n else:\r\n sum += 1\r\n\r\nprint(sum)\r\n\r\n", "n = int(input())\r\na = set(map(int,input().split()))\r\nr = n-len(a)\r\n\r\nfor x in a :\r\n if x > n :\r\n r += 1\r\nprint(r)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nc=0\r\nfor i in s:\r\n if((i>n) or (i<0)):\r\n c=c+1\r\nc=c+(n-(len(s)))\r\nprint(c)", "n = int(input())\n\nc = 0\n\nx = [int(i) for i in input().split()]\n\nfor i in range(1, n+1):\n\tif i not in x:\n\t\tc += 1\n\nprint(c)\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nseen = []\r\n\r\nfor num in nums:\r\n if num > n:\r\n count += 1\r\n elif num in seen:\r\n count += 1\r\n elif num not in seen: \r\n seen.append(num)\r\n\r\nprint(count)", "def diferencia(l,k):\n t=[]\n for j in k:\n if j not in l:\n t.append(j)\n return t\nn=int(input())\ndata= input()\ndata=data.split()\ndata=[int(i) for i in data]\ndata.sort(reverse=True)\nt=[]\nfor i in range (1,n+1):\n t.append(i)\nt.sort(reverse=True)\nj=diferencia(data,t)\nprint (len(j))\n \t\t \t\t \t \t\t \t \t\t\t \t\t\t \t\t \t \t", "\nminput = input().rstrip().split()\n\nn = int(minput[0])\n\n#d = int(minput[1])\n\nnums = list(map(int, input().rstrip().split()))\n\ncount=0\nhashset=set(nums)\nfor i in range(1,n+1):\n if i not in hashset:\n count+=1\nprint(count)\n\n\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t", "n=int(input())\nlista=list(map(int,input().split()))\nlista2=[]\n \nfor i in range(len(lista)):\n if lista[i]<=n:\n lista2.append(lista[i])\n \nst=set(lista2)\nresultado=n-len(st)\nprint(resultado)\n\t\t\t \t\t \t \t\t\t \t \t\t \t \t \t", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nc=0\r\ngl = [] \r\nfor i in l:\r\n if (i in gl) or (i>n):\r\n c+=1\r\n continue\r\n \r\n gl.append(i)\r\nprint(c)\r\n ", "def arrange(arr):\r\n change=0\r\n for i in range(len(arr)):\r\n if i+1!=arr[i] and i+1 in arr:\r\n a,b=i,arr.index(i+1)\r\n arr[a],arr[b]=arr[b],arr[a]\r\n if i+1!=arr[i]:\r\n change+=1\r\n print(change)\r\nlength=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort(reverse=True)\r\narrange(arr)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nz=0\r\nfor i in range(1,t+1):\r\n if(i not in l):\r\n #print(i)\r\n z=z+1\r\nprint(z)", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nm = set()\r\n\r\nfor i in a:\r\n if i <= n:\r\n m.add(i)\r\n\r\nprint(n - len(m))\r\n", "repetition = int(input())\r\ntest_case = list(map(int, input().split()))\r\nreplace_num = 0\r\nfor num in range(1, repetition + 1):\r\n if(num not in test_case):\r\n replace_num += 1\r\nprint(replace_num)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nres=0\r\nfor i in a:\r\n if i>n:\r\n res+=1\r\n else:\r\n b.append(i)\r\nprint(len(b)-len(set(b))+res)", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, a = int(input()), arr_inp()\r\ndis = list(set(a))\r\nans=n-len(dis)\r\nfor i in dis:\r\n if i > n or i < 1:\r\n ans += 1\r\nprint(ans)\r\n", "z,w,m=input,int,sorted\r\nn=w(z())\r\nl=list(set(map(int,input().split())))\r\nfor i in l:\r\n if i>n:\r\n l.remove(i)\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n\r\n \r\n", "n=int(input()) # no. of inputs\r\nm=list(map(int,input().split())) # storage the input in a list \r\nk = [] # empty which value after looping\r\nfor i in range(1,n+1): # range starts from 1 and goes till n+1 means k will store value till n no.\r\n\tk.append(i) # appending the i to k set\r\nprint(len(set(k)-set(m))) # printing the len after subtracting the k set with set m .", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=[ ]\r\nfor i in range (0,n):\r\n if(ar[i]<=n and ar[i] not in s):\r\n s.append(ar[i])\r\nprint(n-len(s))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint(n-len(set(range(1,n+1))&set(arr)))\r\n", "n = int(input())\r\na, = map(int, input().split())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if i not in a:\r\n ans += 1\r\nprint(ans)\r\n", "from collections import \r\nimport itertools\r\nimport collections\r\n\r\nN = int(input().strip())\r\nA = [int(x) for x in input().strip().split()]\r\nA.sort()\r\ncrt = collections.Counter(A)\r\nprint(sum(1 for k in range(1,N + 1) if crt[k]==0))\r\n", "n = int(input())\r\narr = list(set(list(map(int, input().split()))))\r\ncnt = 0\r\nfor i in arr:\r\n if i < 1 or i > n:\r\n cnt += 1\r\n else:\r\n continue\r\nprint(n-len(arr)+cnt)\r\n", "z=int(input());lst=set()\r\nfor i in input().split():\r\n if int(i)<=z:\r\n lst.add(i)\r\nprint(z-len(lst))\r\n", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ns=set(arr)\r\ncnt=0\r\nfor i in s:\r\n if i>n:\r\n cnt+=1\r\nprint(n-len(s)+cnt)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nx = list(set(arr))\r\nans = n-len(x)\r\nfor i in x:\r\n if i>n:\r\n ans+=1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = set(input()[:-1].split())\r\nc = n - len(w)\r\nw = map(int, w)\r\nfor i in w:\r\n if i > n:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nm={}\r\nfor i in a:\r\n if i in m:\r\n continue\r\n else:\r\n m[i]=1\r\nc=0\r\nfor i in range(1,1+n):\r\n if i in m:\r\n continue\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n+1):\r\n\tb.append(0)\r\nfor i in range(n):\r\n\tif a[i]>n:\r\n\t\tcontinue\r\n\telse:\r\n\t\tb[a[i]]+=1\r\ncount=0\r\nfor i in range(1,n+1):\r\n\tif b[i]==0:\r\n\t\tcount+=1\r\nprint(count)\r\n", "n=int(input())\r\ns=dict()\r\nc=0\r\na=[int (a) for a in input().split()]\r\nfor i in a:\r\n if i in s:\r\n s[i]+=1\r\n else:\r\n s[i]=1\r\nfor i in s:\r\n if i>n:\r\n c+=s[i]\r\n elif s[i]>1:\r\n c+=s[i]-1\r\nprint (c)\r\n", "n = int(input()) ;l = list(map(int,input().split())) ;d = [0] * 5001\r\nfor i in l : d[i] = 1\r\nprint(n-sum(d[:n+1]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nch=0\r\nfor i in range(n):\r\n try:\r\n a.remove(i+1)\r\n except:\r\n ch+=1\r\nprint(ch)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nss=[0](n+1)\r\ncnt=0\r\nfor i in a:\r\n if i<=n:\r\n if ss[i]:\r\n cnt+=1\r\n else:\r\n ss[i]=1\r\n else:\r\n cnt+=1\r\nprint(cnt)\r\n \r\n ", "up = int(input())\r\nnums = input().split()\r\nnums = list(map(int, nums))\r\nnums.sort()\r\nnum_count = len(nums)\r\nresult = 0\r\nlast = None\r\nfor i in nums:\r\n if i > up or i == last:\r\n result += 1\r\n else:\r\n last = i\r\nprint(result)\r\n", "# / \r\n#\r\n# / \\ \| \| / \\ \| \| \| \|\r\n# / __\\ \| \| / __\\ \|--\| \| \|\r\n# / \\ \|__ \| __ / \\ \| \| \\__ /\r\n#\r\n# __ __\r\n# / \\ \| / \| ) / \\ \| )\r\n# / __\\ \|< \|-< / __\\ \|-<\r\n# / \\ \| \\ \|__) / \\ \| \\\r\n#\r\n# * /\r\ndef main():\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n unique_arr = set(arr)\r\n temp = 0\r\n for indx, ele in enumerate(unique_arr):\r\n if ele > n:\r\n temp += 1\r\n\r\n # print(arr)\r\n # print(unique_arr)\r\n # print(temp)\r\n print(len(arr)-len(unique_arr)+temp)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nres=0\r\npre=[0](5002)\r\nfor i in l:\r\n pre[i]+=1\r\nfor i in range(1,n+1):\r\n if (pre[i]==0):\r\n res+=1\r\n\r\nprint(res)", "n=int(input())\na=[int(i) for i in input().split(' ')]\nb=[0](5005+1)\nfor i in a:\n b[i]+=1\nans=0\nfor i in range(1,n+1):\n if b[i]==0:ans+=1\nprint(ans)\n \t \t \t \t \t\t \t \t\t \t\t\t \t\t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nnums = {}\r\nans = 0\r\nfor i in range(n):\r\n if a[i] > n:\r\n ans += 1\r\n elif a[i] in nums:\r\n nums[a[i]] += 1\r\n else:\r\n nums[a[i]] = 1\r\n\r\nfor key in nums:\r\n ans += nums[key] - 1\r\n\r\nprint(ans)\r\n", "print(len({range(1,int(input())+1)}-{map(int,input().split())}))\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\narr = set(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(1, n+1):\r\n if i not in arr:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\nl=set(list(map(int,input().split())))\r\nc=0\r\nfor i in l:\r\n if i>n:\r\n c+=1\r\nprint((n+c)-len(l)) ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n if arr.count(i) > 0:\r\n count += 1\r\n\r\nprint(n - count)", "n = int(input())\r\nprint(n-len(set(x for x in input().split() if int(x) <= n)))\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import \r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nans = 0\r\noriginal = []\r\nfor i in arr:\r\n if i > n:\r\n ans += 1\r\n else:\r\n if i not in original:\r\n original.append(i)\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Permutation():\r\n n = inp()\r\n sequence = inlt()\r\n\r\n count_dict = {}\r\n\r\n for num in sequence:\r\n if num not in count_dict.keys():\r\n count_dict[num] = 0\r\n\r\n count_dict[num] += 1\r\n\r\n elements_to_be_replaced = 0\r\n\r\n for num in count_dict.keys():\r\n if num > n:\r\n elements_to_be_replaced += count_dict[num]\r\n else:\r\n if count_dict[num] >= 2:\r\n elements_to_be_replaced += (count_dict[num]-1)\r\n\r\n print(elements_to_be_replaced)\r\n return \r\n\r\nPermutation()", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\ns = set(map(int, stdin.readline().split()))\r\ncnt = 0\r\n\r\nfor i in range(1, n + 1):\r\n if i not in s:\r\n cnt += 1\r\n\r\nstdout.write(str(cnt))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nnl=[]\r\nfor i in l:\r\n if i not in nl:\r\n if i>=1 and i<=n:\r\n nl.append(i)\r\nprint(n-len(nl))", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\ncheck = [False] n\r\nans = 0\r\nfor el in lst:\r\n if el > n:\r\n ans += 1\r\n else:\r\n if not check[el - 1]:\r\n check[el - 1] = True\r\n else:\r\n ans += 1\r\nprint(ans)", "def str_list_to_int(a):\r\n list_of_integers = list(map(int, a))\r\n return list_of_integers\r\n\r\ndef max_(ss,t):\r\n count = t - len(ss)\r\n for i in ss:\r\n if t < i:\r\n count+=1\r\n return count \r\n\r\nt = int(input())\r\na = input().split()\r\na = str_list_to_int(a)\r\nss = list(set(a))\r\ncount = max_(ss,t)\r\nprint(count)", "def main():\n\tcheck=set()\n\tcount=0\n\tn=int(input())\n\tarr= [int(i) for i in input().split()]\n\tfor i in arr:\n\t\tif (i in check) or i>n:\n\t\t\tcount+=1\n\t\telse:\n\t\t\tcheck.add(i)\n\tprint(count)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n+1):\r\n if i not in a:\r\n ans+=1\r\nprint(ans) ", "def binNumber(n,size):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\n# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n#code\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nc = [0](n+1)\r\nk = 0\r\nfor i in a:\r\n if i > n:\r\n k += 1\r\n else:\r\n c[i] += 1\r\nfor i in range(1,n+1):\r\n if c[i] > 0:\r\n k += (c[i]-1)\r\nprint(k)", "n=int(input())\r\ns=set(map(int,input().split()))\r\ncnt=0\r\nfor i in s:\r\n if i>n:\r\n cnt+=1\r\nprint(n-len(s)+cnt)", "n = int(input())\r\nok = [False]n\r\ninp = input().split(' ')\r\ncount = n\r\nfor i in inp:\r\n i = int(i)-1\r\n if i < n and not ok[i]:\r\n count -= 1\r\n ok[i] = True\r\nprint(count)", "a=set(range(1,int(input())+1))\r\nb=set(map(int,input().split(' ')))\r\nprint(len(a-b))", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n+1):\r\n if i!=l[i-1]:\r\n c+=1 if i not in l else 0\r\nprint(c)", "n = int(input())\r\nactual = list(range(1, n + 1))\r\nother = list(map(int, input().split()))\r\n\r\nactual, other = set(actual), set(other)\r\nfinal = actual - other\r\nprint(len(final))\r\n", "'''\r\ncars = 100\r\nspace_in_a_car = 4.0\r\ndrivers = 30\r\npassengers = 90\r\ncars_not_driven = cars - drivers\r\ncars_driven = drivers\r\ncarpool_capacity = cars_driven * space_in_a_car\r\naverage_passengers_per_car = passengers / cars_driven\r\n\r\nprint(\"there are\" + \" \" ,cars , \"cars available\")\r\nprint(\"there are only\" + \" \" ,drivers, \"drivers only\")\r\nprint(\"there will be \" + \" \",cars_not_driven,\"empty cars today\")\r\nprint(\"We can transport\",carpool_capacity,\"people today\")\r\nprint(\"We have\" + \" \" ,passengers, \"to carpool today\")\r\nprint(\"We habe to put about\",average_passengers_per_car, \"in each other\")\r\n'''\r\n\r\ndict = {}\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if v[i] in dict or v[i] > n:\r\n ans += 1\r\n dict[v[i]] = True\r\nprint(ans)\r\n", "# your code goes here\r\n\r\ns = set()\r\nn = int(input())\r\narr = input().split()\r\nfor i in range(n):\r\n\tarr[i] = int(arr[i])\r\nctr = 0\r\nfor num in arr:\r\n\tif num > n:\r\n\t\tctr += 1\r\n\telse:\r\n\t\tif num in s:\r\n\t\t\tctr += 1\r\n\t\telse:\r\n\t\t\ts.add(num)\r\nprint(str(ctr))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nc=0\r\nfor i in l:\r\n if i>n:\r\n c+=1\r\n elif i in a:\r\n c+=1\r\n else:\r\n a.append(i)\r\nprint(c)", "n=int(input())\r\nx=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if i+1 not in x:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nz=[0]n\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i<=n:\r\n z[i-1]=1\r\nc=0\r\nfor i in z:\r\n if i==0:\r\n c+=1\r\nprint(c)", "import collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\nD=collections.Counter(A)\r\nB=list(D.keys())\r\nC=[x for x in B if x>=1 and x<=n]\r\nC=list(set(C))\r\nprint(n-len(C))", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndone = []\r\ncount = 0\r\nfor i in arr:\r\n if i in done or i > n:\r\n count += 1\r\n else:\r\n done.append(i)\r\nprint(count)", "n=int(input())\nx = list(map(int, input().split()))\nf = [0] 5001\nr=0\nfor i in range(len(x)):\n if x[i] > n:\n r+=1\n x[i] = 0\n f[x[i]] += 1\n\nfor i in range(1, 5001):\n if f[i] > 1:\n r += f[i]-1\n\nprint(r)\n\n", "k = int(input())\r\np = [int(x) for x in input().split()]\r\nl = [0 for x in range(0, len(p))]\r\nc = 0\r\nfor i in p:\r\n if i > k:\r\n c = c + 1\r\n else:\r\n l[i - 1] = l[i - 1] + 1\r\n if l[i-1] > 1:\r\n c = c + 1\r\n\r\n# p.sort()\r\n# c = 0\r\n# print(len(p))\r\n# for i in range(1, len(p)+1):\r\n# print(p[i-1], i)\r\n# if p[i-1] != i:\r\n# c = c + 1\r\nprint(c)\r\n\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\ndictt = {}\r\nfor i in x:\r\n dictt[i] = True\r\n\r\nfor i in range(n):\r\n if dictt.get(i+1, False) == False:\r\n count = count + 1\r\n \r\nprint(count)", "import sys\r\n\r\n_max = int(input())\r\nnums = map(int, input().split())\r\nprint(len(set(range(1, _max + 1)) - set(nums)))", "#from collections import deque,namedtuple\r\ndef main():\r\n n = int(input())\r\n s = set([int(i) for i in range(1,n+1)])\r\n for i in input().split():\r\n if int(i) in s:\r\n s.remove(int(i))\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\ns=[int(i) for i in input().split() if int(i)<=n]\nt=len(set(s))\nprint(n-t)\n \t\t\t \t\t\t \t\t\t \t\t \t\t\n\t\t \t \t\t\t \t \t\t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\ntruelist = list(range(1,n+1))\r\ns = set(l)\r\nans = n - len(s)\r\nfor i in s:\r\n if i not in truelist:\r\n ans+=1\r\nprint(ans)\r\n", "def str_list_to_int(a):\r\n list_of_integers = list(map(int, a))\r\n return list_of_integers\r\n\r\ndef max_(ss,a):\r\n count =0\r\n for i in ss:\r\n if len(a) < i:\r\n count+=1\r\n return count\r\n \r\nt = int(input())\r\na = input().split()\r\na = str_list_to_int(a)\r\nss = list(set(a))\r\ncount = max_(ss,a)\r\nif max(ss) == len(a):\r\n print(len(a)-len(ss))\r\nelse:\r\n print(len(a)-len(ss)+count)\r\n\r\n \r\n\r\n", "k = int(input())\r\nA = [i+1 for i in range(k)]\r\nB = list(map(int,input().split()))\r\nfor x in B:\r\n if(x in A):\r\n A.remove(x)\r\nprint(len(A))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmyset=set(arr)\r\nans=0\r\nfor i in range(1,n+1):\r\n if i not in myset:\r\n ans+=1\r\nprint(ans)", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nimport math\n #num = int(input())\n #arr = list(map(int, input().split()))\n #a,b = map(int, input().split())\n #graph = defaultdict(list)\n #graph[a].append(b)\n #graph[b].append(a)\n #MOD = 10*9 + 7\n\ndef solution():\n n = int(input()) \n arr = list(map(int, input().split()))\n\n numbers = set()\n for val in arr:\n if val <= n:\n numbers.add(val)\n\n print(n - len(numbers))\n\n\n\n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "t=int(input())\n# l=[]\n\nl=list(map(int,input().strip().split()))\n\ns=[]\nfor i in range(1,t+1):\n s.append(i)\nc=0\nfor i in s:\n if i not in l:\n c+=1\n\n\n\nprint(c)\n", "t = int(input())\r\nres = 0\r\narr = list(map(int,input().split()))\r\narr1 = set(arr)\r\nfor i in arr1:\r\n if i > t:\r\n res+=1\r\nprint((len(arr) - len(arr1)) + res)", "n=int(input())\r\narray=set(map(int,input().split()))\r\ncount=0\r\nfor i in array:\r\n\tif i<=n:\r\n\t\tcount+=1\r\nprint(n-count)\r\n", "\r\n\r\n\r\n\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\np=0\r\nfor j in range(1,n+1):\r\n if j not in t:\r\n p+=1\r\n\r\nprint(p)\r\n", "t=int(input())\r\na=[int(_) for _ in input().split()]\r\nk=0\r\nfor i in range(1,t+1):\r\n if i not in a:\r\n k+=1\r\nprint(k)", "# Receiving and adjusting inputs\nn = int(input())\narray = input()\narray = list(map(int, array.split(\" \")))\naux = []\n\nanswer = 0\n# solution\nfor i in range(1, n + 1):\n if array[i-1] in aux or array[i-1] > n: \n answer = answer + 1\n else:\n aux.append(array[i-1])\n# print answer\nprint(answer)", "length = int(input())\r\nfull_list = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nfor i in range(1, length + 1):\r\n if i not in full_list:\r\n counter += 1\r\n \r\nprint(counter)", "from collections import defaultdict\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nd=defaultdict(int)\r\n\r\nfor i in range(len(c)):\r\n\td[c[i]]+=1\r\n\t\r\nrng=list(range(1,n+1))\r\n\r\ntot=0\r\nfor i in range(1,n+1):\r\n\tif i not in d.keys():\r\n\t\ttot+=1\r\nprint(tot)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nc=0\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor i in range(1,n+1):\r\n if i in d:\r\n continue\r\n else:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nre = 0\r\nhas = [False] (n + 1)\r\nfor i in a:\r\n if i <= n:\r\n if has[i]:\r\n re += 1\r\n else:\r\n has[i] = True\r\n else:\r\n re += 1\r\n\r\nprint(re)", "i = int(input())\r\nl = set(list(map(int,input().split())))\r\nx = 0\r\nfor num in range(1,i+1):\r\n if num not in l:\r\n x += 1\r\nprint(x)", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nf = [0] * 5000\r\nfor x in a :\r\n f[x] += 1\r\n\r\nans = 0\r\nfor i in range(5000) :\r\n if i < n and f[i] > 1 :\r\n ans += f[i] - 1\r\n elif i >= n :\r\n ans += f[i]\r\nprint(ans)\r\n", "#137B (82No. Problem B)\r\nn = int(input())\r\nper = list(set(map(int,input().split())))\r\nc = 0\r\ntemp = []\r\nfor i in range(n):\r\n temp.append(i+1)\r\n\r\nfor i in range(len(per)):\r\n if (per[i] in temp):\r\n c+=1\r\nprint(n-c) ", "n = int(input())\r\nstr = input()\r\nls = [int(u) for u in str.split()]\r\n#print(ls)\r\ncount = 0\r\nfor i in range(1, n+1):\r\n cond = False\r\n for u in ls:\r\n if i == u:\r\n cond = True\r\n break\r\n if cond == True:\r\n continue\r\n else:\r\n count += 1\r\nprint(count)", "from collections import defaultdict\r\ndd = defaultdict(int)\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nper = [x for x in range(1, n + 1)]\r\nfor x in arr:\r\n dd[x] += 1\r\n\r\nans = 0\r\n\r\nfor x in per:\r\n if dd[x] == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = map(int, input().split())\r\nc = Counter(a)\r\n\r\nr = n - sum([bool(c[i]) for i in range(1, n + 1)])\r\nprint(r)", "from collections import Counter\r\n\r\nn = int(input())\r\nnums = Counter(map(int, input().split()))\r\nresult = 0 \r\nfor num, count in nums.items():\r\n if num > n:\r\n result += count\r\n elif count > 1 :\r\n result += count - 1\r\n \r\nprint(result)", "n=int(input())\r\nprint(len({range(1,n+1)}-{map(int,input().split())}))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[i for i in range(1,n+1)]\r\nb=set(b)\r\na=set(a)\r\nprint(len(b-a))", "n = int(input())\narr = [int(x) for x in input().split()]\n\ngood = [False] * (n+1)\nfor i in arr:\n if i <= n and not good[i]:\n good[i] = True\n\nprint(n-good.count(True))", "n = int(input())\r\ns = set(x for x in list(map(int, input().split())) if 1 <= x <= n)\r\nprint(n - len(s))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0; d = {}\r\nfor i in a: d[i] = d.get(i,0) + 1\r\nfor i in d:\r\n if d[i] > 1 and i<=n :\r\n count += d[i] - 1\r\n elif i>n:\r\n count += d[i]\r\nprint(count)", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_nums(nums):\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\nn = read_int()\r\nnums = [_ for _ in read_ints() if _ <= n]\r\nprint(n - len(set(nums)))", "N = int(input())\r\n\r\nM = list(map(int, input().split()))\r\n\r\nused = set()\r\nans = 0\r\nfor m in M:\r\n if m not in used and m >= 1 and m <= N:\r\n used.add(m)\r\n else:\r\n ans += 1\r\nprint(ans) ", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nc = Counter(nums)\r\nc2 = Counter(list(range(1,n+1)))\r\n\r\ntot = 0\r\nc3 = c-c2\r\nfor i in c3:\r\n tot += c3[i]\r\nprint(tot)", "for _ in range(1):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=[i for i in range(1,n+1)]\r\n cnt=0;\r\n for i in s:\r\n if i not in a:\r\n cnt=cnt+1\r\n print(cnt)", "x=int(input());l1=list(map(int,input().split()));l=[]\r\nfor i in l1:\r\n\tif i<=x and i not in l: l.append(i)\r\nprint(x-len(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=0\r\nfor i in range(1,n+1):\r\n if i in l:\r\n r+=1\r\nprint(n-r)", "def get_ans():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(1,n+1):\r\n if i not in l:\r\n #print(i)\r\n ans+=1\r\n return ans\r\nans = get_ans()\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\ntot = 0\r\nif max(s) <= n:\r\n print(n - len(s))\r\nelse:\r\n more = list(filter(lambda x: x > n, l))\r\n less = set(filter(lambda x: x<=n , l))\r\n print(((n - len(more)) - len(less)) + len(more))", "h=int(input())\r\nn=list(map(int,input().split()))\r\nc=0;v=[]\r\nfor i in range(h):\r\n if n[i]>h:\r\n c=c+1\r\n if n[i]<h+1:\r\n v.append(n[i])\r\n\r\na=set(v)\r\nb=len(v)-len(a)\r\nprint(b+c)\r\n\r\n \r\n", "from collections import Counter\r\ndef solve():\r\n n=int(input());a=Counter(list(map(int,input().split())))\r\n c=0\r\n for i in a:\r\n if i<=n:c+=1\r\n print(n-c)\r\nsolve()", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=set(a);cn=0\r\nfor i in c:\r\n if i >n:cn+=1\r\nprint(n-len(c)+cn)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nm.sort()\r\nco=0\r\nfor t in range(n):\r\n t+=1\r\n if t in m:\r\n pass\r\n else:\r\n co+=1\r\nprint(co)\r\n", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nchange = 0\r\n\r\nnum_set = set(num)\r\n\r\nfor i in range(1,n+1):\r\n if i not in num_set:\r\n change += 1\r\n\r\nprint(change)\r\n\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nv=1\r\ns=0\r\nk=0\r\nwhile s<n:\r\n if v in ar:\r\n k+=1\r\n v+=1\r\n s+=1\r\nprint(n-k)", "I=input\r\nn=int(I())\r\nprint(n-len([i for i in set(list(map(int,I().split()))) if i<=n]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nfrom collections import Counter as cnt\r\nc,ans=cnt(a),0\r\nfor i in range(1,n+1):\r\n if c.get(i)==None:\r\n ans+=1\r\nprint(ans)", "n= int(input())\r\ns= [int(x) for x in input().split()]\r\nc=0\r\nfor i in set(s):\r\n if i<=n:c+=1\r\nprint(n-c)", "n = int(input())\r\ns = set(map(int,input().split()))\r\ncnt = 0\r\nfor i in s:\r\n if i <= n:\r\n cnt+=1\r\nprint(n-cnt)\r\n ", "no=list()\r\nn=int(input())\r\nu=set()\r\nno=map(int,input().split(\" \"))\r\nfor i in no:\r\n if(i<=n):\r\n u.add(i)\r\nprint(n-len(u))\r\n ", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ns1=set(s)\r\nt=0\r\nq=0\r\nfor i in s1:\r\n if i<=n:\r\n t+=1\r\n else:\r\n q+=1\r\nm=max(s1)\r\nif q==n:\r\n print(n)\r\nelif m>n and q<n:\r\n print(n-len(s1)+q)\r\nelse: \r\n print(n-len(s1))", "n = int(input())\r\na = set(list(map(int, input().split())))\r\nc = 0 \r\nfor i in a:\r\n if(i <= n):\r\n c += 1 \r\nprint(n - c)", "n = int(input())\r\nfl = input()\r\nvalues = fl.split(\" \")\r\nref = []\r\nsum = 0\r\n\r\nfor number in values:\r\n if int(number) in ref or int(number) > n:\r\n sum += 1\r\n else:\r\n ref.append(int(number))\r\nprint(sum)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA = set(A)\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i not in A:\r\n ans += 1\r\nprint(ans)\r\n", "from functools import lru_cache, wraps\nfrom sys import stderr, stdin\n\nimport time\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\n\n\n# Decorators\ndef print_to_file(function, file=stderr):\n def wrapped(args, kwargs):\n res = function(args, *kwargs)\n print(res, file=file)\n return res\n\n return wrapped\n\n\ndef time_it(function, output=stderr):\n def wrapped(args, *kwargs):\n start = time.time()\n res = function(args, *kwargs)\n elapsed_time = time.time() - start\n print('Function \"%s\" took %f ms' % (function.__name__, elapsed_time 1000),\n file=output)\n return res\n\n return wrapped\n\n\n@time_it\ndef main():\n n = int(input())\n nums = map(int, input().split())\n print(n - len(set(num for num in nums if num <= n)))\n\n\n# Auxiliary functions\n@print_to_file\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\n# IO reassignment\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n l_print = print\n\n def print(args, kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return l_print(args, *kwargs)\n\n\nif __name__ == '__main__':\n # set_input(open(\"sum.in\", \"r\"))\n # set_output(open(\"sum.out\", \"w\"))\n main()\n", "\r\nfrom collections import deque\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd = deque()\r\n\r\nfor i in range(1 , n + 1 ):\r\n d.append(i)\r\n\r\nflag = True\r\ncnt = 0\r\nfor i in d :\r\n if l.count(i) < 1 :\r\n flag = False\r\n cnt +=1\r\n\r\n\r\nif flag == True:\r\n print(0)\r\n\r\nelse:\r\n print(cnt)\r\n\r\n\r\n\r\n", "n=int(input())\r\nc=0\r\ns=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if(i not in s):\r\n c+=1\r\nprint(c) ", "from collections import Counter\na=int(input())\nb=list(map(int,input().split()))\n\nz=0\nbb=Counter(b)\nss=0\ng=[]\nv=[]\ne=True\nfor k in range (1,a+1):\n g.append(k)\n\nq=sorted(bb)\n\nfor num in q:\n if num >=a+1:\n ss+=1\n e=False\n else:\n \n v.append(num)\nif e==False:\n print(abs(len(v)-a))\nelse:\n vv=len(v)\n print(abs(vv-a))\n \t \t\t \t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nprint(n - len(set([i for i in data if i <= n])))", "n = int(input())\nl = list(map(int, input().split()))\nl.sort()\ncount = 0\nfor i in range(1, n + 1):\n if i not in l:\n count += 1\nprint(count)", "n=int(input());c=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if i not in a:\r\n c+=1\r\nprint(c)", "n = int(input())\nvalues = set(map(int, input().split()))\nprint(len(set(range(1, n+1)).difference(values)))\n", "n, res, cnt, a = int(input()), 0, [True] 5001, list(map(int, input().split()))\r\nfor x in a: cnt[x] = False\r\nfor x in range(1, n + 1):\r\n if cnt[x]: res += 1\r\nprint(res)", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nd = {}\nfor i in a:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\nans = 0\nfor i in range(1, n + 1):\n if i not in d:\n ans += 1\nprint(ans)\n", "import sys\r\nlength=int(input())\r\nvalues=list(map(int,input().split()))\r\ncounter=0\r\nbeginning=1\r\nfor a in values:\r\n if beginning in values:\r\n counter+=1\r\n \r\n beginning+=1\r\n \r\nprint(length-counter)", "a=int(input())\r\nb=list(sorted(map(int,input().split())))\r\nc=0\r\nfor i in range(a+1):\r\n if b.count(i)>1:\r\n c+=b.count(i)-1\r\nfor i in range(a):\r\n if b[i]>a:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nc = {x for x in range(1, n + 1)}\r\nprint(n - len(set(b)) + len(set(b) - set(c)))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n s = set(map(int, input().split()))\r\n p = set(range(1, n+1))\r\n print(n - len(s.intersection(p)))\r\n", "n=int(input())\r\ns = list(map(int,input().rsplit()))\r\ns.sort()\r\ni=1\r\na=0\r\nb=0\r\nfor j in range (n):\r\n if s[j]<=n and s[j]!=a:\r\n b=b+1\r\n a=s[j]\r\nprint(n-b)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = [x for x in a if x in range(1, n + 1)]\r\nprint(n - len(set(a)))", "n=int(input())\r\nl=list(map(int, input().split()))\r\nct=0\r\nj=0\r\nfor i in range(n):\r\n j=j+1\r\n if(j in l):\r\n continue\r\n else:\r\n ct=ct+1\r\nprint(ct)", "n = int(input())\nx = set(map(int, input().split()))\ninc = 0\nfor item in range(1, n + 1):\n if item in x:\n inc += 1\nprint(n - inc)\n", "sequence_length = int(input())\r\ndifferent = set([x for x in map(int, input().split()) if x <= sequence_length])\r\nprint(sequence_length - len(different))\r\n", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nd,s={},0\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor x,y in d.items():\r\n if(x>n):\r\n s+=y\r\n if(x<=n and y>1):\r\n s+=y-1\r\nprint(s)\r\n", "def check_for_cycle(s):\r\n for i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n return 0\r\n return 1\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set()\r\n for i in range(n):\r\n if 1<= a[i] <= n:\r\n s.add(a[i])\r\n return n - len(s)\r\nif __name__ == \"__main__\":\r\n print(main())", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=set(ar)\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=i not in s\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = [1]n\r\n \r\nfor i in a:\r\n if i-1 < n:\r\n s[i-1] = 0\r\nprint(sum(s))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\ncnt=0\r\nfor i in l[::-1]:\r\n if i>n: l.pop(); cnt+=1\r\n else: break\r\nprint(cnt-len(set(l))+len(l))", "n=int(input())\r\nc=list(map(int,input().split()))\r\ncache=[0 for x in range(5001)]\r\nfor x in c:\r\n cache[x]=1\r\nprint(cache[1:n+1].count(0))", "#137B (82No. Problem B)\r\nn = int(input())\r\nper = list(set(map(int,input().split())))\r\nc = 0\r\ntemp = []\r\nfor i in range(1,n+1):\r\n if i not in per:\r\n c+=1\r\nprint(c) ", "n = int(input())\ndict = {}\narr = [int(ch) for ch in input().split()]\nfor i in range(n):\n dict[arr[i]] = 1\nans = 0\nfor i in range(1,n+1):\n if i not in dict.keys():\n ans+=1\nprint(ans)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if (i + 1) not in x:\r\n count = count + 1\r\n \r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(sum([(i not in a) for i in range(1,n+1)]))", "# permutation\nimport sys\n\n# lendo entrada\nnum_seq = int(sys.stdin.readline())\n\n# resolvendo\nlista = []\n\nfor i in range(0, num_seq):\n lista.append(False)\n\n# Checando entrada\nline = sys.stdin.readline()\n\nfor i in line.split():\n num = int(i)\n\n if num - 1 < len(lista):\n lista[num - 1] = True\n\nnum_changes = 0\n\nfor i in lista:\n if not i:\n num_changes += 1\n\nprint(num_changes)\n\n\n\n# 1489163032751\n", "\n# brute force approach\n\n# def permutation(li):\n# \tli.sort()\n# \tcount = 0\n# \ti=0\n# \twhile i < (len(li)-1):\n# \t\tif li[i+1] != li[i]+1:\n# \t\t\tli[i] = i+1\n# \t\t\tli[i+1] = li[i]+1\n# \t\t\tcount+=1\n# \t\t\t# print(count,end = \"\")\n# \t\tif i==len(li)-2:\n# \t\t\tif li[i+1]<li[i]+1:\n# \t\t\t\tcount+=1\n# \t\ti+=1\n# \t\t# print(li)\n# \t# print(li)\n# \t# print(i)\n\n# \tprint(count)\n\n\n\n# solution\ndef permutations(n,li):\n\tcount=0\n\tfor i in range(1,n+1):\n\t\tif i in li :\n\t\t\tcount+=1\n\treturn n-count\n\nn = int(input())\nli = [int(x) for x in input().split()]\nprint(permutations(n,li))", "# Problem Link: https://codeforces.com/problemset/problem/137/B\r\n# Problem Status:\r\n# ----------------------------- Separator -----------------------------\r\ndef TheAmazingFunction(S: list):\r\n table = dict()\r\n Ans = 0\r\n for i in S:\r\n table.update({i: 1})\r\n for i in range(1, len(S)+1):\r\n if table.get(i) is None:\r\n Ans += 1\r\n return Ans\r\n\r\n\r\n# ----------------------------- Separator -----------------------------\r\nlength = int(input())\r\nS_ = list(map(int, input().split()))\r\nprint(TheAmazingFunction(S_))\r\n# ----------------------------- Separator -----------------------------\r\n", "n = int(input())\r\na = set(map(int,input().split()))\r\nc=n-len(a)\r\nfor i in a:\r\n if(i>n):\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = [i for i in range(1,n+1)]\r\nchange = [i for i in k if i not in a]\r\nprint(len(change))", "n =int(input())\r\nnum = list(map(int,input().split(' ')))\r\nreplace=0\r\nfor i in range(n):\r\n if i+1 not in num:\r\n replace +=1\r\nprint(replace)", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\nfrom collections import Counter\r\n\r\nn = I()\r\narr = L()\r\nC = Counter(arr)\r\ncnt = 0\r\nfor e in C:\r\n if e>n:\r\n cnt+=C[e]\r\n else:\r\n cnt+= C[e]-1\r\n\r\nprint(cnt)", "el = int(input())\r\nar = set()\r\nfor i in input().split(' '):\r\n if int(i)>el:\r\n continue\r\n ar.add(i)\r\nprint(el - len(ar))\r\n", "\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\na = set(a)\r\n#print(set(a))\r\ntemp = [i for i in range(1,n+1)]\r\n\r\ncnt = 0\r\n\r\nfor i in temp :\r\n \r\n if i not in a :\r\n \r\n cnt = cnt + 1 \r\n \r\nprint(cnt)\r\n \r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = set()\r\nfor i in a:\r\n if i <= n:\r\n s.add(i)\r\n\r\nprint(n - len(s))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=set(a)\r\nl=len(x)\r\nfor i in x:\r\n if i>n:\r\n l-=1\r\nprint(len(a)-l)", "n = int(input())\narr = [int(num) for num in input().split()]\ncounts_dict = {}\nfor num in arr:\n\tcounts_dict[num] = counts_dict.get(num, 0) + 1\nans = 0\nfor i in range(1, n+1):\n\tif(counts_dict.get(i, 0) == 0):\n\t\tans += 1\nprint(ans)", "n = int(input())\narr = sorted(map(int, input().strip().split()))\nmissing = 0\nfor i in range(1, n + 1):\n if i not in arr:\n missing += 1\nprint(missing)\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nprint(len({range(1,int(input())+1)}-{map(int,input().split())}))\r\n", "s = int(input())\r\narr=list(map(int,input().split()))\r\ncount = 0\r\nd=set()\r\n\r\nfor i in range(s):\r\n if (arr[i] <=s) and (arr[i] not in d):\r\n d.add(arr[i])\r\n count=count+1\r\nprint(s-count) \r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in arr:\r\n c=c+1\r\nprint(c)\r\n \r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n) :\r\n if li[i]>=1 and li[i]<=n :\r\n d[li[i]] = d.get(li[i],0)+1\r\nprint(n-len(d))\r\n ", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n if i+1 in a:\r\n count=count+1\r\n\r\nprint(n-count)", "n = set(range(1, int(input())+1))\r\na = set(map(int, input().split()))\r\n\r\nprint(len(n-a))\r\n", "#1080\r\n#4digit\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ncount=0\r\narr=set(arr)\r\nfor i in range(1,n+1):\r\n if i in arr:\r\n continue\r\n else:\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nnums = [i for i in range(1, n + 1)]\r\nfor i in a:\r\n if (i in nums):\r\n n -= 1\r\n nums.remove(i)\r\nprint (n)", "n = int(input())\nx = list(map(int, input().split()))\nans = 0\nfor i in range(1, n + 1):\n if i not in x:\n ans += 1\nprint(ans)\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nj=0\r\nfor i in s:\r\n if i>=1 and i <=n:\r\n j+=1\r\n \r\n\r\nprint(n-j)\r\n", "def binary_search_recursive(array, element, start, end):\r\n if start > end:\r\n return -1\r\n mid = (start + end) // 2\r\n if element == array[mid]:\r\n return mid\r\n if element < array[mid]:\r\n return binary_search_recursive(array, element, start, mid-1)\r\n else:\r\n return binary_search_recursive(array, element, mid+1, end)\r\n\r\n\r\nlength = int(input())\r\nseq = sorted([int(i) for i in input().split()])\r\ncount = 0\r\nfor i in range(1, length + 1):\r\n if binary_search_recursive(seq, i, 0, length - 1) == -1:\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[(i+1) for i in range(n)]\r\ns=0\r\nfor x in k:\r\n\tif x in l:\r\n\t\ts+=1\r\nprint(n-s)", "x = int(input())\r\ny = list(map(int,input().split()))\r\nprint(x- len(set(range(1,x+1))&set(y)))", "n = int(input())\r\narr = input().split(' ')\r\narr = list(map(int,arr))\r\ncount = 0\r\nfor i in range(1,n+1):\r\n\tif(i not in arr):\r\n\t\tcount = count+1\r\nprint(count)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ns = set(lst) \r\ns1 = {x+1 for x in range(n)}\r\nprint(len(s1.difference(s)))", "n = int(input())\r\n\r\nallowed = range(1, n+1)\r\nalready_used = []\r\ncount = 0\r\nfor x in input().split():\r\n x = int(x)\r\n if x not in allowed or x in already_used:\r\n count += 1\r\n else:\r\n already_used.append(x)\r\n\r\nprint(count)", "i = int(input())\r\nl = list(map(int, input().split()))\r\ng = 0\r\nfor x in range(1, i + 1):\r\n if l.count(x) <1:\r\n g += 1\r\nprint(g)\r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl2=[]\r\nc=0\r\nfor i in l1:\r\n if i not in l2 and i<=n:\r\n l2.append(i)\r\n elif i in l2 and i<=n:\r\n c+=1\r\n elif i>n:\r\n c+=1\r\nprint(c)\r\n ", "n = int(input())\n\na = list(map(int, input().split()))\n\ndi = dict()\n\nfor i in a:\n di[i] = di.get(i, 0) + 1\n\nans = 0\n\nfor i in range(1, n+1):\n if not di.get(i, 0):\n ans += 1\n\nprint(ans)", "casos = int(input())\nlista= []\ntmp = input().split()\nfor i in tmp:\n if (i not in lista) and (int(i)<=casos):\n lista.append(i)\nprint((casos-len(lista))) \n \n \n \n \t \t \t \t \t\t\t \t\t\t \t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n+1):\r\n if a.count(i)<1:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n", "n=input()\r\na=input()\r\nx=a.split()\r\nx.sort()\r\nk=0\r\nfor i in range(int(n)):\r\n if str(i+1) not in x:\r\n k+=1\r\nprint(k)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nlt=[i for i in l if i<=n and i!=0]\r\nli=list(set(lt))\r\nif len(li)==n:\r\n print(\"0\")\r\nelse:\r\n print(n-len(li))\r\n", "n=int(input())\r\nc=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if i not in a:c+=1\r\nprint(c) \r\n#137B", "n, seq = int(input()), list(map(int, input().split()))\r\nprint(len(set(list(range(1, n + 1))) - set(seq)))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount1 = 0\r\nfor i in range(1,n+1):\r\n\tif i not in l:\r\n\t\tcount1 += 1\r\nprint(count1)\t\t", "# 序列从1-n,需替换多少次\r\nnum = int(input())\r\nlist_int = list(map(int, input().split()))\r\nprint(len(set(range(1,num+1))-set(list_int)))\r\n \r\n", "n = int(input())\narr = list(map(int, input().split()))\nper = [x for x in range(1, n + 1)]\ncount = 0\nfor i in range(n):\n for k in arr:\n if k == per[i]:\n count += 1\n break\n\nprint(n - count)\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n counts = dict()\r\n for i in arr:\r\n if i in counts:\r\n counts[i] += 1\r\n else:\r\n counts[i] = 1\r\n\r\n ans = 0\r\n num = 1\r\n for i in range(n):\r\n if num not in counts:\r\n ans += 1\r\n num += 1\r\n\r\n print(ans)\r\nmain()", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\ns=0\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n s+=1\r\nprint(s)", "def permutate(n, lst):\r\n s = range(1, n + 1)\r\n return len(set(s) - set(lst))\r\n\r\n\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(permutate(m, a))\r\n", "n=int(input())\narr=list(map(int,input().split()))\nm={}\nans=0\nfor i in range(1,n+1):\n m[i]=0\nfor i in arr:\n if i>n:\n ans+=1\n else:\n if m[i]==1:\n ans+=1\n elif m[i]==0:\n m[i]=1\nprint(ans)\n# n=int(input())\n# arr=list(map(int,input().split()))\n# m={}\n# for i in range(n):\n# m[i]=0\n# ans=0\n# for i in arr:\n# if i in m and m[i]==1:\n# ans+=1\n# elif i in m and m[i]==0:\n# m[i]=1\n# else:\n# ans+=1\n# print(ans)\n# # n=int(input())\n# # arr=list(map(int,input().split()))\n# # m=[]\n# # ans=0\n# # for i in arr:\n# # if i in m:\n# # ans+=1\n# # else:\n# # m.append(i)\n# # print(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=[]\r\nfor i in range(n):\r\n if(l[i] not in d and l[i]<=n):\r\n d.append(l[i])\r\n c=c+1\r\nprint(n-c)\r\n", "import math\r\ndef is_prime(n):\r\n if n==1:\r\n return False\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\ndef inp():\r\n ls=list(map(int,input().split()))\r\n return ls\r\nt=int(input())\r\nls=inp()\r\nres=0\r\nans=list(set(ls))\r\nfor i in ans:\r\n if i<=t:\r\n res+=1\r\nprint(t-res)\r\n\r\n", "n=int(input())\r\nar=input().split()\r\nar=[int(i) for i in ar]\r\nt=set(ar)\r\nu=set([i for i in range(1,n+1)])\r\nif ar==[ar[0]]n and ar[0]>n:\r\n print(n)\r\nelse:\r\n print(len(u.difference(t)))\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na=Counter(a)\r\nq=sorted(a)\r\ns=0\r\nfor i in range(1,n+1):\r\n if i not in q:\r\n s=s+1\r\nprint(s)\r\n", "#137B\r\n\r\nif __name__ == \"__main__\":\r\n nums = list()\r\n n = int(input())\r\n unique_nums = set()\r\n nums = map(int,input().split(\" \"))\r\n\r\n for k in nums:\r\n if(k<=n):\r\n unique_nums.add(k)\r\n\r\n print (n-unique_nums.__len__())\r\n", "n = int(input())\na = list(map(int, input().split(' ')))\n\nverified_number = []\n\nfor number in a:\n if number <= n:\n verified_number.append(number)\n\nconvert_to_set = set(verified_number)\n\nprint(n - len(convert_to_set))", "n = int(input())\nls = [int(i) for i in input().split()]\nset_ = set(ls)\ndict_ = dict(zip([i+1 for i in range(n)], [0]n))\n\nfor i in ls:\n try:\n dict_[i] += 1\n except:\n pass\n\nsum_=0\nfor k, v in dict_.items():\n if(v == 0):\n sum_ +=1\n \nprint(sum_)\n\t \t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t \t \t\t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nnums = set(arr)\r\nideal = set([i for i in range(1, n+1)])\r\ncount = len(ideal-nums)\r\nprint(count)", "def main():\r\n n = int(input())\r\n seq = [int(c) for c in input().split()]\r\n\r\n perm = set(range(1, n + 1))\r\n\r\n ans = 0\r\n for e in seq:\r\n if e in perm:\r\n perm.discard(e)\r\n else:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N = int(input())\r\nA = list(int(i) for i in input().split())\r\nS = set()\r\nfor k in A:\r\n\tif(1<=k and k<=N):\r\n\t\tS.add(k)\r\n\t\t\r\nprint(N-len(S))", "from collections import Counter\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = Counter(arr)\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if i not in c:\r\n count += 1\r\n\r\nprint(count)", "from collections import Counter\n\n\nn = int(input())\ns = [int(i) for i in input().split()]\n\nc = Counter(s)\nans = 0\nfor k, v in c.items():\n if k <= n:\n ans += v - 1\n else:\n ans += v\nprint(ans)\n", "def main():\n n = int(input())\n i, res = 1, 0\n for a in sorted(map(int, input().split())):\n if i <= a <= n:\n i = a + 1\n else:\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()", "p=0\nn=int(input())\na = input().split(\" \") \na = [int(i) for i in a]\nfor i in range(1, n+1):\n if i not in a:\n p+=1\nprint(p)\n\t\t\t \t\t \t\t\t\t\t\t\t\t \t \t \t \t\t \t\t", "t=n=int(input())\r\na=[0](n)\r\nfor i in map(int,input().split()):\r\n if i<=n and a[i-1]:\r\n continue\r\n elif i<=n and not a[i-1]:\r\n a[i-1]=1\r\n t-=1\r\n else:continue\r\nprint(t)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = set(sorted(a))\r\nb = [x for x in range(1, n+1)]\r\nans = 0\r\nfor i in range(n):\r\n if b[i] not in a:\r\n ans += 1\r\nprint(ans)\r\n ", "n = int(input())\r\nl = list(map(int, input().split())) \r\ncounter = 0\r\nfor i in range( 1 , n+1) :\r\n if i not in l : \r\n counter += 1\r\nprint(counter)", "from collections import Counter\nn = int(input())\ncnt = Counter([int(x) for x in input().split()])\nans = 0\nfor a, b in cnt.items():\n\tif a <= 0 or a > n:\n\t\tans += b\n\telse:\n\t\tans += b - 1\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nall = set()\r\nfor num in a:\r\n if 1 <= num <= n:\r\n all.add(num)\r\nprint(n - len(all))", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=set()\r\nfor i in l:\r\n if(i<=n):\r\n p.add(i)\r\nprint(n-len(p))", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nns = [ 1 ] * (n)\r\nfor k in nums:\r\n if k - 1 < n:\r\n ns[k - 1] = 0\r\nprint(sum(ns))", "# 5\n# 4 5 5 5 5\n\nn = int(input())\na = set(map(int, input().split()))\n\ncounter = 0\nfor i in range(n):\n if i + 1 not in a:\n counter += 1\n\nprint(counter)\n", "n = int(input())\n\nseq = [int(i) for i in input().split()]\n\nl_n = [i for i in seq if i <= n]\nans = n - len(set(l_n))\n\nprint(ans)\n", "up = int(input())\nnums = input().split()\nnums = list(map(int, nums))\nnums.sort()\nnum_count = len(nums)\nresult = 0\nlast = None\nfor i in nums:\n if i > up or i == last:\n result += 1\n else:\n last = i\nprint(result)\n\n \t\t \t \t \t \t\t\t \t\t\t\t \t \t\t\t", "print(len(set(range(1, 1+int(input()))) - set(map(int,input().split()))))", "n = int(input())\r\np = set()\r\n\r\n\r\nfor i in range(1,n+1):\r\n p.add(i)\r\n \r\nh = set([int(x) for x in (input().split())])\r\n\r\nprint(len(p-h))", "n=int(input())\r\na=list(map(int,input().split()))\r\nar=[]\r\nans=0\r\nfor i in range(1,n+1):\r\n ar.append(i)\r\nfor j in ar:\r\n if j not in a:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append(i+1)\r\nfor i in a:\r\n if i in b:\r\n b.remove(i)\r\nprint(len(b))", "n=int(input())\narray=set(map(int,input().split()))\ncount=0\nfor i in array:\n\tif i<=n:\n\t\tcount+=1\nprint(n-count)\n", "n=int(input())\r\n\r\nl1=list(map(int, input().split()))\r\n\r\nl2=[0 for i in range(0,n)]\r\ncount=0\r\n\r\nfor i in l1:\r\n if i<=n:\r\n l2[i-1]=1\r\n\r\nfor i in l2:\r\n if i!=1:\r\n count+=1\r\n\r\nprint (count)", "n=int(input())\r\np=[int(x) for x in input().split()]\r\ns=0\r\np=set(p)\r\nfor i in p:\r\n if 1<=i<=n:\r\n s+=1\r\nprint(n-s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = [int(x) for x in input().split() if int(x) <= n]\r\n\r\nprint(n - len(set(arr)))", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nlst=[]\r\nlst1=[]\r\nfor i in range(1,n+1):\r\n lst.append(i)\r\nfor j in n1:\r\n if(j in lst and j not in lst1):\r\n lst1.append(j)\r\nprint(len(n1)-len(lst1))\r\n \r\n", "n = int(input())\narr = set(map(int, input().split()))\ncount = 0\nfor v in arr:\n if 1 <= v <= n:\n count += 1\nprint(n - count)\n", "n=int(input());c=0;t=[]\r\nfor i in input().split():\r\n i=int(i)\r\n if i in range(1,n+1):\r\n if i in t : c+=1\r\n else : t.append(i)\r\n else :c+=1\r\nprint(c)", "def main():\r\n n = int(input())\r\n seq = [int(c) for c in input().split()]\r\n \r\n perm = [True] * n\r\n \r\n ans = 0\r\n for e in seq:\r\n e -= 1\r\n if e < n and perm[e]:\r\n perm[e] = False\r\n else:\r\n ans += 1\r\n \r\n print(ans)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "\nn = int(input())\ntab = list(map(int, input().split()))\n\nperm = set(range(1, n + 1))\nfor i in tab:\n if i in perm:\n perm.remove(i)\nprint(len(perm))\n", "#!/usr/bin/env python3\nfrom sys import exit\n\nn = int(input())\nt = (int(x) for x in input().split())\n\ns = set()\nres = 0\nfor x in t:\n if x > n or x in s: res += 1\n s.add(x)\nprint(res)\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ns = 0\r\nfor i in range(1,n+1):\r\n if i not in arr:\r\n s +=1\r\nprint(s)" ]	{"inputs": ["3\n3 1 2", "2\n2 2", "5\n5 3 3 3 1", "5\n6 6 6 6 6", "10\n1 1 2 2 8 8 7 7 9 9", "8\n9 8 7 6 5 4 3 2", "15\n1 2 3 4 5 5 4 3 2 1 1 2 3 4 5", "1\n1", "1\n5000", "4\n5000 5000 5000 5000", "5\n3366 3461 4 5 4370", "10\n8 2 10 3 4 6 1 7 9 5", "10\n551 3192 3213 2846 3068 1224 3447 1 10 9", "15\n4 1459 12 4281 3241 2748 10 3590 14 845 3518 1721 2 2880 1974", "15\n15 1 8 2 13 11 12 7 3 14 6 10 9 4 5", "15\n2436 2354 4259 1210 2037 2665 700 3578 2880 973 1317 1024 24 3621 4142", "30\n28 1 3449 9 3242 4735 26 3472 15 21 2698 7 4073 3190 10 3 29 1301 4526 22 345 3876 19 12 4562 2535 2 630 18 27", "100\n50 39 95 30 66 78 2169 4326 81 31 74 34 80 40 19 48 97 63 82 6 88 16 21 57 92 77 10 1213 17 93 32 91 38 4375 29 75 44 22 4 45 14 2395 3254 59 3379 2 85 96 8 83 27 94 1512 2960 100 9 73 79 7 25 55 69 90 99 51 87 98 62 18 35 43 4376 4668 28 72 56 4070 61 65 36 54 4106 11 24 15 86 70 71 4087 23 13 76 20 4694 26 4962 4726 37 14 64", "100\n340 14 3275 2283 2673 1107 817 2243 1226 32 2382 3638 4652 418 68 4962 387 764 4647 159 1846 225 2760 4904 3150 403 3 2439 91 4428 92 4705 75 348 1566 1465 69 6 49 4 62 4643 564 1090 3447 1871 2255 139 24 99 2669 969 86 61 4550 158 4537 3993 1589 872 2907 1888 401 80 1825 1483 63 1 2264 4068 4113 2548 41 885 4806 36 67 167 4447 34 1248 2593 82 202 81 1783 1284 4973 16 43 95 7 865 2091 3008 1793 20 947 4912 3604", "1\n2", "2\n5000 5000", "2\n1 2", "2\n1 1", "2\n2 3", "2\n3 4", "10\n1 2 3 4 5 6 7 1000 10 10"], "outputs": ["0", "1", "2", "5", "5", "1", "10", "0", "1", "4", "3", "0", "7", "10", "0", "15", "14", "18", "70", "1", "2", "0", "1", "1", "2", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	245
d0040d13ef457ac6407a514ec877584c	Arpa's loud Owf and Mehrdad's evil plan	As you have noticed, there are lovely girls in Arpa’s land. People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi. Someday Arpa shouted Owf loudly from the top of the palace and a funny game started in Arpa's land. The rules are as follows. The game consists of rounds. Assume person x wants to start a round, he calls crushx and says: "Oww...wwf" (the letter w is repeated t times) and cuts off the phone immediately. If t<=><=1 then crushx calls crushcrushx and says: "Oww...wwf" (the letter w is repeated t<=-<=1 times) and cuts off the phone immediately. The round continues until some person receives an "Owf" (t<==<=1). This person is called the Joon-Joon of the round. There can't be two rounds at the same time. Mehrdad has an evil plan to make the game more funny, he wants to find smallest t (t<=≥<=1) such that for each person x, if x starts some round and y becomes the Joon-Joon of the round, then by starting from y, x would become the Joon-Joon of the round. Find such t for Mehrdad if it's possible. Some strange fact in Arpa's land is that someone can be himself's crush (i.e. crushi<==<=i). The first line of input contains integer n (1<=≤<=n<=≤<=100) — the number of people in Arpa's land. The second line contains n integers, i-th of them is crushi (1<=≤<=crushi<=≤<=n) — the number of i-th person's crush. If there is no t satisfying the condition, print -1. Otherwise print such smallest t. Sample Input 4 2 3 1 4 4 4 4 4 4 4 2 1 4 3 Sample Output 3 -1 1	[ "input()\ncrush = [0] + [int(x) for x in input().split()]\nvisited = set()\n\ncircle_sizes = []\n\ndef gcd(a, b):\n return a if b == 0 else gcd(b, a%b)\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\ndef solve():\n for i in range(len(crush)):\n if i not in visited:\n start, cur, count = i, i, 0\n while cur not in visited:\n visited.add(cur)\n count += 1\n cur = crush[cur]\n if cur != start:\n return -1\n circle_sizes.append(count if count % 2 else count // 2)\n \n if len(circle_sizes) == 1:\n return circle_sizes[0]\n \n ans = lcm(circle_sizes[0], circle_sizes[1])\n for size in circle_sizes[2:]:\n ans = lcm(ans, size)\n return ans\n\nprint(solve())\n", "n = int(input())\n\nL = list(map(int, input().split()))\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\ndef lcm(a, b):\n return a // gcd(a, b) * b\n\nif len(set(L)) < n:\n print(-1)\nelse:\n a = 1\n\n for i in range(n):\n if L[i] == 0: continue\n u = i\n c = 0\n while L[u] != 0:\n c += 1\n v = L[u] - 1\n L[u] = 0\n u = v\n\n if c % 2 == 0:\n c //= 2\n\n a = lcm(a, c)\n\n print(a)\n\n", "def gcd(a,b):return a if b==0 else gcd(b, a%b)\r\ndef lcm(a,b):return ab//gcd(a,b)\r\nn=int(input())\r\nc=[int(v)-1 for v in input().split(' ')]\r\nt=1\r\nfor i in range(n):\r\n k=i\r\n for j in range(1, n+2):\r\n k=c[k]\r\n if k==i:\r\n break\r\n if j>n:\r\n print(-1)\r\n exit()\r\n t=lcm(t,j if j%2!=0 else j//2)\r\nprint(t)", "def gcd(a, b):\r\n if (a == 0):\r\n return b\r\n return gcd(b % a, a)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] -= 1\r\nu = [False] n\r\nans = 1\r\nfor i in range(n):\r\n if (u[i] == False):\r\n x = i\r\n c = 1\r\n while (True):\r\n u[x] = True\r\n if (a[x] == i):\r\n break\r\n if (u[a[x]] != False):\r\n print(-1)\r\n exit(0)\r\n x = a[x]\r\n c += 1\r\n if (c % 2 == 0):\r\n c //= 2\r\n ans = ans * c // gcd(ans, c)\r\nprint(ans)", "from fractions import gcd\r\ndef lcm(l):\r\n v = 1\r\n for li in l:\r\n v = v * li // gcd(v, li)\r\n return v\r\nn, c = int(input()), [0] + list(map(int, input().split()))\r\nf, l = [False] * (n + 1), []\r\nfor i in range(1, n + 1):\r\n if not f[i]:\r\n li, x = 0, i\r\n while not f[x]:\r\n f[x] = True\r\n x, li = c[x], li + 1\r\n if x != i:\r\n print(-1)\r\n exit()\r\n l.append(li if li % 2 else li // 2)\r\nprint(lcm(l))", "#from collections import deque\nfrom functools import reduce\n\nn = int(input())\ncrush = [int(i) - 1 for i in input().split()]\n\ndef parity_treat(n):\n if n%2 == 0:\n return n//2\n else:\n return n\n\ndef gcd(a,b):\n while b:\n a, b = b, a%b\n return a\n\ndef lcm(a,b):\n return a * b // gcd(a,b)\n\ndef lcmm(args):\n return reduce(lcm, args)\n\n\nif len(set(crush)) < n:\n print(-1)\nelse:\n component_size = []\n visited = set()\n for i in range(n):\n if i not in visited:\n tmp = 1\n start = i\n visited.add(start)\n j = crush[start]\n while j != start:\n visited.add(j)\n j = crush[j]\n tmp+=1\n component_size.append(tmp)\n component_size = [parity_treat(i) for i in component_size]\n print(lcmm(component_size))", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif len(set(a))!=len(a): print(-1)\r\nelse:\r\n ans,cycle=None,None\r\n visited=[False](n+1)\r\n for i in range(n):\r\n if visited[i+1]: continue\r\n count,v=0,[]\r\n index,value=i+1,-1\r\n while value!=i+1:\r\n visited[index]=True\r\n v.append(index)\r\n value=a[index-1]\r\n index=value\r\n cycle=[len(v)//2,len(v)][len(v)%2]\r\n if i==0: ans=cycle\r\n else: ans=(anscycle)//math.gcd(ans,cycle)\r\n print(ans)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef gcd(a, b):\r\n if a > b:\r\n a, b = b, a \r\n if b % a==0:\r\n return a \r\n return gcd(b % a, a)\r\n\r\ndef process(A):\r\n \"\"\"\r\n must be a permutation\r\n \"\"\"\r\n n = len(A)\r\n A2 = sorted(A)\r\n if A2 != [i for i in range(1, n+1)]:\r\n sys.stdout.write('-1\\n')\r\n return\r\n cycles = []\r\n seen = [0 for i in range(n+1)]\r\n for i in range(1, n+1):\r\n if seen[i]==0:\r\n start = [i]\r\n while True:\r\n x = A[start[-1]-1]\r\n if x==i:\r\n break \r\n start.append(x)\r\n cycles.append(len(start))\r\n for x in start:\r\n seen[x] = 1\r\n g = None\r\n for m in cycles:\r\n if m % 2==0:\r\n m1 = m//2 \r\n else:\r\n m1 = m \r\n if g is None:\r\n g = m1 \r\n else:\r\n g = (gm1)//gcd(g, m1)\r\n sys.stdout.write(f'{g}\\n')\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)", "from math import gcd\r\ndef count(x,a,n):\r\n c=0\r\n t=x\r\n while(1):\r\n x=a[x-1]\r\n c+=1\r\n if t==x:\r\n #print(t,x)\r\n break\r\n if c>=n:\r\n return 0\r\n break\r\n if c%2==0:\r\n return c//2\r\n else:\r\n return c\r\ndef xyz():\r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n l=1\r\n for i in range(n):\r\n p=count(i+1,a,n)\r\n if p==0:\r\n return -1\r\n l=(pl)//(gcd(p,l))\r\n return l\r\nprint(xyz())\r\n \r\n \r\n \r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b, a%b)\r\ndef lcm(a,b):\r\n return ab/gcd(a,b)\r\ndef dfs(sad, num, posjeceno):\r\n \"\"\"if sad==a[sad]-1 and posjeceno!=[0]n:\r\n return (-10, [])\"\"\"\r\n posjeceno[sad]=1\r\n if posjeceno[a[sad]-1]==1:\r\n return (num+1, posjeceno)\r\n return dfs(a[sad]-1, num+1, posjeceno)\r\n\r\ndef trazi(oznaka):\r\n global memo\r\n if memo[oznaka]==[]:\r\n memo[oznaka]=dfs(oznaka, 0, [0]n)\r\n return memo[oznaka]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=set()\r\nbrojac=n\r\nmemo=[[] for e in range (n)]\r\nwhile brojac>-1:\r\n brojac-=1\r\n if memo[brojac]==[]:\r\n trazi(brojac)\r\n \"\"\"if memo[brojac][0]==-10:\r\n d=-10\r\n break\"\"\"\r\n l=memo[brojac][1]\r\n for w in range(n):\r\n if l[w]==1:\r\n if trazi(w)[1]!=l:\r\n d=-10\r\n break\r\n if d==-10:\r\n break\r\n vrati, l=trazi(brojac)\r\n if vrati%2==0:\r\n d.add(float(vrati/2))\r\n else:\r\n d.add(float(vrati))\r\nif d==-10:\r\n print(-1)\r\nelse:\r\n sol=1\r\n for r in d:\r\n sol=lcm(sol, r)\r\n print(int(sol))\r\n", "from collections import deque\nfrom math import gcd\n\nn = int(input())\ngraph = [int(i) - 1 for i in input().split()]\n\n\ndef bfs(x):\n visited = set([x])\n queue = deque([x])\n\n while queue:\n vertex = queue.pop()\n el = graph[vertex]\n if el not in visited:\n visited.add(el)\n queue.append(el)\n elif el != x:\n return False\n\n return len(visited)\n\n\nmn = set()\nfor i in range(n):\n res = bfs(i)\n if res:\n res = res if res % 2 == 1 else res // 2\n mn.add(res)\n else:\n print(-1)\n exit()\n\nmn = list(mn)\nd = {}\n\nfor i in mn:\n el = i\n for j in range(2, i + 1):\n if el % j == 0:\n n = 0\n while el % j == 0:\n el //= j\n n += 1\n\n if j not in d.keys():\n d[j] = n\n else:\n d[j] = max(d[j], n)\n\np = 1\nfor i, n in d.items():\n p = i ** n\n\nprint(p)\n\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\n\r\ndef all_gcd(array):\r\n n = len(array)\r\n ans = array[0]\r\n for i in range(1, n):\r\n ans = gcd(ans, array[i])\r\n return ans\r\n\r\n\r\ndef all_lcm_int(array):\r\n ans = array[0]\r\n for i in range(1, len(array)):\r\n ans = (ans * array[i]) // gcd(ans, array[i])\r\n return ans\r\n\r\n\r\ndef all_lcm_dict(array):\r\n primes = {}\r\n for num in array:\r\n for k in range(2, int(num ** 0.5) + 1):\r\n cnt = 0\r\n while num % k == 0:\r\n cnt += 1\r\n num //= k\r\n if cnt != 0:\r\n if k not in primes:\r\n primes[k] = cnt\r\n else:\r\n primes[k] = max(cnt, primes[k])\r\n if num != 1:\r\n if num not in primes:\r\n primes[num] = 1\r\n return primes\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\nif len(set(a)) != len(a):\r\n print(-1)\r\n exit()\r\n\r\nused = [False] * n\r\nsize = []\r\nfor i in range(n):\r\n if used[i]:\r\n continue\r\n sz = 1\r\n used[i] = True\r\n while True:\r\n nxt_i = a[i] - 1\r\n if used[nxt_i]:\r\n break\r\n sz += 1\r\n used[nxt_i] = True\r\n i = nxt_i\r\n if sz % 2 == 0:\r\n size.append(sz // 2)\r\n else:\r\n size.append(sz)\r\n\r\nprint(all_lcm_int(size))", "from fractions import gcd\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\nn = int(input())\r\ngo = list(map(int, input().split()))\r\nfor i in range(n):\r\n go[i] -= 1\r\nvis = [False for i in range(n)]\r\nans = 1\r\nfor i in range(n):\r\n vis = [False for j in range(n)]\r\n x = go[i]\r\n while True:\r\n if vis[x] == True:\r\n break\r\n vis[x] = True\r\n x = go[x]\r\n if vis[i] == False:\r\n print(\"-1\")\r\n exit(0)\r\nvis = [False for i in range(n)]\r\nfor i in range(n):\r\n if vis[i] == True:\r\n continue\r\n x = i\r\n cycle = 0\r\n while True:\r\n if vis[x] == True:\r\n break\r\n cycle += 1\r\n vis[x] = True\r\n x = go[x]\r\n if cycle % 2 == 1:\r\n ans = lcm(ans, cycle)\r\n else:\r\n ans = lcm(ans, cycle // 2)\r\nprint(ans)\r\n ", "from fractions import gcd\r\ndef dfs(node):\r\n if (vis[node] == idd[0]):\r\n return node\r\n cycleLen[0] += 1\r\n vis[node] = idd[0]\r\n return dfs(crush[node])\r\n\r\nn = int(input())\r\ncrush = list(map(int, input().split()))\r\nfor i in range(n):\r\n crush[i] -= 1\r\nvis = [0] * n\r\nans = 10*100\r\nidd = [0]\r\nV = []\r\nfor i in range(n):\r\n idd[0] += 1\r\n cycleLen = [0]\r\n if (dfs(i) != i):\r\n ans = -1\r\n V.append(cycleLen[0])\r\nV.sort()\r\n\r\ndef lcm(x, y):\r\n return x y // gcd(x, y)\r\n\r\nif (ans == -1):\r\n print(ans)\r\nelse:\r\n ans = 1\r\n inc = 1\r\n for item in V:\r\n\r\n mem = {}\r\n bad = False\r\n while (True): \r\n if (ans % item == 0):\r\n break\r\n if (item % 2 == 0 and ans % item == item // 2):\r\n break\r\n if (ans % item in mem):\r\n bad = True\r\n break\r\n mem[ans % item] = 1\r\n ans += inc\r\n if (bad):\r\n ans = -1\r\n break\r\n inc = lcm(inc, ans)\r\n print(ans)\r\n", "from math import gcd\ndef lcm(a, b): return a * b // gcd(a, b)\nn = int(input())\nA = [0] + list(map(int, input().split()))\ng = {}\nfor i in range(1, n + 1):\n g[A[i]] = i\nif len(g) != n:\n print(-1)\nelse:\n clc = 1\n for i in g:\n x = g[i]\n cnt = 1\n while x != i:\n x = g[x]\n cnt += 1\n if cnt % 2 == 0:\n cnt //= 2\n clc = lcm(clc, cnt)\n print(clc)", "n = int(input())\r\nw = map(int, input().split())\r\nw = [x-1 for x in w]\r\n\r\nws = sorted(w)\r\nfor i in range(n):\r\n\tif i != ws[i]:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\r\na = []\r\nvis = [False] * n\r\nfor i in range(n):\r\n\tif not vis[i]:\r\n\t\ta.append(0)\r\n\t\tj = i\r\n\t\twhile not vis[j]:\r\n\t\t\ta[-1] += 1\r\n\t\t\tvis[j] = True\r\n\t\t\tj = w[j]\r\n\r\ndef gcd(a, b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\treturn gcd(b, a % b)\r\n\r\nans = 1\r\nfor i in a:\r\n\tif i % 2 == 0:\r\n\t\ti //= 2\r\n\tans = ans // gcd(ans, i) * i\r\nprint(ans)\r\n", "def gcd(x,y):\n return x if y==0 else gcd(y,x%y)\ndef lcm(x,y):\n return x//gcd(x,y)y\ndef dfs(x,y):\n if(vis[x]):\n return y\n vis[x] = 1\n return dfs(c[x-1],y+1)\nn =int(input())\nc = []\nfor x in input().split():\n c.append(int(x))\nvis = [0](n+1)\nind = [0](n+1)\nfor i in range(n):\n ind[i+1]+=1\n ind[c[i]]+=1\nmk = 1\nfor i in range(n):\n if(ind[i+1]&1):\n mk = 0\nans = 1\nif(mk):\n for i in range(n):\n if(vis[i+1]==0):\n val = dfs(i+1,0)\n if(val%2==0):\n val//=2\n ans = lcm(ans,val)\n print(ans)\nelse:\n print(\"-1\");\n\n \t \t\t \t\t\t \t\t \t\t\t \t \t \t \t", "def make_function(n, crushes):\n def f(original_node):\n node = original_node\n x = 0\n for i in range(n):\n node = crushes[node]\n x += 1\n if node == original_node:\n break\n else:\n return -1\n return x / 2 if x % 2 == 0 else x\n return f\n\n\ndef lcd(numbers):\n gcd = lambda x, y: int(x) if y == 0 else int(gcd(y, x % y))\n ret = 1\n for number in numbers:\n ret = ret number / gcd(ret, number)\n return ret\n\n\ndef main():\n n = int(input())\n a = map(int, input().split())\n crushes = {i: x for i, x in zip(range(1, n+1), a)}\n f = make_function(n, crushes)\n numbers = list(map(int, map(f, crushes)))\n if -1 in numbers:\n print (-1)\n return\n print (int(lcd(numbers)))\n\n\nmain()\n", "from math import \r\nn=int(input())\r\na=list(map(lambda s:int(s)-1,input().split()))\r\nseen=[0]n\r\nans=1\r\nlcm=1\r\nfor i in range(n):\r\n if not seen[i]:\r\n j=i\r\n leng=0\r\n while not seen[j]:\r\n seen[j]=1\r\n leng+=1\r\n j=a[j]\r\n if i==j:\r\n if leng%2==0:\r\n leng//=2\r\n lcm = lcm // gcd(lcm,leng) * leng\r\n else:\r\n ans=-1\r\n break\r\nif ans==-1:\r\n print(-1)\r\nelse:\r\n print(lcm)\r\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif sorted(a) != [i + 1 for i in range(n)]:\r\n print(-1)\r\nelse:\r\n ans = 1\r\n used = [0 for i in range(n)]\r\n for i in range(n):\r\n if used[i] == 0:\r\n j = i\r\n am = 0\r\n while used[j] == 0:\r\n am += 1\r\n used[j] = 1\r\n j = a[j] - 1\r\n if am % 2:\r\n ans = lcm(ans, am)\r\n else:\r\n ans = lcm(ans, am // 2)\r\n print(ans)", "def gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\ndef lcm(a, b):\n return a * b // gcd(a, b)\nn = int(input())\nc = [int(v)-1 for v in input().split(' ')]\nt = 1\nfor i in range(n):\n k = i\n for j in range(1, n+2):\n k = c[k]\n if k == i:\n break\n if j > n:\n print(-1)\n exit()\n t = lcm(t, j if j % 2 != 0 else j // 2)\nprint(t)\n\n\n\n# Made By Mostafa_Khaled", "from fractions import gcd\r\nn = int(input())\r\ncrush = list(map(int,input().split()))\r\nwas = [0] * n\r\nans = 1\r\nfor i in range(n):\r\n if was[i]:\r\n continue\r\n num = i\r\n j = 0\r\n while not was[num]:\r\n was[num] = 1\r\n num = crush[num] - 1\r\n j += 1\r\n if i != num:\r\n ans = -1\r\n break\r\n else:\r\n if j % 2 == 0:\r\n j //= 2\r\n ans = ans * j // gcd(ans,j)\r\nprint(ans)\r\n", "import sys\r\nfrom math import gcd\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\na = [0] + list(map(int, input().split())) \r\nl = [] \r\nv = [0] * (n + 1) \r\nif(len(set(a)) != n + 1):\r\n print(-1)\r\n exit()\r\nfor i in range(1, n + 1):\r\n if(v[i] == 0):\r\n c = 1 \r\n v[i] = 1 \r\n j = a[i] \r\n while(not v[j]):\r\n c += 1 \r\n v[j] = 1 \r\n j = a[j] \r\n if(c % 2):\r\n l.append(c) \r\n else:\r\n l.append(c // 2)\r\n \r\ng = 0 \r\np = 1\r\nans = 1\r\n# print(l)\r\n\r\nfor i in range(len(l)):\r\n g = gcd(ans, l[i]) \r\n p = ans * l[i] \r\n ans = p // g \r\nprint(ans)\r\n\r\n ", "import math\r\n\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\ndef solve():\r\n \r\n n=int(input())\r\n ar=list(map(int,input().split()))\r\n ar=[0,]+ar\r\n mark=[0](n+1)\r\n\r\n ans=list()\r\n for i in range(1,n+1):\r\n\r\n if mark[i]==0:\r\n start=i\r\n ver=i\r\n count=0\r\n while mark[ver]==0:\r\n mark[ver]=1\r\n ver=ar[ver]\r\n count=count+1\r\n if ver==start:\r\n if count%2==0:\r\n ans=ans+[count//2]\r\n else:\r\n ans=ans+[count]\r\n else:\r\n print(-1)\r\n return \r\n\r\n\r\n f=1\r\n for x in ans:\r\n f=fx//gcd(f,x)\r\n print(f)\r\n\r\nsolve()\r\n", "from math import gcd\r\nn = int(input())\r\narr = map(int, input().split())\r\narr = list(map(lambda x: x-1, arr))\r\n\r\nres = 1\r\nfor i in range(n):\r\n p, k = 0, i\r\n for j in range(n):\r\n k = arr[k]\r\n if k == i:\r\n p = j\r\n break\r\n if k != i:\r\n print(-1)\r\n exit()\r\n p += 1\r\n if p % 2 == 0: p //= 2\r\n res = res * p // gcd(res, p) \r\nprint(res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif sorted(a) != list(range(1, n + 1)): exit(print(-1))\r\na = [i - 1 for i in a]\r\nans = 1\r\nfrom math import gcd\r\nfor i in range(n):\r\n now = i\r\n cnt = -1\r\n for j in range(1, n + 2):\r\n now = a[now]\r\n if now == i:\r\n cnt = j\r\n break\r\n else:\r\n continue\r\n if cnt % 2 == 0: cnt //= 2\r\n ans = ans * cnt // gcd(ans, cnt)\r\nprint(ans)", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import \r\nfrom sys import stdin\r\n# from bisect import \r\nfrom heapq import \r\nfrom math import \r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, = gil()\r\nnxt = [0] + gil()\r\nvis = [0](n+1)\r\n\r\nc = set()\r\n\r\ndef cycle(p):\r\n tt = 0\r\n start = p\r\n while vis[p] == 0:\r\n tt += 1\r\n vis[p] = 1\r\n p = nxt[p]\r\n if p != start:\r\n print(-1)\r\n exit()\r\n return tt\r\n\r\n\r\nfor p in range(1, n+1):\r\n if vis[p] : continue\r\n tt = cycle(p)\r\n if tt&1 :\r\n c.add(tt)\r\n else:\r\n c.add(tt//2)\r\n\r\nif 1 in c:c.remove(1)\r\n\r\n\r\nc = list(c)\r\n# print(c)\r\nif len(c) <= 1:\r\n print(c[0] if c else 1)\r\n exit()\r\n\r\npr = {}\r\n\r\ndef getPrime(x):\r\n ppr = {}\r\n\r\n for i in range(2, int(sqrt(x))+1):\r\n po = 0\r\n while x%i == 0:\r\n x //= i\r\n po += 1\r\n if po:ppr[i] = po\r\n\r\n if x > 1:\r\n ppr[x] = 1\r\n\r\n return ppr\r\n\r\n\r\n\r\nfor v in c:\r\n for pi, po in getPrime(v).items():\r\n pr[pi] = max(pr.get(pi, 0), po)\r\n\r\nans = 1\r\n\r\nfor pi, po in pr.items():\r\n ans = pi*po\r\n\r\nprint(ans)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nl=list(map(lambda x:int(x)-1,input().split()))\r\n\r\nuse=[]\r\nvalid=1\r\nfor i in range(n):\r\n t=i\r\n for j in range(n+5):\r\n t=l[t]\r\n if t==i:\r\n if (j+1)%2==0: use.append((j+1)//2)\r\n else: use.append(j+1)\r\n break\r\n else:\r\n valid=0\r\n\r\nif not valid: print(\"-1\")\r\nelse:\r\n # get lcm\r\n ans=1\r\n for i in use:\r\n t=ans\r\n while ans%i:\r\n ans+=t\r\n print(ans)\r\n", "#!/usr/bin/python3\n\nfrom fractions import gcd\n\nn = int(input())\ndef dfs(u, v, nxt, vis):\n if u == v:\n return True\n elif vis[u]:\n return False\n else:\n vis[u] = True\n return dfs(nxt[u], v, nxt, vis)\n\n\ndef size(u, v, nxt):\n if u == v:\n return 1\n return size(nxt[u], v, nxt) + 1\n\n\nnxt = list(map(int, input().split()))\nfor i in range(n):\n nxt[i] -= 1\n\nszs = []\n\nfor i in range(n):\n if not dfs(nxt[i], i, nxt, [False] n) and nxt[i] != i:\n print(-1)\n exit(0)\n elif nxt[i] == i:\n szs.append(1)\n else:\n szs.append(size(nxt[i], i, nxt))\n\n\nans = 1\ng = 0\nfor i in range(n):\n if szs[i] % 2 == 0:\n szs[i] //= 2\n ans = (ans * szs[i]) // gcd(ans, szs[i])\n\nprint(ans)\n\n" ]	{"inputs": ["4\n2 3 1 4", "4\n4 4 4 4", "4\n2 1 4 3", "5\n2 4 3 1 2", "5\n2 2 4 4 5", "5\n2 4 5 4 2", "10\n8 10 4 3 2 1 9 6 5 7", "10\n10 1 4 8 5 2 3 7 9 6", "10\n6 4 3 9 5 2 1 10 8 7", "100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100\n95 27 13 62 100 21 48 84 27 41 34 89 21 96 56 10 6 27 9 85 7 85 16 12 80 78 20 79 63 1 74 46 56 59 62 88 59 5 42 13 81 58 49 1 62 51 2 75 92 94 14 32 31 39 34 93 72 18 59 44 11 75 27 36 44 72 63 55 41 63 87 59 54 81 68 39 95 96 99 50 94 5 3 84 59 95 71 44 35 51 73 54 49 98 44 11 52 74 95 48", "100\n70 49 88 43 66 72 6 6 48 46 59 22 56 86 14 53 50 84 79 76 89 65 10 14 27 43 92 95 98 6 86 6 95 65 91 8 58 33 31 67 75 65 94 75 12 25 37 56 17 79 74 5 94 65 99 75 16 52 19 17 41 39 44 46 51 50 82 90 25 32 83 36 74 49 61 37 8 52 35 28 58 82 76 12 7 66 23 85 53 19 45 8 46 21 62 38 42 48 100 61", "100\n27 55 94 11 56 59 83 81 79 89 48 89 7 75 70 20 70 76 14 81 61 55 98 76 35 20 79 100 77 12 97 57 16 80 45 75 2 21 44 81 93 75 69 3 87 25 27 25 85 91 96 86 35 85 99 61 70 37 11 27 63 89 62 47 61 10 91 13 90 18 72 47 47 98 93 27 71 37 51 31 80 63 42 88 6 76 11 12 13 7 90 99 100 27 22 66 41 49 12 11", "100\n98 39 44 79 31 99 96 72 97 54 83 15 81 65 59 75 3 51 83 40 28 54 41 93 56 94 93 58 20 53 21 7 81 17 71 31 31 88 34 22 55 67 57 92 34 88 87 23 36 33 41 33 17 10 71 28 79 6 3 60 67 99 68 8 39 29 49 17 82 43 100 86 64 47 55 66 58 57 50 49 8 11 15 91 42 44 72 28 18 32 81 22 20 78 55 51 37 94 34 4", "100\n53 12 13 98 57 83 52 61 69 54 13 92 91 27 16 91 86 75 93 29 16 59 14 2 37 74 34 30 98 17 3 72 83 93 21 72 52 89 57 58 60 29 94 16 45 20 76 64 78 67 76 68 41 47 50 36 9 75 79 11 10 88 71 22 36 60 44 19 79 43 49 24 6 57 8 42 51 58 60 2 84 48 79 55 74 41 89 10 45 70 76 29 53 9 82 93 24 40 94 56", "100\n33 44 16 91 71 86 84 45 12 97 18 1 42 67 89 45 62 56 72 70 59 62 96 13 24 19 81 61 99 65 12 26 59 61 6 19 71 49 52 17 56 6 8 98 75 83 39 75 45 8 98 35 25 3 51 89 82 50 82 30 74 63 77 60 23 36 55 49 74 73 66 62 100 44 26 72 24 84 100 54 87 65 87 61 54 29 38 99 91 63 47 44 28 11 14 29 51 55 28 95", "100\n17 14 81 16 30 51 62 47 3 42 71 63 45 67 91 20 35 45 15 94 83 89 7 32 49 68 73 14 94 45 64 64 15 56 46 32 92 92 10 32 58 86 15 17 41 59 95 69 71 74 92 90 82 64 59 93 74 58 84 21 61 51 47 1 93 91 47 61 13 53 97 65 80 78 41 1 89 4 21 27 45 28 21 96 29 96 49 75 41 46 6 33 50 31 30 3 21 8 34 7", "100\n42 40 91 4 21 49 59 37 1 62 23 2 32 88 48 39 35 50 67 11 20 19 63 98 63 20 63 95 25 82 34 55 6 93 65 40 62 84 84 47 79 22 5 51 5 16 63 43 57 81 76 44 19 61 68 80 47 30 32 72 72 26 76 12 37 2 70 14 86 77 48 26 89 87 25 8 74 18 13 8 1 45 37 10 96 100 80 48 59 73 8 67 18 66 10 26 3 65 22 8", "100\n49 94 43 50 70 25 37 19 66 89 98 83 57 98 100 61 89 56 75 61 2 14 28 14 60 84 82 89 100 25 57 80 51 37 74 40 90 68 24 56 17 86 87 83 52 65 7 18 5 2 53 79 83 56 55 35 29 79 46 97 25 10 47 1 61 74 4 71 34 85 39 17 7 84 22 80 38 60 89 83 80 81 87 11 41 15 57 53 45 75 58 51 85 12 93 8 90 3 1 59", "100\n84 94 72 32 61 90 61 2 76 42 35 82 90 29 51 27 65 99 38 41 44 73 100 58 56 64 54 31 14 58 57 64 90 49 73 80 74 19 31 86 73 44 39 43 28 95 23 5 85 5 74 81 34 44 86 30 50 57 94 56 53 42 53 87 92 78 53 49 78 60 37 63 41 19 15 68 25 77 87 48 23 100 54 27 68 84 43 92 76 55 2 94 100 20 92 18 76 83 100 99", "100\n82 62 73 22 56 69 88 72 76 99 13 30 64 21 89 37 5 7 16 38 42 96 41 6 34 18 35 8 31 92 63 87 58 75 9 53 80 46 33 100 68 36 24 3 77 45 2 51 78 54 67 48 15 1 79 57 71 97 17 52 4 98 85 14 47 83 84 49 27 91 19 29 25 44 11 43 60 86 61 94 32 10 59 93 65 20 50 55 66 95 90 70 39 26 12 74 40 81 23 28", "100\n23 12 62 61 32 22 34 91 49 44 59 26 7 89 98 100 60 21 30 9 68 97 33 71 67 83 45 38 5 8 2 65 16 69 18 82 72 27 78 73 35 48 29 36 66 54 95 37 10 19 20 77 1 17 87 70 42 4 50 53 63 94 93 56 24 88 55 6 11 58 39 75 90 40 57 79 47 31 41 51 52 85 14 13 99 64 25 46 15 92 28 86 43 76 84 96 3 74 81 80", "100\n88 41 92 79 21 91 44 2 27 96 9 64 73 87 45 13 39 43 16 42 99 54 95 5 75 1 48 4 15 47 34 71 76 62 17 70 81 80 53 90 67 3 38 58 32 25 29 63 6 50 51 14 37 97 24 52 65 40 31 98 100 77 8 33 61 11 49 84 89 78 56 20 94 35 86 46 85 36 82 93 7 59 10 60 69 57 12 74 28 22 30 66 18 68 72 19 26 83 23 55", "100\n37 60 72 43 66 70 13 6 27 41 36 52 44 92 89 88 64 90 77 32 78 58 35 31 97 50 95 82 7 65 99 22 16 28 85 46 26 38 15 79 34 96 23 39 42 75 51 83 33 57 3 53 4 48 18 8 98 24 55 84 20 30 14 25 40 29 91 69 68 17 54 94 74 49 73 11 62 81 59 86 61 45 19 80 76 67 21 2 71 87 10 1 63 9 100 93 47 56 5 12", "100\n79 95 49 70 84 28 89 18 5 3 57 30 27 19 41 46 12 88 2 75 58 44 31 16 8 83 87 68 90 29 67 13 34 17 1 72 80 15 20 4 22 37 92 7 98 96 69 76 45 91 82 60 93 78 86 39 21 94 77 26 14 59 24 56 35 71 52 38 48 100 32 74 9 54 47 63 23 55 51 81 53 33 6 36 62 11 42 73 43 99 50 97 61 85 66 65 25 10 64 40", "100\n74 71 86 6 75 16 62 25 95 45 29 36 97 5 8 78 26 69 56 57 60 15 55 87 14 23 68 11 31 47 3 24 7 54 49 80 33 76 30 65 4 53 93 20 37 84 35 1 66 40 46 17 12 73 42 96 38 2 32 72 58 51 90 22 99 89 88 21 85 28 63 10 92 18 61 98 27 19 81 48 34 94 50 83 59 77 9 44 79 43 39 100 82 52 70 41 67 13 64 91", "100\n58 65 42 100 48 22 62 16 20 2 19 8 60 28 41 90 39 31 74 99 34 75 38 82 79 29 24 84 6 95 49 43 94 81 51 44 77 72 1 55 47 69 15 33 66 9 53 89 97 67 4 71 57 18 36 88 83 91 5 61 40 70 10 23 26 30 59 25 68 86 85 12 96 46 87 14 32 11 93 27 54 37 78 92 52 21 80 13 50 17 56 35 73 98 63 3 7 45 64 76", "100\n60 68 76 27 73 9 6 10 1 46 3 34 75 11 33 89 59 16 21 50 82 86 28 95 71 31 58 69 20 42 91 79 18 100 8 36 92 25 61 22 45 39 23 66 32 65 80 51 67 84 35 43 98 2 97 4 13 81 24 19 70 7 90 37 62 48 41 94 40 56 93 44 47 83 15 17 74 88 64 30 77 5 26 29 57 12 63 14 38 87 99 52 78 49 96 54 55 53 85 72", "100\n72 39 12 50 13 55 4 94 22 61 33 14 29 93 28 53 59 97 2 24 6 98 52 21 62 84 44 41 78 82 71 89 88 63 57 42 67 16 30 1 27 66 35 26 36 90 95 65 7 48 47 11 34 76 69 3 100 60 32 45 40 87 18 81 51 56 73 85 25 31 8 77 37 58 91 20 83 92 38 17 9 64 43 5 10 99 46 23 75 74 80 68 15 19 70 86 79 54 49 96", "100\n91 50 1 37 65 78 73 10 68 84 54 41 80 59 2 96 53 5 19 58 82 3 88 34 100 76 28 8 44 38 17 15 63 94 21 72 57 31 33 40 49 56 6 52 95 66 71 20 12 16 35 75 70 39 4 60 45 9 89 18 87 92 85 46 23 79 22 24 36 81 25 43 11 86 67 27 32 69 77 26 42 98 97 93 51 61 48 47 62 90 74 64 83 30 14 55 13 29 99 7", "100\n40 86 93 77 68 5 32 77 1 79 68 33 29 36 38 3 69 46 72 7 27 27 30 40 21 18 69 69 32 10 82 97 1 34 87 81 92 67 47 3 52 89 25 41 88 79 5 46 41 82 87 1 77 41 54 16 6 92 18 10 37 45 71 25 16 66 39 94 60 13 48 64 28 91 80 36 4 53 50 28 30 45 92 79 93 71 96 66 65 73 57 71 48 78 76 53 96 76 81 89", "100\n2 35 14 84 13 36 35 50 61 6 85 13 65 12 30 52 25 84 46 28 84 78 45 7 64 47 3 4 89 99 83 92 38 75 25 44 47 55 44 80 20 26 88 37 64 57 81 8 7 28 34 94 9 37 39 54 53 59 3 26 19 40 59 38 54 43 61 67 43 67 6 25 63 54 9 77 73 54 17 40 14 76 51 74 44 56 18 40 31 38 37 11 87 77 92 79 96 22 59 33", "100\n68 45 33 49 40 52 43 60 71 83 43 47 6 34 5 94 99 74 65 78 31 52 51 72 8 12 70 87 39 68 2 82 90 71 82 44 43 34 50 26 59 62 90 9 52 52 81 5 72 27 71 95 32 6 23 27 26 63 66 3 35 58 62 87 45 16 64 82 62 40 22 15 88 21 50 58 15 49 45 99 78 8 81 55 90 91 32 86 29 30 50 74 96 43 43 6 46 88 59 12", "100\n83 4 84 100 21 83 47 79 11 78 40 33 97 68 5 46 93 23 54 93 61 67 88 8 91 11 46 10 48 39 95 29 81 36 71 88 45 64 90 43 52 49 59 57 45 83 74 89 22 67 46 2 63 84 20 30 51 26 70 84 35 70 21 86 88 79 7 83 13 56 74 54 83 96 31 57 91 69 60 43 12 34 31 23 70 48 96 58 20 36 87 17 39 100 31 69 21 54 49 42", "100\n35 12 51 32 59 98 65 84 34 83 75 72 35 31 17 55 35 84 6 46 23 74 81 98 61 9 39 40 6 15 44 79 98 3 45 41 64 56 4 27 62 27 68 80 99 21 32 26 60 82 5 1 98 75 49 26 60 25 57 18 69 88 51 64 74 97 81 78 62 32 68 77 48 71 70 64 17 1 77 25 95 68 33 80 11 55 18 42 24 73 51 55 82 72 53 20 99 15 34 54", "100\n82 56 26 86 95 27 37 7 8 41 47 87 3 45 27 34 61 95 92 44 85 100 7 36 23 7 43 4 34 48 88 58 26 59 89 46 47 13 6 13 40 16 6 32 76 54 77 3 5 22 96 22 52 30 16 99 90 34 27 14 86 16 7 72 49 82 9 21 32 59 51 90 93 38 54 52 23 13 89 51 18 96 92 71 3 96 31 74 66 20 52 88 55 95 88 90 56 19 62 68", "100\n58 40 98 67 44 23 88 8 63 52 95 42 28 93 6 24 21 12 94 41 95 65 38 77 17 41 94 99 84 8 5 10 90 48 18 7 72 16 91 82 100 30 73 41 15 70 13 23 39 56 15 74 42 69 10 86 21 91 81 15 86 72 56 19 15 48 28 38 81 96 7 8 90 44 13 99 99 9 70 26 95 95 77 83 78 97 2 74 2 76 97 27 65 68 29 20 97 91 58 28", "100\n99 7 60 94 9 96 38 44 77 12 75 88 47 42 88 95 59 4 12 96 36 16 71 6 26 19 88 63 25 53 90 18 95 82 63 74 6 60 84 88 80 95 66 50 21 8 61 74 61 38 31 19 28 76 94 48 23 80 83 58 62 6 64 7 72 100 94 90 12 63 44 92 32 12 6 66 49 80 71 1 20 87 96 12 56 23 10 77 98 54 100 77 87 31 74 19 42 88 52 17", "100\n36 66 56 95 69 49 32 50 93 81 18 6 1 4 78 49 2 1 87 54 78 70 22 26 95 22 30 54 93 65 74 79 48 3 74 21 88 81 98 89 15 80 18 47 27 52 93 97 57 38 38 70 55 26 21 79 43 30 63 25 98 8 18 9 94 36 86 43 24 96 78 43 54 67 32 84 14 75 37 68 18 30 50 37 78 1 98 19 37 84 9 43 4 95 14 38 73 4 78 39", "100\n37 3 68 45 91 57 90 83 55 17 42 26 23 46 51 43 78 83 12 42 28 17 56 80 71 41 32 82 41 64 56 27 32 40 98 6 60 98 66 82 65 27 69 28 78 57 93 81 3 64 55 85 48 18 73 40 48 50 60 9 63 54 55 7 23 93 22 34 75 18 100 16 44 31 37 85 27 87 69 37 73 89 47 10 34 30 11 80 21 30 24 71 14 28 99 45 68 66 82 81", "100\n98 62 49 47 84 1 77 88 76 85 21 50 2 92 72 66 100 99 78 58 33 83 27 89 71 97 64 94 4 13 17 8 32 20 79 44 12 56 7 9 43 6 26 57 18 23 39 69 30 55 16 96 35 91 11 68 67 31 38 90 40 48 25 41 54 82 15 22 37 51 81 65 60 34 24 14 5 87 74 19 46 3 80 45 61 86 10 28 52 73 29 42 70 53 93 95 63 75 59 36", "100\n57 60 40 66 86 52 88 4 54 31 71 19 37 16 73 95 98 77 92 59 35 90 24 96 10 45 51 43 91 63 1 80 14 82 21 29 2 74 99 8 79 76 56 44 93 17 12 33 87 46 72 83 36 49 69 22 3 38 15 13 34 20 42 48 25 28 18 9 50 32 67 84 62 97 68 5 27 65 30 6 81 26 39 41 55 11 70 23 7 53 64 85 100 58 78 75 94 47 89 61", "100\n60 2 18 55 53 58 44 32 26 70 90 4 41 40 25 69 13 73 22 5 16 23 21 86 48 6 99 78 68 49 63 29 35 76 14 19 97 12 9 51 100 31 81 43 52 91 47 95 96 38 62 10 36 46 87 28 20 93 54 27 94 7 11 37 33 61 24 34 72 3 74 82 77 67 8 88 80 59 92 84 56 57 83 65 50 98 75 17 39 71 42 66 15 45 79 64 1 30 89 85", "100\n9 13 6 72 98 70 5 100 26 75 25 87 35 10 95 31 41 80 91 38 61 64 29 71 52 63 24 74 14 56 92 85 12 73 59 23 3 39 30 42 68 47 16 18 8 93 96 67 48 89 53 77 49 62 44 33 83 57 81 55 28 76 34 36 88 37 17 11 40 90 46 84 94 60 4 51 69 21 50 82 97 1 54 2 65 32 15 22 79 27 99 78 20 43 7 86 45 19 66 58", "100\n84 39 28 52 82 49 47 4 88 15 29 38 92 37 5 16 83 7 11 58 45 71 23 31 89 34 69 100 90 53 66 50 24 27 14 19 98 1 94 81 77 87 70 54 85 26 42 51 99 48 10 57 95 72 3 33 43 41 22 97 62 9 40 32 44 91 76 59 2 65 20 61 60 64 78 86 55 75 80 96 93 73 13 68 74 25 35 30 17 8 46 36 67 79 12 21 56 63 6 18", "100\n95 66 71 30 14 70 78 75 20 85 10 90 53 9 56 88 38 89 77 4 34 81 33 41 65 99 27 44 61 21 31 83 50 19 58 40 15 47 76 7 5 74 37 1 86 67 43 96 63 92 97 25 59 42 73 60 57 80 62 6 12 51 16 45 36 82 93 54 46 35 94 3 11 98 87 22 69 100 23 48 2 49 28 55 72 8 91 13 68 39 24 64 17 52 18 26 32 29 84 79", "100\n73 21 39 30 78 79 15 46 18 60 2 1 45 35 74 26 43 49 96 59 89 61 34 50 42 84 16 41 92 31 100 64 25 27 44 98 86 47 29 71 97 11 95 62 48 66 20 53 22 83 76 32 77 63 54 99 87 36 9 70 17 52 72 38 81 19 23 65 82 37 24 10 91 93 56 12 88 58 51 33 4 28 8 3 40 7 67 69 68 6 80 13 5 55 14 85 94 75 90 57", "100\n44 43 76 48 53 13 9 60 20 18 82 31 28 26 58 3 85 93 69 73 100 42 2 12 30 50 84 7 64 66 47 56 89 88 83 37 63 68 27 52 49 91 62 45 67 65 90 75 81 72 87 5 38 33 6 57 35 97 77 22 51 23 80 99 11 8 15 71 16 4 92 1 46 70 54 96 34 19 86 40 39 25 36 78 29 10 95 59 55 61 98 14 79 17 32 24 21 74 41 94", "100\n31 77 71 33 94 74 19 20 46 21 14 22 6 93 68 54 55 2 34 25 44 90 91 95 61 51 82 64 99 76 7 11 52 86 50 70 92 66 87 97 45 49 39 79 26 32 75 29 83 47 18 62 28 27 88 60 67 81 4 24 3 80 16 85 35 42 9 65 23 15 36 8 12 13 10 57 73 69 48 78 43 1 58 63 38 84 40 56 98 30 17 72 96 41 53 5 37 89 100 59", "100\n49 44 94 57 25 2 97 64 83 14 38 31 88 17 32 33 75 81 15 54 56 30 55 66 60 86 20 5 80 28 67 91 89 71 48 3 23 35 58 7 96 51 13 100 39 37 46 85 99 45 63 16 92 9 41 18 24 84 1 29 72 77 27 70 62 43 69 78 36 53 90 82 74 11 34 19 76 21 8 52 61 98 68 6 40 26 50 93 12 42 87 79 47 4 59 10 73 95 22 65", "100\n81 59 48 7 57 38 19 4 31 33 74 66 9 67 95 91 17 26 23 44 88 35 76 5 2 11 32 41 13 21 80 73 75 22 72 87 65 3 52 61 25 86 43 55 99 62 53 34 85 63 60 71 10 27 29 47 24 42 15 40 16 96 6 45 54 93 8 70 92 12 83 77 64 90 56 28 20 97 36 46 1 49 14 100 68 50 51 98 79 89 78 37 39 82 58 69 30 94 84 18", "100\n62 50 16 53 19 18 63 26 47 85 59 39 54 92 95 35 71 69 29 94 98 68 37 75 61 25 88 73 36 89 46 67 96 12 58 41 64 45 34 32 28 74 15 43 66 97 70 90 42 13 56 93 52 21 60 20 17 79 49 5 72 83 23 51 2 77 65 55 11 76 91 81 100 44 30 8 4 10 7 99 31 87 82 86 14 9 40 78 22 48 80 38 57 33 24 6 1 3 27 84", "100\n33 66 80 63 41 88 39 48 86 68 76 81 59 99 93 100 43 37 11 64 91 22 7 57 87 58 72 60 35 79 18 94 70 25 69 31 3 27 53 30 29 54 83 36 56 55 84 34 51 73 90 95 92 85 47 44 97 5 10 12 65 61 40 98 17 23 1 82 16 50 74 28 24 4 2 52 67 46 78 13 89 77 6 15 8 62 45 32 21 75 19 14 71 49 26 38 20 42 96 9", "100\n66 48 77 30 76 54 64 37 20 40 27 21 89 90 23 55 53 22 81 97 28 63 45 14 38 44 59 6 34 78 10 69 75 79 72 42 99 68 29 83 62 33 26 17 46 35 80 74 50 1 85 16 4 56 43 57 88 5 19 51 73 9 94 47 8 18 91 52 86 98 12 32 3 60 100 36 96 49 24 13 67 25 65 93 95 87 61 92 71 82 31 41 84 70 39 58 7 2 15 11", "100\n2 61 67 86 93 56 83 59 68 43 15 20 49 17 46 60 19 21 24 84 8 81 55 31 73 99 72 41 91 47 85 50 4 90 23 66 95 5 11 79 58 77 26 80 40 52 92 74 100 6 82 57 65 14 96 27 32 3 88 16 97 35 30 51 29 38 13 87 76 63 98 18 25 37 48 62 75 36 94 69 78 39 33 44 42 54 9 53 12 70 22 34 89 7 10 64 45 28 1 71", "100\n84 90 51 80 67 7 43 77 9 72 97 59 44 40 47 14 65 42 35 8 85 56 53 32 58 48 62 29 96 92 18 5 60 98 27 69 25 33 83 30 82 46 87 76 70 73 55 21 31 99 50 13 16 34 81 89 22 10 61 78 4 36 41 19 68 64 17 74 28 11 94 52 6 24 1 12 3 66 38 26 45 54 75 79 95 20 2 71 100 91 23 49 63 86 88 37 93 39 15 57", "100\n58 66 46 88 94 95 9 81 61 78 65 19 40 17 20 86 89 62 100 14 73 34 39 35 43 90 69 49 55 74 72 85 63 41 83 36 70 98 11 84 24 26 99 30 68 51 54 31 47 33 10 75 7 77 16 28 1 53 67 91 44 64 45 60 8 27 4 42 6 79 76 22 97 92 29 80 82 96 3 2 71 37 5 52 93 13 87 23 56 50 25 38 18 21 12 57 32 59 15 48", "100\n9 94 1 12 46 51 77 59 15 34 45 49 8 80 4 35 91 20 52 27 78 36 73 95 58 61 11 79 42 41 5 7 60 40 70 72 74 17 30 19 3 68 37 67 13 29 54 25 26 63 10 71 32 83 99 88 65 97 39 2 33 43 82 75 62 98 44 66 89 81 76 85 92 87 56 31 14 53 16 96 24 23 64 38 48 55 28 86 69 21 100 84 47 6 57 22 90 93 18 50", "100\n40 97 71 53 25 31 50 62 68 39 17 32 88 81 73 58 36 98 64 6 65 33 91 8 74 51 27 28 89 15 90 84 79 44 41 54 49 3 5 10 99 34 82 48 59 13 69 18 66 67 60 63 4 96 26 95 45 76 57 22 14 72 93 83 11 70 56 35 61 16 19 21 1 52 38 43 85 92 100 37 42 23 2 55 87 75 29 80 30 77 12 78 46 47 20 24 7 86 9 94", "100\n85 59 62 27 61 12 80 15 1 100 33 84 79 28 69 11 18 92 2 99 56 81 64 50 3 32 17 7 63 21 53 89 54 46 90 72 86 26 51 23 8 19 44 48 5 25 42 14 29 35 55 82 6 83 88 74 67 66 98 4 70 38 43 37 91 40 78 96 9 75 45 95 93 30 68 47 65 34 58 39 73 16 49 60 76 10 94 87 41 71 13 57 97 20 24 31 22 77 52 36", "100\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76 99 100", "26\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16", "100\n2 1 4 5 3 7 8 9 10 6 12 13 14 15 16 17 11 19 20 21 22 23 24 25 26 27 28 18 30 31 32 33 34 35 36 37 38 39 40 41 29 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 42 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 59 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 78", "6\n2 3 4 1 6 5", "39\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27", "15\n2 3 4 5 1 7 8 9 10 6 12 13 14 15 11", "98\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 1 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 20 38 39 40 41 42 43 44 45 46 47 48 49 37 51 52 53 54 55 56 57 58 59 60 50 62 63 64 65 66 67 61 69 70 71 72 68 74 75 76 77 78 79 80 81 73 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 82 98 99 100", "4\n2 3 4 2", "93\n2 3 4 5 1 7 8 9 10 11 12 6 14 15 16 17 18 19 20 21 22 23 13 25 26 27 28 29 30 31 32 33 34 35 36 24 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 37 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 54 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 73", "15\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9", "41\n2 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 20 21 22 23 24 12 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 25", "100\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76 100 99", "24\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16", "90\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 40 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 55 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 72", "99\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16 26 27 28 29 30 31 32 33 34 35 25 37 38 39 40 41 42 43 44 45 46 47 48 36 50 51 52 53 54 55 56 57 58 59 60 61 62 63 49 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 64 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 81", "75\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57", "9\n2 3 4 5 6 7 8 9 1", "26\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 26 16 17 18 19 20 21 22 23 24 25", "99\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 1 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 51", "96\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 76", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 1 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 18 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 37 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 57 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 78", "48\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16 26 27 28 29 30 31 32 33 34 35 25 37 38 39 40 41 42 43 44 45 46 47 48 36", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1", "12\n2 3 4 5 1 7 8 9 10 11 12 6", "12\n2 3 4 1 6 7 8 9 10 11 12 5", "100\n2 1 5 3 4 10 6 7 8 9 17 11 12 13 14 15 16 28 18 19 20 21 22 23 24 25 26 27 41 29 30 31 32 33 34 35 36 37 38 39 40 58 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 77 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 100 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99", "100\n2 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 12 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 29 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 48 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 71 100"], "outputs": ["3", "-1", "1", "-1", "-1", "-1", "15", "2", "4", "1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "1260", "6864", "360", "1098", "13090", "4020", "1098", "132", "4620", "3498", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "42", "353430", "1235", "2376", "330", "1071", "7315", "290", "708", "1440", "87", "777", "175", "5187", "9765", "660", "324", "12870", "825", "1650", "111546435", "1155", "111546435", "2", "15015", "5", "111546435", "116396280", "-1", "4849845", "105", "2431", "111546435", "315", "4849845", "14549535", "4849845", "9", "1155", "1225", "4849845", "1560090", "45045", "50", "35", "4", "111546435", "2369851"]}	UNKNOWN	PYTHON3	CODEFORCES	29
d01820987d411523356abffd769f2c7f	Vasily the Bear and Triangle	Vasily the bear has a favorite rectangle, it has one vertex at point (0,<=0), and the opposite vertex at point (x,<=y). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes. Vasya also loves triangles, if the triangles have one vertex at point B<==<=(0,<=0). That's why today he asks you to find two points A<==<=(x1,<=y1) and C<==<=(x2,<=y2), such that the following conditions hold: - the coordinates of points: x1, x2, y1, y2 are integers. Besides, the following inequation holds: x1<=<<=x2; - the triangle formed by point A, B and C is rectangular and isosceles ( is right); - all points of the favorite rectangle are located inside or on the border of triangle ABC; - the area of triangle ABC is as small as possible. Help the bear, find the required points. It is not so hard to proof that these points are unique. The first line contains two integers x,<=y (<=-<=109<=≤<=x,<=y<=≤<=109,<=x<=≠<=0,<=y<=≠<=0). Print in the single line four integers x1,<=y1,<=x2,<=y2 — the coordinates of the required points. Sample Input 10 5 -10 5 Sample Output 0 15 15 0 -15 0 0 15	[ "n=input().split()\r\nx,y=int(n[0]),int(n[1])\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,y-x,x-y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,y-x)\r\nelse:\r\n print(x+y,0,0,x+y)", "x,y=[int(x) for x in input().split(\" \")]\r\nif(x>=0 and y>=0):\r\n s=x+y\r\n print(0,s,s,0)\r\nif(x<0 and y>=0):\r\n d=x-1\r\n s=d+y\r\n print(-s,0,0,s)\r\nif(x>=0 and y<0):\r\n d=y-1\r\n s=d+x\r\n print(0,-s,s,0)\r\nif(x<0 and y<0):\r\n d=x-1\r\n e=y-1\r\n s=d+e\r\n print(-s,0,0,-s)", "x,y = map(int, input().split())\r\nval = abs(x)+abs(y)\r\nsign = lambda a: 1 if a>0 else -1 if a<0 else 0\r\nif x>0:\r\n point1x = 0\r\n point1y = valsign(y)\r\n point2x = val sign(x)\r\n point2y = 0\r\n print( point1x, point1y, point2x, point2y)\r\n\r\nelif x<0:\r\n point1x = val* sign(x)\r\n point1y = 0\r\n point2x = 0\r\n point2y = valsign(y)\r\n print( point1x, point1y, point2x, point2y)\r\n\r\nelse:\r\n None", "import sys\r\ninput = sys.stdin.readline\r\nx, y = [int(k) for k in input().split()]\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(x - y, 0, 0, abs(x - y))\r\nelif x > 0 and y < 0:\r\n print(0, y - x, abs(y - x), 0)\r\nelse:\r\n print(x + y, 0, 0, x + y)", "x, y = map(int, input().split())\r\n\r\ndx = -1 if x < 0 else 1\r\ndy = -1 if y < 0 else 1\r\nv = abs(x) + abs(y)\r\nx1 = min(0, v dx)\r\ny1 = v * dy if x1 == 0 else 0\r\nx2 = max(0, v * dx)\r\ny2 = v * dy if x2 == 0 else 0\r\n\r\nprint(x1, y1, x2, y2)", "import math\r\n\r\n\r\ndef main():\r\n x, y = map(int, input().split())\r\n if x > 0 and y > 0:\r\n c =[(x+y, 0), (0, x+y)]\r\n print(min(c), max(c))\r\n if x > 0 and y < 0:\r\n c = [(x - y, 0), (0, -(x - y))]\r\n print(min(c), max(c))\r\n if x < 0 and y > 0:\r\n c = [(-(-x + y), 0), (0, -x + y)]\r\n print(min(c), max(c))\r\n if x < 0 and y < 0:\r\n c = [(-(-x - y), 0), (0, -(-x - y))]\r\n print(min(c), max(c))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=map(int,input().split())\r\nif a>0 and b>0:\r\n c=abs(b)+abs(a)\r\n print(0,c,c,0)\r\nelif a<0 and b>0:\r\n c=abs(b)+abs(a)\r\n print(-c,0, 0,c)\r\nelif a<0 and b<0:\r\n c=abs(b)+abs(a)\r\n print(-c,0,0,-c)\r\nelif a>0 and b<0:\r\n c=abs(b)+abs(a)\r\n print(0,-c,c,0)", "X = list(map(int, input().split()))\r\nAnswer = [[0, X[1] + (abs(X[0]) if X[1] > 0 else abs(X[0]) * -1)],\r\n [X[0] + (abs(X[1]) if X[0] > 0 else abs(X[1]) * -1), 0]]\r\nAnswer = sorted(Answer)\r\nprint(Answer[0],end=\" \")\r\nprint(Answer[1],end=\" \")\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Being followed by my friend ESSI\r\n# CodeNumber: 621\r\n", "x, y = map(int, input().split())\r\nix = 1 if y >= 0 else -1\r\niy = 1 if x >= 0 else -1\r\nx1 = 0\r\nx2 = 0\r\ny1 = 0\r\ny2 = 0\r\nif 0 < (abs(y) + abs(x)) * iy:\r\n x1 = 0\r\n y1 = (abs(x) + abs(y)) * ix\r\n x2 = (abs(y) + abs(x)) * iy\r\n y2 = 0\r\nelse:\r\n x1 = (abs(y) + abs(x)) * iy\r\n y1 = 0\r\n x2 = 0\r\n y2 = (abs(y) + abs(x)) * ix\r\nprint(x1, y1, x2, y2)", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n print(-(abs(x)+y),0,0,abs(x)+y)\r\nelif x<0 and y<0:\r\n print((x+y),0,0,(x+y))\r\nelif x>0 and y<0:\r\n print(0,-(x+abs(y)),x+abs(y),0)", "sign = lambda x: abs(x)//x\r\n\r\nx, y = map(int, input().split())\r\nr = abs(x)+abs(y)\r\n\r\nif x > 0:\r\n print(0, rsign(y), r, 0)\r\nelse:\r\n print(-r, 0, 0, rsign(y))", "a,b=map(int, input().split())\r\nif a>0 and b>0:\r\n print(0,a+b, a+b, 0)\r\nelif a<0 and b>0:\r\n print(a-b,0,0,abs(a)+b)\r\nelif a<0 and b<0:\r\n print(a+b,0,0,a+b)\r\nelse:\r\n print(0,b-a,abs(b)+a,0)\r\n", "a, b = map(int, input().split())\r\n\r\nx = abs(a) + abs(b)\r\n\r\nif (a > 0 and b > 0):\r\n print(0, x, x, 0)\r\nelif (a > 0 and b < 0):\r\n print(0, -x, x, 0)\r\nelif (a < 0 and b > 0):\r\n print(-x, 0, 0, x)\r\nelse:\r\n print(-x, 0, 0, -x)\r\n", "x,y=map(int,input().split())\r\nz=abs(x)+abs(y)\r\nif x>0 and y>0: print(\"0 \",z,\" \",z,\" 0\")\r\nelif x<0 and y>0: print (-z,\" 0 0 \",z)\r\nelif x<0 and y<0: print (-z,\" 0 0 \",-z)\r\nelse : print(\"0 \",-z,\" \",z,\" 0\")", "x , y = [int(x) for x in input().split()]\r\na = abs(x)\r\nb = abs(y)\r\na = a + b\r\nb = a\r\nif x < 0 and y > 0:\r\n\ta = -a\r\n\tb = b\r\nelif x > 0 and y < 0:\r\n\tb = -b\r\n\ta = a\r\nelif x < 0 and y < 0:\r\n\ta = -a\r\n\tb = -b\r\nif(a < 0):\r\n\tprint(a , 0 , 0 , b)\r\nelse:\r\n\tprint(0 , b , a , 0)", "x, y = map(int, input().split())\r\nt = abs(x)+abs(y)\r\ns = y//abs(y)\r\nif x > 0:\r\n print(0, st, t, 0)\r\nelse:\r\n print(-t, 0, 0, st)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ \| \\/ _____/ \|/ _\| \|\r\n \| _/ \| /\\_____ \\\| < \| \|\r\n \| \| \\ \| / / \\ \| \\\| \|\r\n \|____\|_ /______/ /_______ /____\|__ \\___\|\r\n'''\r\n", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print(0, x+y, x+y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,abs(x)+y)\r\nelif x<0 and y<0:\r\n print(x+y,0,0,x+y)\r\nelse:\r\n print(0,y-x, abs(y)+x,0)", "s = input()\r\nx = int(s.split()[0])\r\ny = int(s.split()[1])\r\nabsl = abs(x) + abs(y)\r\nif (x > 0):\r\n if (y > 0):\r\n print(0, absl, absl, 0)\r\n else:\r\n print(0, -absl, absl, 0)\r\nelse:\r\n if (y > 0):\r\n print(-absl, 0, 0, absl)\r\n else:\r\n print(-absl, 0, 0, -absl)\r\n", "x,y=map(int,input().split())\r\nm=abs(x)+abs(y)\r\nif x>=0 :\r\n if y>=0:\r\n print(0,m,m,0)\r\n else:\r\n print(0,-m,m,0)\r\nelse :\r\n if y>=0:\r\n print(-m,0,0,m)\r\n else:\r\n print(-m,0,0,-m)\r\n \r\n ", "a,b=list(map(int,input().split()))\r\nif a>0 and b>0:\r\n print(0,a+b,a+b,0)\r\nelif b>0:\r\n x=(-1)a+b\r\n print(-x,0,0,x)\r\nelif a>0:\r\n x=(-1)b+a\r\n print(0,-x,x,0)\r\nelse:\r\n x=(-1)b+(-1)a\r\n print(-x,0,0,-x)\r\n\r\n", "x1, y1 = [int(x) for x in input().split()]\r\n\r\nif x1 > 0 and y1 > 0:\r\n p1 = (0,x1+y1)\r\n p2 = (x1+y1,0)\r\nelif x1 < 0 and y1 > 0:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (-(x1+y1), 0)\r\n p2 = (0, x1+y1)\r\nelif x1 < 0 and y1 < 0:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (-(x1+y1), 0)\r\n p2 = (0, -(x1+y1))\r\nelse:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (0, -(x1+y1))\r\n p2 = (x1+y1, 0)\r\n\r\nxs = [p1, p2]\r\nxs.sort(key=lambda x: (x[0],x[1]))\r\nout = []\r\nfor x,y in xs:\r\n out.append(x)\r\n out.append(y)\r\nout = map(str, out)\r\nprint(\" \".join(out))", "'''\r\nCreated on Jan 6, 2015\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nx = int(t[0])\r\ny = int(t[1])\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(x + -1 * y, 0, 0, -1 * x + y)\r\nelif x < 0 and y < 0:\r\n print(x + y, 0, 0, x + y)\r\nelse:\r\n print(0, -1 * x + y, x + -1 * y , 0)\r\n \r\n", "def bear_and_triangle(x,y):\r\n l=[]\r\n add=abs(x)+abs(y)\r\n if(x>0 and y>0):\r\n x1=0\r\n y1=add\r\n x2=add\r\n y2=0\r\n elif(x<0 and y>0):\r\n x1=-(add)\r\n y1=0\r\n x2=0 \r\n y2=add\r\n elif(x<0 and y<0):\r\n x1=-(add)\r\n y1=0\r\n x2=0\r\n y2=-(add)\r\n elif(x>0 and y<0):\r\n x1=0\r\n y1=-(add)\r\n x2=add\r\n y2=0\r\n l.extend((x1,y1,x2,y2))\r\n return(l)\r\n \r\n\r\n \r\n\r\nx,y=list(map(int,input().split()))\r\nresult=bear_and_triangle(x,y)\r\nfor i in result:\r\n print(i,end=\" \")", "def solve():\r\n l=list(map(int,input().split()))\r\n x=abs(l[0])+abs(l[1])\r\n if(l[0]<0 and l[1]<0):\r\n print(-x,0,0,-x)\r\n elif(l[0]<0 and l[1]>0):\r\n print(-x,0,0,x)\r\n elif(l[0]>0 and l[1]<0):\r\n print(0,-x,x,0)\r\n elif (l[0]>0 and l[1]>0):\r\n print(0,x,x,0)\r\nsolve()\r\n", "x, y = map(int, input().split(\" \"))\r\n\r\na = abs(x)+abs(y)\r\n\r\nif(x>0 and y>0):\r\n\tx1 = 0\r\n\ty1 = a\r\n\tx2 = a\r\n\ty2 = 0\r\nelif(x>0 and y<0):\r\n\tx1 = 0\r\n\ty1 = a-1\r\n\tx2 = a\r\n\ty2 = 0\r\n\r\nelif(x<0 and y<0):\r\n\tx1 = a-1\r\n\ty1 = 0\r\n\tx2 = 0\r\n\ty2 = a-1\r\n\r\nelif(x<0 and y>0):\r\n\tx1 = a-1\r\n\ty1 = 0\r\n\tx2 = 0\r\n\ty2 = a\r\n\r\n# print(x1, \" \", y1, \" \", x2, \" \", y2)\r\nprint(x1, y1, x2, y2)", "x, y = (int(i) for i in input().split())\n# Z - x = Z - y\n# Z^2 + Z^2 = (Z - x)^2 + (Z - y)^2\n# 0.5Z^2 = xy + 0.5y(Z - x) + 0.5x(Z - y)\n# 0.5Z^2 = xy + 0.5Zy - xy + 0.5Zx\n# Z^2 = (x + y)Z\n# Z = x + y\nres = abs(x) + abs(y)\nres = sorted([((x//abs(x))res, 0), (0, (y//abs(y))res)])\nres = res[0], res[1]\nprint(res)\n", "[x, y] = [int(i) for i in input().split()]\n\nif x >= 0:\n if y >= 0:\n \tprint(0,' ',x+y,' ',x+y,' ',0)\n else:\n print(0,' ',y-x,' ',x-y,' ',0)\nelse:\n if y >= 0:\n \tprint(x-y,' ',0,' ',0,' ',y-x)\n else:\n \tprint(x+y,' ',0,' ',0,' ',x+y)\n", "x,y=map(int,input().split())\r\ns=abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print('0',s,s,'0')\r\nif x>0 and y<0:\r\n print('0',-s,s,0)\r\nif x<0 and y>0:\r\n print(-s,0,0,s)\r\nif x<0 and y<0:\r\n print(-s,0,0,-s)\r\n", "x, y = map(int, input().split())\nnext_x = abs(x) + abs(y)\nif x > 0:\n if y > 0: print(f\"0 { next_x } { next_x } 0\")\n else: print(f\"0 { -next_x } { next_x } 0\")\nelse:\n if y > 0: print(f\"{ -next_x } 0 0 { next_x }\")\n else: print(f\"{ -next_x } 0 0 { -next_x }\")\n \t \t\t \t \t \t\t \t\t \t", "a,b=map(int,input().split(' '))\r\nz=abs(a)+abs(b)\r\nif(a>0 and b>0):\r\n print('0',z,z,'0')\r\nelif(a<0 and b>0):\r\n print(-z,'0','0',z)\r\nelif(a>0 and b<0):\r\n print('0',-z,z,'0')\r\nelse:\r\n print(-z,'0','0',-z)", "x,y=[int(x) for x in input().split(' ')]\nif(x>0 and y>0):\n\tprint(0,x+y,x+y,0)\nelif(x<0 and y>0):\n\tprint(x-y,0,0,y-x)\nelif(x>0 and y<0):\n\tprint(0,y-x,x-y,0)\nelse:\n\tprint(x+y,0,0,x+y)", "from math import floor\r\ns = input()\r\nsl = s.split(' ')\r\nx = int(sl[0])\r\ny = int(sl[1])\r\ndis = abs(x)+abs(y)\r\n# if type(dis) is 'int':\r\nif x > 0:\r\n\tif y > 0:\r\n\t\tprint('0 {} {} 0'.format(dis, dis))\r\n\telse:\r\n\t\tprint('0 {} {} 0'.format(-dis, dis))\r\nelse:\r\n\tif y > 0:\r\n\t\tprint('{} 0 0 {}'.format(-dis, dis))\r\n\telse:\r\n\t\tprint('{} 0 0 {}'.format(-dis, -dis))\r\n# else:\r\n# \tif x > 0:\r\n# \t\tif y > 0:\r\n# \t\t\tprint('0 {} {} 0'.format(floor(dis)+1, floor(dis)+1))\r\n# \t\telse:\r\n# \t\t\tprint('0 {} {} 0'.format(floor(dis)+1, -(floor(dis)+1)))\r\n# \telse:\r\n# \t\tif y > 0:\r\n# \t\t\tprint('0 {} {} 0'.format(-(floor(dis)+1), floor(dis)+1))\r\n# \t\telse:\r\n# \t\t\tprint('0 {} {} 0'.format(-(floor(dis)+1), -(floor(dis)+1)))\r\n", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n c=x+y\r\n x1=0\r\n y1=c\r\n x2=c\r\n y2=0\r\nelif x<0 and y>0:\r\n c=y-x\r\n x1=-c\r\n y1=0\r\n x2=0\r\n y2=c\r\nelif x<0 and y<0:\r\n c=-y-x\r\n x1=-c\r\n y1=0\r\n x2=0\r\n y2=-c\r\nelse:\r\n c=x-y\r\n x1=0\r\n y1=-c\r\n x2=c\r\n y2=0\r\nprint(f\"{x1} {y1} {x2} {y2}\")", "x,y = map(int,input(\"\").split())\na = abs(x)+abs(y)\nif x <0:\n if y < 0:\n print(\"-{} 0 0 -{}\".format(a,a))\n else:\n print(\"-{} 0 0 {}\".format(a,a))\nelse:\n if y < 0:\n print(\"0 -{} {} 0\".format(a,a))\n else:\n print(\"0 {} {} 0\".format(a,a))\n\t \t \t\t \t\t \t \t \t \t\t\t\t\t \t \t", "x, y = map(int, input().split())\r\nc = abs(x) + abs(y)\r\nif x > 0:\r\n if y > 0: print(0, c, c, 0)\r\n else: print(0, -c, c, 0)\r\nelse:\r\n if y > 0: print(-c, 0, 0, c)\r\n else: print(-c, 0, 0, -c)", "x,y=input().split()\r\nx=int(x);y=int(y)\r\nz=abs(x)+abs(y)\r\nif x>0:\r\n l=[0,zy//abs(y),zx//abs(x),0]\r\n for i in l:\r\n print(i,end=\" \")\r\n print()\r\nelse:\r\n l=[zx//abs(x),0,0,zy//abs(y)]\r\n for i in l:\r\n print(i,end=\" \")\r\n print()", "x, y = list(map(int, input().split()))\r\nx1 = 0\r\ny2 = 0\r\nif x > 0:\r\n\tx2 = abs(x) + abs(y)\r\n\tif y > 0:\r\n\t\ty1 = x2\r\n\telse:\r\n\t\ty1 = -x2\r\nelse:\r\n\tx2 = -(abs(x) + abs(y))\r\n\tif y > 0:\r\n\t\ty1 = -x2\r\n\telse:\r\n\t\ty1 = x2\r\nif x1 < x2:\r\n\tprint(x1, y1, x2, y2)\r\nelse:\r\n\tprint(x2, y2, x1, y1)", "from math import copysign as s,fabs as f\r\na=list(map(int,input().split()))\r\nb=int(f(a[0])+f(a[1]))\r\nif a[0]<0:print(-b,0,0,int(s(b,a[1])))\r\nelse:print(0,int(s(b,a[1])),b,0)\r\n", "x,y=(int(i) for i in input().split())\r\nd=abs(x)+abs(y)\r\nif(x<0):\r\n x1=-d\r\nelse:\r\n x1=d\r\nif(y<0):\r\n y1=-d\r\nelse:\r\n y1=d\r\nif(x1<0):\r\n print(x1,0,0,y1)\r\nelse:\r\n print(0,y1,x1,0)", "x,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nb=a\r\nif x>0 and y>0:\r\n print(0,a,b,0)\r\nif x<0 and y<0:\r\n print(-1b,0,0,-1a)\r\nif x<0 and y>0:\r\n print(-1a,0,0,b)\r\nif x>0 and y<0:\r\n print(0,-1b,a,0)\r\n\r\n", "a, b = map(int, input().split())\r\nif a > 0 and b >= 0:\r\n print(0, a+b, a+b, 0)\r\nelif a < 0 and b > 0:\r\n print(-abs(a) - b, 0, 0, abs(a) + b)\r\nelif a > 0 and b < 0:\r\n print(0, -(a + abs(b)), a + abs(b), 0)\r\nelse:\r\n print(a + b, 0 , 0, a + b)", "x,y=map(int,input().split())\r\nif x>=0 and y>=0:\r\n c=x+y\r\n print(0,c,c,0)\r\nelif x>=0 and y<=0:\r\n c=y-x\r\n print(0,c,-c,0)\r\nelif x<=0 and y>=0:\r\n c=y-x\r\n print(-c,0,0,c)\r\nelse:\r\n c=y+x\r\n print(c,0,0,c)", "import math\r\n\r\n\r\nclass CodeforcesTask336ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.x_y = []\r\n\r\n def read_input(self):\r\n self.x_y = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n x1 = 0\r\n x2 = 0\r\n y1 = 0\r\n y2 = 0\r\n val = abs(self.x_y[0]) + abs(self.x_y[1])\r\n x1 = val math.copysign(1, self.x_y[0])\r\n y2 = val * math.copysign(1, self.x_y[1])\r\n if x1 >= x2:\r\n swap = x2\r\n x2 = x1\r\n x1 = swap\r\n swap = y2\r\n y2 = y1\r\n y1 = swap\r\n self.result = \"{} {} {} {}\".format(int(x1), int(y1), int(x2), int(y2))\r\n\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask336ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "x, y = map(int, input().split())\r\na = abs(x) + abs(y)\r\nif x > 0:\r\n print(0, a * y // abs(y), a, 0)\r\nelse:\r\n print(-a, 0, 0, a * y // abs(y))\r\n", "def bear_tri(x,y):\n \n q = abs(x)+abs(y)\n\n if x>0 and y>0:\n print(0,q,q,0)\n elif x>0:\n print(0,-q,q,0)\n elif y>0:\n print(-q,0,0,q)\n else:\n print(-q,0,0,-q,)\n\nx, y = [x for x in list(map(int, input().split()))]\n\nbear_tri(x,y)", "l=list(map(int,input().split()))\r\nx=l[0]\r\ny=l[1]\r\nif (x>0 and y>0):\r\n print(\"0 \",x+y,\" \",x+y,\" 0\")\r\nelif(x<0 and y<0):\r\n print(x+y,\" 0 0 \",x+y)\r\nelif(x<0 and y>0):\r\n print(x-y,\" 0 0 \",y-x) \r\nelse:\r\n print(\"0 \",y-x,\" \",x-y,\" 0\")\r\n \r\n \r\n \r\n ", "a,b = map(int,input().split())\r\nval = abs(a) +abs(b)\r\np =vala//abs(a) \r\nq=0\r\nx=0\r\ny= val b//abs(b)\r\nif(p>0 ):\r\n print(q,y,p,x) \r\nelse:\r\n print(p,q,x,y)", "x,y=map(int,input().split())\r\np=abs(x)+abs(y)\r\nx1=0\r\ny2=0\r\nif y>=0:\r\n y1=p\r\nelse:\r\n y1=-p\r\nif x>=0:\r\n x2=p\r\nelse:\r\n x2=-p\r\nif x1<x2:\r\n print(x1,y1,x2,y2)\r\nelse:\r\n print(x2,y2,x1,y1)\r\n \r\n", "\r\nif __name__ == \"__main__\":\r\n \r\n point = list(map(int , input().rstrip().split()))\r\n x = point[0]\r\n y = point[1]\r\n if x > 0 and y > 0:\r\n temp_x = x + y\r\n temp_y = y + x\r\n elif x < 0 and y > 0:\r\n temp_x = x - y\r\n temp_y = y - x\r\n elif x < 0 and y < 0:\r\n temp_x = x + y\r\n temp_y = y + x\r\n else:\r\n temp_x = x - y\r\n temp_y = y - x\r\n\r\n if temp_x < 0:\r\n x1 , y1 = temp_x , 0\r\n x2 , y2 = 0 , temp_y\r\n else:\r\n x2 , y2 = temp_x , 0\r\n x1 , y1 = 0 , temp_y\r\n print (x1 , y1 , x2 , y2)\r\n", "x , y = [int(x) for x in input().split()]\r\na = int(y(abs(x)+abs(y))/abs(y))\r\nb = int(x(abs(x)+abs(y))/abs(x))\r\nif (b>0):\r\n print(0,a,b,0)\r\nelse : \r\n print(b,0,0,a)", "x,y=map(int,input().split())\r\nif xy>0:\r\n l=[[x+y,0],[0,x+y]]\r\nelse:\r\n l=[[x-y,0],[0,y-x]]\r\nl.sort()\r\nans=[l[0][0],l[0][1],l[1][0],l[1][1]]\r\nprint(ans)", "x, y = list(map(int, input().split()))\r\nans = abs(x) + abs(y)\r\nif (x > 0 and y > 0):\r\n print(0, ans, ans, 0)\r\nelif (x > 0 and y < 0):\r\n print(0, -ans, ans, 0)\r\nelif (x < 0 and y > 0):\r\n print(-ans, 0, 0, ans)\r\nelse:\r\n print(-ans, 0, 0, -ans)", "a, b = tuple(map(int, input().split()))\r\nres = abs(a) + abs(b)\r\nx, y = (a//abs(a) * res, b//abs(b) * res)\r\nif x < 0:\r\n print(x, 0, 0, y)\r\nelse:\r\n print(0, y, x, 0)", "x,y = map(int,input().split())\r\ncord = abs(x)+abs(y)\r\nif x>0:\r\n if y>0:\r\n print(0,cord,cord,0)\r\n else:\r\n print(0,-cord,cord,0)\r\nelse:\r\n if y>0:\r\n print(-cord,0,0,cord)\r\n else:\r\n print(-cord,0,0,-cord)", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(x, y):\r\n s = abs(x) + abs(y)\r\n\r\n if x > 0 and y > 0:\r\n return f\"{0} {s} {s} {0}\"\r\n elif x < 0 and y > 0:\r\n return f\"{-s} {0} {0} {s}\"\r\n elif x < 0 and y < 0:\r\n return f\"{-s} {0} {0} {-s}\"\r\n else:\r\n return f\"{0} {-s} {s} {0}\"\r\n\r\n\r\nx, y = read_numeric_list()\r\nprint(solve(x, y))\r\n", "x,y = map(int,input().split())\r\nz = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print(0,z,z,0)\r\nelif x<0 and y>0:\r\n print(-z,0,0,z)\r\nelif x<0 and y<0:\r\n print(-z,0,0,-z)\r\nelif x>0 and y<0:\r\n print(0,-z,z,0)", "x, y = map(int, input().split())\r\nif x * y > 0:\r\n k = y + x\r\n if k > 0:\r\n print(0, k, k, 0)\r\n else:\r\n print(k, 0, 0, k)\r\nelse:\r\n k = y - x\r\n if k > 0:\r\n print(-k, 0, 0, k)\r\n else:\r\n print(0, k, -k, 0)", "x,y=map(int,input().split())\r\ntp=abs(x)+abs(y)\r\nprint('0 %d %d 0'%(tp if y>0 else -tp,tp)) if x>0 else print('%d 0 0 %d'%(-tp,tp if y>0 else -tp))", "x, y = map(int, input().split())\ns = abs(x) + abs(y)\nif x < 0 and y < 0: print('-%d 0 0 -%d' % (s, s))\nif x < 0 and y > 0: print('-%d 0 0 %d' % (s, s))\nif x > 0 and y < 0: print('0 -%d %d 0' % (s, s))\nif x > 0 and y > 0: print('0 %d %d 0' % (s, s))\n\n", "x,y=map(int,input().split(' '))\r\nz=int( (x2).5 )+int( (y2).5 )\r\nif(x>0 and y>0): print(0,z,z,0)\r\nif(x<0 and y>0): print(-z,0,0,z)\r\nif(x<0 and y<0): print(-z,0,0,-z)\r\nif(x>0 and y<0): print(0,-z,z,0)", "x, y = map(int, input().split())\r\nm = -1 if (x > 0 and y > 0) or (x < 0 and y < 0) else 1\r\n\r\n\r\na = (0, -m * x + y)\r\nb = (x - m * y, 0)\r\nprint(a, b) if a[0] < b[0] else print(b, a)", "a, b = map(int, input().split())\nres = abs(a) + abs(b)\nx, y = a // abs(a) * res, b // abs(b) * res\nif x < 0:\n print(x, 0, 0, y)\nelse:\n print(0, y, x, 0)\n", "a,b=map(int,input().split())\r\nv=abs(a)+abs(b)\r\np=[0,v(-1)(b<0)]\r\nq=[v(-1)*(a<0),0]\r\nif a<0:p,q=q,p\r\nprint(p,q)", "#################\r\n#Author:Abduaziz#\r\n#################\r\ndef sng(x):\r\n if x < 0:\r\n return -1\r\n return 1\r\nx, y = map(int, input().split())\r\nsx = sng(x)\r\nsy = sng(y)\r\nv = abs(x) + abs(y)\r\na1 = [v sx, 0]\r\na2 = [0, v * sy]\r\nif a1[0] > a2[0]:\r\n a2, a1 = a1, a2\r\na1 += a2\r\nprint(a1)\r\n", "x,y=list(map(int,input().split()))\r\nx1,x2,y1,y2=0,0,0,0\r\nif x<0:\r\n if y<0:\r\n x1=x+y\r\n y2=y+x\r\n else:\r\n x1=x-y\r\n y2=y-x\r\nelse:\r\n if y<0:\r\n x2=x-y\r\n y1=y-x\r\n else:\r\n x2=x+y\r\n y1=y+x\r\nprint(x1,y1,x2,y2)\r\n", "a,b=list(map(int,input().split()))\r\nif a>0:\r\n\tprint(0,(abs(a)+abs(b))(1-(2(b<0))),(abs(a)+abs(b)),0 )\r\nelse:\r\n\tprint(-(abs(a)+abs(b)),0,0,(abs(a)+abs(b))(1-(2(b<0))))\r\n\t", "x,y=list(map(int,input().split()))\r\nif x>0:\r\n signx=1\r\nelse:\r\n signx=-1\r\nif y>0:\r\n signy=1\r\nelse:\r\n signy=-1\r\n\r\nval=abs(x)+abs(y)\r\nx1,x2,y1,y2=valsignx,0,0,valsigny\r\nif x1>x2:\r\n print(x2,y2,x1,y1)\r\nelse:\r\n print(x1,y1,x2,y2)\r\n", "x,y = map(int,input().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,(-x)+y)\r\nelif x>0 and y<0:\r\n print(0,y-x,(-y)+x,0)\r\nelse:\r\n print(x+y,0,0,x+y)", "currX, currY = (int(x) for x in input().split())\r\n\r\nx = abs(currX)\r\ny = abs(currY)\r\n\r\ny1 = int( x + y )\r\nx1 = y1\r\narea = x1 x1\r\nnewA = area\r\n\r\nwhile newA <= area:\r\n x1, y1 = x1 + 1, x1 + 1\r\n area = newA\r\n newA = x1 * x1\r\n\r\n\r\nx1 = int((x1-1) * (currX/abs(currX)))\r\ny1 = int((y1-1) * (currY/abs(currY)))\r\n\r\nif x1 < 0 :\r\n print(str(x1) + ' 0 0 ' + str(y1))\r\nelse:\r\n print('0 ' + str(y1) + ' ' + str(x1) + ' 0')", "a, b = map(int, input().split())\r\nmd = abs(a) + abs(b)\r\nsa = [-1,1][a>0]\r\nsb = [-1,1][b>0]\r\nif sa < 0:\r\n print(f'{md * sa} {0} {0} {md * sb}')\r\nelse:\r\n print(f'{0} {md * sb} {md * sa} {0}')", "I=[int(i) for i in input().split()]\r\nx, y =I[0], I[1]\r\nans=int(abs(x)+abs(y))\r\nA, C = [0,0], [0,0]\r\nif x>0 and y>0:\r\n A[1], C[0] = ans, ans\r\nif x>0 and y<0:\r\n A[1], C[0] = -ans, ans\r\nif x<0 and y>0:\r\n A[0], C[1] = -ans, ans\r\nif x<0 and y<0:\r\n A[0], C[1] = -ans, -ans\r\nprint(str(A[0])+' '+str(A[1])+' '+str(C[0])+' '+str(C[1]))", "from sys import stdin,stdout\r\n\r\nx,y=map(int,stdin.readline().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,0-(x+abs(y)),(x+abs(y)),0)\r\nelif x<0 and y>0:\r\n print(0-(abs(x)+y),0,0,(abs(x)+y))\r\nelse:\r\n print(0-(abs(x)+abs(y)),0,0,0-(abs(x)+abs(y)))", "\r\nx, y = map(int, input().split())\r\n\r\naa = abs(x) + abs(y)\r\n\r\nif x < 0:\r\n\tif y < 0:\r\n\t\tprint(-aa, 0, 0, -aa)\r\n\telse:\r\n\t\tprint(-aa, 0, 0, aa)\r\nelse:\r\n\tif y < 0:\r\n\t\tprint(0, -aa, aa, 0)\r\n\telse:\r\n\t\tprint(0, aa, aa, 0)", "x,y = map(int,input().split())\r\n\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(-y + x, 0, 0,-x + y)\r\nelif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\nelse:\r\n print(x + y, 0,0, x + y)\r\n", "x, y = map(int, input().split())\r\na, b = 0, 0\r\nif x > 0:\r\n if y > 0:\r\n a = x+y\r\n else:\r\n a = x + -1y\r\nelse:\r\n if y > 0:\r\n a = x+ -1y\r\n else:\r\n a = x + y\r\nif y > 0:\r\n if x > 0:\r\n b = x+y\r\n else:\r\n b = y + -1x\r\nelse:\r\n if x > 0:\r\n b = -1x + y\r\n else:\r\n b = x + y\r\nif a < 0:\r\n print(a, 0, 0, b)\r\nelse:\r\n print(0, b, a, 0)", "curX, curY = (int(x) for x in input().split())\r\n\r\nx = abs(curX)\r\ny = abs(curY)\r\n\r\ny1 = int( x + y )\r\nx1 = y1\r\narea = x1 * x1\r\nnewA = area\r\n\r\nwhile newA <= area:\r\n x1, y1 = x1 + 1, x1 + 1\r\n area = newA\r\n newA = x1 * x1\r\n\r\n\r\nx1 = int((x1-1) * (curX / abs(curX)))\r\ny1 = int((y1-1) * (curY / abs(curY)))\r\n\r\nif x1 < 0 :\r\n print(str(x1) + ' 0 0 ' + str(y1))\r\nelse:\r\n print('0 ' + str(y1) + ' ' + str(x1) + ' 0')\r\n\r\n\r\n", "\r\nx, y = map(int, input().split())\r\n\r\naa = abs(x) + abs(y)\r\n'''\r\nif x < 0:\r\n\tif y < 0:\r\n\t\tprint(-aa, 0, 0, -aa)\r\n\telse:\r\n\t\tprint(-aa, 0, 0, aa)\r\nelse:\r\n\tif y < 0:\r\n\t\tprint(0, -aa, aa, 0)\r\n\telse:\r\n\t\tprint(0, aa, aa, 0)\r\n'''\r\n\r\np = [[aa * (x // abs(x)), 0], [0, aa * (y // abs(y))]]\r\np.sort()\r\nfor i in p:\r\n\tprint(i, end = ' ')", "x, y = [int(s) for s in input().split(' ')]\r\nans = [((abs(x) // x) (abs(x) + abs(y)), 0), (0, (abs(y) // y) * (abs(x) + abs(y)))]\r\nans.sort(key=lambda x:x[0])\r\nans = ans[0] + ans[1]\r\nprint(ans)", "a,b=input().split()\r\nx=int(a)\r\ny=int(b)\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,-(abs(y)+x),(abs(y)+x),0)\r\nelif x<0 and y>0:\r\n print(-(abs(x)+y),0,0,(abs(x)+y))\r\nelif x<0 and y<0:\r\n print(x+y,0,0,x+y)\r\n\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nx,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nv=[-a,a][y>0]\r\nprint(((-a,0,0,v)if x<0 else(0,v,a,0)))\r\n ", "a,b = map(int,input().split())\nx1,y2=0,0\nx1 = abs(a)+abs(b)\ny2 = x1\nif a<0:\n\tx1 = -1x1\nif b<0:\n\ty2= -1y2\n\nif x1>0:\n\tprint(0,y2,x1,0)\nelse:\n\tprint(x1,0,0,y2)", "x,y = map(int,input().split())\r\n\r\nl = abs(x)+abs(y)\r\n\r\nif y>0:\r\n y1 = l\r\nelse :\r\n y1 = -l\r\n\r\nif(x<0):\r\n print(-l,0,0,y1)\r\nelse:\r\n print(0,y1,l,0)", "a,b=map(int,input().split())\r\nl=[[(a//abs(a))(abs(a)+abs(b)),0],[0,(b//abs(b))(abs(a)+abs(b))]]\r\nl.sort()\r\nfor j in l:\r\n for i in j:\r\n print(i,end=\" \")", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Tue Sep 8 16:30:08 2020\n\n@author: anirudhasarmatumuluri\n\"\"\"\n\n\ndef main():\n x,y = [int(x) for x in input().split()]\n quarter = 0\n if x>0 and y>0:\n quarter = 1\n elif x<0 and y>0:\n quarter = 2\n elif x<0 and y<0:\n quarter = 3\n else:\n quarter = 4\n x = abs(x)\n y = abs(y)\n \n x1 = 0\n y1 = x+y\n \n x2 = x+y\n y2 = 0\n \n if quarter == 2:\n x2 = (-x2)\n elif quarter== 3:\n x2=(-x2)\n y1 = (-y1)\n elif quarter==4:\n y1 = (-y1)\n \n if x1>=x2:\n x1,x2 = x2,x1\n y1,y2 = y2,y1\n \n print(x1,y1,x2,y2)\n \n \n\n\n\n\nmain()", "x,y=map(int,input().split())\r\nx1,x2,y1,y2=0,0,0,0\r\nif x<0:\r\n x1=x-abs(y)\r\nelse:\r\n x1=x+abs(y)\r\nif y<0:\r\n y2=y-abs(x)\r\nelse:\r\n y2=y+abs(x)\r\nif x1>x2:\r\n x1,x2=x2,x1\r\n y1,y2=y2,y1\r\nprint(x1,end=\" \")\r\nprint(y1,end=\" \")\r\nprint(x2,end=\" \")\r\nprint(y2,)", "x, y = [int(x) for x in input().split()]\nd = abs(x) + abs(y)\nans = []\nif x < 0:\n\tans += [-d, 0]\n\tif y < 0:\n\t\tans += [0, -d]\n\telse:\n\t\tans += [0, d]\nelse:\n\tans += [0]\n\tif y < 0:\n\t\tans += [-d]\n\telse:\n\t\tans += [d]\n\tans += [d, 0]\nprint(' '.join(str(x) for x in ans))\n", "x,y=map(int,input().split())\r\nsum1=abs(x)+abs(y)\r\nif(y>0):\r\n if(x<0):\r\n print(-1(sum1),0,0,sum1)\r\n else:\r\n print(0,sum1,sum1,0)\r\nelse:\r\n if(x<0):\r\n print(-1(sum1),0,0,-1(sum1))\r\n else:\r\n print(0,-1(sum1),sum1,0)", "x, y = map(int, input().split())\nif x > 0:\n if y > 0:\n print(0, x + y, x + y, 0)\n else:\n print(0, y - x, x - y, 0)\nelse:\n if y > 0:\n print(x - y, 0, 0, y - x)\n else:\n print(x + y, 0, 0, x + y)\n", "a,b = map(int, input().split())\r\nm = abs(a)+abs(b)\r\nif b<0:\r\n if a>=0:\r\n print('{} {} {} {}'.format(0,-m,m,0))\r\n if a<0:\r\n print('{} {} {} {}'.format(-m,0,0,-m))\r\nif b>=0:\r\n if a>=0:\r\n print('{} {} {} {}'.format(0,m,m,0))\r\n if a<0:\r\n print('{} {} {} {}'.format(-m,0,0,m))\r\n\r\n\r\n", "def main():\r\n x, y = list(map(int, input().split()))\r\n if x >= 0 and y >= 0:\r\n x1, x2, y1, y2 = 0, x+y, x+y, 0\r\n elif x <= 0 and y >= 0:\r\n x1, x2, y1, y2 = x-y, 0, 0, -(x-y)\r\n elif x <= 0 and y <= 0:\r\n x1, x2, y1, y2 = x+y, 0, 0, x+y\r\n elif x >= 0 and y <= 0:\r\n x1, x2, y1, y2 = 0, x - y, -(x-y), 0\r\n print(x1, y1, x2, y2)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x, y = [int(x) for x in input().split()]\nnewx = x * (abs(x) + abs(y)) / abs(x)\nnewy = y * (abs(x) + abs(y)) / abs(y)\nif newx <= 0:\n print(\"{} 0 0 {}\".format(int(newx), int(newy)))\nelse:\n print(\"0 {} {} 0\".format(int(newy), int(newx)))\n", "import math\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nINF = float('inf')\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a%b\r\n\treturn a\r\n\r\n\r\ndef primeFactor(n):\r\n\tif n % 2 == 0:\r\n\t\treturn 2\r\n\ti = 3\r\n\twhile (i ** 2) <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn i \r\n\t\ti += 1\r\n\treturn n\r\n\r\ndef main():\r\n\tx, y = map(int, input().split())\r\n\tax = ay = abs(x) + abs(y)\r\n\tif x < 0: ax = -1\r\n\tif y < 0: ay = -1\r\n\tans = sorted([[ax, 0], [0, ay]])\r\n\tfor x, y in ans:\r\n\t\tprint(x, y, end=\" \")\r\n\tprint()\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\t# t = int(input())\r\n\tt = 1\r\n\tfor _ in range(t):\r\n\t\tmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "while(1):\r\n try:\r\n x,y=map(int,input().split())\r\n if x>0 and y>0:\r\n x1,y1,x2,y2=0,x+y,x+y,0\r\n elif x<0 and y>0:\r\n x1,y1,x2,y2=-(-x+y),0,0,-x+y\r\n elif x<0 and y<0:\r\n x1,y1,x2,y2=-(-x-y),0,0,-(-x-y)\r\n else:\r\n x1,y1,x2,y2=0,-(x-y),x-y,0\r\n print(x1,y1,x2,y2,end=' ')\r\n except EOFError:\r\n break\r\n ", "x,y=map(int,input().split())\r\nif ( x>0 and y>0 ) or (x<0 and y<0):\r\n\tx1=x+y\r\n\ty1=0\r\n\tx2=0\r\n\ty2=x+y\r\nelse:\r\n\tx1=-(y-x)\r\n\ty1=0\r\n\ty2=(y-x)\r\n\tx2=0\r\nif x1<x2:\r\n\tprint(x1,y1,x2,y2)\r\nelse:\r\n\tprint(x2,y2,x1,y1)", "x, y = map(int, input().split())\nxy = abs(x) + abs(y)\nx1 = xy * (-1 if x < 0 else 1)\ny1 = xy * (-1 if y < 0 else 1)\n\nif x > 0:\n print(0, y1, x1, 0)\nelse:\n print(x1, 0, 0, y1)\n", "x0,y0=map(int,input().split())\n\nk=abs(x0)+abs(y0)\n\ny=y0 //abs(y0)\n\nx=x0//abs(x0)\n\nt=[(xk,0),(0,yk)]\n\nt.sort()\n\nfor i,j in t:\n\n print(i,j,end=\" \")\n\n", "x,y=map(int,input().strip().split())\r\nif x>0 and y>0:\r\n \r\n print(\"0\",(x+y),(x+y),\"0\")\r\n \r\nelif x<0 and y>0:\r\n \r\n z=-(x) \r\n q=-(z+y)\r\n print(q,\"0\",\"0\",(z+y))\r\n \r\n\r\nelif x>0 and y<0:\r\n z=-(y)\r\n q=-(z+x)\r\n print(\"0\",q,(z+x),\"0\")\r\n \r\nelif x<0 and y<0:\r\n s=-(x)\r\n t=-(y)\r\n u=-(s+t)\r\n \r\n print(u,\"0\",\"0\",u)\r\n \r\n \r\n ", "x,y=map(int,input().split())\r\nif(xy>0):\r\n\tslope=-1\r\nelse:\r\n\tslope=1\r\ny1=y-slopex\r\nx1=0\r\ny2=0\r\nx2=(x-y//slope)\r\nif(x1>x2):\r\n\tprint(x2,y2,x1,y1)\r\nelse:\r\n\tprint(x1,y1,x2,y2)", "ip = input()\r\nipList = ip.split(\" \")\r\nx = int(ipList[0])\r\ny = int(ipList[1])\r\n\r\nif x > -1 and y > -1:\r\n print(0,x+y,x+y,0)\r\nelif x < 0 and y > 0:\r\n print(x-y,0,0,y-x)\r\nelif x < 0 and y < 0:\r\n print(x+y,0,0,x+y)\r\nelse:\r\n print(0,y-x,x-y,0)", "x,y=map(int, input().split())\r\nt=abs(x)+abs(y)\r\nsign=y//abs(y)\r\nif x>0:\r\n print(0,signt, t,0)\r\nelse:\r\n print(-t,0, 0,signt)\r\n", "a, b = [int(x) for x in input().split()]\nxcoord = (abs(a)+abs(b))a/abs(a)\nycoord = (abs(a)+abs(b))b/abs(b)\nif(xcoord < 0):\n\tprint(\"%d %d %d %d\"%(xcoord, 0, 0, ycoord))\nelse:\n\tprint(\"%d %d %d %d\"%(0, ycoord, xcoord, 0))\n", "def Abs(a):\r\n if a<0:\r\n return -a\r\n return a\r\n\r\n\r\ndef main():\r\n x,y=[int(a) for a in input().split(' ')]\r\n val=Abs(x)+Abs(y)\r\n if(x<0 and y>0):\r\n print(-val,'0','0',val)\r\n if(x<0 and y<0):\r\n print(-val,'0','0',-val)\r\n if(x>0 and y>0):\r\n print('0',val,val,'0')\r\n if(x>0 and y<0):\r\n print('0',-val,val,'0')\r\n \r\nmain()", "x,y = map(int,input().split())\r\ns = abs(x) + abs(y)\r\nif x >= 0 :\r\n x1 = 0\r\n x2 = s\r\n if y >= 0:\r\n y1 = s\r\n y2 = 0\r\n else:\r\n y1 = -s\r\n y2 = 0\r\nelif x < 0 :\r\n x1 = -s\r\n x2 = 0\r\n if y >= 0 :\r\n y1 = 0\r\n y2 = s\r\n else :\r\n y1 = 0\r\n y2 = -s\r\nprint(x1,y1,x2,y2)\r\n", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n (x0, y0) = map(int, input().split())\r\n\r\n if x0 * y0 > 0:\r\n b = x0 + y0\r\n\r\n if b > 0:\r\n print('0 %d %d 0' % (b, b))\r\n else:\r\n print('%d 0 0 %d' % (b, b))\r\n else:\r\n b = y0 - x0\r\n\r\n if b < 0:\r\n print('0 %d %d 0' % (b, -b))\r\n else:\r\n print('%d 0 0 %d' % (-b, b))\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = map(int, input().split())\r\nz = abs(x) + abs(y)\r\nans = []\r\ns = 1\r\nif x < 0:\r\n s = -1\r\nans.append((s * z, 0))\r\ns = 1\r\nif y < 0:\r\n s = -1\r\nans.append((0, s * z))\r\nans.sort()\r\nprint(ans[0][0], ans[0][1], ans[1][0], ans[1][1])\r\n", "n,m=map(int,input().split())\ns=abs(n)+abs(m)\nans=[]\nif n<0 and m>0:\n\tprint(-s,0,0,s)\nelif n<0 and m<0:\n\tprint(-s,0,0,-s)\nelif n>0 and m<0:\n\tprint(0,-s,s,0)\nelse:\n\tprint(0,s,s,0)\n", "x,y = map(int, input().split())\r\nn = abs(x) + abs(y)\r\ny1 , x2 , x1, y2 = 0,0 , None, None\r\nif x > 0 and y > 0 :\r\n x2 = n\r\n x1 = 0\r\n y1 = n\r\n y2 = 0\r\nelif x > 0 and y < 0:\r\n x1 = 0\r\n x2 = n\r\n y1 = -n\r\n y2 = 0\r\nelif x < 0 and y > 0:\r\n x1 = -n\r\n x2 = 0\r\n y1 = 0\r\n y2 = n\r\nelif x < 0 and y < 0:\r\n x1 = -n\r\n x2 = 0\r\n y1 = 0\r\n y2 = -n\r\n\r\nprint(x1, y1, x2, y2) \r\n", "x,y = [int(num) for num in input().split(' ')]\nyCoord = (abs(x)+abs(y)) * int(y/abs(y))\ncoord1 = (0,yCoord)\nxCoord = (abs(x)+abs(y)) * int(x/abs(x))\ncoord2 = (xCoord,0)\nif coord1[0] < coord2[0]:\n print(coord1[0],end=' ')\n print(coord1[1],end=' ')\n print(coord2[0],end=' ')\n print(coord2[1])\nelse:\n print(coord2[0],end=' ')\n print(coord2[1],end=' ')\n print(coord1[0],end=' ')\n print(coord1[1])\n ", "x,y = map(int,input().split())\r\n\r\nc = abs(x)+abs(y)\r\n\r\n\r\nif x>0 and y>0:\r\n print(0,c,c,0)\r\n\r\nif x<0 and y>0:\r\n print(-c,0,0,c)\r\n\r\nif x>0 and y<0:\r\n print(0,-c,c,0)\r\n\r\nif x<0 and y<0:\r\n print(-c,0,0,-c)", "x,y=map(int,input().split())\r\na=abs(x);b=abs(y)\r\nif x>0 and y>0:\r\n print(0,a+b,a+b,0)\r\nelif x<0 and y>0:\r\n print(-(a+b),0,0,a+b)\r\nelif x<0 and y<0:\r\n print(-(a+b),0,0,-(a+b))\r\nelif x>0 and y<0:\r\n print(0,-(a+b),a+b,0)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nx, y = map(int, input().split())\r\nside = abs(x)+abs(y)\r\nif x > 0 and y > 0:\r\n ans = [0, side, side, 0]\r\nelif x > 0 and y < 0:\r\n ans = [0, -side, side, 0]\r\nelif x < 0 and y > 0:\r\n ans = [-side, 0, 0, side]\r\nelse:\r\n ans = [-side, 0, 0, -side]\r\n\r\nprint(ans)\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/336/A\nx,y=map(int,input().split())\nt=abs(x)+abs(y)\nif x>0 and y>0:\n\tprint(0,t,t,0)\nelif x<0 and y>0:\n\tprint(-t,0,0,t)\nelif x<0 and y<0:\n\tprint(-t,0,0,-t)\nelse:\n\tprint(0,-t,t,0)\n", "a,b=map(int,input().split())\r\nif(a>0 and b>0):\r\n print(\"0\",a+b,b+a,\"0\")\r\nelif(a>0 and b<0):\r\n print(\"0\",b-a,a-b,\"0\")\r\nelif(a<0 and b<0):\r\n print(a+b,\"0 0\",b+a)\r\nelif(a<0 and b>0):\r\n print(a-b,\"0 0\",b-a)\r\n \r\n \r\n ", "x,y=map(int, input().split())\r\nt=abs(x)+abs(y)\r\nif x>0:\r\n if y>0:\r\n x1,y1,x2,y2=0,t,t,0\r\n else:\r\n x1,y1,x2,y2=0,-t,t,0\r\nelse:\r\n if y>0:\r\n x1,y1,x2,y2=-t,0,0,t\r\n else:\r\n x1,y1,x2,y2=-t,0,0,-t\r\nprint(x1,y1,x2,y2)\r\n", "x, y = input().split()\r\nx, y = int(x), int(y)\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\nelif x < 0 and y > 0:\r\n print(x - y, 0, 0, y - x)\r\nelif x < 0 and y < 0:\r\n print(x + y, 0, 0, x + y)\r\n", "def main():\r\n x, y = map(int, input().split())\r\n if x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\n elif x < 0 and y > 0:\r\n print(x - y, 0, 0, y - x)\r\n elif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\n else:\r\n print(y + x, 0, 0, y + x)\r\n\r\nmain()", "x,y=map(int,input().split())\r\na1=abs(x)+abs(y)\r\na2=a1\r\nif y<0:\r\n a2=-a1\r\nif x>=0:\r\n ans='0 '+str(a2)+' '+str(a1)+' 0'\r\nelse:\r\n ans=str(-a1)+' 0 '+'0 '+str(a2)\r\nprint(ans)", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print('0',(abs(x)+abs(y)),(abs(x)+abs(y)),'0')\r\nelif x>0 and y<0:\r\n print('0', -(abs(x) + abs(y)), (abs(x)+abs(y)), '0')\r\nelif x<0 and y>0:\r\n print(-(abs(x) + abs(y)),'0','0',(abs(x)+abs(y)))\r\nelse:\r\n print(-(abs(x) + abs(y)), '0', '0', -(abs(x) + abs(y)))\r\n\r\n", "a,b=map(int,input().split())\r\ntemp=abs(a)+abs(b)\r\nif a>0 and b>0:print(0,temp,temp,0)\r\nelif a>0 and b<0:print(0,-1temp,temp,0)\r\nelif a<0 and b>0:print(-1temp,0,0,temp)\r\nelse:print(-1temp,0,0,-1temp)\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nx, y = In()\r\nif x > 0 :\r\n if y > 0:\r\n print(0, (x+y), (x+y), 0)\r\n else:\r\n print(0, (-x+y), (x-y), 0)\r\nelse:\r\n if y > 0:\r\n print((x-y), 0, 0, (-x+y))\r\n else:\r\n print((x+y), 0, 0, (x+y))", "x,y=map(int,input().split())\r\n\r\nw = abs(x)+abs(y)\r\n\r\nif x<0:\r\n\tif y<0:\r\n\t\tprint(-w,0,0,-w)\r\n\telse:\r\n\t\tprint(-w,0,0,w)\r\nelse:\r\n\tif y<0:\r\n\t\tprint(0,-w,w,0)\r\n\telse:\r\n\t\tprint(0,w,w,0)", "x, y = map(int, input().split())\r\nans = abs(x) + abs(y)\r\nansx, ansy = ans, ans\r\nif x < 0:\r\n ansx = -ans\r\nif y < 0:\r\n ansy = -ans\r\nif ansx < 0:\r\n print(ansx, 0, 0, ansy)\r\nelse:\r\n print(0, ansy, ansx, 0)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Vasily_the_Bear_and_Triangle():\r\n x,y = invr()\r\n\r\n x_firstQuad = abs(x)\r\n y_firstQuad = abs(y)\r\n a = (x_firstQuad+y_firstQuad)\r\n\r\n if x > 0 and y > 0:\r\n x1 = 0 \r\n y1 = a \r\n x2 = a\r\n y2 = 0\r\n elif x < 0 and y > 0:\r\n x1 = -a\r\n y1 = 0\r\n x2 = 0 \r\n y2 = a \r\n elif x < 0 and y < 0:\r\n x1 = -a\r\n y1 = 0\r\n x2 = 0\r\n y2 = -a \r\n else:\r\n x1 = 0\r\n y1 = -a\r\n x2 = a\r\n y2 = 0\r\n \r\n print(str(x1) + ' ' + str(y1) + ' ' + str(x2) + ' ' + str(y2))\r\n return\r\n\r\n\r\nVasily_the_Bear_and_Triangle()", "def process():\r\n x, y = list(map(int, input().split()))\r\n \r\n val = abs(x) + abs(y)\r\n x1 = (-1 if x < 0 else 1) val\r\n y1 = 0\r\n \r\n x2 = 0\r\n y2 = (-1 if y < 0 else 1) * val\r\n \r\n if x1 > x2:\r\n x1, y1, x2, y2 = x2, y2, x1, y1\r\n \r\n print(f'{x1} {y1} {x2} {y2}')\r\n \r\nprocess()", "m,n=[int(x) for x in input().split()]\r\nif m>0:\r\n if n>0:\r\n print(0,m+n,m+n,0)\r\n else:\r\n print(0,n-m,m-n,0)\r\nelse:\r\n if n>0:\r\n print(m-n,0,0,n-m)\r\n else:\r\n print(m+n,0,0,m+n)", "# Codeforces 195, div. 2\r\n# Task A\r\n\r\ndef solve(x, y):\r\n t = abs(x) + abs(y)\r\n if x > 0 and y > 0:\r\n return 0, t, t, 0\r\n elif x > 0 and y < 0:\r\n return 0, -t, t, 0\r\n elif x < 0 and y > 0:\r\n return -t, 0, 0, t\r\n else:\r\n return -t, 0, 0, -t\r\n\r\ndef test():\r\n assert solve(10, 5) == (0, 15, 15, 0)\r\n assert solve(-10, 5) == (-15, 0, 0, 15)\r\n print(\"test passes\")\r\n\r\ntmp = input()\r\ntmp = list(map(int, tmp.split()))\r\nfor i in solve(tmp[0], tmp[1]):\r\n print(i, end=' ')\r\n \r\n\r\n", "x,y=list(map(int,input().split()))\r\np=abs(x)+abs(y)\r\nt=[int(px/abs(x)),0]\r\nw=[0,int(py/abs(y))]\r\nprint(min(t,w),max(t,w))", "x,y = map(int,input().split())\r\nif(x>0 and y>0):\r\n print(0,x+y,x+y,0)\r\nelif(x>0 and y<0):\r\n print(0,-1(x+abs(y)),x+abs(y),0)\r\nelif(x<0 and y>0):\r\n print(-1(y+abs(x)),0,0,y+abs(x))\r\nelse:\r\n z = x+y\r\n print(z,0,0,z)", "x,y = map(int,input().split())\r\nz = abs(x)+abs(y)\r\nif x>0 and y>0: print(0,z,z,0)\r\nelif x>0 and y<0: print(0,-z,z,0)\r\nelif x<0 and y>0: print(-z,0,0,z)\r\nelif x<0 and y<0: print(-z,0,0,-z)", "x,y=map(int,input().split())\r\nm=0\r\nif (x>0 and y>0) or (x<0 and y<0):\r\n m=-1\r\nelse:\r\n m=1\r\n\r\na=-(y)//m + x\r\nb=-mx + y\r\n\r\nif a<0:\r\n print(a,0,0,b)\r\nelse:\r\n print(0,b,a,0)", "#!/usr/bin/env python3\n\ndef main():\n x, y = map(int, input().split())\n xx, yy = map(abs, (x, y))\n a = 0, (xx + yy) y // yy\n c = (xx + yy) * x // xx, 0\n\n if (a[0] > c[0]):\n a, c = c, a\n \n print(a, c)\n\nif __name__ == \"__main__\":\n main()\n\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nx,y = list(map(int,input().split()))\r\ns = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n x1 = 0\r\n y1 = s\r\n x2 = s\r\n y2 = 0\r\nelif x<0 and y>0:\r\n x1 = -s\r\n y1 = 0\r\n x2 = 0\r\n y2 = s\r\nelif x<0 and y<0:\r\n x1 = -s\r\n y1 = 0\r\n x2 = 0\r\n y2 = -s\r\nelse:\r\n x1 = 0\r\n y1 = -s\r\n x2 = s\r\n y2 = 0\r\n\r\nprint(str(x1)+\" \"+str(y1)+\" \"+str(x2)+\" \"+str(y2)+\"\\n\")\r\n", "# coding: utf-8\nx, y = [int(i) for i in input().split()]\nlength = abs(x)+abs(y)\nans = []\nif x < 0:\n ans.append([-length,0])\nelse:\n ans.append([length,0])\nif y < 0:\n ans.append([0,-length])\nelse:\n ans.append([0,length])\nans.sort()\nprint(ans[0][0],ans[0][1],ans[1][0],ans[1][1])\n", "x, y = map(int, input().split())\r\n\r\nif (x > 0 and y > 0) or (x < 0 and y < 0): m = -1\r\nelse: m = 1\r\n\r\nc = y - mx\r\nx1 = -(cm)\r\ny2 = c\r\n\r\nif x1 < 0: print(x1, 0, 0, y2)\r\nelse: print(0, y2, x1, 0)\r\n", "x, y = map(int, input().split())\r\np1, p2 = (0, (-1 if y < 0 else 1) * (abs(x) + abs(y))), ((-1 if x < 0 else 1) * (abs(x) + abs(y)), 0)\r\nif p1[0] > p2[0]:\r\n p1, p2 = p2, p1\r\nprint(' '.join(map(str, p1 + p2)))", "x,y=map(int,input().split())\r\nif(x>0 and y>0):\r\n\tprint(0,x+y,x+y,0)\r\nelif(x<0 and y>0):\r\n\tprint(-(abs(x)+abs(y)),0,0,abs(x)+abs(y))\r\nelif(x<0 and y<0):\r\n\tprint(-(abs(x)+abs(y)),0,0,-(abs(x)+abs(y)))\r\nelif(x>0 and y<0):\r\n\tprint(0,-(abs(x)+abs(y)),abs(x)+abs(y),0)", "import math\r\n\r\ndef main_function():\r\n x, y = [int(i) for i in input().split(\" \")]\r\n length_of_side = abs(x) + abs(y)\r\n if x > 0 and y > 0:\r\n print(\" \".join([str(i) for i in [0, length_of_side, length_of_side, 0]]))\r\n elif x < 0 and y > 0:\r\n print(\" \".join([str(i) for i in [-length_of_side, 0, 0, length_of_side]]))\r\n elif x < 0 and y < 0:\r\n print(\" \".join([str(i) for i in [-length_of_side, 0, 0, -length_of_side]]))\r\n else:\r\n print(\" \".join([str(i) for i in [0, -length_of_side, length_of_side, 0]]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "x, y = map(int, input().split(' '))\r\n\r\nA_x, B_x, A_y, B_y = 0, 0, 0, 0\r\n\r\nA = abs(x) + abs(y)\r\nB = -(A)\r\n\r\nif x < 0:\r\n A_x = B\r\n if y > 0:\r\n B_y = A\r\n else:\r\n B_y = B\r\nelse:\r\n B_x = A\r\n if y > 0:\r\n A_y = A\r\n else:\r\n A_y = B\r\n \r\nprint(\"%d %d %d %d\" % (A_x, A_y, B_x, B_y))\r\n", "x,y = list(map(int,input().strip().split()))[:2]\r\nif x>=0 and y>=0:\r\n x2=x+y\r\n x1=0\r\n y2=0\r\n y1=y+x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x<0 and y>=0:\r\n x2=x-y\r\n y2=0\r\n x1=0\r\n y1= (-1x)+y\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x>=0 and y<0:\r\n x2 = x+(-1y)\r\n y2 = 0\r\n x1 = 0\r\n y1 = y-x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x<0 and y<0:\r\n x2=x+y\r\n x1=0\r\n y2=0\r\n y1=y+x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\n\r\n\r\n", "line = input()\n\nx,y = line.split()\nx = int(x)\ny = int(y)\n\nif xy > 0:\n b = x + y\n if b > 0:\n print(0,b,b,0)\n else:\n print(b,0,0,b)\nif xy < 0:\n b = y - x\n if b > 0:\n print(-b,0,0,b)\n else:\n print(0,b,-b,0)\n ", "# y=-x+c\r\n\r\nimport math\r\nx,y=input().split()\r\nif(((int(x)<0)and(int(y)>0)) or ((int(x)>0)and(int(y)<0))):\r\n c=int(y)-int(x)\r\n x1=0\r\n x2=-c\r\n y1=c\r\n y2=0\r\n\r\n if(x1<x2):\r\n print(f\"{x1} {y1} {x2} {y2}\")\r\n else:\r\n print(f\"{x2} {y2} {x1} {y1}\")\r\n \r\nelse:\r\n # y=x+c\r\n \r\n c=int(y)+int(x)\r\n x1=0\r\n x2=c\r\n y1=c\r\n y2=0\r\n\r\n if(x1<x2):\r\n print(f\"{x1} {y1} {x2} {y2}\")\r\n else:\r\n print(f\"{x2} {y2} {x1} {y1}\")\r\n\r\n", "x,y = map(int,input().split())\r\nif xy >= 0:\r\n m = -1\r\nelse:\r\n m = 1\r\nc = y-(mx)\r\nif x < 0:\r\n print(f\"{int(-c/m)} 0 0 {c}\")\r\nelse:\r\n print(f\"0 {c} {int(-c/m)} 0\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = map(int, input().split())\r\na = abs(x) + abs(y)\r\n\r\nif x < 0:\r\n print(-a, 0, 0, -a if y < 0 else a)\r\nelse:\r\n print(0, -a if y < 0 else a, a, 0)", "x,y = map(int , input().split())\r\n\r\nval = abs(x) + abs(y)\r\n\r\nif(x>0 and y>0):\r\n print(\"0\",val,val,\"0\",sep = \" \")\r\nelif (x<0 and y>0):\r\n print(val-1,\"0\",\"0\",val,sep = \" \")\r\nelif(x<0 and y<0):\r\n print(val-1,\"0\",\"0\",val-1,sep = \" \")\r\nelse:\r\n print(\"0\",val-1,val,\"0\",sep = \" \")", "x,y = map(int,input().split())\r\nif x < 0 and y > 0:\r\n\tprint(-y+x,0,0,y-x)\r\nif x > 0 and y < 0:\r\n\tprint(0,-(-y+x),(x-y),0)\r\nelif (y>0) and (x>0):\r\n\tprint(0,(y+x),(y+x),0)\r\nelif (y<0) and (x<0):\r\n\tprint((y+x),0,0,(y+x))", "x,y= map(int,input().split())\r\nicpt=abs(x)+abs(y)\r\nif x<0 and y<0:\r\n print(-icpt,0,0,-icpt)\r\nelif x<0 and y>0:\r\n print(-icpt,0,0,icpt)\r\nelif x>0 and y<0:\r\n print(0,-icpt,icpt,0)\r\nelse:\r\n print(0,icpt,icpt,0)\r\n", "# LUOGU_RID: 101540640\ndef sgn(x):\r\n return 0 if x == 0 else 1 if x > 0 else -1\r\nx, y = map(int, input().split())\r\nt = abs(x) + abs(y)\r\nif t * sgn(x) > 0:\r\n print(0, t * sgn(y), t * sgn(x), 0)\r\nelse:\r\n print(t * sgn(x), 0, 0, t * sgn(y))", "x, y = map(int, input().split())\r\n\r\nedge = abs(x) + abs(y)\r\n\r\nx1, y1, x2, y2 = 0, 0, 0 ,0\r\n\r\nif x >= 0 and y >= 0:\r\n x1 = 0\r\n y1 = edge\r\n x2 = edge\r\n y2 = 0\r\n\r\nelif x >= 0 and y <= 0:\r\n x1 = 0\r\n y1 = -edge\r\n x2 = edge\r\n y2 = 0\r\n \r\nelif x <= 0 and y >= 0:\r\n x1 = -edge\r\n y1 = 0\r\n x2 = 0\r\n y2 = edge\r\n\r\nelse:\r\n x1 = -edge\r\n y1 = 0\r\n x2 = 0\r\n y2 = -edge\r\n \r\nprint(str(x1) + ' ' + str(y1) + ' ' + str(x2) + ' ' + str(y2)) \r\n\r\n\r\n", "x, y = map(int, input().split())\r\n\r\nif (x < 0) != (y < 0):\r\n p = [(x - y, 0), (0, y - x)]\r\nelse:\r\n p = [(x + y, 0), (0, y + x)]\r\n\r\np.sort()\r\nprint(p[0], p[1])\r\n", "arr = input().split()\r\na = int(arr[0]) \r\nb = int(arr[1])\r\nl = abs(a) + abs(b)\r\nif a >= 0:\r\n\tx = l\r\nelse:\r\n\tx = -1l\r\n\r\nif b >= 0:\r\n\ty = l\r\nelse:\r\n\ty = -1l\r\nif x > 0:\r\n\tprint('0 ' + str(y) + ' ' + str(x) + ' 0')\r\nelse:\r\n\tprint(str(x) + ' 0 0 ' + str(y) )", "x, y = [int(str) for str in input().split()]\r\nl = abs(x) + abs(y)\r\nsign = lambda x: (1, -1)[x<0]\r\npoints = [(l * sign(x), 0), (0, l * sign(y))]\r\npoints = sorted(points, key=lambda point: point[0])\r\npprint = points[0] + points[1]\r\nprint(\" \".join([str(i) for i in pprint]))", "a,b = map(int,input().split())\r\nx1,y2=0,0\r\nx1 = abs(a)+abs(b)\r\ny2 = x1\r\nif a<0:\r\n\tx1 = -1x1\r\nif b<0:\r\n\ty2= -1y2\r\n\r\nif x1>0:\r\n\tprint(0,y2,x1,0)\r\nelse:\r\n\tprint(x1,0,0,y2)", "x,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nv=[-a,a][y>0]\r\nprint(((-a,0,0,v)if x<0 else(0,v,a,0)))\r\n", "x,y = list(map(int, input().split()))\r\n\r\nsum=abs(x)+abs(y)\r\n\r\nif x>0:\r\n b=sum if y>0 else -sum\r\n c=sum\r\n a,d=0,0\r\n\r\nelse:\r\n b,c=0,0\r\n a=-sum\r\n d=sum if y>0 else -sum\r\n\r\n\r\nprint(f\"{a} {b} {c} {d}\")", "#!/usr/bin/env python3\ndef copysign(a,b):\n return abs(a) [1,-1][b<0]\nx, y = map(int,input().split())\nz = abs(x) + abs(y)\nif x < 0:\n print(copysign(z,x), 0, 0, copysign(z,y))\nelse:\n print(0, copysign(z,y), copysign(z,x), 0)\n", "x, y = map(int, input().split())\r\n\r\nif x >= 0:\r\n if y >= 0:\r\n print(0,' ',x+y,' ',x+y,' ',0)\r\n else:\r\n print(0,' ',y-x,' ',x-y,' ',0)\r\nelse:\r\n if y >= 0:\r\n print(x-y,' ',0,' ',0,' ',y-x)\r\n else:\r\n print(x+y,' ',0,' ',0,' ',x+y)", "a=[int(x) for x in input().split()]\r\nx=a[0]\r\ny=a[1]\r\nk=abs(x)+abs(y)\r\n\r\nif(x>0):\r\n if(y<0):\r\n print(\"0\"+\" \"+str(-1k),end=\" \")\r\n else:\r\n print(\"0\"+\" \"+str(k),end=\" \")\r\n print(str(k)+\" \"+\"0\")\r\nelif(x<0):\r\n print(str(-1k)+\" \"+\"0\",end=\" \")\r\n if(y<0):\r\n sf=-1\r\n print(\"0\"+\" \"+str(-1k))\r\n else:\r\n print(\"0\"+\" \"+str(k))\r\n \r\n\r\n", "s,n = input().split()\r\nx = int(s)\r\ny = int(n)\r\nif x >0 and y>0:\r\n print(0,end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\n print(0,end = ' ')\r\nelif x<0 and y<0:\r\n print(int(x)+int(y),end = ' ')\r\n print(0,end = ' ')\r\n print(0,end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\nelif x<0 and y>0:\r\n print(int(x)-int(y),end = ' ')\r\n print(0,end = ' ')\r\n print(0,end = ' ')\r\n print(-(x-y),end = ' ')\r\nelse:\r\n print(0,end = ' ')\r\n print(-(x-y),end = ' ')\r\n print((x-y),end = ' ')\r\n print(0,end = ' ')\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "x,y=map(int,input().split())\na=abs(x)+abs(y)\nv=[-a,a][y>0]\nprint(((-a,0,0,v)if x<0else(0,v,a,0)))\n", "x, y = map(int, input().split())\r\n\r\nsign_x = -1 if x < 0 else 1\r\nsign_y = -1 if y < 0 else 1\r\nres = abs(x) + abs(y) \r\n\r\nif x < 0:\r\n print(sign_x * res, 0, 0, sign_y * res)\r\nelse:\r\n print(0, sign_y * res, sign_x * res, 0)\r\n", "string = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\ncondition1 = abs(a) == a\r\ncondition2 = abs(b) == b\r\nglobal x1, x2, y1, y2\r\ndef xy(x, y):\r\n global x1, x2, y1, y2\r\n n = abs(a) + abs(b)\r\n x1 = 0\r\n x2 = n * x\r\n y1 = n * y\r\n y2 = 0\r\n if x1 > x2:\r\n x1, x2 = x2, x1\r\n y1, y2 = y2, y1\r\ndef check(x):\r\n if condition2:\r\n xy(x, 1)\r\n else:\r\n xy(x, -1)\r\nif condition1:\r\n check(1)\r\nelse:\r\n check(-1)\r\nprint(x1, y1, x2, y2)", "x, y = map(int, input().split())\r\nx1, y1, x2, y2 = 0, 0, 0, 0\r\nif x >= 0 and y >= 0:\r\n y1 = y + x\r\n x2 = y1\r\nelif x >= 0 and y < 0:\r\n y1 = -x+y\r\n x2 = abs(y1)\r\nelif x < 0 and y >= 0:\r\n y2 = y-x\r\n x1 = -y2\r\nelse:\r\n y2 = -(-y-x)\r\n x1 = y2\r\nprint(x1, y1, x2, y2)\r\n\r\n\r\n", "import math\r\n\r\nif __name__ == \"__main__\":\r\n x,y=map(int,input().split())\r\n x1,y1,x2,y2=0,0,0,0\r\n if x<0:\r\n x1=x-int(math.fabs(y))\r\n if y<0:\r\n y2=y+x\r\n else:\r\n y2=y-x\r\n else:\r\n x2=x+int(math.fabs(y))\r\n if y<0:\r\n y1=y-x\r\n else:\r\n y1=y+x\r\n print(x1,y1,x2,y2)", "def main():\n x, y = map(int, input().strip().split())\n t=abs(x)+abs(y)\n if x>0<y:\n print(0,t,t,0)\n elif x<0<y:\n print(-t,0,0,t)\n elif x>0>y:\n print(0,-t,t,0)\n else:\n print(-t,0,0,-t)\n\nmain()", "integer = int\r\nstring = str\r\nlength = len\r\n\r\n\r\ndef main():\r\n x,y=list(map(integer,input().split()))\r\n point=abs(x)+abs(y)\r\n if x>0 and y>0:\r\n print(0,point,point,0)\r\n elif x<0 and y>0:\r\n print(-1point,0,0,point)\r\n elif x<0 and y<0:\r\n print(-1point,0,0,-1point)\r\n else:\r\n print(0,-1point,point,0)\r\n\r\n\r\nmain()", "import sys;\r\n\r\nclass MyReader:\r\n# file = null;\r\n def __init__(self):\r\n filename = \"file.in\";\r\n if self.isLocal():\r\n self.file = open(filename);\r\n self.str = [\"\"];\r\n self.ind = 1;\r\n \r\n def isLocal(self):\r\n return len(sys.argv) > 1 and sys.argv[1] == \"SCHULLZ\";\r\n\r\n def nextString(self):\r\n if self.isLocal():\r\n return self.file.read();\r\n else:\r\n return input();\r\n \r\n def nextInt(self):\r\n return int(self.nextToken());\r\n\r\n def nextToken(self):\r\n if (self.ind >= len(self.str)):\r\n self.ind = 0;\r\n self.str = self.nextString().split();\r\n self.ind += 1;\r\n return self.str[self.ind - 1];\r\n\r\ndef Solve():\r\n x = -1;\r\n try:\r\n x = rdr.nextInt();\r\n except Exception:\r\n return False;\r\n y = rdr.nextInt();\r\n\r\n mx = 1;\r\n my = 1;\r\n\r\n if (x < 0):\r\n x = -x;\r\n mx = -1;\r\n if (y < 0):\r\n y = -y;\r\n my = -1;\r\n \r\n x1 = 0;\r\n y1 = x + y;\r\n x2 = x + y;\r\n y2 = 0;\r\n\r\n if (-1 == mx):\r\n x1 = -x1;\r\n x2 = -x2;\r\n\r\n if (-1 == my):\r\n y1 = -y1;\r\n y2 = -y2;\r\n\r\n if (x1 > x2):\r\n (x1, x2) = (x2, x1);\r\n (y1, y2) = (y2, y1);\r\n\r\n print(x1, y1, x2, y2);\r\n\r\n return True;\r\n\r\nrdr = MyReader();\r\n\r\nif (not rdr.isLocal()):\r\n Solve();\r\nelse:\r\n while (Solve()):\r\n fgh = 1\r\n\r\n\r\n", "x, y = map(int, input().split())\r\nans = abs(x)+abs(y)\r\n\r\nif x > 0 and y > 0:\r\n print(0, ans, ans, 0)\r\nif x < 0 and y > 0:\r\n print(-ans, 0, 0, ans)\r\nif x < 0 and y < 0:\r\n print(-ans, 0, 0, -ans)\r\nif x > 0 and y < 0:\r\n print(0, -ans, ans, 0)", "x, y = map(int, input().split())\r\nif x > 0:\r\n if y > 0:\r\n print(0, x+y, x+y, 0)\r\n else:\r\n print(0, -(x-y), x-y, 0)\r\nelse:\r\n if y > 0:\r\n print(x-y, 0, 0, -x+y)\r\n else:\r\n print(x+y, 0, 0, x+y)", "#A. Vasily the Bear and Triangle\r\nx, y = map(int,input().split())\r\nt = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print(0,t,t,0)\r\nelif x<0 and y>0 :\r\n print(-1t,0,0,t)\r\nelif x>0 and y<0:\r\n print(0,-1t,t,0)\r\nelse:\r\n print(-1t,0,0,-1t)", "#!/usr/bin/python3\n\nx, y = tuple(map(int, input().split()))\nif x > 0 and y > 0:\n print(0, x + y, x + y, 0)\nelif x > 0 and y < 0:\n print(0, -x + y, x - y, 0)\nelif x < 0 and y > 0:\n print(x - y, 0, 0, -x + y)\nelse:\n print(x + y, 0, 0, x + y)\n", "x, y = map(int, input().split())\r\nif x > 0 and y > 0 :\r\n print(0, x+y, x+y,0)\r\nif x > 0 and y < 0 :\r\n print(0, y-x, x-y,0)\r\nif x < 0 and y < 0 :\r\n print (x+y, 0, 0,x+y)\r\nif x < 0 and y > 0 :\r\n print(x-y,0,0, y-x)\r\n\r\n\r\n\r\n\r\n", "\r\nx,y=map(int,input().split())\r\n\r\nif x>0 and y>0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(-(x+y),0,0,(x+y))\r\nelif x<0 and y<0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(-(x+y),0,0,-(x+y))\r\nelse:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(0,-(x+y),(x+y),0)", "def sgn(n):\r\n if n>0: return 1\r\n return -1\r\nx,y=map(int,input().split())\r\nv=abs(x)+abs(y)\r\nl=[[vsgn(x),0],[0,vsgn(y)]]\r\nif l[0][0]>l[1][0]:\r\n l[0],l[1]=l[1],l[0]\r\nfor x in l:\r\n print(x,end=' ')", "x,y = [int(i) for i in input().split()]\n\nif xy > 0:\n c = y+x\n \n c1 = (0,c)\n c2 = (c,0)\n if(c2 < c1):\n c1,c2=c2,c1\n print(c1[0],c1[1],c2[0],c2[1])\n \nelse:\n c = y-x\n \n c1 = (0,c)\n c2 = (-c,0)\n if(c2 < c1):\n c1,c2=c2,c1\n print(c1[0],c1[1],c2[0],c2[1])\n \n\n", "x,y = map(int,input(\"\").split())\nif x > 0 and y > 0:\n a = x + y\n x1 = 0\n y1 = a\n x2 = a\n y2 = 0\n print(x1,y1,x2,y2)\nelif x < 0 and y > 0:\n a = x - y\n x1 = a\n y1 = 0\n x2 = 0\n y2 = -a\n print(x1,y1,x2,y2)\nelif x < 0 and y < 0:\n a = -(x+y)\n x1 = -a\n y1 = 0\n x2 = 0\n y2 = -a\n print(x1,y1,x2,y2)\nelif x > 0 and y < 0:\n a = -(y-x)\n x1 = 0\n y1 = -a\n x2 = a\n y2 = 0\n print(x1,y1,x2,y2)\n\n\n\n \t \t \t\t \t\t\t\t\t\t \t \t \t \t\t\t \t", "xy=input().split()\r\nx=int(xy[0])\r\ny=int(xy[1])\r\nm=0\r\nif x>0 and y>0:\r\n m=-1\r\nelif x<0 and y<0:\r\n m=-1\r\nelse:\r\n m=1\r\nif m==1:\r\n x1=0\r\n y1=y-x\r\n x2=x-y\r\n y2=0\r\nelse:\r\n x1=0\r\n y1=x+y\r\n x2=x+y\r\n y2=0\r\nif x1<x2:\r\n print(x1,y1,x2,y2)\r\nelse:\r\n print(x2,y2,x1,y1)\r\n\r\n", "a,b=map(int,input().split())\nif a>0 and b>0:\n print(0,a+b,a+b,0)\nif a>0 and b<0:\n print(0,-a+b,a-b,0)\nif a<0 and b>0:\n print(a-b,0,0,-a+b)\nif a<0 and b<0:\n print(a+b,0,0,a+b)", "x0, y0 = map(int, input().split())\r\ndiff = abs(x0) + abs(y0)\r\nif x0 < 0:\r\n if y0 < 0:\r\n print(-diff, 0, 0, -diff)\r\n else:\r\n print(-diff, 0, 0, diff)\r\nelse:\r\n if y0< 0:\r\n print(0, -diff, diff, 0 )\r\n else:\r\n print(0, diff, diff, 0)", "x,y=map(int,input().split())\n\n\n\n#y=-x+c\nif((x>0 and y>0)):\n c=y+x\n print(\"0 \"+str(c),end=\" \")\n print(str(c)+\" 0\")\nelif(x<0 and y<0):\n c=y+x\n print(str(c)+\" 0\",end=\" \")\n print(\"0 \"+str(c))\n \nelif(y>x):\n c=y-x\n print(str(-1c)+\" 0\",end=\" \")\n print(\"0 \"+str(c))\nelse:\n c=y-x\n print(\"0 \"+str(c),end=\" \")\n print(str(-1c)+\" 0\")\n \n", "x,y=map(int,input().split())\r\nif x>0:\r\n if y>0:\r\n print(0,x+y,x+y,0)\r\n else:\r\n print(0,-(x+abs(y)),x+abs(y),0)\r\nelif x<0:\r\n if y>0:\r\n print(-(abs(x)+y),0,0,(abs(x)+y))\r\n else:\r\n print(-abs(x+y),0,0,-abs(x+y))\r\n", "x,y = map (int,input().split())\r\n\r\nxs = x // abs (x)\r\nys = y // abs (y)\r\n\r\ns = abs (x) + abs (y)\r\n\r\nret = [(xss,0), (0,yss)]\r\nret.sort ()\r\n\r\nfor x,y in ret:\r\n\tprint (x,y,end=' ')\r\n", "x,y=map(int,input().split())\r\na=str(abs(x)+abs(y))\r\nif(x>0 and y>0):\r\n\tprint(\"0 \"+a+\" \"+a+\" 0\")\r\nelif(x<0 and y>0):\r\n\tprint(\"-\"+a+\" 0 0 \"+a)\r\nelif(x<0 and y<0):\r\n\tprint(\"-\"+a+\" 0 0 \"+\"-\"+a)\r\nelse:\r\n\tprint(\"0 \"+\"-\"+a+\" \"+a+\" 0\")", "[x,y]=[int(i) for i in input().split()]\r\n\r\nif(x>0 and y>0):\r\n\tprint(0,x+y,x+y,0)\r\nelif(x<0 and y>0):\r\n\tv=abs(x)+y\r\n\tprint(-v,0,0,v)\r\nelif(x>0 and y<0):\r\n\tv=x+abs(y)\r\n\tprint(0,-v,v,0)\r\nelse:\r\n\tprint(x+y,0,0,x+y)" ]	{"inputs": ["10 5", "-10 5", "20 -10", "-10 -1000000000", "-1000000000 -1000000000", "1000000000 1000000000", "-123131 3123141", "-23423 -243242423", "123112 4560954", "1321 -23131", "1000000000 999999999", "54543 432423", "1 1", "-1 -1", "-1 1", "1 -1", "42 -2", "2 -435", "76 -76", "1000000000 1", "1000000000 -1", "-1000000000 1", "-1000000000 -1", "1000000000 -999999999", "-1000000000 999999999", "-1000000000 -999999999", "999999999 1000000000", "-999999999 1000000000", "999999999 -1000000000", "-999999999 -1000000000"], "outputs": ["0 15 15 0", "-15 0 0 15", "0 -30 30 0", "-1000000010 0 0 -1000000010", "-2000000000 0 0 -2000000000", "0 2000000000 2000000000 0", "-3246272 0 0 3246272", "-243265846 0 0 -243265846", "0 4684066 4684066 0", "0 -24452 24452 0", "0 1999999999 1999999999 0", "0 486966 486966 0", "0 2 2 0", "-2 0 0 -2", "-2 0 0 2", "0 -2 2 0", "0 -44 44 0", "0 -437 437 0", "0 -152 152 0", "0 1000000001 1000000001 0", "0 -1000000001 1000000001 0", "-1000000001 0 0 1000000001", "-1000000001 0 0 -1000000001", "0 -1999999999 1999999999 0", "-1999999999 0 0 1999999999", "-1999999999 0 0 -1999999999", "0 1999999999 1999999999 0", "-1999999999 0 0 1999999999", "0 -1999999999 1999999999 0", "-1999999999 0 0 -1999999999"]}	UNKNOWN	PYTHON3	CODEFORCES	183
d02c5691f75073b585c6a0d403fb8188	Martian Dollar	One day Vasya got hold of information on the Martian dollar course in bourles for the next n days. The buying prices and the selling prices for one dollar on day i are the same and are equal to ai. Vasya has b bourles. He can buy a certain number of dollars and then sell it no more than once in n days. According to Martian laws, one can buy only an integer number of dollars. Which maximal sum of money in bourles can Vasya get by the end of day n? The first line contains two integers n and b (1<=≤<=n,<=b<=≤<=2000) — the number of days and the initial number of money in bourles. The next line contains n integers ai (1<=≤<=ai<=≤<=2000) — the prices of Martian dollars. Print the single number — which maximal sum of money in bourles can Vasya get by the end of day n. Sample Input 2 4 3 7 4 10 4 3 2 1 4 10 4 2 3 1 Sample Output 8 10 15	[ "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i, n):\r\n ans = max(ans, (b//a[i])a[j] + b%a[i])\r\nprint(ans)", "n, am=map(int, input().split())\na=list(map(int, input().split()))\nmaxd=0\nx=0\ny=0\nprofit=0\nb=[0]n\nb[n-1]=-1\nmaxi=0\nfor i in range(n-2, -1, -1):\n maxi = max(maxi, a[i+1]) \n b[i] = maxi\nfor i in range(n):\n if b[i]>0: \n profit=max(profit, (am//a[i])(b[i]-a[i]))\nprint(am+profit)\n \t \t\t \t \t \t\t \t \t\t\t\t\t \t \t\t", "# @Chukamin ICPC_TRAIN\n\ndef main():\n n, b = map(int, input().split())\n data = list(map(int, input().split()))\n choose = 0\n ans = b\n for i in range(n):\n now_ans = b + (b // data[choose]) (data[i] - data[choose])\n ans = max(ans, now_ans)\n if data[choose] > data[i]:\n choose = i\n print(ans)\n\nif __name__ == '__main__':\n main()\n\n \t\t \t \t\t \t \t \t \t\t\t\t", "n, b = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\n\nans = b\nfor i in range(n):\n for j in range(i + 1, n):\n if arr[j] > arr[i]:\n cur = (b // arr[i]) * arr[j] + (b % arr[i])\n ans = max(ans, cur)\n\nprint(ans)\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=0;ans=b\r\nfor i in range(a-1):\r\n d=c[i+1:]\r\n if max(d)>c[i]:\r\n d=((b//c[i])max(d))+b%c[i]\r\n if d>ans:\r\n ans=d\r\n d=0\r\nprint(ans)", "n, b = map(int, input().split())\na = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(0, len(a)):\n m = b // a[_]\n o = b - m a[_]\n for i in range(_, len(a)):\n res = max(m * a[i] + o, res)\n\nprint(res)\n", "n , b = map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nmon=0\r\nsell=0\r\nans=[]\r\nfor i in range(n):\r\n share = b//lis[i]\r\n mon=b- (b//lis[i])lis[i]\r\n for j in range(i,n):\r\n sell=lis[j]share\r\n# print(share,sell,mon)\r\n ans.append(sell+mon)\r\n#print(ans)\r\nprint(max(ans)) \r\n", "n, b = map(int, input().split())\r\nrates, benefit = [int(i) for i in input().split()], b\r\nfor i, rate in enumerate(rates[:n-1]):\r\n local_max = max(rates[i + 1:])\r\n if rate <= b and local_max > rate and b // rate * local_max + b % rate > benefit:\r\n benefit = b // rate * local_max + b % rate\r\nprint(benefit)\r\n", "a,k = map(int, input().split())\r\nm = list(map(int, input().split()))\r\nn = m1\r\nfor i in range(a-1, -1, -1):\r\n n[i] = max(m[i:])\r\nmx = 0\r\nfor i in range(a):\r\n mx = max(mx, (k//m[i])n[i]+k%m[i])\r\nprint(mx)", "def s():\r\n\t[n,b] = list(map(int,input().split()))\r\n\ta = list(map(int,input().split()))\r\n\tma = [1,1]\r\n\tmi = a[0]\r\n\tr = b\r\n\tfor i in a:\r\n\t\tmi = min(i,mi)\r\n\t\tr = max(r,b%mi + b//mii)\r\n\tprint(r)\r\ns()", "n, amount = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmaxd = 0\r\nx = 0\r\ny=0\r\nprofit = 0\r\nb = [0]n\r\nb[n-1] = -1\r\nmaxi = 0\r\nfor i in range(n-2, -1, -1):\r\n maxi = max(maxi, a[i+1]) \r\n b[i] = maxi\r\nfor i in range(n):\r\n if b[i]>0: \r\n profit = max(profit, (amount//a[i])(b[i]-a[i]))\r\nprint(amount+profit)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nfor _ in range(1):\r\n n, b = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n s = b\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n s = max(s, a[j](b//a[i])+(b%a[i]))\r\n print(s)", "n, b = map(int, input().split())\na, m, v = list(map(int, input().split())), 0, b\nfor i in range(n - 2, -1, -1):\n m = max(m, a[i + 1])\n v = max(v, b % a[i] + b // a[i] * m)\nprint(v)\n", "n, k=map(int,input().split())\nl=list(map(int,input().split()))\nans=k\nfor i in range(0,n-1):\n for j in range(i+1,n):\n ans=max(ans,(k//l[i])l[j]+k%l[i])\nprint(ans)\n", "d,b=map(int,input().split())\nl=list(map(int,input().split()))\nl2=[b]\nfor i in range(d):\n\tdollars=b//l[i]\n\trest=b%l[i]\n\tfor j in range (i+1,d):\n\t\tgains=dollarsl[j]\n\t\tl2.append(gains+rest)\n\nprint(max(l2))", "def maxElemFrom(cont, fromInd):\r\n ans = cont[fromInd]\r\n for i in range(fromInd + 1, len(cont)):\r\n if ans < cont[i]:\r\n ans = cont[i]\r\n return ans\r\n\r\n\r\nn, rub = [int(item) for item in input().split(' ')]\r\ncont = [int(item) for item in input().split(' ')]\r\nans = rub\r\nfor i in range(n - 1):\r\n dollars = rub // cont[i]\r\n rem = rub % cont[i]\r\n cust_max = maxElemFrom(cont, i + 1)\r\n temp = dollars * cust_max + rem\r\n if ans < temp:\r\n ans = temp\r\nprint(ans)\r\n", "# Don't wait for opportunity. Create it. Unknown\r\n# by : Blue Edge - Create some chaos\r\nn,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[]\r\nmini=4000\r\nfor x in a[:-1]:\r\n mini=min(x,mini)\r\n c.append(mini)\r\n\r\nmaxi=0\r\ni=n-2\r\nans=b\r\nfor x in a[-1:0:-1]:\r\n maxi=max(maxi,x)\r\n # print(maxi,c[i])\r\n ans=max(ans,b+max(0,(b//c[i])(maxi-c[i])))\r\n # print(ans)\r\n i-=1\r\n\r\nprint(ans)\r\n", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef main():\r\n n, s = getf()\r\n a = getf()\r\n ans = s\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n ans = max(ans, (s // a[i]) a[j] + s % a[i])\r\n put(ans)\r\nmain()\r\n", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=b\r\nfor i in range(n-1):\r\n temp=b//a[i]\r\n bal=b-tempa[i]\r\n for j in range(i+1,n):\r\n r=tempa[j]\r\n res=max(res,bal+r)\r\nprint(res)", "n,b = map(int,input().split())\r\nv = b\r\nw = list(map(int,input().split()))\r\nm = 0\r\nfor i in range(n-2,-1,-1):\r\n m=max(m,w[i+1])\r\n v=max(v,b//w[i]m+b%w[i])\r\nprint(v)\r\n", "input1 = input().split(\" \")\r\ninput2 = input().split(\" \")\r\ninput1 = [int(i) for i in input1]\r\nn, b = input1[0], input1[1]\r\nprices = [int(i) for i in input2]\r\nmax_earn = 0\r\nfor i in range(n):\r\n buy_price = prices[i]\r\n n_dollars = b // buy_price\r\n gap = 0\r\n for j in range(i, n):\r\n sell_price = prices[j]\r\n gap = sell_price - buy_price\r\n if gap n_dollars > max_earn:\r\n max_earn = gap * n_dollars\r\nprint(max_earn + b)", "from math import \n\nn, b = map(int, input().split())\na = list(map(int, input().split()))\n\nres = b\nmn = 2001\nfor i in range(1, len(a)):\n mn = min(mn, a[i - 1])\n if mn < a[i]:\n res = max(res, b + (a[i] - mn) (b // mn))\nprint(res)\n \t\t\t\t \t\t \t\t\t \t \t\t\t\t\t \t \t", "n,b=map(int, input().split())\r\na=list(map(int, input().split()))\r\ntest=0\r\nans=b\r\n\r\nfor i in range(0,n-1):\r\n for j in range(i+1,n):\r\n cp=a[i]\r\n sp=a[j]\r\n d=b//cp\r\n r=b%cp\r\n p=spd+r\r\n ans=max(ans,p)\r\nprint(ans)", "def cal(b,l,h): return(b//l h + b%l)\n\n(n,b) = map(int,str.split(input()))\na = list(map(int,str.split(input())))\n(l,h,tl,th) = (a[0],a[0],a[0],a[0])\nfor x in a:\n\tif x < tl: (tl , th) = (x,x)\n\tif x > th: \n\t\tth = x\n\t\tif cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)\nif cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)\nprint(cal(b,l,h))\n", "n,a=map(int,input().split())\r\nA=list(map(int,input().split()))\r\n\r\nMAX=A[:]\r\nfor i in range(n-2,-1,-1):\r\n MAX[i]=max(MAX[i],MAX[i+1])\r\n\r\nANS=a\r\n\r\nfor i in range(n):\r\n k=a//A[i]\r\n ANS=max(ANS,a+k(MAX[i]-A[i]))\r\n\r\nprint(ANS)\r\n", "str1 = input().split()\r\nn = (int)(str1[0])\r\nb = (int)(str1[1])\r\nstr2 = input().split()\r\nfor x in range(n):\r\n str2[x] = (int)(str2[x])\r\nminimum = list()\r\nmaximum = list()\r\nans = 0\r\nif(str2 == sorted(str2,reverse=True)):\r\n print (b)\r\nelif (str2 == sorted(str2)):\r\n print (b - ((int)(b/str2[0]) str2[0]) + ((int)(b/str2[0]) * str2[len(str2) - 1]))\r\nelse:\r\n for x in range(n-1):\r\n if(str2[x+1] > str2[x]):\r\n minimum.append(x)\r\n for x in range(n-1):\r\n if(str2[x+1] < str2[x]):\r\n maximum.append(x)\r\n maximum.append(n-1)\r\n for x in minimum:\r\n for y in maximum:\r\n if(x < y):\r\n v1 = b - ((int)(b/str2[x]) * str2[x]) + ((int)(b/str2[x]) * str2[y])\r\n ans = max(v1,ans)\r\n print (ans)", "I=lambda:map(int,input().split());n,b=I();a=list(I())\r\nq=[0]n\r\nfor i in range(n):\r\n r=a[i]\r\n for j in range(i+1,n):\r\n if a[j]>r:\r\n r=a[j]\r\n q[i]=(b//a[i])r+(b%a[i])\r\nprint(max(max(q),b))", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nfor _ in range(1):#int(input())):\r\n n, b = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ma = b\r\n for i in range(n):\r\n for j in range(i, n):\r\n cb = int(b/a[i])\r\n m = b % a[i]\r\n sell = cb * a[j] + m\r\n if (sell > ma):\r\n ma = sell\r\n print(ma)\r\n", "n, ic = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = []\r\nmx = 0\r\nfor el in a[::-1]:\r\n b.append(mx)\r\n mx = max(mx, el)\r\nb.reverse()\r\nmx = ic\r\nfor i in range(n-1):\r\n l = a[i]\r\n r = b[i]\r\n if ic >= l < r:\r\n mx = max(mx, (ic//l) * r + ic%l)\r\nprint(mx)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=m\r\nmx=a[-1]\r\nfor i in range(n-2,-1,-1):\r\n\tmx=max(mx,a[i])\r\n\tans=max(ans,m//a[i]mx+m%a[i])\r\nprint(ans)", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [t[0]] + [0] (n - 1)\r\nfor i in range(n - 1): a[i + 1] = min(a[i], t[i + 1])\r\nt.reverse()\r\nb = [t[0]] + [0] * (n - 1)\r\nfor i in range(n - 1): b[i + 1] = max(b[i], t[i + 1])\r\nb.reverse()\r\nprint(k + max((k // a[i]) * (b[i] - a[i]) for i in range(n)))", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=b\r\nfor i in range(n):\r\n p=b-l[i]\r\n if(p<0):\r\n continue\r\n else:\r\n for j in range(i+1,n):\r\n res = max(res, b//l[i]l[j]+b%l[i])\r\nprint(res)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nx=a[0]\r\ny=a[0]\r\nc=True\r\nfor i in range(1,n):\r\n if(a[i]<x):\r\n l=m%x\r\n s=m//x\r\n # print(ans,x,y)\r\n ans=max(ans,sy+l)\r\n x=a[i]\r\n y=a[i]\r\n if(i==n-1):\r\n c=False\r\n else:\r\n if(a[i]>y):\r\n y=a[i]\r\n# print(ans) \r\nif(c):\r\n l=m%x\r\n s=m//x\r\n ans=max(ans,sy+l) \r\nprint(ans) ", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=sorted(l)\r\nr.reverse()\r\np=[]\r\n#print(r,l)\r\nif l==r:\r\n print(b)\r\nelse:\r\n for i in range(1,n):\r\n mi=min(l[0:i])\r\n j=l.index(mi)\r\n ma=max(l[j:i+1])\r\n p.append((ma(b//mi))+(b%mi))\r\n print(max(p))", "n, b = map(int, input().split())\r\na, m, v = list(map(int, input().split())), 0, b\r\nfor i in range(n - 2, -1, -1):\r\n m = max(m, a[i + 1])\r\n v = max(v, b % a[i] + b // a[i] * m)\r\nprint(v)" ]	{"inputs": ["2 4\n3 7", "4 10\n4 3 2 1", "4 10\n4 2 3 1", "2 755\n51 160", "3 385\n978 1604 1888", "4 1663\n1904 1049 1622 472", "5 1293\n1183 142 1356 889 134", "1 1472\n784", "1 478\n1955", "1 1483\n1126", "10 595\n881 832 1159 171 230 750 361 1800 516 567", "93 867\n97 1270 616 1027 1685 27 1662 947 1480 20 1394 1528 191 1348 67 1694 1772 1706 1394 109 1391 878 1474 307 101 663 1064 116 143 1239 386 651 1534 1348 1604 636 793 1188 1293 24 1729 1204 1656 1579 1644 661 1470 341 1709 1860 1081 1539 5 1892 1732 1049 419 25 1086 1263 967 1284 1229 1013 1348 1046 927 1492 1459 1523 459 1907 68 853 822 994 912 266 850 1991 714 1803 513 835 947 313 1287 1183 285 182 1053 1192 615", "23 1966\n625 1474 1628 1770 1365 922 120 844 826 1145 878 1479 1489 10 1081 1182 1862 303 101 100 14 1319 326", "43 1427\n651 1624 295 6 1615 1683 741 183 734 1056 1487 633 1368 1267 1782 1091 541 1277 1263 1703 785 223 184 1837 1724 1581 1400 1483 445 1490 580 643 1998 41 1581 873 1906 846 1607 1503 1131 1858 1861", "39 897\n18 38 122 130 337 471 492 518 541 557 568 637 688 861 927 989 1018 1046 1158 1292 1309 1316 1347 1380 1430 1530 1589 1637 1651 1696 1798 1821 1829 1830 1838 1883 1896 1912 1917"], "outputs": ["8", "10", "15", "2281", "385", "2236", "12219", "1472", "478", "1483", "5482", "344445", "364958", "473531", "93948"]}	UNKNOWN	PYTHON3	CODEFORCES	35
d08494093811abd7a4cbf604871ae8f9	Network Configuration	The R1 company wants to hold a web search championship. There were n computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly affects the result. The higher the speed of the Internet is, the faster the participant will find the necessary information. Therefore, before the competition started, each computer had its maximum possible data transfer speed measured. On the i-th computer it was ai kilobits per second. There will be k participants competing in the championship, each should get a separate computer. The organizing company does not want any of the participants to have an advantage over the others, so they want to provide the same data transfer speed to each participant's computer. Also, the organizers want to create the most comfortable conditions for the participants, so the data transfer speed on the participants' computers should be as large as possible. The network settings of the R1 company has a special option that lets you to cut the initial maximum data transfer speed of any computer to any lower speed. How should the R1 company configure the network using the described option so that at least k of n computers had the same data transfer speed and the data transfer speed on these computers was as large as possible? The first line contains two space-separated integers n and k (1<=≤<=k<=≤<=n<=≤<=100) — the number of computers and the number of participants, respectively. In the second line you have a space-separated sequence consisting of n integers: a1,<=a2,<=...,<=an (16<=≤<=ai<=≤<=32768); number ai denotes the maximum data transfer speed on the i-th computer. Print a single integer — the maximum Internet speed value. It is guaranteed that the answer to the problem is always an integer. Sample Input 3 2 40 20 30 6 4 100 20 40 20 50 50 Sample Output 30 40	[ "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na.sort(reverse=True)\r\nprint(min(a[:k]))", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nprint(l[b-1])\r\n\r\n", "[n, k], speed = map(int, input().split()), sorted(map(int, input().split()), reverse = True)\r\nprint(speed[k - 1])\r\n", "# LUOGU_RID: 113633863\ndef r():return list(map(int,input().split()))\na,b=r();a=r();a.sort();print(a[-b])", "import sys\r\nn,k = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\n\r\nprint(arr[n-k])", "n, k = [int (x) for x in input().split()]\r\n\r\na = [int (x) for x in input().split()]\r\n\r\na.sort(reverse=True)\r\n\r\nprint(a[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\n\r\nprint(l[-1k])\r\n", "n, k = map(int, input().split())\r\nprint(list(reversed(list(sorted(list(map(int, input().split()))))))[k - 1])\r\n", "import sys,math\r\nfrom collections import defaultdict,Counter\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\r\nn,k = li()\r\na = li()\r\na.sort(reverse=True)\r\nprint(a[k-1])", "if __name__ == '__main__':\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n a.sort()\n\n print(a[n - k])\n\t \t\t \t \t \t \t \t \t\t \t\t", "n,k=list(map(int,input().split(\" \")))\r\nprint(min(sorted(list(map(int,input().split(\" \"))),reverse=True)[:k]))", "def convert(arr):\r\n arr = arr.split(\" \")\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n return arr\r\n\r\n\r\nap = input()\r\ns = input()\r\nnums = convert(ap)\r\nnetSpeed = convert(s)\r\nnetSpeed.sort(reverse=True)\r\nprint(netSpeed[nums[1] - 1])\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns = list(sorted(s))\r\nprint(min(s[n - k:]))", "n , k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr = list(reversed(sorted(arr)))\r\n\r\nres = []\r\n\r\nfor i in range(k):\r\n res.append(arr[i])\r\n\r\nprint(min(res))", "# Aaditya Upadhyay\r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\….\\\r\n# ………/….//……………....\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./\|_…\|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./\r\nfrom sys import stdin, stdout\r\nfrom collections import \r\nfrom math import gcd, floor, ceil\r\ndef st(): return list(stdin.readline().strip())\r\n\r\n\r\ndef li(): return list(map(int, stdin.readline().split()))\r\ndef mp(): return map(int, stdin.readline().split())\r\ndef inp(): return int(stdin.readline())\r\ndef pr(n): return stdout.write(str(n)+\"\\n\")\r\n\r\n\r\nmod = 1000000007\r\nINF = float('inf')\r\n\r\n\r\ndef solve():\r\n n, k = mp()\r\n l = li()\r\n l.sort()\r\n print(l[-k])\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "_, k = [int(x) for x in input().split()]\r\nprint(sorted([int(x) for x in input().split()], reverse=True)[k - 1])\r\n", "def main():\n computers, participants = [int(i) for i in input().split()]\n speeds = [int(i) for i in input().split()]\n\n speeds.sort()\n\n print(speeds[-participants])\n\nmain()\n\t\t \t \t \t\t\t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\r\nprint(sorted(map(int, input().split()))[n - k])", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\na.reverse()\r\n\r\nprint(a[k-1])", "info = input().split()\r\ncomputernum = int(info[0])\r\ncompetitors = int(info[1])\r\ncomputers = [int(x) for x in input().split()]\r\n\r\ncomputers = sorted(computers, reverse=True)\r\n\r\nprint(computers[competitors - 1])\r\n\r\n", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\nc.sort()\r\nc.reverse()\r\nprint(c[b-1])\r\n", "from os import remove\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nprint(a[k-1])", "def main():\n\tn, k = map(int, input().split())\n\tA = list(map(int, input().split()))\n\tA.sort(reverse = True)\n\tprint(A[k - 1])\nmain()", "n, k = map(int, input().split(' '))\nspeeds = list(map(int, input().split(' ')))\nspeeds.sort(reverse= True)\nresult = speeds[k-1]\nprint(result)\n \t \t \t \t \t\t \t \t \t \t\t \t", "n, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nline = [0] * n\r\nmaxx = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if data[i] <= data[j]:\r\n count += 1\r\n line[i] = count\r\n if count >= k:\r\n maxx = max(maxx, data[i])\r\nprint(maxx)\r\n", "if __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n b=[]\r\n for i in range(k):\r\n b.append(a.pop(a.index(max(a))))\r\n # print(b)\r\n print(min(b))\r\n ", "n, k = map(int, input().split())\nv = sorted(map(int, input().split()))\nprint(v[n - k])\n", "#https://codeforces.com/problemset/problem/412/B\nn,k=map(int,input().split(' '))\narr=[int(x) for x in input().split(' ')]\narr.sort()\narr.reverse()\nprint(arr[k-1])\n", "#q16 Network Configuration\r\nn,k=[int(x) for x in input().split()]\r\nlist1=[int(x) for x in input().split()]\r\nlist1.sort(reverse=True)\r\nprint(list1[k-1])", "n,k=map(int,input().split())\r\nl=sorted(list(map(int,input().split())),reverse=True)\r\nprint(l[k-1])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[(-1)m])", "n, k = list(map(int, input().split()))\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[n-k])", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nprint(min(l[:k]))", "n, k = map(int,input().split())\nd = list(map(int,input().split()))\nd.sort()\nprint(d[-k])\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmini=0\r\nb=[]\r\nfor i in range(n-1,n-k-1,-1):\r\n b.append(a[i])\r\nb.sort()\r\nprint(b[0])\r\n", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n \r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\") \r\n\r\nn,k = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nar.reverse()\r\nprint(ar[k-1])", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nprint(l[k-1])", "from heapq import nlargest\nI = lambda: map(int,input().split())\nn, k = I();print(nlargest(k,list(I()))[k-1])\nprint(exit())\n", "n,k = list(map(int,input().split()))\r\nprint(sorted(list(map(int,input().split())))[-k])", "line = input()\n\ncmp_count, parti = line.split()\ncmp_count, parti = int(cmp_count), int(parti)\n\nline = input()\n\na = [int(i) for i in line.split()]\n\na.sort()\n\nprint(a[cmp_count - parti])\n", "n , k = map(int, input().split())\r\nval = list(map(int, input().split()))\r\nval.sort(reverse=True)\r\nprint(val[k-1])", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(a[n - k])\r\n\r\n'''\r\n So I drown it out \r\n* Like I always do\r\n* Dancing through our house\r\n* With the ghost of you\r\n'''\r\n", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nspeed=[int(x) for x in input().split()] \r\nspeed.sort(reverse=True)\r\nprint(speed[k-1])", "cnt = lambda s, i: s.count(i)\r\nii = lambda: int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn,k=f()\r\nl=il()\r\nl.sort(reverse=True)\r\nprint(l[k-1])", "a, b = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nd.sort()\r\nprint(d[-b])\r\n", "n, k = list(map(int, input().split()))\r\nlst = sorted(list(map(int, input().split())))\r\nprint(lst[-k])\r\n", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nM=list(map(int,input().split()))\r\nM.sort()\r\nprint(M[-k])", "a,b = map(int,input().split())\r\nNS = int,input().split()\r\nNS = NS[1]\r\nfor i in range(len(NS)): NS[i] = int(NS[i])\r\nNS.sort()\r\nNS = NS[::-1]\r\nprint(NS[b-1])\r\n ", "x=input()\r\nx=x.split()\r\nn=int(x[0])\r\nk=int(x[1])\r\nl=input()\r\nl=l.split()\r\ns=[]\r\nfor i in range(n):\r\n\ts.append(int(l[i]))\r\ns.sort()\r\nprint(s[n-k])", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rstrs(splitchar=' '):\n return [i for i in input().split(splitchar)]\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in rstrs(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(args, override=False):\n if '-v' in argv or override:\n print(args)\n\nif __name__ == '__main__':\n c, p = rints()\n comps = sorted(rints(), key=lambda k: -1k)\n print(comps[p-1])\n", "n, k = [int(i) for i in input().split()]\r\n\r\nprint(sorted(int(i) for i in input().split())[-k])\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[n-k])", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nprint(sorted(a)[-k])", "n,k=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())),reverse=True)\r\nprint(a[k-1])\r\n", "a , b = map(int , input().split())\r\n\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\narr.sort(reverse= True)\r\nprint(min(arr[:b]))", "X = list(map(int, input().split()))\r\nprint(sorted(list(map(int, input().split())), reverse=True)[X[1] - 1])\r\n\r\n# UB_CodeForces\r\n# Advice: Believe that you are invaluable\r\n# Location: Behind my desk\r\n# Caption: My best buddy is really talkative\r\n", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\na = a[::-1]\r\nprint(a[k-1])", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\nprint(a[k-1])", "# LUOGU_RID: 101567888\nn, k, a = map(int, open(0).read().split())\r\nprint(sorted(a)[n - k])", "n, k = map(int, input().split())\r\na = list(map(int , input().split()))[:n]\r\na.sort(reverse=True)\r\nprint(min(a[:k]))", "n, k = list(map(int, input().split()))\nv = list(map(int, input().split()))\nv.sort()\nprint(min(v[n-k:n]))\n\t\t\t\t \t \t \t\t\t \t \t\t \t\t\t\t", "a,b = map(int,input().split())\nc = list(map(int,input().split()))\nc.sort()\nif (a - b) != 0:\n\tfor x in range(a - b):\n\t\tc.pop(0)\nprint(c[0])", "I = lambda: map(int, input().split())\r\n\r\n_, k = I()\r\n\r\nprint(sorted(I())[-k])", "x,y=map(int,input().split())\r\nn,=sorted(map(int,input().split()))\r\na=x-y\r\nprint(n[a])", "arr = list(map(int, input().split()))\r\nn, k = arr[0], arr[1]\r\n\r\na = sorted(list(map(int, input().split())), reverse=True)\r\nprint (a[k-1])", "c, s = input().split()\r\ninp = input().split()\r\nspeeds = [int(x) for x in inp]\r\nspeeds.sort()\r\nprint(speeds[int(c)-int(s)])", "def network_config():\n c, p = list(map(int,input().split()))\n speed_computers = list(map(int,input().split()))\n speed_computers.sort(reverse=True)\n print(speed_computers[p-1])\n\nnetwork_config()\n\n \t\t \t\t \t\t\t \t \t \t\t\t\t\t \t\t\t \t", "n, k = map(int, input().split())\r\nS = list(map(int, input().split()))\r\nS.sort(reverse = True)\r\nprint(S[k - 1])", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ni = 0\r\na = list(input().split())\r\no = []\r\nfor s in a:\r\n s = int(s)\r\n o.append(s)\r\no.sort()\r\no.reverse()\r\nprint(o[k-1])", "# LUOGU_RID: 105536994\nn,k=map(int,input().split())\r\nnum=sorted(list(map(int,input().split())),reverse=True)\r\nprint(num[k-1])", "n, m = [int(j) for j in input().split()]\r\nspeed = sorted([int(j) for j in input().split()])\r\nprint(speed[n - m])\r\n", "n , k = map(int, input().split())\r\ncomp = list(map(int, input().split()))\r\ncomp.sort(reverse= True)\r\nprint(comp[k-1])", "q = str(input()).split()\r\nn = int(q[0])\r\nk = int(q[1])\r\narr = [int(a) for a in input().split()]\r\nmas = []\r\narr.sort(reverse=True)\r\nfor i in range(k):\r\n mas.append(arr[i])\r\n\r\nprint(mas[-1])", "#network configuration question codeforces\r\nn,k=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nspeed=list(map(int,input().split(' ')))[:n]\r\nspeed.sort(reverse=True)\r\nspeed1=speed[:k]\r\nprint(min(speed1))", "n, k = map(int, input().split())\r\nA = sorted(list(map(int, input().split())))\r\nprint(A[n - k])", "# LUOGU_RID: 113482033\na=input().split()\r\nn=int(a[0])\r\nk=int(a[1])\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\na.sort(reverse=True)\r\nprint(a[k-1])", "k=int(input().split()[1])\r\na=sorted(map(int,input().split()))\r\nprint(a[-k])", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[n - k])", "k = int(input().split()[1])\r\ns = list(map(int,input().split()))\r\ns.sort(reverse = True)\r\nprint(s[k - 1])", "n, k = map(int, input().split())\nx = sorted(list(map(int, input().split())))\nprint(x[-k])\n", "n,k=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort(reverse=True)\r\nprint(list[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nprint(min(l[:k]))", "n,k=map(int,input().split())\r\nar=sorted(list(map(int,input().split())),reverse=True)\r\nprint(ar[k-1]) \r\n", "l1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\nl2 = [int(x) for x in input().split()]\r\nl2.sort(reverse=True)\r\nprint(l2[k-1])\r\n\r\n", "n,k=map(int,input().split())\r\nls = sorted(list(map(int, input().split())))\r\nprint(ls[n-k])", "#Merge Sort - Presente no meu repositório de algoritmos.\n#Fonte do código: https://www.geeksforgeeks.org/merge-sort/\n#Repositório: https://docs.google.com/document/d/1uCF0m6H3Nr0X_OL4OR-u5eHvSjF1cQFUN_wPYaOEw-c/edit?usp=sharing\ndef mergeSort(arr):\n if len(arr) > 1:\n \n # Finding the mid of the array\n mid = len(arr)//2\n \n # Dividing the array elements\n L = arr[:mid]\n \n # into 2 halves\n R = arr[mid:]\n \n # Sorting the first half\n mergeSort(L)\n \n # Sorting the second half\n mergeSort(R)\n \n i = j = k = 0\n \n # Copy data to temp arrays L[] and R[]\n while i < len(L) and j < len(R):\n if L[i] < R[j]:\n arr[k] = L[i]\n i += 1\n else:\n arr[k] = R[j]\n j += 1\n k += 1\n \n # Checking if any element was left\n while i < len(L):\n arr[k] = L[i]\n i += 1\n k += 1\n \n while j < len(R):\n arr[k] = R[j]\n j += 1\n k += 1\n \ndef main():\n entrada = input().split();\n computadores = int(entrada[0]);\n participantes = int(entrada[1]);\n entrada = input().split();\n velocidade = [0]computadores;#velocidade[i] -> velocidade máxima do i-ésimo computador\n for i in range(computadores):\n velocidade[i] = int(entrada[i]);\n #n = numero de participantes\n #Se limitarmos a velocidade dos n computadores mais rápidos a velocidade mais lenta entre eles então teremos computadores em igual velocidade suficientes para a competição.\n mergeSort(velocidade);\n print(velocidade[computadores - participantes]);\nmain();\n \t\t \t\t \t \t\t\t\t \t \t\t\t\t \t", "n,k = map(int, input().split())\nvalores = list(map(int, input().split()))\nvalores.sort(reverse=True)\nprint(valores[k-1])\n\n \n \n \n \n \n \t\t \t\t\t\t \t \t \t \t \t \t \t\t", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narray.sort(reverse=True)\r\nprint(array[k - 1])\r\n", "n,k=map(int,input('').split()) \r\na=list(map(int,input('').split()))\r\na=list(reversed(sorted(a)))\r\nprint(a[k-1])\r\n\r\n \r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:03:02\nLastEditTime: 2021-11-04 23:06:43\nDescription: \nFilePath: CF412B.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n lst = list(sorted(map(int, input().strip().split())))\n return lst[-k]\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "n, k = list(map(int, input().split()))\ns = list(map(int, input().split()))\ns.sort(reverse=True)\nprint(s[k - 1])", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nprint(a[k-1])", "\r\nn, k = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nl.sort(reverse = True)\r\n\r\nprint(l[k - 1])", "import sys\r\nline = str.split(input(),\" \")\r\nn = int(line[0])# num comp\r\nk = int(line[1])# num par\r\n\r\nline = str.split(str(input()),\" \")\r\nspeeds = []\r\nfor s in line:\r\n speeds.append(int(s))\r\n\r\nsspeeds = speeds\r\nsspeeds.sort()\r\nsspeeds.reverse()\r\n\r\nsys.stdout.write(str(sspeeds[k-1]))\r\n", "n, k = map(int, input().split())\r\nS = sorted(list(map(int, input().split())))\r\nmaxim = S[-1 * k]\r\nprint(maxim)", "n, k = map(int, input().split())\nx = list(map(int, input().split()))\nx.sort(reverse=True)\nprint(x[k - 1])\n", "n, k = map(int, input().split())\r\narr = sorted(map(int, input().split()), reverse=True)\r\nprint(arr[k - 1])\r\n", "n , k = map(int,input().split())\r\nnetwork_speeds_sorted = [int(x) for x in input().split()]\r\n#print(network_speeds_sorted)\r\nnetwork_speeds_sorted.sort(reverse=True)\r\n#print(network_speeds_sorted)\r\nprint(network_speeds_sorted[k-1])", "n,k=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nL.sort(reverse=True)\r\n\r\nprint(L[k-1])\r\n", "n, m = [int(d) for d in input().split(\" \")]\r\na = sorted([int(c) for c in input().split(\" \")], reverse = True)\r\n\r\nfor i in range(len(a)):\r\n\tif i+1 == m:\r\n\t\tprint(a[i])\r\n\t\tbreak\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Aug 30 23:16:26 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\n\r\nimport sys\r\nsysinput = sys.stdin.readline\r\nsysinput = input\r\n############ ---- Input Functions ---- ############\r\ndef readint():\r\n return(int(sysinput()))\r\ndef readchlist():\r\n s = sysinput()\r\n lst = list(s[:])\r\n try:\r\n lst.remove('\\n')\r\n finally:\r\n return(lst)\r\ndef readintlist():\r\n return(list(map(int,sysinput().split())))\r\n\r\nn, k = readintlist()\r\na = readintlist()\r\na = sorted(a)\r\nmaxspeed = a[-k]\r\nprint(maxspeed)\r\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))[::-1]\r\nprint(a[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse = True)\r\nprint(l[k-1]) ", "n, k = (int(i) for i in input().split())\na = sorted(int(i) for i in input().split())\nres = a[n - k]\nprint(res)\n", "if __name__ == \"__main__\":\r\n n,k = list(map(int, input().split()))\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n arr = arr[::-1]\r\n for i in range(n):\r\n if i+1 == k:\r\n print(arr[i])\r\n break", "k,n = list(map(int,input().split(\" \")))\r\na = list(map(int,input().split(\" \")))\r\n\r\na.sort(reverse = True)\r\n\r\nprint(a[n-1])", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import \r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nprint(min(arr[:m]))\r\n", "n, k = map(int,input().split())\r\nprint(sorted(map(int,input().split()))[n-k])\r\n", "def main():\r\n\r\n\r\n\tn,k=map(int,input().split(\" \"))\r\n\tip=[int(item) for item in input().split(\" \")]\r\n\tip.sort()\r\n\tprint(ip[len(ip)-k])\r\n\r\n\t\r\n\r\nif __name__==\"__main__\":\r\n\tmain()", "n, k = map(int, input().split())\r\nnumbers = sorted(list(map(int, input().split())), reverse = True)\r\nprint(numbers[k - 1])\r\n", "n, k = map(int, input().split())\r\nw = sorted(map(int, input().split()), reverse=True)\r\nprint(w[k-1])\r\n", "n, k = map(int, input().split())\r\nprint(sorted(list(map(int, input().split())))[n-k])\r\n", "n,k=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\nlis.reverse()\r\nprint(lis[k-1])\r\n", "\n\nif __name__==\"__main__\":\n\n data = input().split()\n\n lista = []\n for it in input().split():\n lista.append(int(it))\n\n lista.sort( reverse = True)\n\n\n print( lista[ int( data[1] ) - 1] )\n\n\n\n \t\t\t\t \t \t \t\t\t\t \t \t\t \t \t \t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nprint(arr[k-1])", "n,k=map(int,input().split())\r\na=[int(s) for s in input().split()]\r\na=sorted(a)\r\nprint(a[n-k])", "# -- coding: utf-8 -*-\r\n\"\"\"\r\nyl1\r\n@author: User\r\n\"\"\"\r\na=lambda:list(map(int,input().strip().split()))\r\nn,k=a()\r\ns=a()\r\ns.sort()\r\nprint(s[-k])", "n,k=[int(x) for x in input().split()]\r\nl=sorted([int(x) for x in input().split()])\r\nprint(l[n-k])", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nprint(sorted(I())[n-k])", "b=input().split()\r\nn=int(b[0])\r\nk=int(b[1])\r\na=input().split()\r\nai=[]\r\nfor i in range(n):\r\n ai.append(int(a[i]))\r\nai.sort()\r\nprint(ai[n-k])\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nprint(a[n-k])\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nprint(sorted(arr, key = lambda x:-x)[k-1])", "def func():\n\tn,m = map(int, input().split())\n\ta = list(map(int, input().split()))\n\ta.sort()\n\tprint(a[n-m])\n\n\n\ndef main():\n\tprint('ok or exit: ')\n\twhile input() != 'exit':\n\t\tprint('execute.')\n\t\tfunc()\n\t\tprint('ok or exit: ')\n\n#main()\nfunc()", "n, k = list(map(int, input().split()))\nspeed = list(map(int, input().split()))\nfor i in range(n-k):\n m = min(speed)\n speed.remove(m)\nprint(min(speed))", "R=lambda:list(map(int,input().split()))\r\nn,m=R(); l=sorted(R()); print(l[n-m])", "n,k=list(map(int,input().split()))\r\n\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\ns=t[::-1]\r\n\r\n\r\nprint(s[k-1])\r\n", "def main():\n [n, k] = [int(_) for _ in input().split()]\n speeds = [int(_) for _ in input().split()]\n speeds.sort(reverse=True)\n\n print(speeds[k - 1])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\n\r\nprint(arr[n-k])", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sorted(a, reverse=True)[k - 1])", "def solve(a: int, b: int, d: list) -> int:\r\n d.sort()\r\n return(d[-b])\r\n \r\na, b = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(solve(a,b,d))\r\n ", "# Here I just need to find the i-th greater value from the sequence\ncomputers, participants = map(int, input().split())\ncomputersSpeed = list(map(int, input().split()))\ncomputersSpeed.sort(reverse=True)\nprint(computersSpeed[participants-1])\n \t\t \t\t\t\t \t\t \t \t \t\t\t\t\t\t \t\t", "n, k = map(int, input().split());\r\narray = list(map(int, input(). split()));\r\narray.sort(reverse = True);\r\nprint(array[k - 1]);", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nprint(A[-k])", "import sys\r\nii = lambda: sys.stdin.readline().strip()\r\nidata = lambda: [int(x) for x in ii().split()]\r\n\r\ndef solve():\r\n n, k = idata()\r\n data = sorted(idata())\r\n print(data[-k])\r\n return\r\n\r\nfor t in range(1):\r\n solve()", "C, N = map(int, input().split())\r\n\r\nPCs = list(map(int,input().split()))\r\nPCs.sort(reverse=True)\r\nprint(PCs[N-1])", "n, k = map(int, input().split())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ndaf.sort(reverse = True)\r\n\r\ndaf = daf[:k]\r\n\r\nprint(daf[-1])\r\n", "def main():\n n, k = map(int, input().split())\n speeds = sorted([int(num) for num in input().split()], reverse= True)\n print(speeds[k-1])\n\nmain()\n \t \t \t \t \t\t \t \t \t\t\t \t\t \t\t \t", "n,k = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\nv.sort()\r\nv.reverse()\r\nprint(v[k-1])", "n, k = (i for i in list(map(int, input().split(' '))))\na = list(map(int, input().split(' ')))\na.sort()\nprint(a[-k])", "added_test=(input(\"\"))\ntest_index=input(\"\")\nl_reverse=[]\nl=list(map(int,test_index.split(' ')))\nk=list(map(int,added_test.split(' ')))\n\nl_new=sorted(l)\nl_new.reverse()\n\nindex=k[1]-1\n\nprint(l_new[index])\n\n \t \t\t \t\t\t\t\t \t \t \t\t \t\t \t \t", "n,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[-k])\r\n", "n, k = map(int, input().split())\n\nspeed = [int(i) for i in input().split()]\n\nspeed.sort()\n\nprint(speed[-k])\n\t\t\t\t\t \t\t\t\t \t \t \t \t \t \t\t \t", "n,k=map(int,input().split())\nb=sorted(map(int,input().split()))\nprint(b[-k])", "nk = list(map (int, input().split()))\r\nspeeds = list(map (int, input().split()))\r\nminimum = nk[0] - nk[1]\r\nspeeds.sort()\r\nprint(speeds[minimum])\r\n", "\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n a.sort(reverse=True)\r\n print(min(a[:k]))\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "s = input()\r\na = s.split(\" \")\r\nn = int(a[0])\r\nt = int(a[1])\r\ns = input()\r\na = s.split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\na.sort()\r\nprint(a[n-t])", "N,K= map(int, input().split())\r\nSpeeds = list(map(int,input().split()))\r\nSpeeds.sort()\r\nprint(Speeds[-K])\r\n", "def maximum_s (n,k,a):\n a = sorted(a)\n a = a[::-1]\n a = a[:k]\n return min(a)\n\nn,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nprint (maximum_s(n,k,a))\n \n", "# https://codeforces.com/problemset/problem/412/B\n# 900\n\n\nn, m = map(int, input().split())\nl = list(map(int, input().split()))\nl.sort() \n\nprint(min(l[-m:]))\n", "n,k=map(int, input().split())\r\nprint(sorted(map(int, input().split()))[-k])", "a, b = map(int, input().split())\r\n\r\nl = sorted(map(int, input().split()))\r\n\r\n#print(l)\r\n\r\nprint(l[-b])", "from collections import Counter\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = Counter(arr)\r\nsor = sorted(count.items(), key=lambda x: x[0], reverse=True)\r\n\r\nfor i, j in sor:\r\n k -= j\r\n if k < 1:\r\n print(i)\r\n break\r\n\r\n\r\n\r\n", "# LUOGU_RID: 112613122\na,k=map(int,input().split())\ns=list(map(int,input().split()))\ns.sort(reverse=True)\nprint(s[k-1])", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\n\r\nspeeds = list(map(int, input().split()))\r\n\r\nspeeds.sort(reverse=True)\r\nprint(speeds[k-1])\r\n", "n, k = list(map(int, input().split()))\r\n\r\ns = list(map(int, input().split()))\r\n\r\ns.sort()\r\n\r\nprint(s[- k])", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=(n-k)\r\nprint(a[x])\r\n", "# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n# code\r\n\r\ndef main():\r\n n,k = map(int, input().split())\r\n a = sorted(list(map(int,input().split())))[::-1]\r\n print(a[k-1])\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nn, k = map(int, input().split())\r\na = list(reversed(sorted(map(int, input().split()))))\r\nprint(a[k - 1])\r\n\r\n# ♥\r\n", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\na = sorted([int(i) for i in input().split()])\r\nprint(a[n-k])\r\n\r\n", "(n, k) = map(int, input().split())\nspeeds = list(map(int, input().split()))\n\nspeeds.sort()\ntopSpeeds = speeds[n-k: n]\n\nprint(min(topSpeeds))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=a[n-k:]\r\nprint(min(b))", "[n, k] = [int(i) for i in input().split()]\r\n\r\na = sorted([int(i) for i in input().split()])[::-1]\r\n\r\nprint(a[k-1])", "n , k = map(int , input().split())\r\nl = sorted(list(map(int , input().split())) , reverse = True)\r\nprint(l[k - 1])\r\n ", "a,b = map(int,input().split())\r\nf= list(map(int,input().split()))\r\nc = []\r\nwhile b != 0:\r\n c.append(max(f))\r\n del f[f.index(max(f))]\r\n b-=1\r\nprint(min(c))", "n, k = map(int, input().split())\r\ns = sorted(list(map(int, input().split())), reverse = True)\r\nprint(s[k - 1])", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort()\r\n\r\nprint(A[n - k])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nans = sorted(data, reverse=True)[:k][-1]\r\nprint(ans)", "n,k = tuple(input().split())\r\nlis = input().split()\r\nlis = [int(i) for i in lis]\r\nlis.sort()\r\nprint(lis[-int(k)])\r\n", "def comp_comp(n, k, arr):\n return merge_sort(arr)[k-1]\n\ndef merge_sort(arr):\n if len(arr) <= 1:\n return arr\n midpoint = len(arr)//2\n left = merge_sort(arr[:midpoint])\n right = merge_sort(arr[midpoint:])\n return final_merge(left, right)\n\ndef final_merge(left, right):\n li=0\n ri=0\n fa=[]\n while li<len(left) and ri<len(right):\n if left[li] > right[ri]:\n fa.append(left[li])\n li+=1\n else:\n fa.append(right[ri])\n ri+=1\n while li<len(left):\n fa.append(left[li])\n li+=1\n while ri<len(right):\n fa.append(right[ri])\n ri+=1\n return fa\n\nn,k = map(int, input().split())\narr = list(map(int, input().split()))\n\nprint(comp_comp(n,k,arr))", "n, k = map(int, input().split())\na = sorted(list(map(int, input().split())), reverse=True)\n\nprint(a[k-1])\n\n\t \t\t\t \t\t\t\t \t\t \t\t\t\t\t\t \t\t \t \t\t", "n,k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nprint(ai[n-k])\r\n", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n a.sort(reverse=True)\r\n\r\n print(a[k-1])\r\n\r\nmain()", "k, n = input().split()\nk = int(k)\nn = int(n)\na = input().split()\na = [int(item) for item in a]\na.sort()\na.reverse()\na = a[0:n]\nprint(min(a))\n", "n, k = input().split()\r\ns = input().split()\r\ns = list(map(int, s))\r\n\r\ns.sort(reverse = True)\r\nprint(s[int(k)-1])", "import heapq as hq\n\nn, k = tuple([int(x) for x in input().split(\" \")])\nmax_speeds = [int(x) for x in input().split(\" \")]\n\nk_largest = hq.nlargest(k, max_speeds)\nprint(k_largest[-1])\n \t\t \t \t \t \t\t \t\t\t \t\t \t\t", "n,m = input().split()\r\nn,m = int(n),int(m)\r\nl = [int(a) for a in input().split(\" \",n-1)]\r\nl.sort(reverse=True)\r\nprint(l[m-1])\r\n \r\n \r\n ", "R = lambda:map(int, input().split())\n\nn, k = R()\n\nprint(sorted(R())[-k])\n\n\n\n# Made By Mostafa_Khaled", "# https://codeforces.com/problemset/problem/412/B\r\n\r\n\r\ndef handle_input():\r\n n,k = tuple(map(int , input().split()))\r\n speed = list(map(int , input().split()))\r\n return n,k,speed\r\n\r\n\r\nn,k,speed = handle_input()\r\n\r\nspeed.sort(reverse=True)\r\nprint(speed[k-1])", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nprint(a[n- 1 - k + 1])" ]	{"inputs": ["3 2\n40 20 30", "6 4\n100 20 40 20 50 50", "1 1\n16", "2 1\n10000 17", "2 2\n200 300", "3 1\n21 25 16", "3 2\n23 20 26", "3 3\n19 29 28", "100 2\n82 37 88 28 98 30 38 76 90 68 79 29 67 93 19 71 122 103 110 79 20 75 68 101 16 120 114 68 73 71 103 114 99 70 73 18 36 31 32 87 32 79 44 72 58 25 44 72 106 38 47 17 83 41 75 23 49 30 73 67 117 52 22 117 109 89 66 88 75 62 17 35 83 69 63 60 23 120 93 18 112 93 39 72 116 109 106 72 27 123 117 119 87 72 33 73 70 110 43 43", "30 13\n36 82 93 91 48 62 59 96 72 40 45 68 97 70 26 22 35 98 92 83 72 49 70 39 53 94 97 65 37 28", "50 49\n20 77 31 40 18 87 44 64 70 48 29 59 98 33 95 17 69 84 81 17 24 66 37 54 97 55 77 79 42 21 23 42 36 55 81 83 94 45 25 84 20 97 37 95 46 92 73 39 90 71", "40 40\n110 674 669 146 882 590 650 844 427 187 380 711 122 94 38 216 414 874 380 31 895 390 414 557 913 68 665 964 895 708 594 17 24 621 780 509 837 550 630 568", "40 1\n851 110 1523 1572 945 4966 4560 756 2373 4760 144 2579 4022 220 1924 1042 160 2792 2425 4483 2154 4120 319 4617 4686 2502 4797 4941 4590 4478 4705 4355 695 684 1560 684 2780 1090 4995 3113", "70 12\n6321 2502 557 2734 16524 10133 13931 5045 3897 18993 5745 8687 12344 1724 12071 2345 3852 9312 14432 8615 7461 2439 4751 19872 12266 12997 8276 8155 9502 3047 7226 12754 9447 17349 1888 14564 18257 18099 8924 14199 738 13693 10917 15554 15773 17859 13391 13176 10567 19658 16494 3968 13977 14694 10537 4044 16402 9714 4425 13599 19660 2426 19687 2455 2382 3413 5754 113 7542 8353", "80 60\n6159 26457 23753 27073 9877 4492 11957 10989 27151 6552 1646 7773 23924 27554 10517 8788 31160 455 12625 22009 22133 15657 14968 31871 15344 16550 27414 876 31213 10895 21508 17516 12747 59 11786 10497 30143 25548 22003 2809 11694 30395 8122 31248 23075 19013 31614 9133 27942 27346 15969 19415 10367 8424 29355 18903 3396 6327 4201 24124 24266 22586 724 1595 3972 17526 2843 20982 23655 12714 18050 15225 2658 7236 27555 13023 729 9022 17386 2585", "100 1\n199 348 489 76 638 579 982 125 28 401 228 117 195 337 80 914 752 98 679 417 47 225 357 413 849 622 477 620 487 223 321 240 439 393 733 660 652 500 877 40 788 246 376 723 952 601 912 316 598 809 476 932 384 147 982 271 202 695 129 303 304 712 49 306 598 141 833 730 946 708 724 788 202 465 951 118 279 706 214 655 152 976 998 231 487 311 342 317 243 554 977 232 365 643 336 501 761 400 600 528", "80 50\n15160 6853 20254 11358 19535 27691 2983 31650 9219 11833 32053 31695 21511 4320 4384 24843 1454 31543 18796 13815 1546 27926 16276 14315 12542 25370 24890 29647 3584 17867 12446 15072 19852 30207 16361 7964 5343 398 10837 31114 9252 12767 15098 22562 32637 31823 8160 12658 6422 19142 12448 6765 7373 868 31712 24856 23251 29200 8159 16144 27165 4308 13652 12502 4183 7961 3032 26855 8687 12263 24319 7722 19460 30700 29806 1280 21141 25965 25550 26881", "50 16\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 1\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 2\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 100\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 99\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16"], "outputs": ["30", "40", "16", "10000", "200", "25", "23", "19", "122", "70", "17", "17", "4995", "16402", "8122", "998", "12448", "16", "16", "16", "16", "16"]}	UNKNOWN	PYTHON3	CODEFORCES	179
d09e0f1b9d617f27cfe3d68024706ed8	Single-use Stones	A lot of frogs want to cross a river. A river is $w$ units width, but frogs can only jump $l$ units long, where $l < w$. Frogs can also jump on lengths shorter than $l$. but can't jump longer. Hopefully, there are some stones in the river to help them. The stones are located at integer distances from the banks. There are $a_i$ stones at the distance of $i$ units from the bank the frogs are currently at. Each stone can only be used once by one frog, after that it drowns in the water. What is the maximum number of frogs that can cross the river, given that then can only jump on the stones? The first line contains two integers $w$ and $l$ ($1 \le l < w \le 10^5$) — the width of the river and the maximum length of a frog's jump. The second line contains $w - 1$ integers $a_1, a_2, \ldots, a_{w-1}$ ($0 \le a_i \le 10^4$), where $a_i$ is the number of stones at the distance $i$ from the bank the frogs are currently at. Print a single integer — the maximum number of frogs that can cross the river. Sample Input 10 5 0 0 1 0 2 0 0 1 0 10 3 1 1 1 1 2 1 1 1 1 Sample Output 3 3	[ "def ok(cnt):\r\n for i in range(l, w):\r\n if pref[i] - pref[i - l] < cnt:\r\n return False\r\n return True\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\npref = [0] * w\r\nfor i in range(1, w):\r\n pref[i] = pref[i - 1] + a[i - 1]\r\nli, ri = 1, pref[-1]\r\nans = 0\r\nwhile li <= ri:\r\n m = (li + ri) // 2\r\n if ok(m):\r\n ans = m\r\n li = m + 1\r\n else:\r\n ri = m - 1\r\nprint(ans)# 1690885996.9007297", "w, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\nx = y = sum(a[:l])\r\n\r\nfor i in range(w-l-1):\r\n y = y - a[i] + a[i+l]\r\n x = min(y,x)\r\n\r\nprint(x)\r\n", "def f(n,l):\r\n m = len(l)\r\n if n==1: return min(l)\r\n if n==m: return sum(l)\r\n ans = sum(l[:n])\r\n new = ans\r\n for i in range(1,m-n):\r\n new = new+l[i-1+n]-l[i-1]\r\n if new<ans:\r\n ans=new\r\n return ans\r\n\r\nw,n = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nprint(f(n,l))\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nw, length = map(int, input().split())\r\na = [-1] + list(map(int, input().split()))\r\nl, r = 1, length + 1\r\ns = sum(a[l:r])\r\nres = s\r\nwhile r < w:\r\n s += a[r] - a[l]\r\n l += 1\r\n r += 1\r\n res = min(res, s)\r\nprint(res)", "# D - Single-use Stones\r\n\r\nw,l = [int(i) for i in input().split(' ')]\r\na = [2E9](w+1)\r\n\r\nentrada = [int(i) for i in input().split(' ')]\r\nfor i in range (1, w):\r\n a[i] = entrada[i-1]\r\n\r\n\r\nb = [0]len(a)\r\n\r\n\r\nmv = 0\r\nfor p in range (1, w+1):\r\n if(a[p] <= 0):\r\n continue\r\n if(p <= l):\r\n b[p] = a[p]\r\n continue\r\n d = p\r\n for u in range(p - l, d):\r\n if(b[u] < (a[p] - b[p])):\r\n mv = b[u]\r\n else:\r\n mv = a[p] - b[p]\r\n b[u] = b[u] - mv\r\n b[p] = b[p] + mv\r\n if(b[p]>= a[p]):\r\n break\r\n\r\nprint(b[-1])\r\n\r\n# print (w)\r\n# print (l)\r\n# print (a)\r\n\r\n#############CPP################\r\n \r\n#include <cstdio>\r\n#include <vector>\r\n\r\n\r\n\r\n# int main(){\r\n\r\n# long w, l; scanf(\"%ld %ld\", &w, &l);\r\n# std::vector<long> a(w + 1, 2e9); \r\n# for(long p = 1; p < w; p++){scanf(\"%ld\", &a[p]);}\r\n# std::vector<long> b(w + 1, 0);\r\n\r\n# for(long p = 1; p <= w; p++){\r\n# if(a[p] <= 0){continue;}\r\n# if(p <= l){b[p] = a[p]; continue;}\r\n# for(long u = p - l; u < p; u++){\r\n# long mv = (b[u] < (a[p] - b[p])) ? b[u] : (a[p] - b[p]);\r\n# b[u] -= mv; b[p] += mv;\r\n# if(b[p] >= a[p]){break;}\r\n# }\r\n# }\r\n\r\n# printf(\"%ld\\n\", b.back());\r\n\r\n# return 0;\r\n# }", "w, l = map(int, input().split())\nj = list(map(int, input().split()))\n\nans = sum(j[0:l])\ntemp = ans\n\nfor i in range(1, w - l):\n temp += j[i + l - 1] - j[i - 1]\n ans = min(ans, temp)\n\nprint(ans)\n \n \n", "tamanho, pulo= [int(t) for t in input().split()]\npedras = [int(t) for t in input().split()]\n\n#Ver o numero maximo dde sapos que podem dar o primeiro pulo\nsaposFinal = saposTemp = sum(pedras[:pulo])\nfor i in range(tamanho - pulo - 1):\n saposTemp = saposTemp - pedras[i] + pedras[i + pulo]\n saposFinal = min(saposTemp, saposFinal)\nprint(saposFinal)\n\n\n\t \t\t\t\t \t\t \t \t\t\t\t\t \t \t\t", "def SingleUseStones():\n w, l = map(int, input().split())\n stones = list(map(int, input().split()))\n maxQty = 0\n t = 0\n \n for i in range(l):\n t += stones[i]\n maxQty = t\n for i in range(l, w - 1):\n t = t + stones[i] - stones[i - l]\n maxQty = min(maxQty, t)\n print(maxQty)\n \n \nSingleUseStones()\n\t\t \t\t\t \t\t \t \t\t \t \t\t\t\t\t", "w, l = [int(value) for value in input().split()]\na = [int(value) for value in input().split()]\ns = 0\nresposta = 0\n\nfor i in range(l):\n s += a[i]\n resposta = s\n\ni = l\nwhile True:\n if resposta > s:\n resposta = s\n \n if i == w - 1:\n break\n \n aux = s + a[i] - a[i - l]\n \n if aux > 0:\n s = aux\n else:\n s = 0\n \n i += 1\n \nprint(resposta)\n \t\t \t \t\t\t \t \t\t \t\t\t \t", "import sys\r\ninput=sys.stdin.readline\r\nw,l=map(int,input().split())\r\na=[int(i) for i in input().split() if i!='\\n']\r\nans=[sum(a[:l])]\r\nfor i in range(w-1-l):\r\n pq=ans[-1]+a[i+l]-a[i]\r\n ans.append(pq)\r\nsys.stdout.write(str(min(ans))+'\\n')\r\n \r\n", "w, l = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\n\r\no = O = sum(arr[:l])\r\n\r\nfor i in range(1, w - l):\r\n o = o - arr[i - 1]\r\n o += arr[i + l - 1]\r\n O = min(O, o)\r\nprint(O)", "I=lambda:map(int,input().split())\r\nw,l=I()\r\na=list(I())\r\nc=s=sum(a[:l])\r\nfor i in range(w-l-1):\r\n s=s-a[i]+a[i+l]\r\n c=min(c,s)\r\nprint(c) ", "w,l = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsoma = sum(a[:l])\nminimo = soma\n\nfor i in range(l, w-1):\n soma += a[i] - a[i-l]\n minimo = min(minimo, soma)\n\nprint(minimo)\n \t\t\t\t\t \t \t \t \t \t \t\t \t", "w, l = map(int, input().split())\nA = list(map(int, input().split()))\nA = [0]+A+[0]\ndp = [0](w+1)\nfor i in range(w):\n if i == 0:\n for j in reversed(range(1, l+1)):\n dp[j] += A[j]\n else:\n for j in reversed(range(i+1, min(i+l+1, w+1))):\n if j == w:\n dp[j] += dp[i]\n break\n else:\n ndpj = min(A[j], dp[j]+dp[i])\n dp[i] -= ndpj-dp[j]\n dp[j] = ndpj\n if dp[i] <= 0:\n break\nprint(dp[-1])\n", "largura_rio,tam_pulo_sapo = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsoma = sum(a[:tam_pulo_sapo])\nminimo = soma\n \nfor i in range(tam_pulo_sapo, largura_rio-1):\n soma += a[i] - a[i-tam_pulo_sapo]\n minimo = min(minimo, soma)\n \nprint(minimo)\n \t\t \t\t \t\t \t \t \t \t \t \t", "\"\"\"\nAtividade C: Single-use stones\n\"\"\"\n\ndef soluciona():\n w, l = map(int,input().split())\n arr = list(map(int,input().split()))\n \n pedras = sum(arr[:l]) # total de pedras dentro do alcance\n res = pedras\n for i in range(1, w - l):\n pedras = pedras - arr[i - 1]\n pedras += arr[i + l - 1]\n res = min(res, pedras)\n print(res)\n\nif __name__ == \"__main__\":\n soluciona()\n\t \t \t\t \t\t\t \t \t\t\t\t\t \t \t\t\t \t", "w, l = map(int, input().split())\na = list(map(int, input().split()))\nprefix = [0] (w-l)\nprefix[0] = sum(a[:l])\nfor i in range(w-1-l):\n prefix[i+1] += prefix[i] + a[i+l] - a[i]\nprint(min(prefix))\n \t \t \t\t\t \t\t \t\t \t \t\t \t\t", "\nw, l = [int(i) for i in input().split(' ')]\narr = [int(i) for i in input().split(' ')]\n\ncummulative = [0 for i in range(len(arr) + 1)]\nfor i in range(len(arr)):\n cummulative[i+1] = cummulative[i] + arr[i]\n\nmin_cut = 1000000009\n\nfor i in range(w - l):\n cut = cummulative[i + l] - cummulative[i]\n if cut < min_cut:\n min_cut = cut\n\nprint(min_cut)\n", "'''\r\nhttps://codeforces.com/problemset/problem/965/D\r\n\r\n输入 w(≤1e5) L(<w) 和一个长为 w-1 的数组 a (0≤a[i]≤1e4，下标从 1 开始)。\r\n有一条宽为 w 的河，青蛙们在位置 0 处，位置 i 处有 a[i] 个石头，位置 w 为河对岸。\r\n青蛙单次跳跃距离不超过 L。每个石头只能被一只青蛙用一次。\r\n输出最多有多少只青蛙能过河。\r\n\r\n相似题目：蓝桥杯2022年第十三届省赛真题-青蛙过河\r\nhttps://www.dotcpp.com/oj/problem2667.html\r\n\r\n输入\r\n10 5\r\n0 0 1 0 2 0 0 1 0\r\n输出 3\r\n解释 0-5-10, 0-5-10, 0-3-8-10\r\n\r\n输入\r\n10 3\r\n1 1 1 1 2 1 1 1 1\r\n输出 3\r\n解释 0-3-6-9-10, 0-2-5-8-10, 0-1-4-7-10\r\n'''\r\n\r\nfrom itertools import \r\nfrom collections import \r\nfrom math import \r\nfrom heapq import \r\nfrom functools import \r\nfrom bisect import \r\nfrom random import \r\nimport random\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\n\r\nBUFSIZE = 4096\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MI():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef PF(a):\r\n return [0] + list(accumulate(a))\r\n\r\n\r\ndef solve():\r\n n, l = MI()\r\n a = list(map(int, input().split()))\r\n pre = PF(a)\r\n res = inf\r\n for i in range(n - l):\r\n res = min(res, pre[i + l] - pre[i])\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "l,w=map(int,input().split())\r\nli=list(map(int,input().split()))\r\naa=[]\r\ntot=0\r\nfor i in range(l-1):\r\n tot+=li[i]\r\n if i>=w:\r\n tot=tot-li[i-w]\r\n if i>=(w-1):\r\n aa.append(tot)\r\nprint(min(aa))\r\n ", "def read_nums():\r\n return list(map(int, input().split()))\r\n\r\nw, l = read_nums()\r\nrocks = read_nums()\r\n\r\ncur_sum = sum(rocks[0: l])\r\nmin_sum = cur_sum\r\nfor i in range(l, len(rocks)):\r\n cur_sum -= rocks[i - l]\r\n cur_sum += rocks[i]\r\n min_sum = min(min_sum, cur_sum)\r\n\r\nprint(min_sum)\r\n", "# ========= /\\ /\| \|====/\|\r\n# \| / \\ \| \| / \|\r\n# \| /____\\ \| \| / \|\r\n# \| / \\ \| \| / \|\r\n# ========= / \\ ===== \|/====\| \r\n# code\r\n\r\ndef main():\r\n w,l = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n dist = 0\r\n mdist = float('inf')\r\n for i in range(l):\r\n dist += a[i]\r\n mdist = min(mdist , dist)\r\n for i in range(l , w - 1):\r\n dist += a[i]\r\n dist -= a[i - l]\r\n mdist = min(mdist , dist)\r\n print(mdist)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nfrom collections import \r\nfrom itertools import \r\nfrom math import \r\nfrom array import \r\nfrom functools import lru_cache\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport io, os\r\n\r\nif sys.hexversion == 50923504:\r\n sys.stdin = open('cfinput.txt')\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\n\r\nMOD = 10 * 9 + 7\r\n\"\"\"https://codeforces.com/problemset/problem/965/D\r\n\r\n输入 w(≤1e5) L(<w) 和一个长为 w-1 的数组 a (0≤a[i]≤1e4，下标从 1 开始)。\r\n有一条宽为 w 的河，青蛙们在位置 0 处，位置 i 处有 a[i] 个石头，位置 w 为河对岸。\r\n青蛙单次跳跃距离不超过 L。每个石头只能被一只青蛙用一次。\r\n输出最多有多少只青蛙能过河。\r\n输入\r\n10 5\r\n0 0 1 0 2 0 0 1 0\r\n输出 3\r\n解释 0-5-10, 0-5-10, 0-3-8-10\r\n\r\n输入\r\n10 3\r\n1 1 1 1 2 1 1 1 1\r\n输出 3\r\n解释 0-3-6-9-10, 0-2-5-8-10, 0-1-4-7-10\r\n\"\"\"\r\n\r\n\r\n# \t ms\r\ndef solve(w, L, a):\r\n l = 0\r\n s = 0\r\n ans = inf\r\n for r, v in enumerate(a):\r\n s += v\r\n while r - l + 1 > L:\r\n s -= a[l]\r\n l += 1\r\n if r - l + 1 == L:\r\n ans = min(ans, s)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n w, L = RI()\r\n a = RILST()\r\n\r\n solve(w, L, a)\r\n", "# input segment\r\nw,l = map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\n# computer minimal segemnt of length l, and a temp variable\r\nminsegment=s=sum(a[:l])\r\n\r\n# calculate every l segment min value,\r\nfor i in range(1,w-l):\r\n s=s-a[i-1]+a[i+l-1]\r\n minsegment = min(s,minsegment)\r\n\r\nprint(minsegment)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(1, n - 1): l[i] += l[i - 1]\r\nans = l[k - 1]\r\nfor i in range(k, n - 1): ans = min(ans, l[i] - l[i - k])\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = [0]\r\nfor i in a:\r\n s.append(s[-1] + i)\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor i in range(l, w):\r\n ans = min(ans, s[i] - s[i - l])\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a[:k])\r\nb=[]\r\nc=0\r\nb.append(s)\r\nfor i in range(n-k-1):\r\n s=s-a[i]+a[i+k]\r\n b.append(s)\r\nprint(min(b))", "[w, l] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\n \nwinais = [0 for _ in range(w - l)]\ns = sum(ais[:l])\nwinais[0] = s\nfor i in range(w - l - 1):\n\ts += ais[i + l] - ais[i]\n\twinais[i + 1] = s\n \nprint (min(winais))\n\t\t \t\t\t \t\t\t\t\t \t\t \t\t \t\t \t \t", "import sys\r\nwhile True:\r\n\ttry:\r\n\t\tW, L = [int(i) for i in input().split()]\r\n\t\triver = [int(i) for i in input().split()]\r\n\r\n\t\tsum_seq = sum(river[:L])\r\n\t\tfrogs = sum_seq\r\n\r\n\t\tfor i in range(L,W-1):\r\n\t\t\tsum_seq = sum_seq + river[i] - river[i-L]\r\n\t\t\tfrogs = min(sum_seq, frogs)\r\n\t\tprint(frogs)\r\n\texcept EOFError:\r\n\t\tsys.exit()", "import sys\nfrom typing import List\nw, l = map(int, input().split())\na = list(map(int, input().split()))\n\ns = [0]\nfor i in a:\n s.append(s[-1] + i)\ninf = pow(10, 9) + 1\nans = inf\nfor i in range(l, w):\n ans = min(ans, s[i] - s[i - l])\n\nprint(ans)\n", "def main():\n #usamos map para tranformar variables\n w, l = map(int, input().split())\n s = list(map(int, input().split()))\n m = 0\n t = 0\n\n for i in range(l):\n t += s[i]\n m = t\n for i in range(l, w - 1):\n t = t + s[i] - s[i - l]\n m = min(m, t)\n print(m)\n\n\nif __name__ == \"__main__\":\n main()\n \t \t\t\t \t \t \t\t\t \t\t\t \t\t \t\t\t\t\t \t", "import sys\r\n\r\ndef findMinSubSum(a, l):\r\n minim = sum(a[:l])\r\n\r\n current = minim\r\n for i in range(l, len(a)):\r\n current += a[i] - a[i - l]\r\n minim = min(current, minim)\r\n\r\n return minim\r\n\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(findMinSubSum(a, l))", "w, l = map(int, input().split())\na = list(map(int, input().split()))\n\ns = sum(a[:l])\nr = s\n\nfor i in range(l, w-1):\n s += a[i]\n s -= a[i-l]\n r = min(s, r)\n\nprint(r)\n", "line = input().split()\r\n\r\nwidth = int(line[0])\r\n\r\nl = int(line[1])\r\n\r\nriver = input().split()\r\n\r\nfor i in range(len(river)):\r\n\r\n river[i] = int(river[i])\r\n\r\nsum = 0\r\n\r\nfor i in range(l):\r\n\r\n sum += river[i]\r\n\r\n i+=1\r\n\r\nminim = sum\r\n\r\nfor i in range(l, width-1):\r\n\r\n sum = sum - river[i-l] + river[i]\r\n\r\n minim = min(minim, sum)\r\n\r\nprint(minim)", "\r\nn,l = list(map(int,input().split()))\r\n\r\nstones = list(map(int,input().split()))\r\n\r\nsumm = sum(stones[:l])\r\n#print(summ)\r\nminn = summ\r\n\r\nfor i in range(n-l-1) :\r\n #print(i,l+i)\r\n \r\n summ = summ + stones[l+i] - stones[i]\r\n \r\n if(summ<minn) :\r\n minn = summ\r\n\r\nprint(minn)\r\n \r\n \r\n \r\n \r\n \r\n ", "w, l = map(int,input().split())\r\na = tuple(map(int,input().split()))\r\nsumat = sum(a[:l])\r\nmini = sumat\r\nfor i in range(w-l-1):\r\n sumat = sumat - a[i] +a[i+l]\r\n mini = min(mini, sumat)\r\nprint(mini)", "w,l = map(int,input().split())\na = list(map(int,input().split()))\nc = sum(a[:l])\ns = c\nfor i in range(w-l-1):\n s=s-a[i]+a[i+l]\n c=min(c,s)\nprint(c) \n\t \t \t \t\t \t\t\t\t\t\t \t\t\t\t \t \t\t \t\t", "from collections import deque\r\nw, l = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [0]\r\n\r\n\r\nremovable_que = deque([])\r\ncnt = [0](w)\r\nans = 0\r\n\r\nfor pos in range(w-l, w):\r\n cnt[pos] = a[pos]\r\nfor pos in range(w-1, 0, -1):\r\n if pos <= l:\r\n ans += cnt[pos]\r\n continue\r\n #pos > l\r\n removable_que.appendleft(pos - l)\r\n val = cnt[pos]\r\n while removable_que and removable_que[-1] >= pos:\r\n removable_que.pop()\r\n while val > 0 and removable_que:\r\n poped_index = removable_que.popleft()\r\n d = a[poped_index] - cnt[poped_index]\r\n if d == 0:\r\n continue\r\n if d >= val:\r\n cnt[poped_index] += val\r\n val = 0\r\n removable_que.appendleft(poped_index)\r\n continue\r\n else:\r\n cnt[poped_index] += d\r\n val -= d\r\n continue\r\nprint(ans)\r\n\r\n", "import math\ndef frogs(w,l,stones):\n acc =0\n \n for i in range(l):\n acc+=stones[i]\n accMin = acc\n for i in range(l,w-1):\n acc = acc - stones[i-l] + stones[i]\n accMin = min(acc,accMin)\n return accMin\n\n\ntemp = input().split()\n\nw = int(temp[0])\nl = int(temp[1])\ntemp = input().split()\nstones=[]\nfor stone in temp:\n stones.append(int(stone))\n\nprint(frogs(w,l,stones))\n\t\t\t \t\t\t \t \t\t\t\t \t \t \t", "linha = input().split()\n \nlargura = int(linha[0])\n \nl = int(linha[1])\n \nrio = input().split()\n \nfor i in range(len(rio)):\n \n rio[i] = int(rio[i])\n \nsoma = 0\n \nfor i in range(l):\n \n soma += rio[i]\n \n i+=1\n \nminim = soma\n \nfor i in range(l, largura-1):\n \n soma = soma - rio[i-l] + rio[i]\n \n minim = min(minim, soma)\n \nprint(minim)\n \t\t\t \t \t \t\t \t\t\t\t\t\t \t\t\t\t\t\t\t \t\t", "w, l = map(int, input().split())\nstones = list(map(int, input().split()))\n\nprefixSums = [0] (w - l)\nprefixSums[0] = sum(stones[:l])\n\nfor i in range (w - 1 - l):\n prefixSums[i + 1] += prefixSums[i] + stones[i + l] - stones[i]\n\nprint(min(prefixSums))\n \t\t\t \t\t \t \t \t\t\t \t \t\t", "w, l = map(int, input().split())\nnumStonesList = list(map(int, input().split()))\ntotal = sum(numStonesList[:l])\naux = total\nfor i in range(l, w-1):\n total += numStonesList[i]\n total -= numStonesList[i-l]\n aux = min(total, aux)\nprint(aux)\n \t\t \t\t\t\t\t \t \t\t\t\t \t \t \t\t \t", "I=lambda:map(int,input().split())\nw,l=I()\na=list(I())\nc=s=sum(a[:l])\nfor i in range(w-l-1):\n s=s-a[i]+a[i+l]\n c=min(c,s)\nprint(c)\n \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t \t\t", "import sys\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(0x0FFFFFFF)\r\n# import threading\r\n# threading.stack_size(0x04000000)\r\n\r\nif __name__==\"__main__\":\r\n n,l=map(int,input().split())\r\n nums=list(map(int,input().split()))\r\n res=cur=sum(nums[:l])\r\n for start in range(n-l-1):\r\n cur+=nums[start+l]\r\n cur-=nums[start]\r\n res=min(res,cur)\r\n print(res)", "w, l = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ns = res = sum(a[:l])\r\nfor i in range(l, w - 1):\r\n s += a[i] - a[i - l]\r\n res = min(res, s)\r\nprint(res)\r\n ", "input_string = input().split()\nn = int(input_string[0])\nl = int(input_string[1])\ninput_string = input().split()\nv = []\nfor i in range(0, len(input_string)):\n\tv.append(int(input_string[i]))\ndp = [0]\nfor i in range(1, len(v) + 1):\n\tdp.append(dp[i-1] + v[i-1])\nans = 1000000000000000000000000000\nfor i in range(l, len(dp)):\n\tans = min(ans, dp[i] - dp[i - l])\nprint(ans)", "# Lê a largura w e o comprimento mínimo l\nw, l = map(int, input().split())\n\n# Lê os valores das pedras disponíveis\na = list(map(int, input().split()))\n\ns = [0] # Inicializa uma lista s com o valor inicial 0\nfor i in a:\n # Calcula as somas cumulativas\n s.append(s[-1] + i)\n # Cada elemento de s é a soma dos valores das pedras desde\n # o início até a posição atual\n\n# Inicializa a variável de resposta com um valor muito grande\ninf = pow(10, 9) + 1\nans = inf\n\n# Loop que percorre as possíveis posições de início da subsequência\n# dentro da sequência original\nfor i in range(l, w):\n dif = s[i] - s[i - l] # Diferença entre as somas cumulativas s(i) e s(i-l)\n # Atualiza a resposta com o menor entre o atual e a nova diferença\n ans = min(ans, dif)\n\n# Imprime a resposta final, que é o valor mínimo encontrado para\n# a soma da subsequência desejada\nprint(ans)\n", "Q = [int(x) for x in input().split(' ')]\nw = Q[0]\nl = Q[1]\nA = [int(x) for x in input().split(' ')]\nB = [0 for i in range(w-1)]\ni = 0\nj = 0\nfor i in range(w-1):\n\tif i<l:\n\t\tB[i]=A[i]\n\telse:\n\t\twhile j<i:\n\t\t\tif j<i-l:\n\t\t\t\tj=i-l\n\t\t\tt = min(A[i]-B[i],B[j])\n\t\t\tB[i]+=t\n\t\t\tB[j]-=t\n\t\t\tif B[j]==0:\n\t\t\t\tj+=1\n\t\t\telse:\n\t\t\t\tbreak\n\t#print(B)\n#print(A)\n#print(B)\nprint(sum(B[w-l-1:]))\n", "def cross_river(stones, jump):\n cur_sum = sum(stones[0:jump])\n min_sum = cur_sum\n left, right = 0, jump\n\n while right < len(stones):\n cur_sum = cur_sum - stones[left] + stones[right]\n min_sum = min(min_sum, cur_sum)\n\n left += 1\n right += 1\n\n return min_sum\n\n\ndef main():\n river_width, jump = map(int, input().strip().split())\n stones = list(map(int, input().strip().split()))\n\n print(cross_river(stones, jump))\n\n\nif __name__ == \"__main__\":\n main()\n\n\t \t\t\t\t \t \t \t\t \t \t \t\t\t\t\t \t\t", "from sys import stdin\r\n\r\nw,l = map(int, stdin.readline().split())\r\na = [0] + list(map(int, stdin.readline().split()))\r\n\r\nc = [0 for _ in range(w)]\r\ni,j = 1,1\r\nC = 0\r\nwhile j <= l:\r\n c[j] = a[j]\r\n a[j] = 0\r\n j+=1\r\n\r\nwhile i < w:\r\n while j<w and a[j]==0:\r\n j+=1\r\n if j-i > l:\r\n i+=1\r\n continue\r\n if j==w:\r\n C+=c[i]\r\n c[i]=0\r\n else:\r\n d = min(c[i],a[j])\r\n c[i]-=d\r\n a[j]-=d\r\n c[j]+=d\r\n if c[i]==0:\r\n i+=1\r\n\r\nprint(C)\r\n", "from itertools import \r\nr=lambda:map(int,input().split())\r\nw,l=r()\r\nv=[0,accumulate(r())]\r\nprint(min(v[i]-v[i-l] for i in range(l,w)))" ]	{"inputs": ["10 5\n0 0 1 0 2 0 0 1 0", "10 3\n1 1 1 1 2 1 1 1 1", "2 1\n0", "2 1\n5", "10 4\n0 0 6 2 7 1 6 4 0", "100 15\n0 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 0 1 0 0 1 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 0 1 0 0 1 0 0 1 1 0 1 0 1 0 0 1 0", "10 4\n10 10 10 10 10 10 10 10 10", "100 34\n16 0 10 11 12 13 0 5 4 14 6 15 4 9 1 20 19 14 1 7 14 11 10 20 6 9 12 8 3 19 20 4 17 17 8 11 14 18 5 20 17 0 3 18 14 12 11 12 5 5 11 7 9 17 4 8 4 10 0 0 12 9 15 3 15 14 19 12 6 8 17 19 4 18 19 3 8 3 9 1 6 15 4 16 1 18 13 16 3 5 20 11 10 9 9 17 20 15 12"], "outputs": ["3", "3", "0", "5", "8", "5", "40", "312"]}	UNKNOWN	PYTHON3	CODEFORCES	51
d0ae2caa308c79b1dd056ce059c51365	Trace	One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall. Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric. The first line contains the single integer n (1<=≤<=n<=≤<=100). The second line contains n space-separated integers ri (1<=≤<=ri<=≤<=1000) — the circles' radii. It is guaranteed that all circles are different. Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10<=-<=4. Sample Input 1 1 3 1 4 2 Sample Output 3.1415926536 40.8407044967	[ "# Description of the problem can be found at http://codeforces.com/problemset/problem/157/B\r\n\r\nimport math\r\n\r\nn = int(input())\r\nl_s = list(map(int, input().split()))\r\nl_s.sort(reverse = True)\r\n\r\nt = 0\r\nfor index in range(n):\r\n t += (-1 if index % 2 == 1 else 1) * l_s[index] ** 2\r\n\r\nprint(t * math.pi)", "from math import pi\r\ninput()\r\nlst = [int(x) for x in input().split()]\r\n\r\nlst.sort(reverse=True)\r\narea = 0\r\nl = len(lst)\r\nfor i in range(0, l, 2):\r\n area += lst[i]lst[i]\r\nfor i in range(1, l, 2):\r\n area -= lst[i]lst[i]\r\n\r\nprint(areapi)\r\n", "import math\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n if i % 2 != n % 2:\r\n if i == 0:\r\n ans += math.pi a[i] ** 2\r\n else:\r\n ans += math.pi * (a[i] 2 - a[i - 1] 2)\r\nprint(ans)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(n%2!=0):\r\n d=l[0]2\r\n a=1\r\nelse:\r\n a=0\r\n d=0\r\nfor i in range(a,n-1,2):\r\n d=d+(l[i+1]2-l[i]*2)\r\nprint(dmath.pi)", "from math import \r\n\r\nn = int(input())\r\nv = [int(i) for i in input().split()]\r\n\r\nif len(v) % 2 != 0:\r\n v.append(0)\r\nv.sort()\r\n\r\nres = 0\r\nfor i in range(1, n+1, 2):\r\n res += v[i]2 - v[i-1]2\r\nprint(\"%.10f\" % (res pi))\r\n", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\nimport math\r\nimport os\r\nimport sys\r\nfrom sys import stdin,stdout\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10*5)\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(args, *kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#-----------------------------------------------------------------\r\n\r\ndef regularbracket(t):\r\n p=0\r\n for i in t:\r\n if i==\"(\":\r\n p+=1\r\n else:\r\n p-=1\r\n if p<0:\r\n return False\r\n else:\r\n if p>0:\r\n return False\r\n else:\r\n return True\r\n\r\n#-------------------------------------------------\r\ndef binarySearchCount(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n\r\n count = 0\r\n\r\n while (left <= right):\r\n mid = int((right + left) / 2)\r\n\r\n # Check if middle element is\r\n # less than or equal to key\r\n if (arr[mid] <= key):\r\n count = mid+1\r\n left = mid + 1\r\n\r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n return count\r\n#------------------------------reverse string(pallindrome)\r\ndef reverse1(string):\r\n pp=\"\"\r\n for i in string[::-1]:\r\n pp+=i\r\n if pp==string:\r\n return True\r\n return False\r\n#--------------------------------reverse list(paindrome)\r\ndef reverse2(list1):\r\n l=[]\r\n for i in list1[::-1]:\r\n l.append(i)\r\n if l==list1:\r\n return True\r\n return False\r\n# endregion\r\nimport math\r\ndef mex(list1):\r\n #list1 = sorted(list1)\r\n p = max(list1)+1\r\n for i in range(len(list1)):\r\n if list1[i]!=i:\r\n p = i\r\n break\r\n return p\r\n#----endregion\r\n\"\"\"\r\ndef main():\r\n n,m = map(int,input().split())\r\n np = list(map(int,input().split()))\r\n mp = list(map(int,input().split()))\r\n np = sorted(np)\r\n mp = sorted(mp)\r\n cnt=0\r\n for i in np:\r\n if len(mp)==0:\r\n cnt+=1\r\n elif i in mp:\r\n continue\r\n elif i>max(mp):\r\n cnt+=1\r\n elif i<max(mp):\r\n #cnt-=1\r\n for j in mp:\r\n if j>i:\r\n mp.remove(j)\r\n break\r\n print(cnt)\r\n\"\"\"\r\n\"\"\"\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n max=0\r\n if len(arr)==1:\r\n print(1)\r\n elif len(arr)==2:\r\n print(2)\r\n else:\r\n cnt=2\r\n for i in range(n-2):\r\n if arr[i+2]==arr[i+1]+arr[i]:\r\n cnt+=1\r\n else:\r\n if cnt>max:\r\n max = cnt\r\n\r\n cnt=2\r\n if cnt>max:\r\n max=cnt\r\n print(max)\r\n\"\"\"\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr = sorted(arr)\r\n p=0\r\n if len(arr)%2!=0:\r\n c = (math.pi)(pow(arr[0],2))\r\n arr.pop(0)\r\n i=0\r\n p=0\r\n while(i<len(arr)-1):\r\n p+=(math.pi(pow(arr[i+1],2))) - ((math.pi(pow(arr[i],2))))\r\n i+=2\r\n print(p+c)\r\n else:\r\n i=0\r\n while(i<len(arr)-1):\r\n p += (math.pi * (pow(arr[i + 1], 2))) - ((math.pi * (pow(arr[i], 2))))\r\n i+=2\r\n print(p)\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\nn = int(input())\narr = [int(x) for x in input().split()]\narr = [x ** 2 for x in sorted(arr)[::-1]]\nif(len(arr) % 2 == 1):\n\tarr = arr + [0]\ntotal = 0\nfor i in range(0, len(arr), 2):\n \ttotal += (arr[i] - arr[i+1])\nprint(math.pi * total)\n", "import math\r\n\r\ntc = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\n\r\nc = 0\r\nfor i in range(tc):\r\n c += (-1 if i % 2 == 1 else 1) * arr[i] ** 2\r\n\r\nprint(c * math.pi)", "#from collections import Counter\r\nimport math\r\n\r\npi = math.pi\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort(reverse=True)\r\n\r\ni = 0\r\narea = 0\r\nwhile i<len(arr):\r\n if i+1<len(arr):\r\n area += pi(arr[i]2-arr[i+1]2)\r\n \r\n else:\r\n area += pi(arr[i]2)\r\n \r\n i += 2\r\n \r\nprint(area)", "from math import pi\r\n\r\nn = int(input())\r\ncircles = list(map(int, input().split(' ')))\r\ncircles.sort()\r\ncircles.reverse()\r\ns = 0\r\nfor i in range(1, len(circles) + 1):\r\n if i % 2 == 0:\r\n s -= circles[i - 1] 2 * pi\r\n else:\r\n s += circles[i - 1] ** 2 * pi\r\n\r\nprint(s)\r\n", "from math import \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nl.sort()\r\nfor i in range(n):\r\n if(i%2==0):\r\n s=s+l[i]l[i]\r\n else:\r\n s=s-(l[i]l[i])\r\np=abs(spi)\r\nprint('%.10f'%p)\r\n", "from math import pi\r\nn = int(input())\r\narr = [int(i) for i in input().strip().split()]\r\narr.sort(reverse = True)\r\nif n % 2 != 0:\r\n arr.append(0)\r\nans = 0 \r\nfor i in range(0, len(arr), +2):\r\n ans += arr[i]2 - arr[i+1]2\r\nprint(pians) ", "import math\r\n\r\nn = int(input())\r\nraios = [int(x) for x in input().split()]\r\n\r\nraios.sort()\r\n\r\nresultado = 0.0\r\nfor i in range(len(raios)-1, -1, -1):\r\n if i % 2 == 0:\r\n resultado += math.pipow(raios[i], 2)\r\n else:\r\n resultado -= math.pi * pow(raios[i], 2)\r\nif resultado >= 0:\r\n print(format(resultado, \".20f\"))\r\nelse:\r\n print(format(-resultado, \".20f\"))\r\n", "from math import pi\r\n\r\nn = int(input())\r\nr = sorted(map(int, input().split()), reverse=True)\r\nans = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans += r[i] 2\r\n else:\r\n ans -= r[i] 2\r\nprint(ans * pi)", "p=3.1415926536\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nl.append(0)\r\nl.sort()\r\nl=l[::-1]\r\n\r\ni=0\r\nj=1\r\ns=0\r\n\r\nwhile j<len(l):\r\n s=s+(pow(l[j],2)-pow(l[i],2))p\r\n j+=2\r\n i+=2\r\n\r\nprint(abs(s))\r\n", "L=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nn=I()\r\na=sorted(L())\r\nx=0\r\nfor i in range(n):\r\n if i%2==0:\r\n x+=a[i]2\r\n else:\r\n x-=a[i]2\r\nprint(abs(x)3.1415926536)\r\n", "import math\n\ndef solve(lst):\n\tres = 0\n\tlst.sort()\n\tfor i in range(len(lst)-1,-1,-2):\n\t\tif i == 0:\n\t\t\tres += (lst[i] ** 2) * math.pi\n\t\telse:\n\t\t\tres += (lst[i]2 - lst[i-1]2) * math.pi\n\treturn res\n\n\nn = input()\nnums = list(map(int, input().split()))\nprint (solve(nums))\n", "import math\n\nn = int(input())\nr = [int(x) for x in input().split()]\n\nr.sort()\ncount = 0\nk = 1\nwhile len(r) > 0:\n x = r.pop()\n count += k * x * x\n k = -1\n\nval = math.pi count\nprint(val)\n", "def intercala (lista,lado_esq,lado_dir):\r\n i = 0\r\n j = 0\r\n k = 0\r\n while i < len(lado_esq) and j < len(lado_dir):\r\n if lado_esq[i] > lado_dir[j]:\r\n lista[k] = lado_esq[i]\r\n i = i + 1\r\n else:\r\n lista[k] = lado_dir[j]\r\n j = j + 1\r\n k = k + 1\r\n while i < len(lado_esq):\r\n lista[k] = lado_esq[i]\r\n i = i + 1\r\n k = k + 1\r\n while j < len(lado_dir):\r\n lista[k] = lado_dir[j]\r\n j = j + 1\r\n k = k + 1\r\n return lista\r\n\r\ndef mergesort (lista):\r\n if len(lista) > 1:\r\n meio = len(lista) // 2\r\n lado_esq = lista[:meio]\r\n lado_dir = lista[meio:]\r\n mergesort(lado_esq)\r\n mergesort(lado_dir)\r\n intercala (lista,lado_esq,lado_dir)\r\n return lista\r\n\r\ndef concentricos(n,raios):\r\n mergesort(raios)\r\n total = 0\r\n if n % 2 == 1:\r\n raios.append(0)\r\n n = n + 1\r\n for i in range(n):\r\n if i % 2 == 0:\r\n total = total + (raios[i] 2) - (raios[i + 1] 2)\r\n total = total * 3.1415926536\r\n return total\r\n\r\nn = int(input())\r\nr = input().split()\r\nraios = []\r\nfor i in r:\r\n raios.append(int(i))\r\nprint(concentricos(n,raios))\r\n", "a=int(input())\r\nimport math\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nif len(b)%2==1:\r\n l=[b[i+1]b[i+1]math.pi-b[i]b[i]math.pi for i in range(len(b[1::])) if i%2==1]\r\n c=round(b[0]b[0]math.pi+sum(l),10)\r\nelse:\r\n l=[b[i]b[i]math.pi-b[i-1]b[i-1]math.pi for i in range(len(b)) if i%2==1]\r\n c=round(sum(l),10) \r\n\r\nprint(c)", "from math import \r\n\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(int(1)):\r\n N = inl()[0]\r\n A = sorted(inl(), reverse=True)\r\n\r\n a = 0\r\n for i in range(0, N - 1, 2):\r\n a += pi (pow(A[i], 2) - pow(A[i + 1], 2))\r\n\r\n print(a + pi * pow(A[-1], 2) * (N % 2))\r\n", "import sys\r\nimport math\r\nx=3.1415926536\r\nn=int(input())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nl.sort(reverse=True)\r\n#print(l)\r\nt=-1\r\ns=0\r\nfor i in l :\r\n s=s +t(-1)ii\r\n t=-1t\r\nprint(sx)", "__author__ = '7877'\r\ndef solve():\r\n from math import pi\r\n n = int(input())\r\n rdl = list(map(int,input().split()))\r\n max_rad = 0\r\n for i in rdl:\r\n max_rad = max(max_rad, i)\r\n red_area = 0.0\r\n cur = 1\r\n for i in range(len(rdl)):\r\n red_area += (max_rad2)picur\r\n rdl[rdl.index(max_rad)] = -1\r\n max_rad = 0\r\n cur = -1\r\n for j in rdl:\r\n max_rad = max(max_rad, j)\r\n print(red_area)\r\n\r\n\r\nsolve()", "\r\npi = 3.14159265358\r\n\r\n\r\ndef main():\r\n ans = 0\r\n n = int(input())\r\n a = [int(x) ** 2 for x in input().split()]\r\n a.sort(key=lambda x: -x)\r\n\r\n for i in range(0, n - 1, 2):\r\n ans += a[i] - a[i + 1]\r\n if n % 2:\r\n ans += a[n - 1]\r\n ans = ans * pi\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "from math import pi\nn=int(input())\n\nL=list(map(int,input().split()))\n\nL.sort(reverse=True)\nans=0\nfor i in range(0,n,2):\n if(i==n-1):\n ans+=pi(L[i]L[i])\n else:\n ans+=pi((L[i]L[i])-(L[i+1]L[i+1]))\nprint(ans)\n", "from math import pi\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nw.sort()\r\nk=1\r\nres=0\r\nwhile w:\r\n res+=kpi(w.pop())2\r\n k=-1\r\nprint(res)", "# -----Arkp-----#\r\nimport sys\r\nfrom math import \r\nfrom collections import defaultdict\r\nimport sys\r\nI_map=lambda: map(int,input().split())\r\nS_map=lambda: map(str,input().split())\r\nF_map=lambda: map(float,input().split())\r\nN=lambda: int(input())\r\nS=lambda: input()\r\ndef INT_MAX():\r\n return sys.maxsize\r\ndef INT_MIN():\r\n return -sys.maxsize\r\n\r\ndef solve(n,l):\r\n res=0\r\n l.sort(reverse=True)\r\n if n%2!=0:\r\n res+=3.1415926536(l[-1]*2)\r\n\r\n for i in range(0,n-1,2):\r\n res+=(3.1415926536((l[i]2)-(l[i+1]2)))\r\n return res\r\n\r\n\r\n\r\nn=N()\r\nl=list(I_map())\r\nprint(solve(n,l))\r\n \r\n ", "import math\nn = int(input())\nr = [int(x) for x in input().split()]\nr = sorted(r, reverse=True)\ni = 0\narea_sum = 0\nwhile i < len(r) - 1:\n area_sum += (r[i]2 - r[i + 1]2)\n i += 2\nif len(r) % 2 != 0:\n area_sum += r[len(r) - 1]*2\nelse:\n pass\nprint(area_sum 3.141592653589793)\n", "import math\r\nn = int(input())\r\nr = [int(x) for x in input().split()]\r\nr.sort()\r\na = 0\r\nif n%2==0:\r\n i = 1\r\n while i < len(r):\r\n a = a+(math.pi)r[i]r[i]\r\n i = i+2\r\n j = 0\r\n while j < len(r):\r\n a = a-(math.pi)r[j]r[j]\r\n j = j+2\r\n print(a)\r\nelse:\r\n i = 0\r\n while i < len(r):\r\n a = a+(math.pi)r[i]r[i]\r\n i = i+2\r\n j = 1\r\n while j < len(r):\r\n a = a-(math.pi)r[j]r[j]\r\n j = j+2\r\n print(a)", "pie = 3.1415926536\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort(reverse= True)\r\n\r\nred = 0\r\nblue = 0\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n red += A[i] 2\r\n else:\r\n blue += A[i] 2\r\n\r\nans = pie * (red - blue)\r\n\r\nprint(ans)\r\n", "import math\n\n\ndef square(j):\n return math.pi * x[j] 2\n\n\nn = int(input())\nx = list(map(int, input().split()))\nx.sort()\ntotal_square = 0\nif n % 2 == 0:\n for j in range(1, n, 2):\n total_square += square(j) - square(j - 1)\nelse:\n for j in range(0, n, 2):\n if j == 0:\n total_square += square(j)\n else:\n total_square += square(j) - square(j - 1)\nprint(total_square)\n", "#157B\r\nfrom math import pi\r\nn = int(input())\r\nr = list(map(float,input().split()))\r\nr.sort(reverse=True)\r\ns = 0\r\nfor i in range(n):\r\n s += r[i]2(-1)i\r\nprint(pis)", "a=int(input())\r\narr=list(map(int,input().strip().split()))\r\narr.sort(reverse=True)\r\nans=0\r\nfor i in range(a):\r\n if i%2==0:ans+=(arr[i]2)\r\n else:ans-=(arr[i]2)\r\nprint(ans3.1415926536)", "n=int(input())\r\nx=list(map(int, input().split()))\r\nx.sort()\r\nx.reverse()\r\nimport math\r\ns=0\r\nfor i in range(n):\r\n if i%2==0:\r\n s=s+x[i]x[i]\r\n else:\r\n s=s-x[i]x[i]\r\nr=smath.pi\r\nprint(\"{:.10f}\".format(r))", "import math\r\ninput()\r\na = sorted(list(map(int,input().split(' '))))\r\nfor i in range(len(a)):\r\n\ta[i]=a[i]*2\r\nprint (math.pi(sum(a[::-2])-sum(a[-2::-2])))", "n=int(input())\nlista=list(map(int,input().split()))\nlista.sort(reverse=True)\nresp=0\npi=3.1415926536\nsinal=True\nfor e in lista:\n if sinal:\n resp+=pi(e2)\n sinal=False\n else:\n resp-=pi(e*2)\n sinal=True\nprint(\"%.10f\"%resp)\n \t \t \t \t\t \t \t \t \t\t", "n = int(input())\r\nl = list(map(int, input().split()))\r\npi = 3.1415926536\r\nl.sort()\r\nr = 0\r\nalterna = -1\r\nfor i in range(n -1, -1, -1):\r\n alterna = -1\r\n r += (pi * (l[i]*2)) alterna\r\nprint(r)", "import math\r\n\r\nn = int(input())\r\nvalores = []n\r\nv = input().split()\r\nfor val in v:\r\n valores.append(int(val))\r\n\r\nvalores.sort(reverse=True)\r\n\r\narea = 0\r\nfor index in range(n):\r\n if index % 2 == 1: \r\n area += -1 valores[index] ** 2\r\n else:\r\n area += 1 * valores[index] ** 2\r\n\r\nprint(area * math.pi)", "import math\r\nn=int(input())\r\nlist=[]\r\nlist=[int(i) for i in input().split()]\r\nlist.append(0)\r\nlist.sort(reverse=True)\r\nans=0\r\nfor i in range(0,n,2):\r\n ans+=(list[i]list[i]-list[i+1]list[i+1])\r\nprint(math.pians)", "from sys import stdin,stdout\nfrom math import pi\n\nn = int(input())\n\nrs = list(map(int,stdin.readline().split()))\n\nrs.sort()\nrs.reverse()\nra = 0\n# print(rs)\nrs.append(0)\nfor i in range(len(rs)-1):\n if(i%2==0):\n dif = rs[i]2pi-rs[i+1]*2pi\n ra+=dif\n # print(ra)\nprint(ra)\n \t\t\t \t\t\t \t \t \t \t \t \t \t", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort(reverse=True)\r\nl=len(x)\r\ns=0\r\nfor i,j in enumerate(x):\r\n if i%2==0:\r\n s+=(jj)\r\n else:\r\n s-=(jj)\r\nprint(s3.1415926536)", "from math import pi\r\n\r\nn = int(input())\r\n\r\nraios = list(map(int, input().split(\" \")))\r\nraios.sort(reverse=True)\t\t\t\t\t# ORDENA RAIOS DESCRESCENTEMENTE\r\n\r\narea = 0\r\n\r\nfor i in range(0, n if n%2==0 else n-1, 2): # SE A QNT DE RAIOS É ÍMPAR CALCULAMOS\t\t\t\t\t\t\t\t\t\t\r\n\tarea += piraios[i]*2 # SOMENTE ATÉ O PENÚLTIMO CÍRCULO MAIS INTERNO\r\n\tarea -= piraios[i+1]*2\r\n\r\nif n%2==1:\t\t\t\t\t\t\t\t\t# SE A QNT DE RAIOS FOR ÍMPAR INCREMENTAMOS A ÁREA\r\n\tarea += piraios[n-1]*2 # COM AQUELA DA CIRCUNFERÊNCIA NÃO CONTABILIZADA\r\n\r\nprint(area)", "input()\nl = sorted(int(a)int(a) for a in input().split())\nprint(3.1415926536 * (sum(l[::-2])-sum(l[-2::-2])))\n \t\t\t\t \t \t \t \t\t\t \t \t\t \t\t", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nans=0\r\nfor z in range(0,len(a),2):\r\n ans+=a[z]2\r\n if(z+1<len(a)):\r\n ans-=a[z+1]2\r\n\r\nprint(math.pians)", "import math\r\n\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nif len(x)%2==1:\r\n x.append(0)\r\nx.sort()\r\nx=x[::-1]\r\ns=0\r\ni=0\r\nwhile(i<len(x)):\r\n s+=(x[i]2)-(x[i+1]2)\r\n i+=2\r\nprint('%.10f'%(math.pis))\r\n", "# test\nimport math\nx = int(input())\ny = [int(i) for i in input().split()]\ny.sort(reverse = True)\ncounter = 0\ntest = 0\nfor items in y :\n if test == 0:\n counter += pow(items,2)\n test = 1\n else: \n test = 0\n counter -= pow(items,2)\nprint(counter * math.pi)\n \t \t\t \t\t \t\t \t\t\t\t \t\t\t", "import math\nn = int(input())\nr = [int(x) for x in input().split()]\nspaces = [math.pi * rad 2 for rad in sorted(r)[::-1]]\nprint(sum(spaces[::2]) - sum(spaces[1::2]))\n\n \t\t \t\t\t\t \t\t \t\t \t\t \t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=True) + [0]\r\n\r\ns = 0\r\nfor i in range(0, n, 2):\r\n s += w[i]2 - w[i+1]*2\r\nprint(smath.pi)", "from math import pi\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\na.append(0)\r\nans=0\r\nfor i in range(0,n,2):\r\n\tans+=pi(a[i]a[i]-a[i+1]a[i+1])\r\nprint(ans)\r\n", "pi = 3.14159\r\nt= int(input())\r\narr = list(map(lambda x: int(x), input().split()))\r\nif t%2==0:\r\n start = 1\r\nelse: \r\n start = 0\r\n\r\nres = 0\r\n\r\narr = sorted(arr)\r\nfor i in range(start,t,2):\r\n if i==0:\r\n res+=(pi(arr[i]*2))\r\n continue\r\n res+= abs(((pi(arr[i-1]*2))-(pi(arr[i]*2))))\r\nprint('%.10f' % res)\r\n\r\n", "import math\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\npi = math.asin(1) 2\r\narr.sort(reverse=True)\r\nr = 0\r\nfor i in range(n):\r\n r += arr[i] * arr[i] * (1 - i % 2 * 2)\r\n\r\nprint(pir)", "import math\r\n\r\nN = int(input())\r\n\r\ntowers = {}\r\n\r\na = [int(i) for i in input().split()]\r\n\r\na.sort(reverse=True)\r\nif N % 2 == 1:\r\n a.append(0)\r\n N += 1\r\n\r\nres = 0\r\n\r\nfor i in range(0, N, 2):\r\n res += math.pi (a[i] * a[i] - a[i + 1] * a[i + 1])\r\n\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nfor i in range (n):\r\n if(i%2==0):\r\n ans+=(l[i]l[i])\r\n else:\r\n ans-=(l[i]l[i])\r\n\r\nans=3.1415926536* ans\r\nprint(ans)\r\n\r\n", "n = input()\nr = input().split()\nn = int(n)\narea = 0\nfor i in range(n):\n r[i] = int(r[i])\nr.sort(reverse=True)\nfor j in range(1, n+1):\n if j%2==0:\n area -= ((r[j-1]*2)3.1415926536)\n else: \n area += ((r[j-1]*2)3.1415926536)\nprint(area)\n\t\t\t\t \t\t \t\t \t \t\t\t\t\t \t \t \t\t", "import math\r\n\r\n\r\ndef main():\r\n input()\r\n radius = [int(e) for e in input().split(\" \")]\r\n areas = [(math.pi * (rr)) for r in radius]\r\n areas.sort(reverse=True)\r\n\r\n area = areas[0]\r\n for i in range(1, len(areas)):\r\n if i % 2 == 0:\r\n area += areas[i]\r\n else:\r\n area -= areas[i]\r\n\r\n print(area)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nif len(a)%2:\r\n a=a+[0]\r\nc=0 \r\nfor i in range(0,len(a),2):\r\n c+=math.pi(a[i]2-a[i+1]2)\r\n\r\nprint(\"{0:.6f}\".format(c))\r\n \r\n\r\n ", "from math import pi\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nj=n-1\r\ncount_=0\r\nwhile j>=0:\r\n if j!=0:\r\n count_+=pi(r[j]2-r[j-1]2)\r\n else:\r\n count_+=pi(r[j]*2)\r\n j-=2\r\nprint(count_)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n%2==1:\r\n s=3.1415926536(l[0]*2)\r\n for i in range(2,n,2):\r\n s+=(3.1415926536(l[i]*2)-3.1415926536(l[i-1]*2))\r\nelse:\r\n s=0\r\n for i in range(1,n,2):\r\n s+=(3.1415923536(l[i]*2)-3.1415923536(l[i-1]*2))\r\nprint(s)\r\n", "n = int(input())\r\nr = list(map(int,input().split()))\r\nr = sorted(r)[::-1]\r\npi = 3.1415926536\r\narea = 0\r\nfor i in range(n):\r\n if i%2==0:\r\n area+=pir[i]r[i]\r\n else:\r\n area-=pir[i]r[i]\r\nprint(area)", "import math\r\nn = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl1.sort()\r\narea = 0\r\nif n%2==0:\r\n i = 1\r\n while i<n:\r\n area+=(l1[i]2-l1[i-1]2)\r\n i+=2\r\nelse:\r\n i = 0\r\n while i<n:\r\n if i==0:\r\n area+=(l1[i]2)\r\n else:\r\n area+=(l1[i]2-l1[i-1]2)\r\n i+=2\r\nprint(round(area(math.pi),10))", "import math\nn = int(input())\ncircles = input().split()\ncircles = [int(i) for i in circles]\nif circles.sort() != None:\n circles = circles.sort()\n\nresult = 0\n\nfor i in range(n - 1,-1,-1):\n if (n + i) % 2 == 0:\n result -= circles[i]*2 math.pi\n else:\n result += circles[i]*2 math.pi\n\nprint(result)\n\t\t \t\t\t \t \t\t\t\t\t \t \t\t", "from sys import stdin, stdout\r\nfrom math import pi\r\nn = int(stdin.readline())\r\nr = list(map(int,stdin.readline().split(' ')))\r\nr.sort(reverse=True)\r\nc = 0\r\nfor k in range(n//2):\r\n c += r[2k]2-r[2k+1]2\r\nif n % 2 == 1:\r\n c += r[n-1]2\r\nstdout.write(str(pic))", "import math, array, re\n \ndef read_int():\n return int(input().strip())\n \ndef read_ints():\n return list(map(int, input().strip().split()))\n \ndef read_str():\n return input().strip()\n \ndef read_strs():\n return input().strip().split()\n\nif __name__ == '__main__':\n n = read_int()\n r = sorted(read_ints(), reverse=True)\n\n area = 0\n\n for i in range(n):\n if i % 2 == 0:\n area += math.pi r[i] ** 2\n else:\n area -= math.pi * r[i] ** 2\n\n print(area)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\na.sort()\r\nred=0\r\nblue=0\r\nfor i in range(0,len(a)):\r\n if i%2==0:\r\n red+=a[i]a[i]\r\n else:\r\n blue+=a[i]a[i]\r\nred=3.1415926536\r\nblue=3.1415926536\r\nprint(abs(red-blue))", "\n\ndef solve(n,arr):\n def ar(n):\n from math import pi\n return round(pin2,10)\n if n <=1 :\n return ar(arr[0])\n \n arr.sort(reverse=True)\n arr.append(0)\n val=0\n for i in range(n) :\n if i%2==0 :\n val+=ar(arr[i])-ar(arr[i+1])\n return val\n\n\n\n\n \t\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n\n\nn=int(input())\nl=[int(x)for x in input().split()]\n\n\nprint(solve(n,l))", "import math\r\n\r\nn = int(input())\r\nrs = list(map(int, input().split()))\r\nrs.sort(reverse=True)\r\n\r\nred = True\r\n\r\ns = 0\r\n\r\nfor r in rs:\r\n if red:\r\n s += r r\r\n else:\r\n s -= r * r\r\n red = not red\r\n\r\nprint(s * math.pi)\r\n", "input();s=sorted(map(lambda x:int(x)*2,input().split()))\r\nprint(abs(sum(s[::2])-sum(s[1::2]))3.1416)", "while True:\r\n\ttry:\r\n\t\timport math\r\n\t\tdef soln(n, a):\r\n\t\t\ta.sort(reverse = True)\r\n\t\t\tres = 0\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tif i & 1:\r\n\t\t\t\t\tres -= (math.pia[i]2)\r\n\t\t\t\telse:\r\n\t\t\t\t\tres += math.pia[i]*2\r\n\t\t\tprint(res)\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\tn = int(input())\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\tsoln(n, a)\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "from math import pi\r\n\r\ninput()\r\ns = 0\r\nodd = True\r\n\r\nfor r in sorted(map(int, input().split()), reverse=True):\r\n s += rr if odd else -rr\r\n odd ^= True\r\n\r\nprint(pis)", "from math import pi\r\ninput()\r\na=sorted(map(int,input().split()),reverse=True)\r\nprint(sum(map(lambda x:pia[x]2(-1)x,range(len(a)))))", "n= int(input())\na=list(map(int,input().split(' ')))\na.sort()\nred_area=0\nfor i in range(len(a)):\n\tif len(a)%2==1:\n\t\tif i%2==0:\n\t\t\tred_area=red_area+a[i]2\n\t\telse:\n\t\t\tred_area=red_area-a[i]2\n\telse:\n\t\tif i%2==1:\n\t\t\tred_area=red_area+a[i]2\n\t\telse:\n\t\t\tred_area=red_area-a[i]*2\nprint(red_area3.1415926536)\n", "n = int(input())\r\na = sorted(list(map(float,input().split())))\r\na = a[::-1]\r\npi = 3.14159265359\r\nans = 0;\r\nfor i in range(0,len(a),1):\r\n if i%2==1:\r\n ans-=pia[i]2\r\n else:\r\n ans+=pia[i]2\r\nprint(ans)", "import heapq\r\nimport math\r\n\r\n\"\"\"\r\n\tversão comentada:\r\n\r\n\tProblema, temos circulos com mesmo centro, como termos uma intercalação cores\r\n\té garantido uma das cores é a areas entre o maior circulo para o segundo maior circulo.\r\n\tE a proxima cor, seria entre o segundo maior e o terceiro maior.\r\n\t\r\n\tentão sera r[1..n] o vetor ordenado do maior para o menor 'n' raio dos 'n' circulos\r\n\r\n\tA area total seria essa interalação começando pelo r[1] até r[2]\r\n\r\n\tArea = pi(r[1])^2 - pi(r[2])^2 + pi(r[3])^2 - ... + pi(r[n])^2\r\n\t\r\n\tnotasse que o sinal tbm intercala, botamos pi em evidencia temos:\r\n\tArea = pi(r[1]^2 - r[2]^2 + r[3]^2 - ... +- r[n]^2)\r\n\r\n\tum loop é suficiente, e multiplicamos com pi apenas só no final:\r\n\tpara intercalar o sinal para elevar (-1)^i \| i = 1,2, ..., n\r\n\t \r\n\"\"\"\r\ndef Trace(n):\r\n\tr = [int(i) for i in input().split(\" \")]\r\n\tr = mergesort(r)\r\n\tpartial_sum = 0\r\n\tj = 0\r\n\tfor i in reversed(range(n)):\r\n\t\tpartial_sum += ((-1)j)r[i]2\r\n\t\tj = j + 1\r\n\t\r\n\treturn math.pi(partial_sum)\r\n\t\r\ndef mergesort(V):\r\n\ti,s = 0, len(V)\r\n\t\r\n\tif s-i < 2 :\r\n\t\treturn V[i:s]\r\n\r\n\tmeio = (i+ s) // 2\r\n\t\r\n\tV1 = mergesort(V[i:meio])\r\n\t\r\n\tV2 = mergesort(V[meio:s+1])\r\n\r\n\treturn merge(V1, V2)\r\n\t\r\ndef merge(V1:list,V2:list):\r\n\tL = [V1,V2]\r\n\tT = [len(V1),len(V2)]\r\n\tn = (len(V1)+len(V2))\r\n\tV = [None]n\r\n\tH = []\r\n\r\n\tI = [0]2\r\n\theapq.heappush(H,(V1[0],0))\r\n\theapq.heappush(H,(V2[0],1))\r\n\r\n\tv = 0\r\n\t\r\n\twhile v < n:\r\n\t\titem,index = heapq.heappop(H)\r\n\t\tV[v] = item\r\n\t\tv += 1\r\n\t\tI[index] += 1\r\n\t\tif I[index] < T[index]:\r\n\t\t\t\theapq.heappush(H,(L[index][I[index]],index))\r\n\treturn V\r\n\r\ndef __main__():\r\n\r\n\tn = int(input())\r\n\tprint(Trace(n))\r\n\r\nif __name__ == '__main__':\r\n\t__main__()", "from math import pi\nn = int(input())\na = [int(x) for x in input().split()]\na.sort()\nfor i in range(len(a) - 2, -1, -2):\n\ta[i] = -a[i]\nprint(pi * sum(x * x * (-1 if x < 0 else 1) for x in a))\n", "quant=int(input())\nn=input().split()\nvermelho=0\nazul=0\npi=3.1415926536\nfor x in range(quant):\n n[x]=int(n[x])\nn=sorted(n)\nfor x in range(quant):\n if(x%2==0):\n area=n[x]n[x]pi\n vermelho=vermelho+area\n else:\n area=n[x]n[x]pi\n azul=azul+area\nif(len(n)%2==0):\n print(azul-vermelho)\nelse:\n print(vermelho-azul)\n \n\n\t \t \t\t \t\t \t \t\t\t \t\t \t \t", "pi = 3.141592653589793\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\nL.sort(reverse=True)\r\nans = 0.0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans += L[i]2\r\n else:\r\n ans -= L[i]2\r\nprint(ans * pi)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------06.04.2020-------------\r\n\r\nimport math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort(reverse=True);E=0\r\nfor i in range(n):\r\n if i%2==0:\r\n if i!=n-1:\r\n E+=r[i]*2math.pi-math.pir[i+1]2\r\n else:\r\n E+=r[i]2math.pi\r\nprint(\"%.12f\"%E)\r\n", "n = int(input())\nr = list(map(int, input().split()))\nr = sorted(r, reverse = True)\nimport math\ntotal = 0\n\nfor x in range(n):\n if x%2 == 0:\n total += math.pi (r[x]2)\n else:\n total -= math.pi (r[x]2)\n\nprint(total)\n#This is my code\n \t\t \t \t\t\t \t \t\t\t \t \t\t", "import math\n\nn1 = int(input())\nnum = 0\n\nx = list(map(int, input().split()))\nx.sort()\n\nfor j in range(n1):\n aux = (x[j] 2) * math.pi\n\n if n1 % 2 == 0:\n if j % 2 == 0:\n aux = -aux\n \n else:\n if (j % 2 != 0):\n aux = -aux\n \n num += aux\n\nprint(num)\n\n\t\t \t \t\t\t\t \t\t \t \t\t\t\t \t \t\t\t", "import math\nn = int(input())\narr = list(map(int,input().strip().split()))[:n]\narr.sort(reverse=True)\narea = 0;\nif(n%2):\n area = math.pi * arr[n-1] * arr[n-1]\nfor i in range(0, n-1, 2):\n area += (math.pi * arr[i] arr[i]) - (math.pi arr[i+1] arr[i+1])\nprint(area)\n\t\t\t \t\t\t\t \t\t \t \t\t \t\t\t\t\t \t", "n=int(input())\r\nq=n%2\r\nk=0\r\nz=0\r\npi=3.1415926536\r\na=sorted(map(int,input().split()))\r\nfor i in range(n):\r\n r=a[i]\r\n if i%2!=q:\r\n k+=(rr-zz)pi\r\n z=r\r\nprint(k)", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\ni=n-1\r\ns=math.pir[i]2\r\nans,z=s,1\r\nwhile True:\r\n if i==0:break\r\n i-=1\r\n z=-1\r\n s=math.pir[i]2\r\n ans+=(zs)\r\nprint(ans)\r\n \r\n \r\n", "\"\"\"\nArthur Vargas Costa Pereira\n2011054197\nMeteoros - SPOJ/METEORO\n\nVerificar se as coordenadas passadas estão dentro do retângulo. Para fazer isto basta comparar se ambos\nos eixos do ponto passado estão entre os eixos do retângulo.\n\n\"\"\"\nimport math\n\nn = int(input())\nr = list(map(int, input().split()))\nr.sort()\narea = 0.0\nfor i in range(n):\n if(i % 2 == 0):\n area += r[i] * r[i]\n else:\n area -= r[i] * r[i]\n\nprint(\"%.10f\" % abs(area * math.pi))\n", "n=int(input())\r\nans=0\r\nk=1\r\nfor r in sorted(map(int,input().split())):\r\n ans+=rrk\r\n k=-1\r\nprint(abs(ans3.1416))\r\n", "import math\na = int(input())\nv = [int(i) for i in input().split()]\nres1 = 0\nres2 = 0\nfor i in range(a):\n v = sorted(v, reverse=True)\n if i%2 == 0:\n res1 += v[i]v[i]\n else:\n res2 += v[i]v[i]\n\n\nres = res1 - res2\n# print(res1, res2)\nprint(resmath.pi)\n", "# LUOGU_RID: 120107899\nn = int(input())\nrs = sorted(list(map(int, input().split())))[::-1]\nred = 0\nf = 0\nfor i in range(n):\n red += pow(rs[i], 2) pow(-1, f)\n f = not f\nprint(red * 3.1415926536)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse = True)\r\nans = 0\r\nfor i in range(n):\r\n if (i&1):\r\n ans -= l[i]2\r\n else:\r\n ans += l[i]2\r\nans = ans3.1415926536\r\nprint(ans)\r\n \r\n ", "\r\n\r\nfrom math import pi\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nif n%2 != 0:\r\n ans = pi(l[0]*2)\r\n\r\n for i in range(2,n,2):\r\n ans+=(pi((l[i]2) - l[i-1]2))\r\n\r\nelse:\r\n\r\n ans = 0\r\n\r\n for i in range(1,n,2):\r\n ans+=(pi((l[i]2) - l[i-1]2))\r\n\r\nprint(ans)", "from math import pi\r\nn=int(input())\r\nsum=0\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nfor i in range(0,len(arr)):\r\n if(i%2==1):\r\n sum-=arr[i]arr[i]\r\n else:\r\n sum+=arr[i]arr[i]\r\nprint(piabs(sum))", "from math import pi\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))[::-1]\r\ntotal = 0\r\nif n % 2 == 0:\r\n for i in range(0, n, 2):\r\n total += a[i]*2 pi - a[i+1]*2pi\r\n print(round(total, 10))\r\nelse:\r\n for i in range(0, n - 1, 2):\r\n total += a[i]*2 pi - a[i+1]*2pi\r\n print(round(total + a[-1]*2pi, 10))", "from math import pi\r\nn, s = int(input()), 0\r\nt = list(map(int, input().split()))\r\nt.sort(reverse = True)\r\nfor i in t:\r\n s = - (s + i * i)\r\nprint(abs(s) * pi)", "from math import pi\r\nn = int(input())+1\r\nradius = [0]+list(map(int, input().split()))\r\nradius.sort()\r\narea = lambda x: pixx\r\ni = 1\r\nif n%2:\r\n i += 1\r\ntot = 0\r\nwhile i<n:\r\n tot += area(radius[i])-area(radius[i-1])\r\n i += 2\r\nprint(tot)\r\n", "#157B\r\nfrom math import pi\r\nn = int(input())\r\nr = sorted(list(map(int, input().split(\" \"))))\r\nans = 0\r\nk = 1\r\nfor i in r:\r\n ans += kii\r\n k =-1\r\nprint(piabs(ans))\r\n", "#!/usr/bin/python3\r\nimport math\r\ndef circleArea(r):\r\n return rrmath.pi\r\nn = int(input())\r\nelements = list(map(int, input().strip().split()))\r\nelements.sort(reverse=True)\r\ntotA = 0\r\nfor index in range(0, len(elements)):\r\n if (index+1) % 2 == 0:\r\n totA -= circleArea(elements[index])\r\n elif (index+1) % 2 != 0:\r\n totA += circleArea(elements[index])\r\nprint(totA)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\narr=arr[::-1]\r\npi=3.1415926536\r\nans=0\r\nfor i in range(n):\r\n if(i&1==0):\r\n ans+=(arr[i]arr[i])\r\n else:\r\n ans-=(arr[i]arr[i])\r\nans=pians\r\n\r\nprint(\"{0:.10f}\".format(ans))", "n=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\na=t[::-1]\r\no=0\r\ne=0\r\nimport math\r\n\r\nfor k in range(1,n+1):\r\n if k%2==0:\r\n e+=a[k-1]2\r\n else:\r\n o+=a[k-1]2\r\n\r\nprint(round((o-e)math.pi,10))\r\n \r\n \r\n", "from math import pi\r\n\r\nn = int(input())\r\nraios = list(map(int, input().split(\" \")))\r\n\r\nraios.sort(reverse=True)\r\n\r\narea = [0]n\r\n\r\narea[0] = piraios[0]*2\r\n\r\nfor i in range(1,n):\r\n if i%2==0:\r\n area[i] = area[i-1] + piraios[i]*2\r\n else:\r\n area[i] = area[i-1] - piraios[i]2\r\n\r\nprint(area[-1])", "import math\r\n\r\nn = int(input())\r\ndata = sorted(map(int, input().split()), reverse=True) + [0]\r\ns = 0\r\nfor i in range(0, n, 2):\r\n s += (data[i]2 - data[i + 1]*2) math.pi\r\n\r\nprint(s)", "num = int(input())\r\nc = 0\r\np = list(map(int,input().split()))\r\np.sort()\r\np.reverse()\r\nk = 0\r\nfor i in p:\r\n if k == 0:\r\n c += i2\r\n k = 1\r\n elif k == 1:\r\n c -= i2\r\n k = 0\r\nprint(c3.1415926535897932384626433)\r\n \r\n", "import math\nqtd_circulos = int(input())\n\nsoma = 0\nareas = [int(v) for v in input().split()]\n\nareas.sort(reverse=True)\nfor i in range(qtd_circulos):\n if i%2 == 0:\n soma += (int(areas[i])2)\n if i%2 != 0:\n soma -= (int(areas[i])2)\n\nprint(round(math.pisoma, 10))\n\n\t \t \t\t \t\t \t\t \t\t \t \t \t \t\t\t\t\t", "#n = int(input())\r\n#n, m = map(int, input().split())\r\n#d = list(map(int, input().split()))\r\n\r\nimport math\r\nn = int(input())\r\nd = sorted(list(map(int, input().split())), reverse = True)\r\n\r\nr = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n r += math.pi * d[i]*2\r\n else:\r\n r -= math.pi d[i]2\r\nprint(r)\r\n\r\n\r\n\r\n", "n=int(input())\nr=input().split()\n\nr=[int(x) for x in r]\nr.sort(reverse=True)\n\narea=0\nfor index, element in enumerate(r):\n\tif index % 2 == 0:\n\t area=element2+area\n\telse:\n\t area=area-(element*2)\n\t \nprint(3.14159area)\n \t\t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t\t", "len1=int(input())\r\nlist1=list(map(int,input().rstrip().split()))\r\nlist1.sort()\r\nlist1=list1[::-1]\r\narea_red=list1[0]list1[0]3.1415926536\r\ni=1\r\nwhile(i<len1):\r\n if(i%2!=0):\r\n area_red-=3.1415926536list1[i]list1[i]\r\n else:\r\n area_red+=3.1415926536list1[i]list1[i]\r\n i+=1\r\nprint(area_red)\r\n ", "n = int(input())\na = list(map(int, input().split()))\n\n\nfrom math import pi\n\na.sort(reverse=True)\n\np = []\nm = []\n\ns = 0\nboolean = False\nfor i in a:\n boolean = not boolean\n if boolean:\n s += ii\n else:\n s -= ii\n\nprint(pis)", "import math\nn=int(input())\ns=list(map(int,input().split()))\ns.sort()\nsum=0\nx=1\nfor i in s:\n sum+=xii\n x=-1\n \nprint(math.piabs(sum))\n\t \t \t \t\t \t \t\t\t \t \t\t \t\t", "import math\n\nnum_rads = int(input())\nrads = [int(x) for x in input().split()]\n\nrads.sort()\n\npositive = 0\nnegative = 0\n\nfor i in range(num_rads):\n if num_rads % 2 == 0:\n if i % 2 == 0:\n negative += rads[i] * 2\n else:\n positive += rads[i] 2\n else:\n if i % 2 == 0:\n positive += rads[i] 2\n else:\n negative += rads[i] ** 2\n\nprint((positive - negative) * math.pi)\n\n\t\t \t \t\t \t\t\t\t\t \t\t \t\t \t\t \t\t\t\t", "n=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nsum=0\r\nif n%2!=0:\r\n sum=r[0]2\r\nfor i in range(n-1,0,-2):\r\n sum=sum+(r[i]2)-(r[i-1]*2)\r\nprint(sum3.1415926536)\r\n", "import math\r\nn = int(input())\r\nr = list(map(int,input().split()))\r\nr.sort()\r\na=0\r\nif(n%2==0):\r\n for i in range(0,n,2):\r\n a+=r[i+1]2 - r[i]2\r\nelse:\r\n for i in range(1,n,2):\r\n a+=r[i+1]2 - r[i]2\r\n a+=r[0]*2\r\nprint(\"{:0.10f}\".format(amath.pi))", "n,area,pi= int(input()),0,3.141592653589793\r\narr= list(map(int, input().split()))\r\narr.sort(),arr.insert(0,0)\r\nif n%2==1:\r\n for i in range(1,n+1,2):area+= piarr[i]arr[i]-piarr[i-1]arr[i-1]\r\nelse:\r\n for i in range(2, n+1,2): area+= piarr[i]arr[i]-piarr[i-1]arr[i-1]\r\nprint(area)", "pi=3.14159265358979323846264338\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nans = 0\r\nfor i in range(n):\r\n ans += (-1)*il[i]*2\r\nprint(anspi)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npi=3.1415926536\r\ncount=0\r\nsub=0\r\nfor i in range(n):\r\n if n%2==0:\r\n if i%2!=0:\r\n count+=(pi(l[i]2))\r\n else:\r\n sub+=(pi(l[i]*2))\r\n else:\r\n if i%2==0:\r\n count+=(pi(l[i]*2))\r\n else:\r\n sub+=(pi(l[i]2))\r\nprint(count-sub) \r\n \r\n \r\n \r\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)2+(y-d)*2)\ndef circle(x1, y1, x2,y2, r1, r2): \n \n distSq = (((x1 - x2) (x1 - x2))+ ((y1 - y2)* (y1 - y2)))(.5) \n \n if (distSq + r2 <= r1): \n return True\n else: \n return False\nn=I()\nl=L()\nl.sort(reverse=True)\nc=0\nfor i in range(0,n,2):\n if(i+1)<n:\n c+=(l[i]2-l[i+1]2)\n else:\n c+=l[i]2\n\nprint(mt.pic)\n \n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsum = 0\r\na.sort()\r\nfor i in range(n-1, -1, -1):\r\n s = math.pi a[i] * a[i]\r\n\r\n if n % 2 == 0:\r\n if i % 2 != 1:\r\n s = 0 - s\r\n else:\r\n if i % 2 == 1:\r\n s = 0 - s\r\n sum += s\r\nprint(sum)\r\n", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n%2!=0:\r\n l.insert(0,0)\r\nprint(sum((l[i+1]2-l[i]2)pi for i in range(len(l)-2,-1,-2)))", "n=int(input(''))\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nl=list(filter(lambda x:r.index(x)%2==0,r))\r\nk=list(filter(lambda x:r.index(x)%2!=0,r))\r\ns=sum(list(map(lambda x:x2,l)))\r\np=sum(list(map(lambda x:x2,k)))\r\nprint(3.1415926536abs(s-p))", "import math\r\n\r\nn = int(input())\r\nr = list(map(int, input().split()))\r\nk=0\r\nr.sort()\r\noutS = 0\r\nif n%2 == 0:\r\n color = 'blue'\r\nelse:\r\n color = 'red'\r\n outS += math.pi * (r[0]*2)\r\nfor i in range(1, n):\r\n if color == 'blue':\r\n outS += math.pi (r[i]2 - r[i-1]2)\r\n color = 'red'\r\n else:\r\n color = 'blue'\r\n\r\n\r\nprint(outS)\r\n", "# tc = int(input())\r\nfrom math import pi\r\n\r\n\r\ntc = 1\r\nwhile tc:\r\n # inp = [int(x) for x in input().split()]\r\n n = int(input())\r\n # n, c, q = inp[0], inp[1], inp[2]\r\n # s = input()\r\n # q = input()\r\n r = [int(x) for x in input().split()]\r\n r.sort()\r\n area_red = 0\r\n if n % 2 != 0:\r\n area_red += r[0] ** 2\r\n for i in range(1, n - 1, 2):\r\n area_red += (r[i+1]-r[i])(r[i+1]+r[i])\r\n else:\r\n for i in range(0, n, 2):\r\n area_red += (r[i+1]-r[i])(r[i+1]+r[i])\r\n print(piarea_red)\r\n tc -= 1\r\n", "n = int(input())\r\nk = list(map(int,input().split()))\r\nx=0\r\nk.sort()\r\np=3.1415926535897931\r\nfor i in range(n-1,n%2-1,-2):\r\n x+=(k[i]k[i]-k[i-1]k[i-1])\r\nx+=((k[0]k[0])(n%2))\r\nprint(px)", "from math import pi\r\nlength = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nif length%2!=0:\r\n arr.append(0)\r\n length += 1\r\nans = 0\r\nfor i in range(0,length,2):\r\n ans += pi(arr[i]arr[i] - arr[i+1]arr[i+1])\r\nprint(round(ans,10))\r\n\r\n", "import math\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n if i % 2 ==0:\r\n ans+=l[n-i-1]2\r\n else:\r\n ans-=l[n-i-1]2\r\n\r\nprint(ansmath.pi)", "import math\n\ndef calculaArea(entrada):\n valores = [int(valor) for valor in entrada]\n valores.sort()\n\n sum = 0\n\n if(len(valores)%2 != 0):\n\n for i in range(len(valores)):\n if(i % 2 == 0):\n sum += valores[i]2\n else:\n sum -= valores[i]2\n\n return round(sum * math.pi, 10)\n\n else:\n\n for i in range(len(valores)):\n if(i % 2 != 0):\n sum += valores[i]2\n else:\n sum -= valores[i]2\n\n return round(sum * math.pi, 10)\n\nnum = int(input())\nentrada = input().split()\n\nprint(calculaArea(entrada))\n\t\t\t \t \t\t \t\t\t \t\t \t\t \t\t \t \t", "import math\nn = int(input())\na = list(map(int,input().split(' ')))\na.sort()\nans = 0\nif (n%2 == 0):\n\tfor i in range(len(a)):\n\t\tif i%2 == 0:\n\t\t\tans-=a[i]2\n\t\telse:\n\t\t\tans+=a[i]2\nelse:\n\tfor i in range(len(a)):\n\t\tif i%2 == 0:\n\t\t\tans+=a[i]2\n\t\telse:\n\t\t\tans-=a[i]2\nprint (math.pians)", "input()\nL = sorted(int(x)int(x) for x in input().split())\nprint(3.1415926536 * (sum(L[::-2])-sum(L[-2::-2])))\n\n\t \t \t \t\t\t \t \t\t \t\t\t\t", "n = int(input())\r\narray = list(map(int,input().split()))\r\narray.sort(reverse=True)\r\nres = 0\r\npi = 3.1415926536\r\n\r\nfor i in range(n):\r\n if not i & 1:\r\n res += pi * ((array[i])*2)\r\n else:\r\n res -= pi ((array[i])2)\r\nprint(res)", "import math\na = int(input())\nb = list(map(int, input().split()))\nb.sort()\nt = 0\nfor i in range(a-1,-1,-2):\n if i == 0: \n t += b[0] 2\n else: \n t += (b[i] 2) - (b[i-1] 2)\nprint(t * math.pi)\n \t \t\t \t\t\t \t\t\t \t \t \t", "from math import pi\ndef solve(l):\n if len(l)==0:\n return 0\n return l[0]*2 - solve(l[1:])\n\nn = int(input())\nm = list(map(int, input().split(' ')))\nm.sort(reverse=True)\nprint(solve(m)pi)\n \t \t\t \t\t\t \t\t \t \t", "n=int(input())\npi=3.1415926536\na=sorted(list(map(int,input().split())))\na=[piii for i in a]\nans=0\nif n%2:\n\tans+=a[0]\n\tfor i in range(2,n,2):\n\t\tans+=a[i]-a[i-1]\nelse:\n\tfor i in range(1,n,2):\n\t\tans+=a[i]-a[i-1]\nprint(ans)\n", "import math\r\n\r\n#Leitura da entrada\r\nn = input()\r\nn = int(n)\r\nl = input().split()\r\nfor i in range(n):\r\n l[i] = float(l[i])\r\n#Ordena o vetor de entrada em ordem decrescente, já que a área entre o primeiro e o segundo circulo de maior raio é vermelha\r\nl.sort(reverse = True)\r\n#Adiciona os quadrados de cada par de raios em r1 e r2\r\nr1 = 0\r\nr2 = 0\r\ni = 1\r\nwhile i <= n:\r\n #Se nao for possivel formar o par, adiciona apenas em r1\r\n if i == n:\r\n r1 += (l[i-1])2\r\n else:\r\n r1 += (l[i-1])2\r\n r2 += (l[i])*2\r\n i += 2\r\n#Respota final\r\nrt = math.pi(r1-r2)\r\nprint('%.10f' % rt)", "import math\r\nn=int(input())\r\na= list(map(int, input().split()))\r\na.sort(reverse=True)\r\narea=0\r\nfor i in range(n):\r\n if i%2==0:area+=(math.pi)a[i]2\r\n else:area-=(math.pi)a[i]*2\r\nprint(area)\r\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\narea = 0\r\nif n%2==1:\r\n\ti = 0\r\nelse:\r\n\ti = 1\r\nwhile i<n:\r\n\tif i==0:\r\n\t\tarea = area+ math.pimath.pow(a[i],2)\r\n\telse:\r\n\t\tarea+= math.pi(math.pow(a[i],2)-math.pow(a[i-1],2))\r\n\ti+=2\r\nprint(area)", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl1.sort()\r\nx=3.1415926536\r\nif n%2!=0:\r\n area=x(l1[0]*2)\r\n for i in range(2,n,2):\r\n area+=x((l1[i]2)-(l1[i-1]2))\r\n print(area)\r\nelse:\r\n area=0\r\n for i in range(1,n,2):\r\n area+=x((l1[i]2)-(l1[i-1]2))\r\n print(area)\r\n \r\n\r\n", "import math\r\nn=int(input())\r\nflag=0\r\nc=list(map(int,input().split()))\r\nif n==1:\r\n\tprint(math.pic[0]c[0])\r\nelse:\r\n\ttot=0.0\r\n\tc=sorted(c)[::-1]\r\n\tfor i in range(len(c)):\r\n\t\tif flag==0:\r\n\t\t\ttot+=math.pic[i]c[i]\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\ttot-=math.pic[i]c[i]\r\n\t\t\tflag=0\r\n\tprint(tot)\r\n\t\r\n", "import math\nn = int(input())\nr = input().split()\nresult = 0\n\nfor i in range(n):\n r[i] = int(r[i])\nr.sort()\n\ni = 0\nif n%2 == 0:\n i += 1\n while i < n:\n result += math.pi r[i]*2 - math.pi r[i-1]*2\n i += 2\nelse:\n result += math.pi r[0]*2\n i += 2\n while i < n:\n result += math.pi r[i]*2 - math.pi r[i-1]*2\n i += 2\n\nprint(result)\n \t\t \t \t\t \t \t\t \t \t\t\t\t \t\t\t \t", "import math\n\nn = int(input())\nx = [int(i) for i in input().split()]\nx.sort(reverse = True)\na = 0\n\nfor i in range(n):\n\tr = x[i]\n\tif i%2 == 0:\n\t\ta += math.pirr\n\telse:\n\t\ta -= math.pirr\n\nprint(a)\n", "from math import pi\r\nn = input()\r\nl = sorted(list(map(int,input().split())))[::-1]\r\nans = 0\r\nsign = 0\r\nfor i in l:\r\n ans += ((-1)sign)pi(i2)\r\n sign+=1\r\n sign = sign%2\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\npi = 3.1415926536\r\nc = 0\r\nif(n%2 == 0):\r\n for i in range(n):\r\n if(i%2 == 0):\r\n c+= pi((a[i+1]2) - (a[i]2))\r\nelse:\r\n c+= pi(a[0]2)\r\n for i in range(1,n):\r\n if(i%2 != 0):\r\n c += pi((a[i+1]2) - (a[i]2))\r\nprint(c)", "pi = 3.1415926536\r\nn = int(input())\r\n\r\ncircles = list(map(int, input().split()))\r\n\r\ncircles = sorted(circles)\r\nanswer = 0\r\nfor i in range(0, len(circles)):\r\n if i % 2 == 0:\r\n answer += circles[-1-i]*2 pi\r\n else:\r\n answer -= circles[-1-i]*2 pi\r\nprint(answer)", "import math\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort(reverse=True)\r\ns=0\r\nfor i in range(0,len(A)-1,2):\r\n s+=A[i]2 - A[i+1]2\r\nif(n%2!=0):\r\n s+=A[n-1]*2\r\nprint(round(math.pi s,10))", "n = int(input())\r\ns = list(sorted(list(map(int, input().split()))))[::-1]\r\ns.append(0)\r\nimport math\r\nprint(math.pisum([s[i]2 - s[i+1]2 for i in range(0, n, 2)]))", "import math\r\nn=int(input())\r\n\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nra=0\r\nif n%2==1:\r\n ra=math.pi(l[0])*2\r\n for i in range(len(l)):\r\n if i%2==0 and i!=0:\r\n ra+=math.pi((l[i])2-(l[i-1])2)\r\n\r\nif n%2==0:\r\n for i in range(len(l)):\r\n if i%2==1:\r\n ra+=math.pi((l[i])2-(l[i-1])2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(ra)", "import math\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nres=0\r\nif n%2!=0:\r\n a.append(0)\r\nfor i in range(0,len(a),2):\r\n res+=(a[i]2-a[i+1]2)\r\nprint(resmath.pi)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nr=0\r\ntemp=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n r=0\r\n r=r+(l[i]2)\r\n else:\r\n r=r-(l[i]2)\r\n temp=temp+r\r\nif(n%2!=0):\r\n temp=temp+r\r\nprint(temp3.1415926536)", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n\r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n\r\n\r\nn = int(input())\r\nl = ilst()\r\n\r\npi = 3.1415926536\r\n\r\nl.sort(reverse = True)\r\nans = 0\r\nfor i in range(n):\r\n if i%2 == 0:\r\n ans += l[i]2\r\n else:\r\n ans -= l[i]2\r\nprint(anspi)\r\n\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn = I()\r\nr = sorted(L(),reverse=True)\r\narea = 0\r\npi = 3.1415926536\r\n\r\nfor i in range(n//2):\r\n area+= (r[2i]2) - (r[2i +1]*2)\r\n\r\n # area-= r[2i +1]2\r\n\r\n \r\nif (n%2!=0):\r\n area+=r[n-1]2\r\n\r\nprint(piarea)\r\n\r\n", "n = int(input())\npi = 3.1415926536\nr =sorted([int(i) for i in input().split()])[::-1]\nt = 0\n# print(r)\nfor i ,_ in enumerate(r):\n if i % 2 == 0 :\n if not i == len(r)-1:\n t += r[i]r[i] - r[i+1]r[i+1]\n else :\n t += r[i] r[i]\nprint(pi * t)\n", "pi=3.141592653589793\r\n\r\na=int(input())\r\nl=[]\r\nb=input().split()\r\nfor i in range(a):\r\n t=int(b[i])\r\n l.append(t)\r\n\r\nl.sort()\r\nl.reverse()\r\np=0\r\nfor i in range(a):\r\n if i%2==0:\r\n p=p+l[i]l[i]\r\n else:\r\n p=p-l[i]l[i]\r\n\r\nprint(ppi)", "import math\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR=sorted(R,reverse=True)\r\nA=0\r\nfor i in range(n):\r\n if i%2!=0:\r\n A=A-R[i]R[i]\r\n else:\r\n A=A+R[i]R[i]\r\nA=round(Amath.pi,10)\r\nprint(A)\r\n\r\n\r\n", "from math import pi\n\nn, r = int(input()), sorted((int(i) for i in input().split()), reverse=True)\nres = sum((-1) ** i * pi * x ** 2 for i, x in enumerate(r))\nprint(res)\n", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\np=math.pi\r\nred=0\r\nif n%2!=0:\r\n red+=pr[0]2\r\n c=0\r\nelse:\r\n c=1\r\nfor i in range(1,n):\r\n if c==1:\r\n red+=pr[i]*2-pr[i-1]2\r\n c=0\r\n else:\r\n c=1\r\nprint(red)\r\n\r\n \r\n \r\n", "import math\na=int(input())\nb=list(map(int,input().split()))\nb.sort()\nans=0\nfor i in range(a-1,-1,-2):\n if i==0: ans+=b[0]2\n else: ans+=b[i]2-b[i-1]2\nprint(ansmath.pi)\n\t\t \t \t\t \t \t\t\t\t\t \t\t\t\t \t \t", "pi= 3.1415926536\r\nn= int(input())\r\nl= list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nif n%2==0:\r\n for i in range(0, n-1,2):\r\n ans+= pi(abs(l[i]2- l[i+1]2))\r\n \r\n print(ans)\r\nelse:\r\n ans= pil[-1]l[-1]\r\n for i in range(0, n-2,2):\r\n ans+= pi(abs(l[i]2- l[i+1]2))\r\n print(ans)\r\n ", "import math\r\nI=lambda:list(map(int,input().split()))\r\nn = int(input())\r\na = sorted(I(), reverse = True)\r\narea = 0\r\nfor i in range(len(a)):\r\n if i%2 == 0:\r\n area+=a[i]2math.pi\r\n else:\r\n area-=a[i]*2math.pi\r\nprint(area)", "import math\r\n\r\nn=int(input())\r\npi=math.pi\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n ans+=(pil[i]l[i])\r\n else:\r\n ans-=(pil[i]l[i])\r\nprint(ans)\r\n", "import math \nqtd = input()\ncir = input()\n\ncircint = list(map(eval, cir.split()))\ncircint.sort()\nred = 0.0\nblue = 0.0\nfor i in range(len(circint)):\n if len(circint) % 2 != 0:\n if i % 2 == 0:\n red += math.pi * (circint[i]*2)\n else:\n blue += math.pi (circint[i]*2)\n else:\n if i % 2 != 0:\n red += math.pi (circint[i]*2)\n else:\n blue += math.pi (circint[i]*2)\n\n\nprint(red-blue)\n\n\n \t \t \t \t \t \t\t \t\t \t \t \t\t\t\t\t\t \t", "import math\nn = int(input())\narr = list(map(int, input().split()))\narr.sort(reverse=True)\ni = 1\ntot = 0\nfor x in arr:\n tot += ixx\n i = -1i\nprint(totmath.pi)\n", "from math import \r\nn=int(input())\r\ns=list(map(int,input().rsplit()))\r\ns.sort(reverse=True)\r\na = 0\r\nif n%2!=0:\r\n a=pis[n-1]2\r\nfor i in range (0,n,2):\r\n a = a+pi(s[i]2-s[i-1]2)\r\nprint(a)", "def mi():\r\n\treturn map(int, input().split())\r\nn = int(input())\r\na = list(mi())\r\na.sort(reverse=True)\r\nans = 0\r\ns = -1\r\nfrom math import pi\r\nfor r in a:\r\n\ts=-1\r\n\tans+=pirrs\r\nprint (ans)", "import math\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\npi = math.pi\r\nans = 0\r\nif n % 2 == 0:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans -= a[i]*2 pi\r\n continue\r\n ans += a[i]*2 pi\r\nelse:\r\n for i in range(n):\r\n if i % 2 != 0:\r\n ans -= a[i]*2 pi\r\n continue\r\n ans += a[i]*2 pi\r\nprint(ans)", "from math import pi\r\nn=input()\r\nliste=input().split(\" \")\r\nliste=[ int(radius) for radius in liste]\r\nliste.sort(reverse=True)\r\n\r\narea=0\r\nfor i in range(len(liste)):\r\n area+= -1(i%22-1)liste[i]2\r\narea=pi\r\n\r\nprint(area)", "from math import pi\r\nn=int(input())\r\na=list(map(int,input().rstrip().split()))\r\na.sort(reverse=True)\r\nsol=0\r\nfor i in range(n):\r\n if i%2==0:\r\n sol+=(pia[i]a[i])\r\n else:\r\n sol-=(pia[i]a[i])\r\nprint(sol)", "import math\ninput()\na = sorted(list(map(int,input().split(' '))))\nfor i in range(len(a)):\n\ta[i]=a[i]*2\nprint (math.pi(sum(a[::-2])-sum(a[-2::-2])))", "import math\nn = int(input())\n\nR = list(map(int, input().split()))\nR = sorted(R)\nsum = 0\ncont = 0\nfor ri in range(len(R)):\n if cont %2 == 0:\n sum+= R[ri]2\n else:\n sum-= R[ri]2\n cont += 1\n\nif n&1:\n print(math.pi * sum)\nelse:\n print(- math.pi * sum)\n \t \t\t\t \t\t \t\t\t\t \t \t \t\t", "a = int(input())\r\nb = list(map(int, input().split()))\r\nimport math\r\nb = sorted(b)\r\nk = 0\r\nS = 0\r\nif a % 2 == 0:\r\n for i in range(0,len(b),1):\r\n if i%2 == 0:\r\n S -= math.pi * (b[i]*2)\r\n if i%2 != 0:\r\n S += math.pi (b[i]*2)\r\nif a % 2 != 0:\r\n for i in range(0,len(b),1):\r\n if i%2 == 0:\r\n S += math.pi (b[i]*2)\r\n if i%2 != 0:\r\n S -= math.pi (b[i]*2)\r\n\r\nprint(S)\r\n", "import math\nn=int(input())\nl=list(map(int, input().split()))\nif n==1:\n print(math.pi l[0] * l[0])\nelse:\n l.sort(reverse=True)\n a=l[0:n:2]\n b=l[1:n:2]\n s=0\n for i in a:\n s+=i2\n for j in b:\n s-=j2\n print(math.pi * s)", "n = int(input())\nradii = list(map(int, input().split()))\nradii.sort()\nradii.reverse()\nr = 0\nfor i, radius in enumerate(radii):\n radius = radius\n if i % 2 == 1:\n radius = -1\n r += radius\nimport math\nprint(math.pir)\n", "from math import pi\r\ntotal = int(input())\r\nL =(int(x) for x in input().split())\r\nL=sorted(ii for i in L)\r\na= sum(L[::-2])\r\nb=sum(L[-2::-2])\r\nprint(pi * (a-b))", "from heapq import \r\nfrom queue import \r\nimport sys, math, bisect\r\n\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(int(1)):\r\n N = inl()[0]\r\n A = sorted(inl(), reverse=True)\r\n # Care A is sorted\r\n\r\n redArea = 0\r\n for i in range(0, N, 2):\r\n if i == N - 1:\r\n redArea += math.pi * pow(A[i], 2)\r\n else:\r\n redArea += math.pi * (pow(A[i], 2) - pow(A[i + 1], 2))\r\n\r\n print(redArea)\r\n", "import math\ndef main(a):\n\ta= sorted(a,reverse=True)\n\ts=0\n\tfor i in range(len(a)):\n\t\tif i%2==0:\n\t\t\ts+=a[i]2\n\t\telse:\n\t\t\ts-=a[i]2\n\tprint(math.pi s)\n\n\n\n# t = int(input(''))\n# for i in range(t):\n# \t#l,r = list(map(int,input(\"\").strip().split()))\n# \ts = input('')\n# \tmain(s)\nn= int(input())\na = list(map(int,input(\"\").strip().split()))\nmain(a)", "count = 0\nn = int(input())\nradii = [int(n) for n in input().split()]\nradii.sort(reverse=True)\nfor number in radii:\n count = -(count + number number)\nprint(abs(count) * 3.1415926535)\n \t\t\t\t\t \t\t\t \t \t \t\t\t \t\t", "from math import pi\r\nn = int(input()) \r\na = list(map(int,input().split()))\r\na.sort()\r\nfor i in range(len(a) - 2, - 1, -2):\r\n a[i] =-1\r\nprint(sum(pi x * x * ( - 1 if x < 0 else 1) for x in a))\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\n\n\ndef solution():\n n = int(input())\n arr = list(map(int, input().split()))\n arr.sort(reverse=True)\n res = 0\n for i in range(len(arr)):\n cur = arr[i]*2\n if i%2 == 0:\n res += cur\n else:\n res -= cur\n print(resmath.pi)\n \n\n\n\n\n\n\n\n\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n\n\n\n\n\"\"\"\n num = int(input())\n a,b = map(int, input().split())\n arr = list(map(int, input().split()))\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10*9 + 7\n\nfor di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:\n ni = i + di\n nj = j + dj\n if not (0<= ni < len(grid) and 0<= nj < len(grid[0])):\n continue\n\ndef gcd(a,b):\n if a < b: a,b = b,a\n if b == 0: return a\n return gcd(a%b,b)\n\"\"\"\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nlist1=[ii for i in list1]\r\ndata1,data2=0,0\r\nfor i in range(len(list1)):\r\n if i%2==0:\r\n data1+=list1[i]\r\n else:\r\n data2+=list1[i]\r\n\r\nprint(abs(data1-data2)(3.1415926536))", "#157B (81No. Problem B)\r\nimport math\r\nc = int(input())\r\nr = sorted(list(map(int,input().split())),reverse=True)\r\nres = 0\r\nif (c%2 == 0):\r\n for j in range(0,c-1,2):\r\n res+= (r[j]2-r[j+1]2)\r\nelse : \r\n res = r[-1]2\r\n for j in range(0,c-2,2):\r\n res+= (r[j]2-r[j+1]2)\r\n\r\nres= math.pi\r\nprint(res)", "import math\r\nn=int(input())\r\nA=0\r\nr=[0]+list(map(int,input().split()))\r\nr.sort()\r\nif(n%2!=0):\r\n i=0\r\n while(i<n):\r\n A=A+3.1415926536(-(r[i]2)+(r[i+1]2))\r\n i=i+2\r\nelse:\r\n i=1\r\n while(i<n):\r\n A=A+3.1415926536(-(r[i]2)+(r[i+1]2))\r\n i=i+2\r\nprint(A) ", "from math import pi\n\n\ndef main():\n input()\n l = sorted(map(int, input().split()),reverse=True)\n print((sum(_ * _ for _ in l[::2]) - sum(_ * _ for _ in l[1::2])) * pi)\n\n\nif __name__ == '__main__':\n main()", "# -- coding: utf-8 --\n'''\nNome: Ivan Rosa Soares Júnior\nMatricula: 2015083590\nSolução: Orderna os raios do maior para o menor e calcula a soma das areas\nalternando o sinal (os termos pares com sinal positivo).\n'''\n\nimport sys\nfrom math import pi\n\n_ = next(sys.stdin)\n\ns = 0\n\nRs = list(reversed(sorted(map(float, next(sys.stdin).strip().split()))))\nfor i, r in enumerate(Rs):\n\tif i % 2 == 0: s += pi * r * r\n\telse: s -= pi * r * r\n\nprint(s)\n", "import math\nn = int(input())\nraios = input().split(\" \")\n\nlista = []\n\nfor i in raios:\n lista.append(int(i))\n\nlista = sorted(lista, reverse=True)\n\nlistaArea = []\n\narea = 0\n\nfor i in range(0, n, 2):\n \n if(i == n-1):\n area += math.pi * lista[i] * lista[i]\n else:\n area += (math.pi * lista[i] * lista[i] - (math.pi * lista[i+1] * lista[i+1])) \n\n \nprint(area)\n \t\t \t \t \t\t \t\t\t \t\t \t\t\t\t \t \t", "from math import pi\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = 0\r\nif(n%2==1):\r\n ans = piarr[0]arr[0]\r\n i = 1\r\n while(i<n):\r\n ans+= pi(arr[i+1]2 - arr[i]2)\r\n i+=2\r\nelse:\r\n i = 0\r\n while(i<n):\r\n ans+= pi(arr[i+1]2 - arr[i]2)\r\n i+=2\r\nprint(round(ans,10))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\npi=3.1415926536\r\nans=0\r\nfor i in range(n):\r\n if(i&1):\r\n ans-= pilst[i]lst[i]\r\n else:\r\n ans+=pilst[i]lst[i]\r\nprint(ans)", "n = int(input())\r\nradius = list(map(int, input().split()))\r\nradius.sort(reverse = True)\r\narea = 0\r\nfor i in range(n):\r\n\tif i%2 == 0:\r\n\t\tarea += (radius[i]radius[i])\r\n\telse:\r\n\t\tarea -= (radius[i]radius[i])\r\nprint(area3.1415926536)", "\r\nif __name__ == '__main__':\r\n qtdCirculos = int(input())\r\n raios = [int(x) for x in input().split()]\r\n raios.sort()\r\n\r\n pi = 3.1415926536\r\n\r\n area = 0\r\n contou = False\r\n for i in range(len(raios)-1, -1, -1):\r\n r = raios[i]\r\n if not contou:\r\n area += pirr\r\n contou = True\r\n else:\r\n area -= pirr\r\n contou = False\r\n\r\n print(area)\r\n\r\n", "from math import pi\r\nn= int(input())\r\na=[]\r\na = list(map(int, input().split()))\r\ni=0\r\ns=0\r\na.sort()\r\na.reverse()\r\nwhile i<n:\r\n s+=pow(a[i],2)pow(-1,i)\r\n i+=1\r\n\r\nprint(round(spi,10))\r\n\r\n", "import math\na = int(input())\nb = input().split()\nfor i in range (0, len(b)):\n b[i]= int(b[i])\nb.sort(reverse = True)\ntotal =0\nalternator =1\nfor i in b:\n total += (math.pi i ** 2) alternator\n alternator = -1\n \nprint(total)\n \t \t \t\t \t \t\t \t \t \t\t \t\t\t", "n = int(input())\nk = input()\nl = [int(x) for x in k.split()]\nl.sort()\ny = 0\nfor i in range(0, len(l)):\n if i % 2 == 0:\n y += l[i]2\n else:\n y -= l[i]2\ny = 3.141592654\nprint(abs(y))\n\t\t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "n=int(input())\nm=input().split()\no=[]\nfor x in m:\n y=int(x)int(x)\n o.extend([y])\no=sorted(o)\nz=(3.1415926536(sum(o[::-2])-sum(o[-2::-2])))\nprint(z)\n \t\t\t \t \t \t \t \t\t\t \t \t \t", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=get_list()\r\n\r\na.sort()\r\na=list(reversed(a))\r\n\r\ns=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n s+=a[i]2\r\n else:\r\n s-=a[i]2\r\n\r\nprint(s3.1415926536)\r\n\r\n\r\n", "n = int(input())\r\nr = list(map(int,input().split())) + [0]\r\nred = 0\r\nr.sort()\r\nr = r[::-1]\r\nfor i in range(n):\r\n if i % 2 : continue\r\n red += r[i]2 - r[i+1]2\r\nprint(red * 3.1415926535)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nsum=0\r\nif n%2!=0:\r\n sum=arr[0]2\r\nfor i in range(n-1,0,-2):\r\n sum=sum+(arr[i]2)-(arr[i-1]*2)\r\nprint(sum3.1415926536)\r\n", "import math\n\nn = int(input())\nline = input()\ncircle = [int(e) for e in line.split()]\ncircle.sort()\n\npi = math.pi\narea = 0\n\nfor i in range(n-1, -1, -1):\n red = (pi * (circle[i] ** 2))\n if i % 2 == 0:\n area += red\n else:\n area -= red\n\nif area < 0:\n area = area * -1\n\nprint(f\"{area:.10f}\")\n\n\t \t\t \t \t\t\t \t\t\t\t\t\t \t", "pi = 3.1415926\r\nn = int(input())\r\narr = [int(x)int(x) for x in input().split()]\r\narr.sort()\r\nif n %2 == 0:\r\n add = 0\r\n for i in range(n//2):\r\n add += pi(arr[2i+ 1] - arr[2i])\r\n print(add) \r\nelse:\r\n add = piarr[0]\r\n for i in range(1,n//2 +1):\r\n add += pi(arr[2i] - arr[2i-1])\r\n print(add) \r\n\r\n\r\n \r\n", "from math import pi\r\n\r\nn = int(input())\r\nnums = sorted(list(map(int , input().split())), reverse= True)\r\nresult = 0\r\nfor i in range(0, n, 2):\r\n result += ((nums[i] ** 2) * pi - (nums[i+1] ** 2 ) * pi) if i < n-1 else (nums[i] ** 2) * pi\r\n\r\n\r\nprint(result)", "from math import pi\n\n\ndef main():\n n = int(input())\n l = sorted(map(int, input().split()))\n sign = (-1, 1)[len(l) & 1]\n res = 0\n for r in l:\n res += r * r * sign\n sign = -1\n print(res pi)\n\n\nif __name__ == '__main__':\n main()", "__author__ = 'Rajan'\r\n\r\nn = int(input())\r\nr = sorted(list(map(int,input().split())))\r\n\r\nPI = 3.1415926536\r\n\r\nans = 0\r\n\r\nif n%2==0:\r\n for i in range(1,n,2):\r\n ans += (r[i]2-r[i-1]2)\r\nelse:\r\n ans+= r[0]2\r\n for i in range(2,n,2):\r\n ans+= (r[i]2-r[i-1]*2)\r\n\r\nans= PI\r\n\r\nprint(ans)\r\n", "import math\nn=int(input())\nr=list(map(int,input().split()))\nr.sort()\nr.reverse()\nresult = 0\nm=1\nfor i in r:\n result += mii\n m=-m\nprint(math.piresult)\n \t\t\t\t\t\t\t \t \t\t \t \t \t \t\t \t\t", "def zip_sorted(a,b):\n\n\t# sorted by a\n\ta,b = zip(sorted(zip(a,b)))\n\t# sorted by b\n\tsorted(zip(a, b), key=lambda x: x[1])\n\n\treturn a,b\n\nimport sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\nS = lambda : list(map(str,input().split()))\n\nimport math\n\nt,=I()\nn = I()\n\nn = sorted(n)\nn1 = [0]+n\n\narea = 0\n\ni = 0\n\nn2 = len(n1)\n\nwhile i<n2:\n\n\tif n2-i-2>=0:\n\n\t\tarea = area + (((math.pi)(n1[n2-i-1])(n1[n2-i-1])) - ((math.pi)(n1[n2-i-2])(n1[n2-i-2])))\n\n\ti = i+2\n\nprint(area)\n\n\n\n'''\nfor i in range(n):\nfor j in range(n):\nfor k1 in range(len(a)):\nfor k2 in range(len(a)):\nfor k3 in range(len(a)):\n\n'''", "import math\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR.sort()\r\narea_red=0\r\narea_blue=0\r\nfor i in range(n-1,-1,-2):\r\n area_red+=math.piR[i]R[i]\r\nfor i in range(n-2,-1,-2):\r\n area_blue+=math.piR[i]R[i]\r\nprint(abs(area_blue-area_red))", "import math\nA = int(input())\nB = input().split()\nNumList = []\n\nTotal_Area = 0\n\nif 1 <= A <= 100:\n for i in B:\n NumList.append(int(i))\nsorted_list = sorted(NumList)\nsorted_list.reverse()\n\nred = []\nblue = []\nfor i in sorted_list[::2]:\n red.append(i)\nfor i in sorted_list[1::2]:\n blue.append(i)\nif len(red) != len(blue):\n blue.append(0)\n\npi = math.pi\ndef circle(a):\n return pi * (a ** 2)\n\nfor i in range(0,len(red)):\n Area = circle(red[i]) - circle(blue[i])\n Total_Area += Area\n\nprint(Total_Area)\n\n#https://stackoverflow.com/questions/2990121/how-do-i-loop-through-a-list-by-twos\n \t\t \t \t \t\t \t\t\t\t\t \t \t\t\t\t \t", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=[ii for i in l]\r\nx.sort(reverse=True)\r\nc=0\r\nprint(pi(sum(x[::2])-sum(x[1::2])))", "import math\r\nn = int(input())\r\n\r\narr = [int(x) for x in input().split(' ')]\r\n\r\nres = 0\r\narr.sort()\r\n\r\ni = n-1\r\nwhile i >= 0:\r\n\tif i != 0:\r\n\t\tres += arr[i]arr[i] - arr[i-1]arr[i-1]\r\n\telse:\r\n\t\tres += arr[i]arr[i]\r\n\ti -= 2\r\n\r\nres = math.pi\r\nprint(res)", "import math\r\n\r\ndef get_n():\r\n return int(input())\r\n\r\ndef get_int_vector():\r\n return [int(x) for x in input().split()]\r\n\r\ndef list2string(list):\r\n result = []\r\n for i in list:\r\n result.append(str(i))\r\n return ':'.join(result)\r\n\r\ndef string2vector(string):\r\n return [int(x) for x in string.split(':')]\r\n\r\nn = get_n()\r\nrad = get_int_vector()\r\n\r\nrad.sort(reverse=True)\r\nresult = 0\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0:\r\n result += rad[i]2-rad[i+1]2\r\n\r\nif n % 2 == 1:\r\n result += rad[-1]*2\r\n\r\nprint(\"{:.5f}\".format(resultmath.pi))\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\ns=0\r\nfor i in range(n-1,-1,-2):\r\n if(i==0):\r\n s+=math.pil[i]l[i]\r\n else:\r\n s+=math.pi(l[i]l[i]-l[i-1]l[i-1])\r\nprint(s)", "import math\r\n\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\n\r\narea = 0\r\nmult = 1\r\n\r\nfor i in range(0,n):\r\n area += mult(a[i]*2)\r\n mult = -1\r\n\r\nprint(areamath.pi)\r\n", "\"\"\"http://codeforces.com/problemset/problem/157/B\"\"\"\nfrom math import pi\n\nif __name__ == '__main__':\n input()\n r = list(map(int,input().split()))\n r.sort(reverse=True)\n s = sum([r[i]2 (-1)*(i&1) for i in range(len(r))])\n print(s pi)\n", "import math\n\nradiiNumber=int(input())\nradiiStrs=input().split(' ')\n\nradii=[]\nfor radiusStr in radiiStrs:\n radii.append(int(radiusStr))\nradii.sort()\n\npiCoefficient=0\npyIndex=len(radii)-1\nwhile pyIndex>0:\n piCoefficient+=radii[pyIndex]2-radii[pyIndex-1]2\n pyIndex-=2\n\nif pyIndex==0:\n piCoefficient+=radii[0]*2\n\nredArea=math.pipiCoefficient\n\nprint(redArea)\n\t\t\t \t\t \t \t\t\t\t \t \t\t \t\t\t", "from math import \r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\na=0\r\nif n%2==0:\r\n for i in range(1,n,2):\r\n a=a+pi(arr[i]2-arr[i-1]2)\r\nelse:\r\n a=a+piarr[0]2\r\n for i in range(2,n,2):\r\n a=a+pi(arr[i]2-arr[i-1]2)\r\nprint(a)\r\n \r\n \r\n ", "import sys\r\nimport math\r\n#import random\r\nsys.setrecursionlimit(100000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\nara=inara()\r\n\r\nara.sort(reverse=True)\r\n\r\nans=0\r\n\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tans+=math.piara[i]ara[i]\r\n\telse:\r\n\t\tans-=math.piara[i]ara[i]\r\n\r\nprint(ans)\r\n", "from sys import stdin,stdout\r\nfrom math import pi\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\naa=lambda r:pirr\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=sorted(lst(),reverse=True)\r\n ans=0\r\n for i in range(n):\r\n if i&1:ans-=aa(a[i])\r\n else:ans+=aa(a[i])\r\n print(ans)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\nn = int(input())\r\narr = sorted(map(int, input().split()), reverse=True)\r\n\r\npi = 3.1415926536\r\n\r\nans = 0\r\n\r\nfor i, n in enumerate(arr):\r\n if i % 2:\r\n ans -= pin2\r\n else:\r\n ans += pin*2\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\ntemparr = input()\r\ntemparr = temparr.split()\r\narr = []\r\nfor i in temparr:\r\n arr.append(int(i))\r\narr = sorted(arr)\r\narr = arr[::-1]\r\nans = 0 \r\nfor j, i in enumerate(arr):\r\n if j & 1 == 0 :\r\n ans += i i \r\n else:\r\n ans -= i * i \r\nprint(ans * 3.1415926536)\r\n ", "n=int(input())\r\ns=0\r\nX=[int(x) for x in input().split(\" \")]\r\nX.sort(reverse=True)\r\nfor i in range(n):\r\n s=s+(-1)*(i)X[i]X[i]\r\nprint(3.1415926536s) ", "import math\r\n\r\nn = int(input())\r\nradius = list(map(int, input().split()))\r\nradius.sort()\r\narea = 0\r\nif n % 2 == 0:\r\n for i in range(1, n, 2):\r\n area += radius[i]*2 math.pi - radius[i - 1]*2 math.pi\r\nelse:\r\n area += radius[0]*2 math.pi\r\n for i in range(2, n, 2):\r\n area += radius[i]*2 math.pi - radius[i - 1]*2 math.pi\r\n\r\nprint(area)\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nb = []\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i % 2 != 0:\r\n b.append('r')\r\n else:\r\n b.append('b')\r\nfor i in range(n):\r\n if b[i] == 'r':\r\n ans += math.pia[i]2\r\n else:\r\n ans -= math.pia[i]*2\r\nprint(ans)\r\n", "# cook your dish here\r\nimport math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n \r\n a[i]=(math.pi)(a[i]*2)\r\na=sorted(a)\r\nc=0\r\nif (n&1)==1:\r\n for i in range(n):\r\n if i&1==0:\r\n if i==0:\r\n c+=a[i]\r\n else:\r\n c+=a[i]-a[i-1]\r\nelse:\r\n for i in range(n):\r\n if i&1==1:\r\n c+=a[i]-a[i-1]\r\nprint(c)\r\n", "import math\nn = int(input())\nr = input().split()\nfor i in range(n):\n r[i] = int(r[i])\nr.sort(reverse=True)\narea = 0\nfor i in range(0, n-2, 2):\n area += math.pi (r[i]2 -r[i+1]2)\nif n % 2 == 1:\n area += math.pi * r[-1]*2\nelse:\n area += math.pi (r[-2] 2 - r[-1] 2)\nprint(area)\n \t \t\t \t\t\t \t \t\t\t \t \t \t \t\t\t", "from math import \r\na = int(input())\r\nb = list(map(int,input().split()))\r\nb.sort(reverse= True)\r\nl = 0\r\nif a%2 != 0:\r\n for y in range(0,a-1,2):\r\n l += round((pi (b[y]*2))- (pi (b[y+1]*2)),10)\r\n\r\n l += round(pi (b[-1]*2),10)\r\n print(l)\r\n\r\n\r\nelse:\r\n for y in range(0,a,2):\r\n l += round((pi (b[y]*2))- (pi (b[y+1]2)),10)\r\n\r\n print(l)\r\n\r\n\r\n", "import re\nimport math\n\nin1 = int(input())\nin2 = [int(x) for x in re.split(\"\\\\s\", input())]\n\nin2.sort(reverse=True)\n\ncount = 0\nalt1 = True\nfor x in in2:\n if alt1:\n count += x2\n alt1 = False\n else:\n count -= x*2\n alt1 = True\n\nprint(math.picount)\n \t\t\t \t \t \t \t \t\t\t\t \t \t \t \t \t\t", "import math\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\npi = math.pi\r\nans = 0\r\nk = 1\r\nfor i in range(n-1, -1, -1):\r\n ans += k * a[i]*2 pi\r\n k = -k\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\npi=3.1415926536\r\nl=sorted(l)\r\ni=n-1\r\nc,b=0,1\r\nwhile i>-1: \r\n if b:\r\n b=0\r\n c+=(l[i]2)\r\n else:\r\n b=1\r\n c-=(l[i]2)\r\n i-=1\r\n\r\nprint('{:.10f}'.format(pic))\r\n", "from math import \r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\n\r\nsum=0\r\n\r\nif(n%2==1):\r\n for i in range(0,n-2,2):\r\n sum+=pow(a[i],2)-pow(a[i+1],2)\r\n sum+=pow(a[n-1],2) \r\nelse:\r\n for i in range(0,n-1,2):\r\n sum+=pow(a[i],2)-pow(a[i+1],2)\r\n \r\nprint(round(pisum,10))", "from sys import stdin, stdout\r\nfrom math import pi\r\n\r\nintn = lambda : int(stdin.readline())\r\nstrs = lambda : stdin.readline()[:-1]\r\nlstr = lambda : list(stdin.readline()[:-1])\r\nmint = lambda : map(int, stdin.readline().split())\r\nlint = lambda : list(map(int, stdin.readline().split()))\r\nout = lambda x: stdout.write(str(x)+\"\\n\")\r\nout_ = lambda x: stdout.write(str(x)+' ')\r\n\r\ndef main():\r\n n = intn()\r\n a = sorted(lint(), reverse=True)\r\n area = 0\r\n for i in range(n):\r\n if i&1:\r\n area -= pia[i]a[i]\r\n else:\r\n area += pia[i]a[i]\r\n out(area)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "if __name__ == '__main__':\n input()\n L = sorted(x2 for x in map(int, input().split()))\n print(3.1415926536 (sum(L[::-2]) - sum(L[-2::-2])))\n\t\t\t \t \t\t\t\t \t \t \t\t\t \t \t", "#link: https://codeforces.com/problemset/problem/157/B\nimport math \n\nn = int(input())\n\nraios = list(map(int, input().split(\" \")))\nraios.sort(reverse=True)\nr = math.pi\nquadrados_pares = []\nquadrados_impares = []\n\nfor x in range(0,len(raios)):\n\tif x % 2 == 0:\n\t\tquadrados_pares.append(raios[x]2)\n\telif x % 2 == 1:\n\t\tquadrados_impares.append(raios[x]2)\n\nresultado = sum(quadrados_pares) - sum(quadrados_impares)\narea_resultante = resultado * r\n\nprint(area_resultante)\n \t \t\t\t\t \t\t \t\t\t\t \t \t \t \t", "from math import pi\n\nn = int(input())\narr = list(map(float, input().split()))\narr = sorted(arr)\n\narea = 0\nif(n % 2):\n area += pi * arr[0]2\n i = 1\n while(i < len(arr)):\n if not (i % 2):\n area += (arr[i]2 -arr[i - 1]*2) pi\n i += 1\nelse:\n i = 1\n while(i < len(arr)):\n if (i % 2):\n area += (arr[i]2 -arr[i - 1]2) * pi\n i += 1\nprint(area)", "import math\na=int(input())\nk=sorted(list(map(int,input().split())))\nc=0\nfor i in range(len(k)):\n if i%2==0:\n c+=k[i]2\n else:c-=k[i]2\nprint( abs(c(math.pi)))\n\t\t \t \t \t \t\t \t\t \t \t\t \t \t\t", "import math\nn = int(input())\nlist = [int(i) for i in input().split()][:n]\nlist.sort(reverse=True)\ni = 0\narea = 0\nwhile i < n:\n if ((i + 1) == n):\n area += ((list[i]2) math.pi)\n else:\n area += (((list[i]*2) math.pi) - ((list[i+1]*2) math.pi))\n i += 2\nprint(area)\n\t\t \t\t \t \t\t \t \t\t \t", "def red_area(num_circles, arr):\r\n arr.sort()\r\n\r\n red_area = 0\r\n\r\n if num_circles % 2 == 0:\r\n for i in range(0, num_circles):\r\n if i % 2 != 0:\r\n red_area += circle_area(arr[i])\r\n else:\r\n red_area -= circle_area(arr[i])\r\n\r\n else:\r\n for i in range(0, num_circles):\r\n if i % 2 == 0:\r\n red_area += circle_area(arr[i])\r\n else:\r\n red_area -= circle_area(arr[i])\r\n\r\n return red_area\r\n\r\n\r\ndef circle_area(rad):\r\n return (rad * rad) * 3.1415926536\r\n\r\n\r\nif __name__ == \"__main__\":\r\n number_of_inputs = int(input())\r\n array = input().split()\r\n array = list(map(int, array))\r\n\r\n print(red_area(number_of_inputs, array))\r\n", "import sys\nfrom math import pi\nf = sys.stdin\n# f = open(\"input.txt\", \"r\")\nn = int(f.readline())\nr = [int(i) for i in f.readline().strip().split()]\nr.sort()\nr.insert(0, 0)\nres = 0\nfor i in range(-1, -len(r), -2):\n res += r[i]2 - r[i-1]2\nprint(respi)", "from math import pi\r\n\r\nnum = int(input())\r\nlis = input().split()\r\nlis = [int(x) for x in lis]\r\n\r\nlis.sort(reverse=True)\r\nresult = []\r\n\r\nfor i in range(0, (len(lis))-1, 2):\r\n result.append((lis[i]2) - (lis[i+1]2))\r\nif len(lis) % 2 != 0:\r\n result.append(lis[len(lis)-1]2)\r\n\r\nsum = 0\r\nfor i in range(len(result)):\r\n sum += pi result[i]\r\n\r\nprint(sum)\r\n", "##B\r\nfrom math import pi\r\nsqr=lambda x: xx\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR.sort()\r\nR.reverse()\r\nred=[]\r\nblue=[]\r\nfor i in range(n):\r\n if i%2:\r\n red.append(-R[i])\r\n else:\r\n blue.append(R[i])\r\nred=list(map(sqr,red))\r\nblue=list(map(sqr,blue))\r\nr=abs(sum(red)-sum(blue))\r\nprint(rpi)\r\n\r\n \r\n", "from math import pi\r\nn = int(input())\r\n\r\nradii = list(map(int, input().split()))\r\nradii.sort(reverse=True)\r\narea_sum = 0\r\n\r\nif n%2:\r\n area_sum += (radii[n-1]2)\r\n\r\nfor i in range(1, n, 2):\r\n area_sum += radii[i-1]2 - radii[i]*2\r\nprint(area_sumpi)\r\n", "import math\r\npi = math.pi\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nf = 1\r\na = 0\r\nk = 0\r\nwhile n:\r\n n -= 1\r\n r = arr[k]\r\n k += 1\r\n if f == 1:\r\n a += pirr\r\n f = 0\r\n else:\r\n f = 1\r\n a -= pirr\r\n\r\nprint(a)\r\n", "def ordena_merge(lista):\n if len(lista) > 1:\n meio = len(lista)//2\n left = [lista[i] for i in range(meio)]\n right = [lista[j] for j in range(meio,len(lista))]\n\n ordena_merge(left)\n ordena_merge(right)\n\n i = j = k = 0\n\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n lista[k] = left[i]\n i += 1\n else:\n lista[k] = right[j]\n j += 1\n k += 1\n\n while i < len(left):\n lista[k] = left[i]\n i += 1\n k += 1\n while j < len(right):\n lista[k] = right[j]\n j += 1\n k += 1\n\nn = int(input())\nradii = input().split()\nradii = [int(radii[i]) for i in range(n)]\nordena_merge(radii)\narea = 0\nfor j in range(n-1, -1, -1):\n if n%2 == 0:\n if j%2 != 0:\n area += radii[j]2\n else:\n area -= radii[j]2\n else:\n if j%2 == 0:\n area += radii[j]2\n else:\n area -= radii[j]2\nprint(area3.1415926536)\n \t\t\t \t \t \t\t\t \t \t \t\t \t \t\t", "from math import pi\r\nn = int(input())\r\narr = [0] + list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nres = 0\r\nfor i in range(0, n, 2):\r\n\tres += pi (arr[i] * arr[i] - arr[i+1] * arr[i+1])\r\nprint(res)\r\n", "mas = list(map(int, input().split()))\r\nt = mas[0]\r\nmas = list(map(int, input().split()))\r\nmas.sort()\r\nmas = mas[::-1]\r\nk = 1\r\ns = 0\r\nfor i in range(t):\r\n s += k * (mas[i] ** 2)\r\n k = -1\r\nimport math\r\nprint(math.pi s)", "from math import pi\n\n\ndef main():\n input()\n l = sorted(map(int, input().split()))\n sign = (1, 0)[len(l) & 1]\n print((sum(_ * _ for _ in l[sign::2]) - sum(_ * _ for _ in l[1 - sign::2])) * pi)\n\n\nif __name__ == '__main__':\n main()", "input();ans=0;k=1\r\nfor r in sorted(map(int,input().split())):ans+=rrk;k=-1\r\nprint(abs(ans3.1416))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\ns = 0\r\nfor i in range(0,len(l),2):\r\n s += l[i]l[i]\r\nfor i in range(1,len(l),2):\r\n s -= l[i]l[i]\r\n\r\nprint(s3.1415926536) ", "import math\n\nsize = int(input())\ncircles = input().split()\ncircles = [int(x) for x in circles]\ncircles.sort()\n\ntotal = 0\n\nif(size % 2 == 1):\n for i in range(size - 1, -1, -1):\n if(i % 2 == 0):\n total += math.pi (circles[i]*2)\n else:\n total -= math.pi (circles[i]*2)\nelse:\n for i in range(size - 1, -1, -1):\n if(i % 2 == 1):\n total += math.pi (circles[i]*2)\n else:\n total -= math.pi (circles[i]*2)\n \nprint(total)\n \t\t \t\t\t \t\t \t\t \t\t\t\t \t\t", "from sys import stdin,stdout,exit\r\nfrom math import pi\r\nn=int(stdin.readline().rstrip())\r\nl=list(map(int,stdin.readline().split()))\r\nl.sort(reverse=True)\r\ns=0\r\nfor i in range(n):\r\n if i%2==0:\r\n s+=pow(l[i],2)\r\n else:\r\n s-=pow(l[i],2)\r\nprint(pis)", "import math\nx = int(input())\ny = input().split()\nfor i in range(0, len(y)):\n y[i] = int(y[i])\ny.sort(reverse = True)\ntotal = 0\nalternator = 1\nfor i in y:\n total += (math.pi * i ** 2) * alternator\n alternator = -1\n\n\nprint(total)\n \t\t\t\t \t\t \t\t\t \t\t\t \t\t\t \t \t \t", "from math import pi\r\nn=int(input())\r\na=sorted(map(int,input().split()),reverse=True)\r\nsu=0\r\nfor i in range(n):\r\n if i%2==0:\r\n su+=pia[i]a[i]\r\n else:\r\n su-=pia[i]a[i]\r\nprint(su)\r\n", "from sys import \r\nfrom math import \r\nfrom sys import stdin,stdout\r\nfrom collections import \r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn = int(input())\r\narr = int_arr()\r\nsu = 0\r\narr.sort()\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n su += arr[i] 2\r\n else:\r\n su -= arr[i] 2\r\nprint(f'{abs(su) * pi:.10f}')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nnew = sorted(arr)\r\npi = 3.1415926536\r\nad = 0\r\nfor j in range(n):\r\n if j % 2 == 0:\r\n ad += new[j] 2\r\n else:\r\n ad -= new[j] 2\r\nprint(f\"{abs(ad) * pi:.10f}\")\r\n", "import math\r\nn=int(input())\r\na=sorted(map(int,input().split()))\r\nd=[1,-1]\r\nr=0\r\nfor i in range(n):\r\n r+=d[i%2]math.pia[-1-i]*2\r\nprint(r)", "n = input()\nn = int(n)\nl = list(map(int,input().split()))\nl.sort()\narea = 0\npi = 3.1415926536\nif n%2 == 0:\n for i in range(1,len(l),2):\n area = area + (pil[i]l[i]-pil[i-1]l[i-1])\nelse:\n area = pil[0]l[0]\n if n==1:\n area = area\n else:\n for i in range(2,len(l),2):\n area = area + (pil[i]l[i]-pil[i-1]l[i-1])\n\nprint (area)\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl = sorted(l)\r\nsu = 0\r\nfor i in range(1,len(l)+1):\r\n \r\n if i%2 == 1: su += (l[-i])2\r\n else: su -= (l[-i])2\r\n\r\nprint(su3.1415926536)", "import math\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nL=sorted(L)\r\nsuma=0\r\nif(n%2):\r\n suma+=(L[0]*2)math.pi\r\n L=L[1:]\r\nfor k in range(1,len(L),2):\r\n suma+=(L[k]2-L[k-1]2)math.pi\r\nprint(\"{0:.10f}\".format(suma)) \r\n", "pi=3.1415926536\r\nn=int(input())\r\nstroka=input()\r\nk=''\r\nR=[]\r\nfor i in range(0,len(stroka)):\r\n if stroka[i]==' ':\r\n R.append(int(k))\r\n k=''\r\n else:\r\n k+=stroka[i]\r\nR.append(int(k))\r\nfor i in range(0,n):\r\n for j in range(1,n):\r\n if R[j]>R[j-1]:\r\n k=R[j]\r\n R[j]=R[j-1]\r\n R[j-1]=k\r\nanswer=0\r\nfor i in range(0,n):\r\n if i%2==0:\r\n answer+=R[i]2\r\n else:\r\n answer-=R[i]2\r\nanswer=pi\r\nprint(answer)\r\n \r\n \r\n", "number_of_testcases = 1 #int(input())\r\n\r\nfor _ in range(number_of_testcases):\r\n num_circles = int(input())\r\n radii_of_circles = list(map(int,input().split()))\r\n pie_value = 3.1415926536\r\n red_part_area = 0\r\n ans = 0\r\n radii_of_circles.sort(reverse = True)\r\n \r\n while num_circles > ans:\r\n if num_circles > (ans + 1):\r\n red_part_area += pie_value(radii_of_circles[ans]radii_of_circles[ans] - radii_of_circles[ans+1]radii_of_circles[ans+1])\r\n ans += 2 \r\n else:\r\n red_part_area += pie_value(radii_of_circles[ans]radii_of_circles[ans])\r\n ans += 1\r\n \r\n print(red_part_area)", "import math\n\nnum_circles = int(input())\ncircles = input().split(' ')\n\ndef to_integer(circles):\n for i in range(num_circles):\n circles[i] = int(circles[i])\n\ndef calculate_area(circles):\n area = 0\n if num_circles % 2 == 1:\n for i in range(num_circles - 1, -1, -1):\n if i % 2 == 0:\n area += math.pi(circles[i]*2)\n else:\n area -= math.pi(circles[i]*2)\n else:\n for i in range(num_circles - 1, -1, -1):\n if i % 2 == 1:\n area += math.pi(circles[i]*2)\n else:\n area -= math.pi(circles[i]*2)\n print(area)\n\nto_integer(circles)\ncircles.sort()\ncalculate_area(circles)\n\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif n%2!=0:\r\n\tl.append(0)\r\nl.sort(reverse=True)\r\ni=0\r\nz=0\r\nwhile i<n:\r\n\tar=math.pi((l[i]l[i])-(l[i+1]l[i+1]))\r\n\tz+=ar\r\n\ti+=2\r\nprint(z)\r\n\r\n", "n = int(input())\r\n\r\ncircle = list(int(x)*2 for x in input().split())\r\ncircle = sorted(circle)\r\npi = 3.1415926536\r\nprint(pi(sum(circle[::-2])-sum(circle[-2::-2])))", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\ns=0\r\nf=1\r\nfor i in range(n-1,-1,-1):\r\n s+=fr[i]2\r\n f=f-1\r\nprint(math.pis)", "import math\r\ninput()\r\n\r\nl=sorted(list(int(i)int(i) for i in input().split()))\r\nprint(math.pi(sum(l[::-2])-sum(l[-2::-2])))\r\n", "import math\nN = int(input())\nlist_of_rads = list(map(int,input().split(' ')))\nlist_of_rads.sort(reverse=True)\nsum = 0\n#print(list_of_rads)\nwhile len(list_of_rads) != 0:\n\tif len(list_of_rads) == 1:\n\t\tsum += (math.pi)(list_of_rads[0]*2)\n\t\tlist_of_rads = list_of_rads[1:]\n\telse:\n\t\tsum+= (((math.pi)(list_of_rads[0]*2)) - (math.pi)(list_of_rads[1]*2))\n\t\tlist_of_rads = list_of_rads[2:]\nprint(sum)\n\t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t\t\t\t \t", "import math\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort(reverse=True)\r\narea=0\r\npi=3.1416\r\nif n==1:\r\n print(pia[0]a[0])\r\nelse:\r\n if n%2==0:\r\n for i in range(n-1,0,-2):\r\n area+=(pia[i]a[i]-pia[i-1]a[i-1])\r\n else:\r\n for j in range(n-1,1,-2):\r\n area += (pi a[j] * a[j] - pi * a[j - 1] * a[j - 1])\r\n area+=pia[0]a[0]\r\n print(abs(area))\r\n", "import math\r\nn=int(input())\r\nr=[int(x) for x in input().split()]\r\n\r\nr.sort(reverse=True)\r\nr.append(0)\r\n\r\nans=0\r\ni=0\r\nwhile i<n:\r\n ans += r[i]2 - r[i+1]2\r\n i+=2\r\n\r\nans = math.pi\r\nprint(\"{:.5f}\".format(ans))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n A.sort(reverse=True)\r\n ans = 0\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans += A[i] * 2\r\n else:\r\n ans -= A[i] ** 2\r\n ans = math.pi\r\n print('%.10f' % (ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import pi\r\n\r\nn = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\narr.sort(reverse= True)\r\narr.append(0)\r\nans = 0.0\r\ni = 0\r\nwhile i<n:\r\n ans += pi (arr[i]2 - arr[i+1]2)\r\n i += 2\r\n\r\nprint(f\"{ans:.10f}\")", "\"\"\"\nhttps://codeforces.com/problemset/problem/157/B\n\"\"\"\npi = 3.141592653589793\nn = int(input())\nrayons = sorted([int(x) for x in input().split()], reverse=True)\nif n % 2 == 1:\n rayons.append(0)\n\nsurface_rouge = pi * sum(\n [x 2 - y 2 for (x, y) in zip(rayons[:-1:2], rayons[1::2])]\n)\n\nprint(surface_rouge)\n", "import math\r\n\r\nsize = int(input())\r\ncircles = input().split()\r\ncircles = [int(x) for x in circles]\r\ncircles.sort()\r\n\r\ntotal = 0\r\n\r\nif(size % 2 == 1):\r\n for i in range(size - 1, -1, -1):\r\n if(i % 2 == 0):\r\n total += math.pi * (circles[i]*2)\r\n else:\r\n total -= math.pi (circles[i]*2)\r\nelse:\r\n for i in range(size - 1, -1, -1):\r\n if(i % 2 == 1):\r\n total += math.pi (circles[i]*2)\r\n else:\r\n total -= math.pi (circles[i]2)\r\n \r\nprint(total)", "circles = int(input())\n\nradius = [ int(x) for x in input().split() ]\nradius.sort()\n\npi = 3.1415926536\n\nred_area = 0\n\nif circles%2==0:\n\tfor r in range(1,circles,2):\n\n\t\tred_area += radius[r]2 - radius[r-1]2\n\nelse:\n\tred_area = radius[0]2\n\n\tfor r in range(2,circles,2):\n\n\t\tred_area += radius[r]2 - radius[r-1]2\n\nred_area = pi\nprint(red_area)\n\n \t \t\t \t\t \t \t \t\t\t", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by adi0311(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nimport heapq\r\nfrom math import \r\nfrom collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.\r\nfrom collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)\r\nfrom collections import Counter as c # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations as comb\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n# sys.setrecursionlimit(2pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(var)\r\ndef l(): return list(map(int, data().split()))\r\ndef sl(): return list(map(str, data().split()))\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [[val for i in range(n)] for j in range(m)]\r\n\r\n\r\nn = int(data())\r\narr = l()\r\narr.sort()\r\nanswer = 0.0\r\nif n % 2 == 0:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n answer -= pi pow(arr[i], 2)\r\n else:\r\n answer += pi * pow(arr[i], 2)\r\nelse:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n answer += pi * pow(arr[i], 2)\r\n else:\r\n answer -= pi * pow(arr[i], 2)\r\nprint(\"%.5f\"%answer)\r\n", "pi=3.1415926536\r\nn=int(input())\r\nt=input()\r\nif n==1:\r\n\tprint(piint(t)2)\r\nelse:\r\n\tli=[]\r\n\tfor x in t.split():\r\n\t\tli.append(int(x))\r\n\tli=sorted(li)\r\n\tif n%2==0:\r\n\t\tresult=0\r\n\t\tfor i in range(1,n):\r\n\t\t\tif i%2!=0:\r\n\t\t\t\tresult+=pi(li[i]2-li[i-1]2)\r\n\telse:\r\n\t\tresult=pili[0]2\t\r\n\t\tfor i in range(2,n):\r\n\t\t\tif i%2==0:\r\n\t\t\t\tresult+=pi(li[i]2-li[i-1]2)\r\n\tprint(result)\t\t\t\r\n\r\n", "from sys import stdin, stdout\r\nfrom math import pi\r\n\r\nn = int(stdin.readline())\r\nvalues = sorted(list(map(int, stdin.readline().split())), reverse = True)\r\nans = 0\r\n\r\nfor i in range(n):\r\n if not i % 2:\r\n ans += values[i] 2\r\n else:\r\n ans -= values[i] 2\r\n\r\nstdout.write(str(pi * ans))", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil,pi\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort(reverse=True)\r\n\r\ntot = 0\r\nswitch = 1\r\nfor i in range(0,len(nums)):\r\n tot += pi(nums[i]2)switch\r\n switch = -1 if switch==1 else 1\r\nprint(tot)", "import math\r\ncircles = int(input())\r\nradii = sorted(map(int,input().split()),reverse = True)\r\nif circles == 1:\r\n print ((radii[0]*2)math.pi)\r\nelse:\r\n red = (radii[-1]*2)math.pi if circles%2 else 0\r\n a = 1 if circles%2 else 0\r\n for x in range(1,circles-a,2):\r\n red += math.pi(radii[x-1]2 - radii[x]2)\r\n print (red)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()];s=0;pi=3.1415926536\r\na.sort(reverse=True)\r\nfor i in range(0,n,2):\r\n try: s+=pi(a[i]2-a[i+1]2)\r\n except: s+=pia[i]2\r\nprint(s)", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nr = list(map(int, input().split()))\r\nr.sort(reverse = True)\r\ns = 0\r\nfor i in range(n):\r\n s += r[i] r[i] if not i % 2 else -r[i] * r[i]\r\nans = math.pi * s\r\nprint(ans)", "import math\r\nn=int(input())\r\nr=[int(i) for i in input().split()]\r\nr.sort(reverse=True)\r\ncounter=0\r\nred=0\r\nwhile counter<n-1:\r\n red+=(r[counter]2-r[counter+1]2)\r\n counter+=2\r\nif counter==n-1:\r\n red+=r[counter]*2\r\nprint(redmath.pi)", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nsum=0\r\nk=1\r\nfor i in r:\r\n sum+=kii\r\n k=-1\r\n\r\nprint(math.piabs(sum))", "n, r, ans = int(input()), sorted(list(map(int, input().split())))[::-1], 0\r\nfor i in range(n):\r\n ans = ans + (1 if i % 2 == 0 else -1) * (r[i] ** 2)\r\nprint(\"%.20f\" % (ans * 3.1415926535897932384626433832795028841971))", "from math import pi\n\ndef main():\n n = int(input())\n a = sorted(list(map(int, input().split(' '))))[::-1]\n area = 0\n f = 0\n for i in range(n):\n cur = pi * a[i] * a[i]\n if f:\n area += cur\n else:\n area -= cur\n f ^= 1\n return abs(area)\nprint(main())\n", "import math\nx = int(input())\ny = input().split()\nfor i in range (0, len(y)):\n y[i]= int(y[i])\ny.sort(reverse = True)\ntotal =0\nalternator =1\nfor i in y:\n total += (math.pi * i ** 2) alternator\n alternator = -1\n\nprint(total)\n\t \t\t\t \t \t\t \t\t\t\t \t\t \t \t \t", "import math\n\ndef get_total_area(l):\n l.sort()\n\n if len(l) == 1:\n return math.pi * (l[0]2)\n\n total_area = 0\n for i in range(len(l) - 1, 0, -2):\n total_area += (l[i] 2) * math.pi - (l[i-1]*2) math.pi\n \n\n if len(l) % 2 != 0:\n total_area += (l[0] ** 2) * math.pi\n\n return total_area\n\n\nn = input()\nareas = list(map(int, input().split()))\n\nprint(get_total_area(areas))\n\n \n\t \t\t \t \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nif n%2==0:\r\n s=1\r\n ans=pi(l[1]2-l[0]2)\r\nelse:\r\n s=0\r\n ans=pil[s]*2\r\ns+=2\r\nfor i in range(s,n,2):\r\n ans+=piabs(l[i]2-l[i-1]2)\r\nprint(\"{0:.10f}\".format(ans))", "\n\nimport math\nx = int(input())\na = [int(x) for x in input().split()]\na.sort(reverse = True)\ncounter = 0\ntest = 0\nfor items in a :\n if test == 0:\n counter += pow(items,2)\n test = 1\n else: \n test = 0\n counter -= pow(items,2)\nprint(counter * math.pi)\n\t \t \t \t\t\t \t \t \t\t\t", "'''\r\nProblema:\r\nCalcular a área total das partes vermelhas da parede.\r\n'''\r\n\r\nfrom math import pi\r\nn = int(input())\r\na = sorted(map(int,input().split()))\r\nd = [1,-1]; at = 0\r\nfor i in range(n):\r\n at += pi * d[i%2] * a[-1-i]2\r\nprint(at)", "from math import pi\r\nn = int(input())\r\nr = sorted(list(map(int,input().split())))\r\ns = r[::-1]\r\na=0\r\nif n%2==0:\r\n for i in range(0,n-1,2):\r\n a+=s[i]2-s[i+1]2\r\nelse:\r\n a+=r[0]2\r\n for i in range(2,n,2):\r\n a+=r[i]2-r[i-1]2\r\nprint(pia)\r\n", "n=int(input())\r\nradios = [int(num) for num in input().split(\" \", n-1)]\r\nsum = 0\r\nx = 1\r\nfor r in sorted(radios):\r\n sum += rrx \r\n x = -1\r\nprint(abs(sum3.1415926536))", "'''input\n1\n1\n'''\nfrom math import pi\nn = int(input())\nr = sorted(map(int, input().split()))\na = 0\nif n % 2 == 1:\n\ta += r.pop(0)2\nwhile r:\n\tx, y = r.pop(0), r.pop(0)\n\ta += (y - x)(y + x)\nprint(api)", "import math\n\nn = int(input())\nr = map(int, input().split())\nr = sorted(list(map(lambda x: xx, r)))\nprint(math.pi * (sum(r[::-2]) - sum(r[-2::-2])))\n\n \t\t\t \t \t\t\t\t\t\t \t \t \t\t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npi=3.1415926536\r\narea=[l[0]2]\r\nfor i in range(1,n):\r\n area.append(l[i]2-l[i-1]*2)\r\n\r\nans=0\r\n#print(l,area)\r\nif n%2==1:\r\n for i in range(0,n,2):\r\n ans+=area[i]\r\n #print(ans,area[i])\r\nelse:\r\n for i in range(1,n,2):\r\n ans+=area[i]\r\n\r\nprint(anspi)", "import math\n\na=int(input())\n\nb=list(map(int,input().split()))\nb.sort()\n\nsoma=0\n\nfor i in range (-1,-a-1,-1):\n if i%2==1:\n soma+=b[i]*2math.pi\n else:\n soma-=b[i]*2math.pi\n\nprint (\"%.10f\"%(soma))\n \t\t\t\t \t \t\t \t\t\t \t\t\t \t\t\t \t", "n = int(input())\r\nl = sorted(list(map(int, input().split())), reverse=True)\r\nans = 0\r\ni = 0\r\npi = 3.1415926536\r\nwhile i<n:\r\n\tif i%2 == 0:\r\n\t\tans += pil[i]l[i]\r\n\telse:\r\n\t\tans -= pil[i]l[i]\r\n\ti += 1\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import pi\r\n\r\nn = int(input())\r\n\r\nrs = list(map(int,stdin.readline().split()))\r\n\r\nrs.sort()\r\nrs.reverse()\r\nra = 0\r\n# print(rs)\r\nrs.append(0)\r\nfor i in range(len(rs)-1):\r\n if(i%2==0):\r\n dif = rs[i]*2pi-rs[i+1]*2pi\r\n ra+=dif\r\n # print(ra)\r\nprint(ra)", "import sys\r\nimport math\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\npi = math.pi\r\n\r\nn = iinput()\r\nr = get_list()\r\nr.sort()\r\nans = 0\r\ni = n-1\r\n\r\nwhile(i>0):\r\n\tans += pi(r[i]2 - r[i-1]2)\r\n\ti-=2\r\n\r\nif (n%2==1):\r\n\tans += pi(r[0]*2)\r\nprint(ans)\t\t", "import math\narea = int(input())\nraios = input()\nraios = raios.split(\" \")\nfor i in range(len(raios)):\n raios[i] = int(raios[i])\n\nraios = sorted(raios,reverse=True)\nresultado = 0\nfor i in range(len(raios)):\n resultado += raios[i] raios[i] * (1 - i % 2 * 2);\nprint('{:.10f}'.format(resultadomath.pi))\n \t \t\t \t \t\t \t", "import math\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nred,blue=sum([math.pi(lst[i]*2) for i in range(0,n,2)]),sum([math.pi(lst[i]*2) for i in range(1,n,2)])\r\nprint(abs(red-blue))", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nansList = [math.piii for i in a]\r\nfor i in range(n):\r\n if i%2 != 0:\r\n ansList[i] = -1\r\n\r\nprint(sum(ansList))", "import math\r\nn = int(input())\r\n\r\nlist1 = [int(x) for x in input().split()]\r\n\r\nlist1 = sorted(list1)\r\n\r\narea = 0\r\npie = math.pi\r\n\r\nif n % 2 == 1:\r\n area += (pie * (list1[0] * list1[0]))\r\n i = 1\r\n for i in range(1, n, 2):\r\n a1 = pie * (list1[i + 1] * list1[i + 1])\r\n a2 = pie * (list1[i] * list1[i])\r\n \r\n area += a1 - a2\r\nelse:\r\n for i in range(0, n, 2):\r\n a1 = pie * (list1[i + 1] * list1[i + 1])\r\n a2 = pie * (list1[i] * list1[i])\r\n \r\n area += a1 - a2\r\n\r\nprint(area)\r\n ", "from math import pi\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.append(0)\r\narr.sort()\r\nans = 0\r\nif n%2==0:\r\n for i in range(2,len(arr),2):\r\n ans+=(pi(arr[i])2-pi(arr[i-1])*2)\r\nelse:\r\n for i in range(1,len(arr),2):\r\n ans+=(pi(arr[i])*2-pi(arr[i-1])*2)\r\nprint(f'{ans:.5f}')", "from math import pi\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n r = [int(i) for i in input().split()]\r\n r.sort()\r\n r = r[::-1]\r\n s = 0\r\n for i in range(n):\r\n if i % 2 == 0:\r\n s += pi r[i] ** 2\r\n else:\r\n s -= pi * r[i] ** 2\r\n\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\n\r\n\r\ndef S(r):\r\n return math.pi * r ** 2\r\n\r\n\r\nn = int(input())\r\nr_s = sorted(list(map(int, input().split())))\r\nsumma = 0\r\nif n % 2 == 1:\r\n summa += S(r_s[0])\r\n\r\n for i in range(1, n-1):\r\n if i % 2 == 1:\r\n summa += S(r_s[i + 1]) - S(r_s[i])\r\nelse:\r\n for i in range(n-1):\r\n if i % 2 == 0:\r\n summa += S(r_s[i + 1]) - S(r_s[i])\r\nprint(summa)", "import math\r\nn = int(input())\r\n\r\nradii = list(map(int,input().split()))\r\nradii.sort()\r\nradii = radii[::-1]\r\n\r\nif n ==1:\r\n print(\"%.10f\" %(math.piradii[0]radii[0]))\r\n exit()\r\n\r\nsummy = 0\r\n\r\nfor i in range(0, n, 2):\r\n summy += (radii[i]2)\r\nfor j in range(1, n, 2):\r\n summy -= (radii[j]2)\r\n \r\nprint(\"%.10f\" %(summymath.pi))", "import math\r\ninput()\r\nprint(math.pi sum(r ** 2 * (-1) ** i for i, r in enumerate(reversed(sorted(map(int, input().split()))))))", "from math import pi\ninput()\na=sorted(map(int,input().split()),reverse=True)\nprint(sum(map(lambda x:pia[x]2(-1)*x,range(len(a)))))\n\t\t \t\t\t\t \t\t\t\t\t \t \t\t \t \t", "from math import pi\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nr = sorted(list(map(lambda x: int(x) int(x), input().split())), reverse=True)\r\nprint(pi * (sum(r[::2]) - sum(r[1::2])))\r\n", "import math\r\n\r\nnumero = int(input())\r\ninteiros = list(map(int, input().split()))\r\n\r\ninteiros.sort(reverse=True)\r\narea_vermelha = 0\r\n\r\nfor i in range(numero):\r\n area_vermelha += inteiros[i] * inteiros[i] * (1 - i % 2 * 2)\r\n\r\nprint(f\"{math.pi * area_vermelha:.10f}\")", "from sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom math import pi\r\n\r\nans=0\r\nn=it()\r\nv=mp()\r\nv.sort(reverse=True)\r\n# print(v)\r\nfor i in range(len(v)):\r\n\tif not i&1:\r\n\t\tans+=v[i]2\r\n\telse:\r\n\t\tans-=(v[i]2)\r\nprint(anspi)\r\n\r\n", "import math\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nsol=0\r\ni=0\r\nwhile len(arr)>0:\r\n ele=arr.pop(-1)\r\n if i%2==0:\r\n sol+=math.pi(ele*2)\r\n else:\r\n sol-=math.pi(ele*2)\r\n i+=1\r\nprint(sol)", "def question2():\r\n number_of_circles = int(input())\r\n radius_of = list(map(int,input().split()))\r\n radius_of.sort(reverse = True)\r\n red_area = 0\r\n circle = 0\r\n pie = 3.1415926536\r\n while circle < number_of_circles:\r\n if circle+1 < number_of_circles:\r\n red_area += pie(radius_of[circle]2 - radius_of[circle+1]2)\r\n circle += 2 \r\n else:\r\n red_area += pie(radius_of[circle]2)\r\n circle += 1\r\n \r\n \r\n return red_area \r\n# remained_test_cases = int(input())\r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question2())\r\n remained_test_cases -= 1 ", "import math\nn, lista = int(input()), sorted([int(x) for x in input().split()])\n\n\ndef par(n, lista):\n pintado = 0\n for i in range(2, n + 1):\n if i % 2 == 0:\n pintado += math.pi lista[i-1] ** 2 - math.pi * lista[i-2] ** 2\n return pintado\n\n\ndef impar(n, lista):\n pintado = 0\n for i in range(1,n+1):\n if i == 1:\n pintado += math.pilista[i-1]2\n elif i > 1 and i % 2 != 0:\n pintado += (math.pilista[i-1]*2) - (math.pilista[i-2]*2)\n return pintado\n\n\n\n\nif n % 2 == 0:\n resultado = par(n, lista)\n print(f\"{resultado:.10f}\")\nelse:\n resultado = impar(n, lista)\n print(f\"{resultado:.10f}\")\n\t \t\t \t \t \t \t \t\t\t\t \t\t\t", "n=int(input())\r\ns1=0;s2=0\r\np=0\r\nradius=list(map(int,input().split()))\r\nradius.sort(reverse=True)\r\nfor i in radius:\r\n if p==0:\r\n s1+=pow(i,2)\r\n p=1\r\n else:\r\n s2+=pow(i,2)\r\n p=0\r\nprint((s1-s2)3.1415926536)", "import math\r\n\r\npi = math.pi\r\nn = int(input())\r\nr = sorted(list(map(int, input().split())))\r\narea = 0\r\n\r\nf = 1 if n % 2 == 0 else 0\r\nfor i in range(n):\r\n if (i+f) % 2 == 0:\r\n area += r[i]*2 pi\r\n else:\r\n area -= r[i]*2 pi\r\nprint(area)", "from math import pi\n\nqtd_circulos = int(input())\ncompri_raios = list(map(int, input().split()))\ncompri_raios.sort()\n\narea_total = 0\narea_azul = 0\ntamanho = len(compri_raios)\n\n# se o tamanho for par o circulo menor será o azul\nif(tamanho%2 == 0):\n for i in range(tamanho):\n if(i%2 != 0):\n area_total += (pi * (compri_raios[i] ** 2)) - area_azul\n else:\n area_azul = pi * (compri_raios[i] ** 2)\nelse:\n for i in range(tamanho):\n if(i%2 != 0):\n area_azul = pi * (compri_raios[i] ** 2)\n else:\n area_total += (pi * (compri_raios[i] ** 2)) - area_azul\n\nprint(\"%.10f\" % (area_total))\n\n \t \t\t \t\t \t\t\t\t\t\t \t \t\t\t \t\t\t\t\t\t", "import math\n\ninput1 = input()\n\ncircles = list(map(eval, input().split()))\ncircles.sort(reverse=True)\n\nresult = 0\n\nfor i in range(len(circles)):\n if i%2 == 0:\n result += math.pi(circles[i]2)\n else:\n result -= math.pi(circles[i]*2)\n\n\nprint(result)\n \t\t \t\t \t\t \t\t\t\t\t\t\t\t \t \t", "from math import \r\ndef area(radi):\r\n return pow(radi, 2) * pi\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.append(0)\r\nA.sort()\r\nans = 0\r\ncur = 0\r\nfor i in range(N, 0, -1):\r\n if cur == 1:\r\n cur = 0\r\n else:\r\n ans += area(A[i]) - area(A[i - 1])\r\n cur = 1\r\nprint(ans) \r\n \r\n ", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\n\r\nr = inlist()\r\n\r\nr = sorted(r, reverse=True)\r\nres = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n res += pir[i]r[i]\r\n else:\r\n res -= pir[i]r[i]\r\nprint(res)\r\n", "from sys import stdin, stdout\r\n\r\ns = int(stdin.readline())\r\n\r\nlt = [int(x)*2 for x in stdin.readline().split()]\r\n\r\nlt.sort()\r\naux=0\r\nif s%2==0:\r\n aux=-1\r\nelse:\r\n aux=1 \r\nans=0\r\nfor x in lt:\r\n ans = ans + auxx \r\n aux=-1\r\nans = 3.1415926536ans\r\nstdout.write(str(ans))", "from functools import reduce\r\n\r\nnum = str(input())\r\ns = list(map(lambda t: int(t)*2, str(input()).split(' ')))\r\ns.sort(reverse=True)\r\nfor i in range(1, len(s), 2):\r\n s[i] = -s[i]\r\nres = reduce((lambda x, y: x + y), s)\r\nprint(res 3.14159265)", "num=int(input())\r\nli=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nli.sort()\r\n#print(li)\r\nfor i in range(len(li)):\r\n if i%2==0:\r\n odd+=(3.1415926536)(li[i]li[i])\r\n else:\r\n even+=(3.1415926536)(li[i]li[i])\r\nprint(abs(odd-even))", "import math # для числа пи\r\nn = int(input()) # ввод числа\r\n# split - получение разбиение строки одстроки(по умолчанию разделителем считается пробел)\r\n# map(int, ... - преобразование в int\r\n# list - преобразование в список\r\n# sorted - сортировка \r\nList = sorted(list(map(int, input().split())), reverse = True)\r\n\r\n# цикл [0, n-1]\r\nfor i in range(n):\r\n # Формула площади... - степень\r\n List[i] = List[i]2 * math.pi\r\n # т.к. каждая нечётная окружность синего цвета, делаем её отрицательной\r\n if i%2==1:\r\n List[i] =-1\r\n# сумируем все получившиеся элементы и выводим результат\r\nprint(sum(List))\r\n", "import math\r\n\r\nn = int(input())\r\nri = list(map(int, input().split()))\r\nri.sort()\r\nres = 0\r\nk = 1\r\nfor i in ri:\r\n res += k i * i\r\n k = -1\r\nprint(math.piabs(res))" ]	{"inputs": ["1\n1", "3\n1 4 2", "4\n4 1 3 2", "4\n100 10 2 1", "10\n10 9 8 7 6 5 4 3 2 1", "1\n1000", "8\n8 1 7 2 6 3 5 4", "100\n1000 999 998 997 996 995 994 993 992 991 990 989 988 987 986 985 984 983 982 981 980 979 978 977 976 975 974 973 972 971 970 969 968 967 966 965 964 963 962 961 960 959 958 957 956 955 954 953 952 951 950 949 948 947 946 945 944 943 942 941 940 939 938 937 936 935 934 933 932 931 930 929 928 927 926 925 924 923 922 921 920 919 918 917 916 915 914 913 912 911 910 909 908 907 906 905 904 903 902 901", "6\n109 683 214 392 678 10", "2\n151 400", "6\n258 877 696 425 663 934", "9\n635 707 108 234 52 180 910 203 782", "8\n885 879 891 428 522 176 135 983", "3\n269 918 721", "7\n920 570 681 428 866 935 795", "2\n517 331", "2\n457 898", "8\n872 704 973 612 183 274 739 253", "74\n652 446 173 457 760 847 670 25 196 775 998 279 656 809 883 148 969 884 792 502 641 800 663 938 362 339 545 608 107 184 834 666 149 458 864 72 199 658 618 987 126 723 806 643 689 958 626 904 944 415 427 498 628 331 636 261 281 276 478 220 513 595 510 384 354 561 469 462 799 449 747 109 903 456", "76\n986 504 673 158 87 332 124 218 714 235 212 122 878 370 938 81 686 323 386 348 410 468 875 107 50 960 82 834 234 663 651 422 794 633 294 771 945 607 146 913 950 858 297 88 882 725 247 872 645 749 799 987 115 394 380 382 971 429 593 426 652 353 351 233 868 598 889 116 71 376 916 464 414 976 138 903", "70\n12 347 748 962 514 686 192 159 990 4 10 788 602 542 946 215 523 727 799 717 955 796 529 465 897 103 181 515 495 153 710 179 747 145 16 585 943 998 923 708 156 399 770 547 775 285 9 68 713 722 570 143 913 416 663 624 925 218 64 237 797 138 942 213 188 818 780 840 480 758", "26\n656 508 45 189 561 366 96 486 547 386 703 570 780 689 264 26 11 74 466 76 421 48 982 886 215 650", "52\n270 658 808 249 293 707 700 78 791 167 92 772 807 502 830 991 945 102 968 376 556 578 326 980 688 368 280 853 646 256 666 638 424 737 321 996 925 405 199 680 953 541 716 481 727 143 577 919 892 355 346 298", "77\n482 532 200 748 692 697 171 863 586 547 301 149 326 812 147 698 303 691 527 805 681 387 619 947 598 453 167 799 840 508 893 688 643 974 998 341 804 230 538 669 271 404 477 759 943 596 949 235 880 160 151 660 832 82 969 539 708 889 258 81 224 655 790 144 462 582 646 256 445 52 456 920 67 819 631 484 534", "27\n167 464 924 575 775 97 944 390 297 315 668 296 533 829 851 406 702 366 848 512 71 197 321 900 544 529 116", "38\n488 830 887 566 720 267 583 102 65 200 884 220 263 858 510 481 316 804 754 568 412 166 374 869 356 977 145 421 500 58 664 252 745 70 381 927 670 772", "64\n591 387 732 260 840 397 563 136 571 876 831 953 799 493 579 13 559 872 53 678 256 232 969 993 847 14 837 365 547 997 604 199 834 529 306 443 739 49 19 276 343 835 904 588 900 870 439 576 975 955 518 117 131 347 800 83 432 882 869 709 32 950 314 450", "37\n280 281 169 68 249 389 977 101 360 43 448 447 368 496 125 507 747 392 338 270 916 150 929 428 118 266 589 470 774 852 263 644 187 817 808 58 637", "97\n768 569 306 968 437 779 227 561 412 60 44 807 234 645 169 858 580 396 343 145 842 723 416 80 456 247 81 150 297 116 760 964 312 558 101 850 549 650 299 868 121 435 579 705 118 424 302 812 970 397 659 565 916 183 933 459 6 593 518 717 326 305 744 470 75 981 824 221 294 324 194 293 251 446 481 215 338 861 528 829 921 945 540 89 450 178 24 460 990 392 148 219 934 615 932 340 937", "94\n145 703 874 425 277 652 239 496 458 658 339 842 564 699 893 352 625 980 432 121 798 872 499 859 850 721 414 825 543 843 304 111 342 45 219 311 50 748 465 902 781 822 504 985 919 656 280 310 917 438 464 527 491 713 906 329 635 777 223 810 501 535 156 252 806 112 971 719 103 443 165 98 579 554 244 996 221 560 301 51 977 422 314 858 528 772 448 626 185 194 536 66 577 677", "97\n976 166 649 81 611 927 480 231 998 711 874 91 969 521 531 414 993 790 317 981 9 261 437 332 173 573 904 777 882 990 658 878 965 64 870 896 271 732 431 53 761 943 418 602 708 949 930 130 512 240 363 458 673 319 131 784 224 48 919 126 208 212 911 59 677 535 450 273 479 423 79 807 336 18 72 290 724 28 123 605 287 228 350 897 250 392 885 655 746 417 643 114 813 378 355 635 905", "91\n493 996 842 9 748 178 1 807 841 519 796 998 84 670 778 143 707 208 165 893 154 943 336 150 761 881 434 112 833 55 412 682 552 945 758 189 209 600 354 325 440 844 410 20 136 665 88 791 688 17 539 821 133 236 94 606 483 446 429 60 960 476 915 134 137 852 754 908 276 482 117 252 297 903 981 203 829 811 471 135 188 667 710 393 370 302 874 872 551 457 692", "95\n936 736 17 967 229 607 589 291 242 244 29 698 800 566 630 667 90 416 11 94 812 838 668 520 678 111 490 823 199 973 681 676 683 721 262 896 682 713 402 691 874 44 95 704 56 322 822 887 639 433 406 35 988 61 176 496 501 947 440 384 372 959 577 370 754 802 1 945 427 116 746 408 308 391 397 730 493 183 203 871 831 862 461 565 310 344 504 378 785 137 279 123 475 138 415", "90\n643 197 42 218 582 27 66 704 195 445 641 675 285 639 503 686 242 327 57 955 848 287 819 992 756 749 363 48 648 736 580 117 752 921 923 372 114 313 202 337 64 497 399 25 883 331 24 871 917 8 517 486 323 529 325 92 891 406 864 402 263 773 931 253 625 31 17 271 140 131 232 586 893 525 846 54 294 562 600 801 214 55 768 683 389 738 314 284 328 804", "98\n29 211 984 75 333 96 840 21 352 168 332 433 130 944 215 210 620 442 363 877 91 491 513 955 53 82 351 19 998 706 702 738 770 453 344 117 893 590 723 662 757 16 87 546 312 669 568 931 224 374 927 225 751 962 651 587 361 250 256 240 282 600 95 64 384 589 813 783 39 918 412 648 506 283 886 926 443 173 946 241 310 33 622 565 261 360 547 339 943 367 354 25 479 743 385 485 896 741", "93\n957 395 826 67 185 4 455 880 683 654 463 84 258 878 553 592 124 585 9 133 20 609 43 452 725 125 801 537 700 685 771 155 566 376 19 690 383 352 174 208 177 416 304 1000 533 481 87 509 358 233 681 22 507 659 36 859 952 259 138 271 594 779 576 782 119 69 608 758 283 616 640 523 710 751 34 106 774 92 874 568 864 660 998 992 474 679 180 409 15 297 990 689 501", "97\n70 611 20 30 904 636 583 262 255 501 604 660 212 128 199 138 545 576 506 528 12 410 77 888 783 972 431 188 338 485 148 793 907 678 281 922 976 680 252 724 253 920 177 361 721 798 960 572 99 622 712 466 608 49 612 345 266 751 63 594 40 695 532 789 520 930 825 929 48 59 405 135 109 735 508 186 495 772 375 587 201 324 447 610 230 947 855 318 856 956 313 810 931 175 668 183 688", "96\n292 235 391 180 840 172 218 997 166 287 329 20 886 325 400 471 182 356 448 337 417 319 58 106 366 764 393 614 90 831 924 314 667 532 64 874 3 434 350 352 733 795 78 640 967 63 47 879 635 272 145 569 468 792 153 761 770 878 281 467 209 208 298 37 700 18 334 93 5 750 412 779 523 517 360 649 447 328 311 653 57 578 767 460 647 663 50 670 151 13 511 580 625 907 227 89", "100\n469 399 735 925 62 153 707 723 819 529 200 624 57 708 245 384 889 11 639 638 260 419 8 142 403 298 204 169 887 388 241 983 885 267 643 943 417 237 452 562 6 839 149 742 832 896 100 831 712 754 679 743 135 222 445 680 210 955 220 63 960 487 514 824 481 584 441 997 795 290 10 45 510 678 844 503 407 945 850 84 858 934 500 320 936 663 736 592 161 670 606 465 864 969 293 863 868 393 899 744", "100\n321 200 758 415 190 710 920 992 873 898 814 259 359 66 971 210 838 545 663 652 684 277 36 756 963 459 335 484 462 982 532 423 131 703 307 229 391 938 253 847 542 975 635 928 220 980 222 567 557 181 366 824 900 180 107 979 112 564 525 413 300 422 876 615 737 343 902 8 654 628 469 913 967 785 893 314 909 215 912 262 20 709 363 915 997 954 986 454 596 124 74 159 660 550 787 418 895 786 293 50", "100\n859 113 290 762 701 63 188 431 810 485 671 673 99 658 194 227 511 435 941 212 551 124 89 222 42 321 657 815 898 171 216 482 707 567 724 491 414 942 820 351 48 653 685 312 586 24 20 627 602 498 533 173 463 262 621 466 119 299 580 964 510 987 40 698 521 998 847 651 746 215 808 563 785 837 631 772 404 923 682 244 232 214 390 350 968 771 517 900 70 543 934 554 681 368 642 575 891 728 478 317", "100\n941 283 349 457 52 837 299 284 796 305 893 624 101 972 738 204 121 70 17 704 836 791 95 111 162 952 472 724 733 580 878 177 705 804 11 211 463 417 288 409 410 485 896 755 921 267 164 656 505 765 539 439 535 19 991 689 220 474 114 944 884 144 926 849 486 566 117 35 749 499 797 303 362 905 690 890 976 66 590 183 234 683 39 297 769 787 376 541 571 759 495 200 261 352 73 493 831 442 273 339", "100\n110 868 147 888 291 282 916 542 917 337 235 595 498 621 814 249 261 713 445 666 142 275 319 49 900 543 333 606 487 670 620 769 852 258 230 867 603 491 714 839 879 37 21 74 590 190 397 506 499 967 152 862 200 107 145 23 614 167 857 475 79 598 270 906 626 116 89 59 651 846 723 201 50 699 522 408 634 132 226 414 824 764 513 586 526 238 556 162 667 173 684 415 527 743 10 442 552 274 350 822", "100\n901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000"], "outputs": ["3.1415926536", "40.8407044967", "31.4159265359", "31111.1920484997", "172.7875959474", "3141592.6535897931", "113.0973355292", "298608.3817237098", "397266.9574170437", "431023.3704798660", "823521.3902487604", "1100144.9065826489", "895488.9947571954", "1241695.6467754442", "1469640.1849419588", "495517.1260654109", "1877274.3981158488", "1780774.0965755312", "1510006.5089479341", "1528494.7817143100", "1741821.4892636713", "1818821.9252031571", "1272941.9273080483", "2045673.1891262225", "1573959.9105970615", "1479184.3434235646", "1258248.6984672088", "1495219.0323274869", "1577239.7333274092", "1624269.3753516484", "1615601.7212203942", "1806742.5014501044", "1611115.5269110680", "1569819.2914796301", "2042921.1539616778", "1310703.8710041976", "1686117.9099228707", "1419726.5608617242", "1556458.0979239127", "1775109.8050211088", "1447969.4788174964", "1597889.4218394549", "1567230.6191330721", "298608.3817237098"]}	UNKNOWN	PYTHON3	CODEFORCES	314
d0af4a8c1ee35c1950cff7a2dcfd802f	Felicity's Big Secret Revealed	The gym leaders were fascinated by the evolutions which took place at Felicity camp. So, they were curious to know about the secret behind evolving Pokemon. The organizers of the camp gave the gym leaders a PokeBlock, a sequence of n ingredients. Each ingredient can be of type 0 or 1. Now the organizers told the gym leaders that to evolve a Pokemon of type k (k<=≥<=2), they need to make a valid set of k cuts on the PokeBlock to get smaller blocks. Suppose the given PokeBlock sequence is b0b1b2... bn<=-<=1. You have a choice of making cuts at n<=+<=1 places, i.e., Before b0, between b0 and b1, between b1 and b2, ..., between bn<=-<=2 and bn<=-<=1, and after bn<=-<=1. The n<=+<=1 choices of making cuts are as follows (where a \| denotes a possible cut): Consider a sequence of k cuts. Now each pair of consecutive cuts will contain a binary string between them, formed from the ingredient types. The ingredients before the first cut and after the last cut are wasted, which is to say they are not considered. So there will be exactly k<=-<=1 such binary substrings. Every substring can be read as a binary number. Let m be the maximum number out of the obtained numbers. If all the obtained numbers are positive and the set of the obtained numbers contains all integers from 1 to m, then this set of cuts is said to be a valid set of cuts. For example, suppose the given PokeBlock sequence is 101101001110 and we made 5 cuts in the following way: So the 4 binary substrings obtained are: 11, 010, 01 and 1, which correspond to the numbers 3, 2, 1 and 1 respectively. Here m<==<=3, as it is the maximum value among the obtained numbers. And all the obtained numbers are positive and we have obtained all integers from 1 to m. Hence this set of cuts is a valid set of 5 cuts. A Pokemon of type k will evolve only if the PokeBlock is cut using a valid set of k cuts. There can be many valid sets of the same size. Two valid sets of k cuts are considered different if there is a cut in one set which is not there in the other set. Let f(k) denote the number of valid sets of k cuts. Find the value of . Since the value of s can be very large, output s modulo 109<=+<=7. The input consists of two lines. The first line consists an integer n (1<=≤<=n<=≤<=75) — the length of the PokeBlock. The next line contains the PokeBlock, a binary string of length n. Output a single integer, containing the answer to the problem, i.e., the value of s modulo 109<=+<=7. Sample Input 4 1011 2 10 Sample Output 10 1	[ "mo = 10*9+7\r\ndef calc(l, r, si):\r\n res = 0\r\n for i in range(l, r + 1):\r\n res = res 2 + int(si[i])\r\n return res\r\n \r\ndef main():\r\n n, si = int(input()), input()\r\n si = chr(0)+si\r\n f = [[0](1<<20) for i in range(6)]\r\n res, r, f[0][0]= 0, 0, 1\r\n for i in range(1, n+1):\r\n r=(r+1)%6\r\n f[r] = [0](1<<20)\r\n for j in range(1, min(5, i) + 1):\r\n if si[i-j+1] != '0':\r\n c, p = calc(i-j+1, i, si), (r-j+6)%6\r\n if(c>20 or c<1): break\r\n for s in range(1<<20):\r\n if(f[p][s]):\r\n f[r][s\|(1<<(c-1))] = (f[r][s\|(1<<(c-1))] + f[p][s]) % mo\r\n for s in range(1, 21):\r\n res = (res + f[r][(1<<s)-1]) % mo\r\n f[r][0] = (f[r][0] + 1) % mo\r\n if(si[i]=='0'):\r\n p=(r-1+6)%6\r\n for s in range(1<<20):\r\n if(f[p][s]):\r\n f[r][s] = (f[r][s] + f[p][s]) % mo\r\n print(res)\r\n\r\nmain()" ]	{"inputs": ["4\n1011", "2\n10", "7\n0110011", "10\n0100011101", "12\n010010101011", "31\n1000000010111001111000111001110", "62\n00010011000110010011110110011001110110010011110110111100100010", "51\n100010110000000110000101100110111110001001011000000", "75\n011001100010010010100010011010001000110010011010100111110110100000010111111", "75\n010110111011010010011101000010001010011111100101000101001100110010001010100", "75\n101111111101000110000001001101011101100010010001011010010100001001111111110", "75\n110100001001110011011011101010001001101000111110010001111110101001011111110", "9\n110101010", "17\n11110101001000001", "17\n10110100110101010", "25\n0000001101010011111101101", "25\n1001101000101001111011100", "25\n0110000000100001011010110", "33\n010001101110010000001001100001000", "33\n111111000000010010010010101000101", "41\n00111110100100100001101110011100011010010", "41\n00101001111010010011011101000100100000100", "49\n0100000110110101000011101100011000111010110100110", "49\n1110001011001111000000101011111111010111101101010", "49\n1001001011010111000101011111101000100101101110110", "57\n001101010001001110011001100011100111101010100000100100111", "57\n101011110010100010010001111101111001011110101000001111100", "57\n010000101010000000000010101010110111010110001110101111001", "65\n01100100011001001010011011011001101010111011010101101011111001000", "65\n00111101000100110101110000101000101001011101110110100100000011101", "73\n1001100010010111111000001100100011111011110100000101110101001001010100011", "73\n0000101011101101110110000010000100010010010011100011101010010110010001110", "73\n0101010100110101110101000111110001110110000011001011000100110000111010011", "73\n1110011000101111111111111010010110011001111111100111110110100101011111110", "73\n1111100101110101011111110111110011100100111000000001101000110011111010011", "44\n11000011111110110100110110010101001000111011", "2\n11", "32\n10011100101110110101100111001010", "16\n1110101011100001", "56\n10010100101100101000110110001001110101011111100100111101", "68\n11100010101100000101101100010111100111001110010010101011111100111110", "62\n00000100010110001100000101000001011001000111101011100110000101", "21\n110001101110001001100", "23\n11100111010100011110000", "60\n001100010011100010101011000011101010111101011101111101001001", "59\n10110000010101101101110000000001010010011111001111000110110", "42\n100001010001111100000010101101110100001001", "23\n01111101010011011011001", "1\n0", "15\n101000111100010", "31\n1010100111110001001010101000001", "75\n011101011001000010000010001001010100101001111110110111101000101101111010101", "75\n100101111101111010001000111011001010101001011110111111101110010011011111110", "75\n111011001000011110100101001011111010101001101010000100001100111001011101111", "75\n111100100001011010000101101000010100110110011110100110101011111101101110100", "75\n111100101001010010011000100100011101111000101100101110100100001111101001011", "75\n001010011010111110010011100100000101101010001110010011100100100011101000111", "75\n111000100000010001101110100100111010000111110010101010110100111101101110010", "75\n010101100111100101010010011001000000110010100110100101110011111101111010010", "75\n110100001100101001001001001000010000011101011100000100011111011011000111110", "75\n010001001010001101000100100000101111111010010100110100111111101000111011010", "75\n111001001011110001010100000011110010010100011011110101001001100101100010001", "75\n010010111010010011100001010011010001010011010011110010111110010000101100001", "75\n111111111111111111111111111111111111111111111111111111111111111111111111111", "75\n111111111111111111111111111111111111111111111111111111111111111111111111110", "75\n111111110111111011111111011111110011111110100011111111111000011111111111110", "75\n010101000010101111110011110010001010100101010001110110111110000111100010111", "75\n111010111011001000011100001101010001111001110010101001110011001010110001000", "75\n110111000100001111000101101100110010100011110101110100110111111100011000101", "75\n111000011010111110100101101000000001101010100010111001101010010110011011000", "75\n101100111111100100000011101001110100111101100010100101110101100111101110011", "75\n111010011111111000010100111011100101001001001111010010110001111011011100011", "75\n000000000000100000000000011000010000101010100000000000000000000000000000100", "1\n1", "2\n01", "75\n100000000000000000000000000000000000000000000000000000000000000000000000001", "75\n100000000000000000000000001111000000000000000000000000010000000000000001000", "75\n101110000111010110110011001111111100100111010000001000111100001110100110011", "75\n010010011001101111001011110001000011010010110001100101010110011100001100111", "75\n110001100110100011000010111100101101111100101000110111000110100110001010010", "75\n100101101110001111111110110010100001111010010110101001010011011111001100111", "75\n000101000100010101111100101111011001100100101111010000011100011110110100100", "75\n010101000110111001011110011011010000100100111011110000011110011010000110111", "75\n111111111111111111111111111011001111111111111111111111111111111111011111111", "75\n000000000010001000000000000000000000001000001000000000000000000000000000000", "75\n011111101111111111111111111111111110111101111111111111111111111111111111111", "75\n101111101111111111111111111111111111101111110111111111111111111111111111111", "75\n111111111110011111111111111101111111111111111111111111111111111111110111111", "75\n111111101111011101101111111111111111111100111111111101111111111110111111111", "75\n111111111111011011111111111111111110011111111011111111011111111110111011111", "75\n100000000000000000000000000000011000100001000000000000000100001000000001000", "75\n001000000000000000010000000000000000101000000010000100000000100010000000000", "75\n000000000100000000000000001000000101000000000000000000000000000000000000000", "75\n101001100001001000010001000110010000101001000010010010100110000101010101000", "75\n100001000100010000111100100101001001000010100001000100100100011000010001010", "75\n110000100001001010001000100010001010100010001011000100010000100010100011001", "75\n100101000010111000101001000100001000010010100100101000010010000100001000010", "75\n100001001000100010110100001010000100001001000110000100010000110100010100111", "75\n110000101100001010000100110001001000010110100001101010100010010001000010000", "75\n100010100110000100100001000110100100100010000100010100010010000101000100001", "75\n100100011011000010000101101001010001011100001100001100110000100001000101001", "75\n101001010010110000100100001000010110010100110001000010000100001000111000101", "75\n110001001100001010100010110001010000100100010000110000110010000100100100011", "75\n000000000000000000000000000000000000000000000000000000000000000000000001011"], "outputs": ["10", "1", "28", "80", "298", "129377", "996654969", "26730714", "928344407", "375282145", "623731146", "601716747", "97", "614", "2026", "29992", "44856", "3455", "30402", "155739", "15011055", "6654256", "284760197", "113840431", "123145241", "313846708", "565909910", "317648452", "223299317", "911430600", "933309680", "216844366", "887992377", "688351754", "588026128", "299589727", "3", "2055033", "822", "724204481", "924337491", "42655630", "3389", "9071", "67025753", "77661632", "3715362", "34033", "0", "406", "164173", "864150441", "388576952", "47586061", "457624439", "271125629", "517784773", "689673388", "236468305", "65671604", "200661894", "224259484", "782231136", "2850", "598994266", "303998985", "817830931", "678777685", "856496502", "132632533", "662817629", "122189821", "32314", "1", "2", "77", "2388", "706235237", "83382495", "531446727", "158490657", "650849043", "523584169", "763088827", "432", "69182016", "57141715", "820494757", "65685547", "57316598", "13285", "8162", "477", "377044625", "401069803", "952955634", "454813411", "852034934", "953764512", "37562460", "292478450", "174101396", "186593444", "365"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d0b4203b9ff07c161d2aaec568cce045	Chess For Three	Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two players, not three. So they play with each other according to following rules: - Alex and Bob play the first game, and Carl is spectating; - When the game ends, the one who lost the game becomes the spectator in the next game, and the one who was spectating plays against the winner. Alex, Bob and Carl play in such a way that there are no draws. Today they have played n games, and for each of these games they remember who was the winner. They decided to make up a log of games describing who won each game. But now they doubt if the information in the log is correct, and they want to know if the situation described in the log they made up was possible (that is, no game is won by someone who is spectating if Alex, Bob and Carl play according to the rules). Help them to check it! The first line contains one integer n (1<=≤<=n<=≤<=100) — the number of games Alex, Bob and Carl played. Then n lines follow, describing the game log. i-th line contains one integer ai (1<=≤<=ai<=≤<=3) which is equal to 1 if Alex won i-th game, to 2 if Bob won i-th game and 3 if Carl won i-th game. Print YES if the situation described in the log was possible. Otherwise print NO. Sample Input 3 1 1 2 2 1 2 Sample Output YES NO	[ "n=int(input())\r\nlst=[]\r\nres=[1,2]\r\nfor i in range(n):\r\n lst.append(int(input()))\r\ncheck=1\r\nfor i in lst:\r\n if i not in res:\r\n check=0\r\n break\r\n else:\r\n if i==1:\r\n if sum(res)==3:\r\n res.remove(2)\r\n res.append(3)\r\n else:\r\n res.remove(3)\r\n res.append(2)\r\n elif i==2:\r\n if sum(res)==3:\r\n res.remove(1)\r\n res.append(3)\r\n else:\r\n res.remove(3)\r\n res.append(1)\r\n else:\r\n if sum(res)==4:\r\n res.remove(1)\r\n res.append(2)\r\n else:\r\n res.remove(2)\r\n res.append(1)\r\nif check==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(input()) for _ in range(n)]\r\nf = 3\r\nfor x in a:\r\n if x == f:\r\n print(\"NO\")\r\n break\r\n for i in range(1, 4):\r\n if i != x and i != f:\r\n f = i\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\nspectator = 3\r\nfor i in range(n):\r\n winner = int(input())\r\n if winner == spectator:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n loser = 6 - (spectator + winner)\r\n spectator, player = loser, winner \r\nprint(\"YES\")\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nq=[1,2,3]\r\nfor _ in range(int(input())):\r\n m=int(input())\r\n if m==q[0]:\r\n q[1],q[2]=q[2],q[1]\r\n elif m==q[1]:\r\n q[0],q[2]=q[2],q[0]\r\n else:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")", "p=3;a=[1,2,3];k=0\r\nfor i in range(int(input())):\r\n\tx=int(input())\r\n\tif x==p:\r\n\t\tk=1\r\n\telse:\r\n\t\tp=[i for i in a if i not in [x,p]][0]\r\nprint('YES' if k==0 else 'NO')", "\r\nn=int(input())\r\nplayer1=1\r\nplayer2=2\r\nplayer3=3\r\nwinner=0\r\nlosser=0\r\ne=0\r\nfor i in range(n):\r\n game=int(input())\r\n winner=game\r\n if game==player1 or game==player2:\r\n e=e+1\r\n if game==player1:\r\n player1=winner\r\n losser=player2\r\n player2=player3\r\n player3=losser\r\n if game==player2:\r\n player2=winner\r\n losser=player1\r\n player1=player3\r\n player3=losser\r\nif e==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "c = 3\r\nn = int(input())\r\nfor i in range(n):\r\n\ta = int(input())\r\n\tif a == c:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tc = 6-c-a\r\nprint('YES')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(int(input()))\r\ndef f(l):\r\n\ta=[1,2]\r\n\tfor i in l:\r\n\t\tif i not in a:\r\n\t\t\treturn \"NO\"\r\n\t\tb=[1,2,3]\r\n\t\tfor x in a:\r\n\t\t\tb.remove(x)\r\n\t\ta=[i,b[0]]\r\n\treturn \"YES\"\r\nprint(f(l))", "# -- coding: utf-8 --\n\n\n\ndef solve():\n n = int(input())\n\n observer = 3\n for i in range(n):\n a = int(input())\n if a == observer:\n print(\"NO\")\n return\n observer = 6 - observer - a\n print(\"YES\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t\t\t\t \t\t\t \t\t\t \t\t\t\t \t \t\t \t", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n = int(input())\r\n\r\n AB = 'AB'\r\n BC = 'BC'\r\n AC = 'AC'\r\n\r\n state = AB\r\n for i in range(n):\r\n w = int(input())\r\n if state == AB and w == 3:\r\n return \"NO\"\r\n if state == AC and w == 2:\r\n return \"NO\"\r\n if state == BC and w == 1:\r\n return \"NO\"\r\n\r\n if state == AB and w == 1:\r\n state = AC\r\n continue\r\n if state == AB and w == 2:\r\n state = BC\r\n continue\r\n if state == BC and w == 2:\r\n state = AB\r\n continue\r\n if state == BC and w == 3:\r\n state = AC\r\n continue\r\n if state == AC and w == 1:\r\n state = AB\r\n continue\r\n if state == AC and w == 3:\r\n state = BC\r\n continue\r\n return \"YES\"\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nans = \"YES\"\r\nA = []\r\nfor i in range(n):\r\n a = int(input())\r\n A.append(a)\r\n\r\ncur = 3;f=0\r\nfor i in range(n):\r\n if(A[i]==cur):\r\n f+=1\r\n break\r\n l = 6-A[i]-cur\r\n cur = l\r\nif(f==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\nplayed = [1, 2]\r\nres = 'YES'\r\n\r\nfor i in range(n):\r\n winner = int(input())\r\n if (winner in played):\r\n played = [winner, 6 - (sum(played))]\r\n else:\r\n res = 'NO'\r\n break\r\nprint(res)\r\n", "n = int(input())\r\nplay1 = 1\r\nplay2 = 2\r\nwatch = 3\r\nfor i in range(n):\r\n x = int(input())\r\n if x == play1:\r\n play2, watch = watch, play2\r\n elif x == play2:\r\n play1, watch = watch, play1\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n=int(input())\r\n\r\nl1=[1,2,3]\r\nl=[1,2]\r\n\r\nfor i in range(n):\r\n\ta=int(input())\r\n\tif(a not in l):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tif(a==l[0]):\r\n\t\tb=l[1]\r\n\telse:\r\n\t\tb=l[0]\r\n\tl=l1.copy()\r\n\tl.remove(b)\r\nprint(\"YES\")", "cases = int(input())\r\ncannot = 3\r\nwhile cases:\r\n cases -= 1\r\n num = int(input())\r\n if num == cannot:\r\n print(\"NO\")\r\n exit()\r\n cannot = 6 - cannot-num\r\n\r\nprint(\"YES\")", "def main_function():\r\n winners = []\r\n for i in range(int(input())):\r\n winners.append(int(input()))\r\n currently_player_1_playing = True\r\n currently_player_2_playing = True\r\n currently_player_3_playing = False\r\n for i in winners:\r\n if i == 1 and currently_player_1_playing:\r\n currently_player_3_playing = not currently_player_3_playing\r\n currently_player_2_playing = not currently_player_2_playing\r\n elif i == 1 and not currently_player_1_playing:\r\n return \"NO\"\r\n if i == 2 and currently_player_2_playing:\r\n currently_player_3_playing = not currently_player_3_playing\r\n currently_player_1_playing = not currently_player_1_playing\r\n elif i == 2 and not currently_player_2_playing:\r\n return \"NO\"\r\n if i == 3 and currently_player_3_playing:\r\n currently_player_2_playing = not currently_player_2_playing\r\n currently_player_1_playing = not currently_player_1_playing\r\n elif i == 3 and not currently_player_3_playing:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n ", "n=int(input())\r\na=[1, 2]\r\nf=\"YES\"\r\nfor i in range(n):\r\n x=int(input())\r\n if x in a:\r\n a=[x, 6-sum(a)]\r\n else:\r\n f=\"NO\"\r\n\r\nprint(f)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = 3\r\n\r\nfor _ in range(n):\r\n s = int(input())\r\n if s == x:\r\n print(\"NO\")\r\n break\r\n x = 6 - s - x\r\nelse:\r\n print(\"YES\")", "i=input;l=3\r\nfor _ in[0]int(i()):\r\n x=int(i())\r\n if x==l:print('NO');exit()\r\n l^=x\r\nprint('YES')", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n l=int(input())\r\n li.append(l)\r\ns=3\r\na=1\r\nfor w in li:\r\n if(w!=s):\r\n s=6-s-w\r\n elif w==s:\r\n a=0\r\n break\r\nif a==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\nplayers = [1, 2]\r\nans = 'YES'\r\nfor case in range(n):\r\n a = int(input())\r\n if a not in players:\r\n ans = 'NO'\r\n break\r\n else:\r\n players = [6 - sum(players), a]\r\nprint(ans)\r\n", "dcF = {1:1, 2:2, 3:4}\r\ndcX = {k:7-v for k,v in dcF.items()}\r\ngame = 1 + 2\r\nfor _ in range(int(input())): \r\n won = int(input())\r\n if game & dcF[won] == 0:\r\n print(\"NO\")\r\n break\r\n game ^= dcX[won]\r\nelse:\r\n print(\"YES\")", "def solve(n: int, l: list) -> int:\r\n viewer = 3\r\n result = True\r\n for i in l:\r\n winner = i\r\n if winner == viewer:\r\n result = False\r\n if (winner == 1 and viewer == 3) or (winner == 3 and viewer == 1):\r\n viewer = 2\r\n elif (winner == 2 and viewer == 1) or (winner == 1 and viewer == 2):\r\n viewer = 3\r\n elif (winner == 3 and viewer == 2) or (winner == 2 and viewer == 3):\r\n viewer = 1\r\n \r\n if result: \r\n return(\"YES\")\r\n else: \r\n return(\"NO\")\r\n\r\n\r\nn = int(input())\r\nlst = []\r\nfor i in range(n):\r\n ele = int(input())\r\n lst.append(ele) \r\nprint(solve(n, lst))", "n = int(input())\r\nx = []\r\nflag = 0\r\nfor i in range(n):\r\n y = int(input())\r\n x.append(y)\r\nspec = 3\r\np1 = 1\r\np2 = 2\r\nfor i in range(n):\r\n if(x[i] == spec):\r\n flag = 1\r\n break\r\n if(p1 == x[i]):\r\n p1 = x[i]\r\n temp = p2\r\n p2 = spec\r\n spec = temp\r\n else:\r\n p2 = x[i]\r\n temp = p1\r\n p1 = spec\r\n spec = temp\r\n\r\nif(flag == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n", "n = input()\r\na =[]\r\nok = 0\r\nu = 1\r\nv = 2\r\nfor i in range(0,int(n)):\r\n x = int(input())\r\n if x ==u or x ==v:\r\n v = 6 -u-v\r\n u = x\r\n else:\r\n ok =1\r\n\r\nif ok ==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nimplement\r\nTwo pass -> 1) min(a[i] and a[i-2]) 2) max(a[i] and a[i-1])\r\n\r\n'''\r\ndef solve():\r\n n = II()\r\n\r\n valid = True\r\n cur = [1, 2]\r\n for _ in range(n):\r\n w = II()\r\n if w != cur[0] and w != cur[1]:\r\n valid = False\r\n break\r\n \r\n if w == cur[0]:\r\n cur[1] = 6 - sum(cur)\r\n if w == cur[1]:\r\n cur[0] = 6 - sum(cur)\r\n\r\n print('YES' if valid else 'NO')\r\n\r\nsolve()", "def possible():\r\n n = int(input())\r\n play = {1, 2}\r\n spectator = 3\r\n for _ in range(n):\r\n winner = int(input())\r\n if winner not in play: return False\r\n play.discard(winner)\r\n looser = list(play)[0]\r\n play = {winner, spectator}\r\n spectator = looser\r\n return True\r\n\r\nif possible():\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\na=1\r\nb=2\r\nc=3\r\nfor i in range(n):\r\n x=int(input())\r\n if x==a:\r\n b,c=c,b\r\n elif x==b:\r\n a,c=c,a\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import os,sys,io,math\r\nfrom array import \r\nfrom math import \r\nfrom bisect import \r\nfrom heapq import \r\nfrom functools import \r\nfrom itertools import \r\nfrom collections import \r\nI=lambda:[map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nx=3;ok=\"YES\"\r\nfor _ in range(IN()):\r\n n=IN()\r\n if n==x:ok=\"NO\"\r\n for i in range(1,4):\r\n if i!=n and i!=x:\r\n x=i;break\r\nprint(ok)", "b=0; i=1; r=[1,2]\r\nfor n in range(int(input())):\r\n l = int(input())\r\n if r==[1,2] or r==[2,1]: x=3\r\n elif r==[2,3] or r==[3,2]: x=1\r\n elif r==[1,3] or r==[3,1]: x=2\r\n if l not in r: print('NO'); break\r\n for i in range(len(r)):\r\n if l!=r[i]: r.pop(i); r.append(x)\r\nif l in r: print('YES')", "n = int(input())\r\nplaying1 = 1\r\nplaying2 = 2\r\nwhitch = 3\r\nerror = 0\r\nfor i in range(n):\r\n win = int(input())\r\n if playing1 != win and whitch != win:\r\n playing1, whitch = whitch, playing1\r\n elif playing2 != win and whitch != win:\r\n playing2, whitch = whitch, playing2\r\n else:\r\n error = 1\r\nif error == 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na,b,c = 1,2,3\r\nfor _ in range(n):\r\n x = int(input())\r\n if x==c:\r\n print(\"NO\")\r\n exit()\r\n t1 = x\r\n t2 = a+b-x\r\n t3 = c\r\n a= t1\r\n b= t3\r\n c = t2\r\n\r\nprint(\"YES\")", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n=int(input())\r\n winner=0\r\n sp=3\r\n loser=0\r\n ans=\"YES\"\r\n for i in range(n):\r\n take=int(input())\r\n if take==sp:\r\n ans=\"NO\"\r\n break\r\n else:\r\n winner=take\r\n if winner==1 and sp==2:\r\n sp=3\r\n elif winner==1 and sp==3:\r\n sp=2\r\n elif winner==2 and sp==3:\r\n sp=1\r\n elif winner==2 and sp==1:\r\n sp=3\r\n elif winner==3 and sp==1:\r\n sp=2\r\n else:\r\n sp=1\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "n = int(input())\r\nA= [int(input()) for i in range(n)]\r\nL = [1, 2, 3]\r\nfor a in A:\r\n if a not in {L[0], L[1]}:\r\n print('NO')\r\n exit()\r\n if a == L[0]:\r\n L[1], L[2] = L[2], L[1]\r\n else:\r\n L[0], L[2] = L[2], L[0]\r\nprint('YES')\r\n", "n = int(input())\r\na = [int(input()) for _ in range(n)]\r\np = 3\r\nfor i in range(len(a)):\r\n if a[i] == p:\r\n print(\"NO\")\r\n exit(0)\r\n for j in range(1, 4):\r\n if j != a[i] and j != p:\r\n p = j\r\n break\r\nprint(\"YES\")# 1690038063.726347", "import sys\r\nn = int(input())\r\nmember = [1,2,3]\r\nteam = [1,2]\r\n\r\nfor i in range(n):\r\n check = int(input())\r\n if check not in team:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\n for j in member:\r\n if j not in team:\r\n second = j\r\n break\r\n team[0]=check\r\n team[1]=second\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\nv = []\nfor _ in range(0, n):\n v.append(int(input()))\n\ns = {1, 2}\na = {1, 2, 3}\n\nfor i in v:\n if i not in s:\n print(\"NO\")\n break\n o = list((a - s))[0]\n s.discard([x for x in s if x != i][0])\n s.add(o)\n\nelse:\n print(\"YES\")\n", "n = int(input())\nx = 1\n\nlog = {\"P1\": 1, \"P2\": 2, \"S\": 3, \"tmp\": 0}\n\nfor i in range(n):\n\ta = int(input())\n\tif(a == log[\"P1\"]):\n\t\tlog[\"tmp\"] = log[\"P2\"]\n\t\tlog[\"P2\"] = log[\"S\"]\n\t\tlog[\"S\"] = log[\"tmp\"]\n\t\t#print(log)\n\telif(a == log[\"P2\"]):\n\t\tlog[\"tmp\"] = log[\"P1\"]\n\t\tlog[\"P1\"] = log[\"S\"]\n\t\tlog[\"S\"] = log[\"tmp\"]\n\t\t#print(log)\n\telse:\n\t\tx = 0\n\t\nif(x == 0):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n \t\t \t \t\t\t \t \t\t\t\t\t\t \t\t\t", "n=int(input())\r\nx=1\r\ny=2\r\ns=3\r\nfor i in range(n):\r\n win=int(input())\r\n if win==x :\r\n s=s^y\r\n y=s^y\r\n s=s^y\r\n elif win==y:\r\n s=s^x\r\n x=s^x\r\n s=s^x\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n = int(input())\r\nplayer = [1,2]\r\nother = [3]\r\n\r\nswitch = 0\r\nfor i in range (n):\r\n s = int(input())\r\n if s in player:\r\n other.append(s)\r\n player.remove(s)\r\n tmp = player\r\n player = other\r\n other = tmp\r\n else:\r\n switch = 1\r\n\r\nif switch == 1:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")", "n = int(input())\r\nnow = [1, 2]\r\nfor i in range(n):\r\n a = int(input())\r\n if a == now[0]:\r\n now[1] = 6 - sum(now)\r\n elif a == now[1]:\r\n now[0] = 6 - sum(now)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "def aaa():\n n=int(input())\n cc=3\n mm={1:{2:3,3:2},2:{1:3,3:1},3:{1:2,2:1}}\n for _ in range(n):\n a=int(input())\n if a==cc: return \"NO\"\n cc=mm[a][cc]\n return \"YES\"\nans=aaa()\nprint(ans)\n \t\t\t\t\t\t \t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\ns = 3\r\nt = True\r\nfor _ in range(n):\r\n w = int(input())\r\n if w == s:\r\n t = False\r\n s = 6 - w - s\r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')", "player = {1, 2}\r\nspec = {3}\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n win = {x}\r\n\r\n if win == spec:\r\n print(\"NO\")\r\n break\r\n spec2 = spec\r\n spec = player - win\r\n player = player - spec \| spec2\r\n\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\nwinner = int(input())\r\nlooser = 2 if winner == 1 else 1\r\nobserver = 3\r\nmessage = 'YES'\r\nif winner == 3:\r\n message = 'NO'\r\nelse:\r\n for i in range(1, n):\r\n currWinner = int(input())\r\n if currWinner == looser:\r\n message = 'NO'\r\n break\r\n temp = looser\r\n looser = observer if currWinner == winner else winner\r\n observer = temp\r\n winner = currWinner\r\nprint(message)", "n = int(input())\r\nlogs = []\r\nfor _ in range(n):\r\n l = int(input())\r\n logs.append(l)\r\n\r\nplaying = [1,2]\r\nspectate = [3]\r\n\r\nfor x in logs:\r\n if x not in playing:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n other = [y for y in playing if y != x][-1]\r\n if other in spectate:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n playing.remove(other)\r\n playing.append(spectate[0])\r\n spectate.remove(spectate[0])\r\n spectate.append(other)\r\nprint(\"YES\")", "n = int(input())\r\nplaying = [1, 2]\r\nspectator = [3]\r\nls = []\r\nans = 'YES'\r\nfor t in range(n):\r\n x = int(input())\r\n ls.append(x)\r\nfor e in range(len(ls)):\r\n if ls[e] not in playing:\r\n ans = 'NO'\r\n break\r\n for i in range(len(playing)):\r\n if playing[i] != ls[e]:\r\n playing[i], spectator[0] = spectator[0], playing[i]\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\nans = \"YES\"\r\np1 = 1\r\np2 = 2\r\nfor i in range(n):\r\n winer = int(input())\r\n if winer == p1:\r\n if p1 == 1:\r\n if p2 == 2:\r\n p2 = 3\r\n elif p2 == 3:\r\n p2 = 2\r\n else:\r\n ans = \"NO\"\r\n elif p1 == 2:\r\n if p2 == 1:\r\n p2 = 3\r\n elif p2 == 3:\r\n p2 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n if p2 == 1:\r\n p2 = 2\r\n elif p2 == 2:\r\n p2 = 1\r\n else:\r\n ans = \"NO\"\r\n elif winer == p2:\r\n if p2 == 1:\r\n if p1 == 2:\r\n p1 = 3\r\n elif p1 == 3:\r\n p1 = 2\r\n else:\r\n ans = \"NO\"\r\n elif p2 == 2:\r\n if p1 == 1:\r\n p1 = 3\r\n elif p1 == 3:\r\n p1 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n if p1 == 1:\r\n p1 = 2\r\n elif p1 == 2:\r\n p1 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n ans = \"NO\"\r\nprint(ans)\r\n", "b = 3\r\ntest = int(input())\r\nfor i in range(test):\r\n\ta = int(input())\r\n\tif a == b:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tb = 6 - b - a\r\nprint('YES')\r\n", "def generator(a,b):\r\n j=[a,b]\r\n k=[1,2,3]\r\n for i in k:\r\n if i not in j:\r\n return i\r\nn=int(input())\r\nl=[]\r\nf=0\r\nfor i in range(n):\r\n x=int(input())\r\n l.append(x)\r\nw=1\r\nb=2\r\nfor m in l:\r\n c=generator(w,b)\r\n if m==c:\r\n f=-1\r\n break\r\n w=m\r\n b=c\r\nif f==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n=int(input())\r\nalek=True\r\nboris=True\r\nvasi=False\r\nf=2\r\nx=True\r\nfor i in range(n):\r\n a=int(input())\r\n if a==1 and alek==True:\r\n if boris:\r\n boris=False\r\n else:\r\n boris=True\r\n if vasi:\r\n vasi=False\r\n else:\r\n vasi=True\r\n elif a==2 and boris==True:\r\n if alek:\r\n alek=False\r\n else:\r\n alek=True\r\n if vasi:\r\n vasi=False\r\n else:\r\n vasi=True\r\n elif a==3 and vasi==True:\r\n if alek:\r\n alek=False\r\n else:\r\n alek=True\r\n if boris:\r\n boris=False\r\n else:\r\n boris=True\r\n else:\r\n x=False\r\n break\r\nif x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "a=[None,True,True,False]\r\nfor i in range(int(input())):\r\n d=int(input())\r\n if not a[d]:\r\n print('NO')\r\n exit()\r\n for i in range(1,4):\r\n if a[i] and i!=d:\r\n a[i]=False\r\n elif not a[i]:\r\n a[i]=True\r\nprint('YES')", "n=int(input())\r\nx=\"1\"\r\ny=\"2\"\r\ns=\"3\"\r\nfor i in range(n):\r\n win=input()\r\n if win==x :\r\n temp=y\r\n y=s\r\n s=temp\r\n elif win==y:\r\n temp=x\r\n x=s\r\n s=temp\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n=int(input())\r\na,b=1,2\r\nfor i in range(n):\r\n c=int(input())\r\n if c==a:b^=a\r\n elif c==b:a^=b\r\n else:exit(print('NO'))\r\nprint('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = 3\r\nans = \"YES\"\r\nfor _ in range(n):\r\n a = int(input())\r\n if a == x:\r\n ans = \"NO\"\r\n for i in range(1, 4):\r\n if not i == a and not i == x:\r\n x = i\r\n break\r\nprint(ans)", "p={1,2}\r\nfor x in range(int(input())):\r\n\tn=int(input())\r\n\tif n not in p:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\tp={n,({1,2,3}.symmetric_difference(p))}\r\nelse:\r\n\tprint(\"YES\")", "n = int(input())\r\na,b,c = 1,2,3\r\n\r\n\r\nfor i in range(n):\r\n k = int(input())\r\n if k == a:\r\n b,c = c,b\r\n elif k == b:\r\n a,c = c,a\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n viewer = 3\r\n result = True\r\n for i in range(n):\r\n winner = int(input())\r\n if winner == viewer:\r\n result = False\r\n if (winner == 1 and viewer == 3) or (winner == 3 and viewer == 1):\r\n viewer = 2\r\n elif (winner == 2 and viewer == 1) or (winner == 1 and viewer == 2):\r\n viewer = 3\r\n elif (winner == 3 and viewer == 2) or (winner == 2 and viewer == 3):\r\n viewer = 1\r\n \r\n if result: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\nmain()", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\ns=3\r\nf=1\r\nfor _ in range(n):\r\n w=int(input())\r\n if f:\r\n if w==s:\r\n f=0\r\n else:\r\n if w==1:\r\n if s==2:\r\n s=3\r\n elif s==3:\r\n s=2\r\n elif w==2:\r\n if s==1:\r\n s=3\r\n elif s==3:\r\n s=1\r\n elif w==3:\r\n if s==1:\r\n s=2\r\n elif s==2:\r\n s=1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\np1 = 1\np2 = 2\ns = 3\n\no = True\n\nfor i in range(n):\n c = int(input())\n if c==p1:\n h = s\n s = p2\n p2 = h\n elif c==p2:\n h = s\n s = p1\n p1 = h\n else:\n print(\"NO\")\n o = False\n break\n\nif o:\n print(\"YES\")", "n=int(input())\r\nplay=[1,2]\r\nm=True\r\nc=3\r\nfor i in range(n):\r\n l=int(input())\r\n if l in play:\r\n play=[l,c]\r\n if 1 not in play:\r\n c=1\r\n elif 2 not in play:\r\n c=2\r\n else:\r\n c=3\r\n else:\r\n print(\"NO\")\r\n m=False\r\n break\r\nif m:\r\n print(\"YES\")\r\n \r\n \r\n", "con=True\r\nplay1,play2,spec=1,2,3\r\nfor i in [int(input()) for _ in [0]int(input())]:\r\n if i==spec:print('NO');con=False;break\r\n elif i==play1:play2,spec=spec,play2\r\n else:play1,spec=spec,play1\r\nif con:print('YES')", "n = int(input())\r\narr = [1,2]\r\nr = 3\r\nflag = True\r\nfor i in range(n):\r\n a = int(input())\r\n if a not in arr:\r\n print(\"NO\")\r\n flag = False\r\n break\r\n if arr[0] != a:\r\n z = arr[0]\r\n arr[0] = r\r\n r = z\r\n elif arr[1] != a:\r\n z = arr[1]\r\n arr[1] = r\r\n r = z\r\n \r\nif flag:\r\n print(\"YES\")\r\n \r\n ", "igra = [1, 2]\r\nfor i in range(int(input())):\r\n a = int(input())\r\n if igra.count(a) == 1:\r\n an = igra[abs(igra.index(a) - 1)]\r\n igra.remove(igra[abs(igra.index(a) - 1)])\r\n igra.append(6 - an - igra[0])\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "t = int(input())\r\nplaying = [1, 2]\r\nwatching = 3\r\nout = \"YES\"\r\nfor i in range(t):\r\n x = int(input())\r\n if x not in playing:\r\n out = \"NO\"\r\n break\r\n\r\n for e in playing:\r\n if e != x:\r\n y = e\r\n playing.remove(y)\r\n playing.append(watching)\r\n watching = y\r\nprint(out)", "\r\nn = int(input())\r\nnow, win , loss = 3, 1, 2\r\nf = True;\r\nfor _ in range(n):\r\n\tx = int(input())\r\n\tif _ == 0:\r\n\t\tif x == 3:\r\n\t\t\tf = False\r\n\t\telse:\r\n\t\t\twin = x\r\n\t\t\tloss = (1+2-x)\r\n\t\t\tnow = 3\r\n\telse :\r\n\t\tif x == loss:\r\n\t\t\tf = False\r\n\t\telse :\r\n\t\t\tt = (loss + 0)\r\n\t\t\tloss = (win + now - x)\r\n\t\t\twin = x\r\n\t\t\tnow = t\r\nif f == True:\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "n = int(input())\nwinners = []\n\nfor i in range(n):\n winners.append(int(input()))\n\nplayer1 = 1\nplayer2 = 2\nother = 3\n\nflag = True\n\nfor winner in winners:\n if winner != player1 and winner != player2:\n flag = False\n break\n if winner == player1:\n player2, other = other, player2\n else:\n player1, other = other, player1\n\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\n\nplayer_1, player_2, watch = 1, 2, 3\nanswer = \"YES\"\nfor i in range(n):\n winner = int(input())\n if(winner == player_1):\n player_2, watch = watch, player_2\n elif(winner == player_2):\n player_1, watch = watch, player_1\n else:\n answer = \"NO\"\n break\n\nprint(answer)\n \t\t \t\t \t \t\t\t \t \t \t\t", "n = int(input())\r\na, b, c, x = True, True, False, []\r\nd, s = {1: a, 2: b, 3: c}, [1, 2, 3]\r\nfor i in range(n):\r\n x.append(int(input()))\r\nfor i in range(n):\r\n if d[x[i]]:\r\n b = list(s)\r\n b.remove(x[i])\r\n for j in b:\r\n d[j] = not d[j]\r\n else:\r\n exit(print(\"NO\"))\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=[1,2]\r\nans=\"YES\"\r\nfor _ in range(n):\r\n w=int(input())\r\n if w not in l:\r\n ans=\"NO\"\r\n else:\r\n l=[w,6-sum(l)]\r\nprint(ans)", "def isPossible(order):\n currentPlayers = [1,2]\n\n for player in order:\n if player in currentPlayers:\n currentPlayers = [player, 6-sum(currentPlayers)]\n \n else:\n return 'NO'\n \n return 'YES' \n\norder = []\nlines = int(input())\nfor line in range(lines):\n i = int(input())\n order.append(i)\n\nprint(isPossible(order))", "l=[]\r\nfor i in range(int(input())):\r\n\ta=int(input())\r\n\tl.append(a)\r\nt=[1,2]\r\n\r\nfor i in range(len(l)):\r\n\tif l[i] not in t:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\telse:\r\n\t\tt[1-t.index(l[i])]=6-sum(t)\r\nelse:\r\n\tprint('YES')", "all = set({1,2,3})\r\nwin = [1, 2]\r\nn = int(input())\r\nflag = 0\r\nfor i in range(n):\r\n idx = int(input())\r\n if idx not in win:\r\n flag = 1\r\n break\r\n else:\r\n other = list(all - set(win))[0]\r\n if win[0]==idx:win[1]=other\r\n else:win[0]=other\r\nif flag==0:print('Yes')\r\nelse:print('No')", "import sys\r\nimport math\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef LI():\r\n\treturn list(map(int, sys.stdin.readline().split()))\r\n \r\ndef MI():\r\n\treturn map(int, sys.stdin.readline().split())\r\n \r\ndef SI():\r\n\treturn sys.stdin.readline().strip()\r\n \r\ndef FACT(n, mod):\r\n s = 1\r\n facts = [1]\r\n for i in range(1,n+1):\r\n s=i\r\n s%=mod\r\n facts.append(s)\r\n return facts[n]\r\n \r\ndef C(n, k, mod):\r\n return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod\r\n\r\ntemp = 3\r\nboo = True\r\nfor _ in range(II()):\r\n a = II()\r\n if a == temp:\r\n boo = False\r\n if a == 1:\r\n if temp == 3:\r\n temp = 2\r\n else:\r\n temp = 3\r\n if a == 2:\r\n if temp == 3:\r\n temp = 1\r\n else:\r\n temp = 3\r\n if a == 3:\r\n if temp == 1:\r\n temp = 2\r\n else:\r\n temp = 1\r\nprint(\"YES\" if boo else \"NO\")\r\n", "c=3\nn=int(input())\nfor i in range(n):\n\ta=int(input())\n\tif a==c:\n\t\tprint('NO')\n\t\texit()\n\tc=6-c-a\nprint('YES')\n\n\t \t \t \t\t\t \t \t \t \t\t \t \t", "n = int(input())\nres = \"YES\"\nspec = 3\nfor _ in range(n):\n won = int(input())\n if won == spec:\n res = \"NO\"\n spec = next(i for i in [1, 2, 3] if i != won and i != spec)\nprint(res)\n" ]	{"inputs": ["3\n1\n1\n2", "2\n1\n2", "100\n2\n3\n1\n2\n3\n3\n3\n1\n1\n1\n1\n3\n3\n3\n3\n1\n2\n3\n3\n3\n3\n3\n3\n3\n1\n2\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n3\n3\n1\n2\n3\n3\n3\n1\n1\n1\n1\n3\n3\n3\n3\n1\n2\n3\n1\n2\n2\n2\n3\n3\n2\n1\n3\n3\n1\n2\n3\n1\n1\n1\n2\n2\n2\n3\n1\n1\n1\n1\n1\n1\n3\n2\n2\n2\n2\n2\n2\n3\n1\n2\n2\n2\n2\n2\n3\n3\n2\n1\n1", "99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1\n1\n3\n2\n2\n2\n1\n3\n3\n1\n1\n3\n2\n1\n3\n3\n1\n2\n3\n3\n3\n1\n2\n2\n2\n3\n3\n3\n3\n3\n3\n2\n2\n2\n2\n3\n3\n3\n1\n1\n3\n2\n1\n1\n2\n2\n2\n3\n3\n2\n1\n1\n2\n2\n1\n3\n2\n1\n1\n2\n3\n3\n3\n3\n2\n2\n2\n2\n2\n1\n3", "100\n2\n2\n1\n3\n1\n3\n3\n1\n1\n3\n1\n1\n3\n2\n1\n3\n1\n1\n3\n3\n2\n2\n3\n1\n1\n2\n3\n2\n2\n3\n1\n1\n2\n3\n2\n1\n2\n2\n3\n3\n1\n1\n3\n1\n2\n1\n3\n1\n1\n3\n2\n2\n2\n1\n1\n1\n3\n1\n3\n2\n1\n2\n2\n2\n3\n3\n2\n1\n1\n3\n3\n2\n1\n2\n1\n1\n3\n1\n2\n3\n2\n3\n3\n3\n2\n2\n1\n3\n1\n2\n3\n1\n2\n3\n3\n1\n2\n1\n3\n1", "10\n2\n3\n3\n3\n3\n2\n2\n2\n3\n2", "100\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\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\n3", "1\n2", "42\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", "4\n2\n3\n3\n3", "3\n1\n2\n3", "5\n1\n1\n1\n1\n3", "5\n2\n3\n3\n3\n3", "2\n3\n3", "4\n1\n2\n2\n1", "3\n2\n2\n3", "5\n2\n3\n3\n1\n1", "3\n3\n1\n3", "3\n3\n3\n1", "2\n2\n1", "3\n1\n1\n3", "6\n2\n2\n2\n3\n1\n3", "2\n3\n1", "2\n3\n2", "2\n1\n3", "3\n1\n3\n1", "5\n1\n1\n2\n2\n3", "3\n2\n1\n1", "2\n2\n2", "3\n2\n2\n1", "5\n2\n2\n2\n2\n2", "8\n1\n1\n1\n1\n1\n1\n1\n1", "3\n3\n2\n2", "3\n3\n2\n3", "7\n2\n2\n2\n2\n2\n2\n2", "3\n2\n2\n2"], "outputs": ["YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	76
d0d6dc4057d27406033bbafafb50a4ec	If at first you don't succeed...	Each student eagerly awaits the day he would pass the exams successfully. Thus, Vasya was ready to celebrate, but, alas, he didn't pass it. However, many of Vasya's fellow students from the same group were more successful and celebrated after the exam. Some of them celebrated in the BugDonalds restaurant, some of them — in the BeaverKing restaurant, the most successful ones were fast enough to celebrate in both of restaurants. Students which didn't pass the exam didn't celebrate in any of those restaurants and elected to stay home to prepare for their reexamination. However, this quickly bored Vasya and he started checking celebration photos on the Kilogramm. He found out that, in total, BugDonalds was visited by $A$ students, BeaverKing — by $B$ students and $C$ students visited both restaurants. Vasya also knows that there are $N$ students in his group. Based on this info, Vasya wants to determine either if his data contradicts itself or, if it doesn't, how many students in his group didn't pass the exam. Can you help him so he won't waste his valuable preparation time? The first line contains four integers — $A$, $B$, $C$ and $N$ ($0 \leq A, B, C, N \leq 100$). If a distribution of $N$ students exists in which $A$ students visited BugDonalds, $B$ — BeaverKing, $C$ — both of the restaurants and at least one student is left home (it is known that Vasya didn't pass the exam and stayed at home), output one integer — amount of students (including Vasya) who did not pass the exam. If such a distribution does not exist and Vasya made a mistake while determining the numbers $A$, $B$, $C$ or $N$ (as in samples 2 and 3), output $-1$. Sample Input 10 10 5 20 2 2 0 4 2 2 2 1 Sample Output 5-1-1	[ "a, b, c, n = map(int, input().split())\r\ntmp = n - (a + b - c)\r\nif tmp < 1 or a < c or b < c:\r\n print(-1)\r\nelse:\r\n print(tmp)", "A,B,C,N=map(int,input().split())\r\nAUB=A+B-C\r\nif AUB>=N:\r\n print(-1)\r\nelif AUB<0:\r\n print(-1)\r\nelif A<C:\r\n print(-1)\r\nelif B<C:\r\n print(-1)\r\nelse:\r\n print(N-AUB)\r\n", "a, b, c, n = map(int, input().split())\r\na -= c\r\nb -= c\r\nif a + b + c + 1 > n or a < 0 or b < 0:\r\n print(-1)\r\nelse:\r\n print(n - a - b - c)\r\n", "a,b,c,t=list(map(int,input().split()))\r\nif t<=a+b-c or c>a or c>b: print(-1)\r\nelse: print(t-a-b+c)", "ReadMultipleValues = lambda: map(int, input().split())\r\nReadMultipleValuesStr = lambda: map(str, input().split())\r\n\r\n\r\n\r\na,b,c,n=ReadMultipleValues()\r\nif n-a-b+c <=0 or a<c or b<c:\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,d=map(int,input().split())\r\nif c>a or c>b:\r\n print(-1)\r\n exit(0)\r\na-=c\r\nif(a+b>=d):\r\n print(-1)\r\n exit(0)\r\nprint(d-a-b)", "a,b,c,n = map(int,input().split())\r\nx = n-(a+b-c)\r\nif x<=0 or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(x)", "A,B,C,N=map(int,input().split())\r\nif(A+B-C>=N): print(\"-1\")\r\nelif(C>A or C>B):print(\"-1\")\r\nelse: print(N-(A+B-C))", "a , b , c , n = map ( int , input (). split ())\r\nq = (( a - c ) + ( b - c ) + c )\r\nw = n - q\r\nif(c>a or c>b):\r\n print(-1)\r\nelif ( w > 0 ):\r\n print ( w )\r\nelse :\r\n print ( \"-1\" )", "a=input()\r\nb=list(map(int,a.split()))\r\nc=b[3]-(b[0]+b[1]-b[2])\r\nif b[0]+b[1]-b[2]>=b[3] or b[2]>b[0] or b[2]>b[1]:\r\n print(-1)\r\nelse:\r\n print(c)", "#ROUNIAAUDI\r\nnum1,num2,num3,num4=map(int,input().split())\r\nnum4-=((num1+num2)-num3)\r\nif num4<=0 or num3>num2 or num1<num3:\r\n print(-1)\r\nelse:\r\n print(num4)", "a , b , c , n = list(map(int ,input().split()))\r\n\r\nn1 = a - c \r\nn2 = b - c \r\nn3 = c \r\nn4 = n - n1 - n2 - n3\r\nif(n1 >= 0 and n2 >= 0 and n3 >= 0 and n4 > 0):\r\n print(n4)\r\nelse:\r\n print(-1)", "A,B,C,N = map(int,input().split())\r\nif(N-(A+B-C)>=1 and C<=A and C<=B):\r\n print(N-(A+B-C))\r\nelse:\r\n print(-1)", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 1010\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\na, b, c, n = inp()\r\ntemp = a + b - c\r\nif c > a or c > b or temp < 0:\r\n print(-1)\r\n sys.exit()\r\nif n - temp <= 0:\r\n print(-1)\r\nelse:\r\n print(n - temp)\r\n", "a, b, c, n = map(int, input().split())\r\nif (c > a) or (c > b):\r\n print(-1)\r\nelse:\r\n result = n - (a - c) - (b - c) - c\r\n if result > 0:\r\n print(result)\r\n else:\r\n print(-1)", "def test_1():\n # A -\n import math\n from collections import Counter\n a, b, c, n = list(map(int, input().split(\" \")))\n\n if a < c or b<c:\n print(-1)\n return\n a_1 = n - (a-c)-(b-c) -c\n if a_1 <1:\n print(-1)\n return\n else:\n print(a_1)\n\n\ntest_1()\n \t\t \t \t \t \t \t\t \t", "a, b, c, d = map(int, input().split())\n\nif c > a or c > b:\n print(-1)\nelse:\n r = d - (a + b - c)\n if r <= 0:\n print(-1)\n else:\n print(r)\n\n \t \t \t \t \t\t\t \t\t\t \t \t", "\r\na,b,c,d=map(int,input().split())\r\nif a<c or b<c or a>d or b>d or c>d:\r\n print(-1)\r\n\r\nelse:\r\n\r\n ans = d-((a+b)-c)\r\n if ans <=0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n", "a, b, c, n = (int(i) for i in input().split())\ndiff = a + b - c\nres = n - diff if n - diff > 0 and c <= a and c <= b and a <= n and b <= n else -1\nprint(res)\n", "a,b,c,n = map(int,input().split(' '))\r\nres = n-a-b+c\r\nprint(res if res>0 and a>=c and b>=c else -1)\r\n", "a,b,c,n = map(int,input().split())\r\nprint(n-(a+b-c) if n-(a+b-c) > 0 and a>=c and b>=c else -1)", "\n\na, b, c, n = [int(x) for x in input().split(' ')]\n\nf = n - (a+b-c)\n\nif(f < 1 or c > a or c > b):\n print(-1)\nelse:\n print(f)\n", "a, b, c, n = map(int, input().strip().split())\npassed = a+b-c\nif 0 <= passed < n and max(a, b, c) <= n and c <= min(a, b):\n\tprint(n-passed)\nelse:\n\texit(print(-1))\n", "a,b,c,n=map(int,input().split())\r\nif a+b-c<n and a>=c and b>=c:\r\n print(n-(a+b-c))\r\nelse:\r\n print(-1)", "a, b, c, n = map(int, input().split())\r\nn -= a + b - c\r\nif a >= c and b >= c and n > 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(-1)", "a, b, c, n = map(int, input().split())\n\nif c > a or c > b or a + b - c + 1 > n:\n print(-1)\nelse:\n print(n - (a + b - c))\n\n \t\t \t \t \t \t\t\t \t\t\t\t\t \t \t \t\t \t", "a, b, c, n = map(int, input().split())\r\n\r\nif a >= c and b >= c:\r\n failed = n - (a-c + b-c + c)\r\n if failed < 1:\r\n print(-1)\r\n else:\r\n print(failed) \r\nelse:\r\n print(-1)", "\r\n #for i,item in enumerate(s): \r\n \r\n\r\n#N=A+B-C+P\r\n\r\na,b,c,n=map(int,input().split(' '))\r\n\r\np=n-(a+b-c)\r\nif(c>a or c>b):\r\n p=-1\r\nif(p>=1):\r\n print(p)\r\nelse: \r\n print(-1)", "\r\na,b,c,d = map(int, input().split())\r\nvalue_1 = a - c\r\nvalue_2 = b - c\r\nvalue_4 = d - value_1 - value_2 - c\r\nif(value_1 >= 0 and value_2 >= 0 and c >= 0 and value_4 > 0):\r\n print(value_4)\r\nelse : print(-1)", "X = list(map(int, input().split()))\r\nPass = X[0] + X[1] - X[2]\r\nprint(-1 if Pass >= X[3] or X[2] > X[0] or X[2] > X[1] else X[3] - Pass)\r\n\r\n# UB_CodeForces\r\n# Advice: “Whenever you find yourself on the side of the majority, it is time to pause and reflect.”\r\n# Location: Behind my desk\r\n# Caption: On the right way\r\n# CodeNumber: 548\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor,log2\r\nrandom = randint(1, 10 9)\r\nclass wrapper(int):\r\n def __hash__(self):\r\n return super(wrapper, self).__hash__() ^ random\r\n\r\na,b,c,n=rd()\r\nif a<c or b<c:\r\n print(-1)\r\n exit()\r\nelif (a-c)+(b-c)+c>=n :\r\n print(-1)\r\nelif n-(a-c)+(b-c)+c<1:\r\n print(-1)\r\nelse:\r\n print(n-(a-c+b-c+c))\r\n", "a,b,c,n=map(int,input().split())\r\nif a+b-c>=n or c>a or c>b:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(n-(a+b-c))", "A,B,C,N = [int(x) for x in input().split()]\r\n\r\nif C > min(A,B):\r\n print(-1)\r\n \r\nelse:\r\n if A+B-C <= N-1:\r\n print(N-A-B+C)\r\n else:\r\n print(-1)", "a,b,c,n=map(int,input().split())\r\nif (c > a or c > b or a + b - c > n - 1):\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,n=[int(x) for x in input().split()]\r\nif a<c or b<c:\r\n print(-1)\r\nelse:\r\n if a+b-c>=n:\r\n print(-1)\r\n else:\r\n print(n-(a+b-c))", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\na, b, c, n = map(int, input().split())\nn1 = a - c\nn2 = b - c\nn3 = c\nn4 = n - n1 - n2 - n3\nif n1 >= 0 and n2 >= 0 and n3 >= 0 and n4 > 0:\n print(n4)\nelse:\n print(-1)\n", "d, k, b, h = map(int, input().split())\n\nf = h - ((d-b) + (k-b) + b)\nif f < 1 or d < b or k < b:\n f = -1\n\nprint(f)\n", "a,b,c,n = map(int,input().split())\r\nif (a-c) + (b-c) + c >= n or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(n-((a-c)+b))", "# -- coding: utf-8 --\n\n\ndef rli():\n return list(map(int, input().split()))\n\n\ndef main():\n a, b, c, n = rli()\n if c > a or c > b:\n print(-1)\n return\n if a + b - c > n - 1:\n print(-1)\n return\n print(n - a - b + c)\n\n\nif __name__ == '__main__':\n main()\n", "A, B, C, N = map(int, input().split())\r\nans = N - (A + B - C)\r\nif A < C or B < C or A > N or B > N or C > N or ans < 1:\r\n print(-1)\r\nelse:\r\n print(ans)", "a,b,c,n=map(int,input().split())\r\nif a<c or b<c:\r\n\tprint(-1)\r\n\texit()\r\na-=c\r\nb-=c\r\nk=n-a-b-c\r\n\r\nif a+b+c>=n:print(-1)\r\nelse:print(k)", "a,b,c,d=map(int,input().split());print([-1] if a<c or b<c or a+b-c>=d else [d-(a+b-c)] )", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\na,b,c,n=list(map(int,input().split()))\r\nx=a+b-c\r\nprint(n-x if c<=a and c<=b and x<n else -1)\r\n", "a,b,c,n=map(int,input().split())\r\nif(c>b or c>a or c>n):\r\n print(-1)\r\nelse:\r\n k=c+(a-c)+(b-c)\r\n k=n-k\r\n if(k>0):\r\n print(k)\r\n else:\r\n print(-1)\r\n\r\n", "a,b,c,n = map(int, input().split())\r\n\r\ntemp = n-a-b+c\r\nif(temp<=0 or temp>n or min(a,b)<c): print(-1)\r\nelse: print(temp)", "a,b,c,n = [int(i) for i in input().split()]\r\n\r\nif(n < a or n < b or n < c or c > a or c > b):\r\n print(-1)\r\nelif n - (a + b - c) >= 1:\r\n print(n - (a + b - c))\r\nelse:\r\n print(-1)\r\n", "a,b,c,n= [int(c) for c in input().split()]\r\nu=a+b-c\r\nif a<c or b<c:\r\n\tprint(-1)\r\nelse:\r\n\tif n-u>=1:\r\n\t\tprint(n-u)\r\n\telse:\r\n\t\tprint(-1)\r\n", "# coding=utf-8\na,b,c,n=map(int,input().split())\r\n# x4=a-c\r\n# x3=b-c\r\n# x2=c\r\nif a-c>=0 and b-c>=0 and a-c+b+1<=n:\r\n print(n-a+c-b)\r\nelse:\r\n print(-1)\r\n\r\n\n\t\t\t\t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t", "a,b,c,n=map(int,input().split())\r\nk=n-(a+b-c)\r\nif k<1 or a<c or b<c :\r\n\tprint(-1)\r\nelse:\r\n\tprint(k)", "a,b,c,n=list(map(int,input().split()))\r\np=(a+b-c)\r\nf=n-p\r\nif p>=n or c>a or c>b:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(f)", "A,B,C,N = map(int,input().strip().split())\n\nflag = True\nif C>A or C>B:\n flag = False\nD = N - (A - C) - B\nif D >= 1 and flag:\n print(D)\nelse:\n print(-1)\n \t\t\t\t\t\t \t \t \t\t \t \t \t \t", "a,b,c,n=map(int,input().split())\r\nif n-a-b+c<1 or c>(min(a,b)):\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,n = map(int,input().split())\r\na-=c\r\nb-=c\r\nif a>=0 and b>=0:\r\n if (a+b+c)<n:\r\n n-=(a+b+c)\r\n print(n)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "A,B,C,N = map(int,input().split())\r\nif A-C>=0 and B-C>=0 and A+B-C<N:\r\n print(N-A-B+C)\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c, n = map(int, input().split())\r\n\r\nx = n-(a+b-c)\r\nprint(x if (x > 0 and a < n and b < n and c <= a and c <= b) else -1)", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n a, b, c, n = P()\r\n\r\n if a < c or b < c:\r\n r = -1\r\n else:\r\n r = n - (a + b - c)\r\n print(-1 if r <= 0 else r)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\na, b, c, n = map(int, input().split())\r\n\r\ntotal_pass = a+b-c\r\n\r\nif total_pass >= n or c > a or c > b:\r\n print(-1)\r\nelse:\r\n print(n-total_pass)\r\n\r\n", "def solve(A: int, B: int, C:int, D: int) -> int:\r\n passed = A+B-C\r\n failed = N-passed\r\n if A < C or B < C or passed < 0 or failed < 1:\r\n return(-1)\r\n return(failed)\r\n \r\nA, B, C, N = [int(x) for x in input().split()]\r\nprint(solve(A, B, C, N))\r\n\r\n\r\n\r\n \r\n\r\n \r\n ", "a,b,c,n = map(int,input().split())\r\nif c > a or c > b or (a+b) - c >=n:\r\n print(-1)\r\nelse:\r\n print(n -((a+b)-c))", "a, b, c, n = map(int, input().split())\r\nt = a + b - c\r\nif a >= n or b >= n or c > a or c > b or t >= n:\r\n print(-1)\r\nelse:\r\n print(n - t)\r\n", "a,b,c,n = map(int,input().split())\nt = a + b - c\nl = n - t\nif l > 0 and c <= min( a,b ):\n print( l )\nelse:\n print( -1 )\n", "a, b, c, n = list(map(int, input().split()))\r\nnewa = a-c\r\nnewb = b-c\r\nif newa + newb + c >= n or (c > a or c > b):\r\n print(-1)\r\nelse:\r\n print(n - (newa + newb + c))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c, n = map(int, input().split())\r\nif min(a, b) < c:\r\n ans = -1\r\nelse:\r\n x = n - (a + b - c)\r\n ans = x if x > 0 else -1\r\nprint(ans)", "a, b, c, d = map(int, input().split())\r\nprint([-1] if a<c or b<c or a+b-c>=d else [d-(a+b-c)] )", "a,b,c,n=map(int,input().split())\r\nif n==0:print(-1)\r\nelse:\r\n if((a-c)<0) or ((b-c)<0):print(-1)\r\n else:\r\n x=(n+c)-(a+b)\r\n print([-1,x][x>=1])", "a,b,c,d = input().split()\r\na= int(a)\r\nb= int(b)\r\nc = int(c)\r\nd= int(d)\r\n\r\ntemp = int(a-c)\r\ntemp1 = int(b-c)\r\nss = int(temp+temp1+c)\r\n\r\nif ss >= d:\r\n print(\"-1\")\r\nelif a<c:\r\n print(\"-1\")\r\nelif b<c:\r\n print(\"-1\")\r\nelse:\r\n print(d-ss)", "a,b,c,n=map(int,input().split())\r\nif(a>=c and b>=c):\r\n if(n-(a+b-c)>0):\r\n print(n-(a+b-c))\r\n else:\r\n print(\"-1\") \r\nelse:\r\n print(\"-1\")", "\r\na, b, c, n = map(int, input().split())\r\na -= c\r\nb -= c\r\n\r\nif a < 0 or b < 0:\r\n print(-1)\r\nelse:\r\n ans = n - (a+b+c)\r\n if ans < 1:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n \r\n", "a,b,c,n=map(int,input().split())\r\na-=c\r\nb-=c\r\nif a>=0 and b>=0 and a+b+c<n:\r\n print(n-a-b-c)\r\nelse :\r\n print(-1) ", "a,b,c,n=map(int,input().split())\r\nok = True\r\n\r\nif c>a or c>b: ok=False\r\nif a+b-c>n: ok=False\r\nif n-(a+b-c)==0: ok=False\r\n\r\nprint(n-(a+b-c) if ok else '-1')", "a,b,c,d=map(int,input().split())\r\nif abs(a-c)+abs(b-c)+c>d or (c>a or c>b):\r\n print(-1)\r\nelif abs(a-c)+abs(b-c)+c<d:\r\n print(abs((abs(a-c)+abs(b-c)+c)-d))\r\nelse:\r\n print(-1)", "\r\na,b,c,n=map(int,input().split())\r\n\r\njust_a=abs(c-a)\r\njust_b=abs(c-b)\r\n\r\nfail=n-just_a-just_b-c\r\n\r\n#print(just_a,just_b,fail)\r\nif fail>0 and c<=a and c<=b:\r\n print(fail)\r\nelse:\r\n print(-1)", "A, B, C, N = [int(x) for x in input().split()]\r\n\r\nif N < C or N < A or N < B or C > A or C > B:\r\n print(-1)\r\nelse:\r\n answer = N - A - B + C\r\n\r\n print(answer if answer >= 1 else -1)\r\n", "A, B, C, N = map(int, input().strip().split())\r\nD = N - (A + B - C)\r\nif D <= 0 or C > A or C > B:\r\n print('-1')\r\n exit(0)\r\nprint(D)\r\n", "def main_function():\r\n A, B, C, N = [int(i) for i in input().split(\" \")]\r\n if A - C + B < N and C <= A and C <= B:\r\n print(N - (A + B - C))\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\nmain_function()", "a, b, c, n = map(int, input().split())\r\nif a-c < 0 or b-c < 0 or n-(a+b-c) < 1: \r\n print(-1)\r\nelse: \r\n print(n-(a+b-c))", "a,b,c,n=map(int,input().split())\r\nif(n-(a+b-c)>=1 and a>=c and b>=c):\r\n print(n-(b+a-c))\r\nelse:\r\n print(-1)", "a, b , c, n= map(int, input().split())\ntmp = a + b - c\ntmp = n - tmp\nif c > a or c > b:\n print(-1)\nelif tmp < 1:\n print(-1)\nelse:\n print(tmp)\n\n", "def check(n, index, lista):\r\n for i in range(n):\r\n if lista[i] > lista[index]:\r\n return True\r\n return False\r\n \r\ndef check2(n, index, lista):\r\n for i in range(n):\r\n if lista[i] < lista[index]:\r\n return True\r\n return False\r\n\r\nx = [int(x) for x in input().split()]\r\ncontradics = False\r\n\r\nif check(3, -1, x) or check2(2, 2, x):\r\n contradics = True\r\n\r\nif x[2]:\r\n for i in range(2):\r\n x[i] -= x[2]\r\n \r\n\r\nsuma = sum(x[:-1])\r\nans = x[-1] - suma \r\n\r\nif contradics or ans <= 0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "A , B , C , N = map(int,input().split())\r\n\r\nif C > A or C > B :\r\n print(-1)\r\nelse :\r\n A -= C\r\n B -= C\r\n Total = A + B + C\r\n if Total >= N :\r\n print(-1)\r\n else:\r\n print(N - Total)", "a, b, c, n = map(int, input().split())\r\nif ((a-c)+(b-c)+c) < n and ((not(c>a)) and (not(c>b))):\r\n print (n-((a-c)+(b-c)+c))\r\nelse:\r\n print(-1)", "a,b, c, n = [int(x) for x in input().split()]\npa = a - c\npb = b - c\n\nif pa < 0 or pb < 0 or (pa + pb + c > n-1):\n print(-1)\nelse:\n print(n - (pa + pb + c))", "a,b,c,n=map(int,input().split())\r\nn-=a+b-c\r\nprint((-1,n)[n>0and a>=c<=b])", "s=input().split()\r\na,b,c,n=int(s[0]),int(s[1]),int(s[2]),int(s[3])\r\npas=a+b-c\r\nif pas>=n or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(n-pas)", "a,b,c,n=map(int,input().split())\r\nif min(c,a,b)!=c or n-1<a+b-c:\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "# from dust i have come dust i will be\n\na,b,c,n=map(int,input().split())\n\njust_a=abs(c-a)\njust_b=abs(c-b)\n\nfail=n-just_a-just_b-c\n\n#print(just_a,just_b,fail)\nif fail>0 and c<=a and c<=b:\n print(fail)\nelse:\n print(-1)\n", "a,b,c,d=list(map(int,input().split()))\r\nprint(-1 if d-a-b+c<=0 or a<c or b<c else d-a-b+c)", "a,b,c,n=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif n-(a+b-c)>=1 and a>=c and b>=c:\r\n print(n-(a+b-c))\r\nelse:\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\n\r\nif a-c >= 0 and b-c >= 0 and c >= 0 and (n-((a-c)+c+(b-c))) > 0:\r\n print(n-((a-c)+c+(b-c)))\r\nelse :\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\nx=a-c\r\ny=b-c\r\nsum=n-x-y-c\r\nif(x>=0 and y>=0 and c>=0 and sum>0):\r\n print(sum)\r\nelse:\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\nif c>a or c>b:\r\n\tprint('-1')\r\n\texit()\r\nprint([-1,n+c-a-b][n-(a+b-c)>0])", "a,b,c,n = list(map(int,input().split()))\r\nif a <c or b<c or n<c or n<a or n<b or a+b+c == n:\r\n print(-1)\r\n quit()\r\na-=c\r\nb-=c\r\nif a+b+c == n or a+b> n:\r\n print(-1)\r\n quit()\r\nprint(n-a-b-c)\r\n", "a,b,c,n=map(int,input().split())\r\n\r\nif(not(a>=c and b>=c)):\r\n\tprint(-1)\r\n\texit()\r\nans=n-(a+b-c)\r\n\r\nif(ans>0):\r\n\tprint(ans)\r\nelse: print(-1)" ]	{"inputs": ["10 10 5 20", "2 2 0 4", "2 2 2 1", "98 98 97 100", "1 5 2 10", "5 1 2 10", "6 7 5 8", "6 7 5 9", "6 7 5 7", "50 50 1 100", "8 3 2 12", "10 19 6 25", "1 0 0 99", "0 1 0 98", "1 1 0 97", "1 1 1 96", "0 0 0 0", "100 0 0 0", "0 100 0 0", "100 100 0 0", "0 0 100 0", "100 0 100 0", "0 100 100 0", "100 100 100 0", "0 0 0 100", "100 0 0 100", "0 100 0 100", "100 100 0 100", "0 0 100 100", "100 0 100 100", "0 100 100 100", "100 100 100 100", "10 45 7 52", "38 1 1 68", "8 45 2 67", "36 36 18 65", "10 30 8 59", "38 20 12 49", "8 19 4 38", "36 21 17 72", "14 12 12 89", "38 6 1 44", "13 4 6 82", "5 3 17 56", "38 5 29 90", "22 36 18 55", "13 0 19 75", "62 65 10 89", "2 29 31 72", "1 31 19 55", "1 25 28 88", "34 32 28 33", "43 36 1 100", "16 39 55 70", "2 3 0 91", "55 29 12 48", "7 33 20 88", "40 38 27 99", "18 28 14 84", "34 25 25 92", "4 24 5 76", "5 22 16 96", "1 1 0 4", "5 5 3 1", "0 0 0 1", "2 3 0 8", "5 5 2 5", "1 2 1 3", "3 0 0 4", "0 0 0 5", "5 5 0 3", "5 6 1 7", "10 10 10 11", "0 0 0 10", "5 15 5 30", "3 2 0 7"], "outputs": ["5", "-1", "-1", "1", "-1", "-1", "-1", "1", "-1", "1", "3", "2", "98", "97", "95", "95", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "100", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "4", "30", "16", "11", "27", "3", "15", "32", "75", "1", "-1", "-1", "-1", "15", "-1", "-1", "-1", "-1", "-1", "-1", "22", "-1", "86", "-1", "-1", "48", "52", "58", "-1", "-1", "2", "-1", "1", "3", "-1", "1", "1", "5", "-1", "-1", "1", "10", "15", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	93
d0e23c6e96b781e15b7393a41c955eb8	Chores	Petya and Vasya are brothers. Today is a special day for them as their parents left them home alone and commissioned them to do n chores. Each chore is characterized by a single parameter — its complexity. The complexity of the i-th chore equals hi. As Petya is older, he wants to take the chores with complexity larger than some value x (hi<=><=x) to leave to Vasya the chores with complexity less than or equal to x (hi<=≤<=x). The brothers have already decided that Petya will do exactly a chores and Vasya will do exactly b chores (a<=+<=b<==<=n). In how many ways can they choose an integer x so that Petya got exactly a chores and Vasya got exactly b chores? The first input line contains three integers n,<=a and b (2<=≤<=n<=≤<=2000; a,<=b<=≥<=1; a<=+<=b<==<=n) — the total number of chores, the number of Petya's chores and the number of Vasya's chores. The next line contains a sequence of integers h1,<=h2,<=...,<=hn (1<=≤<=hi<=≤<=109), hi is the complexity of the i-th chore. The numbers in the given sequence are not necessarily different. All numbers on the lines are separated by single spaces. Print the required number of ways to choose an integer value of x. If there are no such ways, print 0. Sample Input 5 2 3 6 2 3 100 1 7 3 4 1 1 9 1 1 1 1 Sample Output 3 0	[ "n,a,b= map(int,input().split())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nprint(x[b]-x[b-1])", "#Antonio Hernandez Monsalvo\r\nmiLista = []\r\nenter = input().split()\r\nn = int(enter[0])\r\na = int(enter[1])\r\nb = int(enter[2])\r\n2<=n<=2000\r\n\r\ndef bubbleSort(tareas):\r\n\tfor long in range (len(tareas) -1, 0, -1):\r\n\t\tfor i in range (0, long):\r\n\t\t\tif tareas[i] > tareas[i + 1]: #Cambio\r\n\t\t\t\ttemp = tareas[i]\r\n\t\t\t\ttareas[i] = tareas[i + 1]\r\n\t\t\t\ttareas[i + 1] = temp\r\n\r\ntareas = []\r\nnumbers = input().split()\r\nfor i in range (0,n):\r\n\ttareas.append(int(numbers[i]))\r\n\r\nif (a + b == n):\r\n bubbleSort(tareas)\r\n print(tareas[b] - tareas[b-1])\r\nelse: \r\n print(\"Error, el numero de tareas por persona no coincide con el no de tareas totales\")", "chores,petaya,vesaya = map(int,input().split())\r\norder = sorted(map(int,input().split()), reverse = True)\r\nprint (order[petaya-1] - order[petaya]) ", "s=input()\ns=s.split()\nn=int(s[0])\na=int(s[1])\nb=int(s[2])\nl=input()\nl=l.split()\nll=[int(i) for i in l]\nll.sort()\nprint(ll[n-a]-ll[b-1])\n\t\t\t \t \t \t\t \t\t\t \t\t\t\t\t \t", "n, a, b = map(int, input().split())\r\nlst = sorted(map(int, input().split()))\r\nprint(lst[b] - lst[b - 1])\r\n", "total_chores, p_chores, v_chores = map(int, input().split())\r\n\r\nchores = list(map(int, input().split()))\r\n\r\nchores.sort()\r\n\r\nv = chores[:v_chores]\r\np = chores[v_chores:]\r\n\r\nanswer = max(0, p[0] - v[-1])\r\n\t\r\nprint(answer)", "n,a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\na = l[b]-l[b-1]\r\nif(a>0):\r\n print(a)\r\nelse:\r\n print(0)", "n, a, b = [int(i) for i in input().split()]\r\nlst = sorted([int(i) for i in input().split()])\r\nprint(lst[b]-lst[b-1])\r\n", "def main():\n n,a,b = map(int,input().split(' '))\n arr = [int(val) for val in input().split()]\n \n if not arr:\n print(0)\n return\n \n if (a + b) != n:\n print(0)\n return\n\n arr.sort()\n bVal = arr[b-1]\n aVal = arr[b]\n\n print(aVal-bVal)\n\nmain()\n\t \t \t \t\t\t\t\t\t\t \t \t \t\t \t", "# n = int(input())\n# tn = [int(i) for i in input().split()]\n\n# def f(m):\n\n\n# m = 0\n# l = 0\n# r = n\n\n# while l < r:\n# m = (l + r)//2\n \n\nn, a, b = [int(i) for i in input().split()]\nhs = sorted([int(i) for i in input().split()], reverse=True)\n\nr = hs[a-1] - hs[a]\nprint(r)", "nab = list(map(int, input().split()))\nn = nab[0]\na = nab[1]\nb = nab[2]\nnums = list(map(int, input().split()))\nnums.sort()\ntemp1 = nums[:b]\ntemp2 = nums[b:]\n# print(temp1, \" \", temp2)\nprint(min(temp2) - max(temp1))\n", "n,a,b=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nprint(l[-a]-l[-a-1])", "n,a,b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\n\r\nh.sort()\r\nprint(h[n-a] - h[n-a-1])", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[-a]-l[b-1])", "n,a,b = input().split()\r\nchores = input().split()\r\nn,a,b = int(n),int(a),int(b)\r\n\r\nfor i in range(0,n):\r\n chores[i] = int(chores[i])\r\nchores.sort()\r\nvasya = chores[:b]\r\npetya = chores[b:]\r\n\r\nif petya[0]==vasya[b-1]:\r\n ans = 0\r\nelse:\r\n ans = petya[0]-vasya[b-1]\r\n\r\nprint(ans)\r\n", "n, older, younger = (list(map(int,input().split())))\r\nchores = (list(map(int,input().split())))\r\nchores.sort(reverse = True)\r\nc_old = chores[older-1]\r\n\r\nchores.sort()\r\nc_young = chores[younger-1]\r\n\r\nprint((c_old)-(c_young))", "n, a, b = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\nchores.sort()\r\nfirst = chores[:b]\r\nsecond = chores[b:n]\r\n\r\nx = 0\r\n\r\nx = second[0] - first[len(first) - 1]\r\n\r\nprint(x)\r\n", "def find_number_of_ways(n, a, b, arr):\r\n arr = sorted(arr)\r\n return arr[b] - arr[b - 1]\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nH = list(map(int, input().split()))\r\ntotalWays = find_number_of_ways(first_line_input[0], first_line_input[1], first_line_input[2], H)\r\nprint(totalWays)\r\n", "n,b,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(); print(a[c] - a[c-1])\r\n", "n, a, b=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nprint(l[-a]-l[-a-1])", "n,a,b=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nprint(list1[b]-list1[b-1])", "import random\r\n\r\ndef findKthSmallest(nums, k, rrr):\r\n ankor = nums[random.randint(0,len(nums)-1)]\r\n left, mid, right = [], [], []\r\n for x in nums:\r\n if x < ankor:\r\n left += [x]\r\n elif x > ankor:\r\n right += [x]\r\n else:\r\n mid += [x]\r\n if k <= len(left):\r\n return findKthSmallest(left, k, ankor)\r\n elif k <= len(left) + len(mid):\r\n rr = ankor if (k < len(left) + len(mid)) else (min(right) if right else rrr)\r\n return (ankor, rr)\r\n else:\r\n return findKthSmallest(right, k - len(left) - len(mid), rrr)\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nif a == n or b == n:\r\n print(n)\r\nelse:\r\n s, t = findKthSmallest(h, b, -100101)\r\n print(t - s)", "n,a,b=[int(i) for i in input().split(\" \")]\r\narr=[int(i) for i in input().split(\" \")]\r\narr.sort()\r\nprint(arr[n-a]-arr[b-1])\r\n\r\n", "n,m,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(a[p]-a[p-1])", "n,a,b=list(map(int, input().split()))\r\nh=list(map(int, input().split()))\r\nh=sorted(h)\r\ndiff=h[b]-h[b-1]\r\nprint(diff)\r\n", "n,a,b=[int(x) for x in input().split()]\r\nh=[int(x) for x in input().split()]\r\nh.sort(reverse=True)\r\nif h[a-1]==h[a]:\r\n print(0)\r\nelse:\r\n print(h[a-1]-h[a])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\nh, = map(int, input().split())\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n", "#!/usr/bin/python\r\n\r\n# http://codeforces.com/problemset/problem/169/A\r\n\r\nn = [int(i) for i in input().split()]\r\nh = [int(i) for i in input().split()]\r\n\r\n# 1. sort chore complexity\r\n# 2. determine a[-x] value\r\n# 3. print a[-x] - [a-x-1]\r\na = n[1] # Petya chores\r\nb = n[2]\r\n\r\nh.sort()\r\n\r\nprint(h[-a] - h[-a-1])", "#169A\r\nn, a, b = map(int, input().split())\r\nt = sorted(list(map(int, input().split())))\r\nprint(t[b] - t[b - 1])", "n,a,b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort(reverse=True)\r\n\r\nans = h[a-1] - h[a]\r\nprint(ans)", "n, a, b = map(int, input().split())\nx = list(map(int, input().split()))\nx.sort()\nprint(x[-a] - x[b - 1])\n", "n, a, b = map(int, input().split())\n\nh = sorted(list(map(int, input().split())))\nx = h[b] - h[b-1]\n\nprint(x)", "X = list(map(int, input().split()))\r\nChores = list(map(int, input().split()))\r\nChores = sorted(Chores)\r\nprint(Chores[X[2]] - Chores[X[2]-1] if Chores[X[2]-1] not in Chores[X[2]:] else 0)\r\n", "nab = [int(i) for i in input().split()]\r\nn = nab[0]\r\na = nab[1]\r\nb = nab[2]\r\nh = sorted([int(i) for i in input().split()])\r\nprint(h[b] - h[b-1])\r\n", "n,a,b = map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nans=0\r\n\r\nl.sort()\r\nif l[-a]!=l[-a-1]:\r\n print(l[-a]-l[-a-1])\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\npet = arr[a - 1]\r\nvas = arr[a]\r\nprint(pet - vas)", "n, petya, vasya = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\n\r\nchores.sort()\r\ndifference = chores[vasya] - chores[vasya - 1]\r\nif difference == 0:\r\n print(0)\r\nelse:\r\n print(difference)", "n,a,b=map(int,input().split())\r\nl=list(sorted(map(int,input().split())))\r\nfor i in range(n):\r\n if i==b-1:\r\n print(abs(l[i]-l[i+1]))\r\n break\r\n\r\n \r\n \r\n \r\n", "n,a,b=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nk.sort(reverse=True)\r\nprint(k[a-1]-k[a])\r\n", "n,a,b= input().split()\r\n\r\nli= list(map(int, input().split()))\r\nli.sort(reverse=True)\r\n\r\nc= int(a)-1\r\nx=int(li[int(a)])\r\nxx=int(li[c]) \r\nif xx>x:\r\n print( xx-x )\r\nelse:\r\n print(0)", "def _input():\r\n h = []\r\n n, a, b = map(int, input().split())\r\n hs = input().split()\r\n for i in range(0, n):\r\n h.append(int(hs[i]))\r\n return n, a, b, h\r\n\r\ndef chores(n, a, b, h):\r\n h.sort(reverse=False)\r\n return h[b] - h[b - 1]\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b, h = _input()\r\n ret = chores(n, a, b, h)\r\n print(ret)", "# https://codeforces.com/problemset/problem/169/A\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nh = sorted(map(int, input().split()))\r\n\r\nprint(h[b] - h[b-1])\r\n", "n,a,b=list(map(int,input().split()))\r\nh=sorted(list(map(int,input().split())))\r\nprint(h[b]-h[b-1])", "nab=input().split()\nl=input().split()\nnab=[int(i) for i in nab]\nl=[int(i) for i in l]\nl.sort()\nif(l[nab[2]-1]==l[nab[2]]):\n print(0)\nelse:\n print(l[nab[2]]-l[nab[2]-1])\n", "#Day 2 exercise\n#Chores\nfirst = input('').split()\nn = int(first[0])\na = int(first[1])\nb = int(first[2])\nlst = list(map(int,input('').split()))\nlst.sort()\ni = b-1\ncount = 0\n\ncount = lst[len(lst) - a] - lst[b-1]\nif count > 0:\n print(count)\nelse:\n print(0)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\ndata = sorted(map(int, input().split()))\r\n\r\nprint(data[b] - data[b - 1])", "#!/usr/bin/python\n\n# http://codeforces.com/problemset/problem/169/A\n# 2-pointer\n\n# As Petya is older, he wants to take the chores with complexity larger than some value x (hi > x)\n# to leave to Vasya the chores with complexity less than or equal to x (hi ≤ x).\n# The brothers have already decided that Petya will do exactly a chores and Vasya will do exactly b chores (a + b = n).\n# --> find 'x' based on given 'a' & 'b'\n\n\n# define function\ndef test(g, h):\n a = g[1] # the number of Petya's chores\n b = g[2] # the number of Vasya's chores\n h.sort()\n return h[b] - h[b - 1]\n\n\n# call function\ng = [int(i) for i in input().split()]\nh = [int(i) for i in input().split()]\nprint(test(g, h))\n", "def f(): return [int(i) for i in input().split()]\n[n, a, b], h = f(), f()\nh.sort()\nprint(h[b] - h[b-1])\n", "n,a,b = map(int,input().split(' '))\r\nh = list(map(int,input().split(' ')))\r\nh.sort()\r\nprint(h[b]-h[b-1])", "n,a,b = map(int,input().split())\nh = list(map(int,input().split()))\nh.sort(reverse=True)\nx = h[a-1]-h[a]\nprint(x)\n", "n, a, b = map(int, input().split())\r\na = list(map(int,input().split()))\r\n\r\na = sorted(a)\r\nanh = []\r\nem = []\r\ncount = 0\r\nfor i in range (n):\r\n if count >= b:\r\n anh.append(a[i])\r\n else:\r\n count += 1\r\n em.append(a[i])\r\nif em[len(em)-1] == anh[0]:\r\n print (0)\r\nelse:\r\n print(abs(em[len(em)-1] - anh[0]))", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n, na, nb = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A.sort()\r\n l = A[nb-1]\r\n r = A[nb]\r\n print(r - l)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, a, b = [int(x) for x in input().split()]\r\nlist = [int(x) for x in input().split()]\r\nlist.sort(reverse=True)\r\n#print(a, list[a-1], list[a])\r\nif n <= 2:\r\n print(abs(list[1] - list[0]))\r\nelse:\r\n print(abs(list[a-1] - list[a])) ", "I = lambda:map(int,input().split())\r\nn,a,b = I()\r\nm = sorted(I())\r\nprint(m[b]-m[b-1])", "n, a, b = map(int, input().split())\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nprint(h[b]-h[b-1])\r\n", "input1 = list(map(int, input().split()))\r\ninput2 = sorted(list(map(int, input().split())))\r\n\r\na = input1[1]\r\ne = input1[2]\r\n\r\nx = input2[len(input2) - a]\r\ny = input2[e - 1]\r\n\r\nprint(x - y)", "n, a, b = map(int, input().split())\r\nc = sorted(list(map(int, input().split())))\r\nprint(c[b] - c[b - 1])", "n, a, b = [int(s) for s in input().split(' ')]\r\nh = [int(x) for x in input().split(' ')]\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nprint(lst[b] - lst[b - 1])", "# http://codeforces.com/problemset/problem/169/A?fbclid=IwAR2qjWxrKeECIDX3IvTsI-DC7jeJEtGIqj2vePzXa8OLBjqKkkMjcWpwm7Y\n\nnumber_of_jobs, petya_jobs, vasya_jobs = map(int, input().split(' '))\njob_complexities = list(map(int, input().split(' ')))\njob_complexities.sort(reverse=True)\n\nprint(job_complexities[petya_jobs - 1] - job_complexities[petya_jobs])", "n,a,b = map(int,input().split())\r\nc = []\r\nc = list(map(int,input().split()))\r\nc.sort()\r\nl = c[b-1]\r\nr = 0\r\nok = False\r\nfor i in range (b,n-a+1):\r\n if c[i] > l:\r\n ok = True \r\n r = c[i]\r\n break\r\nif ok == True: print(r-l) \r\nelse: print(0) ", "def solution(l1,l2):\r\n n,a,b=l1[0],l1[1],l1[2]\r\n #simple sort and calculate difference between sup of lower set and inf of upper set\r\n l2.sort()\r\n #a-th is a-1 position\r\n return l2[b]-l2[b-1] \r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "import heapq\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nif a == 0 or b == 0:\r\n print(n)\r\nelse:\r\n s = heapq.nsmallest(b + 1, h)\r\n t = heapq.nlargest(2, s)\r\n print(abs(t[1] - t[0]))\r\n ", "n, a, b = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\nchores.sort()\r\nprint(min(chores[-a:])-max(chores[:b]))", "if __name__ == \"__main__\":\n import sys\n\n [n, a, b] = [int(i) for i in sys.stdin.readline().split()]\n h = [int(i) for i in sys.stdin.readline().split()]\n\n h.sort()\n print(h[n-a] - h[n-a-1])\n \t\t\t\t \t \t\t\t \t \t \t\t \t \t", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\n# 1 2 3 6 100\r\n# 0 1 2 3 4\r\n\r\n# b - 1\r\n\r\nprint(arr[b] - arr[b-1])", "n,a,b = map(int, input().split())\nh = list(map(int, input().split()))\n\nh = sorted(h, key=lambda x: -x)\n\nx = h[a - 1]\ny = h[a]\n\nprint(x - y)\n", "n,a,b=list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(h[0-a]-h[b-1])\r\n", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nls = arr[0:b]\r\nls2 = arr[b::]\r\nprint(abs(max(ls)-min(ls2)))\r\n", "n,a,b = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nL.sort()\r\nprint(L[b] - L[b-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh = sorted(h)\r\n#print(h)\r\nprint(h[b] - h[b - 1]) ", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, a, b = map(int, input().split())\r\nh = sorted(list(map(int, input().split())))\r\nif h[b-1] == h[n-a]:\r\n print(0)\r\nelse:\r\n res = h[n - a] - h[b-1]\r\n print(res)", "# LUOGU_RID: 120108574\nn, a, b = map(int, input().split())\nhs = sorted(list(map(int, input().split())))\nprint(hs[b] - hs[b - 1])", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nprint(b[a[2]]-b[a[2]-1])", "a = [int(b) for b in input().split(\" \")]\r\nd = [int(c) for c in input().split(\" \")]\r\ne = sorted(d)\r\n\r\nfound = False\r\n\r\nfor i in range( len(e)-1 ):\r\n\tif a[2]-1 == i:\r\n\t\tprint( abs(e[i] - e[i+1] ) )\r\n\tfound = True\r\n\r\nif not found:\r\n\tprint(0)", "f=lambda:map(int,input().split())\r\nn,a,b=f()\r\nl=list(f())\r\nl.sort()\r\nprint(l[b]-l[b-1])\r\n\r\n", "pv = list(map(int,input().split()))\nls = list(map(int,input().split()))\nls.sort()\nprint(ls[pv[1](-1)]-ls[pv[2]-1])", "def insertion_sort(l):\r\n for i in range(len(l)):\r\n for j in range(i):\r\n k = i - j\r\n if l[k] < l[k - 1]:\r\n l[k], l[k - 1] = l[k - 1], l[k]\r\n return l\r\n\r\n#print(insertion_sort([2,5,4,3,2,1,2,3,4,5,6,7,65,4,3,2,3,5,6,87]))\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n l = insertion_sort([int(i) for i in input().split(\" \")])\r\n return str(l[b] - l[b-1])\r\n\r\n\r\n\r\nprint(main_function())\r\n", "n = list(map(int,input().split()))#n, a, b\r\n\r\na = list(map(int,input().split()))\r\n\r\ns = sorted(a, key=int)\r\n\r\nresult = s[n[2]] - s[n[2]-1]\r\n\r\nprint(result)\r\n", "def chores(n,a,b,h):\r\n h.sort()\r\n return (h[b]-h[b-1])\r\nn,a,b=[int(x) for x in input().split()]\r\nh = list(map(int, input().split()))\r\nprint (chores(n,a,b,h))", "a, b, c = map(int, input().split())\r\narr = sorted(map(int, input().split()))\r\n\r\nans = arr[-b] - arr[c-1]\r\n\r\nprint(ans)", "[n, a, b] = list(map(int, input().split()))\r\n\r\nh = list(map(int, input().split()))[:n]\r\n\r\nh.sort()\r\n\r\nvChores = 1\r\n\r\n# 1 2 3 6 100\r\nfor i in range(1, n):\r\n if(vChores == b):\r\n x = h[i] - h[i - 1]\r\n break\r\n else:\r\n vChores = vChores + 1\r\n\r\nprint(x)", "n, a, b = map(int, input().split())\r\nlst = sorted(list(map(int, input().split())))\r\nprint(lst[n-a]-lst[n-a-1])\r\n", "l = list(map(int,input().split()))\r\nl1 = list(map(int,input().split()))\r\nl1.sort()\r\nprint(l1[l[2]]-l1[l[2]-1])", "n, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nh = sorted(h)\r\n\r\nans = max(h[b] - h[b-1], 0)\r\n\r\nprint(ans)\r\n\r\n", "n,a,b=map(int,input().split())\r\nli = list(map(int,input().split()))\r\nli.sort(reverse=True)\r\nprint(li[a-1]-li[a])", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n# a: Petya\r\n# b: Vasya\r\n\r\narr.sort(reverse=True)\r\nmax_com = arr[a - 1]\r\nmix_com = arr[a]\r\n\r\nprint(max_com - mix_com)\r\n", "I = lambda: map(int, input().split())\r\n\r\n_, b = I()\r\nH = sorted(I())\r\n\r\nprint(H[b] - H[b-1])", "i=lambda:map(int,input().split())\r\n_,b=i()\r\nc=sorted(i())\r\nprint(c[b]-c[b-1])", "n,a,b=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst=sorted(lst)[::-1]\r\n#print(lst)\r\ntotal=lst[a-1]-lst[a]\r\nprint(total)\r\n", "n,a,b=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nlst= sorted(lst)\r\nfor i in range(n):\r\n x=lst[b-1]\r\n y= lst[b]\r\nprint(y-x)", "\r\n\r\n\r\n(n, a, b) = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nprint(a[b] - a[b - 1])\r\n", "n,a,b=map(int,input().split())\r\nc=sorted(list(map(int,input().split())))\r\nprint(c[-a]-c[-a-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\np = h[-a]\r\nq = h[b-1]\r\nprint(p-q)", "n,a,b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nprint(h[n-a] - h[b-1])\r\n", "n,a,b=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(l[b]-l[b-1])", "a,b,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort()\r\nprint(d[c]-d[c-1])\r\n\r\n\r\n", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nh=sorted(b,reverse=True)\r\nprint(h[a[1]-1]-h[a[1]])\r\n", "x,y,z=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[z]-a[z-1])", "import sys\r\n\r\nn, a, b = tuple([int(x) for x in sys.stdin.readline().split()])\r\nvalues = sorted([int(x) for x in sys.stdin.readline().split()])\r\n\r\nresult = abs(values[b] - values[b-1])\r\nprint(result)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Apr 21 15:40:36 2018\r\n\r\n@author: Quang Huy\r\n\"\"\"\r\n\r\nvalue=input()\r\nn, a, b = map(int, value.split())\r\nvalue=input()\r\nlist1=list(map(int, value.split()))\r\nlist1.sort();\r\nif (int(list1[b-1])<int(list1[b])):\r\n print(int(list1[b]) - int(list1[b-1]))\r\nelse: print(0)\r\n", "(n, a, b) = list(map(int, list(input().split())))\r\nh = list(map(int, list(input().split())))\r\n\r\nh = sorted(h)\r\n\r\nprint(h[n-a] - h[b-1])\r\n", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, a, b = IL()\r\nH = sorted(IL())\r\nprint(H[b] - H[b-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\n\r\nv = h[b-1]\r\np = h[-a]\r\nprint(p-v)\r\n\r\n", "n, a, b = [int(i) for i in input().split()]\nchores = sorted([int(i) for i in input().split()])\nprint(chores[-a] - chores[-a - 1])", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn,a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nh.sort()\r\nprint(h[b]-h[b-1])", "_, _, b = (int(i) for i in input().split())\nh = sorted(int(i) for i in input().split())\nres = h[b] - h[b - 1]\nprint(res)\n", "n, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nlow = h[b - 1]\r\nhigh = h[b]\r\nprint(high - low)", "a = [ int(b) for b in input().split(\" \") ]\r\nc = [ int(e) for e in input().split(\" \") ]\r\nd = sorted(c)\r\nfound = False\r\nfor i in range(len(d)-1):\r\n\tif a[2]-1 == i:\r\n\t\tprint(abs(d[i] - d[i+1]))\r\n\t\tfound = True\r\nif not found:\r\n\tprint(0)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef invr():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn,a,b = invr()\r\n\r\nh = invr()\r\n\r\nh.sort()\r\n\r\nprint(h[b] - h[b-1])\r\n", "n,a,b=map(int,input().split())\r\n\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nprint(A[b]-A[b-1])", "n,a,b=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\n\r\nseq.sort(key=lambda x: -x)\r\n\r\n\r\nprint(seq[a-1]-seq[a])", "def sol(complexArray, petya, vasya):\r\n complexArray.sort()\r\n if complexArray[vasya] > complexArray[vasya-1]:\r\n return complexArray[vasya] - complexArray[vasya-1]\r\n else:\r\n return 0\r\n\r\nsize, petya, vasya = map(int, input().split())\r\ncomplexArray = list(map(int, input().split()))\r\n\r\nans = sol(complexArray, petya, vasya)\r\nprint(ans)", "def count_possible_x(n, a, b, complexities):\r\n # find the a largest and b smallest complexities\r\n top_a = sorted(complexities, reverse=True)[:a]\r\n bottom_b = sorted(complexities)[:b]\r\n\r\n # find the minimum and maximum possible x values\r\n min_x = max(bottom_b)\r\n max_x = min(top_a)\r\n\r\n # return the number of possible x values, or 0 if there are none\r\n return max(max_x - min_x, 0)\r\n\r\n# example usage\r\nn, a, b = map(int, input().split())\r\ncomplexities = list(map(int, input().split()))\r\nprint(count_possible_x(n, a, b, complexities))\r\n", "n, a, b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh= sorted(h)\r\n\r\nx = h[b] - h[b-1]\r\nprint(x)\r\n", "s = input().split()\r\nn = int(s[0])\r\na = int(s[1])\r\nb = int(s[2])\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\ns.sort()\r\nprint(s[b]-s[b-1])", "n,a,b=input().split()\r\na=int(a)\r\nn=int(n)\r\nb=int(b)\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(abs(l[b-1]-l[b]))", "\r\n\r\nn , a , b = map(int , input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\nx.sort()\r\n\r\nprint(x[b] - x[b - 1])", "o = list(map(int,input().strip().split()))[:3]\r\nn = o[0]\r\np =o[1]\r\nv = o[2]\r\nb = list(map(int,input().strip().split()))[:n]\r\nb.sort()\r\nli_v = b[:v]\r\nli_p = b[v:]\r\nprint(li_p[0]-li_v[-1])", "# Wadea #\r\n\r\nn,a,b=map(int ,input().split())\r\narr=list(map(int ,input().split()))\r\narr.sort()\r\nk=arr[b-1]\r\ng=arr[b]\r\nprint(int(abs(k-g)))\r\n", "n, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nprint(l[b]-l[b-1])", "[n, a, b] = list(map(int,input().split(\" \")))\r\nh = list(map(int,input().split(\" \")))\r\nh.sort()\r\nprint(h[b]-h[b-1])\r\n", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort(reverse=True)\r\nx = h[a - 1] - h[a]\r\nif (x > 0):\r\n\tprint(x)\r\nelse:\r\n\tprint(\"0\")", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=10*9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\n# Summarize count of factor within list -- START --\ndef summarizeList(l):\n sl=sorted(l)\n\n a=sl[0]\n c=1\n res=[]\n\n for x in sl[1:]:\n if x==a:\n c+=1\n else:\n res.append([a,c])\n a=x\n c=1\n res.append([a,c])\n\n return res\n# Summarize count of factor within list --- END ---\n\ndef main():\n n,a,b=LI()\n l=LI()\n\n sl=summarizeList(l)\n sm=0\n c1=0\n c2=0\n f1=False\n f2=False\n for x,c in sl:\n sm+=c\n if sm==b:\n c1=x\n f1=True\n else:\n if f1:\n c2=x\n return c2-c1\n\n return 0\n\n# main()\nprint(main())\n", "fl = list(map(int, input().split()))\narr = list(map(int, input().split()))\ncount = 0\narr.sort() # 1,2,3,6,100\nx = arr[fl[2]] - arr[fl[2]-1]\nprint(x)\n", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nprint(arr[b] - arr[b - 1])", "n, a, b = map(int, input().split())\r\nf = sorted([int(_) for _ in input().split()])\r\nvasa = f[:b]\r\npetia = f[b:]\r\nd = range(vasa[-1], petia[0])\r\nprint(len(d))\r\n", "n , a , b = map(int,input().split())\r\n\r\nc = sorted(list(map(int,input().split())))\r\n\r\nprint(c[-a]-c[-a-1])", "n,a,b=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nprint(x[b]-x[b-1])", "n, a, b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nar = input().split()\r\nfor i in range(n):\r\n ar[i] = int(ar[i])\r\nar.sort()\r\nprint(ar[-a] - ar[b - 1])", "n, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))[:n]\r\n\r\nj = 0\r\ncount = 0\r\n\r\ndef insertion_sort(l):\r\n for i in range(1, len(l)):\r\n x = l[i]\r\n j = i\r\n while (j > 0) and (l[j-1] < x):\r\n l[j] = l[j-1]\r\n j -= 1\r\n l[j] = x\r\n return l\r\n\r\nh = insertion_sort(l)\r\n\r\nx = h[a-1] - h[a]\r\n\r\nprint(x)", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\n\r\nprint(arr[b] - arr[b-1])\r\n", "n,a,b = map(int,input().split())\r\nhi = list(map(int,input().split()))\r\nhi.sort()\r\nprint(hi[b] - hi[b-1])\r\n", "# Codeforces: 169A - Chores\r\n\r\nn, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nans = h[b] - h[b - 1]\r\n\r\nprint(ans)", "n,a,b = map(int,input().split())\r\nli = sorted(list(map(int,input().split())))\r\nprint(li[b] - li[b-1])", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=True)\r\na=a-1\r\nk=l[a]\r\np=l[a+1]\r\nif k==p:\r\n print(0)\r\nelse:\r\n print(k-(p+1)+1)", "(total_number_of_chores, petya_chores, vasya_chores) = map(int, input().split(' '))\nchores = list(map(int, input().split(' ')))\nchores.sort()\n\nboundary = chores[-petya_chores] - chores[vasya_chores - 1]\n\nif boundary > 0:\n print(boundary)\nelse:\n print(0)", "n , a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint( h[b] - h[b-1])\r\n", "I=lambda:map(int,input().split())\nn,a,b=I()\nm=sorted(I())\nprint(m[b]-m[b-1])\n \t \t \t \t\t\t \t \t\t \t \t", "n, a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort(reverse=True)\r\nstart, end = c[a], c[a-1]\r\nprint(end-start)", "n, a, b = map(int, input().split())\nchores = list(map(int, input().split()))\nchores.sort()\n\nprint(chores[b] - chores[b-1])\n", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr = sorted(arr, reverse=True)\r\n\r\nprint(arr[a-1] - arr[a])", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nprint(c[b]-c[b-1])", "t,m,n = map(int,input().split())\r\na = list(map(int,input().split()))\r\n \r\na.sort()\r\nm = a[n]-a[n-1]\r\nif(m>0):\r\n print(m)\r\nelse:\r\n print(0)", "def solve():\r\n n,a,b = list(map(int,input().split()))\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n print(l[b] - l[b-1])\r\nsolve()", "ip = input()\r\nn = int(ip.split()[0]) # tong so chores\r\na = int(ip.split()[1]) # so luong anh lam\r\nb = int(ip.split()[2]) # so luong e lam\r\nchore_cplx_list = list(map(int,input().split()))\r\nchore_cplx_list.sort()\r\nresult = chore_cplx_list[b] - chore_cplx_list[b-1]\r\nprint (result)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nh.sort()\r\nr=h[b]-h[b-1]\r\nprint(r)", "n, a, b =map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(abs(h[b-1]-h[b]))", "n , a , b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nprint(l[-a]-l[-(a+1)])\r\n", "# Chores\r\ndatain = True\r\n\r\nif datain:\r\n n, a, b = map(int, input().split())\r\n c = list(map(int, input().split()))\r\nelse:\r\n n, a, b = 5, 2, 3\r\n c = [6, 2, 3, 100, 1]\r\n\t\r\nc.sort()\r\n\r\nle = c[b-1]\r\nri = c[b]\r\n\r\nif (le == ri):\r\n\tprint('0')\r\nelse:\r\n\tprint(ri - le)", "n, a , b = map(int, input().split())\r\narr = [int(c) for c in input().split()]\r\narr.sort()\r\nprint(arr[-a]-arr[-a-1])\r\n", "def __init():\r\n num_input = input()\r\n num_input = num_input.split(\" \")\r\n n = int(num_input[0])\r\n a = int(num_input[1])\r\n b = int(num_input[2])\r\n\r\n h = input()\r\n h = h.split(\" \")\r\n for i in range(n):\r\n h[i] = int(h[i])\r\n \r\n return n, b, h\r\n\r\ndef solve(n, b, h):\r\n h.sort()\r\n return max(0, h[b] - h [b - 1])\r\n\r\nn, b, h = __init()\r\nprint(solve(n, b, h))\r\n\r\n", "n,a,b=map(int,input().split());r=sorted(map(int,input().split()));\r\ntry:print(r[b]-r[b-1])\r\nexcept:print(0)\r\n", "n,a,b=map(int,input().split())\r\nh=sorted(list(map(int,input().split())))\r\nprint(h[b]-h[b-1])", "first = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nn = first[0]\r\npetya = first[1]\r\nvasya = first[2]\r\narr.sort()\r\nstart = arr[vasya - 1]\r\nend = arr[n - petya]\r\nif end - start > 0:\r\n\tprint(str(end - start))\r\nelse:\r\n\tprint(\"0\")\r\n\r\n\r\n\t\t\r\n\t\r\n\t\t\r\n\t\t\r\n\r\n", "n,a,b = map(int,input().split())\r\nm=sorted(map(int,input().split()))\r\n\r\nprint(m[b]-m[b-1])\r\n", "#Chores - http://codeforces.com/problemset/problem/169/A\n#Petya takes on chores with complexity hi > x\n#Vasya takes on chores with complexity hi <= x\n#Petya does a chores\n#Vasya does b chores\nn,a,b = map(int,input().split())\nls = list(map(int,input().split()))\nls.sort()\nvasya = ls[b-1]\npetya = ls[b]\nprint(petya - vasya)\n", "n, a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nans = h[b] - h[b-1]\r\nprint(ans)", "n,a,b=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort(reverse=True)\r\nprint(list[a-1]-list[a])\r\n", "n , a, b = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nprint(l[a-1]-l[b-1])", "n, a, b = list(map(int, input().split()))\r\nsorted_chores = sorted(list(map(int, input().split())))\r\ncount = 0\r\nstart_index = b - 1\r\nif start_index < 0:\r\n start_index = 0\r\ncount = sorted_chores[start_index + 1] - sorted_chores[start_index]\r\nif count < 0:\r\n count = 0\r\nprint(count)\r\n", "n, a, b = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nw.sort()\r\n\r\n\r\nif w[b] != w[b-1]:\r\n\tprint(w[b]-w[b-1])\r\nelse:\r\n\tprint(0)\r\n\r\n# 1 2 3 6 100", "n, a, b = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nif ar[b - 1] == ar[b]:\r\n print(0)\r\nelse:\r\n print(ar[b] - ar[b - 1])", "#!/usr/bin/env/python\r\n# -- coding: utf-8 --\r\nn, a, b = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n", "from sys import stdin, stdout\r\nn, a, b = map(int, stdin.readline().split())\r\nH = list(map(int, stdin.readline().split()))\r\nH.sort()\r\n\r\nhardest_for_vasya = H[b-1]\r\neasiest_for_petya = H[b]\r\nans = easiest_for_petya - hardest_for_vasya\r\n\r\nprint(ans) if ans > 0 else print(0)", "def mergeSort(array):\r\n if len(array) > 1:\r\n\r\n # r is the point where the array is divided into two subarrays\r\n r = len(array)//2\r\n L = array[:r]\r\n M = array[r:]\r\n\r\n # Sort the two halves\r\n mergeSort(L)\r\n mergeSort(M)\r\n\r\n i = j = k = 0\r\n\r\n # Until we reach either end of either L or M, pick larger among\r\n # elements L and M and place them in the correct position at A[p..r]\r\n while i < len(L) and j < len(M):\r\n if L[i] < M[j]:\r\n array[k] = L[i]\r\n i += 1\r\n else:\r\n array[k] = M[j]\r\n j += 1\r\n k += 1\r\n\r\n # When we run out of elements in either L or M,\r\n # pick up the remaining elements and put in A[p..r]\r\n while i < len(L):\r\n array[k] = L[i]\r\n i += 1\r\n k += 1\r\n\r\n while j < len(M):\r\n array[k] = M[j]\r\n j += 1\r\n k += 1\r\n\r\n\r\narr = []\r\narr = input().split()\r\narr = [int(item) for item in arr]\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\nworks = []\r\nworks = input().split()\r\nworks = [int(item) for item in works]\r\nmergeSort(works)\r\ncounter = 0\r\nif works[b-1] < works[b]:\r\n counter = works[b] - works[b-1]\r\nprint(counter)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn, a, b = [int(x) for x in input().split()]\r\nq = sorted([int(x) for x in input().split()], reverse = True)\r\nprint(q[a-1]-q[a])\r\n", "n,a,b=map(int,input().split())\r\nchores=list(map(int,input().split()))\r\nchores.sort()\r\nprint(chores[b]-chores[b-1])", "n, a, b = map(int,input().split())\r\nps = list(map(int,input().split()))\r\nps.sort()\r\n\r\nc = ps[-a]\r\nd = ps[-a-1]\r\nif c == d:\r\n print(0)\r\nelif c > d:\r\n print(c-d)", "n,x,y=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nprint(l[y]-l[y-1])", "### Petya > x, Vasya <= x\r\nn, a, b = map(int, input().split())\r\ncomplexity = list(map(int, input().split()))\r\ncomplexity.sort()\r\nvasya_upper = complexity[b-1]\r\npetya_lower = complexity[b]\r\nif vasya_upper == petya_lower:\r\n print(0)\r\nelse:\r\n print(petya_lower-vasya_upper)\r\n", "n,a,b=map(int,input().split())\r\nx=sorted(list(map(int,input().split())))\r\nprint(x[b]-x[b-1])\r\n", "a,b,c=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\ntr=[int(x) for x in input().split(\" \")]\r\ntr.sort()\r\nprint(tr[c]-tr[c-1])", "_,a,b=map(int, input().split());l=sorted(list(map(int, input().split())));print(l[b:][0]-l[:b][b-1])", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n, a, b = map(int, input().split())\r\n h = list(map(int, input().split()))\r\n h.sort()\r\n print(h[b]-h[b-1])\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, a, b = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nprint(A[b] - A[b - 1])\r\n", "# link : https://codeforces.com/problemset/problem/169/A\r\n# sorting\r\nl = []\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nh = sorted([int(x) for x in input().split()])\r\n\r\n\r\ntry:\r\n print(h[b]-h[b-1])\r\nexcept :\r\n print(0)\r\n\r\n", "import sys\r\n\r\ndef main():\r\n n, a, b, l = map(int, sys.stdin.read().strip().split())\r\n l.sort()\r\n return l[n-a] - l[n-a-1]\r\n \r\nprint(main())\r\n", "n,a,b=map(int,input().split())\r\nh=sorted(map(int,input().split()))\r\nprint(h[b]-h[b-1])", "n,a,b=map(int,input().split())\r\nl=sorted([int(i) for i in input().split()])\r\na1=l[:b]\r\nb1=l[b:]\r\nprint(b1[0]-a1[-1])", "m,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif l[-a]-l[-a-1]>0:\r\n\tprint(l[-a]-l[-a-1])\r\nelse:\r\n\tprint('0')", "n,a,b=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nlst.sort(reverse=True)\r\nprint(lst[a-1]-lst[a])\r\n", "n,a,b = [x for x in map(int, input().strip().split(\" \"))]\r\ncomplexity = list(map(int,input().strip().split(\" \")))\r\n\r\ncomplexity_sorted = sorted(complexity)\r\nlast_a = complexity_sorted[-a:]\r\nx = min(last_a)\r\n\r\n\r\ncount = x-complexity_sorted[-a-1]\r\nprint(count)\r\n\r\n\r\n", "n,a,b = map(int,input().split())\r\n\r\n\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nt.sort()\r\n\r\n\r\n\r\n\r\nprint(abs(t[b]-t[::-1][a]))\r\n", "n, a, b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, n1, n2 = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(a[n2] - a[n2 - 1])", "#Day 3 Exercise#1\n#Chores\nn, a, b = map(int,input().split())\nls = list(map(int,input().split()))\n\nls.sort()\ncount = ls[b] - ls[b-1]\n\nprint(count)\n", "n, a, b = map(int, input().split())\r\nl = sorted([int(i) for i in input().split()])\r\nprint(l[b] - l[b-1])", "n,a,b=map(int, input().split())\r\nv=map(int,input().split())\r\nh=sorted(v,reverse=True)\r\nx=h[a-1]-h[a]\r\nprint(x)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\n\r\nc=l[a-1]-l[a]\r\nprint(c)\r\n", "def solve():\r\n\t\r\n\tn, a, b = map(int,input().split())\r\n\tarr = list(map(int,input().split()))\r\n\tarr.sort()\r\n\treturn arr[n-a] - arr[n-a-1]\r\n\t\r\nprint(solve())", "n,a,b = map(int, input().split())\r\nH = list(map(int, input().split()))\r\n\r\nH.sort()\r\n\r\nif H[b-1] == H[b]:\r\n print(0)\r\n quit()\r\nelse:\r\n print(H[b]-H[b-1])", "\r\n(n, a, b) = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nd1 = h[b-1]\r\nd2 = h[-a]\r\n\r\nprint(d2 - d1)", "n, a, b = map(int, input().split())\r\ncomplexity = list(map(int, input().split()))\r\n\r\nbrother_chores = sorted(complexity)[b:n]\r\nyounger_chores = sorted(complexity)[0:b]\r\nx = min(brother_chores) - max(younger_chores)\r\n\r\nprint(x)", "\r\nn, a, b = map(int, input().split())\r\narray = sorted(map(int, input().split()))\r\nprint(0) if array[b - 1] == array[b] else print(array[b] - array[b - 1])\r\n", "if __name__ == '__main__':\r\n n, a, b = list(map(int,input().split()))\r\n h = sorted(map(int,input().split()))\r\n print(h[b] - h[b-1])", "\n\n\nfirst_line = input().split()\nn = int(first_line[0])\na = int(first_line[1])\nb = int(first_line[2])\nh = [int(i) for i in input().split()]\n\n\nh.sort()\n\nif h[b] > h[b - 1]:\n print(h[b] - h[b-1])\nelse:\n print('0')\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse();print(l[a-1]-l[a])\r\n", "l1=(input())\nl2=(input())\nx=l1.split(' ')\ny=l2.split()\nz=list()\nn=int(x[0])\na=int(x[1])\nb=int(x[2])\nfor i in y:\n z.append(int(i))\nz.sort(reverse=True)\nif 2<=n<=2000 and a>=1 and b>=1:\n print(z[a-1]-z[a])\nelse:\n print(0)\n\n \t\t \t \t\t \t\t \t \t\t\t \t\t", "\r\n\r\nn, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nprint(l[b] - l[b-1] )\r\n", "if __name__==\"__main__\":\r\n n,a,b=map(int,input().split())\r\n li=list(map(int,input().split()))\r\n li.sort()\r\n # print(li)\r\n i=0\r\n while b>0:\r\n i+=1\r\n b-=1\r\n # print(i)\r\n # print(li[i])\r\n print(li[i]-li[i-1])\r\n", "n, a, b = map(int, input().split(' '))\nh = list(map(int, input().split(' ')))\nh = sorted(h)\n\nprint(h[b]-h[b-1])\n\n\n'''\nNote:\ntìm max của thằng e (x) và minimum của thằng a (y), mục đích là tìm y-x\n\n'''\n", "n,a,b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\n# n,a,b = 5, 2, 3,\r\n# h = [6, 2, 3, 100, 1]\r\n\r\n# n,a,b = 7, 3, 4\r\n# h = [1, 1, 9, 1, 1, 1, 1]\r\n\r\n# n,a,b = 2, 1, 1\r\n# h = [10, 2]\r\n\r\n#sort array\r\nh.sort()\r\n# print(h)\r\n# print(h[b-1])\r\n# print(h[n-a])\r\n\r\n#answer \r\nprint(h[n-a] - h[b-1])\r\n", "n,a,b = input().split()\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nb = int(b)\r\nprint(l[b]-l[b-1])", "a,b,c = map(int,input().split())\r\nz = sorted(list(map(int,input().split())))\r\nprint(z[-b]-z[-(b+1)])", "n, a, b = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nl = k[:b]\r\nh = k[b:]\r\nprint(h[0] - l[-1])", "n,a,b = map(int, input().split())\nlst=list(map(int, input().split()))\nlst.sort()\nprint(lst[b]-lst[b-1])", "n,p,v = input().split()\r\nx= list(map(int,input().split()))\r\n\r\nx.sort()\r\nprint(x[int(v)]-x[int(v)-1])", "def divideWork(h,a,b):\r\n h.sort()\r\n return h[b]-h[b-1] \r\n\r\nn,Petya,Vasya=map(int,input().split())\r\nh=list(map(int,input().split()))\r\n\r\nresult=divideWork(h,Petya,Vasya)\r\nprint(result)\r\n", "n,a,b=map(int,input().split())\r\nh= list(map(int,input().split()))\r\nh.sort()\r\nv=h[b-1]\r\np=h[b]\r\nprint(p-v)\r\n\r\n", "\r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\nres = arr[a - 1] - arr[a]\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort(reverse = False)\r\ntemp = c[n - a] - c[b - 1]\r\n\r\nif temp >= 0:\r\n print(temp)\r\nelse:\r\n print(0)", "n, a, b = map(int, input().split())\r\nl=list(map(int, input().split()))\r\n\r\nl.sort()\r\nprint(l[-a]-l[b-1])\r\n\r\n", "def chores(n,a,b,h):\r\n h.sort()\r\n return h[b]-h[b-1]\r\n\r\n\r\n\r\ng=input().split()\r\nn=int(g[0])\r\na=int(g[1])\r\nb=int(g[2])\r\nh=list(map(int,input().split()))\r\nprint(chores(n,a,b,h))", "import sys\r\n\r\nline1 = input()\r\ncomplex = input()\r\n\r\ntasks=line1.split()\r\ncomplex = [int(x) for x in complex.split()]\r\n\r\nnumber_task_of_Petya=int(tasks[1])\r\nnumber_task_of_Vasya=int(tasks[2])\r\n\r\n#print(\"Petya : \" + str(number_task_of_Petya))\r\n#print(\"Vasya : \" + str(number_task_of_Vasya))\r\n\r\nsorted_complex = sorted(complex)\r\n\r\n#print(\"sorted_complex : \" + str(sorted_complex))\r\n\r\n#task_of_Petya=[]\r\n#for i in range(number_task_of_Vasya):\r\n# task_of_Petya.append(i+1)\r\n\r\nend_task_of_Vasya = number_task_of_Vasya - 1\r\n#print(\"end_task_of_Vasya : \" + str(end_task_of_Vasya))\r\n\r\nstart_task_of_Petya = number_task_of_Vasya\r\n#print(\"start_task_of_Petya : \" + str(start_task_of_Petya))\r\n\r\n#print(\"Vasya : \" + str(sorted_complex[end_task_of_Vasya]))\r\n#print(\"Petya : \" + str(sorted_complex[start_task_of_Petya]))\r\nprint(str(sorted_complex[start_task_of_Petya] - sorted_complex[end_task_of_Vasya]))", "n,a,b=map(int ,input().split())\r\ncomplexity=list(map(int ,input().split()))\r\ncomplexity.sort()\r\n\r\nk=complexity[b-1]\r\ng=complexity[b]\r\nprint(int(abs(k-g)))", "a,b,c=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nmath=[int(x) for x in input().split(\" \")]\r\nmath.sort()\r\nprint(math[c]-math[c-1])", "n, a, b = list(map(int, input().split()))\r\nh = sorted(list(map(int, input().split())))\r\nans = h[b]-h[b-1]\r\nif ans == 0:\r\n print(ans)\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\nh = list(map(int, input().split()))\n\nv = sorted(h, key=lambda x: -x)\nx = v[a - 1]\ny = v[a]\nprint(x - y)\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=True)\r\na=a-1\r\ni=l[a]\r\nj=l[a+1]\r\nif i==j:\r\n print(0)\r\nelse:\r\n print(i-(j+1)+1)\r\n", "n,a,b = map(int, input().split(' '))\r\nh = list(map(int, input().split(' ')))\r\n\r\nh.sort()\r\n\r\nx = 0\r\ncnt = 0\r\nc,d = a,b\r\n\r\nfor i in range(n):\r\n if d == 0:\r\n if h[i] <= h[i-1]:\r\n print(0)\r\n break\r\n else:\r\n print(h[i] - h[i-1])\r\n break\r\n d -= 1\r\n", "R = lambda:map(int,input().split())\r\nn,m,l = R()\r\nk = sorted(R())\r\nprint(k[l]-k[l-1])", "n, a, b = list(map(int,input().split()))\r\nl=sorted(list(map(int,input().split())))\r\ncount = 0\r\nx= y =0\r\nvas = []\r\npet = []\r\nfor i in range(n):\r\n if x < b:\r\n vas.append(l[i])\r\n i+=1\r\n x+=1\r\n else:\r\n pet.append(l[i])\r\n\r\nmax = max(vas)\r\nmin = min(pet)\r\n\r\nprint(len(range(max,min)))\r\n", "def dela(lst, b):\r\n return sorted(lst)[b] - sorted(lst)[b - 1]\r\n\r\n\r\nn, a, b = [int(i) for i in input().split()]\r\nh = [int(j) for j in input().split()]\r\nprint(dela(h, b))\r\n", "n, a, b = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nprint(w[b]-w[b-1])", "nab = [int(x) for x in input().split()]\nn = nab[0]\na = nab[1]\nb = nab[2]\n\narr =[int(x) for x in input().split()]\narr.sort()\n\na1 = arr[n-a]\na2 = arr[n-a-1]\nprint(a1-a2)", "n, a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nanh = h[b:]\r\nem = h[0:b]\r\n\r\nans = anh[0] - em[-1]\r\nprint(ans)", "n,a,b = map(int,input().split())\r\n\r\nx = list(map(int,input().split()))\r\n\r\naa = sorted(x)\r\n\r\nprint(aa[b] - aa[b-1])", "a,b,c = map(int,input().split())\n\ntotal = list(map(int,input().split()))\ntotal.sort()\nif b<c:\n print(total[c]-total[c-1])\nelse:\n print(total[c]-total[c-1])\n \n\t\t\t \t \t\t \t\t\t\t\t\t \t\t \t \t \t", "chores_count, older_chores_count, younger_chores_count = map(int, input().split())\ncomplexity = list(map(int, input().split()))\nselected_complexity = 0\ncount = 0\n\ncomplexity.sort()\n\nyounger_chores = complexity[0: younger_chores_count]\nolder_chores = complexity[younger_chores_count: chores_count]\nprint(older_chores[0] - younger_chores[-1])\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,a,b = map(int, wtf[0].split())\r\n A = sorted(map(int, wtf[1].split()), reverse=True)\r\n ans = 0\r\n z = abs(a)\r\n if len(A) >= n:\r\n ans = A[z-1]-A[z]\r\n print(ans)\r\n", "n,a,b=map(int,input().split())\r\nalist=list(map(int,input().split()))\r\nalist.sort(reverse=True)\r\np=alist[a-1]\r\nq=alist[a]\r\nprint(p-q)", "mylist = []\r\nenter = input().split()\r\nn = int(enter[0])\r\na = int(enter[1])\r\nb = int(enter[2])\r\nnumbers = input().split()\r\nif(n != len(numbers)):\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(0, n):\r\n\t mylist.append(int(numbers[i]))\r\n\tdef sort(mylist):\r\n\t\tfor long in range(len(mylist)-1,0,-1):\r\n\t\t\tfor i in range(0, long):\r\n\t\t\t\tif mylist[i+1] > mylist[i]:\r\n\t\t\t\t\ttemp = mylist[i]\r\n\t\t\t\t\tmylist[i] = mylist[i+1]\r\n\t\t\t\t\tmylist[i+1] = temp\r\n\tsort(mylist)\r\n\tlist2 = []\r\n\twhile(a != 0):\r\n\t\tlist2.append(mylist[0])\r\n\t\tmylist.remove(mylist[0])\r\n\t\ta -= 1\r\n\tlist3 = mylist.copy()\r\n\tresult = min(list2) - max(list3)\r\n\tprint(result)\r\n\r\n\t", "a,b,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort(reverse=True)\r\nprint(d[b-1]-d[b])", "n,a,b = map(int,input().split())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse = True)\r\nprint(l[a-1] - l[a])\r\n", "# Link: https://codeforces.com/problemset/problem/169/A\n# Site: Codeforces\n# Name: Chores\n# ======================================================\n\nif __name__ == '__main__':\n n, a, b = list(map(int, input().split()))\n li = list(map(int, input().split()))\n li = sorted(li)\n\n res = li[-a] - li[b - 1]\n print(res)", "n, a, b = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\nprint(c[b] - c[b-1])", "n,a,b=[int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()]\r\nx.sort()\r\nv=x[:b]\r\np=x[b:]\r\nif max(v)==min(p):\r\n print(0)\r\nelse:\r\n print(min(p)-max(v))", "n, a, b = list(map(int, input().split()))\nsorted_chores = sorted(list(map(int, input().split())))\ncount = 0\nstart_index = b - 1\nif start_index < 0:\n start_index = 0\ncount = sorted_chores[start_index + 1] - sorted_chores[start_index]\nif count < 0:\n count = 0\nprint(count)\n", "_, a, b = map(int, input().split())\r\ndata = sorted(map(int, input().split()))\r\nprint(data[b] - data[b - 1])\r\n", "n, a, b = map(int, input().split())\nhs = sorted(list(map(int, input().split())))\nprint( hs[b] - hs[b-1] )\n\n\t \t \t\t\t \t \t\t\t \t \t\t \t \t\t\t\t\t\t", "from sys import exit\r\n\r\ndef sort(nums):\r\n for i in range(len(nums)-1):\r\n smallnum = nums[i + 1]\r\n smalldex = i + 1\r\n for j in range(i, len(nums)):\r\n if nums[j] < smallnum:\r\n smallnum = nums[j]\r\n smalldex = j\r\n nums[smalldex] = nums[i]\r\n nums[i] = smallnum\r\n return nums\r\n\r\n\r\ninfo = input().split()\r\nchorenum = int(info[0])\r\npchores = int(info[1])\r\nvchores = int(info[2])\r\nchores = input().split()\r\nchores = [int(x) for x in chores]\r\nchores = sort(chores)\r\ncomplexity = 0\r\nways = 0\r\n\r\nways = int(chores[vchores]) - int(chores[vchores-1])\r\nprint(ways)\r\n", "n,a,b = map(int,input().split())\r\nmission=sorted(map(int,input().split()))\r\n\r\nprint(mission[b]-mission[b-1])\r\n", "import sys\r\nimport math\r\n\r\nn, a, b = [int(x) for x in (sys.stdin.readline()).split()]\r\nhi = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nhi.sort()\r\n\r\nprint(hi[b] - hi[b - 1])\r\n\r\n \r\n ", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nend_b = arr[b-1]\r\nstart_a = arr[b]\r\nif end_b < start_a:\r\n print(start_a - end_b)\r\nelse:\r\n print(0)\r\n", "n, a, b = tuple(map(int, input().split()))\r\nh = sorted(list(map(int, input().split())))\r\n\r\nstatus = None\r\nPeter = h[-a:]\r\ndiff = h[-a] - h[-a-1]\r\nif diff == 0:\r\n status = 0\r\nelse:\r\n status = diff\r\nprint (status)", "n, right, left = map(int, input().split())\nchores = list(map(int, input().split()))\nchores.sort()\na, b = chores[left-1], chores[left]\nprint(b-a)\n", "from sys import stdin, stdout\r\n\r\nn, a, b = map(int, stdin.readline().split())\r\nvalues = sorted(list(map(int, stdin.readline().split())))\r\n\r\nstdout.write(str(values[b] - values[b - 1]))", "n , a, b = map(int,input().split())\r\nchores = list(map(int,input().split()))\r\n\r\nchores.sort()\r\n\r\nPetya = chores[-a]\r\nVasya = chores[b -1]\r\n\r\nprint(Petya - Vasya)\r\n", "c = list(map(int,input(\"\").split()))\nd = sorted(list(map(int,input(\"\").split())))\nprint(d[-c[1]:][0] - d[:c[2]][-1])\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 26 06:24:05 2020\r\n\r\n@author: Ngo-Manh.Tuan\r\n\"\"\"\r\n\r\nlist_input = list(map(int, input().split()))\r\nn, a, b = list_input[0], list_input[1], list_input[2]\r\nchores = list(map(int, input().split()))\r\n\r\nchores = sorted(chores)\r\n\r\nprint(chores[b] - chores[b-1])", "n, a , b = map(int, input().split())\r\n*h, = map(int, input().split())\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, a, b =[int(i)for i in input().split()]\r\nl=list(map(int, input().strip().split()))\r\nl.sort(reverse=True)\r\nsolve=l[a-1]-l[a]\r\nif(solve>0):\r\n print(solve)\r\nelse:\r\n print(\"0\")", "n, a, b = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort(reverse=True)\r\nprint(h[a-1]-h[a])\r\n", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[b] - arr[b - 1])", "inp = list(map(int,input().split()))\r\nn=inp[0]\r\na=inp[1]\r\nb=inp[2]\r\ninp = list(map(int,input().split()))\r\ninp.sort(reverse=True)\r\nif(inp[a-1]-inp[a]<0):\r\n print (0)\r\nelse:\r\n print (inp[a-1]-inp[a])", "# http://codeforces.com/problemset/problem/169/A\n# A. Chores\n\ndef read_input():\n n, a, b = [int(i) for i in input().split(\" \")]\n h = [int(i) for i in input().split(\" \")]\n return (n, a, b, h)\n\ndef do_chores(n, a, b, h):\n h.sort()\n last_b = h[b - 1]\n first_a = h[b]\n # print(h)\n # print(last_b, first_a)\n\n return first_a - last_b\n\n\ndef main():\n n, a, b, h = read_input()\n print(do_chores(n, a, b, h))\n\n\nif __name__ == '__main__':\n main()", "def inp(): return map(int, input().split())\r\nn,a,b = inp()\r\nh = list(inp())\r\nh.sort()\r\nprint(h[b] - h[b-1])", "n,a,b=map(int,input().split())\nli=sorted(list(map(int,input().split())))\nprint(li[b]-li[b-1])\n\n \t \t \t\t\t \t\t\t \t \t\t \t \t\t \t\t \t\t", "from sys import stdin, stdout\r\n\r\nn, a, b = map(int, stdin.readline().split())\r\nH = list(map(int, stdin.readline().split()))\r\nH.sort()\r\n\r\nhardest_for_vasya = H[b-1]\r\neasiest_for_petya = H[b]\r\nans = easiest_for_petya - hardest_for_vasya\r\n\r\nstdout.write(str(ans)) if ans > 0 else stdout.write(str(ans))\r\n", "nums = list(map(int, input().split()))\nmylength = nums[1]\nallnums = list(map(int, input().split()))\nallnums.sort(reverse=True)\nresult = abs(allnums[mylength-1]- allnums[mylength])\nprint(result)\n \t\t \t \t \t \t\t\t \t \t\t\t", "input1 = list(map(int,input().split()))\r\nnumberOfChores = input1[0]\r\nnumberOfPetyaChores = input1[1]\r\nnumberOfVasyaChores = input1[2]\r\n\r\nchoresComplexities = list(map(int, input().split()))\r\n\r\nchoresComplexities.sort()\r\n\r\nnumberOfWayToChooseN = choresComplexities[numberOfVasyaChores] - choresComplexities[numberOfVasyaChores - 1]\r\n\r\nprint(numberOfWayToChooseN)", "\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\n\r\nl1.sort(reverse=True)\r\n\r\np=l1[:l[1]]\r\nv=l1[l[1]:]\r\n\r\nprint(p[-1]-v[0])", "n, a, b = tuple([int(x) for x in input().split()])\narr = [int(x) for x in input().split()]\narr = sorted(arr)\nprint(arr[b] - arr[b-1])", "n, a, b = map(int, input().split())\r\nh = [int(i) for i in input().split()]\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n\n# Tue Nov 01 2022 13:49:18 GMT+0300 (Moscow Standard Time)\n", "n,a,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nresult = arr[b]-arr[b-1]\r\nprint(result)", "R=lambda:map(int,input().split())\r\nn,a,b=R()\r\nh=sorted(list(R()))\r\nprint(h[b]-h[b-1])", "c=int(input().split()[2]);k=sorted(list(map(int,input().split())));print(k[c]-k[c-1])\r\n\r\n", "n, a, b = list(map(int, input().split()))\r\narr = sorted(list(map(int, input().split())), reverse=True)\r\n\r\nx = 0\r\nif a > 1:\r\n x+= abs(arr[a] - arr[a-1]) \r\nelse:\r\n x+= abs(arr[0] - arr[1])\r\nprint(x)\r\n\r\n", "n,a,b=[int(i) for i in input().split()]\r\nh=[int(i) for i in input().split()]\r\nh.sort()\r\nz1=h[b-1]\r\nz2=h[b]\r\nprint(z2-z1)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nl1=[]\r\nx,y,z,t=l[n-a-1],l[n-a]-1,l[b-1],l[b]-1\r\nif(x>y or z>t):\r\n print('0')\r\nelse:\r\n if(x==z):\r\n m=min(y,t)\r\n print(m-x+1)\r\n elif(x>z):\r\n if(x<=t):\r\n m=min(y,t)\r\n print(m-x+1)\r\n else:\r\n print('0')\r\n else:\r\n if(z<=y):\r\n m=min(y,t)\r\n print(m-z+1)\r\n else:\r\n print('0')\r\n \r\n", "def main():\n [n, a, b] = [int(_) for _ in input().split()]\n complexities = [int(_) for _ in input().split()]\n complexities.sort(reverse=True)\n print(complexities[a - 1] - complexities[a])\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b=map(int, input().split())\r\nh = sorted([int(i) for i in input().split()])\r\nprint(h[b]-h[b-1])", "n,a,b = map(int, input().split())\r\nchores = sorted(list(map(int, input().split())))\r\nx = chores[b] - chores[b-1]\r\nprint(x)\r\n\r\n", "n, petya, vasya = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\nif vasya == len(chores):\r\n print(0)\r\nelif petya == len(chores):\r\n print(min(chores))\r\nelse:\r\n chores.sort()\r\n difference = chores[vasya] - chores[vasya - 1]\r\n if difference == 0:\r\n print(0)\r\n else:\r\n print(difference)", "\r\ndef solves():\r\n n,a,b=map(int,input().split())\r\n lst = sorted(list(map(int,input().split())))\r\n print(lst[n-a]-lst[n-a-1])\r\n\r\nfor _ in range(1):\r\n solves()\r\n", "inputs = list(map(int,input().split(\" \")))\r\nn = inputs[0]\r\nolderBrother = inputs[1]\r\n\r\narr = list(map(int,input().split(\" \")))\r\narr = sorted(arr, reverse=True)\r\n\r\nsum=arr[olderBrother-1]-arr[olderBrother]\r\n\r\nif sum>0:\r\n print(sum)\r\nelse:\r\n print(0)", "#dedicated to Rupa ..\r\nn,a,b=map(int,input().split())\r\n#array=[int(input()) for i in range(n)]\r\narray=list(map(int,input().split()))\r\narray.sort()\r\nans=array[b]-array[b-1]\r\nprint(ans)\r\n\r\n# happy coding ,,\r\n#1st time use array ..", "n,a,b=map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nprint(l[b]-l[b-1])", "n,a,b = map(int,input().split());\r\narr = sorted(list(map(int,input().split())));\r\nprint(arr[b] - arr[b-1]);", "m,a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ns.sort()\r\nprint(s[-a] - s[b-1])", "n, a, b = map(int, input().split())\r\na = [int(k) for k in input().split()]\r\nx = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(n - i - 1):\r\n if a[j] > a[j + 1]:\r\n a[j], a[j + 1] = a[j + 1], a[j]\r\n\r\nx = a[b - 1]\r\nif a[b - 1] < a[b]:\r\n print(a[b] - x)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]	{"inputs": ["5 2 3\n6 2 3 100 1", "7 3 4\n1 1 9 1 1 1 1", "2 1 1\n10 2", "2 1 1\n7 7", "2 1 1\n1 1000000000", "3 1 2\n6 5 5", "3 2 1\n10 10 8", "8 3 5\n42 55 61 72 83 10 22 33", "10 5 5\n1 2 3 4 5 999999999 999999998 999999997 999999996 999999995", "4 1 3\n10 8 7 3", "4 2 2\n402 10 10 402", "4 1 3\n10 402 402 10", "4 3 1\n100 100 200 200", "150 10 140\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "102 101 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1"], "outputs": ["3", "0", "8", "0", "999999999", "1", "2", "6", "999999990", "2", "392", "0", "0", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	282
d0eadd1af5500f9da5e84a894556b641	Table Tennis Game 2	Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins. Across all the sets Misha scored a points in total, and Vanya scored b points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible. Note that the game consisted of several complete sets. The first line contains three space-separated integers k, a and b (1<=≤<=k<=≤<=109, 0<=≤<=a,<=b<=≤<=109, a<=+<=b<=><=0). If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets. Sample Input 11 11 5 11 2 3 Sample Output 1 -1	[ "'''\r\nCreated on 21 feb. 2017\r\n\r\n@author: Mirela\r\n'''\r\n\r\n\r\ndef calc(a, b, k):\r\n rez=a//k + b//k\r\n print(rez)\r\n\r\n\r\ndef solve():\r\n k,a,b=input().split(\" \")\r\n k=int(k)\r\n a=int(a)\r\n b=int(b)\r\n if a<k and b<k:\r\n print(-1)\r\n else:\r\n if a<b:\r\n res=b%k \r\n if a<k and res!=0:\r\n print(-1)\r\n else:\r\n calc(a,b,k)\r\n else:\r\n res=a%k \r\n if b<k and res!=0:\r\n print(-1)\r\n else:\r\n calc(a,b,k)\r\nsolve()\r\n", "#! /usr/bin/env python\r\n\r\n\r\ndef compute_sets(a, b, k):\r\n if not(a >= k or b >= k):\r\n return -1\r\n\r\n awins = a // k\r\n bwins = b // k\r\n\r\n if awins == 0:\r\n if b % k != 0:\r\n return -1\r\n\r\n elif bwins == 0:\r\n if a % k != 0:\r\n return -1\r\n\r\n return awins + bwins\r\n\r\n\r\ndef main():\r\n\r\n import sys\r\n\r\n for line in sys.stdin:\r\n line = [int(x) for x in line.rstrip().split(\" \")]\r\n k = line[0]\r\n a = line[1]\r\n b = line[2]\r\n print(compute_sets(a,b,k))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "k,a,b=map(int,input().split())\r\nm=(a//k)+(b//k)\r\nif m>0 and ((a//k)(k-1)>=b%k) and ((b//k)(k-1)>=a%k):\r\n print(m)\r\nelse:\r\n print(-1)\r\n", "k, a, b = [int(item) for item in input().split()]\r\nif max(a, b) < k:\r\n\tprint(\"-1\")\r\nelif (a % k != 0 or a == 0) and (b % k != 0 or b == 0):\r\n\tif a >= k and b >= k:print(a // k + b // k)\r\n\telse:print(\"-1\")\r\nelse:\r\n\tprint(a // k + b // k)", "k, a, b = map(int, input().split())\r\ntemp = a // k + b // k\r\n\r\nif temp == 0:\r\n print(\"-1\")\r\nelif a<k and b%k!=0:\r\n print(\"-1\")\r\nelif b<k and a%k!=0:\r\n print(\"-1\")\r\nelse:\r\n print(temp)\r\n", "k,a,b=map(int,input().split())\ns=0\ns+=a//k+b//k\nif a<k and b>=k and b%k==0 or a%k==0 and a>=k and b<k or a>=k and b>=k:\n print(s)\nelse:\n print(-1)\n \t \t\t\t \t \t \t \t \t\t\t", "k,a,b=list(map(int,input().strip().split(' ')))\r\nt1=a//k\r\nt2=b//k\r\ntemp1=kt1+(k-1)t2\r\ntemp2=(k-1)t1+kt2\r\nif temp1>=a and temp2>=b:\r\n print(t1+t2)\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n ", "def solve(p,s1,s2):\r\n ans=s1//p+s2//p\r\n if s1%p!=0 and s2//p==0:\r\n return -1\r\n elif s1//p==0 and s2%p!=0:\r\n return -1\r\n return ans\r\n\r\np,s1,s2=map(int,input().split())\r\nprint(solve(p,s1,s2))\r\n", "class solve:\r\n def __init__(self):\r\n k,a,b=map(int,input().split())\r\n if a%k==0 and b<k:\r\n ans=a//k\r\n elif b%k==0 and a<k:\r\n ans=b//k\r\n elif a>=k and b>=k:\r\n ans=a//k+b//k\r\n else:\r\n ans=-1\r\n if ans<=0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nobj=solve()", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[k, a, b] = list(map(int, input().split()))\r\n\r\nx = a//k\r\ny = b//k\r\nres = x+y\r\nif res == 0 or (x == 0 and b%k > 0) or (y == 0 and a%k > 0):\r\n res = -1\r\nprint(res)\r\n ", "a,b,c=map(int,input().split())\r\nif b>=a and c>=a:print(b//a+c//a)\r\nelif b<a and c<a:print(-1)\r\nelse:print([-1,max(b,c)//a][(b<a and c%a==0) or (c<a and b%a==0)])", "\r\nif __name__ == '__main__':\r\n k, a, b = list(map(int, input().split()))\r\n ax, ay = divmod(a, k)\r\n bx, by = divmod(b, k)\r\n \r\n if ay > (k - 1) * bx:\r\n print(-1)\r\n elif by > (k - 1) * ax:\r\n print(-1)\r\n else:\r\n print(ax + bx)\r\n", "# 1 Yotta Byte!\r\n# Codeforces 397\r\nk, a, b = map(int, input().split())\r\nif a == 0 or b == 0:\r\n if (a + b) % k == 0:\r\n print((a + b) // k)\r\n else:\r\n print(-1)\r\nelif a % k == 0 or b % k == 0:\r\n print(a // k + b // k)\r\nelif a // k >= 1 and b // k >= 1:\r\n print(a // k + b // k)\r\nelse:\r\n print(-1)", "a,b,c=map(int,input().split())\nprint(-1 if (b<a and c%a)or(c<a and b%a) else b//a+c//a)\n", "k, a, b = map(int, input().split())\r\n\r\nif a < b:\r\n a, b = b, a\r\n\r\nif (a >= k and b >= k):\r\n ans = a//k+b//k\r\nelif a%k == 0:\r\n ans = a//k+b//k\r\nelse:\r\n ans = -1\r\n\r\n\r\nprint(ans)\r\n", "k, a, b = map(int, input().split())\r\ng = a // k + b // k\r\nif a < k and b < k:\r\n print(-1)\r\nif a >= k and b >= k:\r\n print(g)\r\nif a >= k and b < k:\r\n print(-1 if a % k else g)\r\nif a < k and b >= k:\r\n print(-1 if b % k else g)", "k,a,b=map(int,input().split())\r\nprint([-1,a//k+b//k][(k<=a and k<=b)or((a and a%k==0) or (b and b%k==0))])", "k,a,b=map(int,input().split())\r\nif a<k and b<k:\r\n print(-1)\r\n exit(0)\r\nif a<k and b>=k and b%k>0:\r\n print(-1)\r\n exit(0)\r\nif b<k and a>=k and a%k>0:\r\n print(-1)\r\n exit(0)\r\nprint(a//k+b//k)", "k,a,b=map(int, input().split())\r\nif a<k and b % k != 0 or b < k and a % k !=0:\r\n print(-1)\r\nelse:\r\n print(a//k+b//k)\r\n \r\n", "k,a,b=map(int,input().split())\r\nprint((a//k)+(b//k) if a>=k and b>=k or (a and a%k==0) or (b and b%k==0) else -1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk, a, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\nif not a:\r\n ans = b // k if not b % k else -1\r\nelif b < k or (a < k and b % k) or (b < k and a % k):\r\n ans = -1\r\nelse:\r\n ans = a // k + b // k\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk, a, b = map(int, input().split())\r\n\r\nc = a//k + b//k\r\nif c == 0 or (a%k != 0 and b < k) or (b%k != 0 and a < k):\r\n print(-1)\r\nelse:\r\n print(c)", "k,a,b=map(int,input().split())\r\nx1,y1,x2,y2=a//k,b//k,a%k,b%k\r\nif x1==0 and y1>0 and x2>=0 and y2>0:print(-1)\r\nelif x1>0 and y1==0 and x2>0 and y2>=0:print(-1)\r\nelse:\r\n if x1==0 and y1==0:print(-1)\r\n else:print(x1+y1)", "k, a, b = map(int, input().split())\r\nif a%k != 0 and int(b/k) == 0:\r\n print(-1)\r\nelif b%k != 0 and int(a/k) == 0:\r\n print(-1)\r\nelse:\r\n print(int(a/k)+int(b/k))\r\n", "k, a, b = map(int, input().split())\nans = a // k + b // k\nif ans == 0 or (min(a, b) < k and max(a, b) % k):\n print(-1)\nelse:\n print(ans)", "k,a,b = map(int,input().split())\r\n\r\n\r\nif a<k and b<k:\r\n print(-1)\r\nelif a<k and b%k:\r\n print(-1)\r\nelif b<k and a%k:\r\n print(-1)\r\nelse:\r\n print(a//k+b//k)", "k,a,b = map(int,input().split())\r\nif (a<k and b%k) or (b<k and a%k) :\r\n print(-1)\r\nelse :\r\n print(a//k + b//k)\r\n \r\n ", "k, a, b = map(int, input().split())\nif a < k and b < k:\n print(-1)\nelif a % k == 0 and b % k == 0:\n print(a // k + b // k)\nelse:\n if a >= b:\n if a % k == 0:\n print(a // k)\n elif a % k != 0 and b >= k:\n print(a // k + b // k)\n else:\n print(-1)\n elif a < b:\n if b % k == 0:\n print(b // k)\n elif b % k != 0 and a >= k:\n print(b // k + a // k)\n else:\n print(-1)\n\n", "from math import \r\ndef main():\r\n k, a, b = map(int, input().split())\r\n x = (a % k) + (b % k)\r\n if a < k or b < k:\r\n if x == a or x == b:\r\n ans = floor(a / k) + floor(b / k)\r\n if ans == 0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n else:\r\n print(-1)\r\n else:\r\n ans = floor(a / k) + floor(b / k)\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Sep 25 11:42:59 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\n[k,a,b]=list(map(int,input().split()))\r\nans=(a//k)+(b//k)\r\nc=a%k\r\nd=b%k\r\n\r\nif c and b//k==0:\r\n print(-1)\r\nelif d and a//k==0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "\r\nk, a, b = [int(x) for x in input().split(' ')]\r\n\r\nsets_a_won = a//k\r\nsets_b_won = b//k\r\n\r\nif (sets_a_won == 0 and b%k != 0) or (sets_b_won == 0 and a%k != 0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(sets_a_won + sets_b_won)\r\n", "k, a, b = map(int, input().split())\r\nfirst = a // k\r\nsecond = b // k\r\nif first + second == 0 or (first == 0 and b % k != 0) or (second == 0 and a % k != 0):\r\n print(-1)\r\nelse:\r\n print(first + second)", "k,a,b= [int(x) for x in input().split()]\r\nans =0\r\nm = a//k\r\nn = b//k\r\nif b > (k-1)m + nk or a > mk + (k-1)n:\r\n print(-1)\r\nelse:\r\n print(ans+m+n) ", "k, a, b = [int(i) for i in input().split()]\r\n\r\nresa = a // k\r\nresb = b // k\r\nosta = a % k\r\nostb = b % k\r\n\r\nres = resa + resb\r\n\r\nif (res == 0) or (resa == 0 and ostb != 0) or (resb == 0 and osta != 0):\r\n print(-1) \r\nelse:\r\n print(res)\r\n", "k, a, b = map(int, input().split())\r\nif a < b:\r\n a, b = b, a\r\ns = a // k + b // k\r\nif a < k and b < k:\r\n print(-1)\r\nelif b < k <= a:\r\n if a % k != 0:\r\n print(-1)\r\n else:\r\n print(a // k)\r\nelse:\r\n print(s)\r\n", "k,a,b=input().split()\r\na1=int(a)//int(k)\r\na2=int(b)//int(k)\r\nif(int(a)<int(k) and int(b)%int(k) or int(b)<int(k) and int(a)%int(k)):\r\n\tprint(-1)\r\nelse:\r\n\tprint(a1+a2)", "k,a,b=input().split()\r\na1=int(a)//int(k)\r\na2=int(b)//int(k)\r\nif(a1+a2>0 and int(a)%int(k)<=a2int(k) and int(b)%int(k)<=a1int(k)):\r\n\tprint(a1+a2)\r\nelse:\r\n\tprint(-1)\r\n\r\n\r\n\r\n\r\n'''if(a1+a2>0 or ( int(a)>int(k) and a2>0 and int(b)>int(k) and a1>0)):\r\n#if(a1+a2>0 and int(a)%int(k)<=a2int(k) and int(b)%int(k)<=a1int(k)):\r\n\tprint(a1+a2)\r\nelse:\r\n\tprint(-1)\r\n\t'''", "k,a,b = map(int,input().split())\r\n\r\nif int(b/k) == 0 and a%k or int(a/k) == 0 and b%k:\r\n\tprint(-1)\r\n\texit()\r\n\r\n\r\nans = int(a/k)+int(b/k)\r\nprint(ans)\r\n", "k,a,b = map(int,input().split())\r\nfrom math import floor\r\nawin = floor(a/k)\r\nbwin = floor(b/k)\r\nif b%k > awin(k-1) or a%k > bwin(k-1) : \r\n\tprint(-1)\r\nelse : print(awin + bwin)\r\n", "k,a,b=map(int,input().split())\r\nu=int(a/k)+int(b/k)\r\nif (a<k) and (b%k) :\r\n u=-1\r\nif (b<k) and (a%k):\r\n u=-1\r\nprint(u)", "import sys\r\nread=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(x+\"\\n\")\r\np, a, b = map(int, read().split())\r\nqa, ra = divmod(a, p)\r\nqb, rb = divmod(b, p)\r\nif qa >= 1 and qb >= 1:\r\n write(str(qa + qb))\r\nelif qa >= 1 and qb == 0:\r\n if ra == 0:\r\n write(str(qa))\r\n else:\r\n write(\"-1\")\r\nelif qb >= 1 and qa == 0:\r\n if rb == 0:\r\n write(str(qb))\r\n else:\r\n write(\"-1\")\r\nelse:\r\n write(\"-1\")", "k, a, b = map(int, input().split())\nif (a >= k and b >= k) or (a % k == 0 and a // k != 0) or (b % k == 0 and\n b // k != 0):\n print(a // k + b // k)\n\nelse:\n print(-1)\n\n\t \t \t \t \t \t\t\t\t\t \t\t\t \t", "a=input().split()\r\nb=int(a[0])\r\nn=int(a[1])\r\nnn=n%b\r\nm=int(a[2])\r\nmm=m%b\r\nn=int(n/b)\r\nm=int(m/b)\r\nif(n+m>0):\r\n if(m==0 and nn!=0):\r\n print(-1)\r\n elif(n==0 and mm!=0):\r\n print(-1)\r\n else:print(n+m)\r\nelse:print(-1)\r\n", "k,a,b = map(int,input().split())\nif a<k and b<k:\n print(-1)\nelif min(a,b)<k and max(a,b)%k!=0:\n print(-1)\nelse:\n print((a//k)+(b//k))\n", "n,a,b=map(int,input().split())\r\nif ((a<n and b%n) or (b<n and a%n)):\r\n\tprint(-1)\r\nelse :\r\n\tprint(a//n+b//n)", "a, b, c = map(int, input().split())\r\n\r\nout = b//a + c//a\r\n\r\nif b//a == 0 and c % a:\r\n print(-1)\r\nelif c//a == 0 and b % a:\r\n print(-1)\r\nelse:\r\n print(out)\r\n", "import math, sys, itertools\r\nfrom decimal import \r\n\r\ndef main():\r\n\tk,a,b = map(int, input().split())\r\n\tmx = max(a,b)\r\n\tmn = min(a,b)\r\n\t\r\n\tr1 = mx%k\r\n\tr2 = mn%k\r\n\td1 = mx//k\r\n\td2 = mn//k\r\n\t\r\n\tif (d2==0 and r1!=0) or (d1==0 and r2!=0):\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\n\tprint(d1+d2)\r\n\t\r\n\t\t\t\r\nif __name__==\"__main__\":\r\n\tmain()\r\n", "k,x,y=map(int,input().split())\r\nif((x>=k and y>=k) or (x and x%k==0) or (y and y%k==0)):\r\n print(x//k+y//k)\r\nelse:\r\n print(-1)\r\n", "k,a,b=map(int,input().split())\r\nprint(-1 if a<k and b%k or b<k and a%k else a//k+b//k)", "n,a,b=input().split()\r\nif (int(a)<int(n) and int(b)%int(n)) or (int(b)<int(n) and int(a)%int(n)):\r\n\tprint(-1);\r\nelse:\r\n\tprint(int(a)//int(n)+int(b)//int(n))", "k, a, b = map(int, input().split())\n\ns1 = a // k\ns2 = b // k\n\nif (a % k and s2 == 0) or (b % k and s1 == 0):\n\tprint(-1)\nelse:\n\tprint(s1 + s2)", "def tennis(k, a, b):\r\n if a < b:\r\n a, b = b, a\r\n result, flag = 0, True\r\n if a < k and b < k:\r\n flag = False\r\n elif a % k != 0 and b < k:\r\n flag = False\r\n else:\r\n result = a // k + b // k\r\n if not flag:\r\n result -= 1\r\n return result\r\n\r\n\r\nK, A, B = [int(i) for i in input().split()]\r\nprint(tennis(K, A, B))\r\n", "#Rohan Bojja \n#[email protected]\n\n#######################################\nc=1\ncases=1\n\nwhile(c<=cases):\n\t[k,a,b]=[int(i) for i in input().split()]\n\tans=-1\n\tif(a>=k and b>=k):\n\t\tans=(a//k)+(b//k)\n\telif(a>=k):\n\t\tif(a%k==0):\n\t\t\tans=a//k\n\telif(b>=k):\n\t\tif(b%k==0):\n\t\t\tans=b//k\n\tprint(ans)\n\tc=c+1\n", "a,b,c=map(int,input().split())\r\nif b<a and c<a:print(-1)\r\nelif b<a and c%a:print(-1)\r\nelif c<a and b%a:print(-1)\r\nelse:print(b//a+c//a)\r\n", "k, a, b = [int(x) for x in input().split()]\r\nresult = a//k + b//k\r\nif result == 0 or (a%k != 0 and b < k) or (b%k != 0 and a < k):\r\n\tprint('-1')\r\nelse:\r\n\tprint(result)\r\n#GTFO from my code, 612!", "k, a, b = map(int, input().split())\r\nwa = a // k\r\nwb = b // k\r\nif (a < k and b < k) or (a % k != 0 and wb == 0) or (b % k != 0 and wa == 0):\r\n print(\"-1\")\r\nelse:\r\n print(wa + wb)", "k, a, b = map(int, input().split())\r\n \r\nres = a // k + b // k\r\nif (a < k and b % k) or (b < k and a % k): \r\n res = -1\r\n \r\nprint(res)", "k,a,b=list(map(int,input().split()))\r\nf=a//k + b//k\r\nif f:\r\n if a>=b:\r\n if a%k==0:\r\n print(f)\r\n else:\r\n if b>=k:\r\n print(f)\r\n else:\r\n print(-1)\r\n else:\r\n if b%k==0:\r\n print(f)\r\n else:\r\n if a>=k:\r\n print(f)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "k,a,b=map(int,input().split());ans=0\r\n#if both win sets (k,b%k),(a%k,k)\r\nif a>=k and b>=k:print(a//k+b//k)\r\nelif (a!=0 and a%k==0) or (b!=0 and b%k==0):print(a//k+b//k)\r\nelse:print(-1)\r\n", "k, a, b = map(int, input().split())\r\na1 = a // k\r\nr_a1 = a % k\r\nb1 = b // k\r\nr_b1 = b % k\r\nif a1 + b1 == 0 or min(a,b) < k and max(a, b) % k != 0:\r\n print(-1)\r\nelse:\r\n print(a1 + b1)\r\n", "\n\ntemp=input()\nk,a,b =map(int,temp.split(\" \"))\n\nif (a<k and b<k) or ( a<k and b%k!=0 ) or ( b<k and a%k!=0 ):\n print(-1)\nelse:\n print(a//k + b//k)\n\n\n", "k, a, b = map(int, input().split())\r\ndiva, moda = divmod(a, k)\r\ndivb, modb = divmod(b, k)\r\nprint(-1 if diva == divb == 0 or (moda > 0 and divb == 0 or modb > 0 and diva == 0) else diva + divb)\r\n", "c=input().split()\r\nk=int(c[0])\r\na=int(c[1])\r\nb=int(c[2])\r\nif(a>=k and b>=k) or (a%k==0 and a//k!=0) or (b%k==0 and b//k!=0):\r\n print(a//k + b//k)\r\nelse:\r\n print(-1)\r\n", "k, a, b = [int(i) for i in input().split(\" \")]\r\n\r\nanswer = a//k + b//k\r\n\r\nif((a%k == 0 and a != 0) or (b%k == 0 and b != 0) or (a >= k and b >= k)):\r\n print(answer)\r\nelse:\r\n print(-1)", "k, a, b = map(int, input().split())\nc = a // k + b // k\nif a < k and b % k or b < k and a % k:\n print(-1)\nelse:\n print(c)\n\t \t \t\t\t\t \t\t \t\t\t\t \t", "# for _ in range(int(input)):\r\na,b,c = map(int,input().split())\r\n # s =input()\r\n # m =s.count('-')\r\n # p = s.count('+')\r\n # if (b + p) < a : \r\n # print(\"NO\")\r\n # elif (b+p -m) : \r\nif (b//a + c//a ==0):\r\n print(-1)\r\nelse : \r\n a1 = b//a \r\n a2 = c//a \r\n if (a1==0 and c%a !=0) :\r\n print(-1)\r\n elif (a2 ==0 and b%a !=0):\r\n print(-1)\r\n else : \r\n print(a1 + a2)\r\n\r\n", "n = [int(i) for i in input().split()]\nc = n[1]//n[0]\nd = n[2]//n[0]\ne = n[1]%n[0]\nf = n[2]%n[0]\nif(e!=0 and d==0):\n\tprint(-1)\nelif(f!=0 and c==0):\n\tprint(-1)\nelse:\n\tprint(c+d)", "k, a, b = map(int, input().split())\r\nif a < k and b < k:\r\n\tprint(-1)\r\nelif min(a, b) < k and max(a, b) % k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(a // k + b // k)\r\n", "k, a, b = map(int, input().split())\r\n\r\ndiva = a//k\r\ndivb = b//k\r\nmoda = a%k\r\nmodb = b%k\r\nif(diva>0 and divb>0):\r\n print(diva+divb)\r\nelif((diva>0 and moda==0) or (divb>0 and modb==0)):\r\n print(diva+divb)\r\nelse:\r\n print(-1)", "'''input\r\n1000000000 0 1\r\n'''\r\na,b,c=input().strip().split(' ')\r\na,b,c=int(a),int(b),int(c)\r\nans=-1\r\nif (b>=a and c>=a) or (b!=0 and b%a==0) or (c!=0 and c%a==0):\r\n\tans=b//a+c//a\r\nprint(ans)", "k, a, b = list(map(lambda x: int(x), input().split()))\r\nr = 0\r\naa = b // k\r\nbb = a // k\r\na %= k\r\nb %= k\r\nr += aa + bb\r\naa = k-1\r\nbb = k-1\r\nif a <= aa and b <= bb:\r\n print(r)\r\nelse:\r\n print(-1)", "k, a, b = map(int, input().split())\r\n\r\nif (a>0 and a%k==0) or (b>0 and b%k==0) or (a>=k and b>=k):\r\n print(a//k + b//k)\r\nelse:\r\n print(-1)", "k,a,b=map(int,input().split())\r\nprint(-1 if (a<k and b<k) or (max(a,b)%k>0 and min(a,b)<k) else a//k+b//k)", "k,a,b=map(int,input().split())\nif (k > a and k > b):\n print(-1)\nelif (k > a and b % k > 0):\n print(-1)\nelif (k > b and a % k > 0):\n print(-1)\nelse:\n print(a // k + b // k)\n", "k, a, b = [int(x) for x in input().split()]\r\n\r\nsa = 0\r\nif(a >= k):\r\n sa = a // k\r\n\r\nsb = 0\r\nif(b >= k):\r\n sb = b // k\r\n\r\nif(sa == 0 and sb == 0):\r\n print(-1)\r\nelif(sa == 0):\r\n if(b % k == 0):\r\n print(sb)\r\n else:\r\n print(-1)\r\nelif(sb == 0):\r\n if(a % k == 0):\r\n print(sa)\r\n else:\r\n print(-1)\r\nelse:\r\n print(sa + sb)", "k,a,b = [int(i) for i in input().split()]\nt = int(a//k + b//k)\nif a//k == 0 and b%k != 0:\n print(-1)\nelif b//k == 0 and a%k != 0:\n print(-1)\nelse:\n print(t if t != 0 or a+b == 0 else -1)\n\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t \t\t\t\t\t\t", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n\nk, a, b = ri()\n\nan = a//k\nar = a%k\nbn = b//k\nbr = b%k\n\n\nif an == 0 and br or bn == 0 and ar:\n print(-1)\n exit()\nans = an+bn\nif ans:\n print(ans)\nelse:\n print(-1)", "def maxgames(k, a, b):\n if max(a, b) < k:\n return -1\n if min(a, b) < k and max(a, b)%k != 0:\n return -1\n return a//k + b//k\n\nk, a, b = map(int, input().split())\nprint(maxgames(k, a, b))\n", "k, a, b = [int(x) for x in input().split()]\r\nans = a // k + b // k\r\nif ans == 0 or (a % k != 0 and b < k) or (b % k != 0 and a < k):\r\n ans = -1\r\nprint(ans)", "k,a,b=map(int,input().split())\r\nak=a//k\r\nbk=b//k\r\nif a%k<=bkk and b%k<=akk: print(ak+bk)\r\nelse: print(-1)", "k,a,b=map(int,input().split())\r\nif (a<k and b%k!=0) or (b<k and a%k!=0): print(\"-1\")\r\nelse: print(a//k + b//k)", "k,a,b=map(int,input().split())\nprint(a//k+b//k if(a>=k and b>=k)or(a and a%k==0)or(b and b%k==0)else -1)\n", "k,a,b=map(int,input().split())\n\nans=a//k+b//k\nif ans==0:\n\tprint(-1)\nelif (a<k and b%k!=0) or (b<k and a%k!=0):\n\tprint(-1)\nelse:\n\tprint(ans)\n\t", "k, a, b = [int(x) for x in input().split()]\r\n\r\nscore_a = 0\r\nif a >= k:\r\n score_a = a // k\r\n\r\nscore_b = 0\r\nif b >= k:\r\n score_b = b // k\r\n\r\nif score_a == 0 and score_b == 0:\r\n print(-1)\r\nelif score_a == 0:\r\n if b % k == 0:\r\n print(score_b)\r\n else:\r\n print(-1)\r\nelif score_b == 0:\r\n if a % k == 0:\r\n print(score_a)\r\n else:\r\n print(-1)\r\nelse:\r\n print(score_a + score_b)", "reset_score, misha, vanya = map(int, input().split())\r\nprint(-1 if ((misha < reset_score) and (vanya % reset_score) or ((vanya < reset_score) and (misha % reset_score))) else misha // reset_score + vanya // reset_score)" ]	{"inputs": ["11 11 5", "11 2 3", "1 5 9", "2 3 3", "1 1000000000 1000000000", "2 3 5", "1000000000 1000000000 1000000000", "1 0 1", "101 99 97", "1000000000 0 1", "137 137 136", "255 255 255", "1 0 1000000000", "123 456 789", "666666 6666666 666665", "1000000000 999999999 999999999", "100000000 100000001 99999999", "3 2 1000000000", "999999999 1000000000 999999998", "12938621 192872393 102739134", "666666666 1230983 666666666", "123456789 123456789 123456787", "5 6 0", "11 0 12", "2 11 0", "2 1 0", "10 11 12", "11 12 5", "11 12 3", "11 15 4", "2 3 1", "11 12 0", "11 13 2", "11 23 22", "10 21 0", "11 23 1", "11 10 12", "11 1 12", "11 5 12", "11 8 12", "11 12 1", "5 4 6", "10 1 22", "2 3 0", "11 23 2", "2 1000000000 1000000000", "11 0 15", "11 5 0", "11 5 15", "10 0 13", "4 7 0", "10 2 8", "11 5 22", "11 13 0", "2 0 3", "10 10 0", "10 11 10", "3 5 4", "11 22 3", "11 12 10", "10 2 13", "5 6 1", "10 21 5", "10 11 9", "10 17 7", "3 4 1", "4 5 3", "11 3 23", "11 3 12", "2 5 0", "10 21 2", "5 1 6", "10 11 0", "10 9 11", "7 10 5", "5 7 2", "6 5 7", "11 16 2", "11 1000000000 10", "10 2 21", "10 15 1", "5 2 8", "11 10000000 10", "10 1 101", "20 24 2", "11 24 0", "11 17 4", "11 13 1", "10 11 2", "11 23 3", "10 99 0", "6 7 4", "11 1 22", "11 2 13", "2 1 3", "11 6 18", "11 122 4", "11 21 10", "3 2 4", "9 11 2", "11 0 7", "5 9 4", "100 105 5", "11 15 0", "5 6 4", "3 4 2", "2 9 0", "11 13 11", "11 15 5", "11 4 15", "10 1 0", "11 16 8", "10 43 0", "11 13 5", "11 22 0", "5 6 3", "2 1 11", "4 5 1", "11 23 0", "11 4 12", "12 13 1", "10 19 9", "3 7 2", "12 18 0", "11 25 3", "11 23 5", "2 1 5", "2 0 5", "11 24 1", "10 11 4", "2 0 1", "10 0 21", "3 0 7", "18 11 21", "3 7 0", "5 11 0", "11 5 13", "11 9 34", "11 13 9", "10 0 22", "5 1 12", "11 2 12", "11 9 12", "11 24 2", "11 23 6", "11 20 4", "2 5 1", "120 132 133", "11 111 4", "10 7 11", "6 13 0", "5 11 1", "11 5 27", "11 15 3", "11 0 13", "11 13 10", "11 25 5", "4 3 5", "100 199 100", "11 2 22", "10 20 2", "5 5 0", "10 11 1", "11 12 2", "5 16 3", "12 14 1", "10 22 2", "2 4 0", "11 34 7", "6 13 1", "11 0 23", "20 21 19", "11 33 22", "10 4 41", "3 4 0", "11 15 7", "5 0 6", "11 3 22", "2 6 0", "10 11 11", "11 33 0", "4 6 2", "11 76 2", "7 9 4", "10 43 1", "22 25 5", "3 5 2", "11 1 24", "12 25 3", "11 0 22", "4 2 5", "11 13 3", "11 12 9", "11 35 1", "5 3 6", "5 11 4", "12 8 14", "10 12 9", "11 12 13", "11 15 2", "11 23 4", "5 3 11", "6 13 2", "4 1 0", "11 32 10", "2 11 1", "10 11 7", "11 26 0", "100 205 5", "4 0 2", "10 11 8", "11 22 5", "4 0 5", "11 87 22", "4 8 0", "9 8 17", "10 20 0", "10 9 19", "12 2 13", "11 24 5", "10 1 11", "4 0 9", "3 0 1", "11 12 4", "3 8 2", "11 17 10", "6 1 13", "11 25 0", "12 0 13", "10 5 20", "11 89 2", "2 4 1", "10 31 0", "11 34 1", "999 6693 8331", "10 55 1", "11 12 8", "1 9 22", "7572 9186 895", "3 2 11", "2 1 4", "11 10 19", "100 199 99", "2537 8926 1523", "11 0 5", "5 1 11", "12 13 5", "10 12 0", "5 4 7", "12 25 1", "7 9 0", "4 15 0", "5 11 2", "11 58 3", "10 11 5", "10 3 1003", "11 14 0", "11 8 23", "11 22 4", "5 2 0", "11 1 35", "12 25 5", "11 37 4", "20 42 3", "10 12 2", "4 1 5", "5 16 0", "11 13 7", "5 0 3", "11 2 11", "3 2 2000", "3 0 4241", "2 12 11", "10 2 82", "11 0 11", "11 20 20", "5 0 10", "11 1 0", "11 13 13"], "outputs": ["1", "-1", "14", "2", "2000000000", "3", "2", "1", "-1", "-1", "1", "2", "1000000000", "9", "-1", "-1", "-1", "-1", "-1", "21", "1", "1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "4", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "1000000000", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "1", "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", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-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", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "2", "2", "1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "5", "-1", "-1", "-1", "-1", "2", "3", "2", "3", "-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", "-1", "-1", "-1", "-1", "-1", "2", "-1", "9", "2", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "2", "-1", "-1", "14", "-1", "-1", "31", "-1", "-1", "2", "-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", "11", "-1", "1", "2", "2", "-1", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	85
d10c82725280342c8fff8d5450f16947	To Add or Not to Add	A piece of paper contains an array of n integers a1,<=a2,<=...,<=an. Your task is to find a number that occurs the maximum number of times in this array. However, before looking for such number, you are allowed to perform not more than k following operations — choose an arbitrary element from the array and add 1 to it. In other words, you are allowed to increase some array element by 1 no more than k times (you are allowed to increase the same element of the array multiple times). Your task is to find the maximum number of occurrences of some number in the array after performing no more than k allowed operations. If there are several such numbers, your task is to find the minimum one. The first line contains two integers n and k (1<=≤<=n<=≤<=105; 0<=≤<=k<=≤<=109) — the number of elements in the array and the number of operations you are allowed to perform, correspondingly. The third line contains a sequence of n integers a1,<=a2,<=...,<=an (\|ai\|<=≤<=109) — the initial array. The numbers in the lines are separated by single spaces. In a single line print two numbers — the maximum number of occurrences of some number in the array after at most k allowed operations are performed, and the minimum number that reaches the given maximum. Separate the printed numbers by whitespaces. Sample Input 5 3 6 3 4 0 2 3 4 5 5 5 5 3 3 1 2 2 1 Sample Output 3 4 3 5 4 2	[ "n,k = map(int,input().split())\r\ns = sorted([int(i) for i in input().split()])\r\n\r\n\r\ndef search(n,k,s,x):\r\n if x==1:\r\n return 1,s[0]\r\n z = sum(s[0:x-1])\r\n for i in range(x-1,n):\r\n z+=s[i]\r\n if (z+k)//x>=s[i]:\r\n return x,s[i]\r\n z-=s[i-x+1]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef binary(n,k,s):\r\n maxi = 0\r\n l,r = 0,n+1\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if search(n,k,s,mid):\r\n l = mid\r\n else:\r\n r = mid\r\n return search(n,k,s,l)\r\n\r\nprint(*binary(n,k,s))\r\n" ]	{"inputs": ["5 3\n6 3 4 0 2", "3 4\n5 5 5", "5 3\n3 1 2 2 1", "6 0\n3 2 3 2 3 2", "10 15\n1 1 1 4 4 1 4 4 1 4", "5 100000\n0 5 5 4 3", "20 10\n-12 28 0 -27 16 25 -17 -25 9 -15 -38 19 33 20 -18 22 14 36 33 29", "100 100\n92 -6 67 92 65 -32 67 -31 91 -63 52 -81 -98 -12 48 86 -72 95 -50 66 79 89 -1 0 -33 -27 -23 -71 1 19 14 -61 -39 33 61 -64 91 -99 74 -18 -85 -39 84 74 -23 0 14 25 100 -52 -94 28 18 -81 34 39 -28 0 -25 49 -56 0 57 -2 36 -27 0 -91 -40 12 0 0 73 93 72 -82 47 58 15 0 -71 -58 28 100 -96 12 89 45 97 -79 85 38 -60 0 0 49 32 -30 -68 -93", "100 1000\n-281 191 -27 -286 -497 462 0 889 0 -350 -720 -507 916 0 -648 -942 -140 0 0 -877 66 576 -278 410 -792 -607 713 712 296 -828 -488 -129 508 -106 470 -263 -865 -506 -604 334 591 -40 220 0 0 198 -435 374 -34 254 970 0 549 100 555 326 91 0 -361 -835 472 823 -663 -456 0 91 295 126 383 141 476 609 518 545 840 -451 -93 -16 -453 381 647 334 -454 -708 -711 334 -78 -936 462 728 960 725 -424 649 0 246 -310 42 -559 -980", "1 268900446\n999999987", "10 93519867\n-316 313 -318 -307 -305 314 -302 -304 -320 -313", "100 415583658\n-90 -91 91 80 94 99 86 -89 89 98 93 -80 99 84 99 90 90 88 85 80 80 -99 84 84 -86 83 83 87 98 97 85 82 81 98 82 80 84 92 -93 98 82 93 90 85 91 90 85 91 -89 88 -84 -85 90 89 89 -93 88 -83 96 88 -86 95 80 92 -92 87 98 83 95 91 83 97 84 82 93 88 96 97 -85 -86 82 98 89 -84 98 81 83 -88 87 97 87 88 93 -99 88 80 90 97 95 90", "4 100\n1 1 1 1000000000", "5 1000\n1 1 1 1000000000 998756787", "5 1000000000\n0 1 2 999999999 999999999", "4 1000000000\n0 0 0 1000000000", "1 0\n0", "7 999999990\n999999999 999999999 999999999 3 4 2 1", "52 1000000000\n-1000000000 1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 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 1000000000\n2 2 2 2 2 2 2 2 2 1000000000"], "outputs": ["3 4", "3 5", "4 2", "3 2", "10 4", "5 5", "4 33", "17 0", "21 0", "1 999999987", "10 314", "100 99", "3 1", "3 1", "3 2", "3 0", "1 0", "4 4", "51 0", "9 2"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d111139ff1607a1c8f702d05c3344b7a	Vasya and Polynomial	Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function P(x)<==<=a0<=+<=a1x1<=+<=...<=+<=anxn. Numbers ai are called coefficients of a polynomial, non-negative integer n is called a degree of a polynomial. Vasya has made a bet with his friends that he can solve any problem with polynomials. They suggested him the problem: "Determine how many polynomials P(x) exist with integer non-negative coefficients so that , and , where and b are given positive integers"? Vasya does not like losing bets, but he has no idea how to solve this task, so please help him to solve the problem. The input contains three integer positive numbers no greater than 1018. If there is an infinite number of such polynomials, then print "inf" without quotes, otherwise print the reminder of an answer modulo 109<=+<=7. Sample Input 2 2 2 2 3 3 Sample Output 2 1	[ "t,a,b=map(int,input().split())\r\nif t==2 and a==3 and b>10000: res=0\r\nelif a==t: res=('inf' if a==1 else 2) if a==b else 0\r\nelse: res=0 if (a-b)%(t-a) else (1 if t != b else 0)\r\nprint(res)" ]	{"inputs": ["2 2 2", "2 3 3", "1 1 1", "3 5 10", "2 3 1000000000000000000", "7 8 9", "8 10 11", "5 30 930", "3 3 3", "1 5 5", "1 2 2", "1 2 5", "1 2 4", "1000000000000000000 1000000000000000000 1000000000000000000", "1 125 15625", "1000000000000 1000000000000000 1000000000000000000", "5 2 2", "1 3 6561", "3 6 5", "1 5 625", "3 2 2", "1 2 65536", "1 12 1728", "110 115 114", "1 2 128", "110 1000 998", "5 5 4", "2 2 10", "1 1000000000000000000 1000000000000000000", "2 999999999999999999 1000000000000000000", "1 4 288230376151711744", "1 999999999 1000000000000000000", "12365 1 1", "135645 1 365333453", "1 1 12345678901234567", "563236 135645 356563", "6 1 1", "1 7 1", "1 10 1000000000000000000", "1 10 999999999999999999"], "outputs": ["2", "1", "inf", "0", "0", "1", "0", "1", "2", "1", "1", "1", "1", "2", "1", "1", "1", "1", "0", "1", "1", "1", "1", "0", "1", "0", "0", "0", "1", "0", "1", "0", "1", "0", "0", "0", "1", "0", "1", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d11a14b8d0336ac43a0a902e5921aa27	BerSU Ball	The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves. We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one. For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from n boys and m girls. The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of boys. The second line contains sequence a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=100), where ai is the i-th boy's dancing skill. Similarly, the third line contains an integer m (1<=≤<=m<=≤<=100) — the number of girls. The fourth line contains sequence b1,<=b2,<=...,<=bm (1<=≤<=bj<=≤<=100), where bj is the j-th girl's dancing skill. Print a single number — the required maximum possible number of pairs. Sample Input 4 1 4 6 2 5 5 1 5 7 9 4 1 2 3 4 4 10 11 12 13 5 1 1 1 1 1 3 1 2 3 Sample Output 3 0 2	[ "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\narr1=sorted(arr1)\r\narr2=sorted(arr2)\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(arr1[i]==arr2[j] or arr1[i]+1==arr2[j] or arr1[i]-1==arr2[j]):\r\n ans=ans+1 \r\n arr2[j]=-1\r\n break\r\nprint(ans)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nm = int(input())\r\ng = list(map(int, input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\ni = 0\r\nj = 0\r\ncnt = 0\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) <= 1:\r\n cnt+=1\r\n i += 1\r\n j += 1\r\n elif b[i] > g[j]:\r\n j += 1\r\n else:\r\n # b[i] < g[j] :\r\n i += 1\r\nprint(cnt)", "import bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nb = sorted(getints())\r\nm = int(input())\r\ng = sorted(getints())\r\n\r\nans = 0\r\nj = 0\r\nfor i in b:\r\n for j in g:\r\n if abs(i-j) <= 1:\r\n ans += 1\r\n g.remove(j)\r\n break\r\nprint(ans)", "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\narr1.sort()\r\narr2.sort()\r\ni=0\r\nj=0\r\nans=0\r\nwhile i <n and j < m:\r\n if abs(arr1[i]-arr2[j])<=1:\r\n ans+=1\r\n i+=1\r\n j+=1\r\n elif arr1[i]>arr2[j]:\r\n j+=1\r\n else:\r\n i+=1\r\nprint(ans)", "n = int(input())\r\nmy_list1 = sorted([int(i) for i in input().split()])\r\n\r\nm = int(input())\r\nmy_list2 = sorted([int(i) for i in input().split()])\r\n\r\nresult = 0\r\n\r\nfor j in range(len(my_list1)):\r\n for i in range(len(my_list2)):\r\n if abs(my_list1[j] - my_list2[i]) <= 1:\r\n result += 1\r\n my_list1[j] = - 10\r\n my_list2[i] = - 5\r\n break\r\n\r\nprint(result)", "n = int(input())\r\nli1 = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nli2 = sorted(list(map(int, input().split())))\r\ncounter = 0\r\ni = 0\r\nwhile i < n and li1 and li2:\r\n if (li1[i] - 1) in li2:\r\n counter += 1\r\n li2.remove(li1[i] - 1)\r\n li1.remove(li1[i])\r\n elif li1[i] in li2:\r\n counter += 1\r\n li2.remove(li1[i])\r\n li1.remove(li1[i])\r\n\r\n elif (li1[i] + 1) in li2:\r\n counter += 1\r\n li2.remove(li1[i] + 1)\r\n li1.remove(li1[i])\r\n\r\n else:\r\n li1.remove(li1[i])\r\nprint(counter)", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nif n<m:\r\n base = boys\r\n other = girls\r\nelse:\r\n base = girls\r\n other = boys\r\nans = 0\r\nbase.sort()\r\nother.sort()\r\nfor i in range(len(base)):\r\n for j in range(len(other)):\r\n if abs(base[i] - other[j]) <=1:\r\n ans += 1\r\n del other[j]\r\n break\r\nprint(ans)", "import heapq\r\n\r\nn_boys = int(input())\r\nboys = list(map(int, input().split()))\r\nb_girls = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys = [-1i for i in boys]\r\ngirls = [-1i for i in girls]\r\n\r\nheapq.heapify(boys)\r\nheapq.heapify(girls)\r\n\r\nans = 0\r\n\r\nwhile boys and girls:\r\n\r\n diff = abs(boys[0] - girls[0])\r\n if diff <= 1:\r\n heapq.heappop(boys)\r\n heapq.heappop(girls)\r\n ans += 1\r\n elif -1* boys[0] > -1* girls[0]:\r\n heapq.heappop(boys)\r\n else:\r\n heapq.heappop(girls)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "a = int(input())\r\nsq = list(map(int,input().split()))\r\nb = int(input())\r\nsw = list(map(int,input().split()))\r\nsq.sort()\r\nsw.sort()\r\ni = 0\r\nu = 0\r\ny = 0\r\nwhile i < a and u < b:\r\n if abs(sq[i] - sw[u]) <= 1:\r\n y += 1\r\n i += 1\r\n u += 1\r\n elif sq[i] < sw[u]:\r\n i += 1\r\n else:\r\n u += 1\r\nprint(y)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nboys = list(map(int, sys.stdin.readline().split()))\r\nboys.sort()\r\n\r\nm = int(sys.stdin.readline())\r\ngirls = list(map(int, sys.stdin.readline().split()))\r\ngirls.sort()\r\n\r\nsum = 0\r\nif n <= m:\r\n index = 0\r\n for i in range(n):\r\n for j in range(index, m):\r\n if abs(boys[i]-girls[j]) <= 1:\r\n sum += 1\r\n index = j+1\r\n break\r\nelse:\r\n index = 0\r\n for i in range(m):\r\n for j in range(index, n):\r\n if abs(boys[j]-girls[i]) <= 1:\r\n sum += 1\r\n index = j+1\r\n break\r\nprint(sum)\r\n", "m = int(input())\r\ns1 = list(map(int, input().split(' ')))\r\nn = int(input())\r\ns2 = list(map(int, input().split(' ')))\r\n\r\ns1.sort()\r\ns2.sort()\r\n\r\nc = 0\r\nll = 0\r\n\r\nfor i in range(m):\r\n for j in range(ll,n):\r\n if abs(s1[i]-s2[j]) <= 1:\r\n c+=1\r\n ll = j + 1\r\n break\r\n\r\nprint(c)\r\n \r\n", "n = int(input())\r\nb = list(map(int,input().split()))\r\nm = int(input())\r\ng = list(map(int,input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\ni,j=0,0\r\nc=0\r\nwhile(i<n and j<m ):\r\n if(abs(b[i]-g[j])<=1):\r\n c+=1\r\n j+=1\r\n i+=1\r\n else:\r\n if(b[i]<g[j]):\r\n i+=1\r\n else:\r\n j+=1\r\nprint(c)\r\n", "def freq(arr):\r\n sum = 0\r\n dict = {}\r\n for i in arr:\r\n if i not in dict:\r\n dict[i] = 1\r\n else:\r\n dict[i] += 1\r\n return dict\r\ndef f(L,M):\r\n X=freq(L)\r\n Y=sorted(M)\r\n ans=0\r\n for j in Y:\r\n if j-1 in X and X[j-1]>0:\r\n X[j-1]=X[j-1]-1\r\n ans+=1\r\n elif j in X and X[j]>0:\r\n X[j]=X[j]-1\r\n ans+=1\r\n elif j+1 in X and X[j+1]>0:\r\n X[j+1]=X[j+1]-1\r\n ans+=1\r\n return ans\r\nn=input()\r\nL=list(map(int,input().split()))\r\nm=input()\r\nM=list(map(int,input().split()))\r\nif len(L)>len(M):\r\n print(f(L,M))\r\nelse:\r\n print(f(M,L))\r\n", "n = int(input())\r\na = map(int, input().split())\r\nm = int(input())\r\nb = map(int, input().split())\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\n\r\nk = 0\r\ni = j = 0\r\nwhile i<n and j< m:\r\n if abs(a[i] - b[j]) <= 1:\r\n k += 1\r\n i += 1\r\n j += 1\r\n else:\r\n if a[i] > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(k)", "n = input()\r\na = sorted(map(int, input().split()))\r\nm = input()\r\nb = sorted(map(int, input().split()))\r\npairs = 0\r\nia, ib = len(a) - 1, len(b) - 1\r\nwhile ia >= 0 and ib >= 0:\r\n if abs(a[ia] - b[ib]) <= 1:\r\n ia -= 1\r\n ib -= 1\r\n pairs += 1\r\n elif b[ib] > a[ia]:\r\n ib -= 1\r\n else:\r\n ia -= 1\r\nprint(pairs)\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nans = 0\r\npointerboys = 0\r\npointergirls = 0\r\nwhile n > pointerboys and m > pointergirls:\r\n for i in range(pointergirls,m):\r\n if abs(boys[pointerboys]-girls[i]) <= 1:\r\n ans += 1\r\n pointergirls = i+1\r\n break\r\n pointerboys += 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=int(input())\r\nlist2=list(map(int,input().split()))\r\ncount=0\r\nk=0\r\nl=0\r\nlist1.sort()\r\nlist2.sort()\r\nwhile k<n and l<m:\r\n if abs(list1[k] - list2[l]) <= 1:\r\n count += 1\r\n k += 1\r\n l += 1\r\n elif list1[k] < list2[l]:\r\n k += 1\r\n else:\r\n l += 1\r\nprint(count)\r\n", "a, a1, b, b1, c, d, n= int(input()), sorted(list(map(int, input().split()))), int(input()), sorted(list(map(int, input().split()))), 0, 0, 0\r\nwhile c < a and d < b:\r\n if abs(a1[c]-b1[d]) <= 1: n += 1; c += 1; d += 1\r\n else:\r\n if a1[c] < b1[d]: c += 1\r\n else:d += 1\r\nprint(n)", "n = int(input())\r\ns1 = [int(el) for el in input().split()]\r\nm = int(input())\r\ns2 = [int(el) for el in input().split()]\r\ns1.sort(reverse=True)\r\ns2.sort(reverse=True)\r\nc = 0\r\nwhile len(s1) > 0 and len(s2) > 0:\r\n if abs(s1[-1] - s2[-1]) <= 1:\r\n c += 1\r\n s1.pop()\r\n s2.pop()\r\n else:\r\n if s1[-1] < s2[-1]:\r\n s1.pop()\r\n else:\r\n s2.pop()\r\nprint(c)", "n1 = int(input())\r\nal = sorted(list(map(int, input().split())))\r\nn2 = int(input())\r\nar = sorted(list(map(int, input().split())))\r\nlo = up = ans = 0\r\n\r\ni = j = 0\r\nwhile i < n1 and j < n2:\r\n diff = al[i] - ar[j]\r\n if diff == 0 or diff == 1 or diff == -1:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n elif diff < 0:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter(a)\r\ncc=Counter(b)\r\na=sorted(set(a))\r\nb=sorted(set(b))\r\nsm=0\r\nfor i in range(5):\r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if(abs(a[i]-b[j])<=1):\r\n if(c[a[i]]==cc[b[j]]):\r\n sm+=c[a[i]]\r\n c[a[i]]=0\r\n cc[b[j]]=0\r\n elif(c[a[i]]>cc[b[j]]):\r\n c[a[i]]-=cc[b[j]]\r\n sm+=cc[b[j]]\r\n cc[b[j]]=0\r\n\r\n else:\r\n cc[b[j]] -= c[a[i]]\r\n sm+=c[a[i]]\r\n c[a[i]] = 0\r\nprint(sm)", "n = int(input())\r\nboys = list(map(int, input().split()))\r\n\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nk=0\r\nc=0\r\nfor i in range(n):\r\n for j in range(k, m):\r\n if abs(boys[i]-girls[j])<2:\r\n c+=1\r\n k=j+1\r\n break\r\nprint(c)\r\n", "# ELO 1200\r\nimport sys\r\n\r\n\r\ndef check_skills(skill1, skill2, pairs, pair_index):\r\n if (pair_index not in pairs) and (skill1 in (skill2, skill2 - 1, skill2 + 1)):\r\n return True\r\n return False\r\n\r\n\r\ninput_file = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\ninput_file = input_file.split()\r\n\r\nnum_boys = int(input_file[0])\r\nboy_skills = []\r\ndel input_file[0]\r\nfor i in range(num_boys):\r\n boy_skills.append(int(input_file[i]))\r\ndel input_file[0:num_boys]\r\n\r\nnum_girls = int(input_file[0])\r\ngirl_skills = []\r\ndel input_file[0]\r\nfor i in range(num_girls):\r\n girl_skills.append(int(input_file[i]))\r\ndel input_file[0:num_girls]\r\n\r\nboy_skills.sort()\r\ngirl_skills.sort()\r\n\r\nboy_index = 0\r\ngirl_index = 0\r\nnum_pairs = 0\r\nwhile boy_index < num_boys and girl_index < num_girls:\r\n if abs(boy_skills[boy_index] - girl_skills[girl_index]) < 2:\r\n num_pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boy_skills[boy_index] < girl_skills[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\nprint(num_pairs)\r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\n\r\ncounter = 0\r\ni, j = 0, 0\r\nwhile i < len(a):\r\n while j < len(b):\r\n if abs(b[j] - a[i]) <= 1:\r\n del a[i]\r\n del b[j]\r\n counter += 1\r\n i -= 1\r\n break\r\n j += 1\r\n i += 1\r\n j = 0\r\nprint(counter)\r\n", "from sys import stdin\n\nstream = None\ntry:\n stream = open('../1200/file.txt', 'r')\nexcept:\n stream = stdin\n\nn = int(stream.readline())\nmen = [int(i) for i in stream.readline().split()]\nm = int(stream.readline())\nwomen = [int(i) for i in stream.readline().split()]\n\nmen.sort()\nwomen.sort()\n\ni = 0\nj = 0\ncount = 0\nwhile i < len(men) and j < len(women):\n delta = men[i] - women[j]\n if abs(delta) < 2:\n count += 1\n i += 1\n j += 1\n else:\n if delta < 0:\n i += 1\n else:\n j += 1\nprint(count)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nb.sort()\r\nk = 0\r\nfor i in a:\r\n for j in b:\r\n if(abs(i-j)<2):\r\n b.remove(j)\r\n k += 1\r\n break \r\nprint(k)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\na.sort(reverse = True)\nb.sort(reverse = True)\nans = 0\nfor i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) <= 1:\n ans += 1\n b[j] = 100000000000000000000000000000000\n break\nprint(ans)", "def solve():\r\n n = int(input())\r\n boys = list(map(int, input().split()))\r\n m = int(input())\r\n girls = list(map(int, input().split()))\r\n boys.sort()\r\n girls.sort()\r\n l = r = c = 0\r\n\r\n while l < n and r < m:\r\n if abs(boys[l]-girls[r]) <= 1:\r\n l += 1\r\n r += 1\r\n c += 1\r\n elif boys[l] < girls[r]:\r\n l += 1\r\n else:\r\n r += 1\r\n\r\n print(c)\r\n\r\nif \"__main__\" == __name__:\r\n solve()", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nn=int(input())\r\nf=list(map(int,input().split(\" \")))\r\nm=int(input())\r\ns=list(map(int,input().split(\" \")))\r\nf.sort()\r\ns.sort()\r\nfi,si=0,0\r\nc=0\r\n#print(f,s)\r\nwhile(fi<n and si<m):\r\n #print(fi,si, f[fi],s[si])\r\n \r\n if(abs(f[fi]-s[si]==0) or abs(f[fi]-s[si])==1):\r\n c+=1\r\n fi+=1 \r\n si+=1\r\n \r\n elif(f[fi]-s[si]>1):\r\n si+=1 \r\n \r\n elif(f[fi]-s[si]<0):\r\n fi+=1 \r\n \r\n \r\n \r\n\r\nprint(c)\r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=x+[1018]\r\nm=int(input())\r\ny=list(map(int,input().split()))\r\ny=y+[1018]\r\nx.sort()\r\ny.sort()\r\ni=0\r\nj=0\r\ncounter=0\r\nwhile (i<n or j<m):\r\n if(abs(x[i]-y[j])<2):\r\n # print(x[i],y[j])\r\n j+=1\r\n i+=1\r\n counter=counter+1\r\n elif(x[i]>y[j]):\r\n j+=1\r\n elif(x[i]<y[j]):\r\n i+=1\r\n # print(i, j,counter)\r\nprint(counter)\r\n\r\n\r\n", "i=int(input())\r\nl1=list(map(int,input().split()))\r\ni=int(input())\r\nl2=list(map(int,input().split()))\r\nl1.sort()\r\nl2.sort()\r\nl,r=0,0\r\nsol=0\r\nwhile l<len(l1) and r<len(l2) :\r\n if l1[l]>l2[r] :\r\n if l1[l]==l2[r]+1 :\r\n sol+=1\r\n l+=1\r\n r+=1\r\n elif l1[l]<l2[r] :\r\n if l2[r]==l1[l]+1 :\r\n sol+=1\r\n r+=1\r\n l+=1\r\n else :\r\n sol+=1\r\n l+=1\r\n r+=1\r\n\r\nprint(sol)", "def pairing(a, b, n, m):\r\n count = 0\r\n k = 0\r\n for i in range(n):\r\n for j in range(k, m):\r\n if a[i] - b[j] <= 1 and a[i] - b[j] >= -1:\r\n count+= 1\r\n k = j + 1\r\n break\r\n print(count)\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\nm = int(input())\r\ng = list(map(int, input().split()))\r\nb.sort()\r\ng.sort()\r\n\r\nif n < m:\r\n pairing(b, g, n, m)\r\nelse:\r\n pairing(g, b, m, n)", "boys_num = int(input())\r\nboys = [int(i) for i in input().split()]\r\ngirls_num = int(input())\r\ngirls = [int(i) for i in input().split()]\r\nboys = sorted(boys)\r\ngirls = sorted(girls)\r\nb_index = g_index = output = 0\r\n\r\nwhile b_index != boys_num and g_index != girls_num:\r\n if abs(boys[b_index] - girls[g_index]) <= 1:\r\n output += 1\r\n b_index += 1\r\n g_index += 1\r\n elif boys[b_index] > girls[g_index]:\r\n g_index += 1\r\n elif girls[g_index] > boys[b_index]:\r\n b_index += 1\r\n\r\nprint(output)\r\n", "n=int(input())\r\nboy=sorted([int(a) for a in input().split()])\r\nm=int(input())\r\ngirl=sorted([int(b) for b in input().split()])\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if boy[i]!=\"no\" and girl[j] !=\"no\":\r\n if abs(girl[j]-boy[i])<=1:\r\n ans+=1\r\n boy[i],girl[j]=\"no\",\"no\"\r\nprint(ans)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\r\nimport math\r\n\r\nif __name__ == '__main__':\r\n _ = int(input().strip())\r\n b = [int(x) for x in input().strip().split(\" \")]\r\n _ = int(input().strip())\r\n g = [int(x) for x in input().strip().split(\" \")]\r\n b.sort()\r\n g.sort()\r\n\r\n i = 0\r\n j = 0\r\n r = 0\r\n while i < len(b) and j < len(g):\r\n if abs(b[i] - g[j]) <= 1:\r\n r += 1\r\n i += 1\r\n j += 1\r\n elif b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n print(r)", "\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nm=int(input())\r\ng=list(map(int,input().split()))\r\nans=0\r\nb.sort()\r\ng.sort()\r\ni=0\r\nj=0\r\n\r\nwhile(i<len(b) and j<len(g)):\r\n if abs(b[i]-g[j])<=1:\r\n i+=1\r\n j+=1\r\n ans+=1\r\n else:\r\n if b[i]<g[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(ans)", "n = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ng = sorted(list(map(int, input().split())))\r\npair = 0\r\n\r\nfor boy in b:\r\n for girl in g:\r\n if boy == girl:\r\n pair += 1\r\n g.remove(boy)\r\n break\r\n \r\n elif (boy + 1) == girl:\r\n pair += 1\r\n g.remove(boy+1)\r\n break\r\n \r\n elif (boy - 1) == girl:\r\n pair += 1\r\n g.remove(boy-1)\r\n break\r\n \r\nprint(pair)", "while True:\r\n try:\r\n n=int(input())\r\n li1=input().split()\r\n for i in range(0,len(li1)):\r\n li1[i]=int(li1[i])\r\n m=int(input())\r\n li2=input().split()\r\n for i in range(0,len(li2)):\r\n li2[i]=int(li2[i])\r\n li1=sorted(li1)\r\n li2=sorted(li2)\r\n x=0\r\n y=0\r\n total=0\r\n while x<len(li1) and y<len(li2):\r\n if abs(li1[x]-li2[y])<=1:\r\n total+=1\r\n x+=1\r\n y+=1\r\n else:\r\n if li1[x]>li2[y]:\r\n y+=1\r\n else:\r\n x+=1\r\n print(total)\r\n except EOFError:\r\n break\r\n", "def solve(n, m, girls, boys):\r\n q = 1000\r\n cnt = 0\r\n girls.sort()\r\n boys.sort()\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n if abs(boys[i] - girls[j]) <= 1:\r\n cnt += 1\r\n girls[j] = q\r\n break\r\n\r\n return cnt\r\n\r\nn = int(input())\r\ngirls = list(map(int, input().split()))\r\nm = int(input())\r\nboys = list(map(int, input().split()))\r\nprint(solve(n, m, girls, boys))\r\n", "n = map(int, input())\nman = list(map(int, input().split()))\n\nn = map(int, input())\nwoman = list(map(int, input().split()))\n\nman.sort()\nwoman.sort()\n\nm = 0\nw = 0\nres = 0\nwhile m < len(man) and w < len(woman):\n if abs(man[m] - woman[w]) <= 1:\n m += 1\n w += 1\n res += 1\n elif man[m] < woman[w]:\n m += 1\n else:\n w += 1\n \nprint(res)\n \t\t\t \t\t\t \t \t\t \t \t \t\t", "int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nint(input())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nh=0\r\nfor i in range(len(l)):\r\n\tfor j in range(len(c)):\r\n\t\tif l[i]==c[j] or abs(l[i]-c[j])==1:\r\n\t\t\th+=1\r\n\t\t\tc.remove(c[j])\r\n\t\t\tbreak\r\nprint(h)", "\"\"\"\nel tiempo de ejecución del algoritmo es dominado por el ordenamiento por inserción y se estima en O(n^2) en el peor caso.\n\nEste algoritmo toma dos listas de números, \"w\" y \"x\", las ordena utilizando el algoritmo de ordenamiento por inserción, y luego encuentra la cantidad de pares donde la diferencia entre los números en un par sea igual o menor a 1. Luego, imprime la cantidad de pares encontrados.\n\"\"\"\n\nimport sys\n\ndef insertion_sort(arr):\n\n for i in range(1, len(arr)):\n\n key = arr[i]\n j = i - 1\n\n while j>= 0 and arr[j]> key:\n\n arr[j+1] = arr[j]\n j -= 1\n\n arr[j+1] = key\n return arr\n\ndef main():\n\n t = int(sys.stdin.readline())\n w = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n x = list(map(int, sys.stdin.readline().split()))\n insertion_sort(w)\n insertion_sort(x)\n\n pares = 0\n\n for i in range(t):\n\n for j in range(m):\n\n if abs(w[i] - x[j]) < 2:\n\n x[j] = 9000000\n pares += 1\n\n break\n\n print(pares)\n\nmain()\n\n \t \t \t\t \t \t\t\t\t \t\t \t\t \t\t", "a = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nc = int(input())\r\nd = sorted(list(map(int, input().split())))\r\ncount = 0\r\nfor i in range(0, len(b)):\r\n for j in range(0, len(d)):\r\n if -1 <= b[i] - d[j] <= 1:\r\n count = count + 1\r\n d.remove(d[j])\r\n break\r\n\r\nprint(count)", "def Main(n, m, a, b):\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) <= 1:\r\n ans += 1\r\n a[i] = 1000\r\n b[j] = 1000\r\n break\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\n\r\nif n > m:\r\n print(Main(n, m, a, b))\r\nelse:\r\n print(Main(m, n, b, a))\r\n", "w = int(input())\r\nx = sorted(map(int, input().split()))\r\ny = int(input())\r\nz = sorted(map(int, input().split()))\r\nm = 0\r\nn = 0\r\ns = 0\r\nwhile m < w and n < y:\r\n if abs(x[m] - z[n]) <= 1:\r\n s += 1\r\n m += 1\r\n n += 1\r\n elif x[m] > z[n]:\r\n n += 1\r\n elif x[m] < z[n]:\r\n m += 1\r\nprint(s)", "n=int(input())\nb=list(map(int,input().split()))\nb.sort()\nm=int(input())\ng=list(map(int,input().split()))\ng.sort()\n\ni=0\nj=0\ncount=0\nwhile i<n and j<m:\n if abs(b[i]-g[j])<=1:\n i+=1\n j+=1\n count+=1\n elif b[i]>g[j]:\n j+=1\n else:\n i+=1\nprint(count)", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int,input().split())))\r\n\r\nap = bp = 0\r\ncount = 0\r\n\r\nwhile ap<n and bp<m:\r\n if a[ap]==b[bp] or (abs(a[ap]-b[bp])==1):\r\n count += 1\r\n ap += 1\r\n bp += 1\r\n else:\r\n if a[ap]<b[bp]:\r\n ap += 1\r\n else:\r\n bp += 1\r\n\r\nprint(count)", "\r\ndef maximum_numbeb_of_pairs(A, B):\r\n res = 0\r\n n, m = len(A), len(B)\r\n A.sort()\r\n B.sort()\r\n \r\n i, j = 0, 0\r\n while i < n and j < m:\r\n if abs(A[i] - B[j]) <= 1:\r\n res += 1\r\n i += 1\r\n j += 1\r\n elif A[i] > B[j]:\r\n j += 1\r\n elif A[i] < B[j]:\r\n i += 1\r\n \r\n return res\r\n \r\n \r\n \r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n m = int(input())\r\n b = [int(i) for i in input().split()]\r\n \r\n print(maximum_numbeb_of_pairs(a, b))\r\n", "\r\ndef diff(x, y):\r\n if x == y or x == y + 1 or x == y - 1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef check(large, small):\r\n count = 0\r\n for x in large:\r\n for y in small:\r\n if diff(x,y) == True:\r\n count += 1\r\n small.remove(y)\r\n break\r\n return count\r\n\r\nn = int(input())\r\nmale = [int(x) for x in input().split()]\r\nm = int(input())\r\nfemale = [int(x) for x in input().split()]\r\n\r\nmale.sort()\r\nfemale.sort()\r\nkq = check(male,female)\r\nprint(kq)\r\n", "I= lambda: sorted(map(int,input().split()))\r\nn=I()[0]; a=I(); m=I()[0]; b=I()\r\nc=i=j=0;\r\nwhile i<n and j<m: \r\n if abs(a[i]-b[j])<2: c+=1;i+=1;j+=1\r\n elif a[i]>b[j]: j+=1 \r\n else: i+=1\r\nprint(c)", "n = int(input())\nniños = sorted(map(int, input().split()))\nm = int(input())\nniñas = sorted(map(int, input().split()))\n\ni, j, par = 0, 0, 0\nwhile i < n and j < m:\n if abs(niños[i] - niñas[j]) <= 1:\n par += 1\n i += 1\n j += 1\n elif niños[i] < niñas[j]:\n i += 1\n else:\n j += 1\n\nprint(par)\n \t \t\t\t \t \t \t\t\t \t \t \t\t\t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\nprint(count)\r\n", "aa=int(input())\na=list(map(int,input().split()))\nbb=int(input())\nb=list(map(int,input().split()))\na.sort()\nb.sort()\ncount=0\nfor i in range(aa):\n\tfor j in range(bb):\n\t\tif abs(a[i]-b[j])<=1:\n\t\t\tcount+=1\n\t\t\tb[j]=float(\"inf\")\n\t\t\tbreak\nprint(count)\n\t\t\t", "n = int(input())\nl_b = list(map(int, input().split()))\nl_b.sort()\n\nm = int(input())\nl_g = list(map(int, input().split()))\nl_g.sort()\n\nb_i = 0\ng_i = 0\nt = 0\n\nwhile b_i < len(l_b) and g_i < len(l_g):\n if abs(l_b[b_i] - l_g[g_i]) <= 1:\n t += 1\n b_i += 1\n g_i += 1\n else:\n if l_b[b_i] < l_g[g_i]:\n b_i += 1\n else:\n g_i += 1\n\nprint(t)", "n = input()\r\na = sorted(map(int, input().split()))\r\nm = input()\r\nb = sorted(map(int, input().split()))\r\nres = 0\r\nwhile a and b:\r\n if abs(a[-1] - b[-1]) <= 1:\r\n res += 1\r\n a.pop()\r\n b.pop()\r\n elif a[-1] > b[-1]:\r\n a.pop()\r\n else:\r\n b.pop()\r\nprint(res)\r\n", "nb=int(input())\r\nb = list(map(int,input().split()))\r\nng=int(input())\r\ng = list(map(int,input().split()))\r\nb.sort()\r\ng.sort()\r\nbi=0\r\ngi=0\r\ncount=0\r\nwhile bi < len(b) and gi < len(g):\r\n if abs(b[bi]-g[gi]) <=1:\r\n count+=1\r\n bi+=1\r\n gi+=1\r\n else:\r\n if b[bi]>g[gi]:\r\n gi+=1\r\n else:\r\n bi+=1\r\nprint(count)\r\n", "len_girls = int(input())\ngirls = [int(x) for x in input().split()]\nlen_boys = int(input())\nboys = [int(x) for x in input().split()]\n\ngirls.sort()\nboys.sort()\n\nb = -1\ng = -1\nmax_ = 0\n\nwhile g >= -len_girls and b >= -len_boys:\n diff = boys[b] - girls[g]\n if abs(diff) <=1:\n max_ +=1\n g-=1\n b-=1\n elif diff < 0:\n g-=1\n elif diff > 1:\n b-=1\n\n\nprint(max_)\n\t\t \t\t \t\t \t\t\t \t\t\t\t \t \t \t \t\t", "n=int(input())\r\narr1=[int(x) for x in input().split()]\r\nm=int(input())\r\narr2=[int(x) for x in input().split()]\r\narr1.sort()\r\narr2.sort()\r\ni=0\r\nj=0\r\nc=0\r\nwhile i<n and j<m: \r\n if abs(arr1[i]-arr2[j])<=1:\r\n c+=1\r\n i+=1 \r\n j+=1 \r\n else:\r\n if arr1[i]<arr2[j]:\r\n i+=1 \r\n else:\r\n j+=1 \r\nprint(c)\r\n \r\n \r\n ", "n = int(input())\nmen = list(map(int, input().split()))\n\nm = int(input())\nwomen = list(map(int, input().split()))\n\nmen.sort()\nwomen.sort()\n\ni = 0\nj = 0\n\npairs = 0\nwhile i < n and j < m:\n if abs(men[i] - women[j]) < 2:\n pairs += 1\n i += 1\n j += 1\n elif men[i] < women[j]:\n i += 1\n else:\n j += 1\n \nprint(pairs)\n\n\n\t \t \t \t\t \t \t\t\t\t \t\t\t \t \t \t \t", "al = int(input())\r\na = sorted(list(map(int, (input().split()))))\r\nbl = int(input())\r\nb = sorted(list(map(int, (input().split()))))\r\ni = 0\r\nb.reverse()\r\na.reverse()\r\nwhile len(a) > 0 and len(b) > 0:\r\n if -1 <= a[0] - b[0] <= 1:\r\n i += 1\r\n a.remove(a[0])\r\n b.remove(b[0])\r\n else:\r\n a.remove(a[0]) if a > b else b.remove(b[0])\r\nprint(i)\r\n", "n = int(input())\r\nboys = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ngirls = sorted(list(map(int, input().split())))\r\ncurGirl = 0\r\ncurBoy = 0\r\nans = 0\r\nwhile curGirl < m and curBoy<n:\r\n if abs(girls[curGirl]-boys[curBoy])<=1:\r\n ans+=1\r\n curGirl+=1\r\n curBoy+=1\r\n elif girls[curGirl]-boys[curBoy]>1:\r\n curBoy+=1\r\n else:\r\n curGirl+=1\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\na = list(sorted(a))\r\nb = list(sorted(b))\r\ncount = 0\r\nindj = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if j not in indj and -1 < abs(a[i] - b[j]) < 2:\r\n count += 1\r\n indj.append(j)\r\n break\r\nprint(count)", "def hungarian_algorithm(graph):\r\n def dfs(node):\r\n if node in visited:\r\n return False\r\n visited.add(node)\r\n\r\n for neighbor in graph[node]:\r\n if neighbor not in matching or dfs(matching[neighbor]):\r\n matching[neighbor] = node\r\n return True\r\n return False\r\n\r\n matching = {}\r\n for node in graph:\r\n visited = set()\r\n dfs(node)\r\n\r\n return matching\r\n\r\nn = int(input())\r\nn_nums = list(map(int, input().strip().split()))\r\nn_nums.sort()\r\n\r\nm = int(input())\r\nm_nums = list(map(int, input().strip().split()))\r\nm_nums.sort()\r\n\r\nfrom collections import defaultdict\r\ngraph = defaultdict(list)\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(n_nums[i] - m_nums[j]) <= 1:\r\n graph[i].append(j)\r\n\r\n\r\nmatching = hungarian_algorithm(graph)\r\nprint(len(matching))\r\n\r\n# for key, value in matching.items():\r\n# print(f\"{value} matched with {key}\")\r\n", "p=lambda:sorted(map(int,input().split()));n=p()[0];a=p();m=p()[0];b=p();\r\ni,j,k=0,0,0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\r\n elif a[i]<b[j]:i+=1\r\n else:j+=1\r\nprint(k)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nbrr = list(map(int,input().split()))\r\ncnt=0\r\narr.sort();brr.sort()\r\nfor i in range(n):\r\n for j in range(m):\r\n if(abs(arr[i]-brr[j])<2):\r\n brr[j]=1000\r\n cnt+=1\r\n break\r\n \r\nprint(cnt)\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\ni = 0\r\nj = 0\r\ncnt = 0\r\nwhile(i<n and j<m):\r\n if(abs(boys[i] - girls[j]) <= 1):\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n elif(boys[i] < girls[j]):\r\n i += 1\r\n else:\r\n j += 1\r\nprint(cnt)", "#https://codeforces.com/problemset/problem/489/B\r\n# BerSUBall.py\r\n\r\n# Author: Logan Pipes\r\n# Date: 12-09-2023\r\n# Tags: \r\n\r\nn = int(input())\r\na = sorted([int(elem) for elem in input().split()])\r\nm = int(input())\r\nb = sorted([int(elem) for elem in input().split()])\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j+= 1\r\n elif a[i] > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nb = sorted(map(int,input().split()))\r\nm = int(input())\r\ng = sorted(map(int,input().split()))\r\ncnt = 0\r\ni,j =0,0\r\nwhile i<n and j<m:\r\n if abs(b[i]-g[j])<=1:cnt+=1;i+=1;j+=1\r\n elif b[i]<g[j]:i+=1\r\n elif b[i]>g[j]:j+=1\r\nprint(cnt)", "nb = int(input())\r\n\r\nb = list(map(int, input().split()))\r\n\r\nng = int(input())\r\n\r\ng = list(map(int, input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\n\r\nteams = 0\r\n\r\nfor i in range(nb):\r\n\r\n cb = b[i]\r\n\r\n for j in range(ng):\r\n\r\n cg = g[j]\r\n\r\n if abs(cb - cg) <= 1:\r\n\r\n teams += 1 \r\n\r\n g.pop(j)\r\n ng -= 1\r\n\r\n break\r\nprint(teams)\r\n", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\n\na.sort()\nb.sort()\n\ni1 = 0\ni2 = 0\npairs = 0\n\nwhile i1 < n and i2 < m:\n if abs(a[i1] - b[i2]) <= 1:\n pairs += 1\n i1 += 1\n i2 += 1\n else:\n if a[i1] <= b[i2]:\n i1 += 1\n else:\n i2 += 1\nprint(pairs)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nans = 0\r\na.sort()\r\nb.sort()\r\ni = 0\r\nfor j in range(m):\r\n if i >= n:\r\n break\r\n while i < n and b[j] > a[i] + 1:\r\n i += 1\r\n if i >= n:\r\n break\r\n if b[j] + 1 < a[i]:\r\n continue\r\n ans += 1\r\n i += 1\r\nprint(ans)\r\n", "import sys\ndef insertion_sort(arr):\n for i in range(1, len(arr)):\n key = arr[i]\n j = i - 1\n while j >= 0 and arr[j] > key:\n arr[j + 1] = arr[j]\n j -= 1\n arr[j + 1] = key\n return arr\n \ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n b = list(map(int, sys.stdin.readline().split()))\n insertion_sort(a)\n insertion_sort(b)\n pairs = 0\n for i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) < 2:\n b[j] = 6000000\n pairs += 1\n break\n print(pairs)\nmain()\n\n\"\"\"\nSea n la longitud del arreglo a y m la longitud del arreglo b, por medio del metodo de insercion se organizaron los dos arreglos de manera desendente, posteriormente, se crearon dos ciclos, el primero recorre itera a lista a, hay que tener en cuenta que va mas rapido el segundo ciclo donde el iterador es j, cada elemento de a es comparado con cada elemento de b, si si el valor absoluto de la diferencia de a[i]-b[j] es menor a 2 entonces el valor de b[j] es modificado y se pasa al siguiente valor de de i para comparar a [i+1] con el resto de elementos de b. b[i] toma el valor de un numero que sale de rango, de esta forma ya no se puede comparar, cada vez que se cumple la condicion se suma 1 al contador de parejas, cuando se acaba el ciclo principal, se muestra el total de parejas.\nTiempo: O(n^2)\n\"\"\"\n \t\t\t\t \t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\nboys.sort()\r\ngirls.sort()\r\npara = 0\r\na = 0\r\nb = 0\r\nwhile a < n and b < m:\r\n if abs(boys[a] - girls[b]) <= 1:\r\n a += 1\r\n b += 1\r\n para += 1\r\n elif boys[a] < girls[b]:\r\n a += 1\r\n else:\r\n b += 1\r\nprint(para)", "n = int(input())\r\nA = sorted(list(map(int, input().split())), reverse = True)\r\nm = int(input())\r\nB = sorted(list(map(int, input().split())), reverse = True)\r\nans = 0\r\nwhile A and B:\r\n if A[-1] == B[-1] or A[-1]+1 == B[-1] or A[-1]-1 == B[-1]:\r\n ans += 1\r\n A.pop()\r\n B.pop()\r\n continue\r\n if A[-1] < B[-1]:\r\n A.pop()\r\n else:\r\n B.pop()\r\nprint(ans)", "boys_count = int(input()) # Количество мальчиков\r\nboys_list = list(map(int, input().split())) # Список с показателями скиллов каждого мальчика\r\nboys_list.sort() # Сортируем список мальчиков\r\ngirls_count = int(input()) # Количество девочек\r\ngirls_list = list(map(int, input().split())) # Список с показателями скиллов каждой девочки\r\ngirls_list.sort() # Сортируем список девочек\r\nboys = 0 # Это первый мальчик индекс всегда равен 0 т.к. происходит удаление\r\ngirls = 0 # Это первая девочка индекс всегда равен 0 т.к. происходит удаление\r\ncount = 0 # Это количество пар, которое пока равно нулю\r\n\r\n# Пока один из списков не станет пустым\r\nwhile boys_list != [] and girls_list != []: \r\n if abs(boys_list[boys] - girls_list[girls]) <= 1: # Если разность по модулю не больше единицы\r\n count += 1 # Прибавляем пару\r\n boys_list.pop(boys_list.index(boys_list[boys])) # Удаляем из списка этого мальчика\r\n girls_list.pop(girls_list.index(girls_list[girls])) # Удаляем из списка эту девочку\r\n else: # Иначе\r\n if boys_list[boys] > girls_list[girls]: # Если по скиллу мальчик лучше, чем девочка то этой девочке пару уже не найти \r\n girls_list.pop(girls_list.index(girls_list[girls])) # Поэтому удаляем её из списка\r\n \r\n else: # Если же девочка скилловее мальчика, то мы не сможем найти пару мальчику\r\n boys_list.pop(boys_list.index(boys_list[boys])) # Поэтому удаляем его\r\nprint(count) # Выводим количество пар", "def max_pairs(n, boys, m, girls):\r\n boys.sort()\r\n girls.sort()\r\n\r\n # Create a table to store the lengths of LCS for all subproblems\r\n lcs_table = [[0] * (m + 1) for i in range(n + 1)]\r\n\r\n # Fill the table in a bottom-up manner\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if abs(boys[i - 1] - girls[j - 1]) <= 1:\r\n lcs_table[i][j] = lcs_table[i - 1][j - 1] + 1\r\n else:\r\n lcs_table[i][j] = max(lcs_table[i - 1][j], lcs_table[i][j - 1])\r\n\r\n # The length of the LCS is the maximum number of pairs that can be formed\r\n return lcs_table[n][m]\r\n\r\n# Read input\r\nn = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\n# Print the maximum number of pairs that can be formed\r\nmax_num_pairs = max_pairs(n, boys, m, girls)\r\nprint(max_num_pairs)\r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\npairs = 0\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nif n > m:\r\n # Create a list to track if each boy is already paired\r\n is_paired = [False] * n\r\n\r\n for girl in girls:\r\n potential_boys = []\r\n\r\n for i in range(n):\r\n if not is_paired[i] and abs(boys[i] - girl) <= 1:\r\n potential_boys.append(i)\r\n\r\n if potential_boys:\r\n # Pair the girl with the boy with the lowest skill\r\n is_paired[potential_boys[0]] = True\r\n pairs += 1\r\n\r\nelse:\r\n # Create a list to track if each girl is already paired\r\n is_paired = [False] * m\r\n\r\n for boy in boys:\r\n potential_girls = []\r\n\r\n for i in range(m):\r\n if not is_paired[i] and abs(boy - girls[i]) <= 1:\r\n potential_girls.append(i)\r\n\r\n if potential_girls:\r\n # Pair the boy with the girl with the lowest skill\r\n is_paired[potential_girls[0]] = True\r\n pairs += 1\r\n\r\nprint(pairs)\r\n", "n=int(input())\r\nboys=sorted(list(map(int,input().split())))\r\nm=int(input())\r\ngirls=sorted(list(map(int,input().split())))\r\ni=0\r\nj=0\r\npairs=0\r\nwhile i<n and j<m:\r\n if abs(boys[i]-girls[j])<=1:\r\n i+=1\r\n j+=1\r\n pairs+=1\r\n elif boys[i]<girls[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(pairs)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\ni=0\r\nj=0\r\ns=0\r\nwhile(i<n and j<m):\r\n if(abs(a[i]-b[j])<=1):\r\n s+=1\r\n i+=1\r\n j+=1\r\n elif(a[i]-b[j]>1):\r\n j+=1\r\n elif(b[j]-a[i]>1):\r\n i+=1\r\nprint(s) ", "n = int(input())\nboys = list(map(int,input().split()))\nboys = sorted(boys)\nm = int(input())\ngirls = list(map(int,input().split()))\ngirls = sorted(girls)\npairs = 0\n\nfor b in boys:\n for i,g in enumerate(girls):\n if(abs(b-g) <2):\n pairs+=1\n del(girls[i])\n break;\nprint(pairs)\n \n \t \t \t \t \t\t \t\t\t \t\t\t \t", "n = int(input())\narr = list(map(int, input().split()))\nk = int(input())\nbrr = list(map(int, input().split()))\n\narr.sort()\nbrr.sort()\ng = 0\nm = 0\nresult = 0\nwhile g < k and m < n:\n if abs(arr[m] - brr[g]) <= 1:\n result += 1\n g += 1\n m += 1\n elif arr[m] > brr[g]:\n g += 1\n else:\n m += 1\nprint(result)\n \t \t \t \t \t\t\t\t\t\t \t \t\t\t \t\t\t", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nm = int(input())\r\nb = sorted([int(i) for i in input().split()])\r\ncount = 0\r\n\r\ni = j = 0\r\n\r\nwhile i < len(a) and j < len(b):\r\n\r\n if abs(a[i] - b[j]) <= 1:\r\n\r\n count += 1\r\n i += 1\r\n j += 1\r\n\r\n else:\r\n if a[i] > b[j]:\r\n j += 1\r\n elif b[j] > a[i]:\r\n i += 1\r\n\r\nprint(count)\r\n", "'''Descripcion algoritmo: se ingresan los valores, las lista son oredenadas por insertion sort, y luego se recorren\nambas lista con un bucle anidado, en el cual se comieza a comparar los elementos de lista_a con los de lista_b, si el\nvalor absoluto de estos dos es menor 2, se cuenta y en la lista_b se coloca un valor muy grande con ayuda de la\nlibreria math, y se rompe el bucle anidado con el fin de que para las siguientes consultas, no se haga la comparacion,\ny se pase al siguiente caso, esto hasta terminar de el primer bucle, y asi dar respuesta'''\n\n'''Complejidad temporal: T(n_insercion) = O(a^2+b^2) \n T(n_bucle) = O(ab)\n T(n_tolal) = O(a^2+b^2+ab) '''\nfrom sys import stdin\nimport math\n\ndef insercion(lista):\n for i in range(1, len(lista)):\n centinela = lista[i]\n j = i - 1\n while j >= 0 and lista[j] > centinela:\n lista[j + 1] = lista[j]\n j -= 1\n lista[j + 1] = centinela\n\n return lista\n\ndef main():\n a = int(stdin.readline())\n lista_a = insercion([int(x) for x in stdin.readline().split()])\n b = int(stdin.readline())\n lista_b = insercion([int(x) for x in stdin.readline().split()])\n parejas = 0\n\n for i in range(a):\n for j in range(b):\n if abs(lista_a[i]-lista_b[j]) < 2:\n parejas += 1\n lista_b[j] = math.inf\n break\n else:\n pass\n print(parejas)\n\n\nmain()\n\t\t\t \t \t \t\t \t \t \t\t \t", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nm = int(input())\r\nb = sorted(map(int, input().split()))\r\nc = 0\r\nwhile a and b:\r\n a0 = a[0]\r\n b0 = b[0]\r\n if abs(a0 - b0) <= 1:\r\n c += 1\r\n a, b = a[1:], b[1:]\r\n else:\r\n if a0 < b0:\r\n a = a[1:]\r\n else:\r\n b = b[1:]\r\nprint(c)\r\n", "import sys\r\n#import bisect\r\n#from collections import Counter\r\n\r\ninput = sys.stdin.readline\r\n#MOD=10*9+7\r\n\r\nif __name__ == '__main__':\r\n \r\n \r\n b=int(input())\r\n boys=list(map(int, input().split()))\r\n g=int(input())\r\n girls=list(map(int, input().split()))\r\n boys.sort()\r\n girls.sort()\r\n i,j,res=0,0,0\r\n while i<b and j<g:\r\n if boys[i]<girls[j]:\r\n if girls[j]-boys[i]<=1:\r\n res +=1\r\n j +=1\r\n i +=1\r\n else:\r\n if boys[i]-girls[j]<=1:\r\n res +=1\r\n i +=1\r\n j +=1\r\n print(res)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n manSkills:list[int] = []\r\n girlSkills:list[int] = []\r\n input()\r\n manSkills = list(map(int, input().split()))\r\n input()\r\n girlSkills = list(map(int, input().split()))\r\n\r\n\r\n maximumPairCount:int = 0\r\n revSortedManSkills:list[int] = sorted(manSkills, reverse=True)\r\n revSortedGirlSkills:list[int] = sorted(girlSkills, reverse=True)\r\n while revSortedManSkills and revSortedGirlSkills :\r\n if abs(revSortedManSkills[-1] - revSortedGirlSkills[-1]) <= 1 :\r\n revSortedManSkills.pop()\r\n revSortedGirlSkills.pop()\r\n maximumPairCount += 1\r\n continue\r\n\r\n if revSortedManSkills[-1] > revSortedGirlSkills[-1] :\r\n revSortedGirlSkills.pop()\r\n else :\r\n revSortedManSkills.pop()\r\n\r\n\r\n print(maximumPairCount)\r\n\r\nmain()", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\npairs = 0\r\n\r\na.sort()\r\nb.sort()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) < 2:\r\n b[j] = 1000\r\n pairs += 1\r\n break\r\n\r\nprint(pairs)\r\n", "no_of_boys = int(input())\r\nboys_skill_list = sorted(map(int, input().split()))\r\nno_of_girls = int(input())\r\ngirls_skill_list = sorted(map(int, input().split()))\r\n\r\ni = 0\r\nj = 0\r\npairs_count = 0\r\n\r\nwhile i < no_of_boys and j < no_of_girls:\r\n if abs(boys_skill_list[i] - girls_skill_list[j]) <= 1:\r\n pairs_count += 1\r\n i += 1\r\n j += 1\r\n elif boys_skill_list[i] < girls_skill_list[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs_count)\r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\npairs = 0\r\nboy_index = 0\r\ngirl_index = 0\r\n\r\nwhile boy_index < n and girl_index < m:\r\n if abs(boys[boy_index] - girls[girl_index]) <= 1:\r\n pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boys[boy_index] < girls[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\n\r\nprint(pairs)", "n=int(input()) #men quontity\r\na=list(map(int,input().split())) #men_skills\r\nm=int(input()) #women\r\nb=list(map(int,input().split())) #women_skills\r\na.sort()\r\nb.sort()\r\ni=0\r\nj=0\r\ncount=0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<=1:\r\n count+=1\r\n i+=1\r\n j+=1\r\n elif a[i]<b[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(count)\r\n\r\n\r\n \r\n", "def sopostavim(a,b):\r\n if 0 <= abs(a-b) <= 1:\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nd = list(map(int, input().split()))\r\n\r\np.sort()\r\nd.sort()\r\n\r\nres = 0\r\nfor i in range(0, len(p)):\r\n for j in range(0, len(d)):\r\n if sopostavim(p[i], d[j]):\r\n res += 1\r\n d[j] = 1000000\r\n break\r\n\r\n\r\nprint(res)", "#https://codeforces.com/problemset/problem/489/B\r\n\r\nnumber_boys = int(input())\r\nboys_skill = [int(x) for x in input().split(\" \")]\r\nboys_skill.sort()\r\nnumbers_girls = int(input())\r\ngirls_skill = [int(x) for x in input().split(\" \")]\r\ngirls_skill.sort()\r\npairs = 0\r\nfor boy in boys_skill:\r\n for x in range(len(girls_skill)):\r\n if(abs(boy - girls_skill[x]) <= 1):\r\n girls_skill.pop(x)\r\n pairs += 1\r\n break\r\nprint(pairs)\r\n\r\n", "def find_maximum_pairs(n, boys_skills, m, girls_skills):\r\n boys_skills.sort()\r\n girls_skills.sort()\r\n pairs = 0\r\n i = 0\r\n j = 0 \r\n while i < n and j < m:\r\n if abs(boys_skills[i] - girls_skills[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys_skills[i] > girls_skills[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n return pairs\r\n\r\n# Read the number of boys\r\nn = int(input())\r\n\r\n# Read the skills of boys\r\nboys_skills = list(map(int, input().split()))\r\n\r\n# Read the number of girls\r\nm = int(input())\r\n\r\n# Read the skills of girls\r\ngirls_skills = list(map(int, input().split()))\r\n\r\n# Find the maximum possible number of pairs\r\nmax_pairs = find_maximum_pairs(n, boys_skills, m, girls_skills)\r\n\r\n# Print the result\r\nprint(max_pairs)", "n = int(input())\r\nboys_skills = list(map(int, input().split()))\r\nm = int(input())\r\ngirls_skills = list(map(int, input().split()))\r\n\r\nboys_skills.sort()\r\ngirls_skills.sort()\r\n\r\nboy_index = 0\r\ngirl_index = 0\r\npairs = 0\r\n\r\nwhile boy_index < n and girl_index < m:\r\n if abs(boys_skills[boy_index] - girls_skills[girl_index]) <= 1:\r\n pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boys_skills[boy_index] < girls_skills[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\n\r\nprint(pairs)\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\na = iia()\r\nm = ii1()\r\nb = iia()\r\n\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\ncount = 0\r\nwhile len(a) and len(b):\r\n if abs(a[0] - b[0]) <= 1:\r\n count +=1\r\n a.pop(0)\r\n b.pop(0)\r\n else:\r\n if a[0] < b[0]:\r\n a.pop(0)\r\n else:\r\n b.pop(0)\r\nprint(count)", "m = int(input())\r\nlm = sorted([int(i) for i in input().split()])\r\nd = int(input())\r\nld = sorted([int(i) for i in input().split()])\r\nc = 0\r\nmaxl = max(len(ld), len(lm))\r\nif maxl == len(ld):\r\n maxl = ld\r\n minl = lm\r\nelse:\r\n maxl = lm\r\n minl = ld\r\nwhile len(minl) != 0:\r\n flag = False\r\n for i in range(len(maxl)):\r\n for j in range(len(minl)):\r\n if abs(maxl[i]-minl[j]) <= 1:\r\n c += 1\r\n maxl.pop(i)\r\n minl.pop(j)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n break\r\nprint(c)\r\n", "p=lambda:sorted(map(int,input().split()));n=p()[0];a=p();m=p()[0];b=p();\ni,j,k=0,0,0\nwhile i<n and j<m:\n if abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\n elif a[i]<b[j]:i+=1\n else:j+=1\nprint(k)\n \t\t \t \t \t\t\t\t\t \t \t\t \t\t \t \t\t\t", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\nA = Counter(map(int,input().strip().split()))\r\nm = int(input())\r\nB = Counter(map(int,input().strip().split()))\r\n\r\ncnt = 0\r\nfor i in range(101):\r\n for j in range(-1,2):\r\n m = min(A[i],B[i + j])\r\n cnt += m\r\n A[i] -= m\r\n B[i+j] -= m\r\nprint(cnt)", "m=int(input())\r\na=list(map(int,input().split()))\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\noccupied=[]\r\nif len(a)<len(b):\r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<=1:\r\n if j in occupied:\r\n continue\r\n else:\r\n occupied.append(j)\r\n break\r\n print(len(occupied))\r\nelse:\r\n for i in range(len(b)):\r\n for j in range(len(a)):\r\n if abs(b[i]-a[j])<=1:\r\n if j in occupied:\r\n continue\r\n else:\r\n occupied.append(j)\r\n break\r\n print(len(occupied))\r\n \r\n", "n = int(input())\r\nls1 = list(map(int, input().split()))\r\nm = int(input())\r\nls2 = list(map(int, input().split()))\r\nls1.sort()\r\nls2.sort()\r\nindex = 0\r\nwhile(len(ls1)!=0 and len(ls2)!=0):\r\n if ls1[0] + 1 < ls2[0]:\r\n ls1.remove(ls1[0])\r\n elif ls1[0] > ls2[0] + 1:\r\n ls2.remove(ls2[0])\r\n else:\r\n ls1.remove(ls1[0])\r\n ls2.remove(ls2[0])\r\n index = index + 1\r\nprint(index)", "# https://codeforces.com/problemset/problem/489/B\r\n\r\ndef main():\r\n a = int(input())\r\n la = sorted(map(int, input().split(' ')))\r\n b = int(input())\r\n lb = map(int, input().split(' '))\r\n _map = {}\r\n for i in lb:\r\n if i in _map:\r\n _map[i] += 1\r\n else:\r\n _map[i] = 1\r\n count = 0\r\n for i in la:\r\n options = (i - 1, i, i + 1)\r\n for j in options:\r\n if j in _map and _map[j] > 0:\r\n count += 1\r\n _map[j] -= 1\r\n break\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = input()\nb = list(map(int, input().split()))\nm = input()\ng = list(map(int,input().split()))\nb.sort()\ng.sort()\nm=0\nfor i in range(len(b)):\n for j in range(len(g)):\n if abs(g[j] - b[i]) <= 1:\n m += 1\n g[j] = -10\n break\nprint(m)\n", "\r\nn = int(input())\r\na = list(map(int , input().split()))\r\nt = int(input())\r\nb = list(map(int , input().split()))\r\na = sorted(a)\r\nb = sorted(b)\r\nc = 0\r\n\r\nfor i in range(n):\r\n for j in range(t):\r\n if(abs(a[i] - b[j]) <= 1):\r\n c += 1 \r\n b[j] = 100000\r\n break \r\n \r\n\r\nprint(c)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\ns = 0\r\nwhile a and b:\r\n if a[0] == b[0] or a[0] == b[0] + 1 or a[0] == b[0] - 1:\r\n s += 1\r\n a.pop(0)\r\n b.pop(0)\r\n else:\r\n if a[0] > b[0]:\r\n b.pop(0)\r\n else:\r\n a.pop(0)\r\nprint(s)", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nboys = sorted(boys)\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\ngirls = sorted(girls)\r\n\r\ni, j = 0, 0\r\ns = 0\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n s += 1\r\n i, j = i+1, j+1\r\n else:\r\n (i,j) = (i+1,j) if boys[i] < girls[j] else (i, j+1)\r\nprint(s)", "n=int(input())\r\nboys=[int(i) for i in input().split()]\r\nm=int(input())\r\ngirls=[int(i) for i in input().split()]\r\nboys.sort()\r\ngirls.sort()\r\noutput=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(boys[i]-girls[j])<=1:\r\n output+=1\r\n girls[j]=1111\r\n break\r\nprint(output)", "n= int(input())\r\na= list(map(int, input().split()))\r\nm= int(input())\r\nb= list(map(int, input().split()))\r\ncount=0\r\na.sort()\r\nb.sort()\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<=1:\r\n count+=1\r\n b[j]=1000\r\n break\r\nprint(count)", "'''\r\n###### User Profile : Keval_78\r\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\r\nGithub: https://github.com/Keval78\r\nLeetcode: https://leetcode.com/Keval_78/\r\n'''\r\n\r\nimport sys\r\nfrom os import path\r\nfrom math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\nfrom collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef si(): return sys.stdin.readline().strip()\r\ndef ii(): return int(si())\r\ndef mi(ss=\" \"): return map(int, si().split(ss))\r\ndef msi(ss=\" \"): return map(str, si().split(ss))\r\ndef li(ss=\" \"): return list(mi(ss))\r\n\r\n\r\nsys.setrecursionlimit(10 5)\r\nMOD, MOD2, INF = 10 9 + 7, 998244353, float('inf')\r\nMAX = 105+1\r\n\r\nn = ii()\r\nbrr = li()\r\nm = ii()\r\ngrr = li()\r\n\r\nbrr.sort()\r\ngrr.sort()\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if brr[i] == grr[j] or brr[i]+1 == grr[j] or brr[i]-1 == grr[j]:\r\n cnt += 1\r\n grr[j] = -2\r\n break\r\nprint(cnt)\r\n\r\n# pairs = [[0 for i in range(m+1)] for j in range(n+1)]\r\n# for i in range(n):\r\n# for j in range(m):\r\n# pairs[i+1][j+1] = pairs[i][j]\r\n# if abs(brr[i]-grr[j]) <= 1:\r\n# pairs[i+1][j+1] += 1\r\n# pairs[i+1][j+1] = max(pairs[i+1][j+1], pairs[i][j+1], pairs[i+1][j])\r\n# print(pairs[n][m])\r\n", "n, boys = int(input()), list(map(int, input().split()))\nm, girls = int(input()), list(map(int, input().split()))\n\nboys.sort(), girls.sort()\nup, down, ans = 0, 0, 0\n\nwhile up < n and down < m:\n if abs(boys[up] - girls[down]) <= 1:\n ans += 1\n up += 1\n down += 1\n continue\n if boys[up] > girls[down]: down += 1\n else: up += 1\n\nprint(ans)\n \t \t \t \t \t\t\t\t\t\t\t \t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nj = 0\r\ni = 0\r\nans = 0\r\nwhile i < n and j < m:\r\n diff = a[i] - b[j]\r\n if -1 <= diff <= 1:\r\n ans += 1\r\n i+=1\r\n j += 1\r\n elif diff < -1:\r\n i +=1\r\n else:\r\n j += 1\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nboys.sort()\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\ngirls.sort()\r\npara = []\r\ns = 0\r\nfor i in range(len(boys)):\r\n for j in range(s,len(girls)):\r\n if abs(boys[i]-girls[j])<=1:\r\n para.append([boys[i],girls[j]])\r\n s = j+1\r\n break\r\nprint(len(para))", "_ = input()\nbs = [int(c) for c in input().strip().split()]\n_ = input()\ngs = [int(c) for c in input().strip().split()]\n\nbs.sort()\ngs.sort()\n\nbi = len(bs)-1\ngi = len(gs)-1\n\nc = 0\nwhile(bi>=0 and gi>=0):\n # print('*')\n # print(bs[bi], gs[gi])\n # print(c)\n if abs(bs[bi] - gs[gi]) <=1:\n c +=1\n bi -= 1\n gi -= 1\n elif bs[bi] > gs[gi]: \n bi -= 1\n else:\n gi -= 1\nprint(c)\n \t \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\n\r\ni, j, count = 0, 0, 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif b[j] - a[i] > 1: \r\n i += 1\r\n else:\r\n j += 1\r\nprint(count)", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nn1 = int(input())\r\nsp1 = list(map(int, input().split()))\r\nans = 0\r\nfor i in sorted(sp):\r\n for j in sorted(sp1):\r\n if abs(i - j) <= 1:\r\n ans += 1\r\n sp1.remove(j)\r\n break\r\nprint(ans)", "I=lambda:sorted(map(int,input().split()))\nn=I()[0]\na=I()\nm=I()[0]\nb=I()\ni,j,k=0,0,0\nwhile i<n and j<m:\n\tif abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\n\telif a[i]<b[j]:i+=1\n\telse:j+=1\nprint(k)\n\t \t \t \t\t\t\t\t\t\t\t \t \t\t \t \t", "n = int(input())\r\nb = sorted(map(int,input().split()))\r\nm = int(input())\r\ng = sorted(map(int,input().split()))\r\n\r\ntable = [\r\n\t[0]200\r\n]\r\n\r\npair = 0\r\nfor i in range(len(b)):\r\n\tfor j in range(len(g)):\r\n\t\t# print(b[i],g[j],abs(b[i]-g[j]) == 1)\r\n\t\tif(0 <= abs(b[i]-g[j]) <= 1 ):\r\n\t\t\tb[i] = -10000\r\n\t\t\tg[j] = -10000\r\n\t\t\tpair+=1\r\n\t\t\tbreak\r\n\t\telif b[i]-g[j] < -1:\r\n\t\t\tbreak\r\n\r\nprint(pair)", "import sys\ndef insertion_sort(arr):\n for i in range(1, len(arr)):\n key = arr[i]\n j = i - 1\n while j >= 0 and arr[j] > key:\n arr[j + 1] = arr[j]\n j -= 1\n arr[j + 1] = key\n return arr\n \ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n b = list(map(int, sys.stdin.readline().split()))\n insertion_sort(a)\n insertion_sort(b)\n pairs = 0\n for i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) < 2:\n b[j] = 6000000\n pairs += 1\n break\n print(pairs)\nmain()\n \t\t \t \t\t\t\t\t \t \t\t\t\t\t \t", "\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\ninf = 102\r\nn = II()\r\nboys = SLMII()\r\nm = II()\r\ngirls = SLMII()\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if -1 <= boys[i] - girls[j] <= 1:\r\n ans += 1\r\n girls[j] = inf\r\n break\r\n \r\nprint(ans)\r\n \r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\ncnt = 0\r\ni = 0\r\nj = 0\r\nf_1 = True\r\nf_2 = True\r\ngo = True\r\nwhile go:\r\n if abs(a[i] - b[j]) <= 1:\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n if i == n:\r\n f_1 = False\r\n i -= 1\r\n if j == m:\r\n f_2 = False\r\n j -= 1\r\n else:\r\n if a[i] <= b[j] and f_1:\r\n i += 1\r\n if i == n:\r\n f_1 = False\r\n i -= 1\r\n elif a[i] > b[j] and f_2:\r\n j += 1\r\n if j == m:\r\n f_2 = False\r\n j -= 1\r\n if f_1 == False or f_2 == False:\r\n go = False \r\nprint(cnt)", "b = int(input())\r\nboys = list(map(int, input().split()))\r\ng = int(input())\r\ngirls = list(map(int, input().split()))\r\nboys.sort()\r\ngirls.sort()\r\nans = 0\r\nfor i in boys:\r\n for x in girls:\r\n if abs(i-x) <= 1:\r\n girls.remove(x)\r\n ans += 1\r\n break\r\n\r\nprint(ans)", "from functools import lru_cache\r\n\r\ndef main(): \r\n n = input() \r\n a = list(map(int, input().split()))\r\n m = input()\r\n b = list(map(int, input().split()))\r\n\r\n a.sort()\r\n b.sort()\r\n \r\n @lru_cache(None)\r\n def dfs(i, j): \r\n if i == len(a) or j == len(b): \r\n return 0\r\n\r\n if abs(a[i] - b[j]) <= 1:\r\n return 1 + dfs(i + 1, j + 1)\r\n \r\n return max(dfs(i + 1, j), dfs(i, j + 1))\r\n \r\n print(dfs(0, 0))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nb=list(map(int,input().split()))\r\nm=int(input())\r\ng=list(map(int,input().split()))\r\nc=0\r\nb.sort()\r\ng.sort()\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif g[j]!=-1 and abs(b[i]-g[j])<=1:\r\n\t\t\tg[j]=-1\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\nprint(c)", "n = eval(input())\r\ns = input()\r\nb = list(map(int, s.split()))\r\nm = eval(input())\r\ns = input()\r\ng = list(map(int, s.split()))\r\n\r\nb.sort()\r\ng.sort()\r\n\r\ncount = 0\r\ni, j = 0, 0\r\n\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(count)\r\n", "# your code goes here\r\n# your code goes here\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nb=int(input())\r\nm=list(map(int,input().split()))\r\nl.sort()\r\nm.sort()\r\ni=a-1\r\nj=b-1\r\nc=0\r\nwhile(i>-1 and j>-1):\r\n if(abs(l[i]-m[j])<=1):\r\n c=c+1 \r\n i=i-1\r\n j=j-1 \r\n elif(l[i]>m[j]):\r\n i=i-1 \r\n else:\r\n j=j-1 \r\nprint(c)\r\n", "n, a = int(input()), sorted(map(int, input().split()))\r\nm, b = int(input()), sorted(map(int, input().split()))\r\n\r\npairs = i = j = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) < 2:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n a = [int(x) for x in input().split()]\n m = int(input())\n b = [int(x) for x in input().split()]\n a.sort()\n b.sort()\n pairs = 0\n i = j = 0\n while i < n and j < m:\n if abs(a[i] - b[j]) < 2:\n pairs += 1\n i += 1\n j += 1\n elif a[i] < b[j]:\n i += 1\n else:\n j += 1\n print(pairs)\n\n\nif __name__ == \"__main__\":\n main()\n", "import sys\n\n\ndef input_lines():\n\treturn list(map(str.strip, sys.stdin.readlines()))\n\ndef line_to_int_arr(line):\n\treturn list(map(int, line.split(\" \")))\n\ndef print_arr(arr):\n\tfor el in arr:\n\t\tprint(el, end= ' ')\n\tprint()\n\t\nlines = input_lines()\nn = int(lines[0])\narr1 = sorted(line_to_int_arr(lines[1]))\nm = int(lines[2])\narr2 = sorted(line_to_int_arr(lines[3]))\n\nfirst_head = 0\nsecond_head = 0\npairs_cnt = 0\n\nwhile first_head < n and second_head < m:\n if abs(arr1[first_head] - arr2[second_head]) <= 1:\n pairs_cnt += 1\n first_head += 1\n second_head += 1\n elif arr1[first_head] > arr2[second_head]:\n second_head += 1\n else:\n first_head += 1\n\nprint(pairs_cnt)\n \t\t \t\t \t\t \t \t \t \t\t \t", "n = int(input())\r\nskils_n = list(map(int, input().split()))\r\nm = int(input())\r\nskils_m = list(map(int, input().split()))\r\ni = j = p = 0\r\nfor i in sorted(skils_n):\r\n for j in sorted(skils_m):\r\n if j - i == -1 or j - i == 0 or j - i == 1:\r\n skils_m.remove(j)\r\n skils_n.remove(i)\r\n p += 1\r\n break\r\nprint(p)", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\n#from math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\nn=ii()\r\nb=sorted(li())\r\nm=ii()\r\ng=sorted(li())\r\nres=0\r\nwhile b and g:\r\n if abs(b[-1]-g[-1])<=1:\r\n res+=1\r\n b.pop()\r\n g.pop()\r\n elif b[-1]>g[-1]:\r\n b.pop()\r\n else:\r\n g.pop()\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nm1=min(n,m)\r\nc=0\r\ni=0\r\nj=0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<=1:\r\n c+=1\r\n i+=1\r\n j+=1\r\n else:\r\n if a[i]>b[j]:\r\n j+=1\r\n else:\r\n i+=1\r\nprint(c)", "def solve(l1, l2):\r\n pairs=0\r\n for i in range(len(l1)):\r\n if l1[i]-1 in l2:\r\n l2[l2.index(l1[i]-1)]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n elif l1[i] in l2:\r\n l2[l2.index(l1[i])]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n elif l1[i]+1 in l2:\r\n l2[l2.index(l1[i]+1)]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n return pairs\r\n\r\nb=int(input())\r\nbskill=sorted(list(map(int, input().split())))\r\ng=int(input())\r\ngskill=sorted(list(map(int, input().split())))\r\nif b<g:\r\n print(solve(bskill, gskill))\r\nelse:\r\n print(solve(gskill, bskill))\r\n", "def main():\r\n num_boys = int(input())\r\n boys_skill = list(map(int, input().split()))\r\n \r\n num_girls = int(input())\r\n girls_skill = list(map(int, input().split()))\r\n \r\n boys_skill.sort()\r\n girls_skill.sort()\r\n \r\n boys_ptr = 0\r\n girls_ptr = 0\r\n num_pairs = 0\r\n \r\n while boys_ptr < num_boys and girls_ptr < num_girls:\r\n cur_boy_skill = boys_skill[boys_ptr]\r\n cur_girl_skill = girls_skill[girls_ptr]\r\n \r\n if abs(cur_boy_skill - cur_girl_skill) <= 1:\r\n num_pairs += 1\r\n boys_ptr += 1\r\n girls_ptr += 1\r\n \r\n elif cur_boy_skill < cur_girl_skill:\r\n boys_ptr += 1\r\n \r\n else:\r\n girls_ptr += 1\r\n \r\n print(num_pairs)\r\n\r\nmain()", "from sys import stdin\ndef main():\n n=int(input())\n baile_n=[int(x) for x in stdin.readline().split()]\n m=int(input())\n baile_m=[int(x) for x in stdin.readline().split()]\n p=0\n baile_n=sorted(baile_n)\n baile_m=sorted(baile_m)\n for i in baile_n:\n for j in range (len(baile_m)):\n if abs(i-baile_m[j])<2:\n p+=1\n baile_m.pop(j)\n break\n print(p)\nmain()\n \t\t\t\t\t \t\t \t\t\t \t \t \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nl = r = 0\r\na.sort()\r\nb.sort()\r\ncount = 0\r\nwhile l<n and r<m:\r\n if abs(a[l] - b[r]) <2:\r\n count+=1\r\n l+=1\r\n r+=1\r\n elif a[l] > b[r]:\r\n r+=1\r\n else:\r\n l+=1\r\nprint(count)\r\n\r\n", "n=int(input())\r\nboys=list(map(int,input().split()))\r\nm=int(input())\r\ngirls=list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\ni = 0\r\nj = 0\r\ncount=0\r\nwhile i<n and j<m:\r\n if abs(boys[i]-girls[j])<=1:\r\n count+=1\r\n i+=1\r\n j+=1\r\n elif boys[i]<girls[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(count)\r\n", "#Primero tuve en cuenta el ordenamiento de ambos arreglos para ir comparando elemento de uno con elemento del otro arreglo.\n#Este problema lo solucioné creando un ciclo donde las condiciones se establecen en base al tamaño de las dos listas que ingresan\n#Si la diferencia es cero o uno, entonces esto implicaria contar un paraja y sumar uno a las dos variables que identifican el indice \n#e la lista de chicos y chicas para poder continuar con las siguientes posibles parejas.\n#Lo importante aquí es saber que al ser el valor en la lista de habilidades de chicos menor a la de habilidades de las chicas se debe solamente \n#sumar el contador para chicos porque ya se sabe que para lista masculina este personaje no va poder formar pareja con alguna chica, lo mismo pasa en el caso de que las habilidades de alguna chica sea menor a la del chico, se suma 1 al que lleva el indice sobre la lista de chicas.\ndef main():\n n = int(input())\n chicos = list(map(int, input().split()))\n m = int(input())\n chicas = list(map(int, input().split()))\n\n chicos.sort()\n chicas.sort()\n\n parejas = 0\n indice_chico = 0\n indice_chica = 0\n\n while indice_chico < n and indice_chica < m:\n if abs(chicos[indice_chico] - chicas[indice_chica]) <= 1:\n parejas += 1\n indice_chico += 1\n indice_chica += 1\n elif chicos[indice_chico] < chicas[indice_chica]:\n indice_chico += 1\n else:\n indice_chica += 1\n\n print(parejas)\n\nmain()\n\n#El tiempo de ejecucion es de O(m+n).\n\t\t\t\t\t \t\t \t\t \t \t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nans=0\r\nfor i in a:\r\n for j in b:\r\n if -1<=i-j<=1:\r\n ans+=1\r\n b.remove(j)\r\n break\r\nprint(ans) ", "n = int(input())\r\nboys = list(map(int,input().split(' ')))\r\nm = int(input())\r\ngirls = list(map(int,input().split(' ')))\r\n\r\nsorted_boys = sorted(boys)\r\nsorted_girls = sorted(girls)\r\n\r\npairs = 0\r\nfor b in sorted_boys:\r\n for i in range(len(sorted_girls)):\r\n if abs(b - sorted_girls[i]) <= 1:\r\n pairs += 1\r\n sorted_girls.pop(i)\r\n break\r\nprint(pairs)", "n = int(input())\na = sorted(list(map(int, input().split())))\n\nm = int(input())\nb = sorted(list(map(int, input().split())))\n\nlast_j = 0\nres = 0\n\nfor i in range(n):\n for j in range(last_j, m):\n if abs(a[i] - b[j]) <= 1:\n res += 1\n last_j = j + 1\n break\n\nprint(res)\n\n\n\t\t \t \t\t\t\t\t \t \t \t\t\t \t\t \t", "import sys\r\n\r\nt = 1; #t = int(input())\r\n\r\ndef solve() -> None:\r\n #w=list(map(int,sys.stdin.readline().split()))\r\n n=int(input())\r\n man=sorted(list(map(int,input().split())))\r\n m=int(input())\r\n woman=sorted(list(map(int,input().split())))\r\n ans=0\r\n if n<m:\r\n man,woman=woman,man\r\n n,m=m,n\r\n for i in range(m):\r\n if woman[i]-1 in man:\r\n ans += 1\r\n man.remove(woman[i]-1)\r\n elif woman[i] in man:\r\n ans += 1\r\n man.remove(woman[i])\r\n elif woman[i]+1 in man:\r\n ans += 1\r\n man.remove(woman[i]+1)\r\n print(ans)\r\n\r\nfor _ in [0] * t: solve()", "n = int(input(\"\"))\r\na = list(map(int, input(\"\").split()))\r\na.sort()\r\na.reverse()\r\nm = int(input(\"\"))\r\nb = list(map(int, input(\"\").split()))\r\nb.sort()\r\nb.reverse()\r\ncount = 0\r\n\r\nfor i in range(n+m):\r\n if len(a) == 0 or len(b) == 0:\r\n break\r\n if a[-1] < b[-1]:\r\n if a[-1] == b[-1]-1:\r\n count += 1\r\n a.pop()\r\n b.pop()\r\n else:\r\n a.pop()\r\n else:\r\n if a[-1] == b[-1] or a[-1] == b[-1]+1:\r\n count += 1\r\n a.pop()\r\n b.pop()\r\n else:\r\n b.pop()\r\n\r\n\r\nprint(count)", "# for _ in range(int(input())):\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nl2.sort()\r\nans=0\r\n# ans=min(m,n)\r\ni=0\r\nwhile i<(len(l1)):\r\n j=0\r\n while j<(len(l2)):\r\n if (abs(l1[i]-l2[j])<=1):\r\n ans+=1\r\n l2.pop(j)\r\n break\r\n j+=1\r\n i+=1\r\nprint(ans)\r\n \r\n", "n=int(input())\r\nniños=sorted(map(int,input().split()))\r\nm=int(input())\r\nniñas=sorted(map(int,input().split()))\r\n\r\ni,j,par=0,0,0\r\nwhile i<n and j<m:\r\n if abs(niños[i]-niñas[j])<=1:\r\n par+=1\r\n i+=1\r\n j+=1\r\n elif niños[i]<niñas[j]:\r\n i+=1\r\n else:\r\n j+=1\r\n \r\nprint(par)", "n = int(input())\r\nman = [int(i) for i in input().split()]\r\n\r\nm = int(input())\r\nwomen = [int(i) for i in input().split()]\r\nf_svobodna = [1] * (m)\r\n\r\nman.sort()\r\nwomen.sort()\r\n\r\ncnt = 0\r\nfor i in man:\r\n for j in range(m):\r\n if f_svobodna[j] and ((abs(i - women[j]) <= 1)):\r\n cnt += 1\r\n f_svobodna[j] = 0\r\n break\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\nboys = list(map(int,input().split(\" \")))\r\nboys = sorted(boys)\r\nm = int(input())\r\ngirls = list(map(int,input().split(\" \")))\r\ngirls = sorted(girls)\r\ncnt = 0\r\nfor boy in boys:\r\n\tfor i in range(m):\r\n\t\tif abs(boy-girls[i])<=1:\r\n\t\t\tcnt += 1\r\n\t\t\tgirls[i] = 102\r\n\t\t\tbreak\r\nprint(cnt)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nboys = sorted(map(int, input().split()))\r\nm = int(input())\r\ngirls = sorted(map(int, input().split()))\r\n\r\ni, j, pairs = 0, 0, 0\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys[i] < girls[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nsys.stdout.write(str(pairs) + \"\\n\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\n\r\nm = int(input())\r\nb = sorted(map(int, input().split()))\r\n\r\nres = i = j = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) < 2:\r\n res += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(res)", "a=int(input())\r\nX=input().split()\r\nA=[]\r\nfor x in X:\r\n A.append(int(x))\r\nb=int(input())\r\nX=input().split()\r\nB=[]\r\nfor x in X:\r\n B.append(int(x))\r\nA.sort()\r\nB.sort()\r\nif a<=b:\r\n for x in A:\r\n if x-1 in B:\r\n B.remove(x-1)\r\n continue\r\n if x in B:\r\n B.remove(x)\r\n continue\r\n if x+1 in B:\r\n B.remove(x+1)\r\n print(b-len(B))\r\nelif a>b:\r\n for x in B:\r\n if x-1 in A:\r\n A.remove(x-1)\r\n continue\r\n if x in A:\r\n A.remove(x)\r\n continue\r\n if x+1 in A:\r\n A.remove(x+1)\r\n print(a-len(A))\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\n\r\ncnt = 0\r\nif len(b)>=len(a) : \r\n for i in range(min(n,m)) :\r\n for j in range(max(n,m)) : \r\n\r\n if abs(a[i]-b[j])<=1 :\r\n cnt+=1\r\n a[i] = -1\r\n b[j] = -1\r\nelse :\r\n for j in range(min(n,m)) :\r\n for i in range(max(n,m)) : \r\n\r\n if abs(a[i]-b[j])<=1 :\r\n cnt+=1\r\n a[i] = -1\r\n b[j] = -1\r\n \r\n \r\n\r\n\r\nprint(cnt)\r\n ", "n = int(input())\r\na = sorted(map(int,input().split()))\r\nm = int(input())\r\nb = sorted(map(int,input().split()))\r\n\r\nc = 0\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<2:\r\n b[j]=999\r\n c += 1\r\n break\r\nprint(c)", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nboys = sorted(boys)\r\ngirls = sorted(girls)\r\nc = 0\r\ni = 0\r\nj = 0\r\nwhile i <n and j<m:\r\n if abs(boys[i]-girls[j])<2:\r\n c += 1\r\n i += 1\r\n j += 1\r\n elif boys[i]>girls[j]:\r\n j += 1\r\n elif boys[i]<girls[j]:\r\n i += 1\r\nprint(c)\r\n", "\"\"\"\r\n4\r\n1 4 6 2\r\n5\r\n5 1 5 7 9\r\n\r\n1 2 4 6\r\n1 5 5 7 9\r\n\r\n4\r\n1 2 3 4\r\n4\r\n10 11 12 13\r\n\r\n5\r\n1 1 1 1 1\r\n3\r\n1 2 3\r\n\r\n\r\n1 2 3 4 6 9\r\n5 7 8 9\r\n\r\n\r\n\r\n\"\"\"\r\ndef bersu_ball(n, boys, m, girls):\r\n boys.sort()\r\n girls.sort()\r\n indx = set()\r\n count = 0\r\n for i in range(n):\r\n for j in range( m):\r\n if j not in indx and ( boys[i] - girls[j] == 0 or abs( boys[i] - girls[j]) == 1 ):\r\n indx.add(j)\r\n count += 1\r\n break\r\n return count\r\n\r\n# print(bersu_ball(6, 4, [1, 2, 3, 4, 6, 9], [5, 7, 8, 9]))\r\nn = input('')\r\nboys = [ int(i) for i in input('').split(' ')]\r\nm = input('')\r\ngirls = [int(i) for i in input('').split(' ')]\r\n# print(girls, boys, n, m)\r\nprint(bersu_ball(int(n), boys, int(m), girls))\r\n \r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\ni = 0\r\nj = 0\r\npairs = 0\r\n\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys[i] < girls[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs)\r\n", "n = int(input())\r\nb = sorted([int(el) for el in input().split()])\r\nm = int(input())\r\ng = sorted([int(el) for el in input().split()])\r\n\r\ni = 0\r\nj = 0\r\n\r\nans = 0\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) < 2:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n continue\r\n if b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\nprint(ans)", "input()\r\nsigmas = sorted(map(int, input().split()))\r\ninput()\r\nwoman = sorted(map(int, input().split()))\r\ni = 0\r\nn = 0\r\nwhile i < len(sigmas):\r\n j = 0\r\n while j < len(woman):\r\n if abs(sigmas[i]-woman[j]) < 2:\r\n woman[j] = -1\r\n n+=1\r\n break\r\n j+=1\r\n i += 1\r\nprint(n)", "# https://codeforces.com/contest/489/problem/B\r\n\r\ndef lire_skills():\r\n skills = [0] * 102\r\n for ai in map(int, input().split()):\r\n skills[ai] += 1\r\n return skills\r\n\r\ndef associer(i, j):\r\n global a, b, rep\r\n delta = min(a[i], b[j])\r\n a[i] -= delta\r\n b[j] -= delta\r\n rep += delta\r\n\r\ninput()\r\na = lire_skills()\r\ninput()\r\nb = lire_skills()\r\nrep = 0\r\n\r\nfor i in range(1, 101):\r\n associer(i - 1, i)\r\n associer(i, i)\r\n associer(i + 1, i)\r\n\r\nprint(rep)\r\n", "m=int(input())\r\nmm=list(map(int,input().split()))\r\nmm.sort()\r\nn=int(input())\r\nnn=list(map(int,input().split()))\r\nnn.sort()\r\nre=0\r\ni,j=0,0\r\nwhile i<m and j<n:\r\n if mm[i]==nn[j] or abs(mm[i]-nn[j])==1:\r\n i+=1\r\n j+=1\r\n re+=1\r\n elif mm[i]<nn[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(re)", "def solve(b,g):\r\n\r\n b = sorted(b)\r\n g = sorted(g)\r\n\r\n bx = 0\r\n gx = 0\r\n\r\n cont = 0\r\n\r\n while bx < len(b) and gx < len(g):\r\n\r\n bcand = b[bx]\r\n gcand = g[gx]\r\n\r\n #print(bx, gx)\r\n #print(bcand, gcand)\r\n #print(\"-----------\")\r\n\r\n if abs(bcand-gcand)<=1:\r\n #print(\"IT1\")\r\n \r\n \r\n cont += 1\r\n\r\n bx+=1\r\n gx+=1\r\n\r\n elif bcand > gcand:\r\n #print(\"IT2\")\r\n gx+=1\r\n\r\n else:\r\n #print(\"IT3\")\r\n bx += 1\r\n\r\n\r\n return cont\r\n \r\n# num cases\r\n\r\n_ = input()\r\nb = [int(a) for a in input().split(\" \")]\r\n\r\n_ = input()\r\ng = [int(a) for a in input().split(\" \")]\r\n\r\nprint(solve(b,g))", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nIf tie, it's really bad, better to remove one to take the fall (but which one?)\r\nIf majority, there isn't anything you can do\r\n\r\nok you always are in the majority\r\n'''\r\n\r\ndef solve():\r\n\tx = II()\r\n\tb = LII()\r\n\ty = II()\r\n\tg = LII()\r\n\r\n\tb.sort()\r\n\tg.sort()\r\n\r\n\tans = 0\r\n\twhile b and g:\r\n\t\tif abs(b[-1]-g[-1]) > 1:\r\n\t\t\tif b[-1] > g[-1]:\r\n\t\t\t\tb.pop()\r\n\t\t\telse:\r\n\t\t\t\tg.pop()\r\n\t\telse:\r\n\t\t\tb.pop()\r\n\t\t\tg.pop()\r\n\t\t\tans += 1\r\n\tprint(ans)\r\n\r\nsolve()", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int,input().split())))\r\ni,j,ans = 0,0,0\r\nwhile i < n and j < m:\r\n if a[i] == b[j] or a[i] + 1 == b[j] or a[i] == b[j] + 1:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n elif b[j] < a[i]:\r\n j += 1\r\nprint(ans)\r\n ", "count_boys = int(input())\nboys = sorted(list(map(int, input().split())))\ncount_girls = int(input())\ngirls = sorted(list(map(int, input().split())))\nmin_len_arr = girls[:] if count_girls < count_boys else boys[:]\nmax_len_arr = boys[::-1] if count_girls < count_boys else girls[::-1]\npairs = []\nj = 0\nwhile min_len_arr:\n k = min_len_arr.pop()\n if max_len_arr:\n for i in range(len(max_len_arr)):\n if abs(k - max_len_arr[i]) <= 1:\n pairs.append((k, max_len_arr[i]))\n max_len_arr.remove(max_len_arr[i])\n break\nprint(len(pairs))\n", "b=int(input())\nbl=list(map(int,input().split()))\nbl.sort()\ng=int(input())\ngl=list(map(int,input().split()))\ngl.sort()\nk=0\nwhile len(bl)>0 and len(gl)>0:\n if (bl[0]-gl[0]) in [-1,0,1]:\n k+=1\n bl=bl[1:]\n gl=gl[1:]\n elif bl[0]<=gl[0]:\n bl=bl[1:]\n elif bl[0]>=gl[0]:\n gl=gl[1:]\n\nprint(k)\n", "# n, m = map(int, input().split())\nn = int(input())\nboy = list(map(int, input().split()))\nm = int(input())\ngirl = list(map(int, input().split()))\nboy.sort()\ngirl.sort()\nb = 0\ng = 0\npar = 0\nwhile b < n and g < m:\n if abs(boy[b] - girl[g]) <= 1:\n par += 1\n b += 1\n g += 1\n elif boy[b] < girl[g]:\n b += 1\n else:\n g += 1\nprint(par)\n", "def solve(boy, girl):\r\n\r\n pairs = 0\r\n for b in range(len(boy)):\r\n for g in range(len(girl)):\r\n if abs(boy[b] - girl[g]) <= 1:\r\n girl[g] = float('inf')\r\n pairs += 1\r\n break\r\n\r\n return pairs\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n n = int(input())\r\n boys = sorted(map(int, input().split()))\r\n m = int(input())\r\n girls = sorted(map(int, input().split()))\r\n\r\n print(solve(boys, girls))\r\n", "n = int(input())\r\na = sorted([int(el) for el in input().split()])\r\nm = int(input())\r\nb = sorted([int(el) for el in input().split()])\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) <= 1:\r\n a[i] = 10000\r\n b[j] = 10000\r\n cnt += 1\r\nprint(cnt)", "def compare(bList,gList):\r\n result=0\r\n for i in range(len(bList)):\r\n for j in range(len(gList)):\r\n if abs(bList[i]-gList[j])<=1:\r\n result+=1\r\n gList[j]=1000\r\n break\r\n return result\r\n\r\n\r\nb=int(input())\r\nb_list=list(map(int,input().split()))\r\ng=int(input())\r\ng_list=list(map(int,input().split()))\r\nb_list=sorted(b_list)\r\ng_list=sorted(g_list)\r\nprint(compare(b_list,g_list))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\na.sort()\r\nb.sort()\r\nans = 0\r\nindex = 0\r\ni = 0\r\nwhile index < n and i < m:\r\n if a[index] < b[i] - 1:\r\n index += 1\r\n elif b[i] - 1 <= a[index] <= b[i] + 1:\r\n ans += 1\r\n index += 1\r\n i += 1\r\n else:\r\n i += 1\r\nprint(ans)", "count_boys = int(input())\r\nboys_list = list(map(int, input().split()))\r\ncount_girls = int(input())\r\ngirls_list = list(map(int, input().split()))\r\nboys_list.sort()\r\ngirls_list.sort()\r\nboy = 0\r\ngirl = 0\r\ncount = 0\r\nwhile boy < count_boys and girl < count_girls:\r\n if abs(boys_list[boy] - girls_list[girl]) <= 1:\r\n count +=1\r\n boy += 1\r\n girl += 1\r\n elif boys_list[boy] < girls_list[girl]:\r\n boy += 1\r\n else:\r\n girl += 1\r\nprint(count)", "n = int(input())\nmen_skills = list(map(int, input().split()))\nm = int(input())\nwomen_skills = list(map(int, input().split()))\n\npairs=0\nmen_skills.sort()\nwomen_skills.sort()\n\nif len(women_skills)>=len(men_skills) : \n for i in range(min(n,m)) :\n for j in range(max(n,m)) : \n if abs(men_skills[i]-women_skills[j])<=1 :\n pairs+=1\n men_skills[i] = -1\n women_skills[j] = -1\nelse :\n for j in range(min(n,m)) :\n for i in range(max(n,m)) : \n if abs(men_skills[i]-women_skills[j])<=1 :\n pairs+=1\n men_skills[i] = -1\n women_skills[j] = -1\n\n\nprint(pairs)\n\t\t\t\t\t\t \t \t \t \t \t \t \t \t\t\t\t \t", "n = int(input())\r\nboys = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ngirls = sorted(list(map(int, input().split())))\r\nanswer = 0\r\np1 = p2 = 0\r\n\r\nwhile p1 < n and p2 < m:\r\n if abs(boys[p1] - girls[p2]) <= 1:\r\n answer += 1\r\n p1 += 1\r\n p2 += 1\r\n else:\r\n if boys[p1] < girls[p2]:\r\n p1 += 1\r\n else:\r\n p2 += 1\r\n\r\nprint(answer)\r\n\r\n", "n=int(input())\r\nboys=list(map(int,input().split()))\r\nm=int(input())\r\ngirls=list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\na=0\r\nb=0\r\ncount=0\r\nwhile a<n and b<m:\r\n if abs(boys[a]-girls[b])<=1:\r\n count+=1\r\n a+=1\r\n b+=1\r\n elif boys[a]<girls[b]:\r\n a+=1\r\n else:\r\n b+=1\r\nprint(count)\r\n\r\n", "import sys\r\nnumBoys = int(sys.stdin.readline())\r\nboys = sorted([int(x) for x in sys.stdin.readline().split()])\r\nnumGirls = int(sys.stdin.readline())\r\ngirls = sorted([int(x) for x in sys.stdin.readline().split()])\r\n\r\nx = 0\r\ny = 0\r\nsol = 0\r\nwhile x < len(boys) and y < len(girls):\r\n b = boys[x]\r\n g = girls[y]\r\n match = (b==g or b-1==g or b+1==g)\r\n if match:\r\n x+=1\r\n y+=1\r\n sol+=1\r\n else:\r\n if b==min(b,g):\r\n x+=1\r\n else:\r\n y+=1\r\nprint(sol)\r\n", "n = int(input())\r\nl1 = list(sorted(map(int,input().split())))\r\nm = int(input())\r\nl2 = list(sorted(map(int,input().split())))\r\ncount = 0\r\nindex = 0\r\nflog = True\r\nfor i in range(n) :\r\n key = l1[i]\r\n for j in range(index , m) :\r\n if (l2[j] - key) > 1 :\r\n break\r\n if abs(key - l2[j]) <= 1 :\r\n count += 1\r\n index = j + 1\r\n break\r\nprint(count)" ]	{"inputs": ["4\n1 4 6 2\n5\n5 1 5 7 9", "4\n1 2 3 4\n4\n10 11 12 13", "5\n1 1 1 1 1\n3\n1 2 3", "1\n1\n1\n1", "2\n1 10\n1\n9", "4\n4 5 4 4\n5\n5 3 4 2 4", "1\n2\n1\n1", "1\n3\n2\n3 2", "1\n4\n3\n4 4 4", "1\n2\n4\n3 1 4 2", "1\n4\n5\n2 5 5 3 1", "2\n2 2\n1\n2", "2\n4 2\n2\n4 4", "2\n4 1\n3\n2 3 2", "2\n4 3\n4\n5 5 5 6", "2\n5 7\n5\n4 6 7 2 5", "3\n1 2 3\n1\n1", "3\n5 4 5\n2\n2 1", "3\n6 3 4\n3\n4 5 2", "3\n7 7 7\n4\n2 7 2 4", "3\n1 3 3\n5\n1 3 4 1 2", "4\n1 2 1 3\n1\n4", "4\n4 4 6 6\n2\n2 1", "4\n3 1 1 1\n3\n1 6 7", "4\n2 5 1 2\n4\n2 3 3 1", "4\n9 1 7 1\n5\n9 9 9 8 4", "5\n1 6 5 5 6\n1\n2", "5\n5 2 4 5 6\n2\n7 4", "5\n4 1 3 1 4\n3\n6 3 6", "5\n5 2 3 1 4\n4\n1 3 1 7", "5\n9 8 10 9 10\n5\n2 1 5 4 6", "1\n48\n100\n76 90 78 44 29 30 35 85 98 38 27 71 51 100 15 98 78 45 85 26 48 66 98 71 45 85 83 77 92 17 23 95 98 43 11 15 39 53 71 25 74 53 77 41 39 35 66 4 92 44 44 55 35 87 91 6 44 46 57 24 46 82 15 44 81 40 65 17 64 24 42 52 13 12 64 82 26 7 66 85 93 89 58 92 92 77 37 91 47 73 35 69 31 22 60 60 97 21 52 6", "100\n9 90 66 62 60 9 10 97 47 73 26 81 97 60 80 84 19 4 25 77 19 17 91 12 1 27 15 54 18 45 71 79 96 90 51 62 9 13 92 34 7 52 55 8 16 61 96 12 52 38 50 9 60 3 30 3 48 46 77 64 90 35 16 16 21 42 67 70 23 19 90 14 50 96 98 92 82 62 7 51 93 38 84 82 37 78 99 3 20 69 44 96 94 71 3 55 27 86 92 82\n1\n58", "10\n20 87 3 39 20 20 8 40 70 51\n100\n69 84 81 84 35 97 69 68 63 97 85 80 95 58 70 91 100 65 72 80 41 87 87 87 22 49 96 96 78 96 97 56 90 31 62 98 89 74 100 86 95 88 66 54 93 62 41 60 95 79 29 69 63 70 52 63 87 58 54 52 48 57 26 75 39 61 98 78 52 73 99 49 74 50 59 90 31 97 16 85 63 72 81 68 75 59 70 67 73 92 10 88 57 95 3 71 80 95 84 96", "100\n10 10 9 18 56 64 92 66 54 42 66 65 58 5 74 68 80 57 58 30 58 69 70 13 38 19 34 63 38 17 26 24 66 83 48 77 44 37 78 97 13 90 51 56 60 23 49 32 14 86 90 100 13 14 52 69 85 95 81 53 5 3 91 66 2 64 45 59 7 30 80 42 61 82 70 10 62 82 5 34 50 28 24 47 85 68 27 50 24 61 76 17 63 24 3 67 83 76 42 60\n10\n66 74 40 67 28 82 99 57 93 64", "100\n4 1 1 1 3 3 2 5 1 2 1 2 1 1 1 6 1 3 1 1 1 1 2 4 1 1 4 2 2 8 2 2 1 8 2 4 3 3 8 1 3 2 3 2 1 3 8 2 2 3 1 1 2 2 5 1 4 3 1 1 3 1 3 1 7 1 1 1 3 2 1 2 2 3 7 2 1 4 3 2 1 1 3 4 1 1 3 5 1 8 4 1 1 1 3 10 2 2 1 2\n100\n1 1 5 2 13 2 2 3 6 12 1 13 8 1 1 16 1 1 5 6 2 4 6 4 2 7 4 1 7 3 3 9 5 3 1 7 4 1 6 6 8 2 2 5 2 3 16 3 6 3 8 6 1 8 1 2 6 5 3 4 11 3 4 8 2 13 2 5 2 7 3 3 1 8 1 4 4 2 4 7 7 1 5 7 6 3 6 9 1 1 1 3 1 11 5 2 5 11 13 1", "4\n1 6 9 15\n2\n5 8", "2\n2 4\n2\n3 1", "3\n2 3 5\n3\n3 4 6", "3\n1 3 4\n3\n2 1 5", "2\n5 5\n4\n1 1 1 5", "2\n3 2\n2\n3 4", "2\n3 1\n2\n2 4", "2\n2 3\n2\n2 1", "2\n10 12\n2\n11 9", "3\n1 2 3\n3\n3 2 1", "2\n1 3\n2\n2 1", "2\n4 5\n2\n5 3", "2\n7 5\n2\n6 8", "4\n4 3 2 1\n4\n1 2 3 4", "2\n2 3\n2\n3 1", "2\n2 4\n3\n3 1 8", "3\n3 1 1\n3\n2 4 4", "2\n5 3\n2\n4 6", "4\n1 1 3 3\n4\n2 2 1 1", "3\n3 2 1\n3\n2 4 3", "5\n1 2 3 4 5\n5\n2 3 4 5 1", "3\n3 2 1\n3\n1 2 3", "2\n5 4\n2\n4 6", "4\n3 3 5 5\n4\n4 4 2 2", "3\n2 7 5\n3\n2 4 8", "100\n2 3 3 4 2 1 4 4 5 5 2 1 5 2 3 3 5 4 3 2 4 2 3 3 2 2 3 4 2 2 2 3 1 2 3 2 2 3 5 3 3 3 3 4 5 2 2 1 1 1 3 1 2 2 3 5 5 2 5 1 3 4 5 3 5 4 1 1 2 3 4 4 5 3 2 4 5 5 5 2 1 4 2 4 5 4 4 5 5 3 2 5 1 4 4 2 2 2 5 3\n100\n4 5 3 3 2 2 4 3 1 5 4 3 3 2 2 4 5 2 5 2 1 4 3 4 2 3 5 3 4 4 1 2 3 5 2 2 1 5 4 2 4 3 4 3 4 2 3 1 3 3 4 1 1 1 4 4 5 3 1 4 2 3 2 1 3 3 2 3 2 1 1 2 3 2 1 3 3 4 3 3 1 1 3 3 3 1 1 3 5 3 3 3 3 4 4 5 2 5 4 5", "1\n3\n2\n2 3", "2\n5 6\n3\n1 5 100", "2\n2 7\n2\n6 8", "4\n4 10 15 17\n4\n3 12 16 16", "2\n2 3\n2\n1 2"], "outputs": ["3", "0", "2", "1", "1", "4", "1", "1", "1", "1", "1", "1", "1", "2", "1", "2", "1", "0", "3", "1", "3", "1", "0", "1", "3", "2", "1", "2", "1", "3", "0", "1", "0", "6", "9", "76", "2", "2", "3", "3", "1", "2", "2", "2", "2", "3", "2", "2", "2", "4", "2", "2", "2", "2", "4", "3", "5", "3", "2", "4", "3", "100", "1", "1", "1", "3", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	173
d14d76ed6f3fbd0cf793d69b8bbffa64	Growing Mushrooms	Each year in the castle of Dwarven King there is a competition in growing mushrooms among the dwarves. The competition is one of the most prestigious ones, and the winner gets a wooden salad bowl. This year's event brought together the best mushroom growers from around the world, so we had to slightly change the rules so that the event gets more interesting to watch. Each mushroom grower has a mushroom that he will grow on the competition. Under the new rules, the competition consists of two parts. The first part lasts t1 seconds and the second part lasts t2 seconds. The first and the second part are separated by a little break. After the starting whistle the first part of the contest starts, and all mushroom growers start growing mushrooms at once, each at his individual speed of vi meters per second. After t1 seconds, the mushroom growers stop growing mushrooms and go to have a break. During the break, for unexplained reasons, the growth of all mushrooms is reduced by k percent. After the break the second part of the contest starts and all mushrooms growers at the same time continue to grow mushrooms, each at his individual speed of ui meters per second. After a t2 seconds after the end of the break, the competition ends. Note that the speeds before and after the break may vary. Before the match dwarf Pasha learned from all participants, what two speeds they have chosen. However, the participants did not want to disclose to him all their strategy and therefore, did not say in what order they will be using these speeds. That is, if a participant chose speeds ai and bi, then there are two strategies: he either uses speed ai before the break and speed bi after it, or vice versa. Dwarf Pasha really wants to win the totalizer. He knows that each participant chooses the strategy that maximizes the height of the mushroom. Help Dwarf Pasha make the final table of competition results. The participants are sorted in the result table by the mushroom height (the participants with higher mushrooms follow earlier in the table). In case of equal mushroom heights, the participants are sorted by their numbers (the participants with a smaller number follow earlier). The first input line contains four integer numbers n, t1, t2, k (1<=≤<=n,<=t1,<=t2<=≤<=1000; 1<=≤<=k<=≤<=100) — the number of participants, the time before the break, the time after the break and the percentage, by which the mushroom growth drops during the break, correspondingly. Each of the following n lines contains two integers. The i-th (1<=≤<=i<=≤<=n) line contains space-separated integers ai, bi (1<=≤<=ai,<=bi<=≤<=1000) — the speeds which the participant number i chose. Print the final results' table: n lines, each line should contain the number of the corresponding dwarf and the final maximum height of his mushroom with exactly two digits after the decimal point. The answer will be considered correct if it is absolutely accurate. Sample Input 2 3 3 50 2 4 4 2 4 1 1 1 544 397 280 101 280 101 693 970 Sample Output 1 15.00 2 15.00 4 1656.07 1 937.03 2 379.99 3 379.99	[ "def main():\r\n\r\n n, t1, t2, k = [int(i) for i in input().split()]\r\n\r\n v = []\r\n for i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n v.append([a, b])\r\n\r\n res = []\r\n for i in range(n):\r\n a, b = v[i]\r\n\r\n h1 = a * t1 * (1 - k / 100) + b * t2\r\n h2 = b * t1 * (1 - k / 100) + a * t2\r\n\r\n h = max(h1, h2)\r\n\r\n res.append([i + 1, h])\r\n\r\n\r\n for i, rec in sorted(res, key=lambda x: x[1], reverse=True):\r\n print(f'{i} {rec:.2f}')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,t1,t2,k=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n lst.append((-max((at1((100-k)/100)+bt2),(bt1((100-k)/100)+at2)),i+1))\r\nlst.sort()\r\nfor i in range(n):\r\n print('%d %.2f'%(lst[i][1],-lst[i][0]))", "def cf_186_B(a, b, k, p):\r\n ans = []\r\n for i, v in enumerate(p):\r\n mmm = [(av[0] - av[0]k/100)+bv[1], (av[1] - av[1]k/100)+bv[0]]\r\n ans.append((i+1, max(mmm)))\r\n ans.sort(key=lambda x : x[1], reverse=True)\r\n for i in ans:\r\n print(i[0], \"%.2f\" % i[1])\r\nif __name__ == '__main__':\r\n n, t1, t2, k = map(int, input().split())\r\n p = []\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n p.append((a, b))\r\n\r\n cf_186_B(t1, t2, k, p)", "n, t_1, t_2, k = map(int, input().split())\nlst = []\nfor i in range(n):\n a, b = map(int, input().split())\n lst.append((i + 1, max((1-k/100)at_1+bt_2, (1-k/100)bt_1+at_2)))\n\nfor i, h in sorted(lst, key=lambda x: (-x[1], x[0])):\n print(i, f'{h:.2f}')", "inp = list(str(input()).strip().split(' '))\r\nip_1 = [int(x) for x in inp]\r\n\r\ntot_growth = {}\r\n\r\nfor dwarf in range(int(ip_1[0])):\r\n inp = list(str(input()).strip().split(' '))\r\n ip_i = [int(x) for x in inp]\r\n # given order\r\n phaseA = ip_i[0] * ip_1[1]\r\n phaseB = (ip_1[3] * phaseA) / 100\r\n phaseC = ip_i[1] * ip_1[2]\r\n tot_given = phaseA-phaseB+phaseC\r\n # reverse order\r\n phaseA = ip_i[1] * ip_1[1]\r\n phaseB = (ip_1[3] * phaseA) / 100\r\n phaseC = ip_i[0] * ip_1[2]\r\n tot_rev = phaseA-phaseB+phaseC\r\n \r\n tot_growth[dwarf] = max(tot_given,tot_rev)\r\n\r\nwinners = sorted(tot_growth.items(), key=lambda x:x[1], reverse=True)\r\n\r\nfor x in winners:\r\n print(\"{} {:.2f}\".format(x[0]+1, x[1]))", "n, t1, t2, k = map(int, input().split())\ntable = dict()\ndef compute(a, b):\n return at1(1 - k/100) + bt2\nfor i in range(n):\n a, b = map(int, input().split())\n table[i + 1] = max(compute(a, b), compute(b, a))\n\nans = sorted(table.items(), key=lambda x: (-x[1], x[0]))\nfor k, v in ans:\n print(k, \"{:.2f}\".format(v))\n\n", "n, t1, t2, k = map(int, input().split())\r\nl = []\r\nfor i in range(1, n + 1):\r\n v, m = map(int, input().split())\r\n l.append((i, max((1 - k / 100) v * t1 + m * t2, (1 - k / 100) * m * t1 + v * t2)))\r\n\r\nfor i, h in sorted(l, key=lambda x: (-x[1], x[0])):\r\n print(i, f'{h:.2f}')", "n, t1, t2, k = map(int, input().split())\r\n\r\nplans = {}\r\n\r\nfor i in range(n):\r\n\r\n a, b = map(int, input().split())\r\n\r\n plan1 = ((a * t1) * ((100-k)/100)) + (b * t2) \r\n plan2 = ((b * t1) * ((100-k)/100)) + (a * t2)\r\n\r\n plan = plan1 if plan1 > plan2 else plan2\r\n\r\n plans[i+1] = plan\r\n\r\nsorted_dict = dict(sorted(plans.items(), key=lambda item: item[1], reverse=True))\r\n\r\nfor key, value in sorted_dict.items():\r\n print(key, \"{:.2f}\".format(value))\r\n\r\n", "def main():\r\n n, t1, t2, k = list(map(int, input().split()))\r\n k = k / 100\r\n tournament = []\r\n class player:\r\n def __init__(self, pno, speeds):\r\n self.pno = pno\r\n self.v = speeds[0]\r\n self.u = speeds[1]\r\n self.maxheight = 0\r\n \r\n for i in range(n):\r\n speeds = list(map(int, input().split()))\r\n curplayer = player(i + 1, speeds)\r\n curplayer.maxheight = max((curplayer.u * t1)(1 - k) + (curplayer.v t2), (curplayer.v * t1)(1 - k) + (curplayer.u t2))\r\n tournament.append(curplayer)\r\n tournament.sort(key=lambda x: x.pno)\r\n tournament.sort(key=lambda x: x.maxheight, reverse=True)\r\n \r\n for p in tournament:\r\n print(p.pno, f'{p.maxheight:.2f}')\r\n\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n, t1, t2, k = map(int, input().split(' '))\nans = []\nfor i in range(n):\n a, b = map(int, input().split(' '))\n vala = ((1 - (k/100))(at1)) + (bt2)\n valb = ((1 - (k/100))(bt1)) + (at2)\n val = max(vala, valb)\n ans.append((i+1, val))\nans.sort(key = lambda x: -x[1])\nfor x, y in ans:\n print(\"{} {:.2f}\".format(x, y))", "import sys\r\nimport math\r\nfrom heapq import ;\r\ninput = sys.stdin.readline\r\nfrom functools import cmp_to_key;\r\n\r\ndef pi():\r\n return(int(input()))\r\ndef pl():\r\n return(int(input(), 16))\r\ndef ti():\r\n return(list(map(int,input().split())))\r\ndef ts():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nmod = 1000000007;\r\nf = [];\r\ndef fact(n,m):\r\n global f;\r\n f = [1 for i in range(n+1)];\r\n f[0] = 1;\r\n for i in range(1,n+1):\r\n f[i] = (f[i-1]i)%m;\r\n\r\ndef fast_mod_exp(a,b,m):\r\n res = 1;\r\n while b > 0:\r\n if b & 1:\r\n res = (resa)%m;\r\n a = (aa)%m;\r\n b = b >> 1;\r\n return res;\r\n\r\ndef inverseMod(n,m):\r\n return fast_mod_exp(n,m-2,m);\r\n\r\ndef ncr(n,r,m):\r\n if n < 0 or r < 0 or r > n: return 0;\r\n if r == 0: return 1;\r\n return ((f[n]inverseMod(f[n-r],m))%minverseMod(f[r],m))%m;\r\n\r\ndef main():\r\n B();\r\n\r\ndef cmp(a,b):\r\n if a[1] < b[1]: return 1;\r\n if a[1] > b[1]: return -1;\r\n if a[1] == b[1]:\r\n if a[0] < b[0]: return -1;\r\n else: return 1;\r\n\r\ndef B():\r\n [n,t1,t2,k] = ti();\r\n a,b = [],[];\r\n for i in range(n):\r\n [x,y] = ti();\r\n a.append(x);\r\n b.append(y);\r\n pair = [0 for i in range(n)];\r\n for i in range(n):\r\n pair[i] = [i,round(max(t1a[i](100-k)/100+t2b[i], t1b[i](100-k)/100+t2a[i]),2)];\r\n\r\n pair.sort(key=cmp_to_key(cmp));\r\n \r\n for i in range(n):\r\n print(pair[i][0]+1, pair[i][1] if len(str(pair[i][1]).split('.')[1]) == 2 else str(pair[i][1])+'0');\r\n\r\nmain();", "def inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n \r\n \r\nn, t1, t2, k = inp()\r\nspeeds = list()\r\nfor i in range(n):\r\n x, y = inp()\r\n speeds.append((x, y))\r\na = list()\r\nfor i in range(n):\r\n temp1 = speeds[i][0]t1-(speeds[i][0]t1k/100)+speeds[i][1]t2\r\n temp2 = speeds[i][1]t1-(speeds[i][1]t1k/100)+speeds[i][0]t2\r\n if(temp1 >= temp2):\r\n a.append((i+1, temp1))\r\n else:\r\n a.append((i+1, temp2))\r\na.sort(key=lambda x: (-x[1], x[0]))\r\nfor i in range(len(a)):\r\n print(a[i][0], end=\" \")\r\n print(\"{:.2f}\".format(a[i][1]))", "num_testcases = 1 #int(input())\r\nfor _ in range(num_testcases):\r\n num_participant, time_before_break, time_after_break, percentage = map(int,input().split())\r\n \r\n result = []\r\n for i in range(num_participant):\r\n \r\n a, b = map(int,input().split())\r\n max_s = max(atime_before_break - (percentageatime_before_break)/100.0 + btime_after_break, btime_before_break - (percentagebtime_before_break)/100.0 + atime_after_break)\r\n result.append([i+1, max_s])\r\n #print(result)\r\n \r\n result.sort(key = lambda c:c[1], reverse=True)\r\n \r\n for i in result:\r\n print(i[0],\"%.2f\" % i[1])", "n, t1, t2, k = list(map(int, input().split()))\r\nk /= 100\r\ngreater_first = t1 * (1 - k) > t2\r\nre = []\r\nfor num in range(1, n + 1):\r\n a, b = list(map(int, input().split()))\r\n h = 0\r\n if greater_first:\r\n h += t1 * max(a, b)\r\n h = (1 - k)\r\n h += t2 min(a, b)\r\n else:\r\n h += t1 * min(a, b)\r\n h = (1 - k)\r\n h += t2 max(a, b)\r\n h = round(h, 2)\r\n re.append((h, num * -1))\r\nre.sort(reverse=True)\r\nfor h, num in re:\r\n # print(num * -1, h)\r\n print(num * -1, \"{:.2f}\".format(h))", "resLis = []\r\nn , t1 , t2 , k = map(int, input().split())\r\nfor i in range(n):\r\n spA , spB = map(int, input().split())\r\n heightA = (spA * t1 * ((100-k)/100)) + (spB * t2)\r\n heightB = (spB * t1 * ((100-k)/100)) + (spA * t2)\r\n maxHeight = \"{:.2f}\".format(max(heightA , heightB))\r\n resLis.append((i+1,float(maxHeight)))\r\nresLis.sort(key=lambda a: a[1], reverse=True)\r\nfor element in resLis:\r\n print(f'{element[0]} {element[1]:.2f}')", "\"\"\"\nProblem link: \nSolution By Keshav Mishra \n\"\"\"\nfrom sys import stdin,stdout\nfrom collections import Counter , deque\nfrom queue import PriorityQueue\nimport math\n\n\nhelperConstants = True \nhelperUtilityFunctions = True \n\ndef input(): return stdin.readline().strip()\n# def print(s): stdout.write(str(s)+'\\n')\nif helperConstants:\n YES = 'YES'\n NO = 'NO'\n yes = 'yes'\n no = 'no'\n true = 'true'\n false = 'false'\n FALSE = 'FALSE'\n TRUE = 'TRUE'\n IMPOSSIBLE = 'IMPOSSIBLE'\n POSSIBLE = 'POSSIBLE'\n INF = float('inf')\n\nif helperUtilityFunctions:\n # Input utility functions\n def getInputArray():\n return list(map(int, input().split()))\n def getIntegerInputs():\n return map(int, input().split())\n def getInputIntegerMatrix(n):\n matrix = []\n for i in range(n):\n matrix.append(list(map(int,input().split())))\n return matrix\n def getInputStringMatrix(n):\n matrix = []\n for i in range(n):\n matrix.append(input())\n return matrix\n\n # Output Utility functions\n def outputIntegerMatrix(matrix):\n for i in range(len(matrix)):\n print(matrix[i])\n def outputStringMatrix(matrix):\n for i in range(len(matrix)):\n print(matrix[i])\n def kickstartoutput(testcase,outputs):\n print('Case #%d:'%(testcase), outputs)\n \n \n\n\ndef solve():\n n, t1, t2, k = getIntegerInputs()\n participants = []\n k = 1 - k0.01\n for i in range(n):\n a, b = getIntegerInputs()\n ans1 = 0\n ans2 = 0 \n ans1 += at1 \n ans1 = ans1k\n ans1 += bt2 \n ans2 += bt1 \n ans2 = ans2k \n ans2 += at2 \n ans = max(ans1,ans2)\n participants.append({'index':i + 1, 'value':ans})\n participants.sort(reverse = True, key = lambda x : x['value'])\n for participant in participants:\n print('%d %.2f'%(participant['index'], participant['value']))\n\n\n\n\n \nif __name__ == '__main__':\n solve()\n ", "from decimal import Decimal \r\nn, t1, t2, k = map(int, input().strip().split())\r\nl = []\r\ni = 1\r\nwhile n != 0:\r\n x, y = map(int, input().strip().split())\r\n p1 = x * t1 - (((x * t1) / 100) * k) + y * t2\r\n p2 = y * t1 - (((y * t1) / 100) * k) + x * t2\r\n g = max(p1, p2)\r\n l.append([i,g])\r\n i += 1\r\n n -= 1\r\nl.sort(key=lambda el: el[1], reverse=True)\r\nfor i in range(0, len(l)):\r\n print('%d %.2f' %(l[i][0], l[i][1]))\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, t1, t2, k = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d.append((i+1, max(at1(100-k)/100 + bt2, bt1(100-k)/100 + at2)))\r\n\r\nd.sort(key=lambda x:x[1], reverse=True)\r\nfor i in d:\r\n print(i[0], format(i[1], '.2f'))", "[n, t1, t2, k] = map(lambda x: int(x), input().strip().split(maxsplit=4))\r\n\r\nmax_height = []\r\n\r\nfor i in range(n):\r\n [a, b] = map(lambda x: int(x), input().strip().split(maxsplit=2))\r\n c = a * t1 - (at1(k/100)) + b * t2\r\n d = b * t1 - (bt1(k/100)) + a * t2\r\n if c >= d:\r\n max_height.append((i+1, c))\r\n else:\r\n max_height.append((i+1, d))\r\n\r\nmax_height.sort(key=lambda x: x[0])\r\nmax_height.sort(key=lambda x: x[1], reverse=True)\r\n\r\nfor _ in max_height:\r\n print(f\"{_[0]} {_[1]:.2f}\")\r\n", "def comp(item1, item2):\r\n if item1[0] > item2[0]:\r\n return True\r\n elif item2[0] > item1[0]:\r\n return False\r\n else:\r\n if item1[1] < item2[1]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef mergeSort(nums):\r\n if len(nums)<2:\r\n return nums\r\n else:\r\n mid = len(nums)//2\r\n left = mergeSort(nums[:mid])\r\n right = mergeSort(nums[mid:])\r\n\r\n temp = []\r\n i = 0\r\n j = 0\r\n while i<len(left) and j<len(right):\r\n if comp(left[i], right[j]):\r\n temp.append(left[i])\r\n i += 1\r\n else:\r\n temp.append(right[j])\r\n j += 1\r\n \r\n if i<len(left):\r\n temp.extend(left[i:])\r\n \r\n if j<len(right):\r\n temp.extend(right[j:])\r\n \r\n return temp\r\n\r\n\r\nn, t1, t2, k = map(int, input().split())\r\nnums = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n val = max(\r\n (at1)(1-k/100) + bt2,\r\n (bt1)(1-k/100) + at2,\r\n )\r\n nums.append([val, i+1])\r\nnums = mergeSort(nums)\r\nfor i in nums:\r\n print(\"{} {:.2f}\".format(i[1], i[0]))\r\n", "num,t1,t2,per = map(int,input().split())\r\nk = []\r\nc = 9999999999999999\r\nfor i in range(1,num+1):\r\n p = list(map(int,input().split()))\r\n p.sort()\r\n a = float(\"{:.2f}\".format(p[0]t1(100-per)/100+p[1]t2))\r\n b = float(\"{:.2f}\".format(p[1]t1(100-per)/100+p[0]t2))\r\n k.append([float(max(a,b)),c,i])\r\n c -= 1\r\nk.sort()\r\nk.reverse()\r\nfor i in k:\r\n print(i[2],\"{:.2f}\".format(i[0]))", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, t1, t2, k = (int(i) for i in read().split())\r\n k = 1 - (k / 100)\r\n results: list[tuple[int, int]] = []\r\n for i in range(n):\r\n s1, s2 = (int(i) for i in read().split())\r\n result = max((s1 * t1) * k + (s2 * t2), (s2 * t1) * k + (s1 * t2))\r\n results.append((result, i +1))\r\n\r\n results.sort(key=lambda x: (-x[0], x[1]))\r\n for val in results:\r\n value, i = val\r\n print(f'{i} {value:.2f}')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, t1, t2, k = map(int, input().split())\r\nlis = []\r\narr = []\r\nfor i in range(n):\r\n\th, h1, h2, h11, h22, hh = 0, 0, 0, 0, 0, 0\r\n\ta, b = map(int, input().split())\r\n\t\r\n\th1 = a * t1 \r\n\th11 = b * t1 \r\n\th1 = h1 - (k * h1) / 100\r\n\th11 = h11 - (k * h11) / 100 \r\n\th2 = b * t2\r\n\th22 = a * t2 \r\n\th = h1 + h2 \r\n\thh = h11 + h22 \r\n\tarr.append(max(h, hh))\r\n\tc = max(h, hh)\r\n\tc = '%.2f'%c\r\n\tlis.append(c)\r\ndic = {}\r\nfor i in range(len(lis)):\r\n\tif lis[i] in dic:\r\n\t\tdic[lis[i]].append(i + 1)\r\n\telse:\r\n\t\tdic[lis[i]] = [i + 1]\r\nse = set(arr)\r\nnew_arr = []\r\nfinal_arr = []\r\nfor i in se:\r\n\tnew_arr.append(i)\r\nnew_arr.sort(reverse = True)\r\nfor j in new_arr:\r\n\tj = '%.2f'%j\r\n\tfinal_arr.append(j)\r\n'''print(dic)\r\nprint(final_arr)'''\r\nfor i in final_arr:\r\n\tfor j in dic[i]:\r\n\t\tprint(j, i)\r\n\r\n", "n,t1,t2,k=list(map(int,input().split(\" \")))\nk = (100-k) * 0.01\nai=[]\nbi=[]\nfor _ in range(n):\n a,b = list(map(int,input().split(\" \")))\n ai.append(a)\n bi.append(b)\nscores=list()\nfor i,j in zip(ai,bi) :\n scores.append( round( max( (it1k)+(t2j),(t1jk)+(t2i)) ,2) )\n\nfor i,j in sorted(zip(range(1,n+1),scores),key = lambda pair: pair[1],reverse=True):\n print('{0} {1:.2f}'.format(i,j))", "\r\n# Problem: B. Growing Mushrooms\r\n# Contest: Codeforces - Codeforces Round #118 (Div. 2)\r\n# URL: https://codeforces.com/contest/186/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,t1,t2,k = get_ints()\r\narr = []\r\nfor i in range(n):\r\n\ta,b = get_ints()\r\n\tmi = min(a,b)\r\n\tma = max(a,b)\r\n\t# print(mi)\r\n\tx = max(t1a(1-(k/100))+bt2,t1b(1-(k/100))+at2)\r\n\tarr.append([str(i+1),\"{:.2f}\".format(x)])\r\n\r\nfor row in sorted(arr,key =lambda x: float(x[1]),reverse = True):\r\n\tprint(\" \".join(row))", "\r\nfrom collections import deque\r\n\r\nn , t1 , t2, k = map(int,input().split())\r\nl = deque()\r\n\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n r1 = a * t1 - a * t1 * k/100 + b * t2\r\n r2 = b * t1 - b * t1 * k/100 + a * t2\r\n\r\n l.append([i + 1 ,max(r1 , r2)])\r\n\r\nl = list(l)\r\n\r\nl.sort(key= lambda x : x[1] , reverse= True)\r\n\r\n#print(l)\r\n\r\nfor i in range(len(l)):\r\n print('%d %.2f'%(l[i][0] , l[i][1]))\r\n", "n,t1,t2,k = map(int,input().split())\nmatrix = []\nfor i in range(n):\n a ,b = map(int,input().split())\n choice1 = ((at1)-at1(k/100)) + (bt2)\n choice2 = ((bt1)-bt1(k/100))+ (at2)\n a = [i+1 , max(choice1,choice2)]\n matrix.append(a)\nmatrix.sort(key=lambda x:x[1],reverse=True)\nfor i in matrix:\n print(\"{} {:.2f}\".format(i[0],i[1]))\n", "n, t1, t2, k = map(int, input().split())\r\n\r\nresults = [] # Initialize a list to store results\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n a,b = min(a,b), max(a,b)\r\n # Calculate the growth in the first part\r\n growth_1_a = a * t1\r\n growth_1_b = b * t1\r\n # Calculate the reduction during the break\r\n reduced_growth_a = (k / 100) * growth_1_a\r\n reduced_growth_b = (k / 100) * growth_1_b\r\n\r\n # Calculate the growth in the second part\r\n growth_2_a = a * t2\r\n growth_2_b = b * t2\r\n \r\n # Calculate the total height of the mushroom\r\n total_height = max(growth_1_a - reduced_growth_a + growth_2_b,growth_1_b - reduced_growth_b + growth_2_a)\r\n \r\n results.append((i + 1, total_height))\r\n\r\n# Sort the results based on total height (descending) and original order\r\nresults.sort(key=lambda x: (-x[1], x[0]))\r\n\r\n# Print the results table\r\nfor result in results:\r\n print(result[0], '{:.2f}'.format(result[1]))\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Aug 3 12:38:21 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 40 - CF186-DIV2B\r\n\"\"\"\r\n\r\nn, t1, t2, k = map(int,input().split())\r\ngrowths = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n growths.append((i+1,max((at1)(1 - k/100) + bt2, bt1(1-k/100) + at2)))\r\n\r\ngrowths.sort(key = lambda x: (-x[1],x[0]))\r\nfor i in range(n):\r\n print(growths[i][0], '{:.2f}'.format(growths[i][1]))\r\n \r\n \r\n\r\n", "n, t1, t2, k = map(int, input().split())\r\nl = list(list(map(int, input().split())) for i in range(n))\r\ns = {}\r\nif t1 * (100-k)/100 >= t2:\r\n for i in range(n):\r\n s[i + 1] = max(l[i]) * t1 * (100-k)/100 + min(l[i]) * t2\r\nelse:\r\n for i in range(n):\r\n s[i + 1] = min(l[i]) * t1 * (100-k)/100 + max(l[i]) * t2\r\ns = {k: v for k, v in sorted(s.items(), key=lambda item: item[1], reverse=True)}\r\nfor i, j in s.items():\r\n print(i, '{:.2f}'.format(j), sep=' ')\r\n", "#from sys import maxsize\r\n#from collections import Counter as cnt, defaultdict as dic\r\n#import string\r\nfrom decimal import Decimal as de\r\nget_int = lambda: int(input())\r\nget_mul_int = lambda: map(int, input().rstrip().split())\r\nget_list = lambda: list(map(int, input().rstrip().split()))\r\n\r\nTEST_CASES = False\r\ndef main():\r\n n,t1,t2,k=get_mul_int()\r\n table= []\r\n for j in range(n):\r\n a,b=get_mul_int()\r\n h1=(de(at1((100-k)/100))+(bt2))\r\n h2=(de(bt1((100-k)/100))+(at2))\r\n table.append([j+1,round(max(h1,h2),2)])\r\n new=sorted(table,key=lambda x: x[-1],reverse=True)\r\n for i in new:\r\n print(i)\r\n \r\n# START\r\nif not TEST_CASES: main()\r\nelse: [main() for _ in range(int(input()))]\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\n\ndef MyFunc(e):\n return(e[1])\n\ndata = sys.stdin.readline()[:-1].split(' ')\nn, t1, t2, k = int(data[0]), int(data[1]), int(data[2]), int(data[3])\nt1 = 1-k/100\nif t2 > t1:\n t1, t2 = t2, t1\ndwarves = [[0,0] for _ in range(n)]\nfor i in range(n):\n dwarves[i][0] = i+1\n vu = sys.stdin.readline()[:-1].split(' ')\n v, u = int(vu[0]), int(vu[1])\n if u > v:\n u, v = v, u\n dwarves[i][1] = vt1 + ut2\n\ndwarves.sort(key=MyFunc, reverse = True)\nfor i in range(n):\n print(dwarves[i][0], \"%.2f\" % dwarves[i][1])\n\t\t\t \t\t\t \t \t \t \t \t\t \t \t\t \t \t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Growing Mushrooms\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, t1, t2, k = list(map(int, input().split()))\r\n p = []\r\n for _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n p.append([_+1, (max((t1a)-((k/100)(t1a))+(t2b), (t1b)-((k/100)(t1b))+(t2a)))])\r\n \r\n for i in sorted(p, key=lambda x: x[1], reverse=True):\r\n print(i[0], \"%.2f\" %i[1])\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, t1, t2, k = map(int, input().split())\nd = []\nbef = True\nif t1 < t2:\n bef = False\n\nfor i in range(n):\n a, b = map(int, input().split())\n if bef:\n tot = max(\n t2 a + t1 * b - (k / 100) * t1 * b,\n t2 * b + t1 * a - (k / 100) * t1 * a \n )\n else:\n small = min(a, b) * t1\n tot = small + max(a, b) * t2 - small * (k / 100) \n\n\n d.append([i+1, tot])\n\nfor l in sorted(d, key=lambda x: (x[1], x[0] * -1), reverse=True):\n print(l[0], f\"{l[1]:.2f}\")", "n, t1, t2, k = [int(x) for x in input().split()]\n\ndef f(v, u):\n res1 = ((t1 * v) * (100-k) / 100) + t2 * u\n res2 = ((t1 * u) * (100-k) / 100) + t2 * v\n\n return max(res1, res2)\n\ndata = []\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n\n data.append((f(a,b), -(i+1)))\n\ndata.sort(reverse=True)\n\nfor h, ind in data:\n print(-ind, f'{h:.2f}')\n", "from sys import stdin\n\nn, t1, t2, k = map(int, stdin.readline().split())\nk = float(k)\n\nheights = []\nfor i in range(n):\n u, v = map(int, stdin.readline().split())\n h = max(u * t1 * (1 - k / 100) + v * t2, v * t1 * (1 - k / 100) + u * t2)\n heights.append((h, i))\n\n\n# do the sorting\ndef compare_function(pair1, pair2):\n if pair1[0] == pair2[0]:\n return pair2[1] - pair1[1]\n return pair1[0] - pair2[0]\n\nfrom functools import cmp_to_key\nheights.sort(key=cmp_to_key(compare_function), reverse=True)\n# heights = sorted(heights, cmp=compare_function)\n\nfor height, id in heights:\n print(f\"{id+1}\",\"{:.2f}\".format(height))\n\n", "def getkey (item):\r\n return item[1]\r\n\r\nn, t1, t2, k = map(int, input().split())\r\n\r\nboard = []\r\n\r\nfor i in range(n):\r\n v, u = map(int, input().split())\r\n mx = max( (vt1 (100-k)/100) + (ut2), (ut1 * (100-k)/100) + (vt2) )\r\n \r\n board.append([i+1, mx])\r\nboard = sorted(board, key= getkey, reverse= True)\r\n\r\n\r\nfor i in board:\r\n print(i[0], \"{:.2f}\".format(i[1]) )\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,t1,t2,k=get_ints()\r\nans=[]\r\nfor i in range(n):\r\n a,b=get_ints()\r\n #case1\r\n v1=((at1)(1-(k/100)))+(bt2)\r\n #case2\r\n v2=((bt1)(1-(k/100)))+(at2)\r\n v=max(v1,v2)\r\n ans.append([i+1,v])\r\nans.sort(reverse=True, key=lambda x:x[1])\r\nfor i in ans:\r\n print(i[0],\"{:0.2f}\".format(i[1]))", "I = lambda: map(int, input().split())\r\n\r\nn, t1, t2, k = I()\r\nres = []\r\n\r\nfor i in range(n):\r\n a, b = I()\r\n res.append((i, max((1-k/100)at1+bt2, (1-k/100)bt1+at2)))\r\n\r\nfor i,h in sorted(res, key=lambda x: (-x[1], x[0])):\r\n\tprint(i+1, f'{h:.2f}')", "# link: https://codeforces.com/contest/186/problem/B\r\n\r\nfrom collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n n,t1,t2,k = map(int, input().split())\r\n results = defaultdict(list)\r\n i = 1\r\n while n:\r\n # 2 cases\r\n # consider t1 first and then t2\r\n a,b = map(int, input().split())\r\n first_height = ((at1) - (at1k/100)) + (bt2)\r\n second_height = ((bt1) - (bt1k/100)) + (at2)\r\n height = round(max(first_height, second_height), 2)\r\n results[height].append(i)\r\n i += 1\r\n n -= 1\r\n for key in sorted(results, reverse = True):\r\n for i in results[key]:\r\n s = str(key)\r\n s = s.split('.')\r\n if len(s[-1]) == 1:\r\n print(i, s[0]+'.'+s[-1]+'0')\r\n else: \r\n print(i,key)\r\n", "n,t1,t2,k=list(map(int,input().split()))\r\nresult=[]\r\nfor i in range(n):\r\n v,u=(list(map(int,input().split())))\r\n result.append([max(vt1(100-k)+ut2100,ut1(100-k)+vt2100),i])\r\nresult.sort(reverse=True,key=lambda x:x[0])\r\nfor i in result:\r\n print(str(i[1]+1)+\" %.2f\" % (i[0]/100))\r\n\n# Sun Aug 11 2019 15:25:36 GMT+0300 (MSK)\n", "# -- coding: utf-8 --\r\n\r\nr'''\r\n\r\n HAIL TLRX\r\n .----------------. .----------------. .----------------.\r\n\| .--------------. \| \| .--------------. \| \| .--------------. \|\r\n\| \| _______ \| \| \| \| _________ \| \| \| \| ____ ____ \| \|\r\n\| \| \|_ __ \\ \| \| \| \| \|_ ___ \| \| \| \| \| \|_ _\|\|_ _\| \| \|\r\n\| \| \| \|__) \| \| \| \| \| \| \|_ \\_\| \| \| \| \| \\ \\ / / \| \|\r\n\| \| \| __ / \| \| \| \| \| _\| _ \| \| \| \| > `' < \| \|\r\n\| \| _\| \| \\ \\_ \| \| \| \| _\| \|___/ \| \| \| \| \| _/ /'`\\ \\_ \| \|\r\n\| \| \|____\| \|___\| \| \| \| \| \|_________\| \| \| \| \| \|____\|\|____\| \| \|\r\n\| \| \| \| \| \| \| \| \| \| \| \|\r\n\| '--------------' \| \| '--------------' \| \| '--------------' \|\r\n '----------------' '----------------' '----------------'\r\n\r\n\r\n @Author: Kunal Verma\r\n\r\nCodeForces - kunalverma19\r\nCodeChef - kunalverma_19\r\nAtCoder - TLKunalVermaRX\r\n\r\n* @Last Modified by: thelords\r\n* @Modified Time: 2021-10-26 10:06:48 (IST)\r\n'''\r\n\r\n\r\n# import math\r\n# from math import ceil, floor\r\n# import re\r\n# import string\r\n# import sys\r\n# from itertools import permutations\r\n# from collections import Counter\r\n# import itertools\r\n# MOD = 1000000007\r\ndef inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n\r\n\r\nn, t1, t2, k = inp()\r\nspeeds = list()\r\nfor i in range(n):\r\n x, y = inp()\r\n speeds.append((x, y))\r\na = list()\r\nfor i in range(n):\r\n temp1 = speeds[i][0]t1-(speeds[i][0]t1k/100)+speeds[i][1]t2\r\n temp2 = speeds[i][1]t1-(speeds[i][1]t1k/100)+speeds[i][0]t2\r\n if(temp1 >= temp2):\r\n a.append((i+1, temp1))\r\n else:\r\n a.append((i+1, temp2))\r\na.sort(key=lambda x: (-x[1], x[0]))\r\nfor i in range(len(a)):\r\n print(a[i][0], end=\" \")\r\n print(\"{:.2f}\".format(a[i][1]))\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, t1, t2, k = inp()\r\nans = []\r\nfor i in range(n):\r\n a, b = inp()\r\n height = max(t1 * a * ((100 - k) / 100) + t2 * b, t1 * b * ((100 - k) / 100) + t2 * a)\r\n ans.append([i + 1, height, 2])\r\n\r\nans.sort(key=lambda x: x[1], reverse=True)\r\n\r\nfor i in range(n):\r\n print(ans[i][0], '{:.2f}'.format(ans[i][1]))\r\n", "n, t1, t2, k = [int(x) for x in input().split()]\r\nk = (100-k)/100\r\nres = []\r\ndict = {}\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n temp = max(at1k + bt2, bt1k + at2)\r\n if temp in dict:\r\n dict[temp].append(i+1)\r\n else: \r\n dict[temp] = [i+1]\r\n res.append(temp)\r\nres.sort(reverse=True)\r\nfor item in res:\r\n temp = \"{:.2f}\".format(item)\r\n for obj in dict[item]:\r\n print(obj, temp)\r\n\r\n", "n , t1 , t2 , k = map(int,input().split())\r\n\r\nl = []\r\ni = 1\r\nwhile n != 0 :\r\n\r\n a , b = map(int,input().split())\r\n\r\n r1 = a * t1 - (((a * t1) / 100) * k ) + b * t2\r\n r2 = b * t1 - (((b * t1) / 100) * k) + a * t2\r\n g = max(r1 , r2)\r\n\r\n l.append([i , g])\r\n i +=1\r\n n -=1\r\n\r\nl.sort(key= lambda x : x[1] , reverse= True)\r\n\r\nfor i in range(len(l)):\r\n\r\n print('%d %.2f' % (l[i][0] ,l[i][1] ))", "n,t1,t2,k=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n temp1=at1-(at1k/100)+bt2\r\n temp2=bt1-(bt1k/100)+at2\r\n if temp1>temp2:\r\n s.append([temp1,-i-1])\r\n else:\r\n s.append([temp2,-i-1])\r\ns.sort(reverse=True)\r\nfor i,z in s:\r\n print('%d %.2f' % (-z,i))", "def l_():\r\n return list(map(int,input().split()))\r\nn,t1,t2,k=map(int, input().split())\r\nd = {}\r\nk=k/100\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n best = max(at1-at1k+bt2, bt1-bt1k+at2)\r\n d[i+1]=best\r\n#print(d)\r\nsd=sorted(d.items(), key=lambda x:x[1], reverse=True)\r\nfor i in range(n):\r\n print(sd[i][0],\"%.2f\" % sd[i][1])", "n, t1, t2, k = map(int, input().split())\r\nk = k / 100\r\n# print(k)\r\ndashboard = {}\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n meters1 = (a * t1) - (a * t1 * k) + (b * t2)\r\n meters2 = (b * t1) - (b * t1 * k) + (a * t2)\r\n # print(meters)\r\n dashboard[_ + 1] = [max(meters1, meters2)]\r\ndashboard = sorted(dashboard.items(), key=lambda x: x[1], reverse=True)\r\nfor i in range(n):\r\n print(dashboard[i][0], end=' ')\r\n print(\"{:.2f}\".format(dashboard[i][1][0]))\r\n", "n, t1, t2, k = map(int, input().split())\r\ntable = []\r\nfor i in range(1, n+1):\r\n a, b = map(int, input().split())\r\n c1 = at1(1-k/100) + bt2\r\n c2 = bt1(1-k/100) + at2\r\n if c1 > c2:\r\n c = c1\r\n else:\r\n c = c2\r\n table.append((i, f\"{c:.2f}\"))\r\nfor e in sorted(table, key=lambda x: float(x[1]), reverse=True):\r\n print(e)\r\n", "n, t1, t2, k = map(int,input().split())\r\nls = {}\r\nfor _ in range(n):\r\n\ta , b = map(int,input().split())\r\n\tls[_+1] = max((at1(1-k/100)+bt2),(bt1(1-k/100)+at2))\r\n\r\nl = sorted(ls.items(), key=lambda x: x[1],reverse = True)\r\nfor key,val in l:\r\n\tprint(key,\"{:.2f}\".format(val))", "n, t1, t2, k = map(int, input().split())\ncontestants = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\tx = (100-k)/100at1 + bt2\n\ty = (100-k)/100bt1 + at2\n\tcontestants.append((-max(x, y), i+1))\ncontestants.sort()\nfor value, pos in contestants:\n\tprint('%d %.2f' % (pos, -value))\n\n \t\t\t \t\t\t\t\t \t \t\t\t \t\t\t", "n, t1, t2, k = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l.append((i+1, max(at1(1-(k/100))+bt2, bt1(1-(k/100))+at2)))\r\n\r\nl.sort(key=lambda x: x[1], reverse=True)\r\nfor a, b in l:\r\n print(a, \"{:.2f}\".format(b))", "n,t1,t2,c = tuple([int(d) for d in input().split(\" \")])\r\n \r\narr = list()\r\nfor i in range(0,n):\r\n items = [int(g) for g in input().split(\" \")]\r\n val1 = t1items[0] - (t1items[0](c/100.00)) + (t2/1.00)(items[1]/1.00)\r\n val2 = t1items[1] - (t1items[1](c/100.00)) + (t2/1.00)(items[0]/1.00)\r\n \r\n arr.append([max([val1, val2]), i+1])\r\n \r\nsorted_arr = sorted(arr, key=lambda x: x[0] , reverse=True)\r\nfor i in range(0,len(sorted_arr)):\r\n print(str(sorted_arr[i][1]) + \" \" + str(\"{0:.2f}\".format(sorted_arr[i][0])))", "n, t1, t2, k = map(int,input().split())\r\ndwarfs = []\r\nfor i in range(n):\r\n v,u = tuple(map(int,input().split()))\r\n first = t1v\r\n second = t2u\r\n s1 = first - (firstk/100) +second\r\n first = t1u\r\n second = t2v\r\n s2 = first - (firstk/100) +second\r\n dwarfs.append((i+1,max([s1,s2])))\r\ndwarfs.sort(key= lambda x : x[1],reverse=1)\r\n[print(d,'{:.2f}'.format(s))for d,s in dwarfs]", "\r\nimport operator\r\n\r\nn, t1, t2, l = map(int, input().split())\r\npartData = []\r\nfinalData = []\r\nfor x in range(n):\r\n\tpartData.append(list(map(int, input().split())))\r\n\r\ncounter = 1\r\nfor j, k in partData:\r\n\tif (((jt1) - (jt1)(l/100)) + kt2) > (((kt1) - (kt1)(l/100)) + jt2):\r\n\t\tfinalData.append((counter, (((jt1) - (jt1)(l/100)) + kt2)))\r\n\telse:\r\n\t\tfinalData.append((counter, (((kt1) - (kt1)(l/100)) + jt2)))\r\n\tcounter += 1\r\n\r\n\r\nfinalData = sorted(finalData, key=operator.itemgetter(1), reverse = True)\r\n\r\n\r\nfor x, y in finalData:\r\n\tprint(\"{} {:.2F}\".format(x, y))", "# Author: wizplus\n# TIme: 2020-08-26 09:24:24\n\n\ndef main():\n n, t1, t2, k = list(map(int, input().split()))\n\n res = []\n for i in range(1, n+1):\n a, b = list(map(int, input().split()))\n ta =at1 * (1-k/100) + bt2\n tb = bt1 * (1-k/100) + at2\n t = max(ta, tb)\n res.append([i, t])\n\n res = sorted(res, key=lambda x: (x[1], -x[0]))[::-1]\n\n for i, r in res:\n print('{:d} {:.2f}'.format(i, r))\n\n\nif __name__ == \"__main__\":\n main()\n\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n n, t1, t2, k = map(int, stdin.readline().split())\r\n \r\n parts = []\r\n \r\n for i in range(1, n+1):\r\n a, b = map(int, stdin.readline().split())\r\n \r\n m = max(at1(100-k)/100 + bt2, bt1(100-k)/100 + at2)\r\n parts.append((i, m))\r\n \r\n parts.sort(key=lambda x:x[1], reverse=True)\r\n \r\n for i, val in parts:\r\n print(\"{} {:.2f}\".format(i, val))\r\nmain()\r\n", "n, t1, t2, k = map(int, input().split())\n \nans = [] \nfor i in range(n):\n a, b = map(int, input().split())\n v = max(t1a + t2b-t1ak/100, t1b + t2a-t1bk/100)\n ans.append([i+1, v])\n\nans.sort(key = lambda x: x[1], reverse=True)\n[print(f\"{i[0]} {i[1]:.2f}\") for i in ans]\n\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t\t \t\t\t\t\t\t\t\t", "\r\nif __name__=='__main__':\r\n n,t1,t2,t=list(map(int,input().split()))\r\n dwarfs=[]\r\n for i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n r1=(pt1-(pt1)(t/100))+qt2\r\n r2=(qt1-(qt1)(t/100))+pt2\r\n dwarfs.append((i,max(r1,r2)))\r\n n-=1\r\n dwarfs.sort(key=lambda x:x[1],reverse=True)\r\n for i in range(1,len(dwarfs)):\r\n if dwarfs[i-1][1]==dwarfs[i][1]:\r\n if dwarfs[i-1][0]>dwarfs[i][0]:\r\n dwarfs[i-1],dwarfs[i]=dwarfs[i],dwarfs[i-1]\r\n\r\n\r\n \r\n\r\n for dwarf,height in dwarfs:\r\n print(f\"{dwarf} {height:.2f}\")", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n \r\n\r\ndef solve():\r\n n, t_1, t_2, k = read_tuple(int)\r\n v = [tuple(read_tuple(int)) for _ in range(n)]\r\n heights = [(i + 1, max(a t_1 * (1 - k / 100) + b * t_2, b * t_1 * (1 - k / 100) + a * t_2)) for i, (a, b) in enumerate(v)]\r\n heights.sort(key=lambda x: x[1], reverse=True)\r\n for i, h in heights:\r\n print(f'{i} {h:.2f}')\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()\r\n " ]	{"inputs": ["2 3 3 50\n2 4\n4 2", "4 1 1 1\n544 397\n280 101\n280 101\n693 970", "10 1 1 25\n981 1\n352 276\n164 691\n203 853\n599 97\n901 688\n934 579\n910 959\n317 624\n440 737", "10 6 1 48\n239 632\n976 315\n797 112\n1 835\n938 862\n531 884\n422 607\n152 331\n413 677\n622 978", "8 1 4 55\n507 82\n681 492\n602 849\n367 557\n438 320\n798 699\n338 302\n391 814", "9 6 4 80\n95 269\n95 269\n781 724\n22 269\n173 655\n972 850\n22 269\n95 269\n642 666", "7 1 8 25\n98 713\n876 112\n990 771\n57 395\n171 899\n86 600\n459 320", "6 1 5 9\n105 771\n105 771\n105 771\n557 985\n105 771\n105 771", "6 2 2 78\n942 465\n593 600\n480 359\n733 648\n995 55\n526 538", "2 1 1 1\n2 2\n2 2", "2 1 1 100\n3 4\n4 3", "1 1 1 1\n1 1"], "outputs": ["1 15.00\n2 15.00", "4 1656.07\n1 937.03\n2 379.99\n3 379.99", "8 1641.50\n6 1417.00\n7 1368.25\n10 1067.00\n4 1005.25\n1 981.75\n9 861.75\n3 814.00\n5 671.75\n2 559.00", "5 3788.56\n10 3673.36\n2 3360.12\n6 3289.08\n4 2606.20\n3 2598.64\n9 2525.24\n7 2315.84\n1 2210.84\n8 1184.72", "3 3666.90\n6 3506.55\n8 3431.95\n2 2945.40\n4 2393.15\n1 2064.90\n5 1896.00\n7 1487.90", "6 4908.00\n3 3992.80\n9 3434.40\n5 2827.60\n1 1190.00\n2 1190.00\n8 1190.00\n4 1102.40\n7 1102.40", "3 8498.25\n5 7320.25\n2 7092.00\n1 5777.50\n6 4864.50\n7 3912.00\n4 3202.75", "4 5431.87\n1 3950.55\n2 3950.55\n3 3950.55\n5 3950.55\n6 3950.55", "1 2088.60\n5 2014.20\n4 1751.12\n2 1460.92\n6 1307.44\n3 1117.96", "1 3.98\n2 3.98", "1 4.00\n2 4.00", "1 1.99"]}	UNKNOWN	PYTHON3	CODEFORCES	60
d154b5f96fbc09054a93df0a65532334	Prefixes and Suffixes	You have a string s<==<=s1s2...s\|s\|, where \|s\| is the length of string s, and si its i-th character. Let's introduce several definitions: - A substring s[i..j] (1<=≤<=i<=≤<=j<=≤<=\|s\|) of string s is string sisi<=+<=1...sj. - The prefix of string s of length l (1<=≤<=l<=≤<=\|s\|) is string s[1..l]. - The suffix of string s of length l (1<=≤<=l<=≤<=\|s\|) is string s[\|s\|<=-<=l<=+<=1..\|s\|]. Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring. The single line contains a sequence of characters s1s2...s\|s\| (1<=≤<=\|s\|<=≤<=105) — string s. The string only consists of uppercase English letters. In the first line, print integer k (0<=≤<=k<=≤<=\|s\|) — the number of prefixes that match a suffix of string s. Next print k lines, in each line print two integers li ci. Numbers li ci mean that the prefix of the length li matches the suffix of length li and occurs in string s as a substring ci times. Print pairs li ci in the order of increasing li. Sample Input ABACABA AAA Sample Output 3 1 4 3 2 7 1 3 1 3 2 2 3 1	[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nS=input().strip()\r\n\r\n\r\nLEN=len(S)\r\ni=1\r\nj=0\r\nA=[0]LEN\r\nA[0]=LEN\r\n\r\nwhile i<LEN:\r\n while i+j<LEN and S[j]==S[i+j]:\r\n j+=1\r\n A[i]=j\r\n \r\n if j==0:\r\n i+=1\r\n continue\r\n \r\n k=1\r\n while i+k<LEN and k+A[k]<j:\r\n A[i+k]=A[k]\r\n k+=1\r\n i+=k\r\n j-=k\r\n\r\nANS=[0](LEN+1)\r\n\r\nfor a in A:\r\n ANS[a]+=1\r\n\r\nfor i in range(LEN-1,-1,-1):\r\n ANS[i]+=ANS[i+1]\r\n\r\nANS2=[]\r\nfor i in range(1,LEN+1):\r\n if A[LEN-i]==i:\r\n ANS2.append((i,ANS[i]))\r\n\r\nprint(len(ANS2))\r\nfor x,y in ANS2:\r\n print(x,y)\r\n\r\n\r\n\r\n", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\ns = input()\r\nn = len(s)\r\np = [0]n\r\nm = [0]n\r\n\r\nfor i in range(1,n):\r\n j = p[i-1]\r\n \r\n while j > 0 and s[i] != s[j]:\r\n j = p[j-1]\r\n \r\n if s[i] == s[j]:\r\n j += 1\r\n \r\n p[i] = j\r\n\r\nfor i in range(1,n):\r\n m[p[i]] += 1\r\n\r\nfor i in range(n-1,0,-1):\r\n m[p[i-1]] += m[i]\r\n\r\nfor i in range(1,n):\r\n m[i] += 1\r\n\r\nli = []\r\nli.append([n,1])\r\n\r\nj = n-1\r\n\r\nwhile p[j] > 0:\r\n li.append([p[j],m[p[j]]])\r\n j = p[j] - 1\r\n\r\nprint(len(li))\r\n\r\nfor i in range(len(li) - 1,-1,-1):\r\n print(li[i][0],li[i][1])", "s=input()\r\nn=len(s)\r\np=[0]\r\nsol=[]\r\nfor i in range(1,n):\r\n j=p[i-1]\r\n while j>0 and s[j]!=s[i]:\r\n j=p[j-1]\r\n if (s[j]==s[i]):\r\n j+=int(s[j]==s[i])\r\n p.append(j)\r\n\r\nsols = list()\r\nk=n\r\n\r\nwhile k != 0:\r\n sols.append(k) \r\n k = p[k - 1]\r\n\r\nocurs = [0] * (n + 1)\r\nfor i in range(n):\r\n ocurs[p[i]] += 1\r\nfor i in reversed(range(2,n)):\r\n ocurs[p[i - 1]] += ocurs[i]\r\n\r\nsols.reverse()\r\nfor i in sols:\r\n sol.append(\"{} {}\".format(i,ocurs[i]+1))\r\n\r\nprint(len(sols))\r\nfor i in sol:\r\n print(i)", "s=input()\r\nn=len(s)\r\np=[0]n\r\nfor i in range(1,n):\r\n j=p[i-1]\r\n while j>0 and s[i]!=s[j]:\r\n j=p[j-1]\r\n if s[i]==s[j]:j+=1\r\n p[i]=j\r\n\r\nj=0\r\nans=[0](n+1)\r\nfor i in range(n):\r\n ans[p[i]]+=1\r\nfor i in range(n-1,0,-1):\r\n ans[p[i-1]]+=ans[i]\r\nl=[]\r\nk=p[-1]\r\nwhile k>0:\r\n l.append(k)\r\n k=p[k-1]\r\nl.reverse()\r\nprint(len(l)+1)\r\nfor i in l:\r\n print(i,ans[i]+1)\r\nprint(n,1)\r\n \r\n", "s = ' ' + input()\r\nn = len(s)\r\nr, c = [-1] * n, [1] * n\r\nfor i in range(1, n):\r\n r[i] = r[i - 1] + 1\r\n while r[i] and s[r[i]] != s[i]:\r\n r[i] = r[r[i] - 1] + 1\r\nd, n = [], n - 1\r\nfor i in range(n, 1, -1): c[r[i]] += c[i]\r\nwhile n > 0:\r\n d.append(str(n) + ' ' + str(c[n]))\r\n n = r[n]\r\nprint(len(d))\r\nd.reverse()\r\nprint('\\n'.join(d))", "s = input()\r\nn = len(s)\r\nz = [0] * n\r\nsum_ = [0] * (n + 1)\r\n\r\n\r\ndef calc_Z():\r\n z[0] = n\r\n l = r = 0\r\n for i in range(1, n):\r\n if i <= r and z[i - l] < r - i + 1:\r\n z[i] = z[i - l]\r\n else:\r\n z[i] = max(0, r - i + 1)\r\n while i + z[i] < n and s[i + z[i]] == s[z[i]]:\r\n z[i] += 1\r\n if i + z[i] - 1 > r:\r\n l = i\r\n r = i + z[i] - 1\r\n for i in range(n):\r\n sum_[z[i]] += 1\r\n for i in range(1, n + 1):\r\n sum_[i] += sum_[i - 1]\r\n\r\n\r\ncalc_Z()\r\n\r\n\r\nans = []\r\nfor i in range(n - 1, -1, -1):\r\n if i + z[i] - 1 == n - 1:\r\n ans.append((n - i, sum_[n] - sum_[n - i - 1]))\r\nprint(len(ans))\r\nfor a in ans:\r\n print(a[0], a[1])", "S = input()\r\nN = len(S)\r\n\r\ndef prefix_function(s):\r\n n = N\r\n pi = [0]n\r\n for i in range(1, n):\r\n j = pi[i-1]\r\n while j > 0 and s[i] != s[j]:\r\n j = pi[j-1]\r\n if s[i] == s[j]:\r\n j += 1\r\n pi[i] = j\r\n return pi\r\n\r\npi = prefix_function(S)\r\nocc = [0] (N+1)\r\nfor i in range(N):\r\n occ[pi[i]] += 1\r\nfor i in reversed(range(1, N)):\r\n occ[pi[i-1]] += occ[i]\r\nfor i in range(N):\r\n occ[i] += 1\r\n\r\nans = []\r\n\r\nans.append((N, 1))\r\ncur = pi[-1]\r\nwhile cur > 0:\r\n ans.append((cur, occ[cur]))\r\n cur = pi[cur-1]\r\n\r\n\r\nprint(len(ans))\r\nfor item in reversed(ans):\r\n print(item[0], item[1])\r\n", "s=\" \"+input()\r\nn=len(s)\r\nnext,count,ans=[-1]n,[1]n,[]\r\nfor i in range(1,n):\r\n next[i] = next[i - 1] + 1\r\n while next[i] and s[next[i]]!=s[i]:\r\n next[i]=next[next[i]-1]+1\r\nfor i in range(n-1,1,-1):\r\n count[next[i]]+=count[i]\r\nn=n-1\r\nwhile n>0:\r\n ans.append(str(n)+' '+str(count[n]))\r\n n=next[n]\r\nprint(len(ans))\r\nans.reverse()\r\nprint(\"\\n\".join(ans))", "s = input()\r\nn = len(s)\r\nz = [0]n\r\nm = [0]n\r\nli = []\r\n\r\nl, r = 0, 0\r\n\r\nfor i in range(1,n):\r\n \r\n if i <= r:\r\n z[i] = min(r - i + 1, z[i - l])\r\n \r\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\r\n z[i] += 1\r\n \r\n if i + z[i] - 1 > r:\r\n l = i\r\n r = i + z[i] - 1\r\n \r\n if i + z[i] == n:\r\n li.append(z[i])\r\n \r\n m[z[i]] += 1\r\n\r\nfor i in range(n-2,0,-1):\r\n m[i] += m[i+1]\r\n \r\nprint(len(li) + 1)\r\n\r\nfor i in range(len(li) - 1, -1, -1):\r\n print(li[i], m[li[i]] + 1)\r\n\r\nprint(n,1)", "# ﷽\r\nfrom bisect import bisect_right\r\nfrom collections import deque\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef inlst():return [int(i) for i in input().slit()]\r\n\r\n\r\ndef z_function(S):\r\n \"\"\"\r\n Z Algorithm in O(n)\r\n :param S: text string to process\r\n :return: the Z array, where Z[i] = length of the longest common prefix of S[i:] and S\r\n \"\"\"\r\n\r\n n = len(S)\r\n Z = [0] * n\r\n l = r = 0\r\n\r\n for i in range(1, n):\r\n z = Z[i - l]\r\n if i + z >= r:\r\n z = max(r - i, 0)\r\n while i + z < n and S[z] == S[i + z]:\r\n z += 1\r\n\r\n l, r = i, i + z\r\n\r\n Z[i] = z\r\n\r\n Z[0] = n\r\n return Z\r\n\r\n\r\ndef solve():\r\n s=(input()) \r\n ans=deque()\r\n z=z_function(s)\r\n zz=sorted([i for i in z if i>0])\r\n n=len(zz)\r\n # print(zz)\r\n for i in range(len(s)):\r\n if z[-(i+1)]!=i+1:continue\r\n id=n-bisect_right(zz,i)\r\n # print(i,id)\r\n if id>0:\r\n ans.append((i+1,id))\r\n print(len(ans))\r\n for i in ans:\r\n print(i[0],i[1])\r\n \r\n \r\n # print(z)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "def get_char_map(chars):\r\n char_map = dict()\r\n for i, ch in enumerate(chars):\r\n char_map[ch] = i + 1\r\n return char_map\r\n\r\n\r\nclass HashTable:\r\n def __init__(self, base, mod, size):\r\n self.mul = [1]\r\n for _ in range(size):\r\n self.mul.append((self.mul[-1] * base) % mod)\r\n self.base = base\r\n self.mod = mod\r\n\r\n def build(self, arr):\r\n pre = [0]\r\n for c in arr:\r\n pre.append((pre[-1] * self.base + c) % self.mod)\r\n\r\n def get_hash(l, r):\r\n return (\r\n pre[r] - (pre[l] * self.mul[r - l]) % self.mod + self.mod\r\n ) % self.mod\r\n\r\n return get_hash\r\n\r\n\r\ndef solve():\r\n s = input()\r\n dp = [0] * len(s)\r\n arr = [0] * (len(s) + 1)\r\n ch = get_char_map(\"abcdefghijklmnopqrstuvwxyz\".upper())\r\n ht = HashTable(131, 109 + 7, 105)\r\n get_hash = ht.build([ch[c] for c in s])\r\n\r\n def binary_search(start, end):\r\n l = start\r\n r = end\r\n while l < r:\r\n m = (l + r) // 2\r\n if get_hash(start, m + 1) != get_hash(0, m + 1 - start):\r\n r = m\r\n else:\r\n l = m + 1\r\n return l\r\n\r\n for i, _ in enumerate(list(s)):\r\n idx = binary_search(i, len(s))\r\n dp[i] = idx\r\n arr[idx - i] += 1\r\n\r\n total = 0\r\n cur_len = len(s)\r\n res = []\r\n for i, v in enumerate(dp):\r\n if v == len(s):\r\n l = len(s) - i\r\n while cur_len >= l:\r\n total += arr[cur_len]\r\n cur_len -= 1\r\n res.append([l, total])\r\n\r\n print(len(res))\r\n print(\"\\n\".join([\" \".join(map(str, elm)) for elm in reversed(res)]))\r\n\r\n\r\nsolve()\r\n", "s=input()\r\nn=len(s)\r\npre=[0 for i in range(n)]\r\ni, l=1, 0\r\nd1={}\r\nwhile i<n:\r\n if s[i]==s[l]:\r\n l+=1\r\n pre[i]=l\r\n d1[l]=d1.get(l, 0)+1\r\n i+=1\r\n else:\r\n if l==0:\r\n pre[i]=0\r\n i+=1\r\n else:\r\n l=pre[l-1]\r\n\r\nfor i in range(n-1, 0, -1):\r\n if i in d1 and pre[i-1]>0:\r\n d1[pre[i-1]]+=d1[i]\r\nl1=[]\r\nz=[0 for i in range(n)]\r\nl=0\r\nr=0\r\nfor i in range(1, n):\r\n if (i <= r):\r\n z[i] = min (r - i + 1, z[i - l])\r\n while (i+z[i]<n and s[z[i]] == s[i + z[i]]):\r\n z[i]+=1\r\n if (i + z[i] - 1 > r):\r\n l = i\r\n r = i + z[i] - 1\r\n if z[i]+i==n:\r\n l1.append([z[i], d1.get(z[i], 0)])\r\nl1.sort()\r\nprint(len(l1)+1)\r\nfor i, j in l1:\r\n print(i, j+1)\r\nprint(n, 1)", "from sys import stdin\nfrom collections import defaultdict,Counter\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef prefix_function(s):\n prefix_function_vals = [0]len(s)\n\n for i in range(1,len(s)):\n prefix_len = prefix_function_vals[i-1]\n while prefix_len > 0 and s[i] != s[prefix_len]: prefix_len = prefix_function_vals[prefix_len-1]\n prefix_function_vals[i] = prefix_len + (s[i] == s[prefix_len])\n\n return [None]+prefix_function_vals\n\ndef main():\n s = rd(str)\n\n prefix_function_vals = prefix_function(s)\n prefix_function_val_counts = Counter(prefix_function_vals)\n neighbors = defaultdict(list)\n for i,prefix_function_val in enumerate(prefix_function_vals): neighbors[prefix_function_val].append(i)\n subtree_prefix_function_val_counts = {}\n\n dfs = [0]\n seen = set()\n\n while dfs:\n node = dfs[-1]\n\n if node not in seen:\n seen.add(node)\n for neighbor in neighbors[node]: dfs.append(neighbor)\n else:\n dfs.pop()\n subtree_prefix_function_val_counts[node] = prefix_function_val_counts[node] + sum(map(subtree_prefix_function_val_counts.__getitem__,neighbors[node]))\n\n ans = []\n cur_length = prefix_function_vals[len(s)]\n\n while cur_length != 0:\n ans.append([cur_length,subtree_prefix_function_val_counts[cur_length]+1])\n cur_length = prefix_function_vals[cur_length]\n\n print(len(ans)+1)\n\n for l,c in reversed(ans): print(l,c)\n\n print(len(s),1)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "s=input()\r\nn=len(s)\r\nif n==1:\r\n print('1\\n1 1\\n')\r\n exit()\r\np=[-1]n\r\nq=-1\r\nfor i in range(1,n):\r\n while q>=0 and s[i]!=s[q+1]:\r\n q=p[q]\r\n if s[i] == s[q + 1]:\r\n q+=1\r\n p[i]=q\r\n#print(p)\r\nc=[1]*n\r\nfor i in range(n-1,-1,-1):\r\n if p[i]>=0:\r\n c[p[i]]+=c[i]\r\n#print(c)\r\nans=[(n,1)]\r\nq=p[n-1]\r\nwhile q>=0:\r\n ans.append((q+1,c[q]))\r\n q=p[q]\r\nprint(len(ans))\r\nprint('\\n'.join([' '.join(map(str,x)) for x in reversed(ans)]))\r\n" ]	{"inputs": ["ABACABA", "AAA", "A", "AAAAAAAAAAAAAAAAXAAAAAAAAAAAAAAAAAAAAAAA", "AB", "AXAXA", "CODEFORCES", "GERALDPAVELGERALDPAVEL", "ZZ"], "outputs": ["3\n1 4\n3 2\n7 1", "3\n1 3\n2 2\n3 1", "1\n1 1", "17\n1 39\n2 37\n3 35\n4 33\n5 31\n6 29\n7 27\n8 25\n9 23\n10 21\n11 19\n12 17\n13 15\n14 13\n15 11\n16 9\n40 1", "1\n2 1", "3\n1 3\n3 2\n5 1", "1\n10 1", "2\n11 2\n22 1", "2\n1 2\n2 1"]}	UNKNOWN	PYTHON3	CODEFORCES	14
d15b551ae8fabd1bdc627749b5d8d626	Lucky String	Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya recently learned to determine whether a string of lowercase Latin letters is lucky. For each individual letter all its positions in the string are written out in the increasing order. This results in 26 lists of numbers; some of them can be empty. A string is considered lucky if and only if in each list the absolute difference of any two adjacent numbers is a lucky number. For example, let's consider string "zbcdzefdzc". The lists of positions of equal letters are: - b: 2- c: 3,<=10- d: 4,<=8- e: 6- f: 7- z: 1,<=5,<=9- Lists of positions of letters a, g, h, ..., y are empty. This string is lucky as all differences are lucky numbers. For letters z: 5<=-<=1<==<=4, 9<=-<=5<==<=4, for letters c: 10<=-<=3<==<=7, for letters d: 8<=-<=4<==<=4. Note that if some letter occurs only once in a string, it doesn't influence the string's luckiness after building the lists of positions of equal letters. The string where all the letters are distinct is considered lucky. Find the lexicographically minimal lucky string whose length equals n. The single line contains a positive integer n (1<=≤<=n<=≤<=105) — the length of the sought string. Print on the single line the lexicographically minimal lucky string whose length equals n. Sample Input 5 3 Sample Output abcda abc	[ "print(('abcd'100000)[:int(input())])", "n = int(input())\r\ns = \"abcd\"\r\ns1 = \"\"\r\n\r\nk = n // 4\r\n\r\ns1 += s k\r\n\r\nk = n % 4\r\ns1 += s[:k]\r\n\r\nprint(s1)\r\n", "print(('abcd'25001)[:int(input())])", "n=int(input())\ns=(n//4+1)\"abcd\"\nprint(s[:n])", "c,q= \"\",\"abcd\"\r\nn= int(input())\r\nfor i in range(n//4): c+=q\r\nc+= q[:n%4]\r\nprint(c)", "# LUOGU_RID: 126531339\nprint(('abcd'100000)[:int(input())])", "letters = \"abcd\"\r\nn = int(input())\r\nfor i in range(n):\r\n print(letters[i%4], end=\"\")\r\nprint()", "n=int(input())\r\n#print(n-4(n//4))\r\nprint('abcd'(n//4)+'abcd'[:n-4(n//4)])\r\n#print('abcd'[:2])\r\n" ]	{"inputs": ["5", "3", "8", "10", "16", "64", "128", "100", "47", "74", "477", "1000", "1024", "512", "747", "2075", "9475", "10000", "47589", "9999", "85475", "77777", "100000", "99994", "785", "1", "2", "7", "4", "99", "6", "9"], "outputs": ["abcda", "abc", "abcdabcd", "abcdabcdab", "abcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdab", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcda", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "a", "ab", "abcdabc", "abcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc", "abcdab", "abcdabcda"]}	UNKNOWN	PYTHON3	CODEFORCES	8
d15d1f4a8fbfb34fdfd3b6f396e66f1a	Find Pair	You've got another problem dealing with arrays. Let's consider an arbitrary sequence containing n (not necessarily different) integers a1, a2, ..., an. We are interested in all possible pairs of numbers (ai, aj), (1<=≤<=i,<=j<=≤<=n). In other words, let's consider all n2 pairs of numbers, picked from the given array. For example, in sequence a<==<={3,<=1,<=5} are 9 pairs of numbers: (3,<=3),<=(3,<=1),<=(3,<=5),<=(1,<=3),<=(1,<=1),<=(1,<=5),<=(5,<=3),<=(5,<=1),<=(5,<=5). Let's sort all resulting pairs lexicographically by non-decreasing. Let us remind you that pair (p1, q1) is lexicographically less than pair (p2, q2) only if either p1 < p2, or p1 = p2 and q1 < q2. Then the sequence, mentioned above, will be sorted like that: (1,<=1),<=(1,<=3),<=(1,<=5),<=(3,<=1),<=(3,<=3),<=(3,<=5),<=(5,<=1),<=(5,<=3),<=(5,<=5) Let's number all the pair in the sorted list from 1 to n2. Your task is formulated like this: you should find the k-th pair in the ordered list of all possible pairs of the array you've been given. The first line contains two integers n and k (1<=≤<=n<=≤<=105,<=1<=≤<=k<=≤<=n2). The second line contains the array containing n integers a1, a2, ..., an (<=-<=109<=≤<=ai<=≤<=109). The numbers in the array can coincide. All numbers are separated with spaces. Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout, streams or the %I64d specificator instead. In the single line print two numbers — the sought k-th pair. Sample Input 2 4 2 1 3 2 3 1 5 Sample Output 2 2 1 3	[ "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import \nfrom heapq import \nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,K = map(int,input().split())\nA = sorted(list(map(int,input().split())))\nk = (K+N-1)//N-1\ncnt = A.index(A[k])\nnum = A.count(A[cnt])\nprint(A[k],A[(K-(N*cnt)-1)//num])\n" ]	{"inputs": ["2 4\n2 1", "3 2\n3 1 5", "3 3\n1 1 2", "1 1\n-4", "3 7\n5 4 3", "3 6\n10 1 3", "4 12\n-1 -2 -3 -4", "5 10\n1 2 2 1 3", "5 13\n3 3 3 4 5", "8 26\n4 4 1 1 1 3 3 5", "10 90\n2 1 1 1 1 1 2 1 2 2", "10 6\n3 1 1 3 2 2 2 3 3 3", "10 18\n1 1 1 3 4 4 4 1 2 3", "50 622\n4 9 8 1 3 7 1 2 3 8 9 8 8 5 2 10 5 8 1 3 1 8 2 3 7 9 10 2 9 9 7 3 8 6 10 6 5 4 8 1 1 5 6 8 9 5 9 5 3 2", "50 2069\n9 97 15 22 69 27 7 23 84 73 74 60 94 43 98 13 4 63 49 7 31 93 23 6 75 32 63 49 32 99 43 68 48 16 54 20 38 40 65 34 28 21 55 79 50 2 18 22 95 25", "100 9043\n4 1 4 2 1 4 2 2 1 1 4 2 4 2 4 1 4 2 2 1 2 2 2 2 1 1 2 3 2 1 1 3 2 3 1 4 2 2 2 4 1 4 3 3 4 3 4 1 1 4 2 2 4 4 4 4 4 1 1 2 3 1 3 4 1 3 1 4 1 3 2 2 3 2 3 1 2 3 4 3 3 2 3 4 4 4 2 3 2 1 1 2 2 4 1 2 3 2 2 1", "100 4755\n5 4 3 5 1 2 5 1 1 3 5 4 4 1 1 1 1 5 4 4 5 1 5 5 1 2 1 3 1 5 1 3 3 3 2 2 2 1 1 5 1 3 4 1 1 3 2 5 2 2 5 5 4 4 1 3 4 3 3 4 5 3 3 3 1 2 1 4 2 4 4 1 5 1 3 5 5 5 5 3 4 4 3 1 2 5 2 3 5 4 2 4 5 3 2 4 2 4 3 1", "100 6819\n4 3 4 6 2 5 2 2 5 6 6 6 1 3 1 3 2 2 2 3 4 5 2 1 6 4 5 3 2 3 4 4 4 3 5 6 3 2 4 5 2 3 2 1 1 6 4 1 5 6 4 3 4 2 4 1 3 2 3 1 2 2 5 1 3 2 5 1 3 2 4 5 1 3 5 5 5 2 6 6 6 3 1 5 4 6 3 3 4 3 1 4 1 1 1 1 2 4 2 6", "10 50\n1 1 -9 -9 -9 7 7 7 7 7", "9 76\n1 1 2 2 2 2 3 3 9", "5 15\n1 1 1 2 2", "5 7\n1 3 3 3 5", "10 91\n1 1 1 1 1 1 1 1 1 2", "5 20\n1 2 2 3 3", "6 36\n1 1 2 2 2 2", "5 16\n1 1 2 2 3", "5 17\n1 3 3 5 5", "5 17\n1 3 3 3 5", "10 25\n1 2 2 3 4 5 6 7 8 9", "10 90\n1 1 1 1 1 1 1 1 1 2", "4 5\n3 1 3 1", "3 5\n1 1 2", "5 3\n0 1 2 3 4"], "outputs": ["2 2", "1 3", "1 1", "-4 -4", "5 3", "3 10", "-2 -1", "1 3", "3 5", "3 1", "2 2", "1 2", "1 2", "3 3", "75 28", "4 3", "3 3", "4 4", "1 7", "9 2", "1 2", "3 1", "2 1", "3 2", "2 2", "2 2", "5 1", "3 3", "2 7", "1 2", "1 3", "1 2", "0 2"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d16620d13a8ade89313bb0547f8d9d8d	none	Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler! However, there is no reason for disappointment, as Valery has found another ruler, its length is l centimeters. The ruler already has n marks, with which he can make measurements. We assume that the marks are numbered from 1 to n in the order they appear from the beginning of the ruler to its end. The first point coincides with the beginning of the ruler and represents the origin. The last mark coincides with the end of the ruler, at distance l from the origin. This ruler can be repesented by an increasing sequence a1,<=a2,<=...,<=an, where ai denotes the distance of the i-th mark from the origin (a1<==<=0, an<==<=l). Valery believes that with a ruler he can measure the distance of d centimeters, if there is a pair of integers i and j (1<=≤<=i<=≤<=j<=≤<=n), such that the distance between the i-th and the j-th mark is exactly equal to d (in other words, aj<=-<=ai<==<=d). Under the rules, the girls should be able to jump at least x centimeters, and the boys should be able to jump at least y (x<=<<=y) centimeters. To test the children's abilities, Valery needs a ruler to measure each of the distances x and y. Your task is to determine what is the minimum number of additional marks you need to add on the ruler so that they can be used to measure the distances x and y. Valery can add the marks at any integer non-negative distance from the origin not exceeding the length of the ruler. The first line contains four positive space-separated integers n, l, x, y (2<=≤<=n<=≤<=105, 2<=≤<=l<=≤<=109, 1<=≤<=x<=<<=y<=≤<=l) — the number of marks, the length of the ruler and the jump norms for girls and boys, correspondingly. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (0<==<=a1<=<<=a2<=<<=...<=<<=an<==<=l), where ai shows the distance from the i-th mark to the origin. In the first line print a single non-negative integer v — the minimum number of marks that you need to add on the ruler. In the second line print v space-separated integers p1,<=p2,<=...,<=pv (0<=≤<=pi<=≤<=l). Number pi means that the i-th mark should be at the distance of pi centimeters from the origin. Print the marks in any order. If there are multiple solutions, print any of them. Sample Input 3 250 185 230 0 185 250 4 250 185 230 0 20 185 250 2 300 185 230 0 300 Sample Output 1 230 0 2 185 230	[ "import itertools\nimport math\n\ndef can_measure(a, d):\n\treturn any(i + d in a for i in a)\n\ndef main():\n\tn, l, x, y = map(int, input().split())\n\ta = set(map(int, input().split()))\n\t\n\tcan_x = can_measure(a, x)\n\tcan_y = can_measure(a, y)\n\tif can_x and can_y:\n\t\tprint(0)\n\telif can_x:\n\t\tprint(1)\n\t\tprint(y)\n\telif can_y:\n\t\tprint(1)\n\t\tprint(x)\n\telse:\n\t\tfor i in a:\n\t\t\tif i + x + y in a:\n\t\t\t\tprint(1)\n\t\t\t\tprint(i + x)\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tt = i + x - y in a\n\t\t\t\tif 0 <= i + x <= l and t:\n\t\t\t\t\tprint(1)\n\t\t\t\t\tprint(i + x)\n\t\t\t\t\tbreak;\n\t\t\t\tif 0 <= i - y <= l and t:\n\t\t\t\t\tprint(1)\n\t\t\t\t\tprint(i - y)\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\telse:\n\t\t\tprint(2)\n\t\t\tprint(x, y)\n\t\t\n\nif __name__ == \"__main__\":\n\tmain()\n\n\n\n\n# Made By Mostafa_Khaled" ]	{"inputs": ["3 250 185 230\n0 185 250", "4 250 185 230\n0 20 185 250", "2 300 185 230\n0 300", "4 300 4 5\n0 6 7 300", "2 100 30 70\n0 100", "2 300 140 160\n0 300", "4 300 1 2\n0 298 299 300", "3 350 150 160\n0 310 350", "4 300 4 5\n0 298 299 300", "19 180 117 148\n0 1 19 20 21 28 57 65 68 70 78 88 100 116 154 157 173 179 180", "14 134 99 114\n0 6 8 19 50 61 69 83 84 96 111 114 125 134", "18 187 27 157\n0 17 18 31 36 37 40 53 73 86 96 107 119 150 167 181 184 187", "20 179 69 120\n0 6 8 11 21 24 55 61 83 84 96 111 114 116 125 140 147 154 176 179", "16 115 62 112\n0 5 24 32 38 43 44 57 62 72 74 92 103 105 113 115", "112 1867 1261 1606\n0 7 17 43 67 70 87 112 129 141 148 162 179 180 189 202 211 220 231 247 250 277 308 311 327 376 400 406 409 417 418 444 480 512 514 515 518 547 572 575 578 587 612 617 654 684 701 742 757 761 788 821 825 835 841 843 850 858 869 872 881 936 939 969 970 971 997 1026 1040 1045 1068 1070 1073 1076 1095 1110 1115 1154 1166 1178 1179 1203 1204 1225 1237 1241 1246 1275 1302 1305 1311 1312 1315 1338 1340 1419 1428 1560 1561 1576 1591 1594 1618 1643 1658 1660 1664 1689 1803 1822 1835 1867", "2 2 1 2\n0 2", "3 2 1 2\n0 1 2", "3 10 2 3\n0 1 10", "4 10 3 5\n0 1 9 10", "5 1000 777 778\n0 1 500 501 1000", "3 10 1 3\n0 2 10", "4 300 120 150\n0 110 140 300", "5 401 300 400\n0 100 250 350 401", "3 10 1 8\n0 7 10", "4 1000 2 3\n0 400 405 1000", "6 12 7 10\n0 1 3 4 6 12", "4 1000 10 20\n0 500 530 1000", "3 8 2 3\n0 7 8", "4 10 8 9\n0 4 5 10", "4 10 7 8\n0 5 6 10", "6 35 29 30\n0 10 11 31 32 35", "5 200000 1 100029\n0 100000 100009 100010 200000", "4 1000 900 901\n0 950 951 1000", "6 504 400 500\n0 3 5 103 105 504", "5 550 300 400\n0 151 251 450 550", "4 300 40 50\n0 280 290 300", "2 1000000000 100000000 500000000\n0 1000000000", "4 600 100 400\n0 50 350 600", "4 100 7 8\n0 3 4 100", "4 100 80 81\n0 2 3 100", "3 13 8 10\n0 2 13", "4 10 7 8\n0 4 5 10", "3 450 100 400\n0 150 450", "4 500 30 50\n0 20 40 500", "4 100 10 11\n0 4 5 100", "2 10 5 7\n0 10", "6 100 70 71\n0 50 51 90 91 100", "4 9 6 7\n0 4 5 9", "3 10 1 8\n0 3 10", "3 12 1 2\n0 10 12", "4 100 3 5\n0 40 48 100", "3 20 17 18\n0 19 20", "4 1000 45 46\n0 2 3 1000", "4 10 5 7\n0 4 6 10", "3 12 1 3\n0 10 12", "4 20 6 7\n0 1 15 20", "3 11 3 5\n0 9 11", "3 100 9 10\n0 99 100", "3 10 7 8\n0 1 10", "3 10 5 6\n0 9 10", "3 10 7 8\n0 9 10", "3 10 6 7\n0 9 10", "3 9 6 7\n0 1 9", "3 1000000000 99 100\n0 1 1000000000", "4 10 3 5\n0 2 4 10", "4 100 90 91\n0 7 8 100", "4 100 80 81\n0 98 99 100"], "outputs": ["1\n230", "0", "2\n185 230", "1\n11", "1\n30", "1\n140", "0", "1\n150", "1\n294", "2\n117 148", "1\n99", "1\n27", "1\n27", "1\n112", "1\n1808", "1\n1", "0", "1\n3", "1\n4", "1\n778", "1\n3", "1\n260", "1\n400", "1\n8", "1\n402", "1\n10", "1\n510", "1\n5", "2\n8 9", "2\n7 8", "1\n2", "1\n100029", "1\n50", "1\n503", "1\n150", "1\n240", "2\n100000000 500000000", "1\n450", "1\n11", "1\n83", "1\n10", "2\n7 8", "1\n50", "1\n50", "1\n15", "2\n5 7", "1\n20", "2\n6 7", "1\n2", "1\n1", "1\n43", "1\n2", "1\n48", "2\n5 7", "1\n9", "1\n7", "1\n6", "1\n90", "1\n8", "1\n4", "1\n2", "1\n3", "1\n7", "1\n100", "1\n5", "1\n98", "1\n18"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d172ac41a846604f1c877ea449cf1b55	Buy Low Sell High	You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or do nothing. Initially you own zero shares, and you cannot sell shares when you don't own any. At the end of the N days you would like to again own zero shares, but want to have as much money as possible. Input begins with an integer N (2<=≤<=N<=≤<=3·105), the number of days. Following this is a line with exactly N integers p1,<=p2,<=...,<=pN (1<=≤<=pi<=≤<=106). The price of one share of stock on the i-th day is given by pi. Print the maximum amount of money you can end up with at the end of N days. Sample Input 9 10 5 4 7 9 12 6 2 10 20 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 Sample Output 20 41	[ "\n\nfrom heapq import \nn=int(input())\np=list(map(int,input().split()))\nans=0\nhp=[]\nfor i in range(n):\n if hp and hp[0]<p[i]:\n ans+=p[i]-hp[0]\n heappop(hp)\n heappush(hp,p[i])\n heappush(hp,p[i])\n else:heappush(hp,p[i])\n\nprint(ans)\n\n\n", "import sys\nfrom heapq import heappop, heappush\ninput = sys.stdin.readline\nn = int(input())\np = map(int, input().split())\nans = 0\nQ = []\nfor v in p:\n if Q:\n x = Q[0]\n if v > x:\n ans += v-x\n heappop(Q)\n heappush(Q, v)\n heappush(Q, v)\nprint(ans)", "import sys\r\ninput = sys.stdin.buffer.readline\r\nfrom heapq import heappush, heapreplace\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nheap = []\r\nprofit = 0\r\n\r\nfor i in a:\r\n mn = heap[0] if heap else 1e9\r\n\r\n if mn < i:\r\n profit += i-mn\r\n heapreplace(heap, i)\r\n\r\n heappush(heap, i)\r\n\r\nprint(profit)", "from heapq import \r\ninput()\r\ns, h = 0, []\r\nfor v in map(int, input().split()):\r\n heappush(h, v)\r\n if h[0] < v: s += v - heapreplace(h, v)\r\nprint(s)", "from heapq import heappush,heappop\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\nunsed=[]\r\nselled=[]\r\nsm=0\r\nfor x in ar:\r\n U,S=len(unsed),len(selled)\r\n u=heappop(unsed) if U else float('inf')\r\n s=heappop(selled) if S else float('inf')\r\n y=min(u,s)\r\n if(y<x):\r\n if(u==y):\r\n sm+=x-y\r\n if(S):heappush(selled,s)\r\n heappush(selled,x)\r\n else:\r\n sm+=x-y\r\n heappush(unsed,y)\r\n if(U):heappush(unsed,u)\r\n heappush(selled,x)\r\n else:\r\n if(S):heappush(selled,s)\r\n if(U):heappush(unsed,u)\r\n heappush(unsed,x)\r\nprint(sm)\r\n", "import heapq\r\n\r\ndef problemC():\r\n N = int(input())\r\n prices = [int(p) for p in input().split()]\r\n res = 0\r\n sell_options = []\r\n for p in prices:\r\n if not(len(sell_options) == 0 or sell_options[0][0] >= p):\r\n sell_price, bought = heapq.heappop(sell_options)\r\n res += p - sell_price\r\n heapq.heappush(sell_options, (p, True))\r\n if bought:\r\n heapq.heappush(sell_options, (sell_price, False))\r\n else:\r\n heapq.heappush(sell_options, (p, False))\r\n print(res)\r\n\r\nproblemC()", "import heapq\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nhp = []\r\n\r\nfor it in arr:\r\n heapq.heappush(hp, it)\r\n if hp and hp[0] < it:\r\n ans += it - hp[0]\r\n heapq.heappop(hp)\r\n heapq.heappush(hp, it)\r\n\r\nprint(ans)\r\n", "import heapq as hq\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nq = []\r\nfor i in range(n):\r\n if q:\r\n x = hq.heappop(q)\r\n if x < a[i]:\r\n ans += a[i]-x\r\n hq.heappush(q,a[i])\r\n else:\r\n hq.heappush(q,x)\r\n hq.heappush(q,a[i])\r\nprint(ans)", "import heapq as hq\n\nn = int(input())\n\np = list(map(int, input().split()))\n \nheap = []\n\nans = 0\n\nfor i in range(n):\n if heap and p[i] > heap[0]:\n ans += p[i]-heap[0]\n hq.heappop(heap)\n hq.heappush(heap, p[i])\n hq.heappush(heap, p[i])\n\nprint(ans)", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nimport heapq\r\nq = []\r\n\r\nans = 0\r\nfor i in range(n):\r\n heapq.heappush(q, a[i])\r\n if not q or q[0] >= a[i]:\r\n continue\r\n else:\r\n T = heapq.heappop(q)\r\n ans += a[i] - T\r\n heapq.heappush(q, a[i])\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nimport heapq\r\n\r\nN=int(input())\r\nP=list(map(int,input().split()))\r\n\r\nANS=[0]N\r\nQ=[]\r\n\r\nfor i in range(N):\r\n #print(ANS)\r\n p=P[i]\r\n if len(Q)==0:\r\n heapq.heappush(Q,(p,i))\r\n continue\r\n else:\r\n x,ind=heapq.heappop(Q)\r\n\r\n if x<p:\r\n ANS[ind]-=1\r\n ANS[i]+=1\r\n heapq.heappush(Q,(p,i))\r\n heapq.heappush(Q,(p,i))\r\n else:\r\n heapq.heappush(Q,(x,ind))\r\n heapq.heappush(Q,(p,i))\r\n\r\nLANS=0\r\nfor i in range(N):\r\n LANS+=P[i]ANS[i]\r\n\r\nprint(LANS)\r\n \r\n", "from heapq import \r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nhp=[]\r\nans=0\r\nfor i in range(n):\r\n heappush(hp,a[i])\r\n if (hp[0]< a[i]):\r\n ans += a[i] - hp[0]\r\n heappop(hp)\r\n heappush(hp,a[i])\r\n\r\nprint(ans)\r\n", "# LUOGU_RID: 112325654\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MI():\r\n return map(int, input().split())\r\ndef LI():\r\n return list(input().split())\r\ndef LII():\r\n return list(map(int, input().split()))\r\ndef GMI():\r\n return map(lambda x: int(x)-1,input().split())\r\nimport heapq\r\ndef solve():\r\n n = II()\r\n nums = LII()\r\n res = 0\r\n pq = []\r\n for i in range(n):\r\n heapq.heappush(pq, nums[i])\r\n heapq.heappush(pq, nums[i])\r\n res += nums[i] - heapq.heappop(pq)\r\n print(res)\r\nsolve()\r\n", "from heapq import\ninput()\ns,h=0,[]\nfor v in map(int,input().split()):\n\theappush(h,v)\n\tif v>h[0]:s+=v-heapreplace(h,v)\nprint(s)\n \t \t \t \t \t\t\t\t \t\t\t\t\t \t \t \t\t\t", "import sys\r\nimport heapq\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ndef fgh():\r\n return [int(xx) for xx in input().split()]\r\ndef fg():\r\n return int(input())\r\nn = fg()\r\na = fgh()\r\nans = 0\r\nh = [a[0]]\r\nfor i in range(1, n):\r\n if h[0] < a[i]:\r\n ans += a[i] - heapq.heappop(h)\r\n heapq.heappush(h, a[i])\r\n heapq.heappush(h, a[i])\r\n else:\r\n heapq.heappush(h, a[i])\r\nprint(ans)\r\n", "from heapq import*\r\ninput()\r\ns,h=0,[]\r\nfor v in map(int,input().split()):\r\n\theappush(h,v)\r\n\tif v>h[0]:s+=v-heapreplace(h,v)\r\nprint(s)" ]	{"inputs": ["9\n10 5 4 7 9 12 6 2 10", "20\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4", "20\n9 29 8 9 13 4 14 27 16 11 27 14 4 29 23 17 3 9 30 19", "100\n411 642 560 340 276 440 515 519 182 314 35 227 390 136 97 5 502 584 567 79 543 444 413 463 455 316 545 329 437 443 9 435 291 384 328 501 603 234 285 297 453 587 550 72 130 163 282 298 605 349 270 198 24 179 243 92 115 56 83 26 3 456 622 325 366 360 299 153 140 552 216 117 61 307 278 189 496 562 38 527 566 503 303 16 36 286 632 196 395 452 194 77 321 615 356 250 381 174 139 123", "20\n499559 302871 194704 903169 447219 409938 42087 753609 589270 719332 855199 609182 315644 980473 966759 851389 900793 905536 258772 453222", "47\n403136 169462 358897 935260 150614 688938 111490 148144 462915 753991 551831 303917 772190 188564 854800 7094 491120 997932 271873 236736 797113 427200 681780 911765 217707 339475 313125 56785 749677 313468 902148 993064 747609 387815 768631 41886 68862 707668 32853 653517 941150 858711 562604 867235 840369 337814 129019", "2\n4 77"], "outputs": ["20", "41", "147", "13765", "4620235", "12525965", "73"]}	UNKNOWN	PYTHON3	CODEFORCES	16
d175d48a79770638f1ab5c9a7b472225	Broken Monitor	Innocentius has a problem — his computer monitor has broken. Now some of the pixels are "dead", that is, they are always black. As consequence, Innocentius can't play the usual computer games. He is recently playing the following game with his younger brother Polycarpus. Innocentius is touch-typing a program that paints a white square one-pixel wide frame on the black screen. As the monitor is broken, some pixels that should be white remain black. Polycarpus should look at what the program displayed on the screen and guess the position and size of the frame Innocentius has painted. Polycarpus doesn't like the game but Innocentius persuaded brother to play as "the game is good for the imagination and attention". Help Polycarpus, automatize his part in the gaming process. Write the code that finds such possible square frame that: - the frame's width is 1 pixel, - the frame doesn't go beyond the borders of the screen, - all white pixels of the monitor are located on the frame, - of all frames that satisfy the previous three conditions, the required frame must have the smallest size. Formally, a square frame is represented by such pixels of the solid square, that are on the square's border, that is, are not fully surrounded by the other pixels of the square. For example, if the frame's size is d<==<=3, then it consists of 8 pixels, if its size is d<==<=2, then it contains 4 pixels and if d<==<=1, then the frame is reduced to a single pixel. The first line contains the resolution of the monitor as a pair of integers n, m (1<=≤<=n,<=m<=≤<=2000). The next n lines contain exactly m characters each — the state of the monitor pixels at the moment of the game. Character "." (period, ASCII code 46) corresponds to the black pixel, and character "w" (lowercase English letter w) corresponds to the white pixel. It is guaranteed that at least one pixel of the monitor is white. Print the monitor screen. Represent the sought frame by characters "+" (the "plus" character). The pixels that has become white during the game mustn't be changed. Print them as "w". If there are multiple possible ways to position the frame of the minimum size, print any of them. If the required frame doesn't exist, then print a single line containing number -1. Sample Input 4 8 ..w..w.. ........ ........ ..w..w.. 5 6 ...... .w.... ...... ..w... ...... 2 4 .... .w.. 2 6 w..w.w ...w.. Sample Output ..w++w.. ..+..+.. ..+..+.. ..w++w.. ...... +w+... +.+... ++w... ...... .... .w.. -1	[ "from itertools import chain\ndef draw_square(ans, square_a, ymin, xmin) -> list:\n for i in range(square_a + 1):\n if(ans[ymin][xmin + i] != 'w'):\n ans[ymin] = ans[ymin][:xmin + i] + '+' + ans[ymin][xmin + i + 1:]\n if(ans[ymin + square_a][xmin + i] != 'w'):\n ans[ymin + square_a] = ans[ymin + square_a][:xmin + i] + '+' + ans[ymin + square_a][xmin + i + 1:]\n if(ans[ymin + i][xmin] != 'w'):\n ans[ymin + i] = ans[ymin + i][:xmin] + '+' + ans[ymin + i][xmin + 1:]\n if(ans[ymin + i][xmin + square_a] != 'w'):\n ans[ymin + i] = ans[ymin + i][:xmin + square_a] + '+' + ans[ymin + i][xmin + square_a + 1:]\n return ans\n\ndef find_a(pixel, y, x) -> tuple:\n ymax = xmax = 0\n ymin, xmin = y, x\n ymaxl, yminl, xmaxl, xminl = [], [], [], []\n count_pixel = len(pixel) // 2\n for i in range(count_pixel):\n if(ymax < pixel[2 * i]):\n ymax = pixel[2 * i]\n if(ymin > pixel[2 * i]):\n ymin = pixel[2 * i]\n if(xmax < pixel[2 * i + 1]):\n xmax = pixel[2 * i + 1]\n if(xmin > pixel[2 * i + 1]):\n xmin = pixel[2 * i + 1]\n for i in range(count_pixel):\n f = True\n if(pixel[2 * i] == ymax):\n f = False\n ymaxl.append(pixel[2 * i])\n ymaxl.append(pixel[2 * i + 1])\n if(pixel[2 * i] == ymin):\n f = False\n yminl.append(pixel[2 * i])\n yminl.append(pixel[2 * i + 1])\n if(pixel[2 * i + 1] == xmax):\n f = False\n xmaxl.append(pixel[2 * i])\n xmaxl.append(pixel[2 * i + 1])\n if(pixel[2 * i + 1] == xmin):\n f = False\n xminl.append(pixel[2 * i])\n xminl.append(pixel[2 * i + 1])\n if(f):\n print('-1')\n exit()\n return ymax, ymin, xmax, xmin, ymaxl, yminl, xmaxl, xminl\n\nif __name__ == '__main__':\n y, x = map(int, input().split())\n scr = []\n for i in range(y):\n scr.append(input())\n pixel = []\n for i in range(y):\n for j in range(x):\n if(scr[i][j] == 'w'):\n pixel.append(i)\n pixel.append(j)\n ymax, ymin, xmax, xmin, ymaxl, yminl, xmaxl, xminl = find_a(pixel, y, x)\n count_ymax, count_ymin, count_xmax, count_xmin = len(ymaxl)/2, len(yminl)/2, len(xmaxl)/2, len(xminl)/2\n countx_ymax = ymaxl[1::2].count(xmax) + ymaxl[1::2].count(xmin)\n countx_ymin = yminl[1::2].count(xmax) + yminl[1::2].count(xmin)\n county_xmax = xmaxl[::2].count(ymax) + xmaxl[::2].count(ymin)\n county_xmin = xminl[::2].count(ymax) + xminl[::2].count(ymin)\n if(ymax - ymin > xmax - xmin):\n square_a = ymax - ymin\n if(county_xmax < count_xmax and county_xmin < count_xmin):\n if(xmax == xmin):\n if(xmin + square_a < x):\n xmax = xmin + square_a\n elif(xmax - square_a >= 0):\n xmin = xmax - square_a\n else:\n print('-1')\n exit()\n else:\n print('-1')\n exit()\n elif(county_xmax < count_xmax and county_xmin == count_xmin):\n xmin = xmax - square_a\n if(xmin < 0):\n print('-1')\n exit()\n elif(county_xmax == count_xmax and county_xmin < count_xmin):\n xmax = xmin + square_a\n if(xmax >= x):\n print('-1')\n exit()\n elif(county_xmax == count_xmax and county_xmin == count_xmin):\n if(square_a < x):\n if(xmin + square_a < x):\n xmax = xmin + square_a\n elif(xmax - square_a >= 0):\n xmin = xmax - square_a\n else:\n xmin = 0\n xmax = xmin + square_a\n else:\n print('-1')\n exit()\n elif(ymax - ymin < xmax - xmin):\n square_a = xmax - xmin\n if(countx_ymax < count_ymax and countx_ymin < count_ymin):\n if(ymax == ymin):\n if(ymin + square_a < y):\n ymax = ymin + square_a\n elif(ymax - square_a >= 0):\n ymin = ymax - square_a\n else:\n print('-1')\n exit()\n else:\n print('-1')\n exit()\n elif(countx_ymax < count_ymax and countx_ymin == count_ymin):\n ymin = ymax - square_a\n if(ymin < 0):\n print('-1')\n exit()\n elif(countx_ymax == count_ymax and countx_ymin < count_ymin):\n ymax = ymin + square_a\n if(ymax >= y):\n print('-1')\n exit()\n elif(countx_ymax == count_ymax and countx_ymin == count_ymin):\n if(square_a < y):\n if(ymin + square_a < y):\n ymax = ymin + square_a\n elif(ymax - square_a >= 0):\n ymin = ymax -square_a\n else:\n ymin = 0\n ymax = ymin + square_a\n else:\n print('-1')\n exit()\n elif(ymax - ymin == xmax - xmin):\n square_a = xmax - xmin\n ans = draw_square(scr, square_a, ymin, xmin)\n for i in range(y):\n print(ans[i])\n\t \t\t \t\t\t \t\t \t \t \t\t\t \t \t \t\t\t\t\t\t" ]	{"inputs": ["4 8\n..w..w..\n........\n........\n..w..w..", "2 4\n....\n.w..", "2 6\nw..w.w\n...w..", "9 4\n....\n....\n....\n....\n....\n..w.\n....\n....\n.w..", "1 1\nw", "2 1\nw\n.", "2 1\nw\nw", "1 2\nww", "2 2\nww\n..", "2 2\n.w\n.w", "2 2\n..\nww", "2 2\nw.\nw.", "2 2\nw.\n.w", "2 2\n..\nw.", "3 3\n...\n..w\nw..", "1 7\nw.....w", "6 9\n.w.......\n.........\n.........\n.........\n.w.......\n......w..", "6 9\n...ww....\n.........\n.........\n.........\n.........\n......w..", "6 9\n.......w.\n.........\n.........\n.........\n.........\n......w..", "5 4\n....\nw...\n...w\n.w..\n..w.", "5 4\nwwww\nwwww\nwwww\nwwww\nwwww", "5 4\n..w.\n..ww\n.www\n.w..\nwwww", "5 4\nwwww\nw..w\nwwww\n.www\n..ww", "8 16\n................\n................\n................\n................\n............w...\n................\n................\n..............w.", "1 2\n.w", "2 2\n.w\n..", "5 2\n..\n.w\nww\n..\n..", "6 2\nw.\n..\n..\n..\n..\n..", "3 2\n..\n.w\n..", "4 2\nw.\n..\n..\n..", "2 1\n.\nw", "6 1\n.\n.\nw\n.\n.\n.", "1 3\n..w", "4 1\n.\nw\n.\n.", "6 2\n..\n.w\n..\n..\n..\n..", "2 1\nw\n.", "5 1\n.\n.\n.\nw\n.", "1 5\n....w", "6 1\nw\n.\n.\n.\n.\n.", "2 1\nw\n.", "1 3\n.w.", "4 1\n.\n.\n.\nw", "4 2\n..\nw.\n.w\n..", "2 2\n..\nw.", "4 2\n..\n..\nw.\n..", "1 6\n.....w", "3 4\nw...\n..w.\n.ww.", "5 2\n..\n..\n..\n..\nw.", "2 2\n..\nw.", "2 1\nw\n.", "4 1\n.\n.\nw\n.", "3 3\n...\n...\n.w.", "6 1\n.\nw\n.\n.\n.\n.", "2 1\n.\nw", "1 3\n..w", "3 1\n.\n.\nw", "6 1\n.\n.\n.\n.\n.\nw", "6 3\n...\n...\n...\n...\n...\n.w."], "outputs": ["..w++w..\n..+..+..\n..+..+..\n..w++w..", "....\n.w..", "-1", "....\n....\n....\n....\n....\n++w+\n+..+\n+..+\n+w++", "w", "w\n.", "-1", "-1", "ww\n++", "+w\n+w", "++\nww", "w+\nw+", "w+\n+w", "..\nw.", "+++\n+.w\nw++", "-1", ".w+++++..\n.+....+..\n.+....+..\n.+....+..\n.w....+..\n.+++++w..", "...ww++++\n...+....+\n...+....+\n...+....+\n...+....+\n...+++w++", "..+++++w.\n..+....+.\n..+....+.\n..+....+.\n..+....+.\n..++++w+.", "-1", "-1", "-1", "-1", "................\n................\n................\n................\n............w+++\n............+..+\n............+..+\n............++w+", ".w", ".w\n..", "..\n+w\nww\n..\n..", "w.\n..\n..\n..\n..\n..", "..\n.w\n..", "w.\n..\n..\n..", ".\nw", ".\n.\nw\n.\n.\n.", "..w", ".\nw\n.\n.", "..\n.w\n..\n..\n..\n..", "w\n.", ".\n.\n.\nw\n.", "....w", "w\n.\n.\n.\n.\n.", "w\n.", ".w.", ".\n.\n.\nw", "..\nw+\n+w\n..", "..\nw.", "..\n..\nw.\n..", ".....w", "w++.\n+.w.\n+ww.", "..\n..\n..\n..\nw.", "..\nw.", "w\n.", ".\n.\nw\n.", "...\n...\n.w.", ".\nw\n.\n.\n.\n.", ".\nw", "..w", ".\n.\nw", ".\n.\n.\n.\n.\nw", "...\n...\n...\n...\n...\n.w."]}	UNKNOWN	PYTHON3	CODEFORCES	1
d184fb3f320d8dcb999611f7b0d120ec	none	Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are n lanes of m desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to n from the left to the right, the desks in a lane are numbered from 1 to m starting from the blackboard. Note that the lanes go perpendicularly to the blackboard, not along it (see picture). The organizers numbered all the working places from 1 to 2nm. The places are numbered by lanes (i. e. all the places of the first lane go first, then all the places of the second lane, and so on), in a lane the places are numbered starting from the nearest to the blackboard (i. e. from the first desk in the lane), at each desk, the place on the left is numbered before the place on the right. Santa Clause knows that his place has number k. Help him to determine at which lane at which desk he should sit, and whether his place is on the left or on the right! The only line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=10<=000, 1<=≤<=k<=≤<=2nm) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place. Print two integers: the number of lane r, the number of desk d, and a character s, which stands for the side of the desk Santa Claus. The character s should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right. Sample Input 4 3 9 4 3 24 2 4 4 Sample Output 2 2 L 4 3 R 1 2 R	[ "ins = list(map(int, input().split()))\r\nn = ins[0]\r\nm = ins[1]\r\nk = ins[2]\r\nkoln = 1\r\nkolm = 1\r\nwhile k > 2m:\r\n k -= 2m\r\n koln+=1\r\nwhile k > 2:\r\n k-=2\r\n kolm += 1\r\nif k == 1:\r\n print(koln,kolm,\"L\")\r\nelse:\r\n print(koln, kolm, \"R\")", "n,m,k = map(int,input().split())\r\na,b,c = 0,0,0\r\nif(k%2==1):\r\n c = 'L'\r\nif(k%2==0):\r\n c = 'R'\r\nfor i in range(1,n+1):\r\n if(2im>=k):\r\n a = i\r\n break\r\ntot = am2\r\nb = m - int((tot - k)//2)\r\n\r\nprint(a,b,c)\r\n\"\"\"\r\nk = 24\r\na = 4\r\nb = ((24-6)%(332))+1 = 18%18 \r\n\"\"\"", "\"\"\"task a.\"\"\"\r\nimport math\r\n\r\nstr = input()\r\nnumber_strings = str.split(\" \")\r\n[n, m, k] = [int(n) for n in number_strings]\r\n\r\ns = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nd = math.ceil((k / 2)) % m\r\nd = m if d == 0 else d\r\n\r\nr = math.ceil(k / (m * 2))\r\n\r\nprint(\" \", r, d, s)\r\n", "n,m,k=map(int,input().split())\nx=k\nprint((k-1)//(m2)+1,end=' ')\nk=(k-1)%(m2)\nprint(k//2+1,end=\" \")\nif x%2==0:\n\tprint(\"R\")\nelse:\n\tprint(\"L\")\n", "\r\ninp = str(input());\r\ns = ''\r\nfor s in inp:\r\n s = inp.split(' ')\r\n\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\n\r\ni = 0\r\nr = 1\r\nd = 1;\r\np = 0\r\n\r\nwhile(k > 2 * m * r):\r\n p = 2 * m * r\r\n r += 1;\r\n\r\n\r\n\r\nwhile(k > p):\r\n p += 1\r\n if (i == 2): i = 0; d += 1;\r\n i += 1\r\n\r\nif(k % 2 == 0):\r\n print(r,d,'R')\r\nelse:print(r,d,'L')\r\n\r\n\r\n", "q,w,e=map(int,input().split())\r\nif e%2==1:\r\n c='L'\r\nelse:\r\n c='R'\r\ne=(e+1)//2\r\nx=e%w\r\nif x==0:\r\n x=w\r\nif e%w==0:\r\n z=e//w\r\nelse:\r\n z=e//w+1\r\nprint(z,x,c)\r\n", "n, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n p = k // 2\r\nelse:\r\n p = k // 2 + 1\r\nif p % m == 0:\r\n r = p // m\r\nelse:\r\n r = p // m + 1\r\np %= m\r\nif p == 0:\r\n p = m\r\nif k % 2 != 0:\r\n lr = 'L'\r\nelse:\r\n lr = 'R'\r\nprint(r, p, lr)", "n, m, k = map(int, input().split())\r\nx = int((k - 1) / 2)\r\nprint(int(x / m) + 1, x % m + 1, end=' ')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')", "n, m, k = map(int, input().split())\n\nfor i in range(1, n + 1):\n if k % 2 == 0:\n j = k // 2 - m * (i - 1)\n if 1 <= j and j <= m:\n print(\"{} {} R\".format(i, j))\n exit()\n else:\n j = (k + 1) // 2 - m * (i - 1)\n if 1 <= j and j <= m:\n print(\"{} {} L\".format(i, j))\n exit()\n", "a=input().split()\r\nif int(a[2])%2==0:\r\n s='R'\r\nelse:\r\n s='L'\r\nk=0\r\nif int(a[2])%(int(a[1])2)>0:\r\n k+=1\r\nr=int(a[2])%(int(a[1])2)//2+int(a[2])%(int(a[1])2)%2\r\nif r==0:\r\n r=a[1]\r\nprint(int(a[2])//(int(a[1])2)+k)\r\nprint(r)\r\nprint(s)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) % (2 * m) + 2) // 2\r\ns = \"L\" if k % 2 else \"R\"\r\nprint(r, d, s)", "n, m, k = map(int, input().split())\r\n\r\nif k&1:\r\n lr = \"L\"\r\nelse:\r\n lr = \"R\" \r\n \r\nk -= 1 \r\nk //= 2\r\n\r\nprint(k // m + 1, k % m + 1, lr)", "n, m, k = map(int, input().split())\r\nr = k // (2 * m) + int(k % (2 * m) != 0)\r\nif k % (2 * m) == 0:\r\n print(r, m, 'R')\r\nelse:\r\n mod = k % (2 * m)\r\n d = mod // 2 + int(mod % 2 != 0)\r\n if mod % 2 == 0:\r\n print(r, d, 'R')\r\n else:\r\n print(r, d, 'L')\r\n", "n, m, k = [int(i) for i in input().split()]\r\n\r\nc = 'R' if (k % 2 == 0) else 'L'\r\nk -= (k % 2 == 0)\r\n\r\nl = 1 + k // (2 * m)\r\nd = 1 + (k % (2 * m) // 2)\r\n\r\nprint(l, d, c)", "n,m,k = [int(x) for x in input().split(\" \")];\r\nif k %2 == 0:\r\n k /=2;\r\n s = 'R';\r\nelse:\r\n k //= 2;\r\n k += 1;\r\n s = 'L';\r\nif k%m == 0:\r\n a = m;\r\nelse:\r\n a = k%m;\r\nif k%m == 0:\r\n b = k/m;\r\nelse:\r\n b = k//m;\r\n b += 1;\r\nprint(str(int(b)) + \" \" + str(int(a)) + \" \" + s);\r\n", "from math import ceil\r\nn,m,k=map(int,input().split())\r\nh=ceil(k/(2m))\r\ny=((k-((2(h-1)m)+1))//2)+1\r\nif k%2!=0:\r\n print(h,y,\"L\")\r\nelse:\r\n print(h,y,\"R\")", "import math, sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\nn, m, x = map(int, fin.readline().split())\r\nr = math.ceil(x / (m 2))\r\nd = math.ceil((x - ((r - 1) * (m * 2))) / 2)\r\ns = ''\r\nif x % 2 == 1:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nfout.write(str(r) + ' ' + str(d) + ' ' + str(s))\r\n", "n , m , k = map(int , input().split())\r\nres = m * 2\r\nindex =0\r\nindex2 = 0\r\ns = \"\"\r\nfor i in range(1,n+1):\r\n if k<= resi:\r\n index = i\r\n break\r\nif k%2 == 1 :\r\n index2 = abs((k - (indexres)-1)/ 2)\r\n index3 = abs(index2-1- m)\r\n s = 'L'\r\nelif k%2 == 0:\r\n index2 = abs((k - (index * res)) / 2)\r\n index3 = abs(index2 - m)\r\n s = 'R'\r\n\r\nprint(str(index)+\" \"+str(int(index3))+\" \"+s)", "n, m, k = list(map(int, input().split()))\r\nx = (k-1)//(m2) + 1\r\ny = ((k % (m2)) + 1)//2\r\nif y == 0:\r\n y = m\r\nprint(x, y, end=' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "from math import ceil\r\nn,m,k = [int(item) for item in input().split()]\r\n\r\nr = k % (2 * m)\r\n\r\nif r == 0:\r\n line = k // (2 * m)\r\n desk = m\r\n if k % 2 == 0:\r\n side = \"R\"\r\n else:\r\n side = \"L\"\r\nelse:\r\n line = k // (2 * m) + 1\r\n desk = ceil(r / 2)\r\n if k % 2 == 0:\r\n side = \"R\"\r\n else:\r\n side = \"L\"\r\n \r\nprint(line,desk,side)", "n,m,k=map(int,input().split())\r\nc=(k-1)//2\r\nn=c//m+1\r\nm=c%m+1\r\nif k%2==0:\r\n print(n,m,'R')\r\nelse:\r\n print(n,m,'L')\r\n", "# import math\nfrom collections import Counter, deque, defaultdict\nfrom math import \n\nfrom bisect import bisect_right\nmod = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\ndef isPrime(n):\n if n==1:\n return True\n if n==2 or n==3:\n return True\n if (n%2==0 or n%3==0):\n return False\n i=5\n while ii<=n:\n if n%i==0 or n%(i+2)==0:\n return False\n i+=6\n return True\n\ndef solve():\n n,m,k=map(int,input().split())\n cur=0\n lane=0\n while cur<k:\n cur+=m2\n lane+=1\n cur=lanem2\n desk=m\n for i in range(m):\n if cur==k:\n print(lane,desk,'R')\n return\n elif cur-1==k:\n print(lane,desk,'L')\n return\n desk-=1\n cur-=2\n\n\n\n\n\n\n\n\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n \t \t\t \t \t \t \t\t \t \t\t\t \t\t \t", "n,m,k=map(int,input().split())\r\n\r\nside=''\r\nrow=(k-1)//(m2)+1\r\nplace=((k-1)%(m2))//2+1\r\n\r\nif (k%2==0): side='R'\r\nelse: side='L'\r\n\r\nprint(row,place,side)", "import sys\r\nfrom math import ceil\r\n\r\ndef main():\r\n n, m, k = map(int, sys.stdin.read().strip().split())\r\n r = int(ceil(k/(2m)))\r\n p = int(ceil(k%(2m)/2) or m)\r\n return r, p, 'RL'[k%2]\r\n \r\n\r\nprint(main())\r\n", "import math\r\nn , m , k = map(int,input().strip().split())\r\na3 = \"R\"\r\nif k % 2 != 0:\r\n k += 1\r\n a3 = \"L\"\r\na1 = math.ceil((k//2)/m)\r\na2 = int((k%(m2))/2)\r\nif a2 == 0:\r\n a2 = m\r\nelse:\r\n a2 = a2\r\nprint(a1,a2,a3)\r\n", "n, m, k = [int(s) for s in input().split(\" \")]\r\ntot = 2m\r\nlane = k//tot\r\ndesk = k%tot\r\nif desk:\r\n if k&1:\r\n print(lane+1, (desk+1)//2, \"L\")\r\n else:\r\n print(lane+1, (desk+1)//2, \"R\")\r\nelse:\r\n if k&1:\r\n print(lane, m, \"L\")\r\n else:\r\n print(lane, m, \"R\")", "n,m,k=map(int,input().split())\r\nimport math\r\nl=math.ceil(k/(m2))\r\nif k%(m2)==0:\r\n d=m\r\nelse:\r\n d=math.ceil((k%(m2))/2)\r\nif k%2==0:\r\n p='R'\r\nelse:\r\n p='L'\r\nprint(l,d,p)", "a = list (map (int, input ().split ()));\r\nif (a [2] % 2 == 0) : direct = \"R\"\r\nelse : direct = \"L\";\r\nmin_pos = 1;\r\nmax_pos = 0;\r\nres1 = 0;\r\nwhile (max_pos < a [2]) :\r\n max_pos += a [1] 2;\r\n res1 += 1;\r\n if (res1 > 1) : min_pos += a [1] * 2;\r\nres2 = 1;\r\nfor i in range (min_pos, max_pos + 1) :\r\n if (i == a [2]) : print (res1, res2, direct);\r\n if ((i != min_pos) and (i % 2 == 0)) : res2 += 1;\r\n", "n, m, k = [int(s) for s in input().split(' ')]\r\nlr = ['R', 'L']\r\nanswer = [(k - 1) // (m * 2) + 1, ((k - 1) % (2 * m)) // 2 + 1, lr[k % 2]]\r\nprint(answer)\r\n", "n, m, k = map(int , input().split())\r\nk -= 1\r\nz = k//2\r\nx = z//m\r\ny = z % m\r\n\r\nprint(x + 1, y + 1, ('L', 'R')[k % 2])\r\n\r\n", "_, m, k = map(int, input().split())\r\nx = (k+1)//2\r\nprint(-(-x//m), (x-1)%m+1, 'RL'[k%2])", "from math import floor\r\nn, m, k = map(int, input().split())\r\ntmp = floor(k-1)/2\r\nprint(floor(tmp/m)+1, int(tmp%m) + 1, [\"R\",\"L\"][k%2])", "n, m, k = map(int, input().split())\r\nL = int(k/(m+m))\r\nif k%(m+m)!=0:L = L + 1\r\nD = (L-1)(m+m) + 1\r\nif k%2==0:D = D + 1\r\nD = int((k-D)/2) + 1\r\nst = \"L\"\r\nif k%2==0:st = \"R\"\r\nprint(L, D, st)", "n,m,k = map(int,input().split())\r\nblock = m * 2\r\nif k % block == 0:\r\n ryad = k // block\r\nelse:\r\n ryad = (k // block) + 1\r\nper = k\r\nwhile per > block: per -= block\r\nif per % 2 == 0:\r\n s = 'R'\r\n parta = per // 2\r\nelse:\r\n s = 'L'\r\n parta = per // 2 + 1\r\nprint(ryad,parta,s)\r\n", "n, m, k = map(int, input().split())\r\nprint((k + m * 2 - 1) // (m * 2), (k - (((k + m * 2 - 1) // (m * 2)) - 1) * (m * 2) + 1) // 2,\r\n 'R' if k % 2 == 0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\nr = (k + (2 * m - 1)) // (2 * m)\r\nif k % (2 * m) == 0:\r\n d = m\r\nelse:\r\n d = (k % (2 * m) + 1) // 2\r\ns = 'R' if k % 2 == 0 else 'L'\r\nprint(r, d, s)", "n,m,k=map(int,input().split())\r\na=k%2\r\nx={1:\"L\",0:\"R\"}\r\nr=k//(2m)\r\nif(k%(2m)!=0):\r\n\tr+=1\r\nd=(k-(m(r-1)2))\r\nif(d%2!=0):\r\n\td+=1\r\nd=d//2\r\nprint(r,d,x[a])\r\n\r\n", "from math import ceil\r\na, b, c=map(int, input().split())\r\nd=b2\r\ne=ceil(c/d)\r\nf=ceil((c-(d(e-1)))/2)\r\nif c%2==0:\r\n print(e, f, \"R\")\r\nelse:\r\n print(e, f, \"L\")\r\n\r\n", "from math import ceil\nn, m, k = map(int, input().split())\nx = ceil(k/(2m))\nif k % (2 m):\n y = ceil((k%(2m))/2)\nelse: y = m\nz = 'L' if k%2 else 'R'\nprint(x, y, z)", "n, m, k = map(int, input().split())\r\n\r\nr = -(-k // (2m))\r\nlr = ['R', 'L'][k%2]\r\npos = k % (2m) if k % (2m) else 2m\r\nd = (pos+1) // 2\r\n\r\nprint(r, d, lr)\r\n", "n,m,k=[int(i) for i in input().split()]\r\ncol=m2\r\na=(k-1)//col+1\r\nb=(k-1)%col\r\nprint(a,b//2+1,['L','R'][b%2])", "n, m, k = map(int, input().split())\r\nk -= 1\r\nprint(k // (2 * m) + 1, (k % (2 * m)) // 2 + 1, 'L' if k % 2 == 0 else 'R')", "spot = list(map(int, input().split()))\r\nrow = spot[2]//(spot[1]2)\r\nost = spot[2]%(spot[1]2)\r\nif ost > 0:\r\n\tparta = ost//2\r\n\tif ost/2 != parta:\r\n\t\tparta += 1\r\n\tif ost%2 == 0:\r\n\t\tprint(row+1, parta, 'R')\r\n\telse:\r\n\t\tprint(row+1, parta, 'L')\r\nelse:\r\n\tprint(row, spot[1], 'R')\r\n", "def main():\n n, m, k = map(int, input().split())\n r, k = divmod(k - 1, m * 2)\n print(r + 1, k // 2 + 1, 'LR'[k & 1])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\n\nn, m, k = list(map(int, input().split()))\nr = (k // (m * 2))\nif k % (m * 2) != 0:\n r += 1\nr0 = ((m * 2) * (r - 1)) + 1\nd = ((k - r0) // 2) + 1\nif k % 2 == 0:\n s = 'R'\nelse:\n s = 'L'\nprint(r,d,s) #lane, desk, L/R\n", "\r\nfrom math import ceil\r\nn, m, k = map(int, input().split())\r\nc = ceil(k/(m2))\r\nprint(c, end=' ')\r\nr = ceil((k - ((c-1)(m2)))/2)\r\nprint(r, end=' ')\r\nprint('R' if k % 2 == 0 else 'L')\r\n\r\n# CodeForcesian\r\n# ♥\r\n# تو نمیتونی کتابی رو باز کنی و از اون چیزی یاد نگیری\r\n", "#CF1\r\nn,m,k=list(map(int,input().split()))\r\ny=((k-1)%(2m))//2+1\r\nx=(k-1)//(2m)+1\r\n\r\nif k%2==1:r='L'\r\nelse:r='R'\r\nprint(x,y,r)\r\n", "n,m,k = map(int, input().strip().split())\r\nn = 0\r\ni = 1\r\nj = m 2\r\no = 1\r\nanswn = 0\r\nanswm = 0\r\nwhile answn == 0:\r\n if k <= j and k >= i:\r\n answn = o\r\n else:\r\n i += m * 2\r\n j += m * 2\r\n o += 1\r\ni = 1 + (o - 1) * 2 * m\r\nj = 2 + (o - 1) * 2 * m\r\no = 1\r\nwhile answm == 0:\r\n if k <= j and k >= i:\r\n answm = o\r\n else:\r\n i += 2\r\n j += 2\r\n o += 1\r\nif k % 2 == 0:\r\n print(answn,answm,'R')\r\nelse:\r\n print(answn,answm,'L')\r\n ", "n,m,k=map(int,input().split())\r\nif k%(m2)==0:\r\n r=k//(m2)\r\nelse:\r\n r=k//(m2)+1\r\nk-=(r-1)m2\r\nif k%2==0:\r\n s=k//2\r\nelse:\r\n s=k//2+1\r\nif k%2==0:\r\n d='R'\r\nelse:\r\n d='L'\r\nprint(r,s,d, sep=' ')", "n,m,k =map(int,input().split())\r\nper1 = (k-1)//(2m)\r\nprint(1+per1, end = ' ')\r\nper2 = k - per1* (2m)\r\nprint(1 + (per2-1)//2, end = ' ')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')", "n,m,k=map(int,input().split())\r\nif k%2==0:\r\n s='R'\r\nelse:\r\n s='L'\r\nc=(k-1)//(2m)\r\nr=((k-1)%(2m))//2\r\nprint(c+1,r+1,s)", "n, m, k = map(int, input().split())\r\nrow = 1\r\npos = ''\r\nline = 0\r\nline = k\r\nwhile (line > m2):\r\n line -= m2\r\n row += 1\r\nif line%2 == 0:\r\n pos = 'R'\r\nelse:\r\n pos = 'L'\r\nif (line % 2 == 0):\r\n line = line//2\r\nelse:\r\n line = line//2+1\r\nprint(row, ' ', line, ' ', pos)\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n last = 'R'\r\nelse:\r\n last = 'L'\r\nrow = math.ceil(k / (m 2))\r\nbase = (2 * m) * (row - 1) + 1\r\nsecond = (k - base) // 2 + 1\r\nprint(row, second, last)\r\n\r\n", "n, m, k = map(int, input().split())\r\n\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) // 2) % m + 1\r\ns = 'L' if (k - 1) % 2 == 0 else 'R'\r\n\r\nprint(r, d, s)\r\n", "_, n, m=map(int, input().split())\nn, m=n<<1, m-1\nprint(m//n+1, (m%n+2)>>1, 'LR'[m&1])\n\n\n\n\n# Made By Mostafa_Khaled", "from math import ceil\r\nm, n, k = map(int, input().split())\r\nryad = ceil(k / (n * 2))\r\nk %= n * 2\r\nmesto = ceil(k / 2)\r\nstorona = [\"R\", \"L\"][k%2]\r\nif ryad == 0:\r\n ryad += m\r\nif mesto == 0:\r\n mesto += n\r\nprint(ryad, mesto, storona)", "import math\r\nx=input()\r\nk=[int(i) for i in x.split()]\r\nr=int(math.ceil(k[2]/(2k[1])))\r\np=(k[2]-1)/2\r\nd=int(p%k[1]+1)\r\nif k[2] % 2 == 0 : s=\"R\"\r\nelse: s=\"L\"\r\nprint(r,d,s)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n no_lane = math.ceil(k / (2 m))\r\n tmp = k % (2 * m)\r\n if tmp == 0:\r\n tmp = 2 * m\r\n no_desk = math.ceil(tmp / 2)\r\n if k % 2 == 1:\r\n pos = 'L'\r\n else:\r\n pos = 'R'\r\n print('%d %d %s' % (no_lane, no_desk, pos))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m, k = map(int, input().split())\r\n\r\nall_desks = nm\r\ndesks_in_row = m\r\nrows = n\r\n\r\nif k % 2 == 0:\r\n left_sit = False\r\n for_print = \"R\"\r\nelse:\r\n left_sit = True\r\n for_print = \"L\"\r\n\r\n\r\ndesk = k // 2\r\nif left_sit:\r\n desk += 1\r\n\r\nd = desk % desks_in_row\r\nif desk % desks_in_row == 0:\r\n d = desks_in_row\r\n \r\nr = desk // desks_in_row\r\nif desk % desks_in_row != 0:\r\n r += 1\r\n\r\nprint(r, d, for_print)\r\n", "#!/usr/bin/env python3\n\n\ndef solve():\n n, m, k = map(int, input().split())\n r = ((k - 1) // (m 2)) + 1\n d = (((k - 1) % (m * 2)) // 2) + 1\n lr = \"L\" if k % 2 == 1 else \"R\"\n print(r, d, lr)\n\n\nif __name__ == '__main__':\n solve()\n", "n, m, k = [int(i) for i in input().split()]\r\na = (k-1) // (2m) + 1\r\nb = ((k-1)%(2m))//2 + 1\r\nif ((k-1)%(2m))%2 == 1:\r\n print(str(a)+' '+str(b)+' '+'R')\r\nelse:\r\n print(str(a)+' '+str(b)+' '+'L')", "n,m,k=map(int,input().split())\r\na,b,c=0,0,0\r\nif k%2==0:\r\n c='R'\r\n k=k//2\r\nelse:\r\n c='L'\r\n k=(k+1)//2\r\na=k//m+1\r\nb=k%m\r\nif b==0:\r\n b=m\r\n a-=1\r\nprint(a,b,c)\r\n", "import math\r\nlanes,desks,number = map(int,input().split())\r\nnumberperlane = desks2\r\ncolumn = math.ceil(number/numberperlane)\r\nrow = math.ceil((number-((column-1)numberperlane))/2)\r\nprint(column,row,'R' if number%2==0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\nflag = False\r\nif k % 2 == 0:\r\n flag = True\r\n\r\nfor i in range(1, n+1):\r\n if k <= i m * 2:\r\n if flag:\r\n print(i, ((k - 1) // 2) % m + 1, 'R')\r\n else:\r\n print(i, ((k - 1) // 2) % m + 1, 'L')\r\n break", "n, m, k = map(int, input().split(' '))\r\n\r\nif k % (m << 1) == 0:\r\n print(k // (m << 1), m, 'R')\r\nelse:\r\n a = k // (m << 1)\r\n b = k - 2 * a * m\r\n if b % 2 == 1:\r\n print(a + 1, b // 2 + 1, 'L')\r\n else:\r\n print(a + 1, b // 2, 'R')", "n, m, K = map(int, input().split())\r\nif K%2: print((K-1)//(2m)+1, ((K-1)%(2m))//2+1, 'L')\r\nelse: print((K-2)//(2m)+1, ((K-2)%(2m))//2+1, 'R')\r\n", "[x,y,n] = [int(i)for i in input().split(' ')]\nc = n//(2y)+1 if not n%(2y)==0 else int(n/(2y))\nprint(c,(n-(c-1)y2)//2,'R') if (n-(c-1)y2)%2==0 else print(c,(n+1-(c-1)y2)//2,'L')\n \t\t \t\t\t \t \t \t\t\t \t \t \t", "from math import ceil as c\r\nl,d,p=map(int,input().split())\r\nx=c(p/(2d))\r\ny=p-(2d)(x-1)\r\nprint(x,c(y/2),end=\" \")\r\nif y%2==1:print(\"L\")\r\nelse:print(\"R\")", "class CodeforcesTask752ASolution:\n def __init__(self):\n self.result = ''\n self.n_m_k = []\n\n def read_input(self):\n self.n_m_k = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n lane = (self.n_m_k[2] - 1) // (2 * self.n_m_k[1]) + 1\n row = (self.n_m_k[2] + 1 - (2 * self.n_m_k[1] * (lane - 1))) // 2\n position = \"L\" if self.n_m_k[2] % 2 else \"R\"\n self.result = \"{0} {1} {2}\".format(lane, row, position)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask752ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nf = (k + 2 * m - 1) // (2 * m)\r\ntmp = (k + 2 * m - 1) % (2 * m) + 1\r\ns = (tmp + 1) // 2\r\nt = 'L' if tmp % 2 == 1 else 'R'\r\n\r\nprint(f, s, t)", "n, m, k = map(int, input().split())\r\nx = m * 2\r\nk -= 1\r\nprint(k // x + 1, k % x // 2 + 1, \"LR\"[k % x % 2])\r\n", "import math\r\nn,m,val=map(int,input().split())\r\nif val%2==0:\r\n res=\"R\"\r\nelse:\r\n res=\"L\"\r\np=math.floor((val-1)/2)\r\nrow=math.floor(p/m)+1\r\ncol=p%(m)+1\r\nprint(row,col,res)", "def codeforces(n, m, k):\r\n if k % 2 == 1:\r\n k += 1\r\n side = 'L'\r\n else:\r\n side = 'R'\r\n k //= 2\r\n r = k // m\r\n if k % m != 0:\r\n r += 1\r\n s = k % m\r\n if s == 0:\r\n s = m\r\n return r, s, side\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nr, s, side = map(str, codeforces(n, m, k))\r\nprint(' '.join([r, s, side]))\r\n", "n,m,k=map(int,input().split())\r\n\r\nk-=1\r\nLane = 2 * m\r\nDesk = (k%Lane) // 2\r\nLane = k//Lane\r\n\r\nL = Desk % 2\r\n\r\nif k %2== 1:\r\n print(str(Lane + 1) + ' ' + str(Desk + 1) + ' ' + 'R')\r\nelse:print(str(Lane + 1) + ' ' + str(Desk + 1) + ' ' + 'L')\r\n", "import math\r\nn,m,k=list(map(int,input().split()))\r\nprint(math.ceil(math.ceil(k/2)/m),end=\" \")\r\nif math.ceil(k/2)%m==0:\r\n print(m,end=\" \")\r\nelse:\r\n print((math.ceil(k/2)%m),end=\" \")\r\nif k%2==0:\r\n print(\"R\")\r\nelse:\r\n print(\"L\")", "from math import ceil\r\n\r\n\r\nn,m,y = map(int, input().split())\r\n\r\nif y%2==0:\r\n o = \"R\"\r\nelse:\r\n o = \"L\"\r\n\r\nlane = ceil(y/(2m))\r\ny -= (lane-1)2m\r\ndesk = ceil(y/2)\r\nprint(lane, desk, o)", "def r():\r\n\treturn list(map(int, input().split()))\r\nn, m, k = r()\r\na = (k + 2 m - 1) // (2 * m)\r\nk -= (a - 1) * 2 * m\r\nb = (k + 1) // 2\r\nc = 'R' if k % 2 == 0 else 'L'\r\nprint(a, b, c)", "n, m, k = [int(i) for i in input().split()]\nk -= 1\nlane = k //(2m) + 1\nk -= (lane-1)(2m)\nif k%2 == 0:\n letter = \"L\"\nelse:\n letter = \"R\"\ndesk = k // 2 +1\nprint(lane, desk, letter)", "row_num, desk_num, place = map(int, input().split())\r\nif place % 2 == 1:\r\n k = (place+1)//2\r\nelse:\r\n k = place//2\r\nif k%desk_num == 0:\r\n desk_num_res = desk_num\r\n row_num_res = k//desk_num\r\nelse:\r\n desk_num_res = k%desk_num\r\n row_num_res = k//desk_num+1\r\nif place % 2 == 0:\r\n place_res = 'R'\r\nelse:\r\n place_res = 'L'\r\nprint(row_num_res, desk_num_res, place_res)\r\n", "a = input().split()\r\nm, k = 2 int(a[1]), int(a[2]) - 1\r\nprint(k // m + 1, k % m // 2 + 1, 'LR'[k % 2])", "a=input()\r\na=a.split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\na[2]=int(a[2])\r\naf=a[1]2\r\nr=1\r\nq=1\r\nif a[2]%af!=0:\r\n t=a[2]//af+1\r\nelse:\r\n t=a[2]//af\r\nif a[2]%af!=0:\r\n \r\n r=a[2]%af\r\nelse:\r\n r=af\r\nif r%2==0:\r\n print(str(t)+' '+str(r//2)+' '+'R')\r\nelse:\r\n print(str(t)+' '+str(r//2+1)+' '+'L')\r\n \r\n \r\n", "import math\nn, m, k = [int(s) for s in input().split()]\nprint(math.ceil(k/(2m)), math.ceil((k-(math.ceil(k/(2m))-1)m2)/2), end=' ')\nif k%2:\n print('L')\nelse:\n print('R')\n", "n,m,k=map(int,input().split())\nq=(m2)\na=1\nwhile True:\n if k<=q:\n break\n a+=1\n q+=(m2)\nprint(a,end=\" \")\n#q = 24 \n# (m2)=6 \n# 19 start\n# 24 end\ns=q-(m2)+1 # 19 start\nc=1\nwhile True:\n if k==s or k==s+1:\n print(c,end=\" \")\n break\n s+=2\n c+=1\n \nprint(\"R\" if k%2==0 else \"L\") ", "n,m,k=map(int,input().split())\r\np=m2\r\ni=0\r\nr=1\r\nwhile i+p<k :\r\n i=i+p\r\n r=r+1\r\nk=k-p(r-1)\r\nif k%2==0 :\r\n i=2\r\n v=1\r\n while i!=k :\r\n v=v+1\r\n i=i+2\r\n print(r,v,'R')\r\nelse :\r\n i=1\r\n v=1\r\n while i!=k :\r\n v=v+1\r\n i=i+2\r\n print(r,v,'L')\r\n \r\n \r\n \r\n", "n,m,k=map(int,input().split())\r\nt=((k-1)//2)//m+1\r\ns=((k-1)//2)%m+1\r\nif k%2!=0:\r\n print(t,s,'L')\r\nelse:\r\n print(t,s,'R')", "# LUOGU_RID: 106573685\nn,m,k=list(map(int,input().split()))\r\nls=['LR'm for i in range(n)]\r\nhang=k%(2m)\r\nif hang!=0:\r\n hang=k//(2m)+1\r\nelse:\r\n hang=k//(2m)\r\nlie=k%(2m)\r\nif lie==0:\r\n lie=2m\r\nif lie%2==0:\r\n column=lie//2\r\nelse:\r\n column=(lie//2)+1\r\nprint(hang,column,ls[hang-1][lie-1])", "from math import trunc\r\n\r\nn, m, k = map(int, input().split())\r\n\r\na = 2 m\r\n\r\nn1 = k // a + (1 if k % a != 0 else 0)\r\n\r\nm1 = (k - (n1 - 1) * a ) // 2 + (1 if k % 2 != 0 else 0)\r\n\r\nprint(n1, m1, 'L' if k % 2 else 'R')\r\n", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\nN,M,K = map(int,input().split())\nk = (K-1)//2\ndesk = k % M\nlane = k // M\nif (K-1) % 2:\n lr = \"R\"\nelse:\n lr = \"L\"\n\nprint(\"{} {} {}\".format(lane+1, desk+1, lr))\n\n", "def solve(n,m,k):\r\n lane = 1 + (k-1) // (2m)\r\n desk = 1 + ((k-1) % (2m)) // 2\r\n LR = [\"L\",\"R\"][k % 2 == 0]\r\n return f'{lane} {desk} {LR}'\r\n\r\nn, m, k = map(int, input().split())\r\nprint(solve(n,m,k))", "n,m,d=map(int,input().split())\r\ni=1\r\nii=1\r\nwhile i<=2nm:\r\n if d>=i and d<(i+2m):\r\n j=i\r\n jj=1\r\n while j<i+2m:\r\n if j==d or j+1==d:\r\n if d%2==0:\r\n print(ii,jj,'R')\r\n break\r\n else:\r\n print(ii,jj,'L')\r\n break\r\n j=j+2\r\n jj=jj+1\r\n break\r\n else:\r\n i=i+(2m)\r\n ii=ii+1\r\n\r\n ", "n,m,k = map(int,input().split())\r\n\r\nr = int(k/(2m)) + (1 if k%(2m) else 0)\r\nd_ = k-(r-1)m2\r\nd = int(d_/2) + int(d_%2)\r\nif d_%2: s = 'L'\r\nelse: s = 'R'\r\n\r\nprint(r,d,s)", "n,m,k = [int(i) for i in input().split()]\nblocksize = m2\nactualblock = ((k-1)//blocksize)+1\nplaceinblock = k-(blocksize(actualblock-1))\nactualside = \"L\" if placeinblock%2 else \"R\"\nprint(actualblock,(placeinblock-1)//2+1,actualside)\n", "n,m,k = list(map(int,input().split()))\r\n\r\nr1 = 0\r\nfor i in range(1,n+1) :\r\n\tif (r1 < k) and (k <= 2mi) : \r\n\t\tr = i\r\n\t\tbreak\r\n\telse : r1 = 2mi\r\n\r\nif (k - 2(r-1)m) % 2 == 0 : \r\n\ts = \"R\"\r\n\td = (k - 2(r-1)m - 2)//2 + 1\r\nelse : \r\n\ts = \"L\"\r\n\td = (k - 2(r-1)m - 1)//2 + 1\r\n\r\nprint(r,d,s)", "n,m,k=map(int,input().split())\r\ni=0\r\nwhile(i<=(n+1)):\r\n if(k<(1+2mi)):\r\n print(i,end=\" \")\r\n stand=(1+2m(i-1))\r\n if(k%2):\r\n print(int((k-stand)/2)+1,'L')\r\n else:\r\n print(int((k-stand)/2)+1,'R')\r\n exit()\r\n i+=1", "l=input().split()\nn,m,k=int(l[0]),2int(l[1]),int(l[2])\ndef round(x):\n\tif x-int(x)==0:\n\t\treturn(int(x))\n\telse:\n\t\treturn(int(x)+1)\ndef side (x):\n\tif x%2==0:\n\t\treturn ('R')\n\telse:\n\t\treturn('L')\nlane=round(k/m)\nside=side(k)\ndisk=round((k%m)/2)\nif disk==0: disk+=m//2\nprint(lane,disk,side)", "m,n,k=map(int,input().split())\r\nprint((k-1)//(2n)+1, (k-1)%(2n)//2+1, \"RL\"[k%2])\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nprint(math.ceil(k / (2 * m)), end = \" \")\r\nprint(math.ceil((k % (2 * m)) / 2), end = \" \") if k % (2 * m) != 0 else print(m, end = \" \")\r\nprint(\"L\") if k % 2 == 1 else print(\"R\")\r\n", "[n, m, k] = map(int, input().split())\r\n\r\nlane_number = 0\r\ndesk_number = 0\r\ndesk_left_or_right = 'L'\r\n\r\nfor lane_index in range(1, n+1):\r\n lower_bound = (lane_index - 1) * 2 * m + 1 \r\n upper_bound = lane_index * 2 * m \r\n if (k >= lower_bound and k <= upper_bound):\r\n lane_number = lane_index\r\n desk_number = (k - lower_bound)//2 + 1 \r\n if (k%2 == 0):\r\n desk_left_or_right = 'R'\r\n else:\r\n desk_left_or_right = 'L'\r\n break\r\n \r\nprint(lane_number, desk_number, desk_left_or_right)", "n, m, k = map(int, input().split())\r\nf = (k - 1) // (2 * m)\r\n\r\ns = (k - 1) % (2 * m)\r\nif s % 2 == 0:\r\n print(f + 1, s // 2 + 1, 'L')\r\nelse:\r\n print(f + 1, s // 2 + 1, 'R')\r\n\r\n", "n, m, k = map(int, input().split())\r\nrow = (k - 1) // (2 * m) + 1\r\nplace = k % (2 * m)\r\nif place == 0:\r\n place = 2 * m\r\ns = None\r\np = (place - 1) // 2 + 1\r\nif place % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(row, p, s)", "# A. Santa Claus and a Place in a Class\n\nn, m, k = map(int, input().split())\n\nr = k // (2 * m)\nif k % (2 * m) != 0:\n r += 1\n\nd = (k - (r - 1) * 2 * m) // 2\nif (k - (r - 1) * 2 * m) % 2 != 0:\n d += 1\n\ns = \"L\" if k % 2 != 0 else \"R\"\n\nprint(r, d, s)\n", "n,m,k=[int(i) for i in input().split()]\r\nif (k%2==0):\r\n s=\"R\"\r\nelse:\r\n s=\"L\"\r\nr = k//(2m)\r\nif(k%(2m)!=0):\r\n r+=1\r\nd=k-(r-1)2m\r\nif(d%2!=0):\r\n d+=1\r\nd = d//2\r\nprint(r,d,s)", "def solve():\n n, m, k = map(int, input().split())\n r = (k-1) // (2m)\n p = (k-1) % (2m) + 1\n x = 'L' if p%2 else 'R'\n return (r+1, (p+1)//2, x)\n\nprint(' '.join(map(str, solve())))\n \n \n", "x,y,t=map(int,input().split())\r\nfor i in range(1,x+1):\r\n p=i(y2)\r\n if t<=p:\r\n print(i,end=\" \")\r\n break\r\np-=1\r\nfor i in range(y,0,-1):\r\n if t>=p:\r\n print(i,end=\" \")\r\n break\r\n p-=2\r\nprint(\"R\" if t%2==0 else \"L\")\r\n ", "n, m, k = map(int, input().split())\r\nr = (k - 1) // (m * 2) + 1\r\nc = (k - 1) % (m * 2) // 2 + 1\r\nif k & 1:\r\n o = 'L'\r\nelse:\r\n o = 'R'\r\nprint(r, c, o)", "n, m, k = map(int, input().split())\r\nk0=k\r\nif k%2!=0:\r\n k0+=1\r\nk0//=2\r\n\r\nk1=k0\r\nif k1%m==0:\r\n k1-=1\r\nk1//=m\r\nk1+=1\r\n\r\nk2=(k-(k1-1)2m)\r\n\r\nk2//=2\r\nif k%2!=0:\r\n k2+=1\r\nprint(k1,end = \" \")\r\nprint(k2, end = \" \")\r\nif k%2==0:\r\n print('R')\r\nelse:\r\n print('L')", "n,m,k=map(int,input().split())\r\nd=m2;k-=1\r\nprint(k//d+1,k%d//2+1,'LR'[k%d%2])\r\n", "# LUOGU_RID: 106629544\nn,m,k=map(int,input().split())\r\nfor i in range(1,n+1):\r\n if k<=2mi:\r\n break\r\nw=k-2m(i-1)\r\nx=w//2\r\nif w%2==0:\r\n print(\"{} {} R\".format(i,x))\r\nelse:\r\n print(\"{} {} L\".format(i,x+1))", "n,m,k=(input().split())\r\nn=int(n)\r\nm=int(m)\r\nk=int(k)\r\nquot=int(k/(2m))\r\nrem=k%(2m)\r\nif rem != 0:\r\n quot+=1\r\nif rem==0:\r\n d=m\r\n r=0\r\nelse:\r\n d=int(rem/2);\r\n r=int(rem%2);\r\n if r!= 0:\r\n d+=1\r\nif r==1:\r\n print(str(quot)+\" \"+ str(d)+\" \"+ 'L')\r\nif r==0:\r\n print(str(quot)+\" \"+ str(d)+\" \"+ \"R\")\r\n", "n,m,k = [int(i) for i in input().split()]\r\n\r\nif (not k%(2m)):\r\n l = k//(2m)\r\nelse:\r\n l = k//(2m)+1\r\n\r\nidd = k - (l-1)2m;\r\n\r\nrow = (idd+1)//2\r\n\r\ndirec = ''\r\nif (not k%2):\r\n direc = 'R'\r\nelse:\r\n direc = 'L'\r\n\r\nprint(\"{} {} {}\".format(l, row, direc))\r\n", "n,m,k=map(int,input().split())\r\ns=k%2\r\nr=(k-1)//(2m)\r\nd=rm+1\r\ni=d2\r\nd=1\r\nif s==1:\r\n i-=1\r\nwhile i!=k:\r\n i+=2\r\n d+=1\r\nif s==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r+1,d,s)", "f=lambda:map(int,input().split())\r\nn,m,k=f()\r\nif k%2!=0:\r\n x=((k+1)//2-1)%m+1\r\n print(((k+1)//2-1)//m+1,x,'L')\r\nelse:\r\n x=((k//2)-1)%m+1\r\n print((k//2-1)//m+1,x,'R')", "\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nd = k / (2 m)\r\nif (d - (math.floor(d)) != 0):\r\n d = math.floor(d) + 1\r\nelse:\r\n d = math.floor(d)\r\nc = (k - (2 * m * (d - 1) + 1)) // 2\r\nc = c + 1\r\nif (k % 2 == 0):\r\n print(d, c, \"R\")\r\nelse:\r\n print(d,c,\"L\")", "# Santa Claus and a Place in a Class\ndef santa(n, m, k):\n direction = 'R'\n if k & 1 == 1:\n direction = 'L'\n lane = 2\n while True:\n if k <= (m * lane):\n prev = (m * (lane - 2)) + 1\n desk = 1\n while True:\n if k == prev or k == prev + 1:\n break\n desk += 1\n prev += 2\n break\n lane += 2\n lane //= 2\n print(lane, desk, direction)\nn, m, k = list(map(int, input().split()))\nsanta(n, m, k)", "import sys\r\nn,m,k = [int(i.strip()) for i in sys.stdin.readlines()[0].split(' ')]\r\nif k%2==1:\r\n S = 'L'\r\nelse:\r\n S = 'R'\r\nif S == 'L':\r\n d = (k+1)//2\r\nelse:\r\n d = k//2\r\nif d%m == 0:\r\n r = d//m\r\n d = m\r\nelse:\r\n r = d//m + 1\r\n d = d%m\r\nprint (r,d,S)", "n=list(map(int,input().split()))\r\nc=0\r\nlst=[]\r\nfor j in range(1,(n[0]2)+1):\r\n if(j%2==0):\r\n v=n[1]j\r\n if(v>=n[2]):\r\n c=n[1]-((v-n[2])//2)\r\n lst.append(j//2)\r\n break\r\nif(n[2]%2==0):\r\n b='R'\r\nelse:\r\n b='L'\r\nprint(lst[0],c,b)\r\n", "n,m,k=map(int,input().split())\r\nr=int(k/(2m)+0.99999999999)\r\nq=int( ((k-((r-1)2m))/2) +0.99999999999)\r\nprint(r,end=\" \")\r\nprint(q,end=\" \")\r\nif k%2==0:\r\n print(\"R\");\r\nelse:\r\n print(\"L\")", "n, m, k = map(int, input().split())\r\n\r\nx = int((k + (k % 2)) / 2)\r\n\r\nprint(int((x - 1) / m) + 1, end = \" \")\r\nprint(((x - 1) % m) + 1, end = \" \")\r\n\r\nif k % 2 != 0:\r\n\tprint(\"L\")\r\nelse:\r\n\tprint(\"R\")", "n,m,k = map(int, input().split())\r\nnum = 1\r\nlastnum = 1\r\ni_n = 0\r\nfor i in range(2, n+2):\r\n\ti_n +=1\r\n\tlastnum = num\r\n\tnum+=2(m)\r\n\t#print(num, lastnum, i, i_n)\r\n\tif num > k:\r\n\t\tnum = lastnum\r\n\t\trd = i_n\r\n\t\tprt = 1\r\n\t\t#print(num, i,i_n, num%2)\r\n\t\tif k%2 == 1:\r\n\t\t\twhile(num!=k):\r\n\t\t\t\tnum+=2\r\n\t\t\t\tprt+=1\r\n\t\t\tprint(rd, prt, 'L')\r\n\t\telse:\r\n\t\t\tnum+=1\r\n\t\t\t#print(num)\r\n\t\t\twhile(num!=k):\r\n\t\t\t\tnum+=2\r\n\t\t\t\tprt+=1\r\n\t\t\tprint(rd, prt, 'R')\t\r\n\t\tbreak\t\t", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nk=int(a[2])\r\nimport math\r\nif k%2==0:\r\n pos='R'\r\nelse:\r\n pos='L'\r\na1=math.ceil(k/(2m))\r\na2=((k-(a1-1)m2)+1)//2\r\nprint(a1,a2,pos)\r\n \r\n", "m, n, k = map(int, input().split())\r\ncol = int((k-1) / (2 n)) + 1\r\nrow = int((k - (col-1)2n -1) / 2) + 1\r\nif k % 2 == 0:\r\n\tdir = 'R'\r\nelse:\r\n\tdir = 'L'\r\nprint (col,row,dir)", "from math import ceil as c\r\nn,m,k = map(int,input().split())\r\nprint(c(k/(2m)),end=\" \")\r\nif k%(2m)==0:\r\n\tprint(m,end=\" \")\r\nelse:\r\n\tprint(c((k%(2m))/2),end=\" \")\r\nif k%2==0:\r\n\tprint('R')\r\nelse:\r\n\tprint('L')", "n,m,k=map(int,input().split())\r\nr,d,lr=0,0,'R'\r\nif k%2: lr='L'; k+=1\r\nk//=2\r\nr=-(-k//m)\r\nd=k-(m(r-1))\r\nprint(r,d,lr)", "n,m,k =[int(i)for i in input().split()]\r\n\r\nd=(k+1)//2 if k%2==1 else k//2\r\nb=m if d%m==0 else d%m\r\nc=\"R\" if k%2==0 else \"L\"\r\nwhile k%(2m)!=0:\r\n\tk+=1\r\na=k//(2m)\r\nprint(a,b,c)", "n, m, k = map(int, input().split())\r\nif k%2 == 0:\r\n\ta=k//2\r\n\tb=a//m\r\n\tif a%m!=0:\r\n\t\tb+=1\r\n\t\tc=a%m\r\n\telse:\r\n\t\tc=m\r\n\tprint(b,c,'R')\r\nelse:\r\n\ta=(k+1)//2\r\n\tb=a//m\r\n\tif a%m!=0:\r\n\t\tb+=1\r\n\t\tc=a%m\r\n\telse:\r\n\t\tc=m\r\n\tprint(b,c,'L')", "n, m, k = map(int, input().split())\r\nkk = (k - 1) // 2\r\ns = 'L' if k % 2 == 1 else 'R'\r\nu = kk // m + 1\r\ng = kk % m + 1\r\nprint(u, g, s)\r\n", "n,m,k=[int(x) for x in input().split()]\r\nif k%(2m)==0:\r\n print(k//(2m),end=' ')\r\nelse:\r\n print(k//(2m)+1,end=' ')\r\nif k%(2m)==0:\r\n print(m,end=' ')\r\nelse:\r\n print((k%(2m)+1)//2,end=' ')\r\nif k%2!=0:\r\n print('L')\r\nelse:\r\n print('R')", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=list(map(int,input().split(\" \")))\r\nres=[]\r\nif k%2==0:\r\n dir=\"R\"\r\nelse:\r\n dir=\"L\"\r\nlane=1\r\nright=m2\r\ntemp=right\r\ni=2\r\nwhile temp<k:\r\n temp=righti\r\n lane=lane+1\r\n i=i+1\r\nif temp==k:\r\n desk=m\r\nelse:\r\n if k%2!=0:\r\n temp=temp-1\r\n if temp==k:\r\n desk=m\r\n else:\r\n while True:\r\n if m==1:\r\n break\r\n temp=temp-2\r\n if temp==k:\r\n desk=m-1\r\n break\r\n m=m-1\r\n else:\r\n while True:\r\n if m==1:\r\n break\r\n temp=temp-2\r\n if temp==k:\r\n desk=m-1\r\n break\r\n m=m-1\r\nprint(lane,desk,dir)\r\n\r\n \r\n\r\n ", "import math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nr = math.ceil(k / (m 2))\r\nd = math.ceil((k - (r - 1) * m * 2) / 2)\r\n\r\nif k % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\n\r\nprint(r, d, s)", "import math\nline = input()\nlane, desk, k = [int(x) for x in line.split()]\n\n#lane = int(input())\n#desk = int(input())\n#k = int(input())\n\nlaneno = math.ceil(k/(2desk))\ndeskno = k%(2desk)\nif deskno == 0: deskno = desk\nelse: deskno = math.ceil(deskno/2)\n\nif k%2 == 0: ch = 'R'\nelse: ch = 'L'\n\nprint(str(laneno) + \" \" + str(deskno) + \" \" + ch)\n\n", "import math\r\nn, m, k = map(int, input().split())\r\ns = (k % 2)\r\nk -= (1-s)\r\nif s == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\n\r\n\r\nr = k // (2m) + 1\r\nk += 1\r\n\r\nd = (k % (2m)) //2\r\nif d == 0:\r\n d = m\r\n\r\nprint(r, d, s)\r\n", "n, m, k = map(int, input().split())\r\n\r\ntotal = n * m * 2\r\n\r\n\r\nper_lane = m * 2\r\n\r\nlane = (k+per_lane-1) // per_lane\r\n\r\nnew_k = k % per_lane\r\nif new_k == 0:\r\n new_k = per_lane\r\n\r\nside = None\r\nif new_k % 2 == 0:\r\n side = \"R\"\r\n row = new_k // 2\r\nelse:\r\n side = \"L\"\r\n row = new_k // 2 + 1\r\n\r\nprint(lane, row, side)\r\n\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, m, k] = list(map(int, input().split()))\r\nc = (k+1)//2\r\nlane = (c+m-1)//m\r\ndesk = c%m\r\nif desk == 0:\r\n desk = m\r\nres = [lane, desk]\r\nif k%2 == 0:\r\n res.append('R')\r\nelse:\r\n res.append('L')\r\nprint(' '.join(map(str, res)))", "#\r\n# Created by Polusummator on 25.10.2020\r\n# --------- Little PyPy Squad ---------\r\n# Verdict: \r\n#\r\nn, m, k = [int(i) for i in input().split()]\r\nif not k % (m * 2):\r\n r = k // (m * 2)\r\nelse:\r\n r = k // (m * 2) + 1\r\n# print(r)\r\nk1 = k % (m * 2) if k % (m * 2) else m * 2\r\nif k1 % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nif not k1 % 2:\r\n l = k1 // 2\r\nelse:\r\n l = k1 // 2 + 1\r\nprint(r, l, s)\r\n", "#!/usr/bin/env python3\ndef ri():\n return map(int, input().split())\n\nn, m, k = ri()\n\na = (k-1) // (m2) + 1\nb = ((k-1) %(m2))//2 +1\n\nif k%2:\n c = 'L'\nelse:\n c = 'R'\n\nprint(a, b, c)\n\n", "n,m,k=[int(x) for x in input().split()]\r\nif k%2!=0:\r\n\ts='L'\r\nelse :\r\n\ts='R'\r\np=(k-1)//2\r\nprint(p//m+1,p%m+1,s)", "n, m, k = map(int, input().split())\r\n\r\nif k % 2 == 0:\r\n\tp = k // 2\r\n\tisD = 'R'\r\nelse:\r\n\tp = k // 2 + 1\r\n\tisD = 'L'\r\n\t\r\nif p % m == 0:\r\n\tr = p // m\r\n\td = m\r\nelse:\r\n\tr = (p // m) + 1\r\n\td = p % m\r\n\r\nprint(r, d, isD)\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tn,m,k=read_ints()\r\n\tk-=1\r\n\tlane = k//(2m)\r\n\tdesk = (k%(2m))//2\r\n\tlr = \"L\" if k%2==0 else \"R\"\r\n\tprint(lane+1, desk+1, lr)\r\n\r\nsolve()\r\n", "l = list(map(int,input().split()))\r\nn = l[0]; m =l[1];k = l[2];\r\np = 2;\r\nQ = \"L\"\r\nif k%2==0:\r\n Q = \"R\"\r\nM = ((k-1)%(m2))//2+1\r\n\r\nN = (k-1)//(m2)+1\r\nprint(N,M,Q)\r\n", "n, m, k = list(map(int, input().split(' ')))\r\nx = (k - 1) // 2\r\nr = x // m + 1\r\nd = x % m + 1\r\nif k & 1:\r\n print(r, d, 'L')\r\nelse:\r\n print(r, d, 'R')\r\n", "n,m,k = map(int, input().split())\r\nd = m * 2\r\nk -= 1\r\nprint (k // d + 1, k % d // 2 + 1, 'LR'[k % d % 2])", "n, m, k = map(int, input().split())\r\nprint((k+(2m)-1)//(2m), (k-2m((k+(2m)-1)//(2m)-1)+1)//2 , \"L\" if k%2 else \"R\")", "from math import ceil\r\nn,m,k=map(int,input().split())\r\nprint(ceil(ceil(k/2)/m),(ceil(k/2)-1)%m+1,'RL'[k%2])", "n,m,k=map(int,input().split())\r\nkt=(k+1)//2\r\nrow=(kt+m-1)//m\r\ncol=(kt-1)%m+1\r\nif k%2:\r\n print(row,col,'L')\r\nelse:\r\n print(row,col,'R')\r\n", "n ,m ,k =map(int,input().split())\r\ndesk=0\r\nlane=0\r\nplace='0'\r\n\r\nif k % 2 ==0:\r\n place='R'\r\n p=k//2\r\nelse:\r\n place='L'\r\n p = k // 2 + 1\r\n\r\nif p % m == 0:\r\n\tlane = p // m\r\n\tdesk = m\r\nelse:\r\n\tlane = (p // m) + 1\r\n\tdesk = p % m\r\n\r\n\r\nprint(lane,desk,place) \r\n \r\n \r\n\r\n ", "def santa(m, k):\r\n l = ((k - 1) // (2 * m)) + 1\r\n t = k - ((l - 1) * 2 * m)\r\n d = (t + 1) // 2\r\n if k % 2 == 0:\r\n return l, d, \"R\"\r\n return l, d, \"L\"\r\n\r\n\r\nN, M, K = [int(i) for i in input().split()]\r\nprint(santa(M, K))\r\n", "def solution(cols, rows, k):\r\n C = (k + 2 rows - 1) // (2 * rows)\r\n k -= (C - 1) * 2 * rows\r\n R = (k + 1) // 2\r\n \r\n return f\"{C} {R} {'L' if k % 2 == 1 else 'R'}\"\r\n\r\ncols, rows, k = map(int, input().split())\r\nprint(solution(cols, rows, k))\r\n", "n,m,k=map(int,input().split())\r\nflag=True if k%2==0 else False\r\nfor i in range(1,n+1):\r\n if k<= im2:\r\n print(i , ((k - 1) // 2) % m + 1 ,'R' if flag else 'L')\r\n break\r\n\r\n", "import math as ma\nn, m, k = map(int, input().split())\nr, d, s = ma.ceil(k/m/2), ma.ceil(((k-1) % (m2)+1)/2), 'L' if k & 1 else 'R'\nprint(r, d, s)\n", "n, m, k0 = map(int, input().split())\r\nk = k0\r\nans1 = k // (2 m)\r\nk = k % (2 * m)\r\nif k == 0:\r\n print(ans1, m, \"R\")\r\nelse:\r\n c = [\"R\", \"L\"]\r\n ans1 += 1\r\n ans2 = k // 2\r\n if k0 % 2 == 1:\r\n ans2 += 1\r\n ans3 = c[k0 % 2]\r\n print(ans1, ans2, ans3)\r\n", "entrada = str(input())\r\nn = int(entrada.split(\" \")[0])\r\nm = int(entrada.split(\" \")[1])\r\nk = int(entrada.split(\" \")[2])\r\nlane = n\r\nd = m\r\nfor i in range(1,n+1):\r\n\tif k <= (i * 2* m):\r\n\t\tlane = i\r\n\t\tbreak\r\nfor i in range(1, m+1):\r\n\tif lane != 1:\r\n\t\tif k <= (i2 + (lane-1)m2):\r\n\t\t\td = i\r\n\t\t\tbreak\r\n\r\n\telse:\r\n\t\tif k <= (ilane2 ):\r\n\t\t\td = i\r\n\t\t\tbreak\r\nif k%2 ==0:\r\n\tprint (lane, d, 'R')\r\n\r\n\t\r\nelse:\r\n\tprint (lane, d, 'L')\r\n", "n, m, k = map(int, input().split())\r\n\r\nlane = (k - 1) // (2 m) + 1\r\ndesk = (k - 1) % (2 * m) // 2 + 1\r\nside = 'L' if k % 2 > 0 else 'R'\r\n\r\nprint(lane, desk, side)", "def solve(n, m, k):\r\n return \"%d %d %c\" % ((k - 1) // (2 * m) + 1, (k - 1) // 2 % m + 1, 'L' if k % 2 == 1 else 'R')\r\n\r\nif __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n print(solve(n, m, k))", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[-1])\r\nr = (k + 2 * m - 1) // (2 * m)\r\nd = k - (r - 1) * (2 * m)\r\nd = (d + 1) // 2\r\nprint(r, d, end = \" \")\r\nif k % 2:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn,m,k = map(int,input().split())\r\nr = (k-1) // (m2)\r\nd = (k+1 - r 2 * m) // 2\r\nans = (k+1 - r * 2 * m) % 2\r\nprint(r+1,d, \"R\" * ans + \"L\" * (1-ans))\r\n", "#!/bin/python3\n\nn,m,k = [int(x) for x in input().split()]\n\ns = \"L\"\n\nif k % 2 == 0:\n s = \"R\"\n\nlaneSize = 2m\nr = 1\n\nwhile k > (rlaneSize):\n r += 1\n\nlaneFirstValue = ( (r-1)laneSize ) + 1\ndiff = k - laneFirstValue\nd = (diff // 2) + 1\n\nprint(r, d, s) \n", "n, m, k = [int(f) for f in input().split(' ') if f]\r\n\r\nr = k / (2 m)\r\n\r\nif r % 1:\r\n r = int(r // 1 + 1)\r\n\r\nd = (k - 2 * (r - 1) * m) / 2\r\n\r\nif d % 1:\r\n d = int(d // 1 + 1)\r\n\r\nprint(int(r), int(d), sep=' ', end=' ')\r\nif not k % 2:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n, m, k = map(int, input().split())\r\nnum = int(k / 2 + .5)\r\nlane = 1\r\ndesk = 1\r\nwhile num > m:\r\n num -= m\r\n lane += 1\r\ndesk = num\r\npos = \"L\"\r\nif k % 2 == 0:\r\n pos = \"R\"\r\nprint(str(lane) + \" \" + str(desk) + \" \" + pos)\r\n", "n,m,k=(int(z) for z in input().split())\r\nrow=1\r\nwhile k>2m:\r\n k-=2m\r\n row+=1\r\ndesk=1\r\nwhile k>2:\r\n k-=2\r\n desk+=1\r\nif k-1:\r\n print(row,desk,\"R\")\r\nelse:\r\n print(row,desk,\"L\")", "from math import ceil\r\nn, m , k = list(map(int, input().split()))\r\nq = ceil(k/2)\r\nif k%(2m) == 0:\r\n w = k//(2m)\r\nelse:\r\n w = k//(2m)+1\r\nchet = 1\r\nchislo = (w-1)(m2)+1\r\nwhile chislo!= k:\r\n if chislo%2 == 0:\r\n chet+=1\r\n chislo+=1\r\nif k%2==0:\r\n print(str(w) + ' ' + str(chet) + ' R')\r\nelse:\r\n print(str(w) + ' ' + str(chet) + ' L')\r\n", "from math import ceil\r\nn, m, k = map(int,input().split())\r\nr = ceil(k/(m2))\r\nd = m-(rm2-k)//2\r\nprint(r,d,['R','L'][k%2])", "n, m, k = tuple(map(int, input().split()))\r\nx, y = 0, 0\r\nx = k//(2m)\r\nif x != k/(2m):\r\n x += 1\r\nif k % 2 == 0:\r\n p = \"R\"\r\n y = 2(x-1)m+2\r\n y = (k-y)//2 + 1\r\nelse:\r\n p = \"L\"\r\n y = 2 * (x - 1) * m + 1\r\n y = (k - y) // 2 + 1\r\nprint(x, y, p)\r\n", "import math\n#input = map(int, input().split())\ninput = input().split()\nfor i in range(len(input)):\n input[i] = int(input[i])\n\nif(input[0] is 0 and input[1] is 0):\n print(\"0 0 R\")\nelse:\n totaldesks = input[0] * input[1] * 2\n sets = input[1] * 2\n\n # get desk based on mod namely input[2] % sets\n\n destination = input[2]\n side = \"R\"\n if(destination % 2 is not 0):\n side = \"L\"\n destination += 1\n\n desk = int(destination % sets / 2)\n if(desk is 0):\n desk = input[1]\n lane = math.ceil(input[2] / 2 / input[1])\n\n print(str(lane) + \" \" + str(desk) + \" \" + side)", "from math import ceil\r\nn,m,k=[int(i) for i in input().split()]\r\na=k%(2m)\r\nif a==0:\r\n a=2m\r\n\r\nprint(ceil(k/(2m)),(a+1)//2,'RL'[k%2])\r\n", "n, m, k = map(int, input().split())\nt1 = 2 m\nps1 = (k - 1) // t1 + 1\nps2 = (k % t1)\nif ps2 == 0:\n ps2 = 2 * m\nprint(ps1, (ps2 + ps2 % 2) // 2, (\"L\" if ps2 % 2 == 1 else \"R\"))", "# Author: Maharshi Gor\r\n\r\nimport sys\r\nsys.setrecursionlimit(5000000)\r\n\r\ndef read(type=int):\r\n return type(input())\r\n\r\n\r\ndef read_arr(type=int):\r\n return [type(token) for token in input().split()]\r\n\r\nn,m,k = read_arr()\r\nk -= 1\r\n\r\nl = k // (2m)\r\nd = (k // 2) % m\r\nside = 'L' if k % 2 == 0 else 'R'\r\nprint(l+1,d+1,side)", "n, m, k = map(int, input().split()) #4, 3\r\n# # # #\r\n# # # #\r\n# # # #\r\n\r\npos = \"\"\r\nif k % 2 == 0:\r\n pos = \"R\"\r\nelse:\r\n pos = \"L\"\r\nrad = (k - 1) // (2 m) + 1\r\nparta = ((k - (rad - 1) * 2 * m) + 1) // 2\r\nprint(rad, parta, pos)", "import math\r\ns = input()\r\n#list = s.split()\r\nn = int(s.split()[0])\r\nm = int(s.split()[1])\r\nk = int( s.split()[2])\r\ni = math.ceil(k/(2m))\r\nk-= (i-1)2m\r\nj = math.ceil(k/(2))\r\nif(k%2 ==1):\r\n print(\"%d %d L\"%(i,j))\r\nelse:\r\n print(\"%d %d R\" % (i, j))", "import math\r\n_input = input().split()\r\nlanes = int(_input[0])\r\ndesks = int(_input[1])\r\nk = int(_input[2])\r\ndd = desks 2\r\ncol = math.ceil(k / dd)\r\nz = k - ((col-1)dd)\r\nrow = math.ceil(z/2)\r\nif(k & 1):print(str(col)+\" \" + str(row)+ \" L\")\r\nelse :print(str(col)+\" \" + str(row)+ \" R\")", "n,m,k=list(map(int, input().split()))\r\nif(k//(m2)!=k/(m2)):\r\n r=k//(m2)+1\r\nelse:\r\n r=k//(m2)\r\np=(k%(m2))\r\nplace=p%2\r\n\r\nif(p//2!=p/2):\r\n p=p//2+1\r\n\r\nelse:\r\n p=p//2\r\nif(p==0):\r\n p=m\r\nif(place):\r\n\r\n place='L'\r\n\r\nelse:\r\n place='R'\r\nprint(r,p, place)", "from math import ceil\r\nn, m, k = map(int, input().split())\r\nn2 = ceil(k / (m * 2))\r\nm2 = m - (n2 * m * 2 - (k + k % 2)) // 2\r\nd = \"R\" if k % 2 == 0 else \"L\"\r\nprint(n2, m2, d)\r\n", "n, m, k = map(int, input().split())\r\nif k % (m2) == 0:\r\n row = k // (m2)\r\nelse:\r\n row = k // (m2) + 1\r\ndesk = k - ((row - 1) m2)\r\nif desk % 2 == 0:\r\n desk //= 2\r\nelse:\r\n desk = desk // 2 + 1\r\nif k % 2 == 0:\r\n place = 'R'\r\nelse:\r\n place = 'L'\r\nprint(row, desk, place)", "import math\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 1:\r\n pos = \"L\"\r\nelse:\r\n pos = \"R\"\r\nr = math.ceil(k / (2 m))\r\nk -= (r - 1) * 2 * m\r\nf = math.ceil(k / 2)\r\nprint(r, f, pos)\r\n", "from math import ceil\r\nn,m,k = [int(item) for item in input().split()]\r\n\r\nline = ceil(k / (2 * m))\r\ndesk = ceil((k - (line - 1) * 2 * m) / 2)\r\nif k % 2 == 0:\r\n side = \"R\"\r\nelse:\r\n side = \"L\"\r\n\r\nprint(line,desk,side)", "import math\r\n[n, m, k] = map(int, input().split())\r\nx = k%(2m)\r\nif x == 0:\r\n print(int(k/(2m)), m, 'R')\r\nelse:\r\n row = int(math.ceil(x/2))\r\n if x%2 == 0:\r\n place = str('R')\r\n else:\r\n place = str('L')\r\n print(int(k/(2m) + 1), row, place)", "n, m, k = map(int, input().split())\r\nprint((k - 1) // (2m) + 1, end=\" \")\r\nprint((k - 1) % (2m) // 2 + 1, end=\" \")\r\nif k % 2 == 1:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "a,b,c=map(int,input().split());from math import ceil as z;k=z(c/(b2));print(k,z((c-((k-1)(2b)))/2),[\"R\",\"L\"][c%2])", "n, m, k = list(map(int, input().split()))\n\nk -= 1\nr = k // (2 * m)\nc = (k % (2 * m)) // 2\nprint(r + 1, c + 1, end=' ')\nif k % 2 == 0:\n\tprint('L')\nelse:\n\tprint('R')\n\n", "from math import ceil \n\n\ndef solve(n, m, k):\n t = ceil(k / 2) \n x = m if t % m == 0 else t % m\n y = ceil(t / m)\n p = 'L' if k % 2 == 1 else 'R'\n return f'{y} {x} {p}'\n\n\ndef main():\n n, m, k = list(map(int, input().split()))\n print(solve(n, m, k))\n\n\nmain()\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/748/A\r\n\r\nn, m , k = map(int, input().split())\r\n\r\nk -= 1\r\np = k // 2\r\np = p // m\r\n\r\nprint(\"%d %d %s\" % (p + 1, k // 2 - p * m + 1, \"R\" if k % 2 == 1 else \"L\"))", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn, m, k = IL()\r\nprint((k-1)//(2m)+1, (k-1)%(2m)//2+1, \"L\" if k%2 else \"R\")", "n, m, k = map(lambda x: int(x), input().split())\r\nm1 = m * 2\r\nif k % m1 != 0:\r\n rowMain = k // m1 + 1\r\nelse:\r\n rowMain = k // m1\r\n\r\nk1 = k - (rowMain - 1) * m1\r\nif k1 % 2 == 0:\r\n tableMain = k1 // 2\r\nelse:\r\n tableMain = k1 // 2 + 1\r\n\r\nplace = 'L' if k % 2 == 1 else 'R'\r\nprint(rowMain, tableMain, place)\r\n", "# Yergali B\r\n# 389 div 2\r\nn,m,k=map(int,input().split())\r\nx = (k-1)//(m2) + 1\r\ny = ((k%(m2))+1)//2\r\nif y==0:\r\n y=m\r\nprint(x, y, end=' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "def kek(k):\r\n if k % 2:\r\n return 'L'\r\n else:\r\n return 'R'\r\nn, m, k = list(map(int, input().split()))\r\nnum_of_parta = (k - 1) // 2\r\nr = num_of_parta // m + 1\r\nd = num_of_parta % m + 1\r\ns = kek(k)\r\nprint(r, d, s)\r\n", "s = input()\r\nn,m,k = s.split()\r\nm = int(m)\r\nn = int(n)\r\nk = int (k)\r\n\r\nr = (((k+1)//2) // m) + 1\r\n\r\nd = ((k+1)//2) % m\r\nif (d==0):\r\n d=m\r\n r = r-1\r\nif (k%2 == 0):\r\n s = \"R\"\r\nelse:\r\n s = \"L\"\r\nprint (r,d,s)\r\n\r\n", "n, m, k = map(int, input().split())\r\nlan = 1\r\nchar = 'L'\r\nif k%2==0:\r\n char='R'\r\nwhile k>2m:\r\n k-=2m\r\n lan+=1\r\n\r\nprint(str(lan)+\" \"+ str((k+1)//2)+ \" \"+char)", "n,m,k=map(int,input().split())\r\nx=(k-1)//2\r\nr=x//m+1\r\nd=x%m+1\r\nif k%2==0: \r\n\ts='R' \r\nelse:\r\n\ts='L'\r\nprint(r,d,s)", "n, m, k = map(int, input().split())\n\ndef ceil(a, b):\n\treturn (a + (b - 1)) // b\n\n# ceil(a / b) = (a + (b - 1)) // b\nr = ceil(k, (2m))\nd = ceil((k-2m(r-1)), 2)\ns = \"R\" if k%2==0 else \"L\" # side\n\nprint(r, d, s)", "a=str()\r\nj=int()\r\nk=int()\r\nn=int()\r\nRL=str()\r\nc=[]\r\na= input().split(' ')\r\nfor j in range (3) :\r\n c.append (a[j])\r\nk=(int(a[2])%2+ int(a[2]))//2\r\nj=(k-1)//int(a[1])+1\r\nn=k-(j-1)(int(a[1]))\r\nif int(a[2])%2==1:\r\n RL='L'\r\nelse:\r\n RL='R'\r\nprint(j,n,RL, end = '')", "n,m,k = map(int, input().split())\r\nl = (k - 1)//(2 * m) \r\nprint(l + 1, end = ' ')\r\nprint((k - 2 * l * m - 1) // (2) + 1, end = ' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "n,m,k=list(map(int,input().split()))\r\nif k%2==0:\r\n\ts=\"R\"\r\nelse:\r\n\ts=\"L\"\r\nt=(k-1)//2\t\r\n# a=ceil(k/(2n))\r\n# b=ceil((k)/(2m))\r\na=(t//m)+1\r\nb=t%m+1\r\nprint(a,b,s)", "n,m,k=map(int,input().split())\r\nx = (k-1) // 2\r\nr = x // m+1\r\nd = x%m + 1\r\nif k%2==0: \r\n\ts='R' \r\nelse:\r\n\ts='L'\r\nprint(r,d,s)", "from math import\r\nm,n,o=map(int, input().split())\r\n#n=int(input())\r\n#l=list(map(int, input().split()))\r\n#s=input()\r\n\r\nlane=ceil(o/(2n))\r\nfirst=(lane-1)n2+1\r\nrow=1+(o-first)//2\r\nprint(lane,row,'L'if o%2==1 else 'R')", "\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n\tside = 'R'\r\nelse:\r\n\tside = 'L'\r\np = 0\r\n\r\nif k % (m * 2) == 0:\r\n\tlane = k // (m * 2)\r\nelse:\r\n\tlane = k // (m * 2) + 1\r\n\r\nwhile k > m * 2:\r\n\tk -= m * 2\r\n\r\ndesk = (k + 1) // 2\r\n\r\nprint(lane, desk, side)", "n,m,k=[int(i) for i in input().split()]\r\nif k%2==0:\r\n z='R'\r\nelse:\r\n z='L'\r\nm1=(k-1)//(2m)+1\r\nn1=((k-1)%(2m))//2+1\r\nprint(m1,n1,z)\r\n", "n,m,s=map(int,input().split())\r\n\r\nif s%2==1:\r\n ch='L'\r\nelse:\r\n ch='R'\r\n\r\np=s\r\nd=1\r\nwhile p>m2 :\r\n p=p-(m2)\r\n d=d+1\r\na=(p//2)+(p%2)\r\nprint(d,a,ch) \r\n", "n, m, k = map(int, input().split())\r\nprint((k - 1) // (2 * m) + 1, ((k - 1) % (2 * m)) // 2 + 1, 'RL'[k % 2])\r\n", "a,b,c=map(int, input().split())\r\nl=[0,0,\"L\"]\r\nif c%2 == 0:\r\n l[2]=\"R\"\r\n c=int(c/2)\r\nelse:\r\n c=int(c/2)+1\r\nk=int((c-1)/b)\r\nl[0]=str(k+1)\r\nc=c-kb\r\nl[1]=str(c)\r\nprint(\" \".join(l))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\na,b=map(int, input().split())\r\nif b>(a(a+1))/2:\r\n print(\"0\")\r\nelse:\r\n for i in range\r\n\r\n\"\"\"\r\n \r\n\r\n", "import math\r\n\r\nn,m,k=[int(i) for i in input().split()]\r\nl=d=0\r\nc=\"X\"\r\nif k%(2m)==0:\r\n l=int(k/(2m))\r\n d=m\r\n c=\"R\"\r\nelse :\r\n l=math.floor(k/(2m))+1\r\n k=k-((l-1)m2)\r\n if k%2==0:\r\n d=int(k/2)\r\n c=\"R\"\r\n else :\r\n d=math.floor(k/2)+1\r\n c=\"L\"\r\nprint(l,d,c)", "_ = input()\r\n\r\n_ = list(map(int, _.split()))\r\n\r\nl = _[0]\r\nd = _[1]\r\ns = _[2]\r\n\r\nlp = ((s-1)//(d2)) + 1\r\n\r\nif s % (d2) == 0:\r\n dp = ((d2)-1)//2 + 1\r\nelse:\r\n dp = ((s % (d2))-1)//2 + 1\r\n\r\nif s%2 == 0:\r\n lor = 'R'\r\nelse:\r\n lor = 'L'\r\n \r\nprint (lp, ' ', dp, ' ', lor, end='\\n')\r\n", "\r\nn, m, k = map(int, input().split())\r\np = (k - 1) // 2\r\nx = (p // m) + 1\r\ny = (p % m) + 1\r\nif k % 2 == 0:\r\n z = \"R\"\r\nelse:\r\n z = \"L\"\r\nprint(x, y, z)", "\"\"\"\r\n\tAuthor\t\t: Arif Ahmad\r\n\tDate \t\t: \r\n\tAlgo \t\t: \r\n\tDifficulty\t: \r\n\"\"\"\r\n\r\ndef main():\r\n\tr, c, k = [int(_) for _ in input().split()]\r\n\r\n\tlane = ((k - 1) // (c 2)) + 1\r\n\tk -= (lane - 1) * (c * 2)\r\n\tdesk = (k + 1) // 2\r\n\tif k%2 == 1: pos = 'L'\r\n\telse: pos = 'R'\r\n\r\n\tprint(lane, desk, pos)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n", "n,m,k=map(int,input().split())\r\nprint((k-1)//(m2)+1,(k-1)%(2m)//2+1,'R' if k%2==0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\n\r\npl = ''\r\nif k % 2 == 0:\r\n pl = 'R'\r\nelse:\r\n pl = 'L'\r\n\r\nk = k // 2 + k % 2\r\npart = k % m\r\nrad = k // m + 1\r\nif k % m == 0:\r\n rad -= 1\r\nif part == 0:\r\n part = m\r\n\r\nprint(rad, part, pl)", "n, m, k = list(map(int, input().split()))\r\nprint((k - 1) // (2 * m) + 1, end=\" \")\r\nprint((k - 1) % (2 * m) // 2 + 1, end=\" \")\r\nif ((k - 1) % (2 * m) % 2 == 0):\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "s=(input()).split(' ')\r\nn=int(s[0])\r\nm=int(s[1])\r\nk=int(s[2])\r\nif k%2 == 0:\r\n k=k/2\r\n if k%m==0:\r\n p=m\r\n else:\r\n p=int(k-k//mm)\r\n if k%m==0:\r\n r=int(k//m)\r\n else:\r\n r=int(k//m+1)\r\n print(r,p,'R')\r\nelse:\r\n k=(k+1)/2\r\n if k%m==0:\r\n p=m\r\n else:\r\n p=int(k-k//mm)\r\n if k%m==0:\r\n r=int(k//m)\r\n else:\r\n r=int(k//m+1)\r\n print(r,p,'L')\r\n", "from math import ceil\r\nn,m,k = (int(i) for i in input().split())\r\nryad = ceil(k/(2m))\r\nparta = ((k%(2m))+1)//(2)\r\nif k%2:\r\n left = \"L\"\r\nelse:\r\n left = \"R\"\r\nif parta == 0:\r\n parta = m\r\nprint(ryad, parta, left)", "n, m, k = map(int, input().split())\r\nr = (k + 2 * m -1)// (2 * m)\r\nz = (k % (m * 2))\r\nif z != 0:\r\n d = (k % (m * 2) + 1) // 2\r\n s = (k % (m * 2) + 1) % 2\r\nelse:\r\n d = m\r\n s = 'R'\r\nif s == 0:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)", "def increment(t, mod):\r\n if t % mod == 0:\r\n return mod\r\n else:\r\n return t % mod\r\n\r\nn, m, k = map(int, input().split())\r\nkk = k % 2\r\nk = (k + 1) // 2\r\nprint((k + m - 1) // m , increment(k, m), kk * 'L' + (1- kk) * 'R')", "n , m , k = map(int, input().split())\r\nans =[]\r\n\r\nnumber = 2nm\r\n\r\ncol = number//n\r\nc = k//col\r\nif k%col!=0:\r\n c=c+1\r\nans.append(c)\r\n\r\nrow = col//m\r\ncol_start = col * (c-1)\r\ncol_end = colc\r\nr = 0\r\nans_row=1\r\nfor i in range(col_start+1, col_end+1):\r\n if i==k:\r\n ans.append(ans_row)\r\n r = r+1\r\n if r==row:\r\n ans_row = ans_row+1\r\n r=0\r\n\r\nif k%2==0:\r\n ans.append('R')\r\nelse:\r\n ans.append('L')\r\nprint(ans)", "m,n,k=[int(i) for i in input().split()]\r\n\r\nx,y=(k-1)//(2n)+1, (k-1)%(2n)\r\nprint (x, 1+y//2, 'R' if y%2 else 'L')", "n, m, k = map(int, input().split())\n\nrow = (k-1)//(2m)+1\n\npl = ((k-1)%(2m))//2+1\n\nprint(f\"{row} {pl} {'L' if k%2 else 'R'}\")", "a,b,c = map(int,input().split())\r\nz = c//(b2)\r\nx = c%(b2)\r\nif x ==0:\r\n\tprint(z,b,\"R\")\r\nelse:\r\n\tif x%2==0:\r\n\t\tprint(z+1,x//2,\"R\")\r\n\telse:\r\n\t\tprint(z+1,(x//2)+1 ,\"L\")\r\n", "from math import ceil\r\nl,m,k=map(int,input().split())\r\ni=1\r\nwhile 2mi<k:\r\n\ti+=1\r\nlx=list(range(2m(i-1)+1,2m(i)+1))\r\nj=lx.index(k)+1\r\n# print(lx,j)\r\nif j%2==0:\r\n\tprint(i,j//2,\"R\")\r\nelse:\r\n\tprint(i,ceil(j/2),\"L\")", "n, m, k = [int(c) for c in input().split()]\r\nsas = (k + 1) // 2\r\nif k % 2 == 0:\r\n var = 'R'\r\nelse:\r\n var = 'L'\r\nparta = sas % m\r\nif parta == 0:\r\n parta = m\r\nprint((sas - 1) // m + 1, parta, var)", "n, m, k = list(map(int, input().split()))\nk2 = ((k - 1) // 2 + 1)\nans2 =k2 % m\nif ans2 == 0:\n ans2 = m\nprint((k2 - 1) // m + 1, ans2, end=\" \")\nif k % 2 == 1:\n print(\"L\")\nelse:\n print(\"R\")\n", "from math import ceil\r\nrows, columns, place = map(int, input().split())\r\nprint(ceil(place/(columns2)), ceil(((place%(columns2)) if place%(columns2) != 0 else 2columns)/2), 'L' if place%2 else 'R')", "n, m, k = map(int, input().split())\r\n\r\nrow = (k - 1) // (2m) + 1\r\nk = (k - 1) % (2m) + 1\r\n\r\ndesk = (k - 1) // 2 + 1\r\nside = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nprint(row, desk, side)", "import math\r\ndetail = [int(n) for n in input().split()]\r\n\r\nfound = False\r\nlane_size = 2detail[1]\r\nlocation = list()\r\n#find lanes\r\n\r\nlocation.append(str(int(math.ceil(float(detail[2]/lane_size)))))\r\nlocation.append(str(int(math.ceil(float(detail[2]-(int(location[0])-1)lane_size)/2))))\r\nif(int(detail[2])%2==1):\r\n location.append('L')\r\nelse:\r\n location.append('R')\r\n\r\nprint(' '.join(x for x in location))\r\n", "import math\r\nn,m,k=map(int,input().split())\r\ns=n2m\r\nl=math.ceil((k/(2m)))\r\nc=k-(l-1)2m\r\nr=math.ceil(c/(2))\r\nif k%2==0:\r\n print(l,r,\"R\")\r\nelse:\r\n print(l,r,\"L\")\r\n\r\n\r\n", "import math\r\nstring = input()\r\na, b, n = map(int, string.split())\r\nr = math.ceil(n / (b 2))\r\ns = n - b * 2 * (r - 1)\r\nc = math.ceil(s / 2)\r\nif s % 2 == 0:\r\n p = \"R\"\r\nelse:\r\n p = \"L\"\r\nprint(\"%d %d %s\" % (r, c, p))", "n, m, k = map(int, input().split())\r\nx = k // (m * 2) + (k % (m2)+m2-1)//(m2)\r\nprint(x, (k - (x-1) m * 2) // 2 + ((k-(x-1) * m * 2) % 2+1)//2, '', end='')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')\r\n\r\n", "rows, cols, place = map(int, input().split())\n\nplace -= 1\nparta = place // 2\nrow, col = parta // cols, parta % cols\n\nprint(row+1, col+1, 'LR'[place % 2])\n", "n,m,p=[int(x) for x in input().split()]\r\n\r\n\r\n\r\nif p%2==0:\r\n place='R'\r\nelse:\r\n place='L'\r\nif p%(2m)>0:\r\n row=1+p//(2m)\r\nelse:\r\n row=p//(2m)\r\nif p%(2m)>0:\r\n if (p%(2m))%2==0:\r\n parta=(p%(2m))//2\r\n else:\r\n parta=1+(p%(2m))//2\r\nelse:\r\n parta=m\r\n\r\nprint(str(row)+' ' + str(parta)+ ' '+place)", "n, m, santa = map(int, input().split())\r\nd=santa//2+santa%2\r\nif d%m==0:\r\n l=m\r\nelse:\r\n l=d%m\r\nprint(d//m+(d%m!=0), l, [\"L\", \"R\"][santa%2==0])\r\n", "read = lambda: map(int, input().split())\r\nn, m, k = read()\r\np = (k - 1) // 2\r\nr = p // m + 1\r\nc = p % m + 1\r\nt = 'L' if k % 2 else 'R'\r\nprint(r , c, t)\r\n", "z=input('')\r\nz=z.split()\r\nq=int(z[0])\r\nw=int(z[1])\r\ne=int(z[2])\r\nm=''\r\nif e%2!=0:\r\n m='L' \r\nelif e%2==0:\r\n m='R'\r\na=0\r\ns=0\r\nd=0\r\nfor r in range (q):\r\n if d!=e:\r\n s=0\r\n a=a+1\r\n for vb in range(w):\r\n if d!=e:\r\n s=s+1\r\n d=d+1\r\n if d!=e:\r\n d=d+1\r\nprint(a,s,m)\r\n\r\n", "n,m,k=[int(t) for t in input().split(\" \")]\r\nr=k//(2m)\r\nif k%(2m)!=0:\r\n r+=1\r\np=k-2m(r-1)\r\nd=p//2\r\nif p%2!=0:\r\n d+=1\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)", "s=input()\r\nnums=s.split(\" \")\r\nr=int(nums[0])\r\np=int(nums[1])\r\nmesto=int(nums[2])\r\n\r\npm = (mesto+1)//2 \r\nrs=(pm-1) // p + 1\r\nps=(pm) % p\r\nif ps==0:\r\n ps=p\r\n\r\nif mesto%2==0:\r\n side='R'\r\nelse:\r\n side='L'\r\n \r\nprint(rs, ps, side)", "n, m, k = map(int, input().split())\r\nA = [\"L\", \"R\"]\r\nres1 = (k + 2 m - 1) // (2 * m)\r\nres2 = (k - 2 * m * (res1 - 1) + 1) // 2\r\nres3 = (k - 2 * m * res1 + 1 - res2 * 2) % 2\r\nprint(res1, res2, A[res3])", "n,m,k = map(int,input().split(' '))\nif k % 2 == 0:\n position = 'R'\nelse:\n position = 'L'\n\np = (k-1) // 2\ni,j = (p // m) +1, p % m +1\n\nprint(i,j,position)\n", "import math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nr, d, s = 0, 0, \"\"\r\n\r\nif k % 2:\r\n s = \"L\"\r\nelse:\r\n s = \"R\"\r\n\r\nr = k / (m2)\r\nr = math.ceil(r)\r\n\r\nr_start = 2 m * (r-1) + 1\r\nr_end = r_start + (2 * m) - 1\r\n\r\ni = r_start\r\nwhile i <= k:\r\n d += 1\r\n i += 1\r\n\r\nprint(r, math.ceil(d/2), s)\r\n", "n, m, k = map(int, input().split())\na = -(-k // (2 * m))\nb = -(-(k - (a - 1) * (2 * m)) // 2) \nc = \"RL\"[k % 2]\nprint(\"{} {} {}\".format(a, b, c))", "n, m, k = map(int, input().split())\r\nrad = (k - 1) // (2 * m) + 1\r\nparta = ((k - 1) % (2 * m)) // 2 + 1\r\nif (k % 2) == 0:\r\n print(rad, parta, \"R\")\r\nelse:\r\n print(rad, parta, \"L\")\r\n", "a,b,c=map(int,input().split())\r\nk=c//(2b)+1\r\nif c%(2b)==0:\r\n k-=1\r\nh='R'\r\nif c%2==1:\r\n h='L'\r\nj=(c%(2b))\r\nif j==0:\r\n r=b\r\nelse:\r\n r=j//2+j%2\r\nprint(k,r,h)", "\r\ndef main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n lane = 0\r\n while k >2 m * lane:\r\n lane += 1\r\n if not k % 2:\r\n b = k - 1\r\n else:\r\n b = k\r\n desk = ((b % (2 * m)) + 1) // 2\r\n if not k % 2:\r\n s = \"R\"\r\n else:\r\n s = \"L\"\r\n return f\"{lane} {desk} {s}\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nLane = ceil(X[2] / (X[1] * 2))\r\nDesk = ceil((X[2] - (Lane - 1) * X[1] * 2) / 2)\r\nprint(str(Lane), str(Desk), end=' ')\r\nprint('L' if X[2] % 2 != 0 else 'R')\r\n", "import sys\r\n\r\n#n, m, k = [int(i) for i in sys.stdin.read().splitlines()[0].split()]\r\nn, m, k = [int(i) for i in input().splitlines()[0].split()]\r\n\r\nlane = (k - 1) // (2 * m) + 1\r\ndesk = (k - 1) % (2 * m) // 2 + 1\r\nposition = 'R' if k % 2 == 0 else 'L'\r\n\r\nprint(lane, desk, position)\r\n", "N, M, K = map(int, input().split())\r\nrow_size = 2 * M\r\nK -= 1\r\nrow = K // row_size\r\nK %= row_size\r\nside = 'L' if K % 2 == 0 else 'R'\r\nd = K // 2\r\n\r\nprint(row + 1, d + 1, side)\r\n", "def rorl(x):\r\n if x % 2 == 0:\r\n return \"R\"\r\n else:\r\n return \"L\"\r\nimport math\r\nrow,column,target = map(int,input().split(\" \"))\r\nprint(str(math.ceil(target / (2column))) + \" \" + str(((target-1) % (column2) )//2 + 1) + \" \" + rorl(target))\r\n", "n, m, k = map(int, input().split(' '))\r\nif k % 2 == 1:\r\n lr = 'L'\r\n k += 1\r\nelse:\r\n lr = 'R'\r\nr = int((k/2 - 1) % m + 1)\r\nc = int((k/2 - 1) // m + 1)\r\nprint(c, r, lr)", "n, m, k = map(int, input().split())\r\nif k % (2m) == 0:\r\n a = k // (2m)\r\nelse:\r\n a = k // (2m) + 1\r\n\r\nb = (a-1)(2m)\r\nif k % 2 == 0:\r\n b += 2\r\nelse:\r\n b += 1\r\n\r\nprint(a, (k - b) // 2 + 1, \"R\" if k % 2 == 0 else \"L\")", "import math\nn,m,k = input().split()\nn = int(n)\nm = int(m)\nk = int(k)\nl = math.ceil(k/2)\nif l%m == 0:\n b = m\nelse:\n b = l%m\nif k%2 == 0:\n a = \"R\"\nelse:\n a = \"L\"\nprint(math.ceil(l/m),b,a)\n\n \t\t \t\t \t\t\t\t \t\t\t \t \t\t\t \t\t\t", "from math import ceil\r\nn, m, k=map(int, input().split())\r\n\r\nif k%2:\r\n\tpos=\"L\"\r\n\td=(k//2)+1 #As they are pairs, position in column\r\nelse:\r\n\tpos=\"R\"\r\n\td=k//2\r\np=m2 \r\n\r\n# For reference:\r\n# 1.[1,2] [9,10] [17,18] [25,26]\r\n# 2.[3,4] [11,12] [19,20] [27,28]\r\n# 3.[5,6] [13,14] [21,22] [29,30]\r\n# 4.[7,8] [15,16] [23,24] [31,32]\r\n\r\n\r\n# 1.[1,2] [9,10] [17,18] \r\n# 2.[3,4] [11,12] [19,20] \r\n# 3.[5,6] [13,14] [21,22] \r\n# 4.[7,8] [15,16] [23,24] \r\n\r\ncol=d%m #Finding Column\r\nif col==0:\r\n\tcol=m\t\r\nrow=ceil(k/p) #Row\r\nif row==0:\r\n\trow=n\r\nprint(row, col , pos)", "n, m, k = map(int, input().split(\" \"))\r\np = k // 2 - 1 if k % 2 == 0 else k // 2\r\nprint(str((p // m) + 1) + \" \" + str((p % m) + 1) + \" \" + (\"R\" if k % 2 == 0 else \"L\"))\r\n", "n, m, k = map(int, input().split())\r\nrow = (k + m * 2 - 1) // (m * 2)\r\ntable = (k - ((m * 2) * (row - 1) + 1)) // 2 + 1\r\nplace = ''\r\nif k % 2 == 0:\r\n place = 'R'\r\nelse:\r\n place = 'L'\r\nprint(row, table, place)", "n, m, k = map(int, input().split())\nprint((k - 1) // (2 * m) + 1, ((k - 1) % (2 * m) + 2) // 2, \"R\" if ((k - 1) % (2 * m) + 1) % 2 == 0 else \"L\")", "n, m, k = [int(i) for i in input().split()]\n\no = [None, None, None]\n\no[2] = \"L\" if k % 2 else \"R\"\n\nk += -(1 - (k % 2)) - 1\n\nk //= 2\n\no[0] = k // m + 1\n\no[1] = k % m + 1\n\nprint(' '.join([str(i) for i in o]))\n", "n,m,k = map(int,input().split())\n\n\ndef getRyad(n,m,k):\n r = 1\n mest_v_radu = m * 2\n while n != 0: \n if mest_v_radu < k:\n r += 1\n mest_v_radu = mest_v_radu + m * 2\n n -= 1\n else:\n return r\n\n\ndef getParta(r,m,k):\n parta = rm2\n while m != 0:\n if (parta == k) or (parta-1 == k):\n return m\n else:\n m -= 1\n parta -= 2\n \n\ndef getStorona(k):\n if k % 2 == 0:\n return 'R'\n else:\n return 'L'\n\n\nr = getRyad(n,m,k)\nd = getParta(r,m,k)\ns = getStorona(k)\n\nprint(r,d,s)\n\n", "import math\r\nn, m, k = map(int, input().split())\r\nr = math.ceil(k/(2m))\r\nd = math.ceil(abs(k-(r-1)2m)/2)\r\nprint(r, d, 'L' if k % 2 != 0 else 'R')", "# print(\"Input n, m, and k\")\nc,r,k = [int(x) for x in input().split()]\n\nzerobasek = k - 1\nsinglenum = zerobasek // 2\n\nzerobasec = singlenum // r\nzerobaser = singlenum % r\n\nprint(zerobasec + 1, end = ' ')\nprint(zerobaser + 1, end = ' ')\nif k%2 == 0:\n print(\"R\")\nelse:\n print(\"L\")\n", "n, m, k = map(int,input().split())\r\nt = (k + 1) // 2 #12\r\nd = ((t-1) // m)+ 1\r\nr = t % m\r\nif r == 0:\r\n r = m\r\n\r\nif k % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(d,r,s)\r\n\r\n", "n,m,k = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\n# m = int(input()) \r\n# k = int(input())\r\nrealval = k\r\n\r\nif k%2 == 0:\r\n pass\r\nelse:\r\n k = k+1\r\n\r\nx = (k/2) % m\r\n\r\nif x==0:\r\n x = m\r\n\r\n\r\ny = (k-2) // (m2) + 1 \r\ny= y%n \r\n\r\nif y == 0:\r\n y = n\r\n\r\n\r\nx = int(x)\r\ny = int(y)\r\n\r\nif realval%2 == 0:\r\n print(y,x,\"R\")\r\nelse:\r\n print(y,x,\"L\")\r\n\r\n\r\n \r\n\r\n \r\n\r\n ", "import math\r\n\r\nn, m, k = map(int, input().split())\r\nprint(math.ceil(math.ceil(k / 2) / m), end=' ')\r\n\r\nif math.ceil(k / 2) % m == 0:\r\n print(m, end=' ')\r\nelse:\r\n print(math.ceil(k / 2) % m, end=' ')\r\n\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n,m,k = map(int,input().split())\r\na = []\r\np = 1\r\nfor i in range(m): a += [[p,p+1]]; p += 2\r\np -= 1\r\nx = -(-k//p)\r\nif k % 2 == 0: z = \"R\"\r\nelse: z = \"L\"\r\nif k % p == 0: y = m\r\nelse:\r\n for i in range(m):\r\n if k%p in a[i]: y = i+1; break\r\nprint(x,y,z)", "num_lanes, desks_per_lane, santa = map(int, input().split())\n\nleftright = 'L' if santa % 2 == 1 else 'R'\n\nlane = 1\npos = 0\nfound = False\nwhile not found:\n pos += desks_per_lane * 2\n if santa <= pos:\n found = True\n break\n lane += 1\n\ndesknumber = ((santa-1) % (desks_per_lane2)) // 2 + 1\n\nprint(lane, desknumber, leftright)\n", "n, m, k = map(int, input().split())\r\nn_row = (k-1) // (2m) + 1\r\nmod = (k-1) % (2m)\r\nn_par = mod // 2 + 1\r\n\r\nprint(n_row, n_par, end=\" \")\r\nif k % 2 == 1:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "n, m, k = map(int, input().split())\r\nr = k // (2 m)\r\nif k % (2 * m) != 0:\r\n r += 1\r\ntmp = k - 2 * m * (r - 1)\r\nd = tmp // 2\r\nif tmp % 2 != 0:\r\n d += 1\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)\r\n", "from math import \r\n\r\nn, m, k = [int(x) for x in input().split()]\r\ntmp1 = ceil(k / (2 m))\r\ntmp2 = k - (tmp1 - 1) * 2 * m\r\ntmp3 = ceil(tmp2 / 2)\r\nif k % 2 == 0:\r\n print(tmp1, tmp3, 'R')\r\nelse:\r\n print(tmp1, tmp3, 'L')", "n, m, k = map(int, input().split())\r\n\r\n# Determine the row and column of Santa Claus' place\r\nrow = (k - 1) // (2 * m) + 1\r\ncol = ((k - 1) // 2) % m + 1\r\n\r\n# Determine which side Santa Claus should sit on\r\nside = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nprint(row, col, side)\r\n", "n, m, k = (int(i) for i in input().split())\nres = (k + 2 * m - 1) // (2 * m), ((k - 1) % (2 * m)) // 2 + 1, \"L\" if k & 1 == 1 else \"R\"\nprint(res)\n", "[n, m, k] = [int(x) for x in input().split()]\r\nprint((((k+1)//2)+m-1)//m, ((k-1)//2)%m + 1, 'L' if k%2 == 1 else 'R')\r\n", "n,m,k=map(int,input().split())\r\na=[]\r\np=1\r\nfor i in range(m): \r\n a+=[[p,p+1]] \r\n p+=2\r\np-=1\r\nx=-(-k//p)\r\nif k%2==0: \r\n z=\"R\"\r\nelse: \r\n z=\"L\"\r\nif k%p==0: \r\n y=m\r\nelse:\r\n for i in range(m):\r\n if k%p in a[i]: \r\n y=i+1\r\n break\r\nprint(x,y,z)", "n,m,k=map(int,input().split())\r\np,c,r=0,0,0\r\nif k%2==0:\r\n p=k//2\r\nelse:\r\n p=(k//2)+1\r\nif p%m==0:\r\n c=p//m\r\nelse:\r\n c=(p//m)+1\r\nif p%m==0:\r\n r=m\r\nelse:\r\n r=p%m\r\nif k%2==0:\r\n print(c,r,\"R\")\r\nelse:\r\n print(c,r,\"L\")", "n,m,k = list(map(int,input().split()))\r\nprint((k+(m<<1)-1)//(m<<1), ((k-1)//2)%m+1, ['R','L'][k%2])\r\n", "n,m,k=list(map(int,input().split()))\r\n\r\nrow=k/(2m)\r\nif row>k//(2m):\r\n row=k//(2m)+1\r\nelse:\r\n row=int(k/(2m))\r\n\r\nplace=(k-((row-1)2m+1))\r\n\r\nif place%2==0:\r\n x='L'\r\nelse:\r\n x='R'\r\n\r\nprint(row,place//2+1,x)\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,k = map(int,input().split())\r\nk-=1\r\nlane = k//(m2)\r\nintermediate = k - lane(m2)\r\ndesk = intermediate//2\r\nprint (lane+1,desk+1,['L','R'][intermediate%2])", "n,m,a = input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nl=1\r\nd=1\r\nwhile(a>2m):\r\n a=a-2m\r\n l=l+1\r\nwhile(a>2):\r\n a=a-2\r\n d=d+1\r\nif(a==1):\r\n c='L'\r\nelse:\r\n c='R'\r\nprint(l,d,c)\r\n\r\n", "n,m,k = map(int,input().split())\nlr = 'L'\nif k% 2 == 0:\n lr = 'R'\nk = (k+1)//2\nlane = (k+m-1)//m\ndesk = k%m\nif desk == 0:\n desk = m\nprint('{} {} {}'.format(lane,desk,lr))\n", "n,m,k=map(int, input().split())\r\nx=2m\r\nif k%x==0:\r\n r=k//x\r\n ost=x\r\nelse:\r\n r=k//x+1\r\n ost=k%x\r\nif k%2==0:\r\n d=ost//2\r\n s='R'\r\nelse:\r\n d=ost//2+1\r\n s='L'\r\nprint(r,d,s,sep=' ')\r\n", "n, m, k = list(map(int, input().split()))\r\n\r\nryad = (k-1) // (m 2) + 1\r\ntable = (k + 1 - (ryad - 1) * m * 2) // 2\r\n\r\nif k % 2 == 0:\r\n direct = 'R'\r\nelse:\r\n direct = 'L'\r\n\r\nprint(ryad, table, direct)", "import math\r\nn,m,k = map( int ,( input() .split() ) )\r\nlanenumber=math.ceil(k/(2m))\r\ndesknumber=math.ceil((k-(lanenumber-1)(2m)) / 2)\r\nc=0\r\nif k%2==0:\r\n c='R'\r\nelse:\r\n c='L'\r\nprint(lanenumber,desknumber,c)\r\n\r\n", "n,m,k=list(map(int,input().split()))\r\n\r\n\r\n\r\nif k%2==0:\r\n p = k//2\r\n q=p%m\r\n s=p//m\r\n if q>0:\r\n print(s+1,q,'R')\r\n elif q==0:\r\n print(s,m,'R')\r\nelse:\r\n p = (k+1)//2\r\n q=p%m\r\n s=p//m\r\n if q>0:\r\n print(s+1,q,'L')\r\n elif q==0:\r\n print(s,m,'L')\r\n \r\n", "n,m,k = [int(i) for i in input().split(' ')]\nprint(((k-1)//2)//m + 1,(((k-1)//2)%m + 1),((k-1)%2'R')+(k%2'L'))", "n, m, k = map(int, input().split())\r\nx = (k-1) // (m 2)+1\r\ny = (k-1) % (2 * m)\r\nprint(x, y//2+1, \"R\" if k % 2 == 0 else \"L\")\r\n", "n, m, k = map(int, input().split())\r\nk -= 1\r\nprint(1 + k // 2 // m, 1 + k % (2 * m) // 2, end = ' ')\r\nif k % 2:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n,m,k = map(int,input().split())\r\n\r\ns = str(((k-1)//2)//m+1)\r\ns += ' '+str(((k-1)//2)%m+1)\r\nif(k%2==0):\r\n s += ' R'\r\nelse:\r\n s += ' L'\r\nprint(s)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\ncol,row,k = get_int_list()\r\n\r\ncol_capacity = row2\r\nno_of_col = k//col_capacity\r\nif k%col_capacity != 0:\r\n no_of_col += 1\r\nresidue = k%col_capacity \r\n\r\nif residue%2 == 0:\r\n side = 'R'\r\nelse:\r\n side = 'L'\r\n\r\nif residue == 0:\r\n no_row = row\r\nelse:\r\n no_row = residue//2 + residue%2\r\nprint(no_of_col,no_row,side)", "#\r\n# Created by Daniil Kozhanov. All rights reserved.\r\n# January 2017\r\n\r\nn, m, k = map(int, input().split())\r\nm2 = m 2\r\n\r\nif k % m2 == 0:\r\n r = k // m2\r\nelse:\r\n r = k // m2 + 1\r\n\r\nif k % 2 == 0:\r\n s = \"R\"\r\n d = (k - (r - 1) * m2) // 2\r\nelse:\r\n s = \"L\"\r\n d = (k - (r - 1) * m2) // 2 + 1\r\nprint(r, d, s)", "st = input()\r\n\r\nans = [0] * 3\r\n\r\nn, m, k = map(int, st.split())\r\npl = (k + 1) // 2\r\n\r\nans[0] = (pl - 1) // m + 1\r\nans[1] = ((pl - 1) % m) + 1\r\nans[2] = 'R' if not k % 2 else 'L'\r\n\r\nprint(ans)\r\n# print(pl)\r\n", "n, m, k = map(int, input().split())\r\nif k%(2m) == 0:\r\n r = k//(2m)\r\nelse:\r\n r = k//(2m) + 1\r\nd = k%(2m)\r\nif d == 0:\r\n d = 2m\r\nif d%2 == 0:\r\n d = d//2\r\nelse:\r\n d = d//2+1\r\nif k%2 == 0:\r\n z = 'R'\r\nelse:\r\n z = 'L'\r\nprint(r, d, z)\r\n", "n, m, k = map(int, input().split())\r\nrow = ((k + 1) // 2 - 1) // m + 1\r\ns = ['R', 'L']\r\ndesk = (k + 1) // 2 - m * (row - 1)\r\nprint(row, desk, s[k % 2])", "n,m,k = list(map(int, input().strip().split()))\r\n\r\nk = k - 1\r\n\r\ncol = k // (2m)\r\nrow = (k % (2m)) // 2\r\nc = 'L'\r\nif (k % (2m)) % 2 == 1: c = 'R'\r\n\r\nprint(col+1, row+1, c)", "a=input().split(' ')\nn=int(a[0])\nm=int(a[1])\nk=int(a[2])\n\nlol=1\nkek=1\nt=False\nu=False\nside=None\nwhile not t:\n if k<=m2lol:\n t=True\n else:\n lol+=1\nd=m2lol\nr=int(d/(2m))\nwhile not u:\n if (d-m2)+kek2>=k:\n u=True\n else:\n kek+=1\nif k%2==0:\n side='R'\nelse:\n side='L'\nprint(str(r),str(kek),side)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output.out\",'w')\r\nn,m,k=map(int,input().split())\r\np=(k-1)//2\r\nr=(p//m)+1\r\nd=p%(m)+1\r\nif k%2!=0:\r\n\tprint(r,d,\"L\")\r\nelse:\r\n\tprint(r,d,\"R\")\t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m,k = map(int, wtf[0].split())\r\n d = math.ceil(k/2) % m\r\n if d == 0:\r\n d = m\r\n r = math.ceil(math.ceil(k/(2m)))\r\n s = 'L'\r\n if k%2 == 0:\r\n s = 'R'\r\n print(r, d, s)\r\n", "import math\n\nn, m, k = map(int, input().split())\ncolumn = math.ceil(k1.0/(2m))\nrow = math.ceil((k - (column - 1) 2 * m) * 1.0 / 2)\nside = 'L' if k % 2 == 1 else 'R'\nprint(column, row, side)", "n, m, k = map(int, input().split())\r\nc = 'R'\r\nif k & 1:\r\n c = 'L'\r\n\r\npos = (k - 1) // 2 # n + m \r\nlane = (pos // m) + 1\r\ndesk = pos % m +1\r\nprint(lane, desk, c)", "import math\r\nn,m,k=map(int,input().split())\r\nlane=math.ceil(k/(m2))\r\nred=k%(2m)\r\nif(red==0):\r\n print(lane,m,\"R\")\r\nelse:\r\n if(k%2==0):\r\n print(lane,(red+1)//2,\"R\")\r\n else:\r\n print(lane,(red+1)//2,\"L\")\r\n\r\n", "n, m, n = map(int, input().split())\r\n\r\np = (n - 1) // 2\r\ny = (p // m) + 1\r\nx = (p % m) + 1\r\n\r\nif n % 2 == 0:\r\n print(y, x, 'R')\r\nif n % 2 == 1:\r\n print(y, x, 'L')\r\n", "\r\nline=[int(i) for i in input().split()]\r\nn=line[0]\r\nm=line[1]\r\nk=line[2]\r\ngrid=[]\r\n#print(n,m,k)\r\n\r\nans=\"\"\r\ngrid=[]\r\ncount=1\r\nfor i in range(n):\r\n grid.append(count)\r\n if(k<grid[len(grid)-1] and k>=grid[len(grid)-2]):\r\n \r\n ans+=str(i)\r\n c2=grid[len(grid)-2]\r\n for j in range(m):\r\n if(k==c2):\r\n ans+=\" \"+str(j+1)+\" L\"\r\n if(k==c2+1):\r\n ans+=\" \"+str(j+1)+\" R\"\r\n \r\n c2+=2\r\n break\r\n count+=m2\r\n #n m k\r\n #4 3 9\r\nif(ans==\"\"):\r\n \r\n ans+=str(n)\r\n c2=(m)2(n-1)\r\n c2+=1\r\n for j in range(m):\r\n if(k==c2):\r\n ans+=\" \"+str(j+1)+\" L\"\r\n if(k==c2+1):\r\n ans+=\" \"+str(j+1)+\" R\"\r\n \r\n c2+=2\r\n \r\nprint(ans)\r\n \r\n \r\n ", "r,p,n=map(int,input().split())\nprint((n-1)//(p2)+1,(n-1)%(p2)//2+1,sep=' ',end=' ')\nif n%2==0:print('R')\nelse: print('L')\n", "def get_place(rows, dpr, k): # n=rows; m=dpr\n k -= 1\n dn = k // 2\n return (dn // dpr + 1, dn % dpr + 1, 'LR'[k % 2])\n\ndef m():\n print(get_place(map(int, input().split(' '))))\n\nif __name__ == \"__main__\":\n m()\n\n", "n, m, k = map(int, input().split())\n\nr = k // (2 m) + (1 if k % (2 * m) else 0)\n\nc = ((k - 1) // 2) % m + 1\n\nif k & 1:\n\ts = 'L'\nelse:\n\ts = 'R'\n\nprint(r, c, s)", "n,m,k=map(int,input().split())\r\nif k%2==0:\r\n z=k//2\r\n d='R'\r\nelse:\r\n z=(k+1)//2\r\n d='L'\r\nx=1\r\ni=0\r\nwhile 1:\r\n if x>z:\r\n break\r\n else:\r\n x=x+m\r\n i+=1\r\nif z%m!=0:\r\n z=z%m\r\nelse:\r\n z=m\r\nprint(i,z,d)", "n,m,k=map(int,input().split())\r\nr=(((k-1)//2)+1)//m\r\nif (((k-1)//2)+1)%m!=0:\r\n r+=1\r\nd=(((k-1)//2)+1)%m\r\nif d==0:\r\n d=m\r\nif k%2==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)\r\n", "n, m, k = map(int, input().split())\r\nr = 0\r\ns = 0\r\nRL = ''\r\nfor i in range(1,n+1):\r\n\tif(mi2>=k):\r\n\t\tr = i\r\n\t\t#print('r=',r)\r\n\t\tbreak\r\nk = k - (r-1)m2\r\n#print('k=',k)\r\ns = int((k+1)/2)\r\n#print('s=',s)\r\nif((k % 2) == 0):\r\n\tRL = 'R'\r\nelse:\r\n\tRL = 'L'\r\nprint(r, s, RL)\r\n", "lanes, desk ,position = [int(x) for x in input().split()]\r\nOneOrTwo = [\"R\", \"L\"][position % 2]\r\nrow = (position - 1) // (desk * 2) + 1\r\ncol = ((position - 1) % (desk * 2) // 2) + 1\r\nprint(row, col, OneOrTwo)", "string = input()\nstring = string.split()\nn = int(string[0])\nm = int(string[1])\nk = int(string[2])\n\n\nif k % 2 != 0:\n s =\"L\"\n k +=1\nelse:\n s = \"R\"\n\n\nr = k//(m2)\nif k % (m2) != 0:\n r += 1\n\nd = (k % (m2)) //2\nif d == 0:\n d = m\n\n\nprint(r, d, s)\n", "n, m, k = map(int, input().split())\r\n\r\nx = k%(m2)\r\na = k//(m2) + (x>0)\r\nb = (x+1)//2\r\nprint(a, (x+1)//2 if x!= 0 else m, 'L' if x%2 == 1 else 'R')", "n, m, k = [int(x) for x in input().split()]\r\n\r\nif k % 2 == 0:\r\n kk = k\r\n direction = 'R'\r\nelse:\r\n kk = k + 1\r\n direction = 'L'\r\n\r\nkk //= 2\r\n\r\nlane = kk // m\r\n\r\nif kk % m != 0:\r\n lane += 1\r\n\r\ndesk = kk % m\r\n\r\nif desk == 0:\r\n desk = m\r\n\r\nprint(lane, desk, direction)\r\n", "n,m,k = map(int,input().split())\r\n\r\nx = (k+1)//2\r\n\r\nr = (x+m-1)//m\r\nc = (x-1)%m+1\r\nch = 'R'\r\nif k&1:\r\n ch = 'L'\r\nprint(r,c,ch)", "n, m, k = map(int, input().split())\r\nnum = (k + 1) // 2\r\nif (num % m == 0):\r\n print(num // m, end = ' ')\r\nelse:\r\n print(num // m + 1, end = ' ')\r\nif (num % m == 0):\r\n print(m, end = ' ')\r\nelse:\r\n print(num % m, end = ' ')\r\nif (k % 2 == 1):\r\n print(\"L\")\r\nelse:\r\n print(\"R\")", "n,m,k=map(int,input().split())\nif k%2==0:\n s='R'\nelse:\n s='L'\nc=(k-1)//(2m)\nr=((k-1)%(2m))//2\nprint(c+1,r+1,s)\n", "n, m, k = map(int, input().split())\r\ni = 1\r\nstop = 0\r\nwhile stop != 1:\r\n if (k >= 2 (i - 1) * m + 1) and (k <= 2 * i * m) :\r\n r = i\r\n d = 1 + (k - (2 * (i - 1) * m + 1)) // 2\r\n if k % 2 == 0:\r\n s = \"R\"\r\n else:\r\n s = \"L\"\r\n stop = 1\r\n i += 1\r\nprint(r,d,s)\r\n\r\n", "n,m,k=map(int,input().split())\r\nr=(k-1)//(m2)+1\r\nd=(k-1)%(m2)//2+1\r\nif k%2==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)\r\n", "import math\r\ninp1=list(map(int,input().strip().split()))[:3]\r\nr,c,val=inp1[0],inp1[1],inp1[2]\r\ndivi=c2\r\nif(val % 2):\r\n\tval1=val+1\r\n\tdir1='L'\r\nelse:\r\n\tval1=val\r\n\tdir1='R'\r\nrow=math.ceil(val1/divi)\r\nrem=val1 % divi\r\ncol=rem // 2\r\nif(rem==0):\r\n\tcol=c\r\nprint(row,col,dir1,end=\" \")\r\nprint()", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(107)\ninf = 1020\nmod = 109 + 7\n\n\ndef main():\n n,l,t = list(map(int, input().split()))\n a = (t+1)//2\n s = 'L' if t%2==1 else 'R'\n return ' '.join(map(str, [(a-1)//l+1, (a-1)%l+1, s]))\n\n\n\nprint(main())\n", "from math import ceil\r\nn, m, k = map(int, input().split())\r\nr = ceil(k / (m 2))\r\nc = k % (m * 2)\r\nc = m * 2 if c == 0 else c\r\nprint(r, end = ' ')\r\nprint(ceil(c / 2), end = ' ')\r\nprint('L' if c % 2 else 'R')", "n,m,k=map(int,input().split())\r\np=(k-1)//2\r\nr=(p//m)+1\r\nn=p%m+1\r\nprint(r,n, 'L' if k%2==1 else 'R')", "n,m,k=[int(i) for i in input().split()]\r\nryad=k//(2m)+1\r\nif k%(2m)==0:\r\n ryad-=1\r\nparta=(k-2m(ryad-1))//2+k%2\r\nif k%2==0:\r\n mesto='R'\r\nelse:\r\n mesto='L'\r\nprint(ryad,parta,mesto)", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\nif k % 2 == 0:\r\n k = int(k / 2)\r\n a = int(k / m)\r\n b = k % m\r\n if b != 0:\r\n print(a+1, b, 'R')\r\n else:\r\n print(a, m, 'R')\r\nelse:\r\n k = int((k +1) / 2)\r\n a = int(k / m)\r\n b = k % m\r\n if b != 0:\r\n print(a+1, b, 'L')\r\n else:\r\n print(a, m, 'L')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ndef solution(n, m, k):\r\n l = math.ceil(k/(2m))\r\n d = math.ceil((k-(2m(l-1)))/2)\r\n left_or_right = 'R' if k % 2 == 0 else 'L'\r\n return [l, d, left_or_right]\r\n\r\nn, m, k = [int(x) for x in input().strip().split(\" \")]\r\nans = solution(n, m, k)\r\nprint(ans[0], ans[1], ans[2])", "n, m, k = list(map(int, input().split()))\r\nr = (k - 1) // (m 2) + 1\r\nk -= (r - 1) * (2 * m)\r\nd = (k - 1) // 2 + 1\r\nif k % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)\r\n", "# https://codeforces.com/problemset/problem/748/A\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nlane = math.ceil(k / (2 * m))\r\n\r\ndesk = math.ceil((k - (2 * m * (lane - 1))) / 2)\r\n\r\nif k % 2 == 0:\r\n print(lane, desk, \"R\")\r\nelse:\r\n print(lane, desk, \"L\")\r\n", "n, m, k = map(int, input().split())\nz = (k + 2 * m - 1) // (2 * m)\nq = k % (2 * m)\nif q == 0:\n q = 2 * m\nq = (q + 1) // 2\nw = q % 2\nif k % 2:\n w = 'L'\nelse:\n w = 'R'\nprint(z, q, w)", "n, m , k = map(int, input().split())\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) % (2 * m)) // 2 + 1\r\nif k % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(r, d, s)\r\n", "n,m,k=map(int, input().split())\r\nimport sys\r\ni=0\r\nj=0\r\nm=2\r\nsch=0;\r\nd=(k-1)//m+1\r\nprint(d, end=' ')\r\nfor i in range(1+(d-1)m,md+1):\r\n j+=1\r\n if i==k:\r\n print((j-1)//2+1, end=' ')\r\n if k%2==1:\r\n print('L')\r\n else:\r\n print('R')\r\n sys.exit()\r\n", "s=list(map(int, input().split()))\r\nn=s[0]\r\nm=s[1]\r\nk=s[2]\r\nkolvr=2m\r\nif k%kolvr==0:\r\n r=k//kolvr\r\nelse:\r\n r=k//kolvr+1\r\nnachr=2m(r-1)\r\ni=k-nachr\r\nif i%2==0:\r\n d=i//2\r\nelse:\r\n d=i//2+1\r\nprint(r, end=' ')\r\nprint(d, end=' ')\r\nif k%2==0:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "from sys import stdin\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nc = (k - 2m(k//(2m)))\r\nif c == 0:\r\n r = m\r\nelse:\r\n r = (c - 1) // 2 + 1\r\nif c % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\ncol = k // (2m)\r\nif k % (2m) != 0:\r\n col += 1\r\nprint(col , r, s)", "n, m, k = map(int, input().split())\nprint((k + m 2 - 1) // (m * 2), ((k - 1) % (m * 2) + 2) // 2, 'L' if k % 2 else 'R')", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\ndef solve(case_no):\r\n n, m, k = map(int, input().split())\r\n x = 1\r\n y = 1\r\n while k > 2 * m:\r\n k -= 2 * m\r\n x += 1\r\n y = (k + 1) // 2\r\n print(x, y, \"R\" if (k + 1) % 2 == 1 else \"L\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "import math\n\nm, n, t = input().split()\nif int(t) % 2 == 0:\n t = int(t) / 2\n l = 'R'\nelse:\n t = (int(t) + 1) / 2\n l = 'L'\nx = math.ceil(t / int(n))\ny = int(t % int(n))\nif y == 0:\n y = int(n)\nprint(str(x)+' '+str(y)+' '+l)\n\t \t \t\t\t\t\t\t \t\t \t\t \t\t\t\t\t\t \t", "#!/usr/bin/python\n\ninp = [int(i) for i in input().split(' ')]\nn = inp[0]\nm = inp[1]\nk = inp[2]\n\nleft = 'L' if k%2==1 else 'R'\n\nspotsperlane = 2m\n\nlane = int(k/spotsperlane)\nif k%spotsperlane != 0:\n lane+=1\n\n\nk -= spotsperlane(lane-1)\nk/=2\n\nrow = int(k+.5)\n\nprint('{} {} {}'.format(lane, row, left))\n", "import math\r\nn,m,k=map(int,input().split())\r\nl=math.ceil(k/(2m))\r\nse=math.ceil((k-((l-1)2m))/2)\r\nprint(l,se,end=' ')\r\nif k%2==0:print('R')\r\nelse:print('L')", "import math\r\n\r\nlist = [int(i) for i in input().split()]\r\nn = list[0]\r\nm = list[1]\r\nk = list[2]\r\ns = \"\"\r\nif k%2==0:\r\n s=\"R\"\r\n k -= 1\r\nelse:\r\n s=\"L\"\r\n\r\n_n = int(math.ceil(k/(2m)))\r\n_m = math.ceil((k - int(k/(2m))(2m))/2)\r\n\r\nprint(\"%i %i %s\" % (_n, _m, s))\r\n\r\n\r\n", "from math import ceil\r\n\r\nn, m, k = map(int, input().split())\r\nrow = ceil(k/(2m))\r\nprint(row, ceil((k - 2m(row - 1))/2) , \"R\" if k%2==0 else \"L\")\r\n\r\n", "n, m, k = map(int, input().split())\r\n\r\nrow = (k - 1) // (2 * m) + 1\r\ncolumn = ((k - 1) // 2) % m + 1\r\nside = \"R\" if k % 2 ==0 else \"L\"\r\n\r\nprint(row, column, side)", "n,m,k=map(int,input().split())\r\nif k%(2m)==0:\r\n p=k//(2m)\r\nelse:\r\n p=k//(2m)+1\r\nif (k-2m(p-1))%2==0:\r\n mes=(k-2m(p-1))//2\r\nelse:\r\n mes=(k-2m(p-1))//2+1\r\nif k%2==0:\r\n pos='R'\r\nelse:\r\n pos='L'\r\nprint(p,mes,pos)\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nk -= 1\r\nans = [0, 0, 'R']\r\nif (k % 2 == 0):\r\n ans[2] = 'L'\r\nk //= 2\r\nans[0] = k // m + 1\r\nans[1] = k % m + 1\r\nprint(ans)\r\n\r\n", "a,b,c = map(int,input().split())\r\nt = 0\r\nr = 0 \r\nfor i in range(a):\r\n\tif c<=(b(i+1)2):\r\n\t\tt = c - (i)b2\r\n\t\tr = int(t/2)\r\n\t\tif c%2 == 1:\r\n\t\t\tr = r + 1\r\n\r\n\r\n\t\tprint(i+1,r,end=\" \")\r\n\t\tif c%2 == 1:\r\n\t\t\tprint(\"L\")\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"R\")\r\n\t\t\tbreak\r\n", "import math\r\nn,m,x=map(int,input().split())\r\nc=int(math.ceil(x/2/m))\r\nr=int(math.ceil((x-(c-1)2m)/2))\r\n\r\nif(x%2==0):\r\n print('%d %d R'%(c,r))\r\nelse:\r\n print('%d %d L' % (c, r))", "x,y,z=map(int,input().split())\r\ns=(z+(2y-1))//(2y)\r\nd=((z+1)//2+y-1)%y+1\r\nprint(s,d,['R','L'][z%2])", "import math\r\nn,m,k=map(int,input().split())\r\na=math.ceil(k/(m2))\r\nb=math.ceil((k%(m2))/2 )\r\nif b==0:\r\n b=m\r\nif (k%(m*2))%2==0:\r\n c='R'\r\nelse:\r\n c='L'\r\nprint(a,b,c)", "n, m, k = [int(x) for x in input().split()]\r\n\r\ntm = m << 1\r\n\r\nlane = (k - 1) // tm\r\n\r\nr = (k - 1) % tm\r\n\r\ndesk, s = r >> 1, r & 1\r\n\r\nprint(lane + 1, desk + 1, 'L' if s == 0 else 'R')", "import sys\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\n \na,b,c = get_ints()\nd=\"R\"\n\nif c%2==0:\n d=\"R\"\n \nelse:\n d=\"L\"\n c=c+1\n\nc=c/2\nc=c-1\nr=c%b\ne=c//b\nr+=1\ne+=1\nr=int(r)\ne=int(e)\nprint (e,r,d)\n \t\t \t \t\t\t\t\t \t\t \t \t\t\t\t" ]	{"inputs": ["4 3 9", "4 3 24", "2 4 4", "3 10 24", "10 3 59", "10000 10000 160845880", "1 1 1", "1 1 2", "1 10000 1", "1 10000 20000", "10000 1 1", "10000 1 10000", "10000 1 20000", "3 2 1", "3 2 2", "3 2 3", "3 2 4", "3 2 5", "3 2 6", "3 2 7", "3 2 8", "3 2 9", "3 2 10", "3 2 11", "3 2 12", "300 2000 1068628", "300 2000 584756", "300 2000 268181", "10000 9999 186450844", "10000 9999 197114268", "10000 9999 112390396", "10000 10000 1", "10000 10000 2", "10000 10000 100000001", "10000 10000 199999999", "10000 10000 200000000", "1 2 1", "1 2 2", "1 2 3", "1 2 4", "2 1 1", "2 1 2", "2 1 3", "2 1 4", "4 3 7", "1 1 1"], "outputs": ["2 2 L", "4 3 R", "1 2 R", "2 2 R", "10 3 L", "8043 2940 R", "1 1 L", "1 1 R", "1 1 L", "1 10000 R", "1 1 L", "5000 1 R", "10000 1 R", "1 1 L", "1 1 R", "1 2 L", "1 2 R", "2 1 L", "2 1 R", "2 2 L", "2 2 R", "3 1 L", "3 1 R", "3 2 L", "3 2 R", "268 314 R", "147 378 R", "68 91 L", "9324 4745 R", "9857 6990 R", "5621 818 R", "1 1 L", "1 1 R", "5001 1 L", "10000 10000 L", "10000 10000 R", "1 1 L", "1 1 R", "1 2 L", "1 2 R", "1 1 L", "1 1 R", "2 1 L", "2 1 R", "2 1 L", "1 1 L"]}	UNKNOWN	PYTHON3	CODEFORCES	336
d1852fd6497c284277904fff7cf01797	Weak Subsequence	Little Petya very much likes strings. Recently he has received a voucher to purchase a string as a gift from his mother. The string can be bought in the local shop. One can consider that the shop has all sorts of strings over the alphabet of fixed size. The size of the alphabet is equal to k. However, the voucher has a string type limitation: specifically, the voucher can be used to purchase string s if the length of string's longest substring that is also its weak subsequence (see the definition given below) equals w. String a with the length of n is considered the weak subsequence of the string s with the length of m, if there exists such a set of indexes 1<=≤<=i1<=<<=i2<=<<=...<=<<=in<=≤<=m, that has the following two properties: - ak<==<=sik for all k from 1 to n; - there exists at least one such k (1<=≤<=k<=<<=n), for which ik<=+<=1<=–<=ik<=><=1. Petya got interested how many different strings are available for him to purchase in the shop. As the number of strings can be very large, please find it modulo 1000000007 (109<=+<=7). If there are infinitely many such strings, print "-1". The first line contains two integers k (1<=≤<=k<=≤<=106) and w (2<=≤<=w<=≤<=109) — the alphabet size and the required length of the maximum substring that also is the weak subsequence, correspondingly. Print a single number — the number of strings Petya can buy using the voucher, modulo 1000000007 (109<=+<=7). If there are infinitely many such strings, print "-1" (without the quotes). Sample Input 2 2 3 5 2 139 Sample Output 10 1593 717248223	[ "from sys import stdin #Bibliotecas para optimizar la entrada/salida\r\nfrom sys import stdout\r\n\r\nMOD = 1000000007 #Modulo\r\n\r\ndef qp(a,p): #Exponenciacion binaria O(log p)\r\n a = int(a)\r\n p = int(p)\r\n if p == 0:\r\n return 1\r\n x = qp(a,p//2)\r\n x = (xx)%MOD\r\n if p%2 == 1:\r\n x = (xa)%MOD\r\n return x\r\n\r\ndef inv(a): #inverso multiplicativo, ya que el modulo es primo usamos el pequeño teorema de fermat para hallarlo\r\n return qp(a,MOD-2)\r\n\r\n\r\ninputs = list(map(int,stdin.readline().split())) #lee la entrada\r\nk,w = inputs[0],inputs[1] \r\n\r\n\r\n\r\nfact = [0 for i in range(k+1)] #Lista que va a mantener para cada valor entre 0 y k el factorial de ese numero (modulado)\r\nifact = [0 for i in range(k+1)] #Lista que va a mantener para cada valor entre 0 y k el inverso multiplicativo del factorial de ese numero.\r\n\r\n#Computamos el factorial recursivamente\r\nfact[0] = 1\r\nfor i in range(1,k+1):\r\n fact[i] = (fact[i-1]i)%MOD\r\n\r\n#Computamos el inverso multiplicativo del factorial recursivamente teniendo en cuenta que (k!)^(-1) = ((k+1)!^(-1))k+1\r\nifact[k] = inv(fact[k])\r\nfor i in range(2,k+2):\r\n ifact[k + 1 - i] = (ifact[k + 2 - i](k + 2 - i))%MOD\r\n\r\ninvk = inv(k) #variable que guarda el inverso multiplicativo de k\r\n\r\n#Lista que almacena en la posicion i el valor (k^(w-i))%MOD\r\nqpk = [0 for i in range(k+1)]\r\nqpk[0] = qp(k,w)\r\nfor i in range(k):\r\n qpk[i+1] = (qpk[i]invk) %MOD\r\n\r\nans = 0 #Variable para la respuesta\r\n\r\nfor i in range(1,k+1):\r\n subans = 1\r\n\r\n #Calculamos la cantidad de palabras cuyos sufijos de tamaño w son subcadenas buenas máximas\r\n if i < w:\r\n subans=fact[k]\r\n subans%=MOD\r\n subans=fact[k-1]\r\n subans%=MOD\r\n subans=qpk[i]\r\n subans%=MOD\r\n subans=i\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n else:\r\n subans=fact[k]\r\n subans%=MOD\r\n subans=fact[k-1-i+w]\r\n subans%=MOD\r\n subans=w\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n\r\n ans%=MOD\r\n\r\n #Calculamos la cantidad de palabras cuyos prefijos de tamaño w son subcadenas buenas máximas\r\n if i < k:\r\n if i+1 < w:\r\n subans=fact[k]\r\n subans%=MOD\r\n subans=fact[k-1]\r\n subans%=MOD\r\n subans= qpk[i+1]\r\n subans%=MOD\r\n subans=i\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n subans=ifact[k-i-1]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n else:\r\n subans=fact[k]\r\n subans%=MOD\r\n subans=fact[k-2-i+w]\r\n subans%=MOD\r\n subans=(w-1)\r\n subans%=MOD\r\n subans=ifact[k-i]\r\n subans%=MOD\r\n subans=ifact[k-i-1]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n\r\n ans%=MOD\r\n\r\nprint(int(ans))\r\n\r\n" ]	{"inputs": ["2 2", "3 5", "2 139", "5 6", "1000 1002", "131 132", "4 4", "3 2", "1 1000000000", "666 888888888", "1000000 1000000000", "1000000 1000000", "1000000 2", "2 1000000000", "1000000 500000", "12345 543210123", "1 2", "1 3", "1 4", "1 5", "1 6", "1 7", "1 8", "2 3", "2 4", "2 5", "2 6", "2 7", "2 8", "3 3", "3 4", "3 6", "3 7", "3 8", "4 2", "4 3", "4 5", "4 6", "4 7", "4 8", "5 2", "5 3", "5 4", "5 5", "5 7", "5 8", "6 2", "6 3", "6 4", "6 5", "6 6", "6 7", "6 8", "7 2", "7 3", "7 4", "7 5", "7 6", "7 7", "7 8", "8 2", "8 3", "8 4", "8 5", "8 6", "8 7", "8 8", "999999 1000001", "1000000 1000001", "1000000 999999", "1000000 999998", "1000000 999997", "1000000 1000002", "1000000 1000003", "983039 939524096", "998999 3", "987899 555555", "999009 55", "999009 818243", "999009 999004", "999009 999005", "999009 999006", "999009 999007", "999009 999008", "999009 999009", "999010 72", "999010 808035", "999010 999005", "999010 999006", "999010 999007", "999010 999008", "999010 999009", "999010 999010", "999011 64", "999011 133617", "999011 999006", "999011 999007", "999011 999008", "999011 999009", "999011 999010", "999011 999011"], "outputs": ["10", "1593", "717248223", "983725", "9396758", "757914194", "4912", "57", "1", "424798470", "600002237", "438349146", "739181318", "851562506", "53435433", "290786804", "1", "1", "1", "1", "1", "1", "1", "20", "40", "80", "160", "320", "640", "177", "531", "4779", "14337", "43011", "292", "1216", "19648", "78592", "314368", "1257472", "1585", "7745", "39205", "196745", "4918625", "24593125", "9726", "50916", "296856", "1789776", "10755936", "64535616", "387213696", "68425", "366625", "2290855", "15673105", "109953655", "770280385", "391962660", "547912", "2953952", "18951136", "138867968", "92073977", "746268616", "999179293", "134450642", "142931557", "250496915", "129080538", "769225275", "555999483", "479108007", "604697498", "356230103", "229752266", "484803676", "282452206", "614735788", "945978791", "175954096", "318397869", "751039945", "187298386", "131671481", "568832480", "898095114", "100649860", "292072410", "253072162", "808216351", "493965177", "197612280", "471490419", "537424009", "932469897", "712314569", "272668831", "926206743", "68819519"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d1946a1f3c70a6557cd0eba06be837de	The Red Button	Piegirl found the red button. You have one last chance to change the inevitable end. The circuit under the button consists of n nodes, numbered from 0 to n - 1. In order to deactivate the button, the n nodes must be disarmed in a particular order. Node 0 must be disarmed first. After disarming node i, the next node to be disarmed must be either node (2·i) modulo n or node (2·i)<=+<=1 modulo n. The last node to be disarmed must be node 0. Node 0 must be disarmed twice, but all other nodes must be disarmed exactly once. Your task is to find any such order and print it. If there is no such order, print -1. Input consists of a single integer n (2<=≤<=n<=≤<=105). Print an order in which you can to disarm all nodes. If it is impossible, print -1 instead. If there are multiple orders, print any one of them. Sample Input 2 3 4 16 Sample Output 0 1 0 -10 1 3 2 0 0 1 2 4 9 3 6 13 10 5 11 7 15 14 12 8 0	[ "n=int(input())\r\nif n&1:\r\n\tprint(-1)\r\nelse:\r\n\tD,R=[False](106),[0](10**6)\r\n\ti,j=0,0\r\n\twhile True:\r\n\t\tD[j]=True\r\n\t\tR[i]=j\r\n\t\ti+=1\r\n\t\tif not D[(j+n)>>1]:\r\n\t\t\tj=(j+n)>>1\r\n\t\telif not D[j>>1]:\r\n\t\t\tj=j>>1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tprint(\" \".join(str(R[i]) for i in range(n,-1,-1)))\r\n" ]	{"inputs": ["2", "3", "4", "16", "5", "7", "32", "255", "65536", "99999", "9", "6", "8", "10", "12", "20", "25", "30", "32", "45", "50", "100", "126", "513", "514", "800", "1000", "2500", "6400", "23105", "24002", "29024", "36002", "55555", "65534", "77776", "88888", "99494", "99998", "90248", "99994", "100000", "98300", "95324", "87380", "86036", "81914"], "outputs": ["0 1 0", "-1", "0 1 3 2 0", "0 1 2 4 9 3 6 13 10 5 11 7 15 14 12 8 0", "-1", "-1", "0 1 2 4 8 17 3 6 12 25 18 5 10 20 9 19 7 14 29 26 21 11 22 13 27 23 15 31 30 28 24 16 0", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32769 3 6 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49153 32770 5 10 20 40 80 160 320 640 1280 2560 5120 10240 20480 40960 16385 32771 7 14 28 56 112 224 448 896 1792 3584 7168 14336 28672 57345 49154 32772 9 18 36 72 144 288 576 1152 2304 4608 9216 18432 36864 8193 16386 32773 11 22 44 88 176 352 704 1408 2816 5632 11264 22528 45056 24577 49155 32774 13 26 52 104 208 416 832 1664 3328 6656 13312 26624 53248 40961 16387 32775 15 30 60 120 24...", "-1", "-1", "0 1 2 5 4 3 0", "0 1 2 5 3 7 6 4 0", "0 1 2 4 9 8 6 3 7 5 0", "0 1 2 4 8 5 11 10 9 7 3 6 0", "0 1 2 4 8 16 12 5 11 3 6 13 7 14 9 19 18 17 15 10 0", "-1", "0 1 2 4 8 16 3 6 12 24 19 9 18 7 14 29 28 26 23 17 5 10 21 13 27 25 20 11 22 15 0", "0 1 2 4 8 17 3 6 12 25 18 5 10 20 9 19 7 14 29 26 21 11 22 13 27 23 15 31 30 28 24 16 0", "-1", "0 1 2 4 8 16 32 14 28 6 12 24 49 48 46 42 34 18 36 22 44 39 29 9 19 38 26 3 7 15 30 10 20 40 31 13 27 5 11 23 47 45 41 33 17 35 21 43 37 25 0", "0 1 2 4 8 16 32 64 28 56 12 24 48 96 92 84 68 36 72 44 88 76 52 5 10 20 40 80 60 21 42 85 70 41 82 65 30 61 22 45 90 81 62 25 51 3 6 13 26 53 7 14 29 58 17 34 69 38 77 54 9 18 37 74 49 99 98 97 94 89 79 59 19 39 78 57 15 31 63 27 55 11 23 46 93 86 73 47 95 91 83 66 33 67 35 71 43 87 75 50 0", "0 1 2 4 8 16 32 64 3 6 12 24 48 96 66 7 14 28 56 112 98 70 15 30 60 120 114 102 78 31 62 125 124 122 118 110 95 65 5 10 20 40 80 35 71 17 34 68 11 22 44 88 50 100 74 23 46 92 58 116 106 87 49 99 72 18 37 75 25 51 103 81 36 73 21 42 85 45 90 54 109 93 61 123 121 117 108 91 57 115 104 83 41 82 39 79 33 67 9 19 38 77 29 59 119 113 101 76 27 55 111 97 69 13 26 53 107 89 52 105 84 43 86 47 94 63 0", "-1", "0 1 2 4 8 16 32 64 128 256 513 512 510 506 498 482 450 386 258 3 6 12 24 48 96 192 384 254 508 502 490 466 418 322 130 260 7 14 28 56 112 224 448 382 250 500 486 458 402 290 66 132 264 15 30 60 120 240 480 446 378 242 484 454 394 274 34 68 136 272 31 62 124 248 496 478 442 370 226 452 390 266 18 36 72 144 288 63 126 252 504 494 474 434 354 194 388 262 10 20 40 80 160 321 129 259 5 11 22 44 88 176 352 190 380 246 492 470 426 338 162 324 134 268 23 46 92 184 368 222 444 374 234 468 422 330 146 292 70 140 280...", "0 1 2 4 8 16 32 64 128 256 512 224 448 96 192 384 768 736 672 544 288 576 352 704 608 416 33 66 132 264 528 257 514 228 456 112 225 450 100 200 401 3 6 12 24 48 97 194 388 776 752 705 610 420 40 80 160 320 640 480 161 322 644 488 176 353 706 612 424 49 98 196 392 784 769 738 676 552 304 609 418 36 72 144 289 578 356 712 624 449 99 198 396 792 785 770 740 680 560 321 642 484 168 336 673 546 292 584 368 737 674 548 296 592 385 771 742 684 568 337 675 550 300 601 402 5 10 20 41 82 164 328 656 513 226 452 104 ...", "0 1 2 4 8 16 32 64 128 256 512 24 48 96 192 384 768 536 72 144 288 576 152 304 608 216 432 864 728 456 912 824 648 296 592 184 368 736 472 944 888 776 552 104 208 416 832 664 328 656 312 624 248 496 992 984 968 936 872 744 488 976 952 904 808 616 232 464 928 856 712 424 848 696 392 784 568 136 272 544 88 176 352 704 408 816 632 264 528 56 112 224 448 896 792 584 168 336 672 344 688 376 752 504 9 18 36 73 146 292 585 170 340 680 360 720 440 880 760 520 40 80 160 320 640 280 560 120 240 480 960 920 840 681 3...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 1596 692 1384 268 536 1072 2144 1788 1076 2152 1804 1108 2216 1932 1364 228 456 912 1824 1148 2296 2092 1684 868 1736 972 1944 1388 276 552 1104 2208 1916 1332 164 328 656 1312 124 248 496 992 1984 1468 436 872 1744 988 1976 1452 404 808 1616 732 1464 428 856 1712 924 1848 1196 2392 2284 2068 1636 772 1544 588 1176 2352 2204 1908 1316 132 264 528 1056 2112 1724 948 1896 1292 84 168 336 672 1344 188 376 752 1504 508 1016 2032 1564 628 1256 12 24 48 96 192 384 768 153...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 1792 3584 768 1536 3072 6144 5888 5376 4352 2304 4608 2816 5632 4864 3328 257 514 1028 2056 4112 1824 3648 896 1793 3586 772 1544 3088 6176 5952 5504 4609 2818 5636 4872 3344 288 576 1152 2305 4610 2820 5640 4880 3360 320 640 1280 2560 5120 3840 1281 2562 5124 3848 1296 2592 5184 3968 1537 3074 6148 5896 5392 4384 2368 4736 3073 6146 5892 5384 4368 2336 4672 2944 5889 5378 4356 2312 4624 2848 5696 4992 3585 770 1540 3080 6160 5920 5440 4480 2561 5122 3844 1288 ...", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 8766 17532 11062 22124 20246 16490 8978 17956 11910 23820 23638 23274 22546 21090 18178 12354 706 1412 2824 5648 11296 22592 21182 18362 12722 1442 2884 5768 11536 23072 22142 20282 16562 9122 18244 12486 970 1940 3880 7760 15520 7038 14076 4150 8300 16600 9198 18396 12790 1578 3156 6312 12624 1246 2492 4984 9968 19936 15870 7738 15476 6950 13900 3798 7596 15192 6382 12764 1526 3052 6104 12208 414 828 1656 3312 6624 13248 2494 4988 9976 19952 15902 7...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 3744 7488 14976 928 1856 3712 7424 14848 672 1344 2688 5376 10752 21504 13984 27968 26912 24800 20576 12128 24256 19488 9952 19904 10784 21568 14112 28224 27424 25824 22624 16224 3424 6848 13696 27392 25760 22496 15968 2912 5824 11648 23296 17568 6112 12224 24448 19872 10720 21440 13856 27712 26400 23776 18528 8032 16064 3104 6208 12416 24832 20640 12256 24512 20000 10976 21952 14880 736 1472 2944 5888 11776 23552 18080 7136 14272 28544 28064 27104 2...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 29534 23066 10130 20260 4518 9036 18072 142 284 568 1136 2272 4544 9088 18176 350 700 1400 2800 5600 11200 22400 8798 17596 35192 34382 32762 29522 23042 10082 20164 4326 8652 17304 34608 33214 30426 24850 13698 27396 18790 1578 3156 6312 12624 25248 14494 28988 21974 7946 15892 31784 27566 19130 2258 4516 9032 18064 126 252 504 1008 2016 4032 8064 16128 32256 28510 21018 6034 12068 24136 12270 24540 13078 26156 16310 32620 29238 22474 8946 178...", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 3 6 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49152 32770 7 14 28 56 112 224 448 896 1792 3584 7168 14336 28672 57344 49154 32774 15 30 60 120 240 480 960 1920 3840 7680 15360 30720 61440 57346 49158 32782 31 62 124 248 496 992 1984 3968 7936 15872 31744 63488 61442 57350 49166 32798 63 126 252 504 1008 2016 4032 8064 16128 32256 64512 63490 61446 57358 49182 32830 127 254 508 1016 2032 4064 8128 16256 32512 65024 64514 63494 61454 573...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 53296 28816 57632 37488 74976 72176 66576 55376 32976 65952 54128 30480 60960 44144 10512 21024 42048 6320 12640 25280 50560 23344 46688 15600 31200 62400 47024 16272 32544 65088 52400 27024 54048 30320 60640 43504 9232 18464 36928 73856 69936 62096 46416 15056 30112 60224 42672 7568 15136 30272 60544 43312 8848 17696 35392 70784 63792 49808 21840 43680 9584 19168 38336 76672 75568 73360 68944 60112 42448 7120 14240 28480 56960 36144 7228...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 42184 84368 79848 70808 52728 16568 33136 66272 43656 87312 85736 82584 76280 63672 38456 76912 64936 40984 81968 75048 61208 33528 67056 45224 1560 3120 6240 12480 24960 49920 10952 21904 43808 87616 86344 83800 78712 68536 48184 7480 14960 29920 59840 30792 61584 34280 68560 48232 7576 15152 30304 60608 32328 64656 40424 80848 72808 56728 24568 49136 9384 18768 37536 75072 61256 33624 67248 45608 2328 4656 9312 18624 37248 74496 60104 3...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31578 63156 26818 53636 7778 15556 31112 62224 24954 49908 322 644 1288 2576 5152 10304 20608 41216 82432 65370 31246 62492 25490 50980 2466 4932 9864 19728 39456 78912 58330 17166 34332 68664 37834 75668 51842 4190 8380 16760 33520 67040 34586 69172 38850 77700 55906 12318 24636 49272 98544 97594 95694 91894 84294 69094 38694 77388 55282 11070 22140 44280 88560 77626 55758 12022 24044 48088 96176 92858 86222 72950 46406 92812 86130 72766...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31074 62148 24298 48596 97192 94386 88774 77550 55102 10206 20412 40824 81648 63298 26598 53196 6394 12788 25576 51152 2306 4612 9224 18448 36896 73792 47586 95172 90346 80694 61390 22782 45564 91128 82258 64518 29038 58076 16154 32308 64616 29234 58468 16938 33876 67752 35506 71012 42026 84052 68106 36214 72428 44858 89716 79434 58870 17742 35484 70968 41938 83876 67754 35510 71020 42042 84084 68170 36342 72684 45370 90740 81482 62966 25...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 40824 81648 73048 55848 21448 42896 85792 81336 72424 54600 18952 37904 75808 61368 32488 64976 39704 79408 68568 46888 3528 7056 14112 28224 56448 22648 45296 344 688 1376 2752 5504 11008 22016 44032 88064 85880 81512 72776 55304 20360 40720 81440 72632 55016 19784 39568 79136 68024 45800 1352 2704 5408 10816 21632 43264 86528 82808 75368 60488 30728 61456 32664 65328 40408 80816 71384 52520 14792 29584 59168 28088 56176 22104 44208 8841...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31078 62156 24318 48636 97272 94550 89106 78218 56442 12890 25780 51560 3126 6252 12504 25008 50016 38 76 152 304 608 1216 2432 4864 9728 19456 38912 77824 55654 11314 22628 45256 90512 81030 62066 24138 48276 96552 93110 86226 72458 44922 89844 79694 59394 18794 37588 75176 50358 722 1444 2888 5776 11552 23104 46208 92416 84838 69682 39370 78740 57486 14978 29956 59912 19830 39660 79320 58646 17298 34596 69192 38390 76780 53566 7138 1427...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31072 62144 24288 48576 97152 94304 88608 77216 54432 8864 17728 35456 70912 41824 83648 67296 34592 69184 38368 76736 53472 6944 13888 27776 55552 11104 22208 44416 88832 77664 55328 10656 21312 42624 85248 70496 40992 81984 63968 27936 55872 11744 23488 46976 93952 87904 75808 51616 3232 6464 12928 25856 51712 3424 6848 13696 27392 54784 9568 19136 38272 76544 53088 6176 12352 24704 49408 98816 97632 95264 90528 81056 62112 24224 48448 ...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 32772 65544 32788 65576 32852 65704 33108 66216 34132 68264 38228 76456 54612 10924 21848 43696 87392 76484 54668 11036 22072 44144 88288 78276 58252 18204 36408 72816 47332 94664 91028 83756 69212 40124 80248 62196 26092 52184 6068 12136 24272 48544 97088 95876 93452 88604 78908 59516 20732 41464 82928 67556 36812 73624 48948 97896 97492 96684 95068 91836 85372 72444 46588 93176 88052 77804 57308 16316 32632 65264 32228 64456 30612 61224...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 35748 71496 47668 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49152 2980 5960 11920 23840 47680 36 72 144 288 576 1152 2304 4608 9216 18432 36864 73728 52132 8940 17880 35760 71520 47716 108 216 432 864 1728 3456 6912 13824 27648 55296 15268 30536 61072 26820 53640 11956 23912 47824 324 648 1296 2592 5184 10368 20736 41472 82944 70564 45804 91608 87892 80460 65596 35868 71736 48148 972 1944 3888 7776 15552 31104 62208 29092 58184 2...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 43692 5 10 20 40 80 160 320 640 1280 2560 5120 10240 20480 40960 81920 76460 65540 43700 21 42 84 168 336 672 1344 2688 5376 10752 21504 43008 86016 84652 81924 76468 65556 43732 85 170 340 680 1360 2720 5440 10880 21760 43520 87040 86700 86020 84660 81940 76500 65620 43860 341 682 1364 2728 5456 10912 21824 43648 87296 87212 87044 86708 86036 84692 82004 76628 65876 44372 1365 2730 5460 10920 21840 43680 87360 87340 87300 87220 87060 867...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 45036 4036 8072 16144 32288 64576 43116 196 392 784 1568 3136 6272 12544 25088 50176 14316 28632 57264 28492 56984 27932 55864 25692 51384 16732 33464 66928 47820 9604 19208 38416 76832 67628 49220 12404 24808 49616 13196 26392 52784 19532 39064 78128 70220 54404 22772 45544 5052 10104 20208 40416 80832 75628 65220 44404 2772 5544 11088 22176 44352 2668 5336 10672 21344 42688 85376 84716 83396 80756 75476 64916 43796 1556 3112 6224 12448 ...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 49158 16402 32804 65608 49302 16690 33380 66760 51606 21298 42596 3278 6556 13112 26224 52448 22982 45964 10014 20028 40056 80112 78310 74706 67498 53082 24250 48500 15086 30172 60344 38774 77548 73182 64450 46986 12058 24116 48232 14550 29100 58200 34486 68972 56030 30146 60292 38670 77340 72766 63618 45322 8730 17460 34920 69840 57766 33618 67236 52558 23202 46404 10894 21788 43576 5238 10476 20952 41904 1894 3788 7576 15152 30304 60608..."]}	UNKNOWN	PYTHON3	CODEFORCES	1
d19a5d2d40c3191166b3cebf9ec2503a	The penguin's game	Pay attention: this problem is interactive. Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature — an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x<=≠<=y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions. You are to find the special icicles. The first line contains three integers n, x, y (2<=≤<=n<=≤<=1000, 1<=≤<=x,<=y<=≤<=109, x<=≠<=y) — the number of icicles, the temperature of non-special icicles and the temperature of the special icicles. To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1<=<<=p2) — the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately. Sample Input 4 2 1 2 1 1 Sample Output ? 3 1 2 3 ? 1 1 ? 1 3 ! 1 3	[ "import sys\r\n\r\nn, x, y = (int(x) for x in input().split())\r\nys = [y, x ^ y]\r\n\r\ndef ask(bits):\r\n arr = [x for x in range(1, n + 1) if all(x & i == i for i in bits)]\r\n if len(arr) == 0:\r\n return 0\r\n print('?', len(arr), arr)\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\ndiffs = []\r\ni = 1\r\nwhile i <= n:\r\n x = ask(i)\r\n if x in ys:\r\n diffs.append(i)\r\n i <<= 1\r\n\r\ni = diffs[-1]\r\nj = 1\r\nans2 = i\r\nwhile j <= n:\r\n if j != i:\r\n x = ask(i, j)\r\n if x in ys:\r\n ans2 \|= j\r\n j <<= 1\r\n\r\nans1 = sum(diffs) ^ ans2\r\n\r\nprint('!', ans1, ans2)", "import sys, os\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef f(s):\r\n os.write(1, b\"%s %d %s\\n\" % (\"?\".encode(), len(s), \" \".join(map(str, s)).encode()))\r\n z = int(input())\r\n return z\r\n\r\nn, x, y = map(int, input().split())\r\nm = (n - 1).bit_length()\r\npow2 = [1]\r\nfor _ in range(m):\r\n pow2.append(2 * pow2[-1])\r\nu = []\r\nfor i in range(m):\r\n s, p = [], pow2[i]\r\n for j in range(n):\r\n if j & p:\r\n s.append(j + 1)\r\n z = f(s)\r\n u.append(0 if z == x or not z else 1)\r\nfor i in range(m):\r\n if u[i]:\r\n v, p = [], pow2[i]\r\n for j in range(n):\r\n if j & p:\r\n v.append(j + 1)\r\n break\r\nwhile len(v) ^ 1:\r\n m = len(v) // 2\r\n s, t = v[:m], v[m:]\r\n z = f(s)\r\n v = t if z == x or not z else s\r\np1 = v[0]\r\nj = p1 - 1\r\nm = (n - 1).bit_length()\r\nfor i in range(n):\r\n if (i + 1) == p1:\r\n continue\r\n ok = 1\r\n for k in range(m):\r\n pk = pow2[k]\r\n z = min((pk & i) ^ (pk & j), 1)\r\n if u[k] ^ z:\r\n ok = 0\r\n break\r\n if ok:\r\n p2 = i + 1\r\n break\r\nif p1 > p2:\r\n p1, p2 = p2, p1\r\nos.write(1, b\"%s %d %d\\n\" % (\"!\".encode(), p1, p2))\r\nexit()", "import random\r\n\r\ndef brute(L):\r\n P = [24, 384]\r\n res = 0\r\n for item in L:\r\n if item in P:\r\n res ^= Y[0]\r\n else:\r\n res ^= X[0]\r\n return res\r\n\r\nCNT = [0]\r\n\r\ndef query(L):\r\n CNT[0] += 1\r\n if CNT[0] > 19:\r\n assert False\r\n print(f\"? {len(L)} {' '.join(map(str, L))}\")\r\n res = int(input())\r\n # res = brute(L)\r\n # print(res)\r\n return res\r\n\r\ndef solve(L, x, y):\r\n # print(L, x, y)\r\n if len(L) == 1:\r\n return L[0]\r\n res = query(L[:len(L) // 2])\r\n if res == y or res == (x ^ y):\r\n return solve(L[:len(L) // 2], x, y)\r\n return solve(L[len(L) // 2:], x, y)\r\n\r\nn, x, y = map(int, input().split())\r\nX = [x]\r\nY = [y]\r\nL = list(range(1, n + 1))\r\n\r\n\r\nhistory = []\r\nwhile True:\r\n random.shuffle(L)\r\n res = query(L[:len(L) // 2])\r\n if res == y or res == (x ^ y):\r\n a = solve(L[:len(L) // 2], x, y)\r\n O = set(L[len(L) // 2:])\r\n for item in history:\r\n if a not in item:\r\n for val in item:\r\n if val in O:\r\n O.remove(val)\r\n else:\r\n bad = set()\r\n for val in O:\r\n if val not in item:\r\n bad.add(val)\r\n for val in bad:\r\n O.remove(val)\r\n b = solve(list(O), x, y)\r\n if b < a:\r\n a, b = b, a\r\n print(f\"! {a} {b}\")\r\n # print(CNT)\r\n break\r\n else:\r\n history.append(set(L[:len(L) // 2]))\r\n", "import sys\r\n\r\nn, x, y = map(int, input().split())\r\n\r\n# Ennyi bitet kell végigkérdezni.\r\nbits = len(bin(n))-2\r\n\r\n# Összes lehetséges index.\r\nindexes = list(range(1, n+1))\r\n\r\n# Rákérdez azokra az indexekre amiknek a mask bitjeinek a\r\n# helyén a pattern bitmintája van.\r\n# True -> Páratlan sok (1 db) speciális jégcsap van köztük.\r\n# False -> Páros sok (0 vagy 2 db) speciális jégcsap van köztük.\r\ndef mask_ask_odd(pattern, mask):\r\n ask = [i for i in indexes if (i & mask) == (pattern & mask)]\r\n if not ask:\r\n return False\r\n\r\n print(\"?\", len(ask), \" \".join(map(str, ask)))\r\n sys.stdout.flush()\r\n ans = int(input())\r\n\r\n if (ans == y) or (ans == x ^ y):\r\n return True\r\n else: # (ans == 0) or (ans == x)\r\n return False\r\n\r\n# Addig kérdezzük a biteket, amíg meg nem találunk egyet\r\n# amire páratlan sok a válasz. Tehát ebben a bitben\r\n# különbözik a két jégcsap indexe.\r\nfor curr_bit in range(bits):\r\n mask = 1 << curr_bit\r\n if mask_ask_odd(mask, mask):\r\n diff_bit = curr_bit\r\n break\r\n\r\n# Ettől a ponttól kezdve a diff_bit-et mindig felvesszük a maskokba\r\n# tehát a mask_ask_odd válasza mostmár:\r\n# True -> 1 db speciális jégcsap van köztük.\r\n# False -> 0 db speciális jégcsap van köztük.\r\n\r\n# Ezután visszamegyünk és végigkérdezzük újra az azonos biteket,\r\n# vagyis a közös postfixet helyreállítjuk:\r\npostfix = 0\r\nfor curr_bit in range(diff_bit):\r\n # Mask: diff_bit + a curr_bit-ig az összes bit.\r\n mask = (1 << diff_bit) \| ((1 << curr_bit + 1)-1)\r\n # Pattern: diff_bit = 1 + az aktuálisan kérdezett bit\r\n # + az eddig helyreállított postfix.\r\n pattern = (1 << diff_bit) \| (1 << curr_bit) \| postfix\r\n if mask_ask_odd(pattern, mask):\r\n postfix \|= (1 << curr_bit)\r\n\r\n# A közös postfix megvan, diff_bit-ben különböznek.\r\n# Innentől kezdve egymástól függetlenül állítjuk helyre\r\n# a bitjeiket a speciális jégcsapoknak.\r\npos1 = postfix\r\npos2 = (1 << diff_bit) \| postfix\r\nfor curr_bit in range(diff_bit+1, bits):\r\n # Mask: curr_bit-ig az összes bit.\r\n mask = (1 << curr_bit+1)-1\r\n # Ha a curr_bit nem 0, akkor 1.\r\n if not mask_ask_odd(pos1, mask):\r\n pos1 \|= (1 << curr_bit)\r\n # Ha a curr_bit nem 0, akkor 1.\r\n if not mask_ask_odd(pos2, mask):\r\n pos2 \|= (1 << curr_bit)\r\n\r\nprint(\"!\", \" \".join(map(str, sorted([pos1, pos2]))))\r\n" ]	{"inputs": ["4 2 1 1 3", "6 1 2 5 6", "2 4523 4235 1 2", "511 42 1000000000 255 511", "666 536870911 268435455 13 133", "999 536870912 536870911 1 999", "1000 123 321 1 513", "1000 1000000000 1 36 1000", "1000 15 16 511 512", "1000 16 15 511 512", "50 276891238 128284616 2 28", "100 745880634 179094068 84 99", "150 481201317 787652038 49 147", "200 831819465 669375745 137 165", "250 417397044 277933714 112 160", "300 62982488 159657421 124 230", "350 208368580 768215391 71 135", "400 853954024 504714906 168 187", "450 999340115 553464364 29 66", "500 770616857 910894182 28 34", "550 593041285 200362966 227 454", "600 803748180 240123414 428 479", "650 626172608 824559494 22 607", "700 572038286 864319942 52 523", "750 394462715 858821430 416 471", "800 605169609 193549174 221 768", "850 427594038 483017958 161 779", "900 228235524 817745702 313 601", "950 195884145 107214487 556 781", "1000 748509283 888470689 243 289", "848 713949655 778798832 114 537", "604 992531203 77612090 299 432", "797 715823152 671392644 52 722", "553 289371996 115430093 378 501", "309 862920841 709210647 157 278", "65 731436981 448215393 6 36", "258 10018529 41995946 160 248", "14 878534670 486033396 9 10", "769 306859322 79813950 207 574", "386 429342362 484650952 98 278", "1000 305773675 363466523 207 616", "1000 483857099 231982664 254 465", "1000 661940523 365340020 211 899", "1000 545056651 233856160 468 617", "1000 723140075 807405005 214 824", "1000 901223500 380953849 759 768", "1000 79306924 249469990 25 477", "1000 962423052 528051538 122 771", "1000 140506476 251343486 136 325", "1000 309007679 492561550 536 647", "1000 1 2 341 682"], "outputs": ["Correct answer 1 3, queries: 4.", "Correct answer 5 6, queries: 5.", "Correct answer 1 2, queries: 2.", "Correct answer 255 511, queries: 17.", "Correct answer 13 133, queries: 18.", "Correct answer 1 999, queries: 19.", "Correct answer 1 513, queries: 19.", "Correct answer 36 1000, queries: 19.", "Correct answer 511 512, queries: 18.", "Correct answer 511 512, queries: 18.", "Correct answer 2 28, queries: 11.", "Correct answer 84 99, queries: 13.", "Correct answer 49 147, queries: 13.", "Correct answer 137 165, queries: 14.", "Correct answer 112 160, queries: 15.", "Correct answer 124 230, queries: 16.", "Correct answer 71 135, queries: 16.", "Correct answer 168 187, queries: 17.", "Correct answer 29 66, queries: 17.", "Correct answer 28 34, queries: 17.", "Correct answer 227 454, queries: 18.", "Correct answer 428 479, queries: 18.", "Correct answer 22 607, queries: 17.", "Correct answer 52 523, queries: 17.", "Correct answer 416 471, queries: 19.", "Correct answer 221 768, queries: 18.", "Correct answer 161 779, queries: 19.", "Correct answer 313 601, queries: 19.", "Correct answer 556 781, queries: 19.", "Correct answer 243 289, queries: 19.", "Correct answer 114 537, queries: 19.", "Correct answer 299 432, queries: 18.", "Correct answer 52 722, queries: 18.", "Correct answer 378 501, queries: 18.", "Correct answer 157 278, queries: 15.", "Correct answer 6 36, queries: 12.", "Correct answer 160 248, queries: 16.", "Correct answer 9 10, queries: 7.", "Correct answer 207 574, queries: 18.", "Correct answer 98 278, queries: 16.", "Correct answer 207 616, queries: 19.", "Correct answer 254 465, queries: 19.", "Correct answer 211 899, queries: 19.", "Correct answer 468 617, queries: 19.", "Correct answer 214 824, queries: 19.", "Correct answer 759 768, queries: 19.", "Correct answer 25 477, queries: 19.", "Correct answer 122 771, queries: 18.", "Correct answer 136 325, queries: 19.", "Correct answer 536 647, queries: 19.", "Correct answer 341 682, queries: 19."]}	UNKNOWN	PYTHON3	CODEFORCES	4
d1a4489d4ae1ae49f2006c2a331b20f2	Palindromic Cut	Kolya has a string s of length n consisting of lowercase and uppercase Latin letters and digits. He wants to rearrange the symbols in s and cut it into the minimum number of parts so that each part is a palindrome and all parts have the same lengths. A palindrome is a string which reads the same backward as forward, such as madam or racecar. Your task is to help Kolya and determine the minimum number of palindromes of equal lengths to cut s into, if it is allowed to rearrange letters in s before cuttings. The first line contains an integer n (1<=≤<=n<=≤<=4·105) — the length of string s. The second line contains a string s of length n consisting of lowercase and uppercase Latin letters and digits. Print to the first line an integer k — minimum number of palindromes into which you can cut a given string. Print to the second line k strings — the palindromes themselves. Separate them by a space. You are allowed to print palindromes in arbitrary order. All of them should have the same length. Sample Input 6 aabaac 8 0rTrT022 2 aA Sample Output 2 aba aca 1 02TrrT20 2 a A	[ "n = int(input())\r\nstring = input()\r\nchar = []\r\ncharPair = []\r\ncharImpair = []\r\nfor car in string:\r\n\tif car not in char:\r\n\t\tz = string.count(car)\r\n\t\twhile z>1:\r\n\t\t\tcharPair.append(car)\r\n\t\t\tz-=2\r\n\t\tif(z==1):\r\n\t\t\tcharImpair.append(car)\r\n\t\tchar.append(car)\r\nif len(charImpair) ==0 :\r\n\tString1 = ''\r\n\tfor x in charPair:\r\n\t\tString1+= x\r\n\tif len(charImpair) ==1 :\r\n\t\tString1 += charImpair[0]\r\n\tfor x in charPair[::-1]:\r\n\t\tString1 += x\r\n\tprint('1')\r\n\tprint(String1)\r\nelse :\r\n\tnbPalin = len(charImpair)\r\n\twhile len(charPair)%nbPalin != 0 : \r\n\t\tnbPalin += 2\r\n\t\tcharImpair.append(charPair[-1])\r\n\t\tcharImpair.append(charPair[-1])\r\n\t\tdel(charPair[-1])\r\n\tlenPalindrome = n/nbPalin\r\n\tPalin = []\r\n\tfor i in range(nbPalin):\r\n\t\tString2 = ''\r\n\t\tindice = i * int(((lenPalindrome-1)/2))\r\n\t\tfor x in charPair[indice : int(indice + ((lenPalindrome-1)/2))]:\r\n\t\t\tString2 += x\r\n\t\tString2 += charImpair[i]\r\n\t\tfor x in range(indice + int(((lenPalindrome-1)/2))-1, indice-1 ,-1): # charPair[i + int(((lenPalindrome-1)/2))-1: i-1 :-1]:\r\n\t\t\tString2 += charPair[x]\t\r\n\t\tPalin.append(String2)\r\n\t\t\r\n\tprint(nbPalin)\r\n\tString3 = ' '.join(Palin)\r\n\tprint(String3)\r\n\r\n\t", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n import collections\r\n\r\n n = int(input())\r\n s = input()\r\n alph = collections.Counter(s)\r\n odd = sum(x & 0x1 for x in alph.values())\r\n dq = collections.deque()\r\n if odd == 0:\r\n print(1)\r\n for c, x in alph.items():\r\n dq.append(c * (x >> 1))\r\n dq.appendleft(c * (x >> 1))\r\n print(dq, sep=\"\")\r\n else:\r\n for odd in range(odd, n):\r\n if (n - odd) % (odd << 1) == 0:\r\n print(odd)\r\n odds = [c for c, x in alph.items() if x & 0x1]\r\n items = list(alph.items())\r\n while len(odds) != odd:\r\n for i, x in enumerate(items):\r\n if x[1] > 1:\r\n items[i] = (x[0], x[1] - 2)\r\n odds.append(x[0])\r\n odds.append(x[0])\r\n break\r\n req_length = (n - odd) // odd + 1\r\n cur_length = 0\r\n while odd > 0:\r\n if cur_length == 0:\r\n dq.append(odds[-1])\r\n cur_length += 1\r\n odds.pop()\r\n x = min(items[-1][1] >> 1, (req_length - cur_length) >> 1)\r\n dq.append(items[-1][0] x)\r\n dq.appendleft(items[-1][0] * x)\r\n cur_length += x << 1\r\n if items[-1][1] - (x << 1) <= 1:\r\n items.pop()\r\n else:\r\n items[-1] = (items[-1][0], items[-1][1] - (x << 1))\r\n if cur_length == req_length:\r\n print(dq, sep=\"\", end=' ')\r\n odd -= 1\r\n dq.clear()\r\n cur_length = 0\r\n print()\r\n break\r\n else:\r\n print(n)\r\n print(s)\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "n=int(input())\r\ns=list(input())\r\nlets={}\r\nfor i in s:\r\n try:\r\n lets[i]+=1\r\n except:\r\n lets[i]=1\r\ncount=0\r\ncentre=[]\r\nrest=[]\r\nfor i in lets.keys():\r\n if(lets[i]%2):\r\n centre.append(i)\r\n count+=1\r\n rest+=[i](lets[i]//2)\r\nif(count==0):\r\n t=''\r\n for i in lets.keys():\r\n t=i(lets[i]//2) + t + i(lets[i]//2)\r\n print(1)\r\n print(t)\r\n \r\nelse:\r\n extra=0\r\n while(n%count!=0 or (n//count)%2==0):\r\n count+=2\r\n extra+=1\r\n for i in range(extra):\r\n centre+=[rest.pop()]2\r\n amt=len(rest)//(count)\r\n temp=rest.copy()\r\n rest=''\r\n for i in temp:\r\n rest+=i\r\n print(count)\r\n print(rest[0:amt] + centre[0] + rest[(1)(amt)-1::-1],end=' ')\r\n for i in range(1,count):\r\n print(rest[i(amt):(i+1)amt] + centre[i] + rest[(i+1)(amt)-1:(i)amt-1:-1],end=' ')\r\n print()", "import sys\r\nfrom math import \r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10*9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\n# n,k=get_ints()\r\n# a=get_array()\r\nn=int(input())\r\na=input()\r\nc=Counter(a)\r\na=list(a)\r\nans=0\r\nleft=[]\r\ntaken=[]\r\nfor i in set(a):\r\n if c[i]%2==1:\r\n left.append(i)\r\n if c[i]>1:\r\n taken.extend([i](c[i]//2))\r\n\r\n# print(taken,left)\r\nif len(taken)==0 and len(left)>0:\r\n print(len(left))\r\n print(left)\r\nelif len(taken)>0 and len(left)==0:\r\n print(1)\r\n print(taken,taken[::-1],sep='')\r\nelse:\r\n lt=len(taken)\r\n ll=len(left)\r\n while(lt%ll!=0):\r\n lt-=1\r\n ll+=2\r\n for i in range(len(taken)-lt):\r\n z=taken.pop()\r\n left.append(z)\r\n left.append(z)\r\n \r\n lett=len(taken)//len(left)\r\n print(len(left))\r\n for i in range(len(left)):\r\n norm=taken[letti:lett(i+1)]\r\n print(norm,left[i],norm[::-1],sep='',end=' ')", "mp,a,p={},[],[]\r\nn=int(input())\r\nfor i in input():\r\n if i in mp:mp[i]+=1\r\n else:mp[i]=1\r\nodd=0\r\nfor i in mp:\r\n if mp[i]&1:\r\n a.append(i)\r\n mp[i]-=1\r\n odd+=1\r\n if mp[i]:\r\n p.append(i)\r\nm=max(1,odd)\r\nfor i in range(m,n+1):\r\n if not n%i:\r\n d=n//i\r\n if odd and not d&1:continue\r\n print(i)\r\n for K in range(i-m):\r\n a.append(p[-1])\r\n if mp[p[-1]]>1:mp[p[-1]]-=1\r\n else:p.pop()\r\n for k in range(i):\r\n s=''\r\n for j in range(d//2):\r\n s+=p[-1]\r\n mp[p[-1]]-=2\r\n if not mp[p[-1]]:p.pop()\r\n if odd:print(s+a.pop()+s[::-1],end=' ')\r\n else:print(s+s[::-1],end=' ')\r\n exit()", "import sys\nfrom collections import Counter\n\n\ndef gen(counter, skip):\n for c, n in counter:\n has = n // 2\n if skip > has:\n skip -= has\n has = 0\n elif skip > 0:\n has -= skip\n skip = 0\n for i in range(has):\n yield c\n\n\ndef gen_o(counter, take):\n for c, n in counter:\n for i in range(n % 2):\n yield c\n for c, n in counter:\n has = (n // 2) 2\n if take > has:\n take -= has\n elif take > 0:\n has = take\n take = 0\n for i in range(has):\n yield c\n\n\nN = int(next(sys.stdin))\n\ns = next(sys.stdin).strip()\nc = Counter(s)\n\neven = 0\nodd = 0\nitems = list(c.items())\nfor _, n in items:\n even += n // 2\n odd += n % 2\ngenerator = gen(items, 0)\ngenerator_o = gen_o(items, 0)\n\nodd_c = odd\nif odd == 0:\n print(1)\n front = [next(generator) for i in range(len(s) // 2)]\n fs = \"\".join(front)\n print(fs + fs[::-1])\nelse:\n skip = 0\n while even != 0 and even % odd != 0:\n skip += 1\n odd += 2\n even -= 1\n generator = gen(items, skip)\n generator_o = gen_o(items, skip * 2)\n print(odd)\n per = even // odd\n strs = []\n for i in range(odd):\n front = [next(generator) for i in range(per)]\n fs = \"\".join(front)\n strs.append(fs + next(generator_o) + fs[::-1])\n print(\" \".join(strs))\n" ]	{"inputs": ["6\naabaac", "8\n0rTrT022", "2\naA", "1\ns", "10\n6IIC6CCIIC", "20\nqqqoqqoqMoqMMMqqMMqM", "45\nf3409ufEFU32rfsFJSKDFJ234234ASkjffjsdfsdfsj33", "30\n8M8MMMMMlrMlMMrMMllMMrllMMrMrl", "40\nTddTddddTddddddTdddTdddddddddddddddddddd", "45\nRRNRRRRRRRRRNRRRRRRRRRRRRRRNRRRRRRRRRRRNRRRRR", "115\nz9c2f5fxz9z999c9z999f9f9x99559f5Vf955c59E9ccz5fcc99xfzcEx29xuE55f995u592xE58Exc9zVff885u9cf59cV5xc999fx5x55u992fx9x", "1\nz", "2\nff", "2\n9E", "3\nRRR", "3\n001", "3\n011", "3\n101", "3\n110", "3\n111", "3\n010", "3\n100", "1\na", "1\nA", "1\nZ", "1\n0", "1\n9"], "outputs": ["2\naba aca ", "1\n02TrrT20 ", "2\na A ", "1\ns ", "1\n6CCIIIICC6 ", "4\nMMMMM oqoqo qqMqq qqMqq ", "15\n202 323 343 393 4A4 FDF JEJ SFS dKd fUf fff fjf jkj srs sus ", "2\n8MMMMMMlMMMMMM8 MMlllrrrrrlllMM ", "8\nddTdd ddddd ddTdd ddTdd ddTdd ddTdd ddddd ddddd ", "1\nNNRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRNN ", "5\n22555555555555555555522 89999999999899999999998 999999EEVccEccVEE999999 ccccfffffffVfffffffcccc uuxxxxxxzzzzzzzxxxxxxuu ", "1\nz ", "1\nff ", "2\n9 E ", "1\nRRR ", "1\n010 ", "1\n101 ", "1\n101 ", "1\n101 ", "1\n111 ", "1\n010 ", "1\n010 ", "1\na ", "1\nA ", "1\nZ ", "1\n0 ", "1\n9 "]}	UNKNOWN	PYTHON3	CODEFORCES	6
d1a4bc4ff7233cca17c240867693a8ff	Slime Combining	Your friend recently gave you some slimes for your birthday. You have n slimes all initially with value 1. You are going to play a game with these slimes. Initially, you put a single slime by itself in a row. Then, you will add the other n<=-<=1 slimes one by one. When you add a slime, you place it at the right of all already placed slimes. Then, while the last two slimes in the row have the same value v, you combine them together to create a slime with value v<=+<=1. You would like to see what the final state of the row is after you've added all n slimes. Please print the values of the slimes in the row from left to right. The first line of the input will contain a single integer, n (1<=≤<=n<=≤<=100<=000). Output a single line with k integers, where k is the number of slimes in the row after you've finished the procedure described in the problem statement. The i-th of these numbers should be the value of the i-th slime from the left. Sample Input 1 2 3 8 Sample Output 1 2 2 1 4	[ "N = int(input())\r\nans = []\r\ni = 0\r\n\r\nwhile N >> i:\r\n if (N >> i) & 1:\r\n ans.append(i + 1)\r\n i += 1\r\n \r\nprint(ans[::-1])", "n = int(input())\r\n\r\nslimes = [1] n\r\ni = 0\r\n\r\nwhile i < len(slimes)-1:\r\n if slimes[i] == slimes[i+1]:\r\n slimes[i] += 1\r\n del slimes[i+1]\r\n i = max(i-1, 0) # Go back one position if necessary\r\n else:\r\n i += 1\r\n\r\nprint(slimes)\r\n", "n=int(input())\r\nfor i in range(20,-1,-1):\r\n if(2i<=n):\r\n print(i+1,end=' ')\r\n n-=2i\r\n", "n=int(input())\r\nl=[]\r\nwhile n>0 :\r\n S=1\r\n k=1\r\n while S2<=n :\r\n S=S2\r\n k=k+1\r\n l.append(k)\r\n n=n-S\r\nprint(l)\r\n \r\n \r\n\r\n \r\n", "n = int(input())\r\ni = 1\r\nres_board = []\r\nwhile i <= n:\r\n\tres_board.append(1)\r\n\twhile True:\r\n\t\tif len(res_board)>1:\r\n\t\t\tif res_board[-2] == res_board[-1]:\r\n\t\t\t\tres_board[-2] += 1\r\n\t\t\t\tres_board.pop(-1)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tbreak\r\n\ti += 1\r\n\r\nres_board = ' '.join([str(x) for x in res_board])\r\nprint(res_board)", "print([i+1 for i,x in enumerate(bin(int(input()))[2:][::-1])if x>'0'][::-1])", "n=int(input())\r\nl=[1]n\r\nwhile len(l)!=len(set(l)):\r\n for i in range(len(l)-1):\r\n try:\r\n if l[i]==l[i+1]:\r\n l[i]=l[i]+1\r\n del l[i+1]\r\n except:\r\n break\r\n \r\nprint(l)\r\n\r\n \r\n \r\n", "def main_function():\r\n n = int(input())\r\n slimes = []\r\n for i in range(n):\r\n slimes.append(str(1))\r\n for k in range(len(slimes) - 1):\r\n if int(slimes[-1]) == int(slimes[-2]):\r\n slimes.pop()\r\n slimes[-1] = str(int(slimes[-1]) + 1)\r\n else:\r\n break\r\n return \" \".join(slimes)\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def solution(n):\r\n # 1 1 1 1 1 1 1 1 \r\n # 2 1 1 1 1 1 1 \r\n # 2 2 1 1 1 1 \r\n # 3 1 1 1 1\r\n # 3 2 1 1\r\n # 3 2 2\r\n # 3 3\r\n # 4\r\n\r\n # 1 1 1 1 \r\n # 2 1 1 \r\n # 2 2\r\n # 3\r\n\r\n # 1 1 1\r\n # 2 1\r\n\r\n if n==1:\r\n return 1\r\n l1 = [1]\r\n i=0\r\n while i<n-1:\r\n l1.append(1)\r\n j=0\r\n while len(set(l1))!=len(l1):\r\n if l1.index(min(l1))<len(l1):\r\n if l1[l1.index(min(l1))]==l1[l1.index(min(l1))+1]:\r\n l1[l1.index(min(l1))]+=1\r\n l1.remove(min(l1))\r\n i+=1\r\n i=0\r\n c_out=\"\"\r\n while i<len(l1):\r\n c_out+=str(l1[i])\r\n i+=1\r\n if i!=len(l1):\r\n c_out+=\" \"\r\n return c_out\r\n\r\ndef answer():\r\n n = int(input())\r\n print(solution(n))\r\nanswer()", "def get(k):\n find = False\n for i in range(len(k)):\n if k[i] == 0:\n k[i] = 1\n break\n else:\n k[i] = 0\n else:\n k.append(1)\n return k\n\n\nn = int(input())\nk = []\nfor i in range(n):\n k = get(k)\nfor i in range(len(k) - 1, -1, -1):\n if k[i]:\n print(i + 1, end=' ')\n\n", "n = int(input())\r\nv = []\r\nfor i in range(0, n):\r\n v.append(1)\r\n while True:\r\n if len(v) > 1 and v[-1] == v[-2]:\r\n v.pop()\r\n v[-1] += 1\r\n else:\r\n break\r\nprint(v)\r\n\r\n# ♥\r\n# امشب مهمون دارم\r\n", "n = int(input())\r\nslimes = list()\r\nfor _ in range(n):\r\n slimes.append(1)\r\n while len(slimes) > 1 and slimes[-1] == slimes[-2]:\r\n slimes.pop()\r\n slimes[-1] += 1\r\nprint(\" \".join(map(str, slimes)))\r\n", "arr=[0]\r\nn = int(input())\r\nfor _ in range(n):\r\n\tarr.append(1)\r\n\twhile arr[-2]==arr[-1]:\r\n\t\tarr.pop()\r\n\t\tarr[-1]+=1\r\nprint(arr[1:])", "n = int(input())\r\nwhile n != 0:\r\n a = 1\r\n k = 0\r\n while a <= n:\r\n a = 2\r\n k += 1\r\n a //= 2\r\n print(k,end=' ')\r\n n -= a", "a=bin(int(input()))[2:];b=len(a)\r\nfor i in range(b):\r\n if a[i]=='1':print(str(b-i),end=' ')", "n = int(input())\r\n\r\nslime = []\r\ni=1\r\nwhile n!=0:\r\n slime.append(1)\r\n while len(slime)>1 and slime[-1]==slime[-2]:\r\n slime[-2] = slime[-2] +1\r\n slime.remove(slime[-1])\r\n n=n-1\r\nprint(slime)", "a=[0]\nfor _ in range(int(input())):\n\ta+=[1]\n\twhile a[-2]==a[-1]:\n\t\ta.pop()\n\t\ta[-1]+=1\nprint(a[1:])\n", "n = int(input())\na = []\nfor i in range(0,n):\n a.append(1)\n while len(a)>1 and a[-1] == a[-2]:\n a.pop()\n a.append(a.pop()+1)\n\nprint(' '.join(str(j) for j in a))\n", "a = int(input())\nnum = 1\n# print(num)\nres = []\nfor i in bin(a)[2:][::-1]:\n # print(i)\n if i == '1':\n res.append(str(num))\n num += 1\nprint(' '.join(reversed(res)))\n", "# https://codeforces.com/problemset/problem/618/A\r\n\r\nn = int(input())\r\n\r\nstack = [1]\r\n\r\nfor i in range(1, n):\r\n if stack[-1] == 1:\r\n stack[-1] = 2\r\n while True:\r\n if len(stack) >= 2:\r\n last = stack.pop()\r\n if stack[-1] == last:\r\n stack[-1] = last + 1\r\n else:\r\n stack.append(last)\r\n break\r\n else:\r\n break\r\n else:\r\n stack.append(1)\r\nprint(stack)\r\n", "def solve(r):\r\n ans=[]\r\n for i in range(30,-1,-1):\r\n if (r&(1<<i)) >0:\r\n ans.append(i+1)\r\n #return ans\r\n return ' '.join(str(i) for i in ans)\r\n\r\nr=int(input())\r\nprint(solve(r))\r\n", "import math\nn = int(input())\nans = [x+1 for x in range(n.bit_length(), -1, -1) if (n>>x)&1]\nfor x in ans:\n print(x, end = ' ')\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\n\r\nk = []\r\nfor i in range(0, n):\r\n k.append(1)\r\n while len(k) > 1 and k[-1] == k[-2]:\r\n k[-2] += 1\r\n del k[-1]\r\n\r\nfirst = True\r\nfor i in k:\r\n if first:\r\n first = False\r\n else:\r\n print(' ', end='')\r\n print(i, end='')\r\n", "dp = [[1]]\nfor i in range(2, 20):\n heh = []\n for elem in dp:\n x = [i] + elem\n heh.append(x)\n dp.append([i])\n dp += heh\nprint(dp[int(input()) - 1])", "import sys\r\ninputNum = int(input())\r\noutputString = \"\"\r\nisFirst = True\r\nwhile inputNum > 0:\r\n combineTier = 1\r\n combineValue = 1\r\n while inputNum >= combineValue:\r\n combineTier = combineTier + 1\r\n combineValue = combineValue * 2\r\n combineTier = combineTier - 1\r\n combineValue = combineValue / 2\r\n inputNum = inputNum - combineValue\r\n if isFirst:\r\n outputString = outputString + str(combineTier)\r\n isFirst = False\r\n else:\r\n outputString = outputString + ' ' + str(combineTier)\r\nprint(outputString)", "def main():\n n, res, mask, x = int(input()), [], 1, 1\n while n >= mask:\n if n & mask:\n res.append(x)\n mask = 2\n x += 1\n print([x for x in reversed(res) if x])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nl=[2i for i in range(20)]\r\nwhile n>0:\r\n\tif n in l:\r\n\t\ti=l.index(n)\r\n\t\tprint(i+1)\r\n\t\tn=0\r\n\telse:\r\n\t\tl.append(n)\r\n\t\tl.sort()\r\n\t\ti=l.index(n)\r\n\t\tprint(i,end=\" \")\r\n\t\tl.remove(n)\r\n\t\tn-=2(i-1)", "list=[0]\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n list.append(1) \r\n while list[len(list)-1]==list[len(list)-2]:\r\n del list[len(list)-2]\r\n list[len(list)-1]+=1\r\nfor i in range(1,len(list)):\r\n print(list[i],end=' ')\r\n\r\n \r\n \r\n", "n=int(input())\r\n\r\ntotal=0\r\nl=list()\r\nwhile(n):\r\n l.append(1)\r\n if len(l)>1:\r\n si=len(l)\r\n while(si!=1):\r\n if l[si-1]==l[si-2]:\r\n l[si-2]+=1\r\n l.pop(si-1)\r\n si-=1\r\n n-=1\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\r\na = []\r\nfor i in range(1,n+1):\r\n\ta.append(1)\r\n\twhile(len(a) > 1 and a[-1] == a[-2]):\r\n\t\tv = a.pop()\r\n\t\ta.pop()\r\n\t\ta.append(v+1)\r\nfor i in a:\r\n\tprint(i,end = \" \")", "n=int(input())\na=[0]100\ntool = 1\na[0]=1\nf = 1\nfor i in range(1,n):\n \n a[tool]=1\n tool+=1\n f+=1\n if f==2:\n f=0\n tool-=1\n a[tool-1]=a[tool]+1\n c=0\n for j in range(tool-1,0,-1):\n if a[j]==a[j-1]:\n a[j-1]=a[j]+1\n c+=1\n else:\n break\n tool-=c\n else:\n pass\nprint(a[:tool])\n", "n = int(input())\r\nx = bin(n)[2:]\r\nll = len(x)\r\nres = []\r\nfor i in range(ll):\r\n if x[i] == \"1\":\r\n res.append(str(ll - i))\r\nprint(\" \".join(res))", "n = int(input()); l = [1]; i = 1; cou = 0\r\nwhile cou < n-1: \r\n l.append(1); cou += 1\r\n while len(l) > 1 and l[i] == l[i-1]:\r\n l[i-1] = l[i] + 1\r\n l.pop(i); i = i-1\r\n i += 1\r\nprint(l)", "import sys\n\nn = int(input(), 10)\nb = bin(n)\nl = len(b)\nfor i in b:\n\tif i == '1':\n\t\tprint(l, end=\"\")\n\t\tif l != 0:\n\t\t\tprint(' ', end=\"\")\n\tl = l-1\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/618/A\r\n\r\n# in: list of values in non-descending order, the value to search for\r\n# the first index to check between and the last index to check to\r\n# out: one index of value if it exists. If it does not, return -1\r\n# From: My Common Python Functions library\r\ndef binary_search_index_of(value, low, high):\r\n if low >= high:\r\n # if this is the value we're looking for, return it.\r\n if 2((low + high) // 2) <= value:\r\n return (low + high) // 2\r\n elif 2((low + high) // 2) > value:\r\n return (low + high) // 2 - 1\r\n else:\r\n # get the midpoint between the two functions\r\n mid = (low + high) // 2\r\n # if this is greater than value, search the left half\r\n if 2mid > value:\r\n return binary_search_index_of(value, low, mid - 1)\r\n # if this is less than value, search the right half\r\n elif 2mid < value:\r\n return binary_search_index_of(value, mid + 1, high)\r\n else:\r\n return mid\r\n\r\nn = int(input())\r\n\r\nc = n\r\nwhile c > 0:\r\n r = binary_search_index_of(c, 0, 100000)\r\n c -= 2r\r\n print(r + 1, end = \" \")", "n = int(input())\r\np = 1\r\na = []\r\n\r\nwhile n:\r\n b = n & 1\r\n if b:\r\n a.append(p)\r\n p += 1\r\n n >>= 1\r\n\r\nprint(' '.join(map(str, reversed(a))))", "# A. Slime Combining\n\nn = int(input())\n\nans = list()\nfor _ in range(n):\n ans.append(1)\n try:\n while ans[-1] == ans [-2]:\n ans[-2] += 1\n ans.pop()\n except IndexError:\n pass\n\nprint(' '.join([str(x) for x in ans]))\n", "#!/usr/bin/python3\n\nimport sys\n\nn = int(sys.stdin.readline().rstrip())\n\nA = []\n\nfor i in range(n):\n A.append(1)\n while len(A) >= 2 and A[-1] == A[-2]:\n A.pop()\n A[-1] += 1\n\nprint(\" \".join(map(str, A)))\n", "n=bin(int(input()))[2:]\r\nfor i in range(len(n)):\r\n if int(n[i])==1:\r\n print(len(n)-i, end=' ')", "if __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n res = []\r\n while n:\r\n res.append(n%2)\r\n n //= 2\r\n\r\n #res.reverse()\r\n\r\n for i in range(len(res)):\r\n if res[i]:\r\n res[i] = i+1\r\n\r\n res.reverse()\r\n\r\n s = \"\"\r\n for ares in res:\r\n if ares:\r\n s += str(ares) + \" \"\r\n\r\n print(s.strip())", "n = int(input())\r\nx = bin(n)[2:]\r\nanswer = []\r\ncounter = 1\r\nfor i in x[::-1]:\r\n if i != \"0\":\r\n answer.append(str(int(i) counter))\r\n counter += 1\r\nx = ''\r\nfor i in range(len(answer) - 1, -1, -1):\r\n x += answer[i] + \" \"\r\nprint(x)", "import math\r\n\r\nn = int(input())\r\nlist1 = [1]\r\nwhile n>0 :\r\n q = int(math.log(n,2))\r\n print(q+1, end=' ')\r\n n -= math.pow(2, q)", "n = int(input())\r\nl = []\r\ns = '{0:b}'.format(n)\r\nj = 0\r\n\r\nfor i in range(len(s), 0, -1):\r\n if s[j] == '1':\r\n l.append(i)\r\n\r\n j += 1\r\n\r\nprint(l)", "n=int(input())\r\nl=[1]\r\nfor i in range(2,n+1):\r\n l.append(1)\r\n while l[-1]==l[-2]:\r\n p=l.pop()\r\n l.pop()\r\n l.append(p+1)\r\n if len(l)==1:\r\n break\r\nfor i in l:\r\n print(i,end=' ')", "n = int(input())\r\ncurr = 1\r\nresult = [] \r\n\r\nwhile n > 0:\r\n if n % 2 == 1:\r\n result.append(curr)\r\n n //= 2\r\n curr += 1\r\n\r\nprint(' '.join(map(str, result[::-1])))\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(1)\r\n while len(a) > 1 and a[-2] == a[-1]:\r\n a.pop()\r\n a.append(a.pop() + 1)\r\n\r\nprint(\" \".join(map(str, a)))", "n = int(input())\nres, i = [], 0\nwhile 1 << i <= n:\n if n & (1 << i) != 0:\n res.append(i + 1)\n i += 1\nres = reversed(res)\nprint(res)\n", "n = int(input())\r\nb = list(bin(n)[2:])\r\nresult=''\r\nindices = []\r\nb.reverse()\r\nfor i in range(0, len(b)):\r\n if(b[i] == '1'):\r\n indices.append(i)\r\nindices.reverse()\r\nfor i in indices:\r\n result += str(i + 1) + ' '\r\nprint(result)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = []\r\nfor _ in range(n):\r\n ans.append(1)\r\n while len(ans) > 1 and not ans[-1] ^ ans[-2]:\r\n ans.pop()\r\n ans[-1] += 1\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\ncurr = [-7]\r\nfor i in range(n):\r\n curr.append(1)\r\n while curr[-1] == curr[-2]:\r\n curr[-2] += 1\r\n curr.pop()\r\nprint(' '.join(map(str, curr[1:])))", "n = int(input())\r\nfor i in range(20,-1,-1):\r\n\tif 2i <= n:\r\n\t\tprint(i+1,end=\" \")\r\n\t\tn-=2i", "num = int(input())\r\n\r\nvalue = []\r\n\r\nfor i in range(0,num):\r\n value.append(1)\r\n while len(value)>=2 and value[-1]==value[-2]:\r\n value[-2] += 1\r\n del value[-1]\r\n# The * symbol is used to print the list elements in a single line with space\r\nprint(value)\r\n", "n=int(input())\r\nd={}\r\ni=1\r\nwhile(n>0):\r\n d[i]=n%2\r\n n=n//2\r\n i+=1\r\n \r\nfor i in reversed(sorted(d.keys())):\r\n if d[i]:\r\n print(i,end=' ')", "x=int(input())\r\nL=[1];\r\nfor i in range(2,x+1):\r\n L.append(1);\r\n a=len(L)-1;\r\n while(a>0):\r\n if L[a]==L[a-1]:\r\n L[a-1]=L[a]+1;\r\n L[a:a+1]=[];\r\n else:\r\n break\r\n a=len(L)-1;\r\n if a==0:\r\n break\r\nfor i in L:\r\n print(i,end=' ')\r\n", "a=int(input())\r\nb=[]\r\nc=0\r\nwhile(a>>c):\r\n \r\n if (a>>c & 1):\r\n \r\n b.append(c+1)\r\n c=c+1\r\nprint(b[::-1])", "\r\nn = int(input())\r\narr = [1]\r\nfor i in range(1 ,n):\r\n arr.append(1)\r\n while (len(arr) > 1 and arr[-1] == arr[-2]):\r\n arr.pop()\r\n arr[-1] += 1\r\n\r\nprint(arr)\r\n\r\n\r\n", "n=int(input())\r\nb=bin(n)[2:]\r\nx=b[::-1]\r\nl=[]\r\nfor i in range(len(b)):\r\n if(x[i]=='1'):\r\n l.append(i+1)\r\nprint(l[::-1])\r\n", "n = int(input())\r\nar = list()\r\ni = int(1)\r\nwhile n != 0:\r\n if n % 2 != 0:\r\n ar.append(i)\r\n\r\n n //= 2\r\n i += 1\r\n\r\nar = ar[::-1]\r\nfor t in ar:\r\n print(t, end=' ')\r\n\r\n", "'''\nDavid Nelson\nsection EB1\n'''\n\n\nn = bin(int(input()))\nanswer = list()\n\nfor i in range( 2, len(n)):\n\tif n[-i+1] == '1':\n\t\tanswer.append(i-1)\n\t\t\nprint(' '.join( str(x) for x in reversed(answer)))\n\n\n", "def main():\n n = int(input())\n lst = list()\n for i in range(n):\n lst.append(1)\n cnt = len(lst)-1\n while cnt-1 >= 0 and lst[cnt-1] == lst[cnt]:\n lst[cnt-1] += 1\n del lst[cnt]\n cnt -= 1\n print(\" \".join(list(map(str, lst))))\nmain()\n \t \t\t\t\t \t \t \t \t\t \t \t\t\t", "n = int(input())\r\ns = bin(n)[2:]\r\nnum = len(s)\r\nfor f in s:\r\n if f == '1':\r\n print(num, end = ' ')\r\n num -= 1", "n = int(input()); l = [1]; cou = 0\r\nwhile cou < n-1: \r\n l.append(1); cou += 1\r\n while len(l) > 1 and l[-1] == l[-2]:\r\n l[-2] = l[-1] + 1\r\n l.pop()\r\nprint(l)", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n ls.append(1)\r\n try:\r\n while ls[-2]==ls[-1]: ls[-2]+=1; ls = ls[:-1]\r\n except: pass\r\nfor j in ls: print(j, end=' ')\r\nprint()\r\n", "b = list(bin(int(input()))[2:])[::-1]\r\nout = list()\r\nfor i in range(len(b)):\r\n if b[i] == '1':\r\n out.append(i + 1)\r\nprint(\" \".join(map(str,out[::-1])))", "n = int(input())\nA = []\nwhile n > 0:\n if n % 2 == 0:\n A.append(0)\n n //= 2\n else:\n A.append(1)\n n -= 1\n n //= 2\nA = A[::-1]\nfor i in range(len(A)):\n if A[i] == 1:\n print(len(A) - i, end = ' ')", "n = int(input())\nfor i in reversed(range(21)):\n if n & (1 << i) != 0:\n print(i + 1, end=' ')", "n=int(input())\r\nl=[1]\r\nfor i in range(n-1):\r\n l.append(1)\r\n while len(l)>=2 and l[-1]==l[-2]:\r\n l.pop(-1)\r\n l[-1]+=1\r\nprint(' '.join(map(str,l)))", "n = int(input())\r\np = []\r\n\r\n\r\ndef zzip(p):\r\n while True:\r\n if len(p) < 2:\r\n return p\r\n sl = p.pop()\r\n slr = p.pop()\r\n if sl == slr:\r\n p.append(sl + 1)\r\n else:\r\n p.append(slr)\r\n p.append(sl)\r\n return p\r\n\r\n\r\nfor i in range(0, n):\r\n p.append(1)\r\n p = zzip(p)\r\n\r\nfor s in p:\r\n print(s, end=\" \")\r\n\r\n", "lst, n = [], int(input())\r\nfor x in range(n):\r\n lst.append(1)\r\n while len(lst) > 1 and lst[len(lst) - 1] == lst[len(lst) - 2]:\r\n lst.pop()\r\n lst[len(lst) - 1] += 1\r\nprint(lst)", "#!/usr/bin/env python3\nn = int(input())\narr = []\n\nfor i in range(n):\n arr.append(1)\n while len(arr)>=2 and arr[-1] == arr[-2]:\n a, b = arr.pop(), arr.pop()\n arr.append(a+1)\n\nprint(' '.join(map(str, arr)))", "a = int(input())\nb = []\nfor i in range(a) :\n b.append(1)\n while True:\n if len(b) > 1 and b[-1] == b[-2]:\n b[-2] += 1\n del b[-1]\n else: break\nprint(b)", "def lenOfList(list):\r\n sum=0\r\n for x in list:\r\n sum+=1\r\n return sum \r\nn=int(input())\r\nabdo=\"\"\r\nrow=[]\r\nif n==1:\r\n print (1)\r\nelse:\r\n row.append(1)\r\n while n>1:\r\n n-=1\r\n row.append(1)\r\n while row[-1]==row[-2]:\r\n row.append(row[-1]+1)\r\n row.remove(row[-2])\r\n row.remove(row[-2])\r\n if lenOfList(row)<2:\r\n break\r\n for x in row:\r\n abdo+=str(x)+\" \"\r\n print(abdo) \r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\ns=[]\r\nfor i in range(20,-1,-1):\r\n if n&(1<<i) >0:\r\n s+=[str(i+1)]\r\nprint(\" \".join(s))\r\n", "n = int(input())\r\np = []\r\nwhile n != 0:\r\n while len(p) >= 2 and p[-2] == p[-1]:\r\n p[-2] += 1\r\n p.pop()\r\n p.append(1)\r\n n -= 1\r\nwhile len(p) >= 2 and p[-2] == p[-1]:\r\n p[-2] += 1\r\n p.pop()\r\nprint(p)\r\n \r\n", "def toBin(num):\r\n buf = ''\r\n while True:\r\n num, rest = num // 2, num - (num // 2 * 2)\r\n buf = str(rest)+buf\r\n if num == 0:\r\n break\r\n return int(buf)\r\n\r\n\r\ndef main():\r\n num = int(input())\r\n num_bin = toBin(num)\r\n num_bin_str = str(num_bin)\r\n num_bin_str_len = len(num_bin_str)\r\n solutions = []\r\n for pos in range(0, num_bin_str_len):\r\n if num_bin_str[pos] == \"1\":\r\n solutions.append(str(num_bin_str_len - pos))\r\n print(\" \".join(solutions))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\ns=bin(n)\r\ns=s[2:]\r\nfor i in range(len(s)):\r\n\tif s[i]=='1':\r\n\t\tprint(len(s)-i,end=\" \")", "def main():\r\n\tn = int(input())\r\n\tprint(solver(n))\r\n\r\ndef solver(n):\r\n\ts = bin(n)[2:]\r\n\tresult = []\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == '1':\r\n\t\t\tresult.append(len(s) - i)\r\n\treturn result\r\n\r\nmain()\r\n#print(solver(11))", "from collections import deque\nfrom sys import stdin as fin\n# fin = open(\"wfr2016a.in\", \"r\")\n\nn = int(fin.readline())\nstack = deque()\n\nfor i in range(n):\n stack.append(1)\n # cur = 1\n while len(stack) > 1 and stack[-1] == stack[-2]:\n stack.pop(); stack.append(stack.pop() + 1)\n \nfor num in stack:\n print(num, end=' ')\n", "n = int(input())\n\nL = []\nfor i in range(n):\n L.append(1)\n while len(L) >= 2 and L[-1] == L[-2]:\n L.pop()\n L[-1] += 1\nprint(' '.join(str(i) for i in L))\n", "x = int(input())\nv = []\nwhile x > 0:\n w = len(bin(x)) - 2\n v.append(w)\n x -= 2 ** (w - 1)\nprint(v)\n", "x=int(input())\ni=0\na=[]\nwhile x :\n i=i+1\n if x%2!=0:\n b=(x%2)i\n a.append(b)\n x=x//2\n else:\n x=x//2\na.reverse()\nfor t in range (len(a)):\n print('{}'.format(a[t]))\n\n \t\t\t \t \t\t \t \t\t\t \t \t\t \t\t", "n=int(input())\r\nm=n\r\nS=1\r\nd=[]\r\nwhile m>=1:\r\n if m%2==0:\r\n m=m//2\r\n S=S+1\r\n else:\r\n d.append(S)\r\n S=S+1\r\n m=m//2\r\nfor i in range(1,len(d)+1):\r\n print(d[len(d)-i],end=\" \")", "import itertools\r\n\r\n\r\ndef combine(data):\r\n changed = True\r\n while changed:\r\n if len(data)>=2 and data[-1] == data[-2]:\r\n res = data[0:-2]\r\n res.append(data[-1] + 1)\r\n changed = True\r\n data = res\r\n #print(data)\r\n else:\r\n changed = False\r\n\r\n return data\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n data = [1]\r\n for i in range(2, n + 1):\r\n data.append(1)\r\n data = combine(data)\r\n print(\" \".join([str(d) for d in data]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = \"{:b}\".format(n)\r\nr = []\r\nfor i, c in enumerate(l):\r\n if c==\"1\":\r\n r += [str(len(l)-i)]\r\nprint(\" \".join(r))\r\n", "def main():\r\n from math import log2, floor\r\n n = int(input())\r\n result = []\r\n\r\n while n > 0:\r\n x = floor(log2(n))\r\n result += [str(x + 1)]\r\n n -= 2 ** x\r\n\r\n print(' '.join(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\narr=[0]n\ni=1\nfor i in range(n):\n arr[i]=n%2\n n//=2\nfor j in range(i,-1,-1):\n if(arr[j]!=0):\n print(j+1,end=\" \")\n\t \t\t \t \t \t\t\t \t \t \t \t \t \t\t \t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n pot = [2i for i in range(18)]\r\n n = int(wtf[0])\r\n ans = []\r\n while n > 0:\r\n for i,v in enumerate(pot):\r\n if n == v:\r\n n = 0\r\n ans.append(i+1)\r\n break\r\n elif n > v and n < pot[i+1]:\r\n ans.append(i+1)\r\n n -= v\r\n break\r\n print(' '.join(map(str, ans)))\r\n", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn=int(input())\r\na=[0]10000000\r\ncnt=-1\r\nwhile(n):\r\n r=n%2\r\n n//=2\r\n cnt+=1\r\n a[cnt]=r\r\n\r\nfor i in range(cnt+1):\r\n if a[cnt-i]==1:\r\n print(cnt-i+1,end=' ')", "n = int(input())\r\ng = [1 for i in range(n)]\r\nif len(g) == 1 :\r\n\tprint(1)\r\n\texit()\r\n\r\nwhile True :\r\n\tchange = False\r\n\tl = g\r\n\t#print('l', l)\r\n\tg = []\r\n\ti = 0\r\n\twhile i < len(l):\r\n\t\t#print('i', i)\r\n\t\tif i == len(l) - 1 or l[i] != l[i+1]:\t#last one\r\n\t\t\tg.append(l[i])\r\n\t\t\t#print('g', g)\r\n\t\t\ti += 1\r\n\t\telse :\r\n\t\t\tg.append(l[i] + 1)\r\n\t\t\t#print('g', g)\r\n\t\t\ti += 2\r\n\t\t\tchange = True\r\n\tif not change :\r\n\t\t#print('break')\r\n\t\tprint(g)\r\n\t\texit()\r\n\t#print('g', g)\r\n", "x=int(input())\r\na=[1]\r\nfor i in range(x-1):\r\n if a[len(a)-1]==1:\r\n a[len(a)-1]+=1\r\n while len(a)>1 and a[len(a)-1]==a[len(a)-2]:\r\n a.pop()\r\n a[len(a)-1]+=1\r\n else:\r\n a.append(1)\r\nfor i in a:\r\n print(i)\r\n", "from sys import \r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n = int(inp())\r\n ans = []\r\n for i in range(20,-1,-1):\r\n if n & 1<<i:\r\n ans.append(str(i+1))\r\n print(' '.join(ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nstack = []\r\nfor i in range(n):\r\n stack.append(1)\r\n while len(stack) >= 2 and stack[-2] == stack[-1]:\r\n a = stack.pop()\r\n b = stack.pop()\r\n stack.append(a+1)\r\nprint(stack)\r\n", "__author__ = 'Admin'\r\nn = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(1)\r\n for j in range(i):\r\n if m[len(m) - 1] == m[len(m) - 2] and len(m) > 1:\r\n m[len(m) - 2] += 1\r\n m.pop(m.index(m[len(m) - 1]))\r\n else:\r\n break\r\nprint(m)", "n = int(input())\r\nli= []\r\nli.append(1)\r\nj = 1\r\nfor i in range(n-1):\r\n li.append(j)\r\n while len(li)>1:\r\n if li[-1]==li[-2]:\r\n li[len(li)-2]+=1\r\n li.pop(len(li)-1)\r\n else:\r\n break\r\nprint(li)\r\n", "\n\n#~ import io\n#~ import sys\n\n#~ test = '1'\n#~ test = '2'\n#~ test = '3'\n#~ test = '8'\n\n#~ sys.stdin = io.StringIO(test)\n\nn = int(input())\n\na = []\ndef simplify(a):\n if len(a)<=1:\n return\n if a[-2]==a[-1]:\n del a[-1]\n a[-1] += 1\n simplify(a)\n \nfor i in range(n):\n a.append(1)\n simplify(a)\n \n\nprint(\" \".join(map(str,a)))\n", "n = int(input())\r\na = []\r\nwhile n > 0:\r\n a.append(n % 2)\r\n n //= 2\r\nfor i in range(len(a) - 1, -1, -1):\r\n if a[i] == 1:\r\n print(i + 1, end=' ')", "print(\" \".join([str(v+1)for v,k in enumerate(bin(int(input()))[::-1])if k==\"1\"][::-1]))", "n=int(input())\r\n\r\na=str(bin(n)[2:])\r\nb=a[::-1]\r\nt=[]\r\n\r\nfor k in range(len(a)):\r\n if b[k]=='1':\r\n t.append(k+1)\r\n\r\nprint(t[::-1])\r\n \r\n", "n = int(input())\r\np = []\r\n\r\nfor i in range(n):\r\n p.append(1)\r\n try:\r\n while p[-1] == p[-2]:\r\n p[-2] += 1\r\n del p[-1]\r\n except:\r\n pass\r\n\r\nfor k in p[:-1]:\r\n print(k, sep=' ', end=' ')\r\nprint(p[-1])\r\n", "n = int(input())\r\na = [2 i for i in range(20)]\r\nans = []\r\n#print(a)\r\nwhile n > 0:\r\n for i in range(19, -1, -1):\r\n if n >= a[i]:\r\n print(i + 1, end=' ')\r\n n -= a[i]\r\n break\r\n", "n=int(input())\r\nfor i in range(16,-1,-1):\r\n if(n>=2i):\r\n n-=2i\r\n print(i+1,end=' ')", "n = int(input())\r\nwindow = []\r\nwhile n > 0:\r\n window.append(1)\r\n n -= 1\r\n while len(window) > 1 and window[-1] == window[-2]:\r\n window[-2] += 1\r\n window.pop()\r\nprint(' '.join(map(str, window)))\r\n", "v = []\r\nfor i in range(int(input())):\r\n v.append(1)\r\n while (len(v) >= 2 and v[-1] == v[-2]):\r\n v.pop()\r\n v[-1] += 1\r\nprint(' '.join(map(str, v)))", "def deep(n):\n if n != 0:\n i = 0\n while n > 2i:\n i += 1\n if n == 2i:\n print(i+1)\n else:\n print(i, end=' ')\n n -= 2(i-1)\n deep(n)\n\nn = int(input())\ndeep(n)\n", "from collections import deque\r\nn = int(input())\r\ndata = deque([1])\r\nwhile n > 1:\r\n data.append(1)\r\n n -= 1\r\n while len(data) > 1 and data[-1] == data[-2]:\r\n help = data[-1] + 1\r\n data.pop()\r\n data.pop()\r\n data.append(help)\r\nprint(list(data))", "n = int(input())\nl = []\nfor i in range(n):\n l.append(1)\n while len(l) > 1 and l[-1] == l[-2]:\n l.pop()\n l[-1] += 1\nprint(l)", "import math\r\nn=int(input())\r\ndef func(n,op):\r\n if n==1:\r\n op.append(1)\r\n return(op)\r\n elif n==2:\r\n op.append(2)\r\n return op\r\n elif math.log(n,2)%1==0:\r\n op.append(int(math.log(n,2)+1))\r\n return op\r\n else:\r\n op.append(int(math.log(n,2)+1))\r\n n-=2*(int(math.log(n,2)))\r\n return func(n,op)\r\nop=(func(n,[]))\r\nfor j in op:\r\n print(j,end=' ')\r\n", "n=int(input());i=0;a=[]\r\nwhile(n!=1):\r\n i+=1\r\n if n%2:a.insert(0,i)\r\n n=n//2\r\na.insert(0,i+1)\r\nprint(a)", "def solve(l):\r\n\tif(len(l)>1 ):\r\n\t\tif(l[-1]==l[-2]):\r\n\t\t\ta=l[-1]\r\n\t\t\tl.pop()\r\n\t\t\tl.pop()\r\n\t\t\tl.append(a+1)\r\n\r\n\t\tif(len(l)!=len(set(l))):\r\n\t\t\tl=solve(l)\r\n\t\t\treturn l\r\n\t\telse:\r\n\t\t\treturn l\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(1)\r\n\tif(len(l)!=len(set(l))):\r\n\t\tl=solve(l)\r\n\r\nprint(l)\r\n\r\n\r\n", "n = int(input())\r\nl = [1]\r\nfor i in range(1,n):\r\n\tl.append(1)\r\n\tfor j in range(len(l)):\r\n\t\tif len(l)>1 and l[-1]==l[-2] : \r\n\t\t\tl[-2]=l[-2]+1 \r\n\t\t\tl.pop(-1)\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(l)", "def answer(n):\r\n x=[]\r\n while(n!=0):\r\n temp=n%2\r\n n//=2\r\n x.append(temp)\r\n for i in reversed(range(len(x))):\r\n if x[i]==1:\r\n print(i+1,end=' ')\r\nn=int(input())\r\nanswer(n)", "import math\r\n\r\nn = int(input())\r\narr = []\r\nwhile n != 0:\r\n bass = math.floor(math.log(n, 2)) + 1\r\n arr.append(bass)\r\n n -= 2 ** (bass - 1)\r\n\r\nprint(arr)", "n = int(input())\r\nans = []\r\nst = 1\r\nfor i in range(n):\r\n ans.append(1)\r\n while len(ans) > 1 and ans[-1] == ans[-2]:\r\n ans[-2] += 1\r\n ans.pop()\r\nprint(ans)", "n = int(input())\nb = bin(n)[2:]\n\nl = []\nfor i, c in enumerate(b):\n if c == '1':\n l.append(len(b) - i)\n\nprint(' '.join(map(str, l)))\n", "n = int(input())\r\nk = bin(n)[2::]\r\nmas = []\r\nl = len(k)\r\nfor a in range(l):\r\n if k[a] == \"1\":\r\n mas.append(str(l - a))\r\nprint(\" \".join(mas))", "n = int(input())\r\ns = bin(n)[2:]\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n print(len(s) - i, end = ' ')", "n=int(input())\r\nb=list(bin(n))[2:]\r\nb.reverse()\r\ns=str()\r\nfor i in range(len(b)):\r\n if b[i]==\"1\":\r\n s=str(i+1)+\" \"+s\r\nprint(s)", "n = int(input())\r\nres = []\r\nwhile n > 0:\r\n res.append(n%2)\r\n n//=2\r\nans=[]\r\nfor i in range(len(res)):\r\n if(res[i])>0:\r\n ans.append(i+1)\r\nans.reverse()\r\nprint(' '.join(map(str, ans)))\r\n\r\n", "n = int(input())\n\nv = []\nfor i in range(n):\n v.append(1)\n\n while len(v) >= 2 and v[-2] == v[-1]:\n x = v.pop()\n v.pop()\n v.append(x+1)\n\nprint(' '.join([str(x) for x in v]))\n\n", "ans = []\r\nn = int(input())\r\nfor i in range(n):\r\n if(len(ans) == 0):\r\n ans.append(1)\r\n else:\r\n ans.append(1)\r\n for j in range(len(ans)-1, 0, -1):\r\n if ans[j] == ans[j-1]:\r\n ans.pop()\r\n ans[-1] += 1 \r\nprint(ans)", "A = [i for i, ch in enumerate(reversed(bin(int(input()))), 1) if ch == '1']\r\nprint(reversed(A))", "n=int(input())\r\nk=[1]n\r\nwhile len(list(set(k)))!=len(k):\r\n i=0\r\n while i<(len(k)-1):\r\n if k[i]==k[i+1]:\r\n m=k[i]\r\n del k[i:i+2]\r\n k.insert(i,m+1)\r\n i+=1\r\n else:\r\n i+=1\r\nprint(k) \r\n", "n = int(input())\r\nbinaryNum = bin(n)\r\nn = binaryNum[2:]\r\nle = len(str(n))\r\nans = []\r\nfor i in map(int, str(n)):\r\n if i == 1:\r\n ans.append(le)\r\n le -= 1\r\n\r\nprint(ans)", "n = int(input())\r\n\r\ndef rec(l):\r\n\r\n while l[-1] == l[-2]:\r\n l[-2] += 1\r\n l.pop()\r\n return l\r\n\r\nres = [0]\r\nfor i in range(n):\r\n res.append(1)\r\n res = rec(res)\r\n\r\nprint(\" \".join(map(str, res[1:])))", "# -- coding: utf-8 --\n\"\"\"\nCreated on Fri Jan 29 17:33:10 2016\n\n@author: kebl4230\n\"\"\"\n\nn = int(input())\nmylist = []\n\ndef RecursiveDivision(new_n, mylist):\n mylist.append(new_n % 2)\n nn = int(new_n / 2)\n if nn > 0:\n RecursiveDivision(nn, mylist)\n else:\n return mylist\n\nRecursiveDivision(n, mylist)\nmylist.reverse()\nmystring = str()\nN = len(mylist)\nfor num in mylist:\n for repeat in range(num):\n mystring += str(N) + \" \"\n N -= 1\nprint(mystring)", "n = int(input())\nprint(' '.join(str(i + 1) for i in range(20, -1, -1) if (n & (1 << i))))", "def Inspect():\r\n global Slice\r\n k = len(Slice)\r\n for i in range(k):\r\n if Slice[i] != -1:\r\n Slice.append(Slice[i])\r\n Slice = Slice[k:]\r\n for i in range(len(Slice)-1):\r\n if Slice[i] == Slice[i+1]:\r\n return False\r\n return True\r\nn = int(input())\r\nSlice = [1] n\r\nwhile not(Inspect()):\r\n for i in range(len(Slice)-1):\r\n if Slice[i] == Slice[i+1]:\r\n Slice[i+1] = Slice[i] + 1\r\n Slice[i] = -1\r\n Inspect()\r\nprint(Slice)", "n = int(input())\r\npodokonnik = []\r\nwhile n > 0:\r\n podokonnik.append(1)\r\n while len(podokonnik) >= 2 and podokonnik[-1] == podokonnik[-2]:\r\n podokonnik[-2] = podokonnik[-2] + 1\r\n podokonnik.pop()\r\n n -= 1\r\nfor elem in podokonnik:\r\n print(elem, end=\" \")\r\n", "x = int(input())\r\nt = 0\r\nr = []\r\nt1 = 0\r\nwhile t != x:\r\n\tr.append(1)\r\n\t# if t>=1:\r\n\tif len(r)>1:\r\n\t\tt1 = len(r)\r\n\t\tfor i in range(t1):\r\n\t\t\t# print(r)\r\n\t\t\tif len(r) == 1:\r\n\t\t\t\tcontinue\r\n\t\t\tif r[len(r)-1] == r[len(r)-2]:\r\n\t\t\t\tr[len(r)-2] = r[len(r)-2] + 1\r\n\t\t\t\tif len(r) == 1:\r\n\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tr.pop(len(r)-1)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\tt = t + 1\r\n# if len(r) == 1:\r\n# \tprint(\"1\")\r\n# \t# print(\"H\")\r\n# print(r)\r\nfor i in range(len(r)):\r\n \tprint(r[i])", "n = int(input())\r\nans = []\r\nwhile n > 0:\r\n t, k = 1, 1\r\n while t 2 <= n:\r\n t = 2\r\n k += 1\r\n ans.append(k)\r\n n -= t\r\nfor e in ans:\r\n print(e, end=' ')", "n=int(input())\r\nbit=bin(n)[2:]\r\nv=[]\r\nl=len(bit)\r\nfor i in range(l):\r\n if bit[l-i-1]=='1':\r\n v.append(i+1)\r\nv.reverse()\r\nprint(' '.join(map(str,v)))", "n=int(input())\r\na,d=[n%2],n//2\r\nwhile d>0:\r\n\ta.insert(0,d%2)\r\n\td=d//2\r\nl=len(a)\r\nfor x in range(l):\r\n\tif a[x]==1:print(l-x,end=\" \")", "n = int(input()) - 1\r\na = [1]\r\nwhile n > 0:\r\n n -= 1\r\n a.append(1)\r\n while a[-2] == a[-1]:\r\n del a[-1]\r\n a[-1] += 1\r\n if len(a) == 1:\r\n break\r\nprint(a)\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(107)\ninf=1020\nmod=10*9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n a=[]\n n=I()\n for i in range(n):\n x=1\n while True:\n if len(a)>0:\n y=a.pop()\n if y==x:\n x+=1\n else:\n a.append(y)\n a.append(x)\n break\n else:\n a.append(x)\n break\n # print(a)\n\n return ' '.join(str(x) for x in a)\n\n# main()\nprint(main())\n", "l = [0] + list(reversed(bin(int(input()))))\r\nfor i in range(len(l)-2,0,-1):\r\n if l[i] == '1':\r\n print(i,end=' ')\r\n\r\n \r\n\r\n \r\n", "#!/usr/bin/python3\n\nn = int(input())\nb = [i for i in str(bin(n))]\nb = b[2:]\nb = list(map(int, b))\n\nl = len(b)\ni = 0\nwhile i < l:\n b[i] = b[i] (l-i)\n i += 1\n\nfor i in b:\n if i != 0:\n print(str(i), end=\" \")\n", "#IN THE NAME OF GOD\na=int(input())\nb=bin(a)\ni=2\nwhile i<len(b):\n if b[i]=='1':\n print( len(b)-i,end=\" \")\n i+=1\n\n", "n = int(input())\narr = [1]\nfor i in range(1, n):\n\tarr.append(1)\n\twhile (len(arr) > 1 and arr[-1] == arr[-2]):\n\t\tarr.pop()\n\t\tarr[-1]+=1\nprint(arr)", "n=int(input());v=[]\r\nt=0;s=\"\"\r\nwhile (n!=0):\r\n s+=str(n%2)\r\n n//=2\r\nfor i in range(len(s)):\r\n if (s[i]==\"1\"):\r\n v.append(i+1)\r\nfor i in range(len(v)-1,-1,-1):\r\n print(v[i],end=\" \")\r\n", "n = int(input())\r\narr = [1]\r\nfor i in range(n-1):\r\n arr.append(1)\r\n while len(arr)>=2 and arr[-1]==arr[-2]:\r\n arr[-2] += 1\r\n del arr[-1]\r\nprint(arr)", "import math\r\na=[]\r\nn=int(input())\r\namari=n\r\nwhile amari != 0:\r\n a.append(math.floor(math.log(amari,2))+1)\r\n amari -= 2*math.floor(math.log(amari,2))\r\n\r\nprint(' '.join(map(str,a)))", "def bina(x):\r\n ret = \"\"\r\n while(x>0):\r\n ret = str(x%2)+ret\r\n x = x//2\r\n return ret\r\n\r\na = int(input())\r\nb = bina(a)\r\nl = len(b)\r\nprint(l-b.find(\"1\"), end=\"\")\r\nfor i in range(b.find(\"1\")+1, l):\r\n if b[i:i+1] == \"1\":\r\n print(\" \"+str(l-i), end = \"\")\r\n\r\n", "n = int(input())\nres = n\ncurrent = 1\ncurrent_idx = 1\nans = []\nwhile res >= current:\n if res & current == current:\n ans.append(current_idx)\n current = 2\n current_idx += 1\nprint(' '.join([str(i) for i in ans[::-1]]))\n", "k=int(input())\r\na=[0]\r\ni=0\r\nwhile(i<k):\r\n a.append(1)\r\n while a[len(a)-1]==a[len(a)-2]:\r\n a.remove(a[len(a)-1])\r\n a[len(a)-1]+=1\r\n i+=1;\r\nfor i in range(1,len(a)):\r\n print(a[i],end=\" \")", "n = int(input())\nans = []\ntarget = bin(n)[2:][::-1]\nfor i in range(len(target)):\n if target[i] == '1':\n ans.append(i + 1)\nprint(ans[::-1])", "from collections import deque\r\n\r\ndef clean(d):\r\n while len(d) > 1 and d[-1] == d[-2]:\r\n d.pop()\r\n d[-1] += 1\r\n \r\nn = int(input())\r\nd = deque([])\r\nfor _ in range(n):\r\n d.append(1)\r\n clean(d)\r\n\r\nprint(\" \".join(str(x) for x in d))", "def main():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(1)\r\n while len(a) > 1 and a[-1] == a[-2]:\r\n a.pop()\r\n a[-1] += 1\r\n \r\n print(' '.join(str(i) for i in a))\r\n\r\n\r\nmain()", "n=int(input())\r\n\r\nfor i in range(20,-1,-1):\r\n\tif n>=2i:\r\n\t\tprint(i+1, end=\" \")\r\n\t\tn-=2i\r\n\tif not n:\r\n\t\tbreak\r\n#Needed HELP!!", "n = int(input())\n\nimport math\nres = []\nwhile n>0:\n i = math.floor(math.log(n,2))\n n -= 2i\n res.append(i+1)\nprint(res)", "n = int(input())\nout = []\ncur = 1\nwhile n > 0:\n if n % 2 == 1:\n out.append(cur)\n cur += 1\n n //= 2\nfor v in reversed(out):\n print(v, end=' ')\nprint()\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn=int(input())\r\nx=bin(n)\r\nx=x[2:]\r\nx=x[::-1]\r\na=[]\r\nl=len(x)\r\nfor i in range(l):\r\n\tif x[i]==\"1\":\r\n\t\ta.append(i+1)\r\na=a[::-1]\r\nprint(a,sep=\" \")\t\t", "#! /usr/bin/env python\n# -- coding: utf-8 --\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\nl = []\n\nwhile n > 0:\n i = 0\n while pow(2, i) <= n:\n i += 1\n\n l.append(i)\n n -= pow(2, i-1)\n\nfor e in l:\n print(e, end=\" \")\nprint()\n", "n=int(input())\r\nl=[1]\r\nfor i in range(2,n+1):\r\n l+=[1]\r\n while len(l)>=2:\r\n if l[-1]==l[-2]: l=l[:-2]+[l[-1]+1]\r\n else: break\r\nprint(' '.join(map(str,l)))", "n = int(input())\r\n\r\nif n < 1 or n > 100000:\r\n raise ValueError(\"Invalid number of slugs\")\r\n\r\nn -= 1\r\nv = [1]\r\n\r\nfor i in range(n):\r\n v.append(1)\r\n while len(v) > 1:\r\n current = len(v) - 1\r\n previous = current - 1\r\n if v[current] != v[previous]:\r\n break\r\n temp = v[current]\r\n v.pop()\r\n v.pop()\r\n v.append(temp + 1)\r\nprint(v)# 1698363740.699369", "from math import \r\nx = int(input())\r\nwhile x>0:\r\n print(floor(log2(x))+1,end=' ')\r\n x-=pow(2,floor(log2(x)))\r\nprint()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=bin(int(input()))[:1:-1]\r\nb=[i+1 for i in range(len(a))if a[i]=='1']\r\nprint(' '.join(map(str,b[::-1])))\r\n", "from collections import deque\r\n\r\nSize = int(input())\r\nList = deque()\r\nfor i in range(Size):\r\n List.append(1)\r\n while True:\r\n if len(List) > 1 and List[-1] == List[-2]:\r\n List.pop()\r\n List[-1] += 1\r\n else:\r\n break\r\nprint(List)\r\n", "s = bin(int(input()))[2:]\nsol = []\nfor i, j in enumerate(s):\n if j == \"1\":\n sol.append(str(len(s) - i))\nprint(\" \".join(sol))\n \n", "n = int(input())\nans = []\nfor _ in range(n):\n ans.append(1)\n while len(ans) >= 2 and ans[-1] == ans[-2]:\n ans[-2] += 1\n ans.pop()\nprint(ans)", "def solve(n):\n a = [1]\n n -= 1\n while n:\n a.append(1)\n while len(a) >= 2 and a[-1] == a[-2]:\n a[-1] = a.pop() + 1\n n -= 1\n return ' '.join(map(str, a))\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "n, s = int(input()), []\r\nfor i in range(20, -1, -1):\r\n if 2 * i <= n:\r\n s.append(i + 1)\r\n n -= 2 ** i\r\nprint(s)", "n = int(input())\r\nk = []\r\nfor x in range(n):\r\n k.append(1)\r\n while len(k) >= 2 and k[-2] == k[-1]:\r\n k.pop()\r\n k[-1] += 1\r\nprint(\" \".join(map(str, k)))", "n=int(input())\r\nbit=[]\r\nwhile n>0:\r\n bit.append(n%2)\r\n n//=2\r\nv=[]\r\nfor i in range(len(bit)):\r\n if bit[i]>0:\r\n v.append(i+1)\r\nv.reverse()\r\nprint(' '.join(map(str,v)))", "if __name__ == '__main__':\r\n num = str(bin(int(input()))).replace('0b', '')\r\n size = len(num)\r\n line = list()\r\n for i in range(size):\r\n if num[i] == '1':\r\n line.append(str(size - i))\r\n print(' '.join(line))\r\n", "n = int(input())\r\nslimes = []\r\nfor x in range(n):\r\n slimes.append(1)\r\n while len(slimes) >= 2 and slimes[-1] == slimes[-2]:\r\n a = slimes[-1]\r\n del slimes[-1], slimes[-1]\r\n slimes.append(a + 1)\r\nprint(\" \".join(map(str, slimes)))", "s = bin(int(input()))[2:]\r\nfor i, x in enumerate(s):\r\n if x == '1':\r\n print(len(s)-i, end=' ')\r\n", "n=int(input())\n\ns=bin(n)[2:]\nl=len(s)\nlst=[]\nfor i in range(l):\n\tif s[i]=='1':\n\t\tprint((l-i), end=' ')", "import sys\r\nimport math\r\n\r\ndef good(n):\r\n\twhile n%2==0:\r\n\t\tn/=2\r\n\tif n==1:\r\n\t\treturn True\r\n\telse :\r\n\t\treturn False\r\n\r\narr={1:[1],}\r\nt=2\r\nwhile t<100005:\r\n\tarr[t]=[]\r\n\tif good(t):\r\n\t\tarr[t]=[int(math.log2(t))+1]\r\n\telse:\r\n\t\ttmp=2(int(math.log2(t)))\r\n\t\tarr[t]=arr[tmp]+arr[t-tmp]\r\n\tt=t+1\r\n\r\nfor line in sys.stdin:\r\n\tn=line.split()\r\n\ta=int(n[0])\r\n\tfor i in arr[a]:\r\n\t\t# print(\"debug\")\r\n\t\tprint(i,end=\" \")\r\n\t\r\n\r\n\r\n\r\n", "\r\ndef solve():\r\n n = bin(int(input()))[-1:1:-1]\r\n b = [i + 1 for i in range(len(n)) if n[i] == '1']\r\n\r\n print(' '.join(map(str, b[::-1])))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "temp=int(input())\r\nq=1\r\noutstr=\"\"\r\nif temp>1:\r\n z=temp\r\n while z>1:\r\n z=temp//2\r\n y=temp%2\r\n if y > 0:\r\n outstr = str(q) + \" \" + outstr\r\n q+=1\r\n temp=z\r\n \r\n outstr = str(q) + \" \" + outstr\r\nelse:\r\n outstr = str(q)\r\n\r\nprint(outstr) ", "import sys\n\ndef main():\n n = int(sys.stdin.readline())\n if n < 3:\n return [n]\n \n arr = []\n c = 0\n\n while n:\n c, a = helper(n)\n n -= a\n arr.append(c)\n return arr\n\ndef helper(n):\n if n == 0:\n return 0, 0\n elif n == 1:\n return 1, 1\n c = 0\n a = 1\n while a < n+1:\n a <<= 1\n c += 1\n a >>= 1\n return c, a\n\n\n\nprint(main())", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn = int(input())\r\nL = []\r\nr = 1\r\nct = 1\r\nwhile n >= r :\r\n if (n & r > 0) : L.append(ct)\r\n r = 2\r\n ct += 1\r\n\r\nL.reverse()\r\nprint(' '.join(map(str, L)))\r\n\r\n", "n = int(input())\r\npower = [1] 100\r\nfor i in range(1, 100):\r\n power[i] = power[i - 1] * 2\r\nanswer = []\r\na = 99\r\nwhile n > 0:\r\n if n >= power[a]:\r\n n -= power[a]\r\n answer.append(a + 1)\r\n a -= 1\r\nprint(answer)", "n= int(input(''))\r\na= []\r\nwhile n>0:\r\n a.append(n-2int(n/2))\r\n n= int(n/2)\r\nn= len(a)\r\ns= ''\r\nwhile n>0:\r\n n-= 1\r\n for i in range(a[n]):\r\n s+= str(n+1)+' '\r\nprint(s[0:-1])", "n = int(input())\ns = bin(n)\ns = s[2:]\nk = len(s)\nfor i, x in enumerate(s):\n if x == '1':\n print(k - i, end = ' ')\n", "n = int(input())\nrez = []\ni = 1\nwhile n > 0:\n if n % 2:\n rez = [i] + rez\n n //= 2\n i += 1\nprint(rez)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(1)\r\n while len(a)>1:\r\n if a[len(a)-2]==a[len(a)-1]:\r\n a[len(a)-2]=a[len(a)-1]+1\r\n del(a[len(a)-1])\r\n else:\r\n break\r\nfor i in range(len(a)):\r\n print(a[i],end=\" \")\r\n", "# n = int(input())\n# tn = [int(i) for i in input().split()]\n\n# def f(m):\n\n\n# m = 0\n# l = 0\n# r = n\n\n# while l < r:\n# m = (l + r)//2\n \n\nn = int(input())\np = []\n\nfor i in range(n):\n\tp.append(1)\n\twhile len(p) >= 2 and p[-1] == p[-2]: \n\t\tp[-2] += 1\n\t\tp.pop()\n\nfor i in p: print(i, end=\" \")", "n = int(input())\r\nanswer = []\r\nwhile n > 0:\r\n answer.append(1)\r\n for i in range(1, max(answer) + 1):\r\n if answer.count(i) == 2:\r\n answer[answer.index(i)] += 1\r\n answer.remove(i)\r\n n -= 1\r\nprint(answer)\r\n", "a = []\nfor x in range(int(input())):\n a.append(1)\n while len(a) > 1 and a[-1] == a[-2]:\n a.pop()\n a.append(a.pop() + 1)\nprint(a)\n", "n = bin(int(input()))[2:]\r\nl = len(n)\r\nfor i in n:\r\n\tif i=='1':\r\n\t\tprint(l, end = ' ')\r\n\tl-=1", "n = int(input())\n\ns = bin(n)[2:]\nl = len(s)\nlst = []\nfor i in range(l):\n if s[i] == \"1\":\n print((l - i), end=\" \")\n\n", "n = int(input())\r\nnn = n\r\na = []\r\nwhile nn:\r\n if len(a) > 1:\r\n if a[0] != a[1] and a[-1] != a[-2]:\r\n a.append(1)\r\n nn -= 1\r\n else:\r\n a.append(1)\r\n nn -= 1\r\n \r\n while len(a) > 1 and (a[0] == a[1] or a[-1] == a[-2]):\r\n if a[0] == a[1]:\r\n a[1] += 1\r\n a = a[1:]\r\n \r\n if len(a) > 1 and a[-1] == a[-2]:\r\n a[-2] += 1\r\n a = a[:-1]\r\n \r\nfor i in a:\r\n print(i, end=\" \")\r\nprint()", "n = int(input())\r\n\r\nans = []\r\n\r\nnum = list(bin(n)[2::])\r\nsize = len(num)\r\n\r\nfor idx in range(size):\r\n if num[idx] == '1':\r\n ans.append(size - idx)\r\n\r\nprint(' '.join(map(str,ans)))", "n = int(input())\r\na = []\r\nwhile n > 0:\r\n a.append(1)\r\n n = n - 1\r\n while len(a) > 1 and a[len(a) - 1] == a[len(a) - 2]:\r\n x = a[len(a) - 1] + 1\r\n a.pop()\r\n a.pop()\r\n a.append(x)\r\n\r\nfor i in a:\r\n print(i, end=' ')", "x=int(input())\r\np=[1]\r\nfor i in range(2,x+1):\r\n p.append(1)\r\n n=len(p)-1\r\n while n>0:\r\n if p[n]==p[n-1]:\r\n p[n-1]=p[n]+1\r\n p[n:n+1]=[]\r\n else:break\r\n n=len(p)-1\r\nfor i in p:\r\n print(i,end=\" \")", "n = int(input())\r\nprint(\" \".join(str(i+1) for i in range(20,-1,-1) if (n&(1<<i))>0))", "\r\nn = int(input());\r\n\r\nk = 1\r\n\r\na = []\r\nwhile n > 0 :\r\n \r\n if n & 1 :\r\n a.append(k)\r\n k += 1\r\n n = n >> 1\r\n\r\na.reverse()\r\nans = \"\"\r\nfor i in range(len(a)) :\r\n ans += str(a[i]) + \" \"\r\nprint(ans)\r\n", "n = bin(int(input()))[2:]\r\n\r\nl = len(n)\r\n\r\nfor i in n:\r\n if i == \"1\":\r\n print(l, end = \" \")\r\n l -= 1\r\n", "n=int(input())\r\na=[]\r\nfor j in range(n):\r\n\ta.append(1)\r\n\tif len(a)>1:\r\n\t\tfor i in range(len(a)):\r\n\t\t\tif a[len(a)-2]==a[len(a)-1]:\r\n\t\t\t\ta[len(a)-2]=a[len(a)-2]+1\r\n\t\t\t\tdel a[len(a)-1]\r\n\t\t\t\tif len(a)==1:\r\n\t\t\t\t\tbreak\r\nprint(a)", "n = int(input())\r\nimport math\r\ns = ''\r\na = 1\r\n\r\nwhile n > 0 :\r\n a = int(math.log2(n)) + 1\r\n s += str(a) + ' '\r\n n -= 2 ** (a - 1)\r\nprint(s)\r\n", "s = bin(int(input()))[2:]\r\nfor i,j in enumerate(s):\r\n if j=='1':print(len(s)-i)\r\n", "n=int(input())\r\ni=1\r\nk=1\r\na=[]\r\nwhile i<=n:\r\n if i&n:\r\n a.append(k)\r\n i<<=1\r\n k+=1\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end=' ')", "n=int(input())\r\ns=[1]n\r\nwhile not len(set(s))==len(s):\r\n sc=[]\r\n i=0\r\n while i <(len(s)):\r\n if i==(len(s)-1):\r\n sc.append(s[i])\r\n break\r\n if s[i]==s[i+1]:\r\n sc.append(s[i]+1)\r\n i+=1\r\n else:\r\n sc.append(s[i])\r\n i+=1\r\n s=sc\r\nprint(s)", "import math \r\nn=int(input())\r\nwhile n>2:\r\n\tk=math.floor(math.log(n, 2))\r\n\tn-=2k\r\n\tprint(k+1, end=' ')\r\nif n>0: print(n, end=' ')", "import sys\r\nfrom math import log\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n out = []\r\n while n:\r\n t = int(log(n, 2))\r\n out.append(t+1)\r\n n -= 2t\r\n return out\r\n\r\nprint(main())\r\n", "from math import log2\r\nn = int(input())\r\nl = 1 + int(log2(n))\r\nout = []\r\nwhile n:\r\n #print (n, l, 2l)\r\n if n >= 2l:\r\n n -= 2l\r\n out.append(str(l+1))\r\n l -= 1\r\n \r\nprint (' '.join(out))\r\n\r\n", "\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n lst = []\r\n # i = 1\r\n while n>=1:\r\n if len(lst)==0:\r\n #print(\"he\")\r\n lst.append(1)\r\n else:\r\n lst.append(1)\r\n #print(\"se\")\r\n while lst[len(lst)-1]==lst[len(lst)-2] and len(lst)>1:\r\n k = lst[len(lst)-1]+1\r\n lst.pop()\r\n lst.pop()\r\n lst.append(k)\r\n \r\n \r\n #i += 1\r\n n -= 1\r\n for i in lst:\r\n print(i,end=' ')\r\n", "N = int(input())\nans = []\ni = 0\nwhile N >> i:\n if (N >> i) & 1:\n ans.append(i+1)\n i += 1\nprint(ans[::-1])\n", "n=int(input())\nslimes=[]\nslimes.append(1)\nfor i in range(n-1):\n\tslimes.append(1)\n\twhile 1:\n\t\t#print(\"h\")\n\t\tif len(slimes)==1 or (slimes[-1] !=slimes[-2]) :\n\t\t\tbreak\n\t\tslimes[-2]+=1\n\t\tdel slimes[-1]\nprint (slimes)\n\n\n\n\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "\r\nnum = int(input())\r\n\r\nans = []\r\n\r\nwhile num:\r\n ans.append(1)\r\n while len(ans) > 1 and ans[-1] == ans[-2]:\r\n x = ans.pop() + 1\r\n ans[-1] = x\r\n num -= 1\r\nprint(ans)\r\n\r\n", "n = int(input())\nplace = 1\narr = []\nwhile(n != 0):\n\tif(n % 2 == 1):\n\t\tarr.append(place)\n\tplace += 1\n\tn = n // 2\narr = arr[::-1]\nprint(arr)", "n=int(input())\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(1)\r\n while len(arr)>=2 and arr[-1]==arr[-2]:\r\n t=arr[-1]+1\r\n del arr[-1]\r\n del arr[-1]\r\n arr.append(t)\r\nprint (arr)", "a=[0]\r\nfor _ in range(int(input())):\r\n\ta+=[1]\r\n\twhile a[-2]==a[-1]:\r\n\t\ta.pop()\r\n\t\ta[-1]+=1\r\nprint(a[1:])", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\ns=\"\"\r\nwhile n!=0:\r\n s+=str(n%2)\r\n n//=2\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i]=='1':print(i+1,end=\" \")\r\n \r\n ", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\nmemo = [[] for _ in range(k + 1)]\r\n\r\nfor i in range(1, k + 1):\r\n tmp = int(math.log2(i)) + 1\r\n memo[i].append(tmp)\r\n memo[i] += memo[i - 2(tmp - 1)]\r\n\r\nprint(memo[k])\r\n", "n = int(input())\nbin_n = bin(n)[2:]\n\nl = len(bin_n)\nans = [str(l-i) for i in range(l) if bin_n[i] == '1']\nprint(' '.join(ans))\n", "import sys\n\nn = int(sys.stdin.read())\nslimes = [1]\nfor i in range(n-1):\n slimes.append(1)\n pos = len(slimes) - 1\n while pos > 0 and slimes[pos] == slimes[pos-1]:\n del slimes[pos]\n slimes[pos-1] += 1\n pos -= 1\nprint(' '.join(str(slime) for slime in slimes))", "n = int(input())\r\nx = 20\r\n\r\nwhile x >= 0:\r\n if 1 << x & n:\r\n print(x + 1, end=\" \")\r\n x -= 1\r\n", "a = int(input())\r\nm = 1\r\na1 = a\r\nwhile a1 > 1:\r\n a1 /= 2\r\n m += 1\r\nans = []\r\nm += 1\r\nwhile m >= 0:\r\n if a >= 2 m:\r\n a = a - 2 m\r\n ans.append(m + 1)\r\n m -= 1\r\nprint(ans)", "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n for i in range(31, -1, -1):\r\n if n & 1 << i:\r\n print(i + 1, end=' ')\r\n print()\r\n\r\nexcept EOFError:\r\n pass\r\n", "\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(1)\r\n\twhile len(l) > 1 and l[-1] == l[-2]:\r\n\t\tl[-2] += 1\r\n\t\tl.pop()\r\n\r\nprint(l , sep = ' ')\r\n\r\n", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n\td.append(1)\r\n\tif len(d)>=2:\r\n\t\twhile(d[-1]==d[-2]):\r\n\t\t\t\tif d[-1]==d[-2]:\r\n\t\t\t\t\tr=d[-1]+1\r\n\t\t\t\t\td.append(r)\r\n\t\t\t\t\td.pop(-2)\r\n\t\t\t\t\td.pop(-2)\r\n\t\t\t\tif len(d)<2:\r\n\t\t\t\t\tbreak\r\nprint(d)\r\n", "n = int(input())\r\n\r\ns = [1]\r\nfor i in range(n - 1):\r\n s.append(1)\r\n while len(s) > 1 and s[-2] == s[-1]:\r\n s = s[:-2] + [1 + s[-1]]\r\nprint(s)", "x=int(input());p=2;a=[];b=[]\r\nfor i in range(x):\r\n\tif pi>x:break\r\n\ta.append(pi)\r\na=a[::-1]\r\nfor i in range(len(a)):\r\n\tif a[i]<=x:\r\n\t\tb.append(len(a)-i)\r\n\t\tx=x-a[i]\r\n\tif x==0:exit(print(*b))" ]	{"inputs": ["1", "2", "3", "8", "100000", "12345", "32", "70958", "97593", "91706", "85371", "97205", "34768", "12705", "30151", "4974", "32728", "8192", "65536", "32", "256", "4096", "33301", "16725", "149", "16277", "99701"], "outputs": ["1", "2", "2 1", "4", "17 16 11 10 8 6", "14 13 6 5 4 1", "6", "17 13 11 9 6 4 3 2", "17 15 14 13 12 11 9 6 5 4 1", "17 15 14 11 10 6 5 4 2", "17 15 12 11 9 7 6 5 4 2 1", "17 15 14 13 12 10 9 8 6 5 3 1", "16 11 10 9 8 7 5", "14 13 9 8 6 1", "15 14 13 11 9 8 7 3 2 1", "13 10 9 7 6 4 3 2", "15 14 13 12 11 10 9 8 7 5 4", "14", "17", "6", "9", "13", "16 10 5 3 1", "15 9 7 5 3 1", "8 5 3 1", "14 13 12 11 10 9 8 5 3 1", "17 16 11 9 7 6 5 3 1"]}	UNKNOWN	PYTHON3	CODEFORCES	215
d1b115caf00a7ad2e19bbdbf6e96df46	Book Reading	Recently Luba bought a very interesting book. She knows that it will take t seconds to read the book. Luba wants to finish reading as fast as she can. But she has some work to do in each of n next days. The number of seconds that Luba has to spend working during i-th day is ai. If some free time remains, she can spend it on reading. Help Luba to determine the minimum number of day when she finishes reading. It is guaranteed that the answer doesn't exceed n. Remember that there are 86400 seconds in a day. The first line contains two integers n and t (1<=≤<=n<=≤<=100, 1<=≤<=t<=≤<=106) — the number of days and the time required to read the book. The second line contains n integers ai (0<=≤<=ai<=≤<=86400) — the time Luba has to spend on her work during i-th day. Print the minimum day Luba can finish reading the book. It is guaranteed that answer doesn't exceed n. Sample Input 2 2 86400 86398 2 86400 0 86400 Sample Output 2 1	[ "n, t = map(int, input().split())\ndaftar_waktu_kerja = list(map(int, input().split()))\nhari = 1\n\nfor waktu_kerja in daftar_waktu_kerja:\n waktu_kosong = 86400 - waktu_kerja\n t -= waktu_kosong\n\n if t <= 0:\n print(hari)\n break\n \n hari += 1\n\t \t\t \t\t\t\t\t \t \t \t\t \t", "a=input().split(' ')\nn=int(a[0])\nt=int(a[1])\na=input().split(' ')\na=[int(i) for i in a]\nfor i in range(n):\n if t<=0:\n print(i)\n break\n t=t-(86400-a[i])\nelse:\n print(n)\n \n", "n, t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\ns = 0\r\nfor i in a:\r\n ans += 1\r\n s += 86400 - i\r\n if s >= t:\r\n print(ans)\r\n break\r\n", "n, t = map(int, input().split())\na = list(map(int, input().split()))\ncnt = t\nfor i in range(len(a)):\n cnt -= 86400 - a[i]\n if cnt <= 0:\n print(i + 1)\n exit()\n", "i=lambda:map(int,input().split())\r\n_,d=i();r=0\r\nfor x in i():\r\n r+=1\r\n d-=86400-x\r\n if d<1:break\r\nprint(r)\r\n", "n, t = map(int, input().split())\r\nn = 0\r\ns = list(map(lambda x: 86400 - int(x), input().split()))\r\nfor i, j in enumerate(s):\r\n n += j\r\n if n >= t:\r\n print(i + 1)\r\n exit(0)\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range(len(a)):\r\n k+=86400-a[i]\r\n if k>=t:\r\n print(i+1)\r\n break", "n,t = (int(x) for x in input().split())\r\n\r\nns = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, n+1):\r\n t -= 86400 - ns[i-1]\r\n if t <= 0:\r\n print(i)\r\n break\r\n", "n,t=map(int,input().split())\r\nj=0\r\nfor i in list(map(int,input().split())):\r\n j+=1\r\n t-=86400-i\r\n if t<=0:\r\n print(j)\r\n break\r\n \r\n \r\n", "v_vod = input().split()\r\nn = int(v_vod[0])\r\nt = int(v_vod[1])\r\na = [int(i) for i in input().split()]\r\ni = 0\r\np = 0\r\nwhile t > 0:\r\n p += 1\r\n t = t - (86400 - a[i])\r\n i += 1\r\nprint(p)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in a:\r\n t -= (86400-i)\r\n ans += 1\r\n if t<=0:\r\n break\r\nprint(ans)", "n = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\ncount = 0\nwhile(n[1] > 0):\n\tn[1] -= (86400 - a[count])\n\tcount+=1\nprint(count)\n", "n, t = map(int, input().split())\r\nlst, i = list(map(int, input().split())), 0\r\nwhile t > 0 and i < n: t, i = t - 86400 + lst[i], i + 1\r\nprint(i)", "I = lambda: map(int, input().split())\r\n\r\n_, t = I()\r\ns = 0\r\n\r\nfor i, a in enumerate(I(), 1):\r\n s += 86400-a\r\n if s >= t:\r\n print(i)\r\n break", "n, t = map(int, input().split())\r\nli = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n t -= 86400 - li[i]\r\n if t <= 0:\r\n break\r\nprint(i+1)\r\n\r\n\r\n", "from cmath import \r\nfrom decimal import \r\n\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n\r\ndef solves():\r\n n,m=_input()\r\n lst=_list()\r\n ans=0;\r\n for i in range(n):\r\n lst[i]=86400-lst[i]\r\n m-=lst[i]\r\n if (m<=0):\r\n print(i+1)\r\n exit()\r\n print(-1)\r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n, t = input().split()\r\nlst = list(map(int, input().split()))\r\n\r\ntime = 0\r\nfor item in range(len(lst)):\r\n time += 86400 - lst[item]\r\n if time >= int(t):\r\n print(item + 1)\r\n break\r\n", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nout = 0\r\nfor i in c:\r\n\tb = b - 86400 + i\r\n\tout += 1\r\n\tif(b<=0):\r\n\t\tprint(out)\r\n\t\tbreak", "n,t = tuple(map(int, input().split()))\nday_seconds = 86400\nA = tuple(map(int, input().split()))\n\ndef calc(A):\n free_time = 0\n counter = 0\n\n for a in A:\n free_time += day_seconds - a \n counter += 1\n if free_time >= t:\n return counter\n\nprint(calc(A))\n\n", "days, t=map(int, input().split())\r\na=list(map(int, input().split()))\r\nday=86400;p=0\r\n\r\nfor i in range(days):\r\n\td=day-a[i]\r\n\tif t:\r\n\t\tp+=1\r\n\t\tif d>=t:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tt-=d\r\nprint(p)", "a, b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ni = 0\r\nx = 0\r\nwhile x < b:\r\n\tx += 86400 - s[i]\r\n\ti += 1\r\nprint(i)\r\n\t\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[86400-a[i] for i in range(len(a))]\r\nm=0\r\nfor i in range(len(b)):\r\n\tm+=b[i]\r\n\tif m>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split())\na = map(int, input().split())\nfor index, elem in enumerate(a):\n t -= (86400 - elem)\n if t <= 0:\n print(index + 1)\n break", "n,t=map(int,input().split(' '))\r\nl=input().split(' ')\r\n\r\nj=0\r\ni=0\r\nwhile (t>0):\r\n t=t-(86400-int(l[i]))\r\n i=i+1\r\n j=j+1\r\nprint(j)\r\n\r\n", "a, b = map(int, input().split())\r\nwork = list(map(int, input().split()))\r\ncount = 0 \r\nfor i in range (a) :\r\n\tcount += 86400 - work[i]\r\n\tif count >= b :\r\n\t\tbreak\r\nprint (i + 1)", "n,t = map(int, input().split())\r\nl = input().split()\r\ni=0\r\nwhile t>0:\r\n\tt-=(86400-int(l[i]))\r\n\ti+=1\r\nprint(i)", "n,t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nq = 0\r\nfor i in a:\r\n\ts += 86400 - i\r\n\tq += 1\r\n\tif s >= t:\r\n\t\tprint(q)\r\n\t\tbreak", "# 884A\r\n\r\ndef main():\r\n\tbuff = input().split()\r\n\tn, t = int(buff[0]), int(buff[1])\r\n\tarr = list(map(int, input().split()))\r\n\tday = 0\r\n\twhile t > 0:\r\n\t\tday += 1\r\n\t\tt -= (86400 - arr.pop(0))\r\n\treturn day\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tprint(main())", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nchk = -1\r\nfor i in range(n):\r\n t -= 86400 - data[i]\r\n if t <= 0:\r\n chk = i\r\n break\r\n\r\nprint(chk + 1)", "n,t = map(int,input().strip().split(\" \"))\r\nA_i = [int(n) for n in input().split()]\r\nRemain = 0\r\nremain = 0\r\nconst = 86400\r\ni = 0\r\n\r\nwhile t > 0:\r\n remain = const - A_i[i]\r\n t = t - remain\r\n remain = 0\r\n i += 1\r\n\r\nprint(i)\r\n", "n, t = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nno_days = 0\r\ni = 0\r\nwhile t > 0:\r\n\ta = 86400 - l[i]\r\n\tt-=a\r\n\ti+=1\r\nprint(i)", "n , t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(len(a)):\r\n\tx = 86400 - a[i]\r\n\tt = t - x\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split(\" \"))\r\nwork = list(map(int, input().split(\" \")))\r\nsum = 1\r\nread = 0\r\nfor time in work:\r\n left = 86400 - time\r\n if t - read <= left:\r\n break\r\n else:\r\n sum += 1\r\n read += left\r\nprint(sum)", "\r\nn,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in range(n):\r\n b=b+(86400-a[i])\r\n c=c+1\r\n if b>=t:\r\n break\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\ncnt=0\r\nl = [int(x) for x in input().split()]\r\nfor x in l:\r\n if t>0:\r\n t-=86400-x\r\n cnt+=1\r\n else: break\r\nprint(cnt)", "n,t = [int(i) for i in input().split()]\r\nwork = [int(i) for i in input().split()]\r\nsum = 0\r\nday = 0\r\nwhile sum < t:\r\n day += 1\r\n sum += 86400-work[day-1]\r\nprint(day)\r\n", "(n,t) = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(0,n):\r\n count+=86400-l[i]\r\n if count >= t:\r\n break\r\nprint(i+1)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nfor i in l:\r\n x=x+(86400-i)\r\n y=y+1\r\n if x>=t:\r\n break\r\nprint(y) ", "n, t = map(int, input().split())\nl = list(map(int, input().split()))\nfor i in range(len(l)):\n t -= 86400 - l[i]\n if t <= 0:\n print(i + 1)\n break\n", "n,t = map(int,input().split())\na = list(map(int,input().split()))\ni = 0\nwhile t>0:\n t -= (86400-a[i])\n i+=1\nprint(i)\n", "n, t = input().split(\" \")\r\ni = 0\r\nn, t = int(n), int(t)\r\na = input().split(\" \")\r\nwhile t > 0:\r\n t = t - 86400 + int(a[i])\r\n i = i + 1\r\nprint(i)\r\n", "MAX_DAY = 86400\r\n\r\ndays, needed = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor t in times:\r\n needed -= (MAX_DAY - t)\r\n res += 1\r\n if needed <= 0:\r\n break\r\n \r\nprint(res)", "n, t = [int(i) for i in input().split()]\r\ndias = [int(i) for i in input().split()]\r\nqtd = 0\r\nfor dia in dias:\r\n l = 86400 - dia\r\n t = t - l\r\n qtd = qtd + 1\r\n if t <= 0:\r\n break\r\nprint(qtd)\r\n", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n t -= (86400 - a[i])\r\n if t <= 0:\r\n break\r\nprint(i + 1)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(a)):\r\n ans+=86400-a[i]\r\n if(ans>=t):\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nfor i in range(n):\r\n l[i]=86400-l[i]\r\n t-=l[i]\r\n if t<=0: print(i+1);break\r\n\r\n", "entrada = [int(i) for i in input().split()]\nn, t = entrada[0], entrada[1]\n\nlista = [int(i) for i in input().split()]\n\ncontador = 0\nlisto = False\nfor i in range(n):\n contador += 86400 - lista[i]\n if contador >= t and not listo:\n print(i +1)\n listo = True", "n, t = list(map(int,input().split()))\r\nN = list(map(int,input().split()))\r\ncounter = 0\r\ni = 0\r\nwhile counter < t:\r\n counter += 86400 - N[i]\r\n i += 1\r\nprint(i)\r\n", "n, t = map(int, input().split())\nwork = list(map(int, input().split()))\n\nfound = False\nminday = n\nb = t\n\nfor i in range(n):\n for j in range(i, n):\n b += (work[j] - 86400)\n if b <= 0:\n print(j+1)\n found = True\n break\n b = t\n if found:\n break\nelse:\n print(n)\n", "n, t = map(int, input().split())\na = list(map(int, input().split()))\ni = 0\nwhile i < n:\n t -= 86400 - a[i]\n if t <= 0:\n break\n i += 1\nprint(i + 1)", "n,x=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\ns=0\r\nwhile x>0:\r\n\tx-=86400-a[s]\r\n\ts+=1\r\nprint(s)", "x,y=map(int,input().split());a=list(map(int,input().split()))\r\nfor i in range(x):\r\n\tif y-(86400-a[i])<1:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telse:\r\n\t\ty=y-(86400-a[i])", "s = input().split()\r\nn = int(s[0])\r\nt = int(s[1])\r\ns = input().split()\r\nsumm = 0\r\nk = n\r\nkey = 0\r\nfor i in s :\r\n key+=1\r\n summ += 86400 - int(i)\r\n if summ >= t :\r\n print(key)\r\n quit()\r\n", "n,t = map(int, input().split())\nk = 0\nz = list(map(int, input().split()))\ni = 0\nwhile t > 86400 - z[i]:\n t -= 86400 - z[i]\n i += 1\nprint(i + 1)\n", "l1=[int(i) for i in input().split()]\r\nn=l1[0] #n days of work\r\nt=l1[-1] #t seconds for book reading\r\nl2=[int(j) for j in input().split()]\r\ncount=0\r\ni=0\r\nwhile count<t:\r\n count=count+(86400-l2[i])\r\n i+=1\r\nprint(i)", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = 86400\r\nfor i in range(len(a)):\r\n t -= m - a[i]\r\n if t <= 0:\r\n print(i + 1)\r\n break", "nt = list(map(int,input().split()))\na = list(map(int,input().split()))\n\ncnt_day = 0\nt = nt[1]\nn = nt[0]\nfor i in range(n):\n if a[i] < 86400: \n remain_t = 86400 - a[i]\n if remain_t >= t:\n cnt_day += 1\n break\n else:\n t -= remain_t\n cnt_day+= 1\n\nprint(cnt_day)", "inp = input()\nn,t = inp.split()\nn = int(n)\nt = int(t)\ninp2 = input()\ninp2 = inp2.split()\nfor i in range(n):\n inp2[i] = int(inp2[i])\n\ntime = 86400\nfor i in range(n):\n if t-time+inp2[i]<=0:\n print(i+1)\n break\n t = t - time+inp2[i]\n", "\n\nn, t = list(map(int ,input().split()))\n\nworktimes = list(map(int ,input().split()))\ncnt = 0\nfor i in worktimes:\n t = t-(86400-i)\n cnt += 1\n if t <= 0:\n print(cnt) \n break", "if __name__=='__main__':\n n=list(map(int, input().rstrip().split()))\n x=list(map(int, input().rstrip().split()))\n t=n[1]\n c=0\n for item in x :\n t=t+item-86400\n if t<=0 :\n c+=1\n break\n else:\n c+=1\n\n print(c)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tc+=(86400-a[i])\r\n\tif c>=k:\r\n\t\tbreak\r\nprint(i+1)", "\r\nn, t = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in arr:\r\n if t <= 0:\r\n break\r\n\r\n t -= (86400 - i)\r\n count += 1\r\nprint(count)\r\n", "R=lambda:list(map(int,input().split()))\r\nn, t = R()\r\nlist = R()\r\nfor i in range(n):\r\n\tt -= 86400 - list[i]\r\n\tif (t <= 0):\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n", "X = list(map(int, input().split()))\r\nDays = list(map(int, input().split()))\r\nSum = 0\r\nfor i in range(len(Days)):\r\n Sum += 86400 - Days[i]\r\n if Sum >= X[1]:\r\n print(i + 1)\r\n exit()\r\n", "import sys\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\n\r\nfor i in range(n):\r\n sum+=86400-l[i]\r\n if sum>=t:\r\n print(i+1)\r\n sys.exit()\r\n\r\n ", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n c = 86400 - l[i]\r\n if c == 0:\r\n continue\r\n elif c >= t:\r\n print(i+1)\r\n break\r\n else:\r\n t -= c\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n#n, t = 2, 2\r\n#a = [86400, 86398]\r\n\r\n#n, t = 2, 86400\r\n#a = [0, 86400]\r\n\r\n#n = 100\r\n#t = 10*6\r\n#a = [0]n\r\n\r\nfor i, ai in enumerate(a):\r\n\tt -= (86400 - ai)\r\n\tif t <= 0:\r\n\t\tbreak\r\n\r\nprint(i+1)\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10*9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n t -= 86400-a[i]\r\n if t <= 0:\r\n print(i+1)\r\n exit()", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n t -= 606024 - a[i]\r\n if t <= 0:\r\n print(i+1)\r\n exit()", "a,b=[int(x) for x in input().split()]\r\nc=list(map(int,input().split()))\r\ns=0\r\nfor i in range(a):\r\n s+=86400-c[i]\r\n if(s>=b):\r\n print(i+1)\r\n break", "ONE_DAY_SECONDS = 86400\n\nn_days, t_seconds = map(int, input().split())\nwork_seconds = list(map(int, input().split()))\n\nfor i in range(n_days):\n t_seconds -= ONE_DAY_SECONDS - work_seconds[i]\n if t_seconds <= 0:\n print(i + 1)\n break\n", "n, t = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nans = 1\r\nsums = []\r\n\r\nfor i in a:\r\n sums.append(86400 - i)\r\n \r\nwhile sum(sums[0:ans]) < t:\r\n ans += 1\r\n \r\nprint(ans)", "n,k=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\ns=86400\r\nnd=1\r\nfor i in lst:\r\n d=s-i\r\n k=k-d\r\n if k<=0:\r\n print(nd)\r\n break\r\n nd+=1\r\n", "import itertools\r\n\r\n\r\ndef main():\r\n n,t = [int(v) for v in input().split()]\r\n d = [int(v) for v in input().split()]\r\n s = 0\r\n for i, v in enumerate(d):\r\n s+=86400-v\r\n if s>=t:\r\n print(i+1)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python3\n\nn,t = map(int,input().split())\nA = list(map(int,input().split()))\nd = 0\nwhile t>0:\n t -= 86400-A[d]\n d += 1\nprint(d)\n", "n, t = [int(x) for x in input().split()]\ndias = [int(x) for x in input().split()]\nj = n\nfor i in range(n):\n\tt -= 86400 - dias[i]\n\tif t <= 0:\n\t\tj = i+1\n\t\tbreak\nprint(j)\n\n", "sutki, book = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\ni = 0\r\nwhile (book > 0):\r\n book -= (86400 - d[i])\r\n i+=1\r\nprint(i)\r\n", "str1 = str(input())\r\nstr2 = str(input())\r\n\r\n\r\nt = int(str1.split(' ')[1])\r\n\r\n\r\nlis = [int(i) for i in str2.split(' ')]\r\niter_lis = iter(lis)\r\ncount = 0\r\nday = 0\r\n\r\nwhile count < t:\r\n count += 86400 - iter_lis.__next__()\r\n day += 1\r\n\r\nprint(day)", "[n, t] = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = 0\r\nr = 0\r\nfor x in a:\r\n d += 1\r\n r += 86400 - x\r\n if r >= t:\r\n break\r\nprint(d)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nN=[86400 for i in range(n)]\r\nfor i in range(n): \r\n N[i]=N[i]-l[i]\r\nans=0\r\nfor i in range(n):\r\n t-=N[i]\r\n if t<=0:\r\n print(i+1)\r\n break\r\n", "s=input().rstrip().split(' ')\r\np=input().rstrip().split(' ')\r\nt=int(s[1])\r\nY=0;\r\nf=0;\r\nfor i in range(0,len(p)):\r\n f=f+86400-int(p[i])\r\n Y+=1;\r\n if f>=t:\r\n break;\r\nprint(Y)\r\n", "a,b=map(int,input().strip().split())\r\nlst=list(map(int,input().strip().split()))\r\ncount=0\r\ndiff=0\r\nfor i in range(a):\r\n diff=(86400-lst[i])+diff\r\n count=count+1\r\n if diff>=b:\r\n break \r\nprint(count)", "def main():\n n, t = map(int, input().split())\n for i, x in enumerate(map(int, input().split()), 1):\n t -= 86400 - x\n if t <= 0:\n break\n print(i)\n\n\nif __name__ == '__main__':\n main()\n", "n,t=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\ncompt=0\r\ni=0\r\nc=0\r\nwhile(compt<t):\r\n compt+=86400-l[i]\r\n c+=1\r\n i+=1\r\nprint(c)", "import sys\nimport math\n\nFNAME = \"A\"\n#FNAME = \"distance\"\n###########\n#fin, fout = open(FNAME + \".in\", \"r\"), open(FNAME + \".out\", \"w\")\n#sys.stdin = fin\n#sys.stdout = fout\n###########\n\nn,t = map(int, input().split())\na = list(map(int, input().split()))\n\nfor i in range(n):\n t -= (86400 - a[i])\n if t <= 0:\n print(i+1)\n break\n", "def solve(n, t, a):\n s = 0\n for d, i in enumerate(a):\n s += 86400 - i\n if s >= t:\n return d + 1\n\n\ndef main():\n n, t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, t, a))\n\n\nmain()\n", "n, t = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\nday = 86400\r\nanswer = 0\r\nfree_time = 0\r\nfor el in times:\r\n free_time += day - el\r\n answer += 1\r\n if free_time >= t:\r\n print(answer)\r\n exit(0)\r\nprint(answer)\r\n", "n,t=list(map(int,input().split()))\r\nu=86400\r\ns=list(map(int,input().split()))\r\n\r\np=0\r\nfor i in range(len(s)):\r\n p+=abs(u-s[i])\r\n if p>=t:\r\n print(i+1)\r\n break\r\n", "from itertools import permutations\nm,n=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(m):\n\tsum+=86400-a[i]\n\tif sum>=n:\n\t\tprint(i+1)\n\t\tbreak\n", "n,t=map(int,(input().split()))\r\na=list(map(int,(input().split())))\r\ns=0\r\nfor i in range(n):\r\n\ts+=86400-a[i]\r\n\tif s>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "def main():\n\tn, t = map(int, input().split())\n\ttime = list(map(int,input().split()))\n\t\n\tcnt = 0\n\tfor i in range(0, n):\n\t\ttimeleft = 86400-time[i]\n\t\tt = t - timeleft\n\t\tcnt = cnt + 1\n\t\tif t<=0:\n\t\t\tprint(cnt)\n\t\t\treturn\n\nif __name__ == \"__main__\":\n\tmain()\t\t\t\n", "f=lambda:map(int,input().split())\r\nn,t=f()\r\ns=0\r\nl=[86400-i for i in list(f())]\r\nfor i in range(n):\r\n s+=l[i]\r\n if s>=t:\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=0\r\ncount=0\r\nfor i in a:\r\n d=86400-i\r\n r=r+d\r\n count=count+1\r\n if r>=t:\r\n break\r\nprint(count)\r\n", "TIME_IN_A_DAY = 86400\nn, t = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(len(a)):\n\tif TIME_IN_A_DAY - a[i] >= t:\n\t\tprint(i + 1)\n\t\tbreak\n\tt -= (TIME_IN_A_DAY - a[i])", "R=lambda:map(int, input().split())\r\nn,t=R()\r\nfor i, x in enumerate(R(),1):\r\n t-=86400-x\r\n if t <= 0:\r\n break\r\nprint(i)\r\n", "n,k=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nans,c=0,0\r\ni=0\r\nwhile(1):\r\n if(ans>=k):\r\n break\r\n else:\r\n \r\n ans=ans+(86400-l[i])\r\n i+=1\r\n c+=1 \r\nprint(c) \r\n ", "n, t = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ni = 0\r\nfor day in range(n):\r\n i += 86400 - s[day]\r\n if i >= t:\r\n print(day + 1)\r\n break", "s = input().split()\r\nn, t = int(s[0]), int(s[1])\r\nd = 0\r\nfor ai in input().split():\r\n t -= (86400 - int(ai))\r\n d += 1\r\n if t <= 0:\r\n break\r\nprint(d)\r\n\r\n", "n,t = map(int, input().split())\r\nans=0\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if(l[i] < 86400):\r\n m = 86400 - l[i]\r\n t -= m\r\n ans+=1\r\n if(t<=0):\r\n break\r\nprint(ans)", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ni = -1\r\nwhile k > 0:\r\n i += 1\r\n k -= (86400 - a[i])\r\nprint(i + 1)", "cin = lambda : map(int, input().split())\r\nn, m = cin()\r\na = list(cin())\r\nfor i in range(n):\r\n m -= 86400 - a[i]\r\n if m <= 0:\r\n print(i + 1)\r\n exit()", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n d=86400-i\r\n c+=1\r\n if d>0:\r\n t-=d\r\n if t<=0:\r\n break\r\nprint(c)", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\n\r\nn,t = mi()\r\na = list(mi())\r\ns = 0\r\ni = 0\r\nwhile i<n:\r\n\tt-=(86400-a[i])\r\n\tif t<=0:\r\n\t\tprint (i+1)\r\n\t\tbreak\r\n\ti+=1", "n,t = map(int, input().split())\r\ndays = [int(i) for i in input().split()]\r\nlimit = 0\r\ncount = 0\r\nfor i in days:\r\n if limit>=t :\r\n break\r\n limit+= (86400-i)\r\n count+=1\r\nprint(count)\r\n\r\n", "w1 = list(map(int, input().split()))\r\nn = w1[0]\r\nt = w1[1]\r\nw2 = list(map(int, input().split()))\r\ntime = [86400-i for i in w2]\r\n\r\n\r\ndef least(a, left):\r\n if left > 0:\r\n left -= time[a]\r\n a += 1\r\n return least(a, left)\r\n else:\r\n print(a)\r\n\r\n\r\nleast(0, t)\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n if(s<t):\r\n c=c+1\r\n s=s+(86400-a[i])\r\n else:\r\n break\r\nprint(c)\r\n", "n,x=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\nfor i in range(n):\r\n t=86400-l[i]\r\n x=x-t\r\n if x<=0:\r\n print(i+1)\r\n break\r\n\r\n", "a = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nk = 0\r\ng = 0\r\nfor i in range(len(b)):\r\n k += 86400 - b[i]\r\n g += 1\r\n if k >= a[1]:\r\n print(g)\r\n break", "n,t = map(int, input().split())\r\nc = input().split()\r\nday = 0\r\nd = 0\r\nwhile d < t:\r\n d += 86400 - int(c[day])\r\n day += 1\r\nprint(day)", "a,b = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nx =0\r\nfor i in range(len(z)):\r\n\tx+=(86400-z[i])\r\n\tif x>=b:\r\n\t\tprint(i+1)\r\n\t\tbreak", "seconds_in_day= 86400\r\nn,t=input().split()\r\nn=int(n)\r\nt=int(t)\r\nstring_seconds=input().split()\r\nint_seconds=list(map(int,string_seconds))\r\nsum=0\r\nday=1\r\nfor i in range(n):\r\n sum+=(seconds_in_day-int_seconds[i])\r\n if sum >= t:\r\n break\r\n day+=1\r\nprint(day)", "n, t = [int(elem) for elem in input().split(' ')]\nvals = [86400 - int(elem) for elem in input().split(' ')]\nday = 0\ntotal = 0\nwhile total < t:\n total += vals[day]\n day += 1\nprint(day)\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400-l[i]\r\n i += 1\r\nprint(i)\r\n", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ni = 0\r\n\r\nwhile t > 0:\r\n t -= (86400 - a[i])\r\n i += 1\r\n \r\nprint(i)", "n, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncur = 0 #current\r\nfor i in range(len(a)):\r\n cur += 86400 - a[i]\r\n if cur >= t:\r\n break\r\nprint(i + 1)", "n=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nt=n[1]\r\np=0\r\nfor i in k:\r\n if 86400-i<t: \r\n t=t-(86400-i)\r\n p+=1\r\n else:\r\n p+=1\r\n break\r\nprint(p)\r\n \r\n ", "n , m =input().split()\r\nn ,m =[int(n) ,int(m) ]\r\nwork_time = [int(x) for x in input().split()]\r\nfor i in range(n) :\r\n m -= 86400 -work_time[i]\r\n if m <= 0 :\r\n print(i+1)\r\n break\r\n ", "n, t = map(int, input().split())\nA = list(map(int, input().split()))\ns = 0\nfor i, a in enumerate(A):\n s += 86400-a\n if s >= t:\n print(i+1)\n exit()\n", "n, t = map(int, input().split())\r\na = list(map(int,input().split()))\r\ncnt = 0\r\nwhile t > 0:\r\n\tt -= (86400 - a[cnt])\r\n\tcnt += 1\r\n \r\nprint(cnt)", "def reading(lst, t):\r\n result, count = 0, t\r\n for i in range(len(lst)):\r\n if count == 0:\r\n break\r\n d = min(86400 - lst[i], count)\r\n count -= d\r\n result += 1\r\n return result\r\n\r\n\r\nn, t = [int(i) for i in input().split()]\r\na = [int(j) for j in input().split()]\r\nprint(reading(a, t))\r\n", "s=input().split()\r\nn=int(s[0])\r\nt=int(s[1])\r\ns1=input().split()\r\nfor i in range(1,n+1):\r\n time=int(s1[i-1])\r\n t=t-(86400-time)\r\n if(t>0) and (i==n):\r\n print(n);break\r\n if(t<=0):print(i);break\r\n", "n,t = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\nd = 0\r\nfor i in range(len(a)):\r\n\td += 86400 - a[i]\r\n\tif d >= t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "import math\r\nn,t = [int(x) for x in input().split(' ')]\r\nl = [int(x) for x in input().split(' ')]\r\nz=1\r\nfor x in l:\r\n q=86400-x\r\n if q==0:\r\n z+=1\r\n else:\r\n t-=q\r\n if t<=0:\r\n break\r\n else:\r\n z+=1\r\nprint(z)\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=a[1]\r\nd=0\r\ni=0\r\nwhile c>0:\r\n d+=1\r\n c=c-(86400-b[i])\r\n i+=1\r\nprint(d)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n s+=86400-l[i]\r\n if(s>=t):\r\n c+=1\r\n break\r\n else:\r\n c+=1\r\nprint(c)\r\n", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nc= 0\r\nfor i in range(n):\r\n if t>0:\r\n t-=86400-li[i]\r\n c+=1\r\nprint(c)", "n,m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nans = 0\r\ns = 0\r\ni = 0\r\nwhile m > s:\r\n\ts = s+(86400-a[i])\r\n\ti+=1\r\n\tans+=1\r\nprint(ans)\r\n", "n,t=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nread=0\r\ni=0\r\nwhile read<t:\r\n read=read+(86400-l[i])\r\n i+=1\r\n\r\nprint(i)", "r = lambda: map(int, input().split())\r\n\r\ndef main():\r\n\tn, t = r()\r\n\ta = list(r())\r\n\tfor i, x in enumerate(a):\r\n\t\tt -= 86400 - x\r\n\t\tif t <= 0:\r\n\t\t\tprint(i + 1)\r\n\t\t\treturn\r\nmain()", "a,b=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n\tc+=(86400-m[i])\r\n\tif c>=b:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split())\r\nsecondsSpend = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n tempSeconds = secondsSpend[i]\r\n tempDiff = 86400 - tempSeconds\r\n t = t - tempDiff\r\n ans += 1\r\n if(t <= 0): \r\n break\r\nprint(ans)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\n\r\nfor i in range(n):\r\n l.append(86400-a[i])\r\n if(sum(l)>=t):\r\n print(i+1)\r\n break", "def numberDays(t, days):\n\tfor i in range(len(days)):\n\t\tt -= 86400 - days[i]\n\t\tif t <= 0:\n\t\t\treturn i + 1\n\t\ti += 1\n\nn, t = [int(x) for x in input().split()]\ndays = [int(x) for x in input().split()]\nprint(numberDays(t, days))", "a=int(input().split()[1]);s=0\r\nfor i in map(int,input().split()):\r\n a-=(86400-i);s+=1\r\n if a<=0:print(s);exit()\r\n", "def main():\n [n, t] = [int(_) for _ in input().split()]\n a = [int(_) for _ in input().split()]\n reading = 0\n day = 0\n\n for i in range(n):\n reading += (86400 - a[i])\n\n if reading >= t:\n day = i + 1\n break\n\n print(day)\n\n\nif __name__ == '__main__':\n main()\n", "x,t=map(int,input().split())\r\ns=[int(n) for n in input().split()]\r\np=243600\r\nm=0\r\nfor n in s:\r\n\tj=p-n\r\n\tt-=j\r\n\tm+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(m)", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()][:n]\r\ncount=0\r\ntime=0\r\nflag=0\r\nfor i in range(n):\r\n count+=86400-a[i]\r\n time+=1\r\n if count>=t:\r\n print(time)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(time)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nday = 0\r\nwhile t>0:\r\n t-= 86400-a[day]\r\n day += 1\r\nprint (day)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\np = 0\r\nk = 0\r\nfor i in range(len(a)):\r\n if k < m:\r\n k = k + abs(a[i] - 86400)\r\n p += 1\r\n else:\r\n break\r\nprint(p)", "l=input().split(\" \")\r\nn,t=int(l[0]),int(l[1])\r\nd=list(map(int,input().split(\" \")))\r\nlength=len(d)\r\ndays=0\r\nti=0\r\nfor i in range(length):\r\n\tti+=(86400-d[i])\r\n\tdays+=1\r\n\tif (ti>=t):\r\n\t\tbreak\r\nif(ti>=t):\r\n\tprint (days)\r\nelse:\r\n\tprint(n)", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n\tcount+=1\r\n\tc=86400-i\r\n\ts=s-c\r\n\tif s<=0:\r\n\t\tbreak\r\nprint(count)", "\r\ndef read_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nSECONDS_PER_DAY = 86400\r\n\r\nnum_of_day, time_required = read_int()\r\nworking_seconds = read_int()\r\n\r\ncnt = 1\r\n\r\nfor second in working_seconds:\r\n ret = SECONDS_PER_DAY - second\r\n if ret >= time_required:\r\n break\r\n else:\r\n time_required -= ret\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n,t=map(int,input(\"\").split())\r\na=list(map(int,input(\"\").split()))\r\ncount=0\r\nfor i in range(n):\r\n x=86400-a[i]\r\n t-=x;\r\n count+=1\r\n if(t<=0):\r\n break\r\nprint(count)", "n,t=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\ni=0\r\nwhile t>0:\r\n a=86400-s[i]\r\n t=t-a\r\n i=i+1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nans=0\r\n\r\nwhile t >0 and ans<=n:\r\n ans+=1\r\n\r\n a = 86400-l[i]\r\n t-=a\r\n i += 1\r\nif ans<=n:\r\n print(ans)\r\nelse:\r\n print(n)", "n,t = map(int,input().split())\r\nA = list(map(int,input().split()))\r\na = 86400\r\nfor i in range(n):\r\n rem = a-A[i]\r\n t -= min(t,rem)\r\n if(t==0):\r\n ans = i+1\r\n break\r\nif(t==0):\r\n print(ans)\r\nelse:\r\n ans += t/a\r\n if(t%a):\r\n ans+=1\r\n print(ans)", "n, t = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ncurr_time = 0\r\nday = 0\r\nwhile (curr_time < t) and (day <= n):\r\n day += 1\r\n curr_time += (86400 - a[day - 1])\r\n\r\nprint(day)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile t>0:\r\n t-=(86400-a[i])\r\n i+=1\r\nprint(i)\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n,t=list(map(int, input().split()))\r\nl=list(map(int, input().split()))\r\nnum=0\r\nfor i in l:\r\n num+=1\r\n t-=86400-i\r\n if t<=0:break\r\nprint(num)", "line1 = input().split()\nn = int(line1[0])\nt = int(line1[1])\nline2 = input().split()\nworking = []\nfor i in range(n):\n working.append(int(line2[i]))\n\ndays = 0\nwhile t > 0:\n t = t - (86400 - working[days])\n days += 1\n\nprint(days)\n", "n=list(map(int, input().split(\" \")))\r\nre=n[1]\r\nS=list(map(int, input().split(\" \")))\r\nfor i in range(len(S)):\r\n re=re-(86400-S[i])\r\n if re<=0:\r\n print(i+1)\r\n break\r\n", "[a,b] = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nd = 0\r\nfor i in range(a):\r\n d += 1\r\n s += 86400-l[i]\r\n if s >= b:\r\n break\r\nprint(d)\r\n", "s1 = input()\r\nw = s1.split()\r\nn = int(w[0])\r\nt = int(w[1])\r\ns2 = input()\r\ns2 = s2.split()\r\nx = []\r\nfor i in range(n):\r\n x.append(int(s2[i]))\r\nt0=0\r\nd = 1\r\nfor i in x:\r\n if t0>=t:\r\n break\r\n if i<=86400:\r\n t0+=86400-i\r\n if t0>=t:\r\n break\r\n d+=1\r\nprint(d)", "n,t = map(int,input().split())\r\nwork = list(map(int,input().split()))\r\n\r\ntime = 0\r\nfor i in range (n):\r\n time+= 86400 - work[i]\r\n if(time >= t):\r\n print(i+1)\r\n break", "def main():\r\n\r\n\tday = 86400\r\n\r\n\tn,x = map(int,input().split())\r\n\ta = list(map(int,input().split()))\r\n\r\n\tif n < 1 or n > 100 or x < 1 or x > 1000000 or len(a) != n:\r\n\t\tprint(\"NO\")\r\n\t\treturn\r\n\telse:\r\n\t\tctr = 1\r\n\t\tfor d in a:\r\n\t\t\tx -= max(day-d,0)\r\n\t\t\tif x <= 0:\r\n\t\t\t\tprint(ctr)\r\n\t\t\t\treturn\r\n\t\t\tctr += 1\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nremaining = t\r\nfor i in range(n):\r\n remaining -= (86400 - a[i])\r\n if remaining <= 0:\r\n print(i+1)\r\n break\r\n", "n=input()\r\na,b=n.split()\r\nb=int(b)\r\n\r\nc=input()\r\nc=c.split()\r\n\r\nlist=[]\r\nfor q in c:\r\n q=int(q)\r\n list.append(q)\r\n \r\nsum=0 \r\nans=0 \r\nfor a in range(0,len(list)):\r\n sum+=(86400-list[a])\r\n if sum>=b:\r\n ans=a+1\r\n break\r\n \r\nprint(ans) ", "# https://codeforces.com/problemset/problem/884/A\r\n\r\nn, t = map(int, input().split())\r\n\r\ndays = map(int, input().split())\r\n\r\nans = 1\r\nfor i in days:\r\n if t <= 86400 - i:\r\n print(ans)\r\n break\r\n else:\r\n t -= (86400 - i)\r\n ans += 1", "n,t=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ndiff=[0]n \r\nfor i in range(n):\r\n diff[i]=86400-l[i] \r\ni=0 \r\ncnt=1 \r\ncurr=0\r\nwhile i<n and curr<t:\r\n cnt+=1 \r\n curr+=diff[i] \r\n i+=1 \r\nprint(cnt-1)", "N, Time = [int(x) for x in input().split()]\nT = [int(x) for x in input().split()]\n\nfor i in range(len(T)) :\n Time -= (86400-T[i])\n if (Time <= 0) :\n print(i+1)\n break\n", "n, t = [int(s) for s in input().split(' ')]\r\na = [int(s) for s in input().split(' ')]\r\nr = 0\r\ni = 0\r\nwhile r < t:\r\n r += 86400 - a[i]\r\n i += 1\r\nprint(i)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\n\r\nwhile t > 0:\r\n\tt -= (86400 - a[i])\r\n\ti += 1\r\n\r\nprint(i)", "n, t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile t>0:\r\n t=t-(86400-l[i])\r\n i=i+1\r\nprint(i)", "n,t = map(int,input().split())\nrealt = 0\na = [int(i) for i in input().split()]\na = [86400 - i for i in a]\nfor i in range(len(a)):\n\tt -= a[i]\n\trealt += 1\n\tif t <= 0 :\n\t\tprint(realt)\n\t\tbreak", "n,t=map(int,input().split())\r\nL=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=86400-L[i]\r\n if s>=t:\r\n break\r\nprint(i+1)\r\n", "SECONDS_IN_A_DAY = 86400\r\n\r\nfirst_line = input()\r\nno_of_days, time_required = map(int, first_line.split())\r\nworktimes = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nwhile time_required > 0:\r\n work_time = worktimes[counter]\r\n time_left_day = SECONDS_IN_A_DAY - work_time\r\n time_required -= time_left_day\r\n counter += 1\r\n\r\nprint(counter)\r\n", "#! /usr/bin/python3\n\ns_in = str(input()).split()\nn = int(s_in[0])\nt = int(s_in[1])\ns_in = str(input()).split()\ns = 0\n\nfor i in range(0, n):\n s += ( 86400 - int(s_in[i]) )\n if s >= t:\n print(i+1)\n quit()\n", "n, t = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\nans = 0\r\nwhile(t>0):\r\n t -= 86400-a[ans]\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n+1):\r\n\tif m>0:\r\n\t\tm=m-86400+a[i]\r\n\telse:\r\n\t\tbreak\t\r\nprint(i)", "n, t = map(int, input().split())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nfor i in range(n):\r\n por += 86400 - moo[i]\r\n if por >= t:\r\n print(i+1)\r\n break", "days,bookt=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\nfor x in range(days):\r\n lft=86400-time[x]\r\n \r\n if lft>=bookt:\r\n print(x+1)\r\n break\r\n \r\n bookt-=lft", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nll=[86400-i for i in l]\r\nc=0\r\nfor i in ll:\r\n if t>0:\r\n t-=i\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "a=input()\r\nn=0\r\nwhile a[0]!=' ':\r\n n=10\r\n n+=int(a[0])\r\n a=a[1:]\r\na=a[1:]\r\nt=0\r\nfor i in a:\r\n t=10\r\n t+=int(i)\r\na=input()\r\ndays=[]\r\nfor i in range(n):\r\n b=0\r\n if i!=n-1:\r\n while a[0]!=' ':\r\n b=10\r\n b+=int(a[0])\r\n a=a[1:]\r\n a=a[1:]\r\n else:\r\n for i in a:\r\n b=10\r\n b+=int(i)\r\n days.append(b)\r\ni=0\r\nwhile t>0:\r\n i+=1\r\n if i<=n:\r\n t=t-(86400-days[i-1])\r\n else:\r\n t-=86400\r\nprint(i)\r\n", "#http://codeforces.com/problemset/problem/884/A\ninp = list(map(int, input().split() ))\ndays = inp[0]\nreadBook = inp[1]\ntime = list(map(int, input().split() ))\ntimRem = 0\ncounter = 0\nfor x in range(days):\n\tif(timRem >= readBook):\n\t\tbreak\n\telse:\n\t\ttemp = 86400-time[x]\n\t\ttimRem += temp\n\t\tcounter += 1\nprint(counter)", "\r\n\r\nif __name__ == '__main__':\r\n n, t = list(map(int, input().split()))\r\n one_day = 86400\r\n arr = list(map(int, input().split()))\r\n time_acc = 0\r\n for i in range(len(arr)):\r\n time_acc+=(one_day-arr[i])\r\n if time_acc>=t:\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nfor i in range(n):\r\n if t>(86400-li[i]):\r\n t-=(86400-li[i])\r\n else:\r\n print(i+1)\r\n break\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nprogress = 0\r\nwhile progress < t:\r\n count += 1\r\n progress += 60 60 * 24 - a[count - 1]\r\n\r\nprint(count)\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(lambda x:86400-x,l))\r\nc=0\r\nm=0\r\nfor i in range(n):\r\n c+=k[i]\r\n if c>=t:\r\n m=i+1\r\n break\r\nprint(m)", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\nn, t = map(int, input().split(\" \"))\r\nans = -1\r\nL = [int(x) for x in input().split()]\r\nfor i in range(n) : \r\n t -= 86400 - L[i]\r\n if (ans == -1) and (t <= 0) : ans = i + 1\r\nprint(ans)", "n,t=map(int,input().split())\r\nls=list(map(int,input().split()))\r\ncnt=0\r\nfor i in ls:\r\n cnt += 1\r\n t -= (86400 - i)\r\n if t<=0:\r\n print(cnt)\r\n break\r\n", "n,t=map(int,input().split())\r\n\r\nd=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in d:\r\n if t>0:\r\n t=t-(86400-i)\r\n count+=1\r\n \r\n\r\nprint(count)", "l=list(map(int,input().split()))\nl1=list(map(int,input().split()))\ns=0\nc=0\nfor i in range(int(l[0])):\n s=s+(86400-int(l1[i]))\n c+=1\n if s>=int(l[1]):\n print(c)\n break\n\n \n \n", "days, sec=(input().split())\r\nworkingTime=(input().split())\r\ncount,seconds,remainder=0,0,0\r\nfor i in workingTime:\r\n seconds+=86400-int(i)\r\nif seconds>=int(sec):\r\n for i in workingTime:\r\n remainder+=86400-int(i)\r\n if remainder<int(sec):\r\n count+=1\r\n else:\r\n count+=1\r\n break\r\nprint(count)", "a, b= input().split()\r\nvalues = [int(x) for x in input().split()]\r\na=int(a)\r\nb=int(b)\r\ndni=0\r\nfor i in range (a):\r\n dni+=1\r\n cas=86400-values[i]\r\n b=b-cas\r\n if b <=0:\r\n break\r\nprint(dni)\r\n\r\n\r\n", "n=list(map(int,input().split()))\r\n\r\nt=n[1]\r\n\r\nl=list(map(int,input().split()))\r\n\r\ncount=0\r\ns=0\r\n\r\nfor i in l:\r\n left=86400-i\r\n t=t-left\r\n count+=1\r\n if t<=0:\r\n break\r\nprint(count)", "#Lorenzo\r\n##########################################################################################################\r\n##########################################################################################################\r\nimport math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools #\r\nsys.setrecursionlimit(10 ** 7) #\r\nfrom sys import stdin, stdout #\r\ninput = stdin.readline #\r\ndef MAP(): return map(int, input().split()) #\r\ndef LI(): return list(map(int, sys.stdin.readline().split())) #\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)] #\r\n##########################################################################################################\r\n##########################################################################################################\r\n\r\nn,t=MAP()\r\nsec=LI()\r\nc=1\r\nfor j in range(n):\r\n sec[j]=86400-sec[j]\r\n if(sec[j]>=t):print(c);break\r\n else:c+=1;t-=sec[j]", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n c=c+(86400-l[i])\r\n if c>=t:\r\n print(i+1)\r\n break\r\n \r\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nsecs = 0\r\ndays = 0\r\nfor tm in l:\r\n\tif secs >= t:\r\n\t\tbreak\r\n\tsecs += 86400 - tm\r\n\tdays += 1\r\nprint(days)\r\n", "n, t = map(int, input().split())\r\na = list(map(int ,input().split()))\r\ntime = result = 0\r\nfor i in range(n):\r\n\ttime+=86400-a[i]\r\n\tresult+=1\r\n\tif time>=t:\r\n\t\tbreak\r\nprint(result)", "n, t = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\nfor i in range(n):\r\n t -= (86400 - mas[i])\r\n if t <= 0:\r\n print(i+1)\r\n break", "n, t = map(int,input().split())\r\nA=list(map(int,input().split()))\r\ncur = 1\r\nct = 0\r\nwhile t > 0:\r\n free = 86400 -A[ct]\r\n ct+=1 \r\n if free >= t:\r\n print(cur)\r\n break\r\n else:\r\n t -= free\r\n cur += 1\r\n ", "n,t = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ncur = 0\r\ni=0\r\nwhile (t>cur):\r\n cur +=86400 - s[i]\r\n i+=1\r\nprint(i)\r\n", "n,t = map(int ,input().split())\r\na = list(map(int , input().split()))\r\n\r\ntemp = t\r\nfor i in range(n):\r\n temp = temp - (86400-a[i])\r\n if temp <=0:\r\n break\r\nprint(i+1) \r\n \r\n", "n,t = map(int,input().split()) \r\ndata = list(map(int,input().split()))\r\ns=0\r\nnew=[]\r\nfor i in data:\r\n s+=(86400-i)\r\n new.append(s)\r\nfor i in range(n):\r\n if new[i]>=t:\r\n print(i+1)\r\n break\r\nelse:\r\n print(n)\r\n", "d,t=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\ncounter=0\r\nfor i in time :\r\n rest=86400-i\r\n t-=rest\r\n counter+=1\r\n if t<=0 :\r\n print(counter)\r\n break\r\n", "n,t=map(int,input().split(' '))\r\nl=input().split(' ')\r\nfor i in range(n):\r\n a=int(l[i])\r\n t-=(86400-a)\r\n if t<=0:\r\n break\r\nprint(i+1)\r\n ", "n,t=map(int,input().split())\r\nsec=list(map(int,input().split()))\r\nc=1\r\nfor j in range(n):\r\n sec[j]=86400-sec[j]\r\n if(sec[j]>=t):print(c);break\r\n else:c+=1;t-=sec[j]", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntime=0\r\nans=0\r\nfor i in range(0,len(a)):\r\n if ans>=t:\r\n break\r\n else:\r\n ans=ans+(86400-a[i])\r\n time=time+1\r\nprint(time)", "days,time=map(int,input().split())\r\nwork=list(map(int,input().split()))\r\ncount=0\r\nday=86400\r\nfor i in range(days):\r\n free=0\r\n free=day-work[i]\r\n time-=free\r\n if time <= 0:\r\n count+=1\r\n break\r\n else:\r\n count+=1\r\nprint(count)", "n,t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nnew_a = []\r\nfor i in a:\r\n new_a.append(86400-i)\r\ni = 1\r\nx = new_a[0]\r\nwhile x<t:\r\n x+=new_a[i]\r\n i+=1\r\nprint(i)\r\n\r\n", "# -- coding: utf-8 --\n\ndef f(t, arr):\n\n mtime = 86400\n \n r = 1\n for x in arr:\n t -= mtime - x\n if t <= 0:\n break\n r += 1\n\n print(r)\n\n\nif __name__ == '__main__':\n \n n, t = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n\n # for i in range(n):\n # list(map(int, input().split()))\n\n f(t, arr)", "n, t = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\ni = 0\r\nsum1 = 0\r\nwhile sum1 < t and i < len(num):\r\n sum1 += (86400 - num[i])\r\n i += 1\r\nprint(i) ", "d,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=list(map(lambda x:(246060)-x,l))\r\nfor i in range(len(l)):\r\n\tt-=l[i]\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t = tuple(map(int,input().split()))\na = [int(x) for x in input().split()]\nc,k = 0,0\nfor i in a:\n\tc += 86400 - i\n\tk+=1\n\tif c>=t:\n\t\tbreak\nprint(k)", "n,t=map(int,input().split())\r\na=[int(c) for c in input().split()]\r\nfor i in range(n):\r\n t-=86400-int(a[i])\r\n if t<=0:\r\n break\r\nprint(i+1)\r\n\r\n \r\n\r\n", "g = list(map(int ,input().strip().split()))\r\nn=int(g[0])\r\nm=int(g[-1])\r\nl = list(map(int ,input().strip().split()))\r\nc = 0\r\nday = 0\r\n\r\nfor i in range(n):\r\n c += 86400 - l[i]\r\n day += 1\r\n if c >= m:\r\n print(day)\r\n break ", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n\tc+=1\r\n\tt-=86400-i\r\n\tif t<=0:\r\n\t\tprint(c)\r\n\t\tbreak ", "n,t = map(int, input().split())\r\nd=0\r\nl = list(map(int, input().split()))\r\nfor el in l:\r\n if t<=0: break\r\n t-=(86400-el)\r\n d+=1\r\nprint(d)", "N,T=map(int,input().split(\" \"))\r\nL=list(map(int,(input().split(\" \"))))\r\nS=86400\r\nS1=0\r\nfor i in range(0,N):\r\n W=S-L[i]\r\n if(W>=T):\r\n T=T-W\r\n S1=S1+1\r\n break\r\n else:\r\n S1=S1+1\r\n T=T-W\r\nprint(S1)\r\n", "n,t=[int(i) for i in input().split(\" \")]\r\nA=[int(i) for i in input().split(\" \")]\r\n\r\ni=0\r\nwhile t>0 and i<n:\r\n t-=(86400-A[i])\r\n i+=1\r\nprint(i)\r\n", "import sys\r\n\r\nn, t = map(int, input().split())\r\na = [86400 - x for x in map(int, input().split())]\r\nfor i, x in enumerate(a, start=1):\r\n t -= x\r\n if t <= 0:\r\n print(i)\r\n break\r\n", "n, time = map(int, input().split())\r\ntimes = map(int, input().split())\r\nday = 0\r\nfor t in times:\r\n work_time = t\r\n if time > 0:\r\n day += 1\r\n left_out_time = 86400 - work_time\r\n time -= left_out_time\r\n \r\nprint(day)", "# LUOGU_RID: 101736508\nn, t, a = map(int, open(0).read().split())\r\nfor i, x in enumerate(a):\r\n t -= 86400 - x\r\n if t <= 0:\r\n exit(print(i + 1))", "n,t=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n x+=86400-m[i]\r\n if x>=t:\r\n print(i+1)\r\n break", "class Solver:\r\n def run(self):\r\n n, t = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n k = 0\r\n for i in range(n):\r\n k += 86400 - a[i]\r\n if k >= t:\r\n print(i + 1)\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n Solver().run()\r\n", "def find_min_num_of_days(time_to_read, work_times):\r\n curr = days = 0\r\n for time in work_times:\r\n curr += 86400 - time\r\n days += 1\r\n if curr >= time_to_read:\r\n break\r\n return days\r\n\r\n\r\nn, t = map(int, input().split())\r\n\r\nprint(find_min_num_of_days(t, list(map(int, input().split()))))\r\n", "R=lambda:list(map(int,input().split()))\r\nn,t=R()\r\na=R()\r\nfor i in range(n):\r\n t-=86400-a[i]\r\n if t<1:\r\n print(i+1)\r\n exit(0)\r\n", "n,t=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n\tt=t-86400+a[i]\r\n\tif t<=0:\r\n\t\tb=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\tpass\r\nprint(b)\r\n", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\ni = 0\r\n\r\nwhile i < n:\r\n ans += 86400 - a[i]\r\n if ans >= t:\r\n print(i+1)\r\n exit()\r\n i += 1\r\n", "n, t = map(int, input().split())\r\na = [i for i in map(int, input().split())]\r\ncount = 0\r\nwhile t>0:\r\n t -=(86400 - a[count])\r\n count += 1\r\nprint(count)\r\n", "n,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ntot = 86400\r\ncount = 0\r\nday = 0\r\nfor i in range(len(l)):\r\n count+=tot-l[i]\r\n day+=1\r\n if(count>=t):\r\n print(day)\r\n break\r\nelse:\r\n print(day)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile t>0:\r\n a=86400-l[i]\r\n t=t-a \r\n i=i+1\r\nprint(i)", "import math\r\nx,y=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in range(x):\r\n k=86400-p[i]\r\n if k>=y:\r\n print(i+1)\r\n exit()\r\n else:y-=k", "l = input()\r\nl = l.split()\r\nn = int(l[0])\r\nm = int(l[1])\r\n\r\np = list(map(int, input().split()))\r\n\r\nsec = 86400\r\nday = 0\r\nc = 0\r\nfor i in range(n):\r\n c += sec - int(p[i])\r\n day += 1\r\n if(c >= m):\r\n print(day)\r\n break\r\n", "R=lambda:list(map(int,input().split()))\nn,t=R()\na=R()\nfor i in range(n):\n t-=86400-a[i]\n if t<1:\n print(i+1)\n exit(0)\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nx, i = 0, 0\r\nwhile x < t:\r\n\tx = x + 86400 - l[i]\r\n\ti += 1\r\n\t\r\nprint(i)", "n, t = list(map(int, (input().split())))\r\na = list(map(int, (input().split())))\r\nfor _ in range(n):\r\n t = t+a[_]-86400\r\n if t <= 0:\r\n print(_ + 1)\r\n break", "n, t = map(int, input().split())\ntimePerDay = list(map(int, input().split()))\n\nres = 0\n\nfor i in range(n):\n if (86400 +res) - timePerDay[i] >= t:\n print(i+1)\n break\n else:\n res += 86400 - timePerDay[i]\n\n", "n, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\n\r\ndays = 0\r\nfor i in input().split():\r\n free_time = 86400 - int(i)\r\n days += 1\r\n t -= free_time\r\n if t <= 0:\r\n break\r\n\r\nprint(days)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Dec 8 16:16:49 2022\r\n\r\n@author: Rami\r\n\"\"\"\r\nSECONDS = 86400\r\ndays=0\r\nn,t = input().split()\r\nn = int(n)\r\nt = int(t)\r\ntemp=0\r\narr = input().split()\r\nfor i in range(n):\r\n arr[i] = int(arr[i])\r\n temp += SECONDS - arr[i]\r\n days += 1\r\n \r\n if(temp>=t ):\r\n print(days)\r\n break;\r\n \r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,t=read_ints()\r\n\ta=[86400-x for x in read_ints()]\r\n\tfor i in range(n):\r\n\t\tt-=a[i]\r\n\t\tif t<=0:\r\n\t\t\tprint(i+1)\r\n\t\t\treturn\r\n\r\nsolve()\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\ntotal=0\r\nfor i in range(n):\r\n total+=86400-a[i]\r\n ans+=1\r\n if total>=t:\r\n break\r\nprint(ans)", "days, t = input().split()\r\ndays, t = int(days), int(t)\r\n\r\na = list(map(int, input().split()))\r\nc = 0\r\n\r\nwhile t > 0:\r\n t -= 86400 - a[c]\r\n c += 1\r\n\r\nprint(c)\r\n", "# your code goes here\r\nn,t = input().split()\r\nn = int(n)\r\nt = int(t)\r\na = list(map(int,input().split()))\r\ncount = 0\r\nsum=0\r\nfor i in a:\r\n\tsum=86400-i\r\n\tt-=sum\r\n\tcount+=1\r\n\tif(t<=0):\r\n\t\tprint(count)\r\n\t\tbreak", "n, t = map(int,input().split())\r\nwork = list(map(int, input().split()))\r\nday = 0\r\nfor i in range(len(work)):\r\n diff = 86400 - work[i]\r\n t -= diff\r\n day += 1\r\n if t <= 0:\r\n break\r\nprint(day)", "n,t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ndays = 0\r\ntime = 0\r\nfor i in l:\r\n days += 1\r\n time += 86400 - i\r\n if time >= t:\r\n break\r\nprint(days)", "n=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nt = n[1]\r\nj=0\r\nfor i in range(n[0]):\r\n s=86400-f[i]\r\n if t>0:\r\n t=t-s\r\n j=j+1\r\nprint(j)\r\n", "n, t = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nres = 0\r\nleft = t\r\n\r\nfor item in nums:\r\n left -= (86400) - item\r\n res += 1\r\n if(left <= 0):break\r\n\r\nprint(res)\r\n", "n,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nk=0\r\nval=0\r\nfor i in arr:\r\n diff = 86400-i\r\n val = val+diff\r\n k+=1\r\n if(val >= t):\r\n print(k)\r\n break\r\n else:\r\n continue\r\n", "input1 = input()\r\nn, m = map(int, input1.split(' '))\r\n\r\ninput2 = input()\r\ninput2 = [int(i) for i in input2.split(' ')]\r\n\r\ntime_reading = 0\r\ni = 0\r\nwhile (time_reading < m) and ((i+1) <= n):\r\n \r\n time_reading += ((246060) - input2[i])\r\n i += 1\r\n\r\nprint(i)\r\n ", "n=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nc=0\r\ni=0\r\nt=0\r\nwhile t<n[1]:\r\n t+=86400-a[i]\r\n c+=1\r\n i+=1\r\nprint(c)", "n , t = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\ns = 0\r\n\r\nfor i in range(n):\r\n\r\n s += 86400 - l[i]\r\n\r\n if s >= t :\r\n print(i + 1 )\r\n break\r\n", "n, t = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres = 0\nwhile t > 0:\n t -= 86400 - next(a)\n res += 1\nprint(res)\n", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nc = 0\r\nwhile t > 0:\r\n t -= 86400-a[c]\r\n c += 1\r\nprint(c)", "\r\n# first enter the n no of days and time to read\r\ninp = list(map(int , input().split()))\r\n\r\n# n\r\nn = inp[0]\r\n\r\n# time\r\nt = inp[1]\r\n\r\ntime = list(map(int , input().split()))\r\n\r\ncount = 0\r\nsum = 0\r\n\r\nfor x in range(n):\r\n if sum >= t:\r\n break\r\n\r\n else:\r\n sum += 86400 - time[x]\r\n count +=1\r\n\r\n\r\nprint(count)\r\n\r\n", "n,t=map(int,input().split());count=0;p=86400\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n count+=1\r\n if i < p:\r\n z=p-i\r\n if z == t or t-z < 0:break\r\n else:\r\n t=t-z\r\nprint(count) ", "'''input\n2 86400\n0 86400\n'''\nn, t = map(int, input().split())\na = list(map(int, input().split()))\ni = 0\nwhile t > 0:\n\tt -= 86400 - a[i]\n\ti += 1\nprint(i)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n\ttime=86400-i\r\n\tt=t-time\r\n\tcount+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(count)", "n, t = list(map(int,input().split()))\nm = list(map(int,input().split()))\nf = 0\nc = 0\nfor i in range(n):\n if m[i] < 86400:\n d = 86400\n d = d - m[i]\n f = f + d\n c += 1\n if f >= t:\n print(c)\n break\n else: \n c += 1\n if f >= t:\n print(c)\n break\n\n", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nk=0\r\ns=86400-a[0]\r\nwhile s<t:\r\n k+=1\r\n s+=86400-a[k]\r\nprint(k+1)\r\n", "_, t = map(int, input().split())\r\n\r\nresult = 0\r\nfor index, value in enumerate(map(int, input().split())):\r\n t -= (86400 - value)\r\n if t <= 0:\r\n result = index + 1\r\n break\r\n\r\nprint(result)\r\n", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn,k=invr()\r\nara=inara()\r\n\r\ni=0\r\nwhile k>0:\r\n\tk-=(86400-ara[i])\r\n\ti+=1\r\n\r\nprint(i)\r\n", "n, t = map(int, input().split())\r\nt_spend = input().split()\r\nfor i in range(n):\r\n if 86400 - int(t_spend[i]) != 0:\r\n t -= 86400 - int(t_spend[i])\r\n \r\n \r\n if t <= 0:\r\n break \r\nprint(i+1)\r\n ", "def solution(l1,l2):\r\n i=0\r\n timer=l1[1]\r\n while i<len(l2):\r\n timey=86400\r\n if timey-l2[i]>=timer:\r\n return i+1\r\n timer=max(0,timer-(timey-l2[i]))\r\n \r\n i+=1\r\n \r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "x=input().split()\r\ny=input().split()\r\n\r\na=int(x[0])\r\nb=int(x[1])\r\nc=0\r\nfor i in y:\r\n i=int(i)\r\n b=b-(86400-i)\r\n c=c+1\r\n if b<=0:\r\n print(c)\r\n break\r\n\r\n", "n, t = map(int,input().split())\na = list(map(int, input().split()))\nm = t\ni = 0\nwhile m > 0:\n m -= 86400\n m += a[i]\n i += 1\nprint(i)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tk=86400-l[i]\r\n\tc+=k\r\n\tif t<=c:\r\n\t\tprint(i+1)\r\n\t\tbreak", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nans = 0\r\nfor i in a:\r\n s += 86400 - i\r\n ans += 1\r\n if s >= t:\r\n break\r\nprint(ans)", "n,t=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\no=0\r\nfor i in range(len(s)):\r\n\to+=86400-s[i]\r\n\tif o>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t = map(int,input().split())\r\nd = [((86400-int(x)) for x in input().split())]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += d[i]\r\n i += 1\r\nprint(i)", "n,t = map(int,input().split())\r\ncur = 0\r\npf = list(map(int,input().split()))\r\nans = n\r\nfor i in range(n):\r\n a = pf[i]\r\n cur = cur + 86400 - a\r\n if cur >= t:\r\n ans=i+1\r\n break\r\nprint(ans)", "\r\nRead = lambda:map(int, input().split())\r\nfrom functools import reduce\r\n\r\nif __name__ == '__main__':\r\n while True:\r\n try:\r\n n, t = Read()\r\n except:\r\n break\r\n L = list(86400 - x for x in Read())\r\n ans, sum = 0, 0\r\n for x in L:\r\n sum += x\r\n ans += 1\r\n if sum >= t:\r\n print(ans)\r\n break\r\n", "n,t=map(int,input().split())\nls=list(map(int,input().split()))\ni=0\nsum1=0\nwhile(i<n):\n\tsum1+=(86400-ls[i])\n\tif(sum1>=t):\n\t\tprint(i+1)\n\t\texit()\n\ti+=1", "nod, needed = [int(x) for x in input().split()]\r\nworktime = [int(x) for x in input().split()]\r\ndays = 0\r\nfor i in range(nod):\r\n needed -= (86400 - worktime[i])\r\n days += 1\r\n if needed <= 0:break\r\nprint(days) ", "n, t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nc, s = 0, 0\r\nfor i in range(n):\r\n s += (86400 - w[i])\r\n c += 1\r\n if t <= s:\r\n print(c)\r\n break", "a,b=input().split(\" \")\r\nc=input()\r\nc=c.split(\" \")\r\nx=0\r\nz=0\r\nb=int(b)\r\nwhile b>0:\r\n z+=1\r\n b-=(86400-int(c[x]))\r\n x+=1\r\nprint(z)\r\n \r\n", "day = 86400\r\nn , t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nneed = 0\r\nfor i in a:\r\n\tt -= (day - i)\r\n\tneed += 1\r\n\tif t <= 0 :\r\n\t\tbreak\r\nif t > 0:\r\n\tneed += (t // day) + (t % day != 0)\r\nprint(need)", "func = lambda x: int(x)\r\n\r\nl1 = list(map(func, input().split()))\r\nn = l1[0]\r\nt = l1[1]\r\n\r\nl2 = list(map(func, input().split()))\r\n\r\naccumulator = 0\r\nfor i in range(n):\r\n time = 86400 - l2[i]\r\n accumulator = accumulator + time\r\n if accumulator >= t:\r\n print(i + 1)\r\n break\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,c,s=0,0,86400 \r\nfor i in l : \r\n x+=s-i;\r\n c+=1\r\n if x>=t:\r\n break;\r\nprint (c) ", "# -- coding: utf-8 --\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/8 08:35\r\n\r\n\"\"\"\r\n\r\nN, T = map(int, input().split())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\n\r\nfor i in range(N):\r\n T -= 86400 - A[i]\r\n if T <= 0:\r\n print(i+1)\r\n exit(0)\r\n\r\nprint(N)", "n , m = map(int , input().split())\r\nl = list(map(int , input().split()))\r\ncounter = 0 \r\nref = 86400 \r\nfor i in l : \r\n x= ref - i \r\n rest = m - x \r\n m = rest\r\n if rest > 0 : \r\n counter +=1\r\n else :\r\n counter+=1\r\n break\r\nprint(counter) \r\n", "def main():\n MAX = 86400\n n, t = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 1\n for x in a:\n t -= (MAX - x)\n if t <= 0:\n print(ans)\n return\n ans += 1\n\nmain()\n", "n, t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ncount = 0\r\n\r\nwhile t > 0:\r\n t -= (86400 - w[count])\r\n count += 1\r\n \r\nprint(count)", "n,x=map(int, input().split())\na=[int(x) for x in input().split()]\nans=0\nwhile x>0:\n\tx-=86400-a[ans]\n\tans+=1\nprint(ans)", "import sys\nn,t=map(int,input().split())\na = [map(int,input().split())]\nans=0\nfor i in range(n):\n ans+=86400-a[i]\n if ans>=t:\n print(i+1)\n break", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsf = 0\r\nfor i, x in enumerate(a):\r\n sf += (86400 - x)\r\n if sf >= t:\r\n print(i+1)\r\n break", "(n, t) = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nsecondInDay = 24 60 * 60\r\n\r\nresult = 0\r\nwhile t > 0:\r\n t -= secondInDay - a[result]\r\n result += 1\r\nprint(result)", "n, t = [int(z) for z in input().split()]\r\na = [86400 - int(z) for z in input().split()]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += a[i]\r\n i += 1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\na=lambda:map(int,input().split())\r\nl=list(a())\r\ncount = 0\r\nfor i in range(n):\r\n if (t-(86400-l[i])>0):\r\n t = t-(86400-l[i])\r\n count += 1\r\n else:\r\n count += 1\r\n break\r\nprint (count) ", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\ndays=0\r\nfor i in range(0,n):\r\n x=86400-a[i]\r\n sum+=x\r\n days+=1\r\n if sum>=t:\r\n print(days)\r\n break\r\n \r\n ", "num_of_days, time_reading = input().split(' ')\r\ntimes = input().split(' ')\r\nn = 0\r\ns = int(time_reading)\r\nfor i in range(len(times)):\r\n if int(times[i]) + int(s) <= 86400:\r\n print(i + 1)\r\n n += 1\r\n break\r\n elif 86400 - int(times[i]) > 0:\r\n s -= 86400 - int(times[i])\r\n else:\r\n continue\r\n \r\n \r\nif n == 0:\r\n print(0)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile t>0:\r\n t-=86400-a[i]\r\n i+=1\r\nprint(i)", "import math\nn, t = map(int, input().split())\narr = list(map(int, input().split()))\n\ndef summArr(arr):\n\tans = 0\n\tfor i in arr:\n\t\tans += i\n\treturn ans\n\ndef main():\n\tcount_seconds = 86400\n\tans = 0\n\tsub = t\n\tfor i in arr:\n\t\ttmp = count_seconds - i\n\t\tsub -= tmp\n\t\tif sub <= 0:\n\t\t\tans += 1\n\t\t\tbreak\n\t\tans += 1\n\tprint(ans)\nif __name__ == \"__main__\":\n\tmain()", "n,t = map(int, input().split())\r\na = input()\r\na = list(map(int, a.split()))\r\ni = 0\r\nkol = 0\r\nwhile (t > 0) and (i < n):\r\n t -= (86400 - a[i])\r\n kol += 1\r\n i += 1\r\nprint(kol) \r\n", "#b\nn, t = map(int, input().split())\ndaftar = list(map(int, input().split()))\nhari = 1\n\nfor waktu in daftar:\n kosong = 86400 - waktu\n t -= kosong\n\n if t <= 0:\n print(hari)\n break\n \n hari += 1\n\t \t \t \t \t\t\t \t \t\t \t \t\t", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\ndy = 86400\r\n\r\nbesDay = 0\r\n\r\nfor i in range(len(a)):\r\n x = dy-a[i]\r\n\r\n t -= x\r\n\r\n \r\n\r\n if t <= 0:\r\n besDay = i+1\r\n break\r\n\r\nprint(besDay)\r\n", "n, t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nfor i,c in enumerate(arr):\r\n t -= (86400-c)\r\n if t<=0:\r\n print(i+1)\r\n break", "\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += 86400 - a[i]\r\n if s >= t:\r\n print(i + 1)\r\n break\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# گرسنمه :\|", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n ans+=1\r\n t-=(86400-i)\r\n if t<=0:\r\n break\r\nprint(ans)", "n,t=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nj=0\r\nfor i in range(n):\r\n if t>0:\r\n j=j+1\r\n t=t+l[i]-86400\r\n else:\r\n break\r\nprint(j)", "n,x=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\nans=0\r\nwhile x>0:\r\n\tx-=86400-a[ans]\r\n\tans+=1\r\nprint(ans)", "x1=input()\r\nx=x1.split()\r\ny1=input()\r\ny=y1.split()\r\nsum=0\r\ni=0\r\nwhile(sum<int(x[1])):\r\n\tsum+=(86400-int(y[i]))\r\n\ti+=1\r\nprint(i)\r\n", "n, t = map(int,input().split())\r\ntmp = input()\r\njumlah = 0\r\nans = 0\r\nfor i in map(int,tmp.split()):\r\n\tx = 86400 - i\r\n\tjumlah += x\r\n\tans += 1\r\n\tif (jumlah >= t):\r\n\t\tprint(ans)\r\n\t\tbreak", "n,t=map(int,input().split())\r\nlst=[int(x) for x in input().split()]\r\ncount,test=0,0\r\nfor i in lst:\r\n test+=86400-i\r\n count+=1\r\n if test>=t:\r\n print(count)\r\n break", "n, t = map(int, input().split())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nblu = 0\r\nfor i in range(n):\r\n if blu < t:\r\n por += 1\r\n blu += 86400 - moo[i]\r\n else:\r\n break\r\nprint(por)", "n, t = list(map(int, input().split()))\r\nworktime = list(map(int, input().split()))\r\nfreetime = []\r\nfor i in range (n):\r\n freetime.append(86400 - worktime[i])\r\nsumread = 0\r\ncounter = 0\r\nfor i in range (n):\r\n if (sumread < t):\r\n counter += 1\r\n sumread += freetime[i]\r\nprint (counter)\r\n", "import sys\r\nn, t = map(int, input().split(\" \"))\r\n\r\nday = list( map(int, input().split(\" \")) )\r\n\r\nfor i in range(n):\r\n t -= ( 86400 - day[i] )\r\n if t <= 0:\r\n print(i+1)\r\n sys.exit()", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=86400-l[i]\r\n if(s>=k):\r\n print(i+1)\r\n break", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nsecond = 86400\r\ndays = 0\r\nfor i in range(n):\r\n rest = second - li[i]\r\n t = t - rest\r\n days= days +1\r\n if t<=0:\r\n break\r\n\r\nprint(days)\r\n", "n, t = map(int, input().split())\r\nn = list(map(int, input().split()))\r\nk = 0\r\nwhile t>0:\r\n k+=1\r\n t = t-(246060)+ n[k-1]\r\nprint(k)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 2 12:43:08 2017\r\n\r\n@author: BAB\r\n\"\"\"\r\nn, t = list(map(int,input().split(' ')))\r\ntaba = list(map(int,input().split(' ')))\r\ntimeleft = t\r\nday = 0\r\nwhile timeleft > 0:\r\n timeleft -= (86400 - taba[day])\r\n day += 1\r\n \r\nprint(day)", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, t] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += 86400-a[i]\r\n if s >= t:\r\n print(i+1)\r\n exit(0)", "n, t = map(int, input().split())\nv = map(lambda x: 86400 - int(x), input().split())\nfor i, x in enumerate(v, 1):\n t -= x\n if t <= 0:\n break\nprint(i)\n", "[n, t] = [int(i) for i in input().split(\" \")]\r\nwork = [int(i) for i in input().split(\" \")]\r\n\r\nday = 0\r\nfor i in range(n):\r\n time_left = 86400 - work[i]\r\n t -= time_left\r\n day += 1\r\n if t <= 0:\r\n break\r\nprint(day)\r\n", "n , t = map (int , input().split())\r\na = list(map(int , input().split()))\r\ndays = 0;\r\nfor i in range (n):\r\n time = 86400 - a[i]\r\n t -= time\r\n days+=1\r\n if t <= 0:\r\n print (days)\r\n break\r\n", "[n, t] = [int(x) for x in input().split()]\r\nL = [int(x) for x in input().split()]; i = 0\r\nwhile t > 0: t -= (86400-L[i]); i+=1\r\nprint(i)\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nDAILY_SECONDS = 86400\r\nres = 0\r\nfor i in a:\r\n res += 1\r\n remaining = DAILY_SECONDS - i\r\n if remaining >= t:\r\n break\r\n t -= remaining\r\nprint(res)", "n,t = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n t = t - (86400 - l[i])\r\n if t <= 0:\r\n print(i+1)\r\n break\r\n \r\n", "n,t = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400-x[i]\r\n i+=1\r\nprint(i)", "# 884a\n\nn, t = map(int, input().split())\na = list(map(int, input().split()))\n\ndays = 0\ni = 0\n\nwhile i < len(a) and t > 0:\n t -= 86400 - a[i]\n days += 1\n i += 1\n\nprint(days)\n", "#n = int(input())\r\nn, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nl = 0\r\nwhile m > 0:\r\n m -= (86400 - c[l])\r\n l += 1\r\nprint(l)", "n=input()\r\nt=input()\r\ntest=n.split(\" \")\r\na=t.split(\" \")\r\ntime=int(test[1])\r\ncount=1\r\nfor k in a:\r\n num=int(k)\r\n time=time-(86400-num)\r\n if time <= 0:\r\n print(count)\r\n break\r\n count=count+1\r\n", "fullday = 86400\r\nn, t = list(map(int, input().split()))\r\ndays = list(map(int, input().split()))\r\ntotal = 0\r\nfor day in range(n):\r\n total += fullday-days[day]\r\n if total >= t:\r\n print(day+1)\r\n break\r\n", "t,n=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n temp=86400-i\r\n if n==0:\r\n break\r\n else:\r\n n-=temp\r\n c+=1\r\n if n<=0:\r\n n=0\r\n else:\r\n continue\r\nprint(c)", "a,b = map(int,input().split())\r\nl = 0\r\ns = list(map(int,input().split()))\r\nfor i in range(a):\r\n\tl = l + 86400 - s[i]\r\n\tif l >= b:\r\n\t\tbreak\r\nprint(i+1)", "(n, t) = map(lambda x: int(x) , str(input()).split(' '))\r\na = list(map(lambda x: int(x) , str(input()).split(' ')))\r\n\r\nday = 0\r\nwhile t > 0:\r\n t -= 86400 - a[day]\r\n day += 1\r\n\r\nprint(day)", "d=(input().split(' '))\r\nn=int(d[0])\r\nsayfa=int(d[1])\r\ni=0\r\nd=list(map(lambda x:int(x),input().split(' ')))\r\nwhile sayfa > 0:\r\n sayfa=sayfa-(86400-d[i])\r\n i+=1\r\nprint(i)", "from math import ceil\r\ns=0\r\nd=0\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\td+=1\r\n\ts+=(86400-l[i])\r\n\tif s>=t:\r\n\t\tprint(d)\r\n\t\tbreak\r\n", "a1 = input().split()\r\na = [int(a1[i]) for i in range(len(a1))]\r\nb1 = input().split()\r\nb = [86400 - int(b1[i]) for i in range(len(b1))]\r\ns = 0\r\nfor i in range(a[0]):\r\n s += b[i]\r\n if s >= a[1]:\r\n print(i + 1)\r\n break", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n c=c+1\r\n x=86400-l[i]+x\r\n if(x>=k):\r\n print(c)\r\n break\r\n", "p = input().split(' ')\r\nn = int(p[0])\r\nt = int(p[1])\r\ndays = 0\r\n\r\ns = input().split(' ')\r\nfor i in range(n):\r\n \r\n if int(s[i]) == 86400:\r\n days += 1\r\n else:\r\n t -= 86400 - int(s[i])\r\n if t <= 0:\r\n days += 1\r\n break\r\n else:\r\n days += 1\r\n\r\nprint(days)\r\n\r\n", "R=lambda:list(map(int,input().split()))\nn,t=R()\na=R()\nfor i in range(n):\n t-=(86400-int(a[i]))\n if t<=0:print(i+1);break\n", "from math import ceil\r\n\r\nn, t = map(int, input().split())\r\ntrabalho = list(map(int, input().split()))\r\ndia = 86400\r\n\r\nd = 0\r\nfor d in range(n):\r\n t -= (dia-trabalho[d])\r\n d += 1\r\n if t <= 0:\r\n break\r\n\r\nif t > 0:\r\n d += ceil(t/dia)\r\n\r\nprint(d)\r\n", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nsumsec = 0\r\ncount = 0\r\nfor i in li:\r\n if(sumsec >= t):\r\n break\r\n sumsec+=86400-i\r\n count+=1\r\nprint(count)\r\n \r\n", "n, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\ntemp = 86400\r\nfor i in range(len(a)):\r\n a[i] -= temp\r\n t += a[i]\r\n ans += 1\r\n if (t <= 0):\r\n break\r\nprint(ans)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\nc = 86400\n\ns = 0\ni = 0\nwhile s < t:\n s += (c - a[i])\n i += 1\n\nprint(i)\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tt-=86400-a[i]\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in l:\r\n s+=(86400-i)\r\n c+=1\r\n if s>=t:\r\n break\r\nprint(c)\r\n", "def useful_time(x):\r\n return 86400-int(x)\r\n\r\ntn = list(map(int, input().split(\" \")))\r\nseconds = list(map(useful_time, input().split(\" \")))\r\ni = 0\r\nwhile tn[1] > 0:\r\n tn[1] -= seconds[i]\r\n i += 1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\nb=[86400-int(i) for i in input().split()]\r\nfor i in range(n):\r\n if t<=b[i]:\r\n print(i+1)\r\n break\r\n b[i+1]+=b[i]", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import \r\n# from itertools import \r\n# import random\r\nt, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n temp = 86400 - i\r\n if m == 0:\r\n break\r\n else:\r\n m -= temp\r\n count_ += 1\r\n if m <= 0:\r\n m = 0\r\n else:\r\n continue\r\nprint(count_)\r\n", "def reversed_list(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n n, t = [int(i) for i in input().split(\" \")]\r\n l = [86400 - int(i) for i in input().split(\" \")]\r\n sum = 0\r\n for i in range(len(l)):\r\n sum += l[i]\r\n if sum >= t:\r\n return i + 1\r\n\r\n\r\n\r\nprint(main_function())", "class Luba:\r\n SECONDS=86400\r\n def __init__(self,timeToRead,workingPeriod):\r\n self.__timeToRead=timeToRead\r\n self.__workingPeriod=workingPeriod\r\n self.timeToFinish=1\r\n def TimeToFinish(self):\r\n for workingTime in self.__workingPeriod:\r\n self.__timeToRead-=Luba.SECONDS-workingTime\r\n if self.__timeToRead>0:\r\n self.timeToFinish+=1\r\n return str(self.timeToFinish)\r\n\r\n def __str__(self):\r\n return self.TimeToFinish()\r\n_,speed=map(int,input().split())\r\nworkingPeriod=list(map(int,input().split()))\r\nprint(Luba(speed,workingPeriod))\r\n\r\n\r\n\r\n", "a,t= input().split()\r\nt= int(t)\r\n\r\nb=[abs(86400-int(x)) for x in input().split()]\r\n\r\nc=0\r\ns=0\r\ni=0\r\nwhile s<t:\r\n s=s+b[i]\r\n i=i+1\r\n c=c+1\r\nprint(c)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n v=86400-a[i]\r\n if v>=t:\r\n break\r\n else:\r\n t-=v\r\n\r\nprint(i+1)\r\n", "n, t = map(int, input().split())\r\ndays = list(map(int, input().split()))\r\nans = 0;\r\n\r\nfor day,time in enumerate(days):\r\n left = 86400 - time\r\n t-=left\r\n if(t <= 0):\r\n ans = day\r\n break\r\nprint(ans+1)\r\n ", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = 0\r\nfor time in a:\r\n d += 1\r\n t -= 86400 - time\r\n if t <= 0:\r\n break\r\nif t <= 0:\r\n print(d)\r\nelse:\r\n print(d + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn,m=invr()\r\nli=inlt()\r\ntot=0\r\ncnt=0\r\nwhile tot<m:\r\n tot+=(86400-li[cnt])\r\n cnt=cnt+1\r\nprint(cnt)\r\n\r\n", "n,t=[int(i) for i in input().split()]\r\na=[(86400-int(i)) for i in input().split()]\r\nd=0\r\nfor i in a:\r\n t-=i\r\n d+=1\r\n if t<=0:\r\n break\r\nprint(d)\r\n \r\n", "# Book Reading\ndef book(t, arr):\n ans = 0\n while t > 0:\n t -= (86400 - arr.pop(0))\n ans += 1\n return ans\n\nn, t = list(map(int, input().split()))\narr = list(map(int, input().split()))\nprint(book(t, arr))", "def reading_time(arr, n):\r\n for i in range(len(arr)):\r\n n -= (86400 - arr[i])\r\n if n <= 0:\r\n return i + 1\r\n return n\r\n\r\nm, n = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(reading_time(nums, n))", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=i=0\r\nwhile(t>0):\r\n\ta=86400-l[i]\r\n\tcount+=1\r\n\tt-=a\r\n\ti+=1\r\nprint(count)", "n=input().split()\r\nn[0]=int(n[0])\r\nn[1]=int(n[1])\r\nli=list(map(int,input().split()))\r\nc=1\r\nx=0\r\nwhile(n[1]>0):\r\n if(li[x]<86400):\r\n n[1]-=(86400-li[x])\r\n if(n[1]>0):\r\n x+=1\r\n c+=1\r\n else:\r\n c+=1\r\n x+=1\r\nprint(c)\r\n \r\n \r\n \r\n \r\n", "n,t=map(int, input().split())\r\na=list(map(int, input().split()))[:n]\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n x=x+86400-a[i]\r\n c+=1\r\n if x>=t:\r\n print(c)\r\n break\r\n ", "d, t = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\ns = 86400\r\nczas = 0\r\ndays = 0\r\n\r\nfor i in range(d):\r\n days += 1\r\n czas += s - h[i]\r\n\r\n if czas >= t:\r\n print(days)\r\n quit()", "n, t = input().split(' ')\r\nn = int(n)\r\nt = int(t)\r\na = list(map(int, input().split()))\r\nb = 0\r\nvrema = 86400\r\nfor c in range(n):\r\n b = b + vrema - a[c]\r\n if b >= t:\r\n print(c + 1)\r\n break\r\n", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nx = 0\r\nc = 0\r\n\r\nwhile x < t:\r\n x += 86400 - a[c]\r\n c += 1\r\n\r\nprint(c)\r\n", "import itertools\r\n\r\nct = 0\r\nn, t = map(int, input().split())\r\na = [86400-x for x in [int(x) for x in input().split()]]\r\nfor x in itertools.accumulate(a):\r\n ct += 1\r\n if x >= t:\r\n res = ct\r\n break\r\nprint(res)\r\n", "n,t=map(int,input().split())\r\nd=[]\r\nfor x in input().split():\r\n d.append(int(x))\r\nk=0\r\ntp=0\r\nfor i in range(n):\r\n k+=1\r\n tp+=86400-d[i]\r\n if tp>=t:\r\n break \r\nprint(k)\r\n \r\n\r\n\r\n\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn, t = IL()\r\na = IL()\r\nfor i, aa in enumerate(a):\r\n t -= 86400 - aa\r\n if t <= 0:\r\n print(i+1)\r\n break", "arr1=list(map(int,input().strip().split()))\r\narr2=list(map(int,input().strip().split()))\r\nn=arr1[0]\r\nt=arr1[1]\r\ntime=0\r\nfor i in range(n):\r\n time+=86400-arr2[i]\r\n if time >= t:\r\n print (i+1)\r\n break\r\n else:\r\n continue\r\n", "n,t=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\ncnt=0\r\nfor x in arr:\r\n\tif 86400-x>=0:\r\n\t\tt-=(86400-x)\r\n\t\tcnt+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(cnt)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n sec_day = 86400\r\n n, t = map(int, stdin.readline().split())\r\n cnt = 0\r\n for cur in stdin.readline().split():\r\n cur = int(cur)\r\n t -= sec_day - cur\r\n cnt += 1\r\n if t <= 0:\r\n stdout.write(str(cnt))\r\n break\r\n\r\nif __name__ == '__main__':\r\n main()", "n, t = map(int, input().split())\r\nans = 0\r\nfor x in [int(i) for i in input().split()]:\r\n t -= 86400-x\r\n ans += 1\r\n if t <= 0:\r\n print(ans)\r\n break\r\n", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = 0\r\nwhile t>0:\r\n t -= (86400-a[i])\r\n i+=1\r\nprint(i)\r\n", "n, t = [int(x) for x in input().split()]\r\na = [86400 - int(x) for x in input().split()]\r\n\r\ns = 0\r\nfor i, x in enumerate(a):\r\n s += x\r\n if s >= t:\r\n print(i+1)\r\n break", "n, t = map(int, input().split())\nar = list(map(int, input().split()))\ni = 0\nwhile t > 0:\n t -= (86400 - ar[i])\n i += 1\nprint(i)", "n,t=map(int,input().split())\r\nd=list(map(int,input().split()))\r\ni=-1\r\nwhile (t>0):\r\n i+=1\r\n t-=86400-d[i]\r\nprint(i+1) \r\n\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres = 0\r\nwhile t>0:\r\n t-=86400-a[res]\r\n res+=1\r\nprint(res)", "n,t=map(int,input().split());s,k=0,0\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n s+=1\r\n k+=86400-a[i]\r\n if k>=t:print(s);exit()", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nret = 0\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400 - a[i]\r\n i += 1\r\n ret += 1\r\nprint(ret)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nx = 0\nans = 0\nfor i in range(0, n):\n\tx += abs(a[i]-86400)\n\tans+=1\n\tif x >= m:\n\t\tbreak\nprint(ans)", "n,t=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nfor i in range(len(l)):\r\n diff=86400-l[i]\r\n if t<=diff:\r\n print(i+1)\r\n break\r\n else:\r\n t-=diff", "n,k=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\na=list(input().split(' '))\r\na=[int(i) for i in a]\r\ns=0\r\ne=0\r\nfor i in range(0,n):\r\n s+=(86400-a[i])\r\n if s>=k:\r\n e=i\r\n break\r\n\r\nprint(e+1)\r\n", "def r():\r\n n, t = list(map(int, input().split()))\r\n work = list(map(int, input().split()))\r\n for i in range(n):\r\n t -= (86400-work[i])\r\n if t <= 0:\r\n return i+1\r\nprint(r())", "line = list(map(int, input().split()))\r\ndays, time = line\r\nsecList = list(map(int, input().split()))\r\nfor i in range(len(secList)):\r\n secList[i] = 86400 - secList[i]\r\nreqDays = 0\r\nfor i in range(len(secList)):\r\n time -= secList[i]\r\n reqDays += 1\r\n if (time <= 0):\r\n break\r\nprint(reqDays)", "n,t=list(map(int,input().split()))\r\na=input().split()\r\ni=0\r\nwhile t>0:\r\n t-=(86400-int(a[i]))\r\n i+=1\r\nprint(i)", "inp=lambda:map(int,input().split())\r\nn,t=inp()\r\n\r\na=list(inp())\r\n\r\nsum=0\r\nfor i in range(n):\r\n sum+=86400-a[i]\r\n if(sum>=t):\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in a:\r\n k=86400-i\r\n s=s+k\r\n c=c+1\r\n if s>=t:\r\n break\r\nprint(c)", "L = 86400\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor d, i in enumerate(a, 1):\r\n k -= L - i\r\n if k <= 0:\r\n print(d)\r\n exit()\r\nprint(n + 1)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-24 23:49:50\nLastEditTime: 2021-11-24 23:53:42\nDescription: Book Reading\nFilePath: CF884A.py\n'''\n\n\ndef func():\n n, t = map(int, input().strip().split())\n time = list(map(int, input().strip().split()))\n total = 0\n for i in range(len(time)):\n total += 86400 - time[i]\n if total >= t:\n print(i + 1)\n break\n \n\n\nif __name__ == '__main__':\n func()\n ", "s=input().split();n=int(s[0]);t=int(s[1]);x=input().split();ans=1\r\nfor i in range(0,n):\r\n t-=(86400-int(x[i]))\r\n if t<=0:\r\n break\r\n else:\r\n ans+=1\r\nprint(ans)", "def count_days(lst_of_hours,read_time):\r\n num_of_days = 0\r\n for a in lst_of_hours:\r\n read_time -= 86400 - a\r\n num_of_days += 1\r\n if read_time <= 0:\r\n return (num_of_days)\r\n return (num_of_days+ 1 + read_time//86400)\r\n\r\nn,t = map(int,input().strip().split())\r\nworking_hours = list(map(int,input().strip().split()))100\r\n\r\nprint (count_days(working_hours,t))", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\n\r\ntime=0\r\n\r\nfor i in range(n):\r\n if a[i]<=86400:\r\n if 86400-a[i]>m:\r\n time+=m\r\n else:\r\n time+=86400-a[i]\r\n if time>=m:\r\n print(i+1)\r\n break\r\n\r\n\r\n", "n = [int(x) for x in input().strip().split()]\r\nm = [int(y) for y in input().strip().split()]\r\ncount = 0\r\nfor i in range(n[0]):\r\n count += 86400 - m[i]\r\n if count >= n[1]:\r\n print(i + 1)\r\n break", "(n, t) = map(int, input().split())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\ni = 0\r\nk = 0\r\nwhile t > 0:\r\n t -= (86400 - lst[i])\r\n i += 1\r\n k += 1\r\n\r\nprint(k)\r\n", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nwhile t > 0:\r\n t -= 86400 - a[k]\r\n k += 1\r\nprint(k)", "from itertools import accumulate\r\nn,t = [int(x) for x in input().split()]\r\na = [86400-int(x) for x in input().split()]\r\nfor i,acc in enumerate(accumulate(a)):\r\n if(acc>=t):\r\n print(i+1)\r\n break;", "n, t = map(int, input().split())\r\nfor i, ai in enumerate(map(int, input().split())):\r\n t -= 86400 - ai\r\n if t <= 0:\r\n print(i + 1)\r\n break", "x=input()\r\ny=input()\r\nx=x.split()\r\nn=int(x[0])\r\nt=int(x[1])\r\ny=y.split()\r\nd=[]\r\nfor i in (y):\r\n d.append(86400-int(i))\r\nflag=0\r\nfor i in range(n):\r\n if d[i]<t:\r\n t=t-d[i]\r\n else:\r\n flag=i+1\r\n break\r\n \r\n\r\n \r\nprint(flag) \r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n k=86400-a[i]\r\n t-=k\r\n c+=1\r\n if t<=0:\r\n break\r\nprint(c)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=0\r\nfor i in l:\r\n t=t-(86400-i)\r\n d=d+1\r\n if t<=0:\r\n print(d)\r\n break", "n,t = map(int,input().split())\r\nd = [map(int,input().split())]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += (86400-d[i])\r\n i += 1\r\nprint(i)", "n, t = [int(i) for i in input().split()]\r\n\r\nl = [int(i) for i in input().split(\" \")]\r\n\r\ncur = 0\r\n\r\nfor i in range(n):\r\n cur += 86400 - l[i]\r\n if cur >= t:\r\n print(i + 1)\r\n exit(0)", "n, t = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nd = 0\r\nfor i in a:\r\n t = t - (86400 - i)\r\n d += 1\r\n if( t <= 0):\r\n break;\r\nprint(d)\r\n \r\n", "import sys\r\n\r\ndef main():\r\n n, t, l = map(int, sys.stdin.read().strip().split())\r\n f = 0\r\n for i in range(n):\r\n f += 86400 - l[i]\r\n if f >= t: return i + 1\r\n \r\nprint(main())\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ntime = a[1]\r\ndays = 0\r\nfor i in b:\r\n time -= (86400-i)\r\n days += 1\r\n if time <= 0:\r\n break\r\nprint(days)\r\n ", "# t --> seconds to read the book (1 ≤ t ≤ 10*6)\r\n# n --> number of days (1 ≤ n ≤ 100)\r\n# a[i] --> The number of seconds that she has to spend working during i-th day (0 ≤ a[i] ≤ 86400)\r\n\r\nn , t = map(int , input().split()) # Days and time input at the same line\r\na = list(map(int , input().split())) # Array input at the same line\r\n\r\nfor i in range(0 , len(a)):\r\n readingTime = 86400 - a[i]\r\n t = t - readingTime\r\n if(t <= 0):\r\n print(i + 1)\r\n break", "n, t = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nfor i in range(n):\r\n t-=86400-ls[i]\r\n if t<=0: print(i+1); break\r\n", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(len(a)):\r\n res+=86400-a[i]\r\n if res>=t:\r\n print(i+1)\r\n break", "(n, t) = map(int, input().split())\r\nseconds = list(map(int, input().split()))\r\ncounter = int()\r\n\r\nfor i in range(len(seconds)):\r\n if counter >= t:\r\n print(i)\r\n break\r\n\r\n counter+=86400-seconds[i]\r\nelse:\r\n if counter >= t:\r\n print(i + 1)", "INF = int(1e18)\r\nN = 86400\r\n\r\n\r\n\r\n\r\ndef main():\r\n n, t = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n for i in range(len(a)):\r\n t -= (N - a[i])\r\n if t <= 0:\r\n print(i + 1)\r\n return\r\n\r\n\r\n\r\nmain()", "x,y = map(int, input().split(' '))\r\narr = [86400 for i in range(x)]\r\nA = list(map(int, input().split()))\r\n\r\nfor i in range(len(arr)):\r\n arr[i] = arr[i] - A[i]\r\n\r\nfor i in range(len(arr)):\r\n if y > arr[i]:\r\n y -= arr[i]\r\n else:\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nday = 0\r\ni = 0\r\nwhile i <= n - 1:\r\n if t <= 0:\r\n break\r\n free = 86400 - w[i]\r\n t = t - free\r\n day = day + 1 \r\n i = i + 1\r\n\r\nprint(day)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,t=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nfor i in range(n):\r\n t-=86400-z[i]\r\n if t<=0:\r\n print(i+1)\r\n break", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n t -= 86400 - a[i]\r\n if t <= 0:\r\n print(i + 1)\r\n break" ]	{"inputs": ["2 2\n86400 86398", "2 86400\n0 86400", "2 86400\n1 86399", "100 1000000\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", "1 1\n86399", "6 1200\n86400 86400 86000 86000 86000 86400", "6 1200\n86400 86400 86000 86000 86001 86399", "4 172799\n1 1 86400 0", "4 172799\n0 86400 86399 0", "6 1\n1 1 86400 1 86399 1", "4 1\n86400 86399 86400 86400", "4 1\n86400 86400 0 86400"], "outputs": ["2", "1", "2", "12", "1", "5", "6", "4", "4", "1", "2", "3"]}	UNKNOWN	PYTHON3	CODEFORCES	396
d1cb8e128dce4bdba12b0eb1c2f27fc2	k-Factorization	Given a positive integer n, find k integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to n. The first line contains two integers n and k (2<=≤<=n<=≤<=100000, 1<=≤<=k<=≤<=20). If it's impossible to find the representation of n as a product of k numbers, print -1. Otherwise, print k integers in any order. Their product must be equal to n. If there are multiple answers, print any of them. Sample Input 100000 2 100000 20 1024 5 Sample Output 2 50000 -1 2 64 2 2 2	[ "from math import sqrt\r\n\r\n\r\ndef eratosfen(x):\r\n arr = [True] * (x + 1)\r\n result = []\r\n for i in range(2, x + 1):\r\n if arr[i]:\r\n result.append(i)\r\n for j in range(2 * i, x + 1, i):\r\n arr[j] = False\r\n return result\r\n\r\nn, k = map(int, input().split())\r\nsimples = eratosfen(n)\r\ndivs = []\r\nfor simple in simples:\r\n while n % simple == 0:\r\n n //= simple\r\n divs.append(simple)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() * divs.pop())\r\n print(divs)\r\n", "n, k = map(int, (input().split()))\r\nd = []\r\ni = 2\r\nwhile i <= n:\r\n while n % i == 0:\r\n d.append(i)\r\n n //= i\r\n else:\r\n i += 1\r\nif len(d) < k:\r\n print(-1)\r\nelse:\r\n while len(d) > k:\r\n d[-2] = d[-1]\r\n d.pop()\r\n print(d)\r\n", "from math import sqrt\n\n\ndef k_factor(n, k):\n if k == 1:\n return [n]\n factor_candidate = 2\n smallest_factor = None\n while factor_candidate < sqrt(n + 1):\n if not (n % factor_candidate):\n smallest_factor = factor_candidate\n break\n factor_candidate += 1\n if smallest_factor is None:\n return [-1]\n\n other_factors = k_factor(n // smallest_factor, k - 1)\n\n if other_factors[0] == -1:\n return [-1]\n\n return [smallest_factor, other_factors]\n\n\nn, k = map(int, input().split())\n\nprint(' '.join([str(i) for i in k_factor(n, k)]))\n", "n,k = map(int, input().split())\r\nl = []\r\nfor i in range(2, n + 1):\r\n\tif n % i == 0:\r\n\t\twhile n % i == 0 and len(l) < (k - 1):\r\n\t\t\tn //= i\r\n\t\t\tl.append(i)\r\nif n > 1:\r\n\tl.append(n)\r\nif len(l) == k:\r\n\tprint(l)\r\nelse:\r\n\tprint(-1)\n# Mon Jul 11 2022 09:14:29 GMT+0000 (Coordinated Universal Time)\n", "import sys\r\nn,k=[int(x) for x in sys.stdin.readline().split()]\r\ncounter=1\r\ntobeprinted=[]\r\nwhile counter!=k:\r\n\tfor i in range(2,int(n)+1):\r\n\t\tif n%i==0:\r\n\t\t\ttobeprinted.append(i)\r\n\t\t\tn=n//i\r\n\t\t\tcounter+=1\r\n\t\t\tbreak\r\n\tif n==1:\r\n\t\tprint(\"-1\")\r\n\t\texit()\r\ntobeprinted.append(n)\r\nprint(tobeprinted)", "def f(n): \r\n l, d = [], 2 \r\n while d*2 <= n: \r\n if n%d == 0 : l.append(d); n//=d \r\n else : d += 1 \r\n if n!=1 : l.append(n) \r\n return l \r\nn, k = [int(i) for i in input().split()] \r\nQ = f(n)\r\nif len(Q) >= k : \r\n for i in range(k-1) : print(Q[i], end = ' ')\r\n r = Q[k-1:] \r\n w = 1\r\n for i in range(len(r)) : w = r[i] \r\n print(w)\r\nelse : print(-1)", "n,k=map(int,input().split())\r\nl=[]\r\nfor j in range(k-1):\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:\r\n\t\t\tn=n//i\r\n\t\t\tl.append(i)\r\n\t\t\tbreak\r\nif len(l)==k-1: print(l,n)\r\nelse: print(-1)", "import math\r\nn,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\nlst=[]\r\nc=0\r\nwhile(c!=k and n>1):\r\n t=0\r\n if c==k-1:\r\n lst.append(n)\r\n c+=1\r\n break\r\n for j in range(2,math.ceil(math.sqrt(n))+1):\r\n if n%j==0:\r\n t=j\r\n break\r\n if t==0 and n!=1:\r\n lst.append(n)\r\n c+=1\r\n break\r\n else:\r\n lst.append(t)\r\n c+=1\r\n n=n//t\r\nif c!=k:\r\n print(-1)\r\nelse:\r\n for j in range(k):\r\n print(lst[j],end=\" \")\r\n ", "import heapq;\r\nimport itertools\r\nimport math;\r\nfrom collections import deque, Counter;\r\nimport sys;\r\n\r\ninput = sys.stdin.readline;\r\n\r\nmod = 109 + 7;\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef primeFactors(num):\r\n\r\n primes = []\r\n for i in range(2, int(math.sqrt(num)) + 2):\r\n while(num % i == 0):\r\n num //= i;\r\n primes.append(i)\r\n\r\n\r\n\r\n if num > 1:\r\n primes.append(num)\r\n\r\n return primes;\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nprimes = primeFactors(n)\r\nif k > len(primes):\r\n print(-1)\r\nelse:\r\n\r\n diff = len(primes) - k;\r\n\r\n lastNum = 1;\r\n\r\n if not diff:\r\n print(primes)\r\n else:\r\n lastNum = primes.pop()\r\n while(diff):\r\n lastNum = primes.pop()\r\n diff -= 1;\r\n\r\n print(list(primes + [lastNum]))\r\n\r\n\r\n", "n, k = map(int, input().split())\n\nprime_factors = []\nfor p in range(2, n+1):\n while n % p == 0:\n prime_factors.append(p)\n n //= p\n\nif len(prime_factors) >= k:\n ans = [p for p in prime_factors]\n while len(ans) > k:\n d = ans.pop()\n ans[-1] = d\n print(ans)\nelse:\n print(-1)", "n,k=map(int,input().split())\nl=[]\nfor i in range(2,n+1):\n\tif n%i==0:\n\t\twhile n%i==0 and len(l)<(k-1):\n\t\t\tn//=i\n\t\t\tl.append(i)\nif n>1:\n\tl.append(n)\nif len(l)==k:\n\tprint(l)\nelse:\n\tprint(-1)", "n,k=map(int,input().split())\r\nr=[]\r\nfor i in range(k-1):\r\n for j in range(2,n):\r\n if n%j==0:\r\n n=n//j\r\n r.append(j)\r\n break\r\nif len(r)==k-1:\r\n print(r,n)\r\nelse:\r\n print(\"-1\")\r\n", "def sieve(n):\n primo = []\n bs = [1]n\n \n bs[0] = bs[1] = 0\n \n for i in range (2, n):\n if bs[i]:\n for j in range (i i, n, i):\n bs[j] = 0\n primo.append(i)\n \n return primo\n\ndef fact(n, k):\n \n v = []\n primo = sieve(n)\n counter = k\n if (k == 1):\n print(n)\n return\n\n for p in primo:\n while(n % p == 0):\n v.append(p)\n n /= p\n counter += -1\n if (n == 1): break\n \n if len(v) >= k:\n for i in range (k - 1): print(v[i], end = \" \")\n prod = 1\n for i in range (k - 1, len(v)): prod = v[i]\n print(prod)\n else:\n print(-1)\n return\n\n\ndef main():\n n, k = input().split(\" \")\n fact(int(n), int(k))\n\nif __name__ == \"__main__\":\n main()\n\t \t \t\t\t \t\t \t \t \t\t\t\t\t \t \t", "import sys,math,io,os,time,itertools,collections\r\nmod=109+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef primefac(n):\r\n l=[]\r\n while n%2==0:\r\n l.append(2)\r\n n=n//2\r\n p=3\r\n while pp<=n:\r\n while n%p==0:\r\n l.append(p)\r\n n=n//p\r\n p+=2\r\n if n>2:\r\n l.append(n)\r\n return l\r\n\r\ndef main():\r\n n,m=[int(k) for k in i().split()]\r\n l=primefac(n)\r\n if len(l)<m:\r\n p(\"-1\\n\")\r\n else:\r\n fin=[]\r\n prod=l[0]\r\n for k in range(1,len(l)-m+1):\r\n prod=l[k]\r\n fin.append(str(prod))\r\n for k in range(len(l)-m+1,len(l)):\r\n fin.append(str(l[k]))\r\n p(\" \".join(fin)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "def myFact(n):\r\n fact=[];\r\n i=2;\r\n while ii <=n: #or root under n >=i\r\n if n%i==0:\r\n n=n//i;\r\n fact.append(i);\r\n else:\r\n i+=1;\r\n if n>1:\r\n fact.append(n)\r\n return fact;\r\n\r\n\r\nn,k=map(int,input().split())\r\nfactors=myFact(n)\r\nif len(factors)<k:\r\n print(-1);\r\nelse:\r\n print(factors[0:k-1:],end=\" \")\r\n prod=1;\r\n for i in range(k-1,len(factors)):\r\n prod=factors[i];\r\n print(prod);\r\n\r\n\r\n", "N=100010\r\n\r\na = [1]N\r\n\r\na[0]=a[1]=0 \r\nfor i in range(2, N):\r\n\tif(a[i]):\r\n\t\tfor j in range(ii,N,i):\r\n\t\t\ta[j] = 0\r\nar = []\r\nfor i in range(1,N):\r\n\tif(a[i]):\r\n\t\tar.insert(len(ar),i)\r\n\r\n\r\nb = []\r\n\r\nx,y = map(int,input().split())\r\n\r\nfor i in ar:\r\n\tif(x==0):\r\n\t\tbreak\r\n\twhile(x%i==0):\r\n\t\tb.insert(len(b),i)\r\n\t\tx/=i\r\n\r\nif(len(b)<y):\r\n\tprint(-1)\r\nelse:\r\n\tres = 1\r\n\tfor i in range(len(b)-y+1):\r\n\t\tres = b[i]\r\n\tprint(res,end=' ')\r\n\tfor i in range(len(b)-y+1,len(b)):\r\n\t\tprint(b[i],end=' ')\r\n\tprint('')\t", "n,k=map(int,input().split(\" \"))\r\ndiv=[]\r\ndivisor=2\r\n\r\nif k>1:\r\n while n>1:\r\n if n%divisor==0:\r\n n/=divisor\r\n div.append(divisor)\r\n else:\r\n divisor+=1\r\n i=-1\r\n if len(div)>k:\r\n i+=1\r\n while len(div)!=k:\r\n div[1]=div[0]\r\n div.pop(0)\r\n if len(div)==k:\r\n for i in range(k):\r\n print(div[i],end=\" \")\r\n else:\r\n print(-1)\r\nelse:\r\n print(n)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 2\r\nl = []\r\nwhile(n != 1):\r\n while(n % c == 0):\r\n l.append(c)\r\n n = n // c \r\n c += 1 \r\nif(len(l) < k):\r\n print(-1)\r\nelif(len(l) == 1):\r\n print(l)\r\nelse:\r\n print((l[ : k - 1]), end = ' ')\r\n m = 1 \r\n for i in range(k - 1, len(l)):\r\n m = l[i]\r\n\r\n print(m) ", "ll=[]\r\nn,k=map(int,input().split())\r\ni=2\r\nwhile ii<=n:\r\n if n%i==0:\r\n ll.append(i)\r\n n//=i\r\n i=2\r\n else:\r\n i+=1\r\nll.append(n)\r\nif len(ll)<k:\r\n print(-1)\r\nelif len(ll)==k:\r\n print(ll)\r\nelse:\r\n kk=[]\r\n t=1\r\n for i in range(len(ll)-k+1):\r\n t=ll[i]\r\n kk.append(t)\r\n kk+=ll[len(ll)-k+1:]\r\n print(kk)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom heapq import heappush,heappop,heapify\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n# mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\nfile=1\r\n\r\n\r\ndef solve():\r\n\r\n # for t in range(ii()):\r\n\r\n n,k=mi()\r\n x=[]\r\n n1=n\r\n for i in range(2,int(sqrt(n))+1):\r\n c=0\r\n while(n%i==0):\r\n c+=1\r\n n//=i\r\n if c>0:\r\n x.append([c,i])\r\n \r\n if n>1:\r\n x.append([1,n])\r\n cnt=0\r\n for i in range(len(x)):\r\n cnt+=x[i][0]\r\n if k>cnt:\r\n print('-1')\r\n exit(0)\r\n s=1\r\n c=1\r\n for i in range(len(x)):\r\n for j in range(x[i][0]):\r\n if c<k:\r\n print(x[i][1],end=\" \")\r\n s=x[i][1]\r\n c+=1\r\n else:\r\n print(n1//s)\r\n exit(0)\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n\r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(2,n+1):\r\n\tif n%i==0:\r\n\t\twhile n%i==0 and len(l)<(k-1):\r\n\t\t\tn//=i\r\n\t\t\tl.append(i)\r\nif n>1:\r\n\tl.append(n)\r\nif len(l)==k:\r\n\tprint(l)\r\nelse:\r\n\tprint(-1)\r\n", "n,k=map(int,input().split()) \r\nimport math\r\ndef primeFactors(n,arr):\r\n\twhile(n%2==0):\r\n\t\tarr.append(2)\r\n\t\tn = n / 2\r\n\tfor i in range(3,int(math.sqrt(n))+1,2):\r\n\t\twhile(n%i==0):\r\n\t\t\tarr.append(i),\r\n\t\t\tn = n / i\r\n\tif n > 2:\r\n\t\tarr.append(n)\r\narr=[]\r\nprimeFactors(n,arr)\r\nans=[]\r\nif(len(arr)>=k):\r\n x=1\r\n for i in range(k-1):\r\n x=arr[i]\r\n ans.append(arr[i]) \r\n x1=n//x \r\n if(x1==1):\r\n print(-1) \r\n else:\r\n ans.append(x1) \r\n print(ans)\r\nelse:\r\n print(-1)", "import math\n\n# A function to print all prime factors of\n# a given number n\ndef primeFactors(n):\n\n # Print the number of two's that divide n\n while n % 2 == 0:\n factors.append(2)\n n = n // 2\n\n # n must be odd at this point\n # so a skip of 2 ( i = i + 2) can be used\n for i in range(3, int(math.sqrt(n)) + 1, 2):\n\n # while i divides n , print i ad divide n\n while n % i == 0:\n factors.append(i)\n n = n // i\n\n # Condition if n is a prime\n # number greater than 2\n if n > 2:\n factors.append(n)\n\n\nnk = input()\nnks = list(map(int, nk.split(' ')))\nn = nks[0]\nk = nks[1]\nm = 1\nfactors = []\nprimeFactors(n)\n\nif len(factors) >= k:\n for idx in range(k-1):\n print(factors[idx], end='')\n print(' ', end='')\n for i in range(k-1, len(factors)):\n m = factors[i]\n print(m)\nelse:\n print(-1)\n \t\t \t \t \t \t \t \t\t \t \t\t\t\t", "n,k=map(int,input().split())\r\na=[]\r\ni=2\r\nwhile i<=n:\r\n if(k==1 and n!=1):\r\n a.append(n)\r\n k-=1\r\n break\r\n if n%i==0:\r\n a.append(i)\r\n n=int(n//i)\r\n k-=1\r\n i=1\r\n i+=1\r\nif(k>0):\r\n print(-1)\r\nelse:\r\n for i in a:\r\n print(i,end=' ')", "import math\r\ndef primeFact(n):\r\n\ta = []\r\n\twhile n%2==0:\r\n\t\ta += [2]\r\n\t\tn /= 2\r\n\tfor i in range(3,int(math.sqrt(n))+1,2):\r\n\t\twhile n%i==0:\r\n\t\t\ta += [i]\r\n\t\t\tn /= i\r\n\tif n>2:\r\n\t\ta += [int(n)]\r\n\treturn a\r\nn,k = map(int,input().split())\r\na = primeFact(n)\r\np = 1\r\nif len(a)<k:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(k-1):\r\n\t\tprint(a[i],end=' ')\r\n\tfor j in range(k-1,len(a)):\r\n\t\tp = a[j]\r\n\tprint(p,end='')\r\n\tprint()", "n, k = map(int, input().split())\r\ng = []\r\nfor i in range(k - 1):\r\n for j in range(2, n):\r\n if(n % j == 0):\r\n n //= j\r\n g.append(str(j))\r\n break\r\ng.append(str(n))\r\nif(len(g) == k):\r\n print(g)\r\nelse:\r\n print(-1)", "def prime(no):\r\n i=2\r\n while ii<=no:\r\n if no%i==0:return False\r\n if no%(no//i)==0:return False\r\n i+=1\r\n return True\r\nn,k=map(int,input().split())\r\ndiv=[];i=2\r\nwhile n>=i:\r\n while n!=0 and i<=n and prime(i) and n%i==0:\r\n n=n//i;div.append(i)\r\n i+=1\r\nif n>1:div.append(n);\r\nif len(div)<k:print(-1);exit()\r\nfor i in range(k-1):\r\n print(div[i],end=\" \")\r\n#for another\r\na=1\r\nfor j in range(k-1,len(div)):a=div[j]\r\nprint(a)\r\n", "def rozloz(n):\n\twynik = []\n\td = 2\n\twhile d * d <= n:\n\t\twhile n % d == 0:\n\t\t\twynik.append(d)\n\t\t\tn //= d\n\t\td += 1\n\tif n > 1:\n\t\twynik.append(n)\n\treturn wynik\n\n[n, k] = [int(x) for x in input().split()]\n\nczynniki = rozloz(n)\nif len(czynniki) < k:\n\tprint(-1)\nelse:\n\tfor i in range(k - 1):\n\t\tprint(czynniki[i], end = \" \")\n\t\tn //= czynniki[i]\n\tprint(n)", "n, k = map(int, input().split())\r\nfactors = []\r\nd = 2\r\nwhile d * d <= n:\r\n if n % d == 0:\r\n factors.append(d)\r\n n//=d\r\n else:\r\n d += 1\r\nfactors.append(n) \r\nif len(factors)< k :\r\n print(\"-1\")\r\nelse:\r\n while len(factors) > k:\r\n l = factors.pop()\r\n d = factors.pop()\r\n g = ld\r\n factors.append(g)\r\n \r\n print(\" \".join(map(str, factors)))\n# Mon Jul 11 2022 13:23:10 GMT+0000 (Coordinated Universal Time)\n", "n, k = map(int, input().split())\r\nans = []\r\ni = 2\r\nwhile n != 1 and k:\r\n if k == 1:\r\n ans.append(n)\r\n k -= 1\r\n break\r\n\r\n if not n % i:\r\n n //= i\r\n ans.append(i)\r\n k -= 1\r\n\r\n else:\r\n i += 1\r\n \r\nif not k:\r\n print(ans)\r\nelse:\r\n print(-1)", "\r\n\r\nn,k=map(int,input().split())\r\nres=[]\r\ni=2\r\nwhile ii<=n:\r\n while n%i==0:\r\n res.append(i)\r\n n//=i\r\n i+=1\r\nif n>1:\r\n res.append(n)\r\nx=len(res)\r\nif k>x:\r\n print(-1)\r\nelif k==x:\r\n print(res)\r\nelse:\r\n s=1\r\n for i in range(x-k+1):\r\n s=res[i]\r\n res=res[x-k+1:]\r\n res.append(s)\r\n print(res)\r\n \r\n \r\n \r\n ", "import math\r\n\r\ndef main():\r\n def factors(n): \r\n ans = []\r\n \r\n while n % 2 == 0: \r\n ans.append(2)\r\n n = n // 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2): \r\n \r\n while n % i== 0: \r\n ans.append(i) \r\n n = n // i \r\n \r\n if n > 2:\r\n ans.append(n)\r\n return ans\r\n \r\n a,k = map(int,input().split())\r\n fact = factors(a)\r\n if(len(fact)<k):\r\n print(-1)\r\n else:\r\n while(len(fact)!=k):\r\n fact[0]=fact[-1]\r\n fact.pop()\r\n print(' '.join([str(x) for x in fact]))\r\n \r\n return\r\nmain()", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn,k=map(int,input().split())\r\np=[]\r\nc=0\r\ni=2\r\nwhile(i<=math.sqrt(n)+1 and n>1 and c<k-1):\r\n while(n%i==0 and c<k-1):\r\n n=n//i\r\n c+=1\r\n p=p+[i]\r\n i+=1\r\n#print(c)\r\nif c<k-1 or n<=1:\r\n print(-1)\r\nelse:\r\n print((p+[n]))", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef factors(n):\r\n limit = int(sqrt(n)+1)\r\n res = []\r\n for i in range(2, limit+1):\r\n while n % i == 0:\r\n res.append(i)\r\n n //= i\r\n if n > 1:\r\n res.append(n)\r\n return res\r\n\r\n\r\nn, k = invr()\r\n\r\nf = factors(n)\r\n\r\nif k > len(f):\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(f[i], end=\" \")\r\n res = 1\r\n for i in range(k-1, len(f)):\r\n res = f[i]\r\n if res > 1:\r\n print(res)\r\n", "n, k = map(int, input().split())\r\nm = n\r\nts = []\r\nfor i in range(2, n+1):\r\n while n % i == 0:\r\n ts.append(i)\r\n n //= i\r\nif len(ts) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(ts[i], end=' ')\r\n m //= ts[i]\r\n print(m)\r\n", "import sys\r\nimport math\r\nn, k = map(int, input().split())\r\n\r\nrealn = n\r\nsq = int(math.sqrt(n));\r\ncnt = 0\r\nans = []\r\nfor i in range(2,sq+1):\r\n while n % i == 0:\r\n n //= i\r\n ans.append(i)\r\nif n > 1:\r\n ans.append(n)\r\nif len(ans) < k:\r\n print(-1)\r\n sys.exit()\r\nelse:\r\n cur = 1;\r\n for i in range(k -1):\r\n print(ans[i], end = ' ')\r\n cur = ans[i]\r\n print(realn // cur)", "n,k=map(int,input().split())\r\nz=[]\r\nx=2\r\ncount=0\r\nwhile n>=x:\r\n\tif count==k-1:\r\n\t\tz.append(n)\r\n\t\tcount+=1\r\n\t\tbreak\r\n\tif n%x==0:\r\n\t\tz.append(x)\r\n\t\tcount+=1\r\n\t\tn=n//x\r\n\telse:\r\n\t\tx+=1\r\n\r\nif k>count:\r\n\tprint(-1)\r\nelse:\r\n\tprint(z)", "x , y = map(int ,input().split())\r\ns = y\r\nz = []\r\nfor i in range(2 , int(x * .5) +1):\r\n while x % i == 0 and y > 1:\r\n x //= i\r\n y -= 1\r\n z.append(i)\r\n if y == 0:\r\n break\r\nif x > 1:\r\n z.append(x)\r\nprint(z if len(z) == s else [-1])\r\n", "import math\r\n\r\n\r\nn , k = map(int,input().split())\r\narr = []\r\nstor = []\r\nfor i in range(2,int(math.sqrt(n))+1,+1):\r\n while n % i == 0:\r\n n = n//i\r\n arr.append(i)\r\n\r\nif n >= 2:\r\n arr.append(n)\r\n\r\nif k > len(arr):\r\n print(-1)\r\nelse:\r\n for j in range(k-1):\r\n print(arr[j],end=\" \")\r\n product = 1\r\n for u in range(k-1,len(arr)):\r\n product = productarr[u]\r\n\r\n print(product)", "n,k = map(int,input().split())\r\nfactors = []\r\na = [0](1000005)\r\nprimes = set()\r\nprimes.add(2)\r\nfor i in range(3,1000000,2):\r\n if a[i]==0:\r\n primes.add(i)\r\n for j in range(i,1000000,i):\r\n a[j]=1\r\nfor i in primes:\r\n while n%i==0:\r\n factors.append(i)\r\n n/=i\r\n if n==1:\r\n break\r\n if n in primes:\r\n factors.append(int(n))\r\n break\r\nif k>len(factors):\r\n print(-1)\r\nelse:\r\n l = 1\r\n ln = len(factors)\r\n while ln>k-1:\r\n l=factors.pop()\r\n ln-=1\r\n print(factors,l)", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nfactors = []\r\nfor i in range(2, 1+int(math.sqrt(float(n)))):\r\n while n % i == 0:\r\n factors.append(i)\r\n n = int(n/i)\r\nif n != 1:\r\n factors.append(n)\r\nif len(factors) < k:\r\n print(-1)\r\nelif len(factors) > k:\r\n for i in range(k-1):\r\n print(factors[i], end=' ')\r\n for i in range(k, len(factors)):\r\n factors[k-1] = factors[i]\r\n print(int(factors[k-1]))\r\nelse:\r\n for i in factors:\r\n print(int(i), end=' ')\r\n", "[n,k]=[int(x) for x in input().split()]\r\ndef rozloz(n):\r\n wynik = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n wynik.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n wynik.append(n)\r\n return wynik\r\nx=rozloz(n)\r\na=1\r\nif len(x)<k:\r\n print(\"-1\")\r\nelse:\r\n for i in range(k-1):\r\n print(x[i],end=\" \")\r\n a=x[i]\r\n print(n//a)", "def f(n):\r\n l = []\r\n i = 2\r\n while i <= n0.5:\r\n if n % i != 0:\r\n i += 1\r\n else:\r\n l.append(i)\r\n n //= i\r\n if n != 1:\r\n l.append(n)\r\n return l\r\nx = 1\r\nn,k = map(int,input().split())\r\nl = f(n)\r\nif len(l) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(l[i],end=' ')\r\n for i in range(k-1,len(l)):\r\n x = l[i]\r\n print(x)\r\n", "n,k = map(int, input().split())\r\n\r\nimport math\r\ndef factorize(n):\r\n d = {}\r\n temp = int(math.sqrt(n))+1\r\n for i in range(2, temp):\r\n while n%i== 0:\r\n n //= i\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n if d == {}:\r\n d[n] = 1\r\n else:\r\n if n in d:\r\n d[n] += 1\r\n elif n != 1:\r\n d[n] =1\r\n return d\r\n\r\nd = factorize(n)\r\nres = []\r\nfor p, q in d.items():\r\n res += [p]q\r\nif len(res) < k:\r\n print(-1)\r\nelse:\r\n x = 1\r\n for i in range(k, len(res)):\r\n x = res[i]\r\n res = res[:k]\r\n res[-1] = x\r\n print(res)\r\n", "n,k = map(int,input().split())\r\na=[]\r\nflag = 1\r\nl=n\r\nif n < 2k:\r\n flag = 0\r\nelse:\r\n while(len(a)<k):\r\n for i in range(2,int(n0.5)+1):\r\n if n%i==0:\r\n if a != [] :\r\n a.pop()\r\n a.append(i)\r\n n//=i\r\n a.append(n)\r\n break\r\n else: \r\n break\r\n\r\nif k == 1:\r\n print(l)\r\nelif len(a)==k and flag == 1:\r\n for i in a:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)", "n, k = list(map(int, input().split()))\n\nc = 0\nlst = []\nd = 2\nif k == 1:\n\tprint(n)\n\t\nelse:\n\twhile n != 1:\n\t\tif n % d != 0:\n\t\t\td += 1\n\t\t\tcontinue\n\t\tn = n // d\n\t\tc += 1 \n\t\tif c == k - 1:\n\t\t\tlst.append(d)\n\t\t\tlst.append(n)\n\t\t\tbreak\n\t\tlst.append(d)\n\n\n\n\tif len(lst) < k:\n\t\tprint(-1)\n\telif 1 in lst:\n\t\tprint(-1)\n\telse:\n\t\tprint(lst)\n\n\n\n\t\t \t\t\t \t\t\t \t\t \t \t\t \t", "n,k=map(int,input().split())\r\nfactors=[]\r\nd=2\r\ntemp=n\r\nwhile n!=1:\r\n while n%d==0:\r\n factors.append(d)\r\n n=n//d\r\n d+=1\r\nif len(factors)<k:\r\n print(-1)\r\nelse:\r\n while k>1:\r\n print(factors.pop(0),end=\" \")\r\n k-=1\r\n ans=1\r\n for i in range(len(factors)):\r\n ans=ansfactors[i]\r\n print(ans)\r\n print('\\r')\r\n \r\n \r\n \r\n", "maxn = 100005\r\nsm= list(range(maxn))\r\nfor i in range(2,maxn):\r\n if sm[i]==i:\r\n for j in range(i2,maxn,i):\r\n sm[j] = min(sm[j],i)\r\nn,k = map(int,input().split())\r\n\r\nans = []\r\ntn = n\r\nwhile sm[tn]!=tn:\r\n ans.append(sm[tn])\r\n tn//=sm[tn]\r\nans.append(tn)\r\nif len(ans)<k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(ans[i],end=' ')\r\n n//= ans[i]\r\n print(n,end=' ')\r\n", "n,k=map(int,input().split())\r\nlis=[]\r\nfor i in range(2,n+1):\r\n\tif not n%i:\r\n\t\twhile not n%i and len(lis)<k-1:\r\n\t\t\tlis.append(i)\r\n\t\t\tn//=i\r\nif n>1:lis.append(n)\r\nif k==len(lis):print(lis)\r\nelse:print(-1)", "import sys\r\nfrom functools import reduce\r\nI=sys.stdin.readline\r\n\r\nn,k=map(int,I().split())\r\n\r\narr=[]\r\n\r\nfor i in range(2,int(n*.5)+1):\r\n\tif n%i==0:\r\n\t\twhile n%i==0:\r\n\t\t\tarr.append(i)\r\n\t\t\tn//=i\r\n\r\n\r\n\r\nif n>1:\r\n\tarr.append(n)\r\n\r\nif k>len(arr):\r\n\tprint(-1)\r\nelse:\r\n\tres=reduce((lambda x, y: x y), arr[k-1:]) \r\n\tprint(arr[:k-1],res)", "def _factors(n, k, d=2):\n root = int(n * 0.5) + 1\n while n > 1:\n if d > root or k == 1:\n yield n\n break\n n1, n2 = divmod(n, d)\n if n2:\n d += 1\n else:\n yield d\n k -= 1\n n = n1\n\n\nN, K = map(int, input().split())\nfactors = list(_factors(N, K))\nif len(factors) != K:\n print(-1)\nelse:\n print(factors)\n# Sun Nov 12 2023 22:47:00 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin, stdout\n\ndef readline():\n return stdin.readline()\n\ndef writeline(s):\n stdout.write(s+\"\\n\")\n\nn, k = map(int, readline().split())\n\nN = 100001\nps = [True] N\nfor i in range(3, int(N*.5)+1, 2):\n if ps[i]:\n for j in range(ii, N, i):\n ps[j] = False\nprimes = [2] + [i for i in range(3, N, 2) if ps[i]]\n# print(primes)\n\ni = 0\nresult = []\nwhile n > 1 and i < len(primes):\n p = primes[i]\n if n % p == 0:\n n /= p\n result.append(p)\n else:\n i += 1\n\nif len(result) < k:\n result = [-1]\nelif len(result) > k:\n extra = len(result) - k\n for _ in range(extra):\n last = result.pop() \n result[-1] = last\n\nwriteline(\" \".join(str(x) for x in result))\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport math\r\ndef fact(n):\r\n a = []\r\n while n%2==0:\r\n a += [2]\r\n n /= 2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n while n%i==0:\r\n a += [i]\r\n n /= i\r\n if n>2:\r\n a += [int(n)]\r\n return a\r\nn,k = map(int,input().split())\r\nl = fact(n)\r\nif len(l)<k:\r\n print(-1)\r\nelse:\r\n while len(l)>k:\r\n x = l.pop(0)\r\n l[0] = l[0]x\r\n print(l)\r\n", "def DemC(n):\r\n dem=0\r\n for i in range(2,n):\r\n while n%i==0:\r\n dem+=1\r\n n/=i\r\n return dem\r\ndef In(n,m):\r\n var=1\r\n for i in range(2,n):\r\n while n%i==0 and m!=1:\r\n m-=1\r\n print(i,end=\" \")\r\n n/=i\r\n print(int(n))\r\nn,m=map(int,input().split())\r\nif m==1:\r\n print(n)\r\nelse:\r\n cnt=DemC(n)\r\n if m<=cnt:\r\n In(n,m)\r\n else:\r\n print(-1)\r\n", "n , k = map(int,input().split())\r\nl = []\r\nwhile n != 1:\r\n i = 2\r\n while ii <= n:\r\n if n % i == 0:\r\n l.append(i)\r\n n //= i\r\n break\r\n i += 1\r\n else:\r\n l.append(n)\r\n n = 1\r\nif len(l) < k:\r\n print(-1)\r\nelse:\r\n if len(l) == k:\r\n print(l)\r\n else:\r\n for i in range(k-1):\r\n print(l[i],end=\" \")\r\n ans = 1\r\n for i in range(k-1,len(l)):\r\n ans = l[i]\r\n print(ans)", "\nfrom math import sqrt, ceil\n\n# inp = lambda :list(map(int, input().split()))\n\nn, k = list(map(int, input().split()))\n\nres = []\no = 1\nl = n\nt = 0\ni = 2\nwhile i < ceil(sqrt(n))+1 and t < k-1:\n if not n%i:\n t += 1\n o = i\n n //= i\n res.append(i)\n else:\n i += 1\n\nif l%o or l == o or t < k - 1:\n print(-1)\nelse:\n res.append(l//o)\n print(' '.join([str(i) for i in res]))", "def function(num):\r\n for i in range(2, num+1):\r\n if num%i == 0:\r\n return i\r\n\r\n\r\nline = input().split(\" \")\r\nn = int(line[0])\r\nk = int(line[1])\r\n\r\narr = []\r\na = 0\r\nwhile True:\r\n a = int(function(n))\r\n if a == n:\r\n arr.append(a)\r\n break\r\n n //= a\r\n arr.append(a)\r\n\r\nif len(arr) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k - 1):\r\n print(arr[i],end=\" \")\r\n product = 1\r\n for i in range(k-1, len(arr)):\r\n product = arr[i]\r\n print(product)\r\n", "from math import sqrt\r\n\r\n\r\nn, k = map(int, input().split())\r\ndivs = []\r\nfor i in range(2, n + 1):\r\n while n % i == 0:\r\n n //= i\r\n divs.append(i)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() * divs.pop())\r\n print(divs)\r\n", "def sol(n, k):\n fact = []\n i = 2\n while i <= n:\n while n % i == 0:\n fact.append(i)\n n //= i\n i += 1\n\n if len(fact) < k:\n print(\"-1\")\n else:\n while len(fact) > k:\n m = len(fact)\n fact[m - 2] = fact[m - 1]\n fact.pop()\n\n for i in fact:\n print(i, end=\" \")\n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n sol(n, k)\n\n\t \t\t \t\t\t \t\t\t \t\t\t", "# LUOGU_RID: 101671566\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(2, int(n*.5) + 1):\r\n while n % i == 0:\r\n n //= i\r\n a += i,\r\nif n > 1:\r\n a += n,\r\nif len(a) < k:\r\n exit(print(-1))\r\nfor x in a[k:]:\r\n a[k - 1] = x\r\nprint(a[:k])", "import math\nimport functools\ndef factors(n):\n factorsList = []\n j = 2\n while n > 1:\n for i in range(j, int(math.sqrt(n+0.05)) + 1):\n if n % i == 0:\n n //= i ; j = i\n factorsList.append(i)\n break\n else:\n if n > 1:\n factorsList.append(n); \n break\n return factorsList\n\nn,k = map(int, input().split(' '))\n\nc = factors(n)\nif (len(c) < k):\n print (\"-1\")\n exit()\nelse:\n while(len(c) > k):\n c[0:2] = [functools.reduce(lambda x, y: xy, c[0:2])]\nprint(c)\n \t\t \t \t\t \t \t\t\t \t \t", "def findfactors(n,k):\r\n arr=[]\r\n for i in range(2,n):\r\n if(ii>n):\r\n break\r\n while(n%i==0):\r\n if(len(arr)==k-1):\r\n break\r\n n=n//i\r\n arr.append(i)\r\n if(len(arr)==k-1):\r\n break\r\n if(n>1):\r\n arr.append(n)\r\n return(arr)\r\na,b=map(int, input().split())\r\narr=findfactors(a,b)\r\nif(len(arr)==b):\r\n print(arr)\r\nelse:\r\n print(-1)\r\n", "import math\r\n\r\nn,k = [int(x) for x in input().split() ]\r\n\r\nfctrs = []\r\n\r\n\r\nwhile n%2 == 0:\r\n n //= 2\r\n fctrs.append(2)\r\n\r\n\r\nfor i in range( 3, math.ceil(math.sqrt(n)+2), 2 ):\r\n\r\n while n%i == 0:\r\n\r\n n //= i\r\n fctrs.append(i)\r\n\r\nif n > 2:\r\n fctrs.append(n)\r\n \r\nif len(fctrs) < k:\r\n print( -1 )\r\nelif len(fctrs ) == k:\r\n print( \" \".join([ str(x) for x in fctrs ]) )\r\nelse:\r\n\r\n newF = []\r\n\r\n v = 1\r\n for i in range(0, len(fctrs)-k+1):\r\n v = fctrs[i]\r\n\r\n print( v, \" \".join( [str(x) for x in fctrs[len(fctrs)-k+1:] ] ) )\r\n", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(2, n+1):\r\n if n%i == 0:\r\n while n%i == 0 and len(a) <k-1:\r\n n//=i\r\n a.append(i)\r\nif n>1:\r\n a.append(n)\r\nif len(a) == k:\r\n print(a)\r\nelse:\r\n print(-1)", "a = list()\r\nn, k = map(int, input().split())\r\np = 2\r\nwhile n > 1 and pp <= n:\r\n if n % p == 0:\r\n a.append(p)\r\n n //= p\r\n else:\r\n p += 1\r\nif n != 1:\r\n a.append(n)\r\nif len(a) < k:\r\n print(\"-1\")\r\nelse:\r\n b = a[k-1:]\r\n c = 1\r\n for i in b:\r\n c = i\r\n a = a[:k-1]\r\n for i in a:\r\n print(i, end=' ')\r\n print(c)", "n, k = list(map(int, input().split()))\naux = 2\n\nl = []\n\nif 2k <= n:\n\tfor i in range(k-1):\n\t\twhile aux < n:\n\t\t\tif n % aux == 0:\n\t\t\t\tl.append(aux)\n\t\t\t\tn = n // aux\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tif aux % 2 == 0:\n\t\t\t\t\taux += 1\n\t\t\t\telse:\n\t\t\t\t\taux += 2\n\tl.append(n)\n\nif len(l) == k:\n\tfor i in range(k-1):\n\t\tprint(l[i], end=\" \")\n\tprint(l[k-1])\nelse:\n\tprint(\"-1\")\n\t \t \t\t \t \t \t\t \t \t\t \t \t\t", "\na,b = map(int, input().split())\ndef Factor(n):\n Ans = []\n d = 2\n while d d <= n:\n if n % d == 0:\n Ans.append(d)\n n //= d\n else:\n d += 1\n if n > 1:\n Ans.append(n)\n return Ans\nf = Factor(a)\nwhile len(f)>b:\n f[0] = f[0]f[1]\n f.pop(1)\nif len(f)<b:\n print(-1)\nelse:\n for i in range(len(f)):\n print(f[i],end=' ')\n", "\r\n\r\n# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef prime_factors(n):\r\n a = []\r\n while n%2==0:\r\n n//=2\r\n a.append(2)\r\n for i in range(3,int(sqrt(n)+1),2):\r\n while n%i==0:\r\n n//=i\r\n a.append(i)\r\n\r\n if n>2:\r\n a.append(n)\r\n return a\r\n\r\ndef solve():\r\n x = prime_factors(n)\r\n if len(x)<k:\r\n print(-1)\r\n return\r\n\r\n ans = x[:k-1]\r\n\r\n pro = 1\r\n for i in range(k-1,len(x)):\r\n pro=x[i]\r\n\r\n if pro>1:\r\n ans+=[pro]\r\n\r\n print(ans)\r\n\r\nif __name__=='__main__':\r\n n,k = map(int,input().split())\r\n solve()", "import sys\r\n\r\nn, k = map(int, input().split())\r\n\r\nans = []\r\nd = 2\r\nfor _ in range(k-1):\r\n while d < n and n % d:\r\n d += 1\r\n ans.append(d)\r\n n //= d\r\n\r\nif n > 1:\r\n print((ans + [n]))\r\nelse:\r\n print(-1)\r\n", "n, k = list(map(int, input().split()))\n\nd = 2\nfc = 0\nl = []\n\nif k == 1:\n\tprint(n)\nelse:\n\twhile n > 1 and fc < k:\n\n\t\twhile n%d != 0:\n\t\t\td += 1\n\n\t\tn = n//d\n\t\tfc += 1\n\t\tl.append(d)\n\n\t\t#print(n, d)\n\n\t\td = 2\n\n\t\tif fc == k - 1:\n\t\t\tif n == 1:\n\t\t\t\tprint(-1)\n\t\t\t\texit()\n\t\t\telse:\n\t\t\t\tl.append(n)\n\t\t\t\tbreak\n\n\tif len(l) < k:\n\t\tprint(-1)\n\telse:\n\t\tfor i in l:\n\t\t\tprint(i, end=' ')", "import math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n collector = []\r\n n_can_not_be_divided = False\r\n n_is_less = False\r\n while counter < k:\r\n if n == 1:\r\n n_is_less = True\r\n break\r\n if counter == k - 1:\r\n if n != 1:\r\n counter += 1\r\n collector.append(str(n))\r\n break\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n n //= i\r\n counter += 1\r\n collector.append(str(i))\r\n break\r\n if n_is_less:\r\n print(-1)\r\n else:\r\n print(\" \".join(collector))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import sys\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\ncnt = 0\r\nres = []\r\nwhile n > 1:\r\n if cnt == k - 1:\r\n break\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n res.append(i)\r\n cnt += 1\r\n n //= i\r\n break\r\n\r\nif n > 1:\r\n res.append(n)\r\nif len(res) != k:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str, res)))", "inp = list(map(int, input().split()))\nn = inp[0]\nk = inp[1]\nmas = []\nfor i in range(2, n+1):\n\twhile n%i == 0:\n\t\tmas.append(i)\n\t\tn = n // i\nif len(mas) < k:\n\tprint(-1)\nelse:\n\twhile len(mas) > k:\n\t\tmas[0] = mas[0] * mas[1]\n\t\tmas.remove(mas[1])\n\tfor i in mas:\n\t\tprint(i, end = ' ')\n\n\n\n# Wed Jan 05 2022 10:24:30 GMT+0000 (Coordinated Universal Time)\n", "\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\ndef get_input():\r\n input_str = stdin.read().strip().split(' ')\r\n\r\n n, k = input_str\r\n\r\n return int(n), int(k)\r\n\r\n\r\ndef get_nums(n, k):\r\n is_prime = [True] * (n + 1)\r\n\r\n for i in range(2, n + 1):\r\n if not is_prime[i]:\r\n continue\r\n\r\n for j in range(i * i, n + 1, i):\r\n is_prime[j] = False\r\n\r\n factors = []\r\n\r\n for i in range(2, n + 1):\r\n if not is_prime[i]:\r\n continue\r\n\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n\r\n if len(factors) < k:\r\n return [-1]\r\n\r\n while len(factors) > k:\r\n last = factors.pop()\r\n factors[-1] = last\r\n\r\n return factors\r\n\r\nprint(' '.join(map(str, get_nums(get_input()))))\r\n", "n, h = map(int, input().split())\ni = 2\na = []\nwhile i * i <= n:\n while n % i == 0:\n a.append(i)\n n = n // i\n i = i + 1\nif n > 1:\n a.append(n)\nif len(a) < h:\n print(-1)\nelse:\n while len(a) > h:\n h1 = a[0] * a[1]\n a.remove(a[0])\n a[0] = h1\n print(a)\n# Mon Jul 11 2022 09:46:25 GMT+0000 (Coordinated Universal Time)\n", "def k_factorize(n,k):\r\n factors = []\r\n orig = n\r\n d = 2\r\n while dd <= orig and n>1 and len(factors)<(k-1):\r\n while n%d == 0 and len(factors)<(k-1):\r\n factors.append(d)\r\n n//=d\r\n d +=1\r\n if n>1:\r\n factors.append(n)\r\n return factors\r\nn,k = map(int,input().split())\r\nans = k_factorize(n,k)\r\nif len(ans) != k:\r\n print(-1)\r\nelse:\r\n print(k_factorize(n,k))", "n,k=[int(e) for e in input().split()]\r\na=[]\r\ni=2\r\nwhile ii<=n:\r\n while n%i==0:\r\n n//=i\r\n a.append(i)\r\n i+=1\r\nif n!=1:\r\n a.append(n)\r\ndef prod(a):\r\n res=1\r\n for e in a:\r\n res=e\r\n return res\r\nif len(a)>=k:\r\n print((a[:k-1]+[prod(a[k-1:])]))\r\nelse:\r\n print(-1)", "n,k = map(int,input().split())\r\nmn=[]\r\nd=2\r\nwhile dd<=n:\r\n while n%d==0:\r\n mn.append(d)\r\n n=n//d\r\n d+=1\r\nif n>1: mn.append(n)\r\nif len(mn)<k: print(-1)\r\nelif len(mn)==k: print(mn)\r\nelse:\r\n for i in range(k-1):\r\n print(mn[i],end=\" \")\r\n p=1\r\n for i in range(k-1,len(mn)):\r\n p=pmn[i]\r\n print(p)\r\n \r\n\n# Wed Jan 05 2022 09:25:49 GMT+0000 (Coordinated Universal Time)\n", "\r\ndef pd(n):\r\n arr = []\r\n i = 2\r\n while n != 1:\r\n while n % i == 0:\r\n arr.append(i)\r\n n //= i\r\n i += 1\r\n return arr\r\n\r\nn, k = map(int, input().split())\r\ndivs = pd(n)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() divs.pop())\r\n print(divs)", "n,k = map(int, input().split())\nkq = []\nimport math\nfor i in range(2,math.isqrt(n)+1):\n while n%i == 0:\n n //= i\n kq.append(i)\nif n > 1:\n kq.append(n)\nif len(kq)<k:\n print(-1)\nelse:\n if len(kq) == k:\n print(kq)\n else:\n print(kq[:k-1],end=' ')\n d = 1\n for i in range(k-1,len(kq)):\n d = dkq[i]\n print(d)\n\t \t\t\t \t\t\t\t \t\t \t \t\t\t \t \t\t", "def primes_method5(number):\r\n out = list()\r\n sieve = [True] * (number+1)\r\n for p in range(2, number+1):\r\n if (sieve[p] and sieve[p]%2==1):\r\n out.append(p)\r\n for i in range(p, number+1, p):\r\n sieve[i] = False\r\n return out\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nprimes = primes_method5(n)\r\ndivisors = []\r\nindex = 0\r\nwhile n >= 2:\r\n prime = primes[index]\r\n if n % prime == 0:\r\n divisors.append(prime)\r\n n //= prime\r\n else:\r\n index += 1\r\nif len(divisors) < k:\r\n print(-1)\r\nelse:\r\n last = 1\r\n for d in divisors[k-1:]:\r\n last = d\r\n print(divisors[:k-1], last)\r\n\r\n", "def rozloz(n):\r\n wynik = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n wynik.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n wynik.append(n)\r\n return wynik\r\n[n,k]=[int(x) for x in input().split()]\r\nh=rozloz(n)\r\nif len(h)<k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(h[i],end=\" \")\r\n l=1\r\n for i in range(k-1,len(h)):\r\n l=h[i]\r\n print(l)\r\n", "import math\r\nn,k=map(int,input().split())\r\nif k==1:\r\n print(n)\r\n exit()\r\nx=n\r\nls=[]\r\nwhile len(ls)<k-1:\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if x%i==0:\r\n ls.append(i)\r\n x//=i\r\n break\r\n else:\r\n print(-1)\r\n break\r\n if len(ls)==k-1:\r\n ls.append(x)\r\n break\r\nif len(ls)==k:\r\n print(ls)", "m,k=map(int,input().split())\r\nn=m\r\nx=[]\r\nfor i in range(k-1):\r\n for j in range(2,n):\r\n if n%j==0:\r\n x.append(j)\r\n n//=j\r\n break\r\np=1\r\nfor i in range(len(x)):\r\n p=x[i]\r\nif pn==m and len(x)+1==k: print(x,n)\r\nelse: print(-1)", "l, k = (int(i) for i in input().split())\r\n\r\ndziel = []\r\nd = 2\r\nwhile d d <= l:\r\n while l % d == 0:\r\n dziel.append(d)\r\n l //= d\r\n d += 1\r\n\r\nif l > 1:\r\n dziel.append(l)\r\n\r\nif len(dziel) < k:\r\n print(-1)\r\nelse:\r\n while len(dziel) != k:\r\n dziel[0] = dziel[1]\r\n del(dziel[1])\r\n for i in dziel:\r\n print(i)", "import sys\r\nn,k=map(int, input().split())\r\nx=n\r\nprimes=[]\r\ni=2\r\nwhile ii<=n:\r\n if n%i==0:\r\n while(n%i==0):\r\n n=n//i\r\n primes.append(i)\r\n i+=1\r\nif n>1:\r\n primes.append(n);\r\nif k>len(primes):\r\n print(\"-1\")\r\n sys.exit()\r\ni=0\r\nk-=1\r\nwhile k:\r\n print(primes[i],end=\" \")\r\n i+=1\r\n k-=1\r\nresult=1\r\nwhile i!=len(primes):\r\n result=resultprimes[i]\r\n i+=1\r\nprint(result)", "a, b = map(int, input().split())\r\n\r\n\r\ndef fact(a):\r\n output = []\r\n c = 2\r\n while c * 2 <= a:\r\n if a % c == 0:\r\n output.append(c)\r\n a //= c\r\n else:\r\n c += 1\r\n if a > 1:\r\n output.append(a)\r\n return output\r\n\r\n\r\nm = fact(a)\r\n\r\nwhile b < len(m):\r\n m[0] = m[0] * m[1]\r\n m.pop(1)\r\n\r\nif len(m) < b:\r\n print(-1)\r\nelse:\r\n print([i for i in m])\r\n", "def k_factorization(n, k, mlpts):\r\n if k == 1:\r\n return mlpts + [n]\r\n for d in range(2, round(n0.5)+1):\r\n if n % d == 0:\r\n mlpts.append(d)\r\n return k_factorization(n//d, k-1, mlpts)\r\n return [-1]\r\n\r\n\r\nn, k = map(int, input().split())\r\nprint(k_factorization(n, k, []))\r\n", "#Name:S.M.MILOY\n#Department Of CSE,BRUR\n#a,b=list(map(int,input().split()))\n#l=list(map(int,input().split(' ')))\n#n=int(z())\nz=input\n#for i in range(n):\n\nn,k=map(int,z().split())\nl=[]\nfor i in range(2,n+1):\n\tif n%i==0:\n\t\twhile n%i==0 and len(l)<(k-1):\n\t\t\tn//=i\n\t\t\tl.append(i)\nif n>1:\n\tl.append(n)\nif len(l)==k:\n\tprint(l)\nelse:\n\tprint(-1)\n\n \t \t\t\t \t \t\t\t \t \t\t\t\t\t\t \t \t\t", "def findPrimeFactors(n):\r\n ans=[]\r\n \r\n i=2\r\n while(i<=(n+1)):\r\n while(n%i==0):\r\n ans.append(i)\r\n n=n//i\r\n \r\n i+=1\r\n \r\n return ans\r\n \r\n \r\n \r\nn,k=map(int,input().split())\r\nl=findPrimeFactors(n)\r\n\r\nif(len(l)<k):\r\n print(-1)\r\nelse:\r\n ans=1\r\n for i in l[k-1:]:\r\n ans=i\r\n print(l[:k-1],ans)\r\n \r\n ", "def check(Number):\r\n for i in range(2, int(Number * 0.5) + 1):\r\n if (Number % i == 0):\r\n return i\r\n else:\r\n return Number\r\n \r\nnums = []\r\n\r\nNumber, k = map(int, input().split())\r\n\r\nif k == 1:\r\n print(Number)\r\nelse:\r\n col = 0\r\n\r\n while Number != 1 and col < k:\r\n if col + 1 == k:\r\n nums.append(Number)\r\n\r\n col += 1\r\n\r\n break\r\n else:\r\n num = check(Number)\r\n\r\n Number //= num\r\n\r\n nums.append(num)\r\n\r\n col += 1\r\n\r\n if col > k or col < k:\r\n print(-1)\r\n else:\r\n print(nums)\n# Mon Nov 13 2023 17:32:25 GMT+0300 (Moscow Standard Time)\n", "def is_prime(n):\r\n i=2\r\n while i2 <=n:\r\n if not(n%i):\r\n return False\r\n i+=1\r\n return True\r\n\r\nn,k = map(int,input().split())\r\nnums=[]\r\n\r\ni=2\r\nf=1\r\nwhile k:\r\n if k!=1 and is_prime(n):\r\n f=0\r\n break\r\n \r\n while n%i==0 and k>1:\r\n nums.append(i)\r\n n=int(n/i)\r\n k-=1\r\n if k==1:\r\n if n==1:\r\n f=0\r\n nums.append(n)\r\n break\r\n i+=1\r\n while not is_prime(i):\r\n i+=1\r\n \r\n \r\nif not f:\r\n print(-1)\r\nelse:\r\n for num in nums:\r\n print(num,end=\" \")\r\n", "\nn, m = map(int, input().split())\nv = []\n\ni = 2\nwhile i <= n:\n if len(v) == m - 1:\n v.append(n)\n break\n if n % i == 0:\n v.append(i)\n n //= i\n else:\n i += 1\n\nif len(v) == m:\n for num in v:\n print(num, end=\" \")\nelse:\n print(-1)\n \t\t \t\t\t\t\t\t\t\t \t \t \t \t\t \t \t", "def fun(n):\r\n if n==2:\r\n return -1\r\n h=int(n0.5)+1\r\n for i in range(2,h):\r\n if n%i==0:\r\n return i\r\n return -1\r\nn,k=map(int,input().split())\r\nif k==1:\r\n print(n)\r\nelif 2k>n:\r\n print(-1)\r\nelse:\r\n l=[]\r\n f=0\r\n while k>1:\r\n if fun(n)!=-1:\r\n l.append(fun(n))\r\n n=n//fun(n)\r\n k-=1\r\n else:\r\n f=1\r\n break\r\n if f==0:\r\n if n!=1:\r\n l.append(n)\r\n print(l)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\n ", "def factorize(n):\r\n fct = [] # prime factor\r\n b, e = 2, 0 # base, exponent\r\n while b * b <= n:\r\n while n % b == 0:\r\n n = n // b\r\n e = e + 1\r\n if e > 0:\r\n fct.append((b, e))\r\n b, e = b + 1, 0\r\n if n > 1:\r\n fct.append((n, 1))\r\n return fct\r\n \r\nn, k = map(int,input().split())\r\nfact = factorize(n)\r\n\r\nans = []\r\ncnt = 0\r\nfor f, c in fact:\r\n for _ in range(c):\r\n if cnt < k:\r\n ans.append(f)\r\n else:\r\n ans[-1] = f\r\n cnt += 1\r\n\r\nif len(ans) == k:\r\n print(ans)\r\nelse:\r\n print(-1)", "def decomp(n, k):\r\n i = 2\r\n mylist = []\r\n while i * i <= n and len(mylist) < k - 1:\r\n if n % i == 0:\r\n mylist.append(i)\r\n n //= i\r\n else:\r\n i += 1\r\n mylist.append(n)\r\n return mylist\r\n\r\n\r\nn, k = map(int, input().split())\r\nresult = decomp(n, k)\r\nif len(result) == k:\r\n print(*result)\r\nelse:\r\n print(-1)\r\n" ]	{"inputs": ["100000 2", "100000 20", "1024 5", "100000 10", "99999 3", "99999 4", "99999 5", "1024 10", "1024 11", "2048 11", "2 1", "2 2", "2 3", "2 4", "2 5", "2 1", "3 1", "3 2", "349 2", "8 1", "66049 2", "6557 2", "9 2", "4 2", "2 2", "4 4", "12 1", "17 1", "8 2", "14 2", "99991 1", "30 2", "97 1", "92 2", "4 1", "4 3", "30 4", "2 6", "3 1", "3 2", "3 3", "3 4", "3 5", "3 6", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "6 1", "6 2", "6 3", "6 4", "6 5", "6 6", "7 1", "7 2", "7 3", "7 4", "7 5", "7 6", "8 1", "8 2", "8 3", "8 4", "8 5", "8 6", "9 1", "9 2", "9 3", "9 4", "9 5", "9 6", "10 1", "10 2", "10 3", "10 4", "10 5", "10 6", "11 1", "11 2", "11 3", "11 4", "11 5", "11 6", "12 1", "12 2", "12 3", "12 4", "12 5", "12 6", "13 1", "13 2", "13 3", "13 4", "13 5", "13 6", "14 1", "14 2", "14 3", "14 4", "14 5", "14 6", "15 1", "15 2", "15 3", "15 4", "15 5", "15 6", "16 1", "16 2", "16 3", "16 4", "16 5", "16 6", "17 1", "17 2", "17 3", "17 4", "17 5", "17 6", "18 1", "18 2", "18 3", "18 4", "18 5", "18 6", "19 1", "19 2", "19 3", "19 4", "19 5", "19 6", "20 1", "20 2", "20 3", "20 4", "20 5", "20 6", "94249 1", "94249 2", "94249 3", "94249 4", "94249 5", "95477 1", "95477 2", "95477 3", "95477 4", "95477 5", "35557 1", "35557 2", "35557 3", "35557 4", "35557 5", "42439 1", "42439 2", "42439 3", "42439 4", "42439 5"], "outputs": ["2 50000 ", "-1", "2 64 2 2 2 ", "2 2 2 2 2 5 5 5 5 5 ", "3 813 41 ", "3 3 41 271 ", "-1", "2 2 2 2 2 2 2 2 2 2 ", "-1", "2 2 2 2 2 2 2 2 2 2 2 ", "2 ", "-1", "-1", "-1", "-1", "2 ", "3 ", "-1", "-1", "8 ", "257 257 ", "83 79 ", "3 3 ", "2 2 ", "-1", "-1", "12 ", "17 ", "2 4 ", "7 2 ", "99991 ", "3 10 ", "97 ", "2 46 ", "4 ", "-1", "-1", "-1", "3 ", "-1", "-1", "-1", "-1", "-1", "4 ", "2 2 ", "-1", "-1", "-1", "-1", "5 ", "-1", "-1", "-1", "-1", "-1", "6 ", "3 2 ", "-1", "-1", "-1", "-1", "7 ", "-1", "-1", "-1", "-1", "-1", "8 ", "2 4 ", "2 2 2 ", "-1", "-1", "-1", "9 ", "3 3 ", "-1", "-1", "-1", "-1", "10 ", "5 2 ", "-1", "-1", "-1", "-1", "11 ", "-1", "-1", "-1", "-1", "-1", "12 ", "2 6 ", "2 2 3 ", "-1", "-1", "-1", "13 ", "-1", "-1", "-1", "-1", "-1", "14 ", "7 2 ", "-1", "-1", "-1", "-1", "15 ", "5 3 ", "-1", "-1", "-1", "-1", "16 ", "2 8 ", "2 4 2 ", "2 2 2 2 ", "-1", "-1", "17 ", "-1", "-1", "-1", "-1", "-1", "18 ", "3 6 ", "3 2 3 ", "-1", "-1", "-1", "19 ", "-1", "-1", "-1", "-1", "-1", "20 ", "2 10 ", "2 2 5 ", "-1", "-1", "-1", "94249 ", "307 307 ", "-1", "-1", "-1", "95477 ", "311 307 ", "-1", "-1", "-1", "35557 ", "31 1147 ", "31 31 37 ", "-1", "-1", "42439 ", "37 1147 ", "37 31 37 ", "-1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	96
d1f7ca2f5bc4490ad9a2954490f49833	Tidying Up	Smart Beaver is careful about his appearance and pays special attention to shoes so he has a huge number of pairs of shoes from the most famous brands of the forest. He's trying to handle his shoes carefully so that each pair stood side by side. But by the end of the week because of his very active lifestyle in his dressing room becomes a mess. Smart Beaver from ABBYY is not only the brightest beaver in the area, but he also is the most domestically oriented. For example, on Mondays the Smart Beaver cleans everything in his home. It's Monday morning. Smart Beaver does not want to spend the whole day cleaning, besides, there is much in to do and it’s the gym day, so he wants to clean up as soon as possible. Now the floors are washed, the dust is wiped off — it’s time to clean up in the dressing room. But as soon as the Smart Beaver entered the dressing room, all plans for the day were suddenly destroyed: chaos reigned there and it seemed impossible to handle, even in a week. Give our hero some hope: tell him what is the minimum number of shoes need to change the position to make the dressing room neat. The dressing room is rectangular and is divided into n<=×<=m equal squares, each square contains exactly one shoe. Each pair of shoes has a unique number that is integer from 1 to , more formally, a square with coordinates (i,<=j) contains an integer number of the pair which is lying on it. The Smart Beaver believes that the dressing room is neat only when each pair of sneakers lies together. We assume that the pair of sneakers in squares (i1,<=j1) and (i2,<=j2) lies together if \|i1<=-<=i2\|<=+<=\|j1<=-<=j2\|<==<=1. The first line contains two space-separated integers n and m. They correspond to the dressing room size. Next n lines contain m space-separated integers each. Those numbers describe the dressing room. Each number corresponds to a snicker. It is guaranteed that: - n·m is even. - All numbers, corresponding to the numbers of pairs of shoes in the dressing room, will lie between 1 and . - Each number from 1 to will occur exactly twice. The input limits for scoring 30 points are (subproblem C1): - 2<=≤<=n,<=m<=≤<=8. The input limits for scoring 100 points are (subproblems C1+C2): - 2<=≤<=n,<=m<=≤<=80. Print exactly one integer — the minimum number of the sneakers that need to change their location. Sample Input 2 3 1 1 2 2 3 3 3 4 1 3 2 6 2 1 5 6 4 4 5 3 Sample Output 2 4	[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\nfrom typing import NamedTuple, Optional, List, Tuple, cast\r\n\r\nclass MCFGraph:\r\n class Edge(NamedTuple):\r\n src: int\r\n dst: int\r\n cap: int\r\n flow: int\r\n cost: int\r\n\r\n class _Edge:\r\n def __init__(self, dst: int, cap: int, cost: int) -> None:\r\n self.dst = dst\r\n self.cap = cap\r\n self.cost = cost\r\n self.rev: Optional[MCFGraph._Edge] = None\r\n\r\n def __init__(self, n: int) -> None:\r\n self._n = n\r\n self._g: List[List[MCFGraph._Edge]] = [[] for _ in range(n)]\r\n self._edges: List[MCFGraph._Edge] = []\r\n\r\n def add_edge(self, src: int, dst: int, cap: int, cost: int) -> int:\r\n assert 0 <= src < self._n\r\n assert 0 <= dst < self._n\r\n assert 0 <= cap\r\n m = len(self._edges)\r\n e = MCFGraph._Edge(dst, cap, cost)\r\n re = MCFGraph._Edge(src, 0, -cost)\r\n e.rev = re\r\n re.rev = e\r\n self._g[src].append(e)\r\n self._g[dst].append(re)\r\n self._edges.append(e)\r\n return m\r\n\r\n def get_edge(self, i: int) -> Edge:\r\n assert 0 <= i < len(self._edges)\r\n e = self._edges[i]\r\n re = cast(MCFGraph._Edge, e.rev)\r\n return MCFGraph.Edge(\r\n re.dst,\r\n e.dst,\r\n e.cap + re.cap,\r\n re.cap,\r\n e.cost\r\n )\r\n\r\n def edges(self) -> List[Edge]:\r\n return [self.get_edge(i) for i in range(len(self._edges))]\r\n\r\n def flow(self, s: int, t: int,\r\n flow_limit: Optional[int] = None) -> Tuple[int, int]:\r\n return self.slope(s, t, flow_limit)[-1]\r\n\r\n def slope(self, s: int, t: int,\r\n flow_limit: Optional[int] = None) -> List[Tuple[int, int]]:\r\n assert 0 <= s < self._n\r\n assert 0 <= t < self._n\r\n assert s != t\r\n if flow_limit is None:\r\n flow_limit = cast(int, sum(e.cap for e in self._g[s]))\r\n\r\n dual = [0] * self._n\r\n prev: List[Optional[Tuple[int, MCFGraph._Edge]]] = [None] * self._n\r\n\r\n def refine_dual() -> bool:\r\n pq = [(0, s)]\r\n visited = [False] * self._n\r\n dist: List[Optional[int]] = [None] * self._n\r\n dist[s] = 0\r\n while pq:\r\n dist_v, v = heapq.heappop(pq)\r\n if visited[v]:\r\n continue\r\n visited[v] = True\r\n if v == t:\r\n break\r\n dual_v = dual[v]\r\n for e in self._g[v]:\r\n w = e.dst\r\n if visited[w] or e.cap == 0:\r\n continue\r\n reduced_cost = e.cost - dual[w] + dual_v\r\n new_dist = dist_v + reduced_cost\r\n dist_w = dist[w]\r\n if dist_w is None or new_dist < dist_w:\r\n dist[w] = new_dist\r\n prev[w] = v, e\r\n heapq.heappush(pq, (new_dist, w))\r\n else:\r\n return False\r\n dist_t = dist[t]\r\n for v in range(self._n):\r\n if visited[v]:\r\n dual[v] -= cast(int, dist_t) - cast(int, dist[v])\r\n return True\r\n\r\n flow = 0\r\n cost = 0\r\n prev_cost_per_flow: Optional[int] = None\r\n result = [(flow, cost)]\r\n while flow < flow_limit:\r\n if not refine_dual():\r\n break\r\n f = flow_limit - flow\r\n v = t\r\n while prev[v] is not None:\r\n u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])\r\n f = min(f, e.cap)\r\n v = u\r\n v = t\r\n while prev[v] is not None:\r\n u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])\r\n e.cap -= f\r\n assert e.rev is not None\r\n e.rev.cap += f\r\n v = u\r\n c = -dual[s]\r\n flow += f\r\n cost += f * c\r\n if c == prev_cost_per_flow:\r\n result.pop()\r\n result.append((flow, cost))\r\n prev_cost_per_flow = c\r\n return result\r\n\r\nN,M=map(int,readline().split())\r\nS=[list(map(int,readline().split())) for i in range(N)]\r\nMCFG=MCFGraph(NM+2)\r\ns=0\r\nt=NM+1\r\nfor i in range(N):\r\n for j in range(M):\r\n if i%2==j%2:\r\n MCFG.add_edge(s,iM+j+1,1,0)\r\n for di,dj in ((0,1),(0,-1),(1,0),(-1,0)):\r\n if 0<=i+di<=N-1 and 0<=j+dj<=M-1:\r\n if S[i][j]==S[i+di][j+dj]:\r\n MCFG.add_edge(iM+j+1,(i+di)M+j+dj+1,1,0)\r\n else:\r\n MCFG.add_edge(iM+j+1,(i+di)M+j+dj+1,1,1)\r\n else:\r\n MCFG.add_edge(iM+j+1,t,1,0)\r\nans=MCFG.flow(s,t)[1]\r\nprint(ans)" ]	{"inputs": ["2 3\n1 1 2\n2 3 3", "3 4\n1 3 2 6\n2 1 5 6\n4 4 5 3", "2 2\n1 2\n1 2", "2 2\n1 1\n2 2", "2 2\n2 1\n1 2", "3 4\n1 1 6 6\n2 2 4 4\n3 3 5 5", "3 4\n5 3 3 2\n6 1 4 2\n6 1 5 4", "5 4\n9 9 10 10\n7 7 5 5\n2 2 3 3\n1 1 8 8\n4 4 6 6", "4 5\n7 9 9 10 10\n7 5 5 3 3\n8 1 1 2 2\n8 6 6 4 4", "5 4\n6 4 4 3\n10 8 5 1\n10 6 5 2\n9 2 7 7\n9 8 1 3", "5 6\n7 12 1 15 3 2\n3 10 14 4 6 6\n5 11 13 8 2 9\n5 14 7 13 4 10\n11 1 12 15 9 8", "6 5\n8 12 12 15 7\n3 4 11 10 9\n15 14 2 13 10\n3 5 2 11 6\n1 5 14 1 13\n9 7 8 6 4", "6 6\n6 9 9 5 5 14\n15 15 11 18 2 10\n17 14 18 4 8 10\n17 3 1 13 8 13\n16 3 1 7 7 11\n16 4 6 2 12 12", "6 6\n2 10 10 12 18 7\n2 14 9 12 18 7\n3 3 9 16 6 6\n4 11 11 16 15 15\n4 13 1 14 17 17\n8 8 1 5 5 13", "6 7\n15 15 20 7 18 18 3\n7 16 16 12 19 19 3\n13 5 5 12 9 2 2\n13 14 4 10 9 11 14\n20 6 8 10 17 11 1\n1 6 8 4 17 21 21", "8 6\n19 19 15 11 5 5\n14 14 7 15 17 21\n16 4 8 22 24 21\n9 23 8 3 9 6\n2 10 10 13 3 6\n2 11 17 18 12 20\n13 7 1 18 12 20\n4 16 1 23 24 22", "8 8\n8 8 32 32 20 20 15 15\n14 14 7 7 9 9 2 2\n23 23 4 4 26 26 13 13\n18 18 12 12 10 10 19 19\n1 1 24 24 21 21 3 3\n6 6 28 28 22 22 29 29\n16 16 31 31 11 11 27 27\n25 25 5 5 17 17 30 30", "8 8\n19 22 3 22 11 31 10 13\n20 20 6 24 12 8 8 13\n32 10 17 30 21 27 21 5\n32 7 15 31 26 26 28 4\n30 7 15 5 25 12 1 16\n17 23 28 16 2 27 1 23\n29 9 9 6 2 19 29 4\n3 25 18 18 14 14 24 11", "8 8\n29 26 26 2 12 12 6 27\n4 4 29 2 5 13 1 16\n21 25 11 18 18 13 1 28\n19 9 9 21 24 17 7 7\n10 10 32 32 15 17 16 3\n31 24 6 30 15 20 28 27\n22 30 23 23 14 20 5 19\n11 25 31 3 14 22 8 8", "8 8\n1 1 31 17 19 19 11 27\n28 6 18 21 21 30 27 2\n20 20 18 17 8 30 28 2\n15 15 10 10 8 29 22 3\n23 13 16 7 7 29 25 3\n23 13 32 5 6 25 26 26\n12 12 32 14 14 9 9 24\n22 11 16 4 4 31 5 24", "8 8\n9 32 32 8 8 30 16 25\n9 10 10 4 4 26 17 30\n21 24 24 11 5 26 27 15\n21 20 20 31 14 14 27 15\n28 25 2 3 1 23 23 31\n28 11 2 3 1 29 22 13\n7 6 6 19 19 29 22 13\n7 12 12 17 16 5 18 18", "8 8\n18 1 1 25 28 28 31 31\n18 19 19 13 24 24 4 4\n3 7 7 13 16 12 14 6\n3 26 26 17 9 12 14 6\n8 27 27 17 9 10 10 25\n8 5 30 23 23 5 20 15\n30 32 21 11 2 22 20 15\n16 32 21 11 2 22 29 29", "2 3\n1 1 2\n2 3 3"], "outputs": ["2", "4", "0", "0", "2", "0", "3", "0", "0", "6", "13", "12", "10", "5", "7", "13", "0", "21", "19", "12", "10", "6", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d21e0b3207ee3c755958cfc2ee170922	Leha and another game about graph	Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di, which can be equal to 0, 1 or <=-<=1. To pass the level, he needs to find a «good» subset of edges of the graph or say, that it doesn't exist. Subset is called «good», if by by leaving only edges from this subset in the original graph, we obtain the following: for every vertex i, di<==<=<=-<=1 or it's degree modulo 2 is equal to di. Leha wants to pass the game as soon as possible and ask you to help him. In case of multiple correct answers, print any of them. The first line contains two integers n, m (1<=≤<=n<=≤<=3·105, n<=-<=1<=≤<=m<=≤<=3·105) — number of vertices and edges. The second line contains n integers d1,<=d2,<=...,<=dn (<=-<=1<=≤<=di<=≤<=1) — numbers on the vertices. Each of the next m lines contains two integers u and v (1<=≤<=u,<=v<=≤<=n) — edges. It's guaranteed, that graph in the input is connected. Print <=-<=1 in a single line, if solution doesn't exist. Otherwise in the first line k — number of edges in a subset. In the next k lines indexes of edges. Edges are numerated in order as they are given in the input, starting from 1. Sample Input 1 0 1 4 5 0 0 0 -1 1 2 2 3 3 4 1 4 2 4 2 1 1 1 1 2 3 3 0 -1 1 1 2 2 3 1 3 Sample Output -1 0 1 1 1 2	[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\nclass Graph:\r\n def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float(\"inf\")):\r\n self.V=V\r\n self.directed=directed\r\n self.weighted=weighted\r\n self.inf=inf\r\n if graph:\r\n self.graph=graph\r\n self.edges=[]\r\n for i in range(self.V):\r\n if self.weighted:\r\n for j,d in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j,d))\r\n else:\r\n for j in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j))\r\n else:\r\n self.edges=edges\r\n self.graph=[[] for i in range(self.V)]\r\n if weighted:\r\n for i,j,d in self.edges:\r\n self.graph[i].append((j,d))\r\n if not self.directed:\r\n self.graph[j].append((i,d))\r\n else:\r\n for i,j in self.edges:\r\n self.graph[i].append(j)\r\n if not self.directed:\r\n self.graph[j].append(i)\r\n\r\n def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):\r\n seen=[False]self.V\r\n finished=[False]self.V\r\n if directed_acyclic or cycle_detection or topological_sort:\r\n dag=True\r\n if euler_tour:\r\n et=[]\r\n if linked_components:\r\n lc=[]\r\n if lowlink:\r\n order=[None]self.V\r\n ll=[None]self.V\r\n idx=0\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps=[None]self.V\r\n if postorder or topological_sort:\r\n post=[]\r\n if preorder:\r\n pre=[]\r\n if subtree_size:\r\n ss=[1]self.V\r\n if unweighted_dist or bipartite_graph:\r\n uwd=[self.inf]self.V\r\n uwd[s]=0\r\n if weighted_dist:\r\n wd=[self.inf]self.V\r\n wd[s]=0\r\n stack=[(s,0)] if self.weighted else [s]\r\n while stack:\r\n if self.weighted:\r\n x,d=stack.pop()\r\n else:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append((x,d) if self.weighted else x)\r\n if euler_tour:\r\n et.append(x)\r\n if linked_components:\r\n lc.append(x)\r\n if lowlink:\r\n order[x]=idx\r\n ll[x]=idx\r\n idx+=1\r\n if preorder:\r\n pre.append(x)\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if not seen[y]:\r\n stack.append((y,d) if self.weighted else y)\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps[y]=x\r\n if unweighted_dist or bipartite_graph:\r\n uwd[y]=uwd[x]+1\r\n if weighted_dist:\r\n wd[y]=wd[x]+d\r\n elif not finished[y]:\r\n if (directed_acyclic or cycle_detection or topological_sort) and dag:\r\n dag=False\r\n if cycle_detection:\r\n cd=(y,x)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if euler_tour:\r\n et.append(~x)\r\n if lowlink:\r\n bl=True\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if ps[x]==y and bl:\r\n bl=False\r\n continue\r\n ll[x]=min(ll[x],order[y])\r\n if x!=s:\r\n ll[ps[x]]=min(ll[ps[x]],ll[x])\r\n if postorder or topological_sort:\r\n post.append(x)\r\n if subtree_size:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if y==ps[x]:\r\n continue\r\n ss[x]+=ss[y]\r\n if bipartite_graph:\r\n bg=[[],[]]\r\n for tpl in self.edges:\r\n x,y=tpl[:2] if self.weighted else tpl\r\n if uwd[x]==self.inf or uwd[y]==self.inf:\r\n continue\r\n if not uwd[x]%2^uwd[y]%2:\r\n bg=False\r\n break\r\n else:\r\n for x in range(self.V):\r\n if uwd[x]==self.inf:\r\n continue\r\n bg[uwd[x]%2].append(x)\r\n retu=()\r\n if bipartite_graph:\r\n retu+=(bg,)\r\n if cycle_detection:\r\n if dag:\r\n cd=[]\r\n else:\r\n y,x=cd\r\n cd=self.Route_Restoration(y,x,ps)\r\n retu+=(cd,)\r\n if directed_acyclic:\r\n retu+=(dag,)\r\n if euler_tour:\r\n retu+=(et,)\r\n if linked_components:\r\n retu+=(lc,)\r\n if lowlink:\r\n retu=(ll,)\r\n if parents:\r\n retu+=(ps,)\r\n if postorder:\r\n retu+=(post,)\r\n if preorder:\r\n retu+=(pre,)\r\n if subtree_size:\r\n retu+=(ss,)\r\n if topological_sort:\r\n if dag:\r\n tp_sort=post[::-1]\r\n else:\r\n tp_sort=[]\r\n retu+=(tp_sort,)\r\n if unweighted_dist:\r\n retu+=(uwd,)\r\n if weighted_dist:\r\n retu+=(wd,)\r\n if len(retu)==1:\r\n retu=retu[0]\r\n return retu\r\n\r\nN,M=map(int,readline().split())\r\nD=list(map(int,readline().split()))\r\nedges=[]\r\nidx={}\r\nfor i in range(M):\r\n u,v=map(int,readline().split())\r\n u-=1;v-=1\r\n edges.append((u,v))\r\n idx[(u,v)]=i\r\n idx[(v,u)]=i\r\nG=Graph(N,edges=edges)\r\nparents,tour=G.SIV_DFS(0,parents=True,postorder=True)\r\nif D.count(1)%2:\r\n for i in range(N):\r\n if D[i]==-1:\r\n D[i]=1\r\n break\r\nfor i in range(N):\r\n if D[i]==-1:\r\n D[i]=0\r\nif D.count(1)%2:\r\n print(-1)\r\n exit()\r\nans_lst=[]\r\nfor x in tour[:-1]:\r\n if D[x]:\r\n ans_lst.append(idx[(x,parents[x])]+1)\r\n D[x]^=1\r\n D[parents[x]]^=1\r\nprint(len(ans_lst))\r\nif ans_lst:\r\n print(*ans_lst,sep=\"\\n\")" ]	{"inputs": ["1 0\n1", "4 5\n0 0 0 -1\n1 2\n2 3\n3 4\n1 4\n2 4", "2 1\n1 1\n1 2", "3 3\n0 -1 1\n1 2\n2 3\n1 3", "10 10\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\n6 7\n8 3\n6 4\n4 2\n9 2\n5 10\n9 8\n10 7\n5 1\n6 2", "3 2\n1 0 1\n1 2\n2 3"], "outputs": ["-1", "0", "1\n1", "1\n2", "0", "2\n2\n1"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d2370e5d51e7c7104ac917dd0c1ee297	Home Numbers	The main street of Berland is a straight line with n houses built along it (n is an even number). The houses are located at both sides of the street. The houses with odd numbers are at one side of the street and are numbered from 1 to n<=-<=1 in the order from the beginning of the street to the end (in the picture: from left to right). The houses with even numbers are at the other side of the street and are numbered from 2 to n in the order from the end of the street to its beginning (in the picture: from right to left). The corresponding houses with even and odd numbers are strictly opposite each other, that is, house 1 is opposite house n, house 3 is opposite house n<=-<=2, house 5 is opposite house n<=-<=4 and so on. Vasya needs to get to house number a as quickly as possible. He starts driving from the beginning of the street and drives his car to house a. To get from the beginning of the street to houses number 1 and n, he spends exactly 1 second. He also spends exactly one second to drive the distance between two neighbouring houses. Vasya can park at any side of the road, so the distance between the beginning of the street at the houses that stand opposite one another should be considered the same. Your task is: find the minimum time Vasya needs to reach house a. The first line of the input contains two integers, n and a (1<=≤<=a<=≤<=n<=≤<=100<=000) — the number of houses on the street and the number of the house that Vasya needs to reach, correspondingly. It is guaranteed that number n is even. Print a single integer — the minimum time Vasya needs to get from the beginning of the street to house a. Sample Input 4 2 8 5 Sample Output 2 3	[ "n, a = [int(x) for x in input().split()]\r\nans = 1\r\nif a % 2 == 0:\r\n while n != a:\r\n n -= 2\r\n ans += 1\r\nelse:\r\n t = 1\r\n while t != a:\r\n t += 2\r\n ans += 1\r\nprint(ans)", "import string\r\n\r\nx = input()\r\ny = x.split(' ')\r\nn, a = list(map(lambda x: int(x), y))\r\ns = 0\r\nif a & 1 == 1:\r\n s = (a + 1) / 2\r\nelse:\r\n s = (n - a + 2) / 2\r\n\r\nprint(int(s))", "def get():\n s = input().split()\n return int(s[0]), int(s[1])\n\n\nn, a = get()\nprint(str(int(a / 2 + 1 if a % 2 == 1 else n / 2 - a / 2 + 1)))\n", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\nif a==1:\r\n print(1)\r\nelif (a % 2 != 0):\r\n print (int(((a / 2)+1)))\r\nelse:\r\n print(int(((n-a) / 2)+1))\r\n", "n,a = input().split()\r\na = int(n) - int(a) + 1 if int(a[-1])% 2 == 0 else int(a)\r\nprint((a - 1)// 2 + 1)", "a = []\r\nb = []\r\n\r\nx, y = list(map(int, input().split()))\r\naux = x\r\nfor i in range(int(x/2)):\r\n a.append(1 + i2)\r\n b.append(aux)\r\n aux -= 2\r\n\r\nif y % 2:\r\n print(a.index(y) + 1)\r\nelse:\r\n print(b.index(y) + 1)", "n, a = map(int, input().split())\nif a % 2 == 0:\n print((n-a)//2+1)\nelse:\n print(a//2+1)", "n,k=map(int,input().split())\r\nif k%2==1: print((k+1)//2)\r\nelse: print((n//2+1)-(k//2))", "n,a = map(int,input().split())\r\nif a%2==1:\r\n\tprint(a//2+1)\r\nelse:\r\n\tprint((n-a+1)//2+1)", "n = list(map(int, input().split()))\nif (n[1] % 2 == 0):\n itog = (n[0] - n[1]) / 2 + 1\nelse:\n itog = (n[1] - 1) / 2 + 1\nprint(int(itog))", "n , a = map(int, input().split())\nnhs = []\nfor i in range(1,n+1):\n nhs.append(i)\neven = [i for i in nhs if i%2==0 ]\neven.reverse()\nodd = [i for i in nhs if i%2==1]\nprint(odd.index(a)+1 if a%2==1 else even.index(a)+1)\n \t\t \t \t \t \t\t\t \t\t\t\t \t\t\t\t", "n,a = [int(x) for x in input().split()]\n\nif a%2 == 0:\n count = 0\n for i in range(n,0,-2):\n count+=1\n if a == i:\n print(count)\nelse:\n count = 0\n for i in range(1,n,2):\n count+=1\n if a == i:\n print(count)\n \t\t \t\t\t\t \t \t\t \t \t \t\t \t \t", "n,k=(int(z) for z in input().split())\r\ni=1\r\nt=1\r\nwhile i!=k and n+1-i!=k:\r\n\tt+=1\r\n\ti+=2\r\nprint(t)", "n,a=map(int, input().split())\r\nprint(int((a+1)/2 if a%2==1 else (n-a+2)/2))", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\n\r\nprint(n//2-a//2+1 if a%2 == 0 else a//2+1)", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, a = [int(i) for i in input().split(\" \")]\r\n right_side = []\r\n left_side = []\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n right_side.append(i)\r\n else:left_side.append(i)\r\n left_side.reverse()\r\n if a % 2 == 0:\r\n target = left_side\r\n else:\r\n target = right_side\r\n print(target.index(a) + 1)\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n, a = map(int,input().split())\r\nk = a % 2\r\ni = 1\r\nif k == 0:\r\n na=n\r\n while na!=a:\r\n na = na-2\r\n i +=1\r\nelse:\r\n na = 1\r\n while a!=na:\r\n na += 2\r\n i+=1\r\nprint(i)\r\n", "n, a = [int(x) for x in input().split()]\r\nif a % 2 == 0:\r\n print(n // 2 - a // 2 + 1)\r\nelse:\r\n print((a + 1) // 2)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 16:32:14\nLastEditTime: 2021-11-21 16:43:26\nDescription: Home Numbers\nFilePath: CF638A.py\n'''\n\n\ndef func():\n n, a = map(int, input().strip().split())\n if a % 2 != 0:\n print(a // 2 + 1)\n else:\n print(n // 2 - a // 2 + 1)\n\n\nif __name__ == '__main__':\n func()\n ", "n,a = map(int,input().split())\r\nk = 0\r\nfor i in range(1,n,2):\r\n k+=1\r\n if i==a:\r\n print(k)\r\nk = 0\r\nfor i in range(n,1,-2):\r\n k+=1\r\n if i==a:\r\n print(k)\r\n", "def solve(n, a):\n if a&1:\n return a // 2 + 1\n return (n - a) // 2 + 1\n\nn, a = map(int, input().split())\n\nprint(solve(n, a))\n", "n, a = [int(i) for i in input().split()]\r\n\r\narray = [int(i) for i in range(1, n + 1)]\r\n\r\nmas1 =array[0:n:2]\r\nmas2 = array[n:0:-2]\r\n\r\nif a % 2 == 0:\r\n print(mas2.index(a) + 1)\r\nelse:\r\n print(mas1.index(a) + 1)", "n,a=map(int,input().split())\r\nif a%2==1: print(a//2+1)\r\nelse: print((n//2)-(a//2)+1)", "#!/usr/bin/python3\n\nn, a = map(int, input().split())\n\nif a % 2 == 1:\n\tprint(a // 2 + 1)\nelse:\n\tprint(n // 2 - a // 2 + 1)\n", "print(1 + (lambda i: (i[0] - i[1]) // 2 if i[1] % 2 == 0 else (i[1] - 1) // 2)(list(map(int, input().split()))))", "def doma(n, a):\r\n if a % 2 == 1:\r\n return (a + 1) // 2\r\n return ((n - a) // 2) + 1\r\n\r\n\r\nN, A = [int(i) for i in input().split()]\r\nprint(doma(N, A))\r\n", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\nif (a % 2 == 1): print(int(a / 2 + 1))\r\nelse: print(int(n / 2 - a / 2 + 1))", "n, a = list(map(int, input().split()))\r\n\r\nif a % 2 == 1:\r\n print(a // 2 + 1)\r\nelse:\r\n print((n - a) // 2 + 1)", "inp = list(map(int,input().split()))\r\nif inp[1]%2==0:\r\n print((inp[0]-inp[1])//2+1)\r\nelse:\r\n print((inp[1]+1)//2)\r\n", "n, k=map(int, input().split())\r\na, b=[], []\r\nfor x in range(1, n+1):\r\n if x%2==0:\r\n a.append(x)\r\n else:\r\n b.append(x)\r\na=a[::-1]\r\nans=0\r\nfor x in range(len(a)):\r\n ans+=1\r\n if k==a[x] or k==b[x]:break\r\nprint(ans)", "n,a=map(int,input().split())\r\nif a%2==0:\r\n print(1+(n-a)//2)\r\nelse:\r\n print((a+1)//2)\r\n", "n, a = map(int, input().split())\ni = 1\nj = n\nfor k in range(n):\n if i == a or j == a:\n #print(i, j)\n print(k + 1)\n exit(0)\n i += 2\n j -= 2\n", "n, a = map(int, input().split())\r\nif a % 2: ans = a // 2 + 1\r\nelse: ans = (n - a) // 2 + 1\r\nprint(ans)\r\n", "n,a=map(int,input().split())\r\nif a%2==1:\r\n print(a//2+1)\r\nelse: \r\n print((n-a) // 2 + 1)", "n, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(1 + a // 2)\r\nelse:\r\n print(1 + (n - a) // 2)", "n, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(a // 2 + 1)\r\nelse:\r\n print((n-a) // 2 + 1)", "x,y=[int(i) for i in input().split()]\r\nr=1\r\nif y % 2==0:\r\n for i in range(x,1,-2):\r\n if i==y:\r\n break\r\n else:\r\n r+=1\r\nelse:\r\n for i in range(1,x,+2):\r\n if i==y:\r\n break\r\n else:\r\n r+=1\r\nprint(r)\r\n", "n, a = map(int, input().split())\r\n\r\nif a % 2 != 0:\r\n print((a // 2) + 1)\r\nelse:\r\n print(((n - a + 1) // 2) + 1)", "x,y=[int(i) for i in input().split()]\nr=1\nif y % 2==0:\n for i in range(x,1,-2):\n if i==y:\n break\n else:\n r+=1\nelse:\n for i in range(1,x,+2):\n if i==y:\n break\n else:\n r+=1\nprint(r)\n", "inp=input()\r\na1=inp.split()\r\nn=int(a1[0])\r\na=int(a1[1])\r\nif a%2!=0:\r\n\tprint(int(1+(a-1)/2))\r\nelse:\r\n\tprint(int(1+(n-a)/2))", "n,k=map(int,input().split())\r\nif k%2==0:\r\n print(n//2-((k-2)//2))\r\nelse:\r\n print((k-1)//2+1)", "ri=lambda:map(int,input().split(' '))\r\nn,k=ri()\r\nif k%2==0:\r\n print(n//2 - k//2 + 1)\r\nelse:\r\n print((k+1)//2)", "inp = input().split()\r\nn = int(inp[0])\r\na = int(inp[1])\r\n\r\nif a % 2 != 0:\r\n print((a // 2) + 1)\r\nelse:\r\n print((n - a) // 2 + 1)\r\n", "n, a = map(int, input().split())\r\nif(a % 2 == 1):\r\n print((a+1)//2)\r\nelse:\r\n print((n//2 - a//2) + 1)", "n, a = map(int, input().split())\n\nk = 0\nif a % 2 == 1:\n\tk = (a + 1) // 2\nelse:\n\tk = (n - a) // 2 + 1\n\nprint(k)\n", "n,a=map(int,input().split())\r\nif a%2==0:\r\n s=1\r\n k=n\r\n while k!=a:\r\n s+=1\r\n k-=2\r\nelse:\r\n s=1\r\n k=1\r\n while k!=a:\r\n s+=1\r\n k+=2\r\nprint(s)\r\n", "inp=input()\npars=[]\npars=inp.split()\nn=int(pars[0])\na=int(pars[1])\nif a%2==1:\n print((a+1)//2)\nelse:\n print((n-a)//2+1)\n", "# LUOGU_RID: 101607360\nn, a = map(int, input().split())\r\nprint(((a if a % 2 else n - a + 1) + 1) // 2)", "def f(l):\r\n n,a = l\r\n return (a+1)//2 if a%2>0 else (n+2-a)//2\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "n,a=[int(x) for x in input().split()]\r\nif a&1:\r\n print(a//2+1)\r\nelse:\r\n print((n-a)//2+1)", "from sys import \nn, a = map(int, stdin.readline().split())\na = n - a + 1 if a % 2 == 0 else a\nprint((a + 1) // 2)\n", "n,a=map(int,input().split())\r\nif a%2==0:\r\n print(int((n/2)-(a/2))+1)\r\nelse:\r\n print(a//2+1)\r\n \r\n", "x=[int(a) for a in input().split()] ; n =x[0] ; lp = x[1]\r\nprint([lp//2+1,n//2-lp//2+1][lp%2==0])", "n,a=[int(x) for x in input().split()]\r\nt=0\r\nif a%2==1:\r\n t=a//2+1\r\nelse:\r\n t=n//2-a//2+1\r\nprint(t) \r\n", "n, a = map(int, input().split())\r\ni = 1\r\nc = 0\r\nif a%2 != 0:\r\n while i != a:\r\n c = c + 1\r\n i += 2\r\n print(c+1)\r\ni = n\r\nif a%2 == 0:\r\n while i != a:\r\n c += 1\r\n i -= 2\r\n print(c+1)\r\n", "n,a=map(int, input().split(' '))\nif a%2==0:\n x = range(n, 1, -2).index(a)+1\nelse:\n x = range(1, n, 2).index(a)+1\nprint(x)", "n,a=map(int,input().split())\r\nprint([n-a,a][a&1]//2+1)", "n, a = map(int, input().split())\r\nif a % 2 == 0:\r\n a = n - a + 1\r\nprint(a // 2 + 1)\r\n", "import sys\nn,a = map(int,input().split())\nup = [i for i in range(1,n,2)]\ndown = [i for i in range(n,1,-2)]\nif a in up:\n print(up.index(a)+1)\nelse:\n print(down.index(a)+1)\n", "from operator import indexOf\r\n\r\n\r\nn, a = map(int, input().split())\r\n\r\none_side = list(range(1, n+1, 2))\r\nother_side = list(range(n, 1, -2))\r\n\r\nif a % 2 == 0:\r\n tmp = indexOf(other_side, a)\r\n final_time = 1 * other_side[:tmp].__len__() + 1\r\nelse:\r\n tmp = indexOf(one_side, a)\r\n final_time = 1 * other_side[:tmp].__len__() + 1\r\nprint(final_time)", "\r\nn,a=map(int,input().split())\r\n'''\r\nl1=[i for i in range(1,n,2)]\r\nl2=[i for i in range(n,0,-2)]\r\nprint(l1)\r\nprint(l2)\r\nif a in l1:\r\n print(l1.index(a)+1)\r\nelse:\r\n print(l2.index(a)+1)'''\r\nif a%2==0:\r\n dist=(n-a)//2 \r\n print(dist+1)\r\nelse:\r\n print(a//2+1)", "n, m = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nfirst = 1\r\ntimer = 1\r\nif m % 2 == 0:\r\n\twhile n != m:\r\n\t\ttimer += 1\r\n\t\tn -= 2\r\nelse:\r\n\twhile first != m:\r\n\t\r\n\t\ttimer +=1\r\n\t\tfirst += 2\r\nprint(timer)", "n,a=input().split()\r\nn=int(n)\r\na=int(a)\r\nif(a%2==0):\r\n x=n-a\r\n x=x/2\r\n x=x+1\r\nelse:\r\n x=a-1\r\n x=x/2\r\n x=x+1\r\nprint(int(x))\r\n", "n,m = map(int,input().split())\r\nl,r = 1,n\r\nt = 1\r\nwhile l!=m and r!=m:\r\n t+=1\r\n l+=2\r\n r-=2\r\nprint(t)", "n, a = map(int, input().split())\nif a%2 == 1:\n print(a//2 + 1)\nelse:\n print((n-a)//2 +1)", "\r\nn,a=map(int, input().split())\r\nif a%2!=0:\r\n print(a//2+1)\r\nelse:\r\n print(n//2-a//2+1)", "a,b = map(int,input().split())\r\nc = 1\r\nk = 1\r\ns = 1\r\nif b % 2 == 0:\r\n while a != b:\r\n c += 1\r\n a -= 2\r\n print(c)\r\nelse:\r\n while k != b:\r\n s += 1\r\n k += 2\r\n print(s)\r\n", "n, a = map(int, input().split())\r\nk = 1\r\nfor i in range(n):\r\n if (k == a or n == a):\r\n print(i + 1)\r\n break\r\n n -= 2\r\n k += 2", "n, a = map(int, input().split())\r\nprint(a // 2 + 1 if a % 2 else (n - a + 2) // 2)", "n, a = map(int, input().split())\r\nprint((n - a, a)[a % 2] // 2 + 1)", "A=list(map(int,input().split()))\r\nn=A[0]\r\na=A[1]\r\ncounter=1\r\nif (a%2==1):\r\n for i in range(1,a,2):\r\n counter=counter+1\r\nelse:\r\n for i in range(n,a,-2):\r\n counter=counter+1\r\nprint(counter)\r\n", "import math\r\nn, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print( math.ceil( a / 2 ) )\r\nelse:\r\n print( int(n / 2 - a / 2 + 1))\r\n \r\n", "n, a = map(int, input().split())\r\nif a % 2 == 0: print(1 + n//2 - a//2)\r\nelse: print((a + 1)//2)", "n, h = map(int, input().split())\r\nprint(h // 2 + 1 if h % 2 else (n - h) // 2 + 1)\r\n", "\r\nn,a=map(int,input().split())\r\nl1=[i for i in range(1,n,2)]\r\nl2=[i for i in range(n,0,-2)]\r\nif a in l1:\r\n print(l1.index(a)+1)\r\nelse:\r\n print(l2.index(a)+1)", "n, a = map(int, input().split())\r\n\r\nt = 1\r\nif a % 2 == 1:\r\n k = 1\r\n while k != a:\r\n k += 2\r\n t += 1\r\nelse:\r\n k = n\r\n while k != a:\r\n k -= 2\r\n t += 1\r\n\r\nprint(t);\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif b %2==0:\r\n print(1+(a-b)//2)\r\nelse:\r\n print(1+b//2)\r\n", "n, a = [int(x) for x in input().split()]\r\nif a % 2 == 1:\r\n print(int(a / 2 + 1))\r\nelse:\r\n print(int((n - a) / 2 + 1))", "n, a = map(int, input().split())\n\nif a % 2:\n print(a//2 + 1)\nelse:\n print(n//2 - a//2 + 1)", "amount, dest = map(int, input().split())\n\nansw = 0\nif dest % 2 != 1:\n answ = (amount - dest) / 2 + 1\nelse:\n answ = (dest + 1) / 2\n\nprint(int(answ))\n", "n, a = map(int, input().split())\r\nb = []\r\nt = 1\r\n\r\nif a % 2 == 0:\r\n for i in range(2, n+1, 2):\r\n b.append(i)\r\n b.reverse()\r\nelse:\r\n for i in range(1, n, 2):\r\n b.append(i)\r\n\r\ni = 0\r\nwhile b[i] != a:\r\n t += 1\r\n i += 1\r\n\r\n\r\nprint(t)\r\n", "s = input()\r\n\r\nn,a = int(s.split()[0]),int(s.split()[1])\r\n\r\nif a%2==0:\r\n t = (n-a)//2 + 1\r\nelse:\r\n t = (a-1)//2 + 1\r\n\r\nprint(t)", "n,m = map(int, input().split())\r\nif m % 2 == 1:\r\n print(1 + (m//2))\r\nelse:\r\n print(1 + ((n - m)//2))", "\r\n\r\nn,m= map(int,input().split())\r\n\r\n\r\nt = n//2\r\n\r\nif m%2!=0:\r\n\r\n x = (m+1)//2\r\n if m==1:\r\n print(1)\r\n else:\r\n print(x)\r\nelse:\r\n if m==n:\r\n print(1)\r\n else:\r\n print((t-m//2)+1)\r\n\r\n \r\n", "n,a = input().split()\r\nn,a = int(n),int(a)\r\nif a % 2 == 1:\r\n print(1 + int(a/2))\r\nelse:\r\n print(1 + int((n + 1 - a)/2))\r\n", "n, a = input().split()\nn = int(n)\na = int(a)\nif (a % 2) == 1:\n print(int((a+1)/2))\nelse:\n print(int(((n-a)/2)+1))\n\n \t \t \t \t\t \t\t \t \t \t \t\t\t", "n, a = map(int, input().split())\r\n\r\nif n == a:\r\n print(1)\r\nelif a % 2 == 1:\r\n print((a + 1) // 2)\r\nelse:\r\n rez = 0\r\n for i in range(n, a-1, -2):\r\n rez += 1\r\n print(rez)\r\n", "def main():\n n, a = map(int, input().split())\n print(1 + (a // 2 if a & 1 else (n - a) // 2))\n\n\nif __name__ == '__main__':\n main()\n", "n,a = map(int, input().split())\r\ni = 1\r\nj = 1\r\n\r\nif (a%2 == 0):\r\n\twhile(n!=a):\r\n\t\tn -= 2\r\n\t\ti += 1\r\nelse:\r\n\twhile (j != a):\r\n\t\tj += 2\r\n\t\ti += 1\r\nprint (i) \r\n", "n, a = [int(i) for i in input().split()]\r\nif (a + 1) % 2:\r\n a = n + 1 - a\r\nprint((a + 1) // 2)\r\n", "def drive(n,a):\r\n if a == n:\r\n return 1\r\n elif a%2 != 0:\r\n time = a//2+1\r\n elif a%2 == 0:\r\n time = ((n-a)//2)+1\r\n return time\r\n \r\n \r\n \r\nx,y = map(int,input().split())\r\nprint(drive(x,y))", "import math\nn,a=list(map(lambda m:int(m),input().split(' ')))\nif(a%2):\n print(math.ceil(a/2))\n exit(0)\nelse:\n print(n//2-a//2+1)\n", "n, a = map(int, input().split())\r\n\r\nif a % 2 == 0:\r\n\ta = n//2 - a//2\r\nelse:\r\n\ta = (a - 1)//2\r\n\r\nprint(a + 1)\r\n", "n,h=map(int,input().split())\r\nprint(h//2+1 if h%2 else (n-h)//2+1)", "param = [int(x) for x in input().split()]\r\nn = param[0]/2\r\na = param[1]\r\nif a % 2 == 0:\r\n print(int(n-a/2+1))\r\nelse:\r\n print(int(a/2+1))", "def getLn(tp):\r\n return [tp(x) for x in input().split()]\r\n\r\nn, a = getLn(int)\r\nprint((a%2)((a+1)//2) + ((a+1)%2)((n-a)//2+1))\r\n", "n,a=map(int,input().split())\r\nt=[]\r\nj=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n t.append(i)\r\n else:\r\n j.append(i)\r\nj.reverse()\r\nif a in t:\r\n for i in range(len(t)):\r\n if t[i]==a:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(j)):\r\n if j[i]==a:\r\n print(i+1)\r\n break\r\n", "n, a = map(int, input().split())\r\n\r\nif a & 1:\r\n print(a//2 + 1)\r\nelse:\r\n print(n//2 - a//2 + 1)", "n,a=map(int,input().split())\r\nif a%2==1:\r\n print(a//2+1)\r\nelse: \r\n print((n//2)-(a//2)+1)", "#!/usr/bin/env python\r\n\r\n\r\ndef main():\r\n n, a = [int(x) for x in input().split()]\r\n if a % 2 == 0:\r\n print(n // 2 - a // 2 + 1)\r\n else:\r\n print(a // 2 + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\nif m%2==1:\n\tm+=1\n\tm//=2\n\tprint(m)\nelse :\n\tn+=2\n\tn-=m\n\tn//=2\n\tprint(n)\n\n\n", "n,a = map(int,input().split())\r\nl = [i for i in range(1,n,2)]\r\nr = [i for i in range(n,1,-2)]\r\nif(a%2 == 0):\r\n print(int(n/2 - a/2 + 1))\r\nelse:\r\n print(int((a+1)/2))", "n, a = map(int, input().split())\r\nif a%2==0:\r\n print((n-a)//2 + 1)\r\nelse:\r\n print((a-1)//2+1)\r\n", "#!/usr/bin/env python3\n\nn, a = map(int, input().split(\" \"))\n\nif a % 2 == 0:\n street = range(n, 2 - 1 , -2)\nelse:\n street = range(1, n + 1, 2)\n\nresult = 1 + street.index(a)\n\nprint(result)\n\n", "[n, x] = list(map(int, input().split(' ')))\nanswer = int (x % 2 == 0 and (n / 2 - x / 2 + 1) or( (x + 1) / 2))\nprint(answer)", "n, a = map(int, input().split())\r\n\r\nif a % 2 == 1:\r\n print((a+1)//2)\r\nelse:\r\n cnt = 1\r\n i = n\r\n while i != a:\r\n i -= 2\r\n cnt += 1\r\n print(cnt)\r\n ", "from sys import exit\r\n\r\nn, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(int(a // 2 + 1))\r\n exit()\r\nelse:\r\n print(int(n / 2 + 1 - a // 2))\r\n exit()", "\"\"\"\nhttps://codeforces.com/problemset/problem/638/A\n\"\"\"\n\ntotalhouses, house = [int(x) for x in input().split()]\n\nif house % 2 == 1:\n time = house // 2 + 1\nelse:\n time = (totalhouses - house) // 2 + 1\n\nprint(time)\n", "def run(n, a):\n result = 1\n if a % 2 == 1:\n result += (a - 1) / 2\n else:\n result += (n - a) / 2\n\n print(int(result))\n\n\ndata = [int(x) for x in input().split(' ')]\nrun(n=data[0], a=data[1])\n", "n, a = map(int, input().split())\r\nprint(1 + ((a - 1) // 2 if a % 2 == 1 else (n - a) // 2))\r\n", "n, a = map(int, input().split())\r\nprint(n // 2 - a // 2 + 1 if a % 2 == 0 else a // 2 + 1)\r\n", "num, a = list(map(int, input().split()))\nif (a % 2 != 0):\n\ta = (a / 2) + 1\n\tprint(int(a))\nelse:\n\tprint(int(((num - a) / 2) + 1))\n\t\n", "import math\r\n\r\nhouses, goal = map(int, input().split())\r\nif(goal%2 == 0):\r\n print((houses-goal)//2+1)\r\nelse:\r\n print(math.ceil(goal/2))", "n, k = map(int, input().split())\r\nif k & 1:\r\n exit(print(k // 2 + 1))\r\nprint((n - k) // 2 + 1)", "n,a = map(int,input().split())\r\nprint(a//2+1 if a%2 else n//2-a//2+1)", "n, a = map(int, input().split())\r\nif a%2 == 0:\r\n print((n - a)//2 + 1)\r\nelse:\r\n print((a + 1)//2)", "n,a=map(int,input().split())\r\nprint(a-(a-1)//2if a%2else(n-a)//2+1)", "n, a = map(int, input().split())\r\nfor i in range(n // 2):\r\n\tif a == 1 + (i * 2) or a == n - (i * 2):\r\n\t\tprint(i + 1)\r\n\t\tbreak\r\n\t\t", "n, a = map(int, input().split())\nif a % 2 == 0:\n print(1 + int((n - a) / 2))\nelse:\n print(1 + int(a / 2))\n", "a = list(map(int, input().split()))\nresult = 0\nif a[1] % 2 == 1:\n result = a[1] // 2 + 1\nelif a[1] % 2 == 0:\n result = a[0] / 2 - a[1] / 2 + 1\nprint(int(result))\n" ]	{"inputs": ["4 2", "8 5", "2 1", "2 2", "10 1", "10 10", "100000 100000", "100000 2", "100000 3", "100000 99999", "100 100", "3000 34", "2000 1", "100000 1", "24842 1038", "1628 274", "16186 337", "24562 2009", "9456 3443", "5610 332", "1764 1288", "28588 13902", "92480 43074", "40022 26492", "85766 64050", "67808 61809", "80124 68695", "95522 91716", "7752 2915", "5094 5058", "6144 4792", "34334 20793", "23538 10243", "9328 7933", "11110 9885", "26096 2778", "75062 5323", "94790 7722", "90616 32240", "96998 8992", "95130 19219", "92586 8812", "3266 3044", "5026 4697", "3044 2904", "6022 5396", "31270 25522", "82156 75519", "34614 27913", "88024 61143", "91870 55672", "95718 4868", "99564 358", "89266 13047", "90904 16455", "94750 13761", "100000 23458", "100000 23457", "59140 24272", "9860 8516", "25988 2733", "9412 5309", "25540 23601", "76260 6050", "92388 39118", "8516 5495", "91940 37847", "30518 286", "46646 19345"], "outputs": ["2", "3", "1", "1", "1", "1", "1", "50000", "2", "50000", "1", "1484", "1", "1", "11903", "678", "169", "1005", "1722", "2640", "239", "7344", "24704", "6766", "10859", "30905", "34348", "1904", "1458", "19", "677", "10397", "5122", "3967", "4943", "11660", "2662", "43535", "29189", "44004", "9610", "41888", "112", "2349", "71", "314", "2875", "37760", "13957", "30572", "18100", "45426", "49604", "6524", "8228", "6881", "38272", "11729", "17435", "673", "1367", "2655", "11801", "35106", "26636", "2748", "18924", "15117", "9673"]}	UNKNOWN	PYTHON3	CODEFORCES	120
d24e0144ab5b191851e3d3b0c9dc7679	Three displays	It is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a town in Zabaikalsky region), wants to rent three displays to highlight an important problem. There are $n$ displays placed along a road, and the $i$-th of them can display a text with font size $s_i$ only. Maria Stepanovna wants to rent such three displays with indices $i < j < k$ that the font size increases if you move along the road in a particular direction. Namely, the condition $s_i < s_j < s_k$ should be held. The rent cost is for the $i$-th display is $c_i$. Please determine the smallest cost Maria Stepanovna should pay. The first line contains a single integer $n$ ($3 \le n \le 3\,000$) — the number of displays. The second line contains $n$ integers $s_1, s_2, \ldots, s_n$ ($1 \le s_i \le 10^9$) — the font sizes on the displays in the order they stand along the road. The third line contains $n$ integers $c_1, c_2, \ldots, c_n$ ($1 \le c_i \le 10^8$) — the rent costs for each display. If there are no three displays that satisfy the criteria, print -1. Otherwise print a single integer — the minimum total rent cost of three displays with indices $i < j < k$ such that $s_i < s_j < s_k$. Sample Input 5 2 4 5 4 10 40 30 20 10 40 3 100 101 100 2 4 5 10 1 2 3 4 5 6 7 8 9 10 10 13 11 14 15 12 13 13 18 13 Sample Output 90 -1 33	[ "n=int(input())\r\na=[int(x) for x in input().split(\" \")]\r\nc=[int(x) for x in input().split(\" \")]\r\n\r\nans=int(1e18)\r\nfor j in range(1, n-1):\r\n cost=0\r\n pos=-1; mn=int(1e18)\r\n for i in range(0, j): \r\n if a[i]<a[j] and c[i]<mn:\r\n mn=c[i]\r\n pos=i\r\n if pos==-1: continue\r\n cost+=c[pos]\r\n \r\n pos=-1; mn=int(1e18)\r\n for k in range(j+1,n):\r\n if a[j]<a[k] and c[k]<mn:\r\n mn=c[k]\r\n pos=k\r\n if (pos==-1): continue\r\n cost+=c[pos]\r\n cost+=c[j]\r\n ans=min(ans, cost)\r\nif ans==int(1e18): ans=-1\r\nprint(ans)", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n b=lst()\r\n ans=PI=float('inf')\r\n dp=[[PI for _ in range(4)] for _ in range(n)]\r\n for i in range(n):\r\n dp[i][1]=b[i]\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n dp[i][2]=min(dp[i][2],dp[j][1]+b[i])\r\n dp[i][3]=min(dp[i][3],dp[j][2]+b[i])\r\n ans=min(ans,dp[i][3])\r\n print(ans if ans!=PI else -1)", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = float('inf')\nfor j in range(1, n-1):\n sj = s[j]\n cj = c[j]\n\n ci = float('inf')\n ck = float('inf')\n\n for i in range(j):\n if s[i] < sj:\n ci = min(ci, c[i])\n\n for k in range(j+1, n):\n if s[k] > sj:\n ck = min(ck, c[k])\n\n ans = min(ans, ci+cj+ck)\n\nif ans == float('inf'):\n print(-1)\nelse:\n print(ans)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\nn=ii()\r\n\r\na=li()\r\nb=li()\r\n\r\narr=[]\r\n\r\nfor i in range(n):\r\n arr.append([i,a[i],b[i]])\r\n\r\narr.sort(key=lambda x:x[1])\r\n\r\nst=[]\r\n\r\nres=inf\r\n\r\nl=[inf]n\r\nr=b[:]\r\n\r\nfor i,ai,bi in arr:\r\n if st and st[0][1]!=ai:\r\n for ni,nai,nbi in st:\r\n if 0<ni<n-1:\r\n #print(l,r)\r\n res=min(res,min(l[:ni])+nbi+min(r[ni+1:]))\r\n while st:\r\n ni,nai,nbi=st.pop()\r\n l[ni]=nbi\r\n r[i]=inf\r\n st.append([i,ai,bi])\r\n\r\nfor ni,nai,nbi in st:\r\n if 0<ni<n-1:\r\n #print(l,r)\r\n res=min(res,min(l[:ni])+nbi+min(r[ni+1:]))\r\nif res<inf:\r\n print(res)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = []\r\nfor j in range (n) :\r\n costleft = 400000000\r\n for i in range (j) : \r\n if s[j] > s[i] and costleft > c[i] : costleft = c[i]\r\n costright = 400000000\r\n for k in range (j+1,n) : \r\n if s[k] > s[j] and costright > c[k] : costright = c[k]\r\n if costright != 400000000 and costleft != 400000000 : ans.append(costright+costleft+c[j])\r\n else : ans.append(400000000)\r\nm = min(ans)\r\nif m == 400000000 : print(-1)\r\nelse : print(m)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nck_min = []\r\n\r\nfor i in range(n):\r\n ck_min_i = 1018\r\n \r\n for j in range(i+1, n):\r\n if s[i]<s[j]:\r\n ck_min_i = min(ck_min_i, c[j])\r\n \r\n ck_min.append(ck_min_i)\r\n\r\nans = 1018\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if s[i]<s[j]:\r\n ans = min(ans, c[i]+c[j]+ck_min[j])\r\n \r\nif ans==1018:\r\n print(-1)\r\nelse:\r\n print(ans)", "import sys\nimput = sys.stdin.readline\n\nclass SegmentTree():\n def __init__(self, n):\n self.n = n\n self.INF = 231 - 1\n self.size = 1\n while self.size < n:\n self.size = 2\n self.node = [self.INF] * (2self.size - 1)\n\n def update(self, i, val):\n i += (self.size - 1)\n self.node[i] = val\n while i > 0:\n i = (i - 1) // 2\n self.node[i] = min(self.node[2i + 1], self.node[2i + 2])\n\n def get_min(self, begin, end):\n begin += (self.size - 1)\n end += (self.size - 1)\n s = self.INF\n while begin < end:\n if (end - 1) & 1:\n end -= 1\n s = min(s, self.node[end])\n if (begin - 1) & 1:\n s = min(s, self.node[begin])\n begin += 1\n begin = (begin - 1) // 2\n end = (end - 1) // 2\n return s\n\n\ndef compress(array):\n array2 = sorted(set(array))\n memo = {value : index for index, value in enumerate(array2)}\n for i in range(len(array)):\n array[i] = memo[array[i]]\n return array\n\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nst = SegmentTree(n)\n\na = compress(a)\nans = [0]n\n\nfor i in range(n):\n ans[i] = st.get_min(0, a[i])\n st.update(a[i], min(b[i], st.get_min(a[i], a[i]+1)))\n\nst = SegmentTree(n)\nfor i in range(n)[::-1]:\n ans[i] += st.get_min(a[i] + 1, n)\n st.update(a[i], min(b[i], st.get_min(a[i], a[i]+1)))\n\nfor i in range(n):\n ans[i] += b[i]\n\nmin_ans = min(ans)\nif min_ans < 231 - 1:\n print(min_ans)\nelse:\n print(-1)\n \t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncost = list(map(int,input().split()))\r\nans = 1010\r\nfor i in range(1,n-1):\r\n cur = arr[i]\r\n l,r = 1010,1010\r\n for j in range(i-1,-1,-1):\r\n if arr[j]<cur:\r\n l = min(l,cost[j])\r\n for j in range(i+1,n):\r\n if arr[j]>cur:\r\n r = min(r,cost[j])\r\n ans = min(ans,cost[i]+l+r)\r\nif ans==1010:\r\n print(-1)\r\nelse:\r\n print(ans)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx=[0]\r\nfor i in range(1,n):\r\n t=0\r\n for j in range(i+1,n):\r\n if s[j]>s[i]:\r\n if t==0:\r\n t=c[j]\r\n else:\r\n t=min(t,c[j])\r\n x.append(t)\r\nans=-1\r\nfor i in range(n):\r\n t=0\r\n for j in range(i+1,n):\r\n if s[j]>s[i] and x[j]!=0:\r\n if ans==-1:\r\n ans=c[j]+x[j]+c[i]\r\n else:\r\n ans=min(ans,c[j]+x[j]+c[i])\r\nprint(ans)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = 1010\r\nfor j in range(1, n-1):\r\n now_ans = c[j]\r\n money = 1010\r\n for i in range(j):\r\n if s[i] < s[j]:\r\n money = min(money, c[i])\r\n if money == 1010:\r\n pass\r\n now_ans += money\r\n money = 10 10\r\n for i in range(j+1, n):\r\n if s[i] > s[j]:\r\n money = min(money, c[i])\r\n if money == 1010:\r\n pass\r\n now_ans += money\r\n ans = min(ans, now_ans)\r\nif ans == 1010:\r\n print(-1)\r\nelse:\r\n print(ans)", "def f(n, S, C):\n total = -1\n for i in range(1, n-1):\n l = (10 8) + 100\n for m in range(i-1, -1, -1):\n if S[m] < S[i]:\n l = min(l, C[m])\n r = (10 8) + 100\n for o in range(i+1, n):\n if S[o] > S[i]:\n r = min(r, C[o])\n if l == ((108)+100) or r == ((10 8)+100): continue\n elif total != -1: total = min(total, C[i]+r+l)\n else: total = C[i]+r+l\n\n return total\n\n\nn = int(input())\nS = [int(a) for a in input().split()]\nC = [int(b) for b in input().split()]\n\nprint(f(n, S, C))\n\t \t\t \t\t \t\t\t \t \t \t\t\t \t\t\t\t", "from functools import lru_cache\r\n\r\nn = int(input())\r\nS = tuple(map(int, input().split()))\r\nC = tuple(map(int, input().split()))\r\nc = sum(C)\r\n\r\n@lru_cache(maxsize = None)\r\ndef f(x):\r\n R = [c + 1]\r\n for i in range(x + 1, n):\r\n if S[i] > S[x]:\r\n R.append(C[i])\r\n return min(R)\r\nT = [c + 1]\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if S[j] > S[i]:\r\n T.append(f(j) + C[j] + C[i])\r\nt = min(T)\r\nif t > c:\r\n print(-1)\r\nelse:\r\n print(min(T))\r\n", "import sys\r\nn = int(input().strip())\r\nsizes = list(map(int, input().strip().split()))\r\ncost = list(map(int, input().strip().split()))\r\ntot = []\r\nfor i in range(n):\r\n tot.append([sizes[i], cost[i]])\r\nret = False\r\nlcomp = []\r\nfor j in range(len(tot)):\r\n if j > 0 and j < len(tot)-1:\r\n temp1 = tot[:j]\r\n temp2 = tot[j+1:]\r\n mi_1 = sys.maxsize\r\n ret1 = False\r\n for i in range(len(temp1)):\r\n if temp1[i][0] < tot[j][0]:\r\n mi_1 = min(mi_1, temp1[i][1])\r\n ret1 = True\r\n mi_2 = sys.maxsize\r\n ret2 = False\r\n for k in range(len(temp2)):\r\n if temp2[k][0] > tot[j][0]:\r\n mi_2 = min(mi_2, temp2[k][1])\r\n ret2 = True\r\n if ret1 and ret2:\r\n ret = True\r\n lcomp.append(mi_1+tot[j][1]+mi_2)\r\n #print(mi_1, tot[j][1], mi_2)\r\nif ret:\r\n print(min(lcomp))\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\ndp2 = [1000000000 for i in range(n)]\r\nfor i in range(1, n):\r\n for j in range(i + 1):\r\n if s[j] < s[i]:\r\n dp2[i] = min(dp2[i], c[j] + c[i])\r\ndp3 = [1000000000 for i in range(n)]\r\nfor i in range(2, n):\r\n for j in range(1, i + 1):\r\n if s[j] < s[i]:\r\n dp3[i] = min(dp3[i], dp2[j] + c[i])\r\nx = min(dp3)\r\nif x == 1000000000:\r\n print(-1)\r\nelse:\r\n print(x)\r\n\r\n", "from math import inf\n\nn = int(input())\n\ns = tuple(map(int, input().split()))\n\nc = tuple(map(int, input().split()))\n\nans = inf\n\nfor i in range(1, n-1):\n bef = inf\n aft = inf\n\n for j in range(i+1, n):\n if s[j] > s[i]:\n aft = min(aft, c[j])\n \n for k in range(i):\n if s[k] < s[i]:\n bef = min(bef, c[k])\n \n ans = min(ans, bef + c[i] + aft)\n\nprint(ans if ans<inf else -1)\n \t \t \t\t \t\t \t \t \t \t", "n = int(input())\r\nls1 = [int(i) for i in input().split()]\r\nls2 = [int(i) for i in input().split()]\r\n\r\nans = float('inf')\r\n\r\nfor i in range(1, n - 1):\r\n l = [ls2[j] for j in range(0, i) if ls1[j] < ls1[i]]\r\n r = [ls2[j] for j in range(i + 1, n) if ls1[j] > ls1[i]]\r\n\r\n if len(l) and len(r):\r\n ans = min(ans, min(l) + min(r) + ls2[i])\r\n\r\nprint([-1 , ans][ans != float('inf')])", "n=int(input())\r\ns= list(map(int,input().split()))\r\nc= list(map(int,input().split()))\r\nans = float('inf')\r\n\r\ndp= [[float('inf') for x in range(3)]for u in range(len(s)+1)]\r\n\r\nfor i in range(len(s)):\r\n dp[i][0]=c[i]\r\n for j in range(1,3):\r\n dp[i][j]=float('inf')\r\n for k in range(i):\r\n if s[k]<s[i]:\r\n dp[i][j]=min(dp[i][j],dp[k][j-1]+c[i])\r\n\r\n ans = min(ans, dp[i][2])\r\n\r\nif ans==float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd,ceil,log2\r\nfrom bisect import bisect_left, bisect_right,insort\r\nfrom itertools import permutations,combinations\r\nfrom heapq import heapify,heappop,heappush\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nsys.setrecursionlimit(10000)\r\ninf = float('inf')\r\nmod = 10 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\ncl = lambda a, b: (a + b - 1) // b\r\n\r\n\r\nt=1\r\nfor _ in range(t):\r\n n=int(input())\r\n l=[int(i) for i in input().split()]\r\n val=[int(i) for i in input().split()]\r\n ans=inf\r\n for i in range(n):\r\n left,right=inf,inf\r\n for j in range(i):\r\n if l[j]<l[i] and val[j]<left:\r\n left=val[j]\r\n for j in range(i+1,n):\r\n if l[j]>l[i] and val[j]<right:\r\n right=val[j]\r\n ans=min(ans,left+val[i]+right)\r\n if ans!=inf:\r\n print(ans)\r\n else:\r\n print(-1)", "from math import inf\r\n\r\n\r\nn = int(input())\r\ns_list = list(map(int, input().split()))\r\nc_list = list(map(int, input().split()))\r\n\r\ntotal_min = inf\r\nfor j in range(n):\r\n min_i = inf\r\n for i in range(0, j):\r\n if s_list[i] < s_list[j]:\r\n min_i = min(min_i, c_list[i])\r\n\r\n min_k = inf\r\n for k in range(j + 1, n):\r\n if s_list[k] > s_list[j]:\r\n min_k = min(min_k, c_list[k])\r\n\r\n total_min = min(total_min, min_i + c_list[j] + min_k)\r\nif total_min != inf:\r\n print(total_min)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nans = 4108\r\nfor j in range(1, n-1):\r\n mini = 410*8\r\n for i in range(0, j):\r\n if s[i]<s[j]:\r\n mini = min(mini, c[i])\r\n if mini == 410*8:\r\n continue\r\n mink = 410*8\r\n for k in range(j+1, n):\r\n if s[j]<s[k]:\r\n mink = min(mink, c[k])\r\n if mink == 410*8:\r\n continue\r\n ans = min(ans, mini+c[j]+mink)\r\nif ans==410*8:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass SegmentTree():\r\n def __init__(self, init, unitX, f):\r\n self.f = f # (X, X) -> X\r\n self.unitX = unitX\r\n self.f = f\r\n if type(init) == int:\r\n self.n = init\r\n self.n = 1 << (self.n - 1).bit_length()\r\n self.X = [unitX] (self.n * 2)\r\n else:\r\n self.n = len(init)\r\n self.n = 1 << (self.n - 1).bit_length()\r\n # len(init)が2の累乗ではない時UnitXで埋める\r\n self.X = [unitX] * self.n + init + [unitX] * (self.n - len(init))\r\n # 配列のindex1まで埋める\r\n for i in range(self.n - 1, 0, -1):\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 \| 1])\r\n\r\n def update(self, i, x):\r\n \"\"\"0-indexedのi番目の値をxで置換\"\"\"\r\n # 最下段に移動\r\n i += self.n\r\n self.X[i] = x\r\n # 上向に更新\r\n i >>= 1\r\n while i:\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 \| 1])\r\n i >>= 1\r\n\r\n def getvalue(self, i):\r\n \"\"\"元の配列のindexの値を見る\"\"\"\r\n return self.X[i + self.n]\r\n\r\n def getrange(self, l, r):\r\n \"\"\"区間[l, r)でのfを行った値\"\"\"\r\n l += self.n\r\n r += self.n\r\n al = self.unitX\r\n ar = self.unitX\r\n while l < r:\r\n # 左端が右子ノードであれば\r\n if l & 1:\r\n al = self.f(al, self.X[l])\r\n l += 1\r\n # 右端が右子ノードであれば\r\n if r & 1:\r\n r -= 1\r\n ar = self.f(self.X[r], ar)\r\n l >>= 1\r\n r >>= 1\r\n return self.f(al, ar)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n# 离散化a\r\ntemp = sorted(set(a))\r\nd = {temp[i]: i for i in range(len(temp))}\r\ntree = SegmentTree(len(temp), 10 ** 18, min)\r\n\r\nprefix = [0] * n\r\nfor i in range(n):\r\n prefix[i] = tree.getrange(0, d[a[i]])\r\n tree.update(d[a[i]], b[i])\r\n\r\ntree = SegmentTree(len(temp), 10 18, min)\r\nans = 10 18\r\nfor i in range(n - 1,-1,-1):\r\n ans = min(ans, prefix[i] + tree.getrange(d[a[i]] + 1, len(temp)) + b[i])\r\n tree.update(d[a[i]], b[i])\r\nprint(ans if ans != 10 ** 18 else -1)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef read_line():\r\n return [int(x) for x in input().split()]\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef solve():\r\n n = read_int()\r\n a = read_line()\r\n b = read_line()\r\n\r\n res = 1e18\r\n\r\n for j in range(n):\r\n cost = [1e18, 1e18]\r\n for i in range(0, j):\r\n if a[i] < a[j]:\r\n cost[0] = min(cost[0], b[i])\r\n for k in range(j, n):\r\n if a[j] < a[k]:\r\n cost[1] = min(cost[1], b[k])\r\n\r\n res = min(res, cost[0] + cost[1] + b[j])\r\n \r\n print(res if res != 1e18 else -1)\r\n\r\n# t = read_int()\r\nt = 1\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "import sys\r\nfrom math import inf\r\nfrom typing import List\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass RangeDescendRangeMin:\r\n # 模板：线段树区间更新、持续减少最小值\r\n def __init__(self, n):\r\n self.n = n\r\n self.cover = [inf] * (4 * n)\r\n self.lazy = [inf] * (4 * n)\r\n\r\n @staticmethod\r\n def _min(a, b):\r\n return a if a < b else b\r\n\r\n def _make_tag(self, i, val) -> None:\r\n self.cover[i] = self._min(self.cover[i], val)\r\n self.lazy[i] = self._min(self.lazy[i], val)\r\n return\r\n\r\n def _push_up(self, i):\r\n self.cover[i] = self._min(self.cover[2 * i], self.cover[2 * i + 1])\r\n return\r\n\r\n def _push_down(self, i):\r\n # 懒标记下放，注意取最大值\r\n if self.lazy[i] != inf:\r\n self.cover[2 * i] = self._min(self.cover[2 * i], self.lazy[i])\r\n self.cover[2 * i + 1] = self._min(self.cover[2 * i + 1], self.lazy[i])\r\n self.lazy[2 * i] = self._min(self.lazy[2 * i], self.lazy[i])\r\n self.lazy[2 * i + 1] = self._min(self.lazy[2 * i + 1], self.lazy[i])\r\n self.lazy[i] = inf\r\n return\r\n\r\n def build(self, nums: List[int]) -> None:\r\n # 使用数组初始化线段树\r\n assert self.n == len(nums)\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n s, t, ind = stack.pop()\r\n if ind >= 0:\r\n if s == t:\r\n self._make_tag(ind, nums[s])\r\n else:\r\n stack.append([s, t, ~ind])\r\n m = s + (t - s) // 2\r\n stack.append([s, m, 2 * ind])\r\n stack.append([m + 1, t, 2 * ind + 1])\r\n else:\r\n ind = ~ind\r\n self._push_up(ind)\r\n return\r\n\r\n def get(self):\r\n # 查询区间的所有值\r\n stack = [[0, self.n - 1, 1]]\r\n nums = [0] * self.n\r\n while stack:\r\n s, t, i = stack.pop()\r\n if s == t:\r\n nums[s] = self.cover[i]\r\n continue\r\n m = s + (t - s) // 2\r\n self._push_down(i)\r\n stack.append([s, m, 2 * i])\r\n stack.append([m + 1, t, 2 * i + 1])\r\n return nums\r\n\r\n def range_descend(self, left, right, val):\r\n # 更新区间最大值\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n a, b, i = stack.pop()\r\n if i >= 0:\r\n if left <= a and b <= right:\r\n self._make_tag(i, val)\r\n continue\r\n self._push_down(i)\r\n stack.append([a, b, ~i])\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n else:\r\n i = ~i\r\n self._push_up(i)\r\n return\r\n\r\n def range_min(self, left, right):\r\n # 查询区间的最大值\r\n stack = [[0, self.n - 1, 1]]\r\n lowest = inf\r\n while stack:\r\n a, b, i = stack.pop()\r\n if left <= a and b <= right:\r\n lowest = self._min(lowest, self.cover[i])\r\n continue\r\n self._push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n return lowest\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n # 模板：枚举中间数组，使用线段树维护前后缀最小值\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n ind = {num: i for i, num in enumerate(sorted(list(set(s + c + [0] + [10 ** 9 + 1]))))}\r\n m = len(ind)\r\n post = [inf] * n\r\n tree = RangeDescendRangeMin(m)\r\n for i in range(n - 1, -1, -1):\r\n tree.range_descend(ind[s[i]], ind[s[i]], c[i])\r\n post[i] = tree.range_min(ind[s[i]] + 1, m - 1)\r\n\r\n ans = inf\r\n tree = RangeDescendRangeMin(m)\r\n for i in range(n):\r\n if 1 <= i <= n - 2:\r\n cur = c[i] + tree.range_min(0, ind[s[i]] - 1) + post[i]\r\n ans = ac.min(ans, cur)\r\n tree.range_descend(ind[s[i]], ind[s[i]], c[i])\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\nclass FenwickTree:\r\n def __init__(self, n):\r\n self.n = n\r\n self.max_tree = [inf] * (n + 1)\r\n\r\n def update(self, idx, val):\r\n while idx <= self.n:\r\n self.max_tree[idx] = min(self.max_tree[idx], val)\r\n idx += idx & (-idx)\r\n\r\n def query_max(self, idx):\r\n res = inf\r\n while idx > 0:\r\n res = min(res, self.max_tree[idx])\r\n idx -= idx & (-idx)\r\n return res\r\n\r\nn=ii()\r\na=li()\r\nb=li()\r\n\r\nf=b[:]\r\n\r\narr=sorted(set(a+[-1,109+5]))\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit=FenwickTree(n+5)\r\n\r\nfor i in range(n):\r\n f[i]+=bit.query_max(d[a[i]]-1)\r\n bit.update(d[a[i]],b[i])\r\n\r\narr=arr[::-1]\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit=FenwickTree(n+5)\r\n\r\nfor i in range(n-1,-1,-1):\r\n f[i]+=bit.query_max(d[a[i]]-1)\r\n bit.update(d[a[i]],b[i])\r\n\r\nres=min(f)\r\n\r\nif res<inf:\r\n print(res)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 26/04/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn = ii1()\r\nfont = iia()\r\ncost = iia()\r\nres = float(\"inf\")\r\nfor i in range(1, n):\r\n left = float(\"inf\")\r\n for j in range(i):\r\n if font[j]<font[i]:\r\n left = min(left, cost[i] + cost[j])\r\n if left != float(\"inf\"):\r\n for j in range(i + 1, n):\r\n if font[j] > font[i]:\r\n res = min(res, left + cost[j])\r\nif res == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(res)\r\n \r\n \r\n \r\n\r\n\r\n\r\n ", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(int)\r\nn=I()\r\nl=L()\r\nc=L()\r\nans=1010\r\nf=1\r\nfor i in range(1,n-1):\r\n sj=l[i]\r\n le=0\r\n r=0\r\n left=1010\r\n right=1010\r\n for j in range(i):\r\n if(l[j]<l[i]):\r\n le=1\r\n left=min(left,c[j])\r\n for j in range(i+1,n):\r\n if(l[j]>l[i]):\r\n r=1\r\n right=min(right,c[j])\r\n if(ler):\r\n f=0\r\n ans=min(ans,left+right+c[i])\r\n \r\nif(f==1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "import math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heappush, heappop\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn = ii()\r\na = lii()\r\nb = lii()\r\ninf = float('inf')\r\ncur = inf\r\nans = inf\r\nfor j in range(n):\r\n l = r = inf\r\n for i in range(j):\r\n if a[i] < a[j]:\r\n l = min(b[i],l)\r\n for k in range(j + 1,n):\r\n if a[k] > a[j]:\r\n r = min(b[k],r)\r\n ans = min(ans,l + r + b[j])\r\nprint(ans if ans != inf else -1)\r\n\r\n\r\n\r\n\r\n", "# Problem: C. Three displays\r\n# Contest: Codeforces - Codeforces Round 485 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/987/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import \r\nfrom collections import \r\nfrom contextlib import redirect_stdout\r\nfrom itertools import \r\nfrom array import \r\nfrom functools import lru_cache, reduce\r\nfrom heapq import \r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 62)\r\nMOD = 10 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n f[i] = min(f[i], b[j] + b[i])\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n g[i] = min(g[i], f[j] + b[i])\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "from math import inf\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nval=[int(i) for i in input().split()]\r\ndp=[[inf for i in range(n)] for j in range(3)]\r\nfor i in range(n):\r\n dp[0][i]=val[i]\r\n for j in range(i):\r\n if a[i]>a[j]:\r\n dp[1][i]=min(dp[1][i],dp[0][j]+val[i])\r\n dp[2][i]=min(dp[2][i],dp[1][j]+val[i])\r\nm=inf\r\nfor i in range(n):\r\n m=min(m,dp[2][i])\r\nif m==inf:\r\n print(-1)\r\nelse:\r\n print(m)", "import sys\r\nfrom math import inf\r\nfrom typing import List\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass SegmentTreeUpdateQueryMin:\r\n # 模板：线段树区间更新、持续减小最小值\r\n def __init__(self, n):\r\n self.height = [inf](4n)\r\n self.lazy = [inf](4n)\r\n self.n = n\r\n\r\n def build(self, nums: List[int]):\r\n # 使用数组初始化线段树\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n s, t, ind = stack.pop()\r\n if ind >= 0:\r\n if s == t:\r\n self.make_tag(ind, nums[s])\r\n else:\r\n stack.append([s, t, ~ind])\r\n m = s + (t - s) // 2\r\n stack.append([s, m, 2 * ind])\r\n stack.append([m + 1, t, 2 * ind + 1])\r\n else:\r\n ind = ~ind\r\n self.push_up(ind)\r\n return\r\n\r\n def get(self):\r\n # 查询区间的所有值\r\n stack = [[0, self.n-1, 1]]\r\n nums = [inf]self.n\r\n while stack:\r\n s, t, i = stack.pop()\r\n if s == t:\r\n nums[s] = self.height[i]\r\n continue\r\n m = s + (t - s) // 2\r\n self.push_down(i)\r\n stack.append([s, m, 2 i])\r\n stack.append([m + 1, t, 2 * i + 1])\r\n return nums\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n def push_down(self, i):\r\n # 懒标记下放，注意取最小值\r\n if self.lazy[i] != inf:\r\n self.height[2 * i] = self.min(self.height[2 * i], self.lazy[i])\r\n self.height[2 * i + 1] = self.min(self.height[2 * i + 1], self.lazy[i])\r\n\r\n self.lazy[2 * i] = self.min(self.lazy[2 * i], self.lazy[i])\r\n self.lazy[2 * i + 1] = self.min(self.lazy[2 * i + 1], self.lazy[i])\r\n\r\n self.lazy[i] = inf\r\n return\r\n\r\n def make_tag(self, i, val):\r\n self.height[i] = self.min(self.height[i], val)\r\n self.lazy[i] = self.min(self.lazy[i], val)\r\n return\r\n\r\n def push_up(self, i):\r\n self.height[i] = self.min(self.height[2 * i], self.height[2 * i + 1])\r\n return\r\n\r\n def update_range(self, left, right, s, t, val, i):\r\n # 更新区间最小值\r\n stack = [[s, t, i]]\r\n while stack:\r\n a, b, i = stack.pop()\r\n if i >= 0:\r\n if left <= a and b <= right:\r\n self.make_tag(i, val)\r\n continue\r\n\r\n self.push_down(i)\r\n stack.append([a, b, ~i])\r\n m = a + (b - a) // 2\r\n if left <= m: # 注意左右子树的边界与范围\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n else:\r\n i = ~i\r\n self.push_up(i)\r\n return\r\n\r\n def update_point(self, left, right, s, t, val, i):\r\n # 更新单点最小值\r\n while True:\r\n if left <= s and t <= right:\r\n self.make_tag(i, val)\r\n break\r\n self.push_down(i)\r\n m = s + (t - s) // 2\r\n if left <= m: # 注意左右子树的边界与范围\r\n s, t, i = s, m, 2 * i\r\n if right > m:\r\n s, t, i = m + 1, t, 2 * i + 1\r\n\r\n while i > 1:\r\n i //= 2\r\n self.push_up(i)\r\n return\r\n\r\n def query_range(self, left, right, s, t, i):\r\n # 查询区间的最小值\r\n stack = [[s, t, i]]\r\n floor = inf\r\n while stack:\r\n a, b, i = stack.pop()\r\n if left <= a and b <= right:\r\n floor = self.min(floor, self.height[i])\r\n continue\r\n self.push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2i])\r\n if right > m:\r\n stack.append([m+1, b, 2i + 1])\r\n return floor\r\n\r\n def query_point(self, left, right, s, t, i):\r\n # 查询单点的最小值\r\n a, b, i = s, t, i\r\n while True:\r\n if left <= a and b <= right:\r\n ans = self.height[i]\r\n break\r\n self.push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n a, b, i = a, m, 2 * i\r\n if right > m:\r\n a, b, i = m + 1, b, 2 * i + 1\r\n return ans\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n ind = {num: i for i, num in enumerate(sorted(list(set(s+c+[0]+[10*9+1]))))}\r\n m = len(ind)\r\n post = [inf]n\r\n tree = SegmentTreeUpdateQueryMin(m)\r\n for i in range(n-1, -1, -1):\r\n tree.update_point(ind[s[i]], ind[s[i]], 0, m - 1, c[i], 1)\r\n post[i] = tree.query_range(ind[s[i]]+1, m-1, 0, m-1, 1)\r\n\r\n ans = inf\r\n tree = SegmentTreeUpdateQueryMin(m)\r\n for i in range(n):\r\n if 1 <= i <= n-2:\r\n cur = c[i]+tree.query_range(0, ind[s[i]]-1, 0, m-1, 1)+post[i]\r\n ans = ac.min(ans, cur)\r\n tree.update_point(ind[s[i]], ind[s[i]], 0, m - 1, c[i], 1)\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "# map(int, input().split(\" \"))\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl2 = list(map(int, input().split(\" \")))\r\ndp_1 = l2.copy()\r\ndp_2 = [9999999999]n\r\ndp_3 = [9999999999]n\r\nfor i in range(1, n):\r\n for j in range(i):\r\n if l[i] > l[j]:\r\n dp_2[i] = min(dp_2[i], dp_1[j]+l2[i])\r\n\r\nfor i in range(1,n):\r\n for j in range(i):\r\n if l[i] > l[j]:\r\n dp_3[i] = min(dp_3[i], dp_2[j]+l2[i])\r\n\r\nx = min(dp_3)\r\nif x == 9999999999:\r\n print(-1)\r\nelse:\r\n print(x)", "import sys\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10*9+7\r\n\r\nclass BIT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [inf]n\r\n\r\n def update(self, i, v):\r\n while i < self.n:\r\n self.tree[i] = min(self.tree[i], v)\r\n i += i & -i\r\n\r\n def query(self, i):\r\n res = inf\r\n while i:\r\n res = min(res, self.tree[i])\r\n i -= i & -i\r\n return res\r\n\r\ndef solve2():\r\n n = II()\r\n a, b = LII(), LII()\r\n ids = sorted(range(n), key=lambda i: (a[i], -i))\r\n # f[i][j]: 前i个数中长为j+1的递增子序列的b之和的最小值，从f[i][j-1]转移\r\n # 第二个维度优化掉，初始相当于f[i][0], 第一个循环后得到f[i][1]……\r\n f = b[:]\r\n for _ in range(2):\r\n g = [inf] * n\r\n t = BIT(n+1)\r\n for i in ids:\r\n g[i] = t.query(i)+b[i]\r\n t.update(i+1, f[i])\r\n f = g\r\n res = min(f)\r\n print(res if res < inf else -1)\r\n\r\ndef solve1():\r\n n = II()\r\n a = LII()\r\n b = LII()\r\n\r\n res = inf\r\n for j in range(n):\r\n left = inf\r\n for i in range(j):\r\n if a[i] < a[j]:\r\n left = min(left, b[i])\r\n right = inf\r\n for k in range(j+1, n):\r\n if a[k] > a[j]:\r\n right = min(right, b[k])\r\n res = min(res, b[j]+left+right)\r\n print(res if res < inf else -1)\r\n return\r\n\r\nsolve2()\r\n", "class Display:\r\n def __init__(self, index, size, cost):\r\n self.index = index\r\n self.size = size\r\n self.cost = cost\r\n self.totalcost = cost\r\n self.next = None\r\n self.level = 0\r\n\r\ndef nextcycle(displays, level):\r\n for j in range(n):\r\n displays[j].next = None\r\n for k in range(j + 1, n):\r\n if displays[j].size < displays[k].size and displays[k].level == level:\r\n if displays[j].next == None or displays[k].totalcost < displays[j].next.totalcost:\r\n displays[j].next = displays[k]\r\n if displays[j].next != None:\r\n displays[j].totalcost = displays[j].cost + displays[j].next.totalcost\r\n displays[j].level = displays[j].next.level + 1\r\n\r\n\r\nn = int(input())\r\nsizes = input().split(' ')\r\ncosts = input().split(' ')\r\ndisplays = []\r\ni = 0\r\nwhile i < n:\r\n displays.append(Display(i, int(sizes[i]), int(costs[i])))\r\n i += 1\r\n\r\nfor c in range(2):\r\n nextcycle(displays, c)\r\n\r\nbestcost = float(\"inf\");\r\nfor display in displays:\r\n if display.level == 2 and display.totalcost < bestcost:\r\n bestcost = display.totalcost\r\n\r\nprint(-1 if bestcost == float(\"inf\") else bestcost)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nans = 1018\r\nfor i in range(1, n-1):\r\n a = b = 1018\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n a = min(a, c[j])\r\n for j in range(i+1, n):\r\n if s[j] > s[i]:\r\n b = min(b, c[j])\r\n ans = min(ans, a+b+c[i])\r\nprint(-1 if ans == 10*18 else ans)\r\n", "from operator import __gt__, __lt__\r\n \r\ndef helper(op):\r\n xx = list(map(float, input().split()))\r\n le, ri, a = [], [], xx[0]\r\n for b in xx:\r\n if a > b:\r\n a = b\r\n le.append(a)\r\n for a in reversed(xx):\r\n if op(b, a):\r\n b = a\r\n ri.append(b)\r\n ri.reverse()\r\n return xx, le, ri\r\n \r\nn, res = int(input()), 9e9\r\nss, sLe, sRi = helper(__lt__)\r\ncc, cLe, cRi = helper(__gt__)\r\nfor j in sorted(range(1, n - 1), key=cc.__getitem__):\r\n s, c = ss[j], cc[j]\r\n if cLe[j - 1] + c + cRi[j + 1] < res and sLe[j - 1] < s < sRi[j + 1]:\r\n a = b = 9e9\r\n for i in range(j):\r\n if ss[i] < s and a > cc[i]:\r\n a = cc[i]\r\n for k in range(j + 1, n):\r\n if s < ss[k] and b > cc[k]:\r\n b = cc[k]\r\n if res > a + b + c:\r\n res = a + b + c\r\nprint(int(res) if res < 9e9 else -1)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n b=lst()\r\n dp=[0]n\r\n for i in range(n):\r\n v=float('inf')\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:v=min(v,b[i]+b[j])\r\n dp[i]=v\r\n # print(dp)\r\n for i in range(n):\r\n v = float('inf')\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]: v = min(v, b[i] + dp[j])\r\n dp[i] = v\r\n ans=min(dp)\r\n print(ans if ans!=float('inf') else -1)", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\nans = float('inf')\r\nfor i in range(1, n-1):\r\n bef = aft = float('inf')\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n bef = min(bef, b[j])\r\n for j in range(i, n):\r\n if a[i] < a[j]:\r\n aft = min(aft, b[j])\r\n ans = min(ans, b[i]+bef+aft)\r\nprint(-1 if ans > 10*9 else ans)\r\n\r\n\r\n\r\n\r\n", "# This code is contributed by Siddharth\r\n\r\n# import sys\r\n# input = sys.stdin.readline\r\n\r\n# from sys import \r\nfrom bisect import \r\nimport math\r\nfrom collections import \r\nfrom heapq import \r\nfrom itertools import \r\ninf=1018\r\nmod=109+7\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\n\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nminn=inf\r\nfor j in range(1,n-1):\r\n cost=c[j]\r\n temp1=inf\r\n temp2=inf\r\n for i in range(j):\r\n if s[i]<s[j]:\r\n temp1=min(temp1,c[i])\r\n for k in range(j+1,n):\r\n if s[j]<s[k]:\r\n temp2=min(temp2,c[k])\r\n minn=min(temp1+temp2+cost,minn)\r\nif minn<inf:\r\n print(minn)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# dp做法，可以维护任意m\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndp = [[10 ** 18] * 3 for _ in range(n)]\r\nfor i in range(n):\r\n dp[i][0] = b[i]\r\n for j in range(i):\r\n if a[i] > a[j]:\r\n dp[i][1] = min(dp[i][1], dp[j][0] + b[i])\r\n dp[i][2] = min(dp[i][2], dp[j][1] + b[i])\r\nans = min(dp[i][2] for i in range(n))\r\nprint(ans if ans != 10 ** 18 else -1)", "import math\r\n\r\ndef solve(sizes, costs):\r\n min_cost = float('inf')\r\n for j in range(1, len(sizes)-1):\r\n min_prev = float('inf')\r\n min_next = float('inf')\r\n for i in range(0, j):\r\n if sizes[i] < sizes[j]:\r\n min_prev = min(costs[i], min_prev)\r\n for k in range(j+1, len(sizes)):\r\n if sizes[k] > sizes[j]:\r\n min_next = min(costs[k], min_next)\r\n if math.isinf(min_prev) or math.isinf(min_next):\r\n continue\r\n min_cost = min(min_prev + costs[j] + min_next, min_cost)\r\n return min_cost if not math.isinf(min_cost) else - 1\r\n\r\n\r\nif __name__ == '__main__':\r\n dim = int(input())\r\n sizes = [int(n) for n in input().split()]\r\n costs = [int(n) for n in input().split()]\r\n print(solve(sizes, costs))\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nf = [1e9] * (n)\nfor i in range(1, n):\n for j in range(i - 1, -1, -1):\n if a[i] > a[j]:\n f[i] = min(b[i] + b[j], f[i])\nans = 1e9\nfor i in range(2, n):\n for j in range(i - 1, -1, -1):\n if a[i] > a[j]:\n ans = min(ans, f[j] + b[i])\nif ans >= 1e9:\n print(-1)\nelse:\n print(ans)\n", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(N, S, C):\r\n dp = [float('inf')] * N\r\n for i in range(1, N):\r\n for j in range(i):\r\n if S[j] < S[i]:\r\n dp[i] = min(dp[i], C[j] + C[i])\r\n\r\n dp2 = [float('inf')] * N\r\n for i in range(N - 1, 0, -1):\r\n for j in range(i + 1, N, 1):\r\n if S[i] < S[j]:\r\n dp2[j] = min(dp2[j], dp[i] + C[j])\r\n\r\n ans = min(dp2)\r\n if ans == float('inf'):\r\n return -1\r\n return ans\r\n\r\nN = int(input())\r\nS = get_ints()\r\nC = get_ints()\r\n\r\nprint(solve(N, S, C))\r\n", "n = int(input())\ns = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\nmincost = float('inf')\nfor i in range(1,n-1):\n minleft = float('inf')\n minright = float('inf')\n for j in range(0,i):\n if s[j]<s[i]:\n minleft = min(minleft,c[j])\n\n for j in range(i+1,n):\n if s[j]>s[i]:\n minright = min(minright,c[j])\n \n mincost = min(mincost,minleft+minright+c[i])\n\nif mincost<float('inf'):\n print(mincost)\nelse:\n print(-1)", "import sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nn = list(RI())[0]\r\na = list(RI())\r\nb = list(RI())\r\ninf = float(\"inf\")\r\n\r\ndp = [[inf] * 4 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n dp[i][1] = b[i]\r\n\r\nans = inf\r\n\r\nfor i in range(n):\r\n for j in range(i):\r\n if a[i] > a[j]:\r\n for k in range(2, 4):\r\n dp[i][k] = min(dp[i][k], dp[j][k - 1] + b[i])\r\n ans = min(ans, dp[i][3])\r\n\r\nif ans != inf:\r\n print(ans)\r\nelse:\r\n print(-1)", "import sys\r\nfrom math import inf\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass TreeArrayRangeQueryPointUpdateMin:\r\n # 模板：树状数组单点减少前缀区间查询最小值\r\n def __init__(self, n):\r\n # 索引从 1 到 n\r\n self.inf = inf\r\n self.t = [self.inf] * (n + 1)\r\n\r\n @staticmethod\r\n def lowest_bit(i):\r\n return i & (-i)\r\n\r\n def query(self, i):\r\n mi = self.inf\r\n while i:\r\n mi = mi if mi < self.t[i] else self.t[i]\r\n i -= self.lowest_bit(i)\r\n return mi\r\n\r\n def update(self, i, mi):\r\n while i < len(self.t):\r\n self.t[i] = self.t[i] if self.t[i] < mi else mi\r\n i += self.lowest_bit(i)\r\n return\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n\r\n nodes = sorted(list(set(s)) + [0, 10*9 + 1])\r\n dct = {num: i + 1 for i, num in enumerate(nodes)}\r\n m = len(nodes)\r\n\r\n pre = [inf] n\r\n tree = TreeArrayRangeQueryPointUpdateMin(m)\r\n for i in range(n):\r\n pre[i] = tree.query(dct[s[i]] - 1)\r\n tree.update(dct[s[i]], c[i])\r\n\r\n post = [inf] * n\r\n tree = TreeArrayRangeQueryPointUpdateMin(m)\r\n for i in range(n - 1, -1, -1):\r\n post[i] = tree.query(m - dct[s[i]])\r\n tree.update(m - dct[s[i]] + 1, c[i])\r\n\r\n ans = inf\r\n if n >= 3:\r\n ans = min(pre[i] + post[i] + c[i] for i in range(1, n - 1))\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nd = [[0 for _ in range(2)] for _ in range(n)]\r\nMAX = int(1e18)\r\nans = MAX\r\n\r\nfor i in range(n):\r\n d[i][0] = MAX\r\n d[i][1] = MAX\r\n for j in range(0,i):\r\n if a[j] < a[i]:\r\n d[i][0] = min(d[i][0], b[i] + b[j])\r\n d[i][1] = min(d[i][1], b[i] + d[j][0])\r\n \r\n ans = min(ans,d[i][1])\r\n \r\nprint(-1 if ans==MAX else ans)", "from math import inf\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nans = inf\r\nfor j in range(1,n-1):\r\n i = 0\r\n min1 = inf\r\n while i< j:\r\n if s[j] > s[i]:\r\n min1 = min(min1,c[i])\r\n i += 1\r\n if min1 != inf:\r\n k = j + 1\r\n min2 = inf\r\n while k < n:\r\n if s[k] > s[j]:\r\n min2 = min(min2,c[k])\r\n k += 1\r\n if min1 != inf and min2 != inf:\r\n cost = c[j] + min1 + min2\r\n ans = min(ans,cost)\r\nif ans != inf:\r\n print(ans)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\ncost=list(map(int,input().split()))\r\nans=float(\"inf\")\r\nfor i in range(n):\r\n l,r=float('inf'),float('inf')\r\n for j in range(i):\r\n if s[j]<s[i]:\r\n l=min(l,cost[j])\r\n for k in range(i+1,n):\r\n if s[k]>s[i]:\r\n r=min(r,cost[k])\r\n ans=min(ans,l+r+cost[i])\r\nif ans==float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "n=int(input())\r\nL1=list(map(int,input().split()))\r\nL2=list(map(int,input().split()))\r\ndp=[[L2[i],float('inf'),float('inf')] for i in range(n)]\r\nfor i in range(1,n):\r\n #skip\r\n dp[i][1]=min(dp[i-1][1],dp[i][1])\r\n dp[i][2]=min(dp[i-1][2],dp[i][2])\r\n #take\r\n min1=float(\"inf\")\r\n min2=float(\"inf\")\r\n for j in range(i):\r\n if L1[j]<L1[i] and dp[j][0]<min1:\r\n min1=dp[j][0]\r\n if L1[j]<L1[i] and dp[j][1]<min2:\r\n min2=dp[j][1]\r\n dp[i][1]=min1+L2[i]\r\n dp[i][2]=min2+L2[i]\r\nminm=float('inf')\r\nfor i in range(n):\r\n if dp[i][2]<minm:\r\n minm=dp[i][2]\r\nif minm==float('inf'):\r\n print(-1)\r\nelse:\r\n print(minm)\r\n", "n = int(input())\ns = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\ndp = [[float('inf') for _ in range(4)] for _ in range(n)]\n\nfor i in range(n):\n dp[i][1] = c[i]\n\nfor i in range(n):\n for j in range(1, 4):\n for r in range(i):\n if s[r] < s[i]:\n dp[i][j] = min(dp[i][j], c[i] + dp[r][j - 1])\n\nans = min(i[3] for i in dp)\nif ans == float('inf'):\n ans = -1\nprint(ans)\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n = int(input())\r\n s = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n\r\n # f[n][k] = f[n-1][k]\r\n # foreach i < n: if s[i] < s[n]: f[n][k] = min(f[n][k], f[i][k-1] + c[i)\r\n\r\n f = [[float(\"inf\") for _ in range(n+1)] for _ in range(4)]\r\n f[0][0] = 0\r\n f[1][0] = 0\r\n f[2][0] = 0\r\n f[3][0] = 0\r\n for i in range(1, n+1):\r\n f[0][i] = 0\r\n f[1][i] = c[i-1]\r\n for j in range(2, 4):\r\n for i in range(1, n+1):\r\n for k in range(1, i):\r\n if s[k-1] < s[i-1]:\r\n f[j][i] = min(f[j][i], f[j-1][k] + c[i-1])\r\n# print(f[0])\r\n# print(f[1])\r\n# print(f[2])\r\n# print(f[3])\r\n ans = min(f[3][3:])\r\n if ans == float(\"inf\"): print(-1)\r\n else: print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nS = [int(x) for x in input().split()]\ns = tuple(S)\nc = tuple(int(x) for x in input().split())\nS.sort()\ndef min(x, y):\n if x < y:\n return x\n else:\n return y\ndef rank(x):\n l = 0; r = n - 1\n while l < r:\n mid = (l + r) >> 1\n if S[mid] < x:\n l = mid + 1\n else:\n r = mid\n return l\nrk = tuple(rank(x) for x in s)\nMin = [10000000000 for i in range(30000)]\ndef insert(x, l, r, p, v):\n Min[x] = min(Min[x], v)\n if l == r:\n return\n mid = (l + r) >> 1\n if p > mid:\n insert(x << 1 \| 1, mid + 1, r, p, v)\n else:\n insert(x << 1, l, mid, p, v)\ndef query(x, l ,r ,L ,R):\n if l >= L and r <= R:\n return Min[x]\n mid = (l + r) >> 1; ans = 10000000000\n if L <= mid:\n ans = min(ans, query(x << 1, l, mid, L, R))\n if R > mid:\n ans = min(ans, query(x << 1 \| 1, mid + 1, r, L, R))\n return ans\ndp = list(c)\nMin = [10000000000 for i in range(30000)]\nfor i in range(0, n):\n insert(1, 0, n - 1, rk[i], dp[i])\n dp[i] = c[i]\n if rk[i] == 0:\n dp[i] += 10000000000\n else:\n dp[i] += query(1, 0, n - 1, 0, rk[i] - 1)\nMin = [10000000000 for i in range(30000)]\nfor i in range(0, n):\n insert(1, 0, n - 1, rk[i], dp[i])\n dp[i] = c[i]\n if rk[i] == 0:\n dp[i] += 10000000000\n else:\n dp[i] += query(1, 0, n - 1, 0, rk[i] - 1)\nans = 10000000000\nfor i in dp:\n ans = min(ans, i)\nif ans > 3000000000:\n print(-1)\nelse:\n print(ans)\n", "n = int(input())\r\nss = list(map(int, input().split()))\r\ncc = list(map(int, input().split()))\r\n\r\nd1 = {}\r\nd2 = {}\r\nd3 = {}\r\n\r\nfor i in range(n):\r\n s = ss[i]\r\n c = cc[i]\r\n if s in d1.keys():\r\n d1[s] = min(d1[s], c)\r\n else:\r\n d1[s] = c\r\n m = 10000000001\r\n for d in d1.keys():\r\n if d < s and d1[d] < m:\r\n m = d1[d]\r\n if s in d2.keys():\r\n d2[s] = min(d2[s], m + c)\r\n else:\r\n d2[s] = m + c\r\n\r\n m = 10000000001\r\n for d in d2.keys():\r\n if d < s and d2[d] < m:\r\n m = d2[d]\r\n if s in d3.keys():\r\n d3[s] = min(d3[s], m + c)\r\n else:\r\n d3[s] = m + c\r\n\r\nm = 10000000001\r\nfor d in d3.keys():\r\n if d3[d] < m:\r\n m = d3[d]\r\n\r\nif (m < 10000000001) :\r\n print(m)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n ans = float(\"inf\")\r\n a_L = list(map(int, input().split()))\r\n b_L = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n pre = float(\"inf\")\r\n tail = float(\"inf\")\r\n for j in range(i):\r\n if a_L[j] < a_L[i]:\r\n pre = min(pre, b_L[j])\r\n for j in range(i + 1, n):\r\n if a_L[j] > a_L[i]:\r\n tail = min(tail, b_L[j])\r\n # print(i, pre + tail + b_L[i])\r\n ans = min(ans, pre + tail + b_L[i])\r\n if ans == float(\"inf\"):\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def menorCustoEsq(s, c, size, custo):\r\n menor = None\r\n for i in range(0, len(s)):\r\n if menor == None and s[i] < size:\r\n menor = (s[i], c[i])\r\n elif s[i] < size:\r\n if menor[1] > c[i]:\r\n menor = (s[i], c[i])\r\n \r\n return menor\r\n\r\ndef menorCustoDir(s, c, size, custo):\r\n menor = None\r\n for i in range(0, len(s)):\r\n if menor == None and s[i] > size:\r\n menor = (s[i], c[i])\r\n elif s[i] > size:\r\n if menor[1] > c[i]:\r\n menor = (s[i], c[i])\r\n \r\n return menor\r\n\r\n\r\nn = int(input())\r\nsizes = [map(int, input().split())]\r\ncosts = [map(int, input().split())]\r\n\r\nvalores = []\r\nfor i in range(1, n - 1, 1):\r\n js = sizes[i]\r\n jc = costs[i]\r\n a = menorCustoEsq(sizes[: i], costs[: i], js, jc)\r\n k = menorCustoDir(sizes[i + 1 :], costs[i + 1 :], js, jc)\r\n\r\n if a != None and k != None:\r\n soma = a[1] + jc + k[1]\r\n valores.append(soma)\r\n\r\nif len(valores) == 0:\r\n print(-1)\r\nelse:\r\n print(min(valores))", "import sys \r\nimport math\r\nimport heapq\r\n\r\n# solve stack overflow\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(args, kwargs):\r\n if stack:\r\n return f(args, *kwargs)\r\n else:\r\n to = f(args, kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n# input = lambda: sys.stdin.readline().rstrip()\r\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MII():\r\n return map(int, input().split())\r\ndef LMII():\r\n return list(map(int, input().split()))\r\n#-------------------head-----------------#\r\n# list []\r\n# tuple ()\r\n# dict {}\r\n# set set()\r\n# 可变: list dict set\r\n# 不可变: str tuple\r\n# enumerate zip 遍历技巧\r\n\r\nn = II()\r\na = LMII()\r\nb = LMII()\r\nans = 10 20\r\nfor i in range(n):\r\n pre = 10 18\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n pre = min(pre, b[j])\r\n suf = 10 18\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n suf = min(suf, b[j])\r\n if pre != 10 18 and suf != 10 18:\r\n ans = min(ans, pre + b[i] + suf)\r\nprint(-1 if ans == 10 20 else ans)\r\n", "input()\r\nh = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nsas = 1e9\r\nfor j in range(len(h)):\r\n l = 1e9\r\n for i in range(j):\r\n if h[i] < h[j]:\r\n l = min(l, s[i])\r\n r = 1e9\r\n for k in range(j + 1, len(h)):\r\n if h[k] > h[j]:\r\n r = min(r, s[k])\r\n sas = min(sas, s[j] + l + r)\r\nprint(sas if sas != 1e9 else -1)\r\n", "n = int(input())\nsize = list(map(int,input().split()))\ncost =list(map(int,input().split()))\nans = 109\nfor j in range(1,n):\n s_j = size[j]\n c_i = 109\n for i in range(j):\n if size[j]>size[i]:\n c_i = min(c_i,cost[i])\n c_k = 109\n for k in range(j+1,n):\n if size[k]>size[j]:\n c_k = min(c_k,cost[k])\n x = cost[j]+c_i+c_k\n if x<ans:\n ans = x\nif ans>=109:\n print(-1)\nelse:\n print (ans)\n", "n = int(input())\r\ns = input()\r\nS = list(map(int,list(s.split())))\r\nc = input()\r\nC = list(map(int,list(c.split())))\r\ntable = [[109 for i in range(4)] for i in range(n)]\r\nfor i in range(n):\r\n table[i][1] = C[i]\r\nfor i in range(2,4):\r\n for j in range(i-1,n):\r\n for k in range(j):\r\n if S[k]<S[j]:\r\n table[j][i] = min(table[k][i-1]+C[j],table[j][i])\r\nm = 10(9)\r\nfor i in range(n):\r\n m = min(table[i][3],m)\r\nif m == 109:\r\n print(-1)\r\nelse:\r\n print(m)\r\n ", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\npass1 = [None] * (n - 1)\r\nfor i in range(n - 2, -1, -1):\r\n for j in range(i + 1, n):\r\n if s[j] > s[i]:\r\n if pass1[i] is None:\r\n pass1[i] = c[j] + c[i]\r\n else:\r\n pass1[i] = min(pass1[i], c[j] + c[i])\r\npass2 = [None] * (n - 2)\r\nfor i in range(n - 3, -1, -1):\r\n for j in range(i + 1, n - 1):\r\n if s[j] > s[i]:\r\n if pass1[j] is None:\r\n continue\r\n if pass2[i] is None:\r\n pass2[i] = pass1[j] + c[i]\r\n else:\r\n pass2[i] = min(pass2[i], pass1[j] + c[i])\r\n\r\n# print(pass1)\r\n# print(pass2)\r\nif all(a is None for a in pass2):\r\n print(-1)\r\nelse:\r\n print(min(a for a in pass2 if a is not None))\r\n", "#G - Three displays\nimport math\n\nn = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nmaxValue = float('inf')\nans = float('inf')\nesquerdaMin = [0] * n\ndireitaMin = [0] * n\nesquerdaMin[0] = c[0]\n\nfor i in range(1, n):\n esquerdaMin[i] = min(c[i], esquerdaMin[i - 1])\ndireitaMin[n - 1] = c[n - 1]\n\nfor i in range(n - 2, -1, -1):\n direitaMin[i] = min(c[i], direitaMin[i + 1])\n\nminTamanhoE = [0] * n\nminTamanhoD = [0] * n\nminTamanhoE[0] = s[0]\n\nfor i in range(1, n):\n minTamanhoE[i] = min(s[i], minTamanhoE[i - 1])\nminTamanhoD[n - 1] = s[n - 1]\n\nfor i in range(n - 2, -1, -1):\n minTamanhoD[i] = max(s[i], minTamanhoD[i + 1])\n\npreco = [(c[j], j) for j in range(1, n - 1)]\npreco.sort()\n\nfor k,j in preco:\n if esquerdaMin[j - 1] + c[j] + direitaMin[j + 1] >= ans:\n continue\n\n if minTamanhoE[j - 1] >= s[j] or s[j] >= minTamanhoD[j + 1]:\n continue\n\n a = maxValue\n for i in range(j):\n if s[i] < s[j]:\n a = min(a, c[i])\n\n b = maxValue\n for k in range(j + 1, n):\n if (s[j] < s[k]):\n b = min(b, c[k])\n\n curr = a + b + c[j]\n ans = min(ans, curr)\nif ans == maxValue * 3:\n ans = -1\nprint(ans)\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t \t \t \t", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\ndp = [10000000000000000]n\r\nfor i in range(1, n-1):\r\n for j in range(i+1, n):\r\n if s[j] > s[i]:\r\n dp[i] = min(dp[i], c[j]+c[i])\r\nminm = 10000000000000000\r\nfor i in range(0, n-2):\r\n for j in range(i+1, n-1):\r\n if s[j] > s[i]:\r\n minm = min(minm, dp[j]+c[i])\r\nif minm == 10000000000000000:\r\n print(-1)\r\nelse:\r\n print(minm)", "import os,sys,collections,heapq,itertools,functools,operator,random\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2\r\nfrom random import randint \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass BIT:\r\n def __init__(self,n, postfix, default_val, reduce_op):\r\n self.N = n + 2 \r\n self.postfix = postfix \r\n self.default_val = default_val\r\n self.reduce_op = reduce_op\r\n self.A = [default_val] self.N ##\r\n def add(self,i,x):\r\n i = i+1 if not self.postfix else self.N-(i+1) \r\n if i <=0 : i = 1 \r\n while i < self.N: \r\n self.A[i] = self.reduce_op(self.A[i],x)\r\n i += -i & i \r\n def get(self,i):\r\n i = i+1 if not self.postfix else self.N-(i+1) \r\n if i >= self.N : i = self.N - 1 \r\n res = self.default_val\r\n while i > 0: \r\n res = self.reduce_op(res,self.A[i])\r\n i ^= -i & i \r\n return res \r\ndef solution(): \r\n n = readi() \r\n a = readis() \r\n b = readis() \r\n _ = sorted(a) \r\n a = [bisect_left(_,x) for x in a] \r\n b1 = BIT(n,0,inf,min) \r\n b2 = BIT(n,0,inf,min) \r\n res = inf \r\n for i,x in zip(a,b): \r\n res = min(res,b2.get(i-1)+x) \r\n b2.add(i,b1.get(i-1)+x) \r\n b1.add(i,x) \r\n print([res,-1][res==inf])\r\n\r\n\r\nfor i in range( 1 ):\r\n solution() ", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2*(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]2self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2i], self.seg[2i+1])\n\n def update(self, k, x):\n k += self.num\n self.seg[k] = x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2k], self.seg[2k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n lres = self.ide_ele\n rres = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n rres = self.segfunc(self.seg[r], rres)\n if l & 1:\n lres = self.segfunc(lres, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n res = self.segfunc(lres, rres)\n return res\n\n def __str__(self): # for debug\n arr = [self.query(i,i+1) for i in range(self.n)]\n return str(arr)\n\nn = int(input())\nS = list(map(int, input().split()))\nC = list(map(int, input().split()))\nSA = list(set(S))\nSA = sorted(SA)\nd = {}\nfor i, s in enumerate(SA):\n d[s] = i\nS = [d[s] for s in S]\nL = [0]n\nR = [0]n\nINF = 1018\nN = len(d)\nseg = SegTree([INF](N+1), INF, min)\nseg.update(S[0], C[0])\nfor i in range(1, n-1):\n s = S[i]\n L[i] = seg.query(0, s)\n seg.update(s, C[i])\n\nseg = SegTree([INF](N+1), INF, min)\nseg.update(S[-1], C[-1])\nfor i in reversed(range(1, n-1)):\n s = S[i]\n R[i] = seg.query(s+1, seg.n)\n seg.update(s, C[i])\n\n#print(L)\n#print(R)\nans = INF\nfor i in range(1, n-1):\n ans = min(ans, L[i]+C[i]+R[i])\nif ans >= INF:\n print(-1)\nelse:\n print(ans)\n", "'''\r\nhttps://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n'''\r\n\r\nfrom itertools import \r\nfrom collections import \r\nfrom math import \r\nfrom cmath import \r\nfrom heapq import \r\nfrom functools import \r\nfrom bisect import \r\nfrom random import \r\nimport random\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\n\r\nBUFSIZE = 4096\r\nMOD = 10 * 9 + 7\r\ninf = float('inf')\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MI():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef PF(a):\r\n return [0] + list(accumulate(a))\r\n\r\n\r\n'''\r\n思路：\r\n1. 前后缀思想\r\n'''\r\n\r\n\r\ndef solve():\r\n n = II()\r\n a = LII()\r\n b = LII()\r\n res = inf\r\n for i in range(1, n - 1):\r\n m1, m2 = inf, inf\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n m1 = min(m1, b[j])\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n m2 = min(m2, b[j])\r\n res = min(res, m1 + m2 + b[i])\r\n print(res if res != inf else -1)\r\n\r\n\r\nsolve()\r\n", "from sys import stdin, stdout\r\nimport heapq\r\nimport cProfile\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import reduce\r\nimport math\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef solve():\r\n n = get_int()\r\n arr1 = get_list()\r\n arr2 = get_list()\r\n ans = float('inf')\r\n for i in range(n):\r\n mini = float('inf')\r\n for j in range(i):\r\n if arr1[j]<arr1[i]:\r\n mini = min(mini,arr2[j])\r\n maxi = float('inf')\r\n for k in range(i+1,n):\r\n if arr1[k]>arr1[i]:\r\n maxi = min(maxi,arr2[k])\r\n ans = min(ans,arr2[i]+mini+maxi)\r\n if ans==float('inf'): ans = -1\r\n return ans\r\n\r\n\r\n\r\ndef main():\r\n print(solve())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nTestCases = False\r\n\r\nif TestCases:\r\n for i in range(get_int()):\r\n main()\r\nelse:\r\n main()", "from bisect import bisect_left, bisect_right\r\nimport sys\r\nfrom collections import Counter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nfrom math import gcd\r\ndef mrd(fun=int): return [fun(x) for x in input().split()]\r\ndef rd(fun=int): return fun(input())\r\n\r\n'''\r\n .. a[i] ..\r\n y \r\n ----------ai-------------\r\n\r\n x\r\n查询所有前缀所有比ai小的数位置上的min(b)\r\n'''\r\nclass Node:\r\n def __init__(self) -> None:\r\n self.l = self.r = 0\r\n self.mn = float('inf')\r\n\r\nclass SegmentTree:\r\n def __init__(self, n) -> None:\r\n self.tr = [Node() for _ in range(n << 2)]\r\n \r\n def pushup(self, p):\r\n self.tr[p].mn = min(self.tr[p << 1].mn, self.tr[p << 1 \| 1].mn)\r\n \r\n def build(self, p, l, r):\r\n self.tr[p].l = l\r\n self.tr[p].r = r\r\n if l == r: return\r\n \r\n mid = l + r >> 1\r\n self.build(p << 1, l, mid)\r\n self.build(p << 1 \| 1, mid + 1, r)\r\n\r\n def modify(self, p, pos, val):\r\n l, r = self.tr[p].l, self.tr[p].r\r\n if l == r and r == pos:\r\n self.tr[p].mn = min(self.tr[p].mn, val)\r\n return\r\n mid = l + r >> 1\r\n if pos <= mid: self.modify(p << 1, pos, val)\r\n else: self.modify(p << 1 \| 1, pos, val)\r\n self.pushup(p)\r\n \r\n def query(self, p, l, r):\r\n if l > r: return float('inf')\r\n if l <= self.tr[p].l and self.tr[p].r <= r:\r\n return self.tr[p].mn\r\n mid = self.tr[p].l + self.tr[p].r >> 1\r\n ans = float('inf')\r\n if l <= mid: ans = min(ans, self.query(p << 1, l, r))\r\n if r > mid: ans = min(self.query(p << 1 \| 1, l , r), ans)\r\n return ans\r\n\r\n\r\ndef solve2():\r\n n = rd()\r\n a = mrd()\r\n b = mrd()\r\n ans = float(\"inf\")\r\n\r\n c = list(set(a.copy()))\r\n c.sort()\r\n for i in range(n):\r\n a[i] = bisect_left(c, a[i])\r\n \r\n tr = SegmentTree(n + 1)\r\n tr.build(1, 0, n - 1)\r\n tr.modify(1, a[0], b[0])\r\n \r\n f = [0] * n\r\n for i in range(1, n - 1):\r\n f[i] = tr.query(1, 0, a[i] - 1)\r\n tr.modify(1, a[i], b[i])\r\n \r\n tr = SegmentTree(n + 1)\r\n tr.build(1, 0, n - 1)\r\n tr.modify(1, a[-1], b[-1])\r\n \r\n for i in range(n - 2, 0, - 1):\r\n f[i] += tr.query(1, a[i] + 1, n - 1)\r\n tr.modify(1, a[i], b[i])\r\n \r\n ans = min(ans, f[i] + b[i])\r\n\r\n print(ans if ans != float('inf') else -1)\r\n\r\ndef solve():\r\n n = rd()\r\n a = mrd()\r\n b = mrd()\r\n ans = float(\"inf\")\r\n for i in range(1, n - 1):\r\n x = y = float('inf')\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n x = min(b[j], x)\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n y = min(b[j], y)\r\n ans = min(x + y + b[i], ans)\r\n print(ans if ans != float('inf') else -1)\r\n\r\n\r\nt = 1\r\n# t = rd()\r\nfor _ in range(t):\r\n solve2()", "n = int(input())\nss = list(map(int, input().strip().split()))\ncs = list(map(int, input().strip().split()))\n\ndp = [[float('inf')] * 4 for _ in range(n + 1)]\nfor i in range(1, n+1):\n dp[i][1] = cs[i-1]\n\n\nfor i in range(2, n + 1):\n for j in range(2, 4):\n s, c = ss[i-1], cs[i-1]\n for k in range(1, i):\n if ss[k-1] < s:\n dp[i][j] = min(dp[i][j], dp[k][j-1] + c)\n #print(i, j, dp[i][j])\n\n\nmmin = float('inf')\nfor i in range(1, 1+n):\n mmin = min(mmin, dp[i][3])\n\nif mmin == float('inf'):\n print(-1)\nelse:\n print(mmin)\n \t\t \t\t\t\t \t \t\t \t\t \t \t", "import math\r\nimport sys\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nce=list(map(int,input().split()))\r\n\r\nbest=109\r\nfor j in range(1,n-1):\r\n a=ce[j];b=109;c=109\r\n for i in range(j-1,-1,-1):\r\n if s[i]<s[j]:\r\n b=min(b,ce[i])\r\n for k in range(j+1,n):\r\n if s[k]>s[j]:\r\n c=min(c,ce[k])\r\n best=min(best,a+b+c)\r\n\r\nif best>=109:\r\n print(-1)\r\nelse:\r\n print(best)", "if __name__ == '__main__':\r\n n = int(input())\r\n s = list(map(int, input().strip().split()))\r\n c = list(map(int, input().strip().split()))\r\n INF = float(\"inf\")\r\n res = INF\r\n for i in range(n):\r\n leftMin, rightMin = INF, INF\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n leftMin = min(leftMin, c[j])\r\n for j in range(i + 1, n):\r\n if s[i] < s[j]:\r\n rightMin = min(rightMin, c[j])\r\n res = min(res, leftMin + c[i] + rightMin)\r\n res = -1 if res == INF else res\r\n print(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncost = list(map(int,input().split()))\r\nans = float(\"inf\")\r\nfor i in range(n):\r\n m,r = float(\"inf\"),float(\"inf\")\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n m = min(m,cost[j])\r\n for k in range(i+1,n):\r\n if a[k]>a[i]:\r\n r = min(r,cost[k])\r\n ans = min(ans,cost[i]+m+r)\r\nprint(ans if ans!=float(\"inf\") else -1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n-1):\r\n ans = 1012\r\n for j in range(i+1,n):\r\n if s[i] < s[j]:\r\n ans = min(ans,c[i]+c[j])\r\n\r\n d[i] = ans\r\n\r\nans = 1012\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n if s[i] < s[j]:\r\n ans = min(ans,c[i]+d[j])\r\n\r\nif ans == 10*12:\r\n print(-1)\r\n\r\nelse:\r\n print(ans)", "def answer(n,A,B):\r\n \r\n dp=[[float(\"inf\") for i in range(n)] for j in range(3)]\r\n dp[0][0]=B[0]\r\n \r\n for i in range(3):\r\n for j in range(1,n):\r\n if i==0:\r\n dp[i][j]=B[j]\r\n \r\n else:\r\n for k in range(j):\r\n if A[j]>A[k]:\r\n dp[i][j]=min(dp[i][j],dp[i-1][k]+B[j])\r\n \r\n mini=min(dp[2])\r\n if mini==float(\"inf\"):\r\n return -1\r\n \r\n return mini\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\nprint(answer(n,A,B))", "def solve(n,s,c):\r\n INF = float('inf')\r\n ans = INF\r\n for i in range(n):\r\n first = INF\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n first = min(first, c[j])\r\n if first == INF:\r\n continue\r\n second = INF\r\n for j in range(i+1,n):\r\n if s[i] < s[j]:\r\n second = min(second, c[j])\r\n if second == INF:\r\n continue\r\n ans = min(ans, first + c[i] + second)\r\n ans = -1 if ans == INF else ans\r\n print(ans)\r\n\r\n\r\nn = int(input())\r\ns = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nsolve(n,s,c)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ndp=[float('inf')](n)\r\nfor i in range(1,n):\r\n mn=float('inf')\r\n for j in range(i):\r\n if s[i]>s[j]:\r\n mn=min(mn,c[i]+c[j])\r\n dp[i]=mn\r\nres=float('inf')\r\nfor i in range(1,n):\r\n for j in range(i):\r\n if s[i]>s[j]:\r\n res=min(res,c[i]+dp[j])\r\nif res==float('inf'):\r\n res=-1\r\nprint(res)\r\n \r\n \r\n ", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ndp = []\nfor i in range(n):\n first = c[i]\n second = 1e9\n third = 1e9\n for j in range(i):\n if (s[j] < s[i]):\n second = min(second, dp[j][0] + c[i])\n third = min(third, dp[j][1] + c[i])\n dp.append((first, second, third))\n\nresult = 1e9\nfor i in range(n):\n result = min(result, dp[i][2])\nif (result == 1e9):\n print(-1)\n exit()\nprint(result)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\nclass FenwickTree:\r\n def __init__(self, n):\r\n self.n = n\r\n self.max_tree = [inf] * (n + 1)\r\n\r\n def update(self, idx, val):\r\n while idx <= self.n:\r\n self.max_tree[idx] = min(self.max_tree[idx], val)\r\n idx += idx & (-idx)\r\n\r\n def query_min(self, idx):\r\n res = inf\r\n while idx > 0:\r\n res = min(res, self.max_tree[idx])\r\n idx -= idx & (-idx)\r\n return res\r\n\r\nn=ii()\r\na=li()\r\nb=li()\r\n\r\n\r\narr=sorted(set(a+[-1,10*9+5]))\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit1=FenwickTree(n+5) #i项最小值\r\n\r\nbit2=FenwickTree(n+5) #i项+j项最小值\r\n\r\nres=inf\r\n\r\n\r\nfor x,y in zip(a,b):\r\n res=min(res,bit2.query_min(d[x]-1)+y)\r\n bit2.update(d[x],bit1.query_min(d[x]-1)+y)\r\n bit1.update(d[x],y)\r\n\r\nprint([res,-1][res==inf])\r\n\r\n\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nMIN = 3(10*8)+1\r\ndp = [MIN]n\r\nfor i in range(1, len(s)):\r\n for j in range(0, i):\r\n if s[j] < s[i]:\r\n dp[i] = min(dp[i], c[j]+c[i])\r\n MIN = min(dp[j]+c[i], MIN)\r\nif MIN > 3(108):\r\n print(-1)\r\nelse:\r\n print(MIN)", "'''\r\n【灵茶の试炼】\r\nhttps://docs.qq.com/sheet/DWGFoRGVZRmxNaXFz\r\n\r\nhttps://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n'''\r\n\r\n\r\nfrom cmath import inf\r\nfrom collections import defaultdict\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, a, b = _n(), _nA(), _nA()\r\n h1 = [inf]n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n h1[j] = min(h1[j], b[i]+b[j])\r\n h2 = [inf]n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n h2[j] = min(h2[j], h1[i]+b[j])\r\n ret=min(h2)\r\n if ret==inf:\r\n print(-1)\r\n else:\r\n print(ret)\r\n\r\nsolve()\r\n", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn = aint()\r\nl = alist()\r\nc = alist()\r\nans = float(\"inf\")\r\n\r\nd = [float(\"inf\")]n\r\nfor i in range(n-1,-1,-1):\r\n for j in range(i+1, n):\r\n if l[i]<l[j]:\r\n d[i] = min(d[i], c[j])\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if l[i]<l[j] and d[j]!=float(\"inf\"):\r\n ans = min(ans, c[i]+c[j]+d[j])\r\n\r\nif ans==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "from sys import \r\nfrom math import \r\nfrom bisect import \r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().split()))\r\nb=list(map(int,stdin.readline().split()))\r\nm=[]\r\nc=[]\r\nfor i in range(n):\r\n x=[]\r\n l = max(b)+1\r\n k=-1\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:\r\n x.append(j)\r\n if b[j]<l:\r\n l=b[j]\r\n k=j\r\n c.append(k)\r\n m.append(x)\r\nans=sum(b)+1\r\nfor i in range(n-1):\r\n x=b[i]\r\n for j in range(len(m[i])):\r\n y=b[m[i][j]]\r\n if c[m[i][j]] != -1:\r\n z=b[c[m[i][j]]]\r\n if x+y+z<ans:\r\n ans=x+y+z\r\nif ans==sum(b)+1:\r\n print(-1)\r\nelse:\r\n print(ans)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nmx=1e18\r\nfor i in range(n):\r\n d=-1\r\n cost=b[i]\r\n for j in range(i):\r\n if a[j]>=a[i]:continue\r\n if d==-1 or b[d]>b[j]:\r\n d=j\r\n if d==-1:continue\r\n cost+=b[d]\r\n d=-1\r\n for j in range(i+1,n):\r\n if a[j]<=a[i]:continue\r\n if d==-1 or b[d]>b[j]:\r\n d=j\r\n if d==-1:continue\r\n cost+=b[d]\r\n mx=min(mx,cost)\r\nif mx==1e18:\r\n print(\"-1\")\r\nelse:\r\n print(mx)\r\n \r\n", "class node():\n def __init__(self):\n self.id=0\n self.c=0\n self.s=0\nn=int(input())\np=[node() for i in range(n)]\nfor i in range(n):\n p[i].id=i\na=list(map(int,input().split()))\nfor i in range(n):\n p[i].s=a[i]\na=list(map(int,input().split()))\nfor i in range(n):\n p[i].c=a[i]\np.sort(key=lambda x:x.s)\nans=int(1e10)\nfor i in range(1,n-1):\n t1=int(1e10)\n t2=int(1e10)\n for j in range(i):\n if p[j].id<p[i].id and p[j].s<p[i].s:\n t1=min(t1,p[j].c)\n for j in range(i+1,n):\n if p[j].id>p[i].id and p[j].s>p[i].s:\n t2=min(t2,p[j].c)\n ans=min(ans,t1+t2+p[i].c)\nif ans==int(1e10):\n print(-1)\nelse:\n print(ans)\n \t\t\t\t\t\t \t \t \t \t\t \t \t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nminimum=1e11\r\nfor j in range(1,n):\r\n temp=1e10\r\n ans=0\r\n for i in range(0,j):\r\n if a[i]<a[j]:\r\n temp=min(temp,b[i])\r\n if temp==0:\r\n continue\r\n ans+=temp\r\n temp=1e10\r\n for k in range(j+1,n):\r\n if a[k]>a[j]:\r\n temp=min(temp,b[k])\r\n if temp==0:\r\n continue\r\n ans+=temp\r\n ans+=b[j]\r\n minimum=min(minimum,ans)\r\n# print(minimum)\r\nif minimum>1e10:\r\n print(-1)\r\nelse:\r\n print(minimum)", "import string\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nread=lambda :map(lambda s:int(s),input().strip().split())\r\nreadi=lambda :int(input())\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd\r\nRANDOM = randint(1, 10 * 9)\r\nclass Wrapper(int):\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nfor _ in range(1):\r\n n=readi()\r\n a=list(read())\r\n c=list(read())\r\n dp=[[float(\"inf\")]3 for i in range(n)]\r\n ans=float(\"inf\")\r\n dp[0][0]=c[0]\r\n for i in range(len(a)):\r\n for j in range(i):\r\n if a[i]>a[j]:\r\n dp[i][1]=min(dp[i][1],dp[j][0]+c[i])\r\n dp[i][2]=min(dp[i][2],dp[j][1]+c[i])\r\n ans=min(ans,dp[i][2])\r\n dp[i][0]=min(dp[i][0],c[i])\r\n print([ans,-1][ans==float(\"inf\")])\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = math.inf\r\ndp = [math.inf]n\r\nfor i in range(1, n):\r\n for j in range(0, i):\r\n if a[j] < a[i]:\r\n dp[i] = min(dp[i], c[j] + c[i])\r\n#print(dp)\r\nfor i in range(2, n):\r\n for j in range(1, i):\r\n if a[j] < a[i]:\r\n #print(a[j], a[i])\r\n ans = min(ans, dp[j] + c[i])\r\nif ans == math.inf:\r\n sys.stdout.write(\"-1\")\r\nelse:\r\n sys.stdout.write(str(ans))", "n = int(input())\r\ns = list(map(int, input().strip().split()))\r\nc = list(map(int, input().strip().split()))\r\n\r\ndp = [float('inf') for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n dp[i] = min(dp[i], c[i]+c[j])\r\n\r\n\r\ndp2 = [float('inf') for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n dp2[i] = min(dp2[i], dp[j]+c[i])\r\nans = min(dp2)\r\nif ans == float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nminCost = float('inf')\r\nfor j in range(1, n-1):\r\n curr = s[j]\r\n minLs = float('inf')\r\n minMax = float('inf')\r\n for i in range(j):\r\n if s[i] < curr:\r\n minLs = min(minLs, c[i])\r\n for i in range(j+1, n):\r\n if s[i] > curr:\r\n minMax = min(minMax, c[i])\r\n if minLs == float('inf') or minMax == float('inf'):\r\n continue\r\n minCost = min(minCost, c[j] + minLs + minMax)\r\n\r\nprint(-1 if minCost == float('inf') else minCost)", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = -1\n\nfor i in range(1, n - 1):\n temp1 = -1\n temp2 = -1\n for j in range(0, i):\n if(s[i] > s[j]):\n if(temp1 == -1):\n temp1 = c[j]\n else:\n temp1 = min(temp1, c[j])\n for j in range(i + 1, n):\n if(s[i] < s[j]):\n if(temp2 == -1):\n temp2 = c[j]\n else:\n temp2 = min(temp2, c[j])\n\n if(ans != -1 and temp1 != -1 and temp2 != -1):\n ans = min(ans, c[i] + temp1 + temp2)\n elif(temp1 != -1 and temp2 != -1):\n ans = c[i] + temp1 + temp2\n\nprint(ans)", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n# mini = 1e10\r\n# d = dict()\r\nmini = 1010\r\nfor j in range(1, n-1):\r\n i = j - 1\r\n k = j + 1\r\n min1 = 1010\r\n min2 = 1010\r\n while (i >= 0):\r\n if s[i] < s[j]:\r\n min1 = min(min1, c[i])\r\n i -= 1\r\n while (k < n):\r\n if s[j] < s[k]:\r\n min2 = min(min2, c[k])\r\n k += 1\r\n mini = min(mini, min1 + min2 + c[j])\r\nif mini >= 1010:\r\n print(-1)\r\nelse:\r\n print(mini)", "from sys import \r\nfrom math import \r\nfrom bisect import \r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().split()))\r\nc=list(map(int,stdin.readline().split()))\r\nans=[]\r\nf=0\r\n\r\nfor i in range(n):\r\n c1 = c2 = max(c) + 1\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:\r\n c1=min(c1,c[j])\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n c2=min(c2,c[j])\r\n if c1!=max(c)+1 and c2!=max(c)+1:\r\n f=1\r\n ans.append(c[i]+c1+c2)\r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(min(ans))", "import sys, itertools, math, collections, random\n\ndef ia():\n return [int(i) for i in sys.stdin.readline().strip().split(\" \")]\n\ndef ii():\n return int(sys.stdin.readline().strip())\n\ndef istr():\n return sys.stdin.readline().strip()\n\n###\n\nn = ii()\nS = ia()\nC = ia()\n\nans = 1010\nfor i in range(n):\n v = S[i]\n left = 1010\n for j in range(i-1, -1, -1):\n vl = S[j]\n if vl < v:\n left = min(left, C[j])\n right = 1010\n for j in range(i+1, n):\n vr = S[j]\n if vr > v:\n right = min(right, C[j])\n if left < 1010 and right < 1010:\n ans = min(ans, C[i] + left + right)\n\nif ans < 1010:\n print(ans)\nelse:\n print(-1)", "# Problem: C. Three displays\r\n# Contest: Codeforces - Codeforces Round 485 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/987/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nfrom bisect import bisect_left\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nMOD = 10 * 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n\"\"\"\r\n\r\ninf = 10 ** 9\r\n\r\n\r\n# 187 ms\r\ndef solve1():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n f[i] = min(f[i], b[j] + b[i])\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n g[i] = min(g[i], f[j] + b[i])\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\n# 124 ms\r\ndef solve2():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i] and f[i] > b[j] + b[i]:\r\n f[i] = b[j] + b[i]\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i] and g[i] > f[j] + b[i]:\r\n g[i] = f[j] + b[i]\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nclass ZKW:\r\n # n = 1\r\n # size = 1\r\n # log = 2\r\n # d = [0]\r\n # op = None\r\n # e = 10 15\r\n \"\"\"自低向上非递归写法线段树，0_indexed\r\n tmx = ZKW(pre, max, -2 61)\r\n \"\"\"\r\n __slots__ = ('n', 'op', 'e', 'log', 'size', 'd')\r\n\r\n def __init__(self, V, OP, E):\r\n \"\"\"\r\n V: 原数组\r\n OP: 操作:max,min,sum\r\n E: 每个元素默认值\r\n \"\"\"\r\n self.n = len(V)\r\n self.op = OP\r\n self.e = E\r\n self.log = (self.n - 1).bit_length()\r\n self.size = 1 << self.log\r\n self.d = [E for i in range(2 * self.size)]\r\n for i in range(self.n):\r\n self.d[self.size + i] = V[i]\r\n for i in range(self.size - 1, 0, -1):\r\n self.update(i)\r\n\r\n def set(self, p, x):\r\n # assert 0 <= p and p < self.n\r\n update = self.update\r\n p += self.size\r\n self.d[p] = x\r\n for i in range(1, self.log + 1):\r\n update(p >> i)\r\n\r\n def get(self, p):\r\n # assert 0 <= p and p < self.n\r\n return self.d[p + self.size]\r\n\r\n def query(self, l, r): # [l,r)左闭右开\r\n # assert 0 <= l and l <= r and r <= self.n\r\n sml, smr, op, d = self.e, self.e, self.op, self.d\r\n\r\n l += self.size\r\n r += self.size\r\n\r\n while l < r:\r\n if l & 1:\r\n sml = op(sml, d[l])\r\n l += 1\r\n if r & 1:\r\n smr = op(d[r - 1], smr)\r\n r -= 1\r\n l >>= 1\r\n r >>= 1\r\n return self.op(sml, smr)\r\n\r\n def all_query(self):\r\n return self.d[1]\r\n\r\n def max_right(self, l, f):\r\n \"\"\"返回l右侧第一个不满足f的位置\"\"\"\r\n # assert 0 <= l and l <= self.n\r\n # assert f(self.e)\r\n if l == self.n:\r\n return self.n\r\n l += self.size\r\n\r\n sm, op, d, size = self.e, self.op, self.d, self.size\r\n while True:\r\n while l % 2 == 0:\r\n l >>= 1\r\n if not (f(op(sm, d[l]))):\r\n while l < size:\r\n l = 2 * l\r\n if f(op(sm, d[l])):\r\n sm = op(sm, d[l])\r\n l += 1\r\n return l - size\r\n sm = op(sm, d[l])\r\n l += 1\r\n if (l & -l) == l:\r\n break\r\n return self.n\r\n\r\n def min_left(self, r, f):\r\n \"\"\"返回r左侧连续满足f的最远位置的位置\"\"\"\r\n # assert 0 <= r and r < self.n\r\n # assert f(self.e)\r\n if r == 0:\r\n return 0\r\n r += self.size\r\n sm, op, d, size = self.e, self.op, self.d, self.size\r\n\r\n while True:\r\n r -= 1\r\n while r > 1 and (r % 2):\r\n r >>= 1\r\n if not (f(op(d[r], sm))):\r\n while r < size:\r\n r = (2 * r + 1)\r\n if f(op(d[r], sm)):\r\n sm = op(d[r], sm)\r\n r -= 1\r\n return r + 1 - size\r\n sm = op(d[r], sm)\r\n if (r & -r) == r:\r\n break\r\n return 0\r\n\r\n def update(self, k):\r\n self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])\r\n\r\n def __str__(self):\r\n return str([self.get(i) for i in range(self.n)])\r\n\r\n\r\n# 124 ms\r\ndef solve():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n h = sorted(set(a))\r\n f1 = ZKW([inf] * len(h), min, inf)\r\n f2 = ZKW([inf] * len(h), min, inf)\r\n ans = inf\r\n for k, v in zip(a, b):\r\n x = bisect_left(h, k)\r\n ans = min(ans, f2.query(0, x) + v)\r\n f2.set(x, min(f2.get(x), f1.query(0, x) + v))\r\n f1.set(x, min(f1.get(x), v))\r\n\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import bisect\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nans=1018\r\nfor mid in range(1,n-1):\r\n l1=[c[i] for i in range(mid) if s[i]<s[mid]]+[1018]\r\n l2=[c[i] for i in range(mid+1,n) if s[i]>s[mid]]+[1018]\r\n ans=min(ans,min(l1)+c[mid]+min(l2))\r\nif ans>=1018:\r\n print(-1)\r\nelse:\r\n print(ans)", "import sys\r\nn = int(input())\r\nl = [int(x) for x in input().split()] \r\nc = [int(x) for x in input().split()] \r\nans = sys.maxsize\r\nfor j in range(1,n-1,1):\r\n tempAns1 = sys.maxsize\r\n tempAns2 = sys.maxsize\r\n for i in range(j):\r\n if l[i]<l[j]:\r\n tempAns1 = min(tempAns1,c[i])\r\n for k in range(j+1,n,1):\r\n if l[k]>l[j]:\r\n tempAns2 = min(tempAns2,c[k])\r\n if tempAns1!=sys.maxsize and tempAns2!=sys.maxsize:\r\n ans = min(ans,tempAns1+tempAns2+c[j])\r\nif ans == sys.maxsize:\r\n print(-1)\r\nelse:\r\n print(ans)", "n = int(input())\r\nfont = list(map(int, input().split()))\r\nprice = list(map(int, input().split()))\r\ninf = float('inf')\r\nans = inf\r\nfor i in range(1,n-1):\r\n temp1 = inf\r\n for j in range(i):\r\n if font[j]<font[i]:\r\n temp1 = min(temp1, price[j])\r\n temp2 = inf\r\n for j in range(i+1, n):\r\n if font[j] > font[i]:\r\n temp2 = min(temp2, price[j])\r\n ans =min(ans, price[i]+ temp1 + temp2) \r\nif ans == inf:\r\n print(-1)\r\nelse:\r\n print(ans) ", "inp = lambda: map(int, input().rstrip().split())\nn = int(input())\ns = list(inp())\nc = list(inp())\ndp = [100000000000] * n\nfor i in range(1, n - 1):\n for j in range(i + 1, n):\n if s[j] > s[i]:\n dp[i] = min(dp[i], c[j] + c[i])\nminm = 100000000000\n# print(dp)\nfor i in range(0, n - 2):\n for j in range(i + 1, n - 1):\n if s[j] > s[i]:\n minm = min(minm, dp[j] + c[i])\n # print(\"yes\")\nif minm == 100000000000:\n print(-1)\nelse:\n print(minm)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans = 1011\r\nfor i in range(1,n-1):\r\n mn1 = 1011\r\n mn2 = 1011\r\n for j in range (i+1,n):\r\n if (a[j] > a[i]):\r\n mn1 = min(mn1,b[j])\r\n for j in range (0,i):\r\n if (a[j] < a[i]):\r\n mn2 = min(mn2,b[j])\r\n # print(f\"{i} {mn1} {mn2}\")\r\n ans = min(ans,mn1+mn2+b[i])\r\nif ans >= 1011: \r\n ans = -1\r\nprint(ans)\r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nc = 10000000000\r\nb = dict()\r\nfor i in range(n):\r\n c1 = 10000000000\r\n for j in range(i+1, n):\r\n if w[j] > w[i] and s[j] < c1:\r\n c1 = s[j]\r\n b[w[i]] = c1\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if w[j] > w[i]:\r\n x = max(w[j], w[i])\r\n y = s[j] + s[i] + b.get(x, 10000000000)\r\n if y < c:\r\n c = y\r\n\r\nprint(c if c != 10000000000 else -1)", "import sys, math, itertools, functools, collections, bisect\ninput = sys.stdin.readline\n#sys.setrecursionlimit(106)\n\nrs = lambda: input().strip()\nri = lambda: int(input())\nrmi = lambda: map(int, input().split())\nra = lambda: [int(x) for x in input().split()]\n\ntest_case = 1\n\n#-------- DIFFERENT WAYS TO UNSTUCK ------------ \n# 1. Frequency/Value domain and Pigeon Hole Principle \n# 2. Search from end to start instead of start to end\n# 3. Prefix Suffix\n# 4. Brute force if small input size\n\nINF = 1018\n\ndef solve():\n ans = INF\n for j in range(1,n-1):\n ci, cj, ck = INF, C[j], INF\n \n for i in range(j):\n if S[i] < S[j]:\n ci = min(ci, C[i])\n \n \n for k in range(j+1,n):\n if S[j] < S[k]:\n ck = min(ck, C[k])\n \n if ci == INF or ck == INF: continue \n ans = min(ans, ci + cj + ck)\n \n return ans if ans != INF else -1\n \n \n \n\nfor _ in range(test_case):\n n = ri()\n S = ra()\n C = ra()\n print(solve())\n\n\"\"\"\n10\r\n802030518 598196518 640274071 983359971 71550121 96204862 799843967 446173607 796619138 402690754\r\n23219513 68171337 12183499 5549873 73542337 66661387 79397647 34495917 31413076 50918417\n\n85904709\n\"\"\"\n", "'''\r\nyou have 2 arrays one of font sizes\r\nand other is cost\r\npick three elemments which rae incresing\r\nand cost is minimum\r\n\r\nif you are at an element and want to add\r\nsome element in your subsequence then\r\n\r\n2 4 [5] 4 10\r\n40 30 [20] 10 40\r\nthe idea here is that ask the question that if you are at some element\r\nand you want to put this element in the seq then what matters about is we should think in such a ways\r\n\r\nthere are two things --> you can begin the subsequence from here or extend the subsequence at this index i\r\n\r\ni->poisition i\r\ndp(i,len) --> here i, is the last elemnt placed so far 1, 2\r\n\r\n\r\ndp(i,len) -> if begin the subsequence with i then --> dp[i][1]=cost[i]\r\n if extend then dp[i][j]=min(dp[k][j-1]+cost[i]) and j<i\r\n'''\r\n\r\nn=int(input())\r\na=list(map(int,input().split(\" \")))\r\nc=list(map(int,input().split(\" \")))\r\ninf=1e17\r\ndp=[[inf for i in range(3)] for j in range(n+1)]\r\n\r\nans=inf\r\n\r\nfor i in range(n):\r\n dp[i][0]=c[i]\r\n for j in range(1,3):\r\n dp[i][j]=inf\r\n for k in range(0,i):\r\n if(a[k]<a[i]):\r\n dp[i][j]=min(dp[i][j],dp[k][j-1]+c[i])\r\n ans=min(ans,dp[i][2])\r\nif(ans==inf):\r\n print(\"-1\")\r\nelse:\r\n print(ans)\r\n", "n = int(input())\r\n\r\na = [[int(i)] for i in input().split()]\r\n\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n a[i].append(b[i])\r\n\r\ndel b\r\n\r\nd = [0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n mini = 0\r\n for j in range(i):\r\n if a[j][0] < a[i][0]:\r\n if mini == 0:\r\n mini = a[j][1]\r\n else:\r\n mini = min(mini, a[j][1])\r\n if mini:\r\n mini += a[i][1]\r\n d[i] = mini\r\n\r\nc = [0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n mini = 0\r\n if d[i]:\r\n for j in range(i + 1, n):\r\n if a[i][0] < a[j][0]:\r\n if mini == 0:\r\n mini = a[j][1]\r\n else:\r\n mini = min(mini, a[j][1])\r\n if mini:\r\n c[i] = d[i] + mini\r\n\r\nc = [i for i in c if i > 0]\r\n\r\nif len(c):\r\n print(min(c))\r\nelse:\r\n print('-1')", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10*6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n=vary(1)\r\n indices=array_int()\r\n cost=array_int()\r\n ans=float('inf')\r\n mint=[]\r\n for i in range(n):\r\n ans=float('inf')\r\n total=cost[i]\r\n flag=0\r\n for j in range(i):\r\n if indices[i]>indices[j]:\r\n ans=min(ans,cost[j])\r\n flag=1\r\n if flag!=0:\r\n total+=ans\r\n ans=float('inf')\r\n flag=0\r\n for k in range(i+1,n):\r\n if indices[k]>indices[i]:\r\n ans=min(ans,cost[k])\r\n flag=1\r\n if flag!=0:\r\n total+=ans\r\n mint.append(total)\r\n else:\r\n continue\r\n else:\r\n continue\r\n if len(mint)>0:\r\n print(min(mint))\r\n else:\r\n print(-1)\r\n\r\n\r\n \r\n\r\n \r\n\r\n ", "import sys\nfrom collections import Counter\n\nimport functools\nimport math\nimport random\nimport sys\nimport os\nfrom bisect import bisect_left, bisect_right\nfrom collections import Counter, defaultdict, deque\nfrom functools import lru_cache, reduce\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\nfrom io import BytesIO, IOBase\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# RSI = lambda: int(sys.stdin.buffer.readline())\nRI = lambda: list(map(int, sys.stdin.buffer.readline().strip().split()))\nRS = lambda: sys.stdin.buffer.readline().strip().decode('ascii')\nRLS = lambda: sys.stdin.buffer.readline().strip().decode('ascii').split()\nDEBUG = lambda x: sys.stderr.write(f'{str(x)}\\n')\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\n\nif sys.hexversion == 50924784:\n sys.stdin = open('./data')\n\"\"\"\n参考样例\n输入\n5\n2 4 5 4 10\n40 30 20 10 40\n输出 90\n\n输入\n3\n100 101 100\n2 4 5\n输出 -1\n\n输入\n10\n1 2 3 4 5 6 7 8 9 10\n10 13 11 14 15 12 13 13 18 13\n输出 33\n\n题意简述：\nhttps://codeforces.com/problemset/problem/987/C\n\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\n如果不存在这样的 (i,j,k)，输出 -1。\n\n进阶：O(nlogn)。\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\n\n思路：\n\n\n\"\"\"\n\n\ndef solve():\n n, = RI()\n a = RI()\n b = RI()\n d = {x: idx + 1 * 2 for idx, x in enumerate(sorted(set(a)))}\n inf = float('inf')\n s = (n << 1) + 1\n m = 3\n bi = [[inf] * s for _ in range(m)]\n bi[0] = [0] * s\n\n def av(l, i, v):\n while i < s:\n if v < l[i]:\n l[i] = v\n else:\n break\n i += i & -i\n\n def ps(l, i):\n r = l[i]\n while i:\n if l[i] < r:\n r = l[i]\n i -= i & -i\n return r\n\n res = inf\n for ta, tb in zip(a, b):\n ti = d[ta]\n res = min(res, ps(bi[-1], ti) + tb)\n for j in range(m - 1, 0, -1):\n av(bi[j], ti + 1, tb + ps(bi[j - 1], ti))\n print(-1 if res == inf else res)\n\n return 0\n\n\n# for t in range(RIL()[0] - 1):\n# solve()\nsolve()\n" ]	{"inputs": ["5\n2 4 5 4 10\n40 30 20 10 40", "3\n100 101 100\n2 4 5", "10\n1 2 3 4 5 6 7 8 9 10\n10 13 11 14 15 12 13 13 18 13", "3\n1 2 3\n100000000 100000000 100000000", "3\n999999998 999999999 1000000000\n100000000 100000000 99999999", "10\n802030518 598196518 640274071 983359971 71550121 96204862 799843967 446173607 796619138 402690754\n23219513 68171337 12183499 5549873 73542337 66661387 79397647 34495917 31413076 50918417", "20\n452405440 586588704 509061481 552472140 16115810 148658854 66743034 628305150 677780684 519361360 208050516 401554301 954478790 346543678 387546138 832279893 641889899 80960260 717802881 588066499\n61699500 83254572 59454419 27833657 55743179 99661234 94729965 75591136 62937826 3626886 73906880 3664913 39990362 94385934 33153747 23840219 64514676 14746017 13062847 65187713", "3\n1 2 3\n1 1 1"], "outputs": ["90", "-1", "33", "300000000", "299999999", "85904709", "72432912", "3"]}	UNKNOWN	PYTHON3	CODEFORCES	104
d29152b2c4baf0df2caf31c9d71faa80	Sums of Digits	Vasya had a strictly increasing sequence of positive integers a1, ..., an. Vasya used it to build a new sequence b1, ..., bn, where bi is the sum of digits of ai's decimal representation. Then sequence ai got lost and all that remained is sequence bi. Vasya wonders what the numbers ai could be like. Of all the possible options he likes the one sequence with the minimum possible last number an. Help Vasya restore the initial sequence. It is guaranteed that such a sequence always exists. The first line contains a single integer number n (1<=≤<=n<=≤<=300). Next n lines contain integer numbers b1, ..., bn — the required sums of digits. All bi belong to the range 1<=≤<=bi<=≤<=300. Print n integer numbers, one per line — the correct option for numbers ai, in order of following in sequence. The sequence should be strictly increasing. The sum of digits of the i-th number should be equal to bi. If there are multiple sequences with least possible number an, print any of them. Print the numbers without leading zeroes. Sample Input 3 1 2 3 3 3 2 1 Sample Output 1 2 3 3 11 100	[ "import sys\r\n\r\n\r\ndef get_max(su, le):\r\n div, mod = divmod(su, 9)\r\n ret = ['9'] * div\r\n if mod:\r\n ret = [str(mod)] + ret\r\n\r\n if le - len(ret) > 0:\r\n x = str(int(ret.pop(0)) - 1)\r\n ret = ['1', x] + ret\r\n\r\n if le - len(ret) > 0:\r\n ret = [ret[0]] + ['0'] * (le - len(ret)) + ret[1:]\r\n\r\n return ret\r\n\r\n\r\ndef get_max2(su, le):\r\n div, mod = divmod(su, 9)\r\n ret = ['9'] * div\r\n if mod:\r\n ret = [str(mod)] + ret\r\n\r\n return ['0'] * (le - len(ret)) + ret\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nlst = ['0']\r\nfor _ in range(int(input())):\r\n su = int(input())\r\n le = su // 9 + bool(su % 9)\r\n\r\n if le > len(lst):\r\n lst = get_max(su, le)\r\n else:\r\n rem, ix = su, -1\r\n for i in range(len(lst)):\r\n if int(lst[i]) > rem:\r\n break\r\n\r\n if lst[i] != '9' and rem > int(lst[i]) and 9 * (len(lst) - i) >= rem:\r\n ix = i\r\n rem -= int(lst[i])\r\n\r\n if ix == -1:\r\n lst = get_max(su, len(lst) + 1)\r\n else:\r\n rem = su - sum([int(lst[i]) for i in range(ix + 1)])\r\n cur = 1\r\n for i in range(int(lst[ix]) + 1, 10):\r\n rem -= 1\r\n if (len(lst) - ix - 1) * 9 >= rem:\r\n break\r\n cur += 1\r\n lst = lst[:ix] + [str(int(lst[ix]) + cur)] + get_max2(rem, len(lst) - ix - 1)\r\n\r\n print(''.join(lst))\r\n", "n = int(input())\r\n\r\ndef get_sum(x):\r\n result = 0\r\n while x > 0:\r\n d, m = divmod(x, 10)\r\n result += m\r\n x = d\r\n return result\r\n\r\ndef dec(x):\r\n t = x\r\n mult = 1\r\n while True:\r\n d, m = divmod(x, 10)\r\n if m != 0:\r\n return t + (10 - m) * mult\r\n x = d\r\n mult *= 10\r\n\r\ndef get_next(prev_x, prev_sum, sum):\r\n t = prev_x\r\n while True:\r\n while prev_sum > sum:\r\n prev_x = dec(prev_x)\r\n prev_sum = get_sum(prev_x)\r\n s = list(str(prev_x))[::-1]\r\n required = sum - prev_sum\r\n i = 0\r\n while required:\r\n try:\r\n a = min(9 - (ord(s[i]) - ord('0')), required)\r\n s[i] = chr(ord(s[i]) + a)\r\n except IndexError:\r\n a = min(9, required)\r\n s += chr(a + ord('0'))\r\n required -= a\r\n i += 1\r\n x = int(\"\".join(reversed(s)))\r\n if x != t:\r\n return x\r\n prev_x = dec(prev_x)\r\n prev_sum = get_sum(prev_x)\r\n\r\na = s = 0\r\nfor i in range(n):\r\n b = int(input())\r\n a = get_next(a, s, b)\r\n print(a)\r\n s = b\r\n" ]	{"inputs": ["3\n1\n2\n3", "3\n3\n2\n1", "10\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1", "10\n8\n8\n5\n1\n2\n7\n3\n8\n9\n4", "10\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "100\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n1", "100\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18", "1\n139", "1\n6"], "outputs": ["1\n2\n3", "3\n11\n100", "1\n2\n3\n4\n5\n6\n7\n8\n9\n10", "8\n17\n23\n100\n101\n106\n111\n116\n117\n121", "1\n10\n100\n1000\n10000\n100000\n1000000\n10000000\n100000000\n1000000000", "1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\n63\n64\n65\n66\n67\n68\n69\n70\n71\n72\n73\n74\n75\n76\n77\n78\n79\n80\n81\n82\n83\n84\n85\n86\n87\n88\n89\n90\n91\n92\n93\n94\n95\n96\n97\n98\n99\n100", "99\n189\n198\n279\n288\n297\n369\n378\n387\n396\n459\n468\n477\n486\n495\n549\n558\n567\n576\n585\n594\n639\n648\n657\n666\n675\n684\n693\n729\n738\n747\n756\n765\n774\n783\n792\n819\n828\n837\n846\n855\n864\n873\n882\n891\n909\n918\n927\n936\n945\n954\n963\n972\n981\n990\n1089\n1098\n1179\n1188\n1197\n1269\n1278\n1287\n1296\n1359\n1368\n1377\n1386\n1395\n1449\n1458\n1467\n1476\n1485\n1494\n1539\n1548\n1557\n1566\n1575\n1584\n1593\n1629\n1638\n1647\n1656\n1665\n1674\n1683\n1692\n1719\n1728\n1737\n1746\n175...", "4999999999999999", "6"]}	UNKNOWN	PYTHON3	CODEFORCES	2
d2b5986193f7609c75ca4859225eff13	Mahmoud and a Dictionary	Mahmoud wants to write a new dictionary that contains n words and relations between them. There are two types of relations: synonymy (i. e. the two words mean the same) and antonymy (i. e. the two words mean the opposite). From time to time he discovers a new relation between two words. He know that if two words have a relation between them, then each of them has relations with the words that has relations with the other. For example, if like means love and love is the opposite of hate, then like is also the opposite of hate. One more example: if love is the opposite of hate and hate is the opposite of like, then love means like, and so on. Sometimes Mahmoud discovers a wrong relation. A wrong relation is a relation that makes two words equal and opposite at the same time. For example if he knows that love means like and like is the opposite of hate, and then he figures out that hate means like, the last relation is absolutely wrong because it makes hate and like opposite and have the same meaning at the same time. After Mahmoud figured out many relations, he was worried that some of them were wrong so that they will make other relations also wrong, so he decided to tell every relation he figured out to his coder friend Ehab and for every relation he wanted to know is it correct or wrong, basing on the previously discovered relations. If it is wrong he ignores it, and doesn't check with following relations. After adding all relations, Mahmoud asked Ehab about relations between some words based on the information he had given to him. Ehab is busy making a Codeforces round so he asked you for help. The first line of input contains three integers n, m and q (2<=≤<=n<=≤<=105, 1<=≤<=m,<=q<=≤<=105) where n is the number of words in the dictionary, m is the number of relations Mahmoud figured out and q is the number of questions Mahmoud asked after telling all relations. The second line contains n distinct words a1,<=a2,<=...,<=an consisting of small English letters with length not exceeding 20, which are the words in the dictionary. Then m lines follow, each of them contains an integer t (1<=≤<=t<=≤<=2) followed by two different words xi and yi which has appeared in the dictionary words. If t<==<=1, that means xi has a synonymy relation with yi, otherwise xi has an antonymy relation with yi. Then q lines follow, each of them contains two different words which has appeared in the dictionary. That are the pairs of words Mahmoud wants to know the relation between basing on the relations he had discovered. All words in input contain only lowercase English letters and their lengths don't exceed 20 characters. In all relations and in all questions the two words are different. First, print m lines, one per each relation. If some relation is wrong (makes two words opposite and have the same meaning at the same time) you should print "NO" (without quotes) and ignore it, otherwise print "YES" (without quotes). After that print q lines, one per each question. If the two words have the same meaning, output 1. If they are opposites, output 2. If there is no relation between them, output 3. See the samples for better understanding. Sample Input 3 3 4 hate love like 1 love like 2 love hate 1 hate like love like love hate like hate hate like 8 6 5 hi welcome hello ihateyou goaway dog cat rat 1 hi welcome 1 ihateyou goaway 2 hello ihateyou 2 hi goaway 2 hi hello 1 hi hello dog cat dog hi hi hello ihateyou goaway welcome ihateyou Sample Output YES YES NO 1 2 2 2 YES YES YES YES NO YES 3 3 1 1 2	[ "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef find_root(root_dict, x):\r\n L = []\r\n while x != root_dict[x]:\r\n L.append(x)\r\n x = root_dict[x]\r\n for y in L:\r\n root_dict[y] = x \r\n return x \r\n \r\ndef process(A, X, Queries):\r\n n = len(A)\r\n root_dict = [i for i in range(2n)]\r\n d = {}\r\n for i in range(n):\r\n d[A[i]] = i \r\n for t, x, y in X:\r\n x = find_root(root_dict, d[x])\r\n y = find_root(root_dict, d[y])\r\n if x < n:\r\n x2 = find_root(root_dict, x+n) \r\n else:\r\n x2 = find_root(root_dict, x-n)\r\n if y < n:\r\n y2 = find_root(root_dict, y+n)\r\n else:\r\n y2 = find_root(root_dict, y-n)\r\n if t=='1':\r\n if x==y2 or y==x2:\r\n sys.stdout.write('NO\\n')\r\n else:\r\n sys.stdout.write('YES\\n')\r\n root_dict[y] = x \r\n root_dict[y2] = x2 \r\n else:\r\n if x==y or x2==y2:\r\n sys.stdout.write('NO\\n')\r\n else:\r\n sys.stdout.write('YES\\n')\r\n root_dict[y] = x2 \r\n root_dict[y2] = x \r\n for x, y in Queries:\r\n x = find_root(root_dict, d[x])\r\n y = find_root(root_dict, d[y])\r\n if x < n:\r\n x2 = find_root(root_dict, x+n) \r\n else:\r\n x2 = find_root(root_dict, x-n)\r\n if y < n:\r\n y2 = find_root(root_dict, y+n)\r\n else:\r\n y2 = find_root(root_dict, y-n)\r\n if x==y:\r\n sys.stdout.write('1\\n')\r\n elif x==y2:\r\n sys.stdout.write('2\\n')\r\n else:\r\n sys.stdout.write('3\\n')\r\n \r\n return \r\n \r\nn, m, q = [int(x) for x in input().split()]\r\nA = input().decode().strip().split()\r\nX = []\r\nfor i in range(m):\r\n row = input().decode().strip().split()\r\n X.append(row)\r\nQueries = []\r\nfor i in range(q):\r\n row = input().decode().strip().split()\r\n Queries.append(row) \r\nprocess(A, X, Queries)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn, m, q = map(int, input().split())\r\na = list(input().rstrip().decode().split())\r\nd = dict()\r\nfor i in range(n):\r\n d[a[i]] = i\r\nroot = [i for i in range(2 n)]\r\nrank = [1 for _ in range(2 * n)]\r\nsize = [1 for _ in range(2 * n)]\r\nans = []\r\nfor _ in range(m):\r\n t = list(input().rstrip().decode().split())\r\n u, v = d[t[1]], d[t[2]]\r\n if t[0] == \"1\":\r\n ans0 = \"YES\" if not same(u, v + n) else \"NO\"\r\n if ans0 == \"YES\":\r\n unite(u, v)\r\n unite(u + n, v + n)\r\n else:\r\n ans0 = \"YES\" if not same(u, v) else \"NO\"\r\n if ans0 == \"YES\":\r\n unite(u, v + n)\r\n unite(u + n, v)\r\n ans.append(ans0)\r\nfor _ in range(q):\r\n t = list(input().rstrip().decode().split())\r\n u, v = d[t[0]], d[t[1]]\r\n if same(u, v):\r\n ans0 = 1\r\n elif same(u, v + n):\r\n ans0 = 2\r\n else:\r\n ans0 = 3\r\n ans.append(str(ans0))\r\nsys.stdout.write(\"\\n\".join(ans))", "# template begins\n#####################################\nfrom io import BytesIO, IOBase\nimport sys\nimport math\nimport os\nimport heapq\nfrom collections import defaultdict, deque\nfrom math import ceil\nfrom bisect import bisect_left, bisect_right\nfrom time import perf_counter\n\n\n# region fastio\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\ndef mint(): return map(int, input().split())\ndef mfloat(): return map(float, input().split())\ndef intin(): return int(input())\n\n\nclass DisjointSetUnion:\n def __init__(self, n):\n self.parent = list(range(n))\n self.size = [1] * n\n self.num_sets = n\n self.sets = [{i} for i in range(n)]\n\n def find(self, a):\n acopy = a\n while a != self.parent[a]:\n a = self.parent[a]\n while acopy != a:\n self.parent[acopy], acopy = a, self.parent[acopy]\n return a\n\n def union(self, a, b):\n a, b = self.find(a), self.find(b)\n if a != b:\n if self.size[a] < self.size[b]:\n a, b = b, a\n\n self.num_sets -= 1\n self.parent[b] = a\n self.size[a] += self.size[b]\n self.sets[a] \|= self.sets[b]\n\n def get_set(self, a):\n return self.sets[self.find(a)]\n\n def set_size(self, a):\n return self.size[self.find(a)]\n\n def __len__(self):\n return self.num_sets\n\n#####################################\n# template ends\n# Use the recursion snippet if heavy recursion is needed (depth>1000)\n# If constraints are tight, use 1d arrays instead of 2d, like g[im+j] instead of g[i][j]\n\n\ndef flip(w1, w2, dsu, meaning):\n w = min(w1, w2, key=dsu.set_size)\n for item in dsu.get_set(w):\n meaning[item] = 1 - meaning[item]\n\n\ndef solve():\n n, m, q = map(int, input().split())\n words, = input().split()\n words_to_index = {words[i]: i for i in range(n)}\n dsu = DisjointSetUnion(n)\n meaning = [-1]*n\n for _ in range(m):\n relation, w1, w2 = input().split()\n w1, w2 = map(words_to_index.get, (w1, w2))\n if dsu.find(w1) == dsu.find(w2):\n if (relation == '1' and meaning[w1] == meaning[w2]) or (relation == '2' and meaning[w1] != meaning[w2]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if (relation == '1' and meaning[w1] != meaning[w2]) or (relation == '2' and meaning[w1] == meaning[w2]):\n flip(w1, w2, dsu, meaning)\n dsu.union(w1, w2)\n print(\"YES\")\n\n for _ in range(q):\n w1, w2 = map(words_to_index.get, input().split())\n if dsu.find(w1) != dsu.find(w2):\n print(3)\n else:\n print(1 if meaning[w1] == meaning[w2] else 2)\n\n\ndef main():\n t = 1\n # t = int(input())\n for _ in range(t):\n solve()\n\n\nif __name__ == \"__main__\":\n start_time = perf_counter()\n main()\n print(perf_counter()-start_time, file=sys.stderr)\n", "from bisect import bisect_right\r\nfrom collections import defaultdict\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef find(u):\r\n if parent[u] == u:\r\n return u\r\n v=parent[u]\r\n parent[u] = find(v)\r\n\r\n if(d1[u,v]):\r\n val[u]=1-val[v]\r\n else:\r\n val[u]=val[v]\r\n d1[(u,parent[u])]=val[u]^val[parent[u]]\r\n d1[(parent[u],u)] = val[u] ^ val[parent[u]]\r\n\r\n #print(u, parent[u], val[u],val[parent[u]])\r\n return parent[u]\r\n\r\n\r\ndef union(a, b):\r\n u = parent[a]\r\n v = parent[b]\r\n\r\n if size[u] > size[v]:\r\n parent[v] = u\r\n size[u] += size[v]\r\n if(d1[u,v]):\r\n val[v]=1-val[u]\r\n else:\r\n val[v]=val[u]\r\n\r\n\r\n else:\r\n parent[u] = v\r\n size[v] += size[u]\r\n if(d1[u,v]):\r\n val[u]=1-val[v]\r\n else:\r\n val[u]=val[v]\r\n\r\n\r\n\r\nn,m,q=map(int,input().split())\r\nd=defaultdict(lambda:0)\r\nb=list(map(str,input().split()))\r\nfor i in range(n):\r\n d[b[i]]=i+1\r\nparent=[i for i in range(n+1)]\r\nsize = [1 for i in range(n + 1)]\r\nval=[0 for i in range(n+1)]\r\nreq=[]\r\nd1=defaultdict(lambda:0)\r\nfor i in range(m):\r\n b = list(map(str, input().split()))\r\n ty=int(b[0])\r\n u=d[b[1]]\r\n v=d[b[2]]\r\n #print(u,v,find(u),find(v),val[u],val[v])\r\n if(find(u)==find(v)):\r\n if(ty==2):\r\n if(val[u]^val[v]):\r\n req.append(\"YES\")\r\n else:\r\n req.append(\"NO\")\r\n if(ty==1):\r\n\r\n if(not val[u]^val[v]):\r\n req.append(\"YES\")\r\n else:\r\n req.append(\"NO\")\r\n else:\r\n req.append('YES')\r\n p1=parent[u]\r\n p2=parent[v]\r\n\r\n res=0\r\n if(ty==1):\r\n if(val[u]==val[v]):\r\n res=val[p1]^val[p2]\r\n else:\r\n res=val[p1]^(1-val[p2])\r\n else:\r\n if(val[u]==val[v]):\r\n res=val[p1]^(1-val[p2])\r\n else:\r\n res=val[p1]^(val[p2])\r\n\r\n\r\n d1[(p1,p2)]=res\r\n d1[(p2,p1)]=res\r\n\r\n union(p1,p2)\r\n\r\nfor i in range(1,n+1):\r\n parent[i]=find(i)\r\nans=[]\r\nfor i in range(q):\r\n x,y=map(str,input().split())\r\n u,v=d[x],d[y]\r\n if(find(u)==find(v)):\r\n r=val[u]^val[v]\r\n ans.append(r+1)\r\n\r\n else:\r\n ans.append(3)\r\n\r\n\r\n\r\n\r\nfor j in req:\r\n print(j)\r\nfor j in ans:\r\n print(j)\r\n\r\n\r\n\r\n\r\n\r\n" ]	{"inputs": ["3 3 4\nhate love like\n1 love like\n2 love hate\n1 hate like\nlove like\nlove hate\nlike hate\nhate like", "8 6 5\nhi welcome hello ihateyou goaway dog cat rat\n1 hi welcome\n1 ihateyou goaway\n2 hello ihateyou\n2 hi goaway\n2 hi hello\n1 hi hello\ndog cat\ndog hi\nhi hello\nihateyou goaway\nwelcome ihateyou", "5 4 5\nhello hi welcome ihateyou goaway\n1 hello hi\n1 hi welcome\n2 ihateyou hi\n2 goaway hi\nwelcome hello\nihateyou welcome\nwelcome goaway\ngoaway ihateyou\nwelcome hi", "2 1 1\na b\n1 a b\na b", "5 5 5\nhello hi welcome hallo ahlan\n1 hello hi\n1 hi welcome\n1 welcome hallo\n1 hallo ahlan\n2 ahlan hello\nhello hi\nahlan welcome\nhi welcome\nhi ahlan\nhallo hello", "6 2 6\nhello hi welcome dog cat lion\n1 hello hi\n1 hi welcome\nhi dog\ndog cat\nhello hi\nhi hello\nwelcome cat\nlion cat", "2 1 1\nhi hello\n1 hi hello\nhi hello", "8 4 12\nhello hi welcome goaway hateyou mmmm momo mana\n1 hello hi\n1 hi welcome\n2 goaway welcome\n2 hateyou hi\nhateyou goaway\nhateyou hi\nhateyou hi\nhateyou welcome\nmmmm momo\nwelcome hi\nwelcome hateyou\nhateyou goaway\nhello goaway\nhello goaway\nhello hateyou\ngoaway mmmm", "12 9 16\na b c d e f g h i j k l\n1 a b\n2 a c\n2 a d\n2 b e\n2 b f\n2 e g\n2 f h\n2 g i\n2 h j\ni j\ne i\nc d\ne f\nc f\nd e\nb c\nb c\nb f\nb f\nk a\nk b\nk l\nk l\nj e\nh g", "10 5 10\na b c d e f g h i j\n1 f j\n2 a e\n2 b g\n2 f e\n2 j g\na b\nb c\na b\nb c\nh j\nh j\na f\ne g\nb e\na g", "10 7 10\na b c d e f g h i j\n1 h j\n2 a e\n2 b g\n2 g c\n2 e d\n2 d f\n2 c f\na b\nb c\na b\nb c\nh j\nh j\na f\ne g\nb e\na g"], "outputs": ["YES\nYES\nNO\n1\n2\n2\n2", "YES\nYES\nYES\nYES\nNO\nYES\n3\n3\n1\n1\n2", "YES\nYES\nYES\nYES\n1\n2\n2\n1\n1", "YES\n1", "YES\nYES\nYES\nYES\nNO\n1\n1\n1\n1\n1", "YES\nYES\n3\n3\n1\n1\n3\n3", "YES\n1", "YES\nYES\nYES\nYES\n1\n2\n2\n2\n3\n1\n2\n1\n2\n2\n2\n3", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\n1\n1\n1\n1\n1\n1\n2\n2\n2\n2\n3\n3\n3\n3\n1\n1", "YES\nYES\nYES\nYES\nYES\n1\n3\n1\n3\n3\n3\n1\n1\n2\n2", "YES\nYES\nYES\nYES\nYES\nYES\nYES\n1\n1\n1\n1\n1\n1\n2\n1\n2\n2"]}	UNKNOWN	PYTHON3	CODEFORCES	4
d3197ae780b3073cca1cf30089f232ea	Pacifist frogs	Thumbelina has had an accident. She has found herself on a little island in the middle of a swamp and wants to get to the shore very much. One can get to the shore only by hills that are situated along a straight line that connects the little island with the shore. Let us assume that the hills are numbered from 1 to n and the number of a hill is equal to the distance in meters between it and the island. The distance between the n-th hill and the shore is also 1 meter. Thumbelina is too small to make such jumps. Fortunately, a family of frogs living in the swamp suggests to help her. Each frog agrees to give Thumbelina a ride but Thumbelina should choose only one frog. Each frog has a certain jump length. If Thumbelina agrees to accept help from a frog whose jump length is d, the frog will jump from the island on the hill d, then — on the hill 2d, then 3d and so on until they get to the shore (i.e. find itself beyond the hill n). However, there is one more problem: mosquitoes also live in the swamp. At the moment they have a siesta, and they are having a nap on some hills. If the frog jumps on a hill with a mosquito the frog will smash it. The frogs Thumbelina has met are pacifists, so they will find the death of each mosquito very much sad. Help Thumbelina choose a frog that will bring her to the shore and smash as small number of mosquitoes as possible. The first line contains three integers n, m and k (1<=≤<=n<=≤<=109, 1<=≤<=m,<=k<=≤<=100) — the number of hills, frogs and mosquitoes respectively. The second line contains m integers di (1<=≤<=di<=≤<=109) — the lengths of the frogs’ jumps. The third line contains k integers — the numbers of the hills on which each mosquito is sleeping. No more than one mosquito can sleep on each hill. The numbers in the lines are separated by single spaces. In the first line output the number of frogs that smash the minimal number of mosquitoes, in the second line — their numbers in increasing order separated by spaces. The frogs are numbered from 1 to m in the order of the jump length given in the input data. Sample Input 5 3 5 2 3 4 1 2 3 4 5 1000000000 2 3 2 5 999999995 999999998 999999996 Sample Output 2 2 3 1 2	[ "n, m, k = map(int, input().split())\r\nx, y = n, []\r\na = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nfor i, d in enumerate(a):\r\n c = 0\r\n for t in b:\r\n if 0 == t % d:\r\n c += 1\r\n if c < x:\r\n x = c\r\n y = [i + 1]\r\n elif c == x:\r\n y += i + 1,\r\nprint(len(y))\r\nprint(' '.join(map(str, y)))\r\n", "__author__ = 'linh'\n\n\ndef main():\n first_line = input()\n first_line = first_line.split()\n hill_n0 = int(first_line[0])\n frog_n0 = int(first_line[1])\n mosquito_n0 = int(first_line[2])\n\n frog_list = input()\n frog_list = list(map(int, frog_list.split()))\n\n mosquito_list = input()\n mosquito_list = list(map(int, mosquito_list.split()))\n\n result = []\n min_mosquito = 10000000000000\n for i in range(0, frog_n0):\n n0 = 0\n for j in range(0, mosquito_n0):\n if mosquito_list[j] % frog_list[i] == 0:\n n0 +=1\n\n if n0 < min_mosquito:\n min_mosquito = n0\n result.append(n0)\n\n frog_n0_adequate = 0\n output = \"\"\n for i in range(0, frog_n0):\n if result[i] == min_mosquito:\n output += str(i+1) + \" \"\n frog_n0_adequate += 1\n print(frog_n0_adequate)\n print(output)\n\n\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nd = []\r\nfor i in range(m):\r\n c = 0\r\n for j in s:\r\n if j % w[i] == 0:\r\n c += 1\r\n d.append((c, i+1))\r\nd.sort()\r\nx = d[0][0]\r\nans = [d[0][1]]\r\nfor i in d[1:]:\r\n if i[0] == x:\r\n ans.append(i[1])\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "#ROUNIAAUDI\r\na,b,c=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist2=list(map(int,input().split()))\r\nk=[0 for h in range(b)]\r\n#b={}\r\nfor i in list2:\r\n for i1, j in enumerate(list1):\r\n if i % j == 0:\r\n k[i1] += 1\r\n\r\n#print(k)\r\ny=min(k)\r\nh5=[]\r\nc=0\r\nfor i,u in enumerate(k):\r\n if u==y:\r\n c+=1\r\n h5.append(i+1)\r\nprint(c)\r\nprint(\" \".join(map(str,h5)))\r\n", "n,m,k=map(int,input().split())\r\nfrogs=list(map(int,input().split()))\r\nmosquis=list(map(int,input().split()))\r\nkilledmos=[]\r\nmini=1e9\r\nfor fr in frogs:\r\n j=0\r\n for ms in mosquis:\r\n if(ms%fr==0):\r\n j+=1\r\n # print(j)\r\n killedmos.append(j)\r\n mini=min(mini,j)\r\nans=0\r\nfor i in killedmos:\r\n if(i==mini):\r\n ans+=1\r\nprint(ans)\r\nfor i in range(0,m):\r\n if(killedmos[i]==mini):\r\n print(i+1,end=\" \")\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n,m,k = map(int,input().split())\r\njumps = list(map(int,input().split()))\r\nmosquitos = list(map(int,input().split()))\r\n\r\nmn = k+1\r\noutl = []\r\nfor index,i in enumerate(jumps) :\r\n ct = 0\r\n for j in mosquitos :\r\n if j%i == 0 :\r\n ct += 1\r\n if ct < mn :\r\n outl.clear()\r\n outl.append(index+1)\r\n mn = ct\r\n elif ct == mn :\r\n outl.append(index+1)\r\nprint(len(outl))\r\nfor i in outl :\r\n print(i,end=\" \")", "n, m, k = map(int, input().strip().split())\nfrogs = list(map(int, input().strip().split()))\nmosquitos = list(map(int, input().strip().split()))\nkilled = []\n\nfor frog in frogs:\n killed.append(len([x for x in mosquitos if x % frog == 0]))\n\nans = min(killed)\nprint(killed.count(ans))\nanswers = []\nfor i, frog in enumerate(killed):\n if frog == ans:\n answers.append(i + 1)\n\nprint(answers)\n", "n, m, k = list(map(int, input().split()))\r\n\r\nd = list(map(int, input().split()))\r\n\r\nkom = list(map(int, input().split()))\r\n\r\nc = 0\r\ndead = [0]m\r\n\r\nfor i in range(m):\r\n for j in range(k):\r\n if kom[j]%d[i] == 0:\r\n dead[c] += 1\r\n c += 1\r\n\r\nmi = min(dead)\r\nprint(dead.count(mi))\r\n\r\nfor i in range(m):\r\n if dead[i] == mi:\r\n print(i+1, end = \" \")\r\n", "n, m, k = map(int, input().split())\r\nd, a = map(int, input().split()), list(map(int, input().split()))\r\nv = sorted((sum(ai % di == 0 for ai in a), i + 1) for i, di in enumerate(d))\r\nv = sorted(vi[1] for vi in v if vi[0] == v[0][0])\r\nprint(len(v), ' '.join(map(str, v)), sep='\\n')", "import sys\r\nn, m, k = [int(x) for x in sys.stdin.readline().split()]\r\nd = [int(x) for x in sys.stdin.readline().split()]\r\nQ = [int(x) for x in sys.stdin.readline().split()]\r\nkills = []\r\n\r\nfor i in range(m):\r\n kills_i = 0\r\n for q in Q:\r\n if q % d[i] == 0:\r\n kills_i += 1\r\n kills.append(kills_i)\r\n\r\nmin_kills = min(kills)\r\nkillers = [str(i+1) for i in range(m) if kills[i]==min_kills]\r\n\r\nprint(len(killers))\r\nprint(\" \".join(killers))\r\n", "n, m, k = map(int, input().split())\r\nD = list(map(int, input().split()))\r\ncom = list(map(int, input().split()))\r\ncom = set(com)\r\nans = []\r\nfor i in range(m):\r\n lol = 0\r\n aa = 0\r\n for j in com:\r\n if j % D[i] == 0:\r\n aa += 1\r\n ans.append((aa, 1+i))\r\nans.sort()\r\np = [ans[0][1]]\r\nfor c in range(1, len(ans)):\r\n if ans[c][0] != ans[c-1][0]:\r\n break\r\n p.append(ans[c][1])\r\nprint(len(p))\r\nprint(p)\r\n\r\n", "n,m,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n\r\nmi,ans=109,[]\r\nfor i in range(m):\r\n x=0\r\n for j in range(k):\r\n if a[j]% d[i]==0: x+=1\r\n if x<mi:\r\n mi=x\r\n ans=[i+1]\r\n elif x==mi:\r\n ans+=[i+1]\r\nprint(len(ans))\r\nprint(ans)\r\n \r\n \r\n \r\n", "n,m,k = map(int,input().split())\r\nfrog = list(map(int,input().split()))\r\nmos = list(map(int,input().split()))\r\nans = []\r\nres = float('inf')\r\nfor i in range(m):\r\n f = frog[i]\r\n count = 0\r\n for ms in mos:\r\n if (ms)%f==0:\r\n count+=1\r\n if res>count:\r\n ans = [i+1]\r\n res = count\r\n elif res==count:\r\n ans.append(i+1)\r\n\r\nprint(len(ans))\r\nprint(ans)\r\n ", "I = lambda: map(int, input().split())\r\n\r\n_, m, _ = I()\r\nD = list(I())\r\nX = [0]m\r\n\r\nfor k in I():\r\n for i in range(m):\r\n if k % D[i] == 0:\r\n X[i] += 1\r\n\r\nx = min(X)\r\n\r\nprint(X.count(x))\r\nprint((i+1 for i in range(m) if X[i]==x))", "n,m,k = map(int,input().split())\r\nd=list(map(int,input().split()))\r\nkom = list(map(int,input().split()))\r\nmin=1000000000000000\r\nc=0\r\nr1=[]\r\nnum=0\r\nfor j in d:\r\n raz=0\r\n for i in kom:\r\n if i % j == 0:\r\n raz +=1\r\n if raz<=min:\r\n min = raz\r\nfor j in d:\r\n raz = 0\r\n num+=1\r\n for i in kom:\r\n if i % j == 0:\r\n raz +=1\r\n if raz==min:\r\n c+=1\r\n r1.append(num)\r\nprint(c)\r\nprint(r1)", "import sys\r\n\r\nn, m, k = sys.stdin.readline().split()\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\n\r\narr = sys.stdin.readline().split()\r\narr = [ int(x) for x in arr]\r\n\r\n\r\narr2 = sys.stdin.readline().split()\r\narr2 = [ int(y) for y in arr2]\r\n\r\nminimum = 1000\r\nfrogs = []\r\nfor i in range(m):\r\n contador = 0\r\n for j in range(k):\r\n\r\n if arr2[j] % arr[i] == 0:\r\n\r\n contador += 1\r\n if contador < minimum:\r\n frogs = [i +1]\r\n minimum = contador\r\n elif contador == minimum:\r\n frogs.append(i+1)\r\nprint(len(frogs))\r\nprint(' '.join([str(f) for f in frogs]))", "n, m, k = list(map(int, input().split()))\r\nfrogs = list(map(int, input().split()))\r\nmosquitos = list(map(int, input().split()))\r\nbest_frogs = []\r\nmin_kills = len(mosquitos)\r\nfor i, frog in enumerate(frogs):\r\n kills = sum([1 if m % frog == 0 else 0 for m in mosquitos])\r\n if kills < min_kills:\r\n min_kills = kills\r\n best_frogs = []\r\n if kills == min_kills:\r\n best_frogs.append(i + 1)\r\nprint(len(best_frogs))\r\nprint(best_frogs)\r\n", "n, m, k = [int(j) for j in input().split()]\r\nd = [int(j) for j in input().split()]\r\nhill = [int(j) for j in input().split()]\r\nList = []\r\nfor j in range(m):\r\n count = 0\r\n for l in range(k):\r\n if hill[l] % d[j] == 0:\r\n count += 1\r\n List.append(count)\r\nval = min(List)\r\noutput = []\r\nfor j in range(m):\r\n if List[j] == val:\r\n output.append(j + 1)\r\nprint(len(output))\r\nfor j in range(len(output)):\r\n print(output[j], end = ' ')\r\n", "a,b,c=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nans=[]\r\nfor i,j in enumerate(z):\r\n ok=0\r\n for u in k:ok+=(u%j==0)\r\n ans.append([ok,i+1])\r\nans=sorted(ans)\r\nj=[]\r\nfor i in ans:\r\n if ans[0][0]==i[0]:j.append(i[1])\r\nprint(len(j))\r\nprint(j)", "n, m, k = map(int, input().split())\r\nfrog = [int(i) for i in input().split()]\r\nkom = [int(i) for i in input().split()]\r\ndie = [0] * m\r\nww = 0\r\nfor i in range(m):\r\n for j in range(k):\r\n if kom[j] % frog[i] == 0:\r\n die[ww] += 1\r\n ww += 1\r\nmi = min(die)\r\nprint(die.count(mi))\r\nfor i in range(m):\r\n if die[i] == mi:\r\n print(i + 1, end = ' ')", "import sys\r\ninput=sys.stdin.readline\r\nfrom math import \r\nn,m,k=map(int,input().split())\r\ns=0\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nd={}\r\ns=[0 for i in range(m)]\r\nfor i in b:\r\n d[i]=1\r\nfor i in range(m):\r\n for j in range(k):\r\n if b[j]%a[i]==0:\r\n s[i]+=1\r\n \r\nprint(s.count(min(s)))\r\nfor i in range(m):\r\n if s[i]==min(s):\r\n print(i+1,end=\" \")\r\n ", "n,m,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nK=list(map(int,input().split()))\r\n\r\nANS=[-1]m\r\n\r\nfor i in range(m):\r\n a=A[i]\r\n score=0\r\n for k in K:\r\n if k%a==0:\r\n score+=1\r\n ANS[i]=score\r\n\r\nMIN=min(ANS)\r\n\r\nALIST=[]\r\nfor i in range(m):\r\n if ANS[i]==MIN:\r\n ALIST.append(i+1)\r\n\r\nprint(len(ALIST))\r\nprint(ALIST)\r\n", "n, m, k = tuple(map(int, input().split()))\nfrogs = list(map(int, input().split()))\nmosquitoes = list(map(int, input().split()))\n# calculate the amount of mosquitoes\n# that are smashed for each frog\nnum_smash = []\nfor frog in frogs:\n\tnum_smash.append(len([x for x in mosquitoes if x % frog == 0]))\nmin_smash = min(num_smash)\noutput = []\nfor i in range(len(num_smash)):\n\tif(num_smash[i] == min_smash):\n\t\toutput.append(i+1)\nprint(len(output))\nprint(\" \".join([str(x) for x in output]))", "n,m,k = map(int,input().split())\r\nd = list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\nans = []\r\ncheck = 1018\r\nfor i in range(len(d)):\r\n frog=d[i]\r\n c=0\r\n for j in range(len(m)):\r\n if m[j]%frog==0:\r\n c+=1\r\n if c<check:\r\n ans.clear()\r\n ans.append(i+1)\r\n check=c\r\n elif c==check:\r\n ans.append(i+1)\r\n c=check\r\nprint(len(ans))\r\nprint(ans)", "import sys\r\nimport math\r\n#input=lambda:sys.stdin.readline().rstrip()\r\n#def solve():\r\n#\tn,x=map(int,input().split())\r\n#\tA=list(map(int,input().split()))\r\n#\tB=sorted(A)\r\n\t#print(\"YES\" if A[n-x:x]==B[n-x:x] else \"NO\")\r\n#T=int(input())\r\n#for i in range(T):\r\n#\tsolve()\r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\ncontor=1\r\nmy_dict={}\r\n\r\nfor j in range(1,27):\r\n for i in range(1,27):\r\n if i!=j:\r\n element=alfabet_2[str(j)]+alfabet_2[str(i)]\r\n my_dict[element]=contor\r\n contor+=1\r\n \r\n#z=int(input())\r\nfor i in range(1):\r\n #n=int(input())\r\n #stringul=input()\r\n n,m,d=list(map(int,input().split()))\r\n \r\n jump=list(map(int,input().split()))\r\n mosq=list(map(int,input().split()))\r\n my_set=set()\r\n \r\n minimul=n\r\n for i in range(0,m):\r\n partial=0\r\n for j in range(0,d):\r\n if mosq[j]%jump[i]==0:\r\n partial+=1\r\n minimul=min(minimul,partial)\r\n \r\n cate=0\r\n for i in range(0,m):\r\n partial=0\r\n for j in range(0,d):\r\n if mosq[j]%jump[i]==0:\r\n partial+=1\r\n if partial==minimul:\r\n cate+=1\r\n my_set.add(i+1)\r\n \r\n print(cate)\r\n for s in my_set:\r\n print(s,end=' ')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "temp = input().split(' ')\nn = int(temp[0])\nm = int(temp[1])\nk = int(temp[2])\n\nd = []\nmsq = []\nnj = [0 for i in range(m)]\nnm = [0 for i in range(m)]\n\ntemp = input().split(' ')\nfor i in range(m):\n d.append(int(temp[i]))\ntemp = input().split(' ')\nfor i in range(k):\n msq.insert(0, int(temp[i]))\nfor i in range(len(d)):\n nn = n\n nj[i] = n//d[i]\n nm[i] = len([j for j in msq if (j/d[i]).is_integer()])\n\nminval = min(nm)\nmins = [i for i, j in enumerate(nm) if j == minval]\n\nprint(len(mins))\nfor i in range(len(mins)):\n print(mins[i]+1, end=' ')\nprint()\n\n", "n, m, k = map(int, input().split())\nA = list(map(int, input().split()))\nK = list(map(int, input().split()))\n\nANS = [-1] * m\n\nfor i in range(m):\n a = A[i]\n score = 0\n for k in K:\n if k % a == 0:\n score += 1\n ANS[i] = score\n\nMIN = min(ANS)\n\nALIST = []\nfor i in range(m):\n if ANS[i] == MIN:\n ALIST.append(i + 1)\n\nprint(len(ALIST))\nprint(ALIST)\n\n", "n, m, k = map(int, input().split())\r\n\r\njumps = list(map(int, input().split()))\r\nmos = list(map(int, input().split()))\r\n\r\nhash = {}\r\n\r\nfor x, frog in enumerate(jumps, start=1):\r\n count = 0\r\n for kill in mos:\r\n count += int(kill % frog == 0) \r\n hash[count] = hash.get(count, [])\r\n hash[count].append(x)\r\n\r\nans = min(hash)\r\nprint(len(hash[ans]))\r\nprint(hash[ans])", "n,m,k=input().split()\r\nfrog=list(map(int,input().split()))\r\nhill=list(map(int,input().split()))\r\nfrq=[0 for _ in range (0,int(m))]\r\nfor i1 in range (0,int(k)):\r\n for j1 in range (0,int(m)):\r\n if hill[i1]%frog[j1]==0:\r\n frq[j1]+=1\r\nl2=sorted(frq)\r\nans=[]\r\nfor i1 in range (0,int(m)):\r\n if frq[i1]==l2[0]:\r\n ans.append(str(i1+1))\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n \r\n \r\n", "n, m, k = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nmn = k\r\nans = []\r\nfor i in range(m) :\r\n res = 0\r\n for x in h :\r\n if x % d[i] == 0 :\r\n res += 1\r\n if res < mn :\r\n mn = res\r\n ans = [i+1]\r\n elif res == mn :\r\n ans.append(i+1)\r\n \r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))\r\n ", "n, m, k = map(int, input().split())\nfrogs = list(map(int, input().split()))\nmosquitoes = list(map(int, input().split()))\n\ndef get_smash(leap):\n result = 0\n for x in mosquitoes:\n if x % leap == 0:\n result += 1\n return result\n\nbest_smash = get_smash(frogs[0])\nbest_frogs = [1]\n\nfor i, frog in enumerate(frogs[1:]):\n smash = get_smash(frog)\n if smash == best_smash:\n best_frogs.append(i + 2)\n elif smash < best_smash:\n best_smash = smash\n best_frogs = [i + 2]\n\nprint(len(best_frogs))\nprint(' '.join(map(str, best_frogs)))\n", "\"\"\"\r\n// Author : snape_here - Susanta Mukherjee\r\n \r\n\"\"\"\r\n \r\nfrom __future__ import division, print_function\r\n \r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n \r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n \r\n \r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n \r\n \r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n \r\n \r\ndef read():\r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w') \r\n \r\n \r\nimport math\r\n\r\nfrom functools import reduce\r\n\r\ndef factorS(n): \r\n return set(reduce(list.__add__, \r\n ([i, n//i] for i in range(1, int(n*0.5) + 1) if n % i == 0)))\r\n \r\ndef divisorGen(n):\r\n factors = list(factorGenerator(n))\r\n nfactors = len(factors)\r\n f = [0] nfactors\r\n while True:\r\n yield reduce(lambda x, y: xy, [factors[x][0]f[x] for x in range(nfactors)], 1)\r\n i = 0\r\n while True:\r\n f[i] += 1\r\n if f[i] <= factors[i][1]:\r\n break\r\n f[i] = 0\r\n i += 1\r\n if i >= nfactors:\r\n return \r\n\r\nmod=100000007\r\n\r\ndef main():\r\n\r\n n,m,k=mi()\r\n d=li()\r\n l=li()\r\n a=[]\r\n for i in range(m):\r\n c=0\r\n for j in range(k):\r\n if l[j]%d[i]==0:\r\n c+=1 \r\n a.append(c)\r\n\r\n b=min(a)\r\n e=a.count(b)\r\n f=[]\r\n for i in range(m):\r\n if a[i]==b:\r\n f.append(i+1)\r\n print(e)\r\n print(f)\r\n\r\n\r\n# region fastio#\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\ndef print(args, kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n \r\n \r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n# endregion\r\n \r\n \r\nif __name__ == \"__main__\":\r\n #read()\r\n main() \r\n#Comment read()\r\n", "a = list(map(int, input().split()))\r\n\r\nb = list(map(int, input().split()))\r\n\r\nc = list(map(int, input().split()))\r\nt = []\r\nid = 1\r\nfor i in b:\r\n co = 0\r\n for j in c:\r\n if j % i == 0:\r\n co += 1\r\n t.append([co, id])\r\n id += 1\r\n\r\nt = sorted(t)\r\ne = []\r\nfor i in t:\r\n if i[0] == t[0][0]:\r\n e.append(i[1])\r\nprint(len(e))\r\nfor i in e:\r\n print(i, end=\" \")\r\n", "from collections import defaultdict\r\nimport math\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=[]\r\nansval=math.inf\r\nfor i in range(m):\r\n temp=0\r\n for j in b:\r\n if(j%a[i]==0):\r\n temp+=1\r\n if(temp<ansval):\r\n ansval=temp\r\n ans=[i+1]\r\n elif(temp==ansval):\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(ans)", "def chk(x):\r\n for i in range(m):\r\n if x%fgs[i]==0:\r\n ans[i]+=1\r\n \r\nn,m,k=[int(x) for x in input().split()]\r\nfgs=[int(x) for x in input().split()]\r\nct=0\r\nans=[0]m\r\n\r\nfor i in input().split():\r\n chk(int(i))\r\n\r\nmi=min(ans)\r\nprint(ans.count(mi))\r\nfor i in range(m):\r\n if ans[i]==mi:\r\n print(i+1,end=' ')\r\n", "def read_numbers():\r\n return [int(x) for x in input().split()]\r\n\r\ndef main():\r\n n, m, k = read_numbers()\r\n d = read_numbers()\r\n h = read_numbers()\r\n res = []\r\n min_count = 10 * 9\r\n\r\n for frog in enumerate(d, start=1):\r\n curr_count = 0\r\n for hill in h:\r\n if hill % frog[1] == 0:\r\n curr_count += 1\r\n if curr_count < min_count:\r\n min_count = curr_count\r\n res = [frog[0]]\r\n elif curr_count == min_count:\r\n res.append(frog[0])\r\n \r\n print(len(res))\r\n print(' '.join([str(x) for x in res]))\r\n\r\nif __name__ == '__main__':\r\n main()", "hills, f, m = map(int, input().split())\r\n\r\nfrogs = list(map(int, input().split()))\r\nkills = [0] * f\r\nmosquitoes = list(map(int, input().split()))\r\n\r\n\r\n\r\nfor mosquito in mosquitoes:\r\n for ind, frog in enumerate(frogs):\r\n if mosquito % frog == 0:\r\n kills[ind] += 1\r\n\r\nans = []\r\nminKill = min(kills)\r\nfor ind, frog in enumerate(frogs):\r\n if kills[ind] == minKill:\r\n ans.append(ind+1)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans))) ", "n, m, k = map(int, input().split())\r\nD = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nc = set(c)\r\nmas = []\r\nfor i in range(m):\r\n l = 0\r\n a = 0\r\n for j in c:\r\n if j % D[i] == 0:\r\n a += 1\r\n mas.append((a, 1+i))\r\nmas.sort()\r\np = [mas[0][1]]\r\nfor q in range(1, len(mas)):\r\n if mas[q][0] != mas[q-1][0]:\r\n break\r\n p.append(mas[q][1])\r\nprint(len(p))\r\nprint(p)", "n,m,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nans=[]\r\nmini=1018\r\nfor i in range(0,len(d)):\r\n frog=d[i]\r\n count=0\r\n for j in range(0,len(m)):\r\n if m[j]%frog==0:\r\n count+=1\r\n if count<mini:\r\n ans.clear()\r\n ans.append(i+1)\r\n mini=count\r\n elif count==mini:\r\n ans.append(i+1)\r\n count=mini\r\nprint(len(ans))\r\nprint(ans)" ]	{"inputs": ["5 3 5\n2 3 4\n1 2 3 4 5", "1000000000 2 3\n2 5\n999999995 999999998 999999996", "1 1 1\n1\n1", "2 2 1\n2 1\n1", "3 2 2\n2 4\n3 2", "10 3 6\n5 2 8\n5 6 7 8 9 10", "10 10 9\n10 9 8 7 6 5 4 3 2 1\n10 9 8 7 5 4 3 2 1", "20 3 5\n2 3 5\n2 5 6 10 15", "20 4 8\n1 2 3 4\n2 4 6 8 10 12 14 16", "10 5 5\n1 5 3 5 1\n1 6 5 7 2", "20 10 5\n1 12 6 11 9 21 15 16 8 9\n11 13 15 2 1", "20 10 10\n9 8 21 8 7 2 13 17 20 18\n7 16 20 3 6 1 11 18 15 17", "20 10 10\n6 17 14 12 13 15 6 14 16 17\n1 6 16 14 7 8 9 12 10 2", "100 30 30\n25 34 81 32 96 79 36 21 53 15 51 69 78 99 60 2 80 37 61 70 32 31 31 6 7 38 95 70 81 39\n1 50 75 8 90 69 13 57 6 4 60 19 94 52 45 42 95 88 21 22 96 2 56 61 31 78 7 62 68 72", "200 35 67\n152 112 102 46 54 189 56 76 10 39 157 6 84 188 122 117 51 163 6 50 195 34 44 178 28 32 100 67 74 48 88 100 91 50 91\n126 68 138 157 92 128 183 36 175 49 168 198 116 20 31 88 61 46 12 179 137 130 185 5 171 96 184 85 37 147 50 75 93 103 160 10 120 140 59 98 131 124 121 190 169 141 165 39 47 28 90 139 148 119 73 6 51 94 21 52 89 35 97 79 3 13 142", "200 72 29\n201 145 169 163 32 126 131 71 26 130 2 61 110 17 179 114 79 30 192 91 141 70 101 119 185 66 72 76 164 144 106 162 122 146 119 181 184 61 131 131 140 152 60 65 183 154 32 33 108 77 29 102 67 5 125 26 126 104 20 89 183 21 126 195 198 24 123 173 135 164 141 32\n160 65 136 22 194 110 155 138 92 118 87 40 49 191 190 99 157 3 23 17 34 123 31 81 67 86 196 45 109", "500 46 46\n363 441 170 289 389 394 488 72 332 285 445 185 221 183 397 175 98 192 202 16 123 436 336 260 212 229 459 473 66 19 445 153 476 234 396 159 289 137 331 18 268 224 71 133 196 7\n454 64 417 129 95 162 496 300 234 359 224 354 334 155 191 82 35 319 244 126 292 108 321 93 77 311 107 487 121 431 235 100 445 68 338 467 133 307 4 220 245 84 468 141 436 363", "1000 19 27\n656 162 264 790 579 786 877 998 516 247 650 150 858 281 279 549 354 353 533\n349 411 1 248 22 649 726 382 423 832 172 864 17 658 840 572 564 287 800 919 500 575 461 40 1000 383 624"], "outputs": ["2\n2 3", "1\n2", "1\n1", "1\n1", "1\n2", "1\n3", "1\n5", "1\n2", "1\n3", "3\n2 3 4", "7\n2 3 5 6 8 9 10", "2\n3 7", "4\n2 5 6 10", "11\n3 6 9 11 14 17 18 20 26 28 29", "17\n1 2 3 5 6 8 14 15 16 18 21 24 27 28 32 33 35", "59\n1 2 3 4 6 7 8 9 10 12 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 45 46 49 50 52 55 56 57 58 60 61 62 63 64 65 66 68 69 70 71", "35\n2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 21 23 24 25 26 27 28 29 32 33 35 36 37 38 39 41 43 45", "19\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19"]}	UNKNOWN	PYTHON3	CODEFORCES	39
d33ed0a7470768868bc662f77d990f03	Three matrices	Chubby Yang is studying linear equations right now. He came up with a nice problem. In the problem you are given an n<=×<=n matrix W, consisting of integers, and you should find two n<=×<=n matrices A and B, all the following conditions must hold: - Aij<==<=Aji, for all i,<=j (1<=≤<=i,<=j<=≤<=n); - Bij<==<=<=-<=Bji, for all i,<=j (1<=≤<=i,<=j<=≤<=n); - Wij<==<=Aij<=+<=Bij, for all i,<=j (1<=≤<=i,<=j<=≤<=n). Can you solve the problem? The first line contains an integer n (1<=≤<=n<=≤<=170). Each of the following n lines contains n integers. The j-th integer in the i-th line is Wij (0<=≤<=\|Wij\|<=<<=1717). The first n lines must contain matrix A. The next n lines must contain matrix B. Print the matrices in the format equal to format of matrix W in input. It is guaranteed that the answer exists. If there are multiple answers, you are allowed to print any of them. The answer will be considered correct if the absolute or relative error doesn't exceed 10<=-<=4. Sample Input 2 1 4 3 2 3 1 2 3 4 5 6 7 8 9 Sample Output 1.00000000 3.50000000 3.50000000 2.00000000 0.00000000 0.50000000 -0.50000000 0.00000000 1.00000000 3.00000000 5.00000000 3.00000000 5.00000000 7.00000000 5.00000000 7.00000000 9.00000000 0.00000000 -1.00000000 -2.00000000 1.00000000 0.00000000 -1.00000000 2.00000000 1.00000000 0.00000000	[ "n = int(input())\r\nW = []\r\nfor i in range(0, n):\r\n s = input().split(' ')\r\n w = list(map(int, s))\r\n W.append(w)\r\na = []\r\nb = []\r\nA = []\r\nB = []\r\ni = 0\r\n#while (i < n - 1):\r\n# for j in range(i+1, n):\r\n# a.append((W[i][j]+W[j][i])/2)\r\n# b.append((W[i][j]-W[j][i])/2)\r\n# i += 1\r\nwhile (i < n):\r\n for j in range(0, n):\r\n if i == j:\r\n a.append(W[i][j])\r\n b.append(0)\r\n elif i < j:\r\n a.append((W[i][j]+W[j][i])/2)\r\n b.append((W[i][j]-W[j][i])/2)\r\n else:\r\n a.append((W[j][i] + W[i][j]) / 2)\r\n b.append((W[i][j] - W[j][i]) / 2)\r\n i += 1\r\n#for i in range(0 , n):\r\n# A.append([W[i][i]])\r\n# B.append([0])\r\ns = []\r\nfor i in range(0, len(a)):\r\n if (i + 1) % n == 0:\r\n s.append(a[i])\r\n print(s, sep=' ')\r\n s = []\r\n else:\r\n s.append(a[i])\r\ns = []\r\nfor i in range(0, len(b)):\r\n if (i + 1) % n == 0:\r\n s.append(b[i])\r\n print(s, sep=' ')\r\n s = []\r\n else:\r\n s.append(b[i])\r\n", "n=int(input())\r\nlis=[]\r\nfor x in range(n):\r\n lis.append(list(map(int,input().split())))\r\n\r\nA=[]\r\nB=[]\r\nfor x in range(n):\r\n A.append([ (lis[x][i]+lis[i][x])/2 for i in range(n) ])\r\n B.append([lis[x][i]-A[x][i] for i in range(n)])\r\n\r\nfor x in A:\r\n for y in x:\r\n print(y,end=' ')\r\n print()\r\nfor x in B:\r\n for y in x:\r\n print(y,end=' ')\r\n print()", "n=int(input())\r\nw=[]\r\nfor i in range(n):\r\n w.append([int(i) for i in input().split()])\r\na=[[0 for i in range(n)]for j in range(n)]\r\nb=[[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n a[i][i]=w[i][i]\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n x=(w[i][j]+w[j][i])/2\r\n y=(w[i][j]-w[j][i])/2\r\n a[i][j]=x\r\n a[j][i]=x\r\n b[i][j]=y\r\n b[j][i]=-y\r\nfor i in a:\r\n for j in i:\r\n print(j,'',end='')\r\n print()\r\nfor i in b:\r\n for j in i:\r\n print(j,'',end='')\r\n print()", "def code():\r\n\tmat=[]\r\n\tn=int(input())\r\n\tfor i in range(n):\r\n\t\tt=input().split()\r\n\t\tmat.append(list(map(int,t)))\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tprint('%.8f'%((mat[i][j] + mat[j][i])/2),end=' ')\r\n\t\tprint()\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tprint('%.8f'%((mat[i][j] - mat[j][i])/2),end=' ')\r\n\t\tprint()\r\ncode()", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(float,input().split())))\r\na,b=[],[]\r\nfor i in range(n):\r\n d=[]\r\n for j in range(n):\r\n d.append(0.0)\r\n a.append(d)\r\nfor i in range(n):\r\n for j in range(n):\r\n x=l[i][j]+l[j][i]\r\n a[i][j]=x/2\r\n a[j][i]=x/2\r\nfor i in range(n):\r\n print(a[i])\r\nfor i in range(n):\r\n d=[]\r\n for j in range(n):\r\n d.append(0.0)\r\n b.append(d)\r\nfor i in range(n):\r\n for j in range(n):\r\n b[i][j]=l[i][j]-a[i][j]\r\n b[j][i]=l[j][i]-a[j][i]\r\nfor i in range(n):\r\n print(b[i])\r\n", "n=int(input())\r\nans=[list(map(int,input().split(\" \"))) for x in range(n)]\r\na=[[0 for x in range(n)] for x in range(n)]\r\nb=[[0 for x in range(n)] for x in range(n)]\r\nfor x in range(n):\r\n for y in range(n):\r\n if x==y:\r\n a[x][y]=ans[x][y]\r\n else:\r\n a[x][y]=(ans[x][y]+ans[y][x])/2\r\n b[x][y]=(ans[x][y]-ans[y][x])/2\r\nfor x in a:\r\n print(x)\r\nfor y in b:\r\n print(y)\r\n\r\n", "n = int(input())\r\n\r\nW = []\r\nfor j in range(n):\r\n\r\n k = input().split()\r\n\r\n for i in range(n):\r\n k[i] = int(k[i])\r\n\r\n W.append(k)\r\n\r\n\r\nA = []\r\n\r\nfor j in range(n):\r\n A.append([])\r\n for i in range(n):\r\n a = (W[j][i]+W[i][j])/2\r\n A[j].append(a)\r\n\r\n\r\nB = []\r\nfor j in range(n):\r\n B.append([])\r\n for i in range(n):\r\n b = (W[j][i]-W[i][j])/2\r\n B[j].append(b)\r\n\r\nfor i in A:\r\n print(i)\r\n\r\nfor i in B:\r\n print(i)\r\n", "n=int(input())\r\nw=[list(map(int,input().split()))for i in range(n)]\r\na=[[0for i in range(n)]for i in range(n)]\r\nb=[[0for i in range(n)]for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j]=(w[i][j]+w[j][i])/2\r\n b[i][j]=(w[i][j]-w[j][i])/2\r\nfor i in a:\r\n print(i)\r\nfor i in b:\r\n print(i)", "N = int(input())\r\nW = [0 for i in range(N)]\r\nfor i in range(N):\r\n\tW[i] = list(map(int, input().split()))\r\nA = [[0 for i in range(N)] for i in range(N)]\r\nB = [[0 for i in range(N)] for i in range(N)]\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tA[i][j] = (W[i][j] + W[j][i]) / 2\r\n\t\tB[i][j] = W[i][j] - A[i][j]\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tprint(A[i][j], end = ' ')\r\n\tprint()\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tprint(B[i][j], end = ' ')\r\n\tprint()", "l=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\na=[[0 for i in range(n)] for j in range(n)]\r\nb=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = (l[i][j]+l[j][i])/2\r\nfor i in range(n):\r\n for j in range(n):\r\n print(a[i][j],end=\" \")\r\n b[i][j]=l[i][j]-a[i][j]\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(b[i][j],end=\" \")\r\n \r\n print()\r\n\r\n\r\n", "n = int(input())\r\nmat = []\r\nmat1 = []\r\nmat2 = []\r\nfor _ in range(n):\r\n t = list(map(int, input().split()))\r\n mat.append(t)\r\nfor i in range(n):\r\n m = []\r\n m1 = []\r\n for j in range(n):\r\n if(i==j):\r\n m.append(\"{0:.8f}\".format(mat[i][j]))\r\n m1.append(\"{0:.8f}\".format(0))\r\n elif(i<j):\r\n a = (mat[i][j] + mat[j][i])/2\r\n m.append(\"{0:.8f}\".format(a))\r\n m1.append(\"{0:.8f}\".format(mat[i][j] - a))\r\n else:\r\n m.append(mat1[j][i])\r\n if(mat2[j][i][0] != \"-\"):\r\n m1.append(\"-\"+(mat2[j][i]))\r\n else:\r\n m1.append(mat2[j][i][1:])\r\n mat1.append(m)\r\n mat2.append(m1)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat1[i][j],end=\" \")\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat2[i][j],end=\" \")\r\n print()", "n = int(input())\r\nlst = [[int(x) for x in input().split()] for i in range(n)]\r\nt = [[0] * n for y in range(n)]\r\nfor i in range(n):\r\n t[i][i], lst[i][i] = lst[i][i], 0\r\n for j in range(i + 1, n):\r\n t[j][i] = t[i][j] = d = (lst[i][j] + lst[j][i]) / 2\r\n lst[i][j] -= d\r\n lst[j][i] -= d\r\nfor i in t:\r\n print(' '.join(map(str, i)))\r\nfor i in lst:\r\n print(' '.join(map(str, i)))\r\n\r\n", "import sys\r\nfrom os import path\r\nfrom collections import Counter\r\nif(path.exists(\"inp.txt\")):\r\n\tsys.stdin = open(\"inp.txt\",'r')\r\n\tsys.stdout = open(\"out.txt\",'w')\r\nimport math\r\nn=int(input())\r\nw=[]\r\nli=[0]((2n)-1)\r\nfor i in range(n):\r\n\ttemp=list(map(int,input().split()))\r\n\tw.append(temp)\r\na=[[0 for i in range(n)] for j in range(n)]\r\nb=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\ta[i][j]=(w[i][j]+w[j][i])/2\r\n\t\tb[i][j]=(w[i][j]-w[j][i])/2\r\nfor i in a:\r\n\tprint(i)\r\nfor i in b:\r\n\tprint(i)", "n=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\n\r\nb=[[0 for j in range(n)] for i in range(n)]\r\nc=[[0 for j in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if(i==j):\r\n b[i][j]=a[i][j]/1\r\n else:\r\n x=(a[i][j]+a[j][i])/2\r\n b[i][j]=x\r\n b[j][i]=x\r\n c[i][j]=a[i][j]-x\r\n c[j][i]=a[j][i]-x\r\nfor i in b:\r\n for j in i:\r\n print(\"{0:.8f}\".format(j),end=\" \")\r\n print() \r\n \r\nfor i in c:\r\n for j in i:\r\n print(\"{0:.8f}\".format(j),end=\" \")\r\n print() ", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n mat.append(l)\r\nx=[[False]n for i in range(n)]\r\ny=[[False]n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]==False:\r\n k=mat[i][j]+mat[j][i]\r\n x[i][j]=k/2\r\n x[j][i]=k/2\r\nfor i in range(n):\r\n for j in range(n):\r\n if y[i][j]==False:\r\n if mat[i][j]>x[i][j]:\r\n y[i][j]=-(x[i][j]-mat[i][j])\r\n y[j][i]=x[i][j]-mat[i][j]\r\n elif mat[i][j]==x[i][j]:\r\n y[i][j]=mat[i][j]-x[i][j]\r\n y[j][i]=mat[i][j]-x[i][j]\r\n else:\r\n y[i][j]=mat[i][j]-x[i][j]\r\n y[j][i]=-(mat[i][j]-x[i][j])\r\nfor i in range(n):\r\n for j in range(n):\r\n print('%.8f'%x[i][j],end=\" \")\r\n print(\"\")\r\nfor i in range(n):\r\n for j in range(n):\r\n print('%.8f'%y[i][j],end=\" \")\r\n print(\"\")\r\n", "def transpose(m, d):\r\n new = []\r\n for i in range(d):\r\n new.append([m[j][i] for j in range(d)])\r\n return new\r\n\r\ndef sum(a,b, dim):\r\n new = []\r\n for i in range(dim):\r\n new.append([(a[i][j]+b[i][j])/2 for j in range(dim)])\r\n return new\r\n \r\ndef diff(a,b, dim):\r\n new = []\r\n for i in range(dim):\r\n new.append([(a[i][j]-b[i][j])/2 for j in range(dim)])\r\n return new\r\n \r\ndef print_matrix(a,dim):\r\n for i in range(dim):\r\n row = ''\r\n for j in range(dim):\r\n row+= str(a[i][j])\r\n row+=' '\r\n print(row)\r\n\r\ndim = int(input())\r\nw = []\r\nfor _ in range(dim):\r\n w.append([int(i) for i in input().split()])\r\nwt = transpose(w, dim)\r\nprint_matrix(sum(w, wt, dim), dim)\r\nprint_matrix(diff(w,wt,dim), dim)\r\n", "# import numpy as np\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr1 = [int(x) for x in input().split()]\r\n arr.append(arr1)\r\ndasharr = [[None for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n dasharr[i][j] = arr[j][i]\r\na = [[None for i in range(n)] for i in range(n)]\r\nb = [[None for i in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = arr[i][j]/2 + dasharr[i][j]/2\r\n b[i][j] = arr[i][j]/2 - dasharr[i][j]/2\r\n# print(dasharr) \r\nfor sub in a :\r\n print(sub)\r\nfor sub in b:\r\n print(sub)\r\n\r\n\r\n", "R = lambda: list(map(int, input().split()))\r\nn = int(input())\r\nw = [R() for _ in ' 'n]\r\nwd = [[0]n for _ in ' 'n]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n wd[i][j] = w[j][i]\r\n \r\na = [[0]n for _ in ' 'n]\r\nb = [[0]n for _ in ' 'n]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = (w[i][j] + wd[i][j])/2\r\n b[i][j] = (w[i][j] - wd[i][j])/2\r\n\r\nfor i in a: print(i)\r\nfor i in b: print(i)", "\r\n\r\nn = int(input())\r\n\r\nw = []\r\nfor i in range(n):\r\n wi = [int(x) for x in input().split()]\r\n w.append(wi)\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n r1 = []\r\n r2 = []\r\n for j in range(n):\r\n if i<j:\r\n a1 = (w[i][j]+w[j][i])/2\r\n b1 = (w[i][j]-w[j][i])/2\r\n elif i>j:\r\n a1 = (w[i][j]+w[j][i])/2\r\n b1 = (w[i][j]-w[j][i])/2\r\n else:\r\n a1 = w[i][j]\r\n b1 = 0\r\n r1.append(a1)\r\n r2.append(b1)\r\n a.append(r1)\r\n b.append(r2)\r\n\r\nfor i in range(n):\r\n print(a[i])\r\n\r\nfor i in range(n):\r\n print(b[i])\r\n", "n=int(input())\r\na=[[] for i in range(n)]\r\narr1=[[None for i in range(n)] for i in range(n)]\r\narr2=[[None for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n for item in x:\r\n a[i].append(item)\r\nfor i in range(n):\r\n for j in range(n):\r\n arr1[i][j]=(float(a[i][j]+a[j][i]))/2\r\n arr2[i][j]=(float(a[i][j]-a[j][i]))/2\r\nfor i in range(n):\r\n print(arr1[i])\r\nfor i in range(n):\r\n print(arr2[i])\r\n ", "def Add(string):\r\n\tl = string.split(\".\")\r\n\ts = l[1]\r\n\tif len(s)<8:\r\n\t\ts1 = \"0\"\r\n\t\ts1 = s1 (8-len(s))\r\n\t\ts += s1\r\n\telif len(s)>=8:\r\n\t\ts = s[:8]\r\n\tstring = l[0] + \".\" +s\r\n\treturn string\r\n\t\t\r\nn = int(input())\r\nli = []\r\nfor i in range(n):\r\n\tstring = input()\r\n\tl = string.split()\r\n\tfor j in range(len(l)):\r\n\t\tl[j] = int(l[j])\r\n\tli.append(l)\r\n\r\nA = []\r\nfor i in range(n):\r\n\tl = [0]\r\n\tl = ln\r\n\tA.append(l)\r\nB = []\r\nfor i in range(n):\r\n\tl = [0]\r\n\tl = ln\r\n\tB.append(l)\r\nfor i in range(n):\r\n\tA[i][i] = float(li[i][i])\r\n\r\nfor i in range(n):\r\n\tfor j in range(0,i+1):\r\n\t\tif i!=j:\r\n\t\t\tk = li[j][i] - li[i][j]\r\n\t\t\tk = k/2\r\n\t\t\tA[j][i] = float(li[j][i]) - k\r\n\t\t\tA[i][j] = float(li[i][j]) + k\r\n\t\t\tB[j][i] = float(B[j][i]) + k\r\n\t\t\tB[i][j] = float(B[i][j]) - k\r\n\t\t\t\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tA[i][j] = Add(str(float(A[i][j])))\r\n\t\tB[i][j] = Add(str(float(B[i][j])))\r\n\r\nfor i in range(n):\r\n\tstring = \"\"\r\n\tfor j in range(n):\r\n\t\tstring += A[i][j]+\" \"\r\n\tprint(string)\r\nfor i in range(n):\r\n\tstring = \"\"\r\n\tfor j in range(n):\r\n\t\tstring += B[i][j]+\" \"\r\n\tprint(string)\r\n\t\t", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\nn = int(input())\nmatrix = [] \nfor i in range(n):\n listA = input().split()\n for i in range(0,len(listA)):\n listA[i] = int(listA[i])\n matrix.append(listA)\nmatAt = [[0 for x in range(n)] for y in range(n)]\nmatBt = [[0 for x in range(n)] for y in range(n)]\nfor i in range(n):\n for j in range(n):\n matAt[i][j] = matrix[j][i]\n matAt[i][j] = float(matAt[i][j] + matrix[i][j])/2\nfor i in range(n):\n for j in range(n):\n matBt[i][j] = 0 - matrix[j][i]\n matBt[i][j] = float(matBt[i][j] + matrix[i][j])/2\n\nfor i in range(n):\n print(matAt[i])\nfor i in range(n):\n print(matBt[i])\n\n", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n temp=list(map(int,input().split()))\r\n mat.append(temp)\r\na,b=[],[]\r\nfor i in range(n):\r\n x=[]\r\n for j in range(n):\r\n if i==j:\r\n v=\"{0:.8f}\".format(mat[i][j])\r\n x.append(v)\r\n else:\r\n v=\"{0:.8f}\".format((mat[i][j]+mat[j][i])/2)\r\n x.append(v)\r\n a.append(x)\r\n\r\nfor i in range(n):\r\n x=[]\r\n for j in range(n):\r\n if i==j:\r\n v=\"{0:.8f}\".format(0)\r\n x.append(v)\r\n else:\r\n v=\"{0:.8f}\".format(mat[i][j]-float(a[i][j]))\r\n x.append(v)\r\n b.append(x)\r\nfor i in a:\r\n print(i)\r\nfor i in b:\r\n print(i)\r\n\r\n ", "n=int(input())\r\nh=[]\r\n\r\nfor i in range(n):\r\n g=[int(r) for r in input().split()]\r\n h.append(g)\r\n \r\nb=[]\r\nfor i in range(n):\r\n b.append([0]n)\r\n \r\ns=[]\r\nfor i in range(n):\r\n s.append([0]n)\r\nt=[]\r\nfor i in range(n):\r\n t.append([0]n)\r\nfor i in range(n):\r\n for j in range(n):\r\n b[i][j]=h[j][i]\r\nfor i in range(n):\r\n for j in range(n):\r\n s[i][j]=(b[i][j]+h[i][j])/2\r\nfor i in range(n):\r\n for j in range(n):\r\n t[i][j]=(h[i][j]-b[i][j])/2\r\n\r\nfor i in s:\r\n print('\\n')\r\n for j in i:\r\n print(j,end=' ')\r\n \r\nfor i in t:\r\n print('\\n')\r\n for j in i:\r\n print(j,end=' ')", "n = int(input())\r\nif n == 1:\r\n print(int(input()))\r\n print(0)\r\n exit()\r\narr = [list(map(int, input().split(' '))) for _ in range(n)]\r\na = [[0]n for _ in range(n)]\r\nb = [[0]n for _ in range(n)]\r\nfor i in range(n):\r\n a[i][i] = arr[i][i]\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n a[i][j] = (arr[i][j] + arr[j][i]) / 2\r\n a[j][i] = (arr[i][j] + arr[j][i]) / 2\r\n b[i][j] = (arr[i][j] - arr[j][i]) / 2\r\n b[j][i] = -(arr[i][j] - arr[j][i]) / 2\r\nfor i in a: print(i)\r\nfor i in b: print(i)\r\n", "\r\nn = int(input())\r\nl = []\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n k = list(map(int,input().split()))\r\n l.append(k)\r\n l1.append([0]len(k))\r\n l2.append([0]len(k))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n l1[i][j] = (l[i][j]+l[j][i])/2\r\n l2[i][j] = (l[i][j]-l[j][i])/2\r\n\r\nfor i in range(n):\r\n print(l1[i])\r\nfor i in range(n):\r\n print(l2[i])\r\n\r\n\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n c = list(map(int, input().split()))\r\n l.append(c)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append([-99999]n)\r\n b.append([-99999]n)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n a[i][j] = l[i][j]\r\n b[i][j] = 0\r\n elif a[i][j]==-99999:\r\n a[i][j] = a[j][i]= (l[i][j]+l[j][i])/2\r\n b[i][j] = (l[i][j]-l[j][i])/2\r\n b[j][i] = -1(l[i][j]-l[j][i])/2\r\nfor i in a:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\nfor i in b:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n w = []\r\n for i in range(n):\r\n w.append(list(map(int, input().split())))\r\n a=[]\r\n b=[]\r\n for i in range(n):\r\n a.append([0.0]n)\r\n b.append([0.0]n)\r\n for i in range(n):\r\n for j in range(i, n):\r\n a[i][j] = (w[i][j] + w[j][i]) / 2\r\n a[j][i] = a[i][j]\r\n b[i][j] = w[i][j] - a[i][j]\r\n b[j][i] = w[j][i] - a[j][i]\r\n for i in range(n):\r\n print(\" \".join(list(map(str, a[i]))))\r\n for i in range(n):\r\n print(\" \".join(list(map(str, b[i]))))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nb=[[0]n for _ in range(n)]\r\nc=[[0]n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j: b[i][j]=a[i][j]\r\n else:\r\n k=a[i][j]+a[j][i]\r\n b[i][j]=k/2\r\n b[j][i]=k/2\r\n c[i][j]=a[i][j]-b[i][j]\r\n c[j][i]=a[j][i]-b[j][i]\r\nfor i in range(n):\r\n for j in range(n):\r\n print(b[i][j],end=' ')\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(c[i][j],end=' ')\r\n print()", "def printMatrix(matrix):\r\n for matrixrow in matrix:\r\n row=''\r\n for value in matrixrow:\r\n row+=str(value)+' '\r\n print(row)\r\nn=int(input())\r\nw=[[0 for i in range(n)] for i in range(n)]\r\na=[[0 for i in range(n)] for i in range(n)]\r\nb=[[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n row=input().split(' ')\r\n for e in range(n):\r\n w[i][e]=int(row[e])\r\nfor i in range(n):\r\n for e in range(n):\r\n a[e][i]=a[i][e]=(w[i][e]+w[e][i])/2\r\n b[e][i]=w[e][i]-a[e][i]\r\nprintMatrix(a)\r\nprintMatrix(b)", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n\tarr.append(list(map(int,input().split())))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n\ta.append([])\r\n\tb.append([])\r\n\tfor j in range(n):\r\n\t\ta[i].append((arr[i][j]+arr[j][i])/2)\r\n\t\tb[i].append(arr[i][j]-a[i][j])\r\nfor i in range(n):\r\n\tprint(a[i])\r\nfor i in range(n):\r\n\tprint(b[i])\r\n", "# input\r\nn = int(input())\r\nmatrix = []\r\na = n\r\nwhile a>0:\r\n x = []\r\n x = input().split()\r\n matrix.append(x)\r\n a -= 1\r\n\r\n# A\r\na = 0\r\nwhile a<n:\r\n b = 0\r\n out = ''\r\n while b<n:\r\n if a == b:\r\n if b == 0:\r\n out = str(float(matrix[a][b]))\r\n else:\r\n out += ' ' + str(float(matrix[a][b]))\r\n else:\r\n if b == 0:\r\n out = str((float(matrix[a][b]) + float(matrix[b][a]))/2)\r\n else:\r\n out += ' ' + str((float(matrix[a][b]) + float(matrix[b][a]))/2)\r\n b += 1\r\n print(out)\r\n a += 1\r\n\r\n\r\n# B\r\na = 0\r\nwhile a<n:\r\n b = 0\r\n out = ''\r\n while b<n:\r\n if a == b:\r\n if b == 0:\r\n out = str(float(0))\r\n else:\r\n out += ' ' + str(float(0))\r\n else:\r\n if b == 0:\r\n out = str((float(matrix[a][b]) - float(matrix[b][a]))/2)\r\n else:\r\n out += ' ' + str((float(matrix[a][b]) - float(matrix[b][a]))/2)\r\n b += 1\r\n print(out)\r\n a += 1", "W = []\nfor _ in range(int(input())):\n W.append(list(map(int, input().split())))\n\na, b = [], []\nfor i in range(len(W)):\n t1, t2 = [], []\n for j in range(len(W)):\n t1.append((W[i][j]+W[j][i])/2), t2.append((W[i][j]-W[j][i])/2)\n a.append(t1), b.append(t2)\n\nlist(map(lambda x: print(*x), a+b))\n", "size = int(input())\r\nw = []\r\n\r\nfor enu in range(size):\r\n temp = input().split()\r\n w.append(list(map(int, temp)))\r\nA = [[0 for i in range(size)] for j in range(size)]\r\nB = [[0 for i in range(size)] for j in range(size)]\r\nfor i in range(size):\r\n for j in range(i, size):\r\n A[i][j] = (w[i][j] + w[j][i]) / 2\r\n B[i][j] = (w[i][j] - w[j][i]) / 2\r\n A[j][i] = A[i][j]\r\n B[j][i] = -B[i][j]\r\ndef pr(A):\r\n global size\r\n for i in range(size):\r\n for j in range(size - 1):\r\n print(\"%.8f\" % A[i][j], end = ' ')\r\n print('%.8f' % A[i][-1])\r\npr(A)\r\npr(B)" ]	{"inputs": ["2\n1 4\n3 2", "3\n1 2 3\n4 5 6\n7 8 9", "8\n62 567 1382 1279 728 1267 1262 568\n77 827 717 1696 774 248 822 1266\n563 612 995 424 1643 1197 338 1141\n1579 806 1254 468 184 1571 716 772\n1087 182 1312 772 605 1674 720 1349\n1393 988 873 157 403 301 1519 1192\n1085 625 1395 1087 847 1360 1004 594\n1368 1056 916 839 472 840 53 1238", "7\n926 41 1489 72 749 375 940\n464 1148 858 1010 285 1469 1506\n1112 1087 225 917 480 511 1090\n759 945 627 230 220 1456 529\n318 83 203 134 1192 1167 6\n440 1158 1614 683 1358 1140 1196\n1175 900 126 1562 1220 813 148", "1\n1", "1\n0", "2\n0 0\n0 0", "2\n0 1\n0 1"], "outputs": ["1.00000000 3.50000000\n3.50000000 2.00000000\n0.00000000 0.50000000\n-0.50000000 0.00000000", "1.00000000 3.00000000 5.00000000\n3.00000000 5.00000000 7.00000000\n5.00000000 7.00000000 9.00000000\n0.00000000 -1.00000000 -2.00000000\n1.00000000 0.00000000 -1.00000000\n2.00000000 1.00000000 0.00000000", "62.00000000 322.00000000 972.50000000 1429.00000000 907.50000000 1330.00000000 1173.50000000 968.00000000\n322.00000000 827.00000000 664.50000000 1251.00000000 478.00000000 618.00000000 723.50000000 1161.00000000\n972.50000000 664.50000000 995.00000000 839.00000000 1477.50000000 1035.00000000 866.50000000 1028.50000000\n1429.00000000 1251.00000000 839.00000000 468.00000000 478.00000000 864.00000000 901.50000000 805.50000000\n907.50000000 478.00000000 1477.50000000 478.00000000 605.00000000 1038.50000000 78...", "926.00000000 252.50000000 1300.50000000 415.50000000 533.50000000 407.50000000 1057.50000000\n252.50000000 1148.00000000 972.50000000 977.50000000 184.00000000 1313.50000000 1203.00000000\n1300.50000000 972.50000000 225.00000000 772.00000000 341.50000000 1062.50000000 608.00000000\n415.50000000 977.50000000 772.00000000 230.00000000 177.00000000 1069.50000000 1045.50000000\n533.50000000 184.00000000 341.50000000 177.00000000 1192.00000000 1262.50000000 613.00000000\n407.50000000 1313.50000000 1062.50000000...", "1.00000000\n0.00000000", "0.00000000\n0.00000000", "0.00000000 0.00000000\n0.00000000 0.00000000\n0.00000000 0.00000000\n0.00000000 0.00000000", "0.00000000 0.50000000\n0.50000000 1.00000000\n0.00000000 0.50000000\n-0.50000000 0.00000000"]}	UNKNOWN	PYTHON3	CODEFORCES	34
d34fce590c9ab5f1c4b730f672fac6e8	Friends Meeting	Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the point x1<==<=a, another one is in the point x2<==<=b. Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third — by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1<=+<=2<=+<=3<==<=6. The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point. The first line contains a single integer a (1<=≤<=a<=≤<=1000) — the initial position of the first friend. The second line contains a single integer b (1<=≤<=b<=≤<=1000) — the initial position of the second friend. It is guaranteed that a<=≠<=b. Print the minimum possible total tiredness if the friends meet in the same point. Sample Input 3 4 101 99 5 10 Sample Output 1 2 9	[ "import math\r\na = int(input())\r\nb = int(input())\r\nz = math.fabs(a-b)//2\r\nn = 0\r\nfor i in range(int((math.fabs(a-b)-z))+1):\r\n n+=i\r\nfor i in range(int(z)+1):\r\n n+=i\r\nprint(n)", "def arithm_sum(a, n, d):\r\n return int(n/2 * (2a+(n-1)d))\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndistance = abs(a-b)\r\n\r\nif distance == 1:\r\n print(1)\r\nelse:\r\n a_dist = distance//2\r\n b_dist = distance - a_dist\r\n # print(a_dist, b_dist)\r\n\r\n a_tiredness = arithm_sum(1, a_dist, 1)\r\n b_tiredness = arithm_sum(1, b_dist, 1)\r\n # print(a_tiredness, b_tiredness)\r\n\r\n total = a_tiredness+b_tiredness\r\n print(total)\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_strList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\na = get_int()\r\nb = get_int()\r\n\r\nd = (a+b)//2\r\nfirst = abs(d-a)\r\nsecond = abs(b-d)\r\n\r\nprint( first(first+1)//2 + second(second+1)//2)", "a, b = int(input()), int(input())\r\nc = abs(a-b)\r\nd = c // 2\r\nprint(d * (d+1) if c % 2 == 0 else (d+1) ** 2)", "a =int(input())\r\nb=int(input())\r\nmid = (a+b)//2\r\na1 = abs(mid - a)\r\nb1= abs(mid - b)\r\ndef summ(k):\r\n sum=0\r\n while(k>0):\r\n sum+=k\r\n k-=1\r\n return sum\r\n\r\nprint(summ(a1)+summ(b1))", "a = int(input())\r\nb = int(input())\r\ndiff = max(a,b) - min(a,b)\r\nsummation = 0\r\nif diff % 2== 0:\r\n for i in range(1,diff//2+1):\r\n summation += i\r\n summation = 2\r\nelse:\r\n for i in range(1,diff//2+1):\r\n summation += i\r\n summation = 2\r\n summation += diff//2 + 1\r\nprint(summation)", "a = int(input())\r\nb = int(input())\r\nc = (abs(a - b) + 1) // 2\r\ns = 0\r\nfor i in range(1, c + 1):\r\n s += i\r\nif (a - b) % 2:\r\n print(2 * s - c)\r\nelse:\r\n print(2 * s)\r\n", "a = int(input())\r\nb = int(input())\r\nhealth = 0\r\ni = 1\r\nif a > b :\r\n x = (a - b )// 2 + b\r\n while a != b:\r\n if a != x:\r\n a -= 1\r\n health += i\r\n if b != x:\r\n b += 1\r\n health += i\r\n i += 1\r\nelse:\r\n x = (b - a ) // 2 + a\r\n while a != b:\r\n if a != x:\r\n a += 1\r\n health += i\r\n if b != x:\r\n health += i\r\n b -= 1\r\n i += 1\r\nprint(health)", "def get_natural_sum(n):\r\n return n * (n+1) // 2\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nn1, n2 = max(a, b), min(a, b)\r\n\r\ndist_a = (n1 - n2) // 2\r\ndist_b = (n1 - n2) - dist_a\r\n\r\nprint(get_natural_sum(dist_a) + get_natural_sum(dist_b))", "def okaj(xxx):\r\n xxx= int(xxx)\r\n j=0; jog=0\r\n li=[]\r\n for i in range(1,1001):\r\n if i%2==1:\r\n j+=1\r\n jog +=j\r\n li.append(jog)\r\n \r\n return li[xxx-1]\r\n\r\na= int(input())\r\nb= int(input())\r\nc= abs(a-b)\r\nprint(okaj(c))", "def abs(x):\r\n if x>0:\r\n return x\r\n return -x\r\nn=int(input())\r\nm=int(input())\r\nprint(((abs(m-n)+1)//2)(abs(m-n)//2+1))", "\r\na = int(input())\r\nb = int(input())\r\n\r\nx = (a + b) // 2\r\n\r\nn1 = abs(a - x)\r\nres1 = n1 (n1 + 1) // 2\r\n\r\nn2 = abs(b - x)\r\nres2 = n2 * (n2 + 1 ) // 2\r\n\r\nprint(res1 + res2 )\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nif b>a:\r\n a,b=b,a\r\nd=a-b\r\nif d%2==0:\r\n print(int(2((d/2)((d/2)+1)/2)))\r\nelse:\r\n print(int((2((d//2)((d//2)+1)/2))+((d//2)+1)))\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nl=int((a+b)/2)\r\nc=0\r\nfor i in range(1,abs(l-a)+1):\r\n\tc+=i\r\nfor i in range(1,abs(l-b)+1):\r\n\tc+=i\r\nprint(c)", "a,b=int(input()),int(input())\r\nd=min(a,b)+abs(a-b)//2\r\ntiredness=0\r\nfor i in range(1,abs(d-a)+1):\r\n tiredness+=i\r\nfor i in range(1,abs(d-b)+1):\r\n tiredness+=i\r\nprint(tiredness)", "n1 = int(input())\r\nn2 = int(input())\r\nprint((abs(n1-n2)+1)*2//4)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b: a, b = b, a\r\nmid = (a+b)//2\r\ntiredeness = 0\r\n\r\nfactor = 1\r\nfor _ in range(a, mid):\r\n tiredeness += factor\r\n factor += 1\r\n\r\nfactor = 1\r\nfor _ in range(mid, b):\r\n tiredeness += factor\r\n factor += 1\r\n \r\nprint(tiredeness)", "a = int(input())\r\nb = int(input())\r\nx = (a + b) // 2\r\nprint(abs(a - x) (abs(a - x) + 1) // 2 + abs(b - x) * (abs(b - x) + 1) // 2)\r\n", "x=int(input())\r\ny=int(input())\r\nd=abs(x-y)\r\nc=d//2\r\nr=c(c+1)\r\nif(d%2==0):\r\n print(r)\r\nelse:\r\n print(r+(d+1)//2)\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nsum1 = 0\r\nsum2 = 0\r\nif (b - a) % 2 == 0: \r\n st1 = int((b - a)0.5) + 1\r\n st2 = int((b - a)0.5) + 1\r\nelse:\r\n st1 = int((b - a)0.5 + 1.5)\r\n st2 = int((b - a)0.5 + 0.5)\r\nfor i in range(1, st1): sum1 += i\r\nfor i in range(1, st2): sum2 += i\r\nprint(sum1 + sum2)", "a, b = int(input()), int(input())\r\nc = abs(a - b)\r\nif c % 2 == 1:\r\n print((c + 1) // 2 + (c // 2) (c // 2 + 1))\r\nelse:\r\n print((c // 2) * (c // 2 + 1))\r\n", "a = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\nf = 0\r\nft = 0\r\nm = n\r\n\r\nif n % 2 > 0:\r\n m = n + 1\r\n\r\nfor i in range(1, (m//2)+1):\r\n\r\n f = 2 * i\r\n ft = ft + f\r\n\r\nif n % 2 > 0:\r\n\r\n ft = ft - (f//2)\r\n\r\nprint(ft)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b: \r\n a, b = b, a\r\nl = b - a\r\nA = l//2\r\nB = l - A\r\nprint((A(A+1))//2 + (B(B+1))//2)\r\n", "a=int(input())\r\nb=int(input())\r\nminval=min(a,b)\r\nmaxval=max(a,b)\r\ndiff=abs(a-b)\r\ncnt=0\r\nfor i in range(1,diff+1):\r\n\tif minval==maxval:\r\n\t\tbreak\r\n\tminval+=1\r\n\tcnt+=i\r\n\tif minval==maxval:\r\n\t\tbreak\r\n\tmaxval-=1\r\n\tcnt+=i\r\nprint(cnt)", "a = int(input())\r\n\r\nb = int(input())\r\n\r\ndiff = abs (a-b)\r\n\r\n\r\nif diff % 2 == 0:\r\n steps = int(diff / 2)\r\n tiredness = 0\r\n for i in range (1, steps+1):\r\n tiredness +=i\r\n print (tiredness2)\r\nelse:\r\n steps = int(diff // 2)\r\n tiredness = 0\r\n for i in range (1, steps+1):\r\n tiredness +=i\r\n print (tiredness2 + (steps+1))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[94]:\n\n\na = int(input())\nb = int(input())\n\nc = 0\n\nr = abs(a-b)+1\n\nfor i in range(1,r):\n if a>b:\n a=a-1\n c = c+i\n if a == b:\n print(c)\n else:\n b=b+1\n c = c+i\n if a==b:\n print(c)\n elif a<b:\n a=a+1\n c = c+i\n if a == b:\n print(c)\n else:\n b=b-1\n c = c+i\n if a==b:\n print(c)\n \n\n", "a = int(input())\nb = int(input())\ndef t(x):\n return x(x+1)//2\nm = (a+b)//2\nd1= abs(a-m)\nd2= abs(b-m)\nprint(t(d1)+t(d2))\n", "#A. Friends Meeting\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\n#print(d)\r\nif d==1:\r\n print(1)\r\nelse:\r\n ad=int(d/2)\r\n #print(ad)\r\n bd=d-(int(d/2))\r\n #print(bd)\r\n ad1=ad(ad+1)/2\r\n #print(ad1)\r\n bd1=bd(bd+1)/2\r\n print(int(ad1+bd1))", "a=int(input())\r\nb=int(input())\r\nn=max(b-a,a-b)\r\nm=n//2\r\nliststep=[]\r\nfor i in range(1,n):\r\n liststep.append(i)\r\nif n==1:\r\n tired=1\r\nelif n%2==0:\r\n tired=m(m+1)\r\nelif n%2!=0:\r\n tired=m(m+1)+liststep[m]\r\nprint(tired) \r\n ", "a = int(input())\r\nb = int(input())\r\nbest = 1018\r\ndef dist(a, b):\r\n l = max(a - b, b - a)\r\n if l == 0: return 0\r\n return l (l + 1) // 2\r\nfor x in range(1, 2000):\r\n best = min(best, dist(x, a) + dist(x, b))\r\nprint(best)\r\n", "n = int(input())\r\nm = int(input())\r\nl = abs(m - n) // 2\r\na = l\r\nb = abs(m - n) - l\r\nans = 0\r\nfor i in range(a + 1):\r\n ans += i\r\nfor i in range(b + 1):\r\n ans += i\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nbetween = abs(b - a)\r\ndistances = between / 2\r\nans = 0\r\nh = distances + 0.5\r\nl = distances - 0.5\r\nif distances % 1 == 0:\r\n ans = distances * (distances + 1)\r\nelse:\r\n ans = ((l * (l + 1)) / 2) + ((h * (h + 1)) / 2)\r\nprint(int(ans))", "def energy(n):\r\n x = (n(n+1))//2\r\n return x\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nc = (a+b)//2\r\n\r\np = (energy(abs(a-c))) + (energy(abs(b-c)))\r\nprint(p)\r\n", "n=int(input())\r\nm=int(input())\r\nA=[]\r\n\r\nif n>m:\r\n s=n-m\r\nelse:\r\n s=m-n\r\nif s%2==0:\r\n g=s//2\r\n print(g(g+1))\r\nelse:\r\n g=s//2\r\n print(g(g+1)+g+1)\r\n ", "import math\r\na = int(input())\r\nb = int(input())\r\n\r\ndiff = abs((a) - (b))\r\nenergy = 0\r\nfor i in range(0, (diff//2) + 1):\r\n energy+=2i \r\n last = i\r\nif diff%2!=0:\r\n energy+= 1 * (last +1)\r\n\r\nprint(energy)\r\n\r\n \r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs((b-a)//2)\r\nd = abs(max(a,b)-min(a,b)-c)\r\ns= c(c+1)/2+d(d+1)/2\r\nprint(int(s))", "a = int(input())\r\nb = int(input())\r\nif abs(b - a) % 2 == 0:\r\n some = 0\r\n for i in range(1 , 1 + abs(b - a) // 2):\r\n some += i\r\n print(2 * some)\r\nelse:\r\n some = 0\r\n prev = 0\r\n for i in range(1, 1 + abs(b - a) // 2):\r\n some += i\r\n prev = i\r\n i = prev\r\n print(some + some + (i + 1))", "# computes a arithmic sieres of steps being one and first term is one\r\ndef as12n(a):\r\n return(a(a+1))/2\r\na = int(input())\r\nb = int(input())\r\ndist = abs(a-b)\r\ntiredlist = []\r\nfor i in range(dist):\r\n dista = i+1 \r\n distb = dist-dista\r\n number = as12n(dista)+as12n(distb)\r\n tiredlist.append(int(number))\r\nprint(min(tiredlist))", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nif (c==1):\r\n\tans = 1\r\nelif (c == 2):\r\n\tans = 2\r\nelse:\r\n\tq = c//2\r\n\tw = c-q\r\n\ta1 = (q(q+1))/2\r\n\ta2 = (w(w+1))/2\r\n\tans = a1+a2\r\nprint(int(ans))", "a, b = int(input()), int(input())\r\ndiff = abs(a - b)\r\nn1 = diff // 2\r\nn2 = diff - n1\r\nans = n1 (n1 + 1) // 2 + n2 * (n2 + 1) // 2\r\nprint(ans)\r\n", "import math\r\na1 = 0\r\nb1 = 0\r\nn = int(input())\r\nm = int(input())\r\na = math.ceil((abs(n-m))/2) \r\nb = math.floor((abs(n-m))/2)\r\nfor i in range(1,a+1):\r\n\ta1 += i\r\nfor j in range(1,b+1):\r\n\tb1 += j\r\nprint(a1+b1)\t", "a=int(input())\r\nb=int(input())\r\nz=(a+b)//2\r\n# print(z)\r\ns=0\r\nfor i in range(abs(z-a)): #2 1+2\r\n s+= i+1\r\nfor j in range(abs(z-b)): #3 1+2+3\r\n s+= j+1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)/2\r\nz = int(c)\r\nres = 2z(z+1)/2\r\nif z!=c:\r\n res+=z+1\r\n\r\nprint(int(res))", "a = int(input())\r\nb = int(input())\r\ns = abs(a - b)\r\ncnt = 0\r\nfor i in range(1, s // 2 + 1):\r\n cnt += i\r\ncnt = 2\r\ncnt += (s % 2) ((s + 1) // 2)\r\nprint(cnt)\r\n", "a=int(input())\r\nb=int(input())\r\nif a<b:\r\n i,j=1,1\r\n sum1,sum2=0,0\r\n while a!=b:\r\n sum1+=i\r\n a+=1\r\n i+=1\r\n if a!=b:\r\n sum2+=j\r\n b-=1\r\n j+=1\r\n else:\r\n break\r\n print(sum1+sum2)\r\nelse:\r\n a,b=b,a\r\n i,j=1,1\r\n sum1,sum2=0,0\r\n while a!=b:\r\n sum1+=i\r\n a+=1\r\n i+=1\r\n if a!=b:\r\n sum2+=j\r\n b-=1\r\n j+=1\r\n else:\r\n break\r\n print(sum1+sum2)\r\n", "t=int(input())\np=int(input())\nif((t-p)==1):\n\tprint(1)\nelif((p-t)==1):\n\tprint(1)\nelse:\n\tfinal=abs(p-t)\n\tif(final%2==0):\n\t\tprint(int((final(final+2))//4))\n\telse:\n\t\tprint(int(((final-1)((final-1)+2))//4)+(final//2)+1)", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\nprint((c + 1) ** 2 // 4)", "f1 = int(input())\r\nf2 = int(input())\r\n\r\ncountMaior = 0\r\ncountMenor = 0\r\niMenor = 0\r\niMaior = 0\r\n\r\nif(f1 > f2):\r\n maior = f1\r\n menor = f2\r\nelse:\r\n maior = f2\r\n menor = f1\r\n\r\nwhile(menor != maior):\r\n if(countMaior > countMenor):\r\n menor += 1\r\n iMenor += 1\r\n countMenor += iMenor\r\n else:\r\n maior -= 1\r\n iMaior += 1\r\n countMaior += iMaior\r\n\r\nprint(countMaior + countMenor)", "a=int(input())\r\nb=int(input())\r\n\r\nans=0\r\n\r\nfor i in range(1,(abs(a-b)//2)+1):\r\n ans=ans+i\r\n\r\nif(abs(a-b)%2==0):\r\n print(2ans)\r\nelse:\r\n print(2ans+((abs(a-b)//2)+1))", "n=int(input())\nm=int(input())\na=abs(n-m)\nq1=(a//2)+a%2\nq2=(a//2)\nprint((q1(q1+1)//2)+(q2(q2+1)//2))\n", "def main():\n a = int(input())\n b = int(input())\n middle = (a + b) // 2\n a = abs(a - middle)\n b = abs(b - middle)\n tiredness = lambda x: x * (x + 1) // 2\n t = tiredness(min(a, b)) * 2\n\n if a != b:\n t += max(a, b)\n\n print(t)\n\n\nif __name__ == '__main__':\n main()\n", "def solve():\r\n a,b = int(input()),int(input())\r\n m = abs(a-b)\r\n numbers = list(range(1,m+1))\r\n ans = sum(numbers)\r\n for i in range(1,m):\r\n ans = min(ans,sum(numbers[0:m-i])+sum(numbers[0:i]))\r\n print(ans)\r\n\r\n\r\nsolve()\r\n# t = int(input())\r\n# for i in range(t):\r\n# solve()\r\n#\r\n", "a = int(input())\nb = int(input())\n\nd = abs(a - b)\nq, r = divmod(d, 2)\ntireness = (1 + q) * q\n\nif r == 1:\n tireness += (q + 1)\n\nprint(tireness)\n\n", "f1=int(input())\r\nf2=int(input())\r\nx=max(f1,f2)\r\ny=min(f1,f2)\r\nz=x-y\r\na=0\r\nb=0\r\nif z%2==0:\r\n\tw=int(z/2)\r\n\tfor i in range(1,w+1):\r\n\t\tb=b+i\r\n\tprint(2b)\r\nelse:\r\n\tw=int(z/2)\r\n\tfor i in range(1,w+1):\r\n\t\ta=a+i\r\n\tfor i in range(1,w+2):\r\n\t\tb=b+i\r\n\tprint(a+b)", "a=int(input())\r\nb=int(input())\r\nif(a>b):\r\n a,b=b,a\r\ntire=0\r\ntempA=1\r\ntempB=1\r\nturn=0\r\nwhile(a<b):\r\n if(turn==0):\r\n a+=1\r\n tire+=tempA\r\n turn=1\r\n tempA+=1\r\n else:\r\n b-=1\r\n tire+=tempB\r\n turn=0\r\n tempB+=1\r\nprint(tire)", "#w, h, w2, h2 =[int(i) for i in input().split()]\r\na=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nif x%2==1:\r\n n=x//2\r\n m=x//2+1\r\n print(n(n+1)//2+m(m+1)//2)\r\nelse:\r\n n=x//2\r\n m=x//2\r\n print(n(n+1)//2+m(m+1)//2) ", "import math\r\nn=int(input())\r\nm=int(input())\r\nif(n==m):\r\n print(0)\r\nelif(n+1==m):\r\n print(1)\r\nelse:\r\n d=abs(m-n)\r\n if(d%2==0):\r\n e=d//2\r\n sum=0\r\n for i in range(1,e+1):\r\n sum=sum+i\r\n print(sum2)\r\n elif(d%2!=0):\r\n e=d//2\r\n f=e+1\r\n sum=0\r\n for i in range(1,f+1):\r\n sum=sum+i\r\n print(sum+(sum-f))\r\n \r\n ", "from math import ceil as c\r\na = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\ntire = 0\r\nif n % 2 == 0:\r\n k = n // 2\r\n for i in range(1, k+1):\r\n tire += (2 * i)\r\nelse:\r\n k = c(n / 2)\r\n for i in range(1, k+1):\r\n if i == k:\r\n tire += i\r\n else:\r\n tire += (2 * i)\r\nprint(tire)\r\n", "first=int(input())\r\nsecond=int(input())\r\nsubtract=abs(first-second)\r\nif subtract==1:\r\n print(\"1\")\r\nelse:\r\n count=0\r\n k=(subtract//2)+1\r\n i= 1 \r\n while( subtract > 0):\r\n subtract=subtract-1\r\n count=count+i\r\n subtract=subtract-1\r\n count=count+i \r\n i=i+1\r\n if subtract%2==0:\r\n print(count)\r\n else:\r\n print(count - k )\r\n \r\n ", "a=int(input())\r\nb=int(input())\r\ntired = 0\r\ndistA=(max(a,b)-min(a,b))//2\r\ndistB=(max(a,b)-min(a,b))-distA\r\nprint ((distA(distA+1)//2) + (distB(distB+1)//2))\r\n", "a=int(input())\r\nb=int(input())\r\ndis=abs(a-b)\r\nhalf=dis//2\r\nrem=dis%2\r\nsuma=0\r\nsumb=0\r\nfor i in range(1,half+1):\r\n suma+=i\r\nfor j in range(1,(half+rem)+1):\r\n sumb+=j\r\nprint(suma+sumb)", "a = int(input())\r\nb = int(input())\r\nn=abs(a-b)//2\r\nif (a-b)%2==0:\r\n tirdness=2(1+n)n/2\r\nelse:\r\n tirdness=2(1+n)n/2+n+1\r\nprint(int(tirdness))", "# https://codeforces.com/problemset/problem/931/A\n\ndef f(n):\n return (n(n+1))//2\n\na=int(input())\nb=int(input())\ndist = abs(a-b)\naMoves = (dist+1)//2\nbMoves = dist//2\nprint(f(aMoves)+f(bMoves))\n", "a=int(input())\r\nb=int(input())\r\nk=max(a,b)\r\np=min(a,b)\r\nd=(k-p)\r\nif d % 2==0:\r\n n=d//2\r\n t=n(n+1)\r\n print(t)\r\nelse:\r\n n=d//2\r\n m=n+1\r\n t=n(n+1)+m\r\n print(t)\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nans = 0\r\nfor i in range(c // 2 + 1):\r\n ans += 2 i\r\nif c % 2 == 1:\r\n ans += i + 1\r\nprint(ans)", "def main():\n A = int(input())\n B = int(input())\n\n n = abs(A - B)\n x, y = divmod(n, 2)\n y += x\n tired = (x * (x + 1)) // 2 + (y * (y + 1)) // 2\n print(tired)\n\nmain()\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nmov = int(d/2)\r\n#print(mov)\r\nans = int((mov(mov+1))/2)\r\nif d%2==1:\r\n mov = mov + 1\r\nans = ans + int((mov(mov+1))/2)\r\n#print(mov)\r\nprint(ans)", "# A. Friends Meeting\n\nx1 = int(input())\nx2 = int(input())\n\ndiff = abs(x1 - x2)\nn = diff // 2\n\nans = n * (n + 1)\nif diff % 2 != 0:\n ans += n + 1\n\nprint(ans)\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nif (d % 2 == 0):\r\n tmp = d // 2\r\n print(2 * (1 + tmp) * tmp // 2)\r\nelse:\r\n tmp = d // 2\r\n first = (1 + tmp + 1) * (tmp + 1) // 2\r\n second = (tmp + 1) * tmp // 2\r\n print(first + second)", "def main():\n x = abs(int(input()) - int(input()))\n print((x * (x + 1)) // 2 - x // 2 * (x - x // 2))\n\n\nif __name__ == '__main__':\n main()\n", "def friendsM(f1, f2):\r\n if(f1 > f2):\r\n f1, f2 = f2, f1\r\n \r\n mid = (f1 + f2)//2\r\n count = 0\r\n c2 = 1\r\n \r\n for i in range(f1, mid):\r\n count += c2\r\n c2 += 1\r\n \r\n c2 = 1\r\n for i in range(mid, f2):\r\n count += c2\r\n c2 += 1\r\n \r\n print(count)\r\n\r\ndef main():\r\n f1 = int(input())\r\n f2 = int(input())\r\n \r\n friendsM(f1, f2)\r\n \r\nmain()", "a = int(input())\r\nb = int(input())\r\nr = max(a, b)\r\nl = min(a, b)\r\nstep = 0\r\nll = 1\r\nrr = 1\r\nans = 0\r\nwhile r != l:\r\n if step % 2 == 0:\r\n ans += ll\r\n ll += 1\r\n l += 1\r\n else:\r\n ans += rr\r\n rr += 1\r\n r -= 1\r\n step += 1\r\nprint(ans)", "a=int(input(''))\r\nb=int(input(''))\r\nc=a-b\r\np=0\r\nif c<0:\r\n c=c-1\r\ns=c//2\r\np=s(s+1)\r\nif c%2!=0:\r\n p=p+s+1\r\nprint(p)", "a = int(input())\r\nb = int(input())\r\nmidpoint = (a + b) // 2\r\ndist_a = abs(midpoint - a)\r\ndist_b = abs(midpoint - b)\r\ntiredness_a = (dist_a * (dist_a + 1)) // 2\r\ntiredness_b = (dist_b * (dist_b + 1)) // 2\r\ntotal_tiredness = tiredness_a + tiredness_b\r\nprint(total_tiredness)\r\n", "a=int(input())\r\nb=int(input())\r\ne=0\r\nif (abs(a-b))%2==0:\r\n for i in range(1,(abs(a-b))//2+1):\r\n e+=(i2)\r\nelse:\r\n if abs(a-b)==1:\r\n e+=1\r\n else:\r\n for i in range(1,(abs(a-b))//2+1):\r\n e+=(i2)\r\n e+=((abs(a-b))//2+1)\r\nprint(e)\r\n \r\n \r\n", "n=int(input())\r\nm=int(input())\r\nif(n>m):\r\n n,m=m,n\r\ncnt=0\r\ntr1=tr2=1\r\nwhile(True):\r\n if(n==m):\r\n break\r\n if(tr1>tr2):\r\n m-=1\r\n cnt+=tr2\r\n tr2+=1\r\n else:\r\n n+=1\r\n cnt+=tr1\r\n tr1+=1\r\nprint(cnt)", "a = int(input())\r\nb = int(input())\r\nif(a>b):\r\n a,b = b,a\r\nfans = 1e18\r\nfor i in range(a,b+1):\r\n d = i-a;e = b-i\r\n ans = d(d+1)//2 + e(e+1)//2\r\n fans = min(ans,fans)\r\nprint(fans)", "a=int(input())\r\nb=int(input())\r\ncount=0\r\nif a>b:\r\n\tdist=a-b\r\n\tx=dist//2\r\n\tfor i in range(1,x+1):\r\n\t\tcount+=i\r\n\ty=dist-x2\r\n\tif y==0:\r\n\t\tcount=(2count)\r\n\telse:\r\n\t\tcount=(2count)+x+1\r\n\tprint(count)\r\nelse:\r\n\tdist=b-a\r\n\tx=dist//2\r\n\tfor i in range(1,x+1):\r\n\t\tcount+=i\r\n\ty=dist-x2\r\n\tif y==0:\r\n\t\tcount=(2count)\r\n\telse:\r\n\t\tcount=(2count)+x+1\r\n\tprint(count)", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n a,b=b,a\r\nc=(a+b)//2\r\nres=0\r\ni=0\r\nwhile a<c:\r\n i=i+1\r\n a=a+1\r\n res=res+i\r\ni=0\r\nwhile c<b:\r\n i=i+1\r\n c=c+1\r\n res=res+i\r\nprint(res)\r\n", "x=int(input())\r\ny=int(input())\r\nif(abs(x-y) == 1):\r\n print(\"1\")\r\nelif(abs(x-y)==2):\r\n print(\"2\")\r\nelse:\r\n d = abs(x-y)\r\n if d%2 ==0:\r\n a=d//2\r\n print(a(a+1)//2 2)\r\n else:\r\n a=d//2 + 1\r\n print(a(a+1)//2 + ((a-1)(a))//2)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nm = d//2\r\nprint((1 + m)m + (d % 2)(m + 1))\r\n", "a = int(input())\r\nb = int(input())\r\nc = a - b\r\nc = c if c > 0 else -c\r\nd = c // 2\r\nc -= d\r\nprint(c(c + 1)//2 + d(d + 1)//2)\r\n", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nsum1=0\r\nif diff==1:\r\n print(1)\r\n\r\nelse:\r\n if diff%2==0:\r\n for i in range(1,diff//2 + 1):\r\n sum1+=2i\r\n print(sum1)\r\n else:\r\n for i in range(1,diff//2+1):\r\n sum1+= 2i\r\n sum1+=diff//2 + 1\r\n print(sum1)\r\n \r\n \r\n", "import math as m\na=int(input())\nb=int(input())\nif b<a:\n a,b=b,a\nd=a+m.ceil(abs(a-b)/2)\nx=d-a\ny=b-d\nstress=0\nfor i in range(1,x+1):\n stress+=i\nfor i in range(1,y+1):\n stress+=i\nprint(stress)\n\t \t\t\t \t\t\t \t\t\t \t \t \t \t", "a = int(input())\r\nb = int(input())\r\nn = abs(a-b)\r\nt = 0\r\nif n % 2 == 0:\r\n print(2sum([range(1, (n//2)+1)]))\r\nelse:\r\n print(2sum([range(1, (n//2)+1)])+(n//2)+1)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nhalf = (d//2)\r\n\r\nif d % 2 == 0:\r\n #sum of natural numbers is n(n+1)/2, one for each half so half(half+1) \r\n print(half(half+1)) \r\nelse:\r\n #add and additional half + 1 if the distance is odd\r\n print(half(half+1) + half+1)\r\n", "n = int(input())\r\nm = int(input())\r\nans1 = abs(n-m)\r\nif ans1 % 2 == 0:\r\n p = ans1//2\r\n print((1+p)p)\r\nelse:\r\n p = ans1//2+1\r\n print((1+p)p-p)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nif x%2==0:\r\n n=x//2\r\n n=(n(n+1)//2)2\r\nelse:\r\n n=x//2\r\n t=n+1\r\n n=(n(n+1)//2)2\r\n n+=t\r\nprint(n)\r\n\r\n", "import math\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\nhalf = 0\r\nd = 0\r\nasum = 0\r\nbsum = 0\r\nif(diff > 1):\r\n half = math.ceil(diff / 2)\r\n d = abs(diff - half)\r\n for i in range(half):\r\n asum += (i + 1)\r\n for j in range(d):\r\n bsum += (j + 1)\r\n ans = asum + bsum\r\nelif(diff == 1):\r\n ans = 1\r\nelse:\r\n ans = 0\r\nprint(ans)", "import math\n\na, b = int(input()), int(input())\n\ndist = abs(b - a)\n\nprint((dist // 2 + 1) * (dist // 2) + dist % 2 * math.ceil(dist / 2))", "a = int(input())\r\nb = int(input())\r\nmid = (a+b) // 2\r\ns = 0\r\ns += sum(list(range(1, abs(mid - a) + 1)))\r\ns += sum(list(range(1, abs(mid - b) + 1)))\r\n\r\nprint(s)\r\n", "from math import \r\ndef fun(n):\r\n\treturn (n(n+1))//2\r\na=int(input())\r\nb=int(input())\r\nif a>b:\r\n\ta,b=b,a\r\nprint(fun((b-a)//2)+fun(ceil((b-a)/2)))\r\n", "a = int(input())\r\nb = int(input())\r\nsred = (a + b) // 2\r\na1 = abs(sred - a)\r\nb1 = abs(sred - b)\r\nk = 1\r\nl = 1\r\ns1 = 0\r\ns2 = 0\r\nwhile (a1 != 0):\r\n s1 += k\r\n k += 1\r\n a1 -= 1\r\nwhile (b1 != 0):\r\n s2 += l\r\n l += 1 \r\n b1 -= 1\r\ns3 = s1 + s2\r\nprint(s3)\r\n", "a = int(input())\r\nb = int(input())\r\nK = (abs(a - b)) // 2\r\nS = 0\r\nfor i in range(1, K + 1):\r\n S += i * 2\r\nif abs(a - b) % 2 == 1:\r\n S += K + 1\r\nprint(S)", "a = int(input())\r\nb = int(input())\r\nif abs(a - b)%2 == 0:\r\n ans = (abs(a-b)//2)(abs(a-b)//2 + 1)\r\nelse:\r\n n1 = abs(a-b)//2\r\n n2 = abs(a-b) - abs(a-b)//2\r\n ans = n1(n1 + 1)//2 + n2(n2 + 1)//2\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\ntmp = abs(a - b)\r\nstep = (tmp // 2)((tmp // 2) + 1) + tmp//2 + 1 if tmp % 2 == 1 else (tmp // 2)((tmp // 2) + 1)\r\nprint(step)\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# دیش دیری دیرین ماشالله \r\n", "a = int(input())\r\nb = int(input())\r\n\r\nx = abs(a - b)\r\n\r\ns = 0\r\nif x % 2 == 0:\r\n for i in range(1, x // 2 + 1):\r\n s = s + i\r\n print(s 2)\r\n\r\nelse:\r\n for i in range(1, x // 2 + 1):\r\n s = s + i\r\n print(s * 2 + x // 2 + 1)", "a = int(input())\r\nb = int(input())\r\nm = (a+b)//2\r\nmaxi = max(a,b)\r\nmini = min(a,b)\r\na1 = maxi-m\r\na2 = m-mini\r\ntotal = a1(a1+1)//2+a2(a2+1)//2\r\nprint(total)\r\n\r\n", "import math\r\nx=int(input())\r\ny=int(input())\r\nmid=math.ceil((x+y)/2)\r\nt1=(abs(mid-x))/2(abs(mid-x)+1)\r\nt2=(abs(mid-y))/2(abs(mid-y)+1)\r\nprint(int(t1+t2)) ", "a = int(input())\r\nb = int(input())\r\n\r\ns = abs(a - b)\r\nsum = 0\r\n\r\nif s % 2 == 0:\r\n for i in range(1, s // 2 +1):\r\n sum += 2i\r\nelse:\r\n for i in range(1,s // 2 + 1):\r\n sum += 2i\r\n sum += s // 2 + 1\r\n \r\nprint(sum)", "n=int(input())\r\nm=int(input())\r\nc=abs(m-n)\r\nd=c//2\r\ne=d+c%2\r\nprint((1+e)e//2+(1+d)d//2)", "a=int(input())\r\nb=int(input())\r\nm=(a+b)//2\r\nsum1=0\r\nsum2=0\r\nif(a==m):\r\n\tprint(abs(m-b))\r\nif(b==m):\r\n\tprint(abs(m-a))\r\nif(a!=m and b!=m):\r\n\tz=abs(m-a)\r\n\tfor i in range(1,z+1):\r\n\t\tsum1=sum1+i\r\n\tq=abs(m-b)\r\n\tfor j in range(1,q+1):\r\n\t\tsum2=sum2+j\r\n\tprint(sum1+sum2)", "a = int(input())\r\nb = int(input())\r\n\r\nresult = 0\r\ncontA = 0\r\ncontB = 0\r\nwhile(a != b):\r\n if(contA > contB):\r\n if(b > a):\r\n b -= 1\r\n else:\r\n b += 1\r\n contB += 1\r\n result += contB\r\n else:\r\n if(a < b):\r\n a += 1\r\n else:\r\n a -= 1\r\n contA += 1\r\n result += contA\r\nprint(result)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)//2\r\ny=1\r\nfor i in range(x):\r\n y+=1\r\nif abs(a-b)%2==0:\r\n print(2 * (x(x+1)//2))\r\nelse:\r\n print(2 (x(x+1)//2) + y)", "a=int(input())\r\nb=int(input())\r\nz=max(a,b)-min(a,b)\r\nif z%2==0:\r\n\tprint(int(z/2(z/2+1)))\r\nelse:\r\n\tk=z//2\r\n\ta=k(k+1)/2\r\n\tb=(k+1)(k+2)/2\r\n\tprint(int(a+b))", "from functools import reduce\r\ndef s(n):\r\n\tn=reduce(lambda x,y:x+y,range(1,n+1))\r\n\treturn n\r\nx=abs(int(input())-int(input()))\r\nif x==1:\r\n\tprint(1)\r\n\texit()\r\nif x%2==0:\r\n\tprint(2s(x//2))\r\nelse:\r\n\tprint(2s(x//2)+(1+x//2))", "def main():\r\n friend_a = int(input())\r\n friend_b = int(input())\r\n\r\n mid = (friend_a + friend_b) // 2\r\n print(int(sum(abs(mid - friend_a)) + sum(abs(friend_b - mid))))\r\ndef sum(n):\r\n return (n * (n + 1))/2\r\nmain()", "a=int(input())\r\nb=int(input())\r\na,b=min(a,b),max(a,b)\r\np=(b+a)//2\r\ns1=p-a\r\ns2=b-p\r\ns=((s1(s1+1))//2)+((s2(s2+1))//2)\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n c //= 2\r\n c = c * (c + 1)\r\nelse:\r\n c = c // 2\r\n c = c * (c + 1) // 2 + (c + 1) * (c + 2) // 2\r\nprint(c)", "a = int(input())\r\nb = int(input())\r\n\r\ncrnt = 1\r\ncnt = 0\r\n\r\nd = abs(a-b)\r\n\r\nans = 0\r\nwhile d > 0:\r\n if cnt == 0:\r\n d -= 1\r\n ans += crnt\r\n cnt = 1\r\n else:\r\n cnt = 0\r\n d -= 1\r\n ans += crnt\r\n crnt += 1\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)//2\r\nans=x(x+1)\r\nif (abs(a-b))%2==0:\r\n\tprint(ans)\r\nelse:\r\n\tans+=(abs(a-b))//2+1\r\n\tprint(ans)\r\n ", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)-1\r\nif diff%2==1:\r\n d_a=(diff//2)+1\r\n d_b=d_a\r\n ans=d_a(d_a+1)\r\nelse:\r\n d_a=diff//2\r\n d_b=d_a+1\r\n ans=((d_a(d_a+1))//2)+((d_b(d_b+1))//2)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nans = 0\r\ns = 0\r\nm = max(a,b) - min(a,b)\r\nm2 = m // 2\r\nfor i in range(m2):\r\n s += 1\r\n ans += s2\r\nif m % 2 == 1:\r\n ans += (s+1)\r\nprint(ans)", "guy1 = int(input())\r\nguy2 = int(input())\r\n\r\ndiff = abs(guy1 - guy2) \r\nif diff % 2 == 0:\r\n guy1_walks = guy2_walks = diff // 2\r\nelse:\r\n guy1_walks = diff // 2\r\n guy2_walks = guy1_walks + 1\r\n\r\ntiredness = 0\r\n\r\nfor i in range(1,guy1_walks+1):\r\n tiredness += i 2\r\n\r\nif(guy1_walks != guy2_walks):\r\n tiredness += guy2_walks\r\n\r\nprint(str(tiredness))\r\n\r\n\r\n\r\n", "n=int(input())\r\nm=int(input())\r\nif m-n==1 or n-m==1:\r\n print(1)\r\nelse:\r\n x=abs(n-m)\r\n if x%2==0:\r\n x=x//2\r\n print((xx)+x)\r\n else:\r\n x=(x//2)+1\r\n print(xx)", "a=int(input())\r\nb=int(input())\r\ndif=abs(b-a)\r\nf1=dif//2\r\nsum1=(f1(f1+1))//2\r\nf2=dif-f1\r\nsum2=(f2(f2+1))//2\r\nprint(sum1+sum2)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\na=int(input())\r\nb=int(input())\r\nprint(((abs(a-b)+1)*2)//4)\r\n\r\n\r\n# c=(a+b)//2\r\n# d=abs(a-c)\r\n# e=abs(b-c)\r\n# d=(d(d+1))//2\r\n# e=(e(e+1))//2\r\n# print(int(d)+int(e))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\ncntA=d//2\r\ncntB=d-cntA\r\nTa=cntA(cntA+1)//2\r\nTb=cntB(cntB+1)//2\r\nprint(Ta+Tb)", "import math\n\na = int(input())\nb = int(input())\nbar = 0\nfoo = 0\nk=0\nc = max(abs(a), abs(b)) - min(abs(a), abs(b))\nif c % 2 == 0:\n\tk = int(c/2+1)\n\t\n\tfor i in range(1, k):\n\t\tbar+=i \n\tbar=2\nif c % 2 != 0:\n\tfor i in range(1, math.ceil(c/2)+1):\n\t\tbar +=i\n\tfor i in range(1, math.floor(c/2)+1):\n\t\tfoo+=i\n\tbar+=foo\n\nprint(bar)\n", "x=int(input())\r\ny=int(input())\r\n#x=list(s)\r\nd=abs(x-y)\r\nif(d%2==0):\r\n m=(x+y)//2 \r\nelse:\r\n m=(x+y)//2 + 1\r\ne=abs(x-m)\r\nf=abs(y-m)\r\ncnt=int((e(e+1) + f(f+1))/2)\r\nprint(cnt)", "a = int(input())\nb = int(input())\nr = abs(a - b)\nprint(r % 2 * ((r + 1) // 2) + (r // 2 * (r // 2 + 1)))", "a = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\nif n % 2 == 0:\r\n\tn = n // 2\r\n\tans = n * (n+1)\r\nelse:\r\n\tn = (n // 2) + 1\r\n\tans = n * n\r\nprint(ans)\r\n\t\r\n\r\n", "x1 = int(input())\r\nx2 = int(input())\r\nmid = (x1+x2)//2\r\nd1 = abs(x1-mid)\r\nd2 = abs(mid-x2)\r\nt = 0\r\nfor i in range(1, d1+1):\r\n t += i\r\nfor i in range(1, d2+1):\r\n t += i\r\nprint(t)\r\n", "x=int(input())\r\ny=int(input())\r\na,b=0,0\r\nif(abs(x-y)%2==0):\r\n a=b=abs(x-y)/2\r\n print(int(a(a+1)))\r\nelse:\r\n a=(abs(x-y)+1)/2\r\n b=abs(x-y)-a\r\n print(int(a(a+1)/2 + b(b+1)/2))", "import re\r\nimport math\r\nimport decimal\r\nimport bisect\r\n\r\na = int(input())\r\nb = int(input())\r\ndist = abs(a - b)\r\naDist = dist // 2\r\nbDist = dist - aDist\r\nprint((aDist (aDist + 1) // 2) + (bDist * (bDist + 1) // 2))\r\n", "a = int(input())\nb = int(input())\n\ndiff = abs(b - a)\ns_a = diff // 2\ns_b = diff - s_a\n\nprint((s_a * (s_a + 1) + s_b * (s_b + 1)) // 2) ", "import math\r\na_tired = 0\r\nb_tired = 0\r\na = int(input())\r\nb = int(input())\r\n\r\npoint = (a+b)//2\r\n\r\nb_route = abs(b - point)\r\na_route = abs(a - point)\r\n\r\nfor i in range(1,a_route+1):\r\n\ta_tired +=i \r\nfor i in range(1,b_route+1):\r\n\tb_tired +=i\r\n\r\ntotal = a_tired + b_tired\r\nprint(str(total))", "freind1=int(input())\nfreind2=int(input())\nmeetpoint=(freind1+freind2)//2\nsum=0\nfor i in range(meetpoint-min(freind1,freind2)):\n sum=sum+i+1\nfor i in range(max(freind1,freind2)-meetpoint):\n sum=sum+i+1\nprint(sum)", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nx=abs(a-c)\r\ny=abs(b-c)\r\nprint((x(x+1))//2+(y(y+1))//2)", "import math\r\na=int(input())\r\nb=int(input())\r\nsmall=min(a,b)\r\nlarg=max(a,b)\r\nmid_point=math.ceil((a+b)/2)\r\ns1=0\r\ns2=0\r\n\r\nfor i in range(0,(mid_point-small)+1):\r\n s1+=i\r\nfor i in range(0,(larg-mid_point)+1):\r\n s2+=i\r\n \r\nprint(s1+s2)", "a=int(input())\nb=int(input())\nt=0\nl=abs(b-a)\nc=l//2\nd=l-c\nt=((c(c+1))/2)+((d(d+1))/2)\nprint(int(t))", "def solve():\r\n a = int(input())\r\n b = int(input())\r\n x = y = abs(a - b) >> 1\r\n \r\n if abs(a - b) & 1:\r\n x += 1\r\n \r\n print(x * (x + 1) // 2 + y * (y + 1) // 2)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\nm=int(input())\r\nc=(n+m) // 2\r\nl=0\r\nfor i in range(abs(c-n)):\r\n l+= i+1\r\nfor j in range(abs(m-c)):\r\n l+= j+1\r\nprint(l)", "n=int(input())\r\nm=int(input())\r\n\r\nif n-m==1 or n-m==-1:\r\n print(1)\r\nelse:\r\n i=1\r\n s=0\r\n while(n!=m):\r\n if n>m:\r\n n-=1\r\n s+=i\r\n if n==m:\r\n break\r\n m+=1\r\n s+=i\r\n else:\r\n n+=1 \r\n s+=i\r\n if n==m:\r\n break\r\n m-=1 \r\n s+=i\r\n i+=1\r\n print(s)\r\n", "x=int(input())\r\ny = int(input())\r\nprint((abs(x - y) + 1) ** 2 // 4)", "pos1 = int(input())\npos2 = int(input())\n\n\nclass Solution:\n\n def friendsMeeting(self, pos1, pos2):\n dif = abs(pos2 - pos1)\n d = dif // 2\n if dif % 2 == 0:\n return 2 * self.calcSum(d)\n else:\n return self.calcSum(d) + self.calcSum(d+1)\n\n def calcSum(self, n):\n return int(n * (n + 1) / 2)\n\n\nsol = Solution()\nprint(sol.friendsMeeting(pos1, pos2))\n", "n = abs((int(input())-int(input())))\r\ndef f(x): return x(x+1)//2\r\nprint(f(n//2)+f(n-(n//2)))\r\n", "a = int(input())\r\nb = int(input())\r\nans = abs(a - b)\r\na = (ans // 2) (ans // 2 + 1)\r\nif ans % 2 == 1:\r\n a += (ans + 1) // 2\r\nprint(a)\r\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nprint((c+1)*2//4)", "#!/usr/bin/python3\r\n# Встреча друзей, сложность - 800\r\nx1 = int(input())\r\nx2 = int(input())\r\nt = 0; k = 1\r\nfatigue1 = 0; fatigue2 = 0\r\ndelta = x2 - x1 if x2 > x1 else x1 - x2\r\nwhile delta > 0:\r\n if t % 2 == 0:\r\n fatigue1 = fatigue1 + k\r\n else:\r\n fatigue2 = fatigue2 + k\r\n k = k + 1\r\n t = t + 1; delta = delta - 1\r\nprint(fatigue1 + fatigue2)\r\n", "a = int(input())\nb = int(input())\nif b < a:\n b, a = a, b\nm = 0\ndef tiredness(n):\n sum = 0\n for i in range(1, n+1):\n sum += i\n\n return sum\n\ndiff = abs(a - b)\nif diff == 1:\n print(1)\n exit()\nm = diff // 2\nif diff % 2 == 0:\n print(tiredness(abs(a - (a + m))) + tiredness(abs(b - (b - m))))\nelse:\n print(tiredness(abs(a - (a + m))) + tiredness(abs(b - (b - m - 1))))", "a=int(input())\r\nb=int(input())\r\nc=int()\r\nk=0\r\nm=0\r\nif a>b :\r\n c=a-b\r\nelse :\r\n c=b-a\r\nif c%2==0:\r\n c=c//2\r\n for i in range(0,c+1):\r\n k=k+i\r\n for i in range (c,0,-1):\r\n m=m+i\r\nelse:\r\n c=c//2\r\n for i in range(0,c+1):\r\n k=k+i\r\n for i in range (c+1,0,-1):\r\n m=m+i\r\nprint(k+m)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "a = int(input())\nb = int(input())\n\ndis = abs(b-a)\n\nif dis%2 == 0:\n dis //=2\n g = (dis(dis+1))//2\n print(g2)\n\nelse:\n dis //=2\n g1 = (dis(dis+1))//2\n g2 = ((dis+1)(dis+2))//2\n print(g1+g2)\n", "a = int(input())\nb = int(input())\n\nresul = 0\n\ndif = abs(a-b)\n\ni=0\n\nfor i in range(1, dif//2 + 1):\n resul += 2i\n\nif dif%2 == 1:\n resul += (i+1);\n\nprint (resul)\n\n \t\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t", "a, b = int(input()), int(input())\r\nlen = abs(abs(a) - abs(b))\r\n\r\nif len == 1:\r\n res = len\r\nelse:\r\n len1 = len // 2\r\n len2 = len - len1\r\n res = (1 + len1) / 2 * len1 + (1 + len2) / 2 * len2\r\n\r\nprint(int(res), end='')\r\n\r\n\r\n", "aa=int(input())\r\nbb=int(input())\r\nt=[aa,bb]\r\nb=max(t)\r\na=min(t)\r\nc=(b+a)//2\r\nca=c-a\r\ncb=b-c\r\ns=((ca(ca+1))/2)+((cb(cb+1))/2)\r\nprint(int(s))\r\n", "a = int(input())\nb = int(input())\nc = abs(a-b)\nif c % 2:\n d = (c-1)/2\n print(int(d(d+1)+d+1))\nelse:\n d = (c)/2\n print(int(d(d+1)))\n\n", "a=int(input())\r\nb=int(input())\r\nust=0\r\nif(a>b):\r\n s=a-b\r\nelse:\r\n s=b-a\r\nif(s>1):\r\n if(s%2==0):\r\n shagi=s//2\r\n for i in range(1, shagi+1):\r\n ust+=2i\r\n else:\r\n shagi=s//2+1\r\n for i in range(1, shagi+1):\r\n ust+=2i\r\n ust-=shagi\r\nelse:\r\n ust=1\r\nprint(ust)\r\n", "n=int(input())\r\nm=int(input())\r\na=abs(m-n)\r\nif(a==1):\r\n\tprint(1)\r\nelse:\r\n\tc=0\r\n\tfor i in range(1,a//2+1):\r\n\t\tc+=i\r\n\tif(a%2==0):\r\n\t\tprint(2c)\r\n\telse:\r\n\t\tprint(2c + a//2+1)", "a = int(input())\r\nb = int(input())\r\nprint(int(abs(a-b)/2)int((1+int(abs(a-b)/2)))+(abs(a-b)%2!=0)(int(abs(a-b)/2)+1))", "a = int(input())\r\nb = int(input())\r\ns = max(a,b) - min(a,b) \r\nprint(sum([i+1 for i in range(s//2)])2+((s//2+s%2) if s%2==1 else 0))\r\n", "from math import ceil\r\na = int(input())\r\nb = int(input())\r\n \r\nif a > b:\r\n a, b = b, a\r\n \r\nmid = (a + b) // 2\r\ncounter = 1\r\nfirst = 0\r\nfor i in range(a, b):\r\n first += counter\r\n counter += 1\r\n \r\nsecond = 0\r\ncounter = 1\r\n \r\nfor i in range(min(mid - a, b - mid)):\r\n second += counter\r\n \r\n counter += 1\r\n \r\nsecond = 2\r\n \r\nif (mid - a) != (b - mid):\r\n second += counter\r\n \r\nprint(min(first, second))", "a= int(input())\r\nb= int(input())\r\n\r\nres= (a+b)//2\r\ncount=0\r\nj=1\r\nif abs(b-a)==0:\r\n print(0)\r\nelif abs(b-a)==1:\r\n print(1)\r\nelse:\r\n if (a+b)%2==0:\r\n for i in range(min(a,b), res):\r\n count+= j\r\n j+=1\r\n print(2count)\r\n else:\r\n for i in range(min(a,b), res):\r\n count+=j\r\n j+=1\r\n\r\n t=1\r\n for i in range(max(a,b), res, -1):\r\n count+=t\r\n t+=1\r\n print(count)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nt =0\r\nif(d % 2 == 0):\r\n for i in range(1,d//2+1):\r\n t= t + i\r\n m_t= 2 t\r\nelse:\r\n i = 0\r\n for i in range(1,d//2+1):\r\n t= t + i\r\n m_t= 2 * t + (i+1)\r\nprint(m_t)", "a=int(input())\r\nb=int(input())\r\ndif=a-b\r\nsum=0\r\nif(dif<0):\r\n dif=dif(-1)\r\nfor i in range(int(dif/2)):\r\n sum=2(i+1)+sum\r\nif(dif%2!=0):\r\n sum=sum+int(dif/2)+1\r\nprint(sum) \r\n ", "n = int(input())\r\nm = int(input())\r\n \r\ndfr=abs(n-m)+1\r\ns=dfr//2\r\nprint((s+dfr%2)s)", "# Friends Meeting\na = int(input())\nb = int(input())\nm = (a+b)//2\nd1 = abs(m-a)\nd2 = abs(b-m)\nprint(d1(d1+1)//2+d2(d2+1)//2)\n", "a = int(input())\r\nb = int(input())\r\nc = abs(b-a)\r\ne = c//2\r\nd = c%2\r\nprint(e(e+1)+d(d+e))", "f1=int(input())\r\nf2=int(input())\r\nd=abs(f2-f1)\r\nd1=d//2\r\nd2=d-d1\r\nn1,n2=d1(d1+1)//2,d2(d2+1)//2\r\nprint(n1+n2)\r\n", "import math\n\na= int(input())\nb= int(input())\n\nc=abs(a-b)/2\n\nd=math.floor(c)\ne=math.ceil(c)\n\nf=int(d/2(1+d))\ng=int(e/2(1+e))\n\nprint(f+g)\n", "\r\nl = []\r\nl.append(int(input()))\r\nl.append(int(input()))\r\n\r\nl.sort()\r\nn = l[0]\r\nm = l[1]\r\n\r\nt = 1\r\ntot = 0\r\nwhile n != m:\r\n\tn += 1\r\n\ttot += t\r\n\tif n == m:\r\n\t\tprint(tot)\r\n\t\texit()\r\n\t\r\n\tm -= 1\r\n\ttot += t\r\n\tif n == m:\r\n\t\tprint(tot)\r\n\t\texit()\r\n\r\n\tt += 1\r\n", "a=int(input())\r\nb=int(input())\r\ny=(a+b)//2\r\na=abs(y-a)\r\nb=abs(y-b) \r\n#print(b,a)\r\nprint((a(a+1)//2) + (b)(b+1)//2)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n a = int(wtf[0])\r\n b = int(wtf[1])\r\n d = abs(a-b)\r\n d1 = d//2\r\n d2 = d//2+d%2\r\n print( (d12+d1)//2 + (d22+d2)//2 )\r\n", "a = int(input())\r\nb = int(input())\r\nif a > b:\r\n\ta, b = b, a\r\nmid = int((a + b) // 2)\r\nx = mid - a\r\ny = b - mid\r\nprint(int(x (x + 1)// 2 + (y (y + 1) // 2)))", "a = int(input())\r\nb = int(input())\r\nlen = abs(a - b)\r\nma = len // 2\r\nmb = len - ma\r\nprint(int(ma (ma + 1) / 2 + mb * (mb + 1) / 2))", "a=int(input())\r\nb=int(input())\r\nmini=1000000\r\nfor i in range(min(a,b),max(a,b)+1):\r\n mini=min(mini,(((i-min(a,b))(i-min(a,b)+1))//2)+((max(a,b)-i)(max(a,b)-i+1))//2)\r\nprint(mini)", "\r\na=int(input())\r\nb=int(input())\r\nk=0\r\nif(a>b):\r\n k=a-b\r\nelse:\r\n k=b-a\r\ni,j=0,0\r\ntotal_iter=0\r\n#import timeit\r\n\r\n#start = timeit.default_timer()\r\n\r\n#Your statements here\r\nfor m in range(1,(k//2)+1):\r\n i+=m\r\n total_iter=m\r\ntotal=2i\r\nif(k%2!=0):\r\n total+=k-total_iter\r\nprint(total)\r\n#stop = timeit.default_timer()\r\n#print (stop - start)\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\ns = 0\r\nt = 0\r\nfor x in range(d):\r\n if x%2 == 0:\r\n s+=1\r\n t += s\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\nx = abs(b - a) // 2\r\nn = 0\r\nfor k in range(x + 1):\r\n n += 2 k\r\nif abs(b-a) % 2 == 1:\r\n n += x + 1\r\nprint(n)\r\n", "n=int(input())\r\nm=int(input())\r\nx=abs(m-n)\r\na=x//2\r\nb=x-a\r\nprint(a(a+1)//2+b(b+1)//2)", "a=int(input())\nb=int(input())\nn=abs(a-b)\nprint(n//2(n//2+1) + (n%2)((n+1)//2))\n", "#print('Hare Krishna')\r\ndef I():\r\n return int(input())\r\ndef IL():\r\n return [int(i) for i in input().split()]\r\ndef IM():\r\n return map(int,input().split())\r\ndef IS():\r\n return input()\r\na=I()\r\nb=I()\r\na,b=min(a,b),max(a,b)\r\ndiff=b-a \r\na=diff//2 \r\nb=diff//2+diff%2 \r\nprint(a(a+1)//2+b(b+1)//2)", "a = int(input())\nb = int(input())\n\ndist = abs(a - b)\n\nx = dist // 2\n\nenergy = (x * (x + 1))\n\nif dist % 2 == 1:\n energy += (x + 1)\n\nprint(energy)\n", "a=int(input())\r\nb=int(input())\r\nz=abs(a-b)\r\ntired=tired_a=tired_b=0\r\nif (z%2!=0):\r\n x=z//2\r\n y=z//2+1\r\nelse:\r\n x=z//2\r\n y=z//2\r\nfor i in range(1,x+1):\r\n tired_a=tired_a+i\r\nfor j in range(1,y+1):\r\n tired_b=tired_b+j\r\ntired=tired_a+tired_b\r\nprint(tired)", "a=int(input())\r\nb=int(input())\r\ns=a+b\r\nif s%2==0:\r\n s=s//2\r\n if a<b:\r\n p=s-a\r\n else:\r\n p=s-b\r\n ans=((p)(p+1))//2\r\n print(ans2)\r\nelse:\r\n s=s//2\r\n if a<b:\r\n p=s-a\r\n else:\r\n p=s-b\r\n ans = ((p) * (p + 1)) // 2\r\n ans=ans2\r\n print(ans+p+1)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nx=ceil((a+b)/2)\r\nq=abs(a-x)\r\np=abs(b-x)\r\nprint( (q(q+1))//2 + (p(p+1))//2 )", "a = int(input())\r\nb = int(input())\r\nans = 0\r\npointer1 = 1\r\npointer2 = 1\r\ntemp1 = 0\r\ntemp2 = 0\r\nwhile True:\r\n if (a < b):\r\n a += 1\r\n ans += pointer1\r\n pointer1 += 1\r\n if (a == b):\r\n break\r\n \r\n \r\n b -= 1\r\n ans += pointer2\r\n pointer2 += 1\r\n if (a == b):\r\n break\r\n \r\n else:\r\n a -= 1\r\n ans += pointer1\r\n pointer1 += 1\r\n if (a == b):\r\n break\r\n \r\n b += 1\r\n ans += pointer2\r\n pointer2 += 1\r\n if (a == b):\r\n break\r\n \r\nprint(ans)", "x = int(input())\r\ny = int(input())\r\n\r\ndiff = abs(x - y)\r\nsm = 0\r\nk = diff // 2\r\ntiredness = (k (k + 1))\r\n\r\nif (diff % 2):\r\n tiredness += k + 1\r\n\r\nprint(tiredness)\r\n", "a, b = sorted(int(input()) for _ in range(2))\nn = (b - a) // 2\nres = (n + 1) * n\nif b - a > 2 * n:\n res += n + 1\nprint(res)\n", "# Friends Meeting\r\n# https://codeforces.com/problemset/problem/931/A\r\nimport math\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nif a > b: \r\n t = a # swap a and b\r\n a = b\r\n b = t\r\n# ensures that a <= b\r\n\r\nans = 0\r\nfor i in range(1,1001):\r\n if a == b:\r\n break;\r\n a += 1\r\n ans += i\r\n if a == b:\r\n break\r\n b -= 1\r\n ans += i\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nt=0\r\nc=1\r\nif d%2==0:\r\n m=d//2\r\n while m>0:\r\n t+=c\r\n c+=1\r\n m-=1\r\n print(2t)\r\nelse:\r\n m=d//2\r\n while m>0:\r\n t+=c\r\n c+=1\r\n m-=1\r\n print(2t+c)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n\tans=(d//2)((d//2)+1)\r\nelse:\r\n\tans=(d//2)((d//2)+1)/2 + (d//2 +1 )((d//2)+2)/2\r\nprint(int(ans))\r\n'''import math\r\nn,a,b=map(int, input().split())\r\nr=int(math.log2(n))\r\nmid0=n\r\nmid1=n//2\r\nfor i in range(int(math.log2(n))):\r\n\tprint (mid1)\r\n\tif min(a,b)<=mid1 and max(a,b)>=mid1:\r\n\t\t#print (mid1)\r\n\t\tbreak\r\n\telse:\r\n\t\tr-=1\r\n\t\tmid2=mid1\r\n\t\tif min(a,b)<=mid1 and max(a,b)<=mid1:\r\n\t\t\tmid1=mid1//2\r\n\t\telse:\r\n\t\t\tmid1=(mid0+mid1)//2\r\n\t\tmid0=mid2\r\nif r==int(math.log2(n)):\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(r)'''", "a=int(input()) ;b=int(input()) \r\nx=abs(a-b) //2\r\ny=abs(a-b)%2\r\nprint(x(x+1)//2+(x+y) (x+y+1)//2)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nans = abs(a-b)\r\n\r\nans = ans//2\r\ncount = 0\r\nfor i in range(1, ans+1):\r\n count+=i\r\n\r\nif abs(a-b)%2==0:\r\n \r\n print(count2)\r\nelse:\r\n print(count2+ans+1)\r\n\r\n ", "a1 = int(input())\r\nb1 = int(input())\r\n\r\nresult = 0\r\nplus = 1\r\ndiff = abs(a1 - b1)\r\nwhile diff > 0:\r\n result += plus\r\n diff -= 1\r\n if diff == 0:\r\n break\r\n result += plus\r\n diff -= 1\r\n plus += 1\r\n \r\n \r\nprint(result)", "a = int(input())\nb = int(input())\nx = abs(a-b)\nif x%2 == 0:\n ans = (x//2)(x//2+1)\nelse:\n ans = (x//2)(x//2+1)+(x//2+1)\nprint(ans)\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nx=0\r\ny=0\r\nif b<a:\r\n for i in range(0,a-c+1):\r\n x=x+i\r\n for n in range(0,c-b+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n \r\nif a<b:\r\n for i in range(0,b-c+1):\r\n x=x+i\r\n for n in range(0,c-a+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n", "a = int(input())\nb = int(input())\nm = (a+b) // 2\ns = 0\nfor i in range(abs(m-a)):\n s += i+1\nfor i in range(abs(b-m)):\n s += i+1\nprint(s)", "a,b = int(input()),int(input())\r\nk=(max(a,b)-min(a,b))//2\r\nh=(max(a,b)-min(a,b))%2\r\nprint((k(k+1))+h(k+1))", "a=int(input())\r\nb=int(input())\r\n\r\nsum=a+b\r\nans=0\r\n\r\nif sum%2==0:\r\n half=sum/2\r\n sum=abs(half-a)\r\n for i in range(int(sum+1)):\r\n ans=ans+i\r\n ans=ans2\r\nelse:\r\n half=sum/2\r\n a=min(a,b)\r\n sum=abs(half-a)\r\n for i in range(int(sum+1)):\r\n ans=ans+i\r\n ans=ans2\r\n ans=ans+i+1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "x1=int(input())\r\nx2=int(input())\r\nmid=int((x1+x2)/2)\r\nleft=abs(x1-mid)\r\nright=abs(x2-mid)\r\nleft_sum=(left(left+1))/2\r\nright_sum=(right(right+1))/2\r\nprint(int(left_sum+right_sum))", "import math\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nd1=math.floor(d/2)\r\nd2=math.ceil(d/2)\r\ntotal= int(d1(d1+1)/2 + d2(d2+1)/2)\r\nprint(total)", "from math import ceil as c;d=abs(int(input())-int(input()));print((c(d/2)(c(d/2)+1))//2+((d//2)((d//2)+1))//2)", "a = int(input())\r\nb = int(input())\r\nc1 = 1\r\nc2 = 1\r\nn = 0\r\nif(a > b):\r\n storeVar1 = a-b\r\nelse:\r\n storeVar1 = b-a\r\n\r\nquotient = storeVar1 // 2\r\nremainder = storeVar1 % 2\r\nfor x in range(0, quotient):\r\n n = n + c1\r\n c1 += 1\r\nfor y in range(0, quotient+remainder):\r\n n = n + c2\r\n c2 += 1\r\nprint(n)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n n=d//2\r\n s=(n(n+1))//2\r\n print(2s)\r\nelse:\r\n n=d//2\r\n s1=(n(n+1))//2\r\n s2=((d-n)((d-n)+1))//2\r\n print(s1+s2)\r\n\r\n ", "first = int(input())\nsecond = int(input())\n\ndiff = abs(first - second)\n\nif diff % 2 == 0:\n print((diff//2)(diff//2 + 1))\nelse:\n print((diff//2)(diff//2 + 1) + diff//2 + 1)\n", "from sys import stdin\r\n \r\nrd = stdin.readline\r\n\r\na = int(rd())\r\nb = int(rd())\r\n\r\nmoves = abs(b - a)\r\n\r\nif moves & 1:\r\n\r\n print(((moves + 1) // 2) * 2)\r\n\r\nelse: print((moves // 2) * (moves // 2 + 1))\r\n", "a = int(input())\r\nb = int(input())\r\na_tired = 0\r\nb_tired = 0\r\ntired = 0\r\nwhile (a != b):\r\n if a<b:\r\n a += 1\r\n a_tired +=1\r\n tired+=a_tired\r\n if a == b:\r\n break\r\n else:\r\n b-=1\r\n b_tired +=1\r\n tired+=b_tired\r\n elif a>b:\r\n b += 1\r\n b_tired +=1\r\n tired+=b_tired\r\n if a == b:\r\n break\r\n else:\r\n a-=1\r\n a_tired +=1\r\n tired+=a_tired\r\nprint(tired)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nif (a>b):\r\n dis = (a-b)\r\n# if dis==2:\r\n# ;\r\n if dis%2==1:\r\n dis = (int)(dis/2)\r\n dis = dis(dis+1) + (dis+1)\r\n else:\r\n dis = (int)(dis/2)\r\n dis = dis(dis+1)\r\nelse:\r\n dis = b-a\r\n# if dis==2:\r\n# ;\r\n if dis%2==1:\r\n dis = (int)(dis/2)\r\n dis = dis(dis+1) + (dis+1)\r\n else:\r\n dis = (int)(dis/2)\r\n dis = dis(dis+1)\r\nprint(dis)", "# \r\n# \r\n# \r\n# * * Author:Aditya Joshi\r\n# * \r\n# \r\na = int(input())\r\nb = int(input())\r\nr = abs(a - b) // 2\r\nr1 = abs(a - b) - r\r\ns = (r (r + 1)) // 2\r\ns += (r1 * (r1 + 1)) // 2\r\nprint(s)\r\n", "a,b=int(input()),int(input())\r\nc,t,d=abs(a-b),0,0\r\nif c%2!=0:\r\n for i in range(1,(c//2)+1):\r\n t=t+(2i)\r\n d=d+1\r\n print(t+d+1)\r\nelse:\r\n for i in range(1,(c//2)+1):\r\n t=t+(2i)\r\n print(t)", "a, = map(int,input().split())\r\nb, = map(int,input().split())\r\nd = abs(a-b)\r\nk = d//2\r\nans = 0\r\nif k2!=d:\r\n ans += k+1\r\nif k:\r\n ans += (1+k)k\r\nprint(ans)", "import math\r\nx=int(input())\r\ny=int(input())\r\nt=abs(x-y)\r\nif(t%2==0):\r\n m=math.floor(t/2)\r\n print(m(m+1))\r\nelse:\r\n p=t//2\r\n q=p(p+1)\r\n print(q+(p+1))\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\n\r\ndef dis(x):\r\n h = 0\r\n for i in range(1, x+1):\r\n h += i\r\n\r\n return h \r\n\r\nif d % 2 == 0:\r\n print(dis(d//2)2)\r\nelse:\r\n print(dis(d//2)+dis(d - d//2))\r\n", "a=int(input())\r\nb=int(input())\r\ntmn=0\r\ntmx=0\r\ncmx=0\r\ncmn=0\r\nif(a>b):\r\n max=a\r\n min=b\r\nelse:\r\n max=b\r\n min=a\r\nif(a==b):\r\n t=0\r\nelif(a-b==1 or b-a==1):\r\n t=1\r\nelse:\r\n while True:\r\n max-=1\r\n cmx+=1\r\n tmx+=cmx\r\n if(max==min):\r\n t=tmx+tmn\r\n break\r\n min+=1\r\n cmn+=1\r\n tmn+=cmn\r\n if(max==min):\r\n t=tmx+tmn\r\n break\r\nprint(t)", "def tiredness(n):\r\n return n(n+1)//2\r\n\r\na = int(input())\r\nb = int(input())\r\nx = (a+b)//2\r\nprint(tiredness(abs(x-a)) + tiredness((abs(x-b))))\r\n", "n=int(input())\r\nm=int(input())\r\nmid=(n+m)//2\r\na=abs(mid-n)\r\nb=abs(m-mid)\r\nsum=0\r\nfor i in range(1,b+1):\r\n sum+=i\r\nfor i in range(1,a+1):\r\n sum+=i\r\nprint(sum)", "a = int(input())\nb = int(input())\nn=abs(a-b)//2\ntiredness=0\nif (a-b)%2==0:\n tiredness=2(1+n)n/2\nelse:\n tiredness=2(1+n)n/2+n+1\nprint(int(tiredness))\n \n \n \n", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n k=a-b\r\nelse:\r\n k=b-a\r\nif k%2==0:\r\n j=k//2\r\n x=0\r\n for v in range(0,j+1):\r\n x=x+v\r\n y=0\r\n for v in range(j,0,-1):\r\n y=y+v\r\n print(x+y)\r\nelse:\r\n j=(k//2)\r\n x=0\r\n for s in range(0,j+1):\r\n x=x+s\r\n y=0\r\n for s in range(j+1,0,-1):\r\n y=y+s\r\n print(x+y)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def tabadil(x):\r\n su = 0\r\n for i in range(1,x+1):\r\n su += i\r\n return su\r\n\r\na = int(input())\r\nb = int(input())\r\nl = abs(a-b)\r\nif l == 1:\r\n print(1)\r\nelse:\r\n if l%2 == 0:\r\n print(tabadil(l//2)2)\r\n else:\r\n print(tabadil(l//2 + 1) + tabadil(l//2))", "a = int(input())\r\nb = int(input())\r\n\r\nid_end = round((a + b)/2)\r\n\r\nhunger_a = 0\r\nhunger_b = 0\r\n\r\nif a < b:\r\n\ti = 0\r\n\twhile a != id_end:\r\n\t\ti += 1\r\n\t\thunger_a += i\r\n\t\ta += 1\r\n\ti = 0\r\n\twhile b != id_end:\r\n\t\ti += 1\r\n\t\thunger_b += i\r\n\t\tb -= 1\r\nelse:\r\n\ti = 0\r\n\twhile a != id_end:\r\n\t\ti += 1\r\n\t\thunger_a += i\r\n\t\ta -= 1\r\n\ti = 0\r\n\twhile b != id_end:\r\n\t\ti += 1\r\n\t\thunger_b += i\r\n\t\tb += 1\r\n\r\nprint(hunger_a + hunger_b)", "import sys \r\n\r\nI=sys.stdin.readline\r\n\r\na=int(I())\r\nb=int(I())\r\n\r\ntired=0\r\na_tired=0\r\nb_tired=0\r\nif a>b:\r\n\tflag=0\r\nelse:\r\n\tflag=1\r\nwhile a!=b:\r\n\tif a>b:\r\n\t\tif flag==0:\r\n\t\t\ta_tired+=1\r\n\t\t\ttired+=a_tired\r\n\t\t\ta-=1\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tb_tired+=1\r\n\t\t\ttired+=b_tired\r\n\t\t\tb+=1\r\n\t\t\tflag=0\r\n\r\n\telse:\r\n\t\tif flag==0:\r\n\t\t\ta_tired+=1\r\n\t\t\ttired+=a_tired\r\n\t\t\ta+=1\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tb_tired+=1\r\n\t\t\ttired+=b_tired\r\n\t\t\tb-=1\r\n\t\t\tflag=0\r\nprint(tired)\r\n", "from collections import \r\nfrom heapq import \r\nfrom bisect import \r\nfrom itertools import \r\nfrom functools import \r\nfrom math import \r\nfrom string import \r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n a, b = [int(input()) for _ in range(2)]\r\n a, b = sorted((a, b))\r\n\r\n def cost(x):\r\n ans = 0\r\n A = [a, 1]\r\n B = [b, 1]\r\n\r\n while A[0] != B[0]:\r\n if A[1] < B[1]:\r\n A[0] += 1\r\n ans += A[1]\r\n A[1] += 1\r\n else:\r\n B[0] -= 1\r\n ans += B[1]\r\n B[1] += 1\r\n\r\n return ans\r\n\r\n print(min(cost(x) for x in range(a, b + 1)))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b = int(input()), int(input())\r\nif a > b:\r\n a, b = b, a\r\nans, cur = 0, 1\r\nwhile b - a >= 2:\r\n ans += cur * 2\r\n cur += 1\r\n b -= 1\r\n a += 1\r\nif a != b:\r\n ans += cur\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nd=max(a,b)-min(a,b)\r\nif d%2==0:\r\n print(int((d/2)((d/2)+1)))\r\nelse :\r\n print(int(((d+1)/2)2))", "a=int(input());b=int(input());c=abs(a-b)//2;d=abs(a-b)-c;print(c(c+1)//2+d(d+1)//2)", "c1,c2=1,1\r\nk=1\r\ns=0\r\na=int(input())\r\nb=int(input())\r\nfor i in range(abs(a-b)):\r\n if k%2==1:\r\n s+=c1\r\n c1+=1\r\n else:\r\n s+=c2\r\n c2+=1\r\n k+=1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nd = c // 2\r\ne = c - d\r\nk = 0\r\nfor i in range(1, d+1):\r\n k = k + i\r\nfor j in range(1, e+1):\r\n k = k + j\r\nprint(k)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nif (d%2==0):\r\n\tprint(d//2(d//2+1))\r\nelse:\r\n\tprint(d//2(d//2+1)+d//2+1)", "# cook your dish here\r\nn1 = int(input())\r\nn2 = int(input())\r\npower = 0\r\ntotal = 0\r\nif (n1 > n2):\r\n temp = n1\r\n n1 = n2\r\n n2 = temp\r\nwhile (n2 - n1 > 1):\r\n power += 1\r\n n1 += 1\r\n n2 -= 1\r\n total += 2 power\r\nif (n2 - n1 == 1):\r\n power += 1\r\n total += power\r\nprint(total)", "n = int(input())\r\nm = int(input())\r\na = (n+m)//2\r\nprint((abs(a-n)(abs(a-n)+1))//2+(abs(a-m)(abs(a-m)+1))//2)\r\n", "a=int(input())\r\nb=int(input())\r\nres=(a+b)//2\r\nfin1=abs(res-a)(abs(res-a)+1)//2\r\nfin2=abs(res-b)(abs(res-b)+1)//2\r\nprint(fin1+fin2)\r\n", "a = int(input())\r\nb = int(input())\r\nb, a = max(a, b), min(a, b)\r\nif (b - a) % 2 == 0:\r\n print((1 + (b - a) // 2) * (b - a) // 2) \r\nelse:\r\n print((1 + (b - a + 1) // 2) * ((b - a + 1) // 2) // 2 + (1 + (b - a - 1) // 2) * ((b - a - 1) // 2) // 2)", "a = int(input())\r\nb = int(input())\r\n\r\nm = (a+b)//2\r\n\r\nda = abs(m-a)\r\ndb = abs(m-b)\r\n\r\nans = (da(da+1))//2 + (db(db+1))//2\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nlen = a-b\r\nif len<0:\r\n len = -1len\r\ncountA = len//2\r\ncountB = len - len//2\r\nres1 = countA(countA+1)//2\r\nres2 = countB(countB+1)//2\r\nprint(res1+res2)", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nn, r = divmod(d, 2)\r\n\r\nres = (n+1)(n+1) if r else (n+1)n\r\n\r\nprint(res)", "print((abs(int(input())-int(input()))+1)2//4)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nk=abs(b-a)\r\nn=k//2\r\nans=0\r\nif k%2==0:\r\n\tans=n(n+1)\r\n\tprint(ans)\r\nelse:\r\n\tans=n(n+1)\r\n\tans+=ceil(k/2)\r\n\tprint(ans)", "import math\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif(d<=2):\r\n print(d)\r\nelse:\r\n x=math.ceil(d/2)\r\n y=d-x\r\n g=(x(x+1))//2+(y(y+1))//2\r\n print(g)\r\n", "a = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\ns = 0\r\nif a > b:\r\n a,b = b,a\r\nfor i in range(1,(c - a)+1):s+=i\r\nfor i in range(1,(b - c)+1):s+=i\r\nprint(s)", "n1 = int(input())\r\nn2 = int(input())\r\nsub = abs(n1 - n2)\r\nc = 1\r\ns = 0\r\nfor i in range(sub//2):\r\n s += c\r\n c += 1\r\nc = 1\r\nfor i in range(sub - sub//2):\r\n s += c\r\n c += 1\r\nprint(s)", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\na=abs(a-c)\r\nb=abs(b-c)\r\nprint(((1+a)a)//2+(1+b)b//2)\r\n", "def main():\r\n a = int(input())\r\n b = int(input())\r\n\r\n diff = abs(a-b)\r\n amount = diff // 2\r\n parity = diff % 2\r\n\r\n print((1 + amount) amount + parity * (amount + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\nb = int(input())\nA = a \nB = b\nwhile a != b:\n if a > b:\n b += 1 \n if a == b:\n break\n else:\n a -= 1 \n if a < b:\n a += 1 \n if a == b:\n break\n else:\n b -= 1\nexhaustiona = 0\nexhaustionb = 0\nfor x in range(abs(A-a)):\n exhaustiona += (x + 1)\nfor y in range(abs(B-b)):\n exhaustionb += (y + 1)\ntotal_exhaustion = exhaustiona + exhaustionb\nprint(total_exhaustion)\n\n \n \n\n\n\n\n\n", "\r\nx1=int(input())\r\n\r\nx2=int(input())\r\n\r\nm1=abs(x1-x2)//2\r\n\r\nm2=abs(x1-x2)-m1\r\n\r\nprint(int(m1(m1+1)/2 + m2(m2+1)/2))\r\n", "first_friend_position = int(input())\nsecond_friend_position = int(input())\n\ndistance = abs(first_friend_position - second_friend_position)\ntotal_tiredness = 0\n\nif distance % 2 == 0:\n for i in range(1, distance // 2 + 1):\n total_tiredness += i * 2\n print(total_tiredness)\nelse:\n just_a_list = []\n for i in range(1, distance // 2 + 2):\n just_a_list.append(i * 2)\n\n print(int(sum(just_a_list) - just_a_list[-1] / 2))\n\n\n\n\n", "import math\r\na=int(input())\r\nb=int(input())\r\nc=(b+a)/2\r\nv=math.floor(c)\r\nm=abs(v-a)\r\nn=abs(b-v)\r\nsum=(((m(m+1))//2)+(n(n+1)//2))\r\nprint(sum)", "from math import ceil\r\nn=int(input())\r\nk=int(input())\r\na=abs(n-k)\r\nc=0\r\nif a==1:\r\n\tprint(1)\r\nelif a%2==0:\r\n\tfor i in range(1,int(a/2)+1):\r\n\t\tc+=i2\r\n\tprint(c)\t\t\r\nelse:\r\n\tfor i in range (1,int(a/2)+1):\r\n\t\tc+=i2\t\r\n\tprint(c+ceil(a/2))", "import math\r\nn = int(input())\r\nm = int(input())\r\nj = abs(n-m)\r\nans = j/2\r\nans1 = j - j/2\r\nans2 = ans(ans+1)/2\r\nans3 = ans1(ans+1)/2\r\nprint(math.ceil(ans2+ans3))\r\n", "a=int(input())\r\nb=int(input())\r\nmidPoint=(b+a)//2\r\nstepa=abs(midPoint-a)\r\nstepb=abs(b-midPoint)\r\nsuma=(stepa(stepa+1))//2\r\nsumb=(stepb(stepb+1))//2\r\nprint(suma+sumb)\r\n", "# cf 931 A 800\nn = int(input())\nm = int(input())\n\ndiff = abs(n - m)\nt1 = diff // 2\nt2 = diff - t1\nt1 = t1 * (t1 + 1) // 2\nt2 = t2 * (t2 + 1) // 2\nprint(t1 + t2)\n\n", "a = int(input())\nb = int(input())\n\npoint = int(a/b)\n\ntired = 0\n\ni = 1\nj = 1\n\nwhile a != b:\n if a < b:\n if i < j:\n a += 1\n tired += i\n i += 1\n else:\n b -= 1\n tired += j\n j += 1\n else:\n if i < j:\n a -= 1\n tired += i\n i += 1\n else:\n b += 1\n tired += j\n j += 1\nprint(tired)\n", "a = int(input())\nb = int(input())\nif abs(a - b)%2 == 0:\n\tdif = abs(a-b)//2\n\tprint((dif)(dif+1))\nelse:\n\tdif = abs(a-b)//2\n\tprint((dif)(dif+1) + dif + 1)\n", "n=int(input())\r\nm=int(input())\r\nt=0\r\nw=(abs(m-n)-1)//2\r\nt+=w(w+1)\r\nif (m-n-1)%2!=0:\r\n t+=(w+1)2\r\nelse:\r\n t+=(w+1)\r\nprint(t)\r\n", "a = int(input())\nb = int(input())\n\ndiff = abs(a - b)\nn1 = diff // 2\nn2 = n1 + 1\nif diff % 2 == 0:\n print((1 + n1) * n1)\nelse:\n print((1 + n1) * n1 // 2+ (1 + n2) * n2 // 2)", "a, b = int(input()), int(input())\r\nc = (a+b)//2\r\nd = 0\r\ne, f = abs(a-c), abs(b-c)\r\nfor i in range(1, e+1):\r\n d += i\r\nfor i in range(1, f+1):\r\n d += i\r\nprint(d)", "def addnums(num):\n\treturn num(num+1)//2\n\na = int(input())\nb = int(input())\n\ndiff = abs(a-b)\n\nprint(addnums(diff//2)+addnums(diff - diff//2))", "a = int(input())\r\nb = int(input())\r\nS = abs(a - b)\r\nC = S // 2\r\nD = S % 2\r\nSumm = int(((1 + C) / 2) C)\r\nprint(Summ * 2 + (C + D) * D)\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nd=0\r\ng=0\r\ne=1\r\nf=1\r\nif (a-b==1)or(b-a==1):\r\n print(1)\r\nelse :\r\n if (a<b):\r\n for i in range (a,c):\r\n d=d+e\r\n e=e+1\r\n for j in range (c,b):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n else :\r\n for i in range (b,c):\r\n d=d+e\r\n e=e+1\r\n for j in range (c,a):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\n\r\nif d % 2 == 0:\r\n x = d // 2 * (d // 2 + 1)\r\nelse:\r\n x = d // 2 * (d // 2 + 2) + 1\r\n\r\nprint(x)", "import sys\r\n\r\ndef main():\r\n a, b = map(int, sys.stdin.read().strip().split())\r\n d = abs(b - a)\r\n return (1 + d//2)(d//2 + d%2)\r\n\r\n \r\nprint(main())\r\n", "a = int(input())\r\nb = int(input())\r\n\r\ndistance = abs(a - b)\r\nt = 0 #total tiredness\r\n\r\nfor i in range(distance // 2):\r\n t += 2 (i + 1)\r\n\r\nif distance % 2 == 1:\r\n t += (distance // 2) + 1\r\n\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\npasos = 0\r\npuntodellegada = abs(a - b)\r\npasos = ((puntodellegada/2) * (puntodellegada/2) + (puntodellegada/2))\r\nprint(round(pasos))", "x1 = int(input())\r\nx2 = int(input())\r\n\r\nd = abs(x1 - x2)\r\n\r\nbase = d // 2\r\nrem = d % 2\r\n\r\nans = base * (base + 1)\r\nif rem:\r\n ans += base + 1\r\nprint(ans) ", "a = int(input())\r\nb = int(input())\r\ntbc = (a+b)//2\r\nprint(((abs(a-tbc)+1)(abs(a-tbc)))//2+((abs(b-tbc)+1)(abs(b-tbc)))//2)", "def solution(x1,x2):\r\n d=abs(x1-x2)\r\n c1=int(d/2)\r\n c2=int(d/2)+d%2\r\n return int((c1(c1+1)+c2(c2+1))/2)\r\ndef answer():\r\n x1 = int(input())\r\n x2 = int(input())\r\n print(solution(x1,x2))\r\nanswer()", "def dist(x, y):\r\n return abs(x - y)\r\n\r\ndef tired(x):\r\n return x * (x + 1) // 2\r\n\r\ndyn_sum = [1000000000 for i in range(1000)]\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\n\r\nfor i in range(1, 1001):\r\n dyn_sum[i - 1] = tired(dist(a, i)) + tired(dist(i, b))\r\n\r\nprint(min(dyn_sum))\r\n", "a,b=int(input()),int(input())\r\nprint(sum(range(abs(a-(a+b)//2)+1))+sum(range(abs(b-(a+b)//2)+1)))", "a=int(input())\r\nb=int(input())\r\nx=(a+b)//2\r\nt=0\r\nif a<b:\r\n for i in range(1,x+1-a):\r\n t=t+i\r\n for j in range(1,b-x+1):\r\n t=t+j\r\nelse:\r\n for i in range(1,a+1-x):\r\n t=t+i\r\n for j in range(1,x+1-b):\r\n t=t+j\r\nprint(t)\r\n", "n = abs(int(input()) - int(input()))\nh = n // 2\nprint((h * (h + 1)) + [0, 0 - -n // 2][n % 2 == 1])\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nd=(c//2)((c//2)+1)+(c%2)((c//2)+1)\r\nprint(d)\r\n", "l = int(input())\r\nr = int(input())\r\nn = abs(r-l)\r\nx = n//2\r\ny = n - x\r\nprint(x * (x+1)//2 + y * (y+1)//2)", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nA=int(input())\r\nB=int(input())\r\nX=abs(A-B)\r\nans=0\r\nif X%2==0:\r\n\tX=int(X/2)\r\n\tprint((X(X+1)))\r\nelse:\r\n\tX=int(X/2)\r\n\tprint(X(X+1)+X+1)\r\n", "a=int(input())\r\nb=int(input())\r\nd=max(a,b)-min(a,b)\r\nm=int(d/2)\r\nif d%2==0:\r\n\tprint(int((2)((m(m+1))/2)))\r\nelse:\r\n\tprint(int((2)((m(m+1))/2))+m+1)", "n = abs(int(input()) - int(input()))\r\n\r\nprint(((n + 1) // 2) * ((n + 2) // 2))", "a = int(input())\r\nb = int(input())\r\nc = max(a,b) - min(a,b)\r\nd = 0\r\ni = 0\r\nb = []\r\nwhile d < c:\r\n d += 1\r\n if len(b) % 2 == 0:\r\n i += 1\r\n b.append(i)\r\nprint(sum(b))", "a = int(input())\r\nb = int(input()) \r\nd = abs(a-b)\r\nh = d // 2\r\nif d%2 == 0:\r\n print(h(h+1)) # (1+2+...+h)2 = h(h+1)/2 * 2 = h(h+1)\r\nelse:\r\n print((h+1)(h+1)) # (1+2+...+h) + (1+2+...+h+h+1)\r\n", "a=int(input()) \r\nb=int(input()) \r\ns=abs(a-b)\r\nif(s%2==0):\r\n s=s//2\r\n print(s(s+1))\r\nelse:\r\n s=s//2\r\n print((s+1)*2)", "x = int(input())\r\ny = int(input())\r\ns = int((y-x)/2)\r\nif y>x:\r\n\ta = y\r\n\tb = x\r\nelse:\r\n\ta = x\r\n\tb = y\r\n\r\nif (a-b)%2 == 1:\r\n\ts = int((a-b+1)/2)\r\n\tsum1 = int(s(s-1)/2)\r\n\tsum2 = int(s(s+1)/2)\r\n\tprint(sum1+sum2)\r\nelse:\r\n\ts = int((a - b)/2)\r\n\tsum1 = int(s(s+1))\r\n\tprint(sum1)", "a = int(input())\r\nb = int(input())\r\nmid = (a + b) // 2\r\nprint((abs(mid - a) * (abs(mid - a) + 1) // 2) + (abs(mid - b) * (abs(mid - b) + 1) // 2))", "fa = int(input())\r\nfb = int(input())\r\n\r\nmid = (fa+fb)//2\r\n\r\ncntA = abs(fa-mid)\r\ncntB = abs(fb-mid)\r\n\r\ncnt = 1\r\nsuA = 0\r\nfor i in range(cntA):\r\n suA+=cnt\r\n cnt+=1\r\ncnt = 1\r\nsub = 0\r\nfor i in range(cntB):\r\n sub+=cnt\r\n cnt+=1\r\n\r\nprint(suA+sub)", "a=int(input())\r\nb=int(input())\r\nprint((abs(a-b)+1)*2//4)\r\n", "a=int(input())\r\nb=int(input())\r\nr=abs(b-a)\r\nr1=r//2\r\nr2=r-(r1)\r\nsum1=0\r\nfor i in range(1,r1+1):\r\n sum1=sum1+i\r\nfor i in range(1,r2+1):\r\n sum1=sum1+i\r\nprint(sum1)\r\n", "a, b = int(input()), int(input())\nmi, ma = min(a, b), max(a, b)\nmeet = (mi + ma) // 2\nprint(sum(list(range(meet + 1 - mi))) + sum(list(range(ma + 1 - meet))))\n", "def cost(a, b):\r\n n = abs(a-b)\r\n return (n(n+1))//2\r\n\r\na = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\nprint(cost(a, c) + cost(c, b))\r\n", "def f(n):\r\n return n * (n + 1) // 2\r\na, b = int(input()), int(input())\r\nif abs(a - b) % 2 == 0: print(f(abs(a - b) // 2) * 2)\r\nelse: print(f(abs(a - b) // 2) + f(abs(a - b) // 2 + 1))", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read_int()\n\tb=read_int()\n\tm=(a+b)//2\n\tdef f(x):\n\t\treturn x(x+1)//2\n\tprint(f(abs(m-a))+f(abs(m-b)))\n\nsolve()\n", "a,b=[int(input())for _ in[0,0]]\r\nx=abs(b-a);y=x//2\r\nprint(y(y+1)-(-x//2)(x%2))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif(d%2==0):\r\n m,n=d//2,d//2\r\nelse:\r\n m,n=d//2+1,d//2\r\nprint((m(m+1)//2)+(n(n+1)//2))\r\n \r\n", "d = abs(int(input()) - int(input()))\r\na, b = (d + 1) // 2, d // 2\r\nprint((a (a + 1) + b * (b + 1)) // 2)\r\n", "a = int(input())\r\nb = int(input())\r\nc = a - b\r\nd = int(abs(c))\r\nk = d//2\r\nif d%2==0:\r\n print(int(d(d//2+1)//2))\r\nelse:\r\n print(int(k(k+1)//2) + int((k+1)(k+2)//2))\r\n", "# LUOGU_RID: 101738502\na, b = map(int, open(0).read().split())\r\nt = abs(a - b)\r\nx = t // 2\r\ny = t - x\r\nprint(x (x + 1) // 2 + y * (y + 1) // 2)", "import math\r\na=int(input())\r\nb=int(input())\r\nif abs(b-a)==1:\r\n\tprint(1)\r\n\texit(0)\r\n\t\r\nif (a+b)%2==0:\r\n\tm=(a+b)//2\r\n\tn=abs(a-m) \r\n\tres=n(n+1)\r\n\tprint(res)\r\nelse:\r\n\tm=(a+b)//2\r\n\tif a<b:\r\n\t\tn=abs(a-m)\r\n\telse:\r\n\t\tn=abs(b-m)\r\n\tres=n(n+1)//2+(n+1)(n+2)//2 \r\n\tprint(res)\r\n\t\r\n\t\t", "a = int(input())\nb = int(input())\nS = abs(a - b)\nC = S // 2\nD = S % 2\nSumm = int(((1 + C) / 2) C)\nprint(Summ * 2 + (C + D) * D)# 1685366619.7983105", "f = lambda x: (x * (x + 1)) // 2\r\na, b = sorted([int(input()), int(input())])\r\nres = float('inf')\r\nfor c in range(a, b + 1):\r\n res = min(res, f(c - a) + f(b - c))\r\nprint(res)", "n= int(input())\r\nm = int(input())\r\n\r\nprint((abs(n - m) + 1) ** 2 // 4)\r\n", "def sum(n):\r\n return (n / 2) * (1 + n)\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nc = abs(a - b)\r\nif (c % 2 == 1):\r\n print(int(2 * sum(int(c/2)) + int(c/2 +1) ))\r\nelse:\r\n print(int(2 * sum(int(c/2))))\r\n", "a=int(input())\r\nb=int(input())\r\np=abs(a-b)\r\nx,y=p//2,p-(p//2)\r\nq,u=0,0\r\nfor i in range(1,x+1):\r\n q+=i\r\nfor i in range(1,y+1):\r\n u+=i\r\nprint(q+u)", "a = int(input())\r\nb = int(input())\r\nx = abs(a-b)\r\np = x//2\r\nif x % 2 == 1: print((p+1) ** 2)\r\nelif x % 2 == 0: print(p * (p+1))", "def sumOneToN(n):\r\n return int(n(n+1)/2)\r\n\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n d = abs(a-b)\r\n if d & 1 == 0:\r\n print(2sumOneToN(d/2))\r\n else:\r\n d -= 1\r\n print(sumOneToN(d/2) + sumOneToN(d/2 + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input());b = int(input())\r\na = abs(a - b)\r\nprint( (a // 2 * (a // 2 + 1) // 2) + ((a + 1) // 2 * ((a + 1) // 2 + 1) // 2))\r\n", "a = int(input())\r\nb = int(input())\r\nd = (a + b) // 2\r\na1 = abs(a - d)\r\nb1 = abs(b - d)\r\nk = 0\r\nfor i in range(1, a1 + 1):\r\n k += i\r\nfor i in range(1, b1 + 1):\r\n k += i\r\nprint(k)", "a=int(input())\nb=int(input())\ny=abs(a-b)\ncount=0\nz=0\nif(y%2==0):\n\tfor i in range(1,(y//2)+1):\n\t\tcount=count+i\n\tcount=2count\nelse:\n\tfor i in range(1,(y//2)+1):\n\t\tcount=count+i\n\t\tz=i\n\tcount=count2\n\tcount=count+z+1\nprint(count)\n\n", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nt=0\r\nif x==1:\r\n t=1\r\nelse:\r\n for i in range(1,(x//2)+1):\r\n t=t+i2\r\n if x%2!=0:\r\n t=t+i+1\r\nprint(t)", "d = abs(int(input()) - int(input()))\r\nprint(d // 2 (d // 2 + 1) + ((d + 1) // 2 if d & 1 else 0))", "a=int(input())\r\nb=int(input())\r\nt=0\r\nx=(a+b)//2\r\nif b>a:\r\n for i in range(1,x+1-a):\r\n t=t+i\r\n for j in range(1,b-x+1):\r\n t=t+j\r\n print(t)\r\nelse:\r\n for i in range(1,x+1-b):\r\n t=t+i\r\n for j in range(1,a-x+1):\r\n t=t+j\r\n print(t)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na = int(input())\r\nb = int(input())\r\nf = abs(a - b) // 2\r\ns = (abs(a - b) + 1) // 2\r\nprint(f * (f + 1) // 2 + s * (s + 1) // 2)", "a = int(input())\r\nb = int(input())\r\ngap = abs(a - b)\r\nn = gap//2\r\nm = gap - n\r\nprint((n(n+1)//2) + (m(m+1)//2))", "a=int(input())\nb=int(input())\nn=abs(b-a)\nif not n%2:\n\tn=n//2\n\tprint(n(n+1))\nelse:\n\tn//=2\n\tprint(n(n+1)+(n+1))", "a = int(input())\nb = int(input())\nmid = (a+b)//2\nadist = abs(mid-a)\nbdist = abs(mid-b)\ntire = ((adist+1) * adist // 2) + ((bdist+1) * bdist // 2)\nprint(tire)", "f1 = int(input())\nf2 = int(input())\n\ncountMaior = 0\ncountMenor = 0\niMenor = 0\niMaior = 0\n\nif(f1 > f2):\n maior = f1\n menor = f2\nelse:\n maior = f2\n menor = f1\n\nwhile(menor != maior):\n if(countMaior > countMenor):\n menor += 1\n iMenor += 1\n countMenor += iMenor\n else:\n maior -= 1\n iMaior += 1\n countMaior += iMaior\n\nprint(countMaior + countMenor)\n\t\t\t\t \t\t \t \t \t \t\t\t \t\t\t \t \t\t\t", "a = int(input())\r\nb = int(input())\r\nlength = abs(a - b)\r\nd = (length//2)((length//2)+1)+(length%2)((length//2)+1)\r\nprint(d)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\na,b = min(a,b),max(a,b)\r\n\r\n\r\ns = (a+b)//2\r\nd = (a+b)%2\r\n\r\nx=sum(range(s-a+1))\r\ny=sum(range(b-s+1))\r\nprint(x+y)", "a = int(input())\r\nb = int(input())\r\nx = 0\r\nif (a - b) % 2 >= 1:\r\n x = (a + b) // 2 + 1\r\nelse:\r\n x = (a + b) // 2\r\nmoo = abs(a - x) * (abs(a - x) + 1) // 2\r\npor = abs(b - x) * (abs(b - x) + 1) // 2\r\nprint(moo + por)", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nif c==1:\r\n print(1)\r\nelif c%2==0:\r\n d=c//2\r\n d=(d(d+1))//2\r\n print(d2)\r\nelse:\r\n d=c//2\r\n e=(c//2)+1\r\n d=(d(d+1))//2\r\n e=(e(e+1))//2\r\n print(d+e)", "a = int(input())\nb = int(input())\n\nmiddle = (a + b) // 2\n\ntiredness = 0\nfor i in range(abs(a - middle)):\n tiredness += (i + 1)\nfor i in range(abs(b - middle)):\n tiredness += (i + 1)\nprint(tiredness)\n", "friend1_location = int(input())\nfriend2_location = int(input())\nmoves = abs(friend2_location - friend1_location) // 2\nprint(2 * (moves + 1) * moves // 2 + (friend2_location - friend1_location) % 2 * (moves + 1))", "qi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn=qi()\r\nm=qi()\r\nprint(sum(range(1,abs(m-n)//2+1))+sum(range(1,(abs(m-n)-(abs(m-n)//2))+1)))", "n = abs(int(input()) - int(input())) - 1\r\na = 2\r\nb = -2n - 2\r\nc = n2 + 3n + 2\r\ne = (-b) // (2a)\r\nif e <= 0:\r\n e = 1\r\nr = (a(e*2) + be + c) // 2\r\nprint(r)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-01 21:48:12\nLastEditTime: 2021-12-01 21:53:33\nDescription: Friends Meeting\nFilePath: CF931A.py\n'''\n\n\ndef func():\n a, b = int(input()), int(input())\n dis1 = abs(a - b) // 2\n dis2 = abs(a - b) - dis1\n print((1 + dis1) * dis1 // 2 + (1 + dis2) * dis2 // 2)\n\n\nif __name__ == '__main__':\n func()\n", "boy1 = int(input())\r\nboy2 = int(input())\r\ndistance = abs(boy1 - boy2)\r\nremainder = distance % 2\r\nif remainder == 0:\r\n distance1 = distance // 2 + 1\r\n distance2added = 0\r\n mySum = 0\r\n for i in range(1, distance1):\r\n mySum += i\r\n totalSum = mySum * 2\r\n print(totalSum)\r\nelif remainder == 1:\r\n distance1 = distance // 2 + 1\r\n distance2added = 1\r\n mySum = 0\r\n for i in range(1, distance1):\r\n mySum += i\r\n totalSum = mySum * 2 + distance1\r\n print(totalSum)\r\n", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nt=0\r\nfor i in range(x//2):\r\n i+=1\r\n t=t+(1i)\r\nt=2t\r\nif x%2==0:\r\n print(t)\r\nelse:\r\n print(t+(x//2)+1)\r\n", "f1 = int(input())\r\nf2 = int(input())\r\n\r\ndis = abs(f1 - f2)\r\nmd = dis//2\r\nif dis % 2 == 0:\r\n ans = (md * (md+1))\r\n\r\nelse:\r\n ans = (md * (md+1)) // 2 + ((md+1) * (md+2)) // 2\r\n\r\n\r\nprint(ans)\r\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nr=0\r\nif(c%2!=0):\r\n c+=1\r\n r=1\r\nn=c//2\r\nf=n(n+1)\r\nif(r==1):\r\n f-=n\r\nprint(f)\r\n", "a=int(input())\r\nb=int(input())\r\nc=(abs(a-b)+1)\r\nprint(c2//4)\r\n", "import math\n\ndef not_factorial(x):\n result = x \n for i in reversed(range(x)):\n result += i\n return result\n\n\na = int(input())\nb = int(input())\n\ndistance = abs(a - b)\n\na =not_factorial(math.floor(distance / 2))\nb =not_factorial(math.ceil(distance / 2))\n\nprint(a+b)\n\n\n\n\n\n\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nd=0\r\ne=1\r\nif(a<c):\r\n for i in range(a,c):\r\n d=d+e\r\n e=e+1\r\nelse:\r\n for i in range(c,a):\r\n d=d+e\r\n e=e+1\r\ne=1\r\nif(b<c):\r\n for i in range(b,c):\r\n d=d+e\r\n e=e+1\r\nelse:\r\n for i in range(c,b):\r\n d=d+e\r\n e=e+1\r\nprint(d)", "# https://codeforces.com/problemset/problem/931/A\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nx = abs(a - b) // 2\r\n\r\nif abs(a - b) % 2 == 0:\r\n print(x (x + 1))\r\nelse:\r\n print(x * (x + 1) + x + 1)\r\n", "a=int(input());b=int(input())\r\nA=abs(a-(a+b)//2);B=abs(b-(a+b)//2)\r\nprint(A(A+1)//2+B(B+1)//2)", "from collections import \r\nfrom heapq import \r\nfrom bisect import \r\nfrom itertools import \r\nfrom functools import \r\nfrom math import \r\nfrom string import \r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve1():\r\n a, b = [int(input()) for _ in range(2)]\r\n a, b = sorted((a, b))\r\n\r\n def cost(x):\r\n ans = 0\r\n A = [a, 1]\r\n B = [b, 1]\r\n\r\n while A[0] != B[0]:\r\n if A[1] < B[1]:\r\n A[0] += 1\r\n ans += A[1]\r\n A[1] += 1\r\n else:\r\n B[0] -= 1\r\n ans += B[1]\r\n B[1] += 1\r\n\r\n return ans\r\n\r\n print(cost((a + b) // 2))\r\n\r\ndef solve():\r\n a, b = [int(input()) for _ in range(2)]\r\n x = (a + b) // 2\r\n count = lambda x: x (x + 1) // 2\r\n print(count(abs(x - a)) + count(abs(x - b)))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x1 = int(input().strip())\nx2 = int(input().strip())\n\nd = abs(x1-x2)\n\nn = d//2\nrem = d%2\n\nresult = (1+n) * n\n\nresult += rem(n+1)\nprint(result)\n", "def sum_upto(n):\r\n\tx = 0\r\n\tfor i in range(0,n+1):\r\n\t\tx += i\r\n\treturn x\t\r\na = int(input())\r\nb = int(input())\r\nx = (a + b)//2\r\nprint(sum_upto(abs(x - a)) + sum_upto(abs(x - b)))", "a=int(input())\r\nb=int(input())\r\nsum=0\r\nc=(abs(a-b))//2\r\nif c==0:\r\n print(1)\r\nelif abs(a-b)%2==0:\r\n for i in range(c):\r\n sum+=(i+1)2\r\n print(sum) \r\nelse:\r\n for i in range(c):\r\n sum+=(i+1)2\r\n sum+=(i+2) \r\n print(sum) ", "a = int(input())\r\nb = int(input())\r\n\r\nmid = (a+b)//2\r\ni = 0\r\ntiredness = 0\r\nadist = abs(mid - a)\r\nbdist = abs(mid - b)\r\n\r\nfor x in range(adist):\r\n i += 1\r\n tiredness += i\r\n\r\ni = 0\r\n\r\nfor y in range(bdist):\r\n i += 1\r\n tiredness += i\r\n\r\nprint(tiredness)\r\n \r\n ", "import sys\r\n\r\nnum1 = int(sys.stdin.readline().strip())\r\nnum2 = int(sys.stdin.readline().strip())\r\n\r\ndiff = abs(num1 - num2)\r\n\r\nboth = diff // 2\r\nremainingSteps = diff % 2 if diff % 2 == 0 else (diff % 2) + both\r\ntiredness = 0\r\nfor num in range(both+1):\r\n tiredness += num\r\ntiredness = 2\r\ntiredness += remainingSteps\r\nprint(tiredness)", "a = input()\r\nb = input()\r\n\r\ndiff = abs(int(a)-int(b))\r\n\r\nif diff % 2 == 0:\r\n\tprint(str((1 + diff//2) * (diff//2)))\r\nelse:\r\n\tprint(str(diff//2 + 1 + (1+diff//2)(diff//2)))\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nh = d >> 1\r\nret = h (h + 1)\r\nif d & 1:\r\n ret += h + 1\r\nprint(ret)\r\n", "x=int(input())\r\ny=int(input())\r\nd=abs(y-x)\r\nif d%2==0:\r\n a=d/2\r\n c=2((a/2)(1+a))\r\nelse:\r\n a=d//2\r\n c=2((a/2)(1+a))+a+1\r\nprint(int(c))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\n\r\nif d==0 or d==1:\r\n print(d)\r\n exit(0)\r\n\r\nif d%2==0:\r\n n=d//2\r\n print(n(n+1))\r\n\r\nelse:\r\n n=d//2\r\n m=n+1\r\n print((n(n+1))//2 +(m(m+1))//2)\r\n", "def f(x):\r\n return x (x + 1) // 2\r\na = int(input())\r\nb = int(input())\r\nx = abs(a - b)\r\nprint(f(x // 2) + f((x + 1) // 2))", "a = int(input())\r\nb = int(input())\r\nm = (a+b)//2\r\nt=0\r\nf1 = abs(m-a)\r\nf2 = abs(b-m)\r\nfor i in range(1,f1+1):\r\n t+=i\r\nfor j in range(1,f2+1):\r\n t+=j\r\nprint(t)", "a = int(input())\nb = int(input())\nif (a>b):\n dis = (a-b)\n# if dis==2:\n# ;\n if dis%2==1:\n dis = (int)(dis/2)\n dis = dis(dis+1) + (dis+1)\n else:\n dis = (int)(dis/2)\n dis = dis(dis+1)\nelse:\n dis = b-a\n# if dis==2:\n# ;\n if dis%2==1:\n dis = (int)(dis/2)\n dis = dis(dis+1) + (dis+1)\n else:\n dis = (int)(dis/2)\n dis = dis(dis+1)\nprint(dis)\n\t \t \t\t \t \t \t\t\t \t\t\t\t\t\t\t \t", "a = int(input())\r\nb = int(input())\r\n\r\nif (a + b) % 2 == 0:\r\n d = abs(a - b) // 2\r\n print(d * (d + 1))\r\nelse:\r\n d1 = (abs(a - b) - 1) // 2\r\n d2 = d1 + 1\r\n print(d1 * (d1 + 1) // 2 + d2 * (d2 + 1) // 2)\r\n", "x=int(input())\r\ny=int(input())\r\n\r\ndef f(n):\r\n a=n(n+1)\r\n return a\r\n\r\nif y>x:\r\n c=y-x\r\nelse:\r\n c=x-y\r\n\r\nn=c//2 \r\nif c%2==0:\r\n print(f(n))\r\nelse:\r\n print(f(n)+n+1)", "a = int(input())\r\nb = int(input())\r\nl = abs(a - b)\r\nma = l // 2\r\nmb = l - ma\r\nprint(int(ma (ma + 1) / 2 + mb * (mb + 1) / 2))", "a = int(input())\r\nb = int(input())\r\n\r\nstepsA = abs(b - a) // 2\r\nstepsB = abs(b - a) - abs(b - a) // 2\r\n\r\nprint(stepsA * (stepsA + 1) // 2 + stepsB * (stepsB + 1) // 2)\r\n", "def sumArif(a1,n):\r\n\treturn ((2a1+ n - 1)/2) n\r\n\t\r\na = int(input())\r\nb = int(input())\r\nminn = 0\r\nmaxx = 0\r\nif (a > b):\r\n\tmaxx = a\r\n\tminn = b\r\nelse: \r\n\tmaxx = b\r\n\tminn = a\r\ndelta = maxx - minn \r\nif delta % 2 == 1:\r\n\tprint(int(sumArif(1,delta//2)2 + delta // 2 + 1))\r\nelse:\r\n\tprint(int(sumArif(1,delta//2)2))", "\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n if (b-a)%2==0:\r\n d = abs((b-a))//2\r\n r = d(d+1)\r\n else:\r\n d = abs((b - a)) // 2\r\n r = d (d + 1)//2\r\n r+= (d+1) * (d + 2)//2\r\n print(r)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "ac = int(input())\r\nbc = int(input())\r\nl = abs(ac - bc)\r\nma = l // 2\r\nmb = l - ma\r\nprint(int(ma * (ma + 1) / 2 + mb * (mb + 1) / 2))\r\n", "a = int(input())\r\nb = int(input())\r\nk = abs(a - b) % 2\r\nn = abs(a - b) // 2\r\n\r\nsum = ((2 + n * 2) // 2) * n\r\n\r\nsum += (1 + n) * k\r\nprint(sum)\r\n", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nnsum = lambda x: x(x+1)//2\r\n\r\na = I()\r\nb = I()\r\nd = abs(a-b)\r\nd0, d1 = d//2, (d+1)//2\r\nprint(nsum(d0) + nsum(d1))", "a = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\ns1 = abs(a-c)\r\ns2 = abs(b-c)\r\nprint(s1(s1+1)//2 + s2(s2+1)//2)", "a = int(input())\r\nb = int(input())\r\nx = 0\r\nfor i in range(abs(a-int((a+b)/2))+1):\r\n x += i\r\nfor i in range(abs(b-int((a+b)/2))+1):\r\n x += i\r\nprint(x)", "def dragon():\r\n\r\n a = int(input())\r\n b = int(input())\r\n\r\n if a >b :\r\n a, b = b, a\r\n\r\n a_t = 0\r\n b_t = 0\r\n\r\n mid_d = abs((b-a)//2)\r\n\r\n mid = a + mid_d\r\n\r\n a_d = mid - a\r\n b_d = b - mid\r\n\r\n\r\n for i in range(1, a_d +1):\r\n a_t += i\r\n\r\n for i in range(1, b_d +1):\r\n b_t += i\r\n\r\n return a_t + b_t\r\n \r\ndef main():\r\n #print(lucky())\r\n #print(translate())\r\n # print(dragons())\r\n print(dragon())\r\nmain()", "x=int(input())\r\ny=int(input())\r\nt=abs(y-x)//2\r\nc=(t(t+1))\r\nif(abs(y-x)%2==0):\r\n print(c)\r\nelse:\r\n print(c+t+1)", "def sumOfNum(n):\r\n return ( ( n * ( n + 1 ) ) / 2 )\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndist = abs(a - b)\r\ntired1 = dist // 2\r\ntired2 = dist - tired1\r\n\r\nTotalTired = sumOfNum(tired1) + sumOfNum(tired2)\r\n\r\nprint(int(TotalTired))", "import math\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\nif diff % 2 != 0:\r\n first = diff // 2\r\n second = math.ceil(diff / 2)\r\n ans1 = ((1 + first) * first) // 2\r\n ans2 = ((1 + second) * second) // 2\r\n print(ans1 + ans2)\r\nelse:\r\n first = diff // 2\r\n ans1 = ((1 + first) * first) // 2\r\n print(ans1 * 2)\r\n\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\ndef sn(x):\r\n\treturn (x(x+1))//2\r\n\r\na=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\ns=sn(abs(c-a))+sn(abs(c-b))\r\nprint(s)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a-b)\r\nh = (d//2)\r\ni = 1\r\nres = 0\r\nfor ind in range(h):\r\n res += i\r\n i += 1\r\n\r\nres = 2 res\r\nif d % 2 == 1:\r\n res += i\r\n \r\nprint(res)\r\n", "a, b = int(input()), int(input())\r\nm = abs(a - b)\r\nn = m // 2\r\nprint(n * (n + 1) + m % 2 * (n + 1))", "'''input\r\n101\r\n99\r\n'''\r\nc = 1\r\nl = []\r\nfor i in range(1000):\r\n\tl.append(c)\r\n\tl.append(c)\r\n\tc += 1\r\n\r\na = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nprint(sum(l[:d]))", "a = int(input())\r\nb = int(input())\r\ndif = abs(b - a)\r\nif (b - a) % 2 == 0:\r\n n = dif // 2\r\n ans = n * (n + 1)\r\nelse:\r\n n = dif // 2\r\n ans = n * (n + 1)\r\n ans += n + 1\r\nprint(ans)\r\n", "def fun(x):\r\n return (x(x+1))//2\r\nn=int(input())\r\nm=int(input())\r\nk=abs(n-m)\r\np=k//2\r\nif(k%2==0):\r\n d=0\r\nelse:\r\n d=p+1\r\nl=2fun(p)+d\r\nprint(l)", "from math import \r\nx1=int(input())\r\nx2=int(input())\r\nx=int(fabs(x1-x2))\r\nif x%2==0:\r\n n=x//2\r\n print(n(n+1))\r\nelse:\r\n n=x//2\r\n print(n(n+1)//2+(n+1)(n+2)//2)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n d1 = abs(a - b) // 2\r\n d2 = (abs(a - b) + 1) // 2\r\n ans = 0\r\n for i in range(1, d1 + 1):\r\n ans += i\r\n for i in range(1, d2 + 1):\r\n ans += i\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "friend_one=int(input())\r\nfriend_two=int(input())\r\nimport math\r\nx=abs(friend_one-friend_two)\r\ntirednessA=x/2\r\ntirednessB=x-x/2\r\na=tirednessA(tirednessA+1)/2\r\nb=tirednessB(tirednessB+1)/2\r\nprint(math.ceil(a+b))", "from math import ceil\r\nn=int(input())\r\nt=int(input())\r\nx=ceil((n+t)/2)\r\ny=abs(x-n)\r\nz=y(y+1)//2\r\nyy=abs(x-t)\r\nzz=yy(yy+1)//2\r\nprint(zz+z)", "a=int(input())\r\nb=int(input())\r\nif (a+b)%2==0:\r\n c=int((a+b)/2)\r\nelse:\r\n c=int((a+b)/2)+1\r\nx=abs(c-a)\r\ny=abs(b-c)\r\nsum1=0\r\nsum2=0\r\ni=1\r\nj=1\r\nif x>0:\r\n for i in range(x+1):\r\n sum1=sum1+i\r\nif y>0:\r\n for j in range(y+1):\r\n sum2=sum2+j\r\nprint(sum1+sum2)", "from math import ceil\r\na = int(input())\r\nb = int(input())\r\n\r\nx = ceil((a+b)/2)\r\n\r\na = abs(x-a)\r\nb = abs(b-x)\r\n\r\nc = 0\r\n\r\nfor i in range(1, a+1):\r\n c += i\r\nfor i in range(1, b+1):\r\n c += i\r\nprint(c)", "a = int(input())\nb = int(input())\nm = abs(a-b) // 2\ns = 0\nfor i in range(1, m+1):\n s += i * 2\nif abs(a-b) % 2 == 1:\n s += m + 1\nprint(s)\n", "f = int(input())\r\nl = int(input())\r\nif l>f:\r\n d = l-f\r\nelse:\r\n d = f - l\r\nn = d//2\r\ns=n(n+1)//2\r\nn = d - n\r\ns = s+n(n+1)//2\r\nprint(s)", "x=int(input())\r\ny=int(input())\r\nprint(int(2(1+abs(x-y)//2)/2(abs(x-y)//2)+[abs(x-y)//2+1,0][abs(x-y)%2==0]))\r\n", "def s(n):\r\n sum = 0\r\n for i in range(1, n + 1):\r\n sum += i\r\n return sum\r\n\r\na = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nstep = b - a\r\nif step % 2 == 0:\r\n print(s(step // 2) * 2)\r\nelse:\r\n print(s(step // 2) * 2 + (step + 1) // 2)", "a = int(input())\r\nb = int(input())\r\ncount=0\r\nif abs(a-b)%2!=0:\r\n\tfor i in range(0,abs(a-b)//2+1):\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\t\tif i>=1:\r\n\t\t\tcount+=i\r\nelse:\r\n\tfor i in range(0,abs(a-b)//2):\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\r\nprint(count)\t\t", "# Friends Meeting\ndef tired(a, b):\n diff = abs(a - b)\n if diff & 1 == 0:\n diff //= 2\n ans = (diff * (diff + 1)) // 2\n return 2 * ans\n x = diff // 2\n y = x + 1\n ans = ((x * (x + 1)) // 2) + ((y * (y + 1)) // 2)\n return ans\n\n\na = int(input())\nb = int(input())\nprint(tired(a, b))\n", "a=int(input())\nb = int(input())\ndis = abs(b-a)\nmult,mod = dis//2 ,dis%2(dis//2+1)\ntotal = ((mult(mult+1)))+mod\nprint(total)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nif d % 2 == 0:\r\n n = d // 2\r\n print((1+n)n)\r\nelse:\r\n n = d // 2\r\n print((1+n)n + n + 1)", "a = int(input())\nb = int(input())\nk = abs(a-b)\na = (k//2)(k//2+1)\nif k%2 == 1:\n\ta += (k+1)//2\nprint(a)\n\t\n", "import sys\r\nfrom collections import \r\nfrom math import \r\nimport re\r\ndef inp_arr():return list(map(int,input().split()))\r\ndef inp():return map(int,input().split())\r\ndef lcm(a,b):return (ab)/gcd(a,b)\r\ndef even(n):return[False,True][0 if n%2 else 1]\r\nmax_int = sys.maxsize\r\nmod = 10*9+7\r\n\r\ndef solver(n):return int(n(n+1)/2)\r\na,b=int(input()),int(input())\r\nn=abs(a-b)\r\nprint(solver(ceil(n/2))+solver(floor(n/2)))", "a = int(input())\r\nb = int(input())\r\n\r\ng = (a + b) // 2\r\naa = int(abs(a - g))\r\nbb = int(abs(b - g))\r\n\r\nans = int(aa * (aa + 1) / 2 + bb * (bb + 1) / 2)\r\nprint(ans)\r\n", "print((abs(int(input()) - int(input())) + 1) ** 2 // 4)\n", "a = int(input())\r\nb = int(input())\r\nsredn = (a+b) // 2\r\nr_a, r_b = abs(a - sredn), abs(b - sredn)\r\nc_a, c_b = r_a * (r_a + 1) / 2, r_b * (r_b + 1) / 2\r\nprint(int(c_a+c_b))", "a = int(input())\r\nb = int(input())\r\n\r\nif a<b:\r\n small = a\r\n large = b\r\n d = b-a\r\nelse:\r\n small = b\r\n large = a\r\n d = a-b\r\n\r\ncenter = small + d//2\r\n\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(1, (d//2)+1):\r\n s1+=i\r\n\r\nfor i in range(1, (large-center)+1):\r\n s2+=i\r\n\r\nprint(s1+s2)", "a = int(input())\r\nb = int(input())\r\ncount = 0\r\nk = abs(a-b)\r\nn = k//2\r\n\r\nif k%2==0:\r\n count += n(n+1)\r\n\r\nelse:\r\n count += n(n+1)//2 + (n+1)(n+2)//2\r\n\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nif abs(a-b)%2==0:\r\n tengah=int((a+b)/2)\r\nelse:\r\n tengah=int((a+b+1)/2)\r\na1=abs(a-tengah)\r\nb1=abs(b-tengah)\r\ni=1\r\nj=0\r\ntiredness=0\r\nwhile j<a1:\r\n tiredness+=i\r\n i+=1\r\n j+=1\r\nj=0\r\ni=1\r\nwhile j<b1:\r\n tiredness+=i\r\n i+=1\r\n j+=1\r\nprint(tiredness)\r\n", "a = int(input())\nb = int(input())\ndiff = abs(a-b)\ns = 0\nif(diff<=2):\n print(diff)\nelse:\n for i in range(1,(diff//2+1)):\n s = s + i\n for i in range(1,(diff-(diff//2)+1)):\n s = s + i\n print(s)\n", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nr = d // 2\r\nres = r (r + 1) // 2 \r\nif d % 2 == 0:\r\n res = 2\r\nelse:\r\n res += (r + 1) (r + 2) //2\r\nprint(res)", "n=int(input())\r\nm=int(input())\r\nx=abs(m-n)\r\ny=int(x/2)\r\nif x%2==0:\r\n\tprint(y(y+1))\r\nelse:\r\n\tprint((y(y+1)+y+1))", "x1 = int(input())\r\nx2 = int(input())\r\ndiff = abs(x1-x2)\r\nif diff%2==0:\r\n diff = diff//2\r\n print(diff(diff+1))\r\nelse:\r\n diff -= 1\r\n diff = diff//2\r\n print(diff(diff+1) + (diff+1))", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)//2\r\nif abs(a-b)%2==0:\r\n\tprint(2sum([x for x in range(c+1)]))\r\nelse:\r\n\tprint(2sum([x for x in range(c+1)])+c+1)", "import math\n\na = eval(input())\nb = eval(input())\nres = 0\n\n\ndef sum(x, step):\n if x == 0:\n return step\n else:\n step += x\n x -= 1\n return sum(x, step)\n\n\nd = int(math.fabs(a - b) / 2)\nres = 2 * sum(d, 0)\nif d * 2 < math.fabs(a - b):\n res += d + 1\nprint(res)\n\n\t\t\t \t\t\t \t \t \t\t", "a = int(input())\r\nb = int(input())\r\nlength = abs(a-b)\r\ncntA = int(length/2)\r\ncntB= length-(cntA)\r\nf1 = (cntA(cntA+1))/2\r\nf2 =(cntB(cntB+1))/2\r\nprint(int(f1+f2))", "A = int(input())\r\nB = int(input())\r\ntA = abs(A-B)//2\r\ntB = abs(A-B)-tA\r\ntA, tB = tA(tA+1)//2, tB(tB+1)//2\r\ntiredness = tA + tB\r\nprint(tiredness)", "a = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a-b)\r\n\r\nres = 0\r\nif diff%2 == 0:\r\n for i in range(int(diff/2)):\r\n res += i+1\r\n\r\n print(2res)\r\nelse:\r\n for i in range(int(diff/2)):\r\n res += i+1\r\n\r\n res = 2res\r\n res += int(diff/2)+1\r\n\r\n print(res)", "import math\r\n\r\na = int(input()) \r\nb = int(input()) \r\nif(a>b):\r\n temp =a \r\n a=b\r\n b=temp\r\nelse:\r\n pass\r\n\r\npoint = math.ceil ((b+a)/2) \r\nif((b-a)==1 or (a-b)==-1):\r\n print(1) \r\nelse:\r\n distance1 = point - a \r\n distance2 = b - point \r\n tired1 = (distance1)(distance1+1)/2 \r\n tired2 = (distance2)(distance2+1)/2\r\n print(int(tired2+tired1))\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nx = abs((b - a)) // 2\r\n\r\nans = 0\r\nans += x * (x + 1)\r\n\r\nif abs((b - a)) % 2 == 1:\r\n\tans += x + 1\r\nprint(ans)\t\r\n", "p = abs(int(input()) - int(input()))\r\ntired=0\r\nn=1\r\nwhile p>0:\r\n if p>1:\r\n tired+=n2\r\n p-=2\r\n else:\r\n tired+=n\r\n p-=1\r\n n+=1\r\nprint(tired)", "n1=int(input())\r\nn2=int(input())\r\nif n1>n2:\r\n c=n1\r\n n1=n2\r\n n2=c\r\nc=0\r\np1=0\r\np2=0\r\ns=0\r\n\r\nwhile n1<n2:\r\n if c%2==0:\r\n n1+=1\r\n p1+=1\r\n s=s+p1\r\n else:\r\n n2-=1\r\n p2+=1\r\n s=s+p2\r\n c+=1\r\nprint(s)", "a, b = int(input()), int(input())\r\nda = abs(a-b)//2\r\ndb = abs(a-b)-da\r\nprint(da(da+1)//2 + db(db+1)//2)", "import math\r\na = int(input())\r\nb = int(input())\r\ntravel = abs(b-a) - 1\r\nif travel%2 == 0:\r\n #one will take one step more\r\n x1Step = travel//2\r\n # print(x1Step)\r\n tired = sum(range(1,x1Step+1)) 2\r\n tired += (x1Step + 1)\r\n print(tired)\r\nelse:\r\n x1Step = travel//2\r\n tired = sum(range(1,x1Step+1))2\r\n tired += (x1Step+1)2\r\n print(tired)\r\n\r\n", "print((lambda x,y:((abs(x-y)//2)(abs(x-y)//2+1))//2+(((abs(x-y))-abs(x-y)//2)(abs(x-y)-abs(x-y)//2+1)//2))(int(input()),int(input())))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "a = int(input())\nb = int(input())\nif a > b:\n tmp = a\n a = b\n b = tmp\nc = b - a\nk = int(c/2)\nif c%2:\n print((k+1)2)\nelse:\n print(k2 + k)\n\n\t\t\t \t\t\t\t \t \t \t \t\t \t\t \t\t \t \t\t", "a = int(input())\r\nb = int(input())\r\ns1 = 0\r\ns2 = 0\r\nt = (a+b)//2\r\nfor i in range(1, abs(t-a)+1):\r\n s1+=i\r\nfor i in range(1, abs(t-b)+1):\r\n s2+=i\r\nprint(s1+s2)", "class encontro_dos_parcas:\n def __init__(self):\n self.resposta = ''\n self.entrada_1 = 0\n self.entrada_2 = 0\n\n def leitura(self):\n self.entrada_1 = int(input())\n self.entrada_2 = int(input())\n\n def solucao(self):\n distancia = abs(self.entrada_1 - self.entrada_2)\n if distancia % 2:\n amigo_1 = distancia // 2\n amigo_2 = distancia // 2 + 1\n else:\n amigo_1 = distancia // 2\n amigo_2 = distancia // 2\n cansaco_geral = sum([x + 1 for x in range(amigo_1)])\n cansaco_geral += sum([x + 1 for x in range(amigo_2)])\n self.resposta = str(cansaco_geral)\n\n def resultado(self):\n return self.resposta\n\n\nif __name__ == \"__main__\":\n questao = encontro_dos_parcas()\n questao.leitura()\n questao.solucao()\n print(questao.resultado())\n \t\t\t \t\t \t \t \t\t \t \t", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nd_ = 0\r\nd = 0\r\n\r\nif c % 2 == 0:\r\n for i in range(1, c//2+1):\r\n d_ += i \r\n print(d_2)\r\nelse:\r\n for _ in range(1, math.ceil(c/2)+1):\r\n d_ += _\r\n d += _\r\n if _ == math.ceil(c/2):\r\n d -= math.ceil(c/2)\r\n print(d_ + d)", "from math import \n\ndef g(n):\n return n * (n+1) // 2\n\na = int(input())\nb = int(input())\n\nn = abs(a-b)/2\n\nprint(g(ceil(n)) + g(floor(n)))\n", "def factorial(n):\r\n if n==0:\r\n return 0\r\n elif n==1:\r\n return 1\r\n else:\r\n return n+factorial(n-1)\r\n\t\r\nfriend1=int(input())\r\nfriend2=int(input())\r\nif friend1>friend2:\r\n friend1,friend2=friend2,friend1\r\nmid=(friend2-friend1)/2\r\nif not mid.is_integer():\r\n tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))\r\n \r\nelse:\r\n tiredness=2(factorial((friend2-friend1)//2))\r\n \r\nprint(tiredness)", "# for testCase in range(int(input())):\na = int(input())\nb = int(input())\ndiff = abs(a-b)\nprint((diff//2)(diff//2+1)//2+((diff+1)//2)((diff+1)//2+1)//2)\n", "import sys\r\ndef cal(n1,n2):\r\n t=0\r\n t1=1\r\n t2=1\r\n i=min(n1,n2)\r\n j=max(n1,n2)\r\n while(i<=j):\r\n \r\n if(i==j):\r\n return t\r\n i+=1\r\n t+=t1\r\n t1+=1\r\n if(i==j):\r\n return t\r\n \r\n j-=1\r\n t+=t2\r\n t2+=1\r\n if(i==j):\r\n return t\r\n\r\n return t\r\n\r\ndef main():\r\n n1=int(input())\r\n n2=int(input())\r\n x=cal(n1,n2)\r\n print(x)\r\nif __name__==\"__main__\":\r\n main()\r\n", "a = int(input())\r\nb = int(input())\r\nb = abs(b - a)\r\na = 0\r\nA = b // 2\r\nB = b - A\r\nq = 0\r\nfor i in range(1, A + 1):\r\n q += i\r\nfor i in range(1, B + 1):\r\n q += i\r\nprint(q)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n d=d//2\r\n print((d)(d+1))\r\nelse:\r\n c=d\r\n d=d//2\r\n print((d)(d+1)+d+1)", "a = int(input())\nb = int(input())\ndist = abs(a - b)\nhalf = dist // 2\ntiredness = 0\nfor i in range(1, half + 1):\n tiredness += 2 i\nif (dist % 2 == 1):\n tiredness += half + 1\nprint(tiredness)\n", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n tmp = a\r\n a = b\r\n b = tmp\r\n\r\nif (a + b) / 2 == (a + b) // 2:\r\n point = (a + b) // 2\r\nelse:\r\n point = math.ceil((a + b) / 2)\r\n\r\nans = (point - a)(point - a + 1) / 2\r\nans += (b - point) (b - point + 1) / 2\r\nprint(int(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b, asum = int(input()), int(input()), lambda x: (1 + x) * x // 2\r\na, b = abs(a - b) // 2, abs(a - b) - abs(a - b) // 2\r\nprint(asum(a) + asum(b))", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\ns = 0\r\nc = 0\r\nif d % 2 == 0:\r\n s += (d // 2)\r\n for i in range(1, s + 1):\r\n c += i\r\n print(c * 2)\r\n exit()\r\nelse:\r\n s += (d // 2)\r\n k = 0\r\n for i in range(1, s + 1):\r\n c += i\r\n k = i\r\n c = c * 2\r\n c += (k + 1)\r\n print(c)\r\n", "a = int(input());\r\nb = int(input());\r\nans = 0; k = abs(b - a);\r\nfor i in range(1, k // 2 + 1):\r\n ans += i;\r\nans = 2;\r\nif k % 2 == 1:\r\n ans += k // 2 + 1;\r\nprint(ans);\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs((b - a) // 2)\r\nd = abs(max(a, b) - min(a, b) - c)\r\ns= c (c + 1) / 2 + d * (d + 1) / 2\r\nprint(int(s))", "a = int(input())\r\nb = int(input())\r\nm = (a + b)//2\r\ns1 = abs(a - m)\r\ns2 = abs(b - m)\r\ns1 = (s1(s1+1))//2\r\ns2 = (s2(s2+1))//2\r\nprint(int(s1+s2))", "x=int(input())\r\ny=int(input())\r\nn=abs(x-y)\r\nm=n//2\r\nif n%2==0:\r\n c=m(m+1)\r\nelse :\r\n c=(m(m+1)//2)+(((m+1)(m+2))//2)\r\nprint(c)\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\ta = int(inp()); b = int(inp())\r\n\tm = abs(a-b); n = m//2\r\n\tprint(n(n+1) + [0, n+1][m%2])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n# addcbcdda\r\n# addcbcdda", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\na=int(input())\nb=int(input())\nk=abs(a-b)\nif(k%2==0):\n k=k//2\n print(k(k+1))\nelse:\n k//=2\n print((k+1)2)\n", "a = int(input())\r\nb = int(input())\r\n\r\nx = abs(b-a)\r\nn = int(x/2)\r\nm = x - int(x/2)\r\n\r\nans = int((n(n+1))/2)\r\nans += int((m(m+1))/2)\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\n\r\nsumi=a+b\r\nans=0\r\n\r\nif sumi%2==0:\r\n half=sumi/2\r\n sumi=abs(half-a)\r\n for i in range(int(sumi+1)):\r\n ans=ans+i\r\n ans=ans2\r\nelse:\r\n half=sumi/2\r\n a=min(a,b)\r\n sumi=abs(half-a)\r\n for i in range(int(sumi+1)):\r\n ans=ans+i\r\n ans=ans2\r\n ans=ans+i+1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndist = abs(a - b)\r\nhalf = dist // 2\r\ntiredness = 0\r\nfor i in range(1, half + 1):\r\n tiredness += 2 i\r\nif (dist % 2 == 1):\r\n tiredness += half + 1\r\nprint(tiredness)", "a=int(input())\r\nb=int(input())\r\nn=abs(b-a)\r\np=n//2\r\nif(n%2==1):\r\n print(p(p+1)+p+1)\r\nelse:\r\n print(p(p+1))", "a=int(input())\r\nb=int(input())\r\ndist=abs(a-b)\r\n\r\nif dist%2==0:\r\n dist=dist//2\r\n sum0=(dist(1+dist))//2\r\n print(2sum0)\r\nelse:\r\n dist1=(dist//2)+1\r\n dist2=(dist//2)\r\n sum1=(dist1(1+dist1))//2\r\n sum2=(dist2(1+dist2))//2\r\n print(sum1+sum2)\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nmoo = d//2\r\ns = moo(moo+1)//2\r\ns = 2\r\nif d%2 == 1:\r\n s += moo+1\r\nprint(s)", "# your code goes here\r\ndef form(a):\r\n\treturn ( (a*2 + a)//2)\r\n\r\nx = int(input())\r\ny = int(input())\r\nif x>y:\r\n\tx,y = y,x\r\nmeet = (x+y)//2\r\nprint(form(y - meet) + form(meet-x))", "import math\r\na = int(input())\r\nb = int(input())\r\nlen= abs(a-b)\r\n\r\nfrndA = math.ceil(len/2)\r\nfrndB = len - frndA\r\nprint ( int((frndA(frndA +1))/2 + (frndB(frndB +1))/2) ) ", "a=int(input())\r\nb=int(input())\r\n\r\nx=abs(a-b)\r\ntemp=0\r\nif x==1 :\r\n print(1)\r\nelif x==2 :\r\n print(2)\r\nelse :\r\n if x%2==0 :\r\n for i in range(1,x//2+1) :\r\n temp+=i\r\n print(temp2)\r\n else :\r\n for i in range(1,x//2+1) :\r\n temp+=i\r\n print(temp2+i+1)", "a = int(input())\r\n\r\nb =int(input())\r\nc = (a+b)//2\r\nd =0\r\n\r\ng=0\r\ne=1\r\nf=1\r\n\r\nif (a-b==1)or(b-a==1):\r\n print(1)\r\nelse:\r\n if a<b:\r\n for i in range(a,c):\r\n d = d+e\r\n e = e+1\r\n for j in range(c,b):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n else:\r\n for i in range(b,c):\r\n d = d+e\r\n e=e+1\r\n for j in range(c,a):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n", "a = int(input())\r\nb = int(input())\r\nmeetingPoint = (a+b)//2\r\nmoves1 = moves2 = 0\r\nif a < b:\r\n while a != meetingPoint:\r\n a += 1\r\n moves1 += 1\r\n while b != meetingPoint:\r\n b -= 1\r\n moves2 += 1\r\nelse:\r\n while a != meetingPoint:\r\n a -= 1\r\n moves1 += 1\r\n while b != meetingPoint:\r\n b += 1\r\n moves2 += 1 \r\nprint(moves1(moves1+1)//2 + moves2(moves2+1)//2)", "a = int(input())\nb=int(input())\n\nc = (a+b)//2\n\nma = abs(a-c)\nmb = abs(b-c)\nea = sum(range(ma+1))\neb = sum(range(mb+1))\n\nprint(ea+eb)", "def calc(x):\r\n return x (x + 1) // 2\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nmid = (a + b) >> 1\r\nprint(calc(mid - a) + calc(b - mid))", "a=int(input())\nb=int(input())\nx=abs(b-a)\nif not x%2:\n\tx=x//2\n\tprint(x(x+1))\nelse:\n\tx//=2\n\tprint(x(x+1)+(x+1))\n\t\n", "n1 = int(input())\r\nn2 = int(input())\r\nmiddle = int((n1+n2)/2)\r\ndef ap(no1):\r\n return (no1/2)(2+(no1-1))\r\n\r\nprint(int(ap(abs(middle-n1))+ap(abs(middle-n2))))", "a = int(input())\r\nb = int(input())\r\na_steps, b_steps = 0, 0\r\ndef get_tiredness(s):\r\n t = 0\r\n for i in range(1, s + 1):\r\n t += i\r\n return t\r\n\r\nif b - a > 1:\r\n while b - a > 1:\r\n a_steps += 1\r\n b_steps += 1\r\n a += 1\r\n b -= 1\r\nelif a - b > 1:\r\n while a - b > 1:\r\n a_steps += 1\r\n b_steps += 1\r\n a -= 1\r\n b += 1\r\nif a - b == 1 or b - a == 1: \r\n a_steps += 1\r\n a = b\r\nprint(get_tiredness(a_steps) + get_tiredness(b_steps))\r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nprint(sum(range(abs(b-a)//2+1))+sum(range(abs(b-a)-abs(b-a)//2+1)))", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nm = a + abs(b - a) // 2\r\nn1 = b - m\r\nn2 = m - a\r\nprint((n1 + 1) n1 // 2 + (n2 + 1) * n2 // 2)", "a = int(input())\r\nb = int(input())\r\ndifference = abs(a-b)\r\nmove1 = int(difference/2)\r\nmove2 = difference - move1\r\nresult = int(((move1 * (move1 + 1))/2) + ((move2 * (move2 + 1))/2))\r\nprint(result)", "n=int(input())\r\nm=int(input())\r\nc=(n+m)//2\r\nif n<=c:\r\n t=c-n\r\nelse:\r\n t=n-c\r\nif m<=c:\r\n k=c-m\r\nelse:\r\n k=m-c\r\n\r\nh=(t(t+1))//2\r\ng=(k(k+1))//2\r\nprint(h+g)\r\n", "n=int(input())\r\nm=int(input())\r\nk=(n+m+1)//2\r\nl=abs(n-k)\r\no=abs(m-k)\r\nprint(l(l+1)//2+o(o+1)//2)\r\n", "# Read input values\r\na = int(input())\r\nb = int(input())\r\n\r\n# Calculate the midpoint\r\nmidpoint = (a + b) // 2\r\n\r\n# Calculate tiredness for the first friend (a) to reach the midpoint\r\ntiredness_a = sum(range(1, abs(midpoint - a) + 1))\r\n\r\n# Calculate tiredness for the second friend (b) to reach the midpoint\r\ntiredness_b = sum(range(1, abs(midpoint - b) + 1))\r\n\r\n# Calculate the total tiredness\r\ntotal_tiredness = tiredness_a + tiredness_b\r\n\r\n# Print the minimum possible total tiredness\r\nprint(total_tiredness)\r\n", "a=int(input())\r\nb=int(input())\r\nx=(a+b)//2\r\nr=abs(x-a)\r\nl=abs(x-b)\r\nprint((r(r+1)+l(l+1))//2)\r\n", "n=int(input())\r\nm=int(input())\r\na=max(n,m)\r\nb=min(n,m)\r\nif (a-b-1)%2==0:\r\n\tl=int((a-b-1)/2)\r\n\tsum1=0\r\n\tfor i in range(1,l+1):\r\n\t\tsum1+=(i)\r\n\tprint(2sum1+l+1)\r\nelse:\r\n\tsum1=0\r\n\tl=int(((a-b)+1)/2)\r\n\tfor i in range(1,l+1):\r\n\t\tsum1+=i\r\n\tprint(2sum1)\r\n", "def soma(n):\n soma = 0\n for i in range(1, n + 1):\n soma += i\n return soma\n\na = int(input())\nb = int(input())\n\ndist = abs(a - b)\nparaCada = dist // 2\nif dist % 2 == 0:\n ans = soma(paraCada) * 2\nelse:\n ans = soma(paraCada) + soma(paraCada + 1)\n\nprint(ans)\n\t \t \t \t \t\t \t \t\t\t \t\t \t\t", "\r\nimport math\r\na=int(input())\r\nb=int(input())\r\nx,y=max(a,b),min(a,b)\r\nd=x-y\r\nsum=0\r\nif d%2==0:\r\n\tfor i in range(1,d//2+1):\r\n\t\tsum=sum+i2\r\nelse:\r\n\tfor i in range(1,d//2+1):\r\n\t\tsum=sum+i2\r\n\tsum=sum+math.ceil(d/2)\r\n\t\r\nprint(sum)\r\n\r\n \r\n\r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nc=[a, b]\r\nc.sort()\r\nx=c[1]-c[0]\r\nif x%2==0:\r\n print(int(x(x+2)/4))\r\nelse:\r\n p=x/2+0.5\r\n q=x/2-0.5\r\n r=(p(p+1))/2\r\n s=(q(q+1))/2\r\n print(int(r+s))\r\n", "n=int(input())\nm=int(input())\ncount=0\ni=1\nwhile True:\n \n if n<m:\n n=n+1\n count=count+i\n if n==m:\n break\n else:\n m=m-1\n count=count+i\n if n>m:\n m=m+1\n count=count+i\n if m==n:\n break\n else:\n n=n-1\n count=count+i\n if n==m:\n break\n i=i+1\n\nprint(count)\n \t\t\t\t\t\t \t \t \t\t \t\t\t\t\t \t\t \t\t", "a = int(input())\r\nb = int(input())\r\n\r\n\r\nx = max(a,b)\r\ny = min(a,b)\r\n\r\nz = (a+b)//2\r\nh = z-y\r\nj = h(h+1)/2\r\nl = x-z\r\nt = l(l+1)/2\r\no = int(j+t)\r\nprint(o)", "# vars: a, b, c, d\r\na = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nd = c//2\r\ne = c-d\r\nprint((d(d+1)+e(e+1))//2)\r\n#\r\n", "a = int(input())\nb = int(input())\n\nt = [0] 1001\n\nfor i in range(1, len(t)):\n t[i] = t[i - 1] + i\n\nmeet = (a + b) // 2\n\nprint(t[abs(a - meet)] + t[abs(b - meet)])\n", "a,b=int(input()),int(input())\r\nr=abs(a-b)\r\nprint((r-1)//2((r-1)//2+1)+((r-1)%2+1)((r-1)//2+1))", "x1 = int(input())\r\nx2 = int(input())\r\nx = abs(x1-x2)\r\nif x%2 ==0:\r\n x=x//2\r\n print(x(x+1))\r\nelse :\r\n x=x//2\r\n print(x(x+1)+(x+1))", "from math import floor, ceil\r\na = int(input())\r\nb = int(input())\r\nc = floor(abs(a-b)/2)\r\nd = ceil(abs(a-b)/2)\r\nres = int((c + 1)/2c + (d + 1)/2d)\r\nprint(res)\r\n", "a = int(input())\nb = int(input())\n\nd = abs(b-a)\nn1 = d//2\nn2 = d-n1\n\nsum1 = (n1(n1+1))//2\nsum2 = (n2(n2+1))//2\nprint((sum1+sum2))\n\n\t\t \t \t \t\t \t\t \t\t\t \t\t\t\t\t \t\t \t\t", "a = int(input())\r\nb = int(input())\r\nmin_tiredness= float('inf')\r\n\r\nfor i in range (min(a,b) , max(a,b)+1):\r\n tiredness_a= abs(a - i)\r\n tiredness_b= abs(b - i)\r\n total=0\r\n\r\n for j in range (1, tiredness_a+1):\r\n total = total + j\r\n for j in range (1, tiredness_b+1):\r\n total = total + j\r\n \r\n if total < min_tiredness:\r\n min_tiredness = total\r\nprint(min_tiredness) ", "a=int(input())\r\nb=int(input())\r\nimport math\r\nd=math.ceil(abs(a-b)/2)\r\ni=1\r\nsum=0\r\nwhile i<=d:\r\n sum=sum+i\r\n i=i+1\r\nif abs(a-b)%2==0:\r\n print(2sum)\r\nelse: \r\n print((2sum)-d) ", "n = int(input())\nm = int(input())\n\ndfr = abs(n-m)+1\ns = dfr//2\nprint((s+dfr%2)s)\n", "def main():\r\n x1 = int(input())\r\n x2 = int(input())\r\n d = abs(x2 - x1)\r\n if d % 2 == 0:\r\n d /= 2\r\n print(int(d (d + 1)))\r\n else:\r\n d //= 2\r\n print((d + 1) ** 2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nm=int(input())\r\ns=abs(m-n)\r\nf=(s-s%2)//2\r\nans=2int((1+f)/2f)\r\nif s%2:ans+=f+1\r\nprint(ans)\r\n", "a=int(input())\r\nb=int(input())\r\np=abs(a-b)\r\nif p==1:\r\n print(1)\r\nelif p>1:\r\n if p%2 ==0:\r\n q=p//2\r\n print(2(q(q+1)//2))\r\n else:\r\n q=p//2\r\n e=q+1\r\n print((q(q+1))//2+(e(e+1)//2))\r\n \r\n \r\n", "# -- coding: utf-8 --\r\n# http://codeforces.com/contest/931/problem/A\r\n\r\ndef problem():\r\n \r\n in1 = int(input())\r\n in2 = int(input())\r\n\r\n# in1 = 10\r\n# in2 = 3\r\n \r\n moves = abs(in2 - in1)\r\n\r\n each = moves // 2\r\n \r\n cost = each * (each + 1) + (moves % 2 * (each + 1))\r\n \r\n return cost\r\n\r\n \r\nprint(problem())\r\n#problem()", "x=int(input())\r\ny=int(input())\r\nm=abs(x-y)\r\nif (m==1):\r\n res=1\r\nelif (m%2==0):\r\n d=m//2\r\n res=d(d+1)\r\nelse:\r\n d=m//2\r\n res=d(d+1) + (d+1)\r\n \r\nprint(res)", "n = int(input())\r\nm = int(input())\r\nsub = abs(n-m)\r\ndiv = round(sub/2)\r\ncnt = 0\r\nif sub == 1:\r\n for i in range(1,sub+1):\r\n cnt += i\r\nelse:\r\n for i in range(1,div+1):\r\n cnt += i\r\n for j in range(1,(sub-div)+1):\r\n cnt += j\r\nprint(cnt)\r\n", "x = int(input())\ny = int(input())\nif x > y:\n\tx, y = y, x\nans = 2e9\nfor i in range(x, y+1):\n\tans = min(ans, (i-x)(i-x+1)//2 + (y-i)(y-i+1)//2)\nprint(ans)", "diff = abs(int(input()) - int(input()))\r\n\r\ntiredness = ((diff // 2) (diff//2 + 1))\r\n\r\nif diff % 2 == 1:\r\n tiredness += (diff // 2) + 1\r\n\r\nprint(tiredness)", "a=int(input())\r\nb=int(input())\r\nlen=abs(a-b)\r\nif len%2==0:\r\n\tmoves=len//2(len//2+1)\r\nelse:\r\n\tmoves=len//2(len//2+2)+1\r\nprint(moves)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nc= abs(a-b)//2\r\n\r\n\r\ndef getSum(a):\r\n if a <=1:\r\n return a\r\n else:\r\n return (1+a)a//2\r\n\r\nif abs(a-b)%2 == 0 :\r\n ans = getSum(c) * 2\r\nelse:\r\n ans = getSum(c) + getSum(c + 1)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndist = abs(b-a)\r\nif(dist%2 == 0):\r\n x=dist // 2\r\n print(x(x+1))\r\nelse:\r\n x = dist // 2\r\n print((x(x+1))//2 + ((x+1)(x+2))//2)", "a=int(input())\r\nb=int(input())\r\nmn = min(a,b)\r\nmx = max(a,b)\r\nres = (mn(mn+1))//2 + (mx(mx+1))//2\r\nfor i in range(mn, mx+1):\r\n res = min(res, ((mx-i)(mx-i+1))//2 + ((i-mn)(i-mn+1))//2)\r\nprint(res)\r\n", "x1 = int(input())\nx2 = int(input())\n# ввод входных данных\n\ndistance = abs(x1 - x2)\ncnt1 = distance // 2\ncnt2 = distance - cnt1\n\n\ns1 = cnt1 (1 + cnt1) // 2\ns2 = cnt2 * (1 + cnt2) // 2\nprint(s1 + s2)\n", "a = int(input())\r\nb = int(input())\r\nf = abs(a - b)\r\nz,o = f // 2, f % 2\r\ng = ((2 + (z-1)) * z)\r\nif o:\r\n g += 1 + z\r\nprint(g)", "a = int(input())\r\nb = int(input())\r\nmayor = max(a, b)\r\nmenor = min(a, b)\r\nderecha = 0\r\nizquierda = 0\r\nfor i in range(1, mayor):\r\n\r\n mayor = mayor-1\r\n derecha = derecha+i\r\n\r\n if mayor == menor:\r\n print(derecha+izquierda)\r\n break\r\n else:\r\n menor = menor+1\r\n izquierda = izquierda+i\r\n if mayor == menor:\r\n print(derecha+izquierda)\r\n break", "def tr(x):\n c = 0\n for i in range(x):\n c += i+1\n return c\n\ndef mintr(a,b):\n dif = abs(a-b)\n if dif%2 == 0:\n return 2tr(int(dif/2))\n else:\n return tr(dif//2)+tr(dif//2 + 1)\n\na = int(input())\nb = int(input())\n\nprint(mintr(a,b))\n", "\r\nclass Amigo:\r\n def __init__(self, posicao, direcao):\r\n self.posicao = int(posicao)\r\n self.cansaco_passo = 0\r\n self.cansaco_total = 0\r\n self.direcao = direcao\r\n\r\n def move(self):\r\n self.cansaco_passo += 1\r\n if self.direcao == -1:\r\n self.posicao -= 1\r\n else:\r\n self.posicao += 1\r\n self.cansaco_total += self.cansaco_passo\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nif a < b:\r\n direcao_a = 1\r\n direcao_b = -1\r\nelse:\r\n direcao_a = -1\r\n direcao_b = 1\r\n\r\namigo_1 = Amigo(a, direcao_a)\r\namigo_2 = Amigo(b, direcao_b)\r\n\r\naux = 0\r\nwhile amigo_1.posicao != amigo_2.posicao:\r\n if aux % 2 == 0:\r\n amigo_1.move()\r\n else:\r\n amigo_2.move()\r\n aux += 1\r\n\r\ncansaco = amigo_1.cansaco_total + amigo_2.cansaco_total\r\nprint(cansaco)", "a = int(input()) \r\nb = int(input())\r\nimport math\r\nlen = abs(a - b)\r\nif len % 2 == 0:\r\n min_tiredness = (len // 2) ((len // 2) + 1)\r\nelse:\r\n min_tiredness = (len // 2) * ((len // 2) + 1) + (len // 2) + 1\r\n\r\nprint(min_tiredness)\r\n", "x1 = int(input())\r\nx2 = int(input())\r\nmid = (x1+x2)//2\r\nd1 = abs(x1-mid)\r\nd2 = abs(mid-x2)\r\nt = d1(d1+1)//2 +d2(d2+1)//2\r\nprint(t)\r\n", "a = int(input())\r\nb = int(input())\r\nd = a-b if a>b else b-a\r\nn = d//2\r\nc = 0 if d%2==0 else n+1\r\nfor i in range(1,n+1):\r\n c += (i<<1)\r\nprint(c)\r\n", "a = int(input())\r\nb = int(input())\r\naF = 1\r\nbF = 1\r\nallF = 0\r\nif b < a:\r\n a, b = b, a\r\nwhile a != b:\r\n a += 1\r\n allF += aF \r\n aF += 1\r\n if a != b:\r\n b -= 1\r\n allF += bF\r\n bF += 1\r\nprint(allF)", "def sum_seq(n):\n ans = 0\n for i in range(1, n + 1):\n ans += i\n return ans\n\n\na = int(input())\nb = int(input())\nif abs(a - b) % 2 == 0:\n print(2 * sum_seq(abs(a - b) // 2))\nelse:\n print(2 * sum_seq(abs(a - b) // 2) + abs(a - b) // 2 + 1)\n", "a, b = int(input()), int(input())\r\na, b = sorted([a, b])\r\ntot = 0\r\nda, db = 1, 1\r\nwhile a != b:\r\n a += 1\r\n tot += da\r\n da += 1\r\n if a == b:\r\n break\r\n b -= 1\r\n tot += db\r\n db += 1\r\nprint(tot)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nn = abs(b-a)\r\ne = 0\r\nc = 0\r\nif n%2 != 0:\r\n nt = int((n/2) + 0.5)\r\nelse:\r\n nt = int(n/2)\r\n \r\nfor i in range(nt+1):\r\n e = e + 2i\r\n \r\nif n%2 !=0:\r\n c = e - nt\r\nelse:\r\n \r\n c = e\r\n \r\nprint(c) ", "a=int(input())\r\nb=int(input())\r\nd=abs(b-a)\r\nif d==1:\r\n\tprint(1)\r\nelif d==0:\r\n\tprint(0)\r\nelif d%2==0:\r\n\tp=d//2\r\n\ts=(p(p+1))//2\r\n\tprint(s2)\r\nelse:\r\n\tp=d//2\r\n\ts=(p(p+1))//2\r\n\tprint(s2+(p+1))", "# -- coding: utf-8 --\r\n\"\"\"\r\nA\r\n\"\"\"\r\n\r\ndef calculate_tiredness(start, end):\r\n distance = abs(end-start)\r\n return int(distance(distance+1)/2)\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n middle = (a+b)//2\r\n print(calculate_tiredness(a, middle) + calculate_tiredness(b, middle))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\n \r\ny=c//2\r\nz=c%2+y\r\n \r\nprint((y(y+1))//2+(z(z+1))//2)", "f1 = int(input())\nf2 = int(input())\n\nmiddle = (f1 + f2) // 2\n\nt = 1\ntotal = 0\nfor i in range(abs(f1-middle)):\n total += t\n t += 1\nt = 1\nfor i in range(abs(f2-middle)):\n total += t\n t += 1\n\nprint(total)", "a = int(input())\r\nb = int(input())\r\nif abs(a-b) == 1:\r\n print(1)\r\nelse:\r\n dis = (abs(a-b)+1)//2\r\n dis1 = (max(a, b)-dis) - min(a, b)\r\n print( (dis* (dis+1) )//2 + (dis1* (dis1+1) )//2 )", "n = int(input())\r\nm = int(input())\r\na = abs(n-m)\r\nb = a // 2\r\nc = a - b\r\nprint(b * (b + 1) // 2 + c * (c + 1) // 2)\r\n", "a=int(input())\r\nb=int(input())\r\nx=abs(b-a)\r\ny=x//2\r\nif x==1:\r\n print(\"1\")\r\nelif x%2==0:\r\n print(y(y+1))\r\nelse:\r\n print((y+1)2)", "a=int(input())\r\nb=int(input())\r\nk=0\r\nfor i in range(1,abs(a-b)//2 +1):\r\n\tk+=2i\r\nif abs(a-b)%2!=0:\r\n\tk+=abs(a-b)//2 +1\r\nprint(k)", "a = int(input())\r\nb = int(input())\r\nmn = 1e18\r\nfor i in range(1, 1001):\r\n mn = min(mn, abs(i - a)(abs(i - a) + 1)//2 + abs(i - b)(abs(i - b) + 1)//2)\r\nprint(mn)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n x=d/2\r\n c=2((x/2)(1+x))\r\nelse:\r\n x=d//2\r\n c=2((x/2)(1+x))+x+1\r\nprint(int(c))", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nd=c//2\r\ne=d(d+1)\r\nif c%2==0:\r\n print(e)\r\nelse:\r\n print(e+(c+1)//2)", "def main():\r\n a = int(input())\r\n b = int(input())\r\n diff = abs(b - a)\r\n x = diff // 2\r\n y = x + 1 if diff % 2 == 1 else x\r\n print((x(x+1))//2 + (y(y+1))//2) \r\n\r\nmain()", "a = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nans = 100000000000000000000000000\r\nfor i in range(a, b + 1):\r\n x = ((i - a) (i - a + 1)) // 2\r\n y = ((b - i) * (b - i + 1)) // 2\r\n ans = min(ans, x + y)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nx = 0\r\nif c%2==0:\r\n x = c//2\r\n print(x(x+1))\r\nelse:\r\n x = c//2\r\n print(x(x+1)+(c//2)+1)\r\n \r\n ", "a = int(input())\nb = int(input())\nweakness = 0\ni = 1\nr = abs(a - b)\n\nwhile r >= 2:\n weakness += 2i\n r -= 2\n i += 1\n\nif r == 1: weakness += i\n\nprint(weakness)\n", "n=int(input())\r\nm=int(input())\r\nif abs(n-m)==1:\r\n print(1)\r\nelif (n-m)%2==0:\r\n print((abs(n-m)//2)(abs(n-m)//2+1))\r\nelse:\r\n print((abs(n-m)//2+1)(abs(n-m)//2+1))", "a = int(input())\r\nb = int(input())\r\n\r\nsteps = abs((a - b)) // 2\r\nremaining = abs(a - b) % 2\r\n\r\ntotal = int((steps/2)(1 + steps)2 + (steps + 1)remaining)\r\n\r\nprint(total)", "import math\r\na=int(input())\r\nb=int(input())\r\nk=abs(a-b)\r\nc=k//2\r\nd=k-c\r\nans=0\r\nans=c(c+1)//2+d(d+1)//2\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\ndest = abs(a-b)\r\ncel = dest//2\r\nost = dest%2\r\nprint((1+cel)cel + ost(cel+1))", "a = int(input())\nb = int(input())\n\nx = abs(a - b) // 2\ns = (x * (1 + x)) // 2\ns = 2\n\nif (abs(a - b) % 2 == 1):\n s += x + 1\n\nprint(s)\n\t \t \t\t \t\t \t\t \t \t \t\t\t", "import sys \r\n\r\nI=sys.stdin.readline\r\n\r\na=int(I())\r\nb=int(I())\r\n\r\ntired=0\r\nn=abs(a-b)\r\na=1\r\nc=0\r\nwhile n!=0:\r\n\ttired+=a\r\n\tn-=1\r\n\tc+=1\r\n\tif c==2:\r\n\t\tc=0\r\n\t\ta+=1\r\nprint(tired)\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndis = abs(a-b)\r\n\r\n\r\ndef tired(d):\r\n t =0\r\n for i in range(d+1):\r\n t += i \r\n return(t)\r\n\r\n\r\nif (dis%2 == 0):\r\n min_dis = dis//2\r\n total = tired(min_dis)2\r\n\r\nelif (dis%2 ==1):\r\n min_dis = dis//2\r\n total = tired(min_dis) + tired(min_dis + 1)\r\n\r\nprint(total)\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nc1 = (a + b) // 2\r\nc2 = (a + b + 1) // 2\r\nans = (1 + c1 - a) * (c1 - a) / 2\r\nans += (1 + b - c2) * (b - c2) / 2\r\nif (c1 != c2):\r\n ans += min(c2 - a, b - c1)\r\nprint(int(ans))", "a=int(input())\r\nb=int(input())\r\nz=a-b\r\nif(z<0):\r\n z=z(-1)\r\nif(z%2==0):\r\n n=z//2\r\n ans=(n(n+1))\r\nelse:\r\n n=(z-1)//2\r\n ans=(n(n+1))+(n+1)\r\nprint(ans)\r\n ", "from math import \r\nn = int(input())\r\nm = int(input())\r\ndiff = abs(m-n)\r\ncount = 0\r\ni = 0\r\ndiff1 = diff//2\r\nfor i in range(1,diff1+1):\r\n count = count + 2i\r\nif diff%2 != 0:\r\n count = count + i+1\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\n\r\ndiff=abs(a-b)\r\neach=diff//2\r\ntired=(each(each+1))\r\n\r\nif((diff%2)!=0):\r\n tired+=(each+1)\r\nprint(tired) \r\n \r\n", "a = int(input())\r\nb = int(input())\r\nsum = 0\r\n#tiredness = [item for item in range(abs(a - b))]\r\nfor i in range((abs(a - b)) // 2):\r\n sum += i+1\r\nif abs(a - b) % 2 == 0:\r\n for i in range((abs(a - b)) // 2):\r\n sum += i+1\r\nelse:\r\n for i in range(abs((a - b)) // 2 + 1):\r\n sum += i+1\r\nprint(sum)", "# for _ in range(int(input())): \r\na=int(input()) \r\nb=int(input()) \r\ns=abs(a-b)\r\nif(s%2==0):\r\n s=s//2\r\n print(s(s+1))\r\nelse:\r\n s=s//2\r\n print((s+1)2)\r\n# n,m=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n", "import math\r\na=int(input())\r\nb=int(input())\r\ndis=abs(b-a)\r\nif dis%2==0:\r\n dis1=dis//2\r\n sum=0\r\n for i in range(0,dis1+1):\r\n sum=sum+i\r\n ans=sum2\r\n print(ans)\r\nelse:\r\n dis2=math.ceil(dis/2)\r\n dis3=math.floor(dis/2)\r\n sum1=0\r\n sum2=0\r\n for j in range(0,dis2+1):\r\n sum1=sum1+j\r\n for k in range(0,dis3+1):\r\n sum2=sum2+k\r\n ans1=sum1+sum2\r\n print(ans1)", "x1 = int(input())\r\nx2 = int(input())\r\nif x1 > x2:\r\n\t(x1, x2) = (x2, x1)\r\namount_between = x2 - x1\r\nn = amount_between // 2\r\nrem = amount_between % 2\r\nres = (n + 1) * n + rem * (n + 1)\r\nprint(res)\r\n", "a = int(input())\r\nb = int(input())\r\np = (a+b)//2\r\nn1 = abs(p-a)\r\nn2 = abs(b-p)\r\nans = n1(n1+1)//2 + n2(n2+1)//2\r\nprint(ans)\r\n\r\n", "z=input\r\n\r\nn=int(z())\r\nn1=int(z())\r\nfrom math import \r\nt=ceil((n+n1)/2)\r\nt1,t2=abs(n-t),abs(n1-t)\r\ns1=(t1/2(t1+1))\r\ns2=(t2/2(t2+1))\r\nprint(int(s1+s2))\r\n", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ntiredness = 0\r\nmid = (a+b)//2\r\nmin_v = min(a,b)\r\na_1 = math.fabs(mid - a)\r\nb_1 = math.fabs(b - mid)\r\ntiredness = [i for i in range(0,int(a_1)+1)] + [i for i in range(0,int(b_1)+1)]\r\nprint(sum(tiredness))", "a = int(input())\nb = int(input())\n\nd = abs(a - b)\nh = d // 2\nt = lambda n: n (n + 1) // 2\nprint(t(h) + t(d - h))", "a=int(input())\r\nb=int(input())\r\nif b==min(a,b):\r\n a,b=b,a\r\nc=(a+b)//2\r\nd=c-a\r\ne=b-c\r\ns=0\r\np=0\r\nfor i in range (1,d+1):\r\n s=s+i\r\nfor j in range (1,e+1):\r\n p=p+j\r\nprint(s+p)\r\n\r\n\r\n", "p=int(input())\r\nq=int(input())\r\nprint((abs(p - q) + 1) ** 2 // 4)", "def f(x):\n return int(x * (x + 1) / 2)\n\n\na = int(input())\nb = int(input())\n\nm = int((a + b) / 2)\nprint(f(abs(m - a)) + f(abs(b - m)))\n", "import math\r\nif __name__ == '__main__' :\r\n a = int(input())\r\n b = int(input())\r\n c = 0\r\n if abs(a-b)%2 == 0 :\r\n for i in range(((a+b)//2)-min(a,b)) :\r\n c = c+i+1\r\n print(2c)\r\n else :\r\n for i in range(abs(a-b)//2) :\r\n c = c+i+1\r\n print((2c)+(abs(a-b)//2)+1)", "n=int(input())\r\nm=int(input())\r\nx=(m+n)//2\r\nn=abs(n-x)\r\nm=abs(m-x)\r\nprint(abs(n(n+1)//2)+abs(m(m+1)//2))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nm = int(input())\r\na = abs(n - m)\r\nif a % 2:\r\n\tb = (((a // 2) * (a // 2 + 1)) // 2) * 2 + (a // 2 + 1)\r\n\tprint(b)\r\nelse:\r\n\tb = ((a // 2) * (a // 2 + 1) // 2) * 2\r\n\tprint(b) \r\n", "import math\r\na=int(input())\r\nb=int(input())\r\nf=int(math.fabs(a-b)//2)\r\ns=int(math.fabs(a-b)//2)\r\nf1=0\r\ns1=0\r\nif math.fabs(a-b)%2!=0:\r\n f+=1\r\nfor i in range(f+1):\r\n f1+=i\r\nfor i in range(s+1):\r\n s1+=i\r\nprint(s1+f1)", "import math\r\n\r\ndef answer(first, second):\r\n maxi = max(first, second)\r\n mini = min(first, second)\r\n if (maxi - mini) % 2 == 0:\r\n return 2 * adder((maxi-mini)//2)\r\n else:\r\n return adder(math.ceil((maxi-mini)/2)) + adder((maxi-mini)//2)\r\n\r\ndef adder(value):\r\n if value == 1:\r\n return 1\r\n\r\n return (value(value+1))//2\r\n\r\ndef main():\r\n a, b = int(input()), int(input())\r\n print(answer(a, b))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nif d == 1:\r\n print(1)\r\nelse:\r\n if d%2 == 1:\r\n n = d // 2\r\n s1 = (n(n+1)) // 2\r\n s2 = ((n+1)(n+2)) // 2\r\n print(s1+s2)\r\n else:\r\n n = d // 2\r\n s1 = (n(n+1)) // 2\r\n print(s1+s1)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nx=abs(a-b)//2\r\nif (a-b)%2==0:\r\n t=(1+x)x\r\nelse:\r\n t=(1+x)x+x+1\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nn = d // 2\r\nif d % 2 == 0:\r\n solution = n * ((n+1) / 2) * 2\r\nelse:\r\n solution = n * ((n+1) / 2) * 2 + n + 1\r\nprint(int(solution))", "a = int(input())\r\nb = int(input())\r\nd = int(abs(b-a))\r\nS = 0\r\nif d % 2 == 0:\r\n\tfor i in range(int(d/2)+1):\r\n\t\tS = S+i\r\n\tprint(2S)\r\nelse:\r\n\tfor i in range(int((d-1)/2)+1):\r\n\t\tS = S+i\r\n\tprint(2S+int((d-1)/2)+1)", "a=int(input())\r\nb=int(input())\r\n\r\ndef fact(a):\r\n ans=0\r\n for i in range(a,0,-1):\r\n ans=ans+i\r\n return ans\r\nd=abs(a-b)\r\nif d==1:\r\n print(\"1\")\r\nelif d%2==0:\r\n a=fact(d//2)\r\n a=a2\r\n print(a)\r\nelse:\r\n a=fact(d//2)\r\n b=fact((d+1)//2)\r\n print(a+b)\r\n", "a = int(input())\r\nb = int(input())\r\nm = (a+b) // 2\r\ns = 0\r\nfor i in range(abs(m-a)):\r\n s += i+1\r\nfor i in range(abs(b-m)):\r\n s += i+1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nfirst = 1\r\nsecond = 1\r\ntired = 0\r\nwhile a != b:\r\n\tif a < b:\r\n\t\tif first <= second:\r\n\t\t\tfirst += 1\r\n\t\t\ttired += first - 1\r\n\t\t\ta += 1\r\n\t\telse:\r\n\t\t\tsecond += 1\r\n\t\t\ttired += second - 1\r\n\t\t\tb -= 1\r\n\telse:\r\n\t\tif first <= second:\r\n\t\t\tfirst += 1\r\n\t\t\ttired += first - 1\r\n\t\t\ta -= 1\r\n\t\telse:\r\n\t\t\tsecond += 1\r\n\t\t\ttired += second - 1\r\n\t\t\tb += 1\r\nprint(tired)", "a=int(input())\r\nb=int(input())\r\nsteps=0\r\nd=(a+b)//2\r\nif a>b:\r\n tmp=a\r\n a=b\r\n b=tmp\r\nfor i in range(a,d):\r\n steps += (i-a+1)\r\nfor j in range(d,b):\r\n steps += (j-d+1)\r\nprint(steps) \r\n ", "import math;a=int(input());b=int(input());print((math.ceil(abs(a-b)/2))((math.ceil(abs(a-b)/2)) + 1)//1 - (((a-b)%2))(math.ceil(abs(a-b)/2)) )", "import math\r\ndef total_tiredness(a,b):\r\n x = math.ceil((a+b)/2)\r\n sum_of_tiredness = 0\r\n for i in range(1,abs(a-x)+1):\r\n sum_of_tiredness += i\r\n for j in range(1,abs(b-x)+1):\r\n sum_of_tiredness += j\r\n return sum_of_tiredness\r\na = int(input())\r\nb = int(input())\r\nif 1<=a<=1000 and 1<=b<=1000 and a!=b:\r\n value = total_tiredness(a,b)\r\n print(value)", "a = int(input())\r\nb = int(input())\r\nmiddle = (a+b) // 2\r\n\r\nsumm = 0\r\nsumm += sum(list(range(1, abs(middle - a) + 1)))\r\nsumm += sum(list(range(1, abs(middle - b) + 1)))\r\n\r\nprint(summ)", "def suma(q):\r\n sump = 0\r\n for i in range(1,q+1):\r\n sump = sump + i \r\n return(sump)\r\na = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\nc1 = abs(c - a) \r\nc2 = abs(c - b) \r\nprint(suma(c1)+suma(c2))", "GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())\n\ndef main():\n a = GI(); b = GI()\n d = abs(a - b)\n div, mod = divmod(d, 2)\n\n l = [div + mod, div]\n print(int(sum(n (n + 1) / 2 for n in l)))\n\nmain()\n", "a=int(input())\r\nb=int(input())\r\ndif=abs(a-b)\r\nm1=dif//2\r\nm2=dif-m1\r\nprint(m1(m1+1)//2+m2(m2+1)//2)", "def friendsMeeting(a, b):\r\n diff = abs(a - b)\r\n if diff == 1:\r\n return 1\r\n \r\n xa = diff // 2\r\n xb = diff - xa\r\n \r\n return doSum(xa) + doSum(xb)\r\n\r\ndef doSum(n):\r\n return n * (n + 1) // 2\r\n\r\na, b = int(input()), int(input())\r\nprint(friendsMeeting(a, b))", "a=int(input())\r\nb=int(input())\r\ns=abs(a-b)\r\nt=0\r\ni=1\r\nwhile s>0:\r\n if s==1:\r\n t+=i \r\n s-=1\r\n else:\r\n s-=2\r\n t+=i2\r\n i+=1\r\nprint(t)\r\n ", "def minSteps(a, b):\r\n diff = abs(a - b)\r\n n = diff // 2\r\n if diff % 2 == 0:\r\n return n (n + 1)\r\n else:\r\n return (n * (n + 1) // 2) + ((n + 1) * (n + 2) // 2)\r\n\r\na = int(input())\r\nb = int(input())\r\nprint(minSteps(a, b))", "a = int(input())\r\nb = int(input())\r\nz = abs(a-b)//2\r\nx = z(z+1)\r\nif abs(a-b)%2 !=0:\r\n\ty = z+1\r\nelse:\r\n\ty =0\r\nprint(x+y)", "import math as m\r\na=int(input())\r\nb=int(input())\r\nif b<a:\r\n a,b=b,a\r\nd=a+m.ceil(abs(a-b)/2)\r\nx=d-a\r\ny=b-d\r\nstress=0\r\nfor i in range(1,x+1):\r\n stress+=i\r\nfor i in range(1,y+1):\r\n stress+=i\r\nprint(stress)", "a = int(input())\r\nb = int(input())\r\n\r\n\r\ndef tiredness(point_one, point_two):\r\n difference = abs(point_one - point_two)\r\n steps_for_each = int(difference / 2)\r\n\r\n result = steps_for_each (steps_for_each + 1)\r\n\r\n if (difference % 2 != 0):\r\n result += (steps_for_each + 1)\r\n\r\n return result\r\n\r\n\r\nprint(tiredness(a, b))", "a = int(input())\r\nb = int(input())\r\nanswer = 0\r\ni = 1\r\nc = min(a, b)\r\nd = max(a, b)\r\nwhile c != d:\r\n c += 1\r\n answer += i\r\n if c != d:\r\n d -= 1\r\n answer += i\r\n i += 1\r\n\r\nprint(answer)\r\n", "a=int(input())\r\nb=int(input())\r\nif abs(a-b)==1:\r\n print(\"1\")\r\nelse:\r\n n=abs(a-b)\r\n h=n//2\r\n s=(h(h+1))//2\r\n if n%2==0:\r\n print(2s)\r\n else:\r\n r=(2s)+(h+1)\r\n print(r)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b:\r\n temp = a\r\n a = b\r\n b = temp\r\n\r\natired = 1\r\nbtired = 1\r\nscore = 0\r\n\r\nwhile a != b:\r\n a += 1\r\n score += atired\r\n atired += 1\r\n if a == b:\r\n break\r\n\r\n b -= 1\r\n score += btired\r\n btired += 1\r\n\r\nprint(score)", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nodd=False\r\nif diff&1==1:\r\n\todd=True\r\ndiff=diff//2\r\nfirst=(diff(diff+1))//2\r\nif odd:\r\n\tdiff+=1\r\n\tsecond=(diff(diff+1))//2\r\n\tprint(first+second)\r\nelse:\r\n\tprint(first2)", "a = int(input())\r\nb = int(input())\r\n\r\nd = max(a-b,b-a)\r\n\r\nif d%2 == 0:\r\n\ty = int(d/2)\r\nelse:\r\n\ty = int(d/2)+1\r\n\r\nf1 = 0\r\nfor i in range(1,int(d/2)+1):\r\n\tf1 += i\r\n\r\nf2 = 0\r\nfor i in range(1,y+1):\r\n\tf2 += i\r\n\r\nif d == 1:\r\n\tprint(1)\r\nelse:\r\n\tprint(f1+f2)", "a=int(input())\r\nb=int(input())\r\nt=abs(a-b)\r\nA=t//2\r\nB=0\r\nfor i in range(1,A+1):\r\n B+=i\r\nif t%2==0: \r\n print(B2)\r\nelse:\r\n print(B2+1+A)", "a = int(input())\nb = int(input())\n\nacount = 0\nbcount = 0\n\naturn = True\ntotal = 0\n\nif (a < b):\n t = a\n a = b\n b = t\n\nwhile (a!=b):\n if (aturn):\n a -= 1\n acount += 1\n total += acount\n else:\n b += 1\n bcount += 1\n total += bcount\n aturn = not aturn\n\nprint(total)", "m1=int(input())\r\nm2=int(input())\r\nl=int((m1+m2)/2)\r\nd1=abs(m1-l)\r\nd2=abs(m2-l)\r\ns=0\r\nfor i in range(1,d1+1):\r\n s=s+i\r\nfor i in range(1,d2+1):\r\n s=s+i\r\nprint(s)", "import math\n# y, x = list(map(int, input().split(\"\\n\")))\n\nx = int(input().strip())\ny = int(input().strip())\n\ndef test_1(y, x):\n a = y - x + 1\n if x == 0:\n return \"No\"\n if x ==1 and y !=0:\n return \"No\"\n if a < 0:\n return \"No\"\n else:\n b = a/2 + 1\n if round(b/round(b), 10)==1.0:\n return 'Yes'\n else:\n return 'No'\n\ndef test_2(y, x):\n n = abs(x - y)\n # print(x, y, n)\n\n if n % 2 == 1:\n n = n//2 + 1\n a1 = n(n-1)/2\n a2 = n(n+1)/2\n a = a1+a2\n else:\n n = n // 2\n a = n * (n + 1)\n\n return int(a)\n\naa = test_2(y, x)\nprint(aa)\n\n \t \t \t \t \t\t\t \t\t \t\t\t\t\t\t", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nif b>a:\r\n x=0\r\n y=0\r\n for n in range(1,b-c+1):\r\n x=x+n\r\n for n in range(1,c-a+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\nelif a>b:\r\n x=0\r\n y=0\r\n for n in range(1,a-c+1):\r\n x=x+n\r\n for n in range(1,c-b+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n", "# Friends Meeting\r\na = int(input())\r\nb = int(input())\r\nd = abs(a-b)//2\r\nif abs(a-b) % 2 == 0:\r\n print(d(d+1)) \r\nelse:\r\n print(int(d(d+1)/2 + (d+1)(d+2)/2))", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n t = c // 2\r\n print(((1 + t) t))\r\nelse:\r\n t = c // 2\r\n r = t * (1 + t)\r\n print(r + t + 1)\r\n \r\n", "def tired(a, b):\r\n t = abs(a - b)\r\n if t % 2 == 0:\r\n r = t // 2\r\n return r * (r + 1)\r\n t1, t2 = t // 2, t // 2 + 1\r\n return t1 * (t1 + 1) // 2 + t2 * (t2 + 1) // 2\r\n\r\n\r\nA = int(input())\r\nB = int(input())\r\nprint(tired(A, B))\r\n", "a = int(input())\r\nb = int(input())\r\nlen = abs(a-b)\r\nac = len//2\r\nbc = len - len//2\r\nans = (ac(ac+1)//2 ) + (bc(bc+1)//2 )\r\nprint(ans)", "first=int(input())\r\nsecond=int(input())\r\n\r\nfn=0\r\nsn=0\r\nz=abs(first-second)\r\n\r\nmas=[]\r\nwhile True:\r\n if z>0:\r\n z=z-1\r\n sn=sn+1\r\n mas.append(sn)\r\n if z>0:\r\n z=z-1\r\n fn=fn+1\r\n mas.append(fn)\r\n else: \r\n break\r\n\r\nprint(sum(mas))", "a = int(input())\r\nb = int(input())\r\nai = bi = ans = 0\r\ni = 1\r\nif a > b:a, b = b, a\r\nwhile a != b:\r\n if i%2:\r\n ai += 1\r\n ans += ai\r\n a += 1\r\n else:\r\n bi += 1\r\n ans += bi\r\n b -= 1\r\n i += 1\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nd = c // 2\r\nc -= d\r\nprint((c * (c + 1)) // 2 + (d * (d + 1)) // 2)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b:\r\n a, b = b, a\r\n \r\nmedian = (a+b) / 2\r\nif int(median) == median:\r\n left_steps = median - a\r\n rigth_steps = b - median\r\nelse:\r\n left_steps = int(median) - a + 1\r\n rigth_steps = b - int(median)-1\r\n \r\nnum = left_steps * (left_steps+1) // 2\r\nnum += rigth_steps * (rigth_steps+1) // 2\r\nprint(int(num))", "from collections import Counter\r\na = int(input())\r\nb = int(input())\r\np = abs(a - b)\r\nif p == 1:\r\n print(1)\r\nelse:\r\n q = p//2\r\n m = p - (q * 2)\r\n print((q * (q + 1)) + ((q + 1) if p%2 != 0 else 0))", "a = int(input())\r\nb = int(input())\r\n\r\nif a>b:\r\n a, b = b, a\r\nm=int((b-a)/2)\r\nk=(b-a-m)\r\nc=int((m(m+1))/2+(k(k+1))/2) \r\n# 1+2+3+4+5+...+k=(k(k+1))/2\r\nprint(c)\r\n", "a=int(input())\nb=int(input())\nc=abs(a-b)\nd=c//2\nif c%2==0:\n x=[i for i in range(d+1)]\n print(2sum(x))\nelse:\n x=[i for i in range(d+1)]\n print(2sum(x)+(d+1))", "a = int(input())\r\nb = int(input())\r\nn = abs(a-b)//2\r\nif abs(a-b) % 2 == 0:\r\n print(n(n+1))\r\nelse:\r\n print((n(n+1))+n+1)", "def summation(e):\r\n t = 0\r\n for _ in range(1,e+1):\r\n t = t + _\r\n return t\r\n\r\na,b = int(input()),int(input())\r\nprint(summation(abs(b-a)//2) + summation((abs(b-a)//2)+(abs(b-a)%2)))\r\n#print(summation(3))", "def summation(n):\r\n return (n(n+1))//2\r\n\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a-b)\r\n\r\nprint(summation(diff//2)+summation(diff-(diff//2)))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nc = (a + b) // 2\r\nprint((c - a)(c - a + 1) // 2 + (b - c)(b - c + 1) // 2)\r\n", "a=int(input())\r\nb=int(input())\r\nn=abs(a-b)\r\nif n%2==0:\r\n d=n/2\r\n print(int(d(d+1)))\r\nelse:\r\n d=n//2\r\n print(int(d(d+1)+(d+1)))", "a = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\ntired = sum(2 (list(range(1,(diff // 2)+1)))) + ((diff % 2) (diff - diff// 2))\r\nprint(tired)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nans = (d // 2 + d % 2) * (d // 2 + 1)\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nif (1<=a<=1000 and 1<=b<=1000):\r\n if a>b:\r\n n=a-b\r\n else:\r\n n=b-a\r\n m=n//2\r\n if n%2==0:\r\n c=(m(m+1))\r\n else:\r\n c=((m(m+1))//2)+(((m+1)(m+2))//2)\r\nprint(c)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nm = abs(a - b) // 2\r\ns = 0\r\nfor i in range(1, m + 1):\r\n s += i 2\r\nif abs(a - b) % 2 == 1:\r\n s += m + 1\r\nprint(s)", "t=list(map(int,(input().split())))\r\nn=list(map(int,(input().split())))\r\na=(t[0]+n[0])//2\r\nq=abs(a-t[0])\r\nw=abs(a-n[0])\r\nprint((w(w+1))//2+(q(q+1))//2)", "a=int(input())\r\nb=int(input())\r\ny=abs(a-b)//2\r\nx=(a+b)%2\r\nprint((y(y+1)//2) + ((x+y)(x+y+1)//2))\r\n", "a = int(input())\r\nb = int(input())\r\nx, j = 0, 0\r\nif abs(b-a) % 2 == 0:\r\n for i in range(1, (abs(b-a)//2)+1):\r\n x += i\r\n print(2x)\r\nelse:\r\n for j in range((abs(b-a)//2)+1):\r\n x += j\r\n print((2x)+j+1)", "a = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a-b)\r\nsumm = 0\r\nmid = diff // 2\r\nstart = 1\r\n\r\nfor i in range(start,mid+1):\r\n summ += i\r\n\r\nif diff % 2 == 0:\r\n print(summ2)\r\nelse:\r\n print((summ2)+(mid+1))\r\n\r\n\r\n", "class CodeforcesTask931ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.a = 0\r\n self.b = 0\r\n\r\n def read_input(self):\r\n self.a = int(input())\r\n self.b = int(input())\r\n\r\n def process_task(self):\r\n dist = abs(self.a - self.b)\r\n if dist % 2:\r\n tire1 = dist // 2\r\n tire2 = dist // 2 + 1\r\n else:\r\n tire1 = dist // 2\r\n tire2 = dist // 2\r\n tiredness = sum([x + 1 for x in range(tire1)])\r\n tiredness += sum([x + 1 for x in range(tire2)])\r\n self.result = str(tiredness)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask931ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a - b)\r\n\r\nif diff == 1 :\r\n print(1)\r\n\r\nelse:\r\n a = diff // 2\r\n b = (diff - a)\r\n\r\n suma = ((a(a+1))/2) + ((b(b+1))/2)\r\n print(int(suma))", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nif diff%2==0:\r\n diff//=2\r\n print(diff(diff+1))\r\nelse:\r\n diff//=2\r\n print((diff(diff+1))+(diff+1))", "n,m=int(input()),int(input())\r\nval=abs(m-n);mid=val//2;val2=val-mid\r\nprint(((mid(mid+1))//2)+((val2(val2+1))//2))", "a= int(input())\r\nb= int(input())\r\n\r\ndist= abs(a-b)\r\ntierd=0\r\nc= dist//2\r\n\r\n\r\nfor i in range(c+1):\r\n tierd= tierd+ 2i\r\n\r\nif dist%2!=0:\r\n tierd = tierd + c+1\r\nprint(tierd)", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n n=(a-b)//2\r\n if (a-b)%2==0:\r\n k=(n(n+1))\r\n else:\r\n k=((n(n+1))+n+1)\r\nelse:\r\n n=(b-a)//2\r\n if (b-a)%2==0:\r\n k=((n(n+1)))\r\n else:\r\n k=((n(n+1))+n+1)\r\nprint(k)\r\n\r\n", "a = int(input())\nb = int(input())\nif abs((a - b)) % 2 == 0:\n print((abs(a - b) // 2) ((abs(a - b) // 2) + 1))\nelse:\n print((abs(a - b) // 2) * ((abs(a - b) // 2) + 1) + abs(a - b) // 2 + 1)", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\nd=c//2\r\ne=d+c%2\r\nprint((1+e)e//2+(1+d)d//2)\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nsum1 = 0\r\nsum2 = 0\r\na1 = 1\r\na2 = 1\r\nfor i in range(c):\r\n if i < c//2:\r\n sum1+=a1\r\n a1+=1\r\n else:\r\n sum2 += a2\r\n a2 +=1\r\nprint(sum1+sum2)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nn=abs(b-a)\r\nc=n//2\r\nd=ceil(n/2)\r\nprint(c(c+1)//2 + d(d+1)//2)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\ncounta = c//2\r\ncountb = c-counta\r\nprint(int(counta(counta+1)/2+countb(countb+1)/2))", "from math import ceil\n\ndef solve(a, b):\n x = ceil(abs(a - b)/2)\n y = abs(a - b)//2\n if x != y:\n return ((1+y)y)//2 + ((x+1)x)//2\n else:\n return ((1+y)y)\n\n\ndef main():\n a = int(input())\n b = int(input())\n print(solve(a, b))\n\n\nmain()\n", "def tiredness(gap):\n if gap == 0:\n return 0\n frnd1_moves = gap // 2\n frnd2_moves = gap - frnd1_moves\n\n return sum(range(frnd1_moves + 1)) + sum(range(frnd2_moves + 1))\n\npos1 = int(input())\npos2 = int(input())\n\ngap = abs(pos1 - pos2)\nprint(tiredness(gap))", "import math\r\n\r\ndef summation(n):\r\n res = 0\r\n for i in range(1,n+1):\r\n res += i\r\n return res \r\n\r\nx = int(input())\r\ny = int(input())\r\ndistance = abs(y - x)\r\nif distance % 2 == 0:\r\n print(summation(distance//2)2)\r\nelse:\r\n curr = (distance -1 )//2\r\n val = (summation(curr) * 2) + curr +1\r\n print(val)\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nn=abs(a-b)//2\r\nSum=0\r\nif abs(a-b)%2==1:\r\n print((1+n)n+n+1)\r\nelse:\r\n print((1+n)n)", "a = int(input())\nb = int(input())\nc = abs(a - b)\nans = 0\nfor i in range(c // 2 + 1):\n ans += 2 * i\nif c % 2 == 1:\n ans += i + 1\nprint(ans)\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nprint((c-min(a,b))(c-min(a,b) +1)//2 + (max(a,b)-c)(max(a,b)-c +1)//2)\r\n\r\n", "#!/bin/python3\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nhalf = d // 2\r\nmiss = d % 2\r\n\r\ntired = 0\r\nfor i in range(1, half+1+miss):\r\n tired += i\r\nfor i in range(1, half+1):\r\n tired += i\r\n\r\nprint(tired)\r\n", "a = int(input())\nb = int(input())\nc = 0\nturn = 0\nwhile a != b:\n\tturn += 1\n\tif a > b:\n\t\ta -= 1\n\t\tc += turn\n\t\tif b < a:\n\t\t\tb += 1\n\t\t\tc += turn\n\telif b > a:\n\t\tb -= 1\n\t\tc += turn\n\t\tif a < b:\n\t\t\ta += 1\n\t\t\tc += turn\nprint(c)", "pos_a=int(input())\npos_b=int(input())\njarak_a=int(abs(pos_b-pos_a)/2)\nc=abs(pos_b-pos_a)%2\n\nif (pos_a!=pos_b) and (1<=pos_a<=1000) and (1<=pos_b<=1000):\n if (c==0):\n tired1=int(jarak_a2+jarak_a)\n print(tired1)\n elif(c==1):\n tired2=int(jarak_a2+2jarak_a+1)\n print(tired2)", "a = int(input())\r\nb = int(input())\r\nz = (abs(a-b)) % 2\r\nc = int((abs(a-b)) / 2)\r\nif(z == 0):\r\n print(int(c (c+1)))\r\nelse:\r\n print(int((c (c+1)/2)+((c+1) (c+2))/2))", "a = int(input())\r\nb = int(input())\r\nl = abs(a-b)\r\nl1 = l//2\r\nl2 = l-l1\r\nprint((l1(l1+1)//2)+(l2(l2+1)//2))\r\n", "a=int(input())\r\nb=int(input())\r\nmid=int((a+b)/2)\r\nvermoeidheid=0\r\nif b>a:\r\n hoeveelvoora=int(mid-a)\r\n hoeveelvoorb=int(b-mid)\r\n for i in range(1,hoeveelvoora+1):\r\n vermoeidheid+=int(i)\r\n for j in range(1,hoeveelvoorb+1):\r\n vermoeidheid+=int(j)\r\nif a>b:\r\n hoeveelvoora=int(a-mid)\r\n hoeveelvoorb=int(mid-b)\r\n for i in range(1,hoeveelvoora+1):\r\n vermoeidheid+=int(i)\r\n for j in range(1,hoeveelvoorb+1):\r\n vermoeidheid+=int(j)\r\nprint(vermoeidheid)\r\n\r\n ", "a=int(input())\r\nb=int(input())\r\nf=lambda x:(x+1)x//2\r\nm=(a+b)//2\r\nprint(f(abs(m-a))+f(abs(m-b)))", "import math\r\n\r\ndef solve(start, end):\r\n start, end = min(start, end), max(start, end)\r\n diff = end - start\r\n n = diff // 2 \r\n res = n (n + 1) // 2 ## sum of one side\r\n res = 2 ## both sides(left & right)\r\n if diff % 2:\r\n res += n + 1\r\n return res\r\n\r\n\r\n\r\ndef main():\r\n start = int(input())\r\n end = int(input())\r\n print(solve(start, end))\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve(first, second):\r\n\tresult = 0\r\n\tfirst_tired = 1\r\n\tsecond_tired = 1\r\n\tswing = True\r\n\t\r\n\tif first > second:\r\n\t\tfirst, second = second, first\r\n\t\r\n\twhile first < second:\r\n\t\tif swing:\r\n\t\t\tfirst += 1\r\n\t\t\tresult += first_tired\r\n\t\t\tfirst_tired += 1\r\n\t\t\tswing = not swing\r\n\t\telse:\r\n\t\t\tsecond -= 1\r\n\t\t\tresult += second_tired\r\n\t\t\tsecond_tired += 1\r\n\t\t\tswing = not swing\r\n\t\r\n\treturn result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tfirst_friend = int(input())\r\n\tsecond_friend = int(input())\r\n\t\r\n\tprint(solve(first_friend, second_friend))", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nn=diff//2\r\ns=0\r\ntiredness=0\r\nif diff==1:\r\n tiredness=1\r\nelif diff==2:\r\n tiredness=2\r\nelse:\r\n for i in range (1,n+1):\r\n s=s+i\r\n if diff%2==0:\r\n tiredness=2s\r\n else:\r\n tiredness=2s+n+1\r\nprint(tiredness)\r\n \r\n \r\n", "x=int(input())\r\ny=int(input())\r\ndis=abs(x-y)\r\na=dis//2\r\nb=dis-a\r\nprint(a(a+1)//2+b(b+1)//2) if dis>1 else print(1)\r\n", "import math\r\nfriend1=eval(input())\r\nfriend2=eval(input())\r\n\r\nmid=int(math.ceil((friend1+friend2)/2))\r\ndiff1=abs(mid-friend1)\r\ndiff2=abs(friend2-mid)\r\ntot=0\r\nfor i in range(1,diff1+1):\r\n tot+=i\r\nfor i in range(1,diff2+1):\r\n tot+=i\r\nprint(tot)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n print(2 (c//2 * (c//2 + 1)) // 2)\r\nelse:\r\n print(c//2 * (c//2 + 1) // 2 + (c//2 + 1) * (c//2 + 2) // 2)", "a = int(input())\nb = int(input())\n\nmeio = (a+b) // 2\nd1 = abs(a - meio)\nd2 = abs(b - meio)\n\ns1 = sum(range(d1+1))\ns2 = sum(range(d2+1))\nprint(s1+s2)\n\t \t \t \t \t \t\t \t\t \t \t\t \t\t", "a=int(input())\r\nb=int(input())\r\nn=0\r\nk=0\r\nf=0\r\ns=0\r\nl=0\r\nn=(abs(b-a))//2\r\nf=((1+n)n)//2\r\nl=abs(b-a)-n\r\ns=((1+l)l)//2\r\nk=s+f\r\nprint(k)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndis = abs(a-b)\r\n\r\nif dis % 2 == 0:\r\n x = dis // 2 * (dis // 2 + 1)\r\nelse:\r\n x = dis // 2 * (dis // 2 + 2) + 1\r\n\r\nprint(x)\r\n", "def move(f1,f2):\r\n counter = 0\r\n tiredx1 = 0\r\n tiredx2 = 0\r\n a_list = []\r\n\r\n if (f1<f2):\r\n x1 = f1\r\n x2 = f2\r\n else:\r\n x1 = f2\r\n x2 = f1\r\n \r\n x1 +=1\r\n tiredx1 +=1\r\n a_list.append(tiredx1)\r\n while(x1 != x2):\r\n x2 -= 1\r\n tiredx2 += 1\r\n a_list.append(tiredx2)\r\n if (x1 != x2):\r\n x1 += 1\r\n tiredx1 +=1\r\n a_list.append(tiredx1)\r\n \r\n for k in a_list:\r\n counter += k\r\n \r\n \r\n \r\n return counter\r\n\r\n \r\n\r\ndef main():\r\n f1 = int(input())\r\n f2 = int(input())\r\n print(move(f1,f2))\r\n\r\n\r\nmain()", "#brrrr big brrrr u already know ice spice pooh shiest type stuff going on round here fr fr\nimport math\na = int(input())\nb = int(input())\nx = abs(b - a)\ny = x % 2 != 0\nx //= 2\nprint((x + y) * (x + 1))\n\n", "a= int(input())\r\nb= int(input())\r\nd= abs(a-b)\r\nh= d // 2\r\nif d%2 == 0:\r\n print(h(h+1))\r\nelse:\r\n print((h+1)(h+1))", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b) // 2\r\ns = 2 * sum(list(range(c + 1)))\r\nif abs((a - b) % 2):\r\n s += c + 1\r\nprint(s)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nx = (a + b) // 2\r\nu, v = x - a, b - x\r\nans = (u * (u + 1) + v * (v + 1)) // 2\r\nprint(ans)" ]	{"inputs": ["3\n4", "101\n99", "5\n10", "1\n2", "1\n1000", "999\n1000", "1000\n999", "1000\n1", "2\n1", "2\n999", "2\n998", "999\n2", "998\n2", "2\n1000", "1000\n2", "1\n999", "999\n1", "188\n762", "596\n777", "773\n70", "825\n729", "944\n348", "352\n445", "529\n656", "19\n315", "138\n370", "546\n593", "285\n242", "773\n901", "892\n520", "864\n179", "479\n470", "967\n487", "648\n106", "58\n765", "235\n56", "285\n153", "943\n13", "675\n541", "4\n912"], "outputs": ["1", "2", "9", "1", "250000", "1", "1", "250000", "1", "249001", "248502", "249001", "248502", "249500", "249500", "249500", "249500", "82656", "8281", "123904", "2352", "89102", "2209", "4096", "22052", "13572", "576", "484", "4160", "34782", "117649", "25", "57840", "73712", "125316", "8100", "4422", "216690", "4556", "206570"]}	UNKNOWN	PYTHON3	CODEFORCES	607
d35468d66b47dffb57a8ada4ba7221e5	Vanya and Fence	Vanya and his friends are walking along the fence of height h and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed h. If the height of some person is greater than h he can bend down and then he surely won't be noticed by the guard. The height of the i-th person is equal to ai. Consider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard? The first line of the input contains two integers n and h (1<=≤<=n<=≤<=1000, 1<=≤<=h<=≤<=1000) — the number of friends and the height of the fence, respectively. The second line contains n integers ai (1<=≤<=ai<=≤<=2h), the i-th of them is equal to the height of the i-th person. Print a single integer — the minimum possible valid width of the road. Sample Input 3 7 4 5 14 6 1 1 1 1 1 1 1 6 5 7 6 8 9 10 5 Sample Output 4 6 11	[ "friends_num, fence_height = map(int, input().split())\nfriends_heights = [int(height) for height in input().split()]\n\nroad_width = sum(\n 1\n if height <= fence_height\n else 2\n for height in friends_heights\n)\n\nprint(road_width)\n", "\r\nn,h=map(int, input().split())\r\na= list(map(int, input().strip().split())) [:n]\r\n\r\nc=0\r\nfor i in a:\r\n if(i>h):\r\n c+=2\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\ntotal_width=0\r\nfor height in heights:\r\n if height<=h:\r\n total_width+=1\r\n else:\r\n total_width+=2\r\nprint(total_width)\r\n ", "n , h = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nwidth = n\r\nfor i in l:\r\n if i > h:\r\n width += 1\r\nprint(width)", "n,h = map(int,input().split())\na = list(map(int,input().split())) \nc = 0\nfor i in a:\n if i>h:\n c+=2 \n else:\n c+=1 \nprint(c)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\na1 = list(filter(lambda x: x <= h,a))\r\na2 = list(filter(lambda x: x > h,a))\r\nprint(len(a1) + len(a2)2)\r\n", "r,c=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncount=0\r\nfor ele in lst:\r\n if ele> c:\r\n count=count+2\r\n else:\r\n count=count+1\r\nprint(count)", "def rng(s,k,lst):\r\n #s is the total number of people like minimum widith and k is the max height possible\r\n count=s\r\n for f in lst:\r\n if f>k:\r\n count+=1\r\n return count\r\ny=input()\r\nalist=[int(x) for x in y.split()]\r\nd=input()\r\nblist=[int(x) for x in d.split()]\r\nprint(rng(alist[0],alist[1],blist))", "x = input().split()\r\nn = int(x[0])\r\nh = int(x[1])\r\nw = 0\r\nheights = input().split()\r\nfor y in heights:\r\n if int(y)>h:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "count_h = str(input())\r\ncount_h = count_h.split(\" \")\r\nheight = int(count_h[1])\r\n\r\nfriends = str(input())\r\nfriends = friends.split(\" \")\r\nreuslt = 0\r\nfor friend in friends:\r\n if(int(friend) <= height):\r\n reuslt = reuslt + 1\r\n else:\r\n reuslt = reuslt + 2\r\nprint(reuslt)", "inpa = input().split(' ')\r\ninpb = input().split(' ')\r\ncounter = 0\r\nfor x in inpb:\r\n if int(x) > int(inpa[1]):\r\n counter += 2\r\n else:\r\n counter += 1\r\nprint(counter)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\nprint(sum([1 if i <= m else 2 for i in x]))\n \t\t \t \t \t \t \t \t \t \t", "n, h = map(int, input(\"\").split())\r\nlista = list(map(int, input(\"\").split()))\r\nl=0\r\nfor i in range(len(lista)):\r\n if lista[i]<=h:\r\n l = l + 1\r\n else:\r\n l = l + 2\r\nprint(l)", "numAndMaxHeight = [int(a) for a in input().split()]\r\n\r\nheights = [int(a) for a in input().split()]\r\n\r\nwidthOfTheRoad = 0\r\n\r\n\r\nmaxHeight = numAndMaxHeight[1]\r\n\r\ni = 0\r\n\r\nfor height in heights:\r\n if height > maxHeight:\r\n widthOfTheRoad += 2\r\n else:\r\n widthOfTheRoad += 1\r\n\r\nprint(widthOfTheRoad)\r\n", "n,height = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nwidth=0\r\n\r\nfor i in range(n):\r\n if h[i]>height:\r\n width+=2\r\n else:\r\n width+=1\r\n\r\n\r\nprint(width)", "a = input().split()\r\nb = input().split()\r\nn = a[0]\r\nh = int(a[1])\r\ntrack = 0\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\n if b[i] > h:\r\n track += 2\r\n else:\r\n track += 1\r\nprint(track)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc1=0\r\nfor i in c:\r\n if i<=b:\r\n c1+=1\r\n else:\r\n c1+=2\r\nprint(c1)", "n, h = map(int, input().split())\nfriends = list(map(int, input().split()))\nans = 0\n\nfor friend in friends:\n if friend > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n", "n = str(input())\r\nn_list = n.split()\r\nn_list_int = [int(x) for x in n_list]\r\n\r\nheight = str(input())\r\nheight_list = height.split()\r\nheight_list_int = [int(x) for x in height_list]\r\n\r\nsum = 0;\r\n\r\nfor x in height_list_int:\r\n if x > n_list_int[1]:\r\n sum = sum + 2\r\n else:\r\n sum = sum + 1\r\n \r\nprint(sum)", "f,h=map(int,input().split())\r\np=list(map(int,input().split()))\r\na1=0\r\nb1=0\r\nfor i in p:\r\n if i>h:\r\n a1=a1+2\r\n else:\r\n b1=b1+1\r\nprint(a1+b1)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(len(a)):\r\n\tif a[i]>h:\r\n\t\tres+=2\r\n\telse:\r\n\t\tres+=1\r\nprint(res)", "nh=[int(i) for i in input().split()]\r\nn=nh[0]\r\nh=nh[1]\r\nhi=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(len(hi)):\r\n if hi[i]>h:\r\n s+=2\r\n else:\r\n s+=1\r\n\r\nprint(s)", "# Ваня с друзьями идёт по запрещенной территории возле забора высотой h. Чтобы охранник их не заметил, высота каждого\r\n# из друзей не должна превышать h. При этом каждый из них может пригнуться, тогда его точно не будет видно охраннику.\r\n# Высота i-го из друзей равняется ai.\r\n#\r\n# Будем считать, что ширина человека, идущего в полный рост, равна 1, а согнутого — 2. Друзья хотят идти по дороге в\r\n# один ряд, чтобы иметь возможность разговаривать друг с другом. Какой минимальной ширины должна быть (дорога, чтобы)\r\n# все они поместились на ней в один ряд и охранник никого не увидел?\r\n#\r\n# Входные данные\r\n# В первой строке входных данных записаны два целых числа n и h (1≤n≤1000, 1≤h≤1000) — количество друзей и высота\r\n# забора соответственно.\r\n#\r\n# Во второй строке записаны n целых чисел ai (1≤ai≤2h), i-е из которых равняется высоте i-го друга.\r\n#\r\n# Выходные данные\r\n# Выведите единственное целое число — минимальную подходящую ширину дороги.\r\n\r\nn, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwidth_road = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n width_road += 2\r\n else:\r\n width_road += 1\r\nprint(width_road)", "n,h = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nc = 0\r\nfor i in range(len(l)):\r\n if l[i] > h:\r\n c = c+2\r\n else:\r\n c = c+1\r\nprint(c)\r\n ", "import math\r\nimport re\r\nfrom itertools import count\r\nfrom itertools import accumulate\r\n\r\ndef print_hi(name):\r\n # Use a breakpoint in the code line below to debug your script.\r\n print(f'Hi, {name}') # Press Ctrl+F8 to toggle the breakpoint.\r\n\r\n\r\ndef count2(count):\r\n print(f'{count} + 2 = {count+2}')\r\n print(\"if __name__ == '__main__':\")\r\n print(f\"{(hours + ( (wait+minute) // 60)) % 24:0>2}:{((minute + wait) % 60):0>2}\")\r\n\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n))\r\n for i in range(2, 1 + max_div):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ntrans = {'А': 'A', 'а': 'a', 'Б': 'B', 'б': 'b', 'В': 'V', 'в': 'v', 'Г': 'G', 'г': 'g', 'Д': 'D', 'д': 'd',\r\n 'Е': 'E', 'е': 'e', 'Ё': 'E', 'ё': 'e', 'Ж': 'ZH', 'ж': 'zh', 'З': 'Z', 'з': 'z', 'И': 'I', 'и': 'i',\r\n 'Й': 'I', 'й': 'i', 'К': 'K', 'к': 'k', 'Л': 'L', 'л': 'l', 'М': 'M', 'м': 'm', 'Н': 'N', 'н': 'n',\r\n 'О': 'O', 'о': 'o', 'П': 'P', 'п': 'p', 'Р': 'R', 'р': 'r', 'С': 'S', 'с': 's', 'Т': 'T', 'т': 't',\r\n 'У': 'U', 'у': 'u', 'Ф': 'F', 'ф': 'f', 'Х': 'KH', 'х': 'kh', 'Ц': 'TC', 'ц': 'tc', 'Ч': 'CH', 'ч': 'ch',\r\n 'Ш': 'SH', 'ш': 'sh', 'Щ': 'SHCH', 'щ': 'shch', 'Ы': 'Y', 'ы': 'y', 'Э': 'E', 'э': 'e', 'Ю': 'IU', 'ю': 'iu',\r\n 'Я': 'IA', 'я': 'ia' }\r\n#a = [int(x) for x in input().split()]\r\n#print(a[0])\r\n#print(a[1])\r\nans = 0\r\nbuf = [int(x) for x in input().split()]\r\nn = buf[0]\r\nk = buf[1]\r\nfriends = [int(x) for x in input().split()]\r\nfor people in friends:\r\n if people > k:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "n, h = list(map(int, input().split()))\na = list(map(int, input().split()))\nans = 0\nfor person in a:\n if person > h:\n ans += 2\n else:\n ans += 1\nprint(ans)", "n, h = [int(i) for i in input().split()]\nfriends = [int(i) for i in input().split()]\n\n\nwidth = 0\nfor i in range(n):\n\tif friends[i] > h:\n\t\twidth += 2\n\telse:\n\t\twidth += 1\n\n\nprint(width)\n", "ish = list(map(int,input().split()))\r\nreb = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(ish[0]):\r\n if reb[i] <= ish[1]:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)\r\n", "n,h=map(int,input().split())\r\nmy_list=list(map(int,input().split()))\r\ns=0\r\nfor item in my_list:\r\n if item<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n_h = list(map(int,input().split()))\r\nai = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in ai:\r\n if i <= n_h[1]:\r\n counter+=1\r\n else:\r\n counter+=2\r\nprint(counter)", "n,h = list(map(int,input().split()))\r\nfriends = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(len(friends)):\r\n if friends[i] > h:\r\n c += 2\r\n elif friends[i] <= h:\r\n c += 1\r\nprint(c)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Aug 30 08:08:32 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\ndata=input().split()\r\nheights=[]\r\npeople=int(data[0])\r\nheight=int(data[1])\r\ndata_2=input().split()\r\nwidth=0\r\nfor i in range(people):\r\n heights.append(int(data_2[i]))\r\n if heights[i]>height:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split())\r\na=map(int,input().split())\r\naa=list(a)\r\ns=0\r\nfor i in range(n):\r\n if aa[i]>h:\r\n s+=2\r\n if aa[i]<=h:\r\n s+=1\r\nprint(s)", "n,h = map(int,input().split(\" \"))\r\na = input().split(\" \")\r\n\r\nmaxw = 0;\r\n\r\nfor i in range(n):\r\n if (int(a[i])>h):\r\n maxw +=2;\r\n else:\r\n maxw+=1;\r\n \r\nprint(maxw)", "n,h=map(int, input().split())\r\ncount=0\r\nl=list(map(int, input().split()))\r\nfor i in l:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)", "l=list(map(int,input().strip().split()))\r\nif 1<=l[0]<=1000 and 1<=l[1]<=1000:\r\n c=0\r\n x=list(map(int,input().strip().split()))\r\n for i in x:\r\n if i<=l[1]:\r\n c+=1\r\n else:\r\n c+=2\r\n print(c)\r\n \r\n \r\n ", "n, h = list(map(int,input().split()))\r\ncount = 0\r\nfor person in list(map(int,input().split())):\r\n count += 1 if person<=h else 2\r\nprint(count)", "n=input().split()\r\nf=int(n[0])\r\ns=int(n[1])\r\nh=0\r\nl=input().split()\r\nl=[int(i)for i in l]\r\nfor x in range(f):\r\n if l[x]>s:\r\n h+=2\r\n else:\r\n h+=1\r\n\r\nprint(h)", "n,h=map(int,input().split())\r\ncount=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n", "n, b = map(int, input().split())\r\nprint(n + sum([1 for i in input().split() if int(i) > b]))", "a,b=map(int ,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in l:\r\n if i<=b:\r\n sum+=1\r\n else:\r\n sum+=2\r\nprint(sum)", "n,h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 0\r\nfor i in a:\r\n if i <= h:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)\r\n", "\"\"\"Ваня и забор\"\"\"\r\n\r\ndef main():\r\n n, h = [int(i) for i in input().split()]\r\n row = [int(i) for i in input().split()]\r\n tmp = [1 if i <= h else 2 for i in row]\r\n print(sum(tmp))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = (int(i) for i in input().split())\r\nline = list(input().split(' '))\r\nline = list(map(int, line))\r\n\r\ncount = 0\r\nfor j in range(n):\r\n if line[j] <= k:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "n, h = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nans = n\n\nfor itr in a:\n if itr>h:\n ans += 1\n\nprint(ans)\n\t\t \t \t \t \t\t \t\t\t\t\t \t\t", "line_1 = input().split()\nline_2 = input().split()\nh = int(line_1[1])\nwidth_road = 0\n\nfor i in line_2:\n if int(i) > h:\n width_road += 2\n else:\n width_road += 1\n\nprint(width_road)", "n , h = map(int,input().split())\r\nfriends = list(map(int,input().split()))\r\nwidth = 0\r\n\r\nfor height in friends:\r\n if height > h:\r\n width += 2\r\n else: width += 1\r\n\r\nprint(width)", "n, h = map(int, input().split())\r\na = map(int, input().split())\r\nw = 0\r\nfor i in a:\r\n\tif i > h: w += 2\r\n\telse: w += 1\r\nprint (w)", "\r\nn, k = list(map(int, input().split()))\r\n\r\nheight_list = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nfor i in height_list:\r\n if i <= k:\r\n total += 1\r\n \r\n else:\r\n total += 2\r\n \r\nprint(total)\r\n ", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in heights:\r\n if (i > h):\r\n width+=2\r\n else :\r\n width+=1\r\nprint(width)\r\n", "n, h = input().split()\nn = int(n)\nh = int(h)\narr = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n if arr[i] > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n\n \t \t\t\t\t\t \t \t\t \t \t\t\t\t \t \t\t", "n , h = map(int,input().split())\r\narr =map(int,input().split()) \r\nc = 0\r\nfor i in arr:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)\r\n ", "n,h=input().split()\r\ntotalFriends=list(map(int,input().split()))\r\nfriendWidth=0\r\nfor i in totalFriends:\r\n if i > int(h):\r\n friendWidth+=2\r\n else:\r\n friendWidth+=1\r\nprint(friendWidth)", "li = []\r\nNumber,High = map(int,input().split())\r\nn = list(map(int,input().split()))\r\nfor i in n:\r\n if i <=High:\r\n li.append(1)\r\n elif i >=High:\r\n li.append(2)\r\nprint(sum(li))", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n if i>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "s=input()\r\nt=s.split()\r\nn=int(t[0])\r\nh=int(t[1])\r\ns=input()\r\nt=s.split()\r\nw=0\r\nfor i in t:\r\n if int(i)>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "import math as m\r\nx=0\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nfor i in c:\r\n x+=(m.ceil(i/b))\r\nprint(x)", "a,b=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nsum=0\r\nfor x in list1:\r\n if x<=b:\r\n sum+=1\r\n else:\r\n sum+=2\r\nprint(sum)", "p=int(input().split()[1])\r\ns=0\r\nfor i in [int(a) for a in input().split()]:\r\n if i>p:\r\n s += 2\r\n else:\r\n s +=1\r\nprint(s)\r\n", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate the minimum road width\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\n\r\n# Print the result\r\nprint(width)\r\n", "n,h=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nfor i in a:\n s+=2 if i>h else 1\nprint(s)\n ", "w,v=map(int,input().split(\" \"))\r\nc=0\r\nx=input().split(\" \")\r\nfor i in range(w):\r\n if int(x[i])>v:c+=2\r\n else:c+=1\r\nprint(c)", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndouble=0\r\nfor i in b:\r\n if i >a[1]:\r\n double+=1\r\nprint(a[0]+double)", "friends = input().split()\r\nfence_height = friends[1]\r\nheights = input().split()\r\nwidth = 0\r\n\r\nfor height in heights:\r\n if int(height) > int(fence_height):\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-10-16 00:11:53\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\nmod = 10 * 9 + 7 # 998244353\r\n\r\nn, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(n + sum(x > h for x in a))\r\n", "input_friends_fence = input()\ninput_friend_heights = input()\n\nheight_list = input_friend_heights.split(\" \")\nn_friends = input_friends_fence.split(\" \")[0]\nfence_height = int(input_friends_fence.split(\" \")[1])\n\nwidth = 0\nfor friend in height_list:\n if int(friend) > fence_height:\n width += 2\n else:\n width += 1\n\nprint(width)\n\t \t \t\t \t \t \t \t \t \t\t\t \t\t", "n,h=map(int,input().split())\r\na=list(map(int,list(input().split())))\r\n#print(a)\r\nb=0\r\nfor i in range(0,n):\r\n if a[i]>h:\r\n b+=2\r\n else:\r\n b+=1\r\nprint(b)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)", "s = input()\r\ns = s.split(' ')\r\nn = int(s[0])\r\nh = int(s[1])\r\na = input()\r\na = a.split(' ')\r\nc = 0\r\nfor i in a:\r\n i = int(i)\r\n if (i <= h):\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "n, h = map(int, input().split())\n\nnums = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n): \n if nums[i] > h: \n count += 2\n else: \n count += 1\n\nprint(count)\n", "numbers = map(int, open(0).read().split())\r\nN, h, a = numbers\r\ncount_greater_than_h = sum(n > h for n in a)\r\nresult = N + count_greater_than_h\r\nprint(result)\r\n", "N, h = map(int, input().split())\r\nlst = [int(x) for x in input().split(\" \",N)]\r\nlst1 = []\r\nfor i in lst:\r\n if i > h:\r\n lst1.append(i)\r\nprint(len(lst1) 2 + len(lst) - len(lst1))", "n,h=map(int,input().split())\r\na=list(map(int,input().split())) \r\nans=0 \r\nfor i in range(n):\r\n if a[i]<=h:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)\r\n \r\n ", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 0\r\nfor i in a:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n, h = map(int, input().split())\r\ns = input().split()\r\n\r\nc = 0\r\n\r\nfor i in s:\r\n if int(i) > h:\r\n c += 2\r\n if int(i) <= h:\r\n c += 1\r\n\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\nsp = list(map(int, input().split()))\r\nans = 0\r\nfor i in sp:\r\n if i > h:\r\n ans += 2 \r\n else:\r\n ans += 1\r\nprint(ans) \r\n\r\n\r\n", "n,h = map(int,input().split())\r\nfriendsHights = list(map(int, input().split()))\r\nfor frindHight in friendsHights:\r\n if frindHight > h: n+=1\r\nprint(n)", "def road_width(fence_height, friends_height):\r\n width = len(friends_height)\r\n for fr in friends_height:\r\n if fr > fence_height:\r\n width += 1\r\n return width\r\n\r\nn, h = [int(item) for item in input().split()]\r\nprint(road_width(h, friends_height=[int(item) for item in input().split()]))", "a,b=map(int,input().split())\r\nd=0\r\nc=list(map(int,input().strip().split()))[:a]\r\nfor i in range(a):\r\n \r\n if c[i]>b:\r\n d+=2\r\n else:\r\n d+=1\r\nprint (d) ", "n,h = map(int,input().split())\r\nl = list(input().split())\r\nc = 0\r\nfor i in range(n):\r\n if int(l[i]) > h:\r\n c+=2\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n , h = map(int,input().split())\nheights = list(map(int,input().split()))\nwidth = 0\nfor height in heights:\n if height > h :\n width += 2\n else:\n width += 1 \n \nprint(width)", "n, h = input().split()\n\nn = int(n)\nh = int(h)\n\na = input().split()\n\nfor i in range(len(a)):\n a[i] = int(a[i])\n\nans = 0\n\nfor i in range(len(a)):\n if a[i] > h:\n ans += 2\n else:\n ans += 1\n\nprint(ans)\n \t\t \t \t\t\t\t \t\t\t\t \t\t \t\t \t", "def solve():\r\n n, h = map(int, input().split())\r\n l = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in l:\r\n ans += 1 + (i > h)\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "a,b=map(int,input().split())\r\ncount=0\r\nlis=list(map(int,input().split()))\r\nfor i in lis:\r\n if i<=b:\r\n count=count+1\r\n else:\r\n count=count+2\r\nprint(count)", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Tue Sep 19 16:07:49 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nn,h=map(int, input().split())\nlist1=list(map(int, input().split()))\nk=0\nif 1<=n<=1000 and 1<=h<=1000:\n if len(list1)==n:\n for i in list1:\n if 1<=i<=2h:\n if i<=h:\n k+=1\n else:\n k+=2 \n print(k)\n\n ", "n,h = map(int,input().split()) \r\na = list(map(int,input().split()))\r\nsum = 0\r\nfor num in a:\r\n if num > h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "friends, fence_height = [int(x) for x in input().split()]\r\nfriends_height = [int(x) for x in input().split()]\r\nroad_width = 0\r\n\r\nfor height in friends_height:\r\n if height > fence_height:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\n\r\nprint(road_width)", "n=input(\"\").split()\r\nh=input(\"\").split()\r\nwidth=0\r\nfor i in range(int(n[0])):\r\n if int(h[i])>int(n[1]):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width) ", "n, h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range (n):\r\n if a[i]<=h:\r\n k += 1\r\n elif a[i]>h:\r\n k += 2\r\nprint(k)", "n,h=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\ncount=0\r\nfor i in height:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)\r\n ", "n,h = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nwidth = 0\r\nsum =0 \r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n sum += 2\r\n else:\r\n sum += 1\r\n\r\nprint(sum)", "n,h=map(int,input().split())\r\n\r\nvector =list(map(int,input().split()))\r\nwidth =0\r\nfor l in vector:\r\n if l<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "friends, fence = map(int,input().split())\r\nheight = map(int,input().split(\" \"))\r\nwidth = 0\r\n\r\nfor x in height:\r\n if x <= fence:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)\r\n\r\n", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nc=0\r\nfor i in a:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "pg = input().split()\r\nx = 0\r\ny = 0\r\np,g = int(pg[0]), int(pg[1])\r\na = list(map(int, input().split()))\r\nfor i in range(p):\r\n a\r\n if a[i]>g:\r\n x += 2\r\n elif a[i]<=g:\r\n y += 1\r\nprint(x+y)\r\n\r\n", "n,h = map(int,input().split())\r\n\r\nc = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if c[i]<=h:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n \r\nprint(cnt)", "n_h = input()\r\nlist_n_h = n_h.split()\r\n\r\nan = input()\r\nlist_an = an.split()\r\n\r\nc = 0\r\nfor i in range(0, int(list_n_h[0])):\r\n if int(list_an[i]) <= int(list_n_h[1]):\r\n c+=1\r\n else:\r\n c+=2\r\n\r\nprint(c)", "s=input(\"\")\r\nh=input(\"\")\r\ns=s.split(\" \")\r\nh=h.split(\" \")\r\nw=0\r\n\r\nfor j in h:\r\n if int(j)>int(s[1]):\r\n w=w+2\r\n else:\r\n w=w+1\r\n \r\nprint(w)", "n,m = map(int,input().split())\r\na = map(int,input().split())\r\nt = 0\r\nfor i in a:\r\n if i>m:\r\n t+=2\r\n else:\r\n t+=1\r\nprint(t)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=n\r\nfor i in l:\r\n if i > h:\r\n n+=1\r\nprint(n)", "n, h = map(int, input().split())\r\ns = input().split()\r\ns = list(s)\r\nk = 0\r\n\r\nfor i in range(n):\r\n\r\n if int(s[i]) <= h:\r\n k += 1\r\n elif int(s[i]) > h:\r\n k += 2\r\n\r\nprint(k)", "s=input()\r\nl=(s.split(\" \"))\r\nn=l[0]\r\nh=l[1]\r\ndel l\r\ndel s\r\ns=input()\r\na=(s.split(\" \"))\r\nans=0\r\nfor i in a:\r\n if int(i)>int(h): ans+=2\r\n else: ans+=1\r\nprint(ans)", "a, a_1 = map(int, input().split())\r\nb = map(int, input().split())\r\ncounter = 0\r\nfor i in b:\r\n if i == a_1:\r\n counter += 1\r\n if i > a_1:\r\n counter += 2\r\n if i < a_1:\r\n counter += 1\r\nprint(counter)", "x=list(map(int,input().split(' ')))\r\ny=list(map(int,input().split(' ')))\r\n\r\nn=x[0]\r\nh=x[1]\r\ns=0\r\nfor i in range (n):\r\n if y[i]<= h:\r\n s+=1\r\n else:\r\n s+=2\r\n\r\nprint(s)\r\n", "n, h = map(int,input().split())\r\ns = list(str(input()).split())\r\n\r\nsuma = n\r\n\r\nfor i in range(n):\r\n if int(s[i]) > h:\r\n suma += 1\r\n\r\nprint(suma)", "l = input().split()\nn, h = list(map(int, l))\n\nl = input().split()\nx = list(map(int, l))\n\nres = 0\nfor i in range(len(x)):\n if x[i] > h:\n res += 2\n else:\n res += 1\n\nprint(res)", "_, h = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\nctr = 0\r\nfor ele in lst:\r\n if ele > h:\r\n ctr += 2\r\n else:\r\n ctr += 1\r\n\r\nprint(ctr)", "n,h=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n count+=1\r\n elif a[i]>h:\r\n count+=2\r\nprint(count)\r\n \r\n ", "m,n=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n if lst[i]>n:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "nf, wh = map(int, input().split())\r\nheights = map(int, input().split())\r\nw = 0\r\nfor h in heights:\r\n if h > wh:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)", "n, h = map(int, input().split())\r\nn = map(int, input().split())\r\ncount = 0\r\nfor i in n:\r\n count += 2 if i > h else 1\r\nprint(count)", "n, h = map(int, input().split())\r\nr = map(int, input().split())\r\nr = list(r)\r\notv = n\r\nfor i in range(len(r)):\r\n if r[i]>h:\r\n otv+=1\r\nprint(otv)\r\n", "s = input()\r\nb = s.split()\r\nn = int(b[0])\r\nh = int(b[1])\r\nc = input()\r\nd = c.split()\r\nans = 0\r\n\r\nfor i in d:\r\n\tif int(i) > h:\r\n\t\tans = ans + 2\r\n\telse:\r\n\t\tans = ans + 1\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n if i>b:\r\n count+=2\r\n elif i==b or i<b:\r\n count+=1\r\nprint(count)", "a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nans=0\r\nfor x in h:\r\n if x<=b:\r\n ans=ans+1\r\n if x>b:\r\n ans=ans+2\r\nprint(ans)", "n,h =map(int, input().split())\r\nfor i in map(int, input().split()):\r\n if i > h:\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nl=list(map(int,input().strip().split()))\r\na=0\r\nfor i in l:\r\n if i>h:\r\n a+=2\r\n else :\r\n a+=1 \r\nprint(a)\r\n ", "Z=input().split(\" \")\r\nW=input().split(\" \")\r\noutput=0\r\nfor i in range (int(Z[0])):\r\n if (int(W[i])>int(Z[1])):\r\n output +=2\r\n else:\r\n output +=1\r\n\r\nprint (output)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input().split()\nfor i in range (len(a)):\n a[i]=int(a[i])\nans=0\nfor i in range (len(a)):\n if a[i] > h:\n ans+=2\n else:\n ans+=1\nprint(ans)\n\n\t\t\t\t\t \t\t\t \t \t \t\t \t \t \t\t \t\t\t\t\t", "\r\nn , h = map(int , input().split(' '))\r\nheight_list = input().split(' ')\r\nneeded_width = 0\r\nfor friend in height_list :\r\n if int(friend) <= h :\r\n needed_width += 1\r\n elif int(friend) > h :\r\n needed_width += 2 \r\n\r\nprint(needed_width)\r\n\r\n", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i>h:\r\n n+=1\r\nprint(n)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 2 09:37:00 2023\r\n\r\n@author: 10\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n,u=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nans = 0\r\nfor i in h:\r\n if i > u:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\nans = n\r\nfor man in arr:\r\n if man > h:\r\n ans += 1\r\n\r\nprint(ans)", "s0=input().split()\r\ns=input().split()\r\nn,h=int(s0[0]),int(s0[1])\r\nw=0\r\nfor i in range(n):\r\n if int(s[i])<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n , h = map(int, input().split())\r\nlist_i = list(map(int, input().split()))\r\n\r\nnumber = [1 for _ in range(n)]\r\n\r\nfor i, elements in enumerate(list_i):\r\n if elements > h:\r\n number[i] = 2\r\n else:\r\n number[i] = 1\r\nprint(sum(number))", "n, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\ncnt = 0\nfor a in arr:\n if a > h:\n cnt += 2\n else:\n cnt += 1\nprint(cnt)\n \n#hh\n\t\t\t \t \t \t\t \t \t \t\t \t\t \t\t", "n,y=map(int,input().split())\r\nqi = list(map(int,input().split()))\r\nr=0\r\nfor i in qi:\r\n if i>y:\r\n r+=2\r\n else:\r\n r+=1\r\nprint(r)", "n, h = map(int, input().split())\r\n\r\npeople = list(map(int, input().split()))\r\nwidth = 0\r\n\r\nfor i, ppl in enumerate(people):\r\n if ppl > h:\r\n width += 2\r\n continue\r\n width += 1\r\n \r\n\r\nprint(width)\r\n", "n, k = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nl = [1 if i <= k else 2 for i in h]\r\nprint(sum(l))", "n,h=map(int,input().split())\r\ncount=0\r\ns=list(map(int,input().split()))\r\nfor i in s:\r\n if i>h:\r\n count+=2\r\n else:count+=1\r\nprint(count)", "a=list(map(int,input().split()))\r\nf=a[0]\r\nh=a[1]\r\nsumi=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i>h:\r\n sumi+=2\r\n else:\r\n sumi+=1\r\nprint(sumi)", "n , h = map(int, input().split(\" \"))\r\nk = list(map(int,input().split(\" \")))\r\ncount = 0\r\nfor i in k:\r\n if i > h:\r\n count += 2\r\n else:\r\n count +=1\r\nprint(count)", "a,b= map(int,input().split())\r\nt=list(map(int,input().split()))\r\ncount=0\r\nfor i in t:\r\n\r\n if i>b:\r\n count +=2\r\n elif i<=b:\r\n count+=1\r\n \r\nprint(count)", "a, b = [int(x) for x in input().split()]\r\nn = input()\r\nnl = n.split()\r\nc = 0\r\nfor i in (nl) :\r\n if int(i) > b :\r\n c += 2\r\n else :\r\n c += 1\r\nprint(c)", "(n,h)=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nw=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n w=w+2\r\n else:\r\n w=w+1\r\nprint(w)\r\n ", "def width_cal():\r\n person_n_height = list(map(int,input().strip().split()))[:2]\r\n n_person = person_n_height[0]\r\n height = person_n_height[1]\r\n list_of_heights = list(map(int,input().strip().split()))[:n_person]\r\n width = 0\r\n for person in range(len(list_of_heights)):\r\n if list_of_heights[person]>height:\r\n width+=2\r\n else:\r\n width+=1\r\n return width\r\nprint(width_cal())\r\n", "friends, fence = list(map(int, input().split()))\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\n\r\nfor h in heights:\r\n if h <= fence:\r\n width = width + 1\r\n else:\r\n width = width + 2\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nw=0\r\nfor i in l1:\r\n if(i>h):\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "def vanyaandfence(n, h, persons):\r\n width = 0\r\n for i in persons:\r\n if i <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n print(width)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num_array = input().split()\r\n n = int(num_array[0])\r\n h = int(num_array[1])\r\n persons = list(map(int, input().split()))\r\n vanyaandfence(n, h, persons)\r\n", "m, x = map(int, input().split())\r\nph = list(map(int, input().split()))\r\nresult = 0\r\nfor i in ph:\r\n if i > x:\r\n result += 2\r\n else:\r\n result += 1\r\nprint(result) ", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(1 if i <= h else 2 for i in a))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Sep 16 23:28:00 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nnh = input().split()\r\nn = int(nh[0])\r\nh = int(nh[1])\r\nwid = 0\r\nppl = input().split()\r\nfor i in ppl :\r\n if int(i) > h :\r\n wid += 2\r\n elif int(i) <= h :\r\n wid += 1\r\nprint(wid)", "def minWidth(numFriends, fenceHeigh, friends):\n count = 0\n friendsList = friends.split(\" \")\n for x in friendsList:\n if int(x) > int(fenceHeigh):\n count += 1\n total = len(friendsList) + count\n\n return total\n \n \n\ndef main():\n numFriends, fenceHeight = input().split(\" \")\n friends = input()\n print(minWidth(numFriends, fenceHeight, friends))\n \n\nif __name__ == \"__main__\":\n main()", "l = list(map(int,input('').split()))\r\np = list(map(int,input('').split()))\r\nj=0\r\nfor i in range(l[0]):\r\n if p[i]>l[1]:\r\n j=j+1\r\n j=j+1\r\nprint(j)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if l[i]>h:c+=2\r\n else:c+=1\r\nprint(c)", "nh=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\ns=nh[0]\r\nfor i in range(nh[0]):\r\n if a[i]>nh[1]:\r\n s+=1\r\n else: pass\r\nprint(s)", "n , h =map(int , input().split())\r\na=list(map(int , input().split()))\r\nres=0\r\n\r\nfor x in range(n):\r\n if a[x] > h:\r\n res+=2\r\n else:\r\n res+=1\r\nprint(res)", "n, h = map(int, input().split(\" \"))\r\narr = map(int, input().split(\" \"))\r\ns = 0\r\nfor i in arr:\r\n s += 2 if (i // h and i!= h) else 1\r\n\r\nprint(s)", "a = input()\r\nn = \"\"\r\nh = \"\"\r\nnum = 0\r\nwhile num < len(a) and a[num] != \" \":\r\n n = n + a[num]\r\n num = num + 1\r\nnum = num + 1\r\nwhile num < len(a) and a[num] != \" \":\r\n h = h + a[num]\r\n num = num + 1\r\nb = input()\r\ncount = 0\r\nwidth = 0\r\nheight = \"\"\r\nwhile count < len(b):\r\n if b[count] != \" \":\r\n height = height + b[count]\r\n else:\r\n if int(height) > int(h):\r\n width = width + 2\r\n else:\r\n width = width + 1\r\n height = \"\"\r\n count = count + 1\r\nif int(height) > int(h):\r\n width = width + 2\r\nelse:\r\n width = width + 1\r\nprint(width)", "def largeur(liste,hauteur):\r\n res=0\r\n for i in range(len(liste)):\r\n if int(liste[i])<=hauteur:\r\n res=res+1\r\n else:\r\n res=res+2\r\n return res\r\n\r\nentrer=input()\r\nentrer=entrer.split()\r\nh=int(entrer[1])\r\nliste=input()\r\nliste=liste.split()\r\nprint(largeur(liste,h))", "n,h=input().split()\r\nheight=list(map(int ,input().split())) \r\nwidth=0\r\nfor i in height:\r\n if(i<=int(h)):\r\n width+=1\r\n elif(i>int(h)):\r\n width+=2\r\n \r\nprint(width) ", "t = input().split()\r\nw = 0\r\n\r\nfor i in range(len(t)):\r\n t[i] = int(t[i])\r\n \r\nn = t[0]\r\nh = t[1]\r\n\r\nr = input().split()\r\n\r\nfor i in range(n):\r\n r[i] = int(r[i])\r\n\r\nfor i in range(n):\r\n if r[i] > h:\r\n w += 2\r\n \r\n else: w += 1\r\n \r\nprint(w)", "count=0\r\nn=list(map(int, input().split()))\r\nfr=list(map(int, input().split()))\r\nfor i in range(n[0]):\r\n\tif fr[i]<=n[1]:\r\n\t\tcount+=1\r\n\telif fr[i]>n[1]:\r\n\t\tcount+=2\r\nprint(count)", "n, h = map(int, input().split())\r\nans = 0\r\nlist = list(map(int, input().split()))\r\nfor i in list:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\ncount = 0\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nfor a in heights:\r\n if a > h:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,h=map(int,input().split())\r\n\r\nmy_str=map(int,input().split())\r\n\r\n\r\nsum1=0\r\n\r\nfor i in my_str:\r\n if i>h:\r\n sum1 += 2\r\n else:\r\n sum1 +=1\r\n\r\nprint(sum1)", "def main():\r\n n, height = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n width = 0\r\n \r\n for i in range(n):\r\n if arr[i] > height:\r\n width += 2\r\n else:\r\n width += 1\r\n \r\n print(width)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,h=[int(x) for x in input().split()]\r\ne=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n if e[i]>h:\r\n sum=sum+2\r\n else:\r\n sum+=1\r\nprint(sum)", "a,b= map(int, input().split())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in range(a):\r\n if(c[i]<=b):\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "n,h = map(int,input().split())\r\nwidth = 0\r\n\r\nx = list(map(int,input().split()))\r\nfor v in x:\r\n if v > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "n, h = map(int, input().split())\r\np = list(map(int, input().split()))\r\nl = 0\r\nm = 0\r\nfor i in range(n):\r\n if(p[i] <= h):\r\n l += 1 \r\n else:\r\n m += 2 \r\nres = l + m\r\nprint(res)", " \r\ndef vanyaAndFence():\r\n n,h = map(int, input().split())\r\n totalWidth = 0\r\n heights = list(map(int, input().split()))[:n]\r\n for height in heights:\r\n if height > h:\r\n totalWidth = totalWidth + 2\r\n else:\r\n totalWidth = totalWidth + 1\r\n print(totalWidth)\r\nvanyaAndFence()", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nsumm=0\r\nfor i in range(n):\r\n if arr[i]<=h:\r\n summ+=1\r\n else:\r\n summ+=2\r\nprint(summ)", "san1,san2 = map(int, input().split())\r\nsandar = list(map(int, input().split()))\r\ncount = 0\r\nfor i in sandar:\r\n if i >san2:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int,input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nsumWidth = 0\r\nfor height in heights:\r\n if height > h:\r\n sumWidth += 2\r\n else:\r\n sumWidth += 1\r\nprint(sumWidth)", "n, h = map(int, input().split())\r\na = list(int(x) for x in input().split())\r\nbent = 0\r\nfor j in range(len(a)):\r\n if a[j] > h:\r\n bent += 1\r\n\r\nprint(bent 2 + n - bent)", "m, n = map(int,input().split())\nj = 0\ng = [int(x) for x in input().split()]\nfor x in range (m):\n if (g[x]<=n):\n j=j+1 \n else:\n j=j+2\nprint (j)\n", "n, h = map(int, input().split())\r\nl = map(int, input().split())\r\nlength = 0\r\nfor i in l:\r\n if i <= h:\r\n length += 1\r\n else:\r\n length += 2\r\n \r\nprint(length)", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\nfor apple in c:\r\n if apple>b:\r\n a+=1\r\nprint(a)\r\n", "n, h = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n if s[i] <= h:\r\n s[i] = 1\r\n else:\r\n s[i] = 2\r\nprint(sum(s))", "n,h=input().split()\nn=int(n)\nh=int(h)\narr=[int(i)for i in input().split()]\ns=0\nfor i in range(n):\n if arr[i]>h:\n s=s+2\n else:\n s=s+1\nprint(s)\n\t\t\t\t\t \t\t \t\t \t \t \t\t \t \t\t \t \t", "n, h = list(input().split())\r\nl = list(input().split())\r\nk=0\r\nfor i in range(int(n)):\r\n if int(l[i])<=int(h):\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "a,b=input().split()\r\narr=list(map(int,input().split()))\r\nx=0\r\nfor i in arr:\r\n if i>int(b):\r\n x+=2\r\n else:\r\n x+=1\r\nprint(x)\r\n \r\n ", "n,m = map(int, input().split())\r\nl = list(map(int,input().split()))\r\ns = len(l)\r\ns = s + sum([1 for x in l if x>m])\r\nprint(s)", "f = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\nw = 0\r\nfor i in s:\r\n if i > f[1]:\r\n w += 2\r\n else:\r\n w+=1\r\n\r\nprint(w)", "h = int(input().split(' ')[1])\r\nnums = [int(x) for x in input().split(' ')]\r\nancho = 0\r\nfor x in nums:\r\n ancho += 2 if x > h else 1\r\nprint(ancho)", "x,m = map(int,input().split())\r\nz = list(map(int,input().split()))\r\ny = 0\r\nfor i in z:\r\n if i>m:\r\n y+=2\r\n\r\n else:\r\n y+=1\r\n\r\nprint(y)", "a = input()\r\nb= input()\r\na=a.split()\r\nb=b.split()\r\ncount = 0\r\nfor i in b:\r\n if int(i) <= int(a[1]):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "#CodeForce Round 677a Vanya and Fence\r\n\r\nw = 0\r\nn,k = map(int,input().split())\r\nperson = list(map(int,input().split()))\r\nfor each in person:\r\n if each > k:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w) \r\n", "n, h = [int(x) for x in input().split()]\r\noutput = [int(x) for x in input().split()]\r\npasser = 0\r\nnonpasser = 0\r\nfor i in range(0, n):\r\n if output[i] <= h:\r\n passer += 1\r\n else:\r\n nonpasser +=1\r\nprint(1 * passer + 2 * nonpasser) ", "a,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(ar)):\r\n if(ar[i]<=b):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in l:\r\n if i>h:\r\n width +=2\r\n else:\r\n width +=1\r\n\r\nprint(width)\r\n\r\n", "# Input\r\n# 1) Variables dos enteros --> n y h\r\n# n = numero de personas\r\n# h = altura de la cerca\r\n# 2) Variable entera ai --> altura de cada persona\r\n\r\n# Output\r\n# Muestra un solo entero -- el ancho minimo posible valido\r\n\r\n\r\n# ai no puede ser mayor que h\r\n\r\n\r\ndef main():\r\n minimo_posible = 0\r\n numero_persona, altura_cerca = map(int, input().split(\" \"))\r\n # Arreglo vacio\r\n altura_de_persona = []\r\n\r\n # Input de las alturas de las personas\r\n alturas = input().split(\" \")\r\n\r\n # Agrega la altura de acuerdo con las personas que nos paso el usuario\r\n for i in range(numero_persona):\r\n if i > numero_persona:\r\n break\r\n altura_de_persona.append(alturas[i])\r\n\r\n altura_de_persons_int = [int(altura) for altura in altura_de_persona]\r\n\r\n for i in altura_de_persons_int:\r\n if i <= altura_cerca:\r\n minimo_posible += 1\r\n else:\r\n minimo_posible += 2\r\n\r\n print(minimo_posible)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n, h = map(int, stdin.readline().split())\r\n A = map(int, stdin.readline().split())\r\n\r\n res = sum(1 + int(a > h) for a in A)\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "li = [int(x) for x in input().split()]\nn = li[0]\nx = li[1]\nl = [int(x) for x in input().split()]\nz = 0\nfor i in range(n):\n if l[i]>x:\n z+=2\n else:\n z+=1\nprint(z)\n\t \t\t\t\t\t \t \t\t\t\t \t\t \t \t\t\t \t\t \t", "n, t= map(int, input().split(' '))\r\nm = input()\r\nh = list(map(int, m.split()))\r\nl=[]\r\nfor i in range(0, n):\r\n if h[i] > t:\r\n k=2\r\n l.append(k)\r\n else:\r\n p=1\r\n l.append(p)\r\nprint(sum(l))", "n,h=input().split()\r\nn,h=int(n),int(h)\r\nlist=list(map(int,input().split()))[:n]\r\ncount=0\r\nfor i in list:\r\n if i<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=n\r\nfor i in a:\r\n if i>h:\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nh0=[int(x) for x in input().split()]\r\nfor i in range(len(h0)):\r\n if h0[i]>h:\r\n n+=1\r\nprint(n)", "n, m = map(int, input().split())\r\nanswer = n\r\nx = list(map(int, input().split()))\r\nfor c in x:\r\n answer += 1 if c > m else 0\r\nprint(answer)\r\n", "n,h=map(int,input().split())\r\nheights= list(map(int,input().split()))\r\ncount=0\r\nfor i in heights:\r\n count=count+1\r\n if i>h:\r\n count=count+1\r\nprint(count) ", "n ,h = input().split()\r\nn, h = int(n), int(h)\r\ni = 0\r\nminimum_height = 0 \r\nall_height = input().split()\r\nfor _ in range(n):\r\n person_height = int(all_height[i])\r\n i += 1\r\n if person_height > h: \r\n minimum_height += 2\r\n else :\r\n minimum_height += 1\r\nprint(minimum_height)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nbend=[1 for i in a if i>h]\r\nprint(sum(bend)+len(a))\r\n", "n,h= map(int , input().split())\r\na=list(map(int , input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n count=count+1\r\nprint(count+n)", "#!/usr/bin/python3\r\n\r\nn, h = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = n\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "a,b=(int(i) for i in input().split())\r\nsum=0\r\nc=(int(i) for i in input().split())\r\nfor i in c:\r\n if i>b:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "x , y = map(int , input().split())\r\na = list(input().split())\r\nc = 0\r\nfor i in range(len(a)):\r\n z = int(a[i])\r\n if z > y:\r\n c += 2\r\n else:\r\n c +=1\r\n \r\nprint(c)", "n , h = map(int,input().split()) #h ارتفاع السياج n عدد الاصدقاء \r\ns = 0\r\na = map(int,input().split())\r\nfor i in a :\r\n if i <= h :\r\n s +=1\r\n else :\r\n s+=2\r\nprint(s) \r\n", "n, h = map(int, input().split())\r\nfriends = [int(f) for f in input().split()]\r\nw = 0\r\nfor f in friends:\r\n if f > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "k = 0\r\nn,h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(0,len(a)):\r\n if a[i] > h:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "n1,h1=input().split()\r\nn=int(n1)\r\nh=int(h1)\r\narr=list(map(int,input().split()))\r\nw=0\r\nfor i in arr:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#!/bin/env python3\n\nn, h = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nwidth = n\nfor i in a:\n if i > h:\n width += 1\n\nprint(width)\n", "s = input().split()\r\nh = int(s[1])\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in l:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmaxx = max(a)\r\nf = [0](maxx+1)\r\nfor i in a:\r\n f[i] += 1\r\nsum1 = sum(f[:h+1])\r\nsum2 = 2sum(f[h+1:])\r\nprint(sum1+sum2)", "n,h = map(int,input().split())\r\nans = 0\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]>h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n \r\n", "n,h=input().split(' ')\r\nn=(int)(n);h=(int)(h)\r\nheights=[(int)(i) for i in input().split(' ')]\r\nwidth=0\r\nfor i in heights:\r\n if(i>h):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nwidth =0\r\nfor i in l1:\r\n if i>h:\r\n width = width+2\r\n else:\r\n width = width +1\r\nprint(width)", "n,h = map(int,input().split(' '))\r\nlst = [int(n) for n in input().split()]\r\nres = 0\r\nfor i in lst:\r\n if i<=h:\r\n res+=1\r\n else:\r\n res+=2\r\nprint(res)", "problem = [int(c) for c in input().split(' ')]\r\npeople = [int(c) for c in input().split(' ')]\r\nhold = problem[0]\r\nfor c in people:\r\n if c > problem[1]:\r\n hold += 1\r\nprint(hold)", "n,h=map(int,input().split())\na=[int(i) for i in input().split()][:n]\nj=0\nwidth = 0\nwhile j<n:\n if a[j]>h:\n width += 2\n else :\n width += 1\n j+=1\nprint(width)\n", "n,h = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nres = 0\r\nfor el in arr:\r\n if(el > h):\r\n res+=2\r\n else: res+=1\r\nprint(res)", "n, h = map(int, input().split())\r\na = input().split()\r\na = [int(x) for x in a]\r\nsumm = 0\r\nfor i in a:\r\n if i > h:\r\n summ += 2\r\n else:\r\n summ += 1\r\n\r\nprint(summ)", "n, h = map(int, input().split())\r\nheigh = list(map(int, input().split()))\r\nx = 0\r\nfor i in heigh:\r\n if i > h:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)\r\n", "n,h=map(int,input().split())\r\nc=0\r\nfor i in list(map(int,input().split())):\r\n if i <= h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "m=input().split()\r\nn=input().split()\r\nb=int(m[1])\r\nx=0\r\nfor i in n:\r\n if int(i)<=b:\r\n x+=1\r\n else:\r\n x+=2\r\nprint(x)", "def Vanya_Fence(height_of_fence , height_of_person):\r\n width = list()\r\n for i in height_of_person:\r\n if i > height_of_fence :\r\n width.append(2)\r\n else :\r\n width.append(1)\r\n return sum(width)\r\n\r\nif __name__ == \"__main__\":\r\n number_of_friends , height_of_fence= map(int , input().split())\r\n height_of_person = list(map(int , input().split()[:number_of_friends]))\r\n print(Vanya_Fence(height_of_fence , height_of_person))\r\n", "n, t = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ns=0\r\nfor i in range(len(A)):\r\n if A[i]>t :\r\n s+=2\r\n else :\r\n s+=1 \r\nprint(s)\r\n\r\n \r\n \r\n \r\n", "a, b, c = map(int, open(0).read().split())\r\nprint(a + sum(x > b for x in c))\r\n", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nheight = 0\r\n\r\n\r\nfor i in range(n):\r\n if a[i] <= h:\r\n height += 1\r\n else:\r\n height += 2\r\nprint(height)", "n,h=[int(x) for x in input().split()]\r\nnum=0\r\nfor i in input().split():\r\n if int(i) > h:\r\n num+=2\r\n else:\r\n num+=1\r\nprint(num)\r\n\r\n\r\n", "arr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\ncount=0\r\nfor i in range (0,len(arr2)):\r\n if arr2[i]<=arr1[1]:\r\n count=count+1\r\n else:\r\n count=count+2\r\nprint (count)", "n, h = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\n\nw = 0\nfor i in range(n):\n if a[i] > h:\n wi = 2\n else:\n wi = 1\n w += wi\nprint(w)\n", "n, wall = map(int, input().split())\r\nprint(sum([2 if _ > wall else 1 for _ in map(int, input().split())]))", "n, h = [int(i) for i in input().split()]\r\nsampl = [int(s) for s in input().split()]\r\ncunt = 0\r\nfor i_th in sampl:\r\n if i_th <= h:\r\n cunt+=1\r\n else:\r\n cunt+=2\r\nprint(cunt)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(len(a)):\r\n if a[i]<=h:\r\n res+=1\r\n else:res+=2\r\nprint(res)", "#n= no.of frnds, t = height of wall\r\nn, t = map(int, input().split())\r\na=list(map(int,input().split()))\r\ncounter=0\r\nfor i in a:\r\n if i>t:\r\n counter+=2\r\n else:\r\n counter+=1\r\nprint(counter)\r\n\r\n\r\n", "# Решение задач проекта CODEFORSES, Задача 41A\r\n#\r\n# (C) 2021 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Ваня и забор\r\nограничение по времени на тест1 секунда\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nВаня с друзьями идёт по запрещенной территории возле забора высотой h. Чтобы охранник их не заметил,\r\nвысота каждого из друзей не должна превышать h. При этом каждый из них может пригнуться, тогда его \r\nточно не будет видно охраннику. Высота i-го из друзей равняется ai.\r\n\r\nБудем считать, что ширина человека, идущего в полный рост, равна 1, а согнутого — 2. Друзья хотят идти\r\nпо дороге в один ряд, чтобы иметь возможность разговаривать друг с другом. Какой минимальной ширины\r\nдолжна быть дорога, чтобы все они поместились на ней в один ряд и охранник никого не увидел?\r\n\r\nВходные данные\r\nВ первой строке входных данных записаны два целых числа n и h (1 ≤ n ≤ 1000, 1 ≤ h ≤ 1000) — количество \r\nдрузей и высота забора соответственно.\r\n\r\nВо второй строке записаны n целых чисел ai (1 ≤ ai ≤ 2h), i-е из которых равняется высоте i-го друга.\r\n\r\nВыходные данные\r\nВыведите единственное целое число — минимальную подходящую ширину дороги.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import \r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=[int(i) for i in input().split()]\r\na2=[int(i) for i in input().split()]\r\nd=0\r\nfor q in a2:\r\n if q > a1[1]:d=d+1\r\n d=d+1\r\nprint(d)\r\n\r\n#print(ANS,' TIME:',datetime.now() - start_time) ", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i] <= h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "x, y = map(int, input().split())\r\nfriends=list(map(int, input().split()))\r\nfor i in friends:\r\n if i > y:\r\n x += 1 \r\nprint(x)", "n, h = map(int, input().split())\nA = map(int, input().split())\nres = 0\n\nfor a in A:\n res += 1 + (a > h)\n\nprint(res)\n\n", "n=input().split()\r\nh=int(n[1]);n=int(n[0])\r\ns=0\r\na=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\n if a[i]<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)\r\n ", "n, h = map(int, input().split()) # Number of friends and fence height\r\nheights = list(map(int, input().split())) # Heights of each friend\r\n\r\nwidth = 0\r\nfor height in heights:\r\n if height <= h:\r\n width += 1 # Friend can walk with width 1\r\n else:\r\n width += 2 # Friend needs to bend down, width becomes 2\r\n\r\nprint(width)", "a,b=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(k)):\r\n\tif(k[i]>b):\r\n\t\tc+=2\r\n\telse:\r\n\t\tc+=1\r\nprint(c)", "# Read the input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width of the road\r\nwidth = 0\r\n\r\n# Iterate through the friends' heights\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs to bend down\r\n else:\r\n width += 1 # Friend can walk in a single row\r\n\r\n# Print the minimum width of the road\r\nprint(width)\r\n", "inp=list(map(int,input().split()))\r\nn,h=inp[0],inp[1]\r\nheights=list(map(int,input().split()))\r\nans=0\r\nfor i in heights:\r\n if i-h>0:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans) \r\n \r\n ", "n=input().split()\r\nh=input().split()\r\nw=0\r\nx=n[0]\r\ny=n[1]\r\nfor i in range(len(h)):\r\n if int(h[i])>int(y):\r\n w=w+2\r\n else:\r\n w=w+1\r\nprint(int(w))", "n,h = map(int,input().split())\r\nht = list(map(int,input().split()))\r\nres= 0\r\nfor p in ht:\r\n if p > h:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "n, k = map(int, input().split())\r\nh = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n for c in h:\r\n if c > k:\r\n count += 2\r\n elif c <= k:\r\n count += 1\r\n\r\nprint(count)", "def width(n, h, guys_w):\r\n counter = 0\r\n w = 0\r\n while counter < n:\r\n if int(guys_w[counter]) <= h:\r\n w = w + 1\r\n else:\r\n w = w + 2\r\n\r\n counter = counter + 1\r\n return w\r\n\r\nn_h = input().split()\r\n\r\nn = int(n_h[0])\r\nh = int(n_h[1])\r\n\r\nhomies_width = input().split()\r\n\r\nprint(width(n, h, homies_width))", "n,h=map(int,input().split())\r\ncount=0\r\nlst=list(map(int,input().split()))\r\nfor i in range(n): \r\n if lst[i]>h:\r\n count+=2\r\n elif lst[i]<=h:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n", "n,h=map(int,input().split())\r\nx=list(map(int,input().split()))[:n]\r\na=0\r\nfor i in range(n):\r\n if x[i]<=h:\r\n a=a+1 \r\n else:\r\n a=a+2\r\n \r\nprint(a) ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nl=[]\r\nfor i in range(len(a)):\r\n if a[i]>h:\r\n c+=2\r\n l.append(a[i])\r\n else:\r\n c+=1\r\nprint(c)\r\n \r\n\r\n\r\n", "n, h = (int(x) for x in input().split())\r\nheights = [int(x) for x in input().split()]\r\nwidth = 0\r\nfor height in heights:\r\n width += (1, 2)[height > h]\r\nprint(width)\r\n", "n, h = [int(el) for el in input().split()]\r\na = [int(el) for el in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "n , h = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if a[i] <= h: ans += 1\r\n else: ans += 2\r\nprint(ans)\r\n", "n,h = map(int, input().split())\r\nn1 = list(map(int, input().split()))\r\nc = n\r\n\r\nfor i in n1:\r\n if i > h:\r\n c += 1\r\nprint(c)", "\r\nh ,a = map(int , input().split())\r\nm = list(map(int , input().split()))\r\nres = 0\r\nfor k in range(h):\r\n\r\n if m[k] > a:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "inputData = input()\r\npersons = input()\r\nhieghts = persons.split(\" \")\r\nnumber , hieght = inputData.split(\" \")\r\noutput = 0\r\nfor i in range (int(number)):\r\n if int(hieghts[i]) > int(hieght) :\r\n output = output +2 \r\n else:\r\n output = output +1\r\nprint(output)", "import sys\r\n\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nn = numbers[0]\r\nh = numbers[1]\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nwidth_total = 0\r\n\r\nfor i in a:\r\n if i > h:\r\n width_total += 2\r\n else:\r\n width_total += 1\r\n\r\nprint(width_total)\r\n", "testcases = input()\r\nres = int(testcases[testcases.find(\" \") + 1:])\r\n \r\narr = []\r\n \r\ns = input()\r\nj = 0\r\n \r\nwhile j != -1:\r\n pos = s.find(\" \")\r\n if pos == -1:\r\n arr.append(int(s))\r\n else:\r\n arr.append(int(s[:pos]))\r\n s = s[pos+1:]\r\n j = pos\r\n \r\nans = 0\r\nfor e in arr:\r\n if e <= res: ans = ans + 1\r\n else: ans = ans + 2\r\n \r\nprint(ans)", "n,h=map(int,input().split())\r\nt=map(int,input().split())\r\np=0\r\nfor i in t :\r\n if i > h :\r\n p+=2\r\n else :\r\n p+=1\r\nprint(p)\r\n\r\n \r\n", "n1=(input())\r\nn1=n1.split()\r\nn2=(input())\r\nn2 = list(map(int, n2.split()))\r\nc=0\r\nfor i in n2:\r\n if i<=int(n1[1]):\r\n c+=1\r\n else :\r\n c+=2\r\nprint(c)", "l1 = [int(i) for i in input().split()]\r\nn = l1[0]\r\nh = l1[1]\r\nl2 = [int(i) for i in input().split()]\r\n\r\nr = 0\r\n\r\nfor j in range(n):\r\n if l2[j] <= h:\r\n r += 1\r\n else:\r\n r += 2\r\n\r\n\r\nprint(r)\r\n", "lst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in lst2:\r\n if i <= lst1[1]:\r\n count1 += 1\r\n elif i > lst1[1]:\r\n count2 += 2\r\nprint(count1 + count2)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n if a[i]>h:\r\n sum += 2\r\n else:\r\n sum += 1\r\n\r\nprint(sum)", "n, h = map(int, input().split())\r\na = map(int, input().split())\r\nresult = sum(1 if i <= h else 2 for i in a)\r\nprint(result)", "n, h = map(int, input().split())\r\nc = 0\r\nl = input().split()\r\nfor i in l:\r\n if int(i) > h:\r\n c += 1\r\nprint(n + c)", "a, b = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(len(x)):\r\n if x[i] > b:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, h = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nwidth = 0\r\n\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "n,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\nw=0\r\nfor i in l:\r\n if i<=k:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(1 if row <= h else 2 for row in a))", "_,h=map(int,input().split())\r\na = map(int,input().split())\r\ns=0\r\nfor i in a:\r\n if i >h:\r\n s +=2\r\n else:\r\n s +=1\r\nprint(s)", "people,fence=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nwidth=0\r\nfor x in range(len(height)):\r\n if height[x]<=fence:\r\n width=width+1\r\n if height[x]>fence:\r\n width=width+2\r\nprint(width)", "n, h = list( map( int, input().split() ) )\r\nheights = map( int, input().split() ) \r\n\r\nwidth = sum( 2 if height > h else 1 for height in heights )\r\n\r\nprint(width)", "\r\nimport math\r\nx,y=map(int,input().split())\r\nsum=0\r\nakrem=list(map(int,input().split()))\r\nfor i in akrem:\r\n if i<=y:\r\n sum+=1 \r\n else:\r\n ab=math.ceil(i/y)\r\n sum+=ab\r\n \r\nprint(sum) ", "n,k=input().split()\r\nsum=0\r\nn=int(n)\r\nk=int(k)\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if(i>k):\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = 0\r\nw = 0\r\nfor i in range(0, n):\r\n if a[b] > h:\r\n w = w + 2\r\n b = b + 1\r\n else:\r\n w = w + 1\r\n b = b + 1\r\nprint(w)", "n,h = map(int,(input().split()))\r\nbend = 0\r\nnum = list(map(int,input().split()))\r\nfor i in range(n):\r\n if num[i]>h:\r\n bend += 2\r\n else:\r\n bend += 1\r\nprint(bend)", "n,h=map(int,input().split( ))\r\na=list(map(int,input().split( )))\r\nt=0\r\nfor i in range(0,n):\r\n if(a[i]>h):\r\n t+=1 \r\n t+=1 \r\nprint(t)", "c = 0\nn = [int(i) for i in input().split()]\ns = [int(i) for i in input().split()]\nfor i in s:\n if i <= n[1]:\n c += 1\n else:\n c += 2\nprint(c)", "number, height=map(int, input().split())\ninfo=list(map(int, input().split()))\nwidth = 0\nfor i in range(number):\n if info[i]>height:\n width= width + 2\n else:\n width+=1\nprint(width)", "q,e=map(int,input().split())\r\nw=list(input().split())\r\nh=0\r\nfor i in range (q):\r\n if int(w[i])>e:\r\n h=h+2\r\n else:\r\n h=h+1\r\nprint(h)\r\n", "n,h = [int(x) for x in input().split()]\r\nfriends = [int(x) for x in input().split()]\r\nwidth = 0\r\n\r\nfor friend in friends:\r\n if(friend>h):\r\n width+=2\r\n else:\r\n width+=1\r\n\r\nprint(width)", "x = input(\"\").split(\" \")\r\nn = int(x[0])\r\nh = int(x[1])\r\np = input(\"\").split(\" \")\r\nw = 0\r\nfor i in p:\r\n if int(i)> h:\r\n w = w + 2\r\n else:\r\n w = w + 1\r\nprint(w)", "n, h = list(map(int, input().split(\" \")))\nf = list(map(int, input().split(\" \")))\n\nw = 0\nfor i in f:\n if i > h:\n w+=2\n else:\n w+=1\nprint(w)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in l:\r\n if i > h:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "n,k=map(int,input().split())\r\ns=input()\r\ns1=s.split()\r\nl=[int(value) for value in s1]\r\n\r\na=0\r\nfor i in l:\r\n if i <=k:\r\n a+=1 \r\n else:\r\n a+=2\r\n \r\nprint(a)\r\n \r\n ", "c=0\r\nn,num=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>num:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "result = \"\"\r\nn,h = input().split(\" \")\r\nfriends = input().split(\" \")\r\nwidth = 0\r\nfor friend in friends:\r\n if int(friend) > int(h):\r\n width += 2\r\n else:\r\n width += 1\r\nresult = width\r\nprint(f\"{result}\")", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor val in a:\r\n if val > h:\r\n count += 2\r\n else:\r\n count += 1 \r\nprint(count)\r\n", "m=input()\r\nl1=input()\r\n\r\nn=int(m.split()[0])\r\nh=int(m.split()[1])\r\ns=[int(t) for t in l1.split()]\r\nsum=0\r\nfor k in range (n):\r\n if s[k] > h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(x):\r\n if l[i]<=y:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "a,b=map(int,input().split())\r\nx=input().split()\r\ny=0\r\nfor i in x:\r\n if int(i)>b:\r\n \ty+=2\r\n else:\r\n \ty+=1\r\nprint(y)", "def f():\r\n n, h = map(int, input().split())\r\n l = sum([(1 if i <= h else 2) for i in list(map(int, input().split()))])\r\n return l\r\n\r\n\r\nprint(f())\r\n", "I =lambda : map(int,input().split())\r\n\r\nx,y=I()\r\nans=x\r\n\r\n\r\nlst= input().split()\r\nfor i in range(x):\r\n lst[i] = int(lst[i])\r\n\r\n\r\nfor i in lst:\r\n if i > y:\r\n ans += 1\r\nprint(ans)\r\n", "h, s = int(input().split()[-1]), 0\r\nfor i in map(int, input().split()):\r\n\ts += 1 if h >= i else 2\r\nprint(s)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n n=n+1\r\nprint(n)", "# Read input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width of the road\r\ntotal_width = 0\r\n\r\n# Iterate through each friend's height\r\nfor height in heights:\r\n if height > h:\r\n total_width += 2 # If height is greater than h, width is 2\r\n else:\r\n total_width += 1 # Otherwise, width is 1\r\n\r\n# Print the total width\r\nprint(total_width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nprint(n + len([1 for i in range(n) if a[i] > h]))", "inp1=input()\r\ninp2=input()\r\na=inp1.split(\" \")\r\nb=inp2.split(\" \")\r\ncount=0\r\nfor i in b:\r\n if int(i)>int(a[1]):\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "def code(args):\r\n arr = args[-1]\r\n\r\n result = 0\r\n for i in arr:\r\n if i <= args[1]:\r\n result += 1\r\n else:\r\n result += 2\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n, h = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n result = code(n, h, arr) # Pass arguments\r\n print(result)\r\n\r\n", "\nn,h=input().split()\nn=int(n)\nh=int(h)\nsum=0;\n\na=input().split()\nfor i in range (n):\n if(int(a[i])>h):\n sum+=2;\n else:\n sum+=1;\n\n\n\n\n\nprint(sum)\n\n\t \t \t \t\t \t\t\t\t\t\t\t \t \t", "n, h = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n res = res + 2\r\n else:\r\n res = res + 1\r\n\r\nprint(res)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=t=0;\r\nfor i in a:\r\n if i>h:\r\n z+=2;\r\n else:\r\n z+=1;\r\nprint(z);\r\n", "# Read the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width\r\ntotal_width = 0\r\n\r\n# Iterate through each friend's height\r\nfor height in heights:\r\n # If the friend's height is greater than h, they need to bend (width 2)\r\n if height > h:\r\n total_width += 2\r\n else:\r\n total_width += 1\r\n\r\n# Print the total minimum width\r\nprint(total_width)\r\n", "person, fence = map( int, input().split() )\r\nheight = list(map( int, input().split() ))\r\n\r\nans = 0\r\nfor i in range( person ):\r\n if height[i] > fence:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n,h=map(int,input().split())\r\na = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in a :\r\n if i > h :\r\n counter += 2\r\n else :\r\n counter +=1\r\n\r\nprint(counter)", "a=str(input())\r\ng=str(input())\r\nb=a.split()\r\nc=b[0]\r\nd=b[1]\r\ne=g.split()\r\nf=0\r\nfor i in range(0,int(c)):\r\n if int(e[i])>int(d):\r\n f=f+2\r\n else:\r\n f=f+1\r\nprint(f)\r\n \r\n \r\n\r\n", "info=input().split()\r\nr=int(info[0])\r\ns=int(info[-1])\r\nv=0\r\nq=input().split()\r\nfor f in range(r):\r\n if int(q[f])>s:\r\n v+=2\r\n else:\r\n v+=1\r\nprint(v)", "n = input().split()\r\na = input().split()\r\nMP=0\r\nfor i in range(0,int(n[0])):\r\n if int(a[i]) > int(n[1]) :\r\n MP+=2\r\n else:\r\n MP+=1\r\n\r\nprint(MP)", "a , n = input().split()\r\na = int(a)\r\nn = int(n)\r\nx=0\r\ns=[int(i)for i in input().split()]\r\nfor i in range (a):\r\n if s[i]>n:\r\n x=x+2\r\n else:\r\n x=x+1\r\nprint(x)\r\n\t", "n,h=input().split()\nprint(sum(list(map(lambda x:2 if int(x)>int(h) else 1,input().split()))))\n\n ", "n, h = map(int, input().split())\na = list(map(int, input().split()))\nwidth = []\nfor i in range(len(a)):\n if a[i] <= h:\n width.append(1)\n else:\n width.append(2)\nprint(sum(width))\n", "n,h = map(int, input().split())\nresult = 0\nfor f in map(int, input().split()): result += 2 if f > h else 1 \nprint(result)", "n,h = map(int,input().split())\r\nnum = list(map(int,input().split()))\r\nans = len(num)\r\nfor x in num:\r\n if x > h:\r\n ans += 1\r\nprint(ans)", "if __name__ == \"__main__\":\r\n n, h = [int(x) for x in input().split(\" \")]\r\n\r\n width = n\r\n\r\n friends = [int(x) for x in input().split(\" \")]\r\n\r\n for friendHeight in friends:\r\n if(friendHeight > h):\r\n width += 1\r\n else:\r\n continue\r\n print(width)\r\n ", "n,h =(map(int,input().split()))\r\nwidth =0\r\narr =list(map(int,input().split()))\r\nfor i in arr :\r\n if i<= h :\r\n width+=1\r\n else :\r\n width+=2\r\n \r\nprint(width)", "arr = [int(i) for i in input().split()]\r\narr1 = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in arr1:\r\n if i>arr[1]:\r\n count += 2\r\n else: \r\n count += 1\r\nprint(count)", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\ncount = 0\r\nfor i in range (n):\r\n\tif a[i]>h:\r\n\t\tcount +=2\r\n\telse:\r\n\t\tcount +=1\r\nprint (count)", "n, h=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nk=0\r\nfor i in range(n):\r\n if l[i]<=h:\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "_, h = list(map(int, input().split(' ')))\np = list(map(int, input().split(' ')))\nprint(sum(2 if i > h else 1 for i in p))\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nmin_width = sum(1 if height <= h else 2 for height in heights)\r\nprint(min_width)", "n,h = map(int, input().split())\nheights = input().split()\nwidth = 0\nfor i in range(n):\n if int(heights[i]) > h: width += 2\n else: width += 1\nprint(width)", "n,h=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nw = 0\r\n\r\nfor i in range(n):\r\n if l[i]>h:\r\n w+=2\r\n else:\r\n w+=1 \r\n\r\nprint(w)", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = 0\r\nfor i in range(len(b)):\r\n if b[i] > a[1]:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nk = 0\r\nfor i in c:\r\n if i <= b:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)", "def width(h, friends):\r\n \r\n width = 0\r\n for i in range(len(friends)):\r\n if friends[i] <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n \r\n return width\r\n\r\nif __name__ == '__main__':\r\n nh = input()\r\n# nh = '3 7'\r\n nh = nh.split()\r\n n = int(nh[0])\r\n h = int(nh[1])\r\n \r\n fri = input()\r\n# fri = '4 5 14'\r\n fri = fri.split()\r\n \r\n \r\n \r\n friends = []\r\n for i in range(n):\r\n friends.append(int(fri[i]))\r\n \r\n print(width(h, friends))", "n,h = map(int,input().split())\r\ntrash = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if trash[i]<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h = map(int, input().split())\r\nlist = input().split()\r\nw = 0\r\nfor _ in range(len(list)):\r\n if int(list[_]) > h:\r\n w += 2\r\n elif int(list[_]) <= h:\r\n w += 1\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = len(arr)\r\nfor i in range(len(arr)):\r\n if arr[i] > h:\r\n c += 1\r\nprint(c)", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n n, h = map(int, input().split())\r\n li = list(map(int, input().split()))\r\n ans = 0\r\n for x in li:\r\n if x>h:\r\n ans += 1\r\n ans+=1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "n, h = map(int, input().split())\r\nlist1 = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in list1:\r\n if i>h:\r\n counter+=2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n\r\n", "# 677A - Vanya And Fence\r\n# https://codeforces.com/problemset/problem/677/A\r\n\r\n# Inputs:\r\n# 1) Número de amigos\r\n# 2) Altura de la valla\r\namigos, altura_valla = map(int, input().split())\r\n\r\n# Largo de la fila a crear para recorrer la valla sin ser visto\r\nlargo_fila = 0\r\n\r\n# Altura de cada uno de los amigos\r\naltura_amigo = list(map(int, input().split()))\r\n\r\n# Si el amigo mide más que la valla, entonces suma +2 al ancho de la fila, de lo contrario, suma +1\r\nfor altura_amigo_actual in altura_amigo:\r\n if altura_amigo_actual / altura_valla > 1.0:\r\n largo_fila += 2\r\n else:\r\n largo_fila += 1\r\n\r\n# Imprime el largo final de la fila\r\nprint(largo_fila)", "x,y=map(int,input().split())\r\nsum=0\r\nnum=map(int,input().split())\r\nfor i in num:\r\n \r\n if i>y:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)\r\n\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nsum=0;\na=input().split()\nfor i in range(n):\n if (int(a[i])>h):\n sum+=2;\n else:\n sum+=1;\nprint(sum)\n\t\t \t \t\t\t\t\t\t\t\t \t\t \t \t", "n,h = map(int,input().split())\r\nli =list(map(int,input().split()))\r\nc=0\r\nfor i in li:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c) ", "n,h = map(int,input().split())\nheights = input().split()\nwidth = 0\nfor i in heights:\n if int(i) > h:\n width += 2\n else:\n width += 1\nprint(width)\n ", "n, h = input().split(' ')\r\n\r\nn = int(n)\r\nh = int(h)\r\n\r\nrow = input().split(' ')\r\n\r\nres = 0\r\nfor x in row:\r\n if int(x) > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nfor i in c:\r\n a += (i > b)\r\nprint(a)", "n, h = map(int, input().split())\r\nppl = [int(x) for x in input().split()]\r\n\r\nwidth = n\r\nfor var in ppl:\r\n if var > h:\r\n width += 1\r\n \r\nprint(width)", "n, h = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nw = n\r\nfor i in li:\r\n if i > h:\r\n w+=1\r\n\r\n\r\nprint(w)\r\n\r\n", "friends_w = 0\r\n\r\nn, h = map(int, input().split())\r\nfriends_h = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if friends_h[i] > h:\r\n friends_w += 2\r\n else:\r\n friends_w += 1\r\n\r\nprint(friends_w)", "n, h = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\n\r\nmin_width = 0\r\n\r\nfor ha in a:\r\n min_width += 2 if ha > h else 1\r\n\r\nprint(min_width)", "nh=input().split(\" \")\r\nn=int(nh[0])\r\nh=int(nh[1])\r\n\r\ntotal=0\r\nheights=input()\r\n\r\nfor i in range(n):\r\n num=heights.split(\" \")\r\n num=int(num[i])\r\n \r\n if num<=h:\r\n total=total+1\r\n else:\r\n total=total+2\r\nprint(total)\r\n", "\nn, h = input().split()\nn = int(n)\nh = int(h)\nx = [int(i) for i in input().split()]\ny = 0\nfor i in range(n):\n if x[i] <= h:\n y = y + 1\n else:\n y = y + 2\nprint(y)\n\t \t\t \t \t\t \t \t \t \t\t \t \t \t\t\t", "n, h = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nsol = 0\r\nfor i in range(n):\r\n if v[i] > h:\r\n sol += 2\r\n else:\r\n sol += 1\r\nprint(sol)\r\n", "n1 = list(map(int,input().split()))\nn = list(map(int,input().split()))\ncount = 0\nfor i in n:\n if i>n1[1]:\n count +=2\n else:\n count+=1\nprint(count)", "f, h = input().split()\r\nfh = input().split()\r\nw = 0\r\nf = int(f)\r\nh = int(h)\r\nfor i in range(f):\r\n\tif int(fh[i]) > h:\r\n\t\tw = w + 2\r\n\telse:\r\n\t\tw = w + 1\r\nprint(w)\r\n", "n,h=map(int,input().split())\r\nls=[]\r\na=list(map(int,input().split()))\r\n#ls.append(a)\r\nc=0\r\n#print(a)\r\nfor i in a:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,h=map(int,input().split())\r\nh1=list(map(int,input().split()))\r\nw=0\r\nfor i in h1:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n,h=input().split()\r\nn,h=int(n),int(h)\r\n\r\nn_list=[int(x) for x in input().split()]\r\ncount=0\r\n\r\nfor i in n_list:\r\n if i>h:\r\n count+=1\r\n\r\nprint(count+n)", "n, h = map(int,input().split())\r\npers = list(map(int, input().split()))\r\nwidth = 0\r\nfor i in pers:\r\n if i <= h:\r\n width += 1\r\n else:\r\n width += 2\r\nprint(width)", "\r\nn,h=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nwidth=0\r\nfor i in range(n):\r\n if(b[i]<=h):\r\n width+=1\r\n else:\r\n width+=2\r\n \r\nprint(width)\r\n", "# this is really ugly, apologies in advance\r\n\r\nx = input().split(' ')\r\n\r\nn = int(x[0])\r\nh = int(x[1])\r\n\r\npeopleHeights = input().split(' ')\r\n\r\npeopleHeights = map(int, peopleHeights)\r\n \r\nwidths = []\r\n\r\nfor y in peopleHeights:\r\n if y > h: \r\n widths.append(2)\r\n else: \r\n widths.append(1)\r\n\r\nsum = 0\r\nfor width in widths:\r\n sum += width\r\n\r\nprint(sum)", "n, b = map(int, input().split())\nl = list(map(int, input().split()))\ni = 0\nfor x in l:\n if x > b:\n i += 2\n else:i += 1\nprint(i)\n \t \t\t \t \t \t\t \t \t\t \t\t\t\t \t\t\t\t", "n,h=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nj=0\r\nfor pos in m:\r\n if pos>h:\r\n j=j+2\r\n else:\r\n j=j+1\r\nprint(j)\r\n \r\n \r\n ", "line1 = input().split(' ')\r\nline2 = input().split(' ')\r\nheigh = int(line1[1])\r\nwidth = 0\r\nt = int(line1[0])\r\nfor i in range(len(line2)):\r\n if int(line2[i]) > heigh:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Jul 25 09:06:27 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nnh = input().split()\r\nn = int(nh[0])\r\nh = int(nh[1])\r\n\r\na = input().split()\r\nx = 0\r\n\r\nfor i in range(n):\r\n if int(a[i]) > h:\r\n x += 2\r\n else:\r\n x += 1\r\n\r\nprint(x)", "n,k=map(int,input().split())\r\na=0\r\nl1=list(map(int,input().split()))\r\nfor i in l1:\r\n if i>k:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)", "n = input().split(\" \")\r\no = input().split(\" \")\r\nw = 0\r\nfor i in o:\r\n if int(i) > int(n[1]):\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)", "n, h = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in a:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = input().split()\r\nn, h = int(n), int(h)\r\nk = input().split()\r\nt = 0\r\nfor i in range(n):\r\n if int(k[i]) <= h:\r\n t += 1\r\n else:\r\n t += 2\r\nprint(t)", "n, h = map(int, input().split())\n\nlist = list(map(int, input().split()))\n\nroad_width = 0\n\nfor i in list :\n if i <= h :\n road_width+=1\n else :\n road_width+=2\n\nprint(road_width)\n\n\n\n\n\n\n\n\n \t \t\t\t \t\t\t\t \t \t \t\t\t\t\t\t \t\t", "count = 0\r\nfriends, fenceHeight = line1 = list(map(int,input().split(\" \")))\r\nheights = list(map(int,input().split(\" \")))\r\nfor i in heights: \r\n if i > fenceHeight: \r\n count +=2\r\n else: count +=1\r\nprint(count)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 0\r\nfor i in range(n):\r\n l += 2 if a[i] > h else 1\r\nprint(l)", "# n = int(input(\"Введите количество детей: \"))\r\n# h = int(input(\"Введите высоту забора: \"))\r\nn,h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nheights = list(map(int, input().split()))\r\ncounter = 0\r\nfor height in heights:\r\n if height > h:\r\n counter += 2\r\n else:\r\n counter += 1\r\nprint(counter)\r\n", "n, h = map(int,input().split())\r\nfriends = list(map(int,input().split()))\r\nans = 0\r\nfor each in friends:\r\n if each>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "import sys\r\ndata = []\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n data.append(numbers)\r\n\r\nnumber_of_friends = data[0][0]\r\nheight_of_fence = data[0][1]\r\n\r\nwidth = 0\r\n\r\nfor friend in range(number_of_friends):\r\n if data[1][friend] <= height_of_fence:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)\r\n", "n,h=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nres=0\r\n\r\nfor x in l:\r\n if x>h:\r\n res+=2\r\n else:\r\n res+=1\r\nprint(res)", "n,h=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nl=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "list = input().split(\" \")\r\nheightList = input().split(\" \")\r\nlen = int(list[0])\r\nwidth = 0\r\nfenceheight = int(list[1])\r\nfor i in range(len):\r\n if int(heightList[i]) <= fenceheight:\r\n width += 1\r\n elif int(heightList[i]) > fenceheight:\r\n width += 2\r\nprint(width)\r\n", "x,y=map(int, input().split())\r\nz=list(map(int, input().split()))\r\nc=0\r\nfor i in z:\r\n if i<=y:\r\n c+=1\r\n elif i>y:\r\n c+=2\r\nprint(c) \r\n ", "import math\r\na,b = map(int , input().split(' '))\r\nc = input().split(' ')\r\nj = 0\r\nfor i in c:\r\n\tif (int(i) >= b):\r\n\t\tj += math.ceil(int(i)/b)\r\n\telse:\r\n\t\tj += 1\r\nprint (j)\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nx=a.split()\nm=0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i]>h:\n m+=2\n else:\n m+=1\nprint(m)\n \t \t \t\t\t\t \t\t\t\t\t\t\t\t \t \t", "n,h = list(map(int,input().split()))\r\nstr = list(map(int,input().split()))\r\nwidth = 0\r\nfor num in str:\r\n if num > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=0\r\nfor i in a:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "def minimum_width():\r\n n, h = map(int, input().strip().split())\r\n friends = list(map(int, input().strip().split()))\r\n width = 0\r\n for friend in friends:\r\n if friend > h:\r\n width += 2\r\n else:\r\n width += 1\r\n print(width)\r\n\r\nminimum_width()", "n,w=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nans=0\r\nfor i in a:\r\n if i>w:\r\n ans+=2\r\n else:\r\n ans+=1 \r\nprint(ans)\r\n ", "n,h=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nc=0\r\nfor i in (nums):\r\n if i>h:\r\n c+=i//h\r\n if i%h!=0:\r\n c+=1\r\n else:\r\n c+=1\r\nprint(c)\r\n ", "a,b=map(int,input().split())\r\nk=[int(x) for x in input().split()]\r\nw=0\r\nfor i in range(a):\r\n if k[i]<=b:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n, h = map(int, input().split())\r\n\r\ns = list(map(int, input().split()))\r\n\r\ncol = 0\r\n\r\nfor i in range(n):\r\n if s[i] > h:\r\n col += 2\r\n else:\r\n col += 1\r\nprint(col)", "n=input().split()\r\nn2=input().split()\r\nw=0\r\nfor i in n2:\r\n if int(i) <= int(n[1]):\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\nprint(width)", "n, h = map(int, input().split())\r\nprint(sum([1 if x <= h else 2 for x in list(map(int, input().split()))]))\r\n", "n, h = input().split(\" \")\r\na = input().split(\" \")\r\nif(n != \"0\"):\r\n\tfor i in a:\r\n\t\tif(int(i) > int(h)):\r\n\t\t\tn = int(n) + 1\r\n\tprint(n)\r\nelse:\r\n\tprint(n)", "n=input().split()\r\nn2=input().split()\r\nw=0\r\nx=0\r\nwhile x < int(n[0]):\r\n if int(n2[x]) <= int(n[1]):\r\n w+=1\r\n else:\r\n w+=2\r\n x+=1\r\nprint(w)", "a,b=map(int,input().split())\r\nc=0\r\nd=0\r\ne=list(map(int,input().split()))\r\nfor i in range(a):\r\n if e[i]>b:\r\n d=d+2\r\n else:\r\n c=c+1\r\nprint(c+d)", "inputs1 = input().split()\r\nh = int(inputs1[1])\r\n\r\nheights = input().split()\r\nheights = [int(i) for i in heights]\r\n\r\nresult = 0\r\n\r\nfor i in heights:\r\n if i <= h:\r\n result += 1\r\n else:\r\n result += 2\r\n\r\nprint(result)", "a , n=input().split()\na=int(a)\nn=int(n)\ns=[int(i)for i in input().split()]\nx = 0\nfor i in range(a):\n if (s[i]>n):\n x=x+2\n else:\n x=x+1\nprint(x)\n\t \t\t\t\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t\t", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in range(n):\r\n if a[i] > h:\r\n c1+=2\r\n else:\r\n c2+=1\r\nprint(c1+c2)", "m,n,a=map(int,open(0).read().split());print(m+sum(m>n for m in a))", "n,m=input().split()\nn=int(n)\nm=int(m)\narr=[int(i)for i in input().split()]\nsum=0\nfor i in range(n):\n if arr[i]<=m:\n sum+=1\n else:\n sum+=2\nprint(sum)\n\t\t\t\t\t \t \t\t\t \t \t\t\t \t\t \t\t", "import sys\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\nimport time\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, h = inlt()\r\nl = inlt()\r\n\r\n\r\nprint(reduce(lambda r,e: r+(1 if e<=h else 2),l,0))\r\n", "a = list(map(int,input().split()))\r\ncount = 0\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(0, a[0]):\r\n if b[i] > a[1]:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)\r\n", "def solve():\r\n n,h = input().split()\r\n a = list(map(int,input().split()))\r\n width = 0\r\n for num in a:\r\n if num > int(h):\r\n width +=2\r\n else:\r\n width+=1\r\n return width\r\n\r\nprint(solve())\r\n", "a, b = [int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()]\r\nbend=0\r\nnotbend=0\r\nfor i in x:\r\n if i>b:\r\n bend=bend+2\r\n else:\r\n notbend=notbend+1\r\nprint(bend+notbend)\r\n ", "x, y = input().split(\" \")\r\ny = int(y)\r\nl = input().split(\" \")\r\nk = 0\r\nfor item in l:\r\n item = int(item)\r\n if item > y:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "sp=[int(i) for i in input().split()]\r\nn=sp[0]\r\nh=sp[1]\r\nsp=[int(i) for i in input().split()]\r\nwidth=0\r\nfor i in range(len(sp)):\r\n if sp[i]>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split(' '))\r\nx=input().split(\" \")\r\ncount=0\r\n\r\nfor i in range(0,n):\r\n if(int(x[i])>h):\r\n count+=2\r\n else:\r\n count+=1\r\n\r\nprint(count) \r\n", "chir, ris = map(int, input().split())\r\nvan = list(map(int, input().split()))\r\n \r\ngee = 0\r\nfor fvg in van:\r\n if fvg <= ris:\r\n gee += 1\r\n else:\r\n gee += 2\r\nprint(gee)\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nans=0\r\nfor i in range (n):\r\n if w[i]<=m:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint (ans)\r\n\"\"\"", "n, f_h = map(int, input().split())\nheights = map(int, input().split())\nprint(n + sum([h > f_h for h in heights]))", "n,h=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if x[i]<=h:\r\n count+=1\r\n elif x[i]>h:\r\n count+=2\r\nprint(count)", "a,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nc=0\r\nfor i in ar:\r\n if i <=b:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h = input ().split()\nn = int (n)\nh = int (h)\na = input ()\nx = a.split()\nc = 0\nfor i in range (n):\n x[i] = int (x[i])\n if x [i] > h:\n c += 2\n else:\n c += 1\nprint (c)\n \t \t\t \t\t \t \t\t \t\t \t \t\t\t \t", "l1 = input().split()\r\nl2 = input().split()\r\n\r\nfor i in range(len(l2)):\r\n if int(l2[i]) > int(l1[1]):\r\n l2[i] = 2\r\n elif int(l2[i]) <= int(l1[1]):\r\n l2[i] = 1\r\n\r\n\r\nprint(sum(l2))", "a,b = input().split()\na = int(a)\nb = int(b)\nf = input()\nx = f.split()\nz = 0\nfor i in range(a):\n x[i] = int(x[i])\n if x[i] <= b :\n z += 1\n elif x[i] > b:\n z += 2\nprint(z)\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t", "# n, m, a = list(map(int, input().split(\" \")))\r\n# h,v=0,0\r\n# if n%a==0:\r\n# h=int(n/a)\r\n# else:\r\n# h=int(n/a)+1\r\n# if m%a==0:\r\n# v=int(m/a)\r\n# else:\r\n# v=int(m/a)+1\r\n# print(hv)\r\n\r\n# a, b = map(int, input().split(\" \"))\r\n# print(ab//2)\r\n\r\nn, h = list(map(int, input().split(\" \")))\r\na=list(map(int, input().split(\" \")))\r\nans=0\r\nfor i in a:\r\n if i<=h:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)", "a,b=map(int,input().split())\r\ns=0\r\nh=list(map(int,input().split()))\r\nfor i in h:\r\n if i<=b:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "countFriends,height = map(int,input().split())\r\nlist = str(input())\r\nnewList = list.split(\" \")\r\nroad = 0\r\nfor i in range(countFriends):\r\n\r\n\r\n if height < int(newList[i]):\r\n\r\n road=road+2\r\n else:\r\n road=road+1\r\n\r\n\r\nprint(road)", "a,c=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nn=0\r\nfor i in range(a):\r\n if b[i]%c>0:\r\n n+=b[i]//c+1\r\n else:\r\n n+=b[i]//c\r\nprint(n)", "n,h = map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\ncount=0\r\nfor i in l:\r\n if i <=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)\r\n", "n, h = map(int, input().split(\" \"))\r\nl = list(map(int, input().split(\" \")))\r\n\r\nprint(len(l) + len([1 for b in l if b > h]))\r\n", "#Initializes friends (not needed), height of fence, and width of friends\r\nsituation = input().split(' ')\r\nheight = int(situation[1])\r\nwidth = 0\r\n\r\n#measures width of friend group\r\nfor friend in input().split(' '):\r\n if int(friend) > height:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\n#prints answer\r\nprint(width)", "m,n=map(int,input().split())\r\nk=list(map(int,input().split()))\r\ncount=0\r\nfor i in k:\r\n if i>n:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n = [int(x)for x in input().split(\" \")]\r\na = [int(y) for y in input().split(\" \")]\r\nb = 0\r\nfor i in range(0,len(a)):\r\n if a[i] <= n[1]:\r\n b += 1\r\n else:\r\n b += 2\r\nprint(b)", "a, b = map(int, input().split(\" \"))\r\narr = list(map(int, input().split(\" \")))\r\n\r\nres = 0\r\nfor i in arr:\r\n if i > b:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)\r\n ", "import sys\n\n\ndef solution(input_data: str):\n data = input_data.splitlines()\n n, wall = map(int, data[0].split())\n friends = map(int, data[1].split())\n road_width = 0\n for friend in friends:\n if friend > wall:\n road_width += 2\n else:\n road_width += 1\n return road_width\n\n\ndef test_solution():\n assert solution(\"\"\"3 7\n4 5 14\"\"\") == 4\n assert solution(\"\"\"6 1\n1 1 1 1 1 1\"\"\") == 6\n assert solution(\"\"\"6 5\n7 6 8 9 10 5\"\"\") == 11\n\n\nif __name__ == '__main__':\n print(solution(sys.stdin.read().strip()))\n", "a,b = map(int, input().split())\r\nall_friends = list(map(int, input().split()))\r\nsum = 0\r\nfor i in all_friends:\r\n if i > b:\r\n sum +=2\r\n else:\r\n sum +=1\r\nprint(sum)", "n, h = map(int, input().split())\nfriends = list(map(int, input().split()))\n\nw = 0\n\nfor kid in friends:\n if kid > h:\n w += 1\n\nprint(w+n)", "while True:\r\n try:\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n stand = 0\r\n band = 0\r\n for height in a:\r\n if height > h:\r\n band += 1\r\n else:\r\n stand += 1\r\n \r\n print(2 * band + stand)\r\n except EOFError:\r\n break\r\n", "n,h=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in lst:\r\n if(i>h):\r\n c+=1\r\nprint(n+c)", "n, h = map(int, input(). split())\r\nw = 0\r\nA = list(map(int, input(). split()))\r\nfor i in range(n):\r\n if A[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "kamrul,hasan,a=map(int,open(0).read().split());print(kamrul+sum(kamrul>hasan for kamrul in a))", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\ndef solve():\r\n n, h = linp()\r\n l = linp()\r\n for i in l:\r\n if i > h:\r\n n += 1\r\n print(n)\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst1 = []\r\nfor i in range(len(lst)):\r\n if lst[i]>b:\r\n lst1.append(2)\r\n else:\r\n lst1.append(1)\r\nprint(sum(lst1))", "# Input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate minimum width of the road\r\nwidth = sum(1 if height <= h else 2 for height in heights)\r\n\r\n# Output\r\nprint(width)", "n , h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nw = 0\r\nfor i in arr:\r\n if i> h: w+=2\r\n else: w+=1\r\n \r\nprint(w)\r\n \r\n", "n_h = input().split()\r\nn = int(n_h[0])\r\nh = int(n_h[1])\r\ntext_h = input()\r\nalturas = text_h.split()\r\nwidth = 0\r\nfor altura in alturas:\r\n if int(altura) > h:\r\n width = width + 2\r\n else:\r\n width = width + 1\r\nprint(width)\r\n", "NUMBER_OF_FRIENDS, FENCE_HEIGHT = map(int, input().split())\r\nPERSON_HEIGHTS_ARRAY = list(map(int, input().split()))\r\nMIN_ROAD_WIDTH = 0\r\nfor i in range(NUMBER_OF_FRIENDS):\r\n if (PERSON_HEIGHTS_ARRAY[i] > FENCE_HEIGHT):\r\n MIN_ROAD_WIDTH = MIN_ROAD_WIDTH+2\r\n else:\r\n MIN_ROAD_WIDTH = MIN_ROAD_WIDTH+1\r\nprint(MIN_ROAD_WIDTH)\r\n", "n, h = map(int, input().split()) # Number of friends and height of fence\r\nheights = list(map(int, input().split())) # List of heights of friends\r\n\r\nwidth = 0 # Initialize width of the road\r\n\r\nfor height in heights:\r\n if height > h: # If height is greater than fence height\r\n width += 2 # Add 2 to width for bending friend\r\n else:\r\n width += 1 # Add 1 to width for normal friend\r\n\r\nprint(width)\r\n", "no_of_children,h= input().split()\r\nno_of_children=int(no_of_children)\r\nh=int(h)\r\nqueue = [int(x) for x in input().split()[:no_of_children]]\r\n\r\n\r\ni=0\r\ncount=0\r\n#while i<(no_of_children):\r\n # queue = int(input()).split()\r\n\r\n\r\nfor i in range(len(queue)):\r\n if (queue[i] <= h):\r\n count += 1\r\n else:\r\n count += 2\r\n\r\n\r\n\r\n\r\nprint(count)", "# Read the number of friends and the fence height\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of each friend\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width to 0\r\nmin_width = 0\r\n\r\n# Iterate through the heights and calculate the width required\r\nfor height in heights:\r\n if height <= h:\r\n # If the friend's height is less than or equal to the fence height, they only need 1 unit of width\r\n min_width += 1\r\n else:\r\n # If the friend's height is greater than the fence height, they need 2 units of width\r\n min_width += 2\r\n\r\n# Print the minimum width of the road\r\nprint(min_width)\r\n", "def minimum_width(n,h,heights):\r\n total_width=0\r\n for height in heights:\r\n if height>h:\r\n total_width +=2\r\n else:\r\n total_width+=1\r\n return total_width\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nresult=minimum_width(n,h,heights)\r\nprint(result)", "n,h=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(n):\n if a[i]>h:\n sum=sum+2\n else:\n sum=sum+1\nprint(sum)\n\n\n\n\n\n\n\n \t \t \t\t \t\t \t\t \t\t\t \t \t\t \t", "z,x,a=map(int,open(0).read().split());print(z+sum(n>x for n in a))", "n,h=map(int,input().split())\r\nw=0\r\na=input().split()\r\nfor i in range(n):\r\n if int(a[i])>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "dano = [int(x) for x in input().split()]\r\nboys = [int(x) for x in input().split()]\r\nn = dano[0]\r\nh = dano[1]\r\nans = 0\r\nfor i in range(n):\r\n if boys[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "s = list(map(int, input().split()))\r\nn=s[0]\r\nh=s[1]\r\nw=0\r\nheights = list(map(int, input().split()))\r\nfor i in heights:\r\n if (i<=h):\r\n w=w+1\r\n else:\r\n w=w+2\r\nprint(w)\r\n ", "n,h = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in arr:\r\n if i>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "x = input()\r\nl = x.split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\ny = input()\r\nm = y.split()\r\ns = 0\r\nfor i in range(len(m)):\r\n if int(m[i]) > int(l[1]):\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)\r\n", "n, h = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in a:\r\n if i > h:\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)\r\n", "l=input().split()\r\nl=[int(x) for x in l]\r\nm=input().split()\r\nm=[int(x) for x in m]\r\nc=0\r\nfor i in m:\r\n if i>l[1]:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,h = map(int,input().split())\r\nA = input().split()\r\nfor i in range(n):\r\n A[i] = int(A[i])\r\nx = n\r\nfor i in range(n):\r\n if A[i] > h:\r\n x += 1\r\n else:\r\n pass\r\nprint(x)\r\n", "N,h=map(int,input().split())\r\nsb=list(map(int,input().split()))\r\nfor j in sb:\r\n if j>h:\r\n N=N+1\r\nprint(N)", "friend, high = map(int, input().split())\r\nrez = friend\r\nfrie = list(map(int,input().split()))\r\nfor i in range (0, friend):\r\n if (frie[i])> high:\r\n rez +=1\r\n\r\nprint (rez)", "# Input the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Input the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate the minimum width of the road\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\n\r\n# Output the result\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nn=0\r\nf=input().split()\r\nfor i in range(a):\r\n if int(f[i])>b:\r\n n+=2\r\n else:\r\n n+=1\r\n\r\nprint(n)", "n,h = map(int,input().split())\r\njudge_lst = list(map(int,input().split()))\r\nwidth = 0\r\nif int(len(judge_lst)) == n:\r\n for num in judge_lst:\r\n width = width + int((num-1)/h) + 1\r\nprint(width)", "no_friends, height_of_fence = list(map(int, input().strip().split()))\r\nheight_of_friends = list(map(int, input().strip().split()))\r\n\r\nroad_width = 0\r\nfor hof in height_of_friends:\r\n if hof > height_of_fence:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\nprint(road_width)\r\n", "def main():\n n, hFence = map(int, input().split())\n hFriends = list(map(int, input().strip().split()))\n width = 0\n\n for i in range(n):\n if(hFriends[i] <= hFence):\n width += 1\n else:\n width += 2\n print(width)\nif __name__ == '__main__':\n main()\n\n", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\ncounter =0 \r\nfriend=input()\r\nfriend_list=list(map(int , friend.split()))\r\nfor i in friend_list:\r\n if i >y :\r\n counter+=2\r\n else :\r\n counter += 1\r\nprint(counter)", "data = [int(i) for i in input().split()]\r\n\r\nnumber_of_people, fence_height = data[0], data[1]\r\n\r\nheights = [int(i) for i in input().split()]\r\nshorter_counter, taller_counter = 0, 0\r\n\r\nfor height in heights:\r\n\r\n if height > fence_height:\r\n\r\n taller_counter += 1\r\n\r\n else: shorter_counter += 1\r\n\r\n\r\nminimun_width = shorter_counter + 2taller_counter\r\nprint(minimun_width)", "friends, height = input().split()\r\nfriends, height, = int(friends),int(height)\r\npeople = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in people:\r\n if i>height:\r\n total +=1\r\n total+=1\r\nprint(total)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 10 14:33:43 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\nlis=list(input().split())\r\nfor i in lis:\r\n if int(i)>h:\r\n n+=1\r\nprint(n)", "l = list(int(x) for x in input().split())\r\nl1 = list(int(x) for x in input().split())\r\ns = 0\r\nfor i in l1:\r\n if i>l[1]:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "nh=input().split()\r\nn=int(nh[0])\r\nh=int(nh[1])\r\ns=0\r\nt=input().split()\r\nfor i in t:\r\n if int(i)>h:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=[1]a\r\nfor i in range(0,len(l)):\r\n if(l[i]>b):\r\n res[i]=2\r\n else:\r\n pass\r\nprint(sum(res))", "n, h = map(int,input().split())\r\nwidth = 0\r\nlist = input().split()\r\nfor i in range(n):\r\n if int(list[i]) > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "n,h=map(int,input(\"\").split()) \r\ns=list(map(int,input(\"\").split())) \r\nwidth_road=0 \r\nfor x in s: \r\n if x>h: \r\n width_road=width_road+2 \r\n else: \r\n width_road=width_road+1 \r\nprint(width_road)", "n,h = map(int,input().split())\r\nk = list(map(int,input().split()))\r\ns = 0\r\nfor i in (k):\r\n if i <=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n, h = [int(i) for i in input().split()]\r\nc = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n if i <= h:\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "a,h=map(int,input().split())\r\ns=0\r\nfor i in map(int,input().split()):\r\n if i<=h:\r\n s=s+1\r\nprint(2a-s)", "friends, height_fence = [int(f) for f in input().split()]\r\nfriends_height = list([int(f) for f in input().split()])\r\nwidth = 0\r\n\r\nfor friend in friends_height:\r\n if friend > height_fence:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "a, b = map(int,input().split())\r\nw = 0\r\nx = list(map(int,input().split()))\r\nfor i in range(a):\r\n if x[i] > b:\r\n w += 1\r\n w += 1\r\nprint(w)\r\n", "n, h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nans = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 1\r\n ans += 1\r\n\r\nprint(ans)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nb=a.split()\nz=0\nfor i in range(n):\n b[i]=int(b[i])\n if b[i]>h:\n z +=2\n else:\n z +=1\nprint(z)\n \t \t \t\t \t \t \t\t \t\t \t\t", "n, v = map(int, input().split())\r\nhs = list(map(int, input().split()))\r\n\r\nw = 0\r\n\r\nfor h in hs:\r\n if h > v:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "n, h = map(int,input().split())\r\nans = 0\r\ng = list(map(int,input().split()))\r\nfor i in g:\r\n if i > h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "n, h = input().split()\r\npeople = []\r\nsum = 0\r\npeople = [int(x) for x in input().split()]\r\nfor i in people:\r\n if i <= int(h):\r\n sum += 1\r\n else:\r\n sum += 2\r\nprint(sum)", "n,h=map(int,input().split())\r\na=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i>h:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)", "n,h=map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = n\r\nfor i in a:\r\n if i>h:\r\n ans +=1\r\nprint(ans)", "n, h = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ncount=0\r\nfor i in x:\r\n if i>h:count+=2\r\n else:count+=1\r\nprint(count)", "# https://codeforces.com/problemset/problem/677/A\r\n\r\nn, h = [int(e) for e in input().split()]\r\na = [int(e) for e in input().split()]\r\n\r\nc = 0\r\nfor e in a:\r\n if e > h:\r\n c += 2\r\n else:\r\n c += 1\r\nprint(c)\r\n", "p,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nw=0\r\nfor i in arr:\r\n if i <= h:\r\n w+=1\r\n else:\r\n w+=2\r\n \r\nprint(w)\r\n", "x,n1=input().split()\r\nn=int(n1)\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i<=n:\r\n c=c+1\r\n else:\r\n c=c+2\r\nprint(c)", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nc = 0\r\nfor height in heights:\r\n if height > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\n# Print the minimum road width\r\nprint(c)\r\n", "n, h = [int(x) for x in input().split(\" \")]\r\nl = [int(x) for x in input().split(\" \")]\r\n\r\nw = 0\r\n\r\nfor a in l:\r\n w += 1\r\n if a > h:\r\n w += 1\r\n\r\nprint(w)\r\n", "score=0\r\nn,h=map(int,input().split())\r\nheights = list(map(int, input().split()))\r\nfor i in heights:\r\n \r\n if i> h:\r\n score+=2\r\n else:\r\n score+=1\r\n\r\n\r\nprint(score)", "n,f=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in x:\r\n if i<=f:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "def fence(n,h,heights):\r\n total=0\r\n for height in heights:\r\n if h<height:\r\n total+=2\r\n else:\r\n total+=1\r\n return total\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nresults=fence(n,h,heights)\r\nprint(results)", "def inp():\r\n return int(input())\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\nl=inlt()\r\nn=l[0]\r\nh=l[1]\r\np=inlt()\r\nwidth=0\r\nfor i in range(n):\r\n if(p[i]>h):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width) ", "n, h = input().split()\nn = int(n)\nh = int(h)\nlist = [int(i) for i in input().split()]\nans = 0\nfor i in list:\n if i > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n\t\t\t\t\t \t \t \t\t \t\t \t \t \t\t\t", "n, h = map(int, input().split())\r\ncnt = 0\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if heights[i] > h:\r\n cnt += 2\r\n else:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "x,y = input().split()\r\nh = input().split()\r\ncount = 0\r\nfor i in h:\r\n if int(i) > int(y):\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "num = input().split(\" \")\nh = map(int, input().split(\" \"))\nsum = 0\nfor i in h:\n if i>int(num[1]):\n sum+=2\n else:\n sum+=1\nprint(sum)\n\n", " \r\nn, h = map(int, input().split()) # Read the number of friends and the height of the fence\r\nheights = list(map(int, input().split())) # Read the heights of the friends\r\n\r\nwidth = 0 # Initialize the minimum width of the road to 0\r\n\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # If the friend's height is greater than h, they need 2 units of width\r\n else:\r\n width += 1 # Otherwise, they need 1 unit of width\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n c+=2\r\n else:\r\n c+=1 \r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range (n):\r\n if a[i]>h:\r\n c+=1\r\nprint(c+n)\r\n", "import sys\r\n\r\nn, h = map(int, sys.stdin.readline().strip().split())\r\nheights = list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nres = 0\r\nfor height in heights:\r\n if height > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "n, h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nx=input().split()\r\nx=[int(i) for i in x]\r\nsum=0\r\nfor j in range(n):\r\n if x[j]>h:\r\n sum=sum+2\r\n else:\r\n sum=sum+1\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nw = 0\r\nfor x in a:\r\n if x > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nct = n\r\nstrange = list(map(int, input().split()))\r\nfor i in strange:\r\n if i > h:\r\n ct += 1\r\nprint(ct)\r\n\r\n\r\n\r\n\r\n\r\n", "# n,h = input().split()\n# n = int(n)\n# h = int(h)\n\nn, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\ncnt = 0\nfor a in arr: # 8 7 9 3\n if a > h:\n cnt += 2\n else:\n cnt += 1\n\nprint(cnt)\n\n \t \t\t \t\t\t \t\t\t \t\t\t\t \t", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ns = 0\r\n\r\nfor i in a:\r\n if i > n[1]:\r\n s += 2\r\n else:\r\n s += 1\r\n \r\nprint(s)", "input_values = list(map(int, input().split()))\r\nn = input_values[0]\r\nh = input_values[1]\r\nwidth = 0\r\nheights = list(map(int, input().split())) # Use a different variable name\r\nfor char in heights:\r\n if char > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor e in a:\r\n if e > h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\ns = [int(i) for i in input().split()]\r\nlen_c = 0\r\nfor i in range(len(s)):\r\n if s[i] > h:\r\n len_c +=2\r\n else:\r\n len_c +=1\r\n\r\nprint(len_c)", "x, m = map(int, input().split())\r\nh1 = list(map(int, input().split()))\r\nmin = 0\r\nfor height in h1:\r\n if height > m:\r\n min += 2 \r\n else:\r\n min += 1 \r\nprint(min)\r\n", "n, h = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\ncount = 0\r\nfor num in numbers:\r\n if num <= h:\r\n count += 1 \r\n else:\r\n count += 2\r\nprint(count)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 1\r\nwb = 2\r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] <= h:\r\n ans = ans + w\r\n elif a[i] > h:\r\n ans = ans + wb\r\n \r\nprint(ans)", "ct = 0 \r\nn,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n if(l[i]<=h):\r\n ct = ct + 1\r\n \r\n else:\r\n ct = ct + 2 \r\n \r\nprint(ct) ", "numbers = input().split(\" \")\r\nn = int(numbers[0])\r\nh = int(numbers[1])\r\nheights = [int(el) for el in input().split(\" \")]\r\nans = 0\r\nfor i in range(len(heights)):\r\n if heights[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "sf = list(map(int, input().split(' ')))\r\ns = list(map(int, input().split(' ')))\r\npoint = 0\r\nfor i in s:\r\n if i > sf[1]: point += 2\r\n else: point += 1\r\nprint(point)", "n , h = map(int,input().split())\r\ncount=0\r\nheights = list(map(int, input().split()))\r\n\r\nfor i in heights:\r\n if i <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "a=list(map(int,input().strip().split()))[:2]\r\nn=a[0]\r\nh=a[1]\r\nl=a=list(map(int,input().strip().split()))[:n]\r\nans=0\r\nfor i in l:\r\n if i>h:\r\n ans+=1\r\nprint(len(l)+ans)", "a,s=list(map(int,input().split()))\r\nr=0\r\nd=input()\r\nf=d.split()\r\nfor x in f:\r\n if(int(x)<=s):\r\n r+=1\r\n else:\r\n r+=2\r\nprint(r)", "x = input().split()\r\nh = int(x[1])\r\nn = int(x[0])\r\na = input().split()\r\nm = 0\r\n\r\nfor i in a :\r\n if int(i) > h :\r\n m += 2 \r\n else : \r\n m += 1\r\n \r\nprint(m) ", "n, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\n\ncnt = 0\n\nfor a in arr:\n if a > h:\n cnt += 2\n else:\n cnt += 1\n\nprint(cnt)\n \t \t\t\t \t\t \t\t \t\t \t\t \t\t \t\t\t", "a = input().split()\r\nfriends = input().split()\r\n\r\nf = int(a[0])\r\nh = int(a[1])\r\n\r\nfor x in range(len(friends)):\r\n if int(friends[x]) > h:\r\n f = f + 1\r\n\r\n\r\nprint(f)\r\n\r\n\r\n\r\n", "n, h = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nfor i in l:\r\n if i>h:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "n, h = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\nv = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n v += 2\r\n \r\n else:\r\n v += 1\r\n \r\n\r\nprint(v)", "n, h = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nfor i in arr:\r\n if i > h: counter += 1\r\n counter += 1\r\n\r\nprint(counter)", "n, h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nfor i in a:\r\n if i>h:\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nf=list(map(int,input().split()))\r\ncount=0\r\nfor i in f:\r\n if i>h:\r\n count+=2\r\n if(i==h or i<h):\r\n count+=1\r\nprint(count)\r\n", "size,a=map(int, input().split())\r\narr=list(map(int, input().split()))\r\ncount=0\r\nfor i in arr:\r\n if i>a:\r\n count+= 2\r\n else:\r\n count+= 1\r\nprint(count)\r\n", "n, h = map(int, input().split())\r\narr = [int(item) for item in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n if arr[i] // h == 0 or arr[i] == h:\r\n c = c + 1\r\n else:\r\n c = c + 2\r\nprint(c)\r\n", "n,h = map(int, input().split())\r\na = list(map(int,input().split()))\r\nif len(a) == n:\r\n count = 0\r\n i = 0\r\n while i < n:\r\n if a[i] <= h:\r\n count += 1\r\n if a[i] > h:\r\n count += 2\r\n i = i + 1\r\n print(count)\r\n", "a, b = map(int, input().split())\r\nf = 0\r\ns = [int(x) for x in input().split()]\r\nfor i in s:\r\n f += (1 if i <= b else 2)\r\nprint(f)\r\n", "nh=input().split()\r\na=input().split()\r\nwide=0\r\nfor x in range(0,int(nh[0])):\r\n if int(a[x])<=int(nh[1]):\r\n wide+=1\r\n else:\r\n wide+=2\r\nprint(wide)\r\n", "n,h=map(int, input().split())\np=list(map(int, input().split()))\n\nc = 0\nfor a in p:\n if a <= h:\n c += 1\n else:\n c += 2\n \nprint(c)", "a, b = map(int,input().split())\r\nprint(a + sum(1 for i in map(int, input().split()) if i>b))", "n, h = input().split()\r\nheights = (input().split())\r\n\r\nn = int(n)\r\nh = int(h)\r\nfor j in range(n):\r\n heights[j] = int(heights[j])\r\n\r\nw = 0\r\nfor x in heights:\r\n if x > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "a_user = input().split(\" \")\r\nb_user = input().split(\" \")\r\ncount = 0\r\nfor i in range(int(a_user[0])):\r\n if int(b_user[i]) <= int(a_user[1]):\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "s = input()\r\nlst = s.split(' ')\r\nn = int(lst[0])\r\nm = int(lst[1])\r\ns1 = input()\r\nlst1 = s1.split(' ')\r\nk = 0\r\nfor i in range(0,n):\r\n if int(lst1[i]) > m:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "n, h = map(int, input().split(\" \"))\r\n\r\n# iterating till the range\r\n\r\nlst = list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if lst[i]<=h:\r\n ans=ans+1\r\n elif lst[i]>h:\r\n ans=ans+2\r\nprint(ans) ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ni=0\r\nans=0\r\nwhile i<len(a):\r\n if a[i]>h:\r\n i-=1\r\n break\r\n ans+=1\r\n i+=1\r\ni+=1\r\nif i<n:\r\n ans+=(2(n-i))\r\nprint(ans)", "data = input().split()\r\nn = int(data[0])\r\nh = int(data[1])\r\ndata = input().split()\r\nsum = 0\r\nfor i in range(n):\r\n if int(data[i]) > h:\r\n sum += 2\r\n else:\r\n sum += 1\r\nprint(sum)", "n,h=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nwidth=0\r\nfor i in range(0, len(lst)):\r\n if lst[i]<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "n, h = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n counter += 2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n,h = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nwidth = 0\r\nfor i in b:\r\n if i<=h:\r\n width+=1\r\n else:\r\n width +=2\r\nprint(width) ", "def w(n, h, heights):\r\n r_w = 0\r\n\r\n for height in heights:\r\n if height <= h:\r\n r_w += 1\r\n else:\r\n r_w += 2\r\n\r\n return r_w\r\n\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nprint(w(n, h, heights))", "n,h=input().split()\r\nn,h=int(n),int(h)\r\nk=list(map(int,input().split()))\r\nc=0\r\nfor i in k:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = (int(i) for i in input().split())\r\nheights = [int(i) for i in input().split()]\r\nwid = 0\r\nfor h_p in heights:\r\n if h_p <= h:\r\n wid += 1\r\n else:\r\n wid += 2\r\nprint(wid)", "n,h=map(int, input().split())\r\na=list(map(int,input().split()))\r\nwidth=0\r\nfor i in a:\r\n if i>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n", "s=input().split()\r\nn=int(s[0])\r\nh=int(s[1])\r\np=input().split()\r\nx=0\r\nfor i in range(n):\r\n if int(p[i])<=h:\r\n x+=1\r\n else:\r\n x+=2\r\nprint(x)\r\n ", "n,h=map(int,input().split())\r\na=map(int,input().split())\r\nt=0\r\nfor i in a:\r\n if i>h:t+=2\r\n else:t+=1\r\nprint(t)", "b, c = (map(int,input().split()))\r\ncount = 0\r\nfor i in map(int,input().split()):\r\n if i <= c:\r\n count = count + 1\r\n else:\r\n count = count + 2\r\nprint(count)", "amount, fence = map(int, input().split())\r\ntotal = 0\r\nfriends = []\r\nfor i in input().split():\r\n friends.append(int(i))\r\n if int(i) > fence:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "x,y=list(map(int,input().split()))\r\n\r\na=list(map(int,input().split()))\r\ncount1=0\r\ncount2=0\r\nfor i in a:\r\n if i>y :\r\n count2+=1\r\n else:\r\n count1+=1\r\n\r\nprint(count1+count22)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "x,y = map(int,input().split())\r\na = 0\r\nb = 0\r\nz = list(map(int, input().split()))\r\nfor i in range(x):\r\n if z[i] <= y:\r\n a+=1\r\n else:\r\n a+=2\r\n\r\nprint(a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,f=map(int,input().split())\r\nw=0\r\nh=input().split()\r\nfor i in h:\r\n if int(i)>f:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nr=map(int,input().split())\r\nc=0\r\nfor i in r:\r\n if i > h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nd=0\r\nfor i in b:\r\n if i<=k:\r\n d+=1\r\n else:\r\n d+=2\r\nprint(d)", "n, h = map(int, input().split())\n\na = list(map(int, input().split()))\n\nans = n\n\nfor x in a:\n\tif x > h:\n\t\tans += 1\n\nprint(ans)\n", "n,fh=input().split()\r\nn=int(n)\r\nfh=int(fh)\r\nhts=input().split()\r\ncnt=0\r\nfor i in hts:\r\n if(int(i)>fh):\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n\r\nprint(cnt)", "s = input().split(' ')\r\nh = int(s[1])\r\nn = input().split(' ')\r\nm = [int(x) for x in n]\r\nc = 0\r\nfor i in m:\r\n if i <= h:\r\n c += 1\r\n else:\r\n c += 1\r\n while i > h:\r\n i /= 2\r\n c += 1\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nd=0\r\nfor i in range(a):\r\n if(c[i]>b):\r\n d=d+2\r\n else:\r\n d=d+1\r\nprint(d)", "a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nk=0\r\nfor i in range(a):\r\n if s[i]<=b:\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "def minimum_road_width(n, h, heights):\r\n count = 0\r\n for height in heights:\r\n if height > h:\r\n count += 2\r\n else:\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate and print the minimum road width\r\nprint(minimum_road_width(n, h, heights))\r\n", "s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in l:\r\n if i>t:\r\n k.append(2)\r\n else:\r\n k.append(1)\r\nprint(sum(k))\r\n \r\n\r\n ", "a, b = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nwidth_of_road = 0\r\nfor i in range(a):\r\n if heights[i] <= b:\r\n width_of_road += 1\r\n else:\r\n width_of_road += 2\r\nprint(width_of_road)", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\na = 0\r\nfor i in arr:\r\n if i > h:\r\n a += 1\r\nprint(len(arr)+a)", "l=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in l1:\r\n if i>l[1]:\r\n c=c+2\r\n else:\r\n c=c+1\r\nprint(c)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=sum(2 for i in l if i>h)\r\nprint(count+(len(l)-(count//2)))", "a = input().split()\r\nb = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\ntotal = 0\r\nfor i in b:\r\n if int(i) > k:\r\n total += 1\r\nprint(n + total)\r\n", "n , h = map(int,input().split())\r\ni = list(map(int,input().split()))\r\n\r\nw = 0\r\nx=0\r\nwhile(x<n):\r\n ph = i[x]\r\n if(ph>h):\r\n w+=2\r\n else:\r\n w+=1\r\n x+=1\r\nprint(w)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 1\r\nj = 0\r\nsum = 0\r\n\r\nwhile i <= n:\r\n if a[j] <= h:\r\n sum+=1\r\n else:\r\n sum+=2\r\n j+=1\r\n i+=1\r\n\r\n\r\nprint(sum)", "n,h=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nc=0\r\nfor i in v:\r\n if i<=h:\r\n c+=1\r\n elif i>h:\r\n c+=2\r\nprint(c)", "n, h = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nsum = 0\r\nfor i in range(len(arr)):\r\n if arr[i] <= h:\r\n sum += 1\r\n else:\r\n sum += 2\r\n\r\nprint(sum)", "n, h = input().split()\na = list(map(int, input().split()))\nresult = 0\n\nfor i in a:\n if i <= int(h):\n result += 1\n else:\n result += 2\n\nprint(result)\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in range(a):\r\n if b>=c[i]:\r\n l=l+1\r\n elif c[i]%b==0:\r\n l=l+(c[i]//b)\r\n else:\r\n l=l+((c[i]//b)+1)\r\nprint(l)", "a,b = map(int,input().split())\r\nm = list(map(int,input().split()))\r\nz = 1len(m)\r\nfor x in range(a):\r\n if m[x]>b:\r\n z+=1\r\nprint(z)\r\n \r\n", "n, h = map(int,input().split())\r\npersons_h = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in persons_h:\r\n if i <= h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width) ", "n,h=map(int,input().split())\r\nli=[int(i) for i in input().split()]\r\nc=0\r\nfor i in li:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\nfriends = input().split()\r\nshirina = n\r\n\r\nfor i in friends:\r\n if int(i) > int(h):\r\n shirina += 1\r\n\r\nprint(shirina)", "# Problem 677 A - Vanya and Fence\r\nnum,fence_height = [int(i) for i in input().split()]\r\nheights = [int(i) for i in input().split()]\r\nroad_width = num\r\nfor height in heights:\r\n if height > fence_height:\r\n road_width +=1\r\nprint(road_width)", "n,k=input().split()\nn=int(n)\nk=int(k)\n\na=input().split()\n\nwidth=0\nfor i in range (n):\n if(int(a[i])>k):\n width+=2\n else:\n width+=1\n\n\nprint(width)\n\n\n\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t\t \t\t\t", "s = input()\r\nn = int(s.split()[0])\r\nh = int(s.split()[1])\r\nx = input()\r\n\r\nw = 0\r\nfor i in x.split():\r\n if int(i) > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "friends, fence_height = map(int, input().split())\r\nfriends_height_array = list(map(int, input().split()))\r\narr = []\r\nfor i in friends_height_array:\r\n if i > fence_height:\r\n arr.append(2)\r\n else:\r\n arr.append(1)\r\nprint(sum(arr))\r\n", "n,h=map(int,input().split())\r\nhi = list(map(int,input().split()))\r\ncount=n\r\nfor i in range(len(hi)):\r\n if hi[i] > h:\r\n count +=1\r\nprint(count)", "n,h=map(int,input().split())\r\na=list(input().split())\r\nwidth=0\r\nfor i in range(n):\r\n if int(a[i])>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "aiwi = input().split()\r\nheight = int(aiwi[1])\r\nheight_list = input().split()\r\ncount = 0\r\nheight_list = [int(i) for i in height_list]\r\nfor i in height_list:\r\n \r\n if i > height:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint (count)", "a , b=map(int,input().split())\r\nsum=0\r\nl=list(map(int,input().split()))\r\nfor i in range(a):\r\n if l[i]>b:\r\n sum+=2\r\n else:\r\n sum+=1\r\n\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor x in a:\r\n if x > h:\r\n c += 1\r\nprint(len(a) + c)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nc=n\r\n\r\nfor i in a:\r\n if i>h:\r\n c+=1\r\n\r\nprint(c)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(len(l)):\r\n if l[i]<=h:\r\n cnt+=1\r\n else:\r\n j=0\r\n ele=l[i]\r\n while(ele>h):\r\n if(j==0):\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n j+=1\r\n ele=ele//2\r\nprint(cnt)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\nans=n\r\nfor i in a:\r\n if(i>h):\r\n ans+=1\r\nprint(ans)", "n, h = map(int, input().split())\nheights = list(map(int, input().split()))\n\nwidth = 0\n\nfor n in heights:\n if n <= h:\n width += 1\n elif n > h:\n width += 2\nprint(width)\n", "n, h = input().split()\r\nt = input().split()\r\nw = 0\r\n\r\nfor i in t:\r\n if int(i) > int(h):\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "x=input()\r\nx=x.split(\" \")\r\nnumber_of_friends= int(x[0])\r\nhight_of_fence= int(x[1])\r\nx=input()\r\nx=x.split(\" \")\r\nhight_of_friends= [int(i) for i in x]\r\n\r\ndef find_width(hight_of_fence, hight_of_friends):\r\n\r\n width=0\r\n for h in hight_of_friends:\r\n if h > hight_of_fence:\r\n width+=2\r\n else:\r\n width+=1\r\n return width\r\n\r\nprint(find_width(hight_of_fence, hight_of_friends))\r\n ", "def widthCalc(height, list):\r\n widthNeeded = 0\r\n for i in list:\r\n if i > height:\r\n widthNeeded += 2\r\n else:\r\n widthNeeded += 1\r\n return widthNeeded\r\n\r\nif __name__ == '__main__':\r\n _, height = input().split()\r\n height = int(height)\r\n people = [int(h) for h in input().split()]\r\n print(widthCalc(height, people))\r\n", "n, h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nw = n\r\nfor i in a:\r\n if i > h:\r\n w += 1\r\nprint(w)\r\n", "from sys import stdin, stdout\r\nn, h = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nans = 0\r\nfor i in range(n):\r\n ans += 1\r\n if a[i] > h:\r\n ans += 1\r\nstdout.write(str(ans))", "# your code goes here\r\ndef main():\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n\r\n for i in range(n):\r\n if a[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n, h = map(int, input().split())\n print(n+sum([v > h for v in list(map(int, input().split()))]))\n\n\t\t \t\t\t \t\t \t \t\t \t \t\t \t \t\t\t\t\t \t", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor loop in range(n):\r\n if arr[loop] > h:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "def main():\n n,h = map(int,input().split(' '))\n arr = list(map(int,input().split(' ')))\n min_width = 0\n for i in arr:\n if(i>h):\n min_width += 2\n else:\n min_width += 1\n print(min_width)\n\nmain()", "list1 = input().split()\r\nnum = int(list1[0])\r\nheight = int(list1[1])\r\n\r\nlist2 = input().split()\r\nlist3 = [int(x) for x in list2]\r\ncount = 0 \r\nfor ch in list3:\r\n if ch > height:\r\n count += 1\r\nprint(num + count)", "n,h=map(int,input().split())\r\ncounter=0\r\nfor i in list(map(int,input().split())):\r\n if i>h:\r\n counter+=2\r\n else:\r\n counter+=1\r\nprint(counter)", "from collections import Counter\r\ndef solve(ls, H):\r\n width = 0\r\n for item in ls:\r\n width += 1\r\n if item > H:\r\n width += 1\r\n return width\r\n\r\nH = int(input().split()[1])\r\nls = list(map(int, input().split()))\r\nprint(solve(ls, H))", "x,r,v=map(int,open(0).read().split());print(x+sum(n>r for n in v))\r\n#hi codeforces\r\n#", "frd,height = input().split(\" \")\r\nfriends = input().split(\" \")\r\nout = 0\r\nfor i in friends:\r\n if int(i) > int(height):\r\n out +=2\r\n else:\r\n out +=1\r\nprint(out)", "# a = []\r\ns = 0\r\nn,h = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\n\r\nfor i in nums:\r\n # c = int(input())\r\n if i > h:\r\n s += 2\r\n else:\r\n s +=1\r\n# a.append(c)\r\n \r\nprint(s)\r\n \r\n# type(a)", "# https://codeforces.com/contest/677\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, h = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor x in a:\n if x > h:\n ans += 2\n else:\n ans += 1\nprint(ans)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nt = 0\r\nfor i in a:\r\n if i>h:\r\n t += 2\r\n else:\r\n t+=1\r\nprint(t)", "#https://codeforces.com/contest/677/problem/A\r\n\r\nn = input().split()\r\nn, h = int(n[0]), int(n[1])\r\n\r\n# while n: \r\nheights = input().split()\r\nwidth = 0\r\nfor height in heights: \r\n if int(height) <= h: \r\n width += 1\r\n else:\r\n width += 2 \r\nprint(width)\r\n # n-=1", "n,h = [int(x) for x in input().split()]\r\n\r\n\r\nk = [int(x) for x in input().split() ]\r\nwidth = 0\r\nfor i in k:\r\n if i <=h:\r\n width = width+1\r\n else:\r\n width = width+2\r\n\r\nprint(width)", "n, h = input().split()\r\ntall = list(map(int, input().split()))\r\nw = 0\r\nq = 0\r\nwidth_road = 0\r\nfor i in range(len(tall)):\r\n if int(tall[i]) <= int(h):\r\n w += 1\r\n elif int(tall[i]) > int(h):\r\n q += 2\r\nwidth_road = w + q\r\nprint(width_road)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in a:\r\n\tif i>m:\r\n\t\ts+=1\r\nprint((n-s)+(s2))", "n=input().split(\" \")\r\nh=input().split(\" \")\r\nc=0\r\nfor i in range(int(n[0])):\r\n if int(h[i])<=int(n[1]):\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "a, b = map(int, (input().split()))\r\nc = list(map(int, input().split()))\r\nx = 0\r\nfor i in c:\r\n if i > b:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i > h:\r\n s=s+2\r\n else:\r\n s=s+1\r\nprint(s)\r\n#print(n)\r\n#print(h)\r\n#print(l)\r\n", "n,h=map(int,input().split())\r\nthe_list=list(map(int,input().split()))\r\n\r\nw=0\r\nfor i in the_list:\r\n w+=1\r\n if i > h :\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncounter=0\r\nfor i in l:\r\n if(i>h):\r\n counter=counter+2\r\n else:\r\n counter=counter+1\r\nprint(counter)", "umber_of_friends, height_of_fence = map(int, input().split())\r\nlist_of_heights = (map(int, input().split()))\r\n\r\nwidth = 0\r\nfor height in list_of_heights:\r\n if height > height_of_fence:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Sep 6 21:24:13 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, h = list(map(int, input().split()))\r\nai = list(map(int, input().split()))\r\nwi = [1 for a in ai if a > h]\r\nprint(sum(wi) + n)", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # If height exceeds h, they need to bend, so add 2 to the width.\r\n else:\r\n width += 1 # If height is less than or equal to h, they can walk normally, so add 1 to the width.\r\n\r\nprint(width)\r\n", "a = input().split()\r\nn = int(a[0])\r\nh = int(a[1])\r\nhl = input().split()\r\nw = 0\r\nfor i in hl:\r\n i = int(i)\r\n if i > h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)\r\n \r\n \r\n", "n, h = input().split()\narr = input().split()\nextra = 0\nfor i in arr:\n if int(i) > int(h):\n extra += 1\n\nprint(int(n) + extra)", "fence = int(input().split()[1])\r\nwidth =0\r\nfor i in list(map(int,input().split())):\r\n if i>fence:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "t,n = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in l:\r\n if i > n:\r\n c += 2\r\n else:\r\n c += 1\r\nprint(c)", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(a):\r\n if l[i] > b:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "n, h = map(int, input().split())\r\nnums = input().split()\r\nnums = [int(num) for num in nums]\r\nans = 0\r\n\r\nfor i in range(n):\r\n if nums[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "# URL: https://codeforces.com/problemset/problem/677/A\nn, h = map(int, input().split())\nans = n\nfor a in map(int, input().split()):\n ans += a > h\nprint(ans)\n", "total = 0\r\nn, h = map(int, input().split())\r\nmans = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if mans[i] <= h:\r\n total += 1\r\n else:\r\n total += 2\r\nprint(total)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor x in a:\r\n if x > h:\r\n n += 1\r\nprint(n)\r\n", "ip = input().split(\" \")\r\nheights = input().split(\" \")\r\n\r\nwidth = 0\r\n\r\nn = ip[0]\r\nfence = ip[1]\r\n\r\nfor i in range(len(heights)):\r\n if int(heights[i]) > int(fence):\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(int(width))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Sep 12 17:50:22 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\nwide=0\r\ndata1=list(map(int,input().split()))\r\ndata2=list(map(int,input().split()))\r\nn=data1[0]\r\nh=data1[1]\r\nfor i in data2:\r\n if i > h:\r\n wide+=2\r\n else:\r\n wide+=1\r\nprint(wide)\r\n", "num_height = input().split()\r\nfriends_num = int(num_height[0])\r\nheight = int(num_height[1])\r\nfriends_height = input().split()\r\nroad_width = 0\r\nfor one in friends_height:\r\n if int(one) > height:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\nprint(road_width)", "\r\nn,h = (input().split(\" \"))\r\nn,h = int(n), int(h)\r\nrows = list(str(input()).split())\r\nrows = [int(x) for x in rows]\r\ncount = 0\r\nfor x in rows:\r\n\r\n if x%h == 0:\r\n count += int(x/h)\r\n elif x%h > 0:\r\n count += 1 + int(x/h)\r\n else:\r\n continue\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# a,b = (input().split(\" \"))\r\n# a,b = list(a),int(b)\r\n# a = [int(x) for x in a]\r\n# for i in range(b):\r\n# if a[-1] == 0:\r\n# a.pop()\r\n# else:\r\n# a[-1] -= 1\r\n# a = \"\".join([str(x) for x in a]) \r\n# print(a)\r\n\r\n\r\n\r\n\r\n\r\n# a,b = (input().split(\" \"))\r\n# a,b = int(a),int(b)\r\n# count = 0 \r\n# while a <= b:\r\n# a = a3\r\n# b = b2\r\n# count += 1\r\n", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i>y:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "(n,h) = map(int,input().split())\r\nhlist = list(map(int,input().split()))\r\nfor x in hlist:\r\n if x > h:\r\n n += 1\r\nprint(n)\r\n", "n, h = list(map(int, input().split()))\r\n\r\nm = list(map(int, input().split()))\r\n\r\nb = 0\r\n\r\nfor i in range(n):\r\n \r\n if m[i] > h:\r\n \r\n b += 2\r\n \r\n else:\r\n \r\n b += 1\r\n \r\nprint(b)", "quantity, height = map(int, input().split())\nroad_width = 0\nn = 0\nboy_height = input().split()\nfor i in range(quantity):\n if int(boy_height[n]) > height:\n n += 1\n road_width += 2\n else:\n road_width += 1\n n += 1\nprint(road_width)", "fr, high = map(int,input().split())\r\nwidth = 0\r\nfor i in list(map(int,input().split())):\r\n if i > high: width += 2\r\n else: width += 1\r\nprint(width)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "def solve(heights, h):\r\n width = 0\r\n return sum(2 if height > h else 1 for height in heights)\r\n\r\n \r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n, h = map(int, input().split())\r\n heights = list(map(int, input().split()))\r\n print(solve(heights, h))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdin, stdout\r\nn,h=map(int,stdin.readline().split())\r\n\r\n\r\nl= list(map(int,stdin.readline().split()))\r\n\r\nresult = 0\r\nfor i in l :\r\n if i<=h:\r\n result+=1\r\n else:\r\n result+=2\r\nstdout.write(str(result))", "n, h = map(int, input().split())\r\nmem = list(map(int, input().split()))\r\ncount=0\r\nfor i in mem:\r\n if(i<=h):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "a=list(map(int,input().split(\" \")))\r\nn=a[0]\r\nh=a[1]\r\nheight=list(map(int,input().split(\" \")))\r\nwidth=n\r\nfor i in range(n):\r\n if height[i]>h:\r\n width+=1\r\nprint(width)", "n, h = map(int, input().split())\r\nt = list(map(int, input().split())) \r\nw = 0\r\nfor i in t:\r\n if i > h:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nwidth = 0\r\nlst = list(map(int, input().split()))\r\nfor i in range(len(lst)):\r\n if lst[i] > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "user_input = input().split()\r\nheights = input().split()\r\nroad_width = 0\r\nfor i in heights:\r\n if int(i) > int(user_input[1]):\r\n road_width += 2\r\n else:\r\n road_width += 1\r\n \r\nprint(road_width)", "width = 0\r\ndata = list(map(int, input().split(\" \")))\r\nheight = list(map(int, input().split(\" \")))\r\nfor x in height:\r\n if x > data[1]:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "i1 = input()\r\ni1 = i1.split()\r\ninput1=[]\r\nfor x in i1:\r\n\tinput1.append(int(x))\r\n\t\r\n\t\r\nn=input1[0]\r\nh=input1[1]\r\n\r\nheight = input().split()\r\nh2 = []\r\nfor y in height:\r\n\th2.append(int(y))\r\n\t\r\n\r\nctr =0\r\nfor high in h2:\r\n\tif high<=h:\r\n\t\tctr+=1\r\n\telif high>h:\r\n\t\tctr+=2\r\n\r\nprint (ctr)\r\n", "value = list(map(int, input().split(' ')))\r\nh = value[1]\r\nvalue = list(map(int, input().split(' ')))\r\ntotal = 0\r\nfor i in range(len(value)):\r\n if value[i] > h:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n if i<=k:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)", "string = input().split()\r\nstring1 = input().split()\r\nn, h = int(string[0]), int(string[1])\r\ncounth = 0\r\nfor i in string1:\r\n k = int(i)\r\n while k > h:\r\n if k > h:\r\n k /= 2\r\n counth += 1\r\n else:\r\n continue\r\n if k < h:\r\n continue\r\nprint(len(string1) + counth)\r\n\r\n\r\n\r\n", "n, h = map(int, input().split())\r\n\r\nli = [int(x) for x in input().strip().split()]\r\n\r\nwidth = 0\r\nfor x in li:\r\n if x > h:\r\n width+=2\r\n else:\r\n width +=1\r\n\r\nprint(width)", "string1 = [int(i) for i in input().split()]\r\nn, h = string1[0], string1[1]\r\nmy_list = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n if my_list[i] <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "soma = 0\n\nn, f = input().split(\" \")\nalturas = input().split(\" \")\n\nfor altura in alturas:\n cont = 1\n altura = int(altura)\n while (altura > int(f)):\n cont += 1\n altura /= 2\n \n soma += cont\n\nprint(soma)\n", "n,h = map(int,input().split())\r\n\r\nwidth = 0\r\n\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(len(a)):\r\n if a[i] > h: width += 2\r\n else: width += 1\r\n\r\nprint(width) \r\n\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nx=[int(i) for i in input().split()]\ny=0\nfor i in range (n):\n if x[i]<=h:\n y=y+1\n else:\n y=y+2\nprint(y)\n \t\t\t \t \t\t \t\t\t \t \t \t \t \t \t", "friends, fence = list(map(int, input().split()))\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nh = 0\r\n\r\nfor i in heights:\r\n if i > fence:\r\n h += 1\r\n\r\nprint((h2) + (friends - h))\r\n", "n,h = list(map(int,input().split()))\r\na= list(map(int,input().split()))\r\n#print(a)\r\n\r\ncnt=0\r\nfor i in range(0,n):\r\n if(a[i]>h):\r\n cnt = cnt + 2\r\n else:\r\n cnt = cnt + 1\r\nprint(cnt)", "i1 = input()\r\nil1 = i1.split(' ')\r\nn = int(il1[0])\r\nh = int(il1[1])\r\ni2 = input()\r\nil2 = i2.split(' ')\r\n\r\nmini = 0\r\n\r\nfor i in il2:\r\n if int(i) > h:\r\n mini +=2\r\n else:\r\n mini+=1\r\nprint(mini)", "num, count = list(input().split()), 0\r\ns = list(input().split())\r\nfor i in range(len(s)):\r\n if int(s[i]) > int(num[1]):\r\n count += 1\r\nprint(int(num[0]) 2 - (int(num[0]) - count))", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nwidth = sum(1 if x <= h else 2 for x in a)\r\nprint(width)", "n, h = map(int, input().split())\r\nArr = list(map(int, input().split()))\r\nFArr = [0, 0]\r\n\r\nfor ele in Arr:\r\n if ele > h:\r\n FArr[1] += 1\r\n else:\r\n FArr[0] += 1\r\n\r\nR = (FArr[0] * 1) + (FArr[1] * 2)\r\nprint(R)", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nct = 0\r\n\r\nfor i in range(len(l)):\r\n if l[i]/t % 1 != 0:\r\n x = int(l[i]/t) + 1\r\n else:\r\n x = l[i]/t\r\n ct += x\r\nprint(int(ct))\r\n", "n, h = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int, input().split())\nH = list(map(int, input().split()))\ncounter = 0\nfor i in range(len(H)):\n if H[i] > h:\n counter += 1\nW = len(H) + counter\nprint(W)\n \t\t \t\t\t\t \t \t\t \t\t\t\t\t \t \t \t", "# Read the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width of the road\r\nmin_width = 0\r\n\r\n# Iterate through the heights and calculate the minimum width\r\nfor height in heights:\r\n if height > h:\r\n min_width += 2 # Friend needs to bend, so width is 2\r\n else:\r\n min_width += 1 # Friend can walk normally, so width is 1\r\n\r\n# Output the minimum width\r\nprint(min_width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwid = 0\r\nfor i in a:\r\n if i > h:\r\n wid += 2\r\n else:\r\n wid += 1\r\nprint(wid)", "x1=input().split()\r\nn=int(x1[0])\r\nk=int(x1[1])\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor x in l:\r\n if x>k:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor p in heights:\r\n if p > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nz=[]\r\nsol=[]\r\nfor i in x:\r\n if(i<=b):\r\n sol.append(1)\r\n else:\r\n sol.append(2)\r\nprint(sum(sol)) ", "n,h = map(int,input().split())\na = list(map(int,input().split()))\nm = 0\nfor i in a:\n i >h\n if i >h:\n m+=2\n else:\n m+=1\nprint(m)\n\t\t \t\t \t \t \t\t\t\t\t \t \t\t \t \t\t", "x,y,a=map(int,open(0).read().split())\r\nprint(x+sum(n>y for n in a))", "n,h = map(int,input().split())\r\nans=0\r\nfor i in input().split():\r\n if int(i)>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "m=input().split()\r\nn=int(m[0])\r\nh=int(m[1])\r\nl=input().split()\r\nk= list(map(int,l))\r\ncount=0\r\nfor i in (k):\r\n if i>h:\r\n count=count+2\r\n else:\r\n count+=1\r\nprint(count) ", "n, h = map(int, input().split()) \r\nheights = list(map(int, input().split())) \r\nwidths = [1 if height <= h else 2 for height in heights]\r\ntotal_width = sum(widths)\r\n\r\nprint(total_width)\r\n", "# Input n and h\r\ntotal_students, pass_height = map(int, input().split())\r\n\r\n# Input the heights of students\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the count with the total number of students\r\ncount = total_students\r\n\r\n# Iterate through the heights and increment count for students taller than pass_height\r\nfor height in heights:\r\n if height > pass_height:\r\n count += 1\r\n\r\n# Print the final count\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\np=0\r\nfor i in n:\r\n if i>b:\r\n p+=2\r\n else:\r\n p+=1\r\nprint(p)\r\n", "n, h = list(map(int, input().split(\" \")))\r\nf = list(map(int, input().split(\" \")))\r\nc = 0\r\nfor i in f:\r\n if i <= h:c += 1\r\n else: c += 2\r\nprint(c)\r\n", "ide = 0\r\nif ide == 1:\r\n import sys\r\n\r\n sys.stdin = open(\"677a.inp\", \"r\")\r\n\r\n\r\ndef main():\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n w = 0\r\n for i in range(n):\r\n if a[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\n print(w)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,h=list(map(int,input().split()))\r\nw=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n,h = map(int,input().split())\r\nlst = input().split()\r\nlst2 = [int(i) for i in lst]\r\nw=0\r\nfor i in lst2:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\n\r\nprint(w)", "n, h = map(int, input().split())\nheight = [int(i) for i in input().split(\" \")]\nn = len(height)\nwidth = 0\n\nfor each in height:\n if each > h:\n width += 2\n else:\n width += 1\n\nprint(width)", "a=str(input(''))\r\nb=a.split()\r\nc=int(b[0])\r\nd=(str(input('')).split())\r\nfor i in d:\r\n if (int(b[1])<int(i)):\r\n c=c+1\r\nprint(c)", "n,h = map(int,input().split())\r\nlst = [int(x) for x in input().split()]\r\nmini_width = 0\r\n\r\nfor i in lst:\r\n if i <= h:\r\n mini_width += 1\r\n else:\r\n mini_width += 2\r\nprint(mini_width)", "m=input().split()\r\nn=int(m[0])\r\nh=int(m[1])\r\ncount=0\r\na=input().split()\r\nfor i in range(n):\r\n if int(a[i])<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n, h = map(int, input().split())\r\n\r\nrow = list(map(int, input().split()))[:n]\r\ncount = 0\r\nfor i in row:\r\n if i > h:\r\n count+=2\r\n else:\r\n count+=1\r\n\r\nprint(count)", "n,l=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nc=0\r\nfor i in lst:\r\n if i <= l:\r\n c +=1\r\n else:\r\n c +=2\r\n \r\nprint(c)", "a=0\r\nb,c=input().split()\r\nb=int(b)\r\nc=int(c)\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i]>c:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)\r\n", "n, h = map(int, input().split())\r\n\r\na = list(map(int, \r\n input().strip().split()))[:n]\r\n\r\ncount = 0\r\nfor i in a:\r\n if i > h:\r\n count += 2\r\n else:\r\n count += 1\r\n \r\nprint(count)", "n,h = map(int,input().split())\nwidth = 0\narr = list(map(int,input().split()))\nfor i in range (0,n):\n if arr[i] > h:\n width += 2\n else: \n width += 1\n\nprint(width)\n\t \t\t\t \t \t \t\t\t\t \t \t\t\t\t\t", "n, h = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nout = 0\r\n\r\nfor i in x:\r\n if i > h:\r\n out += 2\r\n else:\r\n out += 1\r\n\r\nprint(out)", "a,b=map(int,input().split())\r\nk=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if b < i:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)", "n,h=list(map(int,input().split()))\r\nheight=list(map(int,input().split()))\r\nheight.sort(reverse=True)\r\ni=0\r\nwhile(i<len(height) and height[i]>h): \r\n i=i+1\r\nprint(n+i)", "x,y=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nn=0\r\nfor i in r:\r\n\tif i<=y:\r\n\t\tn+=1\r\n\telse:\r\n\t\tn+=2\r\nprint(n)\r\n\t\t", "n, h = map(int, input().split()) # Input the number of friends and fence height\nheights = list(map(int, input().split())) # Input the heights of friends\n\ntotal_width = 0 # Initialize the total width required\n\nfor height in heights:\n if height > h:\n total_width += 2 # If height > h, width contribution is 2\n else:\n total_width += 1 # Otherwise, width contribution is 1\n\nprint(total_width)\n\n \t\t \t \t \t \t \t \t\t \t\t\t \t\t \t", "x, y = map(int, input().split())\r\nl= input().split()\r\nc = 0\r\nfor i in (l):\r\n if int(i) <= y:\r\n c += 1\r\n else: c += 2\r\nprint(c)\r\n \r\n", "n, h = input().split(\" \")\r\nA = input().split(\" \")\r\na = list(map(int, A))\r\nm = int(n)\r\nfor i in a:\r\n if i > int(h): m+= 1\r\nprint(m)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Sep 13 15:30:50 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn, h = map(int, input().split())\r\nheight = list(map(int, input().split()))\r\ncount = 0\r\nfor high in height:\r\n if high <= h:\r\n count = count + 1\r\n else:\r\n count = count + 2\r\nprint(count)", "n,k =input().split()\nn =int(n)\nk=int(k)\na=input()\nx=a.split()\nc=0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i]>k:\n c+=2\n else:\n c+=1\nprint(c)\n \t\t\t \t \t\t\t \t \t \t\t\t\t \t\t", "n, h = (int(i) for i in input().split())\r\na_n = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n a_n[i] = 1 if a_n[i] <= h else 2\r\nprint(sum(a_n))\r\n", "h,d=input().split()\nh=int(h)\nd=int(d)\na=input()\nx=a.split()\nc=0\nfor i in range(len(x)):\n x[i]=int (x[i])\n if x[i]>d:\n c+=2\n else:\n c+=1\nprint(c)\n\t\t \t \t\t\t \t\t \t\t\t\t\t \t\t\t\t", "i1 = list(map(int, input().strip().split()))\r\ni2 = list(map(int,input().strip().split()))\r\n\r\nh = i1[1]\r\n\r\nmax_width = 0\r\n\r\n\r\nfor fh in i2:\r\n if(fh > h):\r\n max_width += 2\r\n else:\r\n max_width += 1\r\nprint(max_width)", "n,h = map(int,input().split())\r\nf = input().split()\r\nc = n\r\nfor i in range(len(f)):\r\n if int(f[i]) > h :\r\n c += 1\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n v+=1\r\n else:\r\n v+=2\r\nprint(v)", "n,h=map(int,input().split())\nL=list(map(int,input().split()))\ns=0\nfor i in range(n):\n if (L[i]<=h):\n s+=1\n else:\n s+=2\nprint(s) ", "\r\nn,h=input().split( \" \" )\r\nn=int(n)\r\nh=int(h)\r\nx=input().split( \" \" )\r\nw=0\r\n\r\nfor i in range(n):\r\n l=int(x[i])\r\n if(l<=h):\r\n \r\n w+=1\r\n else:\r\n w+=2\r\n \r\nprint(w) ", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, m = map(int, input().split())\r\nres = 0\r\n\r\nn = [int(i) for i in input().split()]\r\nfor i in n:\r\n if i > m:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "import math\r\nn,h=map(int,input().split())\r\nheight= list(map(int, input().split()))\r\noutput=0\r\nfor i in range(n):\r\n output+=math.ceil((int(height[i]))/h)\r\nprint(output)", "number_of_friends, fence_height = map(int, input().split(\" \"))\r\nfriends = tuple(map(int, input().split(\" \")))\r\n\r\nrequired_width = number_of_friends\r\n\r\nfor friend in friends:\r\n if friend > fence_height:\r\n required_width += 1\r\n\r\nprint(required_width)\r\n", "n,h=map(int,input().split())\r\ns=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n s+=1\r\n s+=1\r\nprint(s)\r\n", "# Read input for R (number of heights) and S (threshold height)\r\nnum_heights, threshold_height = map(int, input().split())\r\n\r\n# Read the list of heights\r\nheights = list(map(int, input().split()))\r\n\r\n\r\n\r\n# Initialize variable to keep track of total width\r\ntotal_width = 0\r\n\r\n# Iterate through each height in the list\r\nfor height in heights:\r\n # Check if the current height is greater than the threshold\r\n if height > threshold_height:\r\n # If it is, add 2 units to the width\r\n total_width += 2\r\n else:\r\n # If not, add 1 unit to the width\r\n total_width += 1\r\n\r\n# Print the total width\r\nprint(total_width)\r\n", "n,h = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(arr)):\r\n if arr[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwidth = 0\r\n\r\nfor ht in a:\r\n if ht <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)", "n,h= map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nwidth=0\r\nfor i in lst:\r\n if i > h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n", "n,m=map(int,input().split());print(sum([int(1 if int(i)<=m else 2) for i in input().split()]))", "\r\nnum_of_freinds , height = map(int , input().split())\r\n\r\nwidth = 0\r\n\r\n# for i in range(num_of_freinds) :\r\nfreinds_heights = map(int , input().split())\r\nfor j in freinds_heights :\r\n if j > height :\r\n width += 2\r\n else :\r\n width += 1\r\n \r\nprint(width)", "\n\n\n\n\n\nn, h = map(int, input().split())\n\narr = list(map(int, input().split()))\n\ntot = 0\n\nfor i in arr :\n tot += 2 if i > h else 1\n\nprint(tot)\n\n\n \n \t\t \t \t\t\t \t \t \t\t \t\t\t \t\t", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ns=0\r\nfor i in c:\r\n if i>b:\r\n s=s+2\r\n else:\r\n s=s+1\r\nprint(s)\r\n", "n, h = input().split()\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=int(h)):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h= map(int, input().split())\r\ny= list(map(int,input().split()))\r\nx=0\r\nfor i in y:\r\n if i>h:\r\n x+=2\r\n else:\r\n x+=1\r\nprint(x)", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nj=0\r\nfor i in range(n):\r\n if arr[i]<=h:\r\n j+=1\r\n else:\r\n j+=2\r\nprint(j)", "n,h=map(int,input().split())\r\ns=input().split()\r\nq=n\r\nfor i in range(n):\r\n if int(s[i])>h:\r\n q+=1\r\nprint(q)\r\n ", "\r\ncnt1=0\r\ncnt2=0\r\n\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nfor x in c:\r\n if x>b:\r\n cnt2=cnt2+2\r\n elif x<=b:\r\n cnt1=cnt1+1\r\n\r\nprint(cnt1+cnt2)", "z,x,r=map(int,open(0).read().split());print(z+sum(n>x for n in r))", "#https://codeforces.com/contest/677/problem/A\r\nI=lambda:map(int,input().split())\r\nn,h=I()\r\nprint(n+sum(i>h for i in I()))", "K,H=map(int,input().split())\r\nA=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(A)):\r\n \r\n if A[i]>H:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)\r\n", "n,h= map(int, input().split())\r\nx=list(map(int, input().split()))\r\nc=0\r\nfor i in x:\r\n if i<=h:\r\n c=c+1\r\n else:\r\n c=c+2\r\nprint(c)", "n, h = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nl = 0\r\nfor i in lst:\r\n if i > h:\r\n l += 2\r\n else:\r\n l += 1\r\nprint(l)", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize width\r\nwidth = 0\r\n\r\n# Calculate width based on the heights\r\nfor height in heights:\r\n if height > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\n# Print the minimum possible valid width of the road\r\nprint(width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor j in a:\r\n if j > h:\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)", "n, h = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor x in nums:\r\n if x > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)\r\n ", "num_height=list(map(int,input().split()))\r\nheight=list(map(int,input().split()))\r\nwidth=0\r\nfor x in range(len(height)):\r\n if height[x]>num_height[1]:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int, input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n sum=sum+2\r\n else:\r\n sum=sum+1\r\nprint(sum)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "n, h = map(int, input().split())\r\ndata =[int(i) for i in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n\tif data[i] > h:\r\n\t\tres += 2\r\n\telse:\r\n\t\tres += 1\r\nprint(res)", "q=lambda:map(int,input().split())\r\nn,h=q()\r\nprint(n+sum(i>h for i in q()))", "a , n = input().split()\na = int(a)\nn = int(n)\nx=0\ns=[int(i)for i in input().split()]\nfor i in range (a):\n if s[i]>n:\n x=x+2\n else:\n x=x+1\nprint(x)\n\t\t\t\t\t\t \t\t\t \t\t \t \t\t \t \t\t \t\t", "n, h = list(map(int, input().split()))\r\npeople = list(map(int, input().split()))\r\nlength = 0\r\nfor man in people:\r\n length += 1 if man <= h else 2\r\nprint(length)\r\n", "n,h=map(int,input().split())\r\na=input().split()\r\nwidth=0\r\nfor i in a:\r\n if int(i)<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "friend_fence = input().split()\r\nn = int(friend_fence[0])\r\nh = int(friend_fence[-1])\r\nh_list = []\r\nfriend_height = input().split()\r\nfor i in range(len(friend_height)):\r\n h_list.append(int(friend_height[i]))\r\n# print(h_list)\r\nwidth = 0\r\nfor i in range(len(h_list)):\r\n if h_list[i] <= h:\r\n width = width + 1\r\n else:\r\n width = width + 2\r\nprint(width)", "import math\r\nn,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor a in l:\r\n if a>h:\r\n s+=math.ceil((a/h))\r\n else:\r\n s+=1\r\nprint(s)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nc=a.split()\nx=0\nfor i in range(len(c)):\n c[i]=int(c[i])\n if(c[i]>h):\n x=x+2\n else:\n x=x+1\nprint(x)\n \t \t \t \t\t\t\t \t \t\t \t \t\t", "n,k = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in range(n):\r\n if heights[i]>k:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n, h = [int(i) for i in input().split(\" \")]\r\na = [int(i) for i in input().split(\" \")]\r\notvet = 0\r\nfor i in a:\r\n if i > h:\r\n otvet+=2\r\n else:\r\n otvet+=1\r\nprint(otvet)", "inp = input().split(\" \")\r\nn = int(inp[0])\r\nw = int(inp[1])\r\ninp = input().split(\" \")\r\nwidth = n\r\nl = [int(x) for x in inp]\r\nfor i in range(0,n):\r\n if l[i] > w:\r\n width+=1\r\nprint(width) ", "a,b=input().split()\r\nc=map(int,input().split())\r\nc=list(c)\r\ncount=0\r\nfor i in c:\r\n if int(b)>=i:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "a=input().split()\r\nn=int(a[0])\r\nh=int(a[1])\r\nl=0\r\na=input().split()\r\nfor x in a:\r\n if int(x)<=h:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "\r\ns=input().split()\r\nh=int(s[1])\r\nr=0\r\ns1=input().split()\r\nfor i in s1:\r\n i=int(i)\r\n if i>h:r+=2\r\n else: r+=1\r\nprint(r)", "n, m = map(int,input().split(\" \"))\r\na=map(int,input().split(\" \"))\r\ns=0\r\na=list(a)\r\nfor i in range(len(a)):\r\n a[i]=a[i]\r\n if(a[i]<=m):\r\n s=s+1\r\n else:\r\n s=s+2\r\nprint(s)", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width of the road\r\nwidth = 0\r\n\r\n# Calculate the width needed for each friend\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs 2 units of width (bending down)\r\n else:\r\n width += 1 # Friend needs 1 unit of width\r\n\r\n# Print the minimum width of the road\r\nprint(width)\r\n", "n,h = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if list1[i] > h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int, input().split()) \r\nl = list(map(int, input().split())) \r\nw = 0\r\nfor t in l:\r\n if t > h:\r\n w += 2 \r\n else:\r\n w += 1 \r\nprint(w)\r\n", "[n,h] = list(map(int,input().split()))\r\nf = list(map(int,input().split()))\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n if f[i] > h:\r\n counter += 1\r\n \r\n \r\nresult = (counter * 2) + (n-counter) * 1\r\n\r\nprint(result)\r\n", "n,f,l=map(int,open(0).read().split())\r\nprint(n+sum(i>f for i in l))", "n,h=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nwidth=0\r\nfor i in range(n):\r\n if ar[i]>h:\r\n width=width+2\r\n else:\r\n width=width+1\r\nprint(width)", "n, t = map(int, input().split())\r\nf = input().split()\r\nf = [int(x) for x in f]\r\nwidth = 0\r\nfor i in f:\r\n if i > t: width+=2\r\n else: width += 1\r\n\r\nprint(width)", "str1=input()\r\nl=str1.split()\r\nn=int(l[0])\r\nstr2=input()\r\nl1=str2.split()\r\nfor i in l1:\r\n if int(i)>int(l[1]):\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nw=int(n)\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i]>h:w=w+1\r\nprint(w)", "n, h = [int(i) for i in input().split()]\r\nmy_list = [int(i) for i in input().split()]\r\ncounter = 0\r\nfor i in my_list:\r\n if i <= h:\r\n counter += 1\r\n else:\r\n counter += 2\r\nprint(counter)", "# Vanya and Fence\ninput1 = input().split(' ')\ninput2 = input().split(' ')\n\nheight = int(input1[1])\n\nwidth = 0\n\nfor number in input2:\n if int(number) <= height:\n width += 1\n else:\n width += 2\n\nprint(width)", "n,h=map(int,input().split())\r\nlist_of_inputs=list(map(int,input().split()))\r\nsummation =0\r\n\r\nfor i in range(n):\r\n if list_of_inputs[i]>h :\r\n summation=summation+1\r\n \r\n summation=summation+1\r\n \r\nprint(summation)", "a,b = map(int,input().split(' '))\r\nj = map(int,input().split(' '))\r\nm = 0\r\nfor i in j:\r\n \r\n if i <= b:\r\n m += 1\r\n else:\r\n m += 2\r\nprint(m)", "n, h=map(int,input().split())\r\na =list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i] <=h :\r\n count+=1\r\n else :\r\n count+=2\r\nprint(count) \r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\narr=[int(i) for i in input().split()]\nx=0\nfor i in range (n) :\n if arr[i]>h:\n x+=2\n else:\n x+=1\nprint(x)\n\t\t \t\t \t\t\t \t \t\t\t\t \t\t \t\t \t\t\t", "n, h = list(map(int, input().split()))\nheights = list(map(int, input().split()))\nout = [1 if i<=h else 2 for i in heights]\nprint(sum(out))", "result = 0\r\namount, fence = map(int, input().split())\r\nPersonsHeight = map(int, input().split())\r\nfor heights in PersonsHeight:\r\n if heights <= fence:\r\n result += 1\r\n elif heights > fence:\r\n result += 2\r\nprint(result)\r\n", "#https://codeforces.com/problemset/problem/677/A\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "arrLen, Height = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nwidth = 0\r\nfor i in arr:\r\n if (i > Height):\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "n = [int(i) for i in input().split()]\r\nheight = [int(j) for j in input().split()]\r\nfor _ in range(len(height)):\r\n if height[_] > n[-1]:\r\n height[_] = 2\r\n else:\r\n height[_] = 1\r\nprint(sum(height))", "n, h = input().split()\r\na = list(map(int, input().split()))\r\ns = 0\r\n\r\nfor i in range(int(n)):\r\n if a[i] <= int(h):\r\n s = s + 1\r\n else:\r\n s = s + 2\r\n\r\nprint(s)\r\n", "m,n=map(int,input().split())\r\ng=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(m):\r\n if n>=g[i]:\r\n c.append(1)\r\n else:\r\n c.append(2)\r\nprint(sum(c))", "friends_number, fence_height = map(int, input().split())\r\n\r\n\r\ndef calc_road_width(heights):\r\n road_width = 0\r\n for height in heights:\r\n if height <= fence_height:\r\n road_width += 1\r\n else:\r\n road_width += 2\r\n\r\n return road_width\r\n\r\n\r\nheights = list(map(int, input().split()))\r\nmin_road_width = calc_road_width(heights)\r\nprint(min_road_width)\r\n", "n, b = map(int, input().split())\r\nh=list(map(int, input().split()))\r\ns=0 \r\nc=0\r\nfor i in h:\r\n \r\n if i>b:\r\n s+=2\r\n else:\r\n c+=1\r\ng=c+s\r\nprint(g)", "n,h = map(int,input().split(\" \"))\r\nai = list(map(int,input().split(\" \")))\r\nans = 0\r\nfor i in range(n):\r\n if ai[i] > h:\r\n ans = ans + 2\r\n else:\r\n ans = ans + 1\r\nprint(ans)", "n,h=input().split()\r\nx=[int(x) for x in input().split()]\r\n\r\nans=0\r\nfor i in range(int(n)):\r\n if x[i]>int(h):\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "\r\nx =input().split(\" \")\r\ny=input().split(\" \")\r\nh=x[1]\r\nvalue=0\r\nfor i in y:\r\n if int(i)>int(h):\r\n value+=2\r\n else:\r\n value+=1\r\nprint(value)\r\n\r\n\r\n\r\n", "n,h=map(int,input().split())#n-number of friends h-height of fence\r\na=list(map(int,input().split()))#a-height of friends\r\nl=[]\r\nfor i in a:\r\n if(i>h):\r\n l.append(2)\r\n else:\r\n l.append(1)\r\nprint(sum(l))\r\n \r\n", "n,h = map(int,input().split())\r\na = input().split()\r\nb = n\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nfor i in a:\r\n if i>h:\r\n b+=1\r\nprint(b)", "n, h = map(int, input().split())\r\nhigh = list(map(int, input().split()))\r\ncost = 0\r\nfor i in range(n):\r\n if high[i] <= h:\r\n cost = cost+1\r\n else:\r\n cost = cost+2\r\nprint(cost)\r\n\r\n\r\n", "n,h = map(int,input().split())\nmin_w = 0\n\na = list(i for i in input().split())\n\nfor A in a:\n if int(A) > h:\n min_w += 2\n else:\n min_w +=1\nprint(min_w)\n \t \t \t\t\t\t \t \t\t \t \t\t\t\t\t\t\t \t", "n, h = map(int, input().split())\r\nn += sum(map(lambda x: int(x) > h, input().split()))\r\nprint(n)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Sep 19 17:17:24 2023\r\n\r\n@author: 27823\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n ", "m,n=input().split()\r\nheight=map(int,input().split())\r\nlst=list(height)\r\nlength=0\r\nfor a in lst:\r\n if int(a)<=int(n):\r\n length=int(length)+1\r\n else:\r\n length=int(length)+2\r\nprint(length)", "n,h = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nm = n\r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n m += 1\r\nprint(m)", "import sys\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = 0\r\nfor i in b:\r\n if i <= a[1]:\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "NoFriendFenceHight = input()\r\nNoFriendFenceHightArr = list(map(int,NoFriendFenceHight.split()))\r\nFriendHeight = input()\r\nFriendHeightArr = list(map(int,FriendHeight.split()))\r\nx=0\r\nfor i in FriendHeightArr:\r\n if i > NoFriendFenceHightArr[1]:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n\tc=math.ceil(l[i]/m)\r\n\ts+=c\r\nprint(s)", "l = [int(e) for e in input().split(\" \")]\r\nn, h = l[0], l[1]\r\na = [int(e) for e in input().split(\" \")]\r\nw = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)\r\n", "n = input().split()\r\na = input().split()\r\ncount = 0\r\n\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nfor i in a:\r\n if i > n[1]:\r\n count = count + 2\r\n elif 1 <= n[1]:\r\n count = count +1\r\n\r\nprint(count)\r\n", "y = input().split()\r\nn = int(y[0])\r\nh = int(y[1])\r\ncounter = 0\r\nx = input().split()\r\nx = (int(num) for num in x)\r\nfor j in x:\r\n if j>h:\r\n counter += 1\r\n else:\r\n continue\r\n \r\nprint(counter+n) ", "\nn, h = map(int, input().split())\na = list(map(int, input().split()))\n\nwidth = 0\nfor i in range(n):\n if a[i] > h:\n width += 2\n else:\n width += 1\n\nprint(width)\n\n \t\t \t\t\t\t\t \t \t \t \t\t\t \t", "s = list(map(int, str(input()).split()))\r\nt = list(map(int, str(input()).split()))\r\nn,h = s[0],s[1]\r\nk = 0\r\nfor i in t:\r\n if i > h:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "a=input()\r\na=a.split(\" \")\r\nn,h=int(a[0]),int(a[1])\r\nm=map(int,input().split())\r\ns=0\r\nfor i in m:\r\n if i<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\ncount=0\r\nfor i in range (0,n):\r\n if a[i]>h:\r\n count+=2\r\n else:\r\n count +=1\r\nprint(count)", "n, h = map(int, input().split())\r\ns = 0\r\n\r\nfor i in [int(i) for i in input().split()]:\r\n if i > h:\r\n s += 2\r\n else:\r\n s += 1\r\n \r\nprint(s)", "a,b=map(int,input().split(' '))\r\ns , k = input().split(' '), 0\r\nfor i in range(a):\r\n if int(s[i])>b:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "\r\nn, k = map(int, input().split()) \r\n\r\na = list(map(int,input().split()))\r\n\r\n\r\nans = 0 \r\nfor x in a :\r\n if x > k :\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "n, h = map(int, input().split())\r\nk=input().split(\" \")\r\nw=n\r\nfor i in k:\r\n if(int(i)>h):\r\n w=w+1\r\nprint(w)", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nk=0\r\nfor i in arr:\r\n if i>h:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "n, h = map(int,input().split())\r\na = [int(el) for el in input().split()]\r\nd = 0\r\nfor el in a:\r\n if el <= h:\r\n d += 1\r\n else:\r\n d += 2\r\nprint(d)\r\n", "n,h=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif l[i]>h:\r\n\t\tc=c+2\r\n\telse:\r\n\t\tc=c+1\r\nprint(c)", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nw = 0\r\n\r\nfor i in range(len(l)):\r\n if(l[i]>h):\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "n11, h11 = map(int, input().split())\r\n\r\nfriends_heights11 = list(map(int, input().split()))\r\nmin_width11 = sum(2 if height11 > h11 else 1 for height11 in friends_heights11)\r\n\r\nprint(min_width11)\r\n", "n, h = map(int, input().split()) # Number of friends and fence height\r\nheights = list(map(int, input().split())) # Heights of friends\r\n\r\nwidth = 0\r\n\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs a width of 2 to bend down\r\n else:\r\n width += 1 # Friend needs a width of 1\r\n\r\nprint(width)\r\n", "#n=number of friends, h=fence height\r\nn, h = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if f[i] > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\nprint(c)\r\n\r\n", "z,x = map(int,input().split())\r\na = map(int,input().split())\r\nm = 0\r\nfor i in a:\r\n if i<=x:\r\n m+=1\r\n else:\r\n m+=2\r\nprint(m)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=0\r\nfor i in l:\r\n if i>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split(\" \"))\r\nm=list(map(int,input().split(\" \")))\r\n\r\nans= n\r\nfor i in m:\r\n if i>h:\r\n ans+=1\r\nprint(ans)", "nandh=input().split()\r\nmanh=input().split()\r\nmanhights=[]\r\nwall_h=int(nandh[1])\r\nwideroad=0\r\nfor i in manh:\r\n manhights.append(int(i))\r\nfor x in manhights:\r\n if x>wall_h:wideroad+=2\r\n else:wideroad+=1\r\nprint(wideroad)\r\n", "line1 = input()\r\nline2 = input()\r\n\r\nline1Array = list(map(int, line1.split()))\r\nlistHeightOfPerson = list(map(int, line2.split()))\r\n\r\nnumOfPerson = line1Array[0]\r\nheightOfFence = line1Array[1]\r\n\r\nsumOfWidth = 0\r\n\r\nfor heightOfPerson in listHeightOfPerson:\r\n if heightOfPerson > heightOfFence:\r\n sumOfWidth += 2\r\n else:\r\n sumOfWidth += 1\r\n\r\nprint(sumOfWidth)\r\n\r\n\r\n\r\n", "n,h = map(int,input().split())\nl = input().split()\nres = 0\nfor p in l:\n if int(p)<=h:\n res+=1\n else:\n res+=2\n\nprint(res)\n", "n, h = map(int, input().split())\r\nfriend_heights = list(map(int, input().split()))\r\n\r\nminimum_width = 0\r\n\r\nfor height in friend_heights:\r\n if height > h:\r\n minimum_width += 2 # If the person is taller than the fence, they need 2 units of width.\r\n else:\r\n minimum_width += 1 # If the person is shorter than or equal to the fence, they need 1 unit of width.\r\n\r\nprint(minimum_width)\r\n", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if l[i]<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\nn , h = map(int,input().split())\nh1 = 0\nh2 = 0\nh_list = list(map(int,input().split()))\nfor height in (h_list):\n if height <= h:\n h1 += 1\n elif height > h:\n h2 += 1\nprint (h1+(2h2))", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=n\r\nfor i in range(n):\r\n if a[i]>h:\r\n w+=1\r\nprint(w)\r\n ", "# https://codeforces.com/problemset/problem/677/A\n_, h_fence = map(int, input().split(\" \"))\nheights = list(map(int, input().split(\" \")))\nwidth = 0\nfor h in heights:\n if h <= h_fence:\n width += 1\n else:\n width += 2\nprint(width)\n", "n,h=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nflag=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n flag+=2\r\n else:\r\n flag+=1\r\nprint(flag)", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = n\r\nfor each in arr:\r\n if each > h:\r\n ans += 1\r\n \r\nprint(ans)", "n,h=map(int,input().split())\r\nans=0\r\nli=list(map(int,input().split()))\r\n# print(li)\r\nfor i in li:\r\n if i>h:\r\n # print(\"+2(\",i,\")\")\r\n ans=ans+2\r\n else:\r\n # print(\"+1(\",i,\")\")\r\n ans=ans+1\r\nprint(ans)", "n,h = map(int,input().split(\" \"))\r\nheight = map(int, input().split(\" \"))\r\ncount = 0\r\n\r\nfor i in height :\r\n if i <= h :\r\n count +=1\r\n if i > h :\r\n count +=2\r\nprint(count)", "n, h = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ntotal = 0\r\nfor fr in lst:\r\n if fr > h:\r\n total += 1\r\n total += 1\r\nprint(total)\r\n", "n, h = map(int, input().split())\r\nprint(sum(2 if i > h else 1 for i in list(map(int, input().split()))))\r\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = n + sum(1 if height > h else 0 for height in heights)\r\n\r\nprint(width)\r\n", "tmp = input()\r\ntmp = tmp.split()\r\nn = int(tmp[0])\r\nh = int(tmp[1])\r\nfriends = input()\r\nfriends = friends.split()\r\nwidth = 0\r\n\r\nfor friend in friends:\r\n if int(friend) > h:\r\n width += 2\r\nprint(int(0.5 * width + len(friends)))", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nstnd = 0\r\nbnd = 0\r\n\r\nfor i in range(n):\r\n\tif a[i] > h:\r\n\t\tbnd += 1\r\n\telse:\r\n\t\tstnd += 1\r\n\r\nprint(2 * bnd + stnd)", "n, k = map(int, input().split())\r\nheight1=0\r\nlst = list(map(int, input().split()))\r\nfor j in range(len(lst)):\r\n\tif lst[j] > k:\r\n\t\theight1+=2\r\n\telse:\r\n\t\theight1+=1\r\nprint(height1)", "nh = input().split()\nn, h = int(nh[0]), int(nh[1])\nfriends = input().split()\nwidth = 0\nfor i in friends:\n if int(i)>h:\n width +=2\n else:\n width +=1\nprint(width)\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nsum=0\narr=[int(i) for i in input().split()]\nfor i in range (n):\n if arr[i]<=h:\n sum+=1\n else:\n sum+=2\n\nprint(sum)\n \t\t\t\t\t \t \t\t\t\t\t \t \t \t \t\t", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\nfor friend in heights:\r\n if friend <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\nheight=input()\r\nlis=[int(x)for x in height.split()]\r\nwidth,count=0,0\r\nfor i in range(0,n):\r\n if lis[i]<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)\r\n", "a, b = map(int,input().split())\r\nm = 0\r\nnumbers = input().split()\r\nnumbers = list(map(int, numbers))\r\nfor i in range(a):\r\n if numbers[i] <= b:\r\n m = m + 1\r\n else:\r\n m = m + 2\r\nprint(m)", "a, b = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nd=0\r\nfor i in c:\r\n if i>b:\r\n d+=2\r\n else:\r\n d+=1\r\nprint(d)\r\n", "import functools\r\nimport operator\r\n\r\ninput1 = input()\r\ninput2 = input()\r\n\r\n# fence height is the second part of the first string. \r\n# get by splitting on space and then convert to an int\r\nfenceHeight = int(input1.split(\" \")[1])\r\n\r\n# next line contains a list of all the friends height\r\n# if the friend is greater than the height of the fence, then he will have to hunch over\r\n# and he will be 2 untis wide\r\n# otherwise, just 1 unit wide\r\n# go through the list of heights and figure if 2 or 1\r\nfriendWidths = map(lambda a: 2 if int(a) > fenceHeight else 1, input2.split(\" \"))\r\n\r\n# simply sum up all the widths and print\r\nprint(sum(friendWidths))", "n,h = input().split()\narr = list(map(int,input().split()))\nn = int(n)\nh = int(h)\nwidth = 0\nwidth = int(width)\nfor i in range(0,n):\n if arr[i] <= h:\n width += 1\n else:\n width += 2\nprint(width)\n \t \t\t\t\t\t \t\t\t \t \t\t \t \t", "n = [int(i) for i in input().split()]\r\nsq = [int(i) for i in input().split()]\r\nq = 0\r\ns = 0\r\nwhile s != len(sq):\r\n if sq[s] <= n[1]:\r\n q += 1\r\n else:\r\n if sq[s] % n[1] != 0:\r\n q += sq[s] // n[1] + 1\r\n else:\r\n q += sq[s] // n[1]\r\n s+=1\r\nprint(q)", "h,d=input().split()\nh=int(h)\nd=int(d)\na=input()\nx=a.split()\nc = 0\nfor i in range (len(x)):\n x[i]=int (x[i])\n if x[i] >d:\n c+=2\n else:\n c+=1\nprint(c)\n \t\t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t \t\t \t\t", "n,h=map(int,input().split())\r\n\r\nfh = list(map(int,input().split()))\r\nmaxW = 0\r\nfor i in fh:\r\n if i > h:\r\n maxW+=2\r\n else:\r\n maxW+=1\r\n\r\nprint(maxW)\r\n\r\n\r\n", "n, h = input().split()\r\nn, h = int(n), int(h)\r\n\r\na = input().split()\r\n\r\nrez = 0\r\n\r\nfor i in a:\r\n if int(i) <= h:\r\n rez += 1\r\n if int(i) > h:\r\n rez += 2\r\n\r\nprint(rez)", "n,h = map(int,input().split())\r\nar = list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n if ar[i]<=h:\r\n sum = sum +1\r\n else:\r\n sum = sum+2\r\nprint(sum)", "n, h = map(int, input().split())\nheights = list(map(int, input().split()))\n\nfriends = 0\nfor height in heights:\n if height > h:\n friends += 2\n else:\n friends += 1\n\nprint(friends)\n\t\t\t \t \t \t\t \t \t \t \t \t\t", "n,h = map(int,input().split(' '))\r\nnumbers = map(int,input().split(' '))\r\ncounter=0\r\n\r\nfor item in numbers:\r\n if item<=h:\r\n counter+=1\r\n else:\r\n counter+=2\r\n\r\nprint(counter)", "a=list(map(int, input().split()))\r\nn=list(map(int, input().split()))\r\ns=0\r\nfor i in range(a[0]):\r\n if n[i]>a[1]:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "n,h = map(int, input().split())\nheight = list(map(int, input().split()))\n\ncount = 0\nfor i in height:\n if i > h:\n count+=2\n else:\n count+=1\nprint(count)\n ", "n, h = list(map(int, input().split()))\nai = list(map(int, input().split()))\nroad = 0\nfor i in ai:\n if i <= h:\n road += 1\n else:\n road += 2\nprint(road)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\nr=[]\r\nfor j in a:\r\n r.append(j)\r\n\r\ncount=0\r\nfor k in range(n):\r\n if r[k]>h:\r\n count=count+1\r\n k=k+1\r\nx=n-count\r\nprint((2count)+x)\r\n\r\n\r\n\r\n", "n,h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nnum=n\r\nlist=input().split()\r\nfor i in range(n):\r\n if int(list[i])>h:\r\n num+=1\r\nprint(num)\r\n", "n,h = map(int, input().split())\nlst =[int(i) for i in input().split()]\nc = 0\nfor i in range(n):\n if lst[i]>h:c+=2\n else:c+=1\nprint(c)\n \t\t\t\t \t\t\t\t\t\t\t \t\t \t\t\t \t", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ncount = 0\r\n\r\nfor i in range(a[0]):\r\n if b[i] > a[1]:\r\n count += 1\r\n count += 1\r\nprint(count)\r\n\r\n", "w=0\r\na=list(map(int,input().split()))\r\nn=a[0]\r\nh=a[1]\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)\r\n", "x, y = map(int,input().split())\r\nheight = list(map(int,input().split()))\r\n\r\nans = 0\r\nfor i in height:\r\n if i>y:\r\n ans+=2\r\n else:\r\n ans+=1\r\n\r\nprint(ans)", "\"\"\"\r\nwidth of person upright = 1\r\nwidth of person hunched = 2\r\n\r\nPicture:\r\nFence\r\n\|\r\n\|\r\n\| IIooIoI (Friends walking upright and hunched)\r\n\|\r\n\|\r\n\r\nInput 1 = the number of friends, the height of fence\r\nInput 2 = the height of each person\r\n\"\"\"\r\n\r\ninput1 = input().split()\r\nfriendHeight = input().split()\r\n\r\nfriends = int(input1[0])\r\nfenceHeight = int(input1[1])\r\n\r\ncounter = 0\r\n\r\nfor n in range(friends):\r\n\r\n if int(friendHeight[n]) > fenceHeight:\r\n counter += 2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\nc=0\r\nfor i in l:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = map(int, input().split())\r\ndruz = input().split()\r\ndlin = 0\r\nfor i in range(n):\r\n if int(druz[i]) <= h:\r\n dlin += 1\r\n else:\r\n dlin += 2\r\nprint(dlin)", "N,T = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(N):\r\n if a[i] > T:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "# Source: https://usaco.guide/general/io\n\nn, h = map(int, input().split())\na = map(int, input().split())\nt = 0\nfor i in a:\n\tif i > h: t += 2\n\telse: t += 1\nprint (t)", "a, b = input().split()\r\nc = input().split()\r\nresult = int(a)\r\nfor i in c:\r\n if int(i) > int(b):\r\n result += 1\r\n\r\nprint(result)", "n, h = input().split()\r\nn, h = int(n), int(h)\r\nheights = input().split()\r\ntall = 0\r\nfor i in range(len(heights)):\r\n heights[i] = int(heights[i])\r\nfor j in heights:\r\n if j > h:\r\n tall += 1\r\nwidth = (n-tall) + (tall2)\r\nprint(width)\r\n\r\n \r\n", "n,h=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n c=c+2 if i>h else c+1\r\nprint(c)", "n,h = map(int, input().split())\r\nmin_width = 0\r\n\r\nheight = list(map(int, input().split()))\r\nfor j in range(n):\r\n if height[j] > h:\r\n min_width += 2\r\n else:\r\n min_width += 1\r\n\r\nprint(min_width)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Sep 25 17:15:09 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nlist1=input().split()\r\nn=int(list1[0])\r\nh=int(list1[1])\r\nheight=input().split()\r\nfor i in height:\r\n if int(i)>h:\r\n n=n+1\r\nprint(n)", "x=input(\"\")\r\ny=input(\"\")\r\nl1=x.split(\" \")\r\nl2=y.split(\" \")\r\nc=0\r\nfor i in l2:\r\n if int(i)>int(l1[1]):\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = (int(x) for x in input().split())\r\nw=0\r\nfor i in map(int, input().split()):\r\n if i > h:\r\n w+= 2\r\n else:\r\n w+=1\r\nprint(w)", "import math\r\nst1=input()\r\nst2=input()\r\nvalues1=[int(i) for i in st1.split()]\r\nvalues2=[int(i) for i in st2.split()]\r\nc=0\r\nfor i in range(values1[0]):\r\n if(values2[i]/values1[1]<=1):\r\n c+=1\r\n else:\r\n c+=math.ceil(values2[i]/values1[1])\r\n \r\nprint(c)\r\n", "n, h = map(int, input().split(' '))\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\nres = 0\r\nfor each in a:\r\n if each > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "inpt = input() .split(\" \")\r\nheights= input().split(\" \")\r\ni=0\r\nfor k in range(int(inpt[0])):\r\n if int(heights[k])>int(inpt[1]):\r\n i+=2\r\n else :\r\n i+=1\r\nprint(i)", "n , h = map(int,input().split())\r\nheights = list(map(int, input().split()))\r\nwidth = 0\r\nfor height in heights:\r\n if height <= h:\r\n width += 1\r\n else:\r\n width += 2\r\nprint(width)", "n,h = map(int,input().split())\r\nc = input().split()\r\nw = 0\r\nfor i in range(n):\r\n if int(c[i]) <= h:\r\n w += 1\r\n else:\r\n w += 2\r\nprint(w)", "a,b=map(int,input().split())\r\nSOL=0\r\no=list(map(int,input().split()))\r\n \r\nfor i in o:\r\n if i>b:\r\n \r\n SOL=SOL+2\r\n else:\r\n \r\n SOL=SOL+1\r\nprint(SOL)", "n, h = map(int,input().split())\nl = list(map(int,input().split()))\n\ntw = 0\nfor hie in l:\n if hie > h:\n tw += 2\n else:\n tw += 1\nprint(tw)", "line1=(input())\r\nline2=(input())\r\nnum1,num2=line1.split()\r\nline2=line2.split()\r\nout=0\r\n\r\n\r\narr=[]\r\nfor i in line2:\r\n arr.append(int(i))\r\n\r\nfor x,i in enumerate(arr):\r\n if int(arr[x])<=int(num2):\r\n out+=1\r\n else:\r\n out+=2\r\n\r\nprint(out)", "import sys\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef int_to_arr():\r\n return list(map(int, str(input()).strip()))\r\n\r\n\r\ndef insr():\r\n return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\n\r\n# def is_upper(a):\r\n# return ord(a) >= 65 and ord(a) <= 90\r\n\r\n\r\n# def is_lower(a):\r\n# return ord(a) >= 97 and ord(a) <= 122\r\n\r\n\r\n# def to_upper(a):\r\n# ans = \"\"\r\n# for i in a:\r\n# if ord(i) >= 97 and ord(i) <= 122:\r\n# ans = ans + chr(ord(i) - 32)\r\n# else:\r\n# ans = ans + i\r\n# return ans\r\n\r\n\r\n# def to_lower(a):\r\n# ans = \"\"\r\n# for i in a:\r\n# if ord(i) >= 65 and ord(i) <= 90:\r\n# ans = ans + chr(ord(i) + 32)\r\n# else:\r\n# ans = ans + i\r\n# return ans\r\n\r\n\r\ndef reverse_string(s):\r\n ans = \"\"\r\n for i in s[::-1]:\r\n ans = ans + i\r\n return ans\r\n\r\n\r\ndef main():\r\n input1 = inlt()\r\n input2 = inlt()\r\n\r\n height_of_fense = input1[1]\r\n width = 0\r\n for i in input2:\r\n if i > height_of_fense:\r\n width += 2\r\n else:\r\n width += 1\r\n out(width)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\r\nn,h=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nc=0\r\nfor i in ls:\r\n c+=ceil(i/h)\r\nprint(c)", "import sys\r\nline1 = sys.stdin.readline().strip().split()\r\nline2 = sys.stdin.readline().strip().split()\r\nanswer = 0\r\nfor i in line2:\r\n if int(i) <= int(line1[1]):\r\n answer += 1\r\n else:\r\n answer += 2\r\nprint(answer)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i>m:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "n, h = map(int, input().split())\r\nA = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in A:\r\n sum +=1\r\n if i>h:\r\n sum +=1\r\nprint(sum)\r\n", "# Read input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width\r\nmin_width = 0\r\n\r\n# Calculate the minimum width\r\nfor height in heights:\r\n if height > h:\r\n min_width += 2\r\n else:\r\n min_width += 1\r\n\r\n# Print the minimum width\r\nprint(min_width)\r\n", "n, h = map(int,input().split())\r\na=list(map(int,input().split()))\r\nt = 0\r\nfor i in a : \r\n if i > h : t+=2\r\n else : t+=1\r\nprint(t)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Sep 11 21:19:51 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\ns=0\r\nn,h=[int(x) for x in input().split()]\r\nlist=[int(y) for y in input().split()]\r\nfor k in list:\r\n if k>h: \r\n s+=1\r\n else:\r\n pass\r\nprint(n+s)", "n = input().split()\nn1 = [int(a) for a in n]\nnum = input().split()\ncount = 0\nfor number in num:\n\tif int(number) <= n1[1]:\n\t\tcount = count + 1\n\telse:\n\t\tcount = count + 2\n\nprint(count)", "def fun(n, h, heights):\r\n width = 0\r\n for height in heights:\r\n if height > h:\r\n width += 2\r\n else:\r\n width += 1\r\n return width\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nprint(fun(n, h, heights))", "n,h = list(map(int,input().split()))\r\npeople = list(map(int,input().split()))\r\n\r\nresult = 0\r\nfor i in people:\r\n if i > h:\r\n result += 2\r\n else:\r\n result += 1\r\n\r\nprint(result)", "num,h=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nc=sum(1 for hei in height if hei> h)\r\nres=num+c\r\nprint(res)", "# --- #\r\ngroup, fence_h = [int(n) for n in input().split()]\r\nw = 0\r\npersons_h = [int(x) for x in input().split()]\r\nfor i in persons_h:\r\n if i > fence_h : \r\n w += 2\r\n else :\r\n w += 1\r\n# ---\r\nprint(w)\r\n", "n , h = map(int,input().split())\r\nx = input().split()\r\nc = 0\r\n\r\nfor i in range(n):\r\n if int(x[i]) > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\nprint(c)", "a = input().split(' ')\r\nn, h = int(a[0]), int(a[1])\r\nb = list(map(int,input().split(' ')))\r\nwidth = 0\r\nfor i in b:\r\n if i > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "N,h,v=map(int,open(0).read().split());print(N+sum(n>h for n in v))", "n,h = map(int, input().split())\r\nperson = list(map(int, input().split()))\r\nlength = []\r\nfor i in range(n):\r\n if person[i] > h:\r\n length.append(2)\r\n else:\r\n length.append(1)\r\n\r\nprint(sum(length)) ", "n, h = map(int, input().split())\nnums = list(map(int, input().split()))\nwidth = 0\nfor x in nums:\n if x > h: width += 2\n else: width += 1\n\nprint(width)\n ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n if i>h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)\r\n \r\n", "n,h=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ncountl,countm=0,0\r\nfor i in ar:\r\n if i>h:\r\n countm += 2\r\n else:\r\n countl += 1\r\nprint(countl+countm)", "line_1 = input()\r\nline_2 = input()\r\n\r\nwidth = 0\r\n\r\nn, h = line_1.split()\r\nn = int(n)\r\nh = int(h)\r\n\r\n\r\nheights = line_2.split()\r\n\r\nfor height in heights:\r\n if int(height) > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nl=0\r\nfor i in x:\r\n if b>=i:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn, h = map(int, input().split())\nnums = list(map(int, input().split()))\nwidth = 0\n\nfor num in nums:\n if num > h:\n width += 2\n\n else:\n width += 1\n\nsys.stdout.write(f\"{width}\")\n", "quantity_peoples, height_wall = map(int, input().split())\r\nmin_width_road = 0\r\nheight_people = list(map(int, input().split()))\r\nfor i in range(quantity_peoples):\r\n if height_people[i] > height_wall:\r\n min_width_road += 2\r\n else:\r\n min_width_road += 1\r\nprint(min_width_road)", "def minimum_road_width():\r\n\tn, h = input().split()\r\n\twidth = 0 \r\n\t#for i in len(n):\r\n\theight = input().split(' ')\r\n\theights = [int(i) for i in height]\r\n\tfor i in range(len(heights)):\r\n\t\tif heights[i] <= int(h):\r\n\t\t\twidth += 1\r\n\t\telse:\r\n\t\t\twidth += 2\r\n\treturn width\r\n\r\nprint(minimum_road_width())", "a,b=map(int,input().split())\r\nc=0\r\nli = list(map(int,input().split()))\r\nfor i in range(0,a):\r\n if(li[i]<=b):\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=n\r\nfor i in range(n):\r\n if a[i]>h:\r\n r+=1\r\nprint(r)\r\n\r\n", "n, h = map(int, input().split())\r\nls = list(map(int,input().split()))\r\ncnt_One = 0\r\ncnt_Two = 0\r\nfor i in ls:\r\n if i > h:\r\n cnt_Two += 1\r\n else:\r\n cnt_One += 1\r\nprint(cnt_One + 2cnt_Two)\r\n", "list1=input().split()\r\nn=int(list1[0])\r\nh=int(list1[1])\r\nheight=input().split()\r\nfor i in height:\r\n n+=(1if(int(i)>h)else 0)\r\nprint(n)", "n,h = map(int,input().split())\r\nh2 = list(map(int,input().split()))\r\nw = 0\r\nfor h1 in h2:\r\n if h1 > h:\r\n w = w + 2\r\n else:\r\n w = w + 1\r\nprint(w)", "n, h = list(map(int,input().split()))\r\nheights = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(n):\r\n if heights[i]>h:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)\r\n", "n,m = map(int, input().split())\r\nheight = list(map(int, input().split()))\r\ncount = n\r\nfor i in range(n):\r\n if height[i] > m:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "n, h = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ns = 0\r\nfor i in arr:\r\n if i>h :\r\n s = s + 2\r\n else :\r\n s = s + 1\r\nprint(s)", "a=input().split()\r\nb=input().split()\r\nl=[]\r\nfor i in b:\r\n if int(i)>int(a[-1]):\r\n l.append(2)\r\n else:\r\n l.append(1)\r\nprint(sum(l))", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=0\r\nfor i in l:\r\n if i<=h:\r\n width+=1\r\n elif i>h:\r\n width+=2\r\nprint(width)\r\n", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 0\r\nfor i in a:\r\n if i <= h:\r\n w += 1\r\n else:\r\n w += 2\r\nprint(w)\r\n" ]	{"inputs": ["3 7\n4 5 14", "6 1\n1 1 1 1 1 1", "6 5\n7 6 8 9 10 5", "10 420\n214 614 297 675 82 740 174 23 255 15", "10 561\n657 23 1096 487 785 66 481 554 1000 821", "100 342\n478 143 359 336 162 333 385 515 117 496 310 538 469 539 258 676 466 677 1 296 150 560 26 213 627 221 255 126 617 174 279 178 24 435 70 145 619 46 669 566 300 67 576 251 58 176 441 564 569 194 24 669 73 262 457 259 619 78 400 579 222 626 269 47 80 315 160 194 455 186 315 424 197 246 683 220 68 682 83 233 290 664 273 598 362 305 674 614 321 575 362 120 14 534 62 436 294 351 485 396", "100 290\n244 49 276 77 449 261 468 458 201 424 9 131 300 88 432 394 104 77 13 289 435 259 111 453 168 394 156 412 351 576 178 530 81 271 228 564 125 328 42 372 205 61 180 471 33 360 567 331 222 318 241 117 529 169 188 484 202 202 299 268 246 343 44 364 333 494 59 236 84 485 50 8 428 8 571 227 205 310 210 9 324 472 368 490 114 84 296 305 411 351 569 393 283 120 510 171 232 151 134 366", "1 1\n1", "1 1\n2", "46 71\n30 26 56 138 123 77 60 122 73 45 79 10 130 3 14 1 38 46 128 50 82 16 32 68 28 98 62 106 2 49 131 11 114 39 139 70 40 50 45 137 33 30 35 136 135 19", "20 723\n212 602 293 591 754 91 1135 640 80 495 845 928 1399 498 926 1431 1226 869 814 1386", "48 864\n843 1020 751 1694 18 1429 1395 1174 272 1158 1628 1233 1710 441 765 561 778 748 1501 1200 563 1263 1398 1687 1518 1640 1591 839 500 466 1603 1587 1201 1209 432 868 1159 639 649 628 9 91 1036 147 896 1557 941 518", "26 708\n549 241 821 734 945 1161 566 1268 216 30 1142 730 529 1014 255 168 796 1148 89 113 1328 286 743 871 1259 1397", "75 940\n1620 1745 1599 441 64 1466 1496 1239 1716 1475 778 106 1136 1212 1261 444 781 257 1071 747 626 232 609 1544 682 1326 469 1361 1460 1450 1207 1319 922 625 1737 1057 1698 592 692 80 1016 541 1254 201 682 1007 847 206 1066 809 259 109 240 1611 219 1455 1326 1377 1827 786 42 1002 1382 1592 543 1866 1198 334 1524 1760 340 1566 955 257 1118"], "outputs": ["4", "6", "11", "13", "15", "144", "145", "1", "2", "63", "31", "75", "41", "116"]}	UNKNOWN	PYTHON3	CODEFORCES	889
d3765fa3113a54c91060c293e49d86cc	Strange Calculation and Cats	Gosha's universe is a table consisting of n rows and m columns. Both the rows and columns are numbered with consecutive integers starting with 1. We will use (r,<=c) to denote a cell located in the row r and column c. Gosha is often invited somewhere. Every time he gets an invitation, he first calculates the number of ways to get to this place, and only then he goes. Gosha's house is located in the cell (1,<=1). At any moment of time, Gosha moves from the cell he is currently located in to a cell adjacent to it (two cells are adjacent if they share a common side). Of course, the movement is possible only if such a cell exists, i.e. Gosha will not go beyond the boundaries of the table. Thus, from the cell (r,<=c) he is able to make a move to one of the cells (r<=-<=1,<=c), (r,<=c<=-<=1), (r<=+<=1,<=c), (r,<=c<=+<=1). Also, Ghosha can skip a move and stay in the current cell (r,<=c). Besides the love of strange calculations, Gosha is allergic to cats, so he never goes to the cell that has a cat in it. Gosha knows exactly where and when he will be invited and the schedule of cats travelling along the table. Formally, he has q records, the i-th of them has one of the following forms: - 1, xi, yi, ti — Gosha is invited to come to cell (xi,<=yi) at the moment of time ti. It is guaranteed that there is no cat inside cell (xi,<=yi) at this moment of time. - 2, xi, yi, ti — at the moment ti a cat appears in cell (xi,<=yi). It is guaranteed that no other cat is located in this cell (xi,<=yi) at that moment of time. - 3, xi, yi, ti — at the moment ti a cat leaves cell (xi,<=yi). It is guaranteed that there is cat located in the cell (xi,<=yi). Gosha plans to accept only one invitation, but he has not yet decided, which particular one. In order to make this decision, he asks you to calculate for each of the invitations i the number of ways to get to the cell (xi,<=yi) at the moment ti. For every invitation, assume that Gosha he starts moving from cell (1,<=1) at the moment 1. Moving between two neighboring cells takes Gosha exactly one unit of tim. In particular, this means that Gosha can come into the cell only if a cat sitting in it leaves the moment when Gosha begins his movement from the neighboring cell, and if none of the cats comes to the cell at the time when Gosha is in it. Two ways to go from cell (1,<=1) to cell (x,<=y) at time t are considered distinct if for at least one moment of time from 1 to t Gosha's positions are distinct for the two ways at this moment. Note, that during this travel Gosha is allowed to visit both (1,<=1) and (x,<=y) multiple times. Since the number of ways can be quite large, print it modulo 109<=+<=7. The first line of the input contains three positive integers n, m and q (1<=≤<=n·m<=≤<=20,<=1<=≤<=q<=≤<=10<=000) — the number of rows and columns in the table and the number of events respectively. Next q lines describe the events, each description contains four integers tpi, xi, yi and ti (1<=≤<=tp<=≤<=3,<=1<=≤<=x<=≤<=n,<=1<=≤<=y<=≤<=m,<=2<=≤<=t<=≤<=109) — the type of the event (1 if Gosha gets an invitation, 2 if a cat comes to the cell and 3 if a cat leaves the cell), the coordinates of the cell where the action takes place and the moment of time at which the action takes place respectively. It is guaranteed that the queries are given in the chronological order, i.e. ti<=<<=ti<=+<=1. For each invitation i (that is, tpi<==<=1) calculate the number of ways to get to cell (xi,<=yi) at the moment of time ti. Respond to the invitations chronologically, that is, in the order they appear in the input. Sample Input 1 3 3 2 1 2 3 3 1 2 5 1 1 1 7 3 3 3 2 2 2 2 1 3 3 5 1 3 3 7 4 5 5 2 2 5 3 2 2 4 6 3 2 4 9 1 4 4 13 1 4 4 15 Sample Output 5 2 42 490902 10598759	[ "import sys\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\nM = 10*9 + 7\n\n\ndef smvmul(d, m, v):\n return [sum(m[r][k] v[k] for k in range(d)) % M for r in range(d)]\n\n\ndef smmul(d, m1, m2):\n return [[sum(m1[r][k] * m2[k][c] for k in range(d)) % M\n for c in range(d)] for r in range(d)]\n\n\ndef smpow(d, m, p):\n a = None\n while p > 1:\n if p % 2:\n if a is None:\n a = m\n else:\n a = smmul(d, a, m)\n m = smmul(d, m, m)\n p //= 2\n return m if (a is None) else smmul(d, a, m)\n\n\ndef process(n, m, events):\n d = nm\n v = [0 for _ in range(d)]\n v[0] = 1\n\n a = [[0 for _ in range(d)] for _ in range(d)]\n for r in range(1, n+1):\n for c in range(1, m+1):\n i = (r-1)m + (c-1)\n a[i][i] = 1\n if r > 1:\n a[i][i-m] = 1\n a[i-m][i] = 1\n if c > 1:\n a[i][i-1] = 1\n a[i-1][i] = 1\n\n # from pprint import pprint\n # pprint([[v[rm+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n\n t = 1\n for event in events:\n ee, er, ec, et = event\n if t < et:\n # print(f\"POW {et-t}\", file=sys.stderr)\n # pprint([[v[rm+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n # pprint(a, stream=sys.stderr)\n ap = smpow(d, a, et-t)\n v = smvmul(d, ap, v)\n # pprint(ap, stream=sys.stderr)\n # pprint([[v[rm+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n t = et\n ei = (er-1)m + (ec-1)\n if ee == 1:\n # print(f\"QRY {er} {ec} {ei} {v[ei]}\", file=sys.stderr)\n yield v[ei]\n else:\n v[ei] = 0\n b = 0 if (ee == 2) else 1\n # print(f\"CAT {er} {ec} {ei} {b}\", file=sys.stderr)\n a[ei][ei] = b\n if er > 1:\n a[ei][ei-m] = b\n if ec > 1:\n a[ei][ei-1] = b\n if er < n:\n a[ei][ei+m] = b\n if ec < m:\n a[ei][ei+1] = b\n # pprint([[v[rm+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n # pprint(a, stream=sys.stderr)\n\ndef pl(line):\n e, r, c, t = map(int, line.split())\n return e, r, c, t\n\n\ndef main():\n n, m, q = map(int, input().split())\n events = (pl(input()) for _ in range(q))\n for k in process(n, m, events):\n print(k)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n print(f\"TEST {k}\", file=sys.stderr)\n i, o = test\n with patchio(i) as r:\n main()\n if r.getvalue() == o:\n print(\"OK\\n\", file=sys.stderr)\n else:\n print(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\", file=sys.stderr)\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\ntests = [(\"\"\"\\\n1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7\n\"\"\", \"\"\"\\\n5\n\"\"\"), (\"\"\"\\\n3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n\"\"\", \"\"\"\\\n2\n42\n\"\"\"), (\"\"\"\\\n4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n\"\"\", \"\"\"\\\n490902\n10598759\n\"\"\")]\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n" ]	{"inputs": ["1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7", "3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7", "4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15", "1 1 1\n1 1 1 2", "3 3 1\n1 3 3 5", "2 2 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115", "1 2 3\n1 1 1 2\n1 1 2 5\n1 1 1 19", "1 1 4\n2 1 1 2\n3 1 1 5\n1 1 1 7\n1 1 1 10", "2 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5", "1 20 2\n1 1 20 100000001\n1 1 20 1000000000", "2 2 10\n1 2 2 185\n1 2 2 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300", "1 1 10\n2 1 1 227\n3 1 1 238\n2 1 1 286\n3 1 1 292\n2 1 1 295\n3 1 1 296\n1 1 1 297\n2 1 1 298\n3 1 1 299\n1 1 1 300", "20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300", "1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 300"], "outputs": ["5", "2\n42", "490902\n10598759", "1", "6", "703708091", "1\n8\n131072", "0\n0", "2\n10", "452548876\n224409846", "990123599\n781690482\n617361700", "0\n0", "26508505\n16907334\n673189879", "272600817\n593383272\n555850892\n746491153\n78394828"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d377f3b3aaa38b4a7edac7027b9c009a	Selling Souvenirs	After several latest reforms many tourists are planning to visit Berland, and Berland people understood that it's an opportunity to earn money and changed their jobs to attract tourists. Petya, for example, left the IT corporation he had been working for and started to sell souvenirs at the market. This morning, as usual, Petya will come to the market. Petya has n different souvenirs to sell; ith souvenir is characterised by its weight wi and cost ci. Petya knows that he might not be able to carry all the souvenirs to the market. So Petya wants to choose a subset of souvenirs such that its total weight is not greater than m, and total cost is maximum possible. Help Petya to determine maximum possible total cost. The first line contains two integers n and m (1<=≤<=n<=≤<=100000, 1<=≤<=m<=≤<=300000) — the number of Petya's souvenirs and total weight that he can carry to the market. Then n lines follow. ith line contains two integers wi and ci (1<=≤<=wi<=≤<=3, 1<=≤<=ci<=≤<=109) — the weight and the cost of ith souvenir. Print one number — maximum possible total cost of souvenirs that Petya can carry to the market. Sample Input 1 1 2 1 2 2 1 3 2 2 4 3 3 10 2 7 2 8 1 1 Sample Output 0 3 10	[ "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10*9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m = map(int, input().split())\r\nc1, c2, c3 = [0], [0], [0]\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if x == 3:\r\n c3.append(y)\r\n elif x == 2:\r\n c2.append(y)\r\n else:\r\n c1.append(y)\r\nc1.sort(reverse=True)\r\nc2.sort(reverse=True)\r\nc3.sort(reverse=True)\r\n\r\ndp = [None for i in range(m+1)]\r\ndp[0] = (0, 0, 0)\r\ndp[1] = (c1[0], 1, 0)\r\nfor i in range(2, m+1):\r\n if dp[i-1][1] == len(c1):\r\n x1 = (dp[i-1][0], dp[i-1][1], dp[i-1][2])\r\n else:\r\n x1 = (dp[i-1][0]+c1[dp[i-1][1]], dp[i-1][1]+1, dp[i-1][2])\r\n if dp[i-2][2] == len(c2):\r\n x2 = (dp[i-2][0], dp[i-2][1], dp[i-2][2])\r\n else:\r\n x2 = (dp[i-2][0]+c2[dp[i-2][2]], dp[i-2][1], dp[i-2][2]+1)\r\n if x1[0] > x2[0]:\r\n dp[i] = x1\r\n else:\r\n dp[i] = x2\r\n\r\nans = 0\r\ncost3 = 0\r\nfor i in range(len(c3)):\r\n cost3 += c3[i-1]\r\n cap = m - 3i\r\n if cap < 0: break\r\n ans = max(ans, cost3+dp[cap][0])\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw1, w2, w3 = [], [], []\r\nfor _ in range(n):\r\n w, c = map(int, input().split())\r\n if w == 1:\r\n w1.append(c)\r\n elif w == 2:\r\n w2.append(c)\r\n else:\r\n w3.append(c)\r\nw1.sort(reverse = True)\r\nw2.sort(reverse = True)\r\nw3.sort(reverse = True)\r\nl1, l2, l3 = len(w1), len(w2), len(w3)\r\ndp = [0] * (m + 2)\r\ndp1 = [0] * (m + 2)\r\ndp2 = [0] * (m + 2)\r\nfor i in range(m):\r\n dpi, dp1i, dp2i = dp[i], dp1[i], dp2[i]\r\n if dp1i < l1 and dp[i + 1] < dpi + w1[dp1i]:\r\n dp[i + 1] = dpi + w1[dp1i]\r\n dp1[i + 1], dp2[i + 1] = dp1i + 1, dp2i\r\n if dp2i < l2 and dp[i + 2] < dpi + w2[dp2i]:\r\n dp[i + 2] = dpi + w2[dp2i]\r\n dp1[i + 2], dp2[i + 2] = dp1i, dp2i + 1\r\n if dp1i + 1 < l1 and dp[i + 2] < dpi + w1[dp1i] + w1[dp1i + 1]:\r\n dp[i + 2] = dpi + w1[dp1i] + w1[dp1i + 1]\r\n dp1[i + 2], dp2[i + 2] = dp1i + 2, dp2i\r\nfor i in range(1, m + 1):\r\n dp[i] = max(dp[i], dp[i - 1])\r\nans = dp[m]\r\nc = 0\r\nfor i in range(l3):\r\n m -= 3\r\n if m < 0:\r\n break\r\n c += w3[i]\r\n ans = max(ans, dp[m] + c)\r\nprint(ans)", "import sys\r\nn, m = map(int, input().split())\r\nw1 = []\r\nw2 = []\r\nw3 = [10*10]\r\n\r\nfor w, c in (map(int, l.split()) for l in sys.stdin):\r\n if w == 1:\r\n w1.append(c)\r\n elif w == 2:\r\n w2.append(c)\r\n else:\r\n w3.append(c)\r\n\r\nw1.sort(reverse=True)\r\nw2.sort(reverse=True)\r\nw3.sort(reverse=True)\r\nw3[0] = 0\r\nw1_size, w2_size = len(w1), len(w2)\r\n\r\ndp = [(0, 0, 0) for _ in range(m+3)]\r\nfor i in range(m):\r\n dp[i+1] = max(dp[i+1], dp[i])\r\n if dp[i][1] < w1_size:\r\n dp[i+1] = max(dp[i+1], (dp[i][0]+w1[dp[i][1]], dp[i][1]+1, dp[i][2]))\r\n if dp[i][2] < w2_size:\r\n dp[i+2] = max(dp[i+2], (dp[i][0]+w2[dp[i][2]], dp[i][1], dp[i][2]+1))\r\n\r\nans = 0\r\nw3_c = 0\r\n\r\nfor i in range(len(w3)):\r\n if i3 > m:\r\n continue\r\n w3_c += w3[i]\r\n ans = max(ans, w3_c + dp[m-i3][0])\r\n\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n\n[n, m] = map(int, input().strip().split())\nwc = [[] for _ in range(4)] # w[0] unused\nfor _ in range(n):\n\tw, c = map(int, input().strip().split())\n\twc[w].append(c)\n\nfor i in range(1, 4):\n\twc[i].sort(reverse=True)\n\niwc = [[0 for _ in range(len(wc[i]) + 1)] for i in range(4)]\n\nfor i in range(4):\n\tfor j in range(len(wc[i])):\n\t\tiwc[i][j + 1] = iwc[i][j] + wc[i][j]\n\nn1 = len(wc[1])\nn2 = len(wc[2])\nn3 = len(wc[3])\n\nc12 = [(0, 0, 0) for _ in range(m + 1)]\nfor w in range(len(c12) - 1):\n\tc, q1, q2 = c12[w]\n\tc12[w + 1] = max(c12[w + 1], c12[w])\n\tif q1 < n1:\n\t\tc12[w + 1] = max(c12[w + 1], (iwc[1][q1 + 1] + iwc[2][q2], q1 + 1, q2))\t\t\n\tif q2 < n2 and w + 2 < len(c12):\n\t\tc12[w + 2] = max(c12[w + 2], (iwc[1][q1] + iwc[2][q2 + 1], q1, q2 + 1))\n\n\ncmax = 0\nfor i in range(n3 + 1):\n\tif 3 i > m:\n\t\tbreak\n\tcmax = max(cmax, iwc[3][i] + c12[m - 3 * i][0])\n\nprint(cmax)\n\n" ]	{"inputs": ["1 1\n2 1", "2 2\n1 3\n2 2", "4 3\n3 10\n2 7\n2 8\n1 1", "5 5\n3 5\n2 6\n3 2\n1 1\n1 6", "6 6\n1 6\n1 4\n1 8\n3 2\n3 2\n2 8", "6 12\n1 7\n1 10\n2 8\n1 2\n2 9\n3 5", "6 18\n3 3\n1 10\n2 10\n3 6\n1 3\n2 3", "20 25\n2 13\n3 11\n1 32\n1 43\n3 85\n1 14\n2 57\n1 54\n1 38\n2 96\n2 89\n3 64\n1 79\n2 73\n1 73\n2 34\n1 52\n1 79\n1 42\n3 34", "40 45\n2 82\n2 70\n2 48\n3 50\n2 15\n1 23\n1 80\n2 46\n1 20\n3 8\n3 81\n2 27\n1 59\n1 15\n3 95\n2 82\n2 40\n2 9\n2 61\n1 49\n2 5\n2 82\n1 55\n2 11\n1 26\n1 33\n1 2\n1 7\n3 57\n2 29\n1 59\n2 50\n3 63\n1 40\n1 99\n2 91\n2 39\n3 50\n1 75\n3 77", "4 28\n2 2\n3 1\n3 10\n1 9", "10 5\n1 9\n1 8\n2 10\n3 4\n3 1\n2 2\n3 6\n1 1\n3 8\n2 2", "10 12\n3 7\n3 6\n3 8\n3 2\n1 9\n2 5\n2 1\n2 5\n2 10\n2 9", "1 29\n2 8", "10 2\n3 4\n3 5\n3 7\n1 10\n1 2\n1 2\n1 8\n3 2\n1 8\n3 3", "6 5\n3 1\n3 1\n1 2\n2 9\n3 10\n1 8", "4 2\n3 4\n3 8\n1 1\n1 4", "7 12\n2 10\n2 8\n2 1\n3 8\n3 8\n3 7\n1 7", "70 203\n1 105\n1 105\n1 105\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300", "10 6\n1 8\n1 10\n1 7\n2 9\n3 8\n1 8\n1 7\n1 4\n3 1\n3 8", "2 40\n1 10\n3 6", "7 6\n2 9\n3 10\n1 2\n2 6\n3 6\n2 1\n1 3", "2 4\n3 8\n1 6", "9 19\n2 5\n2 3\n3 9\n1 9\n3 8\n3 5\n3 4\n3 2\n3 6", "13 23\n3 17\n2 83\n1 81\n3 83\n3 59\n3 71\n2 61\n3 8\n3 64\n2 80\n3 47\n1 46\n1 82", "9 10\n3 6\n2 1\n2 4\n2 3\n3 6\n3 1\n1 8\n2 4\n3 3", "3 4\n2 10\n2 10\n3 15", "9 15\n3 8\n1 2\n2 5\n1 5\n3 3\n1 7\n1 7\n2 7\n2 9", "8 21\n2 6\n3 3\n3 7\n3 8\n3 8\n3 8\n2 6\n3 9", "6 7\n2 5\n2 4\n3 9\n3 2\n3 1\n3 8", "8 5\n3 9\n3 3\n1 4\n3 1\n2 5\n3 1\n3 6\n3 1", "1 1\n1 10", "1 2\n2 10", "5 9\n2 8\n3 7\n2 6\n1 4\n2 7", "4 4\n2 13\n2 15\n2 5\n1 9", "2 1\n1 5\n2 11", "8 6\n1 9\n1 5\n1 3\n1 10\n3 8\n1 6\n1 4\n1 2", "5 7\n1 8\n2 13\n2 13\n3 20\n3 14", "52 102\n3 199\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100", "3 4\n1 4\n2 10\n3 100", "61 120\n3 5\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3"], "outputs": ["0", "3", "10", "13", "26", "41", "35", "990", "1605", "22", "28", "46", "8", "18", "20", "5", "41", "20310", "44", "16", "22", "14", "46", "711", "25", "20", "51", "52", "18", "14", "10", "10", "28", "28", "5", "37", "46", "5100", "104", "180"]}	UNKNOWN	PYTHON3	CODEFORCES	4
d37c153e46473b00ba4e801f4917d3d7	Bulbs	Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs? If Vasya presses the button such that some bulbs connected to it are already turned on, they do not change their state, i.e. remain turned on. The first line of the input contains integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of buttons and the number of bulbs respectively. Each of the next n lines contains xi (0<=≤<=xi<=≤<=m) — the number of bulbs that are turned on by the i-th button, and then xi numbers yij (1<=≤<=yij<=≤<=m) — the numbers of these bulbs. If it's possible to turn on all m bulbs print "YES", otherwise print "NO". Sample Input 3 4 2 1 4 3 1 3 1 1 2 3 3 1 1 1 2 1 1 Sample Output YES NO	[ "a,b=map(int,input().split())\r\ng=set()\r\nfor i in range(a):\r\n n=list(map(int,input().split()))\r\n n.pop(0)\r\n g.update(n)\r\nprint(['NO','YES'][len(g) == b])", "n,m=map(int,input().split())\r\np=[]\r\npo=[]\r\nfor i in range(m):\r\n p.append('0')\r\n po.append('1')\r\nfor i in range(1,n+1):\r\n q=input().split()\r\n um=q[0]\r\n for ui in range(1,int(um)+1):\r\n p[int(q[ui])-1]='1'\r\nif p==po:\r\n print('YES')\r\nelse:print('NO')", "########################################################################\r\n\"#######################################################################\"\r\n########################################################################\r\n\"Author = Fasih_ur_Rehman\"\r\n \r\n#\| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"\| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#\| <> <> <> <> <> <> <> <> <> ####\r\n\"_________ ____ _____ ___ __ __ \"\r\n#\| \\ / \\/ / \\ \|\\ \\ \| \\ \| \\ ####\r\n\"\| ▓▓█████▓ /▓█████\\ ▓▓▓▓▓▓\\\| \| ███ \| ██ \| ██ ####\"\r\n#\| ▓▓_____ ▓▓__\| ▓▓ ██___\\██\| \| ▓▓▓ \| ▓▓__\| ▓▓ ####\r\n\"\| ██ \\ ▓▓ ▓▓ \\██ \\ \| ███ \| ▓▓ ▓▓ ####\"\r\n#\| ▓▓▓████▓ ████████ \\▓▓▓▓▓▓\\ \| ▓▓▓ \| ████████ ####\r\n\"\| ██ ▓▓ \| ▓▓ \\__\| ██\| \| ███ \| ▓▓ \| ▓▓ ####\"\r\n#\| ▓▓ ▓▓ \| ▓▓ \\██ ██\| \| ▓▓▓ \| ▓▓ \| ▓▓ ####\r\n\"\\_██ ██ \\██ \\▓▓▓▓▓▓/ \\_███ \\_██ \\_██ ####\"\r\n\r\n#\| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"\| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#\| <> <> <> <> <> <> <> <> <> ####\r\n\r\n\"#######################################################################\" \r\n######################################################################## \r\n\"#######################################################################\" \r\n\r\nn,m = map(int,input().split())\r\na = set({})\r\nfor i in range(n):\r\n x = list(map(int,input().split()))\r\n a.update(x[1:])\r\nif len(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "shuru=input().split()\r\ns=[]\r\nn=int(shuru[0])\r\nm=int(shuru[1])\r\ni=1\r\nwhile i<=n:\r\n shuru1=input().split()\r\n shuru1.pop(0)\r\n s.extend(shuru1)\r\n i+=1\r\ns=list(set(s))\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n b, = map(int, input().split())\r\n del b[0]\r\n for j in b:\r\n if j not in a:\r\n a.append(j)\r\nif len(a) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x,y = map(int,input().split())\r\nn=set()\r\nfor _ in range(x):\r\n n.update(input().split()[1:])\r\nprint([\"NO\",\"YES\"][len(n)==y])", "n, m = map(int, input().split())\r\nbulbs = [False] m \r\nfor i in range(n):\r\n button = list(map(int, input().split()))[1:] \r\n for b in button:\r\n bulbs[b-1] = True \r\nif all(bulbs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b = [int(x) for x in input().split()]\r\nlist1 = [0]b\r\nfor i in range(a):\r\n list2 = [int(x) for x in input().split()]\r\n for j in list2[1:]:\r\n list1[j-1] += 1\r\nif list1.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "button, bulb = [int(i) for i in input().split()]\r\nb = [False] bulb\r\nfor i in range(button):\r\n for j in [int(k) for k in input().split()[1:]]:\r\n b[j - 1] = True\r\nif b.count(False) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "tl = list(map(int, input().split()))\r\nbuttons = tl[0]\r\nbulbs = tl[1]\r\narray = []\r\nfor _ in range(buttons):\r\n l = list(map(int, input().split()))\r\n array.append(l)\r\n\r\nd = {}\r\nfor i in range(1, bulbs + 1):\r\n d[i] = False\r\nrem = bulbs\r\nfor cur_arr in array:\r\n if (rem == 0):\r\n print(\"YES\")\r\n exit(0)\r\n\r\n for i in range(1, len(cur_arr)):\r\n if (d[cur_arr[i]] == False):\r\n d[cur_arr[i]] = True\r\n rem -= 1 \r\nif (rem == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nbulbs=[0]m\r\nfor i in range(n):\r\n buttons=list(map(int,input().split()))\r\n buttons.pop(0)\r\n for j in buttons:\r\n bulbs[j-1]=1\r\nif bulbs.count(0)==0:print(\"YES\")\r\nelse:print(\"NO\")", "def solve(t_id):\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(n):\r\n a = list(map(int, input().split()))\r\n for i in range(1, len(a)):\r\n d[a[i]] = 1\r\n print('YES' if len(d) == m else 'NO')\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "n,m = map(int,input().split(' '))\r\nbulb = [False]m\r\nfor i in range(n):\r\n temp = list(map(int,input().split(' ')))[1::]\r\n for each in temp:\r\n bulb[each-1] = True\r\nprint('YES' if not (False in bulb) else 'NO')", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n b.remove(b[0])\r\n for i in b:\r\n a.append(i)\r\n\r\nif len(set(a))==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "n,m = map(int,input().split())\r\nlamp = [i for i in range(1,m+1)]\r\nlmp = []\r\n\r\nfor _ in range(n):\r\n a = [int(c) for c in input().split()][1:]\r\n lmp.extend(a)\r\n\r\nlmp =set(lmp)\r\nif len(lmp) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, m = map(int, input().split())\r\nr = set()\r\nfor i in range(n):\r\n r \|= set(i for i in input().split()[1:])\r\nprint(\"YES\") if len(r) == m else print(\"NO\")\r\n", "n,m=[int(x) for x in input().split()]\r\ns=set() \r\nfor i in range(n):\r\n s.update(input().split()[1:]) \r\nflag=True\r\nif m!=len(s): \r\n flag=False\r\nprint('YES'if flag else 'NO')", "bulbs = []\r\nn, m = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n now = list(map(int, input().split()))\r\n now = now[1:]\r\n for j in now:\r\n if j not in bulbs:\r\n bulbs.append(j)\r\n\r\nif len(bulbs) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split(\" \"))\r\nl=[]\r\nfor i in range(n):\r\n\ts=list(map(int,input().split(\" \")))\r\n\tl+=s[1:]\r\nif len(set(l))==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, m = map(int, input().split())\r\nbulbs = [0] * m\r\nfor _ in range(n):\r\n temp = [int(__) for __ in input().split()]\r\n x = temp[0]\r\n y = temp[1:]\r\n for i in range(x):\r\n bulbs[y[i] - 1] = 1\r\nif sum(bulbs) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "total,all=map(int,input().split())\r\nlist2=[]all\r\nfor i in range(total):\r\n list1=list(map(int,input().split()))\r\n for j in range(list1[0]):\r\n if list1[j+1] not in list2:\r\n list2.append(list1[j+1])\r\nif len(list2)==all:\r\n print(\"YES\")\r\nelse:print(\"NO\") ", "n,m = map(int, input().split())\nx ={}\nfor i in range(n):\n lst =list(input().split())\n for j in range(1, len(lst)):\n if lst[j]not in x:\n x[lst[j]] =1\nif len(x) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t\t \t \t\t \t \t\t\t \t", "n,m = map(int, input().split())\r\nb = [0]m\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n for c in a[1:]:\r\n b[c-1] = 1\r\nif sum(b) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nnum=set()\r\nfor i in range(n):\r\n num.update(input().split()[1:])\r\nprint(['NO','YES'][len(num)==m])", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sun Nov 8 22:40:35 2020\n\n@author: gohlifang\n\"\"\"\nlst = list(map(int, input().split()))\n\nn, m = [lst[i] for i in range(0,2)] #n = number of buttons; m = bulbs\n\nnewlst = []\n\nfor i in range(0,n):\n result = input().split()\n x = result[0] #number of bulbs turn on with i button\n y_j = result[1:] #which bulb was turn on\n for ele in y_j:\n newlst.append(ele)\n\nnicelst = set(newlst)\n \nif len(nicelst) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n \n \n\n\n\n\n ", "n,m=[int(a) for a in input().split()]\r\nr=set()\r\nfor j in range(n):\r\n s=[int(a) for a in input().split()]\r\n r=r.union(set(s[1:]))\r\nif len(r)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "num_of_buttons, num_of_bulbs = map(int, input().split(' '))\r\n# define an empty set\r\nlighted_bulbs = set([])\r\n\r\nfor i in range(num_of_buttons):\r\n bulbs_for_button = list(map(int, input().split(' ')))\r\n for j in range(1, len(bulbs_for_button)):\r\n lighted_bulbs.add(bulbs_for_button[j])\r\n\r\nif len(lighted_bulbs) == num_of_bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nk = []\r\nfor _ in range(n):\r\n arr1 = list(map(int, input().split()))\r\n arr1.pop(0)\r\n k += arr1\r\nk.sort()\r\nx = [x+1 for x in range(m)]\r\nk = list(set(k))\r\nif k == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# CF25A: IQ test, brute force, 1300\n# \n# http://codeforces.com/problemset/problem/25/A\n\n# In[8]:\n\n\nlistnm=input().split(' ')\nn=int(listnm[0])\nm=int(listnm[1])\nliston=[0]m\nfor i in range(n):\n listturn=input().split(' ')\n listturn=[int(i) for i in listturn]\n for x in range(1,listturn[0]+1):\n liston[listturn[x]-1]=1\nif liston.count(0)==0:\n print('YES')\nelse:\n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "n,m = map(int, input().split())\r\ns = set()\r\nfor x in range(n):\r\n l = list(input().split())\r\n l = l[1:]\r\n s = s.union(set(map(int, l)))\r\nprint('YES' if sum(s) == (1+m)(m)/2 else 'NO')", "n,m=map(int, input().split())\r\ni=0\r\nbutt=set([])\r\nwhile i < n:\r\n buttons=list(input().split())\r\n but=set(buttons[1:])\r\n butt=butt.union(but)\r\n i+=1\r\na=len(butt)\r\nif a==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "inp=[int(x) for x in input().split()]\r\nn=inp[0]\r\nm=inp[1]\r\nbulbs=[0 for x in range(m)]\r\nfor x in range(n):\r\n button=[int(x) for x in input().split()]\r\n number=button.pop(0)\r\n for x in button:\r\n bulbs[x-1]=1\r\ncount=bulbs.count(0)\r\nif count!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, m = map(int, input().split())\r\np =[]\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n for j in range(1,l[0]+1):\r\n p.append(l[j])\r\nif list(set(sorted(list(p)))) == list(range(1,1+m)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\nbulbs=[0]m\nfor i in range(n):\n conn=list(map(int,input()[2:].split()))\n for j in conn:\n bulbs[j-1]=1\nprint('NO') if 0 in bulbs else print('YES')\n \t \t \t \t\t\t \t \t \t \t \t \t", "nm=[int(i) for i in input().split()]\r\nn=nm[0];m=nm[1];l=[]\r\nfor j in range(n):\r\n b=[int(k) for k in input().split()]\r\n b.pop(0)\r\n l.extend(b)\r\nl=set(l)\r\nif len(l)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nbulb=set(i for i in range(1,m+1))\r\nbutton=set()\r\nfor i in range(n):\r\n s=input().split()\r\n pr=int(s[0])\r\n for j in range(1,pr+1):\r\n button.add(int(s[j]))\r\nleft=bulb.symmetric_difference(button)\r\nif(left): print('NO')\r\nelse: print('YES')", "n, m = map(int, input().split())\n\nbulbs = [False] m\n\nfor i in range(n):\n switch = list(map(int, input().split()))[1:]\n for j in switch:\n bulbs[j-1] = True\n if all(bulbs):\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\n \t \t\t \t \t\t \t \t \t \t\t\t\t", "n,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n a.update(b[1:])\r\nif len(a)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nmyset=set()\r\nfor x in range(n):\r\n myset.update(input().split()[1:])\r\nprint(['NO','YES'][len(myset)==m])", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nm=l1[-1]\r\nl3=[]\r\nfor j in range(n):\r\n l2=[int(j) for j in input().split()]\r\n for k in range(1,l2[0]+1):\r\n l3.append(l2[k])\r\nl3.sort()\r\ns3=set(l3)\r\nif len(s3)==m:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n, m = map(int, input().split())\r\na = [0] * m\r\nfor u in range(n):\r\n b = [int(i) for i in input().split()]\r\n for i in range(b[0]):\r\n a[b[i + 1] - 1] = 1\r\nif sum(a) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\ndic={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1, len(lst)):\n if lst[j]not in dic:\n dic[lst[j]] = 1\nif len(dic) == m:\n print('YES')\nelse:\n print('NO')\n \t \t \t \t \t \t \t \t\t \t\t\t", "n,m=map(int,input().split())\ndic = {}\nfor i in range(n):\n lst= list(input().split())\n for t in range(1,len(lst)):\n if lst[t] not in dic :\n dic[lst[t]] = 1\nif len(dic) == (m):\n print('YES')\nelse:\n print('NO')\n\n\n\t\t \t \t \t \t \t \t\t \t \t \t\t \t\t", "button, bulb = map(int, input().split())\na = []\nfor i in range(button):\n a.extend(map(int, (input().split()[1:])))\nb = set(i for i in range(1, bulb + 1))\nif set(a) == b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "n, m = map(int, input().split())\r\nls = {i: 1 for i in range(1, m+1)}\r\ncnt = 0\r\nfor _ in range(n):\r\n bulbs = list(map(int, input().split()))\r\n if bulbs[0] > 0:\r\n for i in range(1, len(bulbs)):\r\n if bulbs[i] in ls:\r\n if ls[bulbs[i]] > 0:\r\n cnt += 1\r\n ls[bulbs[i]] -= 1\r\nif cnt == len(ls):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m = map(int,input().strip().split())\r\nnl = []\r\nc = 0\r\nfor i in range (n):\r\n lst = list(map(int,input().strip().split()))\r\n nl+=(lst[1:])\r\n nl.sort()\r\nfor i in range (1,m+1):\r\n if i not in nl:\r\n c = 1\r\n break\r\nif c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_light_up_all_bulbs(n, m, buttons):\r\n # Tạo một set để lưu các số hiệu của các bóng đã được bật\r\n lit_bulbs = set()\r\n \r\n # Duyệt qua từng button\r\n for i in range(n):\r\n bulbs = buttons[i][1:] # Danh sách các bóng mà button i bật\r\n \r\n # Kiểm tra nếu tất cả các bóng đều đã được bật, không cần làm gì thêm\r\n if all(bulb in lit_bulbs for bulb in bulbs):\r\n continue\r\n \r\n # Bật tất cả các bóng mà button i bật\r\n lit_bulbs.update(bulbs)\r\n \r\n # Kiểm tra nếu tất cả m bulbs đã được bật\r\n if len(lit_bulbs) == m:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\n\r\n# Đọc dữ liệu đầu vào\r\nn, m = map(int, input().split())\r\nbuttons = []\r\nfor _ in range(n):\r\n button = list(map(int, input().split()))\r\n buttons.append(button)\r\n\r\n# Gọi hàm kiểm tra và in kết quả\r\nresult = can_light_up_all_bulbs(n, m, buttons)\r\nprint(result)\r\n", "a = list(int(i) for i in(input().split()))\r\nn = a[0]\r\nm = a[1]\r\ny = []\r\nb = []\r\n\r\nfor i in range(n):\r\n\tx = list(input().split())\r\n\tfor i in range(1,int(x[0])+1):\r\n\t\ty.append(x[i])\r\n\t\t\r\nfor i in range(1,m+1):\r\n\tif str(i) not in set(y):\r\n\t\tb.append(i)\r\n\t\t\r\nif len(b) != 0:\r\n\tprint('NO')\r\n\t\r\nelse:\r\n\tprint('YES')", "from time import sleep as sle\r\nfrom math import \r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tn,m = map(int,input().split())\r\n\tyL = []\r\n\tfor i in range(n):\r\n\t\tyL += [q for q in input().split()][1:]\t\t\r\n\tif len(set(yL)) == m:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\nsolve()", "n,m=map(int,input().split())\r\nbulbs=[0]m \r\nfor _ in range(n):\r\n nums=list(map(int,input().split()))\r\n for i in range(1,nums[0]+1):\r\n bulbs[nums[i]-1]=1\r\nif 0 in bulbs:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(n):\r\n\tb=[int(x) for x in input().split()]\r\n\tb.pop(0)\r\n\ta=a+b\r\nc={x for x in range(1,m+1)}\r\nif set(a)==c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, m = map(int, input().split())\r\nans_list = [False for i in range(m)]\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in a[1::]:\r\n ans_list[j-1] = True\r\nif all(ans_list):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\nl=[1 for x in range(m)]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()]\r\n s=s[1:]\r\n for j in s:\r\n l[j-1]=0\r\nif sum(l)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\nblb=[]\r\nfor i in range(m):\r\n blb.append(int(0))\r\nfor i in range(n):\r\n btn=list(map(int,input().split()))\r\n for i in range(1,len(btn)):\r\n blb[btn[i]-1]=1\r\nif 0 in blb:\r\n print('NO')\r\nelse:\r\n print('YES')", "a,b=map(int,input().split())\r\nx=0\r\nc=list()\r\nwhile x<a:\r\n d=list(map(int,input().split()))\r\n e=d[1:]\r\n c.extend(e)\r\n x+=1\r\nc=list(set(c))\r\nf=len(c)\r\nif f==b:\r\n print('YES')\r\nelif f<b:\r\n print('NO')", "whole = []\r\nbuttons,bulbs = [int(x) for x in input().split()]\r\nfor i in range(0,buttons):\r\n turnon = input().split()\r\n del turnon[0]\r\n whole = whole + turnon\r\nif len(set(whole)) == bulbs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n b = list(map(int, input().split()))\r\n a += b[1:]\r\nif len(set(a)) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split());p=set()\r\nfor i in range(a):\r\n n=list(map(int,input().split()))\r\n n.pop(0)\r\n p.update(n)\r\nprint([\"NO\",\"YES\"][len(p)==b])", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nl = [0] * m\r\nfor i in range(n):\r\n str1 = input().split()\r\n str2 = [int(x) for x in str1]\r\n for i in str2[1:]:\r\n l[i - 1] += 1\r\nif 0 in l:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n li=[int(x) for x in input().split()]\r\n li.pop(0)\r\n s=s\|set(li)\r\na=True\r\nfor i in range(1,m+1):\r\n if i not in s:\r\n a=False\r\n break\r\nif a==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=m[0]\r\nfor i in range(n):\r\n q=[int(x)for x in input().split()]\r\n for j in q[1:]:\r\n a[j-1]+=1\r\nif a.count(0)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "r=lambda i:map(int,input().split()[i:])\r\nn,m=r(0)\r\na=[]\r\nfor _ in[0]n:a+=r(1)\r\nprint('YNEOS'[len(set(a))!=m::2])", "n,m = map(int, input().split())\r\nl = [0 for x in range(m)]\r\nfor i in range(n):\r\n s = [int(x) for x in input().split()]\r\n for j in range(1, s[0] + 1):\r\n l[s[j]-1] = 1\r\nflag = 0\r\nfor i in range(len(l)):\r\n if l[i] == 0:\r\n flag =1\r\n print('NO')\r\n break\r\nif flag == 0:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\nlight=[]\nfor i in range(0,n):\n l=input().split()\n light.extend(l[1:])\nx=1\nfor i in range(1,m+1):\n if str(i) not in light:\n x=0\nif x == 0:\n print('NO')\nelse:\n print('YES')", "n,m=map(int,input().split())\r\nl=[0]m\r\nfor i in range(n):\r\n l1=list(map(int,input().split()))\r\n for i in range(1,l1[0]+1):\r\n a=l1[i]\r\n l[a-1]=1\r\np=sum(l)\r\nif p==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=[int(i) for i in input().split()]\r\nj=1\r\nse=set()\r\nsett=set()\r\nwhile j<=m:\r\n se.add(j)\r\n j+=1\r\nfor w in range(n):\r\n lst=[int(s) for s in input().split()]\r\n lst.remove(lst[0])\r\n sett.update(lst)\r\nif se==sett:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n n, m = map(int, input().split())\r\n bulbs = [False] m\r\n for _ in range(n):\r\n info = list(map(int, input().split()))\r\n for i in range(1, len(info)):\r\n bulbs[info[i] - 1] = True\r\n if all(bulbs):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\n# Online IDE - Code Editor, Compiler, Interpreter\n\ndef splitter(arr):\n return [int(i) for i in arr.split()]\n\n\nbuttsBulbs = input()\nbuttsBulbs = splitter(buttsBulbs)\ntemp = \"\"\nopened = [] \nfinalArr = []\n\nfor i in range(buttsBulbs[0]):\n temp = input()\n opened = splitter(temp)\n for i in range(1,len(opened)):\n finalArr.append(opened[i])\nfinalArr = set(finalArr)\nif(len(finalArr)==buttsBulbs[1]):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n\n\n\t \t\t\t\t \t\t \t \t \t\t \t \t \t", "m, n = map(int, input().split())\r\ns = []\r\nfor i in range(m):\r\n a = [int(x) for x in input().split()]\r\n a.remove(a[0])\r\n s += a\r\nS = set(s)\r\nprint('YES' if(len(S) == n) else 'NO')", "a = []\r\nb, c = map(int, input().split())\r\nfor i in range(b):\r\n d = list(map(int, input().split()))\r\n for i in d[1:len(d)]:\r\n a.append(i)\r\n\r\nif len(set(a)) == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl=[]\r\na=\"YES\"\r\nfor x in range(n):\r\n l+= map(int,list(input().split())[1:])\r\nfor x in range(1,m+1):\r\n if x not in l:\r\n a=\"NO\"\r\nprint(a) ", "a, b = list(map(int, input().split()))\r\nbulb = [int(x) for x in range(1, b+1)]\r\nfor i in range(a):\r\n bulblist = [int(x) for x in input().split()]\r\n for j in bulblist[1:]:\r\n if bulb.count(j) > 0:\r\n bulb.remove(j)\r\n if not bulb:\r\n break\r\nprint([\"YES\", \"NO\"][bulb != []])\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nbulb = set()\r\nfor i in range(n):\r\n bulb.update(set([int(x) for x in input().split()][1:]))\r\nif bulb == set(range(1,m+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=[int(x) for x in input().split()]\r\nd=[0]b\r\nfor i in range(a):\r\n c=[int(x) for x in input().split()]\r\n \r\n for i in range(1,len(c)):\r\n e=c[i]\r\n d[e-1]+=1\r\nif d.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = map(int,input().split(\" \"))\r\n\r\nlamps = [0]k\r\nfor i in range(1,n+1):\r\n x = list(map(int,input().split(\" \")))\r\n y = x[1:]\r\n for j in y :\r\n lamps[j-1]+=1\r\n\r\nfor i in lamps:\r\n if i == 0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "a, b = map(int, input().split())\r\ns = set()\r\nfor _ in range(a):\r\n i, j = map(int, input().split())\r\n for k in j:\r\n s.add(k)\r\nif len(s) == b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nbulb=list(0 for x in range(m+1))\nfor x in range(n):\n\tk=list(map(int,input().strip().split()[:m+1]))\n\tfor y in k[1:]:\n\t\tbulb[y]=1\nif all(bulb[1:])==True:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "a,b = [int(i) for i in input().split()]\r\nc = []\r\nfor i in range(b):\r\n c.append(0)\r\nfor i in range(a):\r\n d = [int(j) for j in input().split()]\r\n for j in range(1,d[0]+1):\r\n c[d[j]-1]=1\r\nif 0 in c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=input().split()\r\nc=[]\r\nfor i in range(int(a[0])):\r\n b=input().split()\r\n del(b[0])\r\n c+=b\r\nd=set(c)\r\nif len(d)==int(a[1]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=list(map(int,input().split()))\r\nc=[]\r\ni=0\r\nwhile i<n:\r\n a=list(map(int,input().split()))\r\n c+=a[1:]\r\n i+=1\r\ni=0\r\nc.sort()\r\nc=set(c)\r\nsum1=0\r\nfor x in c:\r\n if True:\r\n sum1 += x\r\nsum2=m(m+1)//2\r\nif sum2==sum1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "nBott, nBulb = map(int, input().split())\r\nbulbs = [0] * (nBulb + 1)\r\nfor i in range(nBott):\r\n botts = [int(k) for k in input().split()]\r\n nCon = botts[0]\r\n for j in range(1, nCon + 1):\r\n bulbs[botts[j]] = 1\r\ntag = 1\r\nfor i in range(1, nBulb + 1):\r\n if bulbs[i] == 0:\r\n tag = 0\r\n break\r\nif tag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn, m = read_ints()\n\ts=set()\n\tfor i in range(n):\n\t\ts \|= set(read_ints()[1:])\n\tif len(s)==m:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nsolve()\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 16:19:05 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nn,m = [int(i) for i in input().split()]\r\nbulbs = [0]m\r\nfor _ in range(n):\r\n inf = input().split()\r\n del inf[0]\r\n for i in inf:\r\n if bulbs[int(i)-1]==0:\r\n bulbs[int(i)-1]=1\r\nif sum(bulbs) == m:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n ", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nres=[]\r\n\r\nfor i in range(n):\r\n nums=[int(num) for num in input().split()[1:]]\r\n res.extend(nums)\r\n\r\nflag=0\r\nfor i in range(1,m+1):\r\n if i not in res:\r\n flag=1\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "#bulbs\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n k=[int(x) for x in input().split()]\n for j in range(k[0]):\n l.append(k[j+1])\nprint('YES' if set(l)==set(range(1,m+1)) else 'NO')", "n,m=map(int,input().split( ))\r\nstandard={i for i in range(1,m+1)}#集合推导式\r\ntemp=set()#空集合的建立，不是{}而是set（）\r\nfor i in range(n):\r\n info=input().split( )\r\n info.pop(0)\r\n for j in info:\r\n y=int(j)\r\n temp.add(y)\r\nif temp == standard:\r\n print('YES')\r\nif temp != standard:\r\n print('NO')", "def answer():\r\n a = [int(x) for x in input().split()]\r\n n = a[0]\r\n t= a[1]\r\n l=[]\r\n \r\n while n:\r\n c=input().split()\r\n c=[int(x) for x in c]\r\n for x in c[1:]:\r\n if x not in l:\r\n l.append(x)\r\n n-=1\r\n \r\n l=set(l)\r\n i=1\r\n while i<=t:\r\n if i not in l:\r\n return \"NO\"\r\n i+=1\r\n return \"YES\"\r\nprint(answer())", "n, m = [int(i) for i in input().split()]\r\ns = set()\r\nfor _ in range(n):\r\n li = [int(i) for i in input().split()][1:]\r\n for i in li:\r\n s.add(i)\r\nprint(\"YES\" if len(s) == m else \"NO\")\r\n", "n,m=map(int,input().split())\r\nlist1=[]\r\nfor i in range(n):\r\n list2=list(map(int,input().split()))\r\n list2.pop(0)\r\n list1 += list2\r\nprint(['YES','NO'][len(set(list1)) != m])", "n,m=map(int,input().split())\r\nlight=[]\r\nfor i in range(n):\r\n move=list(map(int,input().split()))\r\n for j in range(1,len(move)):\r\n if move[j] not in light:\r\n light.append(move[j])\r\nif len(light)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "from functools import reduce\r\nprint('YES' if (lambda x:set(range(1,1+int(x.split()[1])))==reduce(lambda x,y:x\|y,({int(j) for j in input().split()[1:]} for i in range(int(x.split()[0])))))(input()) else 'NO')\r\n", "n=input().split()\r\nb=[int(i+1)for i in range(int(n[1]))]\r\nfor j in range(int(n[0])):\r\n a=input().split()\r\n for c in a[1:]:\r\n if int(c) in b:\r\n b.remove(int(c))\r\nprint('YNEOS'[len(b)!=0::2])", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n a.remove(a[0])\r\n l+=a\r\nl=list(set(l))\r\nif len(l)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nbuttons , lamps = input().split()\nbuttons = int(buttons)\nlamps = int(lamps)\ndict_ = {}\nfor i in range(buttons):\n list_ = input().split()\n lamps_ = list_[1:]\n dict_[i] = lamps_\n\nmyset = set()\n\nfor key in dict_:\n for i in range(len(dict_[key])):\n myset.add(dict_[key][i])\n\nif len(myset) == lamps:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \t \t \t \t \t\t\t\t \t \t \t \t\t", "#615\r\nn, m = [int(x) for x in input().split()]\r\nconnection = []\r\nfor i in range(n):\r\n for x in input().split()[1:]:\r\n connection.append(int(x))\r\n\r\nfor i in range(1,m+1):\r\n if not (i in connection):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "buttonNum,bulbNum=map(int,input().split())\r\nbulbSet=set()\r\nfor i in range(buttonNum):\r\n bulbList=input().split()\r\n bulbList.pop(0)\r\n bulbSet.update(bulbList)\r\nprint(\"YES\" if len(bulbSet)==bulbNum else \"NO\")\r\n", "n, m = map(int, input().split())\r\non = set()\r\n\r\nfor _ in range(n):\r\n on = on \| set(map(int, input().split()[1:]))\r\n\r\nprint('YES') if on == set(range(1, m + 1)) else print('NO')", "n,m=[int(x) for x in input().split()]\r\nb=[0]m\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n c=len(a)\r\n for i in range(1,c):\r\n d=a[i]\r\n b[d-1]=1\r\nif 0 not in b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n k=list(map(int,input().split()))[1:]\r\n l+=k\r\nl=list(set(l))\r\nif len(l)==m:\r\n print('YES')\r\nelse:\r\n print('NO') ", "m,n = map(int,input().split())\r\nlist2 = []\r\nfor i in range(m):\r\n list1 = list(map(int,input().split()))[1:]\r\n list2 += list1\r\nprint(\"YES\"if len(set(list2))==n else \"NO\")", "n, m = map(int, input().split())\narr = []\n\nfor i in range(n):\n tmp = list(map(int, input().split()))\n for i in range(1, tmp[0] + 1):\n arr.append(tmp[i])\n\nif len(set(arr)) == m:\n print(\"YES\")\nelse:\n print('NO')\n", "n,m=[int(x) for x in input().split()]\r\nb=[]\r\nfor i in range(m):\r\n b.append(\"OFF\")\r\nfor j in range(n):\r\n o=[int(x) for x in input().split()]\r\n for k in range(1,o[0]+1):\r\n if b[o[k]-1]==\"OFF\":\r\n b[o[k]-1]=\"ON\"\r\nprint(\"YES\" if b.count(\"OFF\")==0 else \"NO\")", "N,M=map(int,input().split())\r\na=list()\r\nfor i in range(N):\r\n ar=list(map(int,input().split()))\r\n ar.remove(ar[0])\r\n for i in range(len(ar)):\r\n a.append(ar[i])\r\nif(len(list(set(a)))==M):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nbulbs = [0]m\r\nfor i in range(n):\r\n button = list(map(int,input().split()))\r\n for j in range(button[0]):\r\n bulbs[button[j+1]-1] = 1\r\nif bulbs.count(0) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, bulb= (map(int, input().split()))\r\nb = []\r\n\r\ncount = 0\r\nfor x in range(n):\r\n a = list(map(int, input().split()))\r\n for y in range(int(a[0])):\r\n b.append(a[y+1])\r\n \r\nif len(set(b)) == bulb :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\nres = []\nfor i in range(m + 1):\n res.append(0)\nfor i in range(1, n + 1):\n l = list(map(int, input().split()))\n for j in range(1, len(l)):\n res[l[j]] = 1\nprint(\"YES\" if sum(res) == m else \"NO\")", "i = [int(o) for o in input().split()]\r\nk = set()\r\nfor j in range(i[0]):\r\n k.update(input().split()[1:])\r\n \r\nif len(k) == i[1]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 17:42:12 2021\r\n\r\n@author: 86139\r\n\"\"\"\r\n\r\nt, s = list(map(int, input().split(' ')))\r\ns = set(range(1,s+1))\r\nfor _ in range(t):\r\n d = list(map(int, input().split(' ')))[1:]\r\n d = set(d)\r\n s -= d\r\nif s:\r\n print('NO')\r\nelse:\r\n print('YES')", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Fri Oct 22 17:49:36 2021\n\n@author: lijialin\n\"\"\"\n\n#Bulbs\nn,m=map(int,input().split())\nlist1=[]\ncount=1\nfor i in range(n):\n list2=[]\n list2=input().split()\n list2=[int(x) for x in list2]\n a=len(list2)\n list1.extend(list2[1:a])\nfor i in range(m):\n if count in list1:\n count+=1\n else:\n print(\"NO\")\n break\nif count==m+1:\n print(\"YES\")\n ", "ini = input().split()\r\nlst = [0] int(ini[1])\r\nfor i in range(int(ini[0])):\r\n turn = list(map(int, input().split()))\r\n for j in range(1, turn[0] + 1):\r\n lst[turn[j] - 1] = 1\r\nif sum(lst) == len(lst):print(\"YES\")\r\nelse:print(\"NO\")", "inp = [int(i) for i in input().split()]\nnum_buttons, num_bulbs = inp[0], inp[1]\n\nlit = set()\nfor i in range(num_buttons):\n line = [int(i) for i in input().split()][1:]\n lit.update(line)\n\nif len(lit) == num_bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "n,m = map(int,input().split())\r\nl1 = []\r\nwhile(n):\r\n\tl = list(map(int,input().split()))\r\n\ta = l[0]\r\n\tb = l[1:]\r\n\tl1.extend(b)\r\n\tl1 = list(set(l1))\r\n\tn-=1\r\nif(len(l1)==m):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m=map(int,input().split())\r\nx=[0]m\r\nfor i in range(n):\r\n b=[int(s) for s in input().split()]\r\n bu=b[0]\r\n del b[0]\r\n for k in b:\r\n x[k-1]=1\r\n b=[]\r\nif sum(x)==m:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "n, m = map(int,input().split())\r\nbulbs = [0] m\r\n\r\nfor i in range(n):\r\n y = list(map(int,input().split()))\r\n y1 = y[1:]\r\n for j in y1:\r\n bulbs[j-1] = 1\r\n\r\nif 0 in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "n, m = map(int, input().split())\r\non = set()\r\nfor _ in range(n):\r\n\tnums = list(map(int, input().split()))\r\n\tfor i in range(1, len(nums)):\r\n\t\ton.add(nums[i])\r\nprint(\"YES\" if len(on) == m else \"NO\")", "n,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(n):\r\n bulbs+=list(map(int,input().split()))[1:]\r\ns=set(bulbs)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int, input().split())\r\nx=set()\r\nfor i in range(a):\r\n c=list(map(int, input().split()))\r\n c.remove(c[0])\r\n x. update(c)\r\nif len(x)==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m= map(int,input().split())\r\nt =[]\r\nfor z in range(m):\r\n t.append(1)\r\nfor i in range (n):\r\n x= list(map(int,input().split()))\r\n for j in range (1,len(x)):\r\n tmp = x[j]\r\n for k in range(len(t)):\r\n if k == tmp-1:\r\n t[k] = 0\r\ny= t.count(0)\r\nif y==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nb = []\r\nfor t in range(n):\r\n\ta = [int(i) for i in input().split()]\r\n\tfor i in range(1, a[0] + 1):\r\n\t\tif a[i] not in b:\r\n\t\t\tb += [a[i]]\r\nb.sort()\r\nif len(b) < m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tflag = True\r\n\tfor i in range(m):\r\n\t\tif b[i] != i + 1:\r\n\t\t\tflag = False\r\n\tprint(\"YES\") if flag else print(\"NO\")", "input_list = [int(x) for x in input().split()]\r\nn = input_list[0]\r\nlight_dict = {x: 0 for x in range(input_list[1])}\r\n\r\nfor i in range(n):\r\n input_list = [int(x) for x in input().split()]\r\n for j in input_list[1:]:\r\n light_dict[j - 1] = 1\r\n\r\nif 0 in light_dict.values():\r\n print('NO')\r\nelse:\r\n print('YES')", "c='YES'\r\nk=set()\r\nm,n=input().split()\r\nfor i in range(int(m)):\r\n a=list(map(int, input().split()))\r\n k.update(a[1:])\r\nfor t in range(int(n)) :\r\n if t+1 in k:\r\n c=c\r\n if t+1 not in k:\r\n c='NO'\r\n break\r\nprint(c)", "r=lambda i:map(int,input().split()[i:])\nn,m=r(0)\na=[]\nfor _ in[0]n:a+=r(1)\nprint('YNEOS'[len(set(a))!=m::2])\n\t\t \t \t\t \t \t \t \t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Oct 20 22:15:43 2021\r\n\r\n@author: Asus\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nlism=[0]m\r\nlish=[]\r\nfor h in range(n):\r\n lish+=input().split()\r\nlish=[int(lish[a]) for a in range(len(lish))]\r\nwhile len(lish)>1:\r\n k=lish[0]\r\n del lish[0]\r\n for _ in range(k):\r\n j=lish[0]\r\n lism[j-1]=1\r\n del lish[0]\r\nprint('NO'if 0 in lism else'YES')\r\n ", "num_buttons, num_bulbs = [int(num) for num in input().split()]\narr = []\nfor i in range(num_buttons):\n\tarr = arr + [int(num) for num in input().split()][1:]\nif(set(arr) == set(range(1, num_bulbs+1))):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,m=[int (x) for x in input().split()]\r\nd=[0]m\r\nfor i in range(n):\r\n\ta=[int (x) for x in input().split()]\r\n\tfor i in range(1,a[0]+1):\r\n\t\td[a[i]-1]=1\r\nif 0 in d:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n\tx=list(map(int,input().split()))[1:]\r\n\tfor i in x:\r\n\t\ta.add(i)\r\n\r\n# print(a)\r\nif len(a)==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "e=[]\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n d=list(map(int,input().split()))\r\n for a in d[1:]:\r\n e.append(a)\r\ns=set(e)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "n,m =map(int,input().split())\r\nm=set(range(1,m+1))\r\nans=[]\r\nfor i in range(n):\r\n o = list(map(int,input().split()))\r\n for x in o[1:]:\r\n ans.append(x)\r\nans=set(ans)\r\nif ans == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=input().split()\r\nk=[]\r\np=True\r\nfor i in range(int(a)):\r\n s=[int(x) for x in input().split()]\r\n for c in s[1:len(s)]:\r\n k.append(c)\r\nfor j in range(1,int(b)+1):\r\n if j not in k:\r\n p=False\r\nprint(\"YES\" if p else\"NO\")", "n, m = map(int, input().split())\ns = set()\nfor _ in range(n):\n\tarr = list(map(int, input().split()))\n\tfor i in arr[1:]:\n\t\ts.add(i)\nif len(s) == m:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "#1\r\n'''\r\nn=int(input())\r\nline=input()\r\nnums=[int(i) for i in line.split()]\r\ns=0\r\nt1=0\r\nt2=0\r\nfor i in range(n):\r\n if nums[i]%2==0:\r\n s+=1\r\n t1=i+1\r\n else:\r\n t2=i+1\r\nif s==1:\r\n print(t1)\r\nelse:\r\n print(t2)\r\n'''\r\n\r\n#2\r\n\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nres=[]\r\n\r\nfor i in range(n):\r\n nums=[int(num) for num in input().split()[1:]]\r\n res.extend(nums)\r\n\r\nflag=0\r\nfor i in range(1,m+1):\r\n if i not in res:\r\n flag=1\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n ", "n, m = map(int, input().split())\r\nstate = []\r\nfor i in range(m):\r\n state.append(0)\r\nfor i in range(n):\r\n data = list(map(int, input().split()))[1:]\r\n for j in data:\r\n state[j-1] = 1\r\nif sum(state) != m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m = map(int,input().split())\r\nsta = [0]m\r\n\r\nfor i in range(n):\r\n lights = list(int(i) for i in input().split())\r\n for j in range(lights[0]):\r\n if sta[lights[j+1]-1] == 0:\r\n sta[lights[j+1]-1] = 1\r\n \r\nif sta.count(0) > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = map(int, input().split())\r\na = set()\r\nfor x in range(n):\r\n b = [int(y) for y in input().split()]\r\n a.update(b[1:])\r\n\r\nif len(a) == m :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n v = input().split()\r\n n = int(v[0])\r\n m = int(v[1])\r\n used = []\r\n for i in range(m):\r\n used.append(0)\r\n for i in range(n):\r\n v = input().split()\r\n for j in range(1, int(v[0]) + 1):\r\n used[int(v[j]) - 1] = 1\r\n\r\n ans = \"YES\"\r\n for i in range(m):\r\n if used[i] == 0:\r\n ans = \"NO\"\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=[int(x) for x in input().split()]\r\nlist1=[]\r\nfor i in range(n):\r\n lista=[int(x) for x in input().split()]\r\n list1=list1+lista[1:]\r\n continue\r\nk=1\r\ni=0\r\nwhile k <m+1:\r\n if k in list1:\r\n k+=1\r\n i+=1\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nif i==m:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\r\no=set()\r\np=set()\r\nfor i in range(1,m+1):\r\n o.add(i)\r\nfor i in range(n):\r\n lis=[int(x) for x in input().split()]\r\n lis1=lis[1::1]\r\n p.update(lis1)\r\nif o==p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m = map(int,input().split())\r\nbulbs_state = [0]m\r\nfor i in range(n):\r\n s = list(map(int,input().split()))\r\n for j in range(1,len(s)):\r\n bulbs_state[s[j]-1] = None\r\nif 0 in bulbs_state:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nfor e in a:\r\n for o in range(e[0]):\r\n b.append(e[o+1])\r\n\r\nb = set(b)\r\n\r\nif len(b) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nlights = [1 for x in range(0, m)]\r\nfor i in range(n):\r\n s = list(map(int,input().split()))\r\n del s[0]\r\n s.sort()\r\n for j in s:\r\n lights[j-1] = 0\r\nif sum(lights) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\nnumbers = []\nfor i in range(n):\n lst = list(input().split())\n for j in range(1, len(lst)):\n if lst[j] not in numbers:\n numbers.append(lst[j])\nif len(numbers) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t \t \t\t\t \t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\ntemp=[]\r\nfor i in range(n):\r\n list=[int(i) for i in input().split()]\r\n temp+=list[1:list[0]+1]\r\nif(len(set(temp))==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=input().split()\r\nn=int(n);m=int(m)\r\nA=set()\r\nfor i in range(n):\r\n X = list(map(int,input().split()))\r\n if(X[0]==0):continue\r\n A.update(X[1:])\r\nif(len(A)==m):print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nnum=set()\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for k in range(l[0]):\r\n num.add(l[k+1])\r\nprint(\"YES\" if len(num) == m else \"NO\")", "n, m = map(int, input().split())\n\n# Set of turned off bulbs\nturned_off = set(range(1, m+1))\n\nfor i in range(n):\n bulbs = list(map(int, input().split()))[1:]\n for bulb in bulbs:\n if bulb in turned_off:\n turned_off.remove(bulb)\n\nif turned_off:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n \t \t \t \t \t\t\t \t\t\t \t \t\t\t\t\t\t \t", "n,m=map(int,input().split())\r\nans=set()\r\nfor i in range(n):\r\n inp=list(map(int,input().split()))\r\n for j in range(1,inp[0]+1):\r\n if inp[j] in ans:\r\n continue\r\n else:\r\n ans.add(inp[j])\r\nif len(ans)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\nbulbs = [0] m\r\nfor _ in range(n):\r\n bulb = [map(int, input().split())]\r\n for i in range(1, len(bulb)):\r\n bulbs[bulb[i] - 1] = 1\r\n\r\nprint(\"YES\" if sum(bulbs) == m else \"NO\")\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 22:35:10 2022\r\n\r\n@author: 86138\r\n\"\"\"\r\n\r\na,b=map(int,input().split());c=set()\r\nfor i in range(a):\r\n inp=list(input().split())\r\n for j in range(len(inp)-1):\r\n c.add(inp[j+1])\r\nprint(['YES','NO'][len(c) != b])", "n, m = map(int,input().split())\nst = set()\nfor i in range(n):\n lst = list(map(int,input().split()))\n for j in range(1, len(lst)):\n st.add(lst[j])\nif len(st) == m:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t \t \t\t \t\t \t \t\t\t \t\t", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 18 15:50:24 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\na,b = map(int,input().split())\r\nc = []\r\nd = []\r\ne = 0\r\nfor i in range (0,b):\r\n d.append(1)\r\nfor i in range(0,a):\r\n c = list(map(int,input().split()))\r\n for j in range(1,len(c)):\r\n d[c[j]-1]=0\r\nfor i in range (0,b):\r\n e+=d[i]\r\nif e == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nlst = [0](m+1)\r\nfor i in range(n):\r\n lstn = list(map(int,input().split()))[1:]\r\n for j in lstn:\r\n lst[j]=1\r\ncount = lst.count(1)\r\nif count==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nset1=set()\r\nfor i in range(n):\r\n set1.update(input().split()[1:])\r\nif len(set1)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "#bulb\nn, m = map(int, input().split())\ns=set()\nflag = True\nfor i in range(n):\n q = list(map(int, input().split()))\n for j in range(1, q[0]+1):\n s.add(q[j])\nfor i in range(1, m+1):\n if i not in s:\n flag = False\n\nif flag:\n print('Yes')\nelse:\n print(\"No\")\n\t \t\t\t \t \t\t \t \t\t\t\t", "n,m = map(int,input().split())\r\nbulb_whole = [0]m\r\nfor i in range(n):\r\n bulb_part = list(map(int,input().split()))\r\n bulb_part.pop(0)\r\n for j in range(len(bulb_part)):\r\n index = bulb_part[j]\r\n if bulb_whole[index-1] == 0:\r\n bulb_whole[index-1] = 1\r\nif bulb_whole.count(0) != 0:\r\n print(\"NO\")\r\nelse: print(\"YES\")", "n , ln = map(int, input().split())\r\nnum = list(i for i in range(1,ln+1))\r\non = []\r\nfor j in range(n):\r\n step = list(input().split())\r\n a = int(step[0])\r\n for b in range(1,a+1):\r\n if int(step[b]) not in on:\r\n on.append(int(step[b]))\r\non.sort()\r\nif on == num:\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b = map(int, input().split())\r\nc = []\r\nd = []\r\nfor i in range(a):\r\n l = list(map(int, input().split()))\r\n c.extend((l[1:]))\r\nfor x in range(b):\r\n b -= 1\r\n d.append(b)\r\nfor e in range(len(d)):\r\n d[e] += 1\r\nif set(c) & set(d) == set(d):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n for i in a[1:]:\r\n l.append(i)\r\nl=set(list(l))\r\nif len(l)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n,m=(int(x) for x in input().split())\r\nk=[1]m\r\nfor i in range(n):\r\n t=[int(y) for y in input().split()]\r\n for i in t[1:]:\r\n k[i-1]=0\r\nif sum(k)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n, m = map(int, input().split())\r\nall = []\r\n\r\nfor i in range(n):\r\n bulbs = list(map(int, input().split()))\r\n for j in bulbs[1:len(bulbs)]:\r\n all.append(j)\r\n\r\ns_all = set(all)\r\nif len(s_all) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "m, n = map(int, input().split())\r\nbulbs = [0 for i in range(n)]\r\nfor i in range(m):\r\n xy = [i for i in map(int, input().split())]\r\n xi = xy[0]\r\n yi = xy[1:]\r\n for y in yi:\r\n bulbs[y - 1] = 1\r\n\r\nif sum(bulbs) == n:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl2=[]\r\nwhile(n):\r\n l=list(map(int,input().split()))\r\n l1=l[1:]\r\n l2.append(l1)\r\n n=n-1\r\n#print(l2)\r\noutput = []\r\ndef reemovNestings(l2):\r\n for i in l2:\r\n if type(i) == list:\r\n reemovNestings(i)\r\n else:\r\n output.append(i)\r\nreemovNestings(l2)\r\ns=set(output)\r\n#print(s)\r\nif(len(s)==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import \r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef main():\r\n n,m = nextInts()\r\n\r\n arr = [0](m+1)\r\n for i in range(n):\r\n b = nextInts()\r\n for i in range(1,b[0]+1):\r\n arr[b[i]] = 1\r\n\r\n ok = True\r\n for i in range(1,m+1):\r\n if arr[i] == 0:\r\n ok = False\r\n\r\n if ok:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n\r\n", "n, m = [int(a) for a in input().split()]\r\nx = set()\r\nfor _ in range(n):\r\n x.update(set(input().split()[1:]))\r\nprint([\"NO\", \"YES\"][len(x) == m])", "def main():\n n, m = map(int, input().split())\n switches = [list(map(int, input().split())) for _ in range(n)]\n\n seen = [False] * m\n for switch in switches:\n bulbs = switch[1:]\n for bulb in bulbs:\n seen[int(bulb) - 1] = True\n\n print(\"YES\" if all(seen) else \"NO\")\n\nif __name__ == \"__main__\":\n main()\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 15:25:10 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\nx,y = map(int,input().split())\r\nflag = 'YES' \r\n\r\nbulb = [0 for i in range(y+1)]\r\nbulb[0] = 1\r\n\r\nfor i in range(x):\r\n a = input().split()\r\n a = [int(x) for x in a]\r\n d = a[0] + 1\r\n for j in range(1,d):\r\n bulb[a[j]] = 1\r\n\r\nfor i in range(y+1):\r\n if bulb[i] == 0:\r\n flag = 'NO'\r\n\r\nprint(flag)", "n,m=list(map(int,input().split()))\r\na=[0]m\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n for j in range(1,b[0]+1):\r\n a[b[j]-1]=1\r\ne=0\r\nfor i in range(m):\r\n if a[i]==0:\r\n e=1\r\n break\r\nif e==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", " \r\ndef solve():\r\n groups, lights = list(map(int, input().split(\" \")))\r\n lst = []\r\n \r\n for i in range(groups):\r\n group = list(map(int, input().split(\" \")))\r\n num = group.pop(0)\r\n lst = lst + group\r\n lst = list(set(lst))\r\n if len(lst) == lights:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nsolve()", "n,m=map(int,input().split())\ndic ={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in dic:\n dic[lst[j]]=1\nif len(dic)==m:\n print('Yes')\nelse:\n print('No')\n\n\n \t\t \t \t \t\t \t\t \t \t\t \t\t\t", "n,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(n):\r\n shuru= input().split()\r\n for i in range(1,int(shuru[0])+1):\r\n bulbs.append(shuru[i])\r\nans=len(list(set(bulbs)))\r\nif ans==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=input().split()\nn=int(n)\nm=int(m)\nset=set()\nfor i in range(n):\n list=input().split()\n for i in range(1,len(list)):\n set.add(list[i])\n\nif(len(set)==m):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t\t\t\t\t \t\t \t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(n):\r\n x=input().split()\r\n for t in x[1:]:\r\n if t not in l1:\r\n l1.append(t)\r\nif len(l1)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "x,b = input().split()\nx = int(x)\nb = int(b)\nanss = []\nfor i in range(x):\n lst = list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in anss:\n anss.append(lst[j])\n else:\n continue\nif len(anss)==b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t\t\t \t \t \t\t \t\t", "button, bulb = map(int, input().split())\r\nbul = set()\r\nfor k in range(bulb):\r\n bul.add(str(k+1))\r\non = set()\r\nfor i in range(button):\r\n b = input().split()\r\n on.update(b[1:])\r\nif bul == on:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n for _ in a[1:]:\r\n l.append(_)\r\nfor j in range(m):\r\n if j+1 not in l:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n, m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n l = input().split()\r\n s = s \| set(l[1:])\r\nprint(['NO','YES'][len(s) == m])", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Nov 3 13:57:19 2020\r\n\r\n@author: 86133\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nc = 1\r\nd = [0 for i in range(200)]\r\nfor i in range(n):\r\n a = [int(j) for j in input().split()]\r\n for j in a[1:]:\r\n d[j] = 1\r\nfor i in d[1:m+1]:\r\n if not i:\r\n c = 0\r\n print('NO')\r\n break\r\nif c:\r\n print('YES')", "n,m = [int(x) for x in input().split(\" \")]\r\nclose = set()\r\nwhile True:\r\n try:\r\n s = input().split(\" \")\r\n for i in range(1,len(s)):\r\n close.add(s[i])\r\n except EOFError:\r\n break\r\n\r\nprint([\"NO\",\"YES\"][len(close) - m==0])", "n , m = map(int,input().split())\r\nlist1 = []\r\nz = 0 \r\nwhile n > z :\r\n list0=map(int,input().split())\r\n for i in list0:\r\n list1.append(i)\r\n z+=1 \r\nif list1[0] == m :\r\n list1=list1[1:]\r\nfor i in range(1,m+1):\r\n if i in list1 :\r\n q=9\r\n else:\r\n q=0\r\n break\r\nif q == 9 :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n# easy hhh ", "n,m=map(int,input().split())\r\non=[]\r\nfor i in range(n):\r\n bulbs=list(map(int,input().split()))\r\n for j in range(bulbs[0]):\r\n if bulbs[j+1] in on:\r\n continue\r\n else:\r\n on.append(bulbs[j+1])\r\n\r\nif len(on)==m:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n for i in range(1,len(s)):\r\n if(s[i] not in d):\r\n d[s[i]]=1\r\nif(len(d)==m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n for i in range(1,len(a)):\r\n if a[i] not in lst:\r\n lst.append(a[i])\r\nif len(lst)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\r\nd=[i for i in range(1,b+1)]\r\nfor k in range(a):\r\n c=list(map(int,input().split()))\r\n for i in range(1,len(c)):\r\n d[c[i]-1]=0\r\nif sum(d)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nbulbs = [0] m\r\n\r\nfor _ in range(n):\r\n for i in input().split()[1:]:\r\n bulbs[int(i) - 1] = 1\r\n\r\nprint(\"YES\" if all(bulbs) else \"NO\")\r\n", "n,m=map(int,input().split(' '))\r\nX=[]\r\nfor i in range(1,n+1):\r\n\tA=list(map(int,input().split(' ')))\r\n\tx=A[0]\r\n\tfor k in range(1,x+1):\r\n\t\tX.append(A[k])\r\n\r\nY=list(set(X))\r\n\r\nZ=[]\r\nfor c in range(1,m+1):\r\n\tZ.append(c)\r\nif Y==Z:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "buttons,bulbs = list(map(int,input().split()))\r\n\r\nb=[]\r\nfor i in range(buttons):\r\n\tn = list(map(int,input().split()))\r\n\tn.remove(n[0])\r\n\tfor i in n:\r\n\t\tb.append(i)\r\n\r\nif len(set(b)) == bulbs:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n,m=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in l[1:]:\r\n b.append(j)\r\nif(len(set(b))==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m, n = map(int, input().split())\r\nd = [False] * n\r\nfor i in range(m):\r\n for j in map(int, input().split()[1:]):\r\n d[j - 1] = True\r\nprint('YES' if all(d) else 'NO')", "n,m = map(int,input().split())\r\nbulbs = set() ; on = set()\r\nfor i in range(1,m+1):\r\n bulbs.add(i)\r\nfor _ in range(n):\r\n raw = [int(x) for x in input().split()]\r\n raw.remove(raw[0])\r\n for x in raw: on.add(x)\r\nif bulbs.issubset(on): print(\"YES\")\r\nelse: print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 14:12:50 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\n_a = input().split()\r\nn = int(_a[0]); m = int(_a[1])\r\nbulbs = [False for x in range(0,m)]\r\n\r\nfor i in range(0,n):\r\n l = [int(x) for x in input().split()]\r\n for x in l[1:]:\r\n bulbs[x - 1] = True\r\nif False in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n ", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\ncheck = defaultdict(int)\r\nfor i in range(n):\r\n arr = [map(int, input().split())]\r\n for j in range(1, len(arr)):\r\n check[arr[j]] += 1\r\nprint(\"YES\" if len(check) == m else \"NO\")", "n,m=[int(x) for x in input().split()]\r\na=set()\r\nfor i in range(n):\r\n a.update(input().split()[1:])\r\nif len(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nbulbs=[False]m\r\nfor i in range(n):\r\n l=[int(x) for x in input().split()]\r\n j=1\r\n while(j<=l[0]):\r\n if not bulbs[l[j]-1]:\r\n bulbs[l[j]-1]=True\r\n j+=1\r\nfor k in range(m):\r\n if(not bulbs[k]):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,m=list(map(int,input().split()))\r\nl=[]\r\nlf=[]\r\nsi=set()\r\ns=set()\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n s.update(a[1:])\r\nfor i in range(1,m+1):\r\n lf.append(i)\r\nsi.update(lf)\r\nif s==si:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\n\nbulbs = set(range(1, m + 1))\nbuttons = [set(map(int, input().split()[1:])) for _ in range(n)]\n\nfor button in buttons:\n bulbs -= button\n \nif not bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t\t \t \t\t \t \t", "n,m=[int(x) for x in input().split()]\r\nbulbs=[]\r\nfor i in range (n):\r\n bulb=[int(x) for x in input().split()]\r\n for j in range(1,len(bulb)):\r\n bulbs.append(bulb[j])\r\nk=set(bulbs)\r\nif len(k)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "q=\"YES\"\r\na=input()\r\nb=a.split()\r\ns=int(b[1])\r\nt=[True for x in range(1,int(b[1])+1)]\r\ni=0\r\nwhile i!=int(b[0]):\r\n c=input()\r\n d=c.split()\r\n for j in range(1,len(d)):\r\n t[int(d[j])-1]=False\r\n i=i+1\r\nfor x in t:\r\n if x==True:\r\n q=\"NO\"\r\nprint(q)", "n,m=map(int,input().split())\r\nlis=[]\r\nfor i in range(n):\r\n nlis=list(map(int,input().split()))\r\n for j in range(int(nlis[0])):\r\n if nlis[j+1] not in lis:\r\n lis.append(nlis[j+1])\r\nif len(lis)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,m):\r\n l.append(i)\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n for i in range(0,a[0]):\r\n l[a[i+1]-1]=-1\r\nif l.count(-1)==len(l):\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b = map(int,input().split())\r\nc= []\r\n\r\nfor i in range(a):\r\n d = list(map(int,input().split()))\r\n for i in d[1:]:\r\n c.append(i)\r\ne = list(set(c))\r\nif len(e)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\nSTATE = [0](m+1)\r\nfor i in range (n):\r\n S = [int (x) for x in input().split()]\r\n for j in range(1,S[0]+1):\r\n STATE[S[j]]=1\r\nsb = 0 \r\nfor i in range (1,m+1):\r\n if STATE[i]==0:\r\n sb=1\r\nif (sb==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m =map(int,input().split())\ndic={}\nfor i in range(n):\n lst=list(map(int,input().split()))\n for x in range(1,len(lst)):\n if lst[x] not in dic:\n dic[lst[x]]=1\n else:\n dic[lst[x]]+=1\nif len(dic)==m:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t \t \t\t\t \t \t \t \t\t\t\t \t\t", "\r\nn,m=map(int,input().split())\r\nbulbs=[\"0\"]m\r\nbutt=[]\r\nfor i in range(n):\r\n butt=input().split()\r\n del butt[0]\r\n for k in butt:\r\n bulbs[int(k)-1]=\"1\"\r\nprint(\"YES\"if bulbs.count(\"0\")==0 else \"NO\")", "a,b=map(int,input().split())\r\nc=[0]b\r\nfor i in range(a):\r\n d=list(map(int,input().split()))\r\n for i in range(d[0]):\r\n c[d[i+1]-1]+=1\r\nif c.count(0):\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\nans=list()\r\nans=[0 for i in range(m)]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n ans[l[j]-1]=1\r\nflag=1\r\nfor i in range(m):\r\n if ans[i]==0:\r\n flag=0\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,l[0]+1):\r\n lst.append(l[j])\r\nlst=set(lst)\r\nif len(list(lst))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = map(int, input().split())\r\nbulb = []\r\naim = []\r\nopen = {}\r\nfor i in range(m):\r\n aim.append(i+1)\r\n open[i+1] = 0\r\nfor i in range(n):\r\n bulb.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(1,bulb[i][0]+1):#最后一个数字的指针是bulb[i][0]，因此需要+1\r\n if bulb[i][j] in open.keys():\r\n open[bulb[i][j]] += 1\r\nif 0 in open.values():\r\n print('NO')\r\nelse:\r\n print('YES')", "def f(dict):\r\n for i in dict.keys():\r\n if dict[i]==0:\r\n return 'NO'\r\n return 'YES'\r\nn,m=[int(i) for i in input().split()]\r\nx={}\r\nfor i in range(1,m+1):\r\n x[i]=0\r\nfor i in range(1,n+1):\r\n a=[int(i) for i in input().split()]\r\n for j in range(1,a[0]+1):\r\n x[a[j]] += 1\r\nprint(f(x))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Nov 9 14:51:25 2020\r\n\r\n@author: pinky\r\n\"\"\"\r\n\r\nn,m=[int(x) for x in input().split()]\r\nloca=set()\r\nfor i in range (n):\r\n a=[int(x) for x in input().split()]\r\n l=len(a)\r\n s=set(a[1:l])\r\n loca=loca.union(s)\r\nif len(loca)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=[int(x) for x in input().split()]\r\na=[0]m\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n for i in range(1,len(b)):\r\n c=b[i]\r\n a[c-1]=1\r\nif sum(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a , b = map(int,input().split())\nc = []\nfor i in range (a):\n lst = list(input().split())\n for d in range (1,len(lst)):\n if lst[d] not in c:\n c.append(lst[d])\nif len(c) == b :\n print('YES')\nelse:\n print('NO')\n\t\t\t\t \t \t\t \t \t \t \t", "n, m = map(int,input().split())\r\nlis=[0]m\r\nfor i in range(n):\r\n templist=list(map(int,input().split()))\r\n for j in templist[1::]:lis[j-1]+=1\r\nfor i in range(m):\r\n if(lis[i]==0):\r\n print(\"NO\")\r\n break\r\nelse:print(\"YES\")", "n,m=list(map(int,input().split()))\r\nlight=[0]m\r\nfor i in range(n):\r\n x=list(map(int, input().split()))\r\n for j in range(x[0]):\r\n light[x[j+1]-1] = 1\r\nif sum(light) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\narr1=[int(i) for i in range(1,m+1)]\r\nl=[]\r\nfor i in range(n):\r\n arr=[int(z) for z in input().split()]\r\n for x in arr[1:]:\r\n if x not in l:\r\n l.append(x)\r\nl.sort()\r\nif arr1==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "x,y= map(int,input().split())\r\nb=set()\r\nfor i in range (x):\r\n a = input().split()\r\n for j in a[1:]:\r\n b.add(j)\r\nif y == len(b):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\nb = set()\r\nfor i in range(n):\r\n la = [int(x) for x in input().split()]\r\n for j in la[1:]:\r\n b.add(j)\r\nif len(b)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = [int(x) for x in input().split()]\r\nList1 = [i for i in range(1,m+1)]\r\nfor i in range(n):\r\n List = [int(x) for x in input().split()]\r\n x = List[0]\r\n for j in range(1,x+1):\r\n if List[j] in List1:\r\n List1.remove(List[j])\r\nif len(List1) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\n\r\nn,m = map(int,input().split())\r\nUnion = set()\r\nfor i in range(n):\r\n L = input().split()\r\n t = int(L[0])\r\n s = {int(L[i]) for i in range(1,t+1)}\r\n Union = Union \| s\r\nif Union == {i+1 for i in range(m)}:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n ", "n,m=[int(x) for x in input().split()]\r\ns=[0]m\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n for i in range(1,len(x)):\r\n s[x[i]-1]=1\r\nif 0 in s:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\nw=set()\r\nq=set(str(s) for s in range(1,m+1))\r\nfor _ in range(n):\r\n a=[str(i) for i in input().split()]\r\n for b in a[1:]:\r\n w.add(b)\r\nif w==q:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nx=[]\r\nfor i in range(n):\r\n x += list(map(int, input().split()))[1:]\r\nprint('YES' if len(set(x)) == m else 'NO')", "n,m=map(int,input().split())\r\nseen=set()\r\nfor _ in range(n):\r\n a=list(map(int,input().split()))\r\n a=a[1:]\r\n for el in a:\r\n seen.add(el)\r\nprint(\"YES\" if len(seen)==m else \"NO\")\r\n ", "y=input()\nnm=[int(i) for i in y.split()]\nn=nm[0]\nm=nm[1]\nB=set()\ntr=False\nfor i in range(n):\n x=input()\n l=[i for i in x.split()]\n l.remove(l[0])\n B.update(l)\n if len(B)==m:\n tr=True\n \nif tr:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t\t\t \t \t \t \t \t \t\t\t", "n,m = [int(x) for x in input().split()]\r\nswitch = [False] (m + 1)\r\ncnt = 0\r\nfor loops in range(n):\r\n button = [int(x) for x in input().split()]\r\n for bulb in range(1,len(button)):\r\n if switch[button[bulb]] == False:\r\n switch[button[bulb]] = True\r\n cnt += 1\r\nif(cnt == m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "e=[]\r\nn,m=map(int,input().split())\r\nfor a in range(0,n):\r\n b=list(map(int,input().split()))\r\n d=b[1:]\r\n e=e+d\r\n#print(d)\r\n#print(e)\r\n#print(set(e))\r\nc=set(range(1,m+1))\r\n#print(c)\r\nif set(e)==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m =map(int,input().split())\nst = set()\nfor i in range(n):\n lst=list(map(int,input().split()))\n for j in range(1, lst[0]+1):\n st.add(lst[j])\n \nif len(st)==m:\n print('YES')\nelse:\n print('NO')\n\t \t \t\t \t\t\t\t \t \t \t\t\t\t\t", "a,b=map(int,input().split())\r\nc=[]\r\ni=1\r\nwhile i<=a:\r\n w=list(map(int,input().split()))\r\n del w[0]\r\n for m in w:\r\n if m not in c:\r\n c.append(m)\r\n i=i+1\r\nif len(c)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\non = set()\r\nfor _ in range(n):\r\n on.update(input().split()[1:])\r\nprint(['NO','YES'][len(on)==m])", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 5 07:54:29 2020\r\n\r\n@author: 17831\r\n\"\"\"\r\n\r\nn,m = [int(x) for x in input().split()]\r\nset1 = set()\r\n\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\n for j in range(1,len(a)):\r\n set1.add(a[j])\r\n\r\nb = (m(1+m))/2\r\nif b == sum(set1):\r\n print('YES')\r\nelse:\r\n print('NO')", "io = input().split()\r\n\r\nn = int(io[0])\r\nm = int(io[1])\r\n\r\non = [False] m\r\n\r\nfor i in range(n):\r\n buttons = list(map(int, input().split()))\r\n buttons.pop(0)\r\n for j in range(1, m + 1):\r\n if j in buttons:\r\n on[j - 1] = True\r\n\r\nif all(on):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nbulbs=set()\r\nfor _ in range(n):\r\n inp=list(map(int,input().split()))\r\n bulb=set(inp[1:])\r\n bulbs=bulbs.union(bulb)\r\nif len(bulbs)==m:\r\n print('YES')\r\nelse: print('NO')", "n,m=map(int,input().split())\nset={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in set:\n set[lst[j]]=1\nif len(set)==m:\n print('Yes')\nelse:\n print('No')\n\n\n \t\t \t \t \t \t\t \t\t\t \t \t\t\t \t \t", "import sys\nnbut, nbulb = list(map(int, sys.stdin.readline().split()))\n\nbulblist = set(range(1, nbulb+1))\n\n#print(bulblist)\n\nfor n in range(nbut):\n tmp = list(map(int, sys.stdin.readline().split()))\n tmp.pop(0)\n tmp = set(tmp)\n for a in tmp:\n bulblist.discard(a)\nif len(bulblist) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t\t \t\t\t \t\t\t \t", "n,m=map(int,input().split())\r\ndic = [0]m\r\nfor _ in range(n):\r\n tmp = list(map(int,input().split()))\r\n for i in range(1,len(tmp)):\r\n dic[tmp[i]-1]=1\r\nif 0 in dic:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "set0 = set()\r\nn, m = map(int, input().split())\r\nfor i in range(0, n):\r\n set0 = set0 \| set(list(map(int, input().split()))[1:])\r\nif len(set0) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\ns = set()\nflag = True\nfor i in range(n):\n q = list(map(int,input().split()))\n for j in range(1,q[0]+1):\n s.add(q[j])\n\n\nfor i in range(1,m+1):\n if i not in s:\n flag = False\n\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t \t \t \t\t\t \t \t \t\t \t \t\t\t", "n,m=map(int,input().split())\r\nans=[0 for i in range(m)]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n for j in range(1,a[0]+1):\r\n ans[a[j]-1]=1\r\nprint(\"YES\"if ans.count(0)==0 else\"NO\")\r\n", "def main():\n bulbs = int\n inputs = str\n inputs = input()\n inputs = inputs.split()\n buttons = inputs[0]\n bulbs = inputs[1]\n button_cap = \"\"\n for _ in range(1, int(buttons)+1):\n button_cap += (input()[2:])+\" \"\n button_cap = button_cap.split()\n button_cap = set(button_cap)\n\n for y in range(1, int(bulbs)+1):\n if str(y) not in button_cap:\n print(\"NO\")\n return 0\n print(\"Yes\")\n\nmain()\n\t \t\t\t\t\t\t\t \t\t\t\t\t \t \t\t \t \t", "n,m=map(int, input().split())\r\nans=[]\r\nfor i in range(n):\r\n li=[i for i in input().split()]\r\n del li[0]\r\n ans.extend(j for j in li)\r\n\r\nif len(set(ans))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nbulbs = [1 for x in range(m)]\r\nfor i in range(n):\r\n digits = [int(x) for x in input().split()]\r\n del digits[0]\r\n for digit in digits:\r\n bulbs[digit - 1] = 0\r\nif sum(bulbs) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=[int(x) for x in input().split()]\r\na=[1]m\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n for j in range(b[0]):\r\n a[b[j+1]-1]=0\r\nprint(['YES','NO'][sum(a)!=0])", "n,m=map(int, input().split())\r\nyij=[]\r\nfor i in range(n):\r\n bulbs=input().split()\r\n yij+=(bulbs[1:])\r\nif len(set(yij))==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = [int(x) for x in input().split()]\r\nturn_on = set()\r\nfinal = set(range(1,m+1))\r\nfor _ in range(n):\r\n l = [int(x) for x in input().split()]\r\n s = set(l[1:])\r\n turn_on = turn_on.union(s)\r\nif turn_on == final:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n,m=map(int, input().split())\r\ns=[]\r\nfor _ in range(n):\r\n a=[int(i) for i in input().split()]\r\n a.pop(0)\r\n for j in a:\r\n if j not in s:\r\n s.append(j)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "\nn, m = map(int,input().split())\na = dict()\n\nfor i in range(m):\n a[i+1] = 0\n\nfor i in range(n):\n temp = list(map(int, input().split()))\n x = temp[0]\n for j in range(1,len(temp)):\n y = temp[j]\n a[y] = 1\n\nflag = 0\nfor i in range(1,m+1):\n if a[i] == 0:\n flag = 1\n\n\nif flag != 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t \t \t \t\t\t\t \t \t \t \t\t\t\t \t\t\t", "def solve(n,m,l):\r\n x = []\r\n for i in l:\r\n firstSkip = False\r\n for j in i:\r\n if not firstSkip:\r\n firstSkip = True\r\n continue\r\n x.append(j)\r\n # print(x,l)\r\n if len(set(x)) == m:\r\n return \"YES\"\r\n return \"NO\"\r\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nprint(solve(n,m,l))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Mon Oct 18 19:01:34 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\ncombined = []\r\nfor i in range (n):\r\n xi = input().split()\r\n lights = xi[1:]\r\n #print(lights)\r\n combined += lights \r\n#print(combined)\r\n\r\n final = list(dict.fromkeys(combined))\r\n#print(final)\r\norderfinal = sorted(final)\r\n#print(orderfinal)\r\n\r\nif len(orderfinal) == m:\r\n#len(list) gives the number of elements in a list\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n'''\r\nx = 0\r\nprint(orderfinal[x], x)\r\nif orderfinal[x] == x+1:\r\n print(orderfinal[x], x)\r\n x += 1\r\n if x == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\", x, n)\r\n'''", "n,m=map(int,input().split())\r\nlista=[0]m\r\nlistb=[]\r\nfor i in range(n):\r\n listb=list(input().strip().split())\r\n listb=[int(x) for x in listb]\r\n for j in listb[1:]:\r\n lista[j-1]=1\r\nif sum(lista)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "nm = tuple(map(int,input().split()))\r\nbulbs = list(map(int,('1 'nm[1]).split()))\r\nfor i in range(nm[0]):\r\n button = list(map(int,input().split()))\r\n for j in range(1,button[0]+1):\r\n bulbs[button[j]-1] = 0\r\nif sum(bulbs) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 5 08:30:46 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nm,n=map(int,input().split())\r\nx=0\r\nl=[]\r\nwhile m:\r\n m-=1\r\n l1=input().split()\r\n l1.remove(l1[0])\r\n l+=l1\r\nfor i in range(1,n+1):\r\n if str(i) not in l:\r\n x+=1\r\nif x==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n s.update(input().split()[1:])\r\n \r\nprint(['NO','YES'][len(s)==m])", "n, m = map(int, input().split())\ns = set()\nfor _ in range(0, n):\n x, v = map(int, input().split())\n s \|= set(v)\nif len(s) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, m = map(int,input().split())\r\n\r\nincontrol = []\r\nfor _ in range(n):\r\n button = input().split()\r\n for i in range(1,len(button)):\r\n incontrol.append(button[i])\r\n \r\nincontrol = set(incontrol)\r\n\r\nif len(incontrol) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "x, y = [int(x) for x in input().split()]\r\nlst = []\r\nlst.extend(range(1,y+1))\r\nc = []\r\n\r\nfor i in range(x):\r\n b = [int(x) for x in input().split()]\r\n c.extend(b[1::])\r\n for d in c:\r\n if d in lst:\r\n lst.remove(d)\r\n \r\n\r\nif len(lst) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "m,n=[int(x) for x in input().split()]\r\na=list()\r\nfor i in range(m):\r\n x=[int(j) for j in input().split()]\r\n del x[0]\r\n for i in x:\r\n a.append(i)\r\nif set(a)==set(range(1,n+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=[int(x)for x in input().split()]\r\nempty=set()\r\nfor i in range(n):\r\n a=[int(y)for y in input().split()]\r\n for j in a[1:]:\r\n empty.add(j)\r\nnumber=len(empty)\r\nif number!=m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split(' '))\r\ns=set(range(1,m+1))\r\nfor i in range(n):\r\n l=list(map(int,input().split(' ')))\r\n del l[0]\r\n ls=set(l)\r\n s=s-ls\r\nif len(s)==0:\r\n print('YES')\r\nelif len(s)>0:\r\n print('NO')", "m,t = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n a = input().split()\r\n a.remove(a[0])\r\n l+=a\r\nprint(\"YES\" if len(set(l))==t else \"NO\")", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\na = 0\r\nd = {}\r\nfor i in range(n):\r\n x = [int(xx) for xx in input().split()]\r\n for j in range(1,len(x)):\r\n if x[j] not in d:\r\n d[x[j]]=1\r\n a+=1\r\nif a==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=set()\r\nfor j in range(n):\r\n for i in list(input().split())[1:]:\r\n a.add(int(i))\r\nprint((a==set(range(1,1+m)))\"YES\"+(1-(a==set(range(1,m+1))))\"NO\")", "n,m=map(int,input().split())\r\nw=list(range(1,m+1))\r\ny=[]\r\nfor i in range(n):\r\n x=input().split()\r\n del x[0]\r\n x=map(int,x)\r\n for i in x:\r\n y.append(i)\r\n \r\nif len(set(y)) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nli = []\r\nfor i in range(n):\r\n s = [int(i) for i in input().split()]\r\n s.remove(s[0])\r\n li += s\r\nif len(set(li)) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nmyBulb=[]\r\nfor i in range(n):\r\n arr=list(map(int,input().split()))\r\n myBulb+=arr[1:]\r\n\r\ncheckConn=True\r\n\r\nfor k in range(1,m+1):\r\n if(k not in myBulb):\r\n print('NO')\r\n checkConn=False\r\n break\r\nif(checkConn==True):\r\n print('YES')\r\n\r\n\r\n ", "n,m=map(int,input().split())\r\ns_total=[]\r\nfor i in range(n):\r\n l=[int(x)for x in input().split()]\r\n del(l[0])\r\n s_total.extend(l)\r\ns=set(s_total)\r\nx=True\r\ni=1\r\nwhile i<=m:\r\n if i not in s:\r\n x=False\r\n break\r\n i+=1\r\nif x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split(' ')) # n = the number of buttons; m = the number of bulbs\r\noperation = []\r\nfor i in range(n):\r\n operation += (list(map(int,input().split(' ')[1:])))\r\n\r\nbulbs = set(operation)\r\n\r\nfor i in range(1, m+1):\r\n if i not in bulbs:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\nc=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n b=a[1:]\r\n b=list(set(b))\r\n for i in b:\r\n if i not in c:\r\n c.append(i)\r\nif(len(c)==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = [int(x) for x in input().split()]\r\nbulbs = set()\r\nfor _ in range(n):\r\n bulbs.update(input().split()[1:])\r\nprint('YES' if len(bulbs) == m else 'NO')", "n, m = input().split() # n number of buttons and m number of bulbs\nn, m = [int(n), int(m)]\non = [] # all bulbs that can be turned on\nfor _ in range(n):\n i, a =map(int,input().split(' '))\n on.extend(a)\nchecker = {i for i in range(1,m+1)}\nif checker == set(on):\n print(\"YES\")\nelse:\n print(\"NO\")", "button,bulbs=map(int,input().split())\r\na=dict()\r\nb=[]\r\nfor ti in range(button):\r\n b=[int(i) for i in input().split()]\r\n del b[0]\r\n for i1 in b:\r\n a[i1]=1\r\n b=[]\r\ns=sum(a.values())\r\nif s==bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n\tl2=list(map(int,input().split()))[1:]\r\n\tl.extend(l2)\r\nl=list(set(l))\r\nif len(l)==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\nbulb_states = [0] m\r\n\r\nfor _ in range(n):\r\n button_info = list(map(int, input().split()))\r\n bulbs = button_info[1:]\r\n for bulb in bulbs:\r\n bulb_states[bulb - 1] = 1\r\n\r\nif all(bulb_states):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nc=set(range(1,b+1))\r\ne=set()\r\nfor i in range(a):\r\n d=[int(j) for j in input().split()]\r\n d.pop(0)\r\n d=set(d)\r\n e=e.union(d)\r\nprint('YES' if e==c else 'NO')", "n, m = map(int, input().split())\r\nb = [False]m\r\nfor _ in range(n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b[int(j)-1] = True\r\nprint(['NO', 'YES'][b == [True]m])\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n i,=map(int,input().split())\r\n for x in i[1:]:\r\n l.append(x)\r\nif len(set(l))==m:print('YES')\r\nelse: print('NO')", "n, m = map(int, input().split())\r\narr = [0] m\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for x in a[1:]:\r\n x -= 1\r\n arr[x] = 1\r\n\r\nif arr.count(0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, m = map(int, input().split())\r\nbulb_set = set()\r\nfor i in range(n):\r\n x = [int(j) for j in input().split()]\r\n del x[0]\r\n bulb_set.update(x)\r\nprint(['NO', 'YES'][len(bulb_set) == m])\r\n", "a=list(int(i) for i in(input().split()))\r\nn=a[0]\r\nm=a[1]\r\ny=[]\r\nb=[]\r\nfor i in range(n):\r\n\tx=list(input().split())\r\n\tfor i in range(1,int(x[0])+1):\r\n\t\ty.append(x[i])\r\nfor i in range(1,m+1):\r\n\tif str(i) not in set(y):\r\n\t\tb.append(i)\r\nif len(b)!=0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "a = list(map(int,input().split()))\r\nlist_1 = []\r\nfor i in range(a[0]):\r\n x = input().split()\r\n for j in x[1:]:\r\n if j not in list_1:\r\n list_1.append(j)\r\nif len(list_1) == a[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n lis = input().split()\r\n s = s\|set(lis[1:])\r\nif len(s) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\np=[]\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n for i in range(1,l[0]+1):\r\n p.append(l[i])\r\nx=set(p)\r\nif len(x)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n t = list(map(int,input().split()))\r\n del t[0]\r\n for j in range(len(t)):\r\n l.append(t[j])\r\nl = list(set(l))\r\nif len(l) == m :\r\n print('YES')\r\nelse:\r\n print('NO')", "m,n=map(int,input().split())\r\nlamp=[1]n\r\nfor _ in range(m):\r\n y=list(map(int,input().split()))\r\n for j in y[1:]:\r\n lamp[j-1]=0\r\nprint(['NO','YES'][sum(lamp)==0])", "n,m=input().split()\r\nl=[]\r\nb=0\r\nfor i in range(int(n)):\r\n a=input().split()\r\n for k in range(1,int(a[0])+1):\r\n l.append(a[k])\r\nc=list(set(l))\r\nfor d in range(1,int(m)+1):\r\n if str(d) in c:\r\n b+=1\r\nif b==int(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\ncheck=set()\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n for j in range(1,len(x)):\r\n check.add(x[j])\r\nif len(check)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nuser_input = sys.stdin.read()\ntoks = user_input.split('\\n')\n\nfirst_line = toks[0].split(' ')\nnum_buttons = int(first_line[0])\nnum_bulbs = int(first_line[1])\n\non_bulbs = set()\nfor line in toks[1:]:\n bulbs = line.split(' ')[1:]\n \n for bulb in bulbs:\n on_bulbs.add(bulb)\n\nprint('YES' if len(on_bulbs) == num_bulbs else 'NO')\n \t\t\t \t\t \t \t\t\t\t \t\t\t\t\t \t\t\t", "n, m = map(int, input().split())\r\nbulb = [0 for i in range(m)]\r\nz = 0\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n y = x[0]\r\n for j in range(1, y+1):\r\n bulb[x[j]-1] += 1\r\nfor i in range(m):\r\n if bulb[i] == 0:\r\n z = 1\r\nif z == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\nlt=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,l[0]+1):\r\n lt.append(l[j])\r\nlt=set(lt)\r\nif len(list(lt))==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=[int(x)for x in input().split()]\r\nlight=[]\r\nfor i in range(n):\r\n li=[int(x)for x in input().split()]\r\n light=light+li[1:]\r\nlight=set(light)\r\nl=len(light)\r\nif l==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n s.add(l[j])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a,b=map(int,input().split())\r\nk=set()\r\nfor i in range(a):\r\n l=list(map(int,input().split()))\r\n l.remove(l[0])\r\n k=k\|set(l)\r\nif len(k)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int, input().split()) #the number of buttons and the number of bulbs.\r\nOn=set()\r\nfor i in range(n):\r\n tem= [ x for x in input().split()]\r\n del tem[0]\r\n for j in tem:\r\n On=On\|{j}\r\nprint(\"YES\" if len(On)==m else \"NO\")", "n,m=map(int,input().split())\r\nallbulbs=[]\r\nfor i in range(n):\r\n origin=[int(x) for x in input().split()]\r\n openbulbs=set(origin[1:])\r\n allbulbs+=openbulbs\r\nif len(set(allbulbs))<m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m = map(int,input().split())\r\nb = []\r\nfor x in range(n):\r\n a = [int(i) for i in input().split()]\r\n b += a[1:a[0]+1]\r\nb.sort()\r\ncount=0\r\nfor i in range(1,m+1):\r\n if i in b:\r\n continue\r\n else:\r\n count+=1\r\nif count==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=[]\r\ns=set()\r\nfor i in range(n):\r\n a.append([x for x in input().split()])\r\n del(a[i][0])\r\n s=s\|set(a[i])\r\nprint(\"YES\" if len(s)==m else \"NO\")\r\n", "a, b = map(int, input().split())\nansl = []\nfor i in range(a):\n c = list(map(int, input().split()))\n for i in range(1, c[0]+1):\n ansl.append(c[i])\nansl = list(dict.fromkeys(ansl))\nif len(ansl) == b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t \t\t\t \t \t \t\t\t \t\t\t", "S=[int(x) for x in input().split()]\r\nK={0}\r\nfor x in range(S[0]):\r\n\tQ={int(x) for x in input().split()[1:]}\r\n\tK.update(Q)\r\n\r\nK_0={0}\r\nfor y in range(S[1]+1):\r\n\tK_0.update({y})\r\nif K_0==K:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n, m = map(int, input().split())\nz =[]\nwhile n > 0:\n z += [map(int, input().split())][1:]\n z_0 = set(z); z = list(z_0)\n n -= 1\nif len(z) >= m:\n print('YES')\nelse:\n print('NO')", "n, m = map(int, input().split())\r\ns1 = set()\r\nfor i in range(1,m+1):\r\n s1.add(i)\r\ns = set()\r\nfor i in range(n):\r\n lia = (list(map(int, input().split())))[1:]\r\n s.update(lia)\r\nif s == s1:\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn,m=map(int,input().split())\nk=set(range(1,m+1))\nfor _ in range(n):\n a,b=map(int,input().split())\n for i in b:\n if i in k:\n k-={i}\nif len(k)==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "n,m = map(int, input() .split())\r\nx=[]\r\ns = set()\r\nfor i in range(n):\r\n x += [list(map(int, input() .split()))]\r\n x[i][0] = 'i'\r\nfor i in range(n):\r\n for j in range(1,len(x[i])):\r\n s.add(x[i][j])\r\nif len(s) == m:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n,m=map(int,input().split())\r\nstate=[0]m\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n state[l[j]-1]=1\r\nif 0 in state:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "buttons, bulbs = map(int, input().split())\r\nlis = []\r\ntarget = list(range(1,bulbs+1))\r\nfor i in range(buttons):\r\n m = [int(x) for x in input().split()]\r\n del m[0]\r\n lis = set(lis).union(set(m))\r\nlist(lis).sort\r\nif list(lis) == target:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\ndic = {}\nfor i in range(n):\n lst = list(map(int, input().split()))\n for j in range(1, len(lst)):\n if lst[j] not in dic:\n dic[lst[j]] = 1\n else:\n dic[lst[j]] += 1\nif len(dic) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t\t\t \t \t\t \t", "n, m = map(int, input().split())\r\nbulbs=set()\r\nfor x in range(n):\r\n bulbs.update(input().split()[1:])\r\nprint(['NO','YES'][len(bulbs)==m])", "n,m = list(map(int, input().split()))\r\ntemp = [i for i in range(1, m+1)]\r\nlst = set()\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n ans = x[1:]\r\n for i in ans:\r\n lst.add(i)\r\nfor i in temp:\r\n if i not in lst:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "import sys\r\n\r\nn, m = (int(el) for el in input().split())\r\nans = [False for el in range(m)]\r\nfor i in range(n):\r\n a = [int(el) for el in input().split()]\r\n for j in range(1, a[0] + 1):\r\n ans[a[j] - 1] = True\r\n \r\nfor i in range(m):\r\n if ans[i] == False:\r\n print(\"NO\")\r\n sys.exit()\r\n \r\nprint(\"YES\")", "a, b = map(int, input().split())\r\nc = set()\r\nfor i in range(a):\r\n c.update(input().split()[1:])\r\nprint(['NO','YES'][len(c)==b])", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Nov 3 13:59:01 2020\r\n\r\n@author: hanks\r\n\"\"\"\r\n\r\nn,m=[int(x) for x in input().split()]\r\nl=[1]m\r\nfor x in range(n):\r\n lx=[int(x) for x in input().split()]\r\n for i in range(lx[0]):l[lx[i+1]-1]=0\r\nprint(['YES','NO'][sum(l)!=0])", "n, m = map(int,input().split())\r\nnotonbulbs = [i for i in range(1,m+1)]\r\nfor i in range(n):\r\n temp = input().split()\r\n for j in range(1,len(temp)):\r\n if int(temp[j]) in notonbulbs:\r\n notonbulbs.remove(int(temp[j]))\r\nprint('YES' if len(notonbulbs) == 0 else 'NO')", "n,m=map(int,input().split())\r\ntotal=[]\r\nfor i in range(n):\r\n total+=input().split()[-1:0:-1]\r\n #i.e. total.extend(input().split()[-1:0:-1])\r\nprint([\"NO\",\"YES\"][len(set(total))==m])\r\n", "n,m=map(int,input().split())\r\nmat=[]\r\nfor _ in range(n):\r\n mat.append(list(map(int,input().split()))[1:])\r\ns=set()\r\nfor l in mat:\r\n for e in l:\r\n s.add(e)\r\nif len(s)==m:print(\"YES\")\r\nelse:print(\"NO\")", "n,m=[int(x) for x in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n s.update(input().split()[1:])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nonlights=set()\r\nfor x in range(n):\r\n lights=[int(y) for y in input().split()][1:]\r\n for y in lights:\r\n onlights=onlights\|{y}\r\nprint([\"NO\",\"YES\"][len(onlights)==m])", "n,m=map(int,input().split())\r\na = set()\r\nfor _ in range(n):\r\n a.update(input().split()[1:])\r\nprint(['NO','YES'][len(a)==m])", "n, m = map(int, input().split())\r\n\r\nx = []\r\n\r\noutput = []\r\n\r\nfor i in range(n):\r\n x.append([int(k) for k in input().split()])\r\n\r\nfor i in x:\r\n i.remove(i[0])\r\n for j in i:\r\n if j not in output:\r\n output.append(j)\r\n\r\nif len(output) >= m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\nall_light = list(range(1,m+1))\r\nfor butter in range(n):\r\n light = list(map(int,input().split()))\r\n light.pop(0)\r\n for i in light:\r\n if i in all_light:\r\n all_light.remove(i)\r\nif len(all_light)== 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=(m(m+1))//2\r\nli=[]\r\nfor i in range(n):\r\n li += list(map(int, input().split()))[1:]\r\nprint('YES' if len(set(li)) == m else 'NO')", "n,m=[int(x) for x in input().split()]\r\narr=[0]m\r\nstr=[]\r\nfor _ in range(n):\r\n str=[int(x) for x in input().split()]\r\n for i in range(1,len(str)):\r\n arr[str[i]-1]=1\r\nf=1\r\n\r\nfor i in range(m):\r\n if arr[i]==0:\r\n f=0\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m, n=map(int, input().split()) \r\ns=set() \r\nfor _ in range(m): \r\n a=list(map(int, input().split())) \r\n for i in range(1,len(a)): \r\n s.add(a[i]) \r\nprint(\"YNEOS\"[len(s)!=n:: 2]) ", "x,y=map(int,input().split())\r\na=set()\r\nfor i in range(0,x,1) :\r\n s=list(map(int,input().split()))\r\n for j in range(1,len(s),1) :\r\n a.add(s[j])\r\nif set(range(1,y+1,1))==a :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n b = [int(x) for x in input().split()]\r\n del b[0]\r\n a = set(a).union(set(b))\r\nif set(a) == set(range(1, m + 1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\nn,m=input().split()\nn=int(n);m=int(m)\nb=[0]101\nfor i in range(n):\n a=list(map(int,input().split()))\n for j in range(1,a[0]+1):\n b[a[j]]=1\nfor i in range(1,m+1):\n if(not b[i]):\n print(\"NO\")\n sys.exit(0)\nprint(\"YES\")", "n, m = map(int, input().split())\r\ns, a = [], 0\r\nfor i in range(n):\r\n lst = input().split()\r\n for k in range(1, len(lst)):\r\n s.append(lst[k])\r\nfor j in range(1, m + 1):\r\n if str(j) not in s:\r\n a = 1\r\n break\r\nif a == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n\tl=list(map(int,input().split()))\r\n\tl=l[1:]\r\n\ts.update(set(l))\r\nif len(s)==m:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "temp = [int(x) for x in input().split()]\nx = set()\nfor _ in range(temp[0]):\n temp2 = [int(x) for x in input().split()]\n for i in temp2[1:]:\n x.add(i)\nif len(x) == temp[1]:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = []\r\nb = 0\r\nx = input().split()\r\nx = [int(x[i]) for i in range(len(x))]\r\nn,m = x\r\nfor i in range(n):\r\n y = input().split()\r\n y = [int(y[i]) for i in range(len(y))]\r\n y.remove(y[0])\r\n for i in y:\r\n a.append(i)\r\nfor i in range(1,m+1):\r\n if i in a:\r\n b += 1\r\nif b < m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n l = list(map(int,input().split()))[1:]\r\n for val in l:\r\n s.add(val)\r\nif len(s)!=m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(a):\r\n\tk=list(map(int,input().split()))\r\n\tfor i in k[1::]:\r\n\t\tl.append(i)\r\nprint(['NO','YES'][len(set(l))==b])\t\r\n", "n, m = map(int, input().split())\r\nbulbs = set()\r\nfor _ in range(n):\r\n row = list(map(int, input().split()))\r\n row.pop(0)\r\n for element in row:\r\n bulbs.add(element)\r\nprint('YES' if bulbs == set(range(1, m + 1)) else 'NO')\r\n", "n,m=map(int,input().split())\r\ns=[]\r\nnum=0\r\nfor i in range(n):\r\n new=list(str(input()).split())\r\n new=[int(i) for i in new]\r\n num+=int(new[0])\r\n newtoadd=new[1:]\r\n s+=newtoadd\r\nresult=\"NO\"\r\nfor i in range(m):\r\n if i+1 not in s:\r\n result=\"NO\"\r\n break\r\n else:\r\n result=\"YES\"\r\nprint(result)", "n,m = [int(x) for x in input().split()]\r\na = []\r\nflag = 0\r\nfor _ in range(n):\r\n b = [int(x) for x in input().split()]\r\n for i in range(1,b[0]+1):\r\n a.append(b[i])\r\nif len(set(a))<m:\r\n print('NO')\r\nelse:\r\n print('YES')", "switch, bulbs=map(int, input().split()) \r\non=[]\r\n\r\nfor _ in range(switch):\r\n\tl=list(map(int, input().split()[1:]))\r\n\ton+=l\r\non=list(set(on))\r\n\r\n\r\nif len(on)!=bulbs:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\t", "n,m=map(int,input().split())\r\ns=[]\r\nfor _ in range(n):\r\n s.extend(list(map(int,input().split()))[1:])\r\nif len(set(s))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nlines=[]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()][1:]\r\n lines+=s\r\nif len(set(lines))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr = [int(x) for x in input().split()]\n\nbuttons = arr[0]\nbulbs = arr[1]\n\nbulb_set = set()\nfor i in range(buttons):\n list1 = [int(x) for x in input().split()]\n if len(list1)>1:\n for j in list1[1:]:\n if j != 0:\n bulb_set.add(j)\n \nif len(bulb_set) == bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t\t \t\t\t\t\t \t\t\t\t\t\t\t", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl2=list(map(int,input().split()))[1:]\r\n\tl.extend(l2)\r\n# print(l)\r\nl=list(set(l))\r\n# print(l)\r\nif m==len(l):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sat Oct 15 16:33:32 2022\n\n@author: calvinzhu\n\"\"\"\n\nn,m = [int(x) for x in input().split()]\nlight = []\n\nfor i in range(m):\n light.append(0)\n \n\nfor i in range(n):\n button = [int(x) for x in input().split(\" \")]\n for y in range(1,len(button)):\n light[button[y]-1] = 1\n\nif 0 in light:\n print(\"NO\")\nelse:\n print(\"YES\")", "buttons_num, bulbs_num = [int(i) for i in input().split(\" \")]\r\nbuttons_checked = set()\r\nbulb_set = set()\r\nfor i in range(buttons_num):\r\n statement = [int(i) for i in input().split(\" \")]\r\n if statement[0] not in buttons_checked:\r\n for j in range(1, len(statement)):\r\n bulb_set.add(statement[j])\r\nprint(\"YES\" if len(bulb_set) == bulbs_num else \"NO \")\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\ns = set()\r\n\r\nfor _ in range(n):\r\n a = [int(x) for x in input().split()]\r\n for x in a[1: ]:\r\n s.add(x)\r\n\r\nprint(\"YES\" if len(s) == m else \"NO\")\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 15:47:40 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nbulbs = [0]m\r\nfor i in range(0,n):\r\n on = [int(j) for j in input().split()]\r\n for k in range(0,on[0]):\r\n bulbs[on[k+1]-1] = 1\r\nif bulbs.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n , m = map(int,input().split())\r\nb = set()\r\nfor i in range (n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b.add(j)\r\nif m == len(b):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\ns = set()\r\nfor i in range(n):\r\n w = [int(x) for x in input().split()][1:]\r\n for j in w:\r\n s.add(j)\r\nif len(s) < m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = [int(x) for x in input().split()]\r\na = [0]m\r\nu = 0\r\nfor i in range(0,n):\r\n k = [int(x) for x in input().split()]\r\n for l in range(1,k[0]+1):\r\n a[k[l]-1] += 1\r\nfor j in range(0,m):\r\n if a[j] > 0:\r\n u += 1\r\nif u == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\ns = [0] m\r\n\r\n# 将出现的数字设置为1\r\ni = 0\r\nwhile i < n:\r\n x = input()\r\n a = [int(i) for i in x.split()]\r\n j = 1\r\n while j <= a[0]:\r\n s[int(a[j]) - 1] = '1'\r\n j += 1\r\n i += 1\r\n\r\n# 判断所有灯是否都为1\r\ni = 0\r\nwhile i < m:\r\n if(s[i] != '1'):\r\n print('no')\r\n break\r\n if(i == m - 1):\r\n print('yes')\r\n i += 1\r\n", "buttons, bulbs = map(int, input() .split())\r\nstorage=[]\r\ns = set()\r\nfor i in range(buttons):\r\n storage += [list(map(int, input() .split()))]\r\n storage[i][0] = 'i'\r\nfor i in range(buttons):\r\n for j in range(1,len(storage[i])):\r\n s.add(storage[i][j])\r\nif len(s) == bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "button,bulb=map(int,input().split())\r\no=set()\r\nfor i in range(button):\r\n o.update(input().split()[1:])\r\nprint(['NO','YES'][len(o) == bulb])", "n,k=map(int,input().split())\r\nl2=[0]k\r\nfor i in range (n):\r\n l1=list(map(int,input().split()))\r\n a=l1.pop(0)\r\n for i in range (a):\r\n l2[l1[i]-1]+=1\r\nif(l2.count(0)>0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "but,line=map(int,input().split())\r\nbulb=[0]\r\nbulb=bulb(line)\r\n\r\nfor k in range(but):\r\n li=list(map(int,input().split()))\r\n for i in li[1:]:\r\n bulb[i-1]=1\r\nprint('NO' if 0 in bulb else 'YES')", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n r=list(map(int,input().split()))\r\n for j in range(r[0]):\r\n s.add(r[j+1])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nl=[list(map(int,input().split())) for i in range(n)]\r\nl2=[]\r\nfor i in range(n):\r\n l2+=l[i][1:]\r\n\r\nif len(set(l2))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pieces = input().split()\r\nn, m = int(pieces[0]), int(pieces[1])\r\nlight = [False for i in range(m)]\r\n\r\nfor i in range(n):\r\n pieces = input().split()\r\n x = int(pieces[0])\r\n y = [int(pieces[j]) - 1 for j in range(1, x + 1)]\r\n for y1 in y:\r\n light[y1] = True\r\n\r\nif False not in light:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "button,bulb=map(int,input().split())\r\non=set()\r\nfor i in range(button):\r\n on.update(input().split()[1:])\r\nprint(['NO','YES'][len(on) == bulb])", "n,m=map(int,input().split())\r\nw=set()\r\nlast=set(i for i in range(1,m+1))\r\nfor b in range(n):\r\n a=[int(i) for i in input().split()]\r\n for c in a[1:]:\r\n w.add(c)\r\nif w==last:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 5 09:05:28 2020\r\n\r\n@author: 章斯岚\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n k=input().split()\r\n for x in k[1::]:\r\n a.add(int(x))\r\nb=set(range(1,m+1))\r\nif a==b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def solve():\r\n n,m = map(int, input().split())\r\n for i in range(n):\r\n s = list(map(int, input().split()))\r\n for j in s[1:]:\r\n a[j-1] = 1\r\n for i in range(m):\r\n if a[i] == 0:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n return\r\ntry:\r\n a = []\r\n for p in range(101):\r\n a.append(0)\r\n solve()\r\nexcept:\r\n pass", "n, m = [int(x) for x in input().split()]\r\nl = [0] * m\r\nfor i in range(n):\r\n li = [int(x) for x in input().split()]\r\n k = li[0]\r\n for j in range(k):\r\n l[li[j+1]-1] = 1\r\nif l.count(0) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\ndp=[0]m\r\ns=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n d=l[0]\r\n for j in range(1,d+1):\r\n if dp[l[j]-1]==0:\r\n dp[l[j]-1]+=1\r\ns=sum(dp)\r\nif s==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nb=[0 for i in range(0, m+1)]\r\nfor i in range(0,n):\r\n \r\n a=[int(n) for n in input().split()]\r\n for x in a[1:]:\r\n b[x]=1\r\ns=0\r\nfor i in range(1,m+1):\r\n s+=b[i]\r\nif s==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\nres = []\nfor i in range(m + 1):\n res.append(0)\nfor i in range(1, n + 1):\n l = list(map(int, input().split()))\n for j in range(1, len(l)):\n res[l[j]] = 1\nflag = 1\nfor i in range(1, m + 1):\n if res[i] == 0:\n flag = 0\n break\nprint(\"YES\" if flag else \"NO\")", "n,m = map (int,input().split())\r\na = set()\r\nbulbx = []\r\nc = 0\r\nfor i in range(n):\r\n bulb = [int(x) for x in input().split()]\r\n bulbx = bulbx + bulb[1:]\r\n\r\nfor i in range(1,m+1):\r\n if i in bulbx:\r\n c = c+i\r\n\r\nif c == m(m+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m,n=[int(x) for x in input().split()]\r\nset0 = set()\r\nset1 = set(str(i+1) for i in range(n))\r\nfor i in range(m):\r\n set0 = set0\|set(input().split()[1:])\r\nprint(['YES','NO'][set0 != set1])", "n,m = map(int, input().split())\r\nlist1= []\r\nfor i in range(n):\r\n b = map(int, input().split())\r\n a = next(b)\r\n for j in range(a):\r\n list1.append(next(b))\r\na = set(list1)\r\nx = 0\r\nfor i in range(1,m+1):\r\n if i not in a:\r\n x = 1\r\n break\r\nprint(['YES','NO'][x])\r\n", "a,b=map(int, input().split())\r\nN=[1]b\r\nfor i in range(a):\r\n c=list(map(int, input().split()))\r\n d=1\r\n for j in range(c[0]):\r\n N[c[d]-1]=0\r\n d+=1\r\nif sum(N)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,m = map(int,input().split())\r\nlist1 = []\r\nfor i in range(0,n):\r\n list2 = list(map(int,input().split()))\r\n num = list2[0]\r\n if num != 0:\r\n for q in range(1,num+1):\r\n list1.append(list2[q])\r\nfor t in range(0,m):\r\n if t+1 not in list1:\r\n print(\"NO\")\r\n break\r\nelse:print(\"YES\")", "n,m = map (int,input().split())\r\na = set()\r\nbulbx = []\r\nb = 0\r\nfor i in range(n):\r\n bulb = [int(x) for x in input().split()]\r\n bulbx = bulbx + bulb[1:]\r\n\r\nfor i in range(1,m+1):\r\n if i in bulbx:\r\n b = b+i\r\n\r\nif b == m(m+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n , m = map(int , input().split())\r\nans = (m + 1) * [0]\r\nfor i in range(n):\r\n x = input().split()\r\n for j in range(1 , int(x[0]) + 1):\r\n ans[int(x[j])] = 1\r\nif sum(ans) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=map(int,input().split())\nl=[0 for i in range(m)]\nfor i in range(n):\n a=list(map(int,input().split()))\n p=1\n while a[0]: l[a[p]-1]=1;a[0]-=1;p+=1\nif sum(l)!=m:\n print('NO')\nelse:print('YES')", "def main():\r\n n, m = map(int, input().split())\r\n s = set()\r\n \r\n for _ in range(n):\r\n data = list(map(int, input().split()))\r\n for i in range(1, len(data)):\r\n s.add(data[i])\r\n \r\n print(\"Yes\" if len(s) == m else \"No\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "p,k=map(int,input().split())\r\nh=list(range(1,k+1))\r\nnumbers=[]\r\nwhile p:\r\n nums=list(map(int,input().split()))\r\n numbers.extend(nums[1:])\r\n p-=1\r\nflag = True\r\ni = 0\r\nfor i in h:\r\n if i not in numbers:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Fri Oct 22 16:54:39 2021\r\n\r\n@author: 金曈\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nzero = 1\r\nlistb = []\r\na = ''\r\nwhile zero <= n:\r\n zero += 1\r\n lista = input().split()\r\n listb += lista[1:]\r\nfor i in range(1,m+1):\r\n if str(i) not in listb:\r\n a = 'NO'\r\n print('NO')\r\n break\r\nif a != 'NO':\r\n print('YES')\r\n ", "n,m = map(int,input().split())\n\ns = set()\nfor i in range(n):\n l = list(map(int,input().split()))\n for i in l[1:]:\n s.add(i)\n\nif len(s) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t \t \t \t \t \t\t", "n,m = map(int,input().split())\r\nnum = set({})\r\nfor i in range(n):\r\n\tlist = input().split()\r\n\tfor i in range(1,len(list)):\r\n\t\tnum.add(list[i])\r\nprint('YES' if len(num) == m else 'NO')\r\n\r\n\t", "n, m = map(int, input().split())\r\nlamp_available = set()\r\nfor i in range(n):\r\n situation = list(map(int, input().split()))\r\n for j in range(situation[0]):\r\n lamp_available.add(situation[j + 1])\r\nif len(lamp_available) == m:\r\n print('YES')\r\nelif len(lamp_available) != m:\r\n print('NO')", "s, m = map(int, input().split())\r\nq = set()\r\nr = list()\r\nfor i in range(s):\r\n r = input().split()\r\n for k in r[1:]:\r\n q.add(k)\r\nprint('YES' if len(q) == m else 'NO')", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 17:05:23 2021\r\n\r\n@author: tengjian\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(0,m):\r\n bulbs.append(0)\r\nwhile n>0:\r\n n-=1\r\n L=list(map(int,input().split()))\r\n L.pop(0)\r\n for i in L:\r\n bulbs[i-1]=1\r\ns=sum(bulbs)\r\nif s==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import\r\n\r\nn,m=map(int,input().split())\r\nmain_arr=[0]m\r\nwhile n:\r\n\tn-=1\r\n\tarr=list(map(int,input().split()))\r\n\tfor i in range(1,arr[0]+1):\r\n\t\tif arr[i]!=0:\r\n\t\t\tmain_arr[arr[i]-1]=1\r\n#print(main_arr)\r\nprint(\"NO\" if 0 in main_arr else \"YES\")", "n,m=[int(i) for i in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n for i in [int(i) for i in input().split()][1:]:\r\n s.add(i)\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nans = [i for i in range(1, m+1)]\r\nfor _ in range(n):\r\n a = list(map(int, input().split()))\r\n a.pop(0)\r\n for i in a:\r\n try:\r\n ans.remove(i)\r\n except:\r\n pass\r\nif len(ans) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "button,bulb = map(int,input().split())\r\nli=[0]bulb\r\nfor i in range(button):\r\n tmp=[int(i) for i in input().split()]\r\n for i in range(1,tmp[0]+1):\r\n if li[tmp[i]-1]==0:\r\n li[tmp[i]-1]=1\r\nif sum(li)<bulb:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n,m=(input().split())\r\na=set()\r\nfor i in range (int(n)):\r\n n=input().split()\r\n N=len(n)\r\n for i in range(1,N):\r\n a.add(n[i])\r\nnum=len(a)\r\nif int(m)==num:\r\n print('YES')\r\nelse:\r\n print('NO')", "[n,m]=[int(i)for i in input().split()]\r\nset1=set()\r\nfor i in range(m):\r\n set1.add(i+1)\r\nset2=set()\r\nfor i in range(n):\r\n a=[int(j) for j in input().split()]\r\n for j in range(a[0]):\r\n set2.add(a[j+1])\r\nif(set1==set2):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nlights_on = []\r\n\r\nfor i in range(1, m+ 1):\r\n lights_on.append(i)\r\nfor k in range(n):\r\n bulbs = input().split()\r\n for j in range(1, len(bulbs)):\r\n if int(bulbs[j]) in lights_on:\r\n lights_on.remove(int(bulbs[j]))\r\n\r\nif len(lights_on) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 13:47:19 2021\r\n\r\n@author: 86188\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nlis = []\r\nfor i in range(m):\r\n lis.append(0)\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\n for j in range(1,len(a)):\r\n lis[a[j]-1] = 1 \r\nif (0 in lis):\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\ny=[]\r\nfor i in range(n):\r\n x_i=input().split()\r\n xi=int(x_i[0])\r\n y+=x_i[1:]\r\nif len(set(y))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "[n,m] = map(int,input().split())\n\nx = [0]n\nlights = [0]m\n\nfor i in range(n):\n A = [int(x) for x in input().split()]\n x=A[0]\n j=1\n while j<x+1:\n lights[A[j]-1]=1\n j=j+1\n\npossible=1\nfor k in range(m):\n if lights[k]==0:\n possible=0\n \nprint(\"YES\" if possible else \"NO\")\n\t\t \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t \t", "n, m = map(int, input().split())\n\n# create a set of all the bulbs\nbulbs = set(range(1, m+1))\n\n# iterate over the buttons and their corresponding bulbs\nfor i in range(n):\n button_bulbs = set(map(int, input().split()[1:]))\n # remove the bulbs that are turned on by this button from the set of all bulbs\n bulbs -= button_bulbs\n\n# if there are no bulbs left in the set, Vasya can light up all the bulbs\nif not bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t \t\t\t \t \t \t \t \t \t", "n, m = [int(x) for x in input().split()]\r\ns = []\r\nfor i in range(n):\r\n lt = list(map(int, input().split()))\r\n for j in lt[1:]:\r\n s.append(j)\r\nst = set(s)\r\nif st == set(range(1,m+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\ns = set()\r\nfor i in range(n):\r\n s = s.union(set(input().split()[1:]))\r\nprint('YES' if len(s) == m else 'NO')\r\n", "n, m = map(int, input().split())\r\ns = []\r\nx = 1\r\nfor i in range(n):\r\n lights = input().split()\r\n del lights[0]\r\n s[-1:-1] = lights\r\nfor i in range(1,m+1):\r\n x = s.count(str(i))\r\nif x == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n , m = map(int,input().split())\r\nb1 = []\r\nfor i in range (n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b1.append(j)\r\nb2 = list(set(b1))\r\nif m == len(b2):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nres = [0] * m\r\n\r\nfor _ in range(n):\r\n lst = list(map(int, input().split()))\r\n\r\n for i in lst[1:]:\r\n if res[i - 1] == 0:\r\n res[i - 1] = 1\r\n \r\n \r\nflag = \"YES\"\r\nfor i in res:\r\n if i == 0:\r\n flag = \"NO\"\r\n break\r\n\r\nprint(flag)", "n,m=map(int,input().split());bulbs=[]\nfor i in range (n):\n bulb=[int(x) for x in input().split()]\n for k in range (0,bulb[0]):\n bulbs.append(bulb[k+1])\nfor j in range (0,m):\n if j+1 not in bulbs:\n print(\"NO\")\n break\nelse:print(\"YES\")\n", "n, m = map(int, input().split())\r\nli = []\r\nfor _ in range(n):\r\n li.extend(list(map(int, input().split()))[1:])\r\n\r\nif len(set(li)) != m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def HARD_WAY():\r\n n,m=map(int,input().split())\r\n l=[] \r\n while n:\r\n c=map(int,input().split())\r\n c=list(c)\r\n for x in c[1:]:\r\n if x not in l:\r\n l.append(x)\r\n n-=1 \r\n l=set(l)\r\n i=1\r\n while i<=m:\r\n if i not in l:\r\n return \"NO\"\r\n i+=1\r\n return \"YES\"\r\nprint(HARD_WAY())", "n,m=map(int,input().split())\r\nbub=[0]m\r\nfor i in range(n):\r\n turn_on=list(map(int,input().split()))\r\n turn_number=turn_on[0]\r\n for j in turn_on[1::]:\r\n bub[j-1]=1\r\nprint('YES' if bub==[1]m else 'NO')", "n, m = (int(i) for i in input().split())\ns = set(range(1, m + 1))\nfor _ in range(n):\n x, y = (int(i) for i in input().split())\n for i in y:\n s.discard(i)\nres = \"NO\" if s else \"YES\"\nprint(res)\n", "a,b=map(int, input().split())\r\nset = set()\r\nfor i in range(a):\r\n set.update(input().split()[1:])\r\nprint(['No', 'Yes'][len(set)==b])", "total_number = input().split()\r\nb = set()\r\nc = set()\r\nfor i in range(1,int(total_number[1])+1):\r\n b.add(i)\r\nfor a in range(int(total_number[0])):\r\n again = input().split()\r\n for d in range(1,int(again[0])+1):\r\n c.add(int(again[d]))\r\nif b == c :\r\n print('Yes')\r\nelse:\r\n print('No')", "n,m=(int(x) for x in input().split())\r\nv=[]\r\nf=[]\r\nfor k in range(1,m+1):\r\n v.append(k)\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n x.pop(0)\r\n f.append(x)\r\n h=sum(f,[])\r\nl=sorted(list(set(h)))\r\nif l==v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\ntotal=[]\r\nfor i in range(n):\r\n data=input().split()\r\n for j in range(1,int(data[0])+1):\r\n if not data[j] in total:\r\n total.append(data[j])\r\nprint([\"NO\",\"YES\"][len(total)==m])", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n lamps = [False] m\r\n for _ in range(n):\r\n for i in input().split()[1:]:\r\n lamps[int(i) - 1] = True\r\n print('YES' if sum(lamps) == m else 'NO')\r\n", "n, m = input().split(' ')\r\nbulbs = []\r\nbulbs = set(bulbs)\r\nfor i in range(int(n)):\r\n c = input()\r\n c = c.split(' ')\r\n del c[0]\r\n c = set(c)\r\n bulbs = bulbs.union(c)\r\nbulbs = list(bulbs)\r\nif len(bulbs) == int(m):\r\n print('YES')\r\nelif len(bulbs) < int(m):\r\n print('NO')", "n,m=map(int,input().split())\r\nss=[]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()]\r\n for j in range(1,len(s)):\r\n if s[j] not in ss:\r\n ss.append(s[j])\r\nif len(ss)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nl = [0] * m\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n for h in y:\r\n l[h - 1] = 1\r\nif 0 in l:\r\n print('NO')\r\nelse:\r\n print('YES') ", "n, m = input().split()\r\nb1 = []\r\nfor i in range(int(n)):\r\n b = input().split()\r\n for x in b:\r\n a = b[0]\r\n b.remove(a)\r\n b1.extend(b)\r\n\r\nbulb = 0\r\nfor i1 in range(int(m)):\r\n a = i1+1\r\n if b1.count(str(a)) >= 1:\r\n bulb += 1\r\n \r\nif bulb == int(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=[int(x) for x in input().split()]\r\nt=set()#定义空集合\r\nfor i in range (n):\r\n s=input().split()\r\n t.update(s[1:])#update函数：将集合s中的新元素添加到集合t中\r\nif len(t)==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "set0=set()\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n set0=set0\|set(list(map(int,input().split()))[1:])\r\nprint([\"NO\",\"YES\"][len(set0)==m])", "n, m = map(int, input().split())\r\nbulbs = [0] m\r\nfor _ in range(n):\r\n for y in list(map(int, input().split()))[1:]:\r\n bulbs[y-1] = 1\r\nprint(\"YES\" if bulbs.count(0) == 0 else \"NO\")", "n,m=list(map(int, input().split()))\r\nturnedon=set()\r\nfor i in range(n):\r\n button=list(map(int, input().split()))\r\n for j in range(1, button[0]+1):\r\n turnedon.add(button[j])\r\nif len(turnedon)!=m:\r\n print('NO')\r\nelse:\r\n print('YES')", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 17:12:29 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nb = [0]m\r\nfor i in range(n):\r\n lit = [int(x) for x in input().split()]\r\n for j in range(lit[0]):\r\n b[lit[j+1]-1] = 1\r\nif b.count(1) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nl=n.split()\r\nnmbt=int(l[0])\r\nnmbl=int(l[1])\r\nbll=[]\r\nfor y in range(1,nmbl+1):\r\n bll.append(str(y))\r\nchl=[]\r\nfor ui in range(0,nmbt):\r\n o=input()\r\n l=o.split()\r\n for kl in range(1,len(l)):\r\n if l[kl] in bll:\r\n chl.append(l[kl])\r\nst=0\r\nfor h in range(0,len(bll)):\r\n if bll[h] not in chl:\r\n st=1\r\n break\r\nif st==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split());a=[]\r\nfor _ in \" \"n:a+=map(int,input().split()[1:])\r\nprint(\"YNEOS\"[len(set(a))!=m::2]) ", "n,m=[int(x) for x in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n a=input().split()\r\n for j in range(1,len(a)):\r\n s.append(a[j])\r\nfor k in range(1,m+1):\r\n if str(k) not in set(s):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "(n,l) = list(map(int,input().split()))\r\nli = set()\r\nfor i in range(n):\r\n b = list(map(int,input().split()))\r\n for j in range(b[0]):\r\n li.add(b[j+1])\r\n\r\nif len(li)==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n ,m=map(int, input().split())\r\non=[]\r\nfor button in range(n):\r\n on=[on, list(map(int, input().split()))[1:]]\r\nprint(\"YES\" if len(set(on))==m else \"NO\")", "m,n=map(int,input().split())\nk=[]\nfor i in range(m):\n l=list(map(int,input().split()))\n k.extend(l[1:])\n\nif(len(set(k))==n):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, m = input().split()\nn = int(n)\nm = int(m)\nst = set()\nfor i in range (n):\n lst = list(map(int , input().split()))\n for j in range (1,len(lst)):\n st.add(lst[j])\nif len(st) == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t\t \t\t \t \t\t\t \t\t \t\t \t\t \t\t\t", "n, m = input().split()\nn = int(n)\nm = int(m)\nnums = []\nfor i in range(n):\n lst = list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in nums:\n nums.append(lst[j])\nif len(nums)==m:\n print('YES')\nelse:\n print('NO')\n \t\t \t \t\t \t\t\t\t \t\t\t\t \t \t\t \t", "n,m=map(int,input().split())\r\na=set()\r\nfor i in range(1,n+1):\r\n s=input().split()\r\n s[0]=int(s[0])\r\n for j in range(1,s[0]+1):\r\n a.add(s[j])\r\nif m==len(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nbulb = [0]m\r\nfor i in range(n):\r\n y = [int(x) for x in input().split()]\r\n for j in y[1:]:\r\n bulb[j-1] = 1\r\nif bulb.count(1) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\n\r\nlambs=[0]k\r\n\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n y=x[1:]\r\n for j in y:\r\n lambs[j-1] +=1\r\nfor i in lambs:\r\n if i==0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\") ", "n , m = map(int, input().split())\nd = {}\nfor i in range(n):\n l = [int(j) for j in input().split()]\n for j in range(1, len(l)):\n d[l[j]] = d.get(l[j], 0)+1\nif len(d) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t\t\t\t \t\t \t \t\t \t\t", "n,m=[int(x) for x in input().split()]\r\ny=[]\r\nfor i in range(n):\r\n y.extend(input().split()[1:])\r\nbulb=0\r\nfor c in range(m):\r\n open=c+1\r\n if y.count(str(open))>=1:\r\n bulb+=1\r\nif bulb==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nall_light = list(range(1,m+1))\r\nlight_can = []\r\nfor butter in range(n):\r\n light = list(map(int,input().split()))\r\n light.pop(0)\r\n for i in light:\r\n if i not in light_can:\r\n light_can.append(i)\r\nfor x in all_light:\r\n if x not in light_can:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "a,b = map(int,input().split())\r\nc=[]\r\nd=[]\r\nfor i in range(a):\r\n a = list(map(int,input().split()))\r\n a.pop(0)\r\n c+=a\r\nif len(set(c))>=b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nu = [0] * (m + 1)\r\nfor _ in range(n):\r\n x = list(map(int, input().split()))[1:]\r\n for i in x:\r\n u[i] = 1\r\nans = \"YES\" if sum(u) == m else \"NO\"\r\nprint(ans)", "#%% 615a Vasya and bulbs \r\n\r\ni = lambda : map(int,input().split())\r\nn,m = i(); on = set()\r\nfor _ in range(n):\r\n on.update(list(i())[1:])\r\nprint('YES' if len(on) == m else 'NO')\r\n", "n, m = map(int, input().split())\r\ns_s = set()\r\n\r\nfor _ in range(n):\r\n s_s.update(list(map(int, input().split()))[1:])\r\n \r\nif len(s_s) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 11 13:46:09 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn,m=map(int, input().split())\r\ns=[]\r\nfor i in range(n):\r\n t=list(map(int, input().split()))\r\n s=s+t[1::]\r\ns=set(s)\r\nprint('YES'if len(s)==m else 'NO')\r\n ", "n,m=map(int,input().split())\ns=set()\nfor i in range(n):\n lst=list(input().split())\n # print(lst)\n lst.remove(lst[0])\n # print(lst)\n s.update(lst)\n\nif (len(s) == m):\n print('YES')\nelse:\n print('NO')\n\t \t\t\t\t\t\t\t \t \t \t \t \t\t \t\t\t \t", "# Bulbs \n# ------------------------------------------------\n\ndef main():\n n, m = [int(num) for num in input().split()]\n allBulbs = set()\n for _ in range(n):\n bulbs = [int(num) for num in input().split()]\n bulbs = bulbs[1:]\n allBulbs = allBulbs.union(bulbs)\n if len(allBulbs) == m:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n\t \t\t \t \t \t \t\t \t \t \t", "n,m=[int(i) for i in input().split()]\r\nj=1\r\nsett=set()\r\nfor w in range(n):\r\n lst=[int(s) for s in input().split()]\r\n sett.update(lst[1:])\r\nif len(sett)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nb=[0]m\r\nc=0\r\nfor i in range(n):\r\n hi=str(input()).split(\" \")\r\n hp=[int(x) for x in hi]\r\n for j in range(hp[0]):\r\n b[hp[j+1]-1]=1\r\nfor i in range(m):\r\n c+=b[i]\r\nif c==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Oct 19 15:36:42 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nbulbs = [False]m\r\nfor _ in range(n):\r\n s = input().split()\r\n x = int(s.pop(0))\r\n for i in s:\r\n bulbs[int(i)-1] = True\r\nif False in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "from sys import stdin\r\n\r\nn, m = list(map(int, stdin.readline().split()))\r\na = [False]m\r\nfor _ in range(n):\r\n b = list(map(int, stdin.readline().split()))\r\n for i in range(1, len(b)):\r\n a[b[i]-1] = True\r\n\r\nprint('YES' if all(a) else 'NO')\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Nov 3 13:22:48 2020\r\n\r\n@author: Cui Shiao\r\n\"\"\"\r\n\r\na,b=[int(x) for x in input().split()]\r\ns=set()\r\nfor y in range(a):\r\n k=input().split()\r\n k.pop(0)\r\n s.update(k)\r\n k=[]\r\nif len(s)==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input(). split())\r\nlist1 = []\r\nfor a in range(n):\r\n list2 = list(input(). split())\r\n list1.extend(list2[1:])\r\nx = 1\r\nans = 0\r\nwhile x <= m:\r\n if str(x) in list1:\r\n ans += 1\r\n x += 1\r\nif ans == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n A = []\r\n for t in wtf[1:]:\r\n A.extend(list(map(int, t.split()))[1:])\r\n print('YES' if len(set(A)) == m else 'NO')", "n,m=map(int,input().split())\r\nx=y=set()\r\nx={str(j) for j in range(1,m+1)}\r\nfor i in range(n):\r\n a=input().split()\r\n del a[0]\r\n y\|=set(a)\r\nif y==x:\r\n print('YES')\r\nelse:print('NO')", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(args):\n N = lambda: int(input())\n buttons, bulbs = map(int, input().split())\n bulbcol = [i for i in range(1, bulbs+1)]\n for _ in range(buttons):\n p = [int(e) for e in input().split()]\n for e in p[1::]:\n if e in bulbcol:\n bulbcol = [x for x in bulbcol if x != e]\n\n if not bulbcol:\n print('yes')\n else:\n print('no')\n\nif __name__ == '__main__':\n\tfunction()\t\n" ]	{"inputs": ["3 4\n2 1 4\n3 1 3 1\n1 2", "3 3\n1 1\n1 2\n1 1", "3 4\n1 1\n1 2\n1 3", "1 5\n5 1 2 3 4 5", "1 5\n5 4 4 1 2 3", "1 5\n5 1 1 1 1 5", "2 5\n4 3 1 4 2\n4 2 3 4 5", "5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 4\n0\n4 4 3 2 1", "100 100\n0\n0\n0\n1 53\n0\n0\n1 34\n1 54\n0\n1 14\n0\n1 33\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 82\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 34\n0\n0\n1 26\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 34\n0\n0\n0\n0\n0\n1 3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 40\n0\n0\n0\n1 26\n0\n0\n0\n0\n0\n1 97\n0\n1 5\n0\n0\n0\n0\n0", "100 100\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\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", "5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 4\n3 1 5 6", "5 2\n1 1\n1 1\n1 1\n1 1\n1 1", "1 4\n3 1 2 3", "1 4\n3 2 3 4", "2 4\n3 2 3 4\n1 1", "2 4\n3 1 2 3\n1 4", "5 1\n0\n0\n0\n0\n0", "1 1\n0", "1 10\n10 1 2 3 4 5 6 7 8 9 10", "1 1\n1 1", "1 100\n99 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", "1 3\n3 1 2 1", "1 100\n100 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"], "outputs": ["YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	439
d3891b505ee7f8ab84e9bc52c21e7b57	none	Manao is taking part in a quiz. The quiz consists of n consecutive questions. A correct answer gives one point to the player. The game also has a counter of consecutive correct answers. When the player answers a question correctly, the number on this counter increases by 1. If the player answers a question incorrectly, the counter is reset, that is, the number on it reduces to 0. If after an answer the counter reaches the number k, then it is reset, and the player's score is doubled. Note that in this case, first 1 point is added to the player's score, and then the total score is doubled. At the beginning of the game, both the player's score and the counter of consecutive correct answers are set to zero. Manao remembers that he has answered exactly m questions correctly. But he does not remember the order in which the questions came. He's trying to figure out what his minimum score may be. Help him and compute the remainder of the corresponding number after division by 1000000009 (109<=+<=9). The single line contains three space-separated integers n, m and k (2<=≤<=k<=≤<=n<=≤<=109; 0<=≤<=m<=≤<=n). Print a single integer — the remainder from division of Manao's minimum possible score in the quiz by 1000000009 (109<=+<=9). Sample Input 5 3 2 5 4 2 Sample Output 3 6	[ "n,m,k=map(int,input().split())\n\nMOD=1000000009\n\nx=m-(n//k(k-1)+(n%k))\n\nif (x<=0):exit(print(m%MOD))\n\nprint(((m-x)+((pow(2,x+1, MOD)+2MOD)-2)k-x(k-1))%MOD)", "MOD = 1000000009\nn, m, k = map(int, input().split())\nx = m - (n // k * (k - 1) + n % k)\n\nif x <= 0:\n print(m)\nelse:\n print(((m - x) + (pow(2, x + 1, MOD) - 2) * k - x * (k - 1)) % MOD)\n# OK 100\n", "n, m, k = map(int, input().split())\r\n# k continuos chahiye\r\n# n number of questions hai\r\n# m correctly answer kiya hai\r\nmod = 10*9+9\r\ngaps = m - ((n//k)(k-1)+n%k)\r\nif gaps <= 0:\r\n exit(print(m%mod))\r\n# print(gaps)\r\nans1 = m - gaps\r\nans2 = (pow(2, gaps+1, mod)-2+2mod)k\r\nans3 = -gaps(k-1)\r\nprint((ans1+ans2+ans3)%mod)", "n, m, k = map(int, input().split())\r\n\r\nd = max(0, n // k - (n - m))\r\n\r\nM = 1000000009\r\n\r\nif d > 0:\r\n res = ((2 k * (pow(2, d, M) - 1)) % M + m - k * d) % M\r\nelse:\r\n res = m\r\n\r\nprint(res)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\n\r\ndef f(x):\r\n global a\r\n if x != 0:\r\n x1 = bisect(d1, x)-1\r\n a = d[x1]\r\n a %= M\r\n f(x-d1[x1])\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nl, h = 0, m//k+1\r\nc = -1\r\nM = 1000000009\r\nd = [1, 2]\r\nd1 = [0, 1]\r\nfor i in range(50):\r\n d.append(d[-1]2 %M)\r\n d1.append(d1[-1]2)\r\n\r\nwhile l < h:\r\n mi = (l+h)//2\r\n x = mik\r\n y = (m-x)//(k-1) - ((m-x)%(k-1) == 0)\r\n if y <= n-m:\r\n a = 1\r\n f(mi)\r\n a -= 1\r\n a = 2k\r\n a += m-x\r\n c = a % M\r\n h = mi\r\n else:\r\n l = mi+1\r\nprint(c)\r\n", "MOD =1000000009\nn,m,k=map(int,input().split())\nx=max(0,m-(n-n%k)//k(k-1)-n%k)\nres=((((pow(2,x+1,MOD))-2)%MOD)k)%MOD\nz=(m-xk)%MOD\nres=(res+z)%MOD\nprint (res)\n" ]	{"inputs": ["5 3 2", "5 4 2", "300 300 3", "300 282 7", "1000000000 1000000000 1000000000", "1000000000 800000000 2", "2 0 2", "2 1 2", "2 2 2", "3 2 2", "3 3 2", "10 7 3", "10 8 3", "10 8 5", "10 9 5", "972 100 2", "972 600 2", "972 900 2", "972 900 4", "972 900 5", "12345 11292 3", "120009 70955 2", "120009 100955 2", "291527 253014 7", "300294 299002 188", "23888888 508125 3", "23888888 16789012 2", "23888888 19928497 4", "23888888 19928497 5", "23888888 19928497 812", "23888888 23862367 812", "87413058 85571952 11", "87413058 85571952 12", "87413058 85571952 25", "512871295 482216845 2", "512871295 482216845 3", "512871295 508216845 90", "512871295 512816845 99712", "512871295 512870845 99712", "512871295 512870845 216955", "512871295 512871195 2000000", "512871295 512871295 12345678", "778562195 708921647 4", "500000000 500000000 4", "375000000 375000000 3", "250000000 250000000 2", "300000000 300000000 12561295", "300000000 300000000 212561295", "300000000 300000000 299999999", "500000002 500000002 2", "625000001 625000000 5", "875000005 875000000 7", "1000000000 1000000000 8", "901024556 900000000 6", "901024556 900000000 91", "901024556 900000000 92", "901024556 900000000 888", "901024556 901000000 1000", "901024556 901000000 1013", "999998212 910275020 25", "999998212 999998020 1072520", "999998212 999998020 381072520", "999998212 999998210 381072520", "999998212 999998211 499998210", "1000000000 1000000000 1000000000", "1000000000 1000000000 772625255", "1000000000 999999904 225255", "1000000000 999998304 22255", "1000000000 999998304 7355", "1000000000 999998304 755", "1000000000 999998304 256", "1000000000 1000000000 2", "1000000000 1 999999998"], "outputs": ["3", "6", "17717644", "234881124", "999999991", "785468433", "0", "1", "4", "2", "5", "7", "11", "8", "14", "100", "857317034", "129834751", "473803848", "682661588", "307935747", "938631761", "682499671", "572614130", "435910952", "508125", "573681250", "365378266", "541851325", "19928497", "648068609", "996453351", "903327586", "424641940", "565667832", "446175557", "332476079", "512816845", "944454424", "28619469", "559353433", "423625559", "208921643", "1000000005", "1000000006", "1000000007", "543525658", "512561295", "599999999", "1000000007", "500000002", "531250026", "1000000001", "175578776", "771418556", "177675186", "900000000", "443969514", "840398451", "910275020", "314152037", "999998020", "999998210", "499996412", "999999991", "772625246", "940027552", "969969792", "756187119", "684247947", "401008799", "750000003", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	6
d38fb1c489d4cbf930b0337c192c450b	Interactive LowerBound	This is an interactive problem. You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x. More formally, there is a singly liked list built on an array of n elements. Element with index i contains two integers: valuei is the integer value in this element, and nexti that is the index of the next element of the singly linked list (or -1, if the current element is the last). The list is sorted, i.e. if nexti<=≠<=<=-<=1, then valuenexti<=><=valuei. You are given the number of elements in the list n, the index of the first element start, and the integer x. You can make up to 2000 queries of the following two types: - ? i (1<=≤<=i<=≤<=n) — ask the values valuei and nexti, - ! ans — give the answer for the problem: the minimum integer, greater than or equal to x, or ! -1, if there are no such integers. Your program should terminate after this query. Write a program that solves this problem. The first line contains three integers n, start, x (1<=≤<=n<=≤<=50000, 1<=≤<=start<=≤<=n, 0<=≤<=x<=≤<=109) — the number of elements in the list, the index of the first element and the integer x. To print the answer for the problem, print ! ans, where ans is the minimum integer in the list greater than or equal to x, or -1, if there is no such integer. Sample Input 5 3 80 97 -1 58 5 16 2 81 1 79 4 Sample Output ? 1 ? 2 ? 3 ? 4 ? 5 ! 81	[ "from random import sample\nfrom sys import stdout\n\nread=lambda :map(int,input().split())\n\ndef ask(x):\n\tprint('? {}'.format(x))\n\tstdout.flush()\n\treturn tuple(read())\n\ndef answer(x):\n\tprint('! {}'.format(x))\n\tstdout.flush()\n\texit(0)\n\nn,st,x=read()\n\na=[ask(st)]\nif a[0][0]>=x: answer(a[0][0])\n\nfor i in sample(range(1,n+1),min(n,999)):\n\tb=ask(i)\n\tif b[0]<x: a.append(b)\n\telif b[0]==x: answer(x)\n\nb=max(a)\nwhile True:\n\tif b[0]>=x: answer(b[0])\n\tif b[1]==-1: break\n\telse: b=ask(b[1])\n\nanswer(-1)\n", "from sys import stdout\r\nfrom random import Random\r\n\r\nn, s, x = list(map(int, input().split()))\r\nans = 3 * 10 ** 9\r\n\r\nasked = [False for i in range(n + 1)]\r\ncache = [[] for i in range(n + 1)]\r\n\r\nmax_ask = 1999\r\nt = 1750\r\n\r\ndef ask(i):\r\n if asked[i]:\r\n return cache[i]\r\n asked[i] = True\r\n print('?', i)\r\n stdout.flush()\r\n res = list(map(int, input().split()))\r\n cache[i] = res\r\n return res\r\n\r\nf = ask(s)\r\ncs = f[0]\r\n\r\nr = Random()\r\nfor i in range(t):\r\n y = r.randint(1, n)\r\n if not asked[y]:\r\n q = ask(y)\r\n if q[0] >= x:\r\n ans = min(ans, q[0])\r\n elif cs < q[0] < x:\r\n s = y\r\n cs = q[0]\r\n else:\r\n i -= 1\r\n\r\nfor i in range(max_ask - t):\r\n q = ask(s)\r\n if q[0] >= x:\r\n ans = min(ans, q[0])\r\n s = q[1]\r\n if s == -1:\r\n break\r\n\r\n\r\nif ans == 3 * 10 ** 9:\r\n print('! -1')\r\nelse:\r\n print('!', ans)\r\n \r\n ", "n,start,x = map(int,input().split())\r\n\r\nfrom random import sample\r\n\r\n# random questionings\r\nN1 = 1000\r\n\r\nd = {}\r\n\r\nQ = sample(range(1,n+1), min(N1,n))\r\nif start not in Q:\r\n Q[0] = start\r\n\r\nfor q in Q:\r\n print('?',q, flush=True)\r\n v,n = map(int,input().split())\r\n d[q] = (v,n)\r\n\r\nL = sorted((v,q) for q,(v,n) in d.items())\r\n\r\nfrom bisect import bisect\r\ni = bisect(L,(x,0))-1\r\n\r\nif i < 0:\r\n r = L[0][0]\r\nelse:\r\n v,p = L[i]\r\n p = d[p][1]\r\n while v < x and p != -1:\r\n print('?',p, flush=True)\r\n v,p = map(int,input().split())\r\n\r\n if v >= x:\r\n r = v\r\n else:\r\n r = -1\r\n\r\nprint('!',r,flush=True)", "import bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations, accumulate\r\nfrom functools import reduce\r\n\r\np = print\r\nr = range\r\n\r\n\r\ndef I(): return int(input())\r\n\r\n\r\ndef II(): return list(map(int, input().split()))\r\n\r\n\r\ndef S(): return input()[:-1]\r\n\r\n\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\n\r\n\r\ndef pb(b): print('Yes' if b else 'No')\r\n\r\n\r\ndef INF(): return float('inf')\r\n\r\n\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　（´<_｀）　 Welcome to My Coding Space !\r\n# 　　　　（ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　　 \|　\| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　\|　 \|\r\n# 　＿_(__ﾆつ/　＿/ .\| .\|＿＿＿＿\r\n# 　　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# BINARY SEARCH ?\r\n# CHANGE TO GRAPH?\r\n# pow(x,-1,q) PLEASE USE [python 3.8.2]\r\n# -----------------------------------------------------------------------------------------------------\r\nn, start, x = II()\r\nimport random\r\nfrom functools import lru_cache\r\n\r\n\r\ndef found(x):\r\n print(\"!\", x)\r\n\r\n\r\n@lru_cache(None)\r\ndef query(i):\r\n print(\"?\", i, flush=True)\r\n a, b = II()\r\n if a == x:\r\n found(a)\r\n exit()\r\n return (a, b)\r\n\r\n\r\nif n < 1990:\r\n res = [query(i)[0] for i in r(1, n + 1)]\r\n res.sort()\r\n index = bisect.bisect_left(res, x)\r\n if index == len(res):\r\n found(-1)\r\n else:\r\n found(res[index])\r\n exit()\r\na, b = query(start)\r\nif x <= a:\r\n found(a)\r\n exit()\r\npivot = [100 * i + random.randint(0,99) for i in r(n // 100)]\r\nif start not in pivot:\r\n pivot.append(start)\r\nrpviot = [query(x) for x in pivot]\r\nrpviot.sort()\r\nindex = bisect.bisect_left(rpviot, (x, 0))\r\nstart = -1\r\nend = -1\r\nif index == len(rpviot):\r\n start = rpviot[index - 1][1]\r\nelse:\r\n start = rpviot[index - 1][1]\r\n end = rpviot[index][1]\r\nwhile start != end:\r\n a, b = query(start)\r\n if a >= x:\r\n found(a)\r\n exit()\r\n start = b\r\nfound(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from random import sample\r\n\r\nn,start,x=map(int,input().split())\r\nf = min(n, 998)\r\n\r\ndef get(i):\r\n print('?', i)\r\n return list(map(int, input().split()))\r\n\r\ndef answer(a):\r\n print('!', a)\r\n exit(0)\r\n\r\narr=[]\r\narr.append(get(start))\r\nif arr[0][0] >= x:\r\n answer(arr[0][0])\r\n\r\nfor i in sample(range(1, n+1), f):\r\n a=get(i)\r\n if a[0]<x:\r\n arr.append(a)\r\n elif a[0]==x:\r\n answer(a[0])\r\n\r\nu = max(arr)[1]\r\nwhile u!=-1:\r\n q = get(u)\r\n if q[0] >= x:\r\n answer(q[0])\r\n u = q[1]\r\nanswer(-1)", "from random import sample\n\n\n\nSIZE = 950\n\n\n\ndef R():\n\n return map(int, input().split())\n\n\n\ndef ask(i):\n\n print('?', i, flush=True)\n\n v, nxt = R()\n\n if v < 0:\n\n exit()\n\n return v, nxt\n\n\n\nn, s, x = R()\n\nq = range(1, n + 1)\n\nif n > SIZE:\n\n q = sample(q, SIZE)\n\nv, s = max((t for t in map(ask, q) if t[0] < x), default=(-1, s))\n\nwhile v < x and ~s:\n\n v, s = ask(s)\n\nprint('!', v if v >= x else -1)\n\n\n\n\n\n# Made By Mostafa_Khaled", "from random import randint\r\nfrom sys import stdout\r\n\r\n\r\ndef get(i):\r\n print('? {}'.format(i + 1))\r\n stdout.flush()\r\n v, nx = [int(t) for t in input().split()]\r\n return v, nx - 1\r\n\r\nn, start, x = [int(t) for t in input().split()]\r\nbest_index = None\r\nbest_value = None\r\nfor i in range(1000):\r\n ind = randint(0, n - 1)\r\n value, nxt = get(ind)\r\n if value < x and (best_value is None or value > best_value):\r\n best_value = value\r\n best_index = ind\r\n\r\nif best_value is None:\r\n best_index = start - 1\r\n\r\nind = best_index\r\nwhile True:\r\n value, nxt = get(ind)\r\n if value >= x:\r\n print('! {}'.format(value))\r\n break\r\n if nxt < 0:\r\n print('! -1')\r\n break\r\n ind = nxt\r\n", "import sys\r\nimport random\r\n\r\n\r\n\r\nn, st, t = map(int, input().split())\r\n\r\nprint('?', st)\r\nsys.stdout.flush()\r\nmn, i1 = map(int, input().split())\r\nif (mn >= t):\r\n\tprint('!', mn)\r\n\tsys.stdout.flush()\r\n\texit(0)\r\nar = list(i for i in range(1, n + 1))\r\nrandom.shuffle(ar)\r\nmx = 1010\r\nfor i in range(min(999, len(ar))):\r\n\tprint('?', ar[i])\r\n\tsys.stdout.flush()\r\n\tx, i2 = map(int, input().split())\r\n\tif (x >= t):\r\n\t\tmx = min(mx, t)\r\n\telse:\r\n\t\tif (mn < x):\r\n\t\t\tmn = x\r\n\t\t\ti1 = i2\r\nfor i in range(1000):\r\n\tif (i1 == -1):\r\n\t\tif (mx == 1010):\r\n\t\t\tprint('!', -1)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\texit(0);\r\n\t\telse:\r\n\t\t\tprint('!', mx)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\texit(0)\r\n\tprint('?', i1)\r\n\tx, i2 = map(int, input().split())\r\n\tif (x >= t):\r\n\t\tprint('!', x)\r\n\t\tsys.stdout.flush()\r\n\t\texit(0)\r\n\ti1 = i2\r\nif (mx == 10**10):\r\n\tprint('!', -1)\r\n\tsys.stdout.flush()\r\n\texit(0);\r\nelse:\r\n\tprint('!', mx)\r\n\tsys.stdout.flush()\r\n\texit(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]	{"inputs": ["5 3 80\n97 -1\n58 5\n16 2\n81 1\n79 4", "5 1 6\n1 2\n2 3\n3 4\n4 5\n5 -1", "1 1 0\n0 -1", "1 1 2\n0 -1", "1 1 1000000000\n0 -1", "5 3 3\n3 5\n2 1\n0 4\n1 2\n4 -1", "5 3 145337745\n619347297 5\n344132479 1\n122841322 4\n169280018 2\n740666615 -1", "5 3 315433300\n411188472 5\n316581280 1\n200698791 4\n314885421 2\n759386148 -1", "5 3 381735506\n469559901 5\n359493082 1\n137017061 4\n202768106 2\n955698260 -1", "5 3 587634055\n563214082 5\n404100743 1\n179733654 4\n236438578 2\n673892808 -1", "5 3 974128233\n547205043 5\n318213550 1\n122625404 4\n184874700 2\n669820978 -1", "10 3 2\n3 9\n9 -1\n0 7\n6 8\n5 4\n8 2\n1 10\n7 6\n4 5\n2 1", "10 3 632584719\n378382911 9\n978367651 -1\n176599346 7\n557138623 8\n441019502 4\n823417558 2\n244832688 10\n702148024 6\n385598339 5\n357778234 1", "1 1 50\n60 -1", "5 1 100\n200 2\n300 3\n400 4\n500 5\n600 -1"], "outputs": ["81\n1003", "-1\n1002", "0\n2", "-1\n1002", "-1\n1002", "3\n1003", "169280018\n1003", "316581280\n1003", "469559901\n1003", "673892808\n1003", "-1\n1002", "2\n1003", "702148024\n1003", "60\n2", "200\n2"]}	UNKNOWN	PYTHON3	CODEFORCES	8
d39d202a68a2cf02ae6f18f45fddeaca	Renting Bikes	A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them. The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles. In total, the boys' shared budget is a rubles. Besides, each of them has his own personal money, the i-th boy has bi personal rubles. The shared budget can be spent on any schoolchildren arbitrarily, but each boy's personal money can be spent on renting only this boy's bike. Each boy can rent at most one bike, one cannot give his bike to somebody else. What maximum number of schoolboys will be able to ride bikes? What minimum sum of personal money will they have to spend in total to let as many schoolchildren ride bikes as possible? The first line of the input contains three integers n, m and a (1<=≤<=n,<=m<=≤<=105; 0<=≤<=a<=≤<=109). The second line contains the sequence of integers b1,<=b2,<=...,<=bn (1<=≤<=bi<=≤<=104), where bi is the amount of the i-th boy's personal money. The third line contains the sequence of integers p1,<=p2,<=...,<=pm (1<=≤<=pj<=≤<=109), where pj is the price for renting the j-th bike. Print two integers r and s, where r is the maximum number of schoolboys that can rent a bike and s is the minimum total personal money needed to rent r bikes. If the schoolchildren cannot rent any bikes, then r<==<=s<==<=0. Sample Input 2 2 10 5 5 7 6 4 5 2 8 1 1 2 6 3 7 5 2 Sample Output 2 3 3 8	[ "n, m, a = map(int, input().split())\nB = [int(x) for x in input().split()]\nP = [int(x) for x in input().split()]\nB.sort()\nP.sort()\n\ndef f(a):\n need = 0\n for i in range(a):\n need += max(0, P[i] - B[n - a + i])\n return need\n\nl = 0\nr = min(n + 1, m + 1)\nwhile r - l > 1:\n mid = (l + r) // 2\n if f(mid) > a: r = mid\n else: l = mid\nprint(l, max(0, sum(P[:l]) - a))\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import \nfrom heapq import \nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\ndef find(K):\n ans = 0\n cnt = 0\n x = K-1\n for i in range(K):\n cnt+=B[x]\n ans+=max(0,B[x]-P[i])\n x-=1\n if ans>A:return False,-1\n\n return True,max(0,cnt-A)\n\nN,M,A = map(int,input().split())\nP = sorted(map(int,input().split()))[::-1]\nB = sorted(map(int,input().split()))\n\nl,r = 0,min(N,M)\nwhile l+1<r:\n mid = (l+r)//2\n check,num = find(mid)\n if check:\n l = mid\n else:\n r = mid\n\na,b = find(l)\nc,d = find(r)\nif c:\n print(r,d)\nelse:\n print(l,b)\n", "n, m, a = map(int, input().split())\r\nb, p = sorted(map(int, input().split())), sorted(map(int, input().split()))\r\ndef f(k):\r\n return sum(max(0, p[i] - b[n - k + i]) for i in range(k))\r\ndef g(k):\r\n return sum(min(b[n - k + i], p[i]) for i in range(k))\r\n \r\nx, y, d = 0, min(n, m) + 1, a\r\nwhile y - x > 1:\r\n k = (x + y) // 2\r\n s = f(k)\r\n if s > a:\r\n y = k\r\n else:\r\n x, d = k, s\r\nprint(x, max(0, g(x) - a + d))", "def readn():\n return map(int, input().split())\nn,m,a=readn()#map(int,input().split())\nb,p=sorted(map(int,input().split()))[-min(n,m):],sorted(map(int,input().split()))\nr=min(n,m)\nmm=r\nl=0\nwhile l<=r:\n mid=l+(r-l)//2\n pri=sum([max(0,p[i]-b[mm-mid+i]) for i in range(mid)])\n if pri<=a:\n l=mid+1\n else:\n r=mid-1\nprint(r,max(0,sum(p[:r])-a))\n\n\n\n\n\n\n\t \t\t \t \t \t\t\t \t \t \t\t \t \t\t" ]	{"inputs": ["2 2 10\n5 5\n7 6", "4 5 2\n8 1 1 2\n6 3 7 5 2", "1 1 2\n1\n2", "4 1 1\n3 2 3 2\n3", "1 4 1\n3\n2 4 5 5", "3 3 3\n1 1 2\n3 5 6", "4 5 6\n5 1 7 2\n8 7 3 9 8", "4 8 10\n2 1 2 2\n10 12 10 8 7 9 10 9", "8 4 18\n9 4 2 2 7 5 1 1\n11 12 8 9", "6 6 2\n6 1 5 3 10 1\n11 4 7 8 11 7", "10 10 7\n6 7 15 1 3 1 14 6 7 4\n15 3 13 17 11 19 20 14 8 17", "14 14 22\n23 1 3 16 23 1 7 5 18 7 3 6 17 8\n22 14 22 18 12 11 7 24 20 27 10 22 16 7", "10 20 36\n12 4 7 18 4 4 2 7 4 10\n9 18 7 7 30 19 26 27 16 20 30 25 23 17 5 30 22 7 13 6", "20 10 31\n17 27 2 6 11 12 5 3 12 4 2 10 4 8 2 10 7 9 12 1\n24 11 18 10 30 16 20 18 24 24", "40 40 61\n28 59 8 27 45 67 33 32 61 3 42 2 3 37 8 8 10 61 1 5 65 28 34 27 8 35 45 49 31 49 13 23 23 53 20 48 14 74 16 6\n69 56 34 66 42 73 45 49 29 70 67 77 73 26 78 11 50 69 64 72 78 66 66 29 80 40 50 75 68 47 78 63 41 70 52 52 69 22 69 66", "10 10 0\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n1001 1001 1001 1001 1001 1001 1001 1001 1001 1001", "9 8 0\n1 2 3 4 5 6 7 8 9\n2 3 4 5 6 7 8 9", "9 8 0\n1 2 3 4 5 6 7 8 9\n1 2 3 4 5 6 7 8"], "outputs": ["2 3", "3 8", "1 0", "1 2", "1 1", "1 0", "3 12", "1 0", "4 22", "3 16", "5 42", "10 115", "10 69", "7 86", "22 939", "0 0", "8 44", "8 36"]}	UNKNOWN	PYTHON3	CODEFORCES	4
d39f143028f8d494421257e9610a63a2	Inna and Choose Options	There always is something to choose from! And now, instead of "Noughts and Crosses", Inna choose a very unusual upgrade of this game. The rules of the game are given below: There is one person playing the game. Before the beginning of the game he puts 12 cards in a row on the table. Each card contains a character: "X" or "O". Then the player chooses two positive integers a and b (a·b<==<=12), after that he makes a table of size a<=×<=b from the cards he put on the table as follows: the first b cards form the first row of the table, the second b cards form the second row of the table and so on, the last b cards form the last (number a) row of the table. The player wins if some column of the table contain characters "X" on all cards. Otherwise, the player loses. Inna has already put 12 cards on the table in a row. But unfortunately, she doesn't know what numbers a and b to choose. Help her win the game: print to her all the possible ways of numbers a,<=b that she can choose and win. The first line of the input contains integer t (1<=≤<=t<=≤<=100). This value shows the number of sets of test data in the input. Next follows the description of each of the t tests on a separate line. The description of each test is a string consisting of 12 characters, each character is either "X", or "O". The i-th character of the string shows the character that is written on the i-th card from the start. For each test, print the answer to the test on a single line. The first number in the line must represent the number of distinct ways to choose the pair a,<=b. Next, print on this line the pairs in the format axb. Print the pairs in the order of increasing first parameter (a). Separate the pairs in the line by whitespaces. Sample Input 4 OXXXOXOOXOOX OXOXOXOXOXOX XXXXXXXXXXXX OOOOOOOOOOOO Sample Output 3 1x12 2x6 4x3 4 1x12 2x6 3x4 6x2 6 1x12 2x6 3x4 4x3 6x2 12x1 0	[ "T=int(input())\n\nwhile T>=1:\n T-=1\n a=input()\n list=[]\n for i in range(1,13):\n if 12 % i==0:\n l=12//i\n for j in range(0,l):\n for k in range(0,i):\n if a[kl+j]!='X':\n break\n else:\n break\n else:\n continue\n list.append(i)\n print(len(list),end=' ')\n for i in range(0,len(list)):\n print(str(list[i])+'x'+str(12//list[i]),end=' ')\n print()\n", "fact = [2,3,4,6]\r\nn = int(input())\r\nl1 = []\r\nfor i in range(n):\r\n\tt = input()\r\n\tl2 = []\r\n\tif t.count(\"X\"):\r\n\t\tl2.append(\"1x12\")\r\n\t\tfor j in fact:\r\n\r\n\t\t\tfor k in range(12//j):\r\n\t\t\t\tflag = 0\r\n\t\t\t\t# print(j) \r\n\t\t\t\tfor l in range(k,12,12//j):\r\n\t\t\t\t\t# print(k,j,l)\r\n\t\t\t\t\tif t[l] == \"X\":\r\n\t\t\t\t\t\tpass\r\n\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tflag = 1\r\n\t\t\t\t\t\tbreak\r\n\r\n\t\t\t\tif flag == 0:\r\n\t\t\t\t\tl2.append(str(j)+\"x\"+str(12//j))\r\n\t\t\t\t\tbreak\r\n\tif t.count(\"X\") == 12:\r\n\t\tl2.append(\"12x1\")\r\n\tl1.append(l2)\r\nfor i in l1:\r\n\tprint(len(i),i)\r\n", "a=[1,2,3,4,6,12]\r\nfor _ in range(int(input())):\r\n s=input()\r\n b=[]\r\n for i in a:\r\n m=12//i\r\n for j in range(m):\r\n if s[j::m]==\"X\"i:\r\n b+=[(i,m)]\r\n break\r\n print(len(b), ' '.join(str(x)+\"x\"+str(y) for x,y in b))\r\n ", "t = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n b = []\r\n for n in [1, 2, 3, 4, 6, 12]:\r\n m = 12 // n\r\n for j in range(m):\r\n if s[j::m] == \"X\" n:\r\n b += [(n, m)]\r\n break\r\n print(len(b), ' '.join(str(x) + \"x\" + str(y) for x, y in b))", "# -- coding: UTF-8 --\r\ndef evaluate(origin_str):\r\n ans = []\r\n for i in [1,2,3,4,6,12]:\r\n last_idx = int(12 / i)\r\n flags = [1 for i in range(0,last_idx)]\r\n if (i == 1):\r\n flag = False\r\n for ch in origin_str:\r\n if (ch == 'X'):\r\n flag = True\r\n if (flag):\r\n ans.append([i,last_idx])\r\n else:\r\n for j in range(0,last_idx):\r\n tmp = []\r\n k = j - last_idx\r\n for x in range(0,i):\r\n k += last_idx\r\n tmp.append(k)\r\n for l in tmp:\r\n ch = origin_str[l]\r\n if (ch != 'X'):\r\n flags[j] = 0\r\n if (sum(flags) != 0):\r\n ans.append([i,last_idx])\r\n s = \"\"\r\n for a in ans:\r\n s += str(a[0])+\"x\"+str(a[1]) + \" \"\r\n print(str(len(ans)) + \" \" + s)\r\n \r\ndef main():\r\n n = int(input())\r\n for i in range(0,n):\r\n evaluate(input())\r\n \r\nmain()", "T=int(input())\r\n\r\nfor t in range(T):\r\n s=input()\r\n ans=0\r\n L=[]\r\n for i in [1,2,3,4,6,12]:\r\n x=i\r\n y=12//x\r\n E=[]\r\n for j in range(12):\r\n if(j%y==0):\r\n E.append(\"\")\r\n E[-1]+=s[j]\r\n for j in range(y):\r\n c=0\r\n for z in range(i):\r\n if(E[z][j]=='X'):\r\n c+=1\r\n if(c==i):\r\n ans+=1\r\n L.append(i)\r\n break\r\n print(ans,end=\" \")\r\n for item in L:\r\n print(item,end=\"x\")\r\n print(12//item,end=\" \")\r\n print()\r\n", "n=int(input())\nfor i in range(n):\n a=input()\n c=0\n p=''\n if 'XXXXXXXXXXXX'==a:\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\n continue\n if 'X' in a:\n p=p+'1x12'\n c+=1\n if 'XX'==(a[0]+a[6]) or 'XX'==(a[1]+a[7]) or 'XX' ==(a[2]+a[8]) or 'XX' ==(a[3]+a[9]) or 'XX' ==(a[4]+a[10]) or 'XX' ==(a[5]+a[11]):\n c+=1\n p+=' 2x6'\n if 'XXX'==(a[0]+a[4]+a[8]) or 'XXX'==(a[1]+a[5]+a[9]) or 'XXX'==(a[2]+a[6]+a[10]) or 'XXX'==(a[3]+a[7]+a[11]):\n p+=' 3x4'\n c+=1\n if 'XXXX'==(a[0]+a[3]+a[6]+a[9]) or 'XXXX'==(a[1]+a[4]+a[7]+a[10]) or 'XXXX'==(a[2]+a[5]+a[8]+a[11]):\n c+=1\n p+=' 4x3'\n if 'XXXXXX'==(a[0]+a[2]+a[4]+a[6]+a[8]+a[10])or 'XXXXXX'==(a[1]+a[3]+a[5]+a[7]+a[9]+a[11]):\n c+=1\n p+=' 6x2'\n print(c,p)\n \n\n else:\n print(0)\n \n", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n s = input()\r\n ans_list = []\r\n for a in [1, 2, 3, 4, 6, 12]:\r\n b = 12 // a\r\n \r\n found = False\r\n for i in range(b):\r\n if \"O\" not in [s[j] for j in range(i, 12, b)]:\r\n found = True\r\n break\r\n if found:\r\n ans_list.append(\"{0}x{1}\".format(a, b))\r\n print(len(ans_list), ans_list, sep=\" \")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def solve(pos):\r\n ans=[12]\r\n k=1\r\n y=[6,4,3,2]\r\n for i in y:\r\n if pos[0]>i:\r\n break\r\n s=i\r\n found=True\r\n for j in pos:\r\n if j>i:\r\n break\r\n s=j\r\n while s<=12:\r\n if s not in pos:\r\n break\r\n s+=i\r\n if s>12:\r\n found=False\r\n break\r\n if found==False:\r\n ans.append(i)\r\n continue\r\n print(len(ans),end=' ')\r\n for i in ans:\r\n print(\"{0}x{1}\".format(12//i,i),end=' ')\r\n print()\r\n \r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n #f.readline()\r\n #input()\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [t]=get()\r\n for z in range(t):\r\n g=list(input())\r\n if g.count('X')==12:\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n continue\r\n if g.count('X')==0:\r\n print(\"0\")\r\n continue\r\n if g.count('X')==1:\r\n print(\"1 1x12\")\r\n continue\r\n pos=[]\r\n for i in range(12):\r\n if g[i]=='X':\r\n pos.append(i+1)\r\n solve(pos)\r\n \r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "n=int(input())\narr=[12,6,4,3,2,1]\nfor i in range(n):\n x=input()\n final=\"\"\n c=0\n for k in arr:\n ans=[0]12\n for j in range(0,len(x)):\n if x[j]=='X':\n ans[j%k]+=1 \n if k == 12:\n for j in ans:\n if j == 1:\n c+=1\n final+=\" 1x12\"\n break\n if k == 6:\n for j in ans:\n if j == 2:\n c+=1\n final+=\" 2x6\"\n break\n if k == 4:\n for j in ans:\n if j == 3:\n c+=1\n final+=\" 3x4\"\n break\n if k == 3:\n for j in ans:\n if j == 4:\n c+=1\n final+=\" 4x3\"\n break\n if k == 2:\n for j in ans:\n if j == 6:\n c+=1\n final+=\" 6x2\"\n break\n if k == 1:\n for j in ans:\n if j == 12:\n c+=1\n final+=\" 12x1\"\n break\n print(f\"{c}{final}\")\n #print(ans)", "def test_col(s, a, b, col):\n\tres = True\n\tfor i in range(0, a):\n\t\tif s[i * b + col] != 'X':\t\n\t\t\tres = False\n\treturn res\t\n\ndef test_all_cols(s, a):\n\tb = len(s) // a\n\tif a * b != len(s):\n\t\treturn False\n\telse:\n\t\tres = False\n\t\tfor i in range(0, b):\n\t\t\tres = res or test_col(s, a, b, i)\n\t\treturn res\n\n\t\nn = int(input())\nfor i in range(0, n):\n\ts = input()\n\tslen = len(s)\n\tcvariants = 0 \n\tvariants = \"\"\n\tfor a in range(1, slen + 1):\t\t\n\t\tif (test_all_cols(s, a)):\n\t\t\tcvariants += 1\n\t\t\tvariants += str(a) + \"x\" + str(slen // a) + \" \"\n\tprint(str(cvariants), variants)\n\t\n", "import math\r\nloops = int(input())\r\nfor x in range(loops):\r\n line = input()\r\n line = line.lower()\r\n out = \"\"\r\n sum = 0\r\n for i in range(12):\r\n if line[i] == \"x\":\r\n out = out + \"1x12 \"\r\n sum+=1\r\n break\r\n for i in range(6):\r\n if line[i] == \"x\" and line[i + 6] == \"x\":\r\n out = out + \"2x6 \"\r\n sum+=1\r\n break\r\n for i in range(4):\r\n if line[i] == \"x\" and line[i + 4] == \"x\" and line[i + 8] == \"x\":\r\n out = out + \"3x4 \"\r\n sum+=1\r\n break\r\n for i in range(3):\r\n if line[i] == \"x\" and line[i + 3] == \"x\" and line[i + 6] == \"x\" and line[i + 9] == \"x\":\r\n out = out + \"4x3 \"\r\n sum += 1\r\n break\r\n for i in range(2):\r\n if line[i] == \"x\" and line[i + 2] == \"x\" and line[i + 4] == \"x\" and line[i + 6] == \"x\" and line[i + 8] == \"x\" and line[i + 10] == \"x\":\r\n out = out + \"6x2 \"\r\n sum += 1\r\n break\r\n a = True\r\n for i in range(12):\r\n if line[i] != \"x\":\r\n a = False\r\n break\r\n if a == True:\r\n out = out + \"12x1 \"\r\n sum+= 1\r\n print(str(sum) + \" \" + out[:-1])\r\n", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import \r\nfrom collections import defaultdict, Counter, deque\r\nfrom sys import stdin, stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\n\r\nt = ninput()\r\nfor _ in range(t):\r\n s = sinput()\r\n n = len(s)\r\n ans = []\r\n for a, b in (1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1):\r\n mat = [s[i:i+b] for i in range(0, n, b)]\r\n for i in range(b):\r\n c = 0\r\n for j in range(a):\r\n if mat[j][i] == 'X': c += 1\r\n if c == a: ans.append([a, b]); break\r\n final = [len(ans)]\r\n for i, j in ans: final.append(str(i) + 'x' + str(j))\r\n printt(\" \".join(map(str, final)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\n \r\nt = int(sys.stdin.readline())\r\n\r\nfor i in range(t):\r\n st = sys.stdin.readline()\r\n p1 = 1\r\n p2 = [1] * 2\r\n p3 = [1] * 3\r\n p4 = [1] * 4\r\n p6 = [1] * 6\r\n p12 = 0\r\n for j in range(1, 13):\r\n v = 0\r\n if(st[j - 1] == 'X'):\r\n v = 1\r\n\r\n p1 &= v\r\n p2[j % 2] &= v\r\n p3[j % 3] &= v\r\n p4[j % 4] &= v\r\n p6[j % 6] &= v\r\n p12 += v\r\n\r\n res = []\r\n if(p12 > 0):\r\n res.append(\"1x12\")\r\n if(sum(p6) > 0):\r\n res.append(\"2x6\")\r\n if(sum(p4) > 0):\r\n res.append(\"3x4\")\r\n if(sum(p3) > 0):\r\n res.append(\"4x3\")\r\n if(sum(p2) > 0):\r\n res.append(\"6x2\")\r\n if(p1 > 0):\r\n res.append(\"12x1\")\r\n\r\n print(str(len(res)) + \" \" + \" \".join(res))\r\n", "\r\n\r\nconstants = [1,2,3,4,6,12]\r\nconstants.reverse()\r\n\r\nif __name__ == '__main__':\r\n k = int(input())\r\n for i in range(k):\r\n value = input()\r\n result = []\r\n\r\n for elem in constants:\r\n matrix = [[value[i] for i in range(k,k+elem)] for k in range(0,12, elem)]\r\n width = len(matrix[0])\r\n length = len(matrix)\r\n\r\n for i in range(width):\r\n matrix_found = True\r\n for j in range(length):\r\n if matrix[j][i] == 'O':\r\n matrix_found = False\r\n break\r\n if matrix_found :\r\n result.append(elem)\r\n break\r\n\r\n print(len(result) , end = ' ')\r\n for elem in result:\r\n print(str(12//elem) +\"x\" + str(elem) , end = ' ')\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\noptions = [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]\r\nt = int(input())\r\nfor _ in range(t):\r\n\tl = list(input())\r\n\twinCount = 0\r\n\twinList = []\r\n\r\n\tfor i in range(6):\r\n\t\toption = options[i]\r\n\t\tfor j in range(option[1]):\r\n\t\t\tco = 0\r\n\t\t\tfor k in range(option[0]):\r\n\t\t\t\tif l[k * option[1] + j] == 'X':\r\n\t\t\t\t\tco += 1\r\n\r\n\t\t\tif co == option[0]:\r\n\t\t\t\twinCount += 1\r\n\t\t\t\twinList.append(option)\r\n\t\t\t\tbreak\r\n\r\n\tprint(winCount, end = ' ')\r\n\tfor i in winList:\r\n\t\tprint(i, sep = 'x', end = ' ')\r\n\r\n\tprint()", "\r\n\r\ndef decomp(s, n):\r\n\tm = 12 // n\r\n\treturn [s[i::m] for i in range(m)]\r\n\r\ndef check(s):\r\n\treturn all(map(lambda x:x==\"X\", s))\r\n\r\ndef solve(s):\r\n\tres = []\r\n\tfor n in [1, 2, 3, 4, 6, 12]:\r\n\t\td = decomp(s, n)\r\n\t\t#print(n, d)\r\n\t\tif any(map(check, d)):\r\n\t\t\tres.append(f\"{n}x{12//n}\")\r\n\tprint(len(res), res)\r\n\t\t\r\n\t\r\n#solve(\"OXXXOXOOXOOX\")\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n\tsolve(input())\r\n", "n = int(input())\r\nfor i in range(n):\r\n s = input()\r\n ans = []\r\n for j in [1,2,3,4,6,12]:\r\n k = 12//j\r\n for i in range(k):\r\n if s[i::k] == 'X' * j :\r\n ans+=[(j , k)]\r\n break\r\n print(len(ans),' '.join(str(x)+'x'+str(y) for x , y in ans))", "# coding: utf-8\ndef check(a,b,s,ans):\n for j in range(b):\n if [s[k] for k in range(12) if k%b==j].count('X')==a:\n ans.append('%dx%d'%(a,b))\n return ans\n return ans\nt = int(input())\nfor i in range(t):\n ans = []\n s = input()\n ans = check(1,12,s,ans)\n ans = check(2,6,s,ans)\n ans = check(3,4,s,ans)\n ans = check(4,3,s,ans)\n ans = check(6,2,s,ans)\n ans = check(12,1,s,ans)\n if ans:\n print(len(ans),' '.join(ans))\n else:\n print(0)\n", "t = int(input())\r\nfor i in range (t):\r\n\tword = input()\r\n\ta = []\r\n\tcek = []\r\n\tfor i in [1,2,3,4,6,12]:\r\n\t\tdiv = int(12/i)\r\n\t\tfor u in range (div):\r\n\t\t\tboo = True\r\n\t\t\tj = u\r\n\t\t\twhile j <= 11:\r\n\t\t\t\tif(word[j]=='X'):\r\n\t\t\t\t\tj += div\r\n\t\t\t\telse:\r\n\t\t\t\t\tboo = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif(boo):\r\n\t\t\t\ta.append(i)\r\n\t\t\t\tbreak\r\n\tprint (len(a), end = ' ')\r\n\tfor i in a:\t\r\n\t\tprint (i, 'x', int(12/i), end = ' ', sep = '')\r\n\tprint ()\r\n\t\r\n\t\t\t\t\r\n\t\t\t", "n = int(input())\r\nab = [12, 6, 4, 3, 2, 1]\r\nlst = [list(input()) for i in range(n)]\r\nres = [[0] for i in range(n)] \r\nfor pr in range(n):\r\n for elem in ab:\r\n for i in range(elem):\r\n x = 1\r\n for j in range(0, 12, elem):\r\n if lst[pr][i + j] == \"O\":\r\n x = 0\r\n if x == 1 and str(12 // elem) + \"x\" + str(elem) not in res[pr]: \r\n res[pr][0] += 1\r\n res[pr].append(str(12 // elem) + \"x\" + str(elem))\r\nfor i in range(len(res)):\r\n print(\" \".join(map(str, res[i])))\r\n ", "n = int(input())\r\n\r\nwhile n :\r\n s = input()\r\n cases = [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]\r\n anst = list()\r\n for t in range(6) :\r\n for i in range(cases[t][1]) :\r\n f = False\r\n # if t == 2 :\r\n # print(\"Estou no caracter: %d\" % i)\r\n if s[i] == 'X' :\r\n f = True\r\n # if t == 2 : print(\"Opa, esse caracter e igual a x\")\r\n for j in range(1,cases[t][0]) :\r\n # if t == 2 :\r\n # print(\"Jump: %d\" % (i+(jcases[t][1])))\r\n # print(\"s[%d] = %s\" % (i, s[i]))\r\n # print(\"s[%d] = %s\" % ((i+(jcases[t][1])), s[(i+(jcases[t][1]))]))\r\n aux = s[i+(jcases[t][1])] == 'X'\r\n f = (aux & f)\r\n # if t == 2 : print(f)\r\n if f :\r\n anst.append(\"%dx%d\" % (cases[t][0], cases[t][1]))\r\n break\r\n else :\r\n f = False\r\n print(len(anst), end=' ')\r\n for i in range(len(anst)) :\r\n print(anst[i], end=' ')\r\n print()\r\n\r\n n-=1\r\n", "testcases = int(input())\nfor k in range(testcases):\n\tjuego = list(input())\n\tcasos = []\n\tf = True\n\te = False\n\td = False\n\tc = False\n\tb = False\n\ta = False\n\tctr = 0\n\tresult = \"\"\n\n\n\tfor k in range(6):\n\t\tif juego[k] == \"X\" and juego[k + 6] == \"X\":\n\t\t\tb = True\n\t\t\tbreak\n\n\tfor k in range(4):\n\t\tif juego[k] == \"X\" and juego[k + 4] == \"X\" and juego[k+8] == \"X\":\n\t\t\tc = True\n\t\t\tbreak\n\n\tfor k in range(3):\n\t\tif juego[k] == \"X\" and juego[k + 3] == \"X\" and juego[k+6] == \"X\" and juego[k + 9] == \"X\":\n\t\t\td = True\n\t\t\tbreak\n\n\tfor k in range(2):\n\t\tif juego[k] == \"X\" and juego[k + 2] == \"X\" and juego[k + 4] == \"X\" and juego[k + 6] == \"X\" and juego[k + 8] == \"X\" and juego[k + 10] == \"X\":\n\t\t\te = True\n\t\t\tbreak\n\t\n\tfor k in range(12):\n\t\tif juego[k] == \"X\":\n\t\t\ta = True\n\t\tif juego[k] == \"O\":\n\t\t\tf = False\n\n\tif a:\n\t\tresult += \" 1x12\"\n\t\tctr += 1\n\tif b:\n\t\tresult += \" 2x6\"\n\t\tctr += 1\n\tif c:\n\t\tresult += \" 3x4\"\n\t\tctr += 1\n\tif d:\n\t\tresult += \" 4x3\"\n\t\tctr += 1\n\tif e:\n\t\tresult += \" 6x2\"\n\t\tctr += 1\n\tif f:\n\t\tresult += \" 12x1\"\n\t\tctr += 1\n\n\tprint(str(ctr) + result)\n\n\n\n\n\n\n\t\t\n# 1535133833533\n", "n=int(input())\r\nfor i in range(n):\r\n\ta=input()\r\n\tans=[]\r\n\tfor j in [1,2,3,4,6,12]:\r\n\t\tif j==1 and \"X\" in a:\r\n\t\t\tans.append(\"1x12\")\r\n\t\t\tcontinue\r\n\t\tfor k in range(12//j):\r\n\t\t\tf=0\r\n\t\t\tfor p in range(k,12,12//j):\r\n\t\t\t\t# print(j,k,p)\r\n\t\t\t\tif a[p]==\"X\":\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tf=1\r\n\t\t\tif f==0:\r\n\t\t\t\tans.append(\"{}x{}\".format(j,12//j))\r\n\t\t\t\tbreak\r\n\tif len(ans)!=0:\r\n\t\tprint(len(ans),end=\" \")\r\n\t\tprint(ans)\r\n\telse:\r\n\t\tprint(0)\r\n\r\n", "t = int(input())\r\nfor i in range(t):\r\n s = input().strip()\r\n cnt = 0\r\n ans = []\r\n for b in [1, 2, 3, 4, 6, 12]:\r\n List = []\r\n a = 12 // b\r\n for begin in range(b):\r\n column = ''\r\n j = begin\r\n while j < 12:\r\n column += s[j]\r\n j += b\r\n List.append(column)\r\n #print(i, b, List)\r\n if 'X' a in List:\r\n cnt += 1\r\n ans.append((a, b))\r\n print(cnt, end = ' ')\r\n for pair in sorted(ans):\r\n print('x'.join(map(str, pair)), end = ' ')\r\n print()\r\n", "for _ in range(int(input())):\r\n s = input()\r\n ans = []\r\n for n in [1, 2, 3, 4, 6, 12]:\r\n m = 12//n\r\n for i in range(m):\r\n if s[i::m]=='X'n:\r\n ans+=[(n, m)]\r\n break\r\n print(len(ans), ' '.join(str(x) + 'x' + str(y) for (x, y) in ans))", "n = int(input())\nresults = []\nfor i in range(n):\n res = []\n line = list(input())\n for k in range(1,13):\n if 12%k ==0:\n a = 12//k\n b = k\n boleh = False\n for l in range(b):\n count = 0\n for j in range(l, 12, b):\n if line[j] == 'X':\n count+=1\n if count == a:\n boleh = True\n if boleh:\n res.append(str(a) +\"x\"+str(b))\n results.append(res)\n\n\nfor result in results:\n print(str(len(result)),end=' ')\n print(result[::-1], sep=\" \")\n\n\n \n\n\n\n", "'''\r\nCreated on May 4, 2015\r\n\r\n@author: mohamed265\r\n'''\r\n\r\ndef fun():\r\n num = input()\r\n slon = []\r\n if num.count('X') > 0:\r\n slon.append(\"1x12\")\r\n if num[0] == 'X' and num[6] == 'X' or num[1] == 'X' and num[7] == 'X' or num[2] == 'X' and num[8] == 'X' or num[3] == 'X' and num[9] == 'X' or num[4] == 'X' and num[10] == 'X' or num[5] == 'X' and num[11] == 'X':\r\n slon.append(\"2x6\")\r\n if num[0] == 'X' and num [4] == 'X' and num[8] == 'X' or num[1] == 'X' and num [5] == 'X' and num[9] == 'X' or num[2] == 'X' and num [6] == 'X' and num[10] == 'X' or num[3] == 'X' and num [7] == 'X' and num[11] == 'X':\r\n slon.append(\"3x4\")\r\n if num[0] == 'X' and num[3] == 'X' and num[6] == 'X' and num[9] == 'X' or num[1] == 'X' and num[4] == 'X' and num[7] == 'X' and num[10] == 'X' or num[2] == 'X' and num[5] == 'X' and num[8] == 'X' and num[11] == 'X':\r\n slon.append(\"4x3\")\r\n if num[0] == 'X' and num[2] == 'X' and num[4] == 'X'and num[6] == 'X' and num[8] == 'X' and num[10] == 'X' or num[1] == 'X' and num[3] == 'X' and num[5] == 'X'and num[7] == 'X' and num[9] == 'X' and num[11] == 'X':\r\n slon.append(\"6x2\")\r\n if num.count('X') == 12:\r\n slon.append(\"12x1\") \r\n return slon\r\nt = int(input())\r\nfor i in range(t):\r\n num = fun()\r\n print(len(num) , end =' ')\r\n print(num)", "t = int(input())\r\nfor i in range(0, t):\r\n str = input()\r\n answer = []\r\n p = [1, 2, 3, 4, 6, 12]\r\n for j in range(0, len(p)):\r\n d1, d2 = p[j], 12 // p[j]\r\n cnt = [0 for h in range(0, d2)]\r\n for i2 in range(0, 12):\r\n tt = i2 % d2\r\n cnt[tt] += (str[i2] == 'X')\r\n ans_cand = False\r\n for i2 in range(0, d2):\r\n if cnt[i2] == d1:\r\n ans_cand = True\r\n if ans_cand:\r\n answer.append('%dx%d' % (d1, d2))\r\n print(len(answer), end = ' ')\r\n for j in range(0, len(answer)):\r\n print(answer[j], end = ' ')\r\n print()", "from functools import reduce\r\nprint(\"\\n\".join([(lambda x:(\"%i %s\" % (len(x), \" \".join(x))))((lambda h:[ \"%ix%i\" % (12//i, i) for i in (12,6,4,3,2,1) if reduce(lambda x, y: x&y, [int(h.replace(\"O\",\"0\").replace(\"X\",\"1\")[ij:ij+i],2) for j in range(12//i)], -1)])(input())) for i in range(int(input()))]))", "N = 12\r\nal = [a for a in range(1, N + 1) if N % a == 0]\r\ndef w(s, a):\r\n for c in range(N // a):\r\n if s[c::N // a] == 'X' a:\r\n return True\r\n return False\r\ndef tc(s):\r\n val = [str(a) + 'x' + str(N // a) for a in al if w(s, a)]\r\n print(len(val), ' '.join(val))\r\nfor t in range(int(input())):\r\n tc(input())", "def vamola(c, n=12):\r\n\tvitorias = set()\r\n\tfor i in [1,2,3,4,6,12]:\r\n\t\tflag = False\r\n\t\tk = 12 // i\r\n\t\tfor d in range(k):\r\n\t\t\tcolun = True\r\n\t\t\tfor j in range(d, 12, k):\r\n\t\t\t\tcolun = colun and c[j]\r\n\t\t\tflag = flag or colun\r\n\t\tif flag:\r\n\t\t\tvitorias.add(i)\r\n\tmsg = \"\";\r\n\tfor i in vitorias:\r\n\t\tmsg += str(i)+\"x\"+str(12//i) + \" \"\r\n\treturn str(len(vitorias)) + \" \" + msg[:len(msg)-1]\r\n\r\nx = int(input())\r\nfor c in range(x):\r\n\td = input()\r\n\tteste = []\r\n\tfor j in range(12):\r\n\t\tif d[j] == \"O\":\r\n\t\t\tteste.append(False)\r\n\t\telse:\r\n\t\t\tteste.append(True)\r\n\tprint(vamola(teste))", "n = int(input())\r\nfor i in range(n):\r\n x = input()\r\n res = []\r\n for j in [1, 2, 3, 4, 6, 12]:\r\n valid = False\r\n for k in range(12 // j):\r\n s = set(x[k :: 12//j])\r\n if len(s) == 1 and 'X' in s:\r\n valid = True\r\n break\r\n if valid:\r\n res.append(\"{}x{}\".format(j, 12//j))\r\n print(len(res), ' '.join(res))\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n t = I()\r\n for _ in range(t):\r\n s = S()\r\n c = s.count('X')\r\n res = []\r\n fact = [2,3,4,6,12]\r\n if c:\r\n res.append('1x12')\r\n for f in fact:\r\n mat = []\r\n ff = 12//f\r\n for i in range(0, len(s), ff):\r\n row = s[i:i+ff]\r\n mat.append(row)\r\n d = defaultdict(int)\r\n for j in mat:\r\n lenrow = len(j)\r\n for k in range(lenrow):\r\n if j[k]=='X':\r\n d[k]+=1\r\n ma = max(d.values())\r\n if ma >= f:\r\n string = str(f)+'x'+str(ff)\r\n res.append(string)\r\n print(len(res), res)\r\n\r\nif __name__ == '__main__':\r\n main()", "#!/usr/bin/env python3\r\n\r\ndef read_ints():\r\n\treturn map(int, input().strip().split())\r\n\r\nt, = read_ints()\r\n\r\nfor _ in range(t):\r\n\tx = input()\r\n\r\n\tcorrect = []\r\n\r\n\tfor a in [1, 2, 3, 4, 6, 12]:\r\n\t\tcor = False\r\n\t\tfor c in range(0, 12//a):\r\n\t\t\ts = set(x[c::12//a])\r\n\r\n\t\t\tif len(s)==1 and 'X' in s:\r\n\t\t\t\tcor = True\r\n\t\t\t\tbreak\r\n\r\n\t\tif cor == True:\r\n\t\t\tcorrect.append(\"{}x{}\".format(a, 12//a))\r\n\t\r\n\tprint(len(correct), ' '.join(correct))", "n = int(input())\n\na = [1, 2, 3, 4, 6, 12]\n\nfor i in range(0, n):\n\ts = str(input())\n\tans = [False for x in range(0, 6)]\n\tnans = 0;\n\n\tfor i in range (0, 6):\n\t\tfor j in range (0, 12 // a[i]):\n\t\t\tgood = True\n\t\t\tfor k in range(0, a[i]):\n\t\t\t\tif s[k 12 // a[i] + j] is 'O':\n\t\t\t\t\tgood = False\n\t\t\t\t\tbreak\n\t\t\tif good:\n\t\t\t\tnans = nans + 1\n\t\t\t\tans[i] = True\n\t\t\t\tbreak\n\n\tprint(nans, end = ' ')\n\tfor i in range (0, 6):\n\t\tif ans[i]:\n\t\t\tprint(str(a[i]) + 'x' + str(12 // a[i]), end = ' ')\n\tprint()\n", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n c=input()\r\n l.append(c)\r\n\r\nfor i in range(a):\r\n p=l[i]\r\n s=[]\r\n for i in range(12):\r\n if p[i]==\"X\":\r\n s.append(\"1x12\")\r\n break\r\n for i in range(6):\r\n if p[i]==\"X\" and p[i+6]==\"X\":\r\n s.append(\"2x6\")\r\n break\r\n for i in range(4):\r\n if p[i]==p[i+4]==p[i+8]==\"X\":\r\n s.append(\"3x4\")\r\n break\r\n for i in range(3):\r\n if p[i]==p[i+3]==p[i+6]==p[i+9]==\"X\":\r\n s.append(\"4x3\")\r\n break\r\n for i in range(2):\r\n m=1\r\n for j in range(i,12,2):\r\n if p[j]!=\"X\":\r\n m=0\r\n break\r\n if m==1:\r\n s.append(\"6x2\")\r\n break\r\n t=0\r\n for i in range(12):\r\n \r\n if p[i]!=\"X\":\r\n \r\n t=1\r\n \r\n break\r\n \r\n if t==0:\r\n s.append(\"12x1\")\r\n \r\n if len(s)==0:\r\n print(0)\r\n else:\r\n \r\n o=len(s)\r\n r=str(o)\r\n for k in range(len(s)):\r\n r=r+\" \"+s[k]\r\n print(r)", "t = int(input())\r\nN = 12\r\ndivisors = [1,2,3,4,6,12]\r\nL = 6\r\n\r\nfor _ in range(t):\r\n cards = input()\r\n goodDivs = []\r\n for k in range(L):\r\n numCols = divisors[k]\r\n state = [True] * numCols\r\n for m in range(N):\r\n if cards[m] == 'O':\r\n state[m % numCols] = False\r\n if any(state):\r\n goodDivs.append(numCols)\r\n\r\n print(len(goodDivs), end=' ')\r\n for k in range(len(goodDivs)-1, -1, -1):\r\n print(f\"{N//goodDivs[k]}x{goodDivs[k]}\", end=' ')\r\n print()\r\n", "a=[1,2,3,4,6,12]\r\nfor _ in[0]int(input()):\r\n b=input()\r\n z=[]\r\n for r,c in zip(a,a[::-1]):\r\n d=[]\r\n for k in range(r):\r\n d+=[b[kc:(k+1)c]]\r\n if any(''.join(x)=='X'r for x in[zip(d)]):\r\n z+=[f'{r}x{c}']\r\n print(len(z),z)\r\n ", "# Made By Mostafa_Khaled \nbot = True \nq = [12, 6, 4, 3, 2, 1]\n\np = {12 // i: 'X' i for i in q}\n\nr = {i: str(12 // i) + 'x' + str(i) for i in q}\n\nfor i in range(int(input())):\n\n s, t = [], input()\n\n for j in q:\n\n if any(t[k :: j] == p[j] for k in range(j)): s.append(r[j])\n\n print(len(s), ' '.join(s))\n\n# Made By Mostafa_Khaled", "t = int(input())\r\n\r\nfor i in range(t):\r\n\ts = input()\r\n\tl = []\r\n\t\r\n\tfor j in range(1, 13):\r\n\t\tx = 0\r\n\t\t\r\n\t\tif 12 % j == 0:\t\t\t\r\n\t\t\tfor k in range(j):\r\n\t\t\t\tif s[k:12:j] == \"X\" * (12 // j):\r\n\t\t\t\t\tx = 1\r\n\t\t\t\t\t\r\n\t\tif x == 1:\r\n\t\t\tl.insert(0, f\"{12 // j}x{j}\")\t\t\t\t\r\n\t\t\t\t\r\n\tprint(len(l), \" \".join(list(map(str, l))))\t\t\t\t", "t = int(input())\r\nans = [[] for i in range(t)]\r\nfor i in range(t):\r\n \r\n s = input() \r\n for a in range(1, 13):\r\n \r\n \r\n if 12 % a != 0:\r\n continue\r\n b = 12 // a\r\n c = [[] for h in range(b)]\r\n for h in range(b):\r\n for k in range(a):\r\n c[h].append(s[k * b + h])\r\n if a == 3:\r\n a = 3 \r\n T = True\r\n for h in range(b):\r\n if T:\r\n ok = True\r\n for k in range(a):\r\n if c[h][k] == 'O':\r\n ok = False\r\n if ok:\r\n ans[i].append([a, b])\r\n T = False\r\n break\r\nfor i in range(t):\r\n print(len(ans[i]), end = ' ')\r\n for z in ans[i]:\r\n print(z[0], end = '')\r\n print('x', end= '')\r\n print(z[1], end = ' ')\r\n print()\r\n", "def solve(matriz):\r\n n = len(matriz)\r\n m = len(matriz[0])\r\n \r\n for j in range(m):\r\n curr = True\r\n for i in range(n):\r\n if matriz[i][j] == 'O':\r\n curr = False\r\n break\r\n if curr:\r\n return True\r\n \r\n return False\r\n\r\ndef gera_matriz(s, e):\r\n ans = []\r\n \r\n for i in range(0, len(s), e[1]):\r\n ans.append(s[i:i+e[1]])\r\n \r\n return ans \r\n\r\nt = int(input())\r\npos = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)];\r\n\r\nfor i in range(t):\r\n s = input()\r\n ans = []\r\n \r\n for e in pos:\r\n matriz = gera_matriz(s, e)\r\n \r\n if solve(matriz):\r\n ans.append(e)\r\n \r\n tmp = []\r\n for e in ans:\r\n tmp.append(str(e[0]) + 'x' + str(e[1]))\r\n \r\n print(f'{len(ans)} {\" \".join(tmp)}')", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n good = []\r\n for g in (1, 2, 3, 4, 6, 12):\r\n for i in range(g):\r\n cnt = 0\r\n for j in range(12 // g):\r\n cnt += 1 if s[i + j * g] == 'X' else 0\r\n if cnt == 12 // g:\r\n good.append(g)\r\n break\r\n print(len(good), end=' ')\r\n for c in sorted(good, reverse=True):\r\n print(str(12 // c) + 'x' + str(c), end=' ')\r\n print()", "#!/usr/local/bin/python33\nn = int(input())\n\nfor i in range(n):\n\tcnt = 0\n\tansw = ['1x12', '2x6', '3x4', '4x3', '6x2', '12x1']\n\tanswb = [False, False, False, False, False, False]\n\tinstr = input()\n\n\tif 'X' in instr:\n\t\tcnt += 1\n\t\tanswb[0] = True\n\tfor j in range(6):\n\t\tif (instr[j] == instr[6 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[1] = True\n\t\t\tbreak\n\tfor j in range(4):\n\t\tif (instr[j] == instr[4 + j] == instr[8 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[2] = True\n\t\t\tbreak\n\tfor j in range(3):\n\t\tif (instr[j] == instr[3 + j] == instr[6 + j] == instr[9 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[3] = True\n\t\t\tbreak\n\tfor j in range(2):\n\t\tif (instr[j] == instr[2 + j] == instr[4 + j] == instr[6 + j] == instr[8 + j] == instr[10 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[4] = True\n\t\t\tbreak\n\tif not 'O' in instr:\n\t\tcnt += 1\n\t\tanswb[5] = True\n\n\tprint(cnt, end = ' ')\n\tfor i in range(6):\n\t\tif answb[i]:\n\t\t\tprint(answ[i], end = ' ')\n\tprint()", "As= [1, 2, 3, 4, 6, 12]\r\n\r\nC = int(input())\r\n\r\nfor c in range(C):\r\n S = list(input())\r\n ans = []\r\n for a in As:\r\n b = 12 // a\r\n fre = [0] * 12\r\n for i,q in enumerate(S):\r\n if q == 'X':\r\n fre[i % a] += 1\r\n if max(fre) >= b:\r\n ans += [a]\r\n \r\n print(len(ans),end= ' ')\r\n ans.sort(reverse=True)\r\n for a in ans:\r\n print(str(12//a) + 'x' + str(a),end=' ')\r\n print()", "def do(string):\r\n num = 0\r\n ok = []\r\n for i in [12, 6, 4, 3, 2, 1]:\r\n for j in range(0, i):\r\n if string[j::i] == 'X' * int(12/i):\r\n ok.append(str(int(12/i))+'x'+str(i))\r\n num += 1\r\n break\r\n\r\n ok = [str(num)] + ok\r\n print(' '.join(ok))\r\n\r\nfor i in range(int(input())):\r\n do(input())\r\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = [1,2,3,4,6,12]\r\n\r\nfor i in range(n):\r\n s = stdin.readline()\r\n ans = list()\r\n for x in a:\r\n p = 12//x\r\n for start in range(1,p+1):\r\n flag = True\r\n for col in range(0,x):\r\n if s[start-1 + colp] != 'X':\r\n flag = False\r\n if flag:\r\n ans.append(\" \"+str(x)+\"x\"+str(p))\r\n break\r\n stdout.write(str(len(ans)))\r\n for st in ans:\r\n stdout.write(st)\r\n stdout.write(\"\\n\")\r\n", "#!/usr/bin/env/python\r\n# -- coding: utf-8 --\r\ntests = int(input())\r\nfor _ in range(tests):\r\n m = input()\r\n res = []\r\n for i in [1, 2, 3, 4, 6, 12]:\r\n j = 12 // i\r\n flag = False\r\n\r\n for kk in range(j):\r\n stmp = ''\r\n if flag:\r\n break\r\n for k in range(i):\r\n stmp += m[k j + kk]\r\n # print(stmp)\r\n if stmp.count('X') == len(stmp):\r\n res.append(i)\r\n flag = True\r\n break\r\n\r\n print(len(res), end=' ')\r\n for r in res:\r\n print('{}x{}'.format(r, 12//r), end=' ')\r\n print()\r\n", "t = int(input())\r\nfor i in range(t):\r\n ans = []\r\n s = input()\r\n e = [(1,12),(2,6),(3,4),(4,3),(6,2),(12,1)]\r\n for q in e:\r\n a = q[0]\r\n b = q[1]\r\n for i in range(b):\r\n w = True\r\n for j in range(i,12,b):\r\n if s[j] != 'X':\r\n w = False\r\n if w:\r\n ans.append(q)\r\n break\r\n print(len(ans), map(lambda x:str(x[0])+'x'+str(x[1]), ans))", "def is_win(s, b):\r\n for j in range(b):\r\n if all(['X' in s[i b + j] for i in range(12 // b)]):\r\n return True\r\n return False\r\n\r\ndef solve():\r\n s = input()\r\n bb = []\r\n for b in [12, 6, 4, 3, 2, 1]:\r\n if is_win(s, b):\r\n bb.append(b)\r\n ans = [str(len(bb))]\r\n for b in bb:\r\n ans.append(str(12//b) + 'x' + str(b))\r\n print(ans)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n solve()", "t=int(input())\r\nfor i in range(t):\r\n f=input()\r\n if(f==\"XXXXXXXXXXXX\"):\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n elif(f==\"OOOOOOOOOOOO\"):\r\n print(\"0\")\r\n else:\r\n l=list(f)\r\n nb=0\r\n st=\"\"\r\n if(\"X\" in l):\r\n st+=\"1x12\"\r\n nb+=1\r\n for i in range(6):\r\n if(l[i]==\"X\" and l[i+6]==\"X\"):\r\n st+=\" 2x6\"\r\n nb+=1\r\n break\r\n for i in range(4):\r\n if(l[i]==\"X\" and l[i+4]==\"X\" and l[i+8]==\"X\"):\r\n st+=\" 3x4\"\r\n nb+=1\r\n break\r\n for i in range(3):\r\n if(l[i]==\"X\" and l[i+3]==\"X\" and l[i+6]==\"X\" and l[i+9]==\"X\"):\r\n st+=\" 4x3\"\r\n nb+=1\r\n break\r\n for i in range(2):\r\n if(l[i+2]==\"X\" and l[i+4]==\"X\" and l[i+6]==\"X\" and l[i+8]==\"X\" and l[i+10]==\"X\" and l[i]==\"X\"):\r\n nb+=1\r\n st+=\" 6x2\"\r\n print(nb,st)\r\n\r\n\r\n", "n=int(input())\r\nar=[[1,12],[2,6],[3,4],[4,3],[6,2],[12,1]]\r\nfor _ in range(n):\r\n s=str(input())\r\n cou=0\r\n ans=\"\"\r\n skip=False\r\n for it in ar:\r\n a,b=it\r\n skip=False\r\n for j in range(b):\r\n if(skip):\r\n continue\r\n if(s[j]==\"X\"):\r\n if(a==1):\r\n ans+=f\" {a}x{b}\"\r\n cou+=1\r\n skip=True\r\n for i in range(1,a):\r\n if(s[ib + j]!=\"X\"):\r\n break\r\n if(i==(a-1)):\r\n ans+=f\" {a}x{b}\"\r\n cou+=1\r\n skip=True\r\n ans=f\"{cou}\"+ans\r\n print(ans)", "# http://codeforces.com/contest/400/problem/0\r\n# Codeforces : A. Inna and choose options\r\n\r\nliste_a = (1, 2, 3, 4, 6, 12)\r\nliste_results = []\r\n\r\ndef process(essai):\r\n global liste_results\r\n liste_av = [0]\r\n for a in liste_a:\r\n b = 12 // a\r\n for r in range(b):\r\n if essai[r::b] == 'X'a:\r\n liste_av[0] += 1\r\n liste_av.append('{}x{}'.format(a,b))\r\n break\r\n liste_av[0] = str(liste_av[0])\r\n liste_results.append(liste_av)\r\n\r\n\r\n\r\n\r\nt = int(input())\r\nfor k in range(t):\r\n essai = input()\r\n process(essai)\r\n\r\nfor s in liste_results:\r\n print(s)\r\n", "testcases = int(input())\r\nwhile True:\r\n testcases -= 1\r\n if testcases < 0:\r\n break\r\n cards = list(input())\r\n possibilities = [[True, 1, 12], [True, 2, 6], [True, 3, 4], [True, 4, 3], [True, 6, 2], [True, 12, 1]]\r\n possible = 6\r\n for k in range(6):\r\n p = possibilities[k]\r\n ok = [1] * p[2]\r\n for i in range(12):\r\n if cards[i] == 'O':\r\n ok[i % p[2]] = 0\r\n if sum(ok) == 0:\r\n possibilities[k][0] = False\r\n possible -= 1\r\n print(possible, ' ', end='', sep='')\r\n for p in possibilities:\r\n if p[0]:\r\n print(' ', p[1], 'x', p[2], end='', sep='')\r\n print()\r\n\r\n", "def q400a():\n\tn = int(input())\n\tfor i in range(n):\n\t\tq400a_process_case(input())\n\ndef q400a_process_case(case):\n\toutputs = []\n\tif('X' in case):\n\t\toutputs.append('1x12 ')\n\tif(check_one_shape(case, 6)):\n\t\toutputs.append('2x6 ')\n\tif(check_one_shape(case, 4)):\n\t\toutputs.append('3x4 ')\n\tif(check_one_shape(case, 3)):\n\t\toutputs.append('4x3 ')\n\tif(check_one_shape(case, 2)):\n\t\toutputs.append('6x2 ')\n\tif(case == 'XXXXXXXXXXXX'):\n\t\toutputs.append('12x1')\n\tif(len(outputs) == 0):\n\t\tprint(0)\n\telse:\n\t\tstr1 = \"%d \" + \"%s \" * (len(outputs))\n\t\tprint(str1%(len(outputs), outputs))\n\ndef check_one_shape(case, shape):\n\tfor i in range(shape):\n\t\tcorrect = 'X' (12//shape)\n\t\tif(case[int(i):int(12):int(shape)] == correct):\n\t\t\treturn True\n\treturn False\n\nq400a()", "def main():\n res = []\n for _ in range(int(input())):\n l, s = [None], input()\n for b, sig in (12, '1x12'), (6, '2x6'), (4, '3x4'), (3, '4x3'), (2, '6x2'), (1, '12x1'):\n if not all(s[_::b].count('O') for _ in range(b)):\n l.append(sig)\n l[0] = str(len(l) - 1)\n res.append(' '.join(l))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n t = I()\r\n for _ in range(t):\r\n s = S()\r\n c = s.count('X')\r\n res = []\r\n fact = [1,2,3,4,6,12]\r\n if c:\r\n for f in fact:\r\n ff = 12//f\r\n d = defaultdict(int)\r\n for i in range(0, len(s), ff):\r\n row = s[i:i+ff]\r\n for j in range(len(row)):\r\n if row[j]=='X':\r\n d[j]+=1\r\n ma = max(d.values())\r\n if ma >= f:\r\n res.append(str(f)+'x'+str(ff))\r\n print(len(res), res)\r\n\r\nif __name__ == '__main__':\r\n main()", "'''\r\nCreated on 27.4.2016\r\n\r\n@author: Ivan\r\n'''\r\n\r\nimport sys\r\ndef main():\r\n n = int(input())\r\n list = []\r\n for i in range(0, n):\r\n list.append(input())\r\n \r\n for l in list:\r\n rez = []\r\n for i in range(1, 13):\r\n if 12 % i == 0:\r\n a = i \r\n b = 12 // i \r\n parts = [l[k:k + b] for k in range(0, 12, b)]\r\n for k in range(0, b):\r\n flag = True\r\n for p in parts:\r\n if p[k] == 'O':\r\n flag = False\r\n break\r\n if flag:\r\n rez.append(str(a) + \"x\" + str(b))\r\n break\r\n sys.stdout.write(str(len(rez)) + \" \")\r\n for i in rez:\r\n sys.stdout.write(i + \" \")\r\n print()\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "t = int(input())\r\ndividers = [1, 2, 3, 4, 6, 12]\r\nfor test in range(t):\r\n s = input()\r\n ans = []\r\n for k in dividers:\r\n for j in range(12 // k):\r\n cnt = 0\r\n for i in range(k):\r\n if s[i (12 // k) + j] == 'X':\r\n cnt += 1\r\n if cnt == k:\r\n ans.append(str(k) + 'x' + str(12 // k))\r\n break\r\n print(len(ans), ' '.join(map(str, ans)))\r\n", "divisions = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]\n\ndef check(s, a, b):\n\tfor i in range(b):\n\t\tif s[i:: b] == 'X' * a:\n\t\t\treturn True\n\treturn False\n\ndef solve():\n\ts = input()\n\tans = []\n\tfor division in divisions:\n\t\tif check(s, division):\n\t\t\tans.append(str(division[0]) + 'x' + str(division[1]))\n\tprint(len(ans), ' '.join(ans))\n\nt = int(input())\nfor i in range(t):\n\tsolve()\n", "from collections import Counter\r\n\r\ndef solve(twelve):\r\n if \"X\" not in twelve: \r\n return \"0\"\r\n xs = {i for i, c in enumerate(twelve) if c == \"X\"}\r\n sol = ['1x12']\r\n for a in [2,3,4,6,12]:\r\n b = 12 // a\r\n if len(xs) == 12:\r\n sol.append(f'{a}x{b}')\r\n else:\r\n s = [x % b for x in xs]\r\n cn = Counter(s)\r\n if any(v == a for v in cn.values()):\r\n sol.append(f'{a}x{b}')\r\n return f'{len(sol)} ' + \" \".join(sol)\r\n\r\nres = []\r\nfor _ in range(int(input())):\r\n res.append(solve(input()))\r\nprint(\"\\n\".join(str(x) for x in res))", "num = int(input())\r\nstrings = [\"1x12\", \"2x6\", \"3x4\", \"4x3\", \"6x2\", \"12x1\"]\r\n\r\n\r\n# 1x12 2x6 3x4 4x3 6x2 12x1\r\nfor i in range(num):\r\n lista = [0] 6\r\n row = input()\r\n\r\n for j in range(12):\r\n if row[j] == \"X\":\r\n lista[0] = 1\r\n break\r\n \r\n for j in range(6):\r\n if row[j] == row[j+6] == \"X\":\r\n lista[1] = 1\r\n break\r\n \r\n for j in range(4):\r\n if row[j] == \"X\" and row[j+4] == \"X\" and row[j+8] == \"X\":\r\n lista[2] = 1\r\n break\r\n \r\n for j in range(3):\r\n if row[j] == row[j+3] == row[j+6] == row[j+9] == \"X\":\r\n lista[3] = 1\r\n break\r\n \r\n for j in range(2):\r\n if row[j] == row[j+2] == row[j+4] == row[j+6] == row[j+8] == row[j+10] == \"X\":\r\n lista[4] = 1\r\n break\r\n \r\n equalsX = True\r\n for j in range(12):\r\n if row[j] != \"X\":\r\n equalsX = False\r\n if equalsX: lista[5] = 1\r\n\r\n total = 0\r\n saida = \"\"\r\n for j in range(6):\r\n if lista[j]:\r\n total += 1\r\n saida += strings[j] + \" \"\r\n print((str(total) + \" \" + saida).strip())", "for _ in range(int(input())):\r\n cards = input()\r\n count = 0\r\n output = ''\r\n if 'X' in cards:\r\n count += 1\r\n output += ' 1x12'\r\n for q, p in zip(cards[:6], cards[6:]):\r\n if q == p == 'X':\r\n count += 1\r\n output += ' 2x6'\r\n break\r\n for q, p, r in zip(cards[:4], cards[4:8], cards[8:]):\r\n if q == p == r == 'X':\r\n count += 1\r\n output += ' 3x4'\r\n break\r\n for q, p, r, s in zip(cards[:3], cards[3:6], cards[6:9], cards[9:]):\r\n if q == p == r == s == 'X':\r\n count += 1\r\n output += ' 4x3'\r\n break\r\n for q, p, r, s, t, u in zip(cards[:2], cards[2:4], cards[4:6], cards[6:8], cards[8:10], cards[10:]):\r\n if q == p == r == s == t == u == 'X':\r\n count += 1\r\n output += ' 6x2'\r\n break\r\n if 'O' not in cards:\r\n count += 1\r\n output += ' 12x1'\r\n print(str(count) + output)", "\nfor _ in range(int(input())):\n s=input().strip()\n sol=[]\n l=[1, 2, 3, 4, 6, 12]\n for i in l:\n for j in range(0, i):\n if set(s[j::i])==set('X'):\n sol.append((12/i, i))\n break;\n sol.sort()\n if len(sol)>0:\n print(len(sol), end=\" \")\n for x in sol:\n print(\"%dx%d\"%(x[0], x[1]), sep=\" \", end=\" \")\n else:\n print(0, end='')\n print()", "t = int(input())\nfor _ in range(t):\n s = input()\n res, n = [], len(s)\n for a in [1, 2, 3, 4, 6, 12]:\n b = 12 // a\n for i in range(b):\n if all(s[j] == \"X\" for j in range(i, n, b)):\n res.append(f\"{a}x{b}\")\n break\n if res:\n print(len(res), res)\n else:\n print(\"0\")\n", "factors = [12, 6, 4, 3, 2, 1]\r\nn = int(input())\r\nchoices = []\r\nfor x in range(n):\r\n s = input()\r\n numbers = []\r\n for y in factors:\r\n rows = []\r\n for x in range(0, 12, y):\r\n rows.append(list(s[x:x + y]))\r\n columns = [[p[q] for p in rows] for q in range(y)]\r\n row = [\"X\" for p in range(12 // y)]\r\n if row in columns:\r\n numbers.append(y)\r\n choices.append(numbers)\r\nfor x in choices:\r\n print(len(x), end = \" \")\r\n for y in x:\r\n print(\"%dx%d\" % (12 // y, y), end = \" \")\r\n print()", "def mat_maker(b, row):\r\n mat = []\r\n col = []\r\n for idx, val in enumerate(row):\r\n col.append(val)\r\n if (idx + 1) % b == 0:\r\n mat.append(col)\r\n col = []\r\n\r\n return col_checker(mat, b)\r\n \r\ndef col_checker(mat, b):\r\n col = []\r\n ans = False\r\n a = 12 // b\r\n for i in range(b):\r\n col = []\r\n for j in range(a):\r\n col.append(mat[j][i])\r\n if set(col) == {'X'}:\r\n ans = True\r\n break\r\n return ans\r\n\r\nn = int(input())\r\nmatrix = []\r\nfor _ in range(n):\r\n tmp = list(input())\r\n matrix.append(tmp)\r\n\r\nbs = [12, 6, 4, 3, 2, 1]\r\n\r\nfor row in matrix:\r\n ans = []\r\n for b in bs:\r\n ok = mat_maker(b, row)\r\n if ok:\r\n ans.append(f\"{12//b}x{b}\")\r\n ans.insert(0, len(ans))\r\n print(ans)\r\n ans = []\r\n", "def f(x):\r\n return str(12//x)+'x'+str(x)\r\n\r\n\r\na=[12,6,4,3,2,1]\r\nt=int(input())\r\nfor i in range(t):\r\n ans=[]\r\n s=input()\r\n for y in a:\r\n for j in range(y):\r\n if s[j::y].count('X') == 12//y:\r\n ans += [y]\r\n break\r\n print(len(ans), ' '.join(list(map(f, ans))))", "t = int(input())\r\nc = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]\r\nfor i in range(t):\r\n xo = list(input())\r\n\r\n d = []\r\n b = xo.count('X')\r\n if b > 0:\r\n d.append(c[0])\r\n\r\n for j in c[1:5]:\r\n for x in range(j[1]):\r\n yes = True\r\n for k in range(j[0]):\r\n if xo[k * j[1] + x] != 'X':\r\n yes = False\r\n break\r\n if yes:\r\n d.append(j)\r\n break\r\n\r\n if b == 12:\r\n d.append(c[5])\r\n\r\n print(len(d), end=\" \")\r\n for j in d:\r\n print(str(j[0]) + 'x' + str(j[1]), end=\" \")\r\n print()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n s = input()[:-1]\r\n d = []\r\n l = [1,2,3,4,6,12]\r\n for j in l:\r\n k = 12//j\r\n for i in range(k):\r\n if s[i::k] == 'X' * j:\r\n d += [str(j)+'x'+str(k)]\r\n break\r\n print(len(d), ' '.join(d))", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nimport datetime as dt\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n N = lambda: int(input())\r\n\r\n t = N()\r\n a, r = [1, 2, 3, 4, 6, 12], list()\r\n\r\n while t > 0:\r\n s = input()\r\n for i in a:\r\n for j in range(12//i):\r\n if s[j::12//i].count(\"X\") == i:\r\n r.append(\"%sx%s\" % (i, 12//i))\r\n break\r\n print(len(r), r)\r\n r.clear()\r\n t -= 1", "memo = [1, 2, 3, 4, 6, 12]\r\n\r\nfor _ in range(int(input())):\r\n data = list(input())\r\n \r\n ans = []\r\n for i in memo:\r\n for j in range(12 // i):\r\n flag = True\r\n for k in range(j, 12, 12 // i):\r\n if data[k] != 'X':\r\n flag = False\r\n if flag:\r\n ans.append(i)\r\n break\r\n\r\n print(len(ans), end=' ')\r\n if len(ans) != 0:\r\n for i in ans:\r\n print(str(i) + 'x' + str(12 // i), end=' ')\r\n\r\n print()", "n = int(input())\r\np = 0\r\nf = True\r\nfor k in range(n):\r\n s = input().strip()\r\n ot = set()\r\n for i in range(1, 13):\r\n if i == 5 or i == 7 or i == 9 or i == 10 or i == 11 or i == 8:\r\n continue\r\n for t in range(i):\r\n p = True\r\n for j in range(t, 12, i):\r\n if s[j] == 'O':\r\n p = False\r\n if p:\r\n ot.add(i)\r\n ot = list(reversed(sorted(list(ot))))\r\n print(len(ot), end = ' ')\r\n for i in ot:\r\n print(str(12//i)+'x'+str(i), end = ' ')\r\n print()", "from functools import reduce\r\n\r\ndef sol(l):\r\n if not \"X\" in l: return \"0\"\r\n l = l.replace(\"O\",\"0\").replace(\"X\",\"1\")\r\n res = [ \"%ix%i\" % (12//i, i) for i in (12,6,4,3,2,1) if reduce(lambda x, y: x&y, [int(l[ij:ij+i],2) for j in range(12//i)], -1)]\r\n return (\"%i %s\" % (len(res), \" \".join(res)))\r\n\r\nn = int(input())\r\nprint(\"\\n\".join([sol(input()) for i in range(n)]))", "t=int(input())\r\nfor _ in range(t):\r\n s=input()\r\n l=[]\r\n m1=[str(i) for i in s]\r\n m2=[s[0]+s[6],s[1]+s[7],s[2]+s[8],s[3]+s[9],s[4]+s[10],s[5]+s[11]]\r\n m4=[s[0]+s[3]+s[6]+s[9],s[1]+s[4]+s[7]+s[10],s[2]+s[5]+s[8]+s[11]]\r\n m3=[s[0]+s[4]+s[8],s[1]+s[5]+s[9],s[2]+s[6]+s[10],s[3]+s[7]+s[11]]\r\n m5=[s[0]+s[2]+s[4]+s[6]+s[8]+s[10],s[1]+s[3]+s[5]+s[7]+s[9]+s[11]]\r\n m6=[s[0]+s[1]+s[2]+s[3]+s[4]+s[5]+s[6]+s[7]+s[8]+s[9]+s[10]+s[11]]\r\n if \"X\"1 in m1:\r\n l.append(\"1x12\")\r\n if \"X\"2 in m2:\r\n l.append(\"2x6\")\r\n if \"X\"3 in m3:\r\n l.append(\"3x4\")\r\n if \"X\"4 in m4:\r\n l.append(\"4x3\")\r\n if \"X\"6 in m5:\r\n l.append(\"6x2\")\r\n if \"X\"12 in m6:\r\n l.append(\"12x1\")\r\n print(len(l),end=\" \")\r\n print(l)\r\n \r\n \r\n\r\n\r\n", "def isMatch(n,s):\n x = 12//n\n res = []\n for i in range(0,len(s),x):\n res.append(s[i:i+x])\n for col in range(x):\n for row in range(len(res)):\n if res[row][col] != 'X':\n break\n elif res[row][col] == 'X' and row == len(res)-1 :\n return True \n return False\n\ndef solve(s):\n res = []\n if 'X' in s:\n res.append(\"1x12\")\n for i in [2,3,4,6]:\n if isMatch(i,s):\n res.append(f'{i}x{12//i}')\n if s == 12'X':\n res.append(\"12x1\")\n \n print(len(res),sep=\" \",end=\" \")\n print(res) \n \n\n\ndef main() :\n # n,k = list(map(int, input().split(' ')))\n n = int(input())\n # arr = input().split(' ')\n # s = input()\n # res=''\n arr = []\n for _ in range(n):\n i = input()\n arr.append(i)\n \n for i in arr:\n solve(i)\n\nmain()\n", "t = int(input())\r\nn = 12\r\nwhile t > 0:\r\n ans = []\r\n t = t - 1\r\n s = input()\r\n for i in range(n):\r\n r = i+1\r\n if n%r != 0:\r\n continue\r\n c = n//r\r\n flag = False\r\n for j in range(c):\r\n id = j\r\n ff = False\r\n while id < n:\r\n if s[id] != 'X':\r\n ff = True\r\n break\r\n id = id + c\r\n if ff == False:\r\n flag = True\r\n break\r\n if flag == True:\r\n ans.append((r, c))\r\n\r\n print(len(ans), end = '')\r\n for i in range(len(ans)):\r\n print(' ', ans[i][0], 'x', ans[i][1], sep = '', end = '')\r\n print('')\r\n", "def ok(s , a , b):\r\n mat = []\r\n for i in range(0 , len(s) , b):\r\n mat.append(s[i:i+b])\r\n\r\n for j in range(b):\r\n c = 0\r\n for i in range(a):\r\n if mat[i][j] == 'O': c+=1\r\n if not c: return True\r\n\r\n return False\r\n\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n x = s.count('X')\r\n pos =[[1 , 12] , [2 , 6] , [3 , 4] , [4 , 3] , [6 , 2] , [12 ,1]]\r\n\r\n ans = 0\r\n for i,j in pos:\r\n if(ok(s , i , j)): ans+=1\r\n\r\n print(ans , end = \" \")\r\n\r\n for i,j in pos:\r\n if(ok(s , i , j)): print(f\"{i}x{j}\" ,end = \" \")\r\n\r\n print()", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n t = int(input())\r\n cards = [input() for i in range(t)]\r\n a = [1, 2, 3, 4, 6, 12]\r\n b = [12 // a[i] for i in range(len(a))]\r\n for card in cards:\r\n bools = [False for i in range(len(a))]\r\n index_collector = []\r\n for j in range(len(card)):\r\n if card[j] == \"X\":\r\n index_collector.append(j + 1)\r\n for ind in range(len(a)):\r\n a_i = a[ind]\r\n hash = [0 for f in range(b[ind])]\r\n for i in index_collector:\r\n hash[i % b[ind]] += 1\r\n if max(hash) >= a[ind]:\r\n bools[ind] = True\r\n counter = 0\r\n for i in bools:\r\n if i:\r\n counter += 1\r\n output =[str(counter)] + [str(a[i]) + \"x\" + str(b[i]) for i in range(len(a)) if bools[i]]\r\n print(\" \".join(output))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "def is_possible(request, a):\n b = 12 // a\n\n for i in range(b):\n if 'O' not in [request[i + j * b] for j in range(a)]:\n return True\n\n return False\n\n\ndef solve(request):\n possible_ways = [1, 2, 3, 4, 6, 12]\n\n count_ways = 0\n ways = []\n\n for i in possible_ways:\n if is_possible(request, i):\n count_ways += 1\n ways += ['%dx%d' % (i, 12 // i)]\n\n ways = [str(count_ways)] + ways\n\n return ' '.join(ways)\n\n\ndef main():\n n = int(input())\n\n for _ in range(n):\n print(solve(input()))\n\n\nif __name__ == '__main__':\n main()\n", "t=eval(input())\r\nc=1\r\nwhile (c<=t):\r\n a=str(input())\r\n if(a==\"XXXXXXXXXXXX\"):\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n elif(a==\"OOOOOOOOOOOO\"):\r\n print (0)\r\n else:\r\n s=[\"1x12\"]\r\n i=0\r\n while (i<6):\r\n if (a[i]==\"X\") and (a[i+6]==\"X\"):\r\n s=s+[\"2x6\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<4):\r\n if (a[i]==\"X\") and (a[i+4]==\"X\") and (a[i+8]==\"X\"):\r\n s=s+[\"3x4\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<3):\r\n if (a[i]==\"X\") and (a[i+3]==\"X\")and(a[i+6]==\"X\")and(a[i+9]==\"X\"):\r\n s=s+[\"4x3\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<2):\r\n if (a[i]==\"X\")and(a[i+2]==\"X\")and(a[i+4]==\"X\")and(a[i+6]==\"X\")and(a[i+8]==\"X\")and(a[i+10]==\"X\"):\r\n s=s+[\"6x2\"]\r\n break\r\n i+=1\r\n \r\n \r\n print (len(s),\" \".join(map(str,s)))\r\n c+=1", "t = int(input().strip())\r\nfor i in range(t):\r\n s = input()\r\n ans = []\r\n for h in [x for x in range(1, 13) if 12 % x == 0]:\r\n good = False\r\n w = 12 // h\r\n for k in range(w):\r\n ok = True\r\n for l in range(h):\r\n if s[l * w + k] != 'X':\r\n ok = False\r\n if ok:\r\n good = True\r\n if good:\r\n ans.append(str(h) + \"x\" + str(w))\r\n print(str(len(ans)) + \" \" + \" \".join(ans))", "for _ in range(int(input())):\r\n\ts=input()\r\n\tn=len(s)\r\n\tans=[]\r\n\td=[1,2,3,4,6,12]\r\n\tfor item in d:\r\n\t\tz=12//item\r\n\t\tfor i in range(z):\r\n\t\t\tif s[i::z]=='X'item:\r\n\t\t\t\tans.append((item,z))\r\n\t\t\t\tbreak\r\n\tprint(len(ans),end=' ')\r\n\tans.sort()\r\n\tfor item in ans:\r\n\t\tprint(f'{item[0]}x{item[1]}',end=' ')\r\n\tprint()", "def test(s):\r\n res = []\r\n for i in [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]:\r\n a = [[\"O\" for i in range(i[1])] for j in range(i[0])]\r\n for j in range(i[0]):\r\n for k in range(i[1]):\r\n a[j][k] = s[j i[1] + k]\r\n if check(a):\r\n res.append(i)\r\n return res\r\n\r\ndef check(a):\r\n for i in range(len(a[0])):\r\n if not \"O\" in [a[j][i] for j in range(len(a))]:\r\n return True\r\n return False\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n s = input().strip()\r\n x = test(s)\r\n print(len(x), end=\" \")\r\n for j in x:\r\n print(j[0], \"x\", j[1], sep=\"\", end=\" \")\r\n print()\r\n", "for _ in range(int(input())):\r\n s = input()\r\n A = [str(a)+'x'+str(12//a) for a in (1,2,3,4,6,12)\r\n if any(s[i::12//a]=='X'a for i in range(12//a))]\r\n print(len(A), A)", "def solve(c, n=12):\r\n r = set()\r\n for i in [1, 2, 3, 4, 6, 12]:\r\n win = False\r\n j = 12 // i\r\n for n in range(j):\r\n col = True\r\n for k in range(n, 12, j):\r\n col = col and c[k]\r\n win = win or col\r\n if win:\r\n r.add(i)\r\n\r\n return str(len(r)) + \" \" + \" \".join([str(i)+\"x\"+str(12//i) for i in r])\r\n\r\nif __name__ == \"__main__\":\r\n for _ in range(int(input())):\r\n board = [v == \"X\" for v in input()]\r\n print(solve(board, 12))", "# cook your dish here\r\nfor _ in range(int(input())):\r\n s=input()\r\n l=[]\r\n for i in range(1,13):\r\n if 12%i==0:\r\n for j in range(0,12):\r\n if s[j::12//i]=='X'i:\r\n l.append(str(i)+'x'+str(12//i))\r\n break\r\n \r\n print(len(l),\" \".join(l))", "for i in range(int(input())):\r\n s = input()\r\n count = s.count('X')\r\n if count == 0:\r\n print(0)\r\n elif count == 12:\r\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\r\n else:\r\n lst = []\r\n if count >= 6:\r\n for i in range(2):\r\n if s[i] == s[i+2] == s[i+4] == s[i+6] == s[i+8] == s[i+10] == 'X':\r\n lst.append( '6x2' )\r\n break\r\n if count >= 4:\r\n for i in range(3):\r\n if s[i] == s[i+3] == s[i+6] == s[i+9] == 'X':\r\n lst.append( '4x3' )\r\n break\r\n if count >= 3:\r\n for i in range(4):\r\n if s[i] == s[i+4] == s[i+8] == 'X':\r\n lst.append('3x4')\r\n break\r\n if count >= 2:\r\n for i in range(6):\r\n if s[i] == s[i+6] == 'X':\r\n lst.append('2x6')\r\n break\r\n if count >= 1:\r\n lst.append( '1x12' )\r\n \r\n lst.sort()\r\n print(str(len(lst)) + ' ' + ' '.join(lst))", "\r\nn = int(input())\r\n\r\n\r\nfor _ in range(n):\r\n mystr = input()\r\n answer = []\r\n \r\n divisibles = [1,2,3,4,6,12]\r\n for i in divisibles:\r\n flag=0\r\n \r\n for j in range(0,12//i):\r\n columnSet = set(mystr[j::12//i])\r\n if len(columnSet)==1 and \"X\" in columnSet:\r\n flag=1\r\n break\r\n\r\n if flag==1:\r\n answer.append(\"{}x{}\".format(i,12//i));\r\n print(len(answer), \" \".join(answer))", "t=int(input())\r\nfor _ in range(t):\r\n\ts=input()\r\n\ta1=[1,2,3,4,6,12]\r\n\tans=[]\r\n\tfor a in a1:\r\n\t\tb=int(12/a)\r\n\t\tfor i in range(b):\r\n\t\t\tflag=True\r\n\t\t\tfor j in range(a):\r\n\t\t\t\tif s[bj + i]!='X':\r\n\t\t\t\t\tflag=False\r\n\t\t\tif flag==True:\r\n\t\t\t\tans.append(a)\r\n\t\t\t\tbreak\r\n\tprint(len(ans),end=\" \")\r\n\tfor i in ans:\r\n\t\ts=str(i)+'x'+str(int(12/i))\r\n\t\tprint(s,end=\" \")\r\n\tprint()\r\n\r\n\r\n", "t = int(input())\nfor _ in range(t):\n s = input().strip()\n S = [a == 'X' for a in s]\n ans = []\n if s == 'O'12:\n print(0)\n elif s == 'X'12:\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\n else:\n ans.append('1x12')\n s1 = [S[6i] for i in range(0,2)]\n s2 = [S[6i+1] for i in range(0,2)]\n s3 = [S[6i+2] for i in range(0,2)]\n s4 = [S[6i+3] for i in range(0,2)]\n s5 = [S[6i+4] for i in range(0,2)]\n s6 = [S[6i+5] for i in range(0,2)]\n d2 = any([all(s1),all(s2),all(s3),all(s4),all(s5),all(s6)])\n if d2:\n ans.append('2x6')\n s1 = [S[4i] for i in range(0,3)]\n s2 = [S[4i+1] for i in range(0,3)]\n s3 = [S[4i+2] for i in range(0,3)]\n s4 = [S[4i+3] for i in range(0,3)]\n d3 = any([all(s1),all(s2),all(s3),all(s4)])\n if d3:\n ans.append('3x4')\n if d2:\n s1 = [S[3i] for i in range(0,4)]\n s2 = [S[3i+1] for i in range(0,4)]\n s3 = [S[3i+2] for i in range(0,4)]\n d4 = any([all(s1),all(s2),all(s3)])\n if d4:\n ans.append('4x3')\n if d3:\n s1 = [S[2i] for i in range(0,6)]\n s2 = [S[2*i+1] for i in range(0,6)]\n d6 = any([all(s1),all(s2)])\n if d6:\n ans.append('6x2')\n print('{} {}'.format(len(ans),' '.join(ans)))\n" ]	{"inputs": ["4\nOXXXOXOOXOOX\nOXOXOXOXOXOX\nXXXXXXXXXXXX\nOOOOOOOOOOOO", "2\nOOOOOOOOOOOO\nXXXXXXXXXXXX", "13\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX"], "outputs": ["3 1x12 2x6 4x3\n4 1x12 2x6 3x4 6x2\n6 1x12 2x6 3x4 4x3 6x2 12x1\n0", "0\n6 1x12 2x6 3x4 4x3 6x2 12x1", "6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1"]}	UNKNOWN	PYTHON3	CODEFORCES	92
d3cc84d8a4738925b046a983cf21b4b1	Left-handers, Right-handers and Ambidexters	You are at a water bowling training. There are l people who play with their left hand, r people, who play with their right hand, and a ambidexters, who can play with left or right hand. The coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands. Ambidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand. Please find the maximum possible size of the team, where equal number of players use their left and right hands, respectively. The only line contains three integers l, r and a (0<=≤<=l,<=r,<=a<=≤<=100) — the number of left-handers, the number of right-handers and the number of ambidexters at the training. Print a single even integer — the maximum number of players in the team. It is possible that the team can only have zero number of players. Sample Input 1 4 2 5 5 5 0 2 0 Sample Output 6 14 0	[ "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nl,r,a = li()\r\n\r\nif max(l,r) - min(l,r) > a:\r\n print((min(l,r)+a) * 2)\r\nelse:\r\n print((max(l,r) + (a - (max(l,r) - min(l,r))) // 2) * 2)", "l, r, a = map(int, input().split())\n\nif min(l,r)+a <= max(l, r):\n\tprint(2 * (min(l,r)+a))\nelif l == r == a or l == r and a == 0:\n\tif sum([l,r,a]) % 2 == 0:\n\t\tprint(sum([l,r,a]))\n\telse:\n\t\tprint(sum([l,r,a])-1)\nelif min(l, r) == 0 and a == 0:\n\tprint(0)\nelse:\n\tif sum([l,r,a]) % 2 == 0:\n\t\tprint(sum([l,r,a]))\n\telse:\n\t\tprint(sum([l,r,a])-1)", "l, r, a = [int(s) for s in input().split(\" \")]\r\nif l > r:\r\n l, r = r, l\r\nans = 0\r\nif l+a <= r:\r\n ans += (l+a)2\r\nelse:\r\n ans += r2\r\n ans += ((l+a-r)//2)2\r\nprint(ans)", "w = list(map(int,input().split()))\r\nl = w[0]\r\nr =w[1]\r\na = w[2]\r\n\r\nwhile a >1:\r\n if (l==r) and a !=1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n elif l>r:\r\n r +=1\r\n a -=1\r\n elif r >l:\r\n l+=1\r\n a-=1\r\nif a ==1:\r\n if l>r:\r\n r+=1\r\n else:\r\n l+=1\r\nif l ==r:\r\n print(l+r)\r\nelif l<r:\r\n print(l2)\r\nelse:\r\n print(r2)\r\n", "l,r,a=map(int, input().split())\r\n\r\nwhile (a!=0):\r\n if(r>l):\r\n l=l+1\r\n a=a-1\r\n elif(l>r):\r\n r=r+1\r\n a=a-1\r\n else:\r\n a=a-1\r\n l=l+1\r\n\r\nl=min(l,r)\r\nr=l\r\nprint (l+r)", "inp = list(map(int,input().split()))\r\nl=inp[0]\r\nr=inp[1]\r\na=inp[2]\r\nif(l==r):\r\n print (2(l+a//2))\r\nelif(l<r):\r\n if(r-l<=a):\r\n a=a-(r-l)\r\n l=r\r\n print (2(l+a//2))\r\n else:\r\n l=l+a\r\n print (2min(r,l))\r\nelse:\r\n if(l-r<=a):\r\n a=a-(l-r)\r\n r=l\r\n print (2(l+a//2))\r\n else:\r\n r=r+a\r\n print (2min(r,l))\r\n \r\n ", "left, right, ambi=map(int, input().split())\r\n\r\nif left!=right:\r\n\tif left<right:\r\n\t\tl=left+ambi\r\n\t\tif l>right:\r\n\t\t\td=left-right\r\n\t\t\tright+=d\r\n\t\t\tambi-=d\r\n\t\t\tprint(2(left+(ambi//2)))\r\n\t\telse:\r\n\t\t\tprint(2l)\r\n\telse:\r\n\t\tr=right+ambi\r\n\t\tif r>left:\r\n\t\t\td=right-left\r\n\t\t\tleft+=d\r\n\t\t\tambi-=d\r\n\t\t\tprint(2(right+(ambi//2)))\r\n\t\telse:\r\n\t\t\tprint(2r)\r\nelse:\r\n\tleft+=(ambi//2);right+=(ambi//2)\r\n\tprint(left+right)", "l, r, a = map(int, input().split())\r\n\r\nprint(2 * min(l + a, r + a, (l + r + a) // 2))", "a,b,c=map(int,input().split())\r\n\r\nif(a>b):\r\n a,b=b,a\r\n\r\nd=a+c\r\nif(d>b):\r\n e=(d-b)\r\n b+=e//2\r\n\r\nelif(d<b):\r\n b=d\r\n\r\nprint(2b)\r\n", "l,r,a=map(int,input().split())\r\nif(l<r):\r\n x=r-l\r\n if(x<=a):\r\n l=r\r\n a-=x\r\n else:\r\n l=l+a\r\n a=0\r\nelse:\r\n x=l-r\r\n if(x<=a):\r\n r=l\r\n a-=x\r\n else:\r\n r=r+a\r\n a=0\r\nprint(2(min(l,r)+a//2))", "l,r,a=map(int,input().split())\r\nif l<r:l,r=r,l\r\nif a<=l-r:print(2(r+a))\r\nelse:\r\n a-=l-r\r\n print(2l+a//22)\r\n", "# from dust i have come dust i will be\n\nl,r,a=map(int,input().split())\n\nmx=0\nfor i in range(a+1):\n tl=l+i\n tr=r+a-i\n\n mx=max(mx,min(tl,tr)2)\n\nprint(mx)\n", "l,r,a=map(int,input().split())\r\nif l==0 and a<r or r==0 and a<l:\r\n print(0)\r\nelif l==r:\r\n print(l+r+( a if(a%2==0)else a-1))\r\nelif l<r:\r\n if l+a==r:\r\n print(r2)\r\n elif l+a>r:\r\n scale=r-l\r\n a-=abs(scale)\r\n print((r+(a//2))2)\r\n else:\r\n print((l+a)2)\r\nelse:\r\n if r+a==l:\r\n print(l2)\r\n elif r+a>l:\r\n scale=l-r\r\n a-=abs(scale)\r\n print((l+(a//2))2)\r\n else:\r\n print((r+a)2)", "l,r,a = map(int, input().split())\r\n\r\nif (a == 0 and l == 0) or (a == 0 and r == 0):\r\n print(0)\r\nelse:\r\n lim_fac = min(l,r)\r\n \r\n t = lim_fac2\r\n \r\n l = l -lim_fac\r\n r = r - lim_fac\r\n \r\n if r > l :\r\n if a < r:\r\n t += (2a)\r\n print(t)\r\n else:\r\n t += (2r)\r\n a -= (r)\r\n if a % 2 == 0:\r\n t += a\r\n print(t)\r\n else:\r\n t += (a-1)\r\n print(t)\r\n else:\r\n if a < l:\r\n t += (2a)\r\n print(t)\r\n else:\r\n t += (2l)\r\n a -= (l)\r\n if a % 2 == 0:\r\n t += a\r\n print(t)\r\n else:\r\n t += (a-1)\r\n print(t)\r\n", "l,r,a= map(int,input().split())\r\nmn = min(l,r)\r\nmx = max(l,r)\r\nif(l== 0 and a == 0 ) or (r==0 and a ==0):print(0)\r\nelif mx != mn :\r\n if(mn+a<=mx):print(2(mn+a))\r\n else:\r\n rm = (mn+a)-mx\r\n if(rm%2):print(2mx+rm-1)\r\n else:print(2mx+rm)\r\nelse: \r\n if(l+a+r)%2:print((l+a+r)-1)\r\n else:print((l+a+r))\r\n \r\n", "l, r, a = [int(i) for i in input().split()]\r\nif (l > r):\r\n l, r = r, l\r\nwhile (a > 0 and (l < r or r == l)):\r\n a -= 1\r\n l += 1\r\n if (l > r):\r\n l, r = r, l\r\nprint(2 * min(l, r))", "l, r, a = map(int, input().split())\r\nfor i in range(a):\r\n if l > r:\r\n r += 1\r\n else:\r\n l += 1\r\nprint(2 * min(r, l))\r\n", "l,r,a=map(int,input().split())\r\ns=((min(l,r)+min(abs(l-r),a))+(max(0,a-min(abs(l-r),a))//2))2\r\nprint(s)", "l, r, b = map(int ,input().split())\r\nif(r > l):\r\n a = min(b, r-l)\r\n l += a;b -= a\r\nelif(l > r):\r\n a = min(b, l-r)\r\n r += a;b -= a\r\nif (b%2):\r\n l += (b//2)\r\n r += (b//2 + 1)\r\nelse:\r\n l += (b//2)\r\n r += (b//2)\r\nprint(min(l, r)2)", "a,b,c=map(int,input().split())\r\nif a==b==c:\r\n\tprint(2a+(c//2)2)\r\nelif a>b:\r\n\tif b+c==a:\r\n\t\tprint(a+b+c)\r\n\telif b+c>a:\r\n\t\tprint(2a+((b+c-a)//2)2)\r\n\telse:\r\n\t\tprint((b+c)2)\r\nelse:\r\n\tif a+c==b:\r\n\t\tprint(a+b+c)\r\n\telif a+c>b:\r\n\t\tprint(2b+((a+c-b)//2)2)\r\n\telse:\r\n\t\tprint((a+c)2)", "import math\r\n\r\nl,r,a = map(int,input().split())\r\nwhile a>0:\r\n if a==1 and l==r:\r\n break\r\n elif l<r:\r\n l+=1\r\n a-=1\r\n elif l>r:\r\n r+=1\r\n a-=1\r\n else:\r\n l+=1\r\n r+=1\r\n a-=2\r\nprint(2min(l,r))", "[left, right, ambi] = map(int, input().split())\r\nif left+ambi <= right:\r\n print((left+ambi)2)\r\nelif right+ambi <= left:\r\n print((right+ambi)2)\r\nelse:\r\n print((left+right+ambi)//22)\r\n", "# Left-handers, Right-handers and Ambidexters\r\nl,r,a = map(int,input().split())\r\nif r-l>=a:\r\n ans = 2(l+a)\r\nelif l-r>=a:\r\n ans = 2(r+a)\r\nelse:\r\n if (l+r+a)%2==0:\r\n ans = l+r+a\r\n else:\r\n ans = l+r+a-1\r\nprint(ans)", "def team(l,r,a):\r\n\tfor i in range(l,-1,-1):\r\n\t\tfor j in range(r,-1,-1):\r\n\t\t\tfor k in range(a,-1,-1):\r\n\t\t\t\tfor p in range(a,-1,-1):\r\n\t\t\t\t\tif(k+p<=a and i+k==j+p):\r\n\t\t\t\t\t\treturn i+j+k+p\r\n\r\n\t\t\r\n\r\nL=list(map(int,input().split()))\r\nl=L[0]\r\nr=L[1]\r\na=L[2]\r\nprint(team(l,r,a))", "import math\r\nhand = [int(x) for x in input().split()]\r\nleft = hand[0]; right = hand[1]; ambd = hand[2]\r\nif(left<right):\r\n\twhile left!=right and ambd:\r\n\t\tleft = left+1\r\n\t\tambd = ambd -1\r\nelse:\r\n\twhile left!=right and ambd:\r\n\t\tright = right+1\r\n\t\tambd = ambd -1\r\nleft = right = min(left, right)\r\nif ambd>1:\r\n\tright = right +math.floor(ambd/2)\r\n\tleft = left +math.floor(ambd/2)\r\nif right!=left:\r\n\tprint(0)\r\nelse:\r\n\tprint(right+left)", "l,r,a = map(int,input().split())\r\nmin1 = min(l,r)\r\nmax1 = max(l,r)\r\ndiff = max1 - min1\r\nif diff == 0:\r\n min1 += a // 2\r\n max1 += a // 2\r\nelse:\r\n if a >= diff:\r\n min1 += diff\r\n a -= diff\r\n min1 += a // 2\r\n max1 += a // 2\r\n else:\r\n min1 += a\r\nprint(2 * min1)\r\n", "l,r,a=map(int,input().split())\r\nif (l==0 and a==0) or (r==0 and a==0):\r\n print(0)\r\nelif l+a<r:\r\n print((l+a)2)\r\nelif r+a<l:\r\n print((r+a)2)\r\nelse:\r\n print(2((l+r+a)//2))", "def main():\n line = input()\n l, r, a = line.split(' ')\n l = int(l)\n r = int(r)\n a = int(a)\n _max = max(l, r)\n _min = min(l, r)\n diff = _max - _min\n\n if diff == 0:\n print((l + a // 2) 2)\n elif diff <= a:\n print((_max * 2) + (a - diff) // 2 * 2)\n else:\n print((_min + a) * 2)\n\n\nif __name__ == '__main__':\n main()\n\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t\t\t\t \t", "left, right, ambi = map(int, input().split())\r\nfor i in range(ambi):\r\n if (left>right):\r\n right += 1\r\n else:\r\n left += 1\r\nprint(2(min(left,right)))", "def f():\r\n l,r,a=map(int,input().split())\r\n e=0\r\n if l==r:\r\n a=(a//2)2\r\n e=l+r+a\r\n elif l<r:\r\n if a>=r-l:\r\n a=a-(r-l)\r\n a=(a//2)2\r\n e=2r+a\r\n else:\r\n e=2(l+a)\r\n else:\r\n r,l=l,r\r\n if a>=r-l:\r\n a=a-(r-l)\r\n a=(a//2)2\r\n e=2r+a\r\n else:\r\n e=2(l+a)\r\n\r\n print(e)\r\n return\r\n\r\nt=1\r\nwhile t:\r\n f()\r\n t-=1\r\n \r\n \r\n", "\r\n\r\ndef solve(l,r,a):\r\n while a>0:\r\n if l<r:\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\n return min([l,r])2\r\n\r\ndef main():\r\n lra = input().split()\r\n print(solve(int(lra[0]),int(lra[1]),int(lra[2])))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l,r,a = map(int, input().split())\r\nc = 0\r\nleft = 0\r\nif l < r:\r\n c = c + 2l\r\n r = r - l\r\n left = r\r\nelse:\r\n c = c + 2r\r\n l = l - r\r\n left = l\r\nif a >= left:\r\n c = c + 2left\r\n a = a - left\r\n left = 0\r\nelse:\r\n c = c + 2a\r\n left = left - a\r\n a = 0\r\nif a > 0:\r\n c = c + 2(a//2)\r\nprint(c)", "[l,r,a]=map(int,input().split())\nif l + a < r:\n print(2 * (l + a))\nelif r + a < l :\n print (2 * (r + a))\nelse:\n print (((l+r+a)//2)2)\n\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nl, r, a = map(int, input().split())\r\n\r\ntmp = a - abs(l - r)\r\nans = tmp // 2 + max(l, r) if tmp >= 0 else min(l, r) + a\r\n\r\nprint(ans 2)", "l, r, a = map(int, input().split())\r\n\r\nl, r = min(l,r), max(l,r)\r\nprint(2(l + min(a, r-l) + ((a-min(a, r-l))//2 if a != min(a, r-l) else 0)))", "l,r,a=map(int,input().split())\r\nx=min(l,r)\r\ny=(l+r-x)-x\r\nz=min(y,a)\r\np=(a-z)//2\r\nans=2x+2z+2p\r\nprint(ans)", "a, b, c = map(int, input().split())\r\nmina = min(a,b)\r\nmaxb = max(a,b)\r\n\r\nif(mina + c <= maxb):\r\n print((mina + c)2)\r\nelse:\r\n print((a+b+c)//2 2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l,r,a = map(int,input().split())\r\nx = min(l,r) + a\r\nif x>=max(l,r):\r\n\tif (l+a+r) % 2==0:\r\n\t\tprint(l+a+r) \r\n\telse:\r\n\t\tprint(l+a+r-1)\r\nelse:\r\n\tprint(x2)", "l, r, a = [int(a) for a in input().strip().split(' ')]\r\no = a\r\nif l > r:\r\n o -= min(a,l-r)\r\n r += min(a,l-r)\r\nif r > l:\r\n o -= min(a,r-l)\r\n l += min(a,r-l)\r\nr += (o // 2)\r\nl += (o // 2)\r\nprint(2 min(r,l))", "a,b,c = map(int, input().split())\nd = min(abs(a-b),c)\nc -= d\nprint((min(a,b) + d)2 + c//22)\n", "l, r, a = map(int, input().split())\r\nif l > r and a >= l - r:\r\n a -= l - r\r\n r = l\r\nelif l > r and a < l - r:\r\n r += a\r\n l = r\r\n print(l + r)\r\n exit()\r\nelif l < r and a >= r - l:\r\n a -= r - l\r\n l = r\r\nelif l < r and a < r - l:\r\n l += a\r\n r = l\r\n print(l + r)\r\n exit()\r\n\r\nprint(l + r + (a - a % 2))", "k=input().split()\nl=int(k[0]) \nr=int(k[1])\na=int(k[2])\nmaxh=max(l,r)\nminh=min(l,r)\nif minh+a<maxh:\n print((minh+a)2)\nelse:\n a-=(maxh-minh)\n print(maxh2+(a//2)2)", "l,r,a=map(int,input().split())\r\nif (l==0 and a==0) or (r==0 and a==0):\r\n print(\"0\")\r\nelif l+a<r:\r\n print(2(l+a))\r\nelif r+a<l:\r\n print(2(r+a))\r\nelse:\r\n a=(l+r+a)//2\r\n print(2a)", "l, r, a = map(int, input().split())\r\nm = min(l+a, r+a, (l+r+a)//2)\r\nprint(2m)\r\n", "l, r, a = map(int, input().split())\r\nwhile a>0:\r\n\tif l>r:\r\n\t\tr+=1\r\n\telse:\r\n\t\tl += 1\r\n\ta-=1\r\nprint(min(l,r)2)\r\n", "l, r, a = map(int, input().split())\nans = min(l + a, r + a, (l + r + a) // 2) * 2\nprint(ans)\n", "\r\nl,r,a = list(map(int, input().split()))\r\nif l<r:\r\n mmin=l\r\n mmax=r\r\nelse:\r\n mmin=r\r\n mmax=l\r\ns=mmax-mmin\r\nif a>=s:\r\n print(mmax2+((a-s)//2)2)\r\nelse:\r\n print((mmin+a)2) ", "def solution(data):\r\n\tleft=data[0]\r\n\tright=data[1]\r\n\tambide=data[2]\r\n\tif left<right:\r\n\t\treturn solution([right,left,ambide])\r\n\telif left==right:\r\n\t\tmax=right+left+2(ambide//2)\r\n\t\tprint(max)\r\n\telse:\r\n\t\tif right+ambide<=left:\r\n\t\t\tmax=2(right+ambide)\r\n\t\t\tprint(max)\r\n\t\telse:\r\n\t\t\tambide=ambide-(left-right)\r\n\t\t\tright=left\r\n\t\t\tmax=right+left+2(ambide//2)\r\n\t\t\tprint(max)\t\r\ndata=list(map(int,input().split()))\r\nsolution(data)", "l,r,a=map(int,input().split())\r\nif l>r:\r\n\tb=min(a,(l-r))\r\n\tx=a-b\r\n\tr+=b\r\n\tprint(2(r+x//2))\r\nelif r>l:\r\n\tc=min(a,(r-l))\r\n\tx=a-c\r\n\tl+=c\r\n\tprint(2(l+x//2))\r\nelse:\r\n\tprint(2(l+a//2))", "l,r,a= map(int,input().split())\r\nk = max(l,r)\r\nh = min(l,r)\r\nif k==h:\r\n\tprint(2l+2(a//2))\r\nelif h+a<=k:\r\n\tprint(2(h+a))\r\nelse:\r\n\tprint(2k+2((h+a-k)//2))", "from sys import stdin,stdout\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):\n l,r,b=lst()\n while b!=0:\n if l<r:\n l+=1\n b-=1\n elif l>r:\n r+=1\n b-=1\n else:\n if b<2:break\n l+=1\n r+=1\n b-=2\n print(min(l,r)2)\n\t\t \t \t \t \t \t\t \t\t \t\t \t", "a,b,c=map(int,input().split())\r\nif a<b:r=min(abs(a-b),c);a+=r;c-=r\r\nif b<a:f=min(abs(a - b), c);b+=f;c-=f\r\nif a==b:a+=c//2;b+=c//2\r\nif a-b==0:\r\n print(a+b)\r\nelse:\r\n print(min(a,b)2)\r\n", "l, r, a=map(int,input().split())\r\nmax1=0\r\nfor i in range(a+1):\r\n totall=l+i\r\n totalr=r+a-i\r\n max1=max(max1,min(totall,totalr)2)\r\nprint(max1)\r\n\r\n", "li,r,a=list(map(int,input().split()))\r\npla=0\r\nif li<r:\r\n pla+=li+li\r\n if r-li==a:\r\n pla+=r-li+r-li\r\n elif r-li<a:\r\n pla+=r-li+r-li\r\n if (a-r+li)%2==0:\r\n pla+=a-r+li\r\n else:\r\n pla+=a-r+li-1\r\n elif r-li>a:\r\n pla+=a+a\r\nelif li>r:\r\n pla+=r+r\r\n if li-r==a:\r\n pla+=li-r+li-r\r\n elif li-r<a:\r\n pla+=(li-r)2\r\n if (a-li+r)%2==0:\r\n pla+=a+r-li\r\n else:\r\n pla+=a+r-li-1\r\n elif li-r>a:\r\n pla+=a+a\r\nelif li==r:\r\n pla+=li+li\r\n if a%2==0:\r\n pla+=a\r\n elif a%2!=0:\r\n pla+=a-1\r\nprint(pla)\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "l, r, a = map(int, input().split())\r\nprint(2(min(l, r) + a) if abs(l-r) >= a else 2(max(l, r) + (a - abs(l-r))//2))\r\n", "linea_ingresada = input()\r\n\r\nzurdos,derechos,ambidiestros = linea_ingresada.split(' ')\r\n\r\nzurdos = int(zurdos)\r\nderechos= int(derechos)\r\nambidiestros = int(ambidiestros)\r\n\r\nif zurdos > derechos:\r\n diferencia = zurdos - derechos\r\n if diferencia >= ambidiestros:\r\n resultado = derechos + ambidiestros\r\n else:\r\n resultado = zurdos + (ambidiestros - diferencia) / 2\r\nelse:\r\n if derechos > zurdos:\r\n diferencia = derechos - zurdos\r\n if diferencia >= ambidiestros:\r\n resultado = zurdos + ambidiestros\r\n else:\r\n resultado = derechos + (ambidiestros - diferencia) / 2\r\n else:\r\n resultado = zurdos + ambidiestros / 2\r\n\r\nprint(int(resultado) * 2)", "l,r,a=[int(i) for i in input().split()]\r\nb=max(l,r)\r\nc=min(l,r)\r\nd=b-c\r\nif d>=a:\r\n print(2(c+a))\r\nelif a>d:\r\n e=a-d\r\n f=e//2\r\n print(2(b+f))\r\n", "l,r,a=map(int,input().split())\r\nif((l + a) < r):\r\n res = 2 * (l + a)\r\nelif(l <= r):\r\n res = 2 * r + 2 * abs((a - (r - l)) / 2)\r\nelif((r + a) < l):\r\n res = 2 * (r + a)\r\nelif(r < l):\r\n res = 2 * l + 2 * abs((a - (l - r)) / 2)\r\nif(res%2!=0):\r\n res=res-1\r\nprint(int(res))\r\n", "a,b,c=map(int,input().split())\r\nx=abs(a-b)\r\nif x>=c:\r\n print((c+min(a,b))2)\r\nelse:\r\n print((x+min(a,b)+int((c-x)/2))2)", "l,r,a=[int(x) for x in input().split()]\r\nif l>r:\r\n t=2r\r\n x=l-r\r\nelse:\r\n t=2l\r\n x=r-l\r\nif a>x:\r\n t=t+(2x)\r\n z=a-x\r\n y=(z//2)2\r\n t=t+y\r\nelse:\r\n t=t+(2a)\r\nprint(t)", "l, r, a = [int(x) for x in input().split()]\r\n\r\nmax_num = max(l, r)\r\nmin_num = min(l, r)\r\n\r\ndiff = abs(max_num - min_num)\r\n\r\nif a <= diff:\r\n\tprint((min_num + a) 2)\r\nelse:\r\n\tleft_over = min_num + a - max_num\r\n\tadd_both_sides = left_over // 2\r\n\tprint(max_num * 2 + add_both_sides * 2)", "# Codeforces Submission\n# User : sudoSieg\n# Time : 14:31:40\n# Date : 21/10/2020\n\nimport io\nimport os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nl, r, a = map(int, input().split())\ni = min(l, r)\nl -= i\nr -= i\nif l == 0 and r == 0:\n print(2 * i + 2 * (a//2))\nelif l == 0:\n j = min(r, a)\n r -= j\n a -= j\n print(2 i + 2 j + 2 * (a//2))\nelif r == 0:\n j = min(l, a)\n l -= j\n a -= j\n print(2 i + 2 j + 2 * (a//2))\n", "left,right,ambidekstr=map(int,input().split())\r\nif (left==0 or right==0) and ambidekstr==0:\r\n print(0)\r\n exit()\r\nfor i in range(ambidekstr):\r\n if left==min(left,right):\r\n left+=1\r\n else:\r\n right+=1\r\nprint(min(left,right)2)", "from math import floor\r\nl,r,a=map(int,input().split())\r\nu=floor((l+r+a)/2)\r\nprint(2min(l+a,r+a,u))", "a,b,c= map(int,input().split())\nwhile c!=0 :\n if a>b :\n b+=1\n else :\n a+=1\n c-=1\nif a>b :\n print (b2)\nelse :\n print (a2)\n", "l,r,a = map(int,input().split())\r\nd = abs(l-r)\r\nif a<=d:\r\n print((min(l,r)+a)2)\r\nelse:\r\n s = l+r+a\r\n a-=d\r\n a%=2\r\n print(s-a)", "l,r,a=map(int,input().split())\r\n\r\nwhile(1):\r\n if(a<=0):\r\n print(min(l,r)2)\r\n break\r\n \r\n if(l<=r):\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\n \r\n \r\n \r\n ", "l,r,a=map(int,input().split())\r\nt=a\r\na=a-abs(l-r)\r\nif(a>0):\r\n c=min(l,r)+abs(l-r)\r\n s=c+(a//2)\r\nelse:\r\n s=t+min(l,r)\r\nprint(2s)", "l, r, a=[int(x)for x in input().split()]\r\n \r\nwhile l < r and a != 0:\r\n\tl += 1\r\n\ta -= 1\r\n \r\nwhile r < l and a != 0:\r\n\tr += 1\r\n\ta -= 1\r\n \r\nl += a // 2\r\nr += a // 2\r\n \r\nprint(min(r,l) 2)", "l,r,a=map(int,input().strip().split(' '))\r\nk=max(l,r)\r\nb=min(l,r)\r\nss=k-b\r\nif a<=ss:\r\n print(2(a+b))\r\nelse:\r\n print(k2+((a-ss)//2)2)", "[l,r,a] = map(int, input().split())\r\nif l>=r+a:\r\n print ((r+a)2)\r\nelif r>=l+a:\r\n print ((l+a)2)\r\nelse:\r\n print ((r+l+a)//22)", "l,r,a=map(int,input().split())\r\n\r\nMax=max(l,r)\r\nMin=min(l,r)\r\n\r\nif Min+a<=Max:\r\n print(2(Min+a))\r\nelse:\r\n print((Max+(Min+a-Max)//2)2)", "def this(l, r, a):\r\n ans = 0\r\n while True:\r\n if l == 0:\r\n if a == 0:\r\n return ans\r\n else:\r\n a-=1\r\n else:\r\n l-=1\r\n\r\n if r == 0:\r\n if a == 0:\r\n return ans\r\n else:\r\n a-=1\r\n else:\r\n r-=1\r\n\r\n ans+=2\r\n\r\nl, r, a = map(int, input().split())\r\n\r\nprint(this(l, r, a))", "#950A\r\nl,r,a=map(int,input().split())\r\nif l!=r:\r\n #l<r only\r\n L=min(l,r)\r\n R=max(l,r)\r\n d=R-L\r\n if a>=d:\r\n a=a-d\r\n print(R+R+a-a%2)\r\n else:\r\n L+=a\r\n print(L2)\r\nelse:\r\n re=l2 + (a-a%2)\r\n print(re)", "l, r, a = map(int, input().split())\r\n\r\nwhile l < r and a > 0:\r\n l += 1\r\n a -= 1\r\n\r\nwhile l > r and a > 0:\r\n r += 1\r\n a -= 1\r\n\r\ni = 0\r\nwhile a > 0:\r\n if i % 2:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\n i += 1\r\n\r\nprint(min(l, r) * 2)", "l,r,a=map(int,input().strip().split())\r\nans=2(min(l+a,r+a,(l+r+a)//2))\r\nprint(ans)", "l,r,a= map(int , input().split())\nwhile a>0 :\n\tif l>r :\n\t\tr=r+1\n\t\ta=a-1\n\t\t\n\telif r>l :\n\t\tl=l+1\n\t\ta=a-1\n\t\t\n\telif a==1 :\n\t\tbreak\n\t\n\telif r==l and a>=2 :\n\t\tl=l+1\n\t\tr=r+1\n\t\ta=a-2\n\t\t\nif l<r :\n\tprint (2l,\"\\n\")\n\t\nelse :\n\tprint (2r,\"\\n\")\n\t\n \t \t \t\t \t\t \t \t \t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n l, r, a = map(int, input().split())\r\n ans = 0\r\n while l > 0 and r > 0:\r\n ans += 2\r\n l -= 1\r\n r -= 1\r\n while l > 0 and a > 0:\r\n ans += 2\r\n l -= 1\r\n a -= 1\r\n while r > 0 and a > 0:\r\n ans += 2\r\n r -= 1\r\n a -= 1\r\n while a >= 2:\r\n ans += 2\r\n a -= 2\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l,r,a=list(map(int,input().split()))\nif l<r:\n mymin=l\n mymax=r\nelse:\n mymin=r\n mymax=l\ns=mymax-mymin\nif a>=s:\n print(mymax2+((a-s)//2)2)\nelse:\n print((mymin+a)2)\n\t \t \t \t \t\t \t\t\t \t \t \t\t \t\t\t", "l, r, a = map(int, input().split())\r\nres = 0\r\nfor i in range(0, a + 1):\r\n res = max(res, min(l + i, r + a - i) * 2)\r\nprint(res)", "l,r,a=map(int, input().split())\r\n\r\nfor i in range(a):\r\n if l<r:\r\n l+=1\r\n else:\r\n r+=1\r\n\r\nprint(2min(l,r)) \r\n", "l,r,a=map(int,input().split())\r\nif l==0 and a==0 or r==0 and a==0:\r\n\tprint(\"0\")\r\nelse:\r\n\tif abs(l-r)<a:\r\n\t\tw=( 2max(l,r) )+ ( (a-abs(l-r))//2 )2\r\n\t\tprint(w)\r\n\telse:\r\n\t\tprint((2(min(l,r)+a)))", "l,r,a = map(int,input().split())\r\nwhile True:\r\n if l<r and a:\r\n l+=1\r\n a-=1\r\n elif l>r and a:\r\n r+=1\r\n a-=1\r\n elif l==r and a>1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n else:\r\n break\r\nprint(2min(l,r))", "v, a = map(int, input().split())\nm, M = sorted(v)\nif a > M - m:\n print(((a + M + m) // 2) * 2)\nelse:\n print((m + a) * 2)\n", "#Left-handers, Right-handers and Ambidexters\r\n\r\n# Get input variables and assign\r\nx = input().split()\r\n\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nfor i in range(a):\r\n if l <= r:\r\n l = l + 1\r\n else:\r\n r = r + 1\r\n \r\nif l < r:\r\n print(2l)\r\nelif r <= l:\r\n print(2r)", "l,r,a = map(int,input().split())\r\nif (l==0 or r==0) and a==0:\r\n print(0)\r\nelse:\r\n for i in range(a,0,-1):\r\n if(l<r):\r\n l+=1\r\n else:\r\n r+=1\r\n print(min(l,r)2)", "l,r,a= map(int,input().split())\r\nif(l>r):\r\n l1=min((l-r),a)\r\n r=r+l1\r\n a=a-l1\r\nif(r>l):\r\n l1=min((r-l),a)\r\n l=l+l1\r\n a=a-l1\r\nif(l==r):\r\n a=a//2\r\n l=l+a \r\n r=r+a \r\nprint(min(l,r)2) ", "from math import \r\na,b,c=map(int,input().split())\r\np=min(a,b)\r\nk=max(a,b)\r\ns=k-p\r\nif s>=c:\r\n ans=2(p+c)\r\nelse:\r\n ans=2(k+(c-s)//2)\r\nprint(ans)\r\n ", "l , r , a = map(int , input().split())\r\n\r\nwhile a > 0 : \r\n if r > l : \r\n l+= 1 \r\n else: \r\n r+= 1 \r\n a-= 1 \r\nprint(min(l , r ) 2 )", "a,b,c = map(int, input().split())\r\nres = 0\r\nfor i in range(c+1):\r\n tl = a + i\r\n tr = b + c - i\r\n res = max(res, min(tl, tr)2)\r\nprint(res)", "\r\n(l, r, a) = tuple(map(int, input().split()))\r\n# 5 4 1\r\ntotal = 0\r\n\r\n\r\nwhile(a>0):\r\n \r\n if l<r:\r\n l +=1\r\n else:\r\n r+=1 \r\n a-=1\r\n\r\nprint(min(l,r)2 )", "# cook your dish here\na, b ,c=list(map(int, input().split()))\nif min(a,b)+c <= max(a,b):\n print((min(a,b)+c)2)\nelse:\n x=c-max(a,b)+min(a,b)\n print((max(a,b)+int(x/2))2)\n \n\n\n \n \n \n ", "l,r,a= map(int,input().split())\r\nif(l>r):\r\n m=min((l-r),a)\r\n r=r+m\r\n a=a-m\r\nif(r>l):\r\n m=min((r-l),a)\r\n l=l+m\r\n a=a-m\r\nif(l==r):\r\n a=a//2\r\n l=l+a \r\n r=r+a \r\nprint(min(l,r)2)", "l, r, a = map(int, input().split())\n\nans = 0\nans += min(l, r)\nl -= ans\nr -= ans\nif l != 0:\n tmp = min(l, a)\n ans += tmp\n l -= tmp\n a -= tmp\nif r != 0:\n tmp = min(r, a)\n ans += tmp\n r -= tmp\n a -= tmp \nans += a // 2\nprint(ans 2)\n\t \t\t \t \t \t\t \t \t \t \t\t\t\t\t", "l,r,a = map(int,input().split())\r\n\r\nwhile a>0:\r\n diff = abs(l-r)\r\n if l<r:\r\n l+=min(diff,a)\r\n a-=min(diff,a)\r\n elif l>r:\r\n r+=min(diff,a)\r\n a-=min(diff,a)\r\n else:\r\n r+=a//2\r\n a-=a//2\r\n l+=a\r\n a-=a\r\nprint(min(l,r)2)\r\n \r\n \r\n", "l,r,a=map(int,input().split())\r\ntotal,m,ma=0,0,0\r\nif((l==0 and a==0) or (r==0 and a==0)):\r\n total=0\r\nelif(min(l,r)+a<max(l,r)):\r\n total=(min(l,r)+a)2\r\nelse:\r\n total=((l+a+r)//2)2\r\nprint(total) \r\n", "# https://codeforces.com/problemset/problem/950/A\n\nl, r, a = map(int, input().split())\n\n# x <= y\nx, y = sorted([l, r])\nif y - x > a:\n answer = 2 (x + a)\nelse:\n answer = 2 * (y + (a - (y - x))//2)\n\nprint(answer)\n", "# Left-handers, Right-handers and Ambidexters\r\nl,r,a = [int(x) for x in input().split()]\r\n\r\nif l > r:\r\n l,r = r,l\r\n \r\nl += a\r\n\r\nif l > r:\r\n print((r+(l-r)//2)2)\r\nelse:\r\n print(l2)\r\n", "l,r,a=map(int,input().split())\r\nif l<r:\r\n\tx=r-l\r\n\tif a>=x:\r\n\t\tl=l+x\r\n\t\ta=a-x\r\n\t\tm=1\r\n\telse:\r\n\t\tl=l+a\r\n\t\ta=0\r\n\t\tm=2\r\nelif l==r:\r\n\totvet=l+r+((a//2)2)\r\n\tprint(otvet)\r\n\texit()\r\nelif l>r:\r\n\tx=l-r\r\n\tif a>=x:\r\n\t\tr=r+x\r\n\t\ta=a-x\r\n\t\tm=3\r\n\telse:\r\n\t\tr=r+a\r\n\t\ta=0\r\n\t\tm=4\r\nif m==1 or m==3:\r\n\totvet=l+r+((a//2)2)\r\n\tprint(otvet)\r\nelif m==2:\r\n\totvet=l2\r\n\tprint(otvet)\r\nelif m==4:\r\n\totvet=r2\r\n\tprint(otvet)\t", "l, r, a = map(int, input().split())\nans = 0\nif l < r:\n if l + a <= r:\n ans = l+a\n else :\n ans = r + (a - r + l)//2\nelse :\n if r + a <= l:\n ans = r + a\n else :\n ans = l + (a - l + r)//2\nprint(2ans)\n", "l, r, a = [int(x) for x in input().split()]\r\ndiff = abs(l - r)\r\nif a > diff:\r\n print(((a - diff) // 2) 2 + max(l, r) * 2)\r\nelse:\r\n print(min(l + a, r + a) * 2)\r\n", "x = list(map(int,input().strip().split()))\r\n\r\nwhile (x[2]>0):\r\n\tif x[0] > x[1]:\r\n\t\tx[1]+=1\r\n\t\tx[2]-=1\r\n\telif x[0] < x[1]:\r\n\t\tx[0]+=1\r\n\t\tx[2]-=1\r\n\telse : \r\n\t\tbreak;\r\n\r\nif x[0] > x[1]:\r\n\tprint(int(x[1] 2 + int(x[2]/2)2))\r\nelse :\r\n\tprint(int(x[0] 2 + int(x[2]/2)2))\r\n", "x, y, z= [int(i) for i in input().split()]\nif(x > y):\n x, y = y, x\ndiff = min(y - x, z)\nprint( ((x+diff) + ((z-diff)//2) ) * 2)\n\t\t \t\t\t\t \t \t \t\t\t \t\t\t", "l,r,a = list(map(int, input().split()))\r\nans=0\r\n\r\nif l==r:\r\n ans = 2l+a\r\n \r\n if ans&1:\r\n ans-=1\r\n \r\nelse:\r\n m = min(l,r)\r\n d = abs(l-r)\r\n \r\n if d>=a:\r\n m+=a\r\n ans = m+m\r\n \r\n else:\r\n m = max(l,r)\r\n a-=d\r\n \r\n if a&1:\r\n a-=1\r\n \r\n ans = m+m+a\r\n \r\nprint(ans)", "def main():\r\n l, r, a = map(int, input().split())\r\n z = abs(l-r)\r\n if l >= r:\r\n if z >= a:\r\n print((r+a)2)\r\n else:\r\n d = a - z\r\n print(l2+(d-d%2)) \r\n else:\r\n if z >= a:\r\n print((l+a)2)\r\n else:\r\n d = a - z\r\n print(r2+(d-d%2))\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b, c = map(int, input().split())\r\nif abs(a - b) > c:\r\n print((min(a, b) + c) 2)\r\nelse:\r\n cnt = max(a, b) * 2\r\n c -= abs(a - b)\r\n print(cnt + (c // 2 * 2))\r\n", "n,m,k=map(int,input().split())\r\nif n>m:\r\n\tn,m=m,n\r\nif k>=m-n:\r\n\tprint(m2+(k-(m-n))-(k-m+n)%2)\r\nelif k<m-n:\r\n\tprint((n+k)2)\r\nelse:\r\n\tprint(\"0\")", "l,r,a=map(int,input().split())\r\nx,y=min(l,r),max(l,r)\r\ns,y=x2,y-x\r\nif a>=y:\r\n\ts+=2y\r\n\ts+=((a-y)//2)2\r\nelse:\r\n\ts+=a2\r\nprint(s)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\nl= lst[0]\r\nr= lst[1]\r\na= lst[2]\r\n\r\nwhile a > 0:\r\n if l < r:\r\n l +=1\r\n else:\r\n r += 1\r\n a -= 1\r\n\r\nprint(min(l,r)2)\r\n", "from math import floor\n\nl, r, a = list(map(int, input().split()))\n\nresult = 0\n\nif l <= r:\n l, r = r, l\n\nresult += r\nl -= r\nif a >= l:\n result += l + floor((a - l) / 2)\nelse:\n result += a\n\nprint(2 result)\n", "# your code goes here\nl,r,a=map(int,input().split(\" \"))\nans=0\nif l==r:\n\tans=(l+r)+2(a//2)\nelif l<r:\n\tif a>(r-l):\n\t\tans=2r+2((a-r+l)//2)\n\telse:\n\t\tans=(l+a)2\nelse:\n\tif a>(l-r):\n\t\tans=2l+2((a-l+r)//2)\n\telse:\n\t\tans=(r+a)2\nprint(ans)\n", "l, r, a = map(int, input().split())\r\nans = 0\r\nif l > r:l, r = r, l\r\ngap = r - l\r\nif gap <= a:\r\n ans = r2\r\n a -= gap\r\n ans += (a if a%2==0 else a-1)\r\n print(ans)\r\nelse:\r\n l += a\r\n print(l2)", "#ty,d\r\nimport sys\r\n\r\nx, y, a = map(int, input().split())\r\n\r\nif x == y:\r\n if a % 2 != 0:\r\n a -= 1\r\n print(x + y + a)\r\n sys.exit()\r\n\r\nif x < y:\r\n if x + a <= y:\r\n x += a\r\n print(min(x, y) 2)\r\n else:\r\n if y - x <= a:\r\n a -= (y - x)\r\n x = y\r\n if a % 2 != 0:\r\n a -= 1\r\n x += a // 2\r\n y += a // 2\r\n print(x + y)\r\n else:\r\n print(min(x, y) * 2 + a // 2)\r\nelse: # x >= y\r\n if y + a <= x:\r\n y += a\r\n print(min(y, x) * 2)\r\n else:\r\n if x - y <= a:\r\n a -= (x - y)\r\n y = x\r\n #print(x, y)\r\n if a % 2 != 0:\r\n a -= 1\r\n #print(a // 2)\r\n y += (a // 2)\r\n x += (a // 2)\r\n print(y + x)\r\n else:\r\n print(min(y, x) * 2 + a // 2)\r\n ", "l,r,d=map(int,input().split())\r\nb=0\r\nif l<r:\r\n if l+d==r:\r\n b=l+r+d\r\n elif l+d<r:\r\n b=2(l+d)\r\n else:\r\n c=r-l\r\n l+=c\r\n d-=c\r\n b=l+r+2int(d/2)\r\nelif r<l:\r\n if r+d==l:\r\n b=l+r+d\r\n elif r+d<l:\r\n b=2(r+d)\r\n else:\r\n c=l-r\r\n r+=c\r\n d-=c\r\n b=l+r+2int(d/2)\r\nelse:\r\n b=l+r+2int(d/2)\r\nprint(b)", "def determineValue(value,newMin):\n if value > newMin:\n if (value - newMin) > 1:\n return newMin + (value - newMin)//2\n return newMin\n return value\n\ndef main():\n testCase = input()\n testCase = testCase.split()\n testCase = list(map(int, testCase))\n minIndex = testCase.index(min(testCase[:2]))\n minValue = testCase[minIndex]\n value = minValue + testCase[-1]\n if minIndex == 0:\n print(determineValue(value, testCase[1])2)\n elif minIndex == 1:\n print(determineValue(value, testCase[0])2)\nmain()\n\n\n", "l,r,a=map(int,input().split())\r\nif l==r:\r\n print(l+r+(a//2)2)\r\nelse:\r\n if l<r:\r\n c=r-l\r\n if a>=c:\r\n a-=c\r\n print(r2+(a//2)2)\r\n else:\r\n print((l+a)2)\r\n elif l>r:\r\n c=l-r\r\n if a>=c:\r\n a-=c\r\n print(l2+(a//2)2)\r\n else:\r\n print((r+a)2)\r\n", "x,y,z=map(int,input().split())\r\nif(x>y):\r\n a=x-y\r\n b=min(a,z)\r\n y=y+b\r\n z=z-b\r\nelse:\r\n a=y-x\r\n b=min(a,z)\r\n x=x+b\r\n z=z-b\r\nif(z>1):\r\n p=z//2\r\n p=p2\r\n print((min(x,y)2)+p)\r\nelse:\r\n print(min(x,y)2)", "l,r,a = map(int,input().split())\r\nprint(2max([min(l+m,r+a-m) for m in range(a+1)]))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\nz=m+a\r\nif z<=max(l,r):\r\n print(2z)\r\nelse:\r\n q=(l+r+a)//2\r\n print(2q)\r\n \r\n \r\n", "l,r,a = map(int,input().split())\nans = 0\nans = min(l,r) * 2\nl -= ans // 2\nr -= ans // 2\nif l > 0:\n t = min(l,a) \n l -= t\n a -= t\n ans += t * 2\nelse:\n t = min(r,a)\n r -= t\n a -= t\n ans += t * 2\nif a > 0:\n ans += a // 2 * 2\nprint(ans)\n", "l,f,a = list(map(int,input().split()))\r\n\r\nif (l< f):\r\n if ((a+l) < f):\r\n l+=a\r\n a=0\r\n else:\r\n a-=(f-l)\r\n l+=(f-l)\r\nelif (l > f):\r\n if ((a+f) < l):\r\n f +=a\r\n a=0\r\n else:\r\n a-=(l-f)\r\n f+=(l-f)\r\nif (a!=0):\r\n a=a//2\r\n l+=a\r\n f+=a\r\nprint(min(l,f)2)", "\r\ndef main():\r\n\tl, r, a = map(int, input().split())\r\n\tans = 0\r\n\tfor x in range(1000):\r\n\t\tif l + a >= x and r + a >= x and 2 x - l - r <= a:\r\n\t\t\tans = x\r\n\tprint(2 * ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "r,l,a=map(int,input().split())\r\ndiff=abs(r-l)\r\nma=max(r,l)\r\nmi=min(r,l)\r\nif diff>a:\r\n mi=mi+a\r\n print(min(mi,ma)2)\r\nelse:\r\n a=a-diff\r\n print((ma+int(a/2))2)", "#!/usr/bin/env python3\n\nl, r, a = [int(x) for x in input().split()]\nans = min(l, r)\nl -= ans\nr -= ans\ntmp = max(l, r)\nans2 = min(a, tmp)\na -= ans2\ntmp -= ans2\nans3 = a // 2\nprint((ans + ans2 + ans3) * 2)\n", "string = input().split(\" \")\r\nlh = int(string[0])\r\nrh = int(string[1])\r\nam = int(string[2])\r\n\r\nif(lh>rh):\r\n maximum = lh\r\n minimum = rh\r\nelse:\r\n maximum = rh\r\n minimum = lh\r\n\r\nfor i in range(0, am):\r\n if(minimum<maximum):\r\n minimum+=1\r\n else:\r\n maximum+=1\r\n\r\nprint (min(minimum,maximum)2)\r\n", "inputs = input().split()\r\nleft_h, right_h, am_h = (int(i) for i in inputs)\r\ndiff = 0\r\nif left_h < right_h:\r\n diff = (left_h + am_h) - right_h\r\n if diff < 0:\r\n print((left_h + am_h) 2)\r\n else:\r\n print((right_h * 2) + ((diff // 2) * 2))\r\nelif left_h > right_h:\r\n diff = (right_h + am_h) - left_h\r\n if diff < 0:\r\n print((right_h + am_h) * 2)\r\n else:\r\n print((left_h * 2) + ((diff // 2) * 2))\r\nelif left_h == right_h:\r\n print((left_h * 2) + ((am_h // 2) * 2))\r\n", "l,r,b = map(int,input().split())\r\nif l+b<=r: print((l+b)2)\r\nelif r+b<=l: print((r+b)2)\r\nelse:\r\n if l==r:\r\n l += b//2\r\n print(l2)\r\n else:\r\n if l>r: l,r = r,l\r\n diff = r-l\r\n l += min(b,diff)\r\n b -= min(b,diff)\r\n ans = min(l,r)+b//2\r\n print(ans2)", "people = input().split(' ');\r\n\r\nleftHander = int(people[0])\r\nrighttHander = int(people[1])\r\nambiDexter = int(people[2])\r\n\r\nmaxPeople = max(leftHander, righttHander);\r\nminPeople = min(leftHander, righttHander);\r\n\r\nif (maxPeople - minPeople <= ambiDexter):\r\n ans = 2(maxPeople + (ambiDexter - maxPeople + minPeople)//2);\r\nelse:\r\n ans = 2 (ambiDexter + minPeople);\r\n\r\nprint(int(ans))", "x = list(map(int, input().split()))\r\nif x[0] == x[1]:\r\n print(2 * (sum(x) // 2))\r\nelse:\r\n if min(x[0], x[1]) + x[2] <= max(x[0], x[1]):\r\n print(2 * (min(x[0], x[1]) + x[2]))\r\n else:\r\n x[2] -= max(x[0], x[1]) - min(x[0], x[1])\r\n print(2 * ((2 * max(x[0], x[1]) + x[2]) // 2))\r\n", "a,b,k=map(int,input().split())\r\nm=max(a,b)\r\nn=min(a,b)\r\nif((n+k)<=m):\r\n print((n+k)2)\r\nelse:\r\n p=k-(m-n)\r\n if(p%2==0):\r\n print(m2 + p)\r\n else:\r\n print(m2 + p -1)", "l,r,a=input().split()\r\nl=int(l)\r\nr=int(r)\r\na=int(a)\r\nmi=min(l,r)\r\nma=max(l,r)\r\nd=ma-mi\r\nans=0\r\nif a>d:\r\n ans=ma+int((a-d)/2)\r\nelse:\r\n ans=mi+a\r\nprint(ans2)", "a,b,c=map(int,input().split())\nd=abs(b-a)\nif(c>=d):\n print(max(a,b)2+c-abs(b-a)-(c-abs(b-a))%2)\nelse:\n print((c+min(a,b))2)\n \t \t \t\t\t \t\t\t \t \t \t\t \t \t", "#!/usr/bin/env/python\r\n# -- coding: utf-8 --\r\nl, r, a = list(map(int, input().split()))\r\n\r\nif a <= abs(l - r):\r\n print((min(l, r) + a) * 2)\r\nelse:\r\n print(max(l, r) * 2 + (a - abs(l - r)) // 2 * 2)\r\n", "l, r, a = map(int, input().split(' '))\r\nm1 = min(l,r)\r\nl = l - m1\r\nr = r - m1\r\nm2 = min(max(l,r),a)\r\na = a - m2\r\nm3 = a//2\r\nprint((m1+m2+m3)2)\r\n", "l, r, a = map(int,input().split())\r\n\r\nwhile a >= 1:\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l,r)2)\r\n\"\"\"\r\nif l < r:\r\n d = min(r-l, a)\r\n l += d\r\n a -= d\r\nelif l > r:\r\n d = min(r-l, a)\r\n r += d\r\n a -= d\r\n\r\nprint(2min(l,r) + (a - (a % 2)))\r\n\"\"\"\r\n", "l, r, a = map(int, input().split())\r\nwhile a != 0:\r\n if r > l:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l, r)2)\r\n", "from math import floor\r\nl, r, a = map(int, input().split())\r\nans = 0\r\nif l < r:\r\n r -= l\r\n ans += l2\r\n if r < a:\r\n a -= r\r\n ans += r2 + floor(a/2) * 2\r\n #print(\"CASE 1.1\", ans)\r\n else:\r\n ans += a2\r\n #print(\"CASE 1.2\", ans)\r\nelse:\r\n l -= r\r\n ans += r2\r\n if l < a:\r\n a -= l\r\n ans += l2 + floor(a/2) 2\r\n #print(\"CASE 2.1\", ans)\r\n else:\r\n ans += a2\r\n #print(\"CASE 2.2\", ans)\r\nprint(ans)", "(l, r, a) = map(int, input().split(\" \"))\r\nif l <= r:\r\n if a + l <= r:\r\n print((l + a) 2)\r\n else:\r\n print((l + r + a) // 2 * 2)\r\nelse:\r\n if a + r <= l:\r\n print((r + a) * 2)\r\n else:\r\n print((l + r + a) // 2 * 2)", "lHand , rHand , ambidexter = map(int, input().split())\r\nif (lHand == 0 and ambidexter == 0) or (rHand == 0 and ambidexter == 0):\r\n print(0)\r\nelse:\r\n if lHand>rHand:\r\n diff = lHand - rHand\r\n if diff>ambidexter:\r\n print(2(rHand+ambidexter))\r\n else:\r\n print(2(rHand+diff+(ambidexter-diff)//2))\r\n elif lHand == rHand:\r\n print(2(lHand+(ambidexter)//2))\r\n else:\r\n diff = rHand - lHand\r\n if diff>ambidexter:\r\n print(2(lHand+ambidexter))\r\n else:\r\n print(2(lHand+diff+(ambidexter-diff)//2))", "def ok(l,r,a):\r\n return 2min(l+a,r+a,(l+r+a)//2)\r\nl,r,a=map(int,input().split())\r\nprint(ok(l,r,a))\r\n\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import \r\n# from itertools import \r\n# import random\r\nl, r, a = map(int, input().split())\r\nif a == 0:\r\n min_ = min(l, r)\r\n print(2 * min_)\r\nelif a != 0:\r\n # a is not equal to zero then we have to check if its diff is less than or equal or a or not and then we have to\r\n # check the same for another case\r\n if l < r:\r\n if r - l >= a:\r\n l += a\r\n print(2 * min(l, r))\r\n elif r - l < a:\r\n temp = r - l\r\n l += temp\r\n a -= temp\r\n x = a // 2\r\n l += x\r\n r += x\r\n print(2 * min(l, r))\r\n elif l > r:\r\n if l - r >= a:\r\n r += a\r\n print(2 * min(l, r))\r\n elif l - r < a:\r\n temp = l - r\r\n r += temp\r\n a -= temp\r\n x = a // 2\r\n l += x\r\n r += x\r\n print(2 * min(l, r))\r\n else:\r\n temp = a // 2\r\n l += temp\r\n r += temp\r\n print(2 * min(l, r))\r\n", "x,y,z=map(int,input().split())\nta=min(x,y)\ntb=min(abs(x-y),z)\ntc=(z-tb)//2\nres=(ta+tb+tc)2\nprint(res)\n \t\t \t\t \t \t \t\t \t\t\t\t \t \t", "l,r,a=map(int,input().split())\r\nfor i in range(a):\r\n if l>r:\r\n r=r+1\r\n else:\r\n l=l+1\r\nprint(2(min(l,r)))", "[l, r, a] = map(int, input().split()) \r\nif l >= r:\r\n if a >= l - r:\r\n right = l\r\n amb = a - (l - r)\r\n right = right + amb//2\r\n left = l + amb//2\r\n else:\r\n right = r + a\r\n left = right\r\nelse:\r\n if a >= r - l:\r\n left = l + (r - l)\r\n amb = a - (r - l)\r\n left = left + amb//2\r\n right = r + amb//2\r\n else:\r\n left = l + a\r\n right = left\r\nprint (right + left)", "l, r, a = list(map(int, input().split()))\r\nSum = (min(l, r) * 2) + (min(a, max(l, r) - min(l, r)) * 2)\r\nSum += (int((a - min(a, max(l, r) - min(l, r))) / 2) * 2 if a > min(a, max(l, r) - min(l, r)) else 0)\r\nprint(Sum)\r\n", "l, r, a = list(map(int, input().split()))\r\nM, m = max(l, r), min(l, r)\r\nres = (m + a) * 2 if (M - m >= a) else 2 * M + (a + m - M) // 2 * 2\r\nprint(res)", "l,r,a=map(int,input().split(\" \"))\r\n\r\nfor i in range(a):\r\n if(l<r):\r\n l+=1\r\n elif(r<l):\r\n r+=1\r\n else:\r\n l+=1\r\n \r\nprint(min(l,r)2)", "import math\nl,r,a=map(int,input().split(\" \"))\nif l!=r:\n t=abs(l-r)\n if t<=a:\n a-=t\n print(2max(l,r)+2math.floor(a/2))\n else:\n print(2min(l,r)+2a)\nelse:\n print(l+r+2math.floor(a/2))", "l, r, a = map(int, input().split())\n\nans = 0\nif l - r > a:\n ans = r + a\nelif r - l > a:\n ans = l + a\nelse:\n ans = max(l, r) + (a - abs(l-r)) // 2\nprint(2 * ans)", "l,r,a=map(int,input().split())\r\nif abs(l-r)<a:\r\n print(2int((r+l+a)/2))\r\nelse:\r\n print(2min(a+l,r+a))", "x = list(map(int, input().split(' ')))\r\nres = 0\r\nfor i in range(len(x)):\r\n if x[-1] == 0 and (x[1] == 0 or x[0] == 0):\r\n res = 0\r\n elif x[0] == x[1] and x[-1] != 0:\r\n res = (int(x[-1]/2) + x[0]) + (int(x[-1]/2) + x[1])\r\n else:\r\n for c in range(x[-1]+1):\r\n tl = x[0] + c\r\n tr = x[1]+x[-1]-c\r\n res = max(res, min(tl, tr)2)\r\nprint(res)", "l, r, a = map(int, input().split())\r\ndif = max(l, r) - min(l, r)\r\npeople = 0\r\nif a > dif:\r\n people += max(l, r) 2\r\n a -= dif\r\n people += a // 2 * 2\r\n print(people)\r\nelif a == dif:\r\n print(max(l, r) * 2)\r\nelse:\r\n people = (min(l, r) + a) * 2\r\n print(people)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l, r, a = map(int, input().split())\r\nans = min(l, r)\r\nl -= ans\r\nr -= ans\r\nif l > 0:\r\n temp = min(l, a)\r\n l -= temp\r\n a -= temp\r\n ans += temp\r\nif r > 0:\r\n temp = min(r, a)\r\n r -= temp\r\n a -= temp\r\n ans += temp\r\nif a > 1:\r\n ans += a//2\r\nprint(ans2)", "l,r,a = map(int, input().split())\r\nprint(2min(l+a,r+a,(l+r+a)//2))", "l, r, a = map(int, input().split())\r\nif l < r:\r\n l, r = r, l\r\n\r\nd = l - r\r\nif a > d:\r\n print(((r + d) + (a - d) // 2) * 2)\r\nelse:\r\n print((r + a) * 2)\r\n", "l, r, a = map(int, input().split())\r\nprint(min((l + r + a) // 2, l + a, r + a) * 2)", "l,r,a=list(map(int,input().split()))\r\nans=0\r\nk=min(l,r)\r\nt=max(l,r)\r\nans+=2k\r\nans+=2min(t-k,a)\r\na-=min(t-k,a)\r\nans+=a\r\nif(ans%2==1):\r\n ans-=1\r\nprint(ans) \r\n \r\n ", "l,r,a=map(int,input().split())\r\nm=abs(l-r)\r\nif a<=m:print(2(min(l,r)+a))\r\nelse:print(2max(l,r)+2((a-m)//2))", "l,r,a = map(int,input().split())\nmn=min(l,r)\nmx=max(l,r)\n\nmn+=a\nif mn<=mx :\n print(mn2)\nelif mn>mx :\n eltar=mn-mx\n if eltar%2==0 :\n print(2mx + eltar)\n else : print(2mx + eltar-1)\n\n\n #\n # لو هو فيه\n\n # لو هو فيه بزيادة\n # لو هو مفهوش\n\t \t \t \t \t \t \t \t\t \t \t\t", "import math\r\nfrom sys import stdin\r\nstring = stdin.readline().strip().split()\r\nl = int(string[0])\r\nr = int(string[1])\r\na = int(string[2])\r\ndiff=abs(l-r)\r\n#conpensate\r\nif diff<=a:\r\n output=max(l,r)2+(a-diff)-(a-diff)%2\r\nelse:\r\n output=(min(l,r)+a)2\r\nprint(output)", "import math\r\n\r\nl, r, a = (int(x) for x in input().split())\r\nif (l == 0 and r == 0) and a != 0:\r\n print((a//2)2)\r\nelif (l == 0 and a == 0) or (r == 0 and a == 0):\r\n print(0)\r\nelif a == 0:\r\n print(min(l, r)2)\r\nelse:\r\n if l > r:\r\n razn = l - r\r\n if razn > a:\r\n r += a\r\n print(int(r)2)\r\n elif razn < a:\r\n r += razn\r\n a -= razn\r\n r += a // 2\r\n print(int(r)2)\r\n elif razn == a:\r\n r += razn\r\n print(int(r)2)\r\n elif r > l:\r\n razn = r - l\r\n if razn > a:\r\n l += a\r\n print(int(l)2)\r\n elif razn < a:\r\n l += razn\r\n a -= razn\r\n l += a // 2\r\n print(l2)\r\n elif razn == a:\r\n l += razn\r\n print(int(l)2)\r\n else:\r\n l += a // 2\r\n print(int(l)2)\r\n\r\n", "x = input().split()\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nif l > r :\r\n l, r = r, l\r\n\r\ntemp = r - l\r\n\r\nif temp <= a :\r\n a -= temp;\r\n ans = r + (a // 2)\r\nelse :\r\n ans = l + a\r\n\r\nprint(ans 2)\r\n", "s = list(map(int, str(input()).split()))\r\n\r\nl = s[0]\r\nr = s[1]\r\na = s[2]\r\n\r\nans = 0\r\n\r\nx = min(l,r)\r\nans += x\r\nl -= x\r\nr -= x\r\n\r\nif a <= abs(l-r):\r\n ans += a\r\nelse:\r\n ans += abs(l-r)\r\n a -= abs(l-r)\r\n \r\n ans += (a // 2)\r\n\r\nprint(ans2)", "if __name__ == \"__main__\":\r\n a , b , c = list(map(int, input().split()))\r\n mn = min(a,b)\r\n mx = max(a,b)\r\n d = mx - mn\r\n if d >= c:\r\n mn += c\r\n print(mn2)\r\n else:\r\n e = c - d\r\n print(mx2+(e//2)2)", "import math\r\n\r\na, b, c = [int(x) for x in input().split()]\r\nanswer = 0\r\nminimum = min(a, b)\r\ndiff = abs(a - b)\r\nif diff >= c:\r\n diff -= c\r\n minimum += c\r\n c = 0\r\n answer = minimum\r\nelse:\r\n minimum += diff\r\n c -= diff\r\n diff = 0\r\n answer = minimum + math.floor(c / 2)\r\nprint(answer * 2)", "l,r,a = map(int,input().split())\nfor i in range(a):\n if l < r:\n l += 1\n elif l > r:\n r += 1\n else:\n l += 1\nif (l != r):\n print(2min(l,r))\nelse:\n print(2l)\n\n\n\n\n\n\n\n\n\n\n\n\n", "string = input().split(\" \")\r\nlh = int(string[0])\r\nrh = int(string[1])\r\nam = int(string[2])\r\n\r\nfor i in range(0, am):\r\n if(lh<rh):\r\n lh+=1\r\n else:\r\n rh+=1\r\n\r\nprint (min(lh,rh)2)\r\n", "l,r,a=map(int,input().split())\r\nd=abs(l-r)\r\nif(d>a):\r\n print(2(min(l,r)+a))\r\nelse:\r\n print(2max(l,r)+ ((a-d) if (a-d)%2==0 else a-d-1))\r\n\r\n \r\n", "l,r,a=map(int,input().split())\r\nprint(2(min(l+a,r+a,(l+r+a)//2)))", "'''input\r\n0 2 0\r\n'''\r\n\r\nl, r, a = [int(i) for i in input().split(\" \")]\r\nwhile (a > 0):\r\n\tif l > r:\r\n\t\tr += 1\r\n\telse:\r\n\t\tl += 1\r\n\ta -= 1\r\nprint(2 * min(l, r))", "l, r, a = map(int, input().split())\r\np = 0\r\nif r <= l:\r\n if r + a > l:\r\n p= (int((a- (l - r)) / 2) + l) * 2\r\n else:\r\n p = (r + a) * 2\r\nelif l < r:\r\n if l + a > r:\r\n p = (int((a- (r - l)) / 2) + r) * 2\r\n else:\r\n p = (l + a) * 2\r\nprint(p)\r\n \r\n \t ", "l,r,a = map(int,input().split())\r\nx = min((l+r+a)//2,l+a,r+a)2\r\nprint(x)", "#39\r\n\r\nl,r,a=map(int,input().split())\r\nd=abs(l-r)\r\nif(d>=a):\r\n print((min(l,r)+a)2)\r\nelse:\r\n a=a-d\r\n print(max(l,r)2+(a//2)2)", "a, b, c=map(int, input().split())\r\ncnt=0\r\nfor i in range(c):\r\n if a>b:\r\n b+=1\r\n else:\r\n a+=1\r\nprint(2min(a, b))", "l,r,a = map(int,input().split())\r\nif max(l,r)-(min(l,r)+a)>1:print((min(l,r)+a)2)\r\nelse: print(((l+r+a)//2)2)", "l,r,a = [int(c) for c in input().split()]\r\n\r\nres = 0\r\nfor i in range(a+1):\r\n l1 = l + i\r\n r1 = r + a - i\r\n res = max(res, min(l1,r1) 2)\r\nprint(res)\r\n", "s = list(map(int,input().split()))\r\nl = s[0]\r\nr = s[1]\r\na = s[2]\r\nm = min(l,r)\r\nc = 0\r\nc = c + m + m\r\nl=l-m\r\nr=r-m\r\nif(r==0):\r\n if(l>=a):\r\n c = c + a + a\r\n else:\r\n c = c + l + l\r\n a = a - l\r\n p = a//2\r\n c = c + p + p\r\nelif(l==0):\r\n if(r>=a):\r\n c = c + a + a\r\n else:\r\n c = c + r + r\r\n a = a - r\r\n p = a//2\r\n c = c + p + p\r\nprint(c)\r\n ", "a,b,c=map(int,input().split())\r\na,b=min(a,b),abs(a-b)\r\nd=min(b,c)\r\nprint(2a+2d+(c-d)//22)", "[l, r, a] = map(int, input().split())\r\n\r\nif l < r:\r\n if (l+a) < r:\r\n lnew = l+a \r\n rnew = lnew \r\n else: # l + a >= r\r\n lnew = r \r\n a = a - (r-l) \r\n lnew = lnew + a//2\r\n rnew = lnew \r\nelif l == r: \r\n lnew = l + a//2 \r\n rnew = lnew \r\nelse:\r\n if (r+a) < l:\r\n rnew = r+a \r\n lnew = rnew \r\n else: # r + a >= l \r\n rnew = l \r\n a = a - (l-r) \r\n rnew = rnew + a//2 \r\n lnew = rnew \r\n\r\nprint(lnew + rnew)", "l,r,a=map(int, input().split())\r\nmi = min(l,r)\r\nma = max(l,r)\r\nus = min((ma-mi), a)\r\not = (a - us) >> 1\r\nre = mi + us + ot\r\nprint (2 re)", "left, right, ambidexters, count = [int(i) for i in input().split()] + [0]\r\ntotal = min(left, right) * 2\r\ndifference = max(left, right) - min(left, right)\r\nif ambidexters > difference:\r\n total += ambidexters + difference\r\nelse:\r\n total += ambidexters * 2\r\nprint(total) if total % 2 == 0 else print(total - 1)", "\r\nl, r, a = map(int, input().split())\r\n\r\nwhile l < r and a != 0:\r\n\tl += 1\r\n\ta -= 1\r\n\r\nwhile r < l and a != 0:\r\n\tr += 1\r\n\ta -= 1\r\n\r\nl += a // 2\r\nr += a // 2\r\n\r\nprint(min(r,l) * 2)", "def solution(l1):\r\n left=l1[0]\r\n right=l1[1]\r\n ambi=l1[2]\r\n stage1=min(left,right)\r\n stage2=min(ambi,max(left,right)-stage1)\r\n stage3=int((ambi-stage2)/2)\r\n #print(stage1,stage2,stage3)\r\n\r\n ans=2(stage1+stage2+stage3)\r\n \r\n return ans\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "seq = input()\r\nvalues = seq.split()\r\nteamsize = 0\r\nl = int(values[0])\r\nr = int(values[1])\r\na = int(values[2])\r\ndiff = abs(l-r)\r\nif (diff ==0):\r\n teamsize = l+r+a\r\n teamsize = (teamsize if teamsize%2==0 else teamsize-1)\r\nelif (diff<a):\r\n fill = a-diff\r\n teamsize = l+r+fill+(a-fill)\r\n teamsize = (teamsize if teamsize%2==0 else teamsize-1)\r\nelse:\r\n fill = a+(l if (l<r) else r)\r\n teamsize = fill2\r\nprint(teamsize)\r\n ", "s = input().split()\r\nl, r, a = int(s[0]), int(s[1]), int(s[2])\r\nwhile a > 0:\r\n if l <= r: \r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(2min(l, r))\r\n", "a,b,c=map(int,input().split())\r\nif a<b:\r\n r=min(abs(a-b),c)\r\n a+=r\r\n c-=r\r\nif b<a:\r\n f=min(abs(a - b), c)\r\n b+=f\r\n c-=f\r\nif a==b:a+=c//2;b+=c//2\r\nif a-b==0:\r\n print(a+b)\r\nelse:\r\n print(min(a,b)2)\r\n", "l,r,a=list(map(int,input().split()))\r\nwhile(a>0):\r\n if(l<=r):\r\n l+=1\r\n elif(l>=r):\r\n r+=1\r\n a-=1; \r\nprint(min(l,r)2) ", "l, r, a =[int(i) for i in input().split()]\r\nt=2min(l, r)\r\nx=min(abs(l-r), a)\r\nprint(t+x2+(a-x)-(a-x)%2)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nl, r, a = map(int, input().split())\r\nwhile True:\r\n if l < r and a:\r\n l += 1\r\n a -= 1\r\n elif l > r and a:\r\n r += 1\r\n a -= 1\r\n elif l == r and a > 1:\r\n l += 1\r\n r += 1\r\n a -= 2\r\n else:\r\n break\r\nans = 2 min(l, r)\r\nprint(ans)", "l,r,a = map(int,input().split())\r\npair1 = min(l,r)\r\npair2 = min(abs(l - r), a)\r\npair3 = (a - pair2) // 2\r\nresult = (pair1 + pair2 + pair3) * 2\r\nprint(result)", "l, r, a = [int(s) for s in input().split(' ')]\r\nx = 2 * min(l, r) + 2 * min(a, abs(l - r)) + 2 * max(0, (a - abs(l - r)) // 2)\r\nprint(x)", "from math import ceil, sqrt, floor\r\nimport sys \r\n\r\nl,r,a = map(int, input().split())\r\nl,r = sorted([l,r]) \r\n\r\nif l + a <= r:\r\n print(2(l+a))\r\nelse:\r\n print(2r + 2((a + l - r) // 2))", "a,b,c=[int(x) for x in input().split()]\r\na,b=min(a,b),max(a,b)\r\nif a+c==b:\r\n print(2b)\r\nelif a+c<b:\r\n print(2(a+c))\r\nelse:\r\n print(((a+b+c)//2)2)", "lra = list(map(int, input().split()))\r\nif lra[0] > lra[1]:\r\n\ttemp = min(lra[2], lra[0] - lra[1])\r\n\tlra[1] += temp\r\n\tlra[2] -= temp\r\nelse:\r\n\ttemp = min(lra[2], lra[1] - lra[0])\r\n\tlra[0] += temp\r\n\tlra[2] -= temp\r\nprint(2 * min(lra[1], lra[0]) + lra[2] - (lra[2] % 2))", "l,r,a=map(int,input().split())\r\nd=abs(r-l)\r\nif a<=d:\r\n print(2(min(l,r)+a))\r\nelse:\r\n print(2(max(l,r)+(a-d)//2))", "# https://codeforces.com/problemset/problem/950/A\r\n\r\ninp_ = input()\r\nl, r, a = map(int, inp_.split(\" \"))\r\nwhile l != r:\r\n if a != 0:\r\n if l > r:\r\n r += 1\r\n a -= 1\r\n if r > l:\r\n l += 1\r\n a -= 1\r\n else:\r\n if l>r:\r\n l=r\r\n else:\r\n r=l\r\n break\r\ntotall = r + l + (a//2)2\r\nprint(totall)", "l,r,a = map(int,input().split())\r\nna = abs(r-l)\r\nif(na>=a):\r\n if(l<r):\r\n l+=a\r\n else:\r\n r+=a\r\n print(min(l,r)2)\r\nelse:\r\n till = max(l,r)2\r\n a-=na\r\n till+=((a//2)2)\r\n print(till)\r\n ", "l, r, a = [int(i) for i in input().split()]\r\ncount = min(l, r) * 2\r\nmn = min(l, r)\r\nl = l - mn\r\nr = r - mn\r\nmx = max(l, r)\r\nwhile a > 0:\r\n if mx == 0:\r\n mx += 1\r\n a -= 1\r\n if a > 0 and mx > 0:\r\n mx -= 1\r\n a -= 1\r\n count += 2\r\nprint(count)\r\n", "a, b, c = map(int, input().split())\nm = min(a, b)\na -= m\nb -= m\nans = m\nm = min(max(a, b), c)\nans += m\nc -= m\nif c > 0:\n ans += c // 2\nprint(ans * 2)", "s=input().split()\r\nl,p,a=int(s[0]),int(s[1]),int(s[2])\r\nr=abs(l-p)\r\nif a>=r:\r\n print(l+p+r+2((a-r)//2))\r\nelse:\r\n print(2min(l,p)+2a)\r\n", "l,r,a=map(int,input().split())\r\nif l<r:\r\n if l+a-r>0:\r\n k=(r+(l+a-r)//2)2\r\n else:\r\n k=(l+a)2\r\nelif l==r:\r\n k=(l+a//2)2\r\nelse:\r\n if r+a-l>0:\r\n k=(l+(r+a-l)//2)2\r\n else:\r\n k=(r+a)2\r\nprint(k)\r\n \r\n", "l, r, a = map(int, input().split())\nc = min(l+a, r+a, (l+r+a)//2)\nprint(2c)\n\n", "# http://codeforces.com/contest/467/problem/A\n\nl, r, a = map(int, input().split())\n\nmn = min(l, r)\nmx = max(l, r)\n\nteam = mn + a\n\ne = team - mx\n# print(mx, mn, team, e)\nif e > 0:\n\tteam = mx + int(e/2)\nelse:\n\tteam = mx + e\n\nprint(team 2)", "l,r,a = [int(x) for x in input().split()]\r\nans = 0\r\nif l<=r:\r\n\tif (r-l)<=a:\r\n\t\tans=r2 + (a-(r-l))//22\r\n\telse:\r\n\t\tans=(l+a)2\r\nelse:\r\n\tif (l-r)<=a:\r\n\t\tans=l2 + (a-(l-r))//22\r\n\telse:\r\n\t\tans=(r+a)2\r\nprint (ans)\r\n", "def euclid_algo(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if b == 0:\r\n return a\r\n return euclid_algo(b, a % b)\r\n\r\n\r\n\r\ndef main_function():\r\n l, r, a = [int(i) for i in input().split(\" \")]\r\n difference = max(l, r) - min(l, r)\r\n if difference >= a:\r\n return 2 * (min(l, r) + a)\r\n return 2 * (max(l, r) + (a - difference) // 2)\r\n\r\n\r\nprint(main_function())", "a,b,c=map(int, input().split())\r\nif min(a,b)+c>max(a,b):\r\n print(((c-abs(a-b))//2+max(a,b))2)\r\nelse: print(2(min(a,b)+c))\r\n\r\n", "l,r,a = (int(x) for x in input().split())\r\nwhile a > 0:\r\n if l < r: l += 1\r\n else: r += 1\r\n a -= 1\r\nprint(min(l,r)2)\r\n\r\n", "def maxTeamSize(l, r, a):\r\n playersLeft = a\r\n if l > r:\r\n playersLeft = max(playersLeft - (l - r), 0)\r\n r += a - playersLeft\r\n else:\r\n playersLeft = max(playersLeft - (r - l), 0)\r\n l += a - playersLeft\r\n \r\n return (r + l + (playersLeft // 2) 2) if r == l else min(r, l) * 2\r\n \r\n \r\n\r\nl, r, a = map(int, input().split())\r\nprint(maxTeamSize(l, r, a))\r\n\r\n\r\n", "x,y,z=map(int,input().split())\r\nif abs(x-y)<=z:\r\n z-=abs(x-y)\r\n if x<y:x=y \r\n elif x>y:y=x\r\n print((x+z//2)2) \r\nelse:\r\n if x<y:x+=z\r\n elif x>y:y+=z\r\n print(min(x,y)2)", "string=input()\r\nla=list(map(int,string.split()))\r\nl=la[0]\r\nr=la[1]\r\na=la[2]\r\nwhile(a>0):\r\n\tif r<l:\r\n\t\tr+=1\r\n\telse:\r\n\t\tl+=1\r\n\ta-=1\r\nif r<l:\r\n\tprint(2r)\r\nelse:\r\n\tprint(2l)", "l,r,a=map(int,input().split())\r\ncount=0\r\nif l==r:\r\n count=l+r\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2(a//2)\r\nelif l<r:\r\n if(l+a)==r:\r\n count+=(l+r+a)\r\n elif (l+a)<r:\r\n count+=2(l+a)\r\n else:\r\n count+=2r\r\n a=(a-(r-l))\r\n #print(a)\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2(a//2)\r\nelse :\r\n if(r+a)==l:\r\n count+=(l+r+a)\r\n elif (r+a)<l:\r\n count+=2(r+a)\r\n else:\r\n count+=2l\r\n a=(a-(l-r))\r\n #print(a)\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2(a//2)\r\nprint(count)\r\n ", "l , r , a = input().split()\nl = int(l)\na = int(a)\nr = int(r)\n\nm = min(l,r)\nwhile (m!=max(l,r))&(a!=0):\n\ta-=1\n\tm+=1\nif a>1:\n\tm += (a//2) \nprint (m2)\n", "l,r,a = map(int,input().split())\nmini = min(l,r)\nmaxi = max(l,r)\nif maxi - mini >=a :\n print((mini +a) 2)\nelse :\n a-= maxi-mini\n if a >1 :\n maxi += a//2\n print(maxi2)\n\n", "l,r,a=[map(int,input().split())]\nt=abs(l-r)\nif a>=t:\n print(2(max(l,r)+(a-t)//2))\nelse:\n print(2(min(l,r)+a))\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\n[l, r, a] = map(int, input().split())\nnl = min(l, r)\nnr = max(l, r)\nif nr - nl <= a:\n print(((nr + nl + a) // 2) 2)\nelse:\n print((nl + a) * 2)\n", "r, l, a = input().split()\r\nr = int(r)\r\nl = int(l)\r\na = int(a)\r\n#l = int(input())\r\n#a = int(input())\r\ndef team(a):\r\n if (a)%2 == 0:\r\n return a\r\n else:\r\n return a-1\r\ndef count(a,b):\r\n if a>b:\r\n return 2b\r\n else:\r\n return 2a\r\n \r\nwhile a>0:\r\n if r<l:\r\n r+=1\r\n a-=1\r\n else:\r\n l+=1\r\n a-=1\r\nprint(count(l,r))", "l,r,a=map(int,input().split())\r\nwhile a!=0:\r\n\tif l==r :\r\n\t\tif a%2==0:\r\n\t\t\tl+=a//2\r\n\t\t\tr+=a//2\r\n\t\telse:\r\n\t\t\ta=a-1\r\n\t\t\tl+=a//2\r\n\t\t\tr+=a//2\r\n\t\tbreak\r\n\telif l>r and a>0:\r\n\t\tr+=1\r\n\t\ta-=1\r\n\telif r>l and a>0:\r\n\t\tl+=1\r\n\t\ta-=1\r\nif l>r:\r\n\tprint(l-(l-r)+r)\r\nelif r>l:\r\n\tprint(l+r-(r-l))\r\nelse:\r\n\tprint(l+r)", "a, b, c = map(int,input().split())\r\nif a+c < b:\r\n print((a+c)2)\r\nelse:\r\n if b+c<a:\r\n print((b+c)2)\r\n else:\r\n print((a+b+c)//22)", "import sys\r\n\r\nl, r, a = (int(x) for x in next(sys.stdin).split())\r\n\r\nhands = sorted([l, r])\r\nif a <= hands[1] - hands[0]:\r\n print(2 (hands[0] + a))\r\nelse:\r\n print((l + r + a) // 2 * 2)\r\n", "l,r,b=map(int,input().split())\r\n\r\nwhile(b):\r\n b-=1\r\n if l<r :\r\n l+=1\r\n else:\r\n r+=1\r\n \r\nprint(min(l,r)2) ", "l, r, a = map(int, input().split())\n\nif abs(l - r) > a:\n\tprint(2 (min(l, r) + a))\nelse:\n\ta_remain = a - abs(l - r)\n\ta_add = a_remain - a_remain % 2\n\tprint(2 * max(l, r) + a_add)\n", "from sys import stdin\r\n \r\nrd = stdin.readline\r\n\r\nl, r, a = map(int, rd().split())\r\n\r\nres = 2 * (min(l, r) + min(a, max(l, r) - min(l, r)))\r\nres += 2 * ((a - min(a, max(l, r) - min(l, r))) // 2)\r\n\r\nprint(res)\r\n\r\n \r\n", "if __name__ == \"__main__\":\r\n l, r, a = map(int, input().split())\r\n l, r = min(l, r), max(l, r)\r\n r -= l\r\n l += min(r, a) + max(0, a - r) // 2\r\n print(l * 2)\r\n", "l, r, a = [int(x) for x in input().split()]\r\n\r\nif(a>0):\r\n\twhile a>0:\r\n\t\tif l>r:\r\n\t\t\tr+=1\r\n\t\telse:\r\n\t\t\tl+=1\r\n\t\ta-=1\r\n\r\nx=min(l,r)\r\nx=2\r\nprint(x)\r\n", "l, r, a = map(int, input().split())\nx, y = a + min(l, r), max(l, r)\nprint( 2 x if x == min(x, y) else 2 (y + (x - y)//2))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\nv=max(l,r)\r\nd=v-m\r\nprint(2(v+(a-d)//2) if a>d else 2(m+a))\r\n", "l,r,a=map(int,input().split())\r\nm=2min(l,r)\r\nx=abs(l-r)\r\nk=min(x,a)\r\nz=2k\r\na=max(0,a-k)//2\r\nm=2a+m+z\r\nprint(m)", "l, r, ambidextors = map(int, input().split())\r\n\r\nbase_team_size = 2 * min(l,r)\r\nextra_onehanded = max(max(l,r) - base_team_size//2, 0)\r\n\r\nif extra_onehanded :\r\n more_pairs = min(extra_onehanded, ambidextors)\r\n base_team_size += 2* more_pairs\r\n ambidextors -= more_pairs\r\n extra_onehanded -= more_pairs\r\n\r\nmax_team_size = base_team_size + ambidextors - (ambidextors%2)\r\n\r\n\r\n\r\nprint(max_team_size)", "l,r,a=map(int,input().split())\r\ndif=max(l,r)-min(l,r)\r\nif dif==0:\r\n\tprint(2(min(l,r)+a//2))\r\nelse:\r\n\tif a>=dif:\r\n\t\tprint(2((min(l,r)+dif)+((a-dif)//2)))\r\n\telse:\r\n\t\tprint(2(min(l,r)+a))", "l, r, a = map(int, input().split())\n\nans = 0\n\n\"\"\"\n1 4 2 => 6\n5 5 5 => 14\n0 2 0 => 0\n\"\"\"\n\nif l < r and a != 0:\n\tsub = r - l\n\tif sub - a > 0:\n\t\tans = (l + a) 2\n\telif sub - a == 0:\n\t\tans = r * 2\n\telse:\n\t\t_sub = a - sub\n\t\tans = (r +_sub // 2) * 2\n\nelif l > r and a != 0:\n\tsub = l - r\n\tif sub - a > 0:\n\t\tans = (r + a) * 2\n\telif sub - a == 0:\n\t\tans = l * 2\n\telse:\n\t\t_sub = a - sub\n\t\tans = (l +_sub // 2) * 2\nelif l == r and a != 0:\n\tisy = a // 2\n\tans = (l + isy) * 2\nelif a == 0:\n\t_min = min([l, r])\n\tans = _min * 2\n\nprint(ans)", "l,r,a=map(int,input().split())\r\nmx=0\r\nfor i in range(a+1):\r\n tl=l+i\r\n tr=r+a-i\r\n\r\n mx=max(mx,min(tl,tr)2)\r\n\r\nprint(mx)", "l,r,a= map(int, input().split())\r\nif a<max(l,r)-min(l,r):\r\n print(2(a+min(l,r)))\r\nelse:\r\n print(2(max(l,r)+(a-max(l,r)+min(l,r))//2))", "l, r, a = map(int, input().split())\r\nprint(2(min(l, r) + min(a, abs(l - r)) + max(0, a - abs(l - r))//2)) \r\n", "l,r,a=map(int,input().split())\r\nx=a\r\nif l<r:\r\n min=l\r\n max=r\r\nelse:\r\n min=r\r\n max=l\r\nfor i in range (0,a):\r\n if x==0:\r\n break\r\n if min==max:\r\n break\r\n min+=1\r\n x-=1\r\n if x==0:\r\n break\r\n if min==max:\r\n break\r\nteam=min2\r\nif x%2==0:\r\n team+=x\r\nelse:\r\n team+=x-1\r\nprint(team)\r\n \r\n", "l, r, a = [int(x) for x in input().split()]\r\nif l > r:\r\n l, r = r, l\r\nif a >= r - l:\r\n print(((l + r + a) >> 1) << 1)\r\nelse:\r\n print((l + a) << 1)", "l, r, a = map(int, input().split())\r\nmx = 0\r\nfor i in range(a + 1):\r\n x = r + i\r\n y = l + a - i\r\n mx = max(mx, min(x, y) 2)\r\nprint(mx)\r\n", "l, r, a = list(map(int, input().split()))\r\n\r\nif l > r:\r\n l, r = r, l\r\n\r\nif l + a <= r:\r\n print((l + a) * 2)\r\nelse:\r\n print((r + (l + a - r) // 2) * 2)\r\n", "l,r,a=map(int,input().split())\r\n\r\nprint(2min(l+a,r+a,(l+a+r)//2))\r\n", "l, r, a = map(int, input().split())\r\nd = min(abs(r-l), a)\r\na -= d\r\nprint((min(l, r) + d + a//2)2)", "import sys\r\n\r\ndef main():\r\n l, r, a = map(int, sys.stdin.read().strip().split())\r\n t = min(abs(l-r), a)\r\n a = (a - t)//2\r\n return 2(min(l, r) + t + a)\r\n \r\nprint(main())\r\n", "l,r,a=map(int,input().split())\r\nans=min(l,r)\r\nans+=min(a,abs(l-r))\r\na-=min(a,abs(l-r))\r\nans+=a//2\r\nprint(2ans)\r\n", "l,r,a = map(int,input().split())\r\nif (l == r):\r\n print(2 * (r + a // 2))\r\nelse:\r\n mi = min(l,r)\r\n ma = max(l,r)\r\n k = ma - mi\r\n if (a < k):\r\n print(2 * (mi + a))\r\n else:\r\n a = a - k\r\n mi = mi + k\r\n print(2 * (mi + a // 2))", "import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nl, r,a = map(int, input().split())\r\nif(l>r):\r\n l,r = r, l\r\n# print(min(r-l, a))\r\ntemp = min(r-l, a)\r\nl += temp\r\n\r\na = a-temp\r\n\r\nl = l + (a//2)\r\nprint(l2)", "def test_0():\n # A - World Cup\n import math\n l, r, a = list(map(int, input().split(\" \")))\n if l < r:\n l, r = r, l\n b = l - r\n\n if b > a:\n d = (r + a) 2\n if b <= a:\n d = (l + r + a) // 2 * 2\n print(d)\n\n\ntest_0()\n\t\t\t\t\t \t \t \t\t\t \t\t \t \t\t\t \t\t", "l,r,a=list(map(int,input().split()))\r\nm=min(l,r)\r\nx=max(l,r)\r\nif m==x:\r\n if a%2==0:print(m2+a)\r\n else:print(m2+a-1)\r\nelse: \r\n m+=a\r\n if m>x:\r\n d=m-x\r\n if d%2==0:print(x2+d)\r\n else:print(x2+d-1)\r\n else:print(m2) ", "x = input().split()\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nmin1 = min(l,r)\r\nmax1 = max(l,r)\r\ndiff = max1 - min1\r\n\r\nif diff > 0:\r\n if diff > a:\r\n print((min1+a)2)\r\n else:\r\n a-=diff\r\n divide = int(a/2)\r\n print((max1+divide)2)\r\nelse:\r\n print((min1+int(a/2))2)\r\n ", "import itertools\r\n\r\n\r\n\r\n\r\ndef main():\r\n l,r,a = [int(v) for v in input().split()]\r\n d = min(l,r)\r\n res = d\r\n v = min(a, max(l,r)-d)\r\n res+=v\r\n res+=max(0, a-v)//2\r\n print(res2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l,r,a=map(int,input().split())\r\n\r\nminn=min(l,r)\r\nmaxx=max(l,r)\r\n\r\nans=minn2\r\nmaxx-=minn\r\n\r\n\r\nif(maxx>=a):\r\n ans+=a\r\n ans+=a\r\n \r\nelse:\r\n ans+=maxx \r\n ans+=maxx\r\n \r\n a-=maxx\r\n if(a>=0):\r\n ans+=a//2\r\n ans+=a//2\r\nprint(ans) \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n", "l,r,a = map(int, input().split())\r\n\r\nif l>r:\r\n t = l\r\n l = r\r\n r = t\r\n\r\np = r-l;\r\n\r\nif p>=a:\r\n l += a\r\nelse:\r\n l = r\r\n l+=int((a-p)//2)\r\n\r\nprint(l2)\r\n", "l,r,a = map(int,input().split())\r\nwhile a != 0:\r\n if l < r:\r\n l+=1\r\n a-=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(2min(l,r))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\ns=l+r-m\r\nn=s-m\r\nprint([m+a,s+(a-n)//2][a>n]2)", "l,r,am=map(int,input().split())\r\na,b=min(l,r),max(l,r)\r\ndiff=b-a \r\nif am<=diff:\r\n a+=am\r\nelse:\r\n a=a+diff \r\n rem=am-diff \r\n a=a+rem//2 \r\n b=b+rem//2\r\nprint(min(a,b)2)\r\n ", "l,r,a=map(int,input().split())\r\nm=max(l,r)\r\nif m==r:\r\n if l+a>m:\r\n d=r-l\r\n l=l+d\r\n a=a-d\r\n c=a//2\r\n t=(r+c)2\r\n else:\r\n l=l+a\r\n t=min(l,r)2\r\nelif m==l:\r\n if r+a>m:\r\n d=l-r\r\n r=r+d\r\n a=a-d\r\n c=a//2\r\n t=(l+c)2\r\n else:\r\n r=r+a\r\n t=min(l,r)2\r\nprint(t)", "l, r, a = map(int, input().split())\nmn, mx = min(l, r), max(l, r)\ndiff = mx - mn\nmn += min(diff, a) \na -= min(diff, a)\nif a > 0:\n mn += a//2\n mx += a//2\nprint(2min(mn, mx))\n", "l=list(map(int,input().split()))\r\na=min(l[0],l[1])\r\nb=max(l[0],l[1])\r\ns=l[-1]\r\nif a+s>b:\r\n\ts-=(b-a)\r\n\tc=b2+(s//2)2\r\nelse:\r\n\tc=(a+s)2\r\nprint(c)", "l,r,a=map(int,input().strip().split())\r\nx=max(l,r)\r\ny=min(l,r)\r\nif a<=x-y:\r\n print((y+a)2)\r\nelse:\r\n print(x2+(a-x+y)//22)", "l, r, a = map(int, input().split())\r\n\r\nif l == r:\r\n if a % 2 == 0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\nelif l > r:\r\n if l-r < a:\r\n a -= (l-r)\r\n if a % 2 == 0:\r\n print(2l+a)\r\n else:\r\n print(2l+a-1)\r\n else:\r\n print(2(min(l, r+a))) \r\n \r\nelse:\r\n if r - l < a:\r\n a -= (r-l)\r\n if a % 2 == 0:\r\n print(2r+a)\r\n else:\r\n print(2r+a-1)\r\n else:\r\n print(2(min(r, l+a))) ", "l,r,a = [int(k) for k in input().split()]\r\nif(l<r):\r\n if(l+a<=r):\r\n print(2(l+a))\r\n else:\r\n print(2r + 2int((l+a-r)/2))\r\nelif(l>r):\r\n if(r+a<=l):\r\n print(2(r+a))\r\n else:\r\n print(2l + 2int((r+a-l)/2))\r\nelse:\r\n print(2(l+int(a/2)))", "l,r,a=[int(i) for i in input().split()]\r\nif l>r:\r\n t=r2\r\n x=l-r\r\nelse:\r\n t=l2\r\n x=r-l\r\nif a>x:\r\n t=t+2x\r\n z=a-x\r\n y=(z//2)2\r\n t=t+y\r\nelse:\r\n t=t+2a\r\nprint(t)", "w=list(map(int,input().split()))\r\nl = w[0]\r\nr = w[1]\r\na = w[2]\r\nif (l>r):\r\n if(a>=l-r):\r\n a-=(l-r)\r\n r=l\r\n else:\r\n r+=a\r\n l=r\r\n a=0\r\nelif(r>l):\r\n if(a>=r-l):\r\n a-=(r-l)\r\n l=r\r\n else:\r\n l+=a\r\n r=l\r\n a=0\r\n\r\nif(l==r):\r\n print((l+a//2)2)\r\n \r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#\r\n\"\"\"\r\n89 44 77\r\nl r b\r\n44 + 44 = 45\r\n45 + 45 = 32\r\n16 + 16\r\n\r\n30 70 34\r\n\r\nmin(l, r) = 30\r\n70 - 30 => 40 => 60\r\n40 - 34 => 68\r\n\"\"\"\r\n\r\nl,r,b = invr()\r\n\r\nres = l + r + b\r\nc = Counter([l,r,b])\r\n\r\nmn = min(l, r)\r\nmx = max(l, r)\r\n\r\nr = mx - mn\r\n\r\ntotal = mn * 2\r\n\r\nif(b > r):\r\n total += r2\r\n b -= r\r\n if(b % 2 == 0):\r\n total += b\r\n else:\r\n total += b-1\r\nelse:\r\n total += b2\r\n\r\nprint(total)", "giris = input()\r\n#girilecek bir satır inputu string olarak alıyoruz\r\nayirilmisInput = giris.split(\" \")\r\n#girilen string'i boşluklarından ayırrarak diziye çeviriyoruz, örneğin \"3 4 5\" string'i, [3, 4, 5] olarak diziye dönüyor.\r\nl = int(ayirilmisInput[0])\r\nr = int(ayirilmisInput[1])\r\na = int(ayirilmisInput[2])\r\n#dizinin string cinsinden elemanlarını sıra sıra integer'a dönüştürüp değişkenlerimize atıyoruz.\r\n\r\nwhile(a > 0):\r\n a -= 1\r\n if(l < r):\r\n l += 1\r\n else:\r\n r += 1\r\n#a'daki değeri l ve r'ye önceliğe göre dağıtıyoruz.\r\nkucukOlan = min(l, r)\r\n#sonuçta takım, küçük kalan tarafa göre kurulacak. minimum miktarı alıyoruz.\r\ntoplamOyuncuSayisi = kucukOlan * 2\r\n#toplam oyuncu sayısını bulmak için 2 ile çarpıyoruz.\r\nprint(toplamOyuncuSayisi)\r\n", "import math\r\n\r\n\r\nl,r,a=[int(i) for i in input().split()]\r\nz=min(l,r)\r\ny=max(l,r)\r\ndiff=y-z\r\nif a==diff:\r\n print(2y)\r\nelif a<diff:\r\n print(2(z+a))\r\nelse :\r\n new_a=a-diff\r\n x=math.floor(new_a/2)\r\n print(2(y+x))", "L,R,A = map(int,input().split())\r\nprint(2min(L+A,R+A,(A+L+R)// 2))", "l , r , x = map(int,input().split())\r\n\r\nwhile x > 0 :\r\n if l <= r :\r\n x-=1\r\n l +=1\r\n elif r <= l :\r\n x-=1\r\n r+=1\r\n \r\n\r\n\r\n\r\n#print(l , r)\r\nprint(min(l,r) * 2 )\r\n\r\n\r\n", "l,r,a=map(int,input().split())\r\nd=l-r\r\nif(d<0):\r\n d=d-1\r\nm=min(l,r) \r\nif(a<=d):\r\n print(2(m+a))\r\nelse:\r\n print(2(m+d)+int((a-d)/2)2) ", "l,r,a=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(a+1):\r\n k=l+i\r\n d=r+a-i\r\n m=max(m,min(k2,d2))\r\nprint(m)\r\n", "l, r, a = map(int, input().split())\r\nans = 0\r\nwhile a>0:\r\n a -= 1\r\n if r>l:\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)2)", "def oloko (lot):\r\n l = lot[0]\r\n r = lot[1]\r\n a = lot[2]\r\n o = True\r\n if (l==0 or r== 0) and (a==0):\r\n return 0\r\n else:\r\n while o == True:\r\n #print(l, r)\r\n if l < r and a>=1:\r\n a-=1\r\n l+=1\r\n elif r<l and a>=1:\r\n a-=1\r\n r+=1\r\n elif r==l and a>=2:\r\n r+=1\r\n l+=1\r\n a-=2\r\n elif l < r:\r\n #a = r-l\r\n r = l\r\n elif r < l:\r\n #a = l-r \r\n l = r\r\n else:\r\n o = False\r\n #print(l, r)\r\n if (r==l):\r\n return r+l\r\n else:\r\n return 0\r\nlots = input().split()\r\nlots = [int(lots[i]) for i in range (0, len(lots))]\r\nprint(oloko(lots))", "l,r,a=map(int,input().split())\r\nwhile a > 0:\r\n if l < r:\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(min(l,r)2)", "l,r,a=map(int,input().split())\r\n\r\n# min1,max1=min(l,r),max(l,r)\r\n# max1-=min1\r\n# min1=2\r\n# if(a<=max1):\r\n# print(min1+a2)\r\n# else:\r\n# print(min1+((a+max1)//2)2)\r\nwhile(a>0):\r\n if(l<r):\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(min(l,r)2)", "from math import \r\n\r\nl ,r ,a = map(int,input().split())\r\nans = 0\r\nmaxi = max(l,r)\r\nmini = l+r-maxi\r\nif (maxi - mini > a):\r\n print(min(maxi,mini+a)2)\r\nelse:\r\n print((maxi + (a + mini - maxi)//2)2)\r\n", "l,r,a = map(int,input().split())\r\ntotal = 0\r\nif min(l,r)+a<=l or min(l,r)+a<=r:\r\n minemum = min(l,r)+a\r\n total=minemum2\r\nelse:\r\n minemum = min(l,r)+a\r\n a = minemum-max(l,r)\r\n minemum = max(l,r)\r\n total=(minemum2)+(a)\r\n \r\nif total%2==0:\r\n print(total)\r\nelse:\r\n print(total-1)", "l,r,a=map(int,input().split())\r\nfor _ in range(a):\r\n\tif l<r:l+=1\r\n\telse:r+=1\r\nprint(min(l,r)2)", "l,r,a = map(int,input().split())\r\n\r\n\r\n#print(\"a\")\r\nmi = min(l,r)\r\nma = max(l,r)\r\nwhile (mi != ma) and (a != 0):\r\n #print(\"b\")\r\n mi = mi + 1\r\n a = a - 1\r\n \r\n#print(mi)\r\nprint( 2mi + (a//2)2 )", "l,r,a=map(int,input().split())\r\nif min(l,r)+a <= max(l,r):\r\n\tprint(2(min(l,r)+a))\r\nelif l==r==a:\r\n\tprint(3l - l%2)\r\nelse:\r\n\tx=abs(min(l,r)-max(l,r))\r\n\ty=abs(a-x)\r\n\tprint(2max(l,r)+ y-abs(a-x)%2)\r\n", "l,r,a=map(int,input().split())\r\n\r\nif l<r:\r\n if l+a<=r:\r\n print(2(l+a))\r\n else:\r\n k=(l+a)-r\r\n if k%2==0:\r\n print(2r+k) \r\n else:\r\n print(2r+(k-1))\r\n\r\nelif r<l:\r\n if r+a<=l:\r\n print(2(r+a))\r\n else:\r\n k=(r+a)-l\r\n if k%2==0:\r\n print(2l+k) \r\n else:\r\n print(2l+(k-1))\r\n\r\nelif l==r:\r\n if a%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1) ", "a,b,c = list(map(int,input().split()))\r\nwhile c > 0:\r\n\tif a < b:\r\n\t\ta += 1\r\n\t\tc -= 1\r\n\telse:\r\n\t\tb += 1\r\n\t\tc -= 1\r\nprint(min(a,b)2)", "l, r, a = map(int, input().split())\r\nif abs(l - r) < a:\r\n print((l + r + a) & ~1)\r\nelse:\r\n print(2 * (min(l, r) + a))", "GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())\n\ndef main():\n l, r, a = GIS()\n while a:\n if l < r:\n l += 1\n else:\n r += 1\n a -= 1\n print(min(l, r) * 2)\n\nmain()\n", "import sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10*9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n l,r,b=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n mini=min(l,r)\r\n maxi=max(l,r)\r\n req=(maxi-mini)\r\n ex=min(b,req)\r\n mini+=ex\r\n b-=ex\r\n #print(ex)\r\n maxi+=b//2\r\n mini+=b//2\r\n print(2min(maxi,mini))\r\n \r\n ", "def main():\r\n l, r, a = map(int, input().split())\r\n\r\n if l < r:\r\n d = min(r - l, a)\r\n l += d\r\n a -= d\r\n\r\n if r < l:\r\n d = min(l - r, a)\r\n r += d\r\n a -= d\r\n\r\n l += a//2\r\n r += a//2\r\n ans = 2 * min(l, r)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l, r, a = map(int, input().split())\r\nif abs(r - l) < a:\r\n print((((a - abs(l - r)) // 2) + max(l, r)) * 2)\r\nelse:\r\n print((min(l, r) + a) * 2 if abs(r - l) != 0 else (r + a // 2) * 2)\r\n", "l, r, a = map(int, input().split())\r\nif min(l, r) + a <= max(l, r):\r\n print((min(l, r) + a)2)\r\nelse:\r\n print(max(l, r)2 + ((a - abs(l - r)) // 2) * 2)\r\n", "l, r, a = map(int, input().split())\r\n\r\nminimum = min(l, r)\r\nmaximum = max(l, r)\r\n\r\ndifference = maximum - minimum\r\n\r\nif difference == 0:\r\n minimum += a // 2\r\n maximum += a // 2\r\nelse:\r\n if a >= difference:\r\n minimum += difference\r\n a -= difference\r\n minimum += a // 2\r\n maximum += a // 2\r\n else:\r\n minimum += a\r\n\r\nprint(2 * minimum)\r\n", "l, r, a = map(int, input().split())\r\nif abs(l - r) >= a:\r\n print((min(l, r) + a) * 2)\r\nelse:\r\n print(((l + r + a) // 2) * 2)", "l,r,a=list(map(int,input().split()))\r\nif l==r:\r\n if a%2==0:\r\n print(a+l+r)\r\n else:\r\n print(l+r+a-1)\r\nelif l>r:\r\n kam=l-r\r\n if kam>=a:\r\n print((r+a)2)\r\n else:\r\n a-=kam\r\n if a%2==0:\r\n print(a+l+l)\r\n else:\r\n print(a+l+l-1)\r\nelse:\r\n kam=r-l\r\n if kam>=a:\r\n print((l+a)2)\r\n else:\r\n a-=kam\r\n if a%2==0:\r\n print(a+r+r)\r\n else:\r\n print(a+r+r-1)\r\n ", "string = input().split(' ')\na = int(string [0])\nb = int(string [1])\nc = int(string [2])\nwhile c:\n maxx= max(a,b)\n minn = min(a,b)\n minn = minn + 1\n c =c -1\n a = maxx\n b = minn\nprint(min(a,b)2)\n", "left, right, ambi = map(int,input().split())\r\nif left < right :\r\n\tadd = right - left \r\n\tif ambi >= add:\r\n\t\tleft += add\r\n\t\tambi -= add\r\n\telse:\r\n\t\tleft += ambi\r\n\t\tambi = 0\r\nelse:\r\n\tadd = left - right\r\n\tif ambi >= add:\r\n\t\tright += add\r\n\t\tambi -= add\r\n\telse:\r\n\t\tright += ambi\r\n\t\tambi = 0\r\naddmore = ambi//2\r\nleft += addmore\r\nright += ambi - addmore\r\nprint(2min(left,right))\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 28 11:31:47 2019\r\n\r\n@author: lfy\r\n\"\"\"\r\n\r\n#left,right,ambidexters\r\ndef lra_(l,r,a):\r\n if l==r:\r\n return (l+a//2)2\r\n else:\r\n lm=min(l,r)\r\n rm=max(l,r)\r\n l,r=lm,rm\r\n if a<=r-l:\r\n return 2(l+a)\r\n else:\r\n return 2(r+(a-r+l)//2)\r\nlra=input().split()\r\nprint(lra_(int(lra[0]),int(lra[1]),int(lra[2])))", "a, b, c = map(int,input().split())\r\n\r\nwhile c>0:\r\n if a<=b:\r\n a+=1\r\n c-=1;\r\n else:\r\n b+=1\r\n c-=1\r\nprint(min(a,b)2)", "r1,l1,rl=map(int,input().split())\r\nif r1==l1:\r\n print(r1+l1+(rl//2)2)\r\nelif r1>l1:\r\n if rl >= abs(r1-l1) :\r\n print(2r1+2((rl-(abs(r1-l1)))//2))\r\n else:\r\n print((l1+rl)2)\r\nelse:\r\n if rl >= abs(l1-r1):\r\n print(2l1+2((rl-(abs(l1-r1)))//2))\r\n else:\r\n print((r1+rl)2)", "list = list(map(int,input().split()))\r\nl = list[0]\r\nr = list[1]\r\na = list[2]\r\nx=0\r\nif l % 2 == 0 and r % 2 == 0 and l == r and a % 2 == 0 :\r\n x += a + r + l\r\nelif l % 2 == 0 and r % 2 == 0 and l == r and a % 2 != 0 :\r\n x += l + r + a - 1\r\nelif l % 2 != 0 and r % 2 != 0 and l == r and a % 2 == 0 :\r\n x += l + r + a\r\nelif l % 2 != 0 and r % 2 != 0 and l == r and a % 2 != 0 :\r\n x += l + r + a - 1\r\nelif l != r and l + a < r :\r\n x += (l + a) 2\r\nelif l != r and r + a < l :\r\n x += (r + a) * 2\r\nelse :\r\n if l > r :\r\n a = a -(l-r)\r\n r = l\r\n else :\r\n a = a-(r-l)\r\n l = r\r\n x += (a-a%2) + l2\r\n\r\nprint(x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "[l,r,a] = map(int, input().split())\r\nm=min(l,r)\r\nd=abs(l-r)\r\nif a>=d:\r\n m=m+d\r\n a=a-d\r\n R=a//2\r\n m=m+R\r\nelse:\r\n m=m+a\r\nprint(2m)", "l, r, a = map(int,input().split())\r\nwhile a>0:\r\n if l<r:\r\n l=l+1\r\n else:\r\n r =r +1\r\n a=a-1\r\nprint(min(l,r)2)", "l, r, a = map(int, input().split())\r\nans = min(l,r)\r\nt = max(l,r)-min(l,r)\r\nif t <= a:\r\n ans += (a+t)//2\r\nelse:\r\n ans += a\r\nprint(2ans)\r\n", "\r\nl , r , x = map(int,input().split())\r\n\r\nwhile x >0 :\r\n if l < r :\r\n l +=1\r\n else:\r\n r +=1\r\n x -=1\r\n\r\nprint(min(l , r) * 2 )\r\n#print(l , r)\r\n\r\n", "l,r,a=[int(i) for i in input().split()]\r\nif l<r:\r\n l,r=r,l\r\nc=l-r\r\nif c<=a:\r\n a=a-c\r\n print(((a//2)+l)2)\r\nelse:\r\n print((a+r)2)\r\n", "# Левши, правши и амбидекстры\r\nl, r, a = map(int, input().split())\r\ndiff_betw_left_and_right = abs(l - r)\r\nprint((min(l, r) + a) * 2 if a < diff_betw_left_and_right else max(l, r) * 2 + (a - diff_betw_left_and_right) // 2 * 2)", "l,r,a=map(int,input().split())\r\nd=min(l,r)2\r\nl-=d//2\r\nr-=d//2\r\nk=min(max(l,r),a)\r\nd+=k2\r\na-=k\r\nprint(d+a//22)\r\n", "l,r,a=[int(i) for i in input().split()]\r\nif l>=r:\r\n if (l-r)>a:\r\n print((r+a)2)\r\n elif (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\nif r>l:\r\n if (r-l)>a:\r\n print((l+a)2)\r\n elif (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\n", "l, r, a = map(int, input().split())\nmx, mn = [max((l, r)), min((l, r))]\nplayers = 0\nif a >= mx - mn:\n a -= mx - mn\n mn += mx - mn\n ambx = a\n if ambx % 2 != 0:\n ambx -= 1\n print((mx + mn) + ambx)\nelse:\n print((mn + a) 2)\n\n \t \t\t\t \t \t\t\t \t \t\t \t\t \t \t", "l,r,a = map(int, input().split(\" \"))\r\ndiff = abs(l-r)\r\nm = min(l,r)\r\nif a + m < max(l,r):\r\n print(2(a+m))\r\nelif a+m > max(l,r):\r\n a -= diff\r\n if a % 2 == 1:\r\n a -= 1\r\n print(2(m+diff)+a)\r\nelif a+m == max(l,r):\r\n print(2max(l,r))\r\n ", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print(a+b+2(c//2))\r\nelse:\r\n d=abs(a-b)\r\n if c>=d:\r\n print(d+a+b+2((c-d)//2))\r\n else:\r\n print(2(c+min(a,b)))", "l,r,a=map(int,input().split())\r\nfor i in range(a):\r\n if a>0:\r\n if l==r:\r\n if a>1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n if l<r:l+=1;a-=1\r\n else:r+=1;a-=1\r\nprint(min(l,r)2)\r\n", "l,r,a = map(int, input().split())\nd = min(abs(l - r), a)\ntot = 2 min(l, r) + 2 * d + (a - d) - ((a - d) % 2) \n\nprint(tot)", "#Left-handers, Right-handers and Ambidexters\r\n\r\nl,r,a=map(int,input().split())\r\nmini=min(l,r)\r\nteam=0\r\nl-=mini\r\nr-=mini\r\nteam=mini2\r\nif l==0 and r>0:\r\n f=0\r\nelif r==0 and l>0:\r\n f=1\r\nelse:\r\n f=3\r\n#print(f,l,r,a,team)\r\n\r\nif f==0:\r\n if r>a:\r\n r-=a\r\n team+=(a2)\r\n a=0\r\n #print(1,1,l,r,a,team)\r\n elif r<a:\r\n a-=r\r\n team+=(r2)\r\n r=0\r\n #print(1,2,l,r,a,team)\r\n else:\r\n team+=(a2)\r\n a=0\r\n r=0\r\n #print(1,3,l,r,a,team)\r\n if a%2==0:\r\n team+=(a)\r\n #print(1,4,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(1,5,l,r,a,team)\r\nelif f==1:\r\n if l>a:\r\n l-=a\r\n team+=(a2)\r\n a=0\r\n #print(2,1,l,r,a,team)\r\n elif l<a:\r\n a-=l\r\n team+=(l2)\r\n l=0\r\n #print(2,2,l,r,a,team)\r\n else:\r\n team+=(a2)\r\n a=0\r\n l=0\r\n #print(2,3,l,r,a,team)\r\n if a%2==0:\r\n team+=(a)\r\n #print(2,4,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(2,5,l,r,a,team)\r\n \r\nelse:\r\n if a%2==0:\r\n team+=(a)\r\n #print(3,1,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(3,2,l,r,a,team)\r\n\r\nprint(team)", "l,r,a = map(int,input().split())\r\nif(l==r):\r\n print(2(l+a//2))\r\nelif(l>r):\r\n add = l-r\r\n if(a>add):\r\n a-=add\r\n print(2(l+a//2))\r\n else:\r\n print(2(r+a))\r\nelif(r>l):\r\n add = r-l\r\n if(a>add):\r\n a-=add\r\n print(2(r+a//2))\r\n else:\r\n print(2(l+a))", "l, r, a = [int(x) for x in input().split()]\r\n\r\nfor i in range(a):\r\n if a>0:\r\n z=min(l,r)\r\n if l==z:\r\n a-=1\r\n l+=1\r\n elif r==z:\r\n a-=1\r\n r+=1\r\n\r\nk=min(l,r)2\r\nif k%2==0: print(k)\r\nelse: print(k-2)", "l,r,a=map(int,input().split())\r\nif l>=r:\r\n n=r2\r\n l-=n//2\r\n while l!=0 and a!=0:\r\n n+=2\r\n l-=1\r\n a=a-1\r\n if a!=0:\r\n n+=(a//2)2\r\nelse:\r\n n=l2\r\n r-=n//2\r\n while r!=0 and a!=0:\r\n n+=2\r\n r-=1\r\n a=a-1\r\n if a!=0:\r\n n+=(a//2)2\r\nprint(n)\r\n", "a,b,c=map(int,input().split());print(2min(a+c,b+c,(a+b+c)//2))", "l,r,a=map(int,input().split())\r\n\r\nmin1,max1=min(l,r),max(l,r)\r\nmax1-=min1\r\nmin1=2\r\nif(a<=max1):\r\n print(min1+a2)\r\nelse:\r\n print(min1+((a+max1)//2)2)\r\n", "\r\nl,r,a=map(int,input().split())\r\nif l==r:\r\n x=(int)(l+a/2)2\r\n print(x)\r\nelif l<r:\r\n if (r-l)>a:\r\n print((l+a)2)\r\n else :\r\n a=a-(r-l)\r\n l=r\r\n x=(int)(l+a/2)2\r\n print(x)\r\nelse :\r\n if (l-r)>a:\r\n print((r+a)2)\r\n else :\r\n a=a-(l-r)\r\n r=l\r\n x=(int)(l+a/2)2\r\n print(x)\r\n", "l, r, a = map(int, input().split())\r\nc = min(l, r)\r\nx = min(max(r, l) - min(r, l), a)\r\nc += x\r\na -= x\r\nc += (a // 2)\r\nprint(c * 2)", "l,r,a = (int(x) for x in input().split())\r\nif l < r:\r\n l,a = min(r,l+a),max(0,a-(r-l))\r\nelif r < l:\r\n r,a = min(l,r+a),max(0,a-(l-r))\r\nprint(min(l,r)2 + 2(a//2))\r\n\r\n\r\n", "l,r,a=map(int,input().split())\r\nif min(l,r)+a<=max(l,r):\r\n print((min(l,r)+a)2)\r\nelse:\r\n if (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\n \r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nl,r,a = get_int_list()\r\n\r\nif l == r:\r\n print( l+r+a - a%2 )\r\nelse:\r\n diff = abs(r-l)\r\n if diff <= a:\r\n a -= diff\r\n print(l+r+diff + a - a%2)\r\n else:\r\n m = min(l,r) + a\r\n print( 2m )\r\n \r\n\r\n", "l,r,a=map(int,input().split())\r\nx,y=min(l,r),max(l,r)\r\ny-=x\r\nif(y>=a):\r\n\tprint((x+a)2)\r\nelse:\r\n\ta-=y\r\n\tprint((x+y+a//2)2)", "def solve(l, r, a):\n ans = 0\n for i in range(2, l + r + a + 1, 2):\n rem_a = a\n half = i // 2\n if l < half:\n rem_a -= (half - l)\n if rem_a < 0:\n continue\n if r < half:\n rem_a -= (half - r)\n if rem_a < 0:\n continue\n ans = i\n return ans\n\nif __name__ == '__main__':\n l, r, a = list(map(int, input().split()))\n print(solve(l, r, a))\n\n\t\t \t \t \t\t\t \t \t\t \t\t \t \t", "def Min(a,b):\r\n if a < b:\r\n return a\r\n else:\r\n return b\r\ndef Max(a,b):\r\n if a > b:\r\n return a\r\n else:\r\n return b\r\ns = input()\r\nl,r,a = s.split()\r\nl = int(l)\r\nr = int(r)\r\na = int(a)\r\nmn = Min(l,r)\r\nmx = Max(l,r)\r\nmn += a\r\nif mn < mx:\r\n print(mn2)\r\nelse:\r\n if (mn+mx)%2 == 1:\r\n print(mn+mx-1)\r\n else:\r\n print(mn+mx)\r\n", "l, r, a = [int(x) for x in input().split()]\r\nmini = min(l,r)\r\nmaxi = max(l,r)\r\nwhile (a>0):\r\n if mini<maxi:\r\n mini+=1\r\n a-=1\r\n elif mini>=maxi:\r\n maxi+=1\r\n a-=1\r\n \r\nprint(min(mini,maxi)2)", "[l, r, a] = map(int, input().split())\nif l + a < r:\n print(2 * (l + a))\nelif r + a < l:\n print(2 * (r + a))\nelse:\n print(((l + r + a) // 2) * 2)", "l,r,a = map(int, input().split())\r\n\r\nif abs(l-r)>=a:\r\n if l>r:\r\n r+=a \r\n else:\r\n l+=a \r\n print(2min(l,r))\r\n\r\nelif l-r == 0:\r\n print(l+r+2(a//2))\r\n\r\nelse:\r\n diff = abs(l-r)\r\n if l>r:\r\n r+=diff \r\n else:\r\n l+=diff \r\n\r\n a-=diff \r\n print(l+r+2(a//2)) # 19 19 a=19 -> #28 28 a->1\r\n\r\n\r\n", "l,r,a=(int(i) for i in input().split())\r\nif(r<l):\r\n d=min(a,l-r)\r\n r+=d\r\n a-=d\r\nelse:\r\n d=min(a,r-l)\r\n l+=d\r\n a-=d\r\nprint(2min(r,l)+((a//2)2))", "l,r,a = map(int, input().split())\r\n\r\nres = min(l, r)\r\nl -= res\r\nr -= res\r\nres = 2\r\naa = max(l, r)\r\nres2 = min(aa, a)\r\nres += res2 * 2\r\na -= res2\r\nres += a//2 * 2\r\nprint(res)\r\n", "l, r, a = map(int, input().split())\n\nans = min(l, r)\nl -= ans\nr -= ans\n\ng = min(max(l, r), a)\nans += g\na -= g\n\nans += a // 2\n\nprint(ans * 2)\n", "l,r,a=[int(x)for x in input().split()]\r\nwhile l < r and a !=0:\r\n l +=1\r\n a -=1\r\nwhile r < l and a !=0:\r\n r+=1\r\n a-=1\r\nl+=a//2\r\nr+=a//2\r\nprint(min(l,r)2)", "l,r,a = map(int,input().split())\r\nif l == 0 and r == 0 and a == 0:\r\n print(0)\r\n exit()\r\nfor i in range(a):\r\n if l == min(l,r):\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)2)", "l,r,a = map(int,input().split())\nmini = min(l,r)\nmaxi = max(l,r)\nif maxi - mini >= a :\n print((mini+a)2)\nelse :\n a -= maxi-mini\n print(maxi 2 + (a if a %2 ==0 else a-1))\n\n", "#### A. Left-handers, Right-handers and Ambidexters\r\n\r\nl, r, a = map(int, input().split())\r\n\r\n# Distribute the ambidexters to the weaker side (left or right)\r\n# until we run out of either left-handers or right-handers\r\nwhile a > 0 and (l > 0 or r > 0):\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\n\r\n# Distribute the remaining ambidexters equally to both sides\r\nteam_size = (min(l, r) + a // 2) * 2\r\n\r\nprint(team_size)\r\n\r\n\r\n ", "l, r, a = map(int, input().split())\r\nans = 0\r\nfor i in range(a):\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)2)", "l, r, a = map(int, input().split())\r\nans = min(l, r) 2\r\nl -= ans // 2\r\nr -= ans // 2\r\nif a != 0:\r\n if a >= max(l ,r):\r\n ans += 2 * max(l, r)\r\n a -= max(l, r)\r\n if a >= 2:\r\n ans += (a - a % 2)\r\n else:\r\n ans += 2 * a\r\n \r\nprint(ans)", "l,r,a=map(int,input().split())\r\nx=0\r\nif l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)2)\r\nelif l<r and a>0:\r\n while(a and l<r):\r\n l=l+1\r\n a=a-1\r\n if a>0 and l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)2)\r\n elif a==0:\r\n x=min(l,r)\r\n x=x2\r\nelif r<l and a>0:\r\n while(a and r<l):\r\n r=r+1\r\n a=a-1\r\n if a>0 and l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)2)\r\n elif a==0:\r\n x=min(l,r)\r\n x=x2\r\nelif a==0 and (l<r or r<l):\r\n x=min(l,r)\r\n x=x2\r\nprint(x) ", "L, R, A = list(map(int, input().split()))\r\nmlr = min(L, R)\r\nrst = L+R-2mlr\r\nmra = min(rst, A)\r\nA -= mra\r\nprint(2 (mlr + mra + A // 2))\r\n", "a,b,c=map(int,input().split())\r\nprint((min(min(a,b)+(min(abs(a-b),c)),max(a,b))+max(0,(c-abs(a-b))>>1))<<1)", "l, r, a = map(int, input().split())\r\nMax = 0\r\nfor i in range(a+1):\r\n Max = max(Max, min(l+i, r+a-i)2)\r\nprint(Max)\r\n", "l, r, a = map(int, input().split())\r\nif l + a < r:\r\n print(2 (l + a))\r\nelif r + a < l:\r\n print(2 * (r + a))\r\nelse:\r\n s = l + r + a\r\n print(s - (s%2))", "l,r,a=map(int,input().split())\r\nif a==0 and (l==0 or r==0):\r\n\tprint(0)\r\nelse:\r\n\twhile a>0:\r\n\t\tif l<r:\r\n\t\t\tl+=1\r\n\t\telse:\r\n\t\t\tr+=1\r\n\t\ta-=1\r\n\tprint(min(l,r)2)", "l, r, a = map(int, input().split())\n\nwhile l < r and a != 0:\n l += 1\n a -= 1\n\nwhile r < l and a != 0:\n r += 1\n a -= 1\n\nif a in [0, 1]:\n print((r if r < l else l)2)\nelse:\n print((r + a//2)2)\n", "if __name__==\"__main__\":\r\n l,r,a=map(int,input().split())\r\n if(l>(r+a)):\r\n print(2(r+a))\r\n elif(r>(l+a)):\r\n print(2(l+a))\r\n else:\r\n print(2max(l,r)+2((a-abs(r-l))//2))\r\n", "a,b,c=map(int,input().split());g=max(a,b);a=min(a,b);b=g\r\nx=b-a\r\na=a+min(x,c)\r\nb=a\r\nc=c-min(x,c)\r\nprint(a+b+c-c%2)", "l,r,a=map(int,input().split())\r\np=min(l,r)\r\nl-=p\r\nr-=p\r\np1=min(l,a)\r\nl-=p1\r\na-=p1\r\np2=min(r,a)\r\nr-=p2\r\na-=p2\r\np3=a//2\r\nprint(2(p+p1+p2+p3))", "a,b,c = map(int,input().split())\r\nif(a == b):\r\n c = c//2 \r\n ans = int(a + c)\r\n print(ans * 2)\r\nelif(c == 0):\r\n print(min(a,b)2)\r\nelif(a < b):\r\n diff = b - a \r\n if (c <= diff):\r\n print((a+c)2)\r\n else:\r\n a += diff\r\n c -= diff \r\n c = c//2\r\n ans = int(a + c)\r\n print(ans * 2)\r\n \r\nelif(a > b):\r\n diff = a - b \r\n if (c <= diff):\r\n print((b+c)2)\r\n else:\r\n b += diff\r\n c -= diff \r\n c = c//2\r\n ans = int(b + c)\r\n print(ans 2) ", "l,r,a = map(int, input().split())\r\nmx = max(l,r)\r\nmn = min(l,r)\r\nif mn+a <= mx:\r\n print((mn+a)2)\r\nelse:\r\n t = 0\r\n t += mx2\r\n a -= (mx-mn)\r\n if a>=2:\r\n t+=(a//2)2\r\n print(t)", "a, b, c = map(int, input().split())\nm = min(a, b)\nl, r = m, m\na -= m\nb -= m\nwhile a and c:\n l += 1\n r += 1\n a -= 1\n c -= 1\nwhile b and c:\n l += 1\n r += 1\n b -= 1\n c -= 1\nwhile c > 1:\n l += 1\n r += 1\n c -= 2\nprint(l + r)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nl,r,a=map(int, input().split())\r\nl, r = min(l,r), max(l,r)\r\nb = r-l\r\nif b<=a:\r\n a-=b\r\n print((r+a//2)2)\r\nelse:\r\n print((l+a)2)", "l, r, a = list(map(int, input().split()))\r\nn1 = min(l, r)\r\nl -= n1\r\nr -= n1\r\nn1 = 2\r\nn2 = min(max(l, r), a)\r\na -= n2\r\nn2 = 2\r\nn3 = 2 int(a/2)\r\nprint(n1 + n2 + n3)", "l, r, a = map (int, input ().split ())\r\nif l > r : l, r = r, l\r\nif l + a <= r : print (2 * (l + a))\r\nelse : print ((r + (a - (r - l)) // 2) * 2)\r\n\r\n", "a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nwhile c!=0:\n if a>b:\n c-=1\n b+=1\n else:\n c-=1\n a+=1\nprint(min(a,b)2)\n", "(l, r, a) = map(int, input().split(' '))\r\nma = max(l,r)\r\nmi = min(l,r)\r\nif ma >= mi+a:\r\n print((mi+a)2)\r\nelse:\r\n dif = (ma-mi)-1\r\n if a>= dif:\r\n mi+=dif\r\n a-=dif\r\n a = int(a/2)\r\n print(mi+ma+(a2))", "l,r,a = map(int,input().split())\r\nl,r = min(l,r),max(l,r)\r\n\r\nwhile l<r and a!=0:\r\n\tl+=1\r\n\ta-=1\r\n\r\nprint(2l+2(a//2))", "l,r,a = map(int, input().split())\r\n\r\nans = 0\r\nx = min(l,r)\r\nm = max(l,r)\r\nz = max(a- (m-x), 0)\r\nx += a - z\r\na = z\r\nif a % 2 != 0:\r\n a -= 1\r\nx += a//2\r\n\r\nprint(2x)\r\n", "arr=list(map(int,(input().split())))\r\nd= abs(arr[0]-arr[1])\r\nif d>arr[2]:\r\n c=min(arr[0],arr[1])+arr[2]\r\nelse:\r\n c=sum(arr)//2\r\nprint(c2)", "l, r, a = map(int, input().split())\r\nx = max(l, r)\r\ny = min(l, r)\r\nif x - y >= a:\r\n print((y + a) * 2)\r\nelse:\r\n print(x * 2 + (y - x + a)//2 * 2)", "L, R, a = list(map(int, input().split()))\r\nif L == R:\r\n print(L2+((a//2)2))\r\nelse:\r\n if L+a <= R or R+a <= L:\r\n print(min(L+a, R+a)2)\r\n else:\r\n if L < R:\r\n print(R2+((a-R+L)//2)2)\r\n else:\r\n print(L2+(((a-L+R)//2)2))\r\n", "l, r, a = map(int, input().split())\r\ndif = max(r, l) - min(r, l)\r\nif dif >= a:\r\n print((min(r, l) + a) 2 )\r\nelse:\r\n print(max(r, l) * 2 + (a - dif)//2 * 2)", "s=[int(n) for n in input().split()]\r\nm=0\r\nif s[1]==s[0]:\r\n\tm=2s[0]\r\n\tif s[2]>=2:\r\n\t\tm+=2(s[2]//2)\r\nelif s[1]>s[0]:\r\n\tk=s[0]+s[2]\r\n\tif k==s[1]:\r\n\t\tm=2k\r\n\telif k>s[1]:\r\n\t\td=k-s[1]\r\n\t\tm=2s[1]\r\n\t\tif d>=2:\r\n\t\t\tm=m+2(d//2)\r\n\telif k<s[1]:\r\n\t\td=s[1]-k\r\n\t\tm=2k\r\n\t\t\r\nelif s[0]>s[1]:\r\n\tk=s[1]+s[2]\r\n\tif k==s[0]:\r\n\t\tm=2k\r\n\telif k<s[0]:\r\n\t\td=s[0]-k\r\n\t\tm=2k\r\n\t\t\r\n\telif k>s[0]:\r\n\t\td=k-s[0]\r\n\t\tm=2s[0]\r\n\t\tif d>=2:\r\n\t\t\tm+=2(d//2)\r\n\t\t\r\nprint(m)", "l, r, a = list(map(int, input().split()))\r\n\r\nif a + l <= r:\r\n print(2(a+l))\r\nelif a + r <= l:\r\n print(2(a+r))\r\nelse:\r\n if (a+l+r) % 2 == 0:\r\n print(a+l+r)\r\n else:\r\n print(a+l+r-1)", "#ismail moussi\r\nli =list(map(int,input().split()))\r\n\r\nwhile li[2]:\r\n if li[0]<li[1]:\r\n li[0]+=1\r\n else:\r\n li[1]+=1\r\n li[2] -= 1\r\nprint(min(li[0],li[1])2) ", "a,b,c=map(int, input().split())\r\nsize=min(a,b)\r\na-=size\r\nb-=size\r\nsize=size2\r\nx=max(min(a+c,b),min(b+c,a))\r\nsize=size+x2+((c-x)//2)2\r\nprint(size)\r\n", "from math import floor\nimport sys\n\nl, r, a = sys.stdin.readline().split()\nl, r, a = int(l), int(r), int(a)\n\nmin = min(l, r)\nmax = max(l, r)\n\nif min+a <= max:\n print (2(min+a))\nelse:\n print (((min+a+max)//2)2)\n", "def solve(l, r, a):\n x = abs(l - r)\n y = min(x, a)\n x = min(l, r) + y\n return (x + (a - y)//2)2\n\n\ndef main():\n l, r, a = list(map(int, input().split()))\n print(solve(l, r, a))\n\n\nmain()\n", "# cf 950 A 900\nl, r, a = map(int, input().split())\n\nif l < r:\n d = r - l\n d = min(a, d)\n l += d\n a -= d\nelse:\n d = l - r\n d = min(a, d)\n r += d\n a -= d\n\nprint(2 (min(l, r) + a // 2))\n", "l,r,a=map(int,input().split())\r\nx=min(l,r)\r\nd=abs(l-r)\r\nif d>a:\r\n ans=(x+a)2\r\nelif d<=a:\r\n a=a-d\r\n ans=(x+d+a//2)2\r\nprint(ans)", "l,r,a = map(int, input().split())\nif (max(l,r)-min(l,r)) >= a:\n print(2(min(l,r)+a))\nelse:\n print(2(int((a-(max(l,r)-min(l,r)))/2) + max(l,r)))", "l, r, a = list(map(int, input().split(' ')))\r\nx = 0\r\nfor i in range(a + 1):\r\n tl = l + i\r\n tr = r + a - i\r\n x = max(x, min(tl, tr) * 2)\r\nprint(x)\r\n", "a = list(map(int, input().split()))\r\nt = min(a[0], a[1])\r\nr = max(a[0], a[1])\r\nk = a[2]+t-r\r\nn = k>0\r\nm = (t + min((r-t), a[2])+nk//2)2\r\nprint(m)", "(left_handers, right_handers, ambidexters) = map(int, input().split(' '))\n\nif left_handers > right_handers:\n if left_handers >= right_handers + ambidexters:\n print((right_handers + ambidexters) * 2)\n else:\n print(left_handers * 2 + (right_handers + ambidexters - left_handers)// 2 * 2)\n\nelif right_handers > left_handers:\n if right_handers >= left_handers + ambidexters:\n print((left_handers + ambidexters) * 2)\n else:\n print(right_handers * 2 + (left_handers + ambidexters - right_handers)// 2 * 2)\n\nelif right_handers == left_handers:\n print(right_handers * 2 + ambidexters // 2 * 2)", "l, r, a = map(int, input().split())\r\n\r\nprint (min(min((l + r + a) // 2, l + a), r + a) * 2)\r\n", "l, r, a = (int(i) for i in input().split())\nl, r = min(l, r), max(l, r)\nd = min(a, r - l)\nres = 2 * (l + d + (a - d) // 2)\nprint(res)\n", "i1,i2,a=map(int,input().split())\r\nl=min(i1,i2)\r\nr=max(i1,i2)\r\nif(a>=r-l):\r\n a-=r-l\r\n print(r2+a-a%2)\r\nelse:\r\n print((l+a)2)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nl,r,a=map(int,input().split())\r\nif r<l:r,l=l,r\r\nl,a=l+min(a,r-l),a-min(a,r-l)\r\nprint(2(l+a//2))", "l,r,a=map(int,input().split())\r\nprint((min(l,r)+min(abs(l-r),a)+max(0,(a-abs(l-r))//2))2)", "l, r, a = map(int, input().split())\r\nn = (l + r + a) // 2\r\nfor x in range(n, -1, -1):\r\n if x * 2 - min(l, x) - min(r, x) <= a:\r\n print(x * 2)\r\n break", "l, r, a = map(int, input().split())\nans = 0\nfor x in range(0, a+1):\n y = a-x\n ans = max(ans, min(l+x, r+y)2)\nprint(ans)\n", "l,r,a=map(int,input().split())\r\ncnt=0\r\nl,r=min(l,r),max(l,r)\r\nif(l+a<=r):\r\n print(2(l+a))\r\nelse:\r\n cnt=2r\r\n diff=(l+a-r)\r\n cnt+=2(int(diff/2))\r\n print(cnt)", "a,b,c = map(int,input().split())\r\nif c-abs(a-b)>0:print((max(a,b)+ (c-abs(a-b))//2)2)\r\nelse:print((min(a,b)+c)2)", "line = input()\nl, r, a = list(map(int, line.strip().split()))\n#print(l, r, a)\nmmin = min(l, r)\nmmax = max(l, r)\n\nif a + mmin <= mmax:\n print(2 * (a + mmin))\nelse:\n left = a + mmin - mmax\n print(2 * (mmax + left // 2))\n\t\t \t \t\t\t\t \t \t \t\t \t\t", "l,r,m=map(int,input().split())\r\nif l+m<=r:\r\n print(2(l+m))\r\nelif r+m<=l:\r\n print(2(r+m))\r\nelse:\r\n if l<r:\r\n m=m-(r-l)\r\n l=r\r\n k=m//2\r\n print(2(l+k))\r\n else:\r\n m=m-(l-r)\r\n r=l\r\n k=m//2\r\n print(2(r+k))\r\n ", "l, r, a = [int(k) for k in input().split(' ') if k]\nlh = l\nrh = r\nif lh < rh:\n add = min(rh - lh, a)\n lh += add\n a -= add\nelif rh < lh:\n add = min(lh - rh, a)\n rh += add\n a -= add\nif a > 0:\n lh += a // 2\n rh += a // 2\nprint(2 * min(lh, rh))\n\n", "l, r, a = map(int, input().split())\r\nif l == r:\r\n l += (a // 2)\r\n r += (a // 2)\r\n print(l + r)\r\nif r > l:\r\n if l + a < r:print(2 * (l + a))\r\n elif r < l + a:\r\n if (l+r+a)%2==0:print((l+r+a))\r\n else:print(l + r + a - 1)\r\n elif l + a == r:print(l + r + a)\r\n#########################\r\nif l > r:\r\n if r + a < l:print(2 * (r + a))\r\n elif l < r + a:\r\n if (l + a + r ) % 2 == 0:print(l+a+r)\r\n else:print(l + r + a - 1)\r\n elif r + a == l:print(l + r + a)\r\n#########################\r\n", "l, r, a = map(int, input().split())\nif l == r:\n\tprint((l + a//2)2)\nelif l < r:\n\tif l + a < r:\n\t\tprint((l + a)2)\n\telif l + a == r:\n\t\tprint(r2)\n\telse:\n\t\tprint((r + (a - r + l)//2)2)\nelse:\n\tif r + a < l:\n\t\tprint((r + a)2)\n\telif r + a == l:\n\t\tprint(l2)\n\telse:\n\t\tprint((l + (a - l + r)//2)2)\n", "l, r, a = (int(x) for x in input().split())\r\nless = min(l, r)\r\nmore = max(l, r)\r\nwhile less < more and a > 0:\r\n less += 1\r\n a -=1\r\nrest = a // 2\r\n\r\nprint(2 (less + rest))", "l,r,a=map(int,input().split())\r\nif l>r:\r\n\tl,r=r,l\r\nif l+a<=r:\r\n\tprint(2(l+a))\r\nelse:\r\n\ta-=(r-l)\r\n\tprint((2r)+(2(a//2)))", "l,r,a = map(int,input().split(\" \"))\r\n\r\nwhile a > 0:\r\n if(l<r):\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l,r)2)", "from math import floor\r\nl,r,a=map(int,input().split())\r\nc=floor((l+r+a)/2)\r\nprint(2min(l+a,r+a,c))", "l,r,a=map(int,input().split())\r\ntemp=2(min(l,r))\r\ntemp1=(max(l,r)-min(l,r))\r\nif temp1<=a:\r\n print(temp+2temp1+((a-temp1)//2)2)\r\nelse:\r\n print(temp+2a)", "# For Left-handers, Right-handers and Ambidexters\r\n# https://codeforces.com/problemset/problem/950/A\r\n\r\nl,r,a = map(int, input().split())\r\n\r\nb = min(l,r)\r\nc = max(l,r)\r\n\r\n# on l=1 r=4 a=2, we have b=1, c=4\r\n# we have a=2 < (c-b=3), we can use a+b left handers, and a+b right handers\r\n\r\nif (a <= c-b):\r\n print((a+b)2)\r\nelse:\r\n sum = a + b + c\r\n print(sum - (sum%2))\r\n", "l,r,a = list(map(int,input().split()))\r\nmipa = min(l,r) + a\r\nprint((mipa<<1) if mipa <= max(l,r) else (((l+r+a)//2)<<1))\r\n", "a,b,c=[int(i) for i in input().split()]\r\nif(a>b):\r\n a,b=b,a\r\nt = min(b-a,c)\r\na+=t\r\nc-=t\r\nprint((a+(c//2))2)\r\n", "l,r,a=map(int,input().split())\r\nif l+a<=r:print(2(l+a))\r\nelif r+a<=l:print(2(r+a))\r\nelse:\r\n print((l+r+a)//22)", "l,r,a=map(int,input().split())\r\n\r\nif min(l,r) + a<=max(l,r):\r\n print(2min(l,r)+a2)\r\nelse:\r\n a-=max(l,r) -min(l,r)\r\n ans = max(l,r) +a//2\r\n print(ans2)", "s = list(map(int, input().split()))\nl = s[0]\nr = s[1]\na = s[2]\nans = 0\n\nwhile(True):\n if l==r:\n temp = a//2\n ans = l+r+temp2\n break\n elif l>r:\n if a!=0:\n r+=1\n a-=1\n else:\n ans = r2\n break\n elif r>l:\n if a>0:\n l+=1\n a-=1\n else:\n ans = l2\n break\nprint (ans)\n", "l,r,a = map(int, input().split())\nt = 0\nm = min(l,r)\nl -= m\nr -= m\nt += 2m\ns = l + r\nm = min(l+r,a)\nt += 2m\na -= m\nt += 2 * int(a/2)\nprint(t)\n", "s=[int(a) for a in input().split()]\nif(s[0]>s[1]):\n\ts[0],s[1]=s[1],s[0]\ndiff=s[1]-s[0]\nif diff<=s[2]:\n\ts[2]-=diff\n\ts[0]+=diff\n\ts[0]+=s[2]//2\n\ts[1]+=s[2]//2\nelse:\n\ts[0]+=s[2]\n\nprint(2min(s[0],s[1]))\n", "l,r,a = map(int,input().split())\r\nmn=min(l,r)\r\nmx=max(l,r)\r\n\r\nmn+=a\r\nif mn<=mx :\r\n print(mn2)\r\nelif mn>mx :\r\n eltar=mn-mx\r\n if eltar%2==0 :\r\n print(2mx + eltar)\r\n else : print(2mx + eltar-1)\r\n\r\n\r\n #\r\n # لو هو فيه\r\n\r\n # لو هو فيه بزيادة\r\n # لو هو مفهوش", "\r\nI = input()\r\nmyIntegers = [int(x) for x in I.split()]\r\nl = myIntegers[0]\r\nr = myIntegers[1]\r\na = myIntegers[2]\r\n\r\nif r > l:\r\n t = r\r\n r = l\r\n l = t\r\n\r\nmax = 0\r\n\r\nif l==r:\r\n print(l+r+a&~(1))\r\nelse:\r\n if r+a<=l:\r\n print(2(r+a))\r\n else:\r\n a = a+r-l;\r\n print(2l+a&~(1))\r\n", "l, r, a = [int(x) for x in input().split()]\r\n\r\ns = l + r + a\r\nif s % 2 != 0:\r\n s -= 1\r\n\r\nwhile s != 0:\r\n h = s / 2\r\n leftOk = False\r\n if l >= h:\r\n leftOk = True\r\n elif l <= h <= l + a:\r\n a -= (h - l)\r\n leftOk = True\r\n if h <= r + a and leftOk:\r\n break\r\n\r\n s -= 2\r\n\r\nprint(s)\r\n", "x=input()\r\nk=[int(i) for i in x.split()]\r\nprint(2min(k[0]+k[2],k[1]+k[2],(k[2]+k[0]+k[1])// 2))", "l,r,a=map(int,input().split())\r\ns=max(l,r)\r\nd=min(l,r)\r\nh=s-d\r\nif h>=a:\r\n\tprint((d+a)2)\r\nelif a>h:\r\n\tt=a-h\r\n\tz=int(t/2)\r\n\tp=d+h+z\r\n\tprint(p2)\r\n", "l,r,a=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(a+1):\r\n l1=l+i\r\n r1=r+a-i\r\n m=max(m,min(l1,r1)2)\r\nprint(m)", "from math import fabs\r\nl, r, a = map(int,input().split())\r\nif fabs(l-r)<a:\r\n c = (l+r+a) if (l+r+a)%2==0 else l+r+a-1\r\nelif fabs(l-r)>a:\r\n c = 2(min(l,r) + a)\r\nelse:\r\n c = l+r+a\r\nprint(c)", "l,r,a = map(int,input().split())\r\nans = 0\r\nwhile a != 0:\r\n if l < r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(r,l) 2)", "import sys\n\na,b,c = input().split(' ')\na,b,c = [int(a), int(b), int(c)]\n\n\nif a==b:\n\tprint(a+b+(c-c%2))\n\nelse:\n\n\tif a<b:\n\n\t\td = b - a\n\n\t\tif d>c:\n\t\t\ta = a + c\n\t\t\tb = b - abs(a-b)\n\n\t\telse:\n\n\t\t\ta = a + d\n\t\t\tc = c - d\n\n\t\t\ta = a + c//2\n\t\t\tb = b + c//2\n\n\t\tprint(2a)\n\t\tsys.exit(0)\n\n\telse:\n\n\t\td = a - b\n\n\t\tif d>c:\n\t\t\tb = b + c\n\t\t\ta = a - abs(a-b)\n\t\t\t\n\t\telse:\n\n\t\t\tb = b + d\n\t\t\tc = c - d\n\n\t\t\ta = a + c//2\n\t\t\tb = b + c//2\n\n\t\tprint(2b)\n\t\tsys.exit(0)\n" ]	{"inputs": ["1 4 2", "5 5 5", "0 2 0", "30 70 34", "89 32 24", "89 44 77", "0 0 0", "100 100 100", "1 1 1", "30 70 35", "89 44 76", "0 100 100", "100 0 100", "100 1 100", "1 100 100", "100 100 0", "100 100 1", "1 2 1", "0 0 100", "0 100 0", "100 0 0", "10 8 7", "45 47 16", "59 43 100", "34 1 30", "14 81 1", "53 96 94", "62 81 75", "21 71 97", "49 82 73", "88 19 29", "89 4 62", "58 3 65", "27 86 11", "35 19 80", "4 86 74", "32 61 89", "68 60 98", "37 89 34", "92 9 28", "79 58 98", "35 44 88", "16 24 19", "74 71 75", "83 86 99", "97 73 15", "77 76 73", "48 85 55", "1 2 2", "2 2 2", "2 1 2", "2 2 1", "3 2 1", "1 2 3", "1 3 2", "2 1 3", "2 3 1", "3 1 2", "99 99 99", "99 99 100", "99 100 99", "99 100 100", "100 99 99", "100 99 100", "100 100 99", "89 32 23", "4 5 0", "3 0 3", "0 0 2", "97 97 0", "1 4 0", "5 2 0", "0 5 10", "0 1 2", "5 2 3", "5 5 0", "0 0 10", "0 1 1", "0 0 1"], "outputs": ["6", "14", "0", "128", "112", "210", "0", "300", "2", "130", "208", "200", "200", "200", "200", "200", "200", "4", "100", "0", "0", "24", "108", "202", "62", "30", "242", "218", "188", "204", "96", "132", "126", "76", "134", "156", "182", "226", "142", "74", "234", "166", "58", "220", "268", "176", "226", "188", "4", "6", "4", "4", "6", "6", "6", "6", "6", "6", "296", "298", "298", "298", "298", "298", "298", "110", "8", "6", "2", "194", "2", "4", "14", "2", "10", "10", "10", "2", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	404
d3d3a53758643400bf3241186c9e43bb	Regular Bridge	An undirected graph is called k-regular, if the degrees of all its vertices are equal k. An edge of a connected graph is called a bridge, if after removing it the graph is being split into two connected components. Build a connected undirected k-regular graph containing at least one bridge, or else state that such graph doesn't exist. The single line of the input contains integer k (1<=≤<=k<=≤<=100) — the required degree of the vertices of the regular graph. Print "NO" (without quotes), if such graph doesn't exist. Otherwise, print "YES" in the first line and the description of any suitable graph in the next lines. The description of the made graph must start with numbers n and m — the number of vertices and edges respectively. Each of the next m lines must contain two integers, a and b (1<=≤<=a,<=b<=≤<=n, a<=≠<=b), that mean that there is an edge connecting the vertices a and b. A graph shouldn't contain multiple edges and edges that lead from a vertex to itself. A graph must be connected, the degrees of all vertices of the graph must be equal k. At least one edge of the graph must be a bridge. You can print the edges of the graph in any order. You can print the ends of each edge in any order. The constructed graph must contain at most 106 vertices and 106 edges (it is guaranteed that if at least one graph that meets the requirements exists, then there also exists the graph with at most 106 vertices and at most 106 edges). Sample Input 1 Sample Output YES 2 1 1 2	[ "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\nif k == 1:\r\n ans = [\"YES\", \"2 1\", \"1 2\"]\r\nelif not k % 2:\r\n ans = [\"NO\"]\r\nelse:\r\n ans = [\"YES\"]\r\n n = 2002\r\n e = [\"1 1001\", \"1002 2002\", \"1001 2002\"]\r\n for i in range(1, 1001):\r\n e.append(\" \".join(map(str, (i, i + 1))))\r\n for i in range(1002, 2002):\r\n e.append(\" \".join(map(str, (i, i + 1))))\r\n for i in range(1, 501):\r\n e.append(\" \".join(map(str, (i, i + 500))))\r\n for i in range(1002, 1502):\r\n e.append(\" \".join(map(str, (i, i + 500))))\r\n d = 2\r\n for _ in range(k // 2 - 1):\r\n g = math.gcd(1001, d)\r\n for i in range(g):\r\n j = i\r\n for _ in range(1001 // g):\r\n k = (j + d) % 1001\r\n e.append(\" \".join(map(str, (j + 1, k + 1))))\r\n e.append(\" \".join(map(str, (j + 1002, k + 1002))))\r\n j = k\r\n d += 1\r\n m = len(e)\r\n ans.append(\" \".join(map(str, (n, m))))\r\n ans.append(\"\\n\".join(e))\r\nsys.stdout.write(\"\\n\".join(ans))", "k=int(input())\r\nif k&1:\r\n\tprint('YES')\r\n\thn=(k<<1)-1\r\n\tprint(hn<<1,hn*k)\r\n\tfor t in range(0,hn+1,hn):\r\n\t\tfor i in range(1,k,2):\r\n\t\t\tprint(i+t,i+t+1)\r\n\t\tfor i in range(1,k):\r\n\t\t\tfor j in range(k,hn):\r\n\t\t\t\tprint(i+t,j+t)\r\n\t\tfor i in range(k,hn):\r\n\t\t\tprint(i+t,hn+t)\r\n\tprint(hn,hn<<1)\r\nelse:\r\n\tprint('NO')" ]	{"inputs": ["1", "3", "11", "10", "2", "4", "5", "6", "7", "8", "9", "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"], "outputs": ["YES\n2 1\n1 2", "YES\n10 15\n1 6\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5\n4 5\n6 7\n6 8\n7 9\n7 10\n8 9\n8 10\n9 10", "YES\n26 143\n1 14\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n2 12\n2 13\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n3 12\n3 13\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n4 12\n4 13\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n5 12\n5 13\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n6 12\n6 13\n6 8\n6 9\n6 10\n6 11\n7 12\n7 13\n7 8\n7 9\n7 10\n7 11\n8 12\n8 13\n8 10\n8 11\n9 12\n9 13\n9 10\n9 11\n10 12\n10 13\n11 12\n11 13\n12 13\n14 15\n14 16\n14 17\n14 18\n14 19\n14 20\n14 21\n14 22\n14 23\n14 24\n15 25\n15 26\n15 17\n15...", "NO", "NO", "NO", "YES\n14 35\n1 8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 4\n2 5\n3 6\n3 7\n3 4\n3 5\n4 6\n4 7\n5 6\n5 7\n6 7\n8 9\n8 10\n8 11\n8 12\n9 13\n9 14\n9 11\n9 12\n10 13\n10 14\n10 11\n10 12\n11 13\n11 14\n12 13\n12 14\n13 14", "NO", "YES\n18 63\n1 10\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n2 8\n2 9\n2 4\n2 5\n2 6\n2 7\n3 8\n3 9\n3 4\n3 5\n3 6\n3 7\n4 8\n4 9\n4 6\n4 7\n5 8\n5 9\n5 6\n5 7\n6 8\n6 9\n7 8\n7 9\n8 9\n10 11\n10 12\n10 13\n10 14\n10 15\n10 16\n11 17\n11 18\n11 13\n11 14\n11 15\n11 16\n12 17\n12 18\n12 13\n12 14\n12 15\n12 16\n13 17\n13 18\n13 15\n13 16\n14 17\n14 18\n14 15\n14 16\n15 17\n15 18\n16 17\n16 18\n17 18", "NO", "YES\n22 99\n1 12\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n2 10\n2 11\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n3 10\n3 11\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n4 10\n4 11\n4 6\n4 7\n4 8\n4 9\n5 10\n5 11\n5 6\n5 7\n5 8\n5 9\n6 10\n6 11\n6 8\n6 9\n7 10\n7 11\n7 8\n7 9\n8 10\n8 11\n9 10\n9 11\n10 11\n12 13\n12 14\n12 15\n12 16\n12 17\n12 18\n12 19\n12 20\n13 21\n13 22\n13 15\n13 16\n13 17\n13 18\n13 19\n13 20\n14 21\n14 22\n14 15\n14 16\n14 17\n14 18\n14 19\n14 20\n15 21\n15 22\n15 17\n15 18\n15 19\n15 20\n16 21\n16 22\n16 17\n...", "NO", "YES\n30 195\n1 16\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n2 14\n2 15\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n3 14\n3 15\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n4 14\n4 15\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n5 14\n5 15\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n6 14\n6 15\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n7 14\n7 15\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n8 14\n8 15\n8 10\n8 11\n8 12\n8 13\n9 14\n9 15\n9 10\n9 11\n9 12\n9 13\n10 14\n10 15\n10 12\n...", "NO", "YES\n34 255\n1 18\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n2 16\n2 17\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 16\n3 17\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n4 16\n4 17\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n5 16\n5 17\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n6 16\n6 17\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n7 16\n7 17\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n7 14\n7 15\n8 16\n8 ...", "NO", "YES\n38 323\n1 20\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n2 18\n2 19\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n3 18\n3 19\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n4 18\n4 19\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n5 18\n5 19\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n6 18\n6 19\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n6 16\n...", "NO", "YES\n42 399\n1 22\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n2 20\n2 21\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n3 20\n3 21\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n4 20\n4 21\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n5 20\n5 21\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n5 18\n5 19\n6 20...", "NO", "YES\n46 483\n1 24\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n2 22\n2 23\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n3 22\n3 23\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n4 22\n4 23\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n5 22\n5 23\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12...", "NO", "YES\n50 575\n1 26\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 24\n2 25\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n3 24\n3 25\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n4 24\n4 25\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n4 22\n4 23\n...", "NO", "YES\n54 675\n1 28\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n2 26\n2 27\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n3 26\n3 27\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n4 26\n4 27\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n...", "NO", "YES\n58 783\n1 30\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n2 28\n2 29\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n3 28\n3 29\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3 27\n4 28\n4 29\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n...", "NO", "YES\n62 899\n1 32\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n2 30\n2 31\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n3 30\n3 31\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3 27\n3 28\n3 29\n4 30\n4 ...", "NO", "YES\n66 1023\n1 34\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n2 32\n2 33\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n3 32\n3 33\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3...", "NO", "YES\n70 1155\n1 36\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n2 34\n2 35\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n3 34\n3 35\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3...", "NO", "YES\n74 1295\n1 38\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n2 36\n2 37\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n3 36\n3 37\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3...", "NO", "YES\n78 1443\n1 40\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n2 38\n2 39\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n3 38\n3 39\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3...", "NO", "YES\n82 1599\n1 42\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n2 40\n2 41\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n3 40\n3 41\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3...", "NO", "YES\n86 1763\n1 44\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n2 42\n2 43\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n3 42\n3 43\n3 4\n3 5\n3 6...", "NO", "YES\n90 1935\n1 46\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n2 44\n2 45\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n2 42\n2 43\n3...", "NO", "YES\n94 2115\n1 48\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n2 46\n2 47\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n2...", "NO", "YES\n98 2303\n1 50\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n2 48\n2 49\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2...", "NO", "YES\n102 2499\n1 52\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n2 50\n2 51\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n...", "NO", "YES\n106 2703\n1 54\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n2 52\n2 53\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n...", "NO", "YES\n110 2915\n1 56\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n2 54\n2 55\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n...", "NO", "YES\n114 3135\n1 58\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n2 56\n2 57\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n...", "NO", "YES\n118 3363\n1 60\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n2 58\n2 59\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n...", "NO", "YES\n122 3599\n1 62\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n2 60\n2 61\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n...", "NO", "YES\n126 3843\n1 64\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n2 62\n2 63\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n...", "NO", "YES\n130 4095\n1 66\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n2 64\n2 65\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n...", "NO", "YES\n134 4355\n1 68\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n2 66\n2 67\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n...", "NO", "YES\n138 4623\n1 70\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n2 68\n2 69\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n...", "NO", "YES\n142 4899\n1 72\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n2 70\n2 71\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n...", "NO", "YES\n146 5183\n1 74\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n2 72\n2 73\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n...", "NO", "YES\n150 5475\n1 76\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n2 74\n2 75\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n...", "NO", "YES\n154 5775\n1 78\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n2 76\n2 77\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n...", "NO", "YES\n158 6083\n1 80\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n2 78\n2 79\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n...", "NO", "YES\n162 6399\n1 82\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n2 80\n2 81\n2 4\n2 5\n2 6\n2 7...", "NO", "YES\n166 6723\n1 84\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n2 82\n2 83\n2 4\n2...", "NO", "YES\n170 7055\n1 86\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n2 84\n...", "NO", "YES\n174 7395\n1 88\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n178 7743\n1 90\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n182 8099\n1 92\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n186 8463\n1 94\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n190 8835\n1 96\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n194 9215\n1 98\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n198 9603\n1 100\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n202 9999\n1 102\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO"]}	UNKNOWN	PYTHON3	CODEFORCES	2
d3de88c38870d2f1361cde69bf370df5	Partial Teacher	A teacher decides to give toffees to his students. He asks n students to stand in a queue. Since the teacher is very partial, he follows the following rule to distribute toffees. He looks at the first two students and gives more toffees to the student having higher marks than the other one. If they have the same marks they get the same number of toffees. The same procedure is followed for each pair of adjacent students starting from the first one to the last one. It is given that each student receives at least one toffee. You have to find the number of toffees given to each student by the teacher such that the total number of toffees is minimum. The first line of input contains the number of students n (2<=≤<=n<=≤<=1000). The second line gives (n<=-<=1) characters consisting of "L", "R" and "=". For each pair of adjacent students "L" means that the left student has higher marks, "R" means that the right student has higher marks and "=" means that both have equal marks. Output consists of n integers separated by a space representing the number of toffees each student receives in the queue starting from the first one to the last one. Sample Input 5 LRLR 5 =RRR Sample Output 2 1 2 1 2 1 1 2 3 4	[ "import math\r\nfrom collections import Counter, defaultdict\r\nfrom itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\ns = input()\r\ndp = [[0] * 1005 for i in range(n + 1)]\r\nfor i in range(1, 1001):\r\n dp[0][i] = i\r\ndp[0][1001] = math.inf\r\nfor i in range(n):\r\n dp[i][0] = math.inf\r\nfor i in range(1, n):\r\n if s[i - 1] == 'L':\r\n rmin = math.inf\r\n for j in range(1000, 0, -1):\r\n dp[i][j] = rmin + j\r\n rmin = min(rmin, dp[i - 1][j])\r\n elif s[i - 1] == 'R':\r\n rmin = math.inf\r\n for j in range(1, 1001):\r\n dp[i][j] = rmin + j\r\n rmin = min(rmin, dp[i - 1][j])\r\n else:\r\n for j in range(1, 1001):\r\n dp[i][j] = dp[i - 1][j] + j\r\nrem = min((dp[n - 1][j], j) for j in range(1, 1001))[0]\r\nres = [-1] * n\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(1, 1001):\r\n if rem == dp[i][j]:\r\n res[i] = j\r\n rem -= j\r\n continue\r\nprint(' '.join(map(str, res)))", "len = int(input())\r\ndir = input()\r\n\r\nres = [1] * len\r\n\r\nfor i in range(1, len):\r\n if dir[i - 1] == 'L':\r\n res[i] = 1\r\n else:\r\n res[i] = res[i - 1] + (dir[i - 1] == 'R')\r\n\r\nfor i in range(len - 2, -1, -1):\r\n if dir[i] == 'L':\r\n res[i] = max(res[i], res[i + 1] + 1)\r\n elif dir[i] == '=':\r\n res[i] = max(res[i], res[i + 1])\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "from collections import deque\r\n\r\nn = int(input())\r\ns = input()\r\nans = [1]n\r\n\r\nfor i in range(1,n):\r\n if s[i-1]=='R':\r\n ans[i]=ans[i-1]+1\r\n elif s[i-1]=='=':\r\n ans[i]=ans[i-1]\r\n\r\nfor i in range(n-2, -1, -1):\r\n if s[i]=='L':\r\n ans[i]=max(ans[i+1]+1, ans[i]) \r\n elif s[i]=='=':\r\n ans[i]=max(ans[i], ans[i+1])\r\n\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\nans = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n min_val = 1\r\n \r\n if i > 0:\r\n if s[i - 1] == '=':\r\n ans[i] = ans[i - 1]\r\n continue\r\n if s[i - 1] == 'R':\r\n min_val = ans[i - 1] + 1\r\n \r\n cnt_low = 0\r\n for j in range(i, n - 1):\r\n if s[j] == '=':\r\n continue\r\n if s[j] == 'L':\r\n cnt_low += 1\r\n if s[j] == 'R':\r\n break\r\n min_val = max(min_val, cnt_low + 1)\r\n \r\n ans[i] = min_val\r\n\r\nprint(ans)", "n=int(input())\r\na=input()\r\ndp=[1]n\r\nfor i in range(n):\r\n for j in range(n-1):\r\n if a[j]==\"L\":\r\n if dp[j]<=dp[j+1]:\r\n dp[j]=dp[j+1]+1\r\n elif a[j]==\"R\":\r\n if dp[j]>=dp[j+1]:\r\n dp[j+1]=dp[j]+1\r\n elif a[j]==\"=\" and dp[j]!=dp[j+1]:\r\n dp[j]=max(dp[j],dp[j+1])\r\n dp[j+1]=max(dp[j],dp[j+1])\r\nstr1=''\r\nfor i in dp:\r\n str1+=str(i)+' '\r\nprint(str1)", "n = int(input())\n\np = 'R' + input() + 'R'\n\nt = [0] n\n\ni = t[0] = l = r = 1\n\nL = R = 0\n\nwhile i < n + 1:\n\n if p[i] == 'L':\n\n if r > 1:\n\n t[R] = r\n\n L, r = i, 1\n\n l += 1\n\n elif p[i] == 'R':\n\n if l > 1:\n\n if t[R] < l: t[R] = l\n\n else: t[L] = l - 1\n\n l = 1\n\n R = i\n\n r += 1\n\n i += 1\n\nfor i in range(1, n):\n\n if t[i] == 0:\n\n if p[i] == 'L': t[i] = t[i - 1] - 1\n\n elif p[i] == 'R': t[i] = t[i - 1] + 1\n\n else: t[i] = t[i - 1]\n\nprint(' '.join(map(str, t)))", "import copy\nn = int(input())\n\ndifference = input()\n\nanswer = [0 for i in range(n)]\n\ndef is_local_min(i, difference):\n for j in range(i - 1, -1, -1):\n if difference[j] == 'R':\n return False\n if difference[j] == 'L':\n break\n for j in difference[i:]:\n if j == 'L':\n return False\n if j == 'R':\n break\n return True\n\nloc_min_lst = []\n\nfor i in range(n):\n if is_local_min(i, difference):\n loc_min_lst.append(i)\n\nvalue = 0\n\nfor i in loc_min_lst:\n value = 1 \n for j in range(i, -1, -1):\n if j == 0:\n answer[0] = value\n value = 1\n break\n if answer[j] >= value:\n break\n else:\n answer[j] = value\n if difference[j - 1] == 'R':\n break\n if difference[j - 1] == 'L':\n value += 1\n value = 1\n for j in range(i, n):\n if j == n - 1:\n answer[n - 1] = value\n value = 1\n break\n if answer[j] > value:\n break\n else:\n answer[j] = value\n if difference[j] == 'L':\n break\n if difference[j] == 'R':\n value += 1\n\nprint(' '.join([str(x) for x in answer]))\n\n", "\r\n\r\n\r\ndef ans():\r\n n=int(input())\r\n k=n+1\r\n s=input()\r\n a=[]\r\n for i in range(n):\r\n a.append(0)\r\n a[n-1]=1\r\n for i in range(len(s)-1,-1,-1):\r\n if(s[i]=='L'):\r\n a[i]=a[i+1]+1\r\n elif(s[i]=='R'):\r\n if(a[i+1]==1):\r\n a[i+1]=2\r\n for j in range(i+1,n-1):\r\n if(s[j]=='='):\r\n a[j+1]=a[j]\r\n elif(s[j]=='L'):\r\n break\r\n elif(a[j]==a[j+1]):\r\n a[j+1]+=1\r\n a[i]=1\r\n else:\r\n a[i]=a[i+1]\r\n\r\n print(a)\r\nfor i in range(1):\r\n ans()\r\n\r\n ", "n=int(input())\r\ns=\"0\"+input()\r\nk=[1]n\r\nfor i in range(1,n):\r\n if s[i]==\"R\" and k[i]<=k[i-1]:\r\n k[i]=k[i-1]+1\r\n elif s[i]==\"L\" and k[i-1]<=k[i]:\r\n k[i-1]=1\r\n elif s[i]==\"=\":\r\n k[i]=k[i-1]\r\ns=s[::-1]\r\nk=k[::-1]\r\nfor i in range(n-1):\r\n if s[i]==\"L\" and k[i+1]<=k[i]:\r\n k[i+1]=k[i]+1\r\n elif s[i]==\"=\":\r\n k[i+1]=k[i]\r\nprint(k[::-1])", "n = int(input())\r\ns = input()\r\nans = [1] n\r\n\r\nt = True\r\nwhile t:\r\n t = False\r\n for i in range(n - 1):\r\n if s[i] == '=' and ans[i] != ans[i + 1]:\r\n ans[i] = ans[i + 1] = max(ans[i], ans[i + 1])\r\n t = True\r\n elif s[i] == 'R' and ans[i] >= ans[i + 1]:\r\n ans[i + 1] += 1\r\n t = True\r\n elif s[i] == 'L' and ans[i] <= ans[i + 1]:\r\n ans[i] += 1\r\n t = True\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nw=[1]n\r\nfor i in range(n-1):\r\n if s[i]=='=':\r\n w[i+1]=w[i]\r\n elif s[i]=='R':\r\n if w[i+1]<=w[i]:\r\n w[i+1]=w[i]+1\r\n else:\r\n if w[i]<=w[i+1]:\r\n w[i]=w[i+1]+1\r\nfor i in range(n-2,-1,-1):\r\n if s[i]=='=':\r\n w[i]=w[i+1]\r\n elif s[i]=='R':\r\n if w[i+1]==w[i]:\r\n w[i+1]=w[i]+1\r\n else:\r\n if w[i]<=w[i+1]:\r\n w[i]=w[i+1]+1\r\nfor i in range(n):\r\n print(w[i],end=' ')\r\n", "n=int(input())\r\nr=[1]n\r\ns=input()\r\ny=1\r\nwhile y:\r\n y=0\r\n for i in range(n-1):\r\n if s[i]=='=' and r[i]!=r[i+1]:r[i]=r[i+1]=max(r[i:i+2]);y=1\r\n if s[i]=='L' and r[i]<=r[i+1]:r[i]=r[i+1]+1;y=1\r\n if s[i]=='R' and r[i]>=r[i+1]:r[i+1]=r[i]+1;y=1\r\nprint(r)", "from collections import defaultdict\n\nclass PartialTeacher():\n def __init__(self, n, prefs):\n self.prefs = prefs\n \n def create_graph(self):\n num_nodes = len(list(filter(lambda x: x != '=',list(self.prefs))))+1\n node_cntr = 0\n node_cnts = defaultdict(lambda: 1)\n edge_map = defaultdict(list)\n rev_map = defaultdict(list)\n outgoing_edges = defaultdict(int)\n for ch in self.prefs:\n if ch == 'R':\n edge_map[node_cntr].append(node_cntr+1)\n rev_map[node_cntr+1].append(node_cntr)\n outgoing_edges[node_cntr] += 1\n node_cntr += 1\n elif ch == 'L':\n edge_map[node_cntr+1].append(node_cntr)\n rev_map[node_cntr].append(node_cntr+1)\n outgoing_edges[node_cntr+1] += 1\n node_cntr += 1\n else:\n node_cnts[node_cntr] += 1\n s = set()\n for i in range(node_cntr+1):\n if outgoing_edges[i] == 0:\n s.add(i)\n order = []\n while len(s) > 0:\n v = s.pop()\n order.append(v)\n for u in rev_map[v]:\n outgoing_edges[u] -= 1\n if outgoing_edges[u] == 0:\n s.add(u)\n order.reverse()\n values = [-1]len(order)\n for v in order:\n val_list = list(map(lambda x: values[x], rev_map[v]))\n val = 1 if len(val_list) == 0 else max(val_list)+1\n values[v] = val\n complete_values = []\n for i in range(len(values)):\n complete_values += [values[i]]node_cnts[i]\n print(*complete_values)\n\n\nn = int(input())\nprefs = input().strip(' ')\n\npt = PartialTeacher(n, prefs)\npt.create_graph()\n\n\n\n\n\n\n" ]	{"inputs": ["5\nLRLR", "5\n=RRR", "6\nRLRL=", "3\nR=", "7\nRR==RR", "166\nR===RL=LRRR=RRRL=LRR=R=RR==L=R=R=RRR=RR=RLLRRL=LLRL==L=R==RLR==RL=RR=LR==R=R=LLRLRLR=RR=RLLRLR=RRLL==L=LR=RR=RRRL=RLLLR==L=RRLRLLLLLLLRL===LRLRLRLRRLL=LRLL===LRLRR==", "333\nLL=LR=R=RRR=L=LRR=RLRLLLR=LRL=RRLRRRLLRRLL====RL=L====LLRL=RR==L==RLL==L=R=RLRR==LRRL=LRL=RLRLRR=R=LR=LLR===LRL=RRL====R==LRLR===LLLLL=LLLRLRLLLLLL==RLL=RL==LR=RRLRLL=R=R=R=RLRLRLLRRL==L==LRR=L=R=R===RLR=R=L=LR=LRLRR=RRL=L=RRLR=RRL=RRRL=RLRRRLLLRR=RRRLRLLLR==RR=RL===R=RL=RLL====RRRR=LR=LL=RL==RRLR====R=L=R==L=R=R=RLR=RR=R=LRRRRLLL", "24\nR=R==RL=RL=RLL=LLL=LLRL", "438\nLR=RLLLRL=R==LLR=RRLRRR==RLRLRLLRRRRRLRL=RRRRLRR==RR=RR=LLRR=L=LLRRRLLR==RL=L=LLR=L=R==LLR=L=RR==LRL=LLL=RRR=R=LRLLRLLLR==LRRLLL=L==LLR=RL=LLLLR=RR=LR=RL==LRLRR=RRRRRLRLRR==RR=LLLRLR====LRRLL==LR==LL=LLRR=LRL=RRRRLR=RLLR=R=LLLRRRRR===R==LRLLRLR=LLL=L=L=R=RLLR=R=RR=RL=LLRRLLRR=LRRRR==LR==L==R=L=L=R===LLL=LL==L=L=LLLLL==RRRR==R=RLL=RLR=RRRR=R=L=RRRLLRRLRRRLLRLLRRRL=LR=R=LRLRL=R=RLRRLRRL==R=RRR=RLLR=RR=LL=RLR=R==R===RRLR=LLLR=L===LR=L=R", "453\nR==LL==RRLLRRLR=L=LRLL=LRRR=R====L=RL======RR==RRRR=LRR=LLLRR=LLLLL===LL=LLL=LR=RLRL===L==R=LRL=L=R==RRLLR=L==LRR=RRLRLLRR=LL==RLRLLRRRL=RRL=R====L=RLRR=RR=RRRL=R=RL=LLR=LR=L=RR=RR====LRRLRRLLR==R==L==RRLLRLR=RLLLLR==L=L=L=RR==L=LRRRL=R==RRL=LRR=RRRRRL===RLRLR=RLRLRLRLRR=RL=LL=RLLRR=LL=RLL=L=LRLLLLLR==RRL=R=L===LRLLL=RRRLR=LR====RR=L===LLLL=R=LLLRRRLL=LL==RLRL=LRLRL=RR=RLR==LLR=LR=RLLRLRRLL==L=LL==L==RLRLRLL=L=RLLR==LLRRLRRL==L=R=RLLRLLLL====L=====", "100\n=L=L=L=R=LR=RRRLRL=LRL=RRLLLLRL=R==R=LLLRR===RR=LR==LRLR===RRLRLLRLLR=LRLRR=L=LRRLLLRR==LLRLLLL==RL", "484\nLLRRRL==RRLRRLR=LRR=RL=LLLRL===RLRRRLRR=RRRL=LLLLRL==RL==R==LLLRL=RLLRLRLLLLLLLRRLL=LLR=LLR==RLL==LLLR=RL==LL=LRRL=LLRRRLR====R=R=LRRRLLL==RLRRLR=LL==LLRLR===RR=LR==RL==L==R====LRL=LR=R=R=R=LL=L=RLR=RL==R==LRLRL==L==LL=LR=L=RRRR=R==RRLRRRLR==R=LL===R===RLRRR===LRRLLRRRRR=L==LLRRRRLRRRLL===L==LR==LR==RRLRRLRLLLL=RRL=L=LLLRLRRLLL=LRRRRLLLR=L=LL=LRLL=R==L=LRR=R=LLLRR=LRRRLR=R=RLLRR=LRL===LL==LR===L=L=L=RLL=LRRL=LL==RL==RRL====RR=L=R==L==RRL=LLRLR=RLLLL==R==RRL=====LR=RRR=LRLRRR=RLR", "338\n==R===L=RLRLR===RR=RRL==R=R=RLRLLRLRRRLR=LR=RR=RLLRR=RRRLLRLL=RRRRRLRLLLL=RLLRLLLRL===RRR=RRLLR=LLLL===RLL==LRLLLLRLLLLR=====RLRLRLRL=L==RRLL=RLL===LL=R=RRL=LL=L==RRLLR=LLRLL=LL=LL==RRLR=L=RLLL=LRLLLRRLR=RL=RR=R=L==RLRLL=LRRLLLLLL=RRL==RLL==R===LR===LRLRLR==LR=RR==RR=RRRRRLRRRLRLLRRRLL=LR=RRR=RL=R=LRRLR==RRR=LLL===RR=RL==RRLLL=RL=L=RLL", "198\nLLRRR=RRRRLRRLRR=R===R=RL==R=RLLLR=R=L=LR=R====RRL=RRR=LL=R=RR=RRRLRRLRRR==L=LRLLL====LR=RL==L===LRR=L=L==R==R==L=LLL===R=LLL=R=L=LLLLRLL=RL=LRRLR=RL==RR=R==RLR==R=R==RLRL=LL=RRR=R===LLLRRRRL=RLRLL", "426\nR==LRRRL=R==LLRRRLRLLLR=====R=RRRLLR==LL=L=RR=L=L==LRRR=LL=RR=LRRRLRLLR=R==RL=RRL===RRRL=RLRRRRRLRLLR=LR==LL=R=RRRLRLLLRL=L=RL=R==L==RRLLRRR=RRR==RL=====R=R==RLR=R==L==RL=RRR=RLL=L=LL=RLLR===R=RL==LR=LRLLLR==L==LR=RLLLRRRRL=RRRL=RL=LR=====R=RR=L=RL==L=LLRL=LL=L==LR=RLLRR=RLRLR=LRLLRR===L===RLL=RR==RR=R====RRLR=L=RLRLRLLRLLL=R=R=LLLRRRLR=L==L=R==LLR=L=L==RRLR=LR=R=LR=RR=R=LLRL=L=R=LLLLLR==L=LR=R=L=LL==LRR=L===RL==LL==R==RL", "10\nRL=R=RLR=", "2\nL", "100\nR=R=RRR=R=RR=RRLL=RLRLLLLLR==L=======L=LLR==RL=R=LRLLLR==LLLL=RRRL=LRL=LR=====L=LLLRRL=LLR===RLR=RR", "23\nL=LLLLRL=RR=RLLLL=RR==", "432\n=R=RRL=LLR=LLRLLRL=RL==R===L===LR=RR=LL==RLRLRRL=LRL=RLLRRLLL==RLLR=LLLRL=RLRRLLRRL=RLRRL=LL=RR=RL==LL===R==RR=LLL=RRR===R=RLLLR====R==RL=LRL=LLRLRLLRL=LLR==R==LLLL===R=R=LR=L=LRR=LR==LLL=L=LR=R=RLR=L=R==L=RLLLRR=R===R==L==R===L=RLLRLLLLLLL=LRRL=LLLL=RR==R===RR=LLLLRLRL==R====LR==LRL=L=R=R=L====LRLRL=RRR=RRRL====R=LRLRL===LRLLLR==R==LL=R==L==L=LRRRL==LL=R=L=LL=RRRLLRLRL==LLR===RRR=RRLRRR=R=RL===L=RRRR=R=RL===R==L===LLR=LLRLLLRL", "4\nRRL", "17\n=RRR=L==LLLLRRRL", "20\nRRLLLLLRRRRRRRRLRLR", "9\nR===RRLL", "15\n=RRR=LLLLLRRRL"], "outputs": ["2 1 2 1 2", "1 1 2 3 4", "1 2 1 2 1 1", "1 2 2", "1 2 3 3 3 4 5", "1 2 2 2 2 3 2 2 1 2 3 4 4 5 6 7 2 2 1 2 3 3 4 4 5 6 6 6 1 1 2 2 3 3 4 5 6 6 7 8 8 9 2 1 2 4 3 3 2 1 3 2 2 2 1 1 2 2 2 3 1 2 2 2 3 1 1 2 3 3 1 2 2 2 3 3 4 4 2 1 2 1 2 1 2 2 3 4 4 5 2 1 2 1 2 2 3 5 4 3 3 3 2 2 1 2 2 3 4 4 5 6 7 1 1 4 3 2 1 2 2 2 1 1 2 3 1 8 7 6 5 4 3 2 1 3 2 2 2 2 1 2 1 2 1 2 1 2 4 3 2 2 1 4 3 2 2 2 2 1 2 1 2 3 3 3", "4 3 2 2 1 2 2 3 3 4 5 6 6 2 2 1 2 3 3 4 1 4 3 2 1 2 2 1 2 1 1 2 3 1 2 3 4 2 1 2 3 2 1 1 1 1 1 5 4 4 3 3 3 3 3 2 1 2 1 1 2 3 3 3 1 1 1 4 3 2 2 2 1 1 2 2 3 1 2 3 3 3 1 2 3 2 2 1 2 1 1 2 1 2 1 2 3 3 4 4 1 3 3 2 1 2 2 2 2 1 2 1 1 2 3 1 1 1 1 1 2 2 2 1 2 1 9 9 9 9 8 7 6 5 4 4 3 2 1 2 1 7 6 5 4 3 2 1 1 1 3 2 1 1 3 2 2 2 1 2 2 3 4 1 3 2 1 1 2 2 3 3 4 4 5 1 2 1 3 2 1 2 4 3 3 3 2 2 2 1 2 3 3 1 1 2 2 3 3 3 3 4 1 2 2 3 3 2 2 1 2 2 1 2 1 2 3 3 4 5 2 2 1 1 2 3 1 2 2 3 4 1 1 2 3 4 1 1 2 1 2 3 4 3 2 1 2 3 3 4 5 6 1 4 3 2...", "1 2 2 3 3 3 4 1 1 2 1 1 8 7 6 6 5 4 3 3 2 1 2 1", "2 1 2 2 4 3 2 1 2 1 1 3 3 3 2 1 2 2 3 4 1 2 3 4 4 4 5 1 2 1 3 2 1 2 3 4 5 6 1 2 1 1 2 3 4 5 1 2 3 3 3 4 5 5 6 7 7 2 1 2 4 4 3 3 2 1 2 3 4 2 1 2 2 2 5 4 4 3 3 2 1 2 2 1 1 3 3 3 2 1 2 2 1 1 2 3 3 3 1 5 4 4 3 2 1 1 2 3 4 4 5 5 1 3 2 1 4 3 2 1 2 2 2 1 2 7 6 5 4 4 3 3 3 2 1 2 2 6 5 5 4 3 2 1 2 2 3 4 4 1 2 2 3 2 2 2 1 2 1 2 3 3 4 5 6 7 8 1 2 1 2 3 3 3 4 5 5 3 2 1 2 1 2 2 2 2 2 1 2 4 3 2 2 2 1 5 5 5 4 3 3 2 1 2 3 3 1 2 1 1 2 3 4 5 1 2 2 3 2 1 2 2 4 4 3 2 1 2 3 4 5 6 6 6 6 7 7 7 1 3 2 1 2 1 6 6 5 4 3 3 2 2 1 1 2 2...", "1 3 3 3 2 1 1 1 2 3 2 1 2 3 1 3 3 2 2 1 4 3 2 2 1 2 3 4 4 5 5 5 5 5 1 1 2 1 1 1 1 1 1 1 2 3 3 3 4 5 6 7 7 1 2 4 4 3 2 1 2 12 12 11 10 9 8 7 7 7 7 6 5 5 4 3 2 2 1 2 2 3 1 3 2 2 2 2 1 1 1 2 2 1 3 2 2 1 1 2 2 2 3 4 2 1 3 3 2 2 2 1 2 3 3 4 5 1 3 2 1 2 3 3 2 1 1 1 2 1 3 2 1 2 3 4 1 1 2 3 1 1 2 2 2 2 2 1 1 2 1 2 3 3 4 5 5 6 7 8 1 1 2 2 4 3 3 2 1 2 2 1 2 2 1 1 2 3 3 4 5 5 5 5 5 1 2 3 1 2 3 2 1 2 2 2 3 3 3 1 1 1 2 3 2 1 2 1 2 2 5 4 3 2 1 4 4 4 3 3 2 2 1 1 2 3 3 3 2 2 1 2 3 4 1 1 2 2 2 3 4 2 2 1 2 3 3 4 5 6 7 8 1 1...", "4 4 3 3 2 2 1 1 2 2 1 2 2 3 4 5 1 3 2 2 1 2 1 1 2 5 4 3 2 1 2 1 1 2 2 2 4 4 3 2 1 2 3 3 3 3 4 5 5 1 2 2 2 1 2 1 2 2 2 2 3 4 1 3 2 1 3 2 1 2 2 1 2 1 2 3 3 2 2 1 2 4 3 2 1 2 3 3 3 2 1 5 4 3 2 1 1 1 2 1", "3 2 1 2 3 4 1 1 1 2 3 1 2 3 1 2 2 1 2 3 3 5 4 4 3 2 1 2 1 1 1 1 2 1 2 3 4 1 2 3 3 4 5 6 5 5 4 3 2 1 2 1 1 1 2 1 1 1 4 4 4 3 2 1 2 1 1 3 2 1 2 1 8 7 6 5 4 3 2 1 2 5 4 3 3 2 1 3 3 2 1 2 2 2 6 5 4 4 4 3 2 1 2 2 5 4 4 4 3 2 2 1 2 4 3 3 2 1 2 3 4 1 2 2 2 2 2 3 3 4 4 1 2 3 4 3 2 1 1 1 2 1 2 3 1 5 5 4 3 3 3 2 1 2 1 2 2 2 2 3 4 4 1 2 2 2 3 2 2 2 1 1 1 2 2 2 2 2 1 3 2 2 1 2 2 3 3 4 4 5 5 3 2 2 1 1 2 1 2 2 3 1 1 1 2 2 2 1 2 1 6 5 5 5 4 4 4 3 2 2 1 2 2 1 1 2 3 4 5 5 6 6 6 7 8 1 2 3 4 1 2 2 2 3 3 2 1 1 1 1 2 2 2 2 3 1...", "1 1 1 2 2 2 2 1 1 2 1 2 1 2 2 2 2 3 4 4 5 6 1 1 1 2 2 3 3 4 1 3 2 1 2 1 2 3 4 1 2 2 1 2 2 3 4 4 5 2 1 2 3 3 4 5 6 2 1 3 2 1 1 2 3 4 5 6 1 5 4 3 2 1 1 3 2 1 4 3 2 1 2 1 1 1 1 2 3 4 4 5 6 2 1 5 5 4 3 2 1 1 1 1 4 3 2 2 2 1 5 4 3 2 1 5 4 3 2 1 2 2 2 2 2 2 3 1 2 1 2 1 3 2 2 1 1 1 2 3 2 1 1 5 4 3 3 3 3 2 1 1 2 2 3 5 4 4 3 2 2 1 1 1 2 3 2 1 3 3 2 1 7 6 5 5 4 3 3 2 1 1 1 2 3 1 2 2 1 1 5 4 3 2 2 1 4 3 2 1 2 3 1 2 2 3 1 1 2 3 3 4 4 1 1 1 2 1 4 3 2 2 1 2 7 6 5 4 3 2 1 1 2 3 1 1 1 3 2 1 1 1 2 2 2 2 1 2 2 2 2 1 2 1 2 1...", "3 2 1 2 3 4 4 5 6 7 8 1 2 3 1 2 3 3 4 4 4 4 5 5 6 1 1 1 2 2 4 3 2 1 2 2 3 3 2 2 1 2 2 3 3 3 3 3 4 5 1 1 2 3 4 4 2 1 1 2 2 3 4 4 5 6 7 1 2 3 1 2 3 4 4 4 2 2 1 5 4 3 2 2 2 2 2 1 2 2 4 3 3 3 2 2 2 2 1 2 3 3 2 2 1 1 1 2 2 2 5 5 5 4 4 3 2 1 1 1 1 4 4 3 2 1 1 6 6 5 5 4 3 2 1 3 2 1 1 3 2 2 1 2 3 1 2 2 3 1 1 1 2 3 3 4 4 4 5 1 2 2 2 3 3 4 4 4 5 1 4 3 3 2 1 1 2 3 4 4 5 5 5 5 3 2 1 2 3 4 5 1 1 2 1 3 2 1", "1 2 2 2 1 2 3 4 1 1 3 3 3 2 1 2 3 4 1 4 3 2 1 2 2 2 2 2 2 3 3 4 5 6 2 1 4 4 4 3 2 2 1 1 2 4 4 3 3 2 2 2 1 2 3 4 4 2 1 1 2 3 3 1 2 3 4 1 3 2 1 2 2 3 3 3 4 1 1 2 3 1 1 1 1 2 3 4 1 1 2 1 2 3 4 5 6 1 3 2 1 2 2 1 3 3 3 2 1 1 2 2 3 4 5 1 4 3 2 1 3 2 2 1 1 2 1 1 2 2 2 1 1 1 2 3 2 1 2 3 4 4 5 6 7 7 7 8 1 1 1 1 1 1 2 2 3 3 3 4 1 2 2 3 3 3 1 1 1 2 1 1 2 3 4 4 6 5 4 4 3 3 2 1 1 3 2 1 2 2 2 2 3 3 4 2 2 2 1 2 2 1 4 3 2 1 3 3 3 2 2 2 1 2 2 4 3 2 1 2 3 4 5 1 1 2 3 4 1 1 3 2 2 1 2 2 2 2 2 2 3 3 4 5 5 1 1 5 4 4 4 3 3 2 1 6...", "1 2 1 1 2 2 3 1 2 2", "2 1", "1 2 2 3 3 4 5 6 6 7 7 8 9 9 10 11 2 1 1 2 1 6 5 4 3 2 1 5 5 5 4 4 4 4 4 4 4 4 3 3 2 1 2 2 2 3 1 1 2 2 1 4 3 2 1 5 5 5 4 3 2 1 1 2 3 4 2 2 1 3 2 2 1 5 5 5 5 5 5 4 4 3 2 1 2 4 3 3 2 1 2 2 2 2 3 1 2 2 3 4", "6 5 5 4 3 2 1 2 1 1 2 3 3 5 4 3 2 1 1 2 3 3 3", "1 1 2 2 3 4 3 3 2 1 3 3 2 1 3 2 1 2 1 1 2 1 1 1 3 3 3 3 2 2 2 2 1 2 2 3 4 4 2 1 1 1 2 1 2 1 2 3 2 2 1 2 1 1 3 2 1 2 4 3 2 1 1 1 3 2 1 4 4 3 2 1 2 1 1 2 1 2 3 2 1 2 3 1 1 2 1 2 4 3 3 2 1 1 2 3 3 4 3 3 3 2 1 1 1 1 2 2 2 3 4 4 3 2 1 1 2 3 4 4 4 4 5 5 6 3 2 1 2 2 2 2 2 3 3 3 4 2 2 1 4 3 3 2 1 2 1 3 2 1 4 3 3 2 1 2 2 2 5 5 5 4 3 2 1 1 1 1 2 2 3 3 1 3 3 2 2 1 2 3 3 1 6 6 6 5 4 3 3 2 2 1 2 2 3 3 4 1 2 2 1 1 2 2 2 1 1 4 3 2 1 2 3 3 4 4 4 4 5 5 5 1 1 1 2 2 2 2 1 1 3 2 1 9 8 7 6 5 4 3 2 2 1 2 6 5 5 4 3 2 1 1 2 3 3 3...", "1 2 3 1", "1 1 2 3 6 6 5 5 5 4 3 2 1 2 3 4 1", "1 2 6 5 4 3 2 1 2 3 4 5 6 7 8 9 1 2 1 2", "1 2 2 2 2 3 4 2 1", "1 1 2 3 6 6 5 4 3 2 1 2 3 4 1"]}	UNKNOWN	PYTHON3	CODEFORCES	13
d3e51e02198078824b0169caf85d97d6	Till I Collapse	Rick and Morty want to find MR. PBH and they can't do it alone. So they need of Mr. Meeseeks. They Have generated n Mr. Meeseeks, standing in a line numbered from 1 to n. Each of them has his own color. i-th Mr. Meeseeks' color is ai. Rick and Morty are gathering their army and they want to divide Mr. Meeseeks into some squads. They don't want their squads to be too colorful, so each squad should have Mr. Meeseeks of at most k different colors. Also each squad should be a continuous subarray of Mr. Meeseeks in the line. Meaning that for each 1<=≤<=i<=≤<=e<=≤<=j<=≤<=n, if Mr. Meeseeks number i and Mr. Meeseeks number j are in the same squad then Mr. Meeseeks number e should be in that same squad. Also, each squad needs its own presidio, and building a presidio needs money, so they want the total number of squads to be minimized. Rick and Morty haven't finalized the exact value of k, so in order to choose it, for each k between 1 and n (inclusive) need to know the minimum number of presidios needed. The first line of input contains a single integer n (1<=≤<=n<=≤<=105) — number of Mr. Meeseeks. The second line contains n integers a1,<=a2,<=...,<=an separated by spaces (1<=≤<=ai<=≤<=n) — colors of Mr. Meeseeks in order they standing in a line. In the first and only line of input print n integers separated by spaces. i-th integer should be the minimum number of presidios needed if the value of k is i. Sample Input 5 1 3 4 3 3 8 1 5 7 8 1 7 6 1 Sample Output 4 2 1 1 1 8 4 3 2 1 1 1 1	[ "import sys\r\nbase = 1 << 17\r\ndef get(x, v=1, cl=0, cr=base):\r\n if x >= t[v]:\r\n return cr\r\n if cl + 1 == cr:\r\n return cl\r\n cc = (cl + cr) // 2\r\n if x >= t[v * 2]:\r\n return get(x - t[v * 2], v * 2 + 1, cc, cr)\r\n else:\r\n return get(x, v * 2, cl, cc)\r\ndef put(v, val):\r\n v += base\r\n t[v] = val\r\n while v > 1:\r\n v >>= 1\r\n t[v] = t[v * 2] + t[v * 2 + 1]\r\nif __name__ == \"__main__\":\r\n n = int(sys.stdin.readline().strip())\r\n a = list(map(int, sys.stdin.readline().strip().split()))\r\n a = [x - 1 for x in a]\r\n VER = int(2e5)\r\n base = 1 << 17\r\n t = [0] * (base * 2)\r\n pos = [[] for _ in range(VER + 1)]\r\n qs = [[] for _ in range(VER + 1)]\r\n ans = [0] * (VER + 1)\r\n for i in range(n):\r\n pos[a[i]].append(i)\r\n for i in range(n):\r\n pos[i].reverse()\r\n if pos[i]:\r\n t[pos[i][-1] + base] += 1\r\n for i in range(base - 1, 0, -1):\r\n t[i] = t[i * 2] + t[i * 2 + 1]\r\n for i in range(n):\r\n qs[0].append(i + 1)\r\n for i in range(n):\r\n for k in qs[i]:\r\n to = get(k)\r\n ans[k] += 1\r\n if to < n:\r\n qs[to].append(k)\r\n qs[i].clear()\r\n put(i, 0)\r\n x = a[i]\r\n pos[x].pop()\r\n if pos[x]:\r\n put(pos[x][-1], 1)\r\n for i in range(1, n + 1):\r\n print(ans[i], end=' ')\r\n print()# 1693576767.28902", "import sys\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(args, *kwargs):\r\n if queue:\r\n return f(args, *kwargs)\r\n else:\r\n to = f(args, *kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\ndef getRes(v):\r\n vis = [0] * (n + 1)\r\n res = 1\r\n cnt = 0\r\n cur = 0\r\n i = 0\r\n while prev[i] >= cur: i += 1\r\n while i < n:\r\n if cnt <= v:\r\n cnt += 1\r\n else:\r\n res += 1\r\n cnt = 1\r\n cur = i\r\n i += 1\r\n while prev[i] >= cur: i += 1\r\n return res\r\n\r\n\r\nac = FastIO()\r\nn = ac.read_int()\r\nnums = ac.read_list_ints()\r\n# n=100000\r\n# nums=list(range(1,n+1))\r\nidx = {}\r\nprev = [-1] * (n + 1)\r\n# prev[n]=n+1\r\nfor i in range(n):\r\n x = nums[i]\r\n if x in idx: prev[i] = idx[x]\r\n idx[x] = i\r\n\r\nres = [None] * n\r\nres[-1] = 1\r\nL = min(2 * round(n ** 0.5), n - 1)\r\nfor i in range(L + 1): res[i] = getRes(i)\r\n# exit(0)\r\nto_process = deque([[L, n - 1]])\r\nwhile to_process:\r\n l, r = to_process.popleft()\r\n if r <= l + 1: continue\r\n m = (l + r) // 2\r\n if res[m] is None:\r\n res[m] = getRes(m)\r\n if res[m] == res[l]:\r\n for i in range(l, m):\r\n res[i] = res[m]\r\n elif m > l + 1:\r\n to_process.append([l, m])\r\n if res[m] == res[r]:\r\n for i in range(m, r):\r\n res[i] = res[m]\r\n elif r > m + 1:\r\n to_process.append([m, r])\r\nprint(*res)\r\n\r\n" ]	{"inputs": ["5\n1 3 4 3 3", "8\n1 5 7 8 1 7 6 1", "10\n4 1 2 6 8 5 3 9 3 9", "85\n23 11 69 1 49 10 7 13 66 35 81 4 51 2 62 55 31 18 85 34 59 44 20 28 27 5 6 79 43 78 45 64 61 56 12 40 54 52 24 14 26 65 75 72 30 46 67 80 38 70 25 60 50 8 17 84 41 71 58 76 19 47 73 29 3 48 82 33 39 63 15 37 83 36 9 32 16 57 68 53 21 77 22 42 74", "100\n39 78 71 61 54 13 17 81 30 33 83 98 44 10 45 87 75 47 70 84 41 86 49 94 85 91 37 64 5 56 67 79 28 89 50 53 77 93 81 14 97 67 58 6 48 60 89 62 29 3 38 8 88 19 66 63 100 17 43 97 21 12 58 76 2 78 25 73 99 11 27 18 57 46 4 72 68 45 74 18 2 80 51 52 42 59 55 35 1 95 42 92 36 40 59 15 7 21 97 53", "1\n1"], "outputs": ["4 2 1 1 1 ", "8 4 3 2 1 1 1 1 ", "10 4 3 2 2 2 2 1 1 1 ", "85 43 29 22 17 15 13 11 10 9 8 8 7 7 6 6 5 5 5 5 5 4 4 4 4 4 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 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 ", "100 50 34 25 20 17 15 13 11 10 10 9 8 7 7 6 6 6 6 5 5 5 5 4 4 4 4 4 4 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "1 "]}	UNKNOWN	PYTHON3	CODEFORCES	2
d3e540e3910727f7dcf520e39d57d44d	Irrational problem	Little Petya was given this problem for homework: You are given function (here represents the operation of taking the remainder). His task is to count the number of integers x in range [a;b] with property f(x)<==<=x. It is a pity that Petya forgot the order in which the remainders should be taken and wrote down only 4 numbers. Each of 24 possible orders of taking the remainder has equal probability of being chosen. For example, if Petya has numbers 1, 2, 3, 4 then he can take remainders in that order or first take remainder modulo 4, then modulo 2, 3, 1. There also are 22 other permutations of these numbers that represent orders in which remainder can be taken. In this problem 4 numbers wrote down by Petya will be pairwise distinct. Now it is impossible for Petya to complete the task given by teacher but just for fun he decided to find the number of integers with property that probability that f(x)<==<=x is not less than 31.4159265352718281828459045%. In other words, Petya will pick up the number x if there exist at least 7 permutations of numbers p1,<=p2,<=p3,<=p4, for which f(x)<==<=x. First line of the input will contain 6 integers, separated by spaces: p1,<=p2,<=p3,<=p4,<=a,<=b (1<=≤<=p1,<=p2,<=p3,<=p4<=≤<=1000,<=0<=≤<=a<=≤<=b<=≤<=31415). It is guaranteed that numbers p1,<=p2,<=p3,<=p4 will be pairwise distinct. Output the number of integers in the given range that have the given property. Sample Input 2 7 1 8 2 8 20 30 40 50 0 100 31 41 59 26 17 43 Sample Output 0 20 9	[ "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\np1,p2,p3,p4,b,a=M()\nk=min(p1,p2,p3,p4)\nc=0\nfor i in range(b,min(k,a+1)):\n c+=1\nprint(c)\n", "q=input()\r\np1,p2,p3,p4,a,b=map(int,q.split())\r\np=min(p1,p2,p3,p4)\r\nc=0\r\nif p>b:\r\n c=b-a+1\r\nelif p>a:\r\n c=p-a\r\nelse:\r\n c=0\r\nprint(c)\r\n", "p1,p2,p3,p4,a,b = map(int,input().strip().split())\r\nm=min(min(min(p1,p2),p3),p4)\r\nif m<a:\r\n print(0)\r\nelse:\r\n t=(m-a)\r\n if b<m:\r\n t=t-(m-b-1)\r\n print(t) \r\n \r\n", "a , b , c , d , x , y = map(int,input().split())\r\nm1 = min(a,b,c,d)\r\nanswer = 0\r\nfor i in range(x,y+1):\r\n if i == i%m1:\r\n answer+=1\r\nprint(answer)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nm = min(p1, p2, p3, p4)\r\n\r\nif m - a <= 0:\r\n print(0)\r\nelif m > b:\r\n print(b-a+1)\r\nelse:\r\n print(m-a)\r\n", "from itertools import permutations\ndef compute(p1,p2,p3,p4,x):\n return (((x % p1)%p2)%p3)%p4\n\n\ndef solve(p1,p2,p3,p4,a,b):\n per = list(permutations([p1,p2,p3,p4]))\n count = 0\n for i in range(a,b+1):\n temp = 0\n for j in per:\n if i == compute(j,i):\n temp += 1\n if temp == 7 :\n count += 1\n break\n return count\n\ndef main():\n # n = int(input())\n a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n print(solve(a))\n\nmain()", "import sys,math,io,os,time,itertools,collections\r\nmod=109+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef main():\r\n p1,p2,p3,p4,a,b=[int(k) for k in i().split()]\r\n cnt=0\r\n l=list(itertools.permutations([p1,p2,p3,p4]))\r\n for k in range(min(a,103),min(b,10*3)+1):\r\n tot=0\r\n for x in l:\r\n f=((((k%x[0])%x[1])%x[2])%x[3])\r\n if f==k:\r\n tot+=1\r\n if tot>=7:\r\n cnt+=1\r\n p(str(cnt)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "\np = []\n\np = input().split()\nfor i in range(6):\n\tp[i]=int(p[i])\n\nb = p.pop()\na = p.pop()\n\n\np.sort()\n\nif p[0]<=b:\n\tans=max(p[0]-a,0)\n\tprint(ans)\nelse:\n\tans=b-a+1\n\tprint(ans)\n\n", "import math\r\nimport string\r\n\r\ndef create_all_permutations(m, s, i):\r\n if i == len(m):\r\n return\r\n elif i == len(m) - 1:\r\n s.append(m)\r\n else:\r\n for j in range(i, len(m)):\r\n d = m.copy()\r\n d[i], d[j] = d[j], d[i]\r\n create_all_permutations(d, s, i + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n p_1, p_2, p_3, p_4, a, b = [int(i) for i in input().split(\" \")]\r\n data = sorted([p_1, p_2, p_3, p_4])\r\n permutations = []\r\n create_all_permutations(data, permutations, 0)\r\n counter = 0\r\n for i in range(a, b + 1):\r\n internal_counter = 0\r\n for j in range(len(permutations)):\r\n p_1, p_2, p_3, p_4 = permutations[j]\r\n if i == ((((i % p_1) % p_2) % p_3) % p_4):\r\n internal_counter += 1\r\n if internal_counter >= 7:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\nmain_function()\r\n", "a,b,c,d,x,y=map(int,input().split())\r\nif x>=min(a,b,c,d):\r\n print(0)\r\nelse:\r\n print(min(min(a,b,c,d),y+1)-x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from itertools import permutations\n\np1,p2,p3,p4,a,b = list(map(int,input().split()))\ncount = 0\nfor i in range(a,b+1):\n i_count = 0\n perms = permutations([p1, p2, p3, p4])\n for j in perms:\n fx = (((i%j[0])%j[1])%j[2])%j[3]\n if (fx == i):\n i_count += 1\n if (i_count >= 7):\n count += 1\nprint (count)\n\n\n\n\n", "def check_permutations(p1,p2,p3,p4,x):\r\n\ttotal=0\r\n\ts1={p1,p2,p3,p4}\r\n\tfor i in s1:\r\n\t\ta=i\r\n\t\ts2={a}\r\n\t\ts2=s1-s2\r\n\t\tfor j in s2:\r\n\t\t\tb=j\r\n\t\t\ts3={j}\r\n\t\t\ts3=s2-s3\r\n\t\t\tfor k in s3:\r\n\t\t\t\tc=k\r\n\t\t\t\ts4={k}\r\n\t\t\t\ts4=s3-s4\r\n\t\t\t\tfor z in (s4):\r\n\t\t\t\t\td=z\r\n\t\t\t\t\tif ((((x%a)%b))%c)%d==x:\r\n\t\t\t\t\t\ttotal+=1\r\n\treturn total\r\n \r\n \r\n \r\n \r\np1,p2,p3,p4,a,b = map(int,input().split())\r\nans=0\r\nfor i in range(a,b+1):\r\n\tif check_permutations(p1,p2,p3,p4,i)>=7:\r\n\t\tans+=1\r\nprint(ans)", "a,b,c,d,e,f=map(int,input().split())\r\ncount=0\r\nfor i in range(e,f+1):\r\n k=i%a%b%c%d\r\n if i==k:\r\n count+=1\r\nprint(count)", "def rec(t,k):\r\n global l,d\r\n if k==5:\r\n l.append(t[:])\r\n return\r\n else:\r\n for i in range(4):\r\n if viz[i]==0:\r\n viz[i]=1\r\n t.append(d[i])\r\n rec(t,k+1)\r\n t.pop()\r\n viz[i]=0\r\n\r\np1,p2,p3,p4,a,b=map(int,input().split())\r\nd=[p1,p2,p3,p4]\r\nviz=[0,0,0,0]\r\nl=[]\r\nrec([],1)\r\nans=0\r\nfor i in range(a,b+1):\r\n k=0\r\n for j in l:\r\n t=i\r\n \r\n for z in j:\r\n t%=z\r\n if t==i:\r\n k+=1\r\n if k>=7:\r\n ans+=1\r\nprint(ans)\r\n", "p, a, b = map(int, input().split())\r\nprint(sum(1 for i in range(a, b + 1) if i < min(p)))\r\n", "from itertools import permutations\r\np = list(map(int, input().split()))\r\na, b = p[-2], p[-1]\r\np = p[:-2]\r\nans = 0\r\nfor x in range(a, b + 1):\r\n cnt = 0\r\n for perm in permutations(p):\r\n if x == (((x % perm[0]) % perm[1]) % perm[2]) % perm[3]:\r\n cnt += 1\r\n if cnt >= 7:\r\n ans += 1\r\nprint(ans)# 1698341614.3284554", "from functools import reduce\r\n\r\ninp=input().split()\r\np=[int(inp[0]),int(inp[1]),int(inp[2]),int(inp[3])]\r\na=int(inp[4])\r\nb=int(inp[5])\r\nn=0\r\nfor i in range(a,b+1):\r\n if reduce((lambda a,b : a%b), [i]+p) == i:\r\n n+=1\r\nprint(n)\r\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\np1,p2,p3,p4,a,b = readints()\nmods = [p1,p2,p3,p4]\nx = min(mods) \nprint(max(-1,min(x-1,b)-a)+1)\n\n \t \t\t \t \t\t\t\t\t \t \t\t\t\t \t \t", "p = [int(x) for x in input().split()]\nmod = min(p[0:4])\nif mod < p[4]:\n print(0)\nelse:\n if mod > p[5]:\n print(p[5] - p[4] + 1)\n else:\n print(mod - p[4])\n", "# LUOGU_RID: 101453572\np1, p2, p3, p4, a, b = map(int, open(0).read().split())\r\nprint(sum(x % p1 == x % p2 == x % p3 == x % p4 == x for x in range(a, b + 1)))", "p1, p2, p3, p4, a, b = map(int, input().split())\n\nprint(max(0, min(p1, p2, p3, p4, b + 1) - a))", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\ntmp = min(p1, p2, p3, p4)\r\n\r\nif tmp <= b:\r\n ans = tmp - a\r\nelse:\r\n ans = b-a+1\r\n\r\n\r\n\r\n\r\n\r\nif ans < 0:\r\n ans = 0\r\n\r\nprint(ans)", "a=list(map(int,input().split()))\r\ndef f(x):\r\n return ((((x % a[0]) % a[1]) % a[2]) % a[3])\r\nans=0\r\nfor x in range(a[4], a[5]+1):\r\n if f(x)==x:\r\n ans+=1\r\nprint(ans)\r\n", "l=list(map(int,input().split()))\r\nc=0\r\nfor i in range(l[4],l[5]+1):\r\n for k in range(4):\r\n z=i%l[0]\r\n for j in range(1,3):\r\n z=z%l[j]\r\n for m in range(2,4):\r\n z=z%l[m]\r\n z=z%l[5-m]\r\n if z==i:\r\n c+=1\r\nprint(c)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\np = min(p1, p2, p3, p4)\r\n\r\nans = 0\r\n\r\nfor i in range(a, b+1):\r\n if i%p == i:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "import itertools\n\ndef q68a():\n\tp1, p2, p3, p4, low, high = tuple([int(num) for num in input().split()])\n\tp = list(itertools.permutations([p1, p2, p3, p4], 4))\n\tnum_good = 0\n\tfor i in range(low, high+1):\n\t\tcount = 0\n\t\tfor t in p:\n\t\t\tif(i == q68a_mod_operation(i, t[0], t[1], t[2], t[3])):\n\t\t\t\tcount += 1\n\t\tif(count >= 7):\n\t\t\tnum_good += 1\n\tprint(num_good)\n\ndef q68a_mod_operation(num, a, b, c, d):\n\treturn (((num % a) % b) % c) % d\n\nq68a()", "a,b,c,d,e,f=map(int,input().split())\r\nb=min(a,b,c,d)\r\nif b>f:\r\n b=f+1\r\nprint(len([1 for i in range(e,b)]))", "import math\r\np1,p2,p3,p4,a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a,b+1):\r\n if (((i%p1)%p2)%p3)%p4==i:\r\n c+=1\r\nprint (c) \r\n", "import itertools\n\np1, p2, p3, p4, a, b = map(int, input().split())\npermutations = list(itertools.permutations([p1, p2, p3, p4]))\nresult = 0\n\nfor x in range(a, b+1):\n count = 0\n for permutation in permutations:\n y = x\n for p in permutation:\n y %= p\n if y == x:\n count += 1\n if count >= 7:\n result += 1\n\nprint(result)\n", "s=input().split()\np1=int(s[0]);p2=int(s[1]);p3=int(s[2]);p4=int(s[3]);a=int(s[4]);b=int(s[5])\nans=0\nfor i in range(a,b+1):\n if i%p1%p2%p3%p4==i:\n ans+=1\nprint(ans)", "x1,x2,x3,x4,a,b = map(int,input().split(' '))\r\nminValue = min(x1,x2,x3,x4)\r\nif(b<minValue):\r\n print(b-a+1)\r\nelse:\r\n print(max(0,minValue-a))", "import math\r\nimport random\r\nimport itertools\r\n\r\ndef f(x, u1, u2, u3, u4):\r\n val = (((x % u1)%u2)%u3)%u4\r\n return val == x\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split(' '))\r\n\r\nmacht = 0\r\nfor i in range(a, b+1):\r\n total = 0\r\n for perm in itertools.permutations([p1, p2, p3, p4]):\r\n if f(i, perm[0], perm[1], perm[2], perm[3]):\r\n total+=1\r\n if total>=7:\r\n macht+=1\r\n\r\nprint(macht)", "import itertools\r\nl = []\r\ncont = 0\r\nr = 0\r\nl1 = list(map(int,input().strip().split()))[:6]\r\nl = l1[0:4]\r\nab = l1[4:6]\r\n\r\nfor x in range(ab[0],ab[1]+1):\r\n perm = itertools.permutations(l)\r\n for i in list(perm):\r\n if ((((x % i[0]) % i[1]) % i[2]) % i[3]) == x:\r\n cont += 1\r\n if cont >= 7:\r\n r += 1\r\n cont = 0\r\nprint (r)", "\np1, p2, p3, p4, a, b = map(int, input().split())\np_min = min(p1, p2, p3, p4)\nresult = 0\n\nfor x in range(a, b+1):\n if x == x % p_min:\n result += 1\n\nprint(result)\n", "from itertools import permutations\n\n\nclass CodeforcesTask68ASolution:\n def __init__(self):\n self.result = ''\n self.pppp_a_b = []\n\n def read_input(self):\n self.pppp_a_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n prop = [0] * (1 + self.pppp_a_b[-1] - self.pppp_a_b[-2])\n for st in permutations(self.pppp_a_b[:4]):\n f = lambda x: (((x % st[0]) % st[1]) % st[2]) % st[3]\n for y in range(self.pppp_a_b[-2], self.pppp_a_b[-1] + 1):\n if f(y) == y:\n prop[y - self.pppp_a_b[-2]] += 1\n has_prop = [1 if x >= 7 else 0 for x in prop]\n self.result = str(sum(has_prop))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask68ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "p1,p2,p3,p4,a,b=map(int,input().split())\r\nl=[p1,p2,p3,p4]\r\ncount=0\r\nfor i in range(a,b+1):\r\n r=i\r\n for j in l:\r\n r=r%j\r\n if r==i:\r\n count+=1\r\n\r\nprint(count)", "p1, p2, p3, p4, a, b = map(int, input().split())\nc = 0\nfor i in range(a, b+1):\n if i % p1 == i:\n if i % p2 == i:\n if i % p3 == i:\n if i % p4 == i:\n c += 1\nprint(c)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nc = 0\r\nfor i in range(a, b+1):\r\n if i%p1%p2%p3%p4 == i:\r\n c += 1\r\nprint(c)", "p1, p2,p3,p4, a,b = map(int,input().split())\n\ncnt = 0\n\nfor x in range(a,b+1):\n ans = (((x%p1)%p2)%p3)%p4\n if x == ans:\n cnt+=1\n\nprint(cnt)\n\n \t \t \t\t\t\t\t \t \t\t \t\t \t\t\t\t\t", "from time import \n\n\nif __name__ == \"__main__\" :\n # start = time()\n p1 , p2 , p3 , p4 , a , b = map(int,input().strip().split())\n count = 0\n for i in range(a , b + 1) :\n if ((((i % p1)% p2)% p3) % p4) == i :\n count += 1\n print(count)\n # print(time() - start)\n", "inp = [int(x) for x in input().split()]\r\np = inp[:4]\r\na,b = inp[4],inp[5]\r\np = min(p)\r\ncnt = 0\r\nfor i in range(a,b+1):\r\n if i%p==i:\r\n cnt+=1\r\nprint(cnt)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\nprint(sum(1 for i in range(a, b + 1) if i % p1 % p2 % p3 % p4 == i))\r\n", "a,b,c,d,x,y=map(int, input().split())\r\ncontador=0\r\nwhile (x<=y):\r\n if(x%a%b%c%d==x):\r\n contador=contador+1\r\n x=x+1\r\nprint(contador)\r\n", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nminP = min(p1, min(p2, min(p3, p4)))\r\n\r\noutput = 0\r\nif a <= minP <= b:\r\n output = minP - a\r\nelif minP > b:\r\n output = b - a + 1\r\n\r\nprint(output)", "p1,p2,p3,p4,a,b=map(int,input().split())\r\nm=min(p1,p2,p3,p4)\r\nif m-a<=0:\r\n\tprint(0)\r\nelse:\r\n\tif m>b:\r\n\t\tprint(b-a+1)\r\n\telse:\r\n\t\tprint(m-a)", "def readln(): return tuple(map(int, input().split()))\n\ninp = readln()\nmod = min(inp[:4])\nprint(len([_ for _ in range(inp[4], inp[5] + 1) if _ < mod]))\n", "mylist=list(map(int,input().split()))\r\na=0\r\nb=min(mylist[:4:]) - mylist[4]\r\nif(b>=0):\r\n a=min(b,mylist[5]-mylist[4]+1)\r\nprint(a)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\nfrom itertools import \r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\ndef function(x, lst):\r\n permu = permutations(lst, len(lst))\r\n count_ = 0\r\n for i in permu:\r\n temp = (((x % i[0]) % i[1]) % i[2]) % i[-1]\r\n if temp == x:\r\n count_ += 1\r\n if count_ >= 7:\r\n return True\r\n if count_ < 7:\r\n return False\r\n\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\narr = [p1, p2, p3, p4]\r\ncount = 0\r\nfor i in range(a, b+1):\r\n if function(i, arr):\r\n count += 1\r\nprint(count)\r\n", "p1,p2,p3,p4,a,b = map(int,input().split())\r\ncount = 0\r\nfor i in range(a,b+1):\r\n k = (((i%p1)%p2)%p3)%p4\r\n if i==k:\r\n count+=1\r\nprint(count)", "p1,p2,p3,p4,a,b = map(int,input().split())\r\nremainder = 0\r\nfor i in range(a,b+1):\r\n if i < min([p1,p2,p3,p4]): #f(x)=x,当i<pmin时即可\r\n remainder += 1\r\n else:\r\n pass\r\nprint(remainder)", "s = list(map(int, input().split()))\r\nlis = [s[0]]\r\nfor i in range(1,4):\r\n if s[i]<s[i-1]:lis.append(s[i])\r\ncnt = 0\r\nfor i in range(s[4], s[5]+1):\r\n m = i\r\n for j in lis:\r\n m = m%j\r\n if m == i: cnt += 1\r\nprint(cnt)", "a,b,c,d,e,f = map(int,input().split())\ng = min([a,b,c,d])\nif e==f==0:\n print(1)\nelse:\n if g>f:\n print(f-e+1)\n else:\n print(max(0,min(g,f)-e))\n", "p1, p2, p3, p4, a, b = [int(i) for i in input().split()]\r\nprint(max(0, min(p1, p2, p3, p4, b + 1) - a))\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nfrom itertools import permutations\r\np1,p2,p3,p4,a,b = get_int_list()\r\nm = 0\r\nfor p in permutations([p1,p2,p3,p4]):\r\n count = 0\r\n for i in range(a,b+1):\r\n if i == (((i%p[0])%p[1])%p[2])%p[3]:\r\n count += 1\r\n m = max(m,count)\r\nprint(m)", "# LUOGU_RID: 98061811\na=input()\r\nb=a.split(' ')\r\nb[0]=int(b[0])\r\nb[1]=int(b[1])\r\nb[2]=int(b[2])\r\nb[3]=int(b[3])\r\nb[4]=int(b[4])\r\nb[5]=int(b[5])\r\nsumm=0\r\nwhile(b[4]<=b[5]):\r\n if(b[4]%b[0]==b[4] and b[4]%b[3]==b[4] and b[4]%b[2]==b[4] and b[4]%b[1]==b[4]):\r\n summ+=1\r\n b[4]+=1\r\nprint(summ)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\np1,p2,p3,p4,a,b=(int(i) for i in input().split())\r\nprint(max(min(b-a+1,min(p1,p2,p3,p4)-a),0))", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n\r\np1,p2,p3,p4,a,b=I()\r\nl=list(permutations([p1,p2,p3,p4]))\r\nans=0\r\nfor i in range(a,b+1):\r\n c=0\r\n for j in range(24):\r\n a,x=list(l[j]),i\r\n for y in a:\r\n x=x%y\r\n if x==i: c+=1 \r\n if c>=7: ans+=1 \r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "from itertools import permutations as per\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\np = list(per([p1, p2, p3, p4], 4))\r\n\r\nx = 0\r\n\r\nfor i in range(a, b + 1):\r\n\tc = 0\r\n\t\r\n\tfor j in p:\r\n\t\tif (((i % j[0]) % j[1]) % j[2]) % j[3] == i:\r\n\t\t\tc += 1\r\n\t\t\t\r\n\tif c >= 7:\r\n\t\tx += 1\r\n\t\t\r\nprint(x)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\np = min([p1, p2, p3, p4])\r\nprint(0 if p < a else min(p-1, b) - a + 1)", "l=list(map(int,input().split()))\r\nx=min(l[:4])\r\nif x>l[5]:\r\n print(l[5]-l[4]+1)\r\nelif x>=l[4]:\r\n print(x-l[4])\r\nelse:\r\n print(\"0\")\r\n", "def f(x):\r\n return (((x%p1)%p2)%p3)%p4\r\np1,p2,p3,p4,a,b = map(int,input().split())\r\nans = 0\r\nfor i in range(a,b+1):\r\n if f(i) == i: ans += 1\r\nprint(ans)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:25:05\nLastEditTime: 2021-11-02 23:29:48\nDescription: \nFilePath: CF68A.py\n'''\n\n\ndef func():\n lst, a, b = map(int, input().strip().split())\n count = 0\n for i in range(a, b + 1):\n for item in lst:\n if i % item != i:\n break\n else:\n count += 1\n return count\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "l, a, b = map(int, input().split())\r\nprint(max(0, min(b + 1, *l) - a))" ]	{"inputs": ["2 7 1 8 2 8", "20 30 40 50 0 100", "31 41 59 26 17 43", "1 2 3 4 0 0", "1 2 3 4 1 1", "1 2 999 1000 30 40", "17 18 19 20 17 20", "17 18 19 20 16 20", "41 449 328 474 150 709", "467 329 936 440 117 700", "258 811 952 491 931 993", "823 431 359 590 153 899", "292 370 404 698 699 876", "442 705 757 527 868 893", "642 273 18 885 675 788", "291 303 656 660 126 704", "225 862 522 617 630 725", "17 847 715 732 502 778", "41 449 328 474 15724 19169", "467 329 936 440 5705 28145", "258 811 952 491 2995 11942", "823 431 359 590 153 3902", "292 370 404 698 19718 19895", "442 705 757 527 1869 19912", "642 273 18 885 23811 28703", "291 303 656 660 7711 15141", "225 862 522 617 1246 1341", "17 847 715 732 778 27529", "997 998 999 1000 0 31415", "1 2 3 4 0 31415", "541 931 822 948 131 193", "956 800 909 916 89 194", "735 794 942 991 419 490", "818 926 827 575 153 395", "792 858 887 679 179 356", "937 683 742 515 366 373", "616 747 501 875 146 264", "760 773 638 655 111 196", "697 855 997 589 97 192", "998 834 706 722 277 475", "100 101 102 103 10 20"], "outputs": ["0", "20", "9", "1", "0", "0", "0", "1", "0", "212", "0", "206", "0", "0", "0", "165", "0", "0", "0", "0", "0", "206", "0", "0", "0", "0", "0", "0", "997", "1", "63", "106", "72", "243", "178", "8", "119", "86", "96", "199", "11"]}	UNKNOWN	PYTHON3	CODEFORCES	63
d41eccdddbe3022c0a46f60c8badcf60	Abbreviation	You are given a text consisting of $n$ space-separated words. There is exactly one space character between any pair of adjacent words. There are no spaces before the first word and no spaces after the last word. The length of text is the number of letters and spaces in it. $w_i$ is the $i$-th word of text. All words consist only of lowercase Latin letters. Let's denote a segment of words $w[i..j]$ as a sequence of words $w_i, w_{i + 1}, \dots, w_j$. Two segments of words $w[i_1 .. j_1]$ and $w[i_2 .. j_2]$ are considered equal if $j_1 - i_1 = j_2 - i_2$, $j_1 \ge i_1$, $j_2 \ge i_2$, and for every $t \in [0, j_1 - i_1]$ $w_{i_1 + t} = w_{i_2 + t}$. For example, for the text "to be or not to be" the segments $w[1..2]$ and $w[5..6]$ are equal, they correspond to the words "to be". An abbreviation is a replacement of some segments of words with their first uppercase letters. In order to perform an abbreviation, you have to choose at least two non-intersecting equal segments of words, and replace each chosen segment with the string consisting of first letters of the words in the segment (written in uppercase). For example, for the text "a ab a a b ab a a b c" you can replace segments of words $w[2..4]$ and $w[6..8]$ with an abbreviation "AAA" and obtain the text "a AAA b AAA b c", or you can replace segments of words $w[2..5]$ and $w[6..9]$ with an abbreviation "AAAB" and obtain the text "a AAAB AAAB c". What is the minimum length of the text after at most one abbreviation? The first line of the input contains one integer $n$ ($1 \le n \le 300$) — the number of words in the text. The next line contains $n$ space-separated words of the text $w_1, w_2, \dots, w_n$. Each word consists only of lowercase Latin letters. It is guaranteed that the length of text does not exceed $10^5$. Print one integer — the minimum length of the text after at most one abbreviation. Sample Input 6 to be or not to be 10 a ab a a b ab a a b c 6 aa bb aa aa bb bb Sample Output 12 13 11	[ "# https://codeforces.com/contest/1003\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input())\ns = input()\n\n# word list\nw = s.split()\n\n# dict: word to index\nwd = {}\nfor x in w:\n if x not in wd:\n wd[x] = len(wd)\n\n# number of distinct words\nnw = len(wd)\n\n# length of i-th word\nwl = [0] * nw\nfor word, idx in wd.items():\n wl[idx] = len(word)\n\n# translate word list to list of word indices\nw = [wd[x] for x in w]\n\nmax_savings = 0\n\n\ndef next_segment(orig, k, start):\n while start + k <= n:\n ok = True\n for i in range(k):\n if w[orig + i] != w[start + i]:\n ok = False\n break\n if ok:\n return start\n start += 1\n return -1\n\n\nfor i in range(n):\n for k in range(1, n // 2 + 1):\n if i + k >= n:\n break\n c = 1\n pos = i + k\n while True:\n j = next_segment(i, k, pos)\n if j == -1:\n break\n c += 1\n pos = j + k\n if c >= 2:\n savings = c * (sum(wl[w[i + j]] for j in range(k)) - 1)\n max_savings = max(max_savings, savings)\n\nprint(len(s) - max_savings)\n", "n = int(input())\r\nW = list(map(str, input().split()))\r\n\r\nallSum = n-1\r\nfor w in W:\r\n allSum += len(w)\r\n\r\neq = [[False]n for i in range(n)]\r\nfor i in range(n):\r\n eq[i][i] = True\r\n for j in range(i):\r\n eq[i][j] = (W[i]==W[j])\r\n eq[j][i] = (W[i]==W[j])\r\n\r\ndp = [[0]n for i in range(n)]\r\nfor i in range(n-1, -1, -1):\r\n for j in range(n-1, -1, -1):\r\n if eq[i][j]:\r\n if i+1 < n and j+1 < n:\r\n dp[i][j] = dp[i+1][j+1]+1\r\n else:\r\n dp[i][j] = 1\r\nans = allSum\r\n\r\nfor i in range(n):\r\n s = 0\r\n for j in range(n-i):\r\n s += len(W[i+j])\r\n cnt = 1\r\n pos = i+j+1\r\n while pos < n:\r\n if dp[i][pos] > j:\r\n cnt += 1\r\n pos += j\r\n pos += 1\r\n cur = allSum-scnt+(j+1)cnt-jcnt\r\n if cnt > 1 and ans > cur:\r\n ans = cur\r\n\r\nprint(ans)\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef z_algorithm():\r\n m = len(w)\r\n z = [0] m\r\n z[0] = m\r\n i, j = 1, 0\r\n while i < m:\r\n while i + j < m and w[j] == w[i + j]:\r\n j += 1\r\n z[i] = j\r\n if not j:\r\n i += 1\r\n continue\r\n l = 1\r\n while l < j and l + z[l] < j:\r\n z[i + l] = z[l]\r\n l += 1\r\n i += l\r\n j -= l\r\n return z\r\n\r\nn = int(input())\r\nw = list(input().rstrip().split())\r\na = [len(w[i]) for i in range(n)]\r\nb = [0]\r\nfor i in a:\r\n b.append(i + b[-1])\r\ns = b[n] + n - 1\r\nans = s\r\nfor i in range(n):\r\n z = z_algorithm()\r\n m = 0\r\n for j in range(1, n - i):\r\n k, c = 0, 0\r\n while k < n - i:\r\n if z[k] >= j:\r\n c += 1\r\n k += j\r\n else:\r\n k += 1\r\n if c > 1:\r\n m = max(m, c * (b[i + j] - b[i] - 1))\r\n ans = min(ans, s - m)\r\n w = deque(w)\r\n w.popleft()\r\n w = list(w)\r\nprint(ans)" ]	{"inputs": ["6\nto be or not to be", "10\na ab a a b ab a a b c", "6\naa bb aa aa bb bb", "45\nxr l pl sx c c u py sv j f x h u y w w bs u cp e ad ib b tz gy lm e s n ln kg fs rd ln v f sh t z r b j w of", "250\nf r s d b f f k d e k v m b t k k j t t a o m m s n d w l v g e k x d w k v a j h c a g x s d e t z z w q z d h n r i k b z k u s q l k c v o d o w w c y i a q v r i g i m l b x z h t a i j t h q u e v j o h w m o v k g r r x j a c m z z i s i r a p p i i l e i g m f f f y v k m c l p n n n j j u t t q s o y b t m x n n t z f c g s r f h w z b b d q d y h t v g y e w p l n m f v c s b r g p v w z c o h k u r c g c s v w r t w k z v t v y z i x r f o l e o u q z k x c o l e c b d j v f z y e r k", "1\nu", "1\nvpdgzvgvgbichiiqdhytvcooetcgeecyueoylqzbtzzgaqhalt", "1\nxdhlmtnvecsbwbycahddxnvwpsxwxgfmidfetpkpeevpjzfbgfafbjpyuevupuptoxutnketcxwrllooyxtxjzwxpzcbpiqzeiplcqvdxyyznjxgkwstpxogdihsamoqhyspbjlelxpbarzqawsgidjtmnpmmupohnslirorliapvntasudhpuuxynyoipuqxdiysbyctpmfpbxqfdlmlsmsvtbxoypkbhwrtpwbsbcdhypsbqhqpdlilquppdwsszrpavcowudreygmpwckbzlpnxxqxjdpqmtidjatvgcbxjrpqqxhhsvlpyxxkoqxutsvebrlxqeggvsnshetkpnfygpwbmnuujfvqnlgavwppufxadhxtffsrdknfmqbsjjegcwokbauzivhnldkvykkytkyrwhimmkznkkofcuioqmpbshskvdhsetyidubcgvuerbozqfbkcmaguaszaivtuswzmtnqcpoiqlvronibiqyeoqm", "2\nvjrvahvokiudpiocpvoqsqhukavyrckhcbctr prqxizcofrfr", "2\nxxwxpgalijfbdbdmluuaubobxztpkfn parzxczfzchinxdtaevbepdxlouzfzaizkinuaufhckjvydmgnkuaneqohcqocfrsbmmohgpoacnqlgspppfogdkkbrkrhdpdlnknjyeccbqssqtaqmyamtkedlhpbjmchfnmwhxepzfrfmlrxrirbvvlryzmulxqjlthclocmiudxbtqpihlnielggjxjmvqjbeozjpskenampuszybcorplicekprqbsdkidwpgwkrpvbpcsdcngawcgeyxsjimalrrwttjjualmhypzrmyauvtothnermlednvjbpgkehxbtbpxolmaapmlcuetghikbgtaspqesjkqwxtvccphjdqpuairsaypfudwvelmupbzhxwuchnfumcxmhflkpyzeppddtczbcjrookncgtojmujyvponennuudppqwwjtnwpgapokwzvbxohrdcvcckzbcrwwvfqlbnwbnmmv", "4\ncongratulations for being first", "4\njngen hype xfckaovxfckaovxfckaovxfckaovxfckaovfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwz fegkbwzxfckaovfegkbwzxfckaovxfckaovxfckaovfegkbwzfegkbwzxfckaovxfckaovxfckaovfegkbwzfegkbwzxfckaovxfckaovxfckaovxfckaovxfckaovxfckaovfegkbwzxfckaov", "4\njngen hype acpumodacpumodacpumodulhiwuoulhiwuoulhiwuoacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodulhiwuoacpumodacpumodulhiwuoacpumodulhiwuoacpumod ulhiwuoulhiwuoacpumodacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodacpumodacpumodacpumodacpumodulhiwuoulhiwuoulhiwuoulhiwuoacpumodulhiwuo", "4\nraraaraaarrraraaaaaaaaaaaaaaaaraaraararaarraarrraaarrarrraaaarrrarrrrraaraaaarrararrarraarrrararaaar arrararaararaarraaaraararraararaarrraarrrarrrrarrraaaaraaraaaaaaaraaararrarararrarrraarrarrrrraaaaar arrararaararaarraaaraararraararaarrraarrrarrrrarrraaaaraaraaaaaaaraaararrarararrarrraarrarrrrraaaaar raraaraaarrraraaaaaaaaaaaaaaaaraaraararaarraarrraaarrarrraaaarrrarrrrraaraaaarrararrarraarrrararaaar", "4\njngen hype wlvgjpibylpibylwlvgjpibylwlvgjwlvgjwlvgjwlvgjwlvgjpibylwlvgjwlvgjpibylpibylpibylwlvgjpibylpibyl pibylpibylpibylpibylpibylwlvgjwlvgjpibylwlvgjwlvgjpibylpibylwlvgjwlvgjwlvgjpibylwlvgjpibylwlvgj", "29\nqiozjl ghgehr xewbil hwovzr keodgb foobar dvorak barfoo xjjfgm wybwaz jizzzz jizzij tjdqba jiyiqj jizziz inforr icagmg jizjiz tdxtfv jhkhdw pgvlzq qvfpbx ymhmll kzaodh xccnda ugywmk jijizz lkkhfs qwerty", "4\naahahhhaaaaaahhaaahaaahahhhahahhhhhhahhahhhhhhahah ahaahahahaaaahahahaaahaaaahhhaaahhahaaahhaahhaaaah ahaahahahaaaahahahaaahaaaahhhaaahhahaaahhaahhaaaah aahahhhaaaaaahhaaahaaahahhhahahhhhhhahhahhhhhhahah", "4\naaaahaaahahhaaahaaahaahhhahhaaaaahahaahaahaahhaaha hhahhahhaaahhhhhhhhahhhhahaahhhaahhahhhhaahahhhhaa hhahhahhaaahhhhhhhhahhhhahaahhhaahhahhhhaahahhhhaa aaaahaaahahhaaahaaahaahhhahhaaaaahahaahaahaahhaaha", "4\njngen hype flnhgpflnhgpwdxrlvwdxrlvflnhgpwdxrlvflnhgpwdxrlvflnhgpwdxrlvflnhgpflnhgpwdxrlvflnhgpflnhgpflnhgpwdxrlvflnhgp wdxrlvwdxrlvflnhgpwdxrlvflnhgpflnhgpflnhgpwdxrlvflnhgpwdxrlvwdxrlvflnhgpflnhgpwdxrlvflnhgpflnhgpflnhgpflnhgp", "40\naanvs aaikp afkib abrzm abnrq aaxdo aaqxz aalhq afhrw aeets acmlb aazzc acphl aanlr abdfc aatdv adfxe abrud acare abbao aauui aacyx aannq aafwd adirh aafiz accgm aalfz aeeac abrja acfkl aabmr aayub aairn acoqw aavlo afgjf aetbp acbbx abmqy", "2\nrmdkgswpghuszbnq oveleebkwopbnmbr", "2\naisajfcrtzfmrpth fninkxwvnqzjvfdq", "40\naclsp aafgb abvlq aazfz aajjt aacts acbfz aawkl abozz aawlg acmre aapqu acodc aaapn aezbx abhjl adhdt aauxj afggb aafbm acbah abgbo abafl aazow acfwx ablad acifb aayly aemkr acsxa aeuzv abvqj actoq aazzc aayye aaxpo advso aanym abtls aahre", "4\njngen hypee acpumodacpumodacpumodulhiwuoulhiwuoulhiwuoacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodulhiwuoacpumodacpumodulhiwuoacpumodulhiwuoacpumod ulhiwuoulhiwuoacpumodacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodacpumodacpumodacpumodacpumodulhiwuoulhiwuoulhiwuoulhiwuoacpumodulhiwuo", "7\na a b a a a b", "13\nv w s e n g j m g v g o asdf", "2\nxnnlpp jpymdh"], "outputs": ["12", "13", "11", "106", "495", "1", "50", "500", "50", "500", "31", "306", "292", "205", "202", "202", "105", "105", "228", "239", "33", "33", "239", "293", "9", "28", "13"]}	UNKNOWN	PYTHON3	CODEFORCES	3
d44b54a5c176b8db281df28c230f992d	Beautiful Numbers	Vitaly is a very weird man. He's got two favorite digits a and b. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits a and b. Vitaly calls a good number excellent, if the sum of its digits is a good number. For example, let's say that Vitaly's favourite digits are 1 and 3, then number 12 isn't good and numbers 13 or 311 are. Also, number 111 is excellent and number 11 isn't. Now Vitaly is wondering, how many excellent numbers of length exactly n are there. As this number can be rather large, he asks you to count the remainder after dividing it by 1000000007 (109<=+<=7). A number's length is the number of digits in its decimal representation without leading zeroes. The first line contains three integers: a, b, n (1<=≤<=a<=<<=b<=≤<=9,<=1<=≤<=n<=≤<=106). Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7). Sample Input 1 3 3 2 3 10 Sample Output 1 165	[ "import sys, threading\nimport math\nfrom os import path\nfrom collections import deque, defaultdict, Counter\nfrom bisect import \nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\nfrom random import randint\nfrom heapq import \nfrom array import array\nfrom types import GeneratorType\n \n \ndef readInts():\n x = list(map(int, (sys.stdin.readline().rstrip().split())))\n return x[0] if len(x) == 1 else x\n \n \ndef readList(type=int):\n x = sys.stdin.readline()\n x = list(map(type, x.rstrip('\\n\\r').split()))\n return x\n \n \ndef readStr():\n x = sys.stdin.readline().rstrip('\\r\\n')\n return x\n \n \nwrite = sys.stdout.write\nread = sys.stdin.readline\n \n \nMAXN = 1123456\n\n\ndef bootstrap(f, stack=[]):\n def wrappedfunc(args, kwargs):\n if stack:\n return f(args, *kwargs)\n else:\n to = f(args, *kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n return wrappedfunc\n\n\nclass mydict:\n def __init__(self, func=lambda: 0):\n self.random = randint(0, 1 << 32)\n self.default = func\n self.dict = {}\n \n def __getitem__(self, key):\n mykey = self.random ^ key\n if mykey not in self.dict:\n self.dict[mykey] = self.default()\n return self.dict[mykey]\n \n def get(self, key, default):\n mykey = self.random ^ key\n if mykey not in self.dict:\n return default\n return self.dict[mykey]\n \n def __setitem__(self, key, item):\n mykey = self.random ^ key\n self.dict[mykey] = item\n \n def getkeys(self):\n return [self.random ^ i for i in self.dict]\n \n def __str__(self):\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\n\n \ndef lcm(a, b):\n return (ab)//(math.gcd(a,b))\n \n \ndef mod(n):\n return n%(1000000007) \n\n\ndef power(bas, exp):\n if (exp == 0):\n return 1\n if (exp == 1):\n return bas\n \n \n if (exp % 2 == 0):\n t = power(bas, exp // 2)\n t = mod(t * t)\n return t \n\n else:\n return mod(power(bas, exp-1)bas)\n\n\nfactr = []\nfactr = [1]\nfact = 1\nfor i in range(1, MAXN):\n fact = mod(mod(fact)mod(i))\n factr.append(fact)\n \ndef nCr(n, r):\n\n if r > n:\n return 0\n\n n1 = factr[n]\n d1 = power(factr[r], 1000000005)\n d2 = power(factr[n-r], 1000000005)\n\n return mod(mod(n1)mod(d1)mod(d2))\n\n\ndef solve(t):\n # print(f'Case #{t}: ', end = '')\n a, b, n = readInts()\n ans = 0\n for i in range(n+1):\n sm = ia + b(n-i)\n st = set(str(sm))\n st.discard(str(a))\n st.discard(str(b))\n if len(st) > 0:\n continue\n\n ans = mod(ans + nCr(n, i))\n\n print(ans)\n\n\ndef main():\n t = 1\n if path.exists(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/input.txt\"):\n sys.stdin = open(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/input.txt\", 'r')\n sys.stdout = open(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/output.txt\", 'w')\n # sys.setrecursionlimit(100000) \n # t = readInts()\n for i in range(t):\n solve(i+1)\n \n \nif __name__ == '__main__':\n main() ", "#input\r\na,b,n=map(int,input().split())\r\ndic={0:1}\r\nm=109+7\r\n#if it were multiple testcases then we would have precomputed upto 106\r\nfor i in range(1,n+1):\r\n dic[i]=(dic[i-1]i)%m\r\n\r\ndef modExp(a,n,m=109+7):\r\n if n==0:\r\n return 1\r\n elif n==1:\r\n return a\r\n else:\r\n while n>=2:\r\n if n%2==0:\r\n n=n//2\r\n return modExp(((a%m)(a%m))%m,n,m)\r\n else:\r\n n=(n-1)//2\r\n return ((a%m)modExp(((a%m)(a%m))%m,n,m)%m)%m\r\n\r\ndef nCr(n,r):\r\n return (dic[n]modExp(dic[n-r],m-2)modExp(dic[r],m-2))%m\r\n\r\n\r\nout=0\r\nfor i in range(n+1):\r\n op=str(ai+b(n-i))\r\n for j in op:\r\n if j!=str(a) and j!=str(b):\r\n break\r\n else:\r\n out+=nCr(n,i)\r\n out=out%m\r\nprint(out)\r\n ", "ans = 0\nmod = 1000000007\na, b, n = map(int, input().split())\ns = set()\nfor x in range(2, 1 << 8):\n z = 0\n while x > 1:\n z = z * 10 + (a, b)[x & 1]\n x >>= 1\n s.add(z)\nf = [1] * (n + 1)\nfor i in range(1, n + 1):\n f[i] = f[i - 1] * i % mod\nfor x in range(n + 1):\n if x * a + (n - x) * b in s:\n ans += pow(f[x] * f[n - x], mod - 2, mod)\n ans %= mod\nprint(ans * f[n] % mod)\n\n \t \t \t \t \t\t\t\t\t \t \t \t\t", "mod = 10 ** 9 + 7\r\na, b, n = map(int, input().split())\r\nN1 = n + 1\r\nfac = [1]\r\nfor nn in range(1, N1):\r\n fac.append(nn * fac[-1] % mod)\r\nfac_inv = [pow(fac[-1], mod - 2, mod)]\r\nfor nn in range(N1 - 1, 0, -1):\r\n fac_inv.append(fac_inv[-1] * nn % mod)\r\nfac_inv.reverse()\r\ncnt = 0\r\ndiff = b - a\r\nstart = a * n\r\nsab = {str(a), str(b)}\r\nfor i in range(N1):\r\n s = str(start)\r\n for j in s:\r\n if j not in sab:\r\n break\r\n else:\r\n cnt = (cnt + fac[n] * fac_inv[i] * fac_inv[n - i]) % mod\r\n start += diff\r\nprint(cnt)", "class Combinator:\r\n def __init__(self, n, N):\r\n self.n = n\r\n self.N = N\r\n self._compute_factorials()\r\n\r\n def combination(self, k):\r\n # return C(n, k) % N = n! / (k! * n_b!) % N\r\n return (self.factorials[self.n] * self._inv(k)) % self.N\r\n\r\n def _compute_factorials(self):\r\n self.factorials = [1]\r\n for i in range(1, self.n + 1):\r\n self.factorials.append((self.factorials[i - 1] * i) % self.N)\r\n return\r\n\r\n def _fast_power(self, b, e):\r\n if e == 0:\r\n return 1\r\n elif e % 2 == 0: # e even\r\n x = self._fast_power(b, e / 2)\r\n return (x * x) % self.N\r\n else: # e odd\r\n x = self._fast_power(b, (e - 1) / 2)\r\n return (x * x * b) % self.N\r\n\r\n def _inv(self, k):\r\n base = (self.factorials[self.n - k] * self.factorials[k]) % self.N\r\n exponent = self.N - 2\r\n return self._fast_power(base, exponent)\r\n\r\n\r\nclass GoodNumbers:\r\n def __init__(self, first: str, second: str):\r\n self.first = first\r\n self.second = second\r\n self.all_good_numbers = self.first + self.second\r\n\r\n def is_good(self, x: int):\r\n for digit in str(x):\r\n if digit not in self.all_good_numbers:\r\n return False\r\n return True\r\n\r\n\r\nif __name__ == \"__main__\":\r\n N = 10*9 + 7\r\n a, b, n = input().split()\r\n n = int(n)\r\n combinator = Combinator(n, N)\r\n good_numbers = GoodNumbers(a, b)\r\n count = 0\r\n for k in range(n + 1):\r\n number_of_as = k\r\n number_of_bs = n - k\r\n sum_of_digits = number_of_as int(a) + number_of_bs * int(b)\r\n if good_numbers.is_good(sum_of_digits):\r\n count += combinator.combination(k)\r\n count %= N\r\n print(count, end=\"\")\r\n", "''' Aman's submission '''\r\na,b,n = map(int,input().split())\r\nmod=1000000007 #not write too many times \r\nfact = [1] \r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]i)%mod) #confidential list \r\nans = 0\r\nfor i in range(n+1):\r\n su = (ai) + b(n-i)\r\n coef = 1\r\n #check block starts\r\n while(su>0):\r\n if(su%10 != a and su%10!=b):\r\n coef = 0;\r\n su//=10\r\n #check block ends \r\n if(coef==1):\r\n ans+=(fact[n]pow((fact[i]fact[n-i]),mod-2,mod))\r\n ans= ans%mod\r\nprint(ans%mod)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nMOD = 109+7\r\na,b,N = map(int, input().split())\r\n\r\nfact = [1](N+1)\r\nifact = [0](N+1)\r\n \r\nfor i in range(1,N+1):\r\n fact[i] = fact[i-1]i%MOD\r\n# 由阶乘生成逆元\r\nifact[N] = pow(fact[N],MOD-2,MOD)\r\nfor i in range(N,0,-1):\r\n ifact[i-1] = ifact[i]i%MOD\r\n \r\ndef comb(a,b):\r\n cnt = fact[a]ifact[b]ifact[a-b]%MOD\r\n return cnt\r\n\r\ndef check(m):\r\n while m:\r\n t = m%10\r\n if t!=a and t!=b:return False\r\n m//=10\r\n return True\r\n\r\ndef deal(x,y):\r\n t = ax+by\r\n if not check(t):\r\n return 0\r\n \r\n return comb(N,x)\r\n\r\nans = 0\r\nfor i in range(N+1):\r\n ans+=deal(i,N-i)\r\n ans%=MOD\r\nprint(ans)\r\n ", "\r\ndef power(x, y, m): \r\n \r\n if (y == 0): \r\n return 1\r\n \r\n p = power(x, y // 2, m) % m \r\n p = (p p) % m \r\n \r\n if(y % 2 == 0): \r\n return p \r\n else: \r\n return ((x * p) % m) \r\n \r\ndef gcd(a, b): \r\n if (a == 0): \r\n return b \r\n \r\n return gcd(b % a, a) \r\n\r\n\r\na,b,n=map(int,input().split())\r\nans=0\r\nm=1000000007\r\n\r\nfct=[1](n+1)\r\nfct[0]=1\r\nfor i in range(1,n+1):\r\n fct[i]=(fct[i-1](i))%m\r\n\r\nfor i in range(n+1):\r\n k=ia+(n-i)b\r\n k=str(k)\r\n # print(k)\r\n ch1=str(a)\r\n ch2=str(b)\r\n a1=k.count(ch2)\r\n a2=k.count(ch1)\r\n # print(a1,a2)\r\n if(a1+a2==len(k)):\r\n #print(i)\r\n g=fct[n]\r\n #print(g)\r\n j=(power(fct[i],m-2,m))%m\r\n j=(jpower(fct[n-i],m-2,m)+m)%m\r\n #print(j)\r\n j=(gj+m)%m\r\n j=(j+m)%m\r\n #print(j)\r\n ans=(ans+j)%m\r\n ans=(ans+m)%m\r\nprint(ans)", "a, b, n = map(int, input().split())\r\nans = 0\r\nmod = (10 ** 9) + 7\r\nfactorial = [1]\r\nfor i in range(1, n + 1):\r\n factorial.append((factorial[-1] * i) % mod)\r\nfor i in range(n + 1):\r\n sm = str((i * a) + ((n - i) * b))\r\n if sm.count(str(a)) + sm.count(str(b)) == len(sm):\r\n ans += ((factorial[n] * pow(factorial[i], -1, mod) * pow(factorial[n - i], -1, mod)) % mod)\r\n ans = ans % mod\r\nprint(ans)", "import sys\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\ndef inv(a): return pow(a, MOD-2, MOD)\n\nMOD = 1000000007\nMAXN = int(1e6)\nfact = [1](MAXN+1)\nfor i in range(1, MAXN+1):\n fact[i] = fact[i-1] i % MOD\na, b, n = get_ints()\nans = 0\nfor i in range(n+1):\n sum = i * a + (n-i) * b\n flag = True\n for j in str(sum):\n if j != str(a) and j != str(b):\n flag = False\n if not flag:\n continue\n ans += fact[n] * inv(fact[n-i]fact[i])\n ans %= MOD\nprint(ans)\n\t\t\t\t \t \t\t \t \t\t \t\t\t \t \t\t", "p, fact = 109 + 7, [1]\r\n\r\n\r\ndef is_nice(n):\r\n for dg in str(n):\r\n if dg != sa and dg != sb:\r\n return False\r\n return True\r\n\r\n\r\ndef inv(a, p):\r\n return pow(a, p-2, p)\r\n\r\n\r\ndef nCk(n, k, p):\r\n return (fact[n] inv(fact[k], p) * inv(fact[n-k], p)) % p\r\n\r\n\r\nsa, sb, n = input().split()\r\na, b, n = int(sa), int(sb), int(n)\r\nfor i in range(1, n+1):\r\n fact.append(fact[-1]i % p)\r\nsuma, dif = an, b-a\r\nans = int(is_nice(suma))\r\ncomb = 1\r\nfor i in range(1, n+1):\r\n suma += dif\r\n if is_nice(suma):\r\n comb = nCk(n, i, p)\r\n ans = (ans + comb) % p\r\n\r\nprint(ans)\r\n", "def f0(a, b, n):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val * base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = n + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def is_good(x, a, b):\r\n while x:\r\n d = x % 10\r\n if d != a and d != b:\r\n return 0\r\n x //= 10\r\n return 1\r\n\r\n ans = 0\r\n for x in range(0, n + 1):\r\n y = n - x\r\n s = a * x + b * y\r\n if is_good(s, a, b):\r\n inc = facts[n] * invrs[x] * invrs[y] % mod\r\n ans = (ans + inc) % mod\r\n return ans\r\n\r\n\r\na, b, n = map(int, input().split())\r\nprint(f0(a, b, n))\r\n", "\na,b,n=map(int,input().split())\nimport sys\ninput=sys.stdin.readline\np=(109)+7\npri=p\nfac=[1 for i in range((106)+1)]\nfor i in range(2,len(fac)):\n fac[i]=(fac[i-1](i%pri))%pri\ndef modi(x):\n return (pow(x,p-2,p))%p;\n \ndef ncr(n,r):\n x=(fac[n]((modi(fac[r])%p)(modi(fac[n-r])%p))%p)%p\n return x;\n\nans=[]\nfor i in range(n+1):\n total=ia+((n-i)b)\n s=str(total)\n \n if(s.count(str(a))+s.count(str(b))==len(s)):\n ans.append([i,n-i])\ntotal=0\nfor i in range(len(ans)):\n total+=ncr(n,ans[i][0])\n total%=pri\nprint(total)\n \n\n\t \t\t \t\t\t \t \t\t \t\t \t\t \t \t", "f=[0](106+1)\r\nf[0]=f[1]=1\r\nmod=109+7\r\nfor i in range(2,10*6+1):\r\n f[i]=(f[i-1]i)%mod\r\ndef comb(n,r):\r\n return (f[n]pow(f[n-r]f[r],mod-2,mod))%mod\r\na,b,n=map(int,input().split())\r\nans=0\r\ndef is_good(x,a,b):\r\n x=str(x)\r\n a=str(a)\r\n b=str(b)\r\n flag=True\r\n for xx in x:\r\n if xx!=a and xx!=b:\r\n flag=False\r\n return flag\r\nfor k in range(n+1):\r\n s=ak+b(n-k)\r\n if is_good(s,a,b):\r\n ans+=comb(n,k)\r\n ans%=mod\r\nprint(ans%mod)", "mod = 1000000007\r\n\r\n\r\ndef fact(n):\r\n x = 1\r\n for i in range(n, 0, -1):\r\n x = i\r\n x %= mod\r\n return x\r\n\r\n\r\ndef inv(n, mod):\r\n if n % mod == 0:\r\n return n\r\n else:\r\n return pow(n, mod-2, mod)\r\n\r\n\r\na, b, n = map(int, input().split())\r\nans = 0\r\nfor i in range(n+1):\r\n x = ai+b(n-i)\r\n s = str(x)\r\n for char in s:\r\n if char not in [str(a), str(b)]:\r\n break\r\n else:\r\n q = fact(n)inv(fact(n-i)fact(i), mod)\r\n ans += q\r\n ans %= mod\r\nprint(ans)\r\n", "fact = {}\r\n\r\nmodulo = 1000000007\r\n\r\n\r\ndef check(val, a, b):\r\n while val:\r\n if val%10 == a or val%10 == b:\r\n val //= 10\r\n else:\r\n return False\r\n return True\r\n\r\n\r\ndef modpow(base, exp, mod):\r\n if exp == 0:\r\n return 1\r\n if exp & 1:\r\n return modpow(base, exp-1, mod) base % mod\r\n res = modpow(base, exp >> 1, mod)\r\n return (res * res) % mod\r\n\r\n\r\ndef getC(n, i):\r\n res = fact[n]\r\n div = fact[n-i] * fact[i]\r\n div %= modulo\r\n div = modpow(div, modulo-2, modulo)\r\n return (res * div) % modulo\r\n\r\n\r\na, b, n = [int(x) for x in input().split()]\r\n\r\nfact[0] = 1\r\nfor i in range(1, 1000005):\r\n fact[i] = (fact[i - 1] * i)\r\n fact[i] %= modulo\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n expsum = a * i + b * (n - i)\r\n if check(expsum, a, b):\r\n ans += getC(n, i)\r\n ans %= modulo\r\n\r\nprint(ans)", "import sys\r\nimport itertools as it\r\nimport math as mt\r\nimport collections as cc\r\n\r\ninput=sys.stdin.buffer.readline\r\nI=lambda:list(map(int,input().split()))\r\na,b,n=I()\r\nfact=[1](n+1)\r\nmod=109+7\r\nfor i in range(1,n+1):\r\n\tfact[i]=fact[i-1]i\r\n\tfact[i]%=mod\r\ndef ch(n,a,b):\r\n\tf=1\r\n\twhile n:\r\n\t\tif n%10!=a and n%10!=b:\r\n\t\t\tf=0\r\n\t\t\tbreak\r\n\t\tn//=10\r\n\treturn f\r\n\r\nans=0\r\nfor i in range(n+1):\r\n\tx=ia+(n-i)b\r\n\tif ch(x,a,b):\r\n\t\tans+=(fact[n](pow(fact[i],mod-2,mod)%mod)pow(fact[n-i],mod-2,mod))\r\n\t\tans%=mod\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef modularexpo(a:int,b:int,m:int):\r\n a = a%m\r\n res = 1\r\n while(b>0):\r\n if(b&1):\r\n res = (resa)%m\r\n a = (aa)%m\r\n b >>= 1\r\n return res\r\n\r\ndef modinverse(a:int,m:int):\r\n return modularexpo(a,m-2,m)\r\n\r\na,b,n = list(map(int,input().split()))\r\nfact = [0](n+1)\r\nfact[0] = 1\r\nMOD = int(1e9+7)\r\nans = 0\r\n\r\nfor i in range(1,n+1):\r\n fact[i] = (ifact[i-1])%MOD\r\n \r\nfor i in range(0,n+1):\r\n sums = (ai + b(n-i))\r\n \r\n while(sums>0):\r\n rem = sums%10\r\n if(rem!=a and rem!=b):\r\n break\r\n sums = sums//10\r\n \r\n if(sums==0):\r\n ans = (ans + (fact[n] * modinverse((fact[n-i]fact[i])%MOD,MOD))%MOD)%MOD\r\n \r\nprint(ans)", "#1 3 3\n#111 #113 #133 #131 #311 #331 #313\nfact = [0] (1000001)\nmodulo = 1000000007\ndef factoriales():\n\n fact[0] = 1\n i = 1\n while i < len(fact):\n fact[i] = fact[i-1] * i;\n fact[i] %= modulo;\n i+=1\n \ndef binpow(val, deg,mod):\n val %= mod\n res = 1\n while(deg > 0):\n if (deg%2!=0):\n res = res * val % mod\n val = val * val % mod\n deg = deg//2\n return res % mod\n \n\ndef check(suma,a,b):\n #la suma de este numero,\n #debe ser un good numero.\n while suma > 0:\n if suma%10 == a or suma%10 ==b:\n suma//= 10\n else:\n return False\n return True\n\ndef getC(n,i):\n\n respuesta = fact[n]\n div = fact[n-i] * fact[i]\n div %= modulo\n\n #porque teorema \n div = binpow(div, modulo -2, modulo)\n return (respuestadiv) % modulo\n\n\ndef solve(a,b,n):\n res = 0\n for i in range(0,n+1):\n suma = ai + b(n-i)\n\n if check(suma,a,b):\n \n res+= getC(n,i)\n res%= modulo\n print(res)\n \n\n\ndef main():\n factoriales()\n a,b,n = [int(x) for x in input().split()]\n solve(a,b,n)\n\nmain()\n \n\n\t \t\t \t \t \t \t\t \t \t \t\t \t\t\t\t \t\t", "\r\na,b,n=map(int,input().split())\r\nimport sys\r\ninput=sys.stdin.readline\r\np=(109)+7\r\npri=p\r\nfac=[1 for i in range((106)+1)]\r\nfor i in range(2,len(fac)):\r\n fac[i]=(fac[i-1](i%pri))%pri\r\ndef modi(x):\r\n return (pow(x,p-2,p))%p;\r\n \r\ndef ncr(n,r):\r\n x=(fac[n]((modi(fac[r])%p)(modi(fac[n-r])%p))%p)%p\r\n return x;\r\n\r\nans=[]\r\nfor i in range(n+1):\r\n total=ia+((n-i)b)\r\n s=str(total)\r\n \r\n if(s.count(str(a))+s.count(str(b))==len(s)):\r\n ans.append([i,n-i])\r\ntotal=0\r\nfor i in range(len(ans)):\r\n total+=ncr(n,ans[i][0])\r\n total%=pri\r\nprint(total)\r\n \r\n", "a, b, n = map(int, input().split())\nmod = 1000000007\ntot = 0\n\nfact = [1 for i in range(n + 1)]\n\nfor i in range(1, n + 1):\n fact[i] = (fact[i - 1] * i) % mod\n\ndef expmod(a, b):\n x = 1\n while b > 0:\n if b & 1 == 1:\n x = (x * a) % mod\n a = (a * a) % mod\n b >>= 1\n return x\n\ndef nCr(n, r):\n return fact[n] * expmod(fact[r] * fact[n - r], mod - 2)\n\nfor i in range(n + 1):\n s = str(a * i + b * (n - i))\n bad = False\n for c in s:\n if c != str(a) and c != str(b):\n bad = True\n break\n if not bad:\n tot = (tot + nCr(n, i)) % mod\n\nprint(tot)\n", "MAX = 1000000007\n\ndef inv(x):\n return modpow(x, MAX-2, MAX)\n\ndef modpow(b, e, m):\n if e == 0:\n return 1 % m\n u = modpow(b, e//2, m)\n u = (uu) % m\n if e % 2 == 1:\n u = (ub) % m\n return u\n\ndef checkSum(a, b, sum):\n for i in range(len(sum)):\n if not (sum[i] == a or sum[i] == b):\n return False\n return True\n\ndef solve(a, b, n):\n r = 0\n f = [1](n+1)\n for i in range(2,n+1):\n f[i] = (f[i-1]i) % MAX\n for k in range(0,n+1):\n sum = ka + (n-k)b\n if checkSum(str(a), str(b), str(sum)):\n #r += f[n]//(f[k]f[n-k])\n r += f[n] inv(f[k]f[n-k])\n r = r % MAX\n return r % MAX\n\nif __name__ == \"__main__\":\n a, b, n = list(map(int, input().split()))\n solution = solve(a, b, n)\n print(solution)\n\t \t \t \t \t\t \t\t \t \t \t\t", "\r\nMOD = 1000000007\r\nfact = [1](106+1)\r\n\r\ndef pre_computation():\r\n for i in range(2,106+1):\r\n fact[i] = (fact[i-1]i)%MOD\r\n\r\ndef mod_inv(a):\r\n return pow(a,MOD-2,MOD)\r\n\r\ndef nCr(n,r): # n!/(r!(n-r)!)\r\n return fact[n]mod_inv((fact[r]fact[n-r])%MOD)\r\n\r\ndef check(sm,a,b):\r\n while sm:\r\n if sm%10 == a or sm%10 == b:\r\n sm //= 10\r\n else:\r\n return False\r\n return True\r\n\r\ndef main():\r\n pre_computation()\r\n (a,b,n) = map(int,input().split())\r\n\r\n ans = 0\r\n for i in range(n+1):\r\n sm = ai+(n-i)b\r\n if check(sm,a,b):\r\n ans = (ans + nCr(n,i))%MOD\r\n\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from math import factorial\r\n \r\nMOD = 10*9+7\r\nfact = {}\r\n \r\na, b, n = map(int, input().split())\r\nfact[0]=1\r\nfor i in range(1, n+1):\r\n fact[i] = fact[i-1]i%MOD\r\n \r\nans = 0\r\nfor (i, j) in zip(range(n+1), range(n, -1, -1)):\r\n if set(str(ai + bj)) <= {f'{a}', f'{b}'}:\r\n ans+=(fact[n]pow(fact[n-i]fact[i]%MOD, MOD-2, MOD) % MOD)\r\nprint(ans%MOD)", "import io\r\nmod = 1000000007\r\n\r\n\r\ndef power(x, e):\r\n if e == 1:\r\n return x % mod\r\n tmp = power(x, e // 2)\r\n tmp = ((tmp % mod) * (tmp % mod)) % mod\r\n if e % 2 != 0:\r\n tmp = ((tmp % mod) * (x % mod)) % mod\r\n return tmp\r\n\r\n\r\nclass Solution:\r\n def __init__(self, n):\r\n fact = list(range(n + 1))\r\n fact[0], fact[1] = 1, 1\r\n for i in range(2, n + 1):\r\n fact[i] = fact[i - 1] * i\r\n fact[i] %= mod\r\n\r\n self.fact = fact\r\n\r\n def rCn(self, p, n):\r\n tmp = power(self.fact[n - p] * self.fact[p], mod - 2)\r\n return ((tmp % mod) * (self.fact[n] % mod)) % mod\r\n\r\n def is_good(self, x, a, b):\r\n s = str(x)\r\n return s.count(str(a)) + s.count(str(b)) == len(s)\r\n\r\n def solve(self, a, b, n):\r\n ans = 0\r\n for p in range(n+1):\r\n if self.is_good(p * a + (n - p) * b, a, b):\r\n ans += self.rCn(p, n)\r\n ans %= mod\r\n return ans\r\n\r\n\r\nout = io.StringIO()\r\na, b, n = map(int, input().split())\r\nsol = Solution(n)\r\nprint(sol.solve(a, b, n))\r\n\r\n", "import sys\r\n#sys.setrecursionlimit(10*7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Beautiful_Numbers2():\r\n def is_good_sum(a,b,num):\r\n while num > 0 :\r\n digit = num % 10\r\n num = num // 10\r\n\r\n if digit != a and digit != b:\r\n return False \r\n \r\n return True \r\n\r\n a,b,n = invr()\r\n x = 1000000007\r\n\r\n\r\n\r\n factorial_calc = []\r\n for i in range(n+1):\r\n if i == 0:\r\n factorial_calc.append(1)\r\n else:\r\n new_num = (factorial_calc[-1] i) % x\r\n factorial_calc.append(new_num)\r\n \r\n total_combinations = 0 \r\n\r\n for i in range(n+1):\r\n sum_of_num = (ai) + (b(n-i))\r\n #print(sum_of_num)\r\n\r\n if is_good_sum(a,b,sum_of_num):\r\n number_of_ways = factorial_calc[n] * pow(factorial_calc[i]factorial_calc[n-i], x-2, x)\r\n number_of_ways = number_of_ways % x\r\n total_combinations += number_of_ways\r\n \r\n print(total_combinations % x)\r\n return\r\n\r\n\r\nBeautiful_Numbers2()", "\r\ndef is_good(x):\r\n while x > 0:\r\n if x % 10 not in {a, b}:\r\n return False\r\n x //= 10\r\n return True\r\n\r\n\r\ndef inverse(a):\r\n def power_modulo(n, k, m):\r\n res = 1\r\n while k > 0:\r\n if k % 2:\r\n res = res n % m\r\n k //= 2\r\n n = n * n % m\r\n\r\n return res\r\n return power_modulo(a, m - 2, m)\r\n\r\n\r\ndef binomial(x, y):\r\n if x == y or y == 0:\r\n return 1\r\n return factorial[x] * inverse(factorial[y]) % m * inverse(factorial[x-y]) % m\r\n\r\n\r\na, b, n = map(int, input().split())\r\nm = 1000000007\r\n\r\nfactorial = [0] * (n + 1)\r\nfactorial[0] = 1\r\nfor i in range(1, n + 1):\r\n factorial[i] = factorial[i - 1] * i % m\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n if is_good(ia + (n-i)b):\r\n # print(ia + (n-i)b, i, 'is good')\r\n # print('binomial', n, i, 'is', binomial(n, i))\r\n ans += binomial(n, i)\r\n ans %= m\r\n\r\nprint(ans)\r\n", "mod=1000000007 \r\nfactorial=[]\r\n\r\ndef excellent(a,b,n,i):\r\n sum=ai+b(n-i)\r\n while sum>0:\r\n if (sum%10 == a) or (sum%10 == b):\r\n sum=sum//10\r\n else :\r\n return 0\r\n return 1\r\n\r\ndef combination(n,i):\r\n a=factorial[n]\r\n b=(factorial[n-i])(factorial[i])\r\n b%=mod\r\n c=power(b,mod-2)\r\n return (ac)%mod\r\n\r\ndef calcualate_factorial():\r\n factorial.append(1)\r\n for i in range(1000001):\r\n a=((i+1)factorial[i])%mod\r\n factorial.append(a)\r\n\r\ndef power(a,n):\r\n b=1\r\n while n>0:\r\n if (n%2)==1:\r\n b=a\r\n b%=mod\r\n a=a\r\n a%=mod\r\n n=n//2\r\n return b%mod\r\n\r\nif __name__=='__main__':\r\n a,b,n=[int(x) for x in input().split()]\r\n ans=0\r\n calcualate_factorial()\r\n for i in range(n+1):\r\n if excellent(a,b,n,i):\r\n ans+=combination(n,i)\r\n ans%=mod\r\n print(ans)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import \r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import \r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\nm = 1000000007\r\ndef fastpower_with_mod(x , y , m):\r\n res = 1\r\n if x == 0 :\r\n return 0\r\n\r\n x %= m\r\n while y > 0 :\r\n if (y % 2 != 0 ):\r\n res = (res x) % m\r\n x = (x * x) % m\r\n y //= 2\r\n return res\r\n\r\n\r\ndef check_sum(sm , a , b):\r\n while (sm):\r\n if (sm % 10 != a and sm % 10 != b):\r\n return False\r\n sm//= 10\r\n\r\n return True\r\n\r\ndef calc_inv(num , m):\r\n return fastpower_with_mod(num , m-2 , m)\r\n\r\ndef ncr(n, r,m):\r\n if n==r or r==0:\r\n return 1\r\n if n<r:\r\n return 0\r\n return (fac[n]calc_inv(fac[r],m)%mcalc_inv(fac[n-r],m)%m)%m\r\n\r\na , b , n = MAP()\r\n\r\nfac = [0] * (10*6 + 9 )\r\nfac[1] = 1\r\nfor i in range(2 , n + 1):\r\n fac[i] = (fac[i - 1] i) % m\r\n\r\nres = 0\r\nfor i in range(n + 1):\r\n sm = a * i + b * (n-i)\r\n if (check_sum(sm , a , b)):\r\n res += ncr(n , i , m)\r\n res %= m\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "import sys,math\r\nfrom collections import deque,defaultdict\r\nimport operator as op\r\nfrom functools import reduce\r\nfrom itertools import permutations\r\nimport heapq\r\n\r\n# sys.setrecursionlimit(107) \r\n#OneDrive\\Documents\\codeforces\r\n\r\nI=sys.stdin.readline\r\n\r\nalpha=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nmod=109 + 7\r\n\r\n\"\"\"\r\nx_move=[-1,0,1,0,-1,1,1,-1]\r\ny_move=[0,1,0,-1,1,1,-1,-1]\r\n\"\"\"\r\ndef ii():\r\n\treturn int(I().strip())\r\ndef li():\r\n\treturn list(map(int,I().strip().split()))\r\ndef mi():\r\n\treturn map(int,I().strip().split())\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom \r\n\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\ndef isPrime(n):\r\n\tif n<=1:\r\n\t\treturn False\r\n\telif n<=2:\r\n\t\treturn True\r\n\telse:\r\n\t\t\r\n\t\tfor i in range(2,int(n*.5)+1):\r\n\t\t\tif n%i==0:\r\n\t\t\t\treturn False\r\n\t\treturn True\r\n\r\n\r\n#print(\"Case #\"+str(_+1)+\":\",ans)\r\ndef modInverse(a, m):\r\n m0 = m\r\n y = 0\r\n x = 1\r\n \r\n if (m == 1):\r\n return 0\r\n \r\n while (a > 1):\r\n \r\n # q is quotient\r\n q = a // m\r\n \r\n t = m\r\n \r\n # m is remainder now, process\r\n # same as Euclid's algo\r\n m = a % m\r\n a = t\r\n t = y\r\n \r\n # Update x and y\r\n y = x - q y\r\n x = t\r\n \r\n # Make x positive\r\n if (x < 0):\r\n x = x + m0\r\n \r\n return x\r\n\r\n\r\ndef isExcelent(x,y,a,b):\r\n\t\r\n\ttmp=ax+by \r\n\ta=str(a)\r\n\tb=str(b)\r\n\tfor i in str(tmp):\r\n\t\tif i!=a and i!=b:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nfact=[1](106 +1)\r\n\r\nfor i in range(1,106 + 1):\r\n\tfact[i]=(fact[i-1]i)%mod\r\n\r\n\r\ndef main():\r\n\ta,b,n=mi()\r\n\tcnt=0\r\n\tfor i in range(n+1):\t\t\r\n\t\tif isExcelent(i,n-i,a,b):\r\n\t\t\tx= (fact[n]modInverse(fact[i],mod)modInverse(fact[n-i],mod))%mod\r\n\t\t\tcnt+=x\r\n\t\r\n\tprint(cnt%mod)\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\t\r\n\t\r\n\r\n\t\t\t\t\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a,b,n = map(int,input().split())\r\nm =1000000007\r\nfact = [1]\r\n\r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]i)%m)\r\nans = 0\r\nfor i in range(n+1):\r\n su = (ai) + b(n-i)\r\n coef = 1\r\n while(su>0):\r\n if(su%10 != a and su%10!=b):\r\n coef = 0;\r\n su//=10\r\n if coef:\r\n ans+=(fact[n]pow((fact[i]fact[n-i]),m-2,m))\r\n ans= ans%m\r\nprint(ans%m)\r\n \r\n ", "import sys\r\nimport math\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod = 1000000007\r\n#map(int,input().split())\r\n#int(input())\r\na,b,n=map(int,input().split())\r\nans=0\r\ns=str(a)+str(b)\r\nfac=[1](106+1)\r\nfor i in range(2,106+1):\r\n fac[i]=(fac[i-1]i)%mod\r\nfor i in range(n+1):\r\n veri=ai+b(n-i)\r\n flag=1\r\n temp=veri\r\n while temp>0:\r\n if temp%10!=a and temp%10!=b:\r\n flag=0\r\n break\r\n temp//=10\r\n if flag:\r\n ans=(ans+fac[n]pow(fac[i]fac[n-i],mod-2,mod))%mod\r\nprint(ans)", "N=106\r\nmod=109+7\r\ndef checkgood(val, a, b):\r\n while(val):\r\n if(val%10 != a and val%10 !=b ):\r\n return False\r\n val//=10\r\n return(True)\r\ndef power(x, a):\r\n if(a==0):\r\n return(1)\r\n z=power(x, a//2)\r\n z = (z2)%mod\r\n if(a%2):\r\n z=(zx)%mod\r\n return(z)\r\nfact=[1 for _ in range(N+1)]\r\nfor no in range(2, N+1):\r\n fact[no]=(fact[no-1]no)%mod\r\n[a, b, n]=list(map(int, input().split()))\r\ncount=0\r\nval=(n+1)b-a\r\nfor freq in range(n+1):\r\n val += a-b\r\n if(checkgood(val, a, b)):\r\n count+=(((fact[n]power(fact[freq], mod-2))%mod)power(fact[n-freq], mod-2))%mod\r\n count%=mod\r\nprint(count)", "a,b,n = [int(i) for i in input().split()]\r\n\r\nmod = (10*9) + 7\r\n\r\nfact = [0] (1000001)\r\nfact[0] = 1\r\nfact[1] = 1\r\ncount = 0\r\n\r\ndef modpow(a , b):\r\n\tans = 1\r\n\twhile b > 0:\r\n\t\tif b%2:\r\n\t\t\tans = (ans * a) % mod\r\n\t\tb = b // 2\r\n\t\ta = ((a%mod) * (a% mod)) % mod\r\n\r\n\treturn ans\r\n\r\nfor i in range(2 , 1000001):\r\n\tfact[i] = i * fact[i-1]\r\n\tfact[i] %= mod\r\n\r\nfor i in range(0 , n+1):\r\n\tx = i\r\n\ty = n - x\r\n\ts = (ax) + (by)\r\n\r\n\tflag = 0\r\n\r\n\tfor i in str(s):\r\n\t\tif int(i) != a and int(i) != b:\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\r\n\tif not flag:\r\n\t\tres = 1\r\n\t\tx1 = fact[n] \r\n\t\ty = modpow(fact[x] , mod - 2)\r\n\t\tz = modpow(fact[n-x] , mod - 2)\r\n\t\tres = x1\r\n\t\tres %= mod\r\n\t\tres = y\r\n\t\tres %= mod\r\n\t\tres = z\r\n\t\tres %= mod\r\n\t\tcount += res\r\n\t\tcount %= mod\r\n\r\nprint(count % mod)\r\n\r\n\r\n", "md = 1000000007\r\na, b, n = map(int, input().split())\r\n\r\nfact = [1] (n + 1)\r\nfor i in range(1, n + 1):\r\n fact[i] = (fact[i - 1] * i) % md\r\ndigi = [a, b]\r\n\r\ndef check(num):\r\n while num > 0:\r\n if num % 10 not in digi:\r\n return 0\r\n num //= 10\r\n return 1\r\n\r\nans = 0\r\nfor i in range(n + 1):\r\n if check(a * i + b * (n - i)):\r\n ans = (ans + pow(fact[i] * fact[n - i], md - 2, md)) % md\r\nprint((ans * fact[n]) % md)\r\n\r\n", "def egcd(a, b):\n if a == 0:\n return (b, 0, 1)\n else:\n g, y, x = egcd(b % a, a)\n return (g, x - (b // a) * y, y)\ndef modinv(a, m):\n g, x, y = egcd(a, m)\n return x % m\na, b, n = map(int, input().split())\nc = str(a) + str(b)\nf, mod, ans = [1], 1000000007, 0\nfor i in range(1, n + 1):\n f.append(f[-1] * i % mod)\ns = a * n\nfor i in range(n + 1):\n if all(i in c for i in str(s)):\n ans += f[n] * modinv(f[i] * f[n - i], mod) % mod\n s += b - a\nprint(ans % mod)\n\n\t \t \t \t\t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t", "fact = [1] * (10 6+50)\r\nmod = 10 9 + 7\r\nfor i in range(2, len(fact)):\r\n fact[i] = (fact[i-1] * i) % mod\r\n\r\ndef get_ret(n):\r\n return pow(n, mod-2, mod)\r\n\r\ndef ck(n, k):\r\n return (fact[n] * get_ret(fact[n-k] * fact[k])) % mod\r\n\r\n\r\ndef main():\r\n a, b, n = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in range(n//2+1):\r\n if str(i * (a+b) + (n-i2)a).count(str(a)) + str(i * (a+b) + (n-i2)a).count(str(b)) == len(str(i * (a+b) + (n-i2)a)):\r\n ans = (ans + ck(n, i + n - i2)) % mod\r\n for i in range(n//2+1):\r\n if str(i (a + b) + (n - i * 2) * b).count(str(a)) + str(i * (a + b) + (n - i * 2) * b).count(\r\n str(b)) == len(str(i * (a+b) + (n-i2)b)):\r\n ans = (ans + ck(n, i + n - i * 2)) % mod\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "ans = 0\r\nmod = 10*9+7\r\na, b, n = map(int, input().split())\r\ns = set()\r\nfor x in range(2, 1 << 8):\r\n z = 0\r\n while x > 1:\r\n z = z 10 + (a, b)[x & 1]\r\n x >>= 1\r\n s.add(z)\r\nf = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n f[i] = f[i - 1] * i % mod\r\nfor x in range(n + 1):\r\n if x * a + (n - x) * b in s:\r\n ans += pow(f[x] * f[n - x], mod - 2, mod)\r\n ans %= mod\r\nprint(ans * f[n] % mod)", "def ncr(n, r, p):\r\n # initialize numerator\r\n # and denominator\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, \r\n p - 2, p)) % p\r\na,b,n=map(int,input().split())\r\nans=0\r\np=10*9+7\r\nnum=1\r\nden=1\r\nfor i in range(n+1):\r\n s=ai+b(n-i)\r\n if i!=0:\r\n num=(num(n-i+1))%p\r\n den=(den(i))%p\r\n am=True\r\n while s!=0:\r\n if s%10!=a and s%10!=b:\r\n am=False\r\n break\r\n s//=10\r\n if am:\r\n ans=(ans+(numpow(den,p-2,p))%p)%p\r\nprint(ans%p)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\na,b,n=(int(i) for i in input().split())\r\nmod=1000000007\r\nf=[1]\r\nfor i in range(1,1000001):\r\n f.append((f[i-1]i)%mod)\r\ns1=0\r\nfor i in range(n+1):\r\n s=str(ai+b(n-i))\r\n c=1\r\n for j in s:\r\n if(j!=str(a) and j!=str(b)):\r\n c=0\r\n break\r\n if(c==1):\r\n k=(f[n]pow(f[i]f[n-i],mod-2,mod))%mod\r\n s1=(s1+k)%mod\r\nprint(s1)", "\nMOD = 1000000007\nMX = 1000000\n\nfact = [1] (MX + 1)\nfor i in range(1, MX + 1):\n fact[i] = (fact[i - 1] * i) % MOD\n\n\ndef power(a, b):\n res = 1\n while b > 0:\n if b % 2 == 1:\n res = (res * a) % MOD\n a = (a * a) % MOD\n b //= 2\n return res\n\n\ndef inv(n):\n return power(n, MOD - 2)\n\n\ndef choose(n, k):\n return fact[n] * inv(fact[n - k]) * inv(fact[k])\n\n\ndef is_good(n, g):\n while n > 0:\n if n % 10 not in g:\n return False\n n //= 10\n return True\n\n\na, b, n = map(int, input().split())\nres = 0\nfor ca in range(n + 1):\n cb = n - ca\n if is_good(ca * a + cb * b, [a, b]):\n res += choose(n, ca)\n res %= MOD\nprint(res)", "def good_number(num, a, b):\n lt = [a, b]\n\n while num != 0:\n if num % 10 not in lt:\n return False\n num = int(num / 10)\n return True\n\n\na, b, n = list(map(int, input().split()))\nlista = [1]\np = int(1e9 + 7)\n\nfor i in range(1, n + 1):\n num = int(i * lista[i - 1] % p)\n lista.append(num)\n\nr = 0\nfor i in range(0, n + 1):\n t = a * i + b * (n - i)\n if good_number(t, a, b):\n x = (lista[n] * pow(lista[i], p - 2, p)) % p\n y = pow(lista[n - i], p - 2, p) % p\n\n r += x * y\n r %= p\n\nprint(int(r))\n\n\t \t\t\t \t \t \t\t \t\t\t\t\t \t \t\t \t", "import sys\r\ninput = sys.stdin.readline\r\ndef mod_exp(a:int,b:int,mod:int)->int:\r\n a = a%mod\r\n res = 1\r\n \r\n while b > 0:\r\n if b & 1:\r\n res = (resa)%mod\r\n \r\n a = (aa)%mod\r\n b >>= 1\r\n \r\n return res\r\n\r\ndef modprimeinverse(a:int,mod:int)->int:\r\n return mod_exp(a,mod-2,mod)\r\n\r\ndef comb(x:int,y:int,mod:int)->int:\r\n if x < y:\r\n return 0\r\n else:\r\n return (fact[x] * modprimeinverse(fact[y]fact[x-y],mod))%mod\r\n \r\ndef isgood(x:int,a:int,b:int)->bool:\r\n \r\n while x > 0:\r\n rem = x%10\r\n \r\n if rem != a and rem != b:\r\n return False\r\n \r\n x = x//10\r\n \r\n return True\r\n\r\na,b,n = map(int,input().split())\r\nres = 0\r\nMOD = int(1e9+7)\r\nfact = [1] + [0](n+1)\r\n\r\nfor i in range(1,n+1):\r\n fact[i] = (ifact[i-1])%MOD\r\n \r\nfor i in range(n+1):\r\n if isgood(ai + b(n-i),a,b):\r\n res = (res + comb(n,i,MOD))%MOD\r\n\r\nprint(res)", "a,b,n=[int(x) for x in input().split()]\r\nm =1000000007\r\nfact = [1]\r\ndef helper(a,b,n):\r\n while n:\r\n curr=n%10\r\n if curr!=a and curr!=b:\r\n return False\r\n n=n//10\r\n return True\r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]i)%m)\r\ns=bn\r\nans=0\r\nfor i in range(n+1):\r\n #print(s)\r\n if helper(a,b,s):\r\n ans+=(fact[n]pow((fact[i]fact[n-i]),m-2,m))\r\n ans%=m\r\n s-=b\r\n s+=a\r\nprint(ans%(109+7))", "# https://codeforces.com/problemset/problem/1420/D\r\n\r\ndef f0(a, b, n):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = n + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def is_good(x, a, b):\r\n good = 1\r\n while x:\r\n d = x % 10\r\n if d != a and d != b:\r\n good = 0\r\n break\r\n x //= 10\r\n return good\r\n\r\n ans = 0\r\n for i in [a, b]:\r\n ans += is_good(i * n, a, b)\r\n half = n >> 1\r\n even = 1 ^ (n & 1)\r\n iters = ((a, b), (b, a))\r\n for x in range(1, half + 1):\r\n y = n - x\r\n # print(x, y)\r\n for i, j in iters:\r\n s = i * x + j * y\r\n f1 = is_good(s, i, j)\r\n f2 = not (even and x == half)\r\n # inc = 0\r\n if f1 and f2:\r\n inc = facts[n] * invrs[x] * invrs[y] % mod\r\n # print(facts[n], invrs[x], invrs[y])\r\n ans = (ans + inc) % mod\r\n # print(i, j, s, \"\|\", f1, f2, inc)\r\n return ans\r\n\r\n\r\na, b, n = map(int, input().split())\r\nprint(f0(a, b, n))\r\nexit()\r\n\r\na = 2\r\nb = 3\r\nn = 10\r\n\r\na = 1\r\nb = 3\r\nn = 3\r\n\r\nprint(f0(a, b, n))\r\n", "a, b, n = map(int, input().split())\r\n\r\nmod = 10*9 + 7\r\n\r\nl = [1]\r\nfor i in range(1, n + 1):\r\n l.append((i l[-1]) % mod)\r\n \r\nx, y = 0, n\r\n\r\ns = [] \r\n\r\nwhile(x <= n):\r\n m = a * x + b * y \r\n c = set()\r\n while(m > 0):\r\n c.add(m % 10) \r\n m //= 10 \r\n if(len(c) == 2):\r\n if(a in c and b in c):\r\n s.append((x, y)) \r\n if(len(c) == 1):\r\n if(a in c or b in c):\r\n s.append((x, y))\r\n \r\n \r\n x, y = x + 1, y - 1\r\n \r\nk = 0\r\nfor i in s:\r\n k = (k + pow(l[i[0]] * l[i[1]], mod - 2, mod)) % mod\r\nprint(l[n] * k % mod)", "def read(): return(list(map(int, input().strip().split(\" \"))))\r\n\r\n\r\nMOD = 109 + 7\r\ndef fact():\r\n N = 106 + 1\r\n facto = [0](N+1)\r\n facto[0] = 1\r\n for i in range(1, N + 1):\r\n facto[i] = ((facto[i-1]%MOD)i)%MOD\r\n return(facto)\r\nfacto = fact()\r\n\r\ndef chk(n, a, b):\r\n# print(n, a, b)\r\n s = 0\r\n while n > 0:\r\n if not n%10 in (a,b):return(False)\r\n n //= 10\r\n return(True)\r\n\r\ndef modInverse(a, m):\r\n m0 = m\r\n y = 0\r\n x = 1\r\n \r\n if (m == 1):\r\n return 0\r\n \r\n while (a > 1):\r\n \r\n # q is quotient\r\n q = a // m\r\n \r\n t = m\r\n \r\n # m is remainder now, process\r\n # same as Euclid's algo\r\n m = a % m\r\n a = t\r\n t = y\r\n \r\n # Update x and y\r\n y = x - q * y\r\n x = t\r\n \r\n # Make x positive\r\n if (x < 0):\r\n x = x + m0\r\n \r\n return x\r\n\r\ndef solve():\r\n a, b, n = read()\r\n ans = 0\r\n for i in range(n+1):\r\n x, y = i, n-i\r\n if chk(ax+by, a, b):\r\n u = facto[n]\r\n d = modInverse(((facto[x]%MOD)(facto[y]%MOD))%MOD, MOD)\r\n ans += (ud)%MOD\r\n ans %= MOD\r\n print(ans)\r\n \r\n \r\n \r\nsolve()\r\n \r\n \r\n ", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import \nfrom heapq import \nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nmod = 109+7\nf = [1]\nfor i in range(1,107+1):\n f.append(f[-1]i%mod)\n\nA,B,N = map(int,input().split())\np = [str(A),str(B)]\nans = 0\nfor i in range(N+1):\n k = str(Ai+(N-i)B)\n check = True\n for j in k:\n if j not in p:check=False;break\n\n if check==True:\n ans+=f[N]pow(f[i],mod-2,mod)pow(f[N-i],mod-2,mod)\n ans%=mod\nprint(ans)", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef power(a, b, mod):\r\n res = 1\r\n while b > 0:\r\n if b & 1:\r\n res = (resa) % mod\r\n a = (aa) % mod\r\n b = b//2\r\n return res\r\n\r\n\r\ndef factorial(fact, n, mod):\r\n for i in range(1, n+1):\r\n fact[i] = ((i % mod) (fact[i-1]) % mod) % mod\r\n\r\n\r\ndef ncr(fact, n, r, mod):\r\n if r > n \| n < 0 \| r < 0:\r\n return 0\r\n return (fact[n] % mod)(power(fact[r], mod-2, mod) % mod)(power(fact[n-r], mod-2, mod) % mod) % mod\r\n\r\n\r\ndef Solution(a, b, n, fact, mod):\r\n # Write Your Code Here\r\n res = 0\r\n for i in range(n+1):\r\n t = (ai)+((n-i)b)\r\n flag = False\r\n while t > 0:\r\n if t % 10 != a and t % 10 != b:\r\n flag = True\r\n break\r\n t = t//10\r\n if flag:\r\n continue\r\n res = (res % mod + ncr(fact, n, i, mod) % mod) % mod\r\n print(res)\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n mod = 1000000007\r\n a, b, n = get_ints_in_variables()\r\n fact = [1 for _ in range(n+1)]\r\n factorial(fact, n, mod)\r\n Solution(a, b, n, fact, mod)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "mxn = 10*6+10\r\nfact = [1] mxn\r\nmod = 10*9+7\r\nfor i in range(1,mxn):\r\n fact[i] = fact[i-1] i % mod\r\ndef nck(n,k):\r\n return fact[n] * pow(fact[k] * fact[n-k],mod-2,mod) % mod\r\ndef log(n):\r\n ans = 0\r\n while n:\r\n ans += 1\r\n n //= 10\r\n return ans\r\na,b,n = map(int,input().split())\r\nif a < b:\r\n a,b = b,a\r\nmn = b * n\r\nmx = a * n\r\nleng = [i for i in range(log(mn),log(mx)+1)]\r\nans = 0\r\ndef check(num):\r\n mx = n * a\r\n if (mx - num) % (a-b) != 0:\r\n return 0\r\n # print(mx-num,mx)\r\n l = n - (mx - num) // (a-b)\r\n r = n - l\r\n # print(num,nck(n,l)nck(n-l,r),l,r,lb,ra)\r\n return nck(n,l) nck(n-l,r)\r\nfor l in leng:\r\n for mask in range(1 << l):\r\n num = 0\r\n mul = 1\r\n for bit in range(l):\r\n if mask & (1 << bit):\r\n num += mul * a\r\n else:\r\n num += mul * b\r\n mul = 10\r\n if mn <= num and num <= mx:\r\n ans += check(num)\r\n ans %= mod\r\nprint(ans) \r\n", "import sys\r\nimport random\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(108)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import gcd\r\n#import math\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nlii = lambda : list(map(int, list(ip())))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\nmod = 109 + 7\r\nmod1 = 998244353\r\n\r\nfact = [1]\r\nfor i in range (1,106 + 5) :\r\n fact.append((fact[-1]i)%mod)\r\ninv = []\r\ninv.append(pow(fact[-1],mod-2,mod))\r\nfor i in range (10*6 + 4 , 0,-1) :\r\n inv.append((inv[-1]i)%mod)\r\ninv = inv[::-1]\r\ndef ncr(n,r) :\r\n return (fact[n] * inv[r] * inv[n-r])%mod\r\n\r\nfor _ in range (1) :\r\n a,b,n = il()\r\n ans = 0\r\n for i in range (n+1) :\r\n s = str(ai + b(n-i))\r\n\r\n if (s.count(str(a)) + s.count(str(b)) == len(s)) :\r\n ans += ncr(n,i)\r\n ans %= mod\r\n print(ans)\r\n \r\n\r\n \r\n", "a,b,n=map(int,input().split())\r\n# a=1 \r\n# b=3 \r\n# n=3\r\nf = [1](n+1)\r\nmod = 109+7\r\nfor i in range(1, n+1):\r\n f[i] = f[i-1]i%mod\r\n \r\nv = [a, b]\r\n\r\ndef OK(x):\r\n while x > 0:\r\n if x%10 not in v:\r\n return False\r\n x =x// 10\r\n return True\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n if OK(ai+(n-i)b)==True:\r\n ans = (ans+ pow(f[i]f[n-i], mod-2, mod) )%mod\r\nprint(f[n]ans%mod)", "M=109+7\r\nR=106\r\nFact=[1](R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(iFact[i-1])%M\r\nFacthyp=[1](R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]Facthyp[n-k]Facthyp[k])%M\r\na,b,n=[int(e) for e in input().split()]\r\ny=0\r\nfor i in range(n+1):\r\n x=ai+b(n-i)\r\n if 0 not in (int(e) in {a,b} for e in str(x)):\r\n y+=C(n,i)\r\nprint(y%M)", "N=1000007;m=int(1e9+7);sum=0;ans=0\r\nfact = [0 for i in range(0,1000007)]\r\ndef modularexponentiation(a:int,b:int,m:int):\r\n res = 1\r\n a = a%m\r\n \r\n while(b>0):\r\n if(b&1):res=(resa)%m\r\n a = (aa)%m\r\n b = b//2\r\n \r\n return res\r\n\r\ndef modinverse(a:int,m:int):\r\n return modularexponentiation(a,m-2,m)\r\n\r\na,b,n = [int(x) for x in input().split()]\r\n\r\nfact[0]=1\r\nfor i in range(1,N):\r\n fact[i] = (fact[i-1]i)%m\r\n\r\nfor i in range(0,n+1):\r\n sum = ai+b(n-i)\r\n while(sum>0):\r\n if(sum%10!=a and sum%10!=b):break\r\n sum=sum//10\r\n \r\n if(sum==0):\r\n ans=(ans+fact[n]modinverse((fact[i]*fact[n-i])%m,m))%m\r\n\r\nprint(ans)\r\n " ]	{"inputs": ["1 3 3", "2 3 10", "6 8 14215", "4 9 104671", "6 7 78755", "1 8 265", "3 9 37413", "1 7 49055", "3 4 11028", "2 6 32377", "3 5 80791", "4 8 11857", "1 3 10785", "4 6 11808", "1 2 11857", "2 4 88193", "1 4 37226", "2 5 53049", "3 6 1000000", "7 9 999999", "8 9 999999", "3 8 1000000", "2 8 999999", "1 6 997695", "1 5 997694", "5 9 997693", "5 8 997690", "7 8 2", "6 9 1", "8 9 111111", "8 9 1000000", "1 2 1000000"], "outputs": ["1", "165", "651581472", "329390901", "0", "461320265", "461358757", "461364774", "461668105", "887598327", "999993599", "999991923", "999952603", "999925731", "999991923", "999976846", "999970594", "259705254", "786609214", "53911803", "447886447", "0", "0", "0", "0", "0", "21735480", "0", "2", "900401372", "573697309", "786609214"]}	UNKNOWN	PYTHON3	CODEFORCES	54
d45fb32c9fa52c71f3024a033629d604	Shift It!	There is a square box 6<=×<=6 in size. It contains 36 chips 1<=×<=1 in size. Those chips contain 36 different characters — "0"-"9" and "A"-"Z". There is exactly one chip with each character. You are allowed to make the following operations: you may choose one of 6 rows or one of 6 columns and cyclically shift the chips there to one position to the left or to the right (for the row) or upwards or downwards (for the column). Those operations are allowed to perform several times. To solve the puzzle is to shift the chips using the above described operations so that they were written in the increasing order (exactly equal to the right picture). An example of solving the puzzle is shown on a picture below. Write a program that finds the sequence of operations that solves the puzzle. That sequence should not necessarily be shortest, but you should not exceed the limit of 10000 operations. It is guaranteed that the solution always exists. The input data are represented by 6 lines containing 6 characters each. They are the puzzle's initial position. Those lines contain each character from the string "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" exactly once. On the first line print number n, which is the number of operations. On the next n lines print the sequence of operations one per line. An operation is described by a word consisting of two characters. The first character shows the direction where the row or the column will be shifted. The possible directions are "L", "R" (to the left, to the right correspondingly, we shift a row), "U", "D" (upwards, downwards correspondingly, we shift a column). The second character is the number of the row (or the column), it is an integer from "1" to "6". The rows are numbered from the top to the bottom, the columns are numbered from the left to the right. The number of operations should not exceed 104. If there are several solutions, print any of them. Sample Input 01W345 729AB6 CD8FGH IJELMN OPKRST UVQXYZ Sample Output 2 R2 U3	[ "ls=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\ns,cnt,a1,a2=[],0,[],[]\nfor i in range(6):\n\ts.append(list(input()))\n\ndef add(c,i):\n\tglobal cnt\n\tcnt+=1\n\ta1.append(c)\n\ta2.append(i)\n\ndef right(i):\n\tadd('R',i+1)\n\ttmp=s[i][5]\n\tfor j in range(5,0,-1):\n\t\ts[i][j]=s[i][j-1]\n\ts[i][0]=tmp\n\ndef left(i):\n\tadd('L',i+1)\n\ttmp=s[i][0]\n\tfor j in range(5):\n\t\ts[i][j]=s[i][j+1]\n\ts[i][5]=tmp\n\ndef up(j):\n\tadd('U',j+1)\n\ttmp=s[0][j]\n\tfor i in range(5):\n\t\ts[i][j]=s[i+1][j]\n\ts[5][j]=tmp\n\ndef down(j):\n\tadd('D',j+1)\n\ttmp=s[5][j]\n\tfor i in range(5,0,-1):\n\t\ts[i][j]=s[i-1][j]\n\ts[0][j]=tmp\n\ndef chg(i1,j1,i2,j2):\n\tif i1==i2:\n\t\tright(i1);up(j1);right(i1);down(j1)\n\t\tright(i1);up(j1);right(i1);down(j1)\n\t\tright(i1);up(j1);right(i1);right(i1);down(j1)\n\telse:\n\t\tdown(j1);left(i1);down(j1);right(i1)\n\t\tdown(j1);left(i1);down(j1);right(i1)\n\t\tdown(j1);left(i1);down(j1);down(j1);right(i1)\n\nfor i in range(6):\n\tfor j in range(6):\n\t\ttoch=ls[i*6+j]\n\t\tfor ni in range(6):\n\t\t\tfor nj in range(6):\n\t\t\t\tif s[ni][nj]==toch:\n\t\t\t\t\tii,jj=ni,nj\n\t\t\t\t\twhile jj>j:\n\t\t\t\t\t\tchg(ii,jj-1,ii,jj)\n\t\t\t\t\t\tjj-=1\n\t\t\t\t\twhile jj<j:\n\t\t\t\t\t\tchg(ii,jj,ii,jj+1)\n\t\t\t\t\t\tjj+=1\n\t\t\t\t\twhile ii>i:\n\t\t\t\t\t\tchg(ii-1,jj,ii,jj)\n\t\t\t\t\t\tii-=1\nprint(cnt)\nfor i in range(cnt):\n\tprint(a1[i]+str(a2[i]))" ]	{"inputs": ["01W345\n729AB6\nCD8FGH\nIJELMN\nOPKRST\nUVQXYZ", "012345\n6789AB\nCDEFGH\nIJKLMN\nOPQRST\nUVWXYZ", "102345\n6789AB\nCDEFGH\nIJKLMN\nOPQRST\nUVWXYZ", "234501\n789AB6\nGHCDEF\nIJKLMN\nRSTOPQ\nZUVWXY", "2X4501\n6783AB\nDE9GHC\nIJKFMN\nOPQLST\nZUVWRY", "0123A5\n67894B\nCDEFGH\nIKJLMN\nOPQRST\nUVWXZY", "ZYXWVU\nTSRQPO\nNMLKJI\nHGFEDC\nBA9876\n543210", "06CIOU\n17DJPV\n28EKQW\n39FLRX\n4AGMSY\n5BHNTZ", "RSTYWU\nLMNXQO\nFGHVKI\n9ABPEC\n345J86\nZD7210", "THEFIV\n3BOX1N\nGW2ZAR\nDSJUMP\nQ04CKL\nY56789", "VRLJQP\nT74WZI\nDMAHO3\n56N0G2\nUCSBK9\nXEF81Y", "C2OYNI\nUGLRHF\nDB71XV\nE3S4WM\n60A9Q5\nJKTP8Z", "PW9Z6H\n2TYJK4\nMO7SLR\nEQBDUF\nN1G0A5\n38VICX", "3YHMUB\nNDA1S5\nP87XI2\nVC6JTO\nRG09ZL\nKQFWE4", "4X1VB8\nYD0OIM\n5EANT2\nUG7CPH\n9SJWLR\nK6ZFQ3", "NTMUDA\nQW6GKY\n428B17\n0OVZ95\nRICLHJ\nFSP3EX", "3IDLYQ\n1X0ZMG\nC45SUP\nBAJW26\nFNOK98\nTR7HVE", "WUNP5G\n1CFY38\nL6ZO4I\nKJQV2H\nRADX97\nT0MBSE", "5OZ4R2\nVBM6N7\nWDXP3T\nE0QFGK\nJSL1H9\nA8IUCY", "IPWND8\nOK1QBZ\n5FG69R\nYCH2M4\n30TVJX\nSLUA7E", "DYI8NC\nJ15LQG\nPF2EMH\n493KRZ\nTBVAWS\nU7XO06", "EL685I\nY3DMJ7\nNF41ZA\n2WOBTQ\n0VKXCP\nSUHG9R", "H6EMA2\n7PB85W\nGLJOC3\nSDUR9Y\nQIKNZ1\nTX0FV4", "98WBZN\n61GQO3\nSIFUPT\nKMJ5VL\nH2XRDY\n07CA4E", "KP3HOS\nE7C5BY\nUMGDI4\nFLRV1T\n6JW9NX\n280ZQA", "K5871J\nMUEZGC\nPHN4AY\nIWVT2Q\nXRFS36\n9DBO0L", "7ZIRA4\nH32WE5\n89DGM0\nCV6BNP\nQF1XSO\nLTJKYU", "84W1IC\nN0PQM3\nGJZOYT\nV95SXK\nRBAUHE\nFD62L7", "89RM1A\nLIOK0Q\n73ET6V\nH5C4YF\nUXZ2NS\nGPDJBW", "LMD0PA\nWT6EV1\nF9ZRUY\nBJ348S\nKHXONI\n7C25GQ", "VRFM60\nNTBC7L\nYGPJS8\nIDWZHE\nXO1AQ5\n93K2U4", "LWQ4MB\nYFCUAO\n56IRT1\nS2DNXJ\nPEK0Z7\n39HVG8", "HY2UQM\nGKPI0S\nVW39T4\nE8X5CA\n6O1DLJ\n7NFBRZ", "LDVNCS\nZOB538\nK19R67\nX2JPEA\nTHWG40\nUYMFIQ", "6R9DOW\n50QB3L\n4ZMKXH\nNG1A2V\nETYU87\nSFPIJC", "G2OTZ3\n5AINBQ\nJVXPHC\n7WKY8U\nLM0DER\n914FS6", "G1DVK5\nE72J3Z\nBLHAYU\n98X6SM\nQPO4CF\nRWTIN0", "A3LREJ\n8N2PG9\nW0US4M\nZ61DBO\nKVQ5IC\n7FTHYX", "4QG261\n9A0SUI\nTLHVXR\n8MP5N7\nWZJFYK\nBD3ECO", "UO5QLC\n4P083W\nFR1YJH\nZNMBA2\nKV6EDG\n79ISXT", "91O8D7\nVRS2AC\nWL6EXF\nIZ0JHY\n4NUKT3\nMQBPG5", "ELSOIZ\nNY5T37\n9HW4XG\n0V6JM8\nUQBPRD\n1FKA2C", "VQ5NS3\n20MX9P\nT8Y4WE\nJAUGI1\n6RZCOF\nKHBL7D", "MN0RQO\nKJE1X7\nIVAUWD\n3LHFYT\nG9S2ZP\n48B56C", "16GOTL\nYPBM3X\nDZ5EIC\nW7SAN0\nJ2V984\nKRFUQH", "JMIBO3\n5V6Q84\nXY1ZCK\nPHWRS7\nDE9G2L\n0UNAFT", "Z6PKUX\nIHJDMG\nQ1CRSN\n7VWYE8\n2LT30B\n9FAO45", "VDMF5J\nX3KSR8\n0PHQ67\n4CGIZE\n9ANLYO\n2UBT1W", "AH4SNR\nDX5B7C\nYVI2KT\nQ3LE1Z\nWGFU0M\n6J8O9P", "CJ9078\nSKVLGX\nO4YWM5\nI23ZDH\nB6PFTA\nNQERU1", "LMNIJK\nRSTOPQ\nXYZUVW\n345012\n9AB678\nFGHCDE", "345LMN\n9ABRST\nFGHXYZ\n012IJK\n678OPQ\nCDEUVW", "IJK012\nOPQ678\nUVWCDE\nLMN345\nRST9AB\nXYZFGH", "EDCHGF\n876BA9\n210543\nWVUZYX\nQPOTSR\nKJINML", "17825B\n06934A\nICFKMG\nJDELNH\nPVWQTZ\nOUXRSY", "987654\n3210ZY\nXWVUTS\nRQPONM\nLKJIHG\nFEDCBA", "ABCDEF\nGHIJKL\nMNOPQR\nSTUVWX\nYZ0123\n456789", "EFYZOP\nLKSTUV\nQR10CD\nXW76IJ\nBA32MN\n5498GH", "56789A\n4NOPQB\n3MXYRC\n2LWZSD\n1KVUTE\n0JIHGF", "KLMNOP\nJ6789Q\nI501AR\nH432BS\nGFEDCT\nZYXWVU"], "outputs": ["260\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nR2\nU4\nR2\nD4\nR2\nU4\nR2\nD4\nR2\nU4...", "0", "13\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1", "455\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2...", "403\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3...", "39\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5", "2340\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1625\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU4\nR3\nD4\nR3\nU4\nR3\nD4\nR3\nU...", "2925\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1586\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1599\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU...", "1482\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL...", "1404\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1469\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL...", "1443\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL...", "1534\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1534\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL...", "1469\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL...", "1287\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1430\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1352\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1404\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL...", "1235\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1430\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1365\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL...", "1443\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL...", "1196\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1586\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1469\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU...", "1521\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU...", "1586\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1625\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL...", "1482\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1404\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1586\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1599\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1300\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1469\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL...", "1703\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL...", "1417\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU...", "1560\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nR4\nU4\nR4\nD4\nR4\nU4\nR4\nD4\nR4\nU...", "1651\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL...", "1547\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL...", "1820\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1391\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1300\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1443\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1560\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1638\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL...", "1417\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1404\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1521\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL...", "1365\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nR3\nU4\nR3\nD4\nR3\nU4\nR3\nD4\nR3\nU...", "936\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3...", "364\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nR1\nU6\nR1\nD6\nR1\nU6\nR1\nD6\nR1\nU6\nR1\nD6\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3...", "1170\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU...", "1508\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "2028\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1287\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1482\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU..."]}	UNKNOWN	PYTHON3	CODEFORCES	1
d4606777a789a26895f0e249ec9f7499	Kyoya and Permutation	Let's define the permutation of length n as an array p<==<=[p1,<=p2,<=...,<=pn] consisting of n distinct integers from range from 1 to n. We say that this permutation maps value 1 into the value p1, value 2 into the value p2 and so on. Kyota Ootori has just learned about cyclic representation of a permutation. A cycle is a sequence of numbers such that each element of this sequence is being mapped into the next element of this sequence (and the last element of the cycle is being mapped into the first element of the cycle). The cyclic representation is a representation of p as a collection of cycles forming p. For example, permutation p<==<=[4,<=1,<=6,<=2,<=5,<=3] has a cyclic representation that looks like (142)(36)(5) because 1 is replaced by 4, 4 is replaced by 2, 2 is replaced by 1, 3 and 6 are swapped, and 5 remains in place. Permutation may have several cyclic representations, so Kyoya defines the standard cyclic representation of a permutation as follows. First, reorder the elements within each cycle so the largest element is first. Then, reorder all of the cycles so they are sorted by their first element. For our example above, the standard cyclic representation of [4,<=1,<=6,<=2,<=5,<=3] is (421)(5)(63). Now, Kyoya notices that if we drop the parenthesis in the standard cyclic representation, we get another permutation! For instance, [4,<=1,<=6,<=2,<=5,<=3] will become [4,<=2,<=1,<=5,<=6,<=3]. Kyoya notices that some permutations don't change after applying operation described above at all. He wrote all permutations of length n that do not change in a list in lexicographic order. Unfortunately, his friend Tamaki Suoh lost this list. Kyoya wishes to reproduce the list and he needs your help. Given the integers n and k, print the permutation that was k-th on Kyoya's list. The first line will contain two integers n, k (1<=≤<=n<=≤<=50, 1<=≤<=k<=≤<=min{1018,<=l} where l is the length of the Kyoya's list). Print n space-separated integers, representing the permutation that is the answer for the question. Sample Input 4 3 10 1 Sample Output 1 3 2 4 1 2 3 4 5 6 7 8 9 10	[ "#!/usr/bin/python3\n\narr = [1] * 51\n\nfor i in range(2, 51):\n arr[i] = arr[i - 1] + arr[i - 2]\n\nans = []\n\n\ndef generate(i, n, to):\n if i == n:\n assert to == 1\n print(\" \".join(map(str, ans)))\n return\n if i + 1 == n:\n ans.append(n)\n generate(i + 1, n, to)\n return\n if arr[n - i - 1] < to:\n ans.append(i + 2)\n ans.append(i + 1)\n generate(i + 2, n, to - arr[n - i - 1])\n else:\n ans.append(i + 1)\n generate(i + 1, n, to)\n\n \nn, k = map(int, input().split())\ngenerate(0, n, k)\n", "#! /usr/bin/env python3\n\ndef phib_gen(n):\n p = [1, 1]\n for i in range(2, n):\n p.append(p[-1] + p[-2])\n return tuple(p)\n\nn, k = tuple(map(int, input().split()))\n\nphib = phib_gen(n + 1)\n\ndef gen_sequence(n, k):\n while n > 0:\n if k >= phib[n - 1]:\n k -= phib[n - 1]\n n -= 2\n yield 2\n else:\n n -= 1\n yield 1\n\ndef gen_perm(n, k):\n elem = 1\n for i in gen_sequence(n, k):\n if i == 2:\n yield elem + 1\n yield elem\n elem += 2\n else:\n yield elem\n elem += 1\n\nprint(' '.join(map(str, gen_perm(n, k - 1))))\n", "G=range;n,k=map(int,input().split())\r\nfib=[1,1]+[0](n-1)\r\nfor i in G(2,n+1):fib[i]=fib[i-1]+fib[i-2]\r\ni=0;z=[0]n\r\nwhile i<n:\r\n v=fib[n-i-1]\r\n if k<=v:z[i]=i+1;i+=1\r\n else:k-=v;z[i:i+2]=[i+2,i+1];i+=2\r\nprint(z)", "f, res = [1, 1], []\r\nfor i in range(50):\r\n f.append(f[-1] + f[-2])\r\nn, k = map(int, input().split())\r\nnow, j = n - 1, 0\r\nfor i in range(n):\r\n res.append(i + 1)\r\nwhile k > 1:\r\n if k > f[now]:\r\n res[j], res[j + 1] = res[j + 1], res[j]\r\n k -= f[now]\r\n now -=1\r\n j += 1\r\nfor i in res:\r\n print(i, end = ' ')", "def getFibCode(x):\r\n result = []\r\n f =[1, 1]\r\n while f[-2] + f[-1] <= x:\r\n f.append(f[-2] + f[-1])\r\n for i in f[:0:-1]:\r\n if i <= x:\r\n result.append(1)\r\n x -= i\r\n else:\r\n result.append(0)\r\n return result\r\n\r\nn, k = tuple(map(int, input().split()))\r\nscheme = getFibCode(k - 1)\r\nanswer = list(range(1, n + 1))\r\nj = n - 1\r\nfor i in scheme[::-1]:\r\n if i == 1:\r\n answer[j - 1], answer[j] = answer[j], answer[j - 1]\r\n j -= 1\r\n else:\r\n j -= 1\r\n\r\nprint(' '.join(map(str, answer)))\r\n", "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (19) Kyoya and Permutation (Difficulty: 4) (http://codeforces.com/problemset/problem/553/B)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn, k = rints()\npos = [0] (n + 1)\npos[0] = 1\npos[1] = 1\nfor i in range(2, n + 1):\n pos[i] = pos[i - 1] + pos[i - 2]\nperm = list(range(1, n + 1))\ni = 0\nwhile i < n - 1:\n if pos[n - i - 1] < k:\n perm[i] += 1\n perm[i + 1] -= 1\n k -= pos[n - i - 1]\n i += 2\n else:\n i += 1\nprint(' '.join(map(str, perm)))\n", "from bisect import bisect_left\r\n\r\nn, k = map(int, input().split())\r\nl = [1, 1, 2]\r\nfor i in range(90):\r\n l.append(l[-1] + l[-2])\r\n\r\nps = []\r\nleft = k\r\nwhile left > 0:\r\n nu = bisect_left(l, left)\r\n if nu-1 >= 1:\r\n left = left - l[nu-1]\r\n ps.append(n-nu)\r\n else:\r\n left = 0\r\n \r\nto_ret = list(map(str, (range(1, n+1))))\r\nfor i in ps:\r\n to_ret[i], to_ret[i+1] = to_ret[i+1], to_ret[i]\r\nprint(' '.join(to_ret))\r\n\r\n", "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\nfrom functools import lru_cache\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\nimport typing\n\n@lru_cache(maxsize=1000000)\ndef fib(n : int) -> int:\n if n == 0 or n == 1: return 1\n return fib(n - 1) + fib(n - 2)\n\ndef slv(lst : typing.List[int],k :int) -> typing.List[int]:\n n = len(lst)\n assert(n > 0 and 1 <= k <= fib(n))\n if n == 1:return lst\n if n == 2:\n if k == 1:return lst \n return [lst[1],lst[0]]\n # n >= 3\n if k <= fib(n - 1):\n return [lst[0]] + slv(lst[1:],k)\n return [lst[1],lst[0]] + slv(lst[2:],k - fib(n - 1))\n\n \ndef main():\n n,k = map(int,input().split())\n perm = [i + 1 for i in range(n)] \n ans = slv(perm,k)\n print(ans)\n return 0\n\n\nif __name__ == \"__main__\":\n main()", "def F(n):\r\n a,b = 1,0\r\n for i in range(n):\r\n a,b = b,a+b\r\n return b\r\n\r\ndef ans(n,k):\r\n if n == 0:\r\n return []\r\n elif n == 1:\r\n return [1]\r\n elif k > F(n):\r\n return [2,1] + [i+2 for i in ans(n-2,k-F(n))]\r\n else:\r\n return [1] + [i+1 for i in ans(n-1,k)]\r\n\r\nn,k = map(int,input().split())\r\nprint(' '.join([str(i) for i in ans(n,k)]))\r\n", "l = [1, 2]\r\nfor i in range(1, 100):\r\n l.append(l[i]+l[i-1])\r\n if l[-1]>1018:\r\n break\r\n\r\nl = [0, 0] + l\r\ndef perm(n, k):\r\n if n == 1 and k == 1:\r\n return [1]\r\n if n == 2 and k == 1:\r\n return [1, 2]\r\n if n == 2 and k == 2:\r\n return [2, 1]\r\n if k <= l[n]:\r\n return [1] + [i+1 for i in perm(n-1, k)]\r\n\r\n return [2, 1] + [i+2 for i in perm(n-2, k - l[n])]\r\n\r\nn, k = map(int, input().split(' '))\r\nprint(' '.join([str(x) for x in perm(n, k)]))\r\n\r\n", "__author__ = 'taras-sereda'\n\n\nn,k = map(int,input().split())\n\nfib = [0](n+1)\nfib[0], fib[1] = 1, 1\nfor i in range(2,n):\n fib[i] = fib[i-1] + fib[i-2]\n\nidx = 0\nres = [None]n\nwhile (idx<n):\n if (k <= fib[n-idx-1]):\n res[idx] = idx + 1\n idx += 1\n else:\n k -= fib[n-idx-1]\n res[idx] = idx + 2\n res[idx+1] = idx + 1\n idx += 2\n\nprint(\" \".join(map(str,res)))\n", "from typing import List\n\ndef find_kth_permutation(n:int, k:int)->List[int]:\n fib = [0] (n+1)\n fib[0] = fib[1] = 1\n for i in range(2, n+1):\n fib[i] = fib[i-1] + fib[i-2]\n \n idx = 0\n res = [0] * n\n while idx < n:\n if k <= fib[n-idx-1]:\n res[idx] = idx + 1\n idx += 1\n else:\n k -= fib[n-idx-1]\n res[idx] = idx + 2\n res[idx+1] = idx + 1\n idx += 2\n return res \nn, k = map(int, input().split())\nr = find_kth_permutation(n, k)\nprint(r)\n", "import math\r\nimport sys\r\n\r\ndef fib(x):\r\n if x<1:\r\n return 0\r\n if x==1:\r\n return 1\r\n if x==2:\r\n return 2\r\n a=1\r\n b=2\r\n for i in range(0,x):\r\n c=a\r\n a=b\r\n b=c+b\r\n return b-a\r\n \r\n \r\n\r\n\r\ninp=list(map(int,input().split()))\r\n\r\nn=inp[0]\r\nk=inp[1]\r\nk2=k\r\nn2=n\r\nans=[]\r\nc=0\r\nwhile n2>0:\r\n\r\n f1=fib(n2-1)\r\n f2=fib(n2-2)\r\n\r\n if n2==1:\r\n ans.append(1+c)\r\n break\r\n \r\n if k2<=f1:\r\n ans.append(1+c)\r\n n2-=1\r\n c+=1\r\n else:\r\n ans.append(2+c)\r\n ans.append(1+c)\r\n c+=2\r\n n2-=2\r\n k2=k2-f1\r\n \r\n\r\n\r\nif n==1:\r\n ans=[1]\r\nif n==2 and k==1:\r\n ans=[1,2]\r\nif n==2 and k==2:\r\n ans=[2,1]\r\n\r\n\r\n\r\nfor i in range(0,n-1):\r\n print(str(ans[i]),end=\" \")\r\nprint(str(ans[n-1]))\r\n \r\n", "n, k = map(int, input().split())\nf = [1, 1]\nfor i in range(2, n):\n f.append(f[i-2] + f[i-1])\ni = n\nwhile i > 0:\n i -= 1\n if k > f[i]:\n print(n - i + 1, n - i, end = ' ')\n k -= f[i]\n i -= 1\n else:\n print(n - i, end = ' ')\n", "n, k = map(int, input().split())\r\na = [0 for i in range(n+1)]\r\na[0], a[1] = 1, 1\r\nfor i in range(2, n+1):\r\n a[i] = a[i-1] + a[i-2]\r\np = [i+1 for i in range(n)]\r\ni = 0\r\nwhile i < n:\r\n if k > a[n-1-i]:\r\n p[i], p[i+1] = p[i+1], p[i]\r\n k -= a[n-1-i]\r\n i += 2\r\n else: i += 1\r\np = [str(i) for i in p]\r\nprint(' '.join(p))\r\n\r\n ", "\"\"\"\r\n#If FastIO not needed, used this and don't forget to strip\r\n#import sys, math\r\n#input = sys.stdin.readline\r\n\"\"\"\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left, bisect_right\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n self.os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nfrom collections import defaultdict as dd, deque as dq\r\nimport math, string\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 109+7\r\n\r\n\"\"\"\r\n-I'm pretty confident that the internal ordering is only preserved in pairs\r\n-The cyclic pairs must be adjacent and of the form (i, i+1)\r\n-The pairs must already occupy the correct blocks\r\n\r\n[2,1] 3 [5,4] 6... etc\r\n\r\nSo the questions are: how many permutations begin with 1, and how many begin with 2?\r\nNumber beginning with 1 = dp[N-1][1] + dp[N-1][2]\r\nNumber beginning with 2 = dp[N-2][1] + dp[N-2][2]\r\n\r\n1 2 3 4 5 6\r\n1 2 3 4 (6 5)\r\n1 2 3 (5 4) 6\r\n1 2 (4 3) 5 6\r\n1 2 (4 3) (6 5)\r\n1 (3 2) 4 5 6\r\n1 (3 2) 4 (6 5)\r\n1 (3 2) (5 4) 6\r\n(2 1) 3 4 5 6\r\n(2 1) 3 4 (6 5)\r\n(2 1) 3 (5 4) 6\r\n(2 1) (4 3) 5 6\r\n(2 1) (4 3) (6 5)\r\n\r\n\"\"\"\r\n\r\n\r\ndef solve():\r\n N, K = getInts()\r\n if N == 1:\r\n print(1)\r\n return\r\n dp = [[0 for j in range(2)] for i in range(N+1)]\r\n dp[1][0] = 1\r\n dp[2][0] = 1\r\n dp[2][1] = 1\r\n for j in range(3,N+1):\r\n dp[j][0] = dp[j-1][0] + dp[j-1][1]\r\n dp[j][1] = dp[j-2][0] + dp[j-2][1]\r\n #there are sum(dp[N]) sequences, and we need to know whether K <= dp[N][0] or not\r\n ans = []\r\n to_fill = N\r\n curr = 1\r\n while len(ans) < N:\r\n if K <= dp[to_fill][0]:\r\n ans.append(curr)\r\n to_fill -= 1\r\n curr += 1\r\n else:\r\n K -= dp[to_fill][0]\r\n ans.append(curr+1)\r\n ans.append(curr)\r\n to_fill -= 2\r\n curr += 2\r\n print(ans)\r\n return\r\n \r\n#for _ in range(getInt()):\r\nsolve()", "import math\r\n\r\n\r\ndef get_ans(n, k):\r\n a = []\r\n global fib\r\n if (n == 0):\r\n return a\r\n\r\n if (n == 1):\r\n a.append(1)\r\n return a\r\n\r\n if (k < fib[n - 1]):\r\n a.append(1)\r\n l = get_ans(n - 1, k)\r\n a.extend(l)\r\n return a\r\n else:\r\n a.append(2)\r\n a.append(1)\r\n l = get_ans(n - 2, k - fib[n - 1])\r\n a.extend(l)\r\n return a\r\n\r\n\r\nn, k = list(map(int, input().rstrip().split()))\r\nfib = [1, 1]\r\nfor i in range(2, n + 1):\r\n fib.append(fib[i - 1] + fib[i - 2])\r\n\r\na = get_ans(n, k - 1)\r\n\r\ni = 0\r\ncsum = 0\r\nwhile (i < n):\r\n c = a[i]\r\n for j in range(c):\r\n a[i] += csum\r\n i += 1\r\n csum += c\r\n\r\nfor i in range(n):\r\n print(a[i], ' ', sep = '', end = '')\r\nprint()", "n, k = list(map(int, input().split()))\r\n#n = int(input())\r\n#k = int(input())\r\nfib = [0] * (n + 1)\r\nfib[0] = 1\r\nfib[1] = 1\r\nres = [0] * n\r\nfor i in range(2, n):\r\n fib[i] = fib[i - 1] + fib[i - 2]\r\nidx = 0\r\nwhile idx < n:\r\n if k <= fib[n - idx - 1]:\r\n res[idx] = idx + 1\r\n idx += 1\r\n else:\r\n k -= fib[n - idx - 1]\r\n res[idx] = idx + 2\r\n res[idx + 1] = idx + 1\r\n idx += 2\r\nprint(res)", "fib=[0,1,1]\r\nfor i in range(3,51):\r\n fib.append(fib[-1]+fib[-2])\r\nfor i in range(1,51):\r\n fib[i]+=fib[i-1]\r\nn,m=map(int,input().split())\r\nans=[0]n\r\nleft=m\r\nlast=0\r\nfor i in range(n):\r\n if ans[i]!=0:\r\n continue\r\n for j in range(i+1,n+1):\r\n size=n-j\r\n if size==1:\r\n perms=1\r\n else:\r\n perms = fib[size - 1] + 1\r\n if perms>=left:\r\n ans[i]=j\r\n break\r\n else:\r\n left-=perms\r\n nlast=ans[i]\r\n t=i+1\r\n while(t<n and ans[t-1]!=last+1):\r\n ans[t]=ans[t-1]-1\r\n t+=1\r\n last=nlast\r\nprint(ans)", "def kyoya(n, k):\n F = [None] (n + 1)\n F[0] = F[1] = 1\n for i in range(2, len(F)):\n F[i] = F[i-1] + F[i-2]\n\n l = []\n i = n\n j = k\n while i > 1:\n if j > F[i-1]:\n j -= F[i-1]\n l.append(1)\n else:\n l.append(0)\n i -= 1\n # log(l)\n\n P = list(range(1, n+1))\n for i, b in enumerate(l):\n if b:\n P[i], P[i+1] = P[i+1], P[i]\n return P\n\n\ndef main():\n n, k = readinti()\n print(' '.join(map(str, kyoya(n, k))))\n\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(args, kwargs):\n print(args, *kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4 3\n\"\"\", \"\"\"\\\n1 3 2 4\n\"\"\"), (\"\"\"\\\n10 1\n\"\"\", \"\"\"\\\n1 2 3 4 5 6 7 8 9 10\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n \n", "n, m = [int(x) for x in input().split()]\nF = [1,1]\nfor i in range(2, n): F.append(F[-1] + F[-2])\nperm = [i+1 for i in range(n)]\nfor i in range(n):\n if m > F[n-1 - i]:\n m -= F[n-1 -i]\n perm[i], perm[i+1] = perm[i+1], perm[i]\nfor k in perm: print(k, end = ' ')\n" ]	{"inputs": ["4 3", "10 1", "1 1", "50 1", "10 57", "50 20365011074", "20 9999", "49 12586269025", "49 1", "10 89", "10 1", "5 8", "5 1", "25 121393", "25 1", "1 1", "2 2", "3 3", "4 2", "5 8", "6 10", "7 20", "8 24", "9 1", "10 24", "11 77", "12 101", "13 240", "14 356", "15 463", "16 747", "17 734", "18 1809", "19 859", "20 491", "21 14921", "22 731", "23 45599", "24 47430", "25 58467", "26 168988", "27 298209", "28 77078", "29 668648", "30 582773", "31 1899100", "32 1314567", "33 1811927", "34 2412850", "35 706065", "36 7074882", "37 27668397", "38 23790805", "39 68773650", "40 43782404", "41 130268954", "42 40985206", "43 193787781", "44 863791309", "45 1817653076", "46 1176411936", "47 4199125763", "48 4534695914", "49 3790978105", "50 5608642004"], "outputs": ["1 3 2 4", "1 2 3 4 5 6 7 8 9 10", "1", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50", "2 1 3 4 5 6 7 8 10 9", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49", "2 1 4 3 5 7 6 8 9 10 11 13 12 14 15 17 16 18 19 20", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 49", "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", "2 1 4 3 6 5 8 7 10 9", "1 2 3 4 5 6 7 8 9 10", "2 1 4 3 5", "1 2 3 4 5", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 25", "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", "1", "2 1", "2 1 3", "1 2 4 3", "2 1 4 3 5", "2 1 3 4 6 5", "2 1 4 3 5 7 6", "2 1 3 4 5 7 6 8", "1 2 3 4 5 6 7 8 9", "1 2 4 3 5 6 7 9 8 10", "1 3 2 5 4 6 7 8 9 10 11", "1 3 2 4 5 6 8 7 10 9 11 12", "2 1 3 4 5 6 7 8 10 9 11 13 12", "1 3 2 5 4 6 8 7 10 9 12 11 14 13", "1 3 2 4 5 7 6 9 8 11 10 12 13 15 14", "1 3 2 4 5 7 6 9 8 11 10 12 13 14 15 16", "1 2 4 3 5 6 8 7 10 9 11 12 13 14 15 16 17", "1 3 2 4 5 6 8 7 10 9 11 12 14 13 16 15 18 17", "1 2 3 4 6 5 8 7 9 10 11 12 14 13 15 16 18 17 19", "1 2 3 4 5 6 8 7 9 11 10 12 14 13 15 16 18 17 19 20", "2 1 3 5 4 7 6 9 8 10 11 12 13 15 14 16 18 17 19 20 21", "1 2 3 4 5 6 7 9 8 10 11 13 12 14 16 15 18 17 19 21 20 22", "2 1 4 3 6 5 8 7 9 10 11 13 12 15 14 16 18 17 20 19 21 22 23", "2 1 3 4 5 6 7 8 10 9 11 12 13 14 16 15 17 19 18 21 20 22 24 23", "1 3 2 4 6 5 7 8 9 11 10 12 13 15 14 16 17 19 18 20 21 22 23 24 25", "2 1 4 3 5 6 7 8 9 10 12 11 13 15 14 16 17 18 19 20 21 23 22 24 26 25", "2 1 4 3 5 7 6 9 8 10 12 11 14 13 15 16 17 19 18 21 20 22 24 23 25 27 26", "1 2 3 5 4 6 7 8 9 10 11 13 12 14 16 15 17 18 20 19 22 21 23 24 25 27 26 28", "2 1 3 5 4 6 8 7 9 10 12 11 13 14 15 16 17 19 18 20 22 21 23 25 24 26 27 29 28", "1 3 2 4 5 6 8 7 10 9 11 13 12 14 15 16 17 19 18 20 21 23 22 25 24 26 28 27 29 30", "2 1 4 3 5 6 7 8 10 9 11 13 12 15 14 16 17 19 18 21 20 23 22 24 26 25 28 27 29 31 30", "1 2 4 3 6 5 8 7 9 11 10 13 12 14 16 15 18 17 19 20 22 21 23 24 25 26 27 28 30 29 32 31", "1 2 4 3 5 7 6 9 8 10 11 13 12 15 14 16 18 17 19 21 20 22 23 24 25 26 27 28 29 31 30 32 33", "1 2 4 3 5 6 7 9 8 10 11 13 12 14 16 15 18 17 19 20 21 22 23 25 24 26 28 27 29 31 30 32 34 33", "1 2 3 4 5 6 8 7 9 11 10 13 12 15 14 16 18 17 20 19 21 23 22 25 24 27 26 28 29 31 30 32 33 35 34", "1 2 4 3 5 7 6 8 9 10 11 12 13 14 16 15 18 17 19 20 22 21 23 25 24 26 27 28 30 29 32 31 33 34 35 36", "2 1 3 4 5 7 6 9 8 11 10 13 12 15 14 16 18 17 19 21 20 23 22 24 25 26 28 27 30 29 32 31 34 33 35 36 37", "1 2 4 3 6 5 8 7 10 9 11 12 14 13 15 16 18 17 20 19 21 22 24 23 25 27 26 29 28 31 30 32 33 34 36 35 38 37", "2 1 3 4 5 6 8 7 10 9 12 11 13 15 14 16 17 19 18 20 21 23 22 24 26 25 28 27 29 31 30 32 33 34 35 36 37 39 38", "1 2 4 3 5 6 7 9 8 10 12 11 14 13 15 16 17 18 20 19 21 22 23 25 24 26 28 27 29 31 30 32 34 33 36 35 37 39 38 40", "1 3 2 4 6 5 7 8 10 9 11 12 13 14 16 15 17 19 18 20 21 23 22 25 24 26 27 28 30 29 31 32 34 33 35 36 37 38 39 41 40", "1 2 3 4 6 5 7 8 9 10 11 13 12 15 14 16 17 18 19 21 20 22 24 23 25 26 28 27 29 30 31 33 32 35 34 36 37 39 38 40 42 41", "1 2 4 3 5 6 8 7 9 10 12 11 13 14 16 15 17 18 19 20 21 22 24 23 25 26 27 28 29 30 31 32 33 35 34 36 38 37 39 40 41 43 42", "2 1 3 4 6 5 8 7 10 9 12 11 13 14 15 16 18 17 19 20 21 22 23 24 26 25 27 29 28 31 30 32 34 33 36 35 38 37 40 39 41 42 44 43", "2 1 4 3 6 5 8 7 9 11 10 12 14 13 16 15 18 17 19 20 22 21 24 23 25 27 26 29 28 30 32 31 34 33 35 36 38 37 39 40 42 41 43 44 45", "1 3 2 4 5 6 7 8 10 9 11 12 13 14 16 15 17 18 19 21 20 22 23 25 24 27 26 29 28 31 30 32 34 33 35 37 36 38 40 39 41 42 43 44 46 45", "2 1 4 3 5 6 7 8 10 9 12 11 13 14 16 15 18 17 20 19 22 21 23 24 25 27 26 28 30 29 31 32 33 34 36 35 38 37 39 40 41 43 42 44 45 46 47", "1 3 2 5 4 6 8 7 10 9 12 11 14 13 15 17 16 18 19 21 20 23 22 25 24 26 27 28 29 30 31 32 33 34 36 35 37 38 40 39 41 43 42 44 46 45 47 48", "1 2 4 3 5 7 6 8 9 11 10 12 13 15 14 16 17 18 19 21 20 22 24 23 25 27 26 28 30 29 31 33 32 35 34 37 36 38 39 41 40 42 44 43 45 47 46 48 49", "1 2 4 3 5 6 8 7 9 10 11 13 12 15 14 17 16 18 20 19 22 21 23 24 25 26 28 27 30 29 31 32 33 34 35 36 38 37 40 39 42 41 44 43 45 46 47 48 50 49"]}	UNKNOWN	PYTHON3	CODEFORCES	21
d462df4068f05173ec26a6fb99d24783	Right Triangles	You are given a n<=×<=m field consisting only of periods ('.') and asterisks (''). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of ''-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle). The first line contains two positive integer numbers n and m (1<=≤<=n,<=m<=≤<=1000). The following n lines consist of m characters each, describing the field. Only '.' and '' are allowed. Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d). Sample Input 2 2 * . 3 4 ..* .*. .** Sample Output 1 9	[ "n,m=map(int,input().split())\r\nc,r=[0]n,[0]m\r\nvals=[]\r\nfor i in range(n):\r\n s=input()\r\n vals.append(s)\r\n for j in range(m):\r\n if(s[j]==''):\r\n c[i]+=1\r\n r[j]+=1\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(vals[i][j]==''):\r\n ans+=(c[i]-1)(r[j]-1)\r\nprint(ans)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m = map(int, input().split())\r\na = ([[0] (m + 2)]\r\n + [[0] + list(1 if c == '' else 0 for c in input().rstrip()) + [0] for _ in range(n)]\r\n + [[0] (m + 2)])\r\n\r\nlr = [[0] * (m + 2) for _ in range(n + 2)]\r\nud = [[0] * (m + 2) for _ in range(n + 2)]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 2):\r\n lr[i][j] = lr[i][j - 1] + a[i][j]\r\n\r\nfor j in range(1, m + 1):\r\n for i in range(1, n + 2):\r\n ud[i][j] = ud[i - 1][j] + a[i][j]\r\n\r\nans = 0\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if a[i][j]:\r\n l, r, u, d = lr[i][j - 1], lr[i][-1] - lr[i][j], ud[i - 1][j], ud[-1][j] - ud[i][j]\r\n ans += u * r + r * d + d * l + l * u\r\n\r\nprint(ans)\r\n", "n,m=list(int(i) for i in input().split())\r\nA=[[0 for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n x=input()\r\n for j in range(m):\r\n A[i][j]=x[j]\r\nrow=[0 for i in range(n)]\r\ncolumn=[0 for i in range(m)]\r\nfor i in range(n):\r\n sum=0\r\n for j in range(m):\r\n if A[i][j]==\"\":\r\n sum+=1\r\n row[i]=sum\r\nfor i in range(m):\r\n sum=0\r\n for j in range(n):\r\n if A[j][i]==\"\":\r\n sum+=1\r\n column[i]=sum\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"\":\r\n ans+=(row[i]-1)(column[j]-1)\r\nprint(ans)\r\n", "n, m =map(int, input().split())\r\ny = m[0]\r\nx = []\r\nc = []\r\nfor i in range(n):\r\n s = input()\r\n x.append(s.count(''))\r\n for j in range(m):\r\n if s[j] == '':\r\n y[j] += 1\r\n c.append(s)\r\nz = 0\r\nfor x1 in range(len(c)):\r\n for y1 in range(len(c[x1])):\r\n if c[x1][y1] == '':\r\n z += (y[y1]-1) * (x[x1]-1)\r\nprint(z)", "input_str = input\r\nn, m = map(int, input_str().split())\r\ngrid = [list(input_str()) for _ in range(n)]\r\nrow_counts = [row.count('') for row in grid]\r\ncolumn_counts = [col.count('') for col in zip(grid)]\r\ntotal = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n total += (row_counts[i] - 1) * (column_counts[j] - 1)\r\nprint(total)\r\n", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\n\r\ncnt_rows = [0] * n\r\ncnt_cols = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n cnt_rows[i] +=1\r\n cnt_cols[j] += 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n res += (cnt_cols[j] - 1) * (cnt_rows[i] - 1)\r\nprint(res)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nr = [0] * n\r\nc = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n r[i] += 1\r\n c[j] += 1\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n s += (r[i] - 1) * (c[j] - 1)\r\nprint(s)\r\n", "def process(M):\r\n n = len(M)\r\n m = len(M[0])\r\n d1 = {}\r\n d2 = {}\r\n points = set([])\r\n answer = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if M[i][j]=='':\r\n points.add((i, j))\r\n if i not in d1:\r\n d1[i] = 0\r\n if j not in d2:\r\n d2[j] = 0\r\n d1[i]+=1\r\n d2[j]+=1\r\n for i, j in points:\r\n a1 = d1[i]-1\r\n a2 = d2[j]-1\r\n answer = answer+(a1a2)\r\n return answer\r\n \r\n\r\nn, m = [int(x) for x in input().split()]\r\nM = []\r\nfor i in range(n):\r\n row = input()\r\n M.append(row)\r\nprint(process(M))", "a,b = map(int,input().split())\r\nmatrix = []\r\nscoluna = [0 for i in range(b)]\r\nslinha = [0 for i in range(a)]\r\nfor i in range(a):\r\n matrix.append(input())\r\n for j in range(b):\r\n if matrix[-1][j] == \".\":\r\n continue\r\n slinha[i] = slinha[i] + 1\r\n scoluna[j] = scoluna[j] + 1\r\n# print(scoluna,slinha)\r\nres = 0\r\nfor i in range(a):\r\n # print(matrix[i])\r\n for j in range(b):\r\n # print(matrix[i][j],end = ' ')\r\n if matrix[i][j] == \"\":\r\n res += (scoluna[j]-1)(slinha[i]-1)\r\n# print(slinha[i])\r\n# print(scoluna)\r\nprint(res)", "u=input\nn,m=map(int,u().split())\nl=[list(u()) for _ in range(n)]\nR=[p.count('') for p in l]\nC=[p.count('') for p in zip(l)]\nt=0\nfor i in range(n):\n for j in range(m):\n if(l[i][j]==''):\n t+=(R[i]-1)(C[j]-1)\nprint(t)", "u=input\r\nn,m=map(int,u().split())\r\nl=[list(u()) for _ in range(n)]\r\nR=[p.count('') for p in l]\r\nC=[p.count('') for p in zip(l)]\r\nt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==''):\r\n t+=(R[i]-1)(C[j]-1)\r\nprint(t)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,M=map(int,readline().split())\r\ngrid=[readline().rstrip() for n in range(N)]\r\ncntN=[0]N\r\ncntM=[0]M\r\nfor n in range(N):\r\n for m in range(M):\r\n if grid[n][m]==\"\":\r\n cntN[n]+=1\r\n cntM[m]+=1\r\nans=0\r\nfor n in range(N):\r\n for m in range(M):\r\n if grid[n][m]==\"\":\r\n ans+=(cntN[n]-1)(cntM[m]-1)\r\nprint(ans)", "\r\nn,m = map(int,input().split())\r\nma = []\r\nfor i in range(n):\r\n ma.append(input())\r\nx = [0] n\r\ny = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if ma[i][j] == \"\":\r\n x[i] += 1\r\n y[j] += 1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if ma[i][j] == \"\":\r\n ans += (x[i] - 1) * (y[j] - 1)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nz=[]\r\nzn=[0]n\r\nzm=[0]m\r\nfor i in range(n):\r\n s=input()\r\n z.append(s)\r\n for j in range(m):\r\n if s[j]=='':\r\n zm[j]+=1\r\n zn[i]=s.count('')\r\nk=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if z[i][j]=='':\r\n k+= (zm[j]-1) (zn[i]-1)\r\nprint(k)", "n, m = map(int, input().split())\r\nlin = []\r\nkol_stroka = [0 for _ in range(n)]\r\nkol_stolb = [0 for _ in range(m)]\r\nfor i in range(n):\r\n lin.append(list(input()))\r\n k = 0\r\n for j in range(len(lin[i])):\r\n if lin[i][j] == '':\r\n k += 1\r\n kol_stolb[j] += 1\r\n kol_stroka[i] += k\r\ncounter = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if lin[i][j] == '':\r\n counter += (kol_stroka[i] - 1) * (kol_stolb[j] - 1)\r\nprint(counter)", "n, m = map(int, input().split())\nA = [\"\" for i in range(n)]\nfor i in range(n):\n\tA[i] = input()\nR = [0 for i in range(n)]\nC = [0 for i in range(m)]\nfor i in range(n):\n\tfor j in range(m):\n\t\tif A[i][j] == '':\n\t\t\tR[i] += 1\n\t\t\tC[j] += 1\nans = 0\nfor i in range(n):\n\tfor j in range(m):\n\t\tif (A[i][j] == ''):\n\t\t\tans += (R[i] - 1) * (C[j] - 1)\nprint(ans)\n\n \t \t \t\t\t \t \t \t \t\t\t \t \t \t", "n,m=list(map(int,input().split()))\r\na=[input() for i in range(n)]\r\nb=[-1]n\r\nc=[-1]m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='':\r\n b[i]+=1\r\n c[j]+=1\r\nd=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='':\r\n d+=b[i]c[j]\r\nprint(d)", "n,m=map(int,input().split())\r\nA=[input().strip() for i in range(n)]\r\n\r\nR=[0]n\r\nC=[0]m\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"\":\r\n R[i]+=1\r\n C[j]+=1\r\n\r\nANS=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"\":\r\n ANS+=(R[i]-1)(C[j]-1)\r\n\r\nprint(ANS)\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\na = [[0 for _ in range(m)] for i in range(n)]\r\nb = [[0 for _ in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n a[i][j] = a[i][j - 1] + (grid[i][j] == '')\r\n if i:\r\n b[i][j] = b[i - 1][j]\r\n b[i][j] += grid[i][j] == ''\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '':\r\n l = r = u = d = 0\r\n if j:\r\n l = a[i][j - 1]\r\n r = a[i][-1] - a[i][j]\r\n if i:\r\n u = b[i - 1][j]\r\n d = b[-1][j] - b[i][j]\r\n ans += (l + r) (u + d)\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nst = [0] * n\r\nstb = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n st[i] += 1\r\n stb[j] += 1\r\n#print(st)\r\n#print(stb)\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '':\r\n ans += (st[i]- 1) * (stb[j] - 1)\r\nprint(ans)\r\n", "import sys\n\n\nreadline = sys.stdin.readline\nN, M = 0, 0\nmatrix = []\n\ndef read_input():\n global N, M, matrix\n N, M = [int(w) for w in readline().split()]\n matrix = [[0] * M for _ in range(N)]\n for i in range(N):\n line = readline().strip()\n for j in range(M):\n if line[j] == '':\n matrix[i][j] = 1\n\ndef solve()->int:\n row_cnt = [0] N\n col_cnt = [0] * M\n for r in range(N):\n for c in range(M):\n row_cnt[r] += matrix[r][c]\n col_cnt[c] += matrix[r][c]\n result = 0\n for r in range(N):\n for c in range(M):\n if matrix[r][c] == 1:\n result += (row_cnt[r] - 1) * (col_cnt[c] - 1)\n return result\n\ndef write_output(result: int):\n print(result)\n\n\nread_input()\nwrite_output(solve())\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\na = [i.count('') for i in g]\r\nb = [i.count('') for i in zip(g)]\r\nc = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == '':\r\n c += (a[i]-1)*(b[j]-1)\r\nprint(c)" ]	{"inputs": ["2 2\n*\n.", "3 4\n..\n.*.\n.*", "3 2\n..\n..\n.", "1 2\n*", "1 3\n.", "5 2\n.\n*\n.\n..\n.", "2 3\n...\n..", "10 9\n......\n.....\n......\n.****..\n...*.\n.*.....\n.......\n....\n....\n....", "2 3\n..\n.", "5 3\n.\n..\n.\n.\n..", "4 2\n\n\n.\n", "5 2\n\n\n\n.\n.", "2 3\n*\n..", "4 2\n.\n.\n..\n..", "10 26\n.......**..**.\n....*....******\n.....**....*.....\n...............\n..*****....*****\n..........\n....*....***\n.....*..*.....\n**.........****\n....***.......***", "20 11\n.........\n........\n......*.\n..........\n.......\n......*.\n......*.\n........\n.......\n..***...\n..**....\n.........\n.........\n.........\n........\n....*.\n....*....\n..........\n........\n........", "14 29\n.**********...*******\n..**.*****...*.\n****..............\n*..**..**....**...\n*.....**..***..\n...*.********...*\n*..**...**....\n.****.....**..*******\n...********.......*.\n.****....*...***...\n.****......***********\n..****..***.....\n...**......****..\n.....*****...", "13 26\n..**.*************\n*********...*****\n..*.*****..****\n**.**...*.\n.**.**********..\n********..**********\n.*...*******..\n**.**************.\n***...********.\n.**********************\n********.**********\n..*****.**.****\n**....****.", "2 1\n.\n.", "2 1\n\n", "1 1\n.", "1 1\n"], "outputs": ["1", "9", "0", "0", "0", "3", "0", "541", "1", "13", "15", "18", "2", "0", "12950", "1129", "48985", "65889", "0", "0", "0", "0"]}	UNKNOWN	PYTHON3	CODEFORCES	22
d4718bd75cf416c1554ff23d9d429005	About Bacteria	Qwerty the Ranger took up a government job and arrived on planet Mars. He should stay in the secret lab and conduct some experiments on bacteria that have funny and abnormal properties. The job isn't difficult, but the salary is high. At the beginning of the first experiment there is a single bacterium in the test tube. Every second each bacterium in the test tube divides itself into k bacteria. After that some abnormal effects create b more bacteria in the test tube. Thus, if at the beginning of some second the test tube had x bacteria, then at the end of the second it will have kx<=+<=b bacteria. The experiment showed that after n seconds there were exactly z bacteria and the experiment ended at this point. For the second experiment Qwerty is going to sterilize the test tube and put there t bacteria. He hasn't started the experiment yet but he already wonders, how many seconds he will need to grow at least z bacteria. The ranger thinks that the bacteria will divide by the same rule as in the first experiment. Help Qwerty and find the minimum number of seconds needed to get a tube with at least z bacteria in the second experiment. The first line contains four space-separated integers k, b, n and t (1<=≤<=k,<=b,<=n,<=t<=≤<=106) — the parameters of bacterial growth, the time Qwerty needed to grow z bacteria in the first experiment and the initial number of bacteria in the second experiment, correspondingly. Print a single number — the minimum number of seconds Qwerty needs to grow at least z bacteria in the tube. Sample Input 3 1 3 5 1 4 4 7 2 2 4 100 Sample Output 230	[ "def mikroby(k, b, n, t):\r\n z = 1\r\n while z <= t:\r\n z = k * z + b\r\n n -= 1\r\n return max(n + 1, 0)\r\n\r\n\r\nK, B, N, T = [int(i) for i in input().split()]\r\nprint(mikroby(K, B, N, T))\r\n", "entrada=input().split(\" \")\r\nlistae = list(map(int, entrada))#Convertir strs a int\r\nstock=1#comienza con 1 \r\nwhile(listae[0]stock+listae[1]<=listae[3] and listae[2]>0):#las que llevo<las que están en el tubo\r\n stock=listae[0]stock+listae[1]#las que llevo\r\n listae[2]-=1#timer, descuenta los segundos del tiempo necesario en prueba 1\r\nprint(listae[2])\r\n#refresh de cada segundo\r\n", "k,b,n,t=map(int,input().split())\na=1\ncnt=0\nfor i in range(1,n+1):\n a=ak+b\n if a<=t:\n cnt=i\n else:\n break\nprint(n-cnt)", "from math import \r\nk,b,n,t = map(int,input().split())\r\nif k == 1:\r\n print(max(ceil((nb+1-t)/b),0))\r\nelse:\r\n print(max(ceil(log(((b-1)+k)/((k-1)t+b),k)+n),0))", "k, b, n, t = map(int,input().split())\r\nans, i = (t(k-1)+b)/(k-1+b), 0\r\nif k == 1 :\r\n while 1+nb-t > ib :\r\n i += 1\r\n print(i)\r\nelse :\r\n while ans >= ki :\r\n i += 1\r\n print(max(0,n-i+1))", "k, b, n, t = list( map( int, input().split() ) )\r\n \r\ndef f( n, k, b, t ):\r\n \r\n population = 1\r\n \r\n while population <= t:\r\n population = k population + b\r\n n -= 1\r\n \r\n return ( max( 0, n+1 ) )\r\n \r\nprint( f( n, k, b, t ) )", "from math import ceil, log\r\nk, b, n, t = map(int, input().split())\r\nif k == 1:\r\n need = 1 + b * n\r\n print(max(0, (need - t + b - 1) // b))\r\n\r\nelse:\r\n k -= 1\r\n print(max(ceil(log((k + b) / (t * k + b)) / log(k + 1) + n), 0))", "k, b, n, t = map(int, input().split())\r\nz = 1\r\nres = int(n)\r\n\r\nfor i in range(n):\r\n z = kz + b\r\n if z <= t:\r\n res -= 1\r\n else:\r\n break\r\n\r\nprint(res)", "k,b,n,t = [int(x) for x in input().split(\" \")]\r\nz = 1\r\nwhile kz+b<=t:\r\n z = kz+b\r\n n -= 1\r\nprint(max(n,0))", "k,b,n,t=map(int,input().split())\nx=1\nwhile x<=t:\n\tx,n=xk+b,n-1\nprint (max(0,n+1))", "a=input()\r\nz=1\r\na=a.split(' ')\r\nlista=list(map(int,a))\r\n\r\ncontador=0\r\nk=lista[0]\r\nt=lista[-1]\r\nb=lista[1]\r\nn=lista[-2]\r\nwhile z<=t:\r\n z=kz+b\r\n contador+=1\r\nformula=n-contador+1\r\nif formula<0:\r\n print(\"0\")\r\nelse:\r\n print(formula)\r\n \r\n", "k, b, n, t = map(int, input().split())\r\ncur = 1\r\ndec = 1\r\nwhile (dec <= n):\r\n cur = cur k + b\r\n if (cur > t):\r\n break\r\n dec += 1\r\nprint(n - dec + 1)\r\n", "s = input().split(' ')\r\nk = int(s[0])\r\nb = int(s[1])\r\nn = int(s[2])\r\nt = int(s[3])\r\n\r\nct = 1\r\nwhile ( ct <= t ):\r\n ct = ct * k + b\r\n n = n - 1\r\nprint(max(0 , n + 1))", "# https://codeforces.com/contest/198/problem/A\n\nfrom math import ceil, log\n\nk, b, n, t = map(int, input().split())\n\nif k == 1:\n expr = (1 + n * b - t) / b\nelse:\n expr = (t * (k - 1) + b) / (k - 1 + b)\n expr = n - log(expr, k)\n\nexpr = max(0, ceil(expr))\nprint(expr)", "import math\r\nk,b,n,t=list(map(int,input().split()))\r\nif k!=1:\r\n val=math.log((1-k-b)/(t-tk1.000-b),k)\r\n # print(val)\r\n num=n+val\r\n print(max([0,math.ceil(num)]))\r\nelse:\r\n p=n-(t-1)/(b1.0000)\r\n print(max([0,math.ceil(p)]))", "k, b, n, t = map(int, input().split())\r\nz = 1\r\nx = n\r\nfor i in range(n):\r\n z = (k z) + b\r\n if z <= t:\r\n x -= 1\r\n else:\r\n break\r\nprint(x)", "entrada=input().split(\" \")\r\nlistae = list(map(int, entrada))#Convertir strs a int\r\nstock=1\r\nwhile(listae[0]stock+listae[1]<=listae[3] and listae[2]>0):\r\n stock=listae[0]stock+listae[1]\r\n listae[2]-=1\r\nprint(listae[2])\r\n", "import math\r\nk,b,n,t=list(map(int,input().split()))\r\nif k>1:\r\n \r\n ans=math.ceil(n-math.log((t+b/(k-1))/(1+b/(k-1)))/math.log(k))\r\n print(max(0,ans))\r\nelse:\r\n z=1+nb\r\n f=1\r\n ans=0\r\n while f:\r\n if t+ansb>=z:\r\n f=0\r\n break\r\n else:\r\n ans=ans+1\r\n print(ans)", "k,b,n,t =map(int,input().split())\r\nq=k\r\nq+=b\r\nkil=0\r\nwhile True :\r\n if q<=t :\r\n q=k\r\n q+=b\r\n kil+=1\r\n else :\r\n break\r\nkil=min(kil,n)\r\nprint(n-kil)\r\n", "from math import log\r\nk, b, n, t = map(int, input().split())\r\nif k == 1: print(max((n b + b - t) // b, 0))\r\nelse: print(max(0, n - int(log((k * t - t + b) / (k - 1 + b)) / log(k))))", "k, b, n, t = list(map(int, input().split())) \r\np = 1\r\nwhile p <= t:\r\n p = k * p + b\r\n n -= 1\r\nprint(max(0, n+1))\r\n", "k,b,n,t=map(int,input().split())\r\nz=1\r\nres=n\r\nfor i in range(n):\r\n z=(kz)+b\r\n if z<=t:\r\n res-=1\r\n else:\r\n break\r\nprint(res)\r\n", "from math import \r\nk,b,n,t=map(int,input().split())\r\n\r\nx=1\r\nx=(kx)+b\r\ncount=0\r\nwhile(x<=t):\r\n x=(kx)+b\r\n count+=1\r\n if(count==n):\r\n break;\r\nprint(n-count)\r\n" ]	{"inputs": ["3 1 3 5", "1 4 4 7", "2 2 4 100", "1 2 3 100", "10 10 10 123456", "847 374 283 485756", "37 1 283475 8347", "1 1 1 1", "1 1 1 1000000", "1 1 1000000 1", "1 1 1000000 1000000", "1 1000000 1 1", "1 1000000 1 1000000", "1 1000000 1000000 1", "1 1000000 1000000 1000000", "1000000 1 1 1", "1000000 1 1 1000000", "1000000 1 1000000 1", "1000000 1 1000000 1000000", "1000000 1000000 1 1", "1000000 1000000 1 1000000", "1000000 1000000 1000000 1", "1000000 1000000 1000000 1000000", "1 160 748 108", "1 6099 4415 2783", "1 1047 230 1199", "1 82435 53193 37909", "1 96840 99008 63621", "1 250685 823830 494528", "1 421986 2348 320240", "2 8 16 397208", "2 96 676 215286", "2 575 321 606104", "2 8048 37852 278843", "2 46658 377071 909469", "3 10 90 567680", "4 4 149 609208", "5 4 3204 986907", "6 5 5832 885406", "7 10 141725 219601", "38 86 441826 91486", "185 58 579474 889969", "3901 18 41607 412558", "9821 62 965712 703044", "29487 60 3239 483550", "78993 99 646044 456226", "193877 3 362586 6779", "702841 39 622448 218727", "987899 74 490126 87643", "1000000 69 296123 144040", "2 5 501022 406855", "2 2 420084 748919", "2 3 822794 574631", "2 2 968609 433047", "2 1 371319 775111", "3 2 942777 573452", "3 2 312783 882812", "3 4 715494 741228", "3 1 410364 566940", "3 2 780370 425356", "1 5 71 551204", "1 10 29 409620", "2 1 14 637985", "2 6 73 947345", "3 8 66 951518", "3 3 24 293582", "4 9 10 489244", "4 6 16 831308", "5 6 62 835481", "5 2 68 144841", "1 1 1000000 500000", "5 2 100 7", "3 1 3 4", "126480 295416 829274 421896", "999991 5 1000000 999997", "54772 1 1000000 1000000", "5 5 2 10", "1 1 2 2", "100000 100000 10 1000000", "2 2 5 4", "999997 1 100000 1000000", "5 2 100 38", "1 4 1 5", "1 2149 1000000 1000000", "99999 99999 10 1000000", "999998 1 1000000 1000000", "1 1 10 2", "1 1 100 1000", "1 1 1000000 553211", "1 1 10 1", "3 1 3 1", "888888 2 4 999999", "3 5 10 29", "1 1 100 2", "5 5 2 1", "50000 42 1337 999999", "2 345678 908765 987654", "1 7 15 7", "842717 8581 19342 851297", "5 4 1 4", "2 2 5 94", "2 100000 5 10", "722229 410423 118215 838505", "3 1 3 13", "900000 1 100 1000000", "2 4 4 36", "999990 1 1000000 1000000", "100000 100000 1000000 1000000", "999998 1 5 1000000", "1 1 10 4", "2 3 4 5", "3 1 3 40", "1 10 10 100", "999987 123456 1000000 1"], "outputs": ["2", "3", "0", "0", "6", "282", "283473", "1", "0", "1000000", "1", "1", "1", "1000000", "1000000", "1", "1", "1000000", "1000000", "1", "1", "1000000", "1000000", "748", "4415", "229", "53193", "99008", "823829", "2348", "1", "665", "311", "37847", "377067", "80", "141", "3196", "5825", "141720", "441824", "579472", "41606", "965711", "3238", "646043", "362586", "622448", "490126", "296123", "501006", "420067", "822777", "968592", "371301", "942766", "312772", "715483", "410353", "780359", "0", "0", "0", "56", "55", "14", "2", "7", "55", "61", "500001", "99", "2", "829273", "999999", "999999", "1", "1", "9", "4", "99999", "98", "0", "999535", "9", "999999", "9", "0", "446790", "10", "3", "3", "8", "99", "2", "1336", "908764", "15", "19342", "1", "0", "5", "118215", "1", "99", "1", "999999", "999999", "4", "7", "3", "0", "1", "1000000"]}	UNKNOWN	PYTHON3	CODEFORCES	23
d475b1db315b445f2e098c807d2d52c1	New Skateboard	Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4. You are given a string s consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero. A substring of a string is a nonempty sequence of consecutive characters. For example if string s is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04. As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. The only line contains string s (1<=≤<=\|s\|<=≤<=3·105). The string s contains only digits from 0 to 9. Print integer a — the number of substrings of the string s that are divisible by 4. Note that the answer can be huge, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type. Sample Input 124 04 5810438174 Sample Output 4 3 9	[ "a= input()\nans = 0\nfor i in range(len(a)-1,-1,-1):\n\tif(not int(a[i])%4):\n\t\tans+=1\n\tif ( i>0 and not int(a[i-1:i+1])%4):\n\t\tans+= i\n\nprint(ans)\n\t \t\t \t\t \t\t \t \t \t \t\t \t\t", "s = input()\r\nres = 0\r\n\r\nfor i in range(1, len(s)) :\r\n if int(s[i-1 : i+1]) % 4 == 0 :\r\n res += i\r\n\r\nres += s.count('0') + s.count('4') + s.count('8')\r\n\r\nprint(res)", "import sys\r\nimport os\r\nimport math\r\nimport copy\r\nfrom bisect import bisect\r\nfrom io import BytesIO, IOBase\r\nfrom math import sqrt,floor,factorial,gcd,log,ceil\r\nfrom collections import deque,Counter,defaultdict\r\nfrom itertools import permutations,combinations,accumulate\r\n\r\ndef Int(): return int(sys.stdin.readline())\r\ndef Mint(): return map(int,sys.stdin.readline().split())\r\ndef Lstr(): return list(sys.stdin.readline().strip())\r\ndef Str(): return sys.stdin.readline().strip()\r\ndef Mstr(): return map(str,sys.stdin.readline().strip().split())\r\ndef List(): return list(map(int,sys.stdin.readline().split()))\r\ndef Hash(): return dict()\r\ndef Mod(): return 1000000007\r\ndef Mat2x2(n): return [List() for _ in range(n)]\r\ndef Lcm(x,y): return (xy)//gcd(x,y)\r\ndef dtob(n): return bin(n).replace(\"0b\",\"\")\r\ndef btod(n): return int(n,2) \r\ndef watch(x): return print(x)\r\ndef common(l1, l2): return set(l1).intersection(l2)\r\ndef Most_frequent(list): return max(set(list), key = list.count)\r\n \r\ndef solution():\r\n #for _ in range(Int()):\r\n s=Str()\r\n ans=0\r\n for i in range(len(s)):\r\n if(int(s[i])%4==0):\r\n ans+=1\r\n for i in range(len(s)-1):\r\n if(int(s[i]+s[i+1])%4==0):\r\n ans+=(i+1)\r\n print(ans) \r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution()", "s = list(map(int, input()))\ncnt = 0\nfor i in range(len(s) - 1):\n if (s[i] 2 + s[i + 1]) % 4 == 0:\n cnt += i + 1\n if s[i] % 4 == 0:\n cnt += 1\nif s[-1] % 4 == 0:\n cnt += 1\nprint(cnt)\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input())\r\nM = lambda: map(int, input().strip().split())\r\nL = lambda: list(map(int, input().strip().split()))\r\nS = lambda: input().strip()\r\n\r\nn = S()\r\ncount = n.count('4') + n.count('8') + n.count('0')\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2]) % 4 == 0:\r\n count += i+1\r\nprint(count)\r\n", "s = input()\r\nc = 0\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n c += 1\r\nfor i in range(1, len(s)):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n c += i\r\nprint(c)", "import sys\r\nfrom math import \r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nj = None\r\nr = 0\r\np = 0\r\nfor i in minp():\r\n\tr += (int(i)%4 == 0)\r\n\tif j != None:\r\n\t\tif int(j+i) % 4 == 0:\r\n\t\t\tr += p\r\n\tp += 1\r\n\tj = i\r\nprint(r)", "import sys\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline().strip('\\n')\r\n\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nans = 0\r\nans += s.count('4')\r\nans += s.count('8')\r\nans += s.count('0')\r\n\r\nfor i in range(1,n):\r\n k = s[i-1] + s[i]\r\n \r\n if int(k)%4 == 0:\r\n ans += i\r\n\r\n #if k in ['04','08','20','40','60','80']:\r\n # ans += 1\r\nprint(ans)\r\n", "s=input().rstrip()\r\nx=list(s)\r\nG=0;\r\nfor i in range(0,len(x)):\r\n if i==0:\r\n if int(x[i])%4==0:\r\n G+=1;\r\n else:\r\n f=x[i];\r\n if int(f)%4==0:\r\n G+=1;\r\n g=x[i-1]\r\n c=g+f;\r\n D=int(c)\r\n if D%4==0:\r\n G+=i;\r\nprint(G)\r\n", "import sys\r\ns=sys.stdin.readline()[:-1]\r\nk=0\r\nfor x in s :\r\n if int(x)%4==0 :\r\n k+=1\r\nfor i in range(1,len(s)) :\r\n if int(s[i-1]+s[i])%4==0 :\r\n k+=i\r\nprint(k)\r\n", "count = 0\nx = input()\nfor i in range(len(x)-1):\n z = x[i:i+2]\n if int(z)%4 == 0:\n count += i+1\nfor j in range(len(x)):\n if x[j] in ['0', '4', '8']:\n count+= 1\nprint(count) \n \n \n\n\t \t\t \t \t\t \t \t\t\t\t\t\t \t", "s = input()\r\nans = 0\r\nd = {}\r\nd['0'] = \"02468\"\r\nd['2'] = \"13579\"\r\nd['4'] = \"02468\"\r\nd['6'] = \"13579\"\r\nd['8'] = \"02468\"\r\n\r\ndt = [0 for _ in range(10)]\r\n\r\nfor i in range(0,len(s)):\r\n if i and s[i] in d and s[i-1] in d[s[i]]:\r\n ans+= i\r\n if s[i] in \"048\":\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ns = input()\r\nans = 0; n = len(s)\r\nif int(s[0])%4 == 0: ans += 1\r\nfor i in range(1,n-1):\r\n if int(s[i])%4 == 0: ans += 1\r\n if int(s[i-1:i+1])%4 == 0: ans += i\r\nprint(ans)\r\n", "s = input()\nn = len(s)\ni = n - 1\nans = 0\nwhile i > 0:\n number = int(s[i-1] + s[i])\n if s[i] == '4' or s[i] == '8' or s[i] == '0':\n ans += 1\n if number % 4 == 0:\n ans += i\n i -= 1\nif s[0] == '4' or s[0] == '8' or s[0] == '0':\n ans += 1\nprint(ans)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\ndef find(x):\n if x != parents[x]:\n parents[x] = find(parents[x])\n return parents[x]\n\ndef union(x, y):\n rootX = find(x)\n rootY = find(y)\n if rootX != rootY:\n if ranks[rootX] > ranks[rootY]:\n parents[rootY] = rootX\n else:\n parents[rootX] = rootY\n if ranks[rootX] == ranks[rootY]:\n ranks[rootY] += 1\n\ndef main():\n s = input()\n n = len(s)\n dp = [0] len(s) \n for i in range(n):\n dp[i] = dp[i-1]\n if int(s[i]) % 4 == 0:\n if i == 0:\n dp[i] = 1\n else:\n dp[i] += 1 \n if i >= 1 and int(s[i-1:i+1]) % 4 == 0:\n dp[i] += i \n print(dp[n-1])\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n\n", "s=list(input())\r\nd=0\r\nfor i in range(len(s)):\r\n if i!=0:\r\n num=int(s[i-1])10+int(s[i])\r\n if num%4==0:\r\n d+=i\r\n if int(s[i])%4==0:\r\n d+=1\r\nprint(d)\r\n ", "from sys import stdin, stdout, setrecursionlimit\r\n#import threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, RECURSION_LIMIT, STACK_SIZE):\r\n setrecursionlimit(RECURSION_LIMIT)\r\n threading.stack_size(STACK_SIZE)\r\n return None\r\n \r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n s = R()\r\n l = len(s) - 1\r\n \r\n total = 0\r\n for i in range(l):\r\n total += (not int(s[i])%4)\r\n \r\n for i in range(1, l):\r\n total += (i if not int(s[i-1]+s[i])%4 else 0)\r\n \r\n W('%d\\n' % total)\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\n#Tail_Recursion_Optimization(107, 226) # recursion-call size, stack-size in byte\r\n#threading.Thread(target=main).start()\r\nmain()", "s=input()\r\ncount=0\r\nfor i in range(len(s)):\r\n if(int(s[i])%4==0):\r\n count=count+1\r\nfor i in range(len(s)-1):\r\n num=s[i]+s[i+1]\r\n if(int(num)%4==0):\r\n count=count+i+1\r\nprint(count) \r\n \r\n \r\n", "s=input()\r\nans=0\r\nn=len(s)\r\nfor i in range(n-1):\r\n if(int(s[i])%4==0):\r\n ans+=1\r\n if(int(s[i:i+2])%4==0):\r\n ans+=i+1\r\nif(int(s[n-1])%4==0):\r\n ans+=1\r\nprint(ans)", "s, r = input(), 0\r\nfor i in range(len(s)-1):\r\n a = s[i] + s[i+1]\r\n if int(a) % 4 == 0:\r\n r += i + 1\r\n if s[i] in ['0', '4', '8']:\r\n r += 1\r\nprint(r + 1 if s[-1] in ['0', '4', '8'] else r)", "n = input()\r\na = 0\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2])%4 == 0:\r\n a += i + 1\r\n if int(n[i])%4 == 0:\r\n a += 1\r\nif int(n[-1])%4 == 0:\r\n a += 1\r\nprint(a)\r\n", "s = input()\nres = s.count('0') + s.count('4') + s.count('8')\nfor i in range(len(s) - 1):\n if int(s[i:i+2]) % 4 == 0:\n res += i + 1\nprint(res)\n", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\na = s.count('0') + s.count('4') + s.count('8')\n \nfor i in range(len(s) - 1):\n\tif int(s[i:i + 2]) % 4 == 0:\n\t\ta += i + 1\n \nprint(a)\n", "s = input()\nc = 0\n\nfor i in range(0, len(s)):\n if ((ord(s[i]) - ord('0')) % 4 == 0):\n c += 1\n\nfor i in range(0, len(s) - 1):\n if(((ord(s[i]) - ord('0')) 10 + (ord(s[i + 1]) - ord('0'))) % 4 == 0):\n c += i + 1\n\nprint(c)\n \t\t \t \t\t \t\t \t\t \t \t\t\t\t \t", "def main():\n l = [ord(c) - 48 for c in input()]\n y, res = 1, l.count(0) + l.count(4) + l.count(8)\n for i in range(len(l) - 1, -1, -1):\n x = l[i]\n if not (x * 10 + y) % 4:\n res += i + 1\n y = x\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "s=input()\r\nn=len(s)\r\nans=0\r\n\r\nfor i in s:\r\n if((int(i))%4==0):\r\n ans+=1\r\nfor i in range(1,n):\r\n if( int(s[i-1]+s[i])%4==0):\r\n ans+=i\r\nprint(ans)\r\n", "s, k = input(), 0\r\n\r\nfor i in range(1, len(s)):\r\n if int(s[i-1] + s[i]) % 4 == 0:\r\n k += i\r\n\r\nprint(k + sum(s.count(d) for d in '048'))", "#!/usr/bin/python3\n\"\"\" getting skateboard 1300 \"\"\"\n\nfrom re import I\nfrom unittest import TestCase\n\n\nclass Test(TestCase):\n \"\"\" test cases \"\"\"\n\n def test_get_subs(self):\n \"\"\" test the function get substring \"\"\"\n\n self.assertEqual(get_subs('123'), ['1', '12', '123', '2', '23', '3'])\n self.assertEqual(\n get_subs('1234'),\n ['1', '12', '123', '1234', '2', '23', '234', '3', '34', '4']\n )\n\n def test_answer(self):\n \"\"\" test that answer returns the number of\n substrings divisible by 4 given a string \"\"\"\n\n self.assertEqual(answer('124'), 4)\n self.assertEqual(answer('04'), 3)\n self.assertEqual(answer('5810438174'), 9)\n\n def test_count_048(self):\n \"\"\" test count 4 8 function \"\"\"\n\n self.assertEqual(count_1_div_4('124'), 1)\n self.assertEqual(count_1_div_4('1244'), 2)\n self.assertEqual(count_1_div_4('4844'), 4)\n self.assertEqual(count_1_div_4('48440'), 5)\n \n def test_count_2_div_4(self):\n \"\"\" test count 2 divisible by 4 function \"\"\"\n\n self.assertEqual(count_2_div_4('124'), 3)\n self.assertEqual(count_2_div_4('12'), 1)\n self.assertEqual(count_2_div_4('4321'), 2)\n\n\ndef get_subs(str_1) -> list:\n \"\"\" return a list of all substrings given a string \"\"\"\n\n n_str = len(str_1)\n return [\n str_1[ind1: ind1 + len_]\n for ind1 in range(n_str) for len_ in range(1, n_str - ind1 + 1)\n ]\n\n\ndef count_1_div_4(str_1) -> int:\n \"\"\" return number of single digits that are divisible by 8 \"\"\"\n\n return sum([1 for char in str_1 if char in '048'])\n\n\ndef count_2_div_4(str_1) -> int:\n \"\"\" count the number of two length substrings \n from the back, divisible by 4 \"\"\"\n\n n_str = len(str_1)\n return sum(\n [\n ind\n for ind in range(n_str-1, 0, -1)\n if int(str_1[ind-1:ind+1]) % 4 == 0\n ]\n )\n\n\ndef answer(str_1):\n \"\"\" return the number of substrings divisible by 4 \"\"\"\n\n return count_1_div_4(str_1) + count_2_div_4(str_1)\n\n\ndef main() -> None:\n \"\"\" do stuff \"\"\"\n\n print(answer(input()))\n\n\nif __name__ == '__main__':\n main()\n", "s = list(map(int, list(input())))\ncount = 0\nfor i in range(len(s)):\n if s[i] % 4 == 0:\n count += 1\n if i > 0:\n num = 10 * s[i-1] + s[i]\n if num % 4 == 0:\n count += i\n \nprint(count)\n", "s = input()\ncount = 0\n\n\nfor i in range(len(s)):\n if s[i] in [\"0\",\"4\",\"8\"]:\n count+=1\nfor i in range(len(s)-1):\n x = s[i:i+2]\n if int(x)%4 == 0:\n count+= i+1\n \nprint(count)\n \t \t\t \t\t \t\t \t\t\t\t\t\t \t \t \t\t", "s = input()\r\ncounter = 0\r\nfor i in range(len(s), 1, -1):\r\n if int(s[i-2]+s[i-1]) % 4 == 0:\r\n counter += (i-1)\r\nfor elem in s:\r\n if int(elem)%4 == 0:\r\n counter += 1\r\n\r\nprint(counter)", "import sys\nfrom collections import Counter\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_chars(): return list(sys.stdin.readline().strip())\nsys.setrecursionlimit(20000)\n\ns = get_chars()\n\na = 0\n\nif int(s[0]) % 4 == 0:\n a+=1\nfor i in range(1, len(s)):\n if int(s[i]) % 4 == 0:\n a+= 1\n if (int(s[i-1])10 + int(s[i])) % 4 == 0:\n a+= i\n\n # print(i, a)\n\nprint(a)", "s = input()\nres = 0\nfor elem in s:\n if int(elem) % 4 == 0:\n res += 1\nfor i in range(len(s) - 1):\n if int(s[i:i + 2]) % 4 == 0:\n res += i + 1\nprint(res)", "import sys\r\n\r\ns = sys.stdin.buffer.readline().decode('utf-8').rstrip()\r\ndp = [0]4\r\nans = 0\r\n\r\nfor d in map(int, s):\r\n m = d % 4\r\n ndp = [0]4\r\n ndp[m] += 1\r\n for x in range(4):\r\n ndp[(x10+m) % 4] += dp[x]\r\n\r\n dp = ndp\r\n ans += dp[0]\r\n\r\n\r\nprint(ans)\r\n", "s = input()\r\n \r\n \r\ncount = 0\r\nfor i in s:\r\n if int(i)%4 == 0:\r\n count +=1\r\n \r\nfor i in range(len(s) - 1):\r\n l2_digits = int(s[i:i+2])\r\n# print(l2_digits,i)\r\n if l2_digits%4 == 0:\r\n count += i+1\r\n \r\nprint(count)\r\n", "# Reference: https://codeforces.com/problemset/problem/628/B\r\n\r\ndef div4(n: int):\r\n if n%4 == 0:\r\n return True\r\n return False\r\n\r\ndef fs(f: str, s: str):\r\n t = 0\r\n b = False\r\n if div4(int(s)):\r\n t += 1\r\n if div4(int(f+s)):\r\n t += 1\r\n b = True\r\n\r\n return t, b\r\n\r\n\r\n\r\ns = input()\r\n\r\nlast_index = 1\r\nc = 0\r\n\r\nif len(s) == 1:\r\n if div4(int(s)):\r\n c = 1\r\nelif len(s) == 2:\r\n if div4(int(s[0])):\r\n c = 1\r\n\r\n c += fs(s[0], s[1])[0]\r\n\r\nelse:\r\n for i in range(1, len(s)):\r\n first = s[i-1]\r\n second = s[i]\r\n t, b = fs(first, second)\r\n c += t\r\n if i == 1 and div4(int(first)):\r\n c += 1\r\n\r\n\r\n if b and i != last_index:\r\n t = i - last_index\r\n if t > 0:\r\n c += t\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nn1,n2,n4,c4 = 0,0,0,0\r\nfor i in range(len(s)):\r\n r = int(s[i])%4\r\n if r==1 or r==3:\r\n n1,n2,n4 = i+1,0,0\r\n elif r==2:\r\n n1,n2,n4 = 0,(n2+n4+1),n1\r\n else:\r\n n1,n2,n4 = 0,n1,(n2+n4+1)\r\n c4 += n4\r\nprint(c4)\r\n", "a = input()\na = list(a)\nans = 0\nfor i in a:\n\tif int(i)%4 == 0:\n\t\tans += 1\nwhile len(a)>=2:\n\tif int(''.join(a[-2:]))%4 == 0:\n\t\tans += len(a) - 1\n\ta.pop()\nprint(ans)", "# https://codeforces.com/problemset/problem/628/B\n\nimport fileinput\nimport sys\nfrom typing import List, Dict, Union, Any\n\n\nline: List[int] = []\nfor i, line in enumerate(fileinput.input()):\n line = [int(i) for i in line[:-1]]\n break\n\nrez = 0\n\nfor numb in line:\n rez += (numb % 4 == 0)\n\nfor i in range(len(line) - 1):\n add = (int(f\"{line[i]}{line[i + 1]}\") % 4 == 0)\n if add != 0:\n add += i\n rez += add\n\nprint(rez)\n", "s = input()\r\n\r\nn = len(s)\r\n# dp = [-1]n\r\n# def rec(i,s):\r\n# if i<0:\r\n# return 0\r\n# if i==0:\r\n# if int(s[i])%4==0:\r\n# dp[i]=1\r\n# else:\r\n# dp[i]=0\r\n# return dp[i]\r\n \r\n# if dp[i]!=-1:\r\n# return dp[i]\r\n \r\n# ans = rec(i-1,s)\r\n# if int(s[i])%4==0:\r\n# ans+=1\r\n# if int(s[i-1:i+1])%4==0:\r\n# ans+= i\r\n \r\n# dp[i]=ans\r\n# return dp[i]\r\n\r\n# print(rec(n-1,s))\r\n\r\ndp = [0]n\r\n\r\nif int(s[0])%4==0:\r\n dp[0]=1\r\n\r\nfor i in range(1,n):\r\n\r\n dp[i] = dp[i-1]\r\n if int(s[i])%4==0:\r\n dp[i]+=1\r\n if int(s[i-1:i+1])%4==0:\r\n dp[i]+= i\r\n\r\nprint(dp[n-1])\r\n", "s = list(map(int,input()))\r\nx = len(s)\r\nq = 0 if s[-1]%4 else 1\r\nfor i in range(x-1):\r\n if not s[i]%4:\r\n q+=1\r\n if (10s[i]+s[i+1])%4==0:\r\n q+=i+1\r\nprint(q)", "s = input()\n\ncunt = 0\n\nl = len(s)\n\nif int(s[0])%4 == 0:\n\tcunt += 1\n\nfor i in range(1, l):\n\tif int(s[i])%4 == 0:\n\t\tcunt += 1\n\n\tif int(s[i-1] + s[i])%4 == 0:\n\t\tcunt += i\n\t\n\nprint(cunt)", "n = input()\n\ns = 0\n\nfor i in range(len(n)-1, -1, -1):\n\tif int(n[i])%4 == 0:\n\t\t# print(n[i])\n\t\ts+=1\n\tif i < 1:\n\t\tcontinue\n\n\tif int(n[i-1:i+1])%4 == 0:\n\t\t# print(n[i-1:i+1])\n\t\ts+=i\n\nprint(s)", "# how in the flying fuck was a simple calculator able to display 300000 characters \r\n# in one go. And Yusuf, that fucking cunt. That motherfucker had enough time\r\n# to type in that many characters. \r\nlongArray = input()\r\na,b,c = longArray.count('0'),longArray.count('4'),longArray.count('8')\r\ncount,size = a+b+c,len(longArray)\r\nfor x in range(size-2,-1,-1):\r\n h = int(longArray[x:x+2])\r\n if not h%4:\r\n count += (size - (size-x)) + 1\r\nprint(count)\r\n", "s=(input())\r\n\r\nl=list(map(int, list(s)))\r\n'''\r\ndef nums(i):\r\n\tglobal l;\r\n\tif(i==0):\r\n\t\treturn int(l[0]%4==0)\r\n\t\r\n\tif(i>0 and (l[i-1]10+l[i])%4==0):\r\n\t\treturn nums(i-1)+i+int(l[i]%4==0)\r\n\tif(l[i]%4==0):\r\n\t\treturn nums(i-1)+1\r\n\telse:\r\n\t\treturn nums(i-1)\r\n'''\r\n\r\nc=0\r\ndef work():\r\n\tglobal c, l;\r\n\tfor i in range(len(l)-1, -1,-1):\r\n\t\tif(i==0):\r\n\t\t\tc+= int(l[0]%4==0)\r\n\r\n\t\telif(i>0 and (l[i-1]10+l[i])%4==0):\r\n\t\t\tc += i+int(l[i]%4==0)\r\n\t\telif(l[i]%4==0):\r\n\t\t\tc+=1\r\n\t\r\n\r\n\r\n\r\nwork()\r\nprint(c)\r\n\r\n", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n if (i>0):\r\n if (int(s[i-1])10+int(s[i]))%4==0:\r\n ans+=i\r\nprint(ans)", "l=list(input())\r\ntemp=[]\r\ncount=0\r\nfor i in range(len(l)-1):\r\n x=int(l[i]+l[i+1])\r\n y=int(l[i])\r\n if x%4==0:\r\n temp.append(i+1)\r\n \r\n if y%4==0:\r\n count+=1\r\n\r\nif int(l[len(l)-1])%4==0:\r\n count+=1\r\n\r\nxs=0\r\nfor i in range(len(temp)):\r\n xs+=temp[i]\r\n\r\nprint(count+xs) \r\n\r\n", "arr = list(map(int,list(input())))\r\nans = 0\r\nfor i in range(len(arr)):\r\n if arr[i] == 8 or arr[i] == 4 or arr[i] == 0:\r\n ans+=1\r\nfor i in range(len(arr)-1):\r\n if (arr[i]10 + arr[i+1])%4 == 0:\r\n ans+=i+1\r\nprint(ans)", "\"\"\"\r\nCreated on Sat Jan 12 23:33:17 2019\r\n\"\"\"\r\n\r\ns = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n t = int(s[i])\r\n if t % 4 == 0:\r\n res += 1\r\n if i > 0:\r\n if (int(s[i - 1]) 10 + t) % 4 == 0:\r\n res += i\r\nprint(res)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\n\r\nfor i in range(n - 1, 0, -1):\r\n if int(s[i - 1:i + 1]) % 4 == 0:\r\n ans += i\r\n\r\nprint(ans)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor j in range(n-2,-1,-1):\r\n x=s[j]+s[j+1]\r\n if int(x)%4==0:\r\n ans=ans+1+j\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\nprint(ans)", "# from math import lcm\r\nfrom queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\n# for _ in range(int(input())):\r\ns=list(input())\r\nn=len(s)\r\nl=list(map(int,s))\r\ncount=0\r\nfor i in range(n-1,0,-1):\r\n if l[i]%4==0:\r\n count+=1\r\n if (10l[i-1]+l[i])%4==0:\r\n count+=i\r\nif l[0]%4==0:\r\n count+=1\r\nprint(count)\r\n", "s = input()\n\nans = 0\nfor i in range(len(s)):\n if int(s[i])%4 == 0:\n ans += 1\n if i > 0 and (int(s[i-1])10+int(s[i]))%4 == 0:\n ans += i\nprint(ans)\n", "a=str(input())\ncount=0\nn=len(a)-1\nm=n-1\nwhile True:\n if m==-1:\n break\n if(int(a[m:n+1])%4==0):\n count+=(m+1)\n if int(a[n:n+1])%4==0:\n count+=1\n n-=1\n m-=1\nif (int(a[0])%4==0):\n count+=1\n\n\n\nprint(count)\n\t \t\t \t\t\t\t \t \t \t \t\t\t \t\t \t \t", "def solution(s):\r\n ret = 1 if int(s[0]) % 4 == 0 else 0\r\n\r\n for i in range(1, len(s)):\r\n if (int(s[i - 1]) * 10 + int(s[i])) % 4 == 0:\r\n ret += i\r\n if int(s[i]) % 4 == 0:\r\n ret += 1\r\n \r\n return ret\r\nprint(solution(input()))", "import math\r\ndef dtb(n): \r\n return bin(n).replace(\"0b\",\"\")\r\ndef btd(n): \r\n return int(n,2) \r\nt=1\r\nfor k in range(t):\r\n s=input()\r\n #a=list(map(int,input().split()))[:n]\r\n n=len(s)\r\n count,prev=0,0\r\n if int(s[0])%4==0:\r\n \r\n count+=1\r\n prev=int(s[0]) \r\n for i in range(1,n):\r\n if int(s[i])%2==1:\r\n prev=int(s[i])\r\n continue\r\n \r\n if int(s[i])%4==0 :\r\n if prev%2==0:\r\n count+=(i+1)\r\n else:\r\n count+=1\r\n elif (int(s[i])+(10prev))%4==0:\r\n count+=i\r\n prev=int(s[i]) \r\n print(count) \r\n \r\n ", "s = input() \r\nans = 0 \r\nfor i in range(len(s)-1, 0, -1): \r\n if int(s[i])%4 == 0 : ans += 1\r\n if int(s[i-1] + s[i]) % 4 == 0 : ans += i-1 + 1\r\nif int(s[0])%4 == 0 : ans += 1\r\nprint(ans)", "s = input()\nn = len(s)\n\nans = 0\nfor i in range(1, n):\n\tif int(s[i]) % 2 == 0:\n\t\tif (10 int(s[i - 1]) + int(s[i])) % 4 == 0:\n\t\t\tans += i\n\tif int(s[i]) in [0, 4, 8]:\n\t\tans += 1\n\t#print (ans)\n\t\t\t\nif int(s[0]) in [0, 4, 8]:\n\tans += 1\n\t\nprint (ans)\n", "n=input()\r\nans=0\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2])%4==0:\r\n ans+=i+1\r\nfor i in n:\r\n if int(i)%4==0:\r\n ans+=1\r\nprint(ans)", "import math\n\nl1 = input()\n#l2 = input().split()\n\n#l1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\ns = list(l1)\nans = 0;\n\n#print(s)\n\nfor i in range (len(s)):\n if ( int(s[i]) % 4 == 0 ):\n ans += 1;\n\nfor i in range (1, len(s)):\n if (( int(s[i]) + (int(s[i - 1])) * 2 ) % 4 == 0):\n ans += i;\n\nprint(ans)\n\n\n\t\t \t \t \t \t\t\t\t\t \t", "\"\"\"\r\nCreated on Sun 14th Feb 2021\r\n @author: Rohit\r\n\"\"\"\r\n\r\ns = input()\r\nl = len(s)\r\ncount= 0\r\nif int(s[0]) % 4 == 0:\r\n count = 1\r\nfor p in range(1, l):\r\n if int(s[p-1: p+ 1]) % 4 == 0:\r\n count += p\r\n if int(s[p]) % 4 == 0:\r\n count += 1\r\nprint(count)\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "\r\n\r\nS = input()\r\n\r\nresult = 0\r\n\r\nfor i in range(len(S) ):\r\n\r\n if i == 0:\r\n \r\n\r\n if int(S[i]) % 4 == 0:\r\n\r\n result += 1\r\n\r\n elif int(S[i]) % 4 == 0:\r\n\r\n if int(S[i-1:i+1]) % 4 == 0:\r\n\r\n result += i+1\r\n\r\n else:\r\n result += 1\r\n\r\n elif int(S[i-1:i+1]) % 4 == 0:\r\n\r\n result += i\r\n\r\n\r\nprint(result)\r\n\r\n\r\n", "\r\n\r\ndef build_lps_table(s):\r\n table = [0] * len(s)\r\n index = 0\r\n for i in range(1, len(s)):\r\n if s[i] == s[index]:\r\n table[i] = index + 1\r\n index += 1\r\n else:\r\n index = table[i-1]\r\n while index > 0 and s[index] != s[i]:\r\n index = table[index-1]\r\n\r\n if s[i] == s[index]:\r\n index += 1\r\n table[i] = index\r\n return table\r\n\r\n\r\n\"\"\"\r\n\r\nnumber of substrings that are divisible by 4 \r\nif last digit so far is divisible by 4, then 1 + all of the substrings before tha\r\ns[i]%4==0:\r\n ans = 1 + all_substrings(i-1)\r\nif prev+s[i]\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n s = input()\r\n count = 0\r\n if int(s[0]) % 4 == 0:\r\n count += 1\r\n for i in range(1, len(s)):\r\n cur = s[i]\r\n prev = s[i-1]\r\n if int(cur) % 4 == 0:\r\n count += 1\r\n if int(prev+cur) % 4 == 0:\r\n count += i\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = [int(i) for i in input()]\r\n\r\nct = 0\r\n\r\nfor i in s:\r\n if not i%4:\r\n ct += 1\r\n \r\nn = len(s)\r\n\r\nfor i in range(1, n):\r\n if not (10s[i-1]+s[i])%4:\r\n ct += i\r\n \r\nprint(ct)", "s = input()\nnum = 0\nfor i in range(len(s)):\n if (i != len(s)-1):\n n = (int(s[i])10+int(s[i+1]))\n if n%4 == 0:\n num += 1 + i\n if int(s[i])%4 == 0:\n num += 1\nprint(num)\n\n \t\t\t\t \t \t\t\t \t \t\t \t \t\t", "s = input()\r\ncount = 0\r\ns = s[::-1]\r\nfor i in range(len(s)):\r\n if int(s[i]) % 4 == 0:\r\n count += 1\r\n if i < (len(s)) - 1:\r\n num = (s[i+1]) + (s[i])\r\n if int(num) % 4 == 0:\r\n count += len(s[(i+1):])\r\nprint(count)", "string = input()\nresp = 0\nif int(string[0]) % 4 == 0:\n resp += 1\nfor i in range(len(string) - 1):\n actual = int(string[i])10 + int(string[i+1])\n endingWithActual = i + 1\n if actual % 4 == 0:\n resp += endingWithActual\n if int(string[i + 1]) % 4 == 0:\n resp += 1\nprint (resp)\n\t\t\t\t\t \t \t\t \t \t \t\t\t\t \t", "x = input()\r\nn = len(x)\r\ncnt = 0\r\nfor i in range(n - 1):\r\n if int(x[i:i+2]) % 4 == 0:\r\n cnt += (i + 1)\r\nfor j in range(n):\r\n if int(x[j]) % 4 == 0:\r\n cnt += 1\r\nprint(cnt)", "s = input()\n\nans = 0\n\nprev = -1\n\nfor i, char in enumerate(s):\n\n nb = int(char)\n\n\n if nb % 4 == 0:\n ans += 1\n\n if i and (prev10+nb) % 4 == 0:\n ans += i\n\n prev = nb\nprint(ans)", "import sys\ninput=sys.stdin.readline\ns = input().strip()\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in [\"0\",\"4\",\"8\"]:\n count+=1\nfor i in range(len(s)-1):\n x = s[i:i+2]\n if int(x)%4 == 0:\n count+= i+1\n \nsys.stdout.write(\"%d\"%(count))\n\n \n\n \t \t\t\t\t \t \t\t\t\t\t \t\t \t\t\t\t\t", "a=input()\r\ncnt=0\r\nn=len(a)\r\nfor i in range(n):\r\n if int(a[i])%4==0:\r\n cnt+=1\r\nfor i in range(n-1):\r\n if int(a[i]+a[i+1])%4==0:\r\n cnt+=(i+1)\r\nprint(cnt)", "def div4(s):\n return int(s[-2:]) % 4 == 0\n\nn = input()\n\ntotal = 0\n\nfor c in n:\n if int(c) % 4 == 0:\n #print(c)\n total += 1\n \nfor i in range(1,len(n)):\n d2 = n[i-1:i+1]\n if div4(d2):\n #print(d2)\n total += i\n\nprint(total)\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\ns=input()\r\nc=0\r\nfor i in range(len(s)):\r\n k=int(s[i])\r\n if(k%4==0):\r\n c+=1 \r\n if(i):\r\n k=int(s[i-1]+s[i])\r\n if(k%4==0):\r\n c+=i \r\nprint(c) ", "s=input();\r\nans=0;\r\ns=[int(x)for x in s];\r\nans+=sum([x%4==0 for x in s]);\r\nfor i in range(len(s)-1):\r\n if (s[i]10+s[i+1])%4==0:\r\n ans+=i+1;\r\nprint(ans);", "'''\r\n# Sample code to perform I/O:\r\n\r\nname = input() # Reading input from STDIN\r\nprint('Hi, %s.' % name) # Writing output to STDOUT\r\n\r\n# Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail\r\n'''\r\n\r\n# Write your code here\r\ndef divv(ag):\r\n ag=int(ag)\r\n if((ag%4)==0):\r\n return 1\r\n else:\r\n return 0\r\ns=str(input())\r\ncnt=0\r\nfor i in range(0,len(s)):\r\n ag=s[i]\r\n ag=int(ag)\r\n if((ag%4)==0):\r\n cnt=cnt+1\r\ni=0\r\nfor i in range(len(s)-2,-1,-1):\r\n ag=s[i:i+2]\r\n if(divv(ag)==1):\r\n cnt=cnt+1\r\n cnt=cnt+i\r\nprint(cnt)\r\n ", "lst = input().strip()\r\ns = []\r\nfor i in range(len(lst)):\r\n s.append(int(lst[i]))\r\nanswer = 0\r\nfor i in range(1, len(s)):\r\n if (s[i] + 10 s[i - 1]) % 4 == 0:\r\n answer += i\r\nfor i in range(len(s)):\r\n if s[i] % 4 == 0:\r\n answer += 1\r\nprint(answer)\r\n", "s = input()\r\nans = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n if int(s[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\nprint(ans)\r\n", "seq = list(map(int, list(input())))\r\nn = len(seq)\r\n\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n s = seq[i]\r\n if s % 4 == 0:\r\n ans += 1\r\n if i > 0 and seq[i - 1] % 2 == 0:\r\n ans += i\r\n elif s % 4 == 2:\r\n if i > 0 and seq[i - 1] % 2 == 1:\r\n ans += i\r\nprint(ans)\r\n", "S = input()\r\nL = len(S)\r\n\r\nres = 0\r\n\r\nfor i in range(L)[::-1]:\r\n if int(S[i]) % 4 == 0:\r\n res += 1\r\n if i != 0 and int(S[i - 1: i + 1]) % 4 == 0:\r\n res += i\r\n\r\nprint(res)", "def main():\r\n a=input()\r\n a=list(a)\r\n summ=0\r\n for i in range(len(a)):\r\n if int(a[i])%4==0:\r\n summ+=1\r\n if i!=0 and int(''.join(k for k in a[i-1:i+1]))%4==0:\r\n summ+=i\r\n return summ\r\n\r\nprint(main())", "t = input()\r\nn = len(t)\r\nif n == 1:\r\n print(int(not(bool(int(t)%4))))\r\nelse:\r\n c = 0\r\n if int(t[0])%4 == 0: c+=1 \r\n for i in range(1,n):\r\n if int(t[i])%4 == 0: \r\n c+=1\r\n d = int(t[i-1:i+1])\r\n if d%4==0:\r\n c+=i\r\n print(c)\r\n ", "s = input()\r\nres = 0\r\nn = len(s)\r\nfor i in range(n-2,-1, -1):\r\n k = int(s[i:i+2])\r\n if k % 4 == 0:\r\n res += i+1\r\n if k%10%4 == 0:\r\n res += 1\r\nif int(s[0])%4==0: \r\n res +=1 \r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(map(int, list(input().strip())))\r\nans = len([i for i in s if not i%4])\r\n\r\nfor i in range(len(s)-1):\r\n if not (s[i] * 10 + s[i+1]) % 4:\r\n ans += (i+1)\r\nprint(ans)", "s = input()\r\nans = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n if int(s[i - 1] + s[i]) % 4 == 0:\r\n ans += i\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nprint(ans)", "s=input()\r\nans=0\r\nif(int(s[0])%4==0):ans+=1\r\nfor i in range(1,len(s)):\r\n if(int(s[i])%4==0):ans+=1\r\n if(int(s[i-1]+s[i])%4==0):ans+=i\r\nprint(ans) ", "def check(string):\r\n if string % 4 == 0:\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\nans = 0\r\n\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\n\r\nl = 0\r\n\r\nfor i in range(2, len(s)+1):\r\n if check(int(s[l:i])):\r\n ans += i-1\r\n l += 1\r\n\r\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nS=readline().rstrip()\r\nans=0\r\nN=len(S)\r\nfor i in range(N):\r\n if int(S[i])%4==0:\r\n ans+=1\r\nfor i in range(2,N+1):\r\n if int(S[i-2:i])%4==0:\r\n ans+=i-1\r\nprint(ans)", "a = input()\r\nres = [0] * len(a)\r\nfor i in range(len(a)):\r\n tmp = 0\r\n if a[i] in '048':\r\n tmp += 1\r\n if i:\r\n if int(a[i-1:i + 1]) % 4 == 0:\r\n tmp += i\r\n res[i] = res[i - 1] + tmp\r\nprint(res[-1])", "s = input()\nans = sum(int(i) % 4 == 0 for i in s)\n\nfor i in range(1, len(s)):\n\tans += i if int(s[i - 1:i + 1]) % 4 == 0 else 0\n\nprint(ans)", "s=list(map(int,list(input())))\r\nl=[0]len(s)\r\nif s[0]%4==0:l[0]=1\r\nfor i in range(1,len(s)):\r\n\tif s[i]%4==0:\r\n\t\tl[i]+=1\r\n\t\tif s[i-1]%2==0:l[i]+=i\r\n\telif s[i]%2==0 and s[i]%4!=0 and s[i-1]%2==1:l[i]+=i\r\n\tl[i]+=l[i-1]\r\nprint(l[-1])", "def main():\r\n digs = input()\r\n\r\n cnt = 0\r\n\r\n for i in range(len(digs), 1, -1):\r\n if int(digs[i - 1:i]) % 4 == 0:\r\n cnt += 1\r\n\r\n if int(digs[i - 2:i]) % 4 == 0:\r\n cnt += (i - 1)\r\n\r\n if int(digs[0:1]) % 4 == 0:\r\n cnt += 1\r\n\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if(i!=len(s)-1):\r\n if(int(s[i]+s[i+1])%4==0):\r\n ans+=i+1\r\n #print(s[i]+s[i+1],i)\r\n\r\nans+=s.count(\"4\")+s.count(\"8\")+s.count(\"0\")\r\nprint(ans)\r\n", "\r\n\r\nif __name__=='__main__':\r\n string = input()\r\n prev = str(5)\r\n ans = 0\r\n for i in range(len(string)-1,-1,-1):\r\n #print(\"i-> \",i)\r\n num = int(string[i])\r\n if num%4==0:\r\n #print(\"num\",num)\r\n ans += 1\r\n last2 = int(string[i]+prev)\r\n if last2%4==0:\r\n #print(\"last2\",last2)\r\n ans += i+1\r\n prev = string[i]\r\n print(ans)\r\n \r\n \r\n", "#Ashish Sagar\r\ndef countDivisbleby4(s): \r\n n = len(s) \r\n count = 0; \r\n for i in range(0,n): \r\n if (s[i] == '4' or s[i] == '8' or s[i] == '0'): \r\n count += 1\r\n for i in range(0,n - 1): \r\n h = (ord(s[i]) - ord('0')) 10 + (ord(s[i+1]) - ord('0')) \r\n if (h % 4 == 0): \r\n count+= i + 1\r\n return count \r\n \r\ns = list(input())\r\nprint(countDivisbleby4(s)) ", "s = input()\r\n\r\nans = 0\r\na = [0, 0, 0, 0]\r\nnew_a = [0, 0, 0, 0]\r\nfor c in s:\r\n d = int(c) % 4\r\n for i in range(4):\r\n new_a[i] = 0\r\n new_a[d] = 1\r\n for i in range(4):\r\n new_a[(2 * i + d) % 4] += a[i]\r\n a, new_a = new_a, a\r\n ans += a[0]\r\n\r\nprint(ans)\r\n", "ans = 0\r\nl = [int(x) for x in list(input())]\r\nans += [1,0][l[0]%4 != 0]\r\nif len(l)>1:\r\n\tfor i in range(1,len(l)):\r\n\t\tif l[i] % 4 == 0 and l[i-1] % 2 == 0:\r\n\t\t\tans += (i+1)\r\n\t\telif l[i] % 4 != 0 and l[i] % 2 == 0 and l[i-1] % 2 != 0:\r\n\t\t\tans += i\r\n\t\telif l[i] % 4 == 0:\r\n\t\t\tans += 1\r\nprint(ans)", "from sys import stdin , stdout\r\nimport sys , os\r\n\r\ns = stdin.buffer.readline().decode('ascii').rstrip('\\n\\r',)\r\ncount = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n count += 1\r\n\r\n\r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n \r\n count += i\r\n\r\nprint(count)\r\n", "n = input()\r\ns = 0\r\nfor i in range(1, len(n)):\r\n x = ord(n[i]) - ord('0') + 10 * (ord(n[i - 1]) - ord('0'))\r\n if x % 4 == 0:\r\n s += i\r\n if x % 10 % 4 == 0:\r\n s += 1\r\nif (ord(n[0]) - ord('0')) % 4 == 0:\r\n s += 1\r\nprint(s)", "s=input()\r\nans=0;n=len(s)\r\nif int(s[0])%4==0: ans+=1\r\nfor x in range(1,n):\r\n if int(s[x])%4==0: ans+=1\r\n if int(s[x-1]+s[x])%4==0:ans+=x\r\nprint(ans)", "import math\r\nfrom math import \r\ns = input()\r\nans = 0\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(s)):\r\n c2 = int(s[i])\r\n if c2 % 4 == 0:\r\n ans += 1\r\n #++ans\r\n if i == 0:\r\n continue\r\n c1 = int(s[i-1])\r\n if (c110 + c2)%4 == 0:\r\n ans += i\r\nprint(ans)", "s = input()\r\n\r\nnum = 0\r\nfor i in range(len(s) - 1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n num += i + 1\r\n if s[i] in [\"0\", \"4\", \"8\"]:\r\n num += 1\r\n\r\nif s[-1] in [\"0\", \"4\", \"8\"]:\r\n num += 1\r\n\r\nprint(num)", "\ns = input()\n\nresult = 0\nfor i in range(len(s)):\n if (i != 0):\n if ((10int(s[i-1]) + int(s[i])) % 4 == 0):\n result += i\n if (int(s[i]) % 4 == 0):\n result += 1\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input().rstrip()\r\nn = len(s)\r\ns = s[::-1]\r\nans = 0\r\nfor j in range(n):\r\n x = int(s[j])\r\n if x % 4 == 0:\r\n ans += 1\r\n if j + 1 < n:\r\n y = int(s[j + 1])\r\n if (10 y + x) % 4 == 0:\r\n ans += n - j - 1\r\nprint(ans)\r\n", "s = input()\r\nanswer = 0\r\nfor symbol in s:\r\n answer += int(symbol) % 4 == 0\r\nfor i in range(len(s) - 1):\r\n answer += (int(s[i:i + 2]) % 4 == 0) * (i + 1)\r\nprint(answer)\r\n", "s=input()\r\np=0\r\na=[0,4,8]\r\nb=[2,6]\r\nif int(s[0]) in a:\r\n p+=1\r\nfor i in range(1,len(s)):\r\n if int(s[i]) in a:\r\n if int(s[i-1])%2==0:\r\n p+=i+1\r\n else:\r\n p+=1\r\n elif int(s[i]) in b:\r\n if int(s[i-1])%2:\r\n p+=i \r\nprint(p)\r\n \r\n ", "s = input()\r\nans = 0\r\nn = len(s)\r\nfor i in range(n-1):\r\n if int(s[i:i+2])% 4 == 0:\r\n ans+=i+1\r\n if int(s[i]) % 4 == 0:\r\n ans+=1\r\nif int(s[-1])%4==0:\r\n ans+=1\r\nprint(ans)", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#a = [int(x) for x in input().split()]\r\ns = input()\r\nr = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) & 0b11 == 0:\r\n r += 1\r\n if i > 0 and int(s[i-1:i+1]) & 0b11 == 0:\r\n r += i\r\n\r\nprint(r)\r\n", "# from debug import debug\r\nimport sys;input = sys.stdin.readline\r\na = ord('a')\r\ns = input().strip()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n\tif int(s[i])%4 == 0: ans += 1\r\n\tif i-1>=0 and int(s[i-1:i+1])%4 == 0: ans += i\r\nprint(ans)\r\n\r\n", "s = [int(x) for x in input()]\r\nans = 0\r\nif s[0] % 4 == 0:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if s[i] % 4 == 0:\r\n ans += 1\r\n if (s[i] + 10 * s[i - 1]) % 4 == 0:\r\n ans += i\r\nprint(ans)", "l=input()\r\nn=len(l)\r\ncoun=0\r\nfor i in range(0,n-1):\r\n\tif int(l[i]+l[i+1])%4==0:coun+=i+1 \r\n\tif l[i]=='0' or l[i]=='4' or l[i] =='8':coun+=1 \r\nif l[n-1]=='0' or l[n-1]=='4' or l[n-1] == '8':coun+=1\r\nprint(coun)", "# just because of dp tag\r\n\r\ndef main():\r\n # int TC; cin >> TC; while (TC--)\r\n s = input()\r\n n = len(s)\r\n \r\n dp = [[0] * 4 for _ in range(n)]\r\n \r\n for i in range(n):\r\n dp[i][int(s[i]) % 4] += 1\r\n for j in range(4):\r\n x = (j * 10 + int(s[i])) % 4\r\n if i:\r\n dp[i][x] += dp[i - 1][j]\r\n \r\n ans = 0\r\n for i in range(n):\r\n ans += dp[i][0]\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input();\r\nans = 0;\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n ans += 1;\r\nfor i in range(len(s) - 1):\r\n if int(s[i] + s[i+1]) % 4 == 0:\r\n ans += i+1;\r\nprint(ans);", "\r\nnb = input().strip()\r\nn = len(nb)\r\nans = 0\r\nfor i in range(n):\r\n if int(nb[i]) % 4 == 0:\r\n ans += 1\r\n\r\nfor i in range(n - 1):\r\n if int(nb[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\n \r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(xy)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)x\r\npw=lambda x:1 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x2+x)//2\r\nN=109+7\r\n\r\ns=[int(i) for i in S()]\r\nans=1 if s[0]%4==0 else 0\r\np=1\r\nx=s[0]10\r\nfor i in s[1:]:\r\n\tif i%4==0:ans+=1\r\n\tx+=i\r\n\tif x%4==0:ans+=p\r\n\tx=i10\r\n\tp+=1\r\nprint(ans)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(1, n):\r\n if (int(s[i - 1]) * 10 + int(s[i])) % 4 == 0:\r\n ans += i\r\nfor i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\r\nl = 0\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n l+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n l+=(i+1)\r\nprint(l)\r\n", "s=list(input())\r\nif len(s)==1:\r\n if int(s[0])%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n c=0\r\n for i in range(len(s)-2,-1,-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n c+=i+1\r\n for i in range(len(s)):\r\n if int(s[i])%4==0:\r\n c+=1\r\n print(c)", "s = input()\r\ni = len(s) - 1\r\nrez = 0\r\nwhile(i != -1):\r\n\tif(int(s[i]) % 4 == 0):\r\n\t\trez += 1\r\n\tif i == 0:\r\n\t\ti -= 1\r\n\t\tcontinue\r\n\telse:\r\n\t\tif(int(s[i - 1] + s[i]) % 4 == 0):\r\n\t\t\trez += i\r\n\ti -= 1\r\n\r\nprint(rez)\r\n", "s = input()\r\nans = 0\r\nfor i in s:\r\n if i == '0' or i == '4' or i == '8':\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n x = int(s[i] + s[i + 1])\r\n if x % 4 == 0:\r\n ans += (i + 1)\r\nprint(ans)", "n = input()\r\ncount = 0\r\nif len(n) == 1:\r\n if int(n) % 4 == 0:\r\n count += 1\r\nelse:\r\n if int(n[0]) % 4 == 0:\r\n count += 1\r\n for i in range(1, len(n)):\r\n if int(n[i]) % 4 == 0:\r\n count += 1\r\n if int(n[i - 1] + n[i]) % 4 == 0:\r\n count += 1 + ((i - 1) - 0)\r\n\r\nprint(count)\r\n\r\n\r\n", "a = input().strip()\nn = len(a)\ncount = 0\n\nfor i in range(n):\n if int(a[i]) % 4 == 0:\n count += 1\n if i + 1 < n and int(a[i:i+2]) % 4 == 0:\n count += i + 1\n\nprint(count)\n", "def solve(number): \r\n ans = 0\r\n for s in number:\r\n if s == '0' or s == '4' or s == '8':\r\n ans += 1\r\n for i in range(len(number) - 1):\r\n if ((int(number[i]) * 10 + int(number[i+1])) % 4 == 0):\r\n ans += i + 1\r\n print(ans)\r\n\r\n\r\nsolve(input())", "a=input()\r\nl=r=0\r\nfor i in range(len(a)):\r\n t=0\r\n if a[i] in '048':\r\n t+=1\r\n if i:\r\n if int(a[i-1:i+1])%4==0:\r\n t+=i\r\n r=l+t\r\n l=r\r\nprint(r)", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n):\r\n if s[i] == '0' or s[i] == '4' or s[i] == '8':\r\n count += 1\r\n\r\nfor i in range(1, n):\r\n if int(s[i-1:i+1]) % 4 == 0:\r\n count += i\r\n\r\nprint(count)", "x=list(input())\r\ncount=0\r\nfor i in range(len(x)-1):\r\n if((int(x[i])10+int(x[i+1]))%4==0):\r\n count+=i+1\r\n if(int(x[i])%4==0):\r\n count+=1\r\nif(int(x[-1])%4==0):\r\n count+=1\r\nprint(count)", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n c = int(s[i])\r\n if c % 4 ==0:\r\n ans += 1\r\n c1 = int(s[i-1])\r\n if (c110 + c) % 4 == 0:\r\n ans += i\r\nprint(ans)", "n = input()\r\nans = 0\r\n\r\nfor i in range(len(n) - 1):\r\n if int(n[i : i + 2]) % 4 == 0:\r\n ans += i + 1\r\n \r\nfor i in n:\r\n if int(i) % 4==0:\r\n ans += 1\r\n \r\nprint(ans)", "n = input()\r\nA = list(n)\r\nm = len(A)\r\nc = 0\r\nfor i in A:\r\n if int(i)%4 == 0:\r\n c =c+1\r\nfor i in range(m-1):\r\n if (int(A[i]+A[i+1]))%4 == 0:\r\n c =c+(i+1)\r\nprint(c)\r\n", "'''input\n5810438174\n'''\ns = input()\nt = 0\nfor x in range(len(s)-1):\n\tn = int(s[x] + s[x+1])\n\tif n % 4 == 0:\n\t\tt += x + 1\n\tif int(s[x]) % 4 == 0:\n\t\tt += 1\nif int(s[-1]) % 4 == 0:\n\tt += 1\nprint(t)", "import sys\nni = lambda :int(input())\nna = lambda :list(map(int,input().split()))\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\n#######################################################################\n\ns = input()\nans = 0\nn = len(s)\nfor i in range(n):\n if s[i] in \"048\":\n ans += 1\n\nfor i in range(n-1):\n if int(s[i:i+2]) % 4 == 0:\n ans += i + 1\n\nprint(ans)\n\n", "s = input()\ntot = 0\nfor i in range(len(s)):\n if int(s[i])%4==0:\n tot+=1\n if i!= len(s)-1 and int(s[i:i+2])%4==0:\n tot+=i+1\nprint(tot)\n\n\t \t \t\t\t\t\t\t\t\t\t \t \t \t \t \t\t \t", "a = '0'+input()\r\na = a[::-1]\r\nn = len(a)\r\nans = 0\r\nfor i in range(0,n):\r\n if int(a[i])%4==0:\r\n ans += 1\r\n if int(a[i:i+2][::-1])%4==0:\r\n ans += (n-i-2)\r\nprint(ans)\r\n", "import sys\r\n\r\nn, l, c, t = 0, 0, -1, 0\r\n\r\nwhile True:\r\n l = c\r\n c = sys.stdin.read(1)\r\n\r\n if not c or c == '\\n':\r\n break\r\n\r\n c = int(c)\r\n if c % 4 == 0:\r\n t += 1\r\n\r\n if l >= 0 and (l * 10 + c) % 4 == 0:\r\n t += n\r\n\r\n n += 1\r\n\r\nprint(t)\r\n", "import sys\r\ns = sys.stdin.readline()\r\nl = len(s)-1\r\nf = [0 for i in range(l)]\r\nif (int(s[0]) % 4 == 0): f[0] = 1\r\nfor i in range(1,l):\r\n f[i] = f[i-1]\r\n if (int(s[i]) % 4 == 0):\r\n f[i] += 1\r\n if (int(s[i-1]) % 2 == 0): f[i] += i\r\n elif (int(s[i]) % 2 == 0):\r\n if (int(s[i-1]) % 2 == 1): f[i] += i\r\nsys.stdout.write(str(f[l-1]))", "s=input()\r\nans=0\r\nfor i in range(len(s)-1):\r\n if int(s[i:i+2])%4==0:\r\n ans+=i+1\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans+=1\r\n\r\nprint(ans) \r\n", "\r\n# If you win, you live. You cannot win unless you fight.\r\n\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict as unsafedict,deque,Counter as unsafeCounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, floor,log2,factorial,radians,sin,cos\r\nrandom = randint(1, 10 9)\r\nmod=109+7\r\ndef ceil(a,b):\r\n\treturn (a+b-1)//b\r\nclass myDict:\r\n\tdef __init__(self,func):\r\n\t\tself.RANDOM = randint(0,1<<32)\r\n\t\tself.default=func\r\n\t\tself.dict={}\r\n\tdef __getitem__(self,key):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tif myKey not in self.dict:\r\n\t\t\tself.dict[myKey]=self.default()\r\n\t\treturn self.dict[myKey]\r\n\tdef get(self,key,default):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tif myKey not in self.dict:\r\n\t\t\treturn default\r\n\t\treturn self.dict[myKey]\r\n\tdef __setitem__(self,key,item):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tself.dict[myKey]=item\r\n\tdef getKeys(self):\r\n\t\treturn [self.RANDOM^i for i in self.dict]\r\n\tdef __str__(self):\r\n\t\treturn f'{[(self.RANDOM^i,self.dict[i]) for i in self.dict]}'\r\n\r\n\r\ns=rs()\r\ncnt=int(s[0])%4==0\r\nfor i in range(1,len(s)):\r\n\tif int(s[i])%4==0:\r\n\t\tcnt+=1\r\n\tif int(s[i-1]+s[i])%4==0:\r\n\t\tcnt+=(i)\r\nprint(int(cnt))\r\n", "import math\r\nstr_in = \"\"\r\nstr_in = input()\r\ncount = 0\r\nlen_s = len(str_in)\r\ni = len_s-1\r\ncurr_i = len_s\r\nwhile i >= 0:\r\n if curr_i - i == 2:\r\n if (int(str_in[i:curr_i]) % 4 == 0):\r\n \r\n count = count + 1 + i\t\t \t\t\r\n curr_i = i + 1\r\n else:\r\n if(int(str_in[i:curr_i]) % 4 == 0):\r\n count = count + 1\r\n \r\n i = i - 1 \r\n \r\nprint(count)\r\n", "s = input()\r\nant = 0\r\nif int(s[0]) % 4 == 0 : ant += 1\r\nfor i in range(1,len(s)):\r\n if int(s[i]) %4 == 0: ant += 1\r\n if int(s[i-1] + s[i]) % 4 == 0: ant += i\r\nprint(ant)", "a=input()\r\ns=\"0,4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,00,04,08\"\r\ns=list(s.split(','))\r\ncount=0\r\nfor i in range(len(a)):\r\n\tfor j in range(len(s)):\r\n\t\tif len(s[j])==1 and a[i]==s[j]:\r\n\t\t\tcount+=1\r\n\t\tif len(s[j])==2:\r\n\t\t\t# print(a[i]+a[i+1])\r\n\t\t\tif (i+1)<len(a) and s[j]==(a[i]+a[i+1]):\r\n\t\t\t\tcount+=(i+1)\r\n\t\t\t\t# print(\"sd\")\r\nprint(count)", "s=input()\r\nc=0\r\nfor i in range(len(s)-1):\r\n if int(s[i])%4==0:\r\n c+=1\r\n if int(s[i:i+2])%4==0:\r\n c+=i+1\r\nif int(s[-1])%4==0:\r\n c+=1\r\nprint(c)", "s = input()\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '0' or s[i] == '4' or s[i] == '8':\r\n ans += 1\r\n if i > 0 and int(s[i-1:i+1]) % 4 == 0:\r\n ans += i\r\n\r\nprint(ans)", "s=input()\r\ncount=0\r\nfor i in range(len(s)-1):\r\n if(int(s[i:i+2])%4==0):\r\n count+=i+1\r\n if(int(s[i])%4==0):\r\n count+=1\r\nif(int(s[-1])%4==0):\r\n count+=1\r\nprint(count)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "n=input()\r\nn+='~'\r\nc=0\r\nif int(n[0])%4==0:\r\n c+=1\r\nfor i in range(1,len(n)-1):\r\n if int(n[i])%4==0:\r\n c+=1\r\n if int(n[i-1:i+1])%4==0:\r\n c+=(i)\r\nprint(c) ", "n_str = input()\ncount = 0\ntotal = 0\n\ndef is_div(num):\n return int(num) % 4 == 0\n\nfor j in n_str:\n if is_div(j):\n total += 1\n \nfor i in range(0,len(n_str)-1):\n if is_div(n_str[i:i+2]):\n total += i+1\n \nprint(total)\n\t\t\t \t\t \t \t \t \t\t\t \t \t \t", "p = input()\r\ncount = 0\r\nfor i in range(len(p)):\r\n if int(p[i])%4 == 0:\r\n count += 1\r\n if i >= 1 and int(p[i-1:i+1])%4 == 0:\r\n count += i\r\nprint(count)\r\n\r\n", "s=input()\r\ncount=0\r\nfor i in range(0,len(s)):\r\n\tif int(s[i])%4==0:\r\n\t\tcount+=1\r\nfor i in range(0,len(s)-1):\r\n\tif (int(s[i])10+int(s[i+1]))%4==0:\r\n\t\tcount+=i+1\r\nprint(str(count))", "#!/usr/bin/python3\n\ns = input()\n# s = '124'\nn = len(s)\n\nans = 0\n\nfor i in reversed(range(1, n)):\n\tif int(s[i])%2 == 0:\n\t\tif int(s[i-1:i+1])%4 == 0:\n\t\t\tans += i\n\t\tif int(s[i])%4 == 0:\n\t\t\tans += 1\n\nif int(s[0])%4 == 0: ans += 1\n\nprint(ans)\n", "s = input()\r\n\r\nans = 0\r\nfor i in range(1, len(s)):\r\n if int(s[i - 1: i + 1]) % 4 == 0:\r\n ans += i\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\ns = inp()\r\nans = 0\r\nif int(s[0]) % 4 == 0:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if int(s[i - 1: i + 1]) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "s = input()\nsLen = len(s)\nanswer = 0\n\nfor i in range(sLen-1, -1, -1):\n if int(s[i]) % 4 == 0:\n answer += 1\n\n if i-1 == -1:\n break\n\n if int(s[i-1] + s[i]) % 4 == 0:\n answer += i\nprint(answer)\n \n \t \t\t \t \t \t \t \t \t\t \t\t", "from sys import stdin\r\ninput=lambda : stdin.readline()\r\nfrom math import ceil,sqrt,gcd\r\ns=list(map(int,list(input().strip())))\r\nsu=s.count(0)+s.count(4)+s.count(8)\r\nfor i in range(len(s)-1,0,-1):\r\n\tif (10s[i-1]+s[i])%4==0:\r\n\t\tsu+=i\r\nprint(su)", "import math \n\ns = (input())\nsum = 0\nif int(s[0])%4==0:\n sum=1\nfor i in range(1,len(s)):\n if int(s[i])%4==0:\n sum += 1\n if ((int(s[i-1])10+int(s[i]))%4)==0:\n sum+=i\nprint(sum)\n", "\r\n\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n # t = int(input())\r\n # for _ in range(t):\r\n #q = int(input())\r\n #a, b = list(map(int, input().split()))\r\n #a = list(map(int, input().split()))\r\n s = input()\r\n l = len(s)\r\n ans = 0\r\n if int(s[0])%4 == 0:\r\n ans+=1\r\n\r\n for i in range(1,l):\r\n if int(s[i])%4 == 0:\r\n ans+=1\r\n if int(s[i-1]+s[i])%4 == 0:\r\n ans+= i\r\n\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = input()\r\nans = 0\r\nfor c in s :\r\n ans += int(c)%4 == 0\r\nfor i in range(0,len(s)-1) :\r\n ans += (int(s[i:i+2])%4==0) (i+1)\r\nprint(ans)", "s=input()\r\nc=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n c+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n c+=(i+1)\r\nprint(c)", "s=input()\r\nans=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans+=i+1\r\nprint(ans)\r\n ", "t=input()\r\nans=0\r\nfor i in range(len(t)):\r\n if int(t[i])%4==0:\r\n ans+=1\r\nfor i in range(1,len(t)):\r\n if int(t[i-1:i+1])%4==0:\r\n ans+=i\r\nprint(ans)", "string = input()\r\nsum = 0\r\n\r\nfor x in range(len(string)):\r\n if int(string[x]) % 4 == 0:\r\n sum += 1\r\n if x > 0:\r\n if int(string[x-1]) % 2 == 0:\r\n sum += x\r\n elif int(string[x]) % 4 == 2 and x > 0:\r\n if int(string[x-1]) % 2 == 1:\r\n sum += x\r\n\r\nprint(sum)", "a=input()\r\nl=r=0\r\nfor i in range(len(a)):\r\n r=l+(a[i]in'048')+i(i and int(a[i-1:i+1])%4==0) \r\n l=r\r\nprint(r)", "s = input()+\"1\"\nx = 0\nfor i in range(len(s)):\n if int(s[i:i+2])%4 == 0:\n x+=(i+1) \n if s[i] in [\"0\", \"4\", \"8\"]:\n x+=1\nprint(x)\n \t\t\t \t\t\t\t \t \t \t \t \t\t", "import math\r\nimport bisect\r\nimport sys\r\nfrom collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\n# T = inp()\r\n# for t in range(T):\r\n# N, M = invr()\r\n# A = inlt()\r\nS = insr()\r\n# print(len(S))\r\nout = 0\r\nfor i in range(len(S)-1):\r\n\tif int(S[i])%4 == 0:\r\n\t\tout += 1\r\n\tif int(S[i]+S[i+1])%4 == 0:\r\n\t\tout += i+1\r\nif int(S[-1])%4 == 0:\r\n\tout += 1\r\nprint(out)", "def solve(a):\r\n ans=0\r\n for i in range(len(a)):\r\n if int(a[i])%4==0:\r\n ans+=1\r\n i=0\r\n while i+2<=len(a):\r\n tmp=int(a[i])10+int(a[i+1])\r\n if tmp%4==0:\r\n ans+=i+1\r\n i+=1\r\n return ans\r\n\r\na=input()\r\nprint(solve(a))\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-1,-1,-1):\r\n b = int(s[i])\r\n if b%4==0:\r\n ans+=1\r\n if i:\r\n a = int(s[i-1])\r\n num = a10+b\r\n if num%4==0:\r\n ans+=i\r\nprint(ans)", "def main():\n s = input()\n res = 0\n for elem in s:\n if int(elem) % 4 == 0:\n res += 1\n for i in range(len(s) - 1):\n if int(s[i:i + 2]) % 4 == 0:\n res += i + 1\n print(res)\n \nmain()", "import sys\ninput=sys.stdin.readline\nnum=input().strip()\nsubs=0\nx=len(num)\nfor i in range(x-1):\n if int(num[x-1-i])%4==0:\n subs+=1\n if int(num[x-2-i:x-i])%4==0:\n subs+=x-1-i\nif int(num[0])%4==0:\n subs+=1\nprint(subs)\n \t\t\t\t \t\t\t \t \t \t\t \t\t \t\t \t \t", "def solve(num):\n res = 0\n\n l = len(num)\n\n for n in num:\n if int(n)% 4 == 0: res+=1\n \n for i in range(l-1):\n l2 = num[i]+ num[i+1]\n\n if int(l2)%4 == 0: res+=(i+1)\n \n\n return res\n\nnum = input()\n\nprint(solve(num))\n", "import math\r\n \r\ndef main():\r\n n = list(input())\r\n ans = 0\r\n for i in range(0,len(n)):\r\n if( int(n[i]) % 4 == 0):\r\n ans += (1)\r\n for i in range(0,len(n) - 1):\r\n if( (int(n[i])10 + int(n[i+1]) ) % 4 == 0):\r\n ans += (i+1)\r\n print(ans)\r\nif __name__ == '__main__':main()", "def f():\r\n ans = 0\r\n s = input()\r\n n = len(s)\r\n whitelist = [\"0\", \"2\", \"6\", \"4\", \"8\"]\r\n for i in range(n - 1, -1, -1):\r\n if s[i] in whitelist:\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n suf = int(s[i - 1: i + 1])\r\n if suf % 4 == 0:\r\n ans += i\r\n return ans\r\n \r\n \r\n \r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n print(f())", "s = input()\r\nans = 0\r\nfor i in s:\r\n if i in ['0', '4', '8']:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if (10 * int(s[i-1]) + int(s[i])) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n# -- coding: utf-8 --\n\"\"\"\nCreated on Sun Jun 28 11:11:00 2020\n\n@author: shailesh\n\"\"\"\n\ns = input()\n\n\ncount = 0\nfor i in s:\n if int(i)%4 == 0:\n count +=1\n\nfor i in range(len(s) - 1):\n l2_digits = int(s[i:i+2])\n# print(l2_digits,i)\n if l2_digits%4 == 0:\n count += i+1\n\nprint(count)", "s = input()+\"1\"\ndiv4 = {\"00\", \"04\", \"08\", \"12\", \"16\", \"20\", \"24\", \"28\", \"32\", \"36\", \"40\", \"44\", \"48\", \"52\",\n \"56\", \"60\", \"64\", \"68\", \"72\", \"76\", \"80\", \"84\", \"88\", \"92\", \"96\"}\ndiv42 = {\"0\", \"4\", \"8\"}\nx = 0\nfor i in range(len(s)):\n if s[i:i+2] in div4:\n x+=(i+1)\n \n if s[i] in div42:\n x+=1\nprint(x)\n \t \t\t \t\t \t \t \t \t\t\t \t\t", "s = input()\nans = 0\nif int(s[0])%4==0:\n\tans += 1\nfor i in range(1,len(s)):\n\tif int(s[i-1]+s[i])%4==0:\n\t\tans += i\n\tif int(s[i])%4==0:\n\t\tans += 1\nprint (ans)", "s = input()\nans = 0\nfor i in range(len(s)):\n if int(s[i]) % 4 == 0:\n ans += 1\n if i >= 1 and int(s[i-1:i+1]) % 4 == 0:\n ans += i\nprint(ans)\n", "s = input()\r\nans = 0\r\nfor i in range(0, len(s) - 1):\r\n if int(s[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nif int(s[len(s) - 1]) % 4 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\ns=input() \r\nans=0\r\nfor i in s:\r\n if i in '048' :\r\n ans+=1\r\n \r\nn=len(s)-1\r\n\r\nfor i in range(n-1):\r\n x=int(s[i])10+int(s[i+1])\r\n if x%4==0 :\r\n ans+=(i+1)\r\n \r\nprint(ans)\r\n\r\n", "from collections import defaultdict\r\ns = input()\r\nvalid = defaultdict(lambda: False)\r\nvalid['00'] = True\r\nvalid['04'] = True\r\nvalid['08'] = True\r\nfor i in range(12, 101, 4):\r\n valid[str(i)] = True\r\nans = 0\r\nfor i in range(0, len(s)-1):\r\n temp = s[i]+s[i+1]\r\n if(valid[temp] == True):\r\n ans += i+1\r\n if(s[i] == '4'):\r\n ans += 1\r\n elif(s[i] == '8'):\r\n ans += 1\r\n elif(s[i] == '0'):\r\n ans += 1\r\n# print(ans)\r\nif(s[len(s)-1] == '4'):\r\n ans += 1\r\nelif(s[len(s)-1] == '8'):\r\n ans += 1\r\nelif(s[len(s)-1] == '0'):\r\n ans += 1\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n s = input()\r\n n = 0\r\n if int(s[0]) % 4 is 0:\r\n n += 1\r\n for i, c in enumerate(s[1:]):\r\n ch = s[i] + c\r\n if int(c) % 4 is 0:\r\n n += 1\r\n if int(ch) % 4 is 0:\r\n n += i+1\r\n print(n)", "n = input()\r\ncount = [n.count(\"4\"),n.count(\"0\"),n.count(\"8\")]\r\nans = sum(count)\r\nfor i in range(1,len(n)):\r\n\r\n\tif int(n[i-1]+n[i])%4 == 0:\r\n\t\tans = ans + i\r\n\r\nprint(ans)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ns = input()\r\nn = len(s)\r\nres = 0\r\nres += s.count(\"0\")\r\nres += s.count(\"4\")\r\nres += s.count(\"8\")\r\nfor i in range(n-1):\r\n subarray = s[i:i+2]\r\n if subarray == \"00\" or (int(subarray) % 4 == 0 and int(subarray) >= 4):\r\n res += i + 1\r\nprint(res)\r\n", "s = input()\r\nn = len(s)\r\nc = 0\r\nfor i in range(n):\r\n if i < n-1 and int(s[i]+s[i+1]) % 4 == 0:\r\n c += i+1\r\n if int(s[i]) % 4 == 0:\r\n c += 1\r\nprint(c)\r\n", "s=input()\r\ncnt=0 \r\nn=len(s)\r\nfor i in range(1,n):\r\n a=int(s[i-1]+s[i])\r\n if a%4==0:\r\n cnt+=(i)\r\nprint(cnt+sum(int(i)%4==0 for i in s))", "s = input()\r\n\r\nn = len(s)\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n v = int(s[i])\r\n if v % 4 == 0:\r\n res += 1\r\n\r\nfor i in range(n-1):\r\n v = int(s[i:i+2])\r\n if v % 4 == 0:\r\n res += 1 + i\r\n\r\nprint(res)\r\n", "s = input()\nn = len(s)\nt = 0\nfor i in s:\n if i == \"4\" or i == \"8\" or i == \"0\":\n t += 1\nfor i in range(n - 1):\n x = s[i:i + 2]\n if int(x) % 4 == 0:\n t += i + 1\nprint(t)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nc = 0\r\nfor i in range(n-1, 0, -1):\r\n if s[i] in ['0', '4', '8']:\r\n c += 1\r\n if (s[i] in ['0', '4', '8'] and int(s[i-1])%2 == 0) or (s[i] in ['2', '6'] and int(s[i-1])%2):\r\n c += i\r\nif s[0] in ['0', '4', '8']:\r\n c += 1\r\nprint(c)", "# -- coding: utf-8 --\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nimport math\r\n\r\ns=input()\r\nans=0\r\nfor i in range(len(s)-1):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\n r=\"\"+s[i]+s[i+1]\r\n if int(r)%4==0:\r\n ans=ans+i+1\r\nif int(s[len(s)-1])%4==0:\r\n ans=ans+1\r\nprint(ans)\r\n\r\n ", "#!/usr/bin/python3.5\r\nn=input()\r\nc=0\r\nif n[0]=='0' or n[0]=='4' or n[0]=='8':\r\n c+=1\r\nfor i in range(1,len(n)):\r\n if n[i]=='0' or n[i]=='4' or n[i]=='8':\r\n c+=1\r\n if int(n[i-1:i+1])%4==0:\r\n c+=i\r\nprint(c)", "import sys\nimport math\n\ninput = sys.stdin.readline\n\ndef inInt():\n return int(input())\n\ndef inStr():\n return input().strip(\"\\n\")\n\ndef inIList():\n return (list(map(int, input().split())))\n\ndef inSList():\n return (input().split())\n\n#########################################\n\n\ndef solve(s):\n ret = 0\n N = len(s)\n for i in range(N):\n d = int(s[i])\n if d % 4 == 0:\n ret = ret + 1\n if i >= 1:\n p = int(s[i - 1])\n if (p 10 + d) % 4 == 0:\n ret = ret + i\n print(ret)\n\ns = inStr()\nsolve(s)", "s=input()\r\nans=0\r\nif int(s[0])%4==0 :\r\n ans+=1\r\nfor i in range(1,len(s)):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n t=int( s[i-1:i+1])\r\n if t%4==0:\r\n ans+=i\r\n \r\n \r\nprint(ans)\r\n \r\n \r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ns=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n if i>0 and int(s[i-1]+s[i])%4==0:\r\n ans+=i\r\nprint(ans)", "s=input()\r\nn=len(s)\r\nans=0\r\nif int(s[0])%4==0:\r\n ans=1\r\nfor i in range(1,n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\n if int(s[i-1]+s[i])%4==0:\r\n ans=ans+i\r\nprint(ans)\r\n\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\n\r\nfor i in range(0,n):\r\n if(i>0 and (((ord(s[i-1])-ord('0'))10 + (ord(s[i])-ord('0')))%4==0)):\r\n ans += i\r\n if((ord(s[i])-ord('0'))%4==0):\r\n ans+=1\r\n \r\nprint(ans)", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(1,n):\r\n if int(s[i-1:i+1])%4==0:\r\n ans+=i\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans+=1\r\nprint(ans)", "def main():\r\n n = input()\r\n l = len(n)\r\n ans = 0\r\n for i in range(l):\r\n if(n[i] in ['0', '4', '8']):\r\n ans+=1\r\n for i in range(l-1):\r\n if(int(n[i]+n[i+1])%4==0):\r\n ans+=i+1\r\n print(ans)\r\nmain()\r\n", "\r\nfrom sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\n\r\ndef cd4(s):\r\n\tc=0\r\n\tn=len(s)\r\n\tfor i in range(n):\r\n\t\tif s[i]=='0' or s[i]=='4' or s[i]=='8':\r\n\t\t\tc+=1\r\n\tfor i in range(n-1):\r\n\t\tif (int(s[i])10+int(s[i+1]))%4==0:\r\n\t\t\tc+=i+1\r\n\treturn c\r\n\r\ns=input()\r\nprint(cd4(s))\r\n", "word = input()\r\nn = len(word)\r\ncnt = 0\r\nfor i in word:\r\n\tif int(i)%4==0:\r\n\t\tcnt+=1\r\nfor i in range(1,n):\r\n\tif int(word[i-1]+word[i])%4==0:\r\n\t\tcnt+=(i)\r\nprint(cnt)\r\n", "s=input()\r\nif len(s)==1:\r\n if int(s[0])%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n n=len(s)\r\n dp=0\r\n if int(s[0])%4==0:\r\n dp=dp+1\r\n for i in range(1,n):\r\n if int(s[i])%4==0:\r\n dp=dp+1\r\n if int(s[i-1:i+1])%4==0:\r\n dp=dp+i\r\n print(dp)\r\n", "# aadiupadhyay\r\nimport sys\r\nfrom collections import \r\nimport os.path\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef solve():\r\n s = st()\r\n ans = 0\r\n n = len(s)\r\n for i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i+1 < n:\r\n a = int(s[i]+s[i+1])\r\n if a % 4 == 0:\r\n ans += i+1\r\n pr(ans)\r\n\r\n\r\nsolve()\r\n", "from collections import Counter, defaultdict, deque\nfrom bisect import bisect_left, bisect_right\nfrom heapq import heapify, heappush, heappop\nfrom functools import cache, lru_cache\n\n\ndef solve():\n s = input()\n n = len(s)\n\n res = 0\n for i in range(1, n + 1):\n res += int(int(s[i - 1]) % 4 == 0)\n if i > 1:\n if int(s[i - 2] + s[i - 1]) % 4 == 0:\n res += i - 1\n print(res)\n\nsolve()\n", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n n = int(s[i])\r\n if n % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n n = int(s[i - 1] + s[i])\r\n if n % 4 == 0:\r\n ans += i\r\nprint(ans)", "s=input()\r\nif len(s)==1:\r\n if int(s)%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n cnt=0\r\n for i in range(len(s)-1,0,-1):\r\n if int(s[i])%4==0:\r\n cnt+=1\r\n if int(s[i-1:i+1])%4==0:\r\n cnt+=i\r\n if int(s[0])%4==0:\r\n cnt+=1\r\n print(cnt)", "s = input()\r\n\r\nr = 0\r\nfor i, c in enumerate(s):\r\n if int(c) % 4 == 0:\r\n r += 1\r\n if i == 0:\r\n continue\r\n if int(s[i-1:i+1]) % 4 == 0:\r\n r += i\r\nprint(r)\r\n ", "n = input()\nans = 0\n\n# dig = 1\nfor i in range(len(n)):\n if(int(n[i])%4 == 0):\n ans += 1\n\n# dig = 2]\nfor i in range(1, len(n)):\n if(int(n[i-1]+n[i])%4 == 0):\n ans += 1 + i-1\nprint(ans)\n \n\n\t\t\t \t \t\t \t \t \t\t \t\t \t\t\t \t", "l = list(map(int, input()))\r\nc = 0\r\nn = len(l)\r\nfor i in range(n-1):\r\n if l[i] % 4 == 0 :\r\n c+=1\r\n if (l[i] % 2 == 0 and l[i+1] in [0,4,8]) or (l[i] % 2 != 0 and l[i+1] in [2,6]):\r\n c += i+1\r\nif l[n-1] % 4 == 0:\r\n c+=1\r\nprint(c)", "s = input()\r\nans = 0\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n if int(s[i - 1] + s[i]) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "\nif __name__ == \"__main__\":\n number = input()\n count = number.count('0') + number.count('4') + number.count('8')\n for i in range(1,len(number)):\n n = number[i-1: i+1]\n if int(n) % 4 == 0:\n count += i\n print(count)\n\n\t\t \t\t\t \t\t\t\t\t \t \t \t \t", "def func(s,n):\r\n count=0\r\n for i in range(n-1):\r\n if int(s[i])%4==0:\r\n count+=1\r\n string=s[i]+s[i+1]\r\n if int(string)%4==0:\r\n count+=(i+1)\r\n if int(s[n-1])%4==0:\r\n count+=1\r\n return count \r\n\r\ns=input()\r\nn=len(s)\r\ncount=func(s,n)\r\nprint(count)", "s = input();\r\n\r\nn = len(s);\r\n\r\nt = 0;\r\n\r\nif s[0]=='0' or s[0]=='4' or s[0]=='8' :\r\n t+=1;\r\n\r\n\r\nfor x in range(1,n) :\r\n if s[x]=='0' or s[x]=='4' or s[x]=='8' :\r\n t+=1;\r\n\r\n m = ((ord(s[x-1]))-48)10 + (ord(s[x]))-48;\r\n\r\n if m%4==0 :\r\n t+=x;\r\n\r\nprint(t);\r\n \r\n", "s=input()\r\ncnt = 0\r\nn=len(s)\r\nfor i in s:\r\n if(int(i)%4==0):\r\n cnt+=1\r\nfor i in range(1,n):\r\n t=int(s[i-1])10+int(s[i])\r\n if(t%4==0):\r\n cnt+=i\r\nprint(cnt)\r\n", "possible = [\"00\",\"04\",\"08\"] + [ str(4i) for i in range(3,25) ]\n\nfrom sys import stdin; s = stdin.readline()\ncount = 0\n\nfor i in s:\n\tif i in ['0','4','8']:\n\t\tcount += 1\n\nfor i in range(len(s)-1):\n\tif s[i:i+2] in possible:\n\t\tcount += i+1\n\nprint(count)", "s = list(str(input()))\r\nn = len(s)\r\nans = 0\r\nfor c in s:\r\n c = int(c)\r\n if c%4 == 0:\r\n ans += 1\r\nfor i in range(n-1):\r\n x = 10int(s[i])+int(s[i+1])\r\n if x%4 == 0:\r\n ans += i+1\r\nprint(ans)\r\n", "k=input();s=0+(int(k[0])%4==0)\r\nfor i,j in enumerate(k[1:]):\r\n if int(j)%4==0:s+=1\r\n if int(k[i]+j)%4==0:s+=i+1\r\nprint(s)\r\n", "from math import \r\ns = input()\r\nn = len(s)\r\nans = o = e = 0\r\nfor i in range(n):\r\n\tif(s[i] == '4' or s[i] == '8' or s[i] == '0'):\r\n\t\tans += 1\r\n\t\tif(i > 0 and int(s[i-1])%2 == 0):\r\n\t\t\tans += i\r\n\telif(s[i] == '2' or s[i] == '6'):\r\n\t\tif(i > 0 and int(s[i-1])%2 == 1):\r\n\t\t\tans += i\r\nprint(ans)", "#n,m,k = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#a = list(map(int, input().strip().split(' ')))\r\ns=input()\r\nc=0\r\nfor j in range(len(s)):\r\n s1=int(s[j])\r\n if s1%4==0:\r\n c+=1\r\nfor j in range(len(s)-1):\r\n s1=int(s[j:j+2])\r\n if s1%4==0:\r\n c+=j+1\r\nprint(c)\r\n ", "s = input()\r\nsdc = 0\r\n\r\n#Checking for 0th index character\r\nif int(s[0])%4==0:\r\n sdc +=1\r\n\r\n#Iterating from index 1 to n-1\r\nfor i in range(1,len(s)):\r\n #If the single character is divisible by 4\r\n if s[i]=='0' or s[i]=='4' or s[i]=='8':\r\n sdc +=1\r\n\r\n #If the 2 character number is divisible by 4\r\n if int(s[i-1:i+1])%4==0:\r\n sdc += i\r\n \r\nprint( sdc)", "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/628/B\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\nfrom itertools import permutations, combinations\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n s = input().strip()\r\n n = len(s)\r\n count = 0\r\n for i in s:\r\n if int(i) % 4 == 0:\r\n count += 1\r\n for i in range(1, n):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n count += i\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n=input()\r\n L=list(n)\r\n res=0\r\n for i in range(len(n)-1):\r\n digit1=L[i]\r\n digit2=L[i+1]\r\n if int(digit1)%4==0: \r\n res+=1\r\n \r\n if int(digit1+digit2)%4==0:\r\n res+=i+1\r\n \r\n if int(L[-1])%4==0:\r\n res+=1\r\n \r\n print(res)\r\nmain()\r\n", "\r\ns=input()\r\ndp=[]\r\ndp.append(0)\r\nfor i in range(len(s)):\r\n if (int(s[i]))%4==0:\r\n dp.append(dp[i]+1)\r\n else:\r\n dp.append(dp[i])\r\n if (i>0) and ((int(s[i-1]+s[i]))%4==0):\r\n dp[i+1]=dp[i+1]+i\r\n \r\nprint(dp[len(s)]) ", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if (int(s[i]) % 4 == 0):\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n if (int(s[i]) * 10 + int(s[i + 1])) % 4 == 0:\r\n ans += (i + 1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\nn= len(s)\r\nans=0\r\nn-=1\r\n\r\nfor j in range(n):\r\n \r\n p=s[j]\r\n if int(p)%4==0:\r\n ans+=1\r\n\r\n if j>=1:\r\n if int(s[j-1]+s[j])%4==0:\r\n ans+=j\r\n \r\nprint(ans)\r\n", "import sys\n\ns = input()\nn = 0\nfor i in range(len(s) - 1):\n if (int(s[i]) / 4).is_integer():\n n += 1\n if (int(s[i] + s[i + 1]) / 4).is_integer():\n n += i + 1\nif (int(s[-1]) / 4).is_integer():\n n += 1\nprint(n)\n", "q=input()\r\nt=q.count('0')+q.count('4')+q.count('8')\r\nw=len(q)\r\nfor i in range(w-1):\r\n if int(q[w-i-2]+q[w-i-1])%4==0:\r\n t+=w-i-1\r\nprint(t)", "n = input().strip()\r\nD = [0]len(n)\r\nif len(n) >= 2:\r\n if int(n[0]) % 4 == 0:\r\n D[0] += 1\r\n if int(n[1]) % 4 == 0:\r\n D[1] += 1\r\n if int(n[0:2]) % 4 == 0:\r\n D[1] += 1\r\n D[1] += D[0]\r\n for i in range(2,len(n)):\r\n D[i] = D[i-1]\r\n if int(n[i]) % 4 == 0:\r\n D[i] += 1\r\n if int(n[i-1:i+1]) % 4 == 0:\r\n D[i] += i\r\nelse:\r\n if int(n) % 4 == 0:\r\n D[0] += 1\r\nprint(D[-1])\r\n", "st=input()\r\nl=len(st)\r\nc=0\r\nfor i in range(l-2,-1,-1):\r\n m=int(st[i])\r\n n=int(st[i+1])\r\n k=m10+n\r\n if(k%4==0):\r\n c=c+i+1\r\nfor j in range(0,l):\r\n a=int(st[j])\r\n if(a%4==0):\r\n c=c+1\r\nprint(c)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(1,n):\r\n x = 10int(s[i-1]) + int(s[i])\r\n if x%4==0:\r\n ans += i\r\nfor d in s:\r\n if int(d)%4==0:\r\n ans += 1\r\nprint(ans)", "from sys import stdin, stdout\n\ndef main():\n s = stdin.readline().rstrip()\n\n count = 0\n for i, e in enumerate(s):\n if int(e) % 4 == 0:\n count += 1\n if i >= 1:\n if int(s[i - 1: i + 1]) % 4 == 0:\n count += i\n stdout.write(f'{count}\\n')\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nnum = 0\r\nfor i in range(0,len(s)-1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n num += i+1\r\n if int(s[i]) % 4 == 0:\r\n num += 1\r\nif int(s[-1]) % 4 == 0:\r\n num += 1\r\nprint(num)\r\n", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n c+=1\r\n \r\nfor i in range(1,n):\r\n if int(s[i-1]+s[i])%4==0:\r\n c+=i\r\n \r\nprint(c)", "def isFactor(s):\r\n return int(s) % 4 == 0\r\n\r\ns = input()\r\nans = 0\r\nfor index in range(1, len(s)):\r\n if isFactor(s[index - 1] + s[index]):\r\n ans += index\r\nfor ch in s:\r\n if ch == '0' or ch == '4' or ch == '8':\r\n ans += 1\r\nprint(ans)", "s='0'+input();n=len(s);count=0\r\nfor i in range(1,n):\r\n if s[i] in '048' and not int(s[i-1])%2:count+=i\r\n if s[i] in '048' and int(s[i-1])%2:count+=1\r\n if s[i] in '26' and int(s[i-1])%2:count+=i-1\r\nprint(count)", "s = str(input())\r\nn = len(s)\r\nc = 0\r\nfor i in range(n):\r\n if s[i] in ['0', '4', '8']:\r\n c += 1\r\n\r\nfor i in range(n-1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n c += (i+1)\r\n \r\nprint(c)", "def solution():\r\n s = input()\r\n l_s = len(s)\r\n count = 1 if not int(s[0]) % 4 else 0\r\n for i in range(1, l_s):\r\n t = 0\r\n a = int(s[i])\r\n b = int(s[i-1])\r\n if not a % 4:\r\n t += 1\r\n t1 = a + 10 b\r\n if not t1 % 4:\r\n t += 1 + (i-1)\r\n count += t\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "s = input()\ndivisible = [False for _ in range(len(s) - 1)]\nfor i in range(1, len(s)):\n\tif int(s[i - 1] + s[i]) % 4 == 0:\n\t\tdivisible[i - 1] = True\ncount = 0\nfor i in range(len(s) - 1):\n\tif divisible[i]:\n\t\tcount += i + 1\nfor i in range(len(s)):\n\tif int(s[i]) % 4 == 0:\n\t\tcount += 1\nprint(count)\n", "s = input().rstrip()\r\nans = sum(int(i) % 4 == 0 for i in s)\r\nn = len(s)\r\nfor i in range(n - 1):\r\n ans += (int(s[i:i+2]) % 4 == 0) * (i + 1)\r\n\r\nprint(ans)", "\r\ndef countDivisbleby4(s):\r\n n = len(s)\r\n count = 0;\r\n for i in range(0, n, 1):\r\n if (s[i] == '4' or s[i] == '8' or s[i] == '0'):\r\n count += 1\r\n for i in range(0, n - 1, 1):\r\n h = (ord(s[i]) - ord('0')) * 10 + (ord(s[i + 1]) - ord('0'))\r\n if (h % 4 == 0):\r\n count = count + i + 1\r\n return count\r\nif __name__ == '__main__':\r\n s = input()\r\n a = []\r\n for i in range(0, len(s)):\r\n a.append(s[i])\r\n print(countDivisbleby4(a))\r\n", "import sys\r\ninput=sys.stdin.readline\r\ns=input().strip()\r\nans=0\r\nfor i in range(len(s)):\r\n if int (s[i])%4==0:\r\n ans+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i:i+2])%4==0:\r\n ans+=(i+1)\r\nprint(ans)\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ns = list(input())\r\nans = 0; s.pop()\r\nn = len(s)\r\nif int(s[0])%4 == 0: ans += 1\r\nfor i in range(1,n):\r\n if int(s[i])%4 == 0: ans += 1\r\n if int(''.join(s[i-1:i+1]))%4 == 0: ans += i\r\nprint(ans)\r\n", "string = input()\r\ni = 0\r\nj = 0\r\nn = len(string)\r\nstring = list(map(int,string))\r\nans = 0\r\nfor i in range(n):\r\n if (string[i])%4 == 0:\r\n ans+=1\r\n \r\n if i >=1:\r\n value = string[i-1]10 + string[i]\r\n \r\n if value%4 == 0:\r\n ans += (i)\r\nprint(ans)\r\n ", "a=input()\nl=r=0\nfor i in range(len(a)):\n r=l+(a[i]in'048')+i(i and int(a[i-1:i+1])%4==0) \n l=r\nprint(r)\n\t\t\t \t\t \t\t \t\t\t\t \t \t\t\t\t \t \t", "s= input()\r\nans = 0\r\nfor i in s:\r\n if int(i)%4 == 0:\r\n ans+=1\r\nn = len(s)\r\nfor i in range(0,n-1):\r\n if int(s[i:i+2])%4 == 0:\r\n ans+=i+1\r\nprint(ans)", "s=input()\r\na=[0]\r\ncount=0\r\nans=0\r\nfor i in range(1,len(s)):\r\n p=int(s[i-1]+s[i])\r\n #print(p)\r\n if(p%4==0):\r\n a.append(1)\r\n else:\r\n a.append(0)\r\n#print(a)\r\nfor i in range(len(a)):\r\n if(a[i]==1):\r\n count=count+i \r\nfor i in s:\r\n if(int(i)%4==0):\r\n ans+=1 \r\n \r\noutput=count+ans\r\n#print(count)\r\n#print(ans)\r\nprint(output)", "s = input()\r\ns1 = list(s)\r\ncount = 0\r\ncount += s1.count('0')\r\ncount += s1.count('4')\r\ncount += s1.count('8')\r\nfor i in range(len(s)-1):\r\n if(int(''.join(s[i:i+2]))%4==0):\r\n count += i+1\r\n\r\nprint(count) ", "longArray = input()\r\na,b,c = longArray.count('0'),longArray.count('4'),longArray.count('8')\r\ncount,size = a+b+c,len(longArray)\r\nfor x in range(size-2,-1,-1):\r\n h = int(longArray[x:x+2])\r\n if not h%4:\r\n count += (size - (size-x)) + 1\r\nprint(count)", "s = input()\r\ndp = [0]len(s)\r\nif int(s[0]) % 4 == 0:\r\n dp[0]+=1\r\nfor i in range(1,len(s)):\r\n dp[i] = dp[i - 1]\r\n if int(s[i - 1:i + 1]) % 4 == 0:\r\n dp[i]+=i\r\n if int(s[i]) % 4 == 0:\r\n dp[i]+=1\r\nprint(dp[len(s) - 1])\r\n \r\n", "# Anuneet Anand\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nD = set()\r\nfor i in range(100):\r\n\tif i%4==0:\r\n\t\tx = str(i)\r\n\t\tif i<10:\r\n\t\t\tx = \"0\"+x\r\n\t\tD.add(x)\r\n\r\nc = 0\r\nfor i in range(n-1):\r\n\tif s[i]+s[i+1] in D:\r\n\t\tc = c+i+1\r\n\r\nfor i in range(n):\r\n\tif int(s[i])%4==0:\r\n\t\tc = c+1\r\nprint(c)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n-1,0,-1):\r\n l=int(s[i])\r\n r=int(s[i-1])\r\n if l%4==0:\r\n ans+=1\r\n k=int(s[i-1]+s[i])\r\n #print(k)\r\n if k%4==0:\r\n #print(i)\r\n ans+=i\r\nif int(s[0])%4==0:\r\n ans+=1\r\nprint(ans)", "s = input()\r\nc = 0\r\nfor i in s:\r\n\tif(int(i) % 4 == 0):\r\n\t\tc += 1\r\n\t\t\r\ni, j = len(s) - 1, len(s) - 2\r\nwhile(j >= 0):\r\n\tif(int(''.join(s[j : i + 1])) % 4 == 0):\r\n\t\tc += len(s) - (len(s) - j) + 1\r\n\t\t# print(i, j)\r\n\ti -= 1\r\n\tj -= 1\r\nprint(c)\t\t\r\n\t", "s = input()\ncount = 0\n\ncount += sum(1 for c in s if int(c) % 4 == 0)\n\nfor pos in range(len(s) - 1):\n start = pos\n end = pos + 2\n # print(start, end, s[start:end])\n if int(s[start:end]) % 4 == 0:\n # This substring, and all substrings before, are divisible by 0.\n count += 1\n count += start\n\nprint(count)\n\t\t\t\t \t \t\t \t \t \t \t\t \t \t\t \t", "s = input()\r\ncount=0\r\nif int(s[0])%4==0:\r\n\tcount+=1\r\nfor i in range(1,len(s)):\r\n\tif int(s[i-1])%2==0 and (s[i] in '048'):\r\n\t\tcount+=(i+1)\r\n\telif int(s[i-1])%2==1 and s[i] in '26':\r\n\t\tcount+=i\r\n\telif int(s[i])%4==0:\r\n\t\tcount+=1\r\nprint(count)", "s=input()\r\ny=[]\r\nfor i in s:\r\n y.append(i)\r\n\r\ncount=0\r\nfor i in y:\r\n if int(i)%4==0:\r\n count+=1\r\n\r\ni=1\r\nwhile i<len(s):\r\n if int(s[i-1:i+1])%4==0:\r\n count+=i\r\n i+=1\r\n\r\nprint(count)\r\n \r\n ", "import sys\r\nimport os.path\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\ns=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n-2,-1,-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans+=i+1\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\nprint(ans)\r\n \r\n ", "s = input()\r\nn = len(s)\r\ndigits = list(s)\r\ncnt = 0\r\nfor i in range(n):\r\n num1 = int(digits[i])\r\n if num1 % 4 == 0:\r\n cnt += 1\r\n if i > 0:\r\n num2 = int(digits[i]) + int(digits[i - 1]) 10 \r\n if num2 % 4 == 0:\r\n cnt += i\r\nprint(cnt)\r\n", "s=input()\r\nq=int(int(s[0])%4==0)\r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i])%4==0:q+=i\r\n if int(s[i])%4==0:q+=1\r\nprint(q)", "s = input()\nans = 0\nfor i in range(0, len(s)-1):\n if int(s[i:i+2]) % 4 == 0:\n ans += i+1\nfor i in range(0, len(s)):\n if int(s[i]) % 4 == 0:\n ans += 1\n\nprint(ans)", "st = input()\r\nl = len(st)\r\ns = [int(st[i]) for i in range(l)]\r\ncount = 0\r\n\r\nfor i in s:\r\n if i == 0 or i==4 or i==8:\r\n count+=1\r\nif l == 1:\r\n print(count)\r\n exit(0)\r\nfor i in range(l-1):\r\n num = s[i]10 + s[i+1]\r\n if num%4 == 0:\r\n count += (i+1)\r\nprint(count)", "# help from editorial\r\nMOD = 1000000007\r\n\r\nclass Solution(object):\r\n def __init__(self):\r\n pass\r\n \r\n \r\n def get_input(self):\r\n self.msg = input()\r\n self.res = 0\r\n\r\n\r\n def comp_output(self):\r\n n = len(self.msg)\r\n for i in range(n-1):\r\n if int(self.msg[i])%4 == 0:\r\n self.res += 1\r\n if int(self.msg[i:i+2])%4 == 0:\r\n self.res += i+1\r\n\r\n if int(self.msg[n-1])%4 == 0:\r\n self.res += 1\r\n print(self.res) \r\n \r\n\r\n\r\nobj = Solution()\r\nobj.get_input()\r\nobj.comp_output()\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n d1=-1\r\n if i>=1:\r\n d1 = ord(s[i-1])-ord('0')\r\n d2 = ord(s[i])-ord('0')\r\n if d2%4==0:\r\n ans+=1\r\n if d1!=-1 and (d110+d2)%4==0:\r\n ans+=i\r\nprint(ans)\r\n ", "l= [char for char in input()]\r\nn=len(l)\r\ncount=0\r\n\r\nfor x in l:\r\n if int(x)%4==0:\r\n count+=1\r\n\r\nfor i in range(n-1, 0, -1):\r\n if int(l[i-1]+l[i])%4==0:\r\n count+=i\r\n\r\n\r\nprint(count)", "n=input()\nc=0\nif n[0]=='0' or n[0]=='4' or n[0]=='8':\n c+=1\nfor i in range(1,len(n)):\n if n[i]=='0' or n[i]=='4' or n[i]=='8':\n c+=1\n if int(n[i-1:i+1])%4==0:\n c+=i\nprint(c)", "n=input()\r\ns=0\r\n \r\nl=[]\r\nfor i in n:\r\n l.append(int(i))\r\nfor i in l:\r\n if(int(i)%4==0):\r\n s=s+1\r\ncur=0\r\nfor i in range(len(l)-1):\r\n s1=10l[i]+l[i+1]\r\n if(s1%4==0):\r\n s=s+(i+1)\r\nprint(s)", "s = input(\"\")\n\ndp = s.count(\"0\")+s.count(\"4\")+s.count(\"8\")\n\nfor i in range(len(s)-1):\n\tif int(s[i] + s[i+1])%4 == 0:\n\t\tdp += (i+1)\n\nprint(dp)", "# maa chudaaye duniya\r\ns = input()\r\ncnt = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n cnt += 1\r\nfor i in range(len(s) - 1):\r\n x = int(s[i] + s[i+1])\r\n if x%4 == 0:\r\n cnt += i+1\r\nprint(cnt)", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if i<n-1 and int(s[i]+s[i+1])%4==0:\r\n c+=i+1\r\n if int(s[i])%4==0:\r\n c+=1\r\nprint(c)", "def read():\n return [int(s) for s in input().split()]\n\ns = input().strip()\n\nres = 0\n\nfor i in range(len(s)):\n if int(s[i]) % 4 == 0:\n res += 1\n\nfor i in range(len(s)-1):\n if int(s[i:i+2]) % 4 == 0:\n res += (i + 1)\n\nprint(res)\n", "k=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n k+=1 \r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i])%4==0:\r\n k+=1 \r\n k+=i-1\r\nprint(k)", "s = input()\r\nans = 0\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans += 1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans += (i+1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\nans = 0\r\nfor i in range(n - 1):\r\n if not int(s[i] + s[i + 1]) % 4:\r\n ans += i + 1\r\nfor i in s:\r\n if not int(i) % 4:\r\n ans += 1\r\nprint(ans)", "n = input()\r\ndp = [0]len(n)\r\nans = 0\r\nif int(n[0]) % 4 == 0:\r\n dp[0] = 1\r\n ans = 1\r\n\r\n\r\nfor i in range(1, len(n)):\r\n if (int(n[i])) % 4 == 0:\r\n ans += 1\r\n dp[i] = ans\r\n else:\r\n dp[i] = 0\r\n\r\n if (int(n[i - 1]) * 10 + int(n[i])) % 4 == 0:\r\n ans += 1\r\n\r\n if (int(n[i - 1]) * 10 + int(n[i])) % 4 == 0 and i >= 2:\r\n ans += 1*(i - 1)\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "s = str(input())\nans = 0\nif(s[0] in '048'):\n ans += 1\nif(len(s) > 1):\n for k in range(1,len(s)):\n if(s[k] in '048'):\n ans += 1\n if(int(s[k-1:k+1]) % 4 == 0):\n ans += k\nprint(ans)\n", "import sys\r\ns=input()\r\nn=len(s)\r\nif(n==1):\r\n if(int(s)%4==0):\r\n print(1)\r\n else:\r\n print(0)\r\n sys.exit()\r\nc=0\r\nfor i in range(n-1):\r\n l=int(s[i]+s[i+1])\r\n if(l%4==0):\r\n c+=(i+1)\r\nfor i in range(n):\r\n l=int(s[i])\r\n if(l%4==0):\r\n c+=1\r\nprint(c)", "s = input()\r\nc = 0\r\ni = len(s)\r\nfor a in s:\r\n if int(a) % 4 == 0:\r\n c += 1\r\nwhile i > 1:\r\n if int(s[i-2:i]) % 4 == 0:\r\n c += i-1\r\n i -= 1\r\nprint(c)\r\n" ]	{"inputs": ["124", "04", "5810438174", "1", "039", "97247", "5810438174", "12883340691714056185860211260984431382156326935244", "2144315253572020279108092911160072328496568665545836825277616363478721946398140227406814602154768031", "80124649014054971081213608137817466046254652492627741860478258558206397113198232823859870363821007188476405951611069347299689170240023979048198711745011542774268179055311013054073075176122755643483380248999657649211459997766221072399103579977409770898200358240970169892326442892826731631357561876251276209119521202062222947560634301788787748428236988789594458520867663257476744168528121470923031438015546006185059454402637036376247785881323277542968298682307854655591317046086531554595892680980142608", "123456", "4", "123"], "outputs": ["4", "3", "9", "0", "1", "6", "9", "424", "1528", "30826", "7", "1", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	270
d484895805b8041afab5927ffdb460e2	New Year Candles	Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like any other new candle. Now Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number. The single line contains two integers, a and b (1<=≤<=a<=≤<=1000; 2<=≤<=b<=≤<=1000). Print a single integer — the number of hours Vasily can light up the room for. Sample Input 4 2 6 3 Sample Output 7 8	[ "a,b=map(int,input().split())\r\nc=int(a-1)/(b-1)\r\nprint(int(a+c))\r\n", "a, b = map(int, input().split())\r\nres = 0\r\nwhile a >= b:\r\n a += 1 - b\r\n res += b\r\nres += a\r\nprint(res)", "a, b = tuple(int(i) for i in input().split())\r\nc = 0\r\ntotal = 0\r\nflag = True\r\n\r\nwhile flag:\r\n total += a\r\n c += a % b\r\n a //= b\r\n a += c // b\r\n c %= b\r\n if a == 0:\r\n flag = False\r\n\r\nprint(total)", "a,b = map(int,input().split())\r\nc=a\r\nx=a\r\nwhile(x>=b ):\r\n c+= x//b\r\n x = x//b + (x - (x//b)b)\r\n # print(x,c)\r\nprint(c)", "a, b = map(int, input().split())\r\n\r\ncount = 0\r\nwhile a >= b:\r\n\r\n used = a - a%b\r\n count += used\r\n a -= used - used//b\r\n\r\nprint(count + a)", "a, b = list(map(int, input().split()))\r\nh = a\r\nwhile a >= b:\r\n a-=b\r\n a+=1\r\n h+=1\r\nprint(h)", "n,m = input().split()\r\nn,m = int(n),int(m)\r\n\r\nans=0\r\ncnt = n\r\nday = 1\r\n\r\nwhile cnt>0:\r\n if day==m:\r\n cnt+=1\r\n day=1\r\n else:\r\n day+=1\r\n ans+=1\r\n cnt-=1\r\n\r\nprint(ans)\r\n\r\n\r\n# 10 + ", "def sol(a, b):\r\n # Calculate the number of hours\r\n hours = a\r\n # Calculate the number of times b can be divided into a\r\n z = a // b\r\n hours += z\r\n # Calculate the remaining hours if a is greater than b\r\n if a > b:\r\n z += a % b\r\n e = 0\r\n # Continue dividing z by b until it is less than b\r\n while z >= b:\r\n # Calculate the remaining hours if z is greater than b\r\n if z > b:\r\n e += z % b\r\n z = z // b\r\n hours += z\r\n z += e\r\n e = 0\r\n return hours\r\n\r\n\r\na, b = map(int, input().split())\r\nprint(sol(a,b))", "n, b = map(int, input().split())\r\nans = n\r\nwhile(n >= b):\r\n toadd = n // b\r\n ans += toadd\r\n left = n % b\r\n n = toadd + left\r\nprint(ans)", "m,n=map(int,input().split())\r\nc=m\r\nd=0\r\nwhile (m>=n):\r\n b=m//n\r\n c=c+b\r\n d=m%n\r\n m=b+d\r\nprint(c)\r\n", "from math import ceil\r\ncandels , replace = map(int ,input().split()) \r\ncounter = candels \r\nwhile candels >= replace : \r\n c = int(candels / replace)\r\n counter += c \r\n candels = c + candels % replace \r\nprint(counter)\r\n \r\n", "n, a=list(map(int, input().split()))\r\ns=n\r\nwhile n>=a:\r\n p=n\r\n n=p//a+p%a\r\n s+=p//a\r\nprint(s)", "a, b = map(int, input().split())\r\n\r\ntotalHours = a\r\n\r\nwhile a >= b:\r\n newCandles = a // b\r\n totalHours += newCandles\r\n a = newCandles + (a % b)\r\n\r\nprint(totalHours)\r\n", "a, b = map(int, input().split())\r\nans = a\r\nost = 0\r\nwhile a >= b:\r\n ans += a // b\r\n ost = a % b\r\n a //= b\r\n a += ost\r\nprint(ans)\n# Mon Nov 28 2022 23:01:11 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int, input().split())\r\na2, count = 0, 0\r\nwhile a > 0:\r\n a2 += 1 - a2//b b\r\n a += a2//b - 1\r\n count += 1\r\nprint(count)\r\n", "# https://codeforces.com/problemset/problem/379/A\r\n\r\na, b = [int(x) for x in input().split()]\r\n\r\nh = a\r\nwhile a >= b:\r\n div, mod = divmod(a, b)\r\n a = div + mod\r\n h += div\r\n\r\nprint(h)\r\n", "a,b = input().split()\r\na,b = int(a), int(b)\r\nc = a\r\nwhile a >= b:\r\n temp = a // b\r\n c += temp\r\n a = a % b + temp\r\nprint(c)", "a, b = map(int, input().split())\ns = a\nc = a\nwhile c >= b:\n a = c // b\n s = s + a\n c = c % b + a\nprint(s)\n\n\n \n \n \n", "a , b = map(int,input().split())\r\nh = 0\r\nleft = 0\r\nwhile a > 0:\r\n h += a\r\n left += a\r\n a = int(left/b)\r\n left = left % b\r\nprint(h)", "a, b = map(int, input().split())\r\nif 1<=a<=1000 and 2<=b<=1000:\r\n c=a\r\n while a//b>=1:\r\n c+=a//b\r\n a=a//b+a%b\r\n \r\n print(c)", "a, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nhours = a\r\nwhile a >= b:\r\n c = a // b\r\n hours += c\r\n a = a % b + c\r\n\r\nprint(hours)", "#Coder_1_neel\r\na,b=map(int,input().split())\r\nhr=a\r\nx=a\r\nwhile(x>=b):\r\n n=x//b\r\n hr+=n\r\n x=n+(x%b)\r\nprint(hr) ", "n,m = map(int,input().split())\r\ns = 0\r\na = n\r\nb = 0\r\nwhile True:\r\n s += a\r\n if a+b<m:\r\n break\r\n a = (a+b)//m\r\n b = s%m\r\nprint(s)", "import sys\r\nimport math\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\na = int(inputs[0].strip().split()[0])\r\nb = int(inputs[0].strip().split()[1])\r\ntotalCandlesLeft = a\r\naCandlesTaken = 0\r\ncandlesToReuse = 0\r\nhours = 0\r\nwhile totalCandlesLeft > 0:\r\n totalCandlesLeft-=1\r\n aCandlesTaken+=1\r\n hours+=1\r\n if aCandlesTaken == b:\r\n aCandlesTaken-=b\r\n totalCandlesLeft+=1\r\nprint(hours)\r\n ", "from sys import stdin, stdout\r\n\r\na, b = map(int, stdin.readline().split())\r\n\r\nstdout.write(str(a + (a - 1) // (b - 1)))\r\nstdout.flush()", "s, b = map(int, input().split())\r\nans = s\r\nwhile s//b > 0:\r\n ans += s//b\r\n s = (s%b) + (s//b)\r\nprint(ans)", "candles, b = map(int, input().split())\r\nhours = 0\r\nwhile candles > 1:\r\n hours += (candles//b)b\r\n if candles >= b:\r\n candles = candles//b + candles%b\r\n else:\r\n break\r\nprint(hours+candles)\r\n", "a, b = map(int, input().split())\r\nhours = a\r\n\r\nwhile a >= b:\r\n candles = a // b\r\n hours += candles\r\n a = candles + (a % b)\r\n\r\nprint(hours)\r\n\r\n", "a, b = map(int, input().split())\r\nn = a\r\nc = a\r\ns = 0\r\nwhile n - b >= 0:\r\n n -= b\r\n n += 1\r\n c += 1\r\nprint(c)", "a, b = map(int, input().split())\r\ntotal = a\r\nused = a\r\n\r\nwhile used >= b:\r\n new = (used - (used%b)) // b\r\n total += new\r\n used -= newb - new\r\nprint(total)\r\n", "if __name__ == \"__main__\":\n a, b = map(int, input().strip().split())\n print(a + (a-1)//(b- 1))", "for i in range(1):\r\n a,b=map(int,input().split(' '))\r\n f=0\r\n h=0\r\n while (a>0):\r\n h+=1\r\n a-=1\r\n f+=1\r\n if (f==b):\r\n f=0\r\n a+=1\r\n print(h)\r\n", "a, b = map(int, input().split())\r\nhour = 0\r\nold = 0\r\nwhile a > 0:\r\n hour += 1\r\n a -= 1\r\n old += 1\r\n if old == b:\r\n a += 1\r\n old = 0\r\nprint(hour)\r\n", "a,b = map(int,input().split())\r\nx = a\r\nwhile a>=b:\r\n x = x+(a//b)\r\n a = a//b + a%b\r\nprint(x)", "a, b = list(map(int, input().split()))\r\nans = (a - 1) // (b - 1)\r\nprint(ans + a)", "n =(input()).split(\" \")\r\na,b =int(n[0]),int(n[1])\r\nc=a\r\nwhile a >=b :\r\n c+= a//b\r\n a= a//b +a%b\r\n\r\nprint(c)\r\n\r\n", "a,b=map(int,input().split())\ns=a\nc=1\nwhile(c!=0):\n c=a//b\n s=s+c\n a=c+a%b\nprint(s)\n", "a,b=map(int,input().split())\r\n\r\nwentOutCandles = a\r\nnumOfNewCandle = 0\r\n\r\nwhile wentOutCandles>=b:\r\n newCandle = wentOutCandles//b\r\n remainder = wentOutCandles%b\r\n \r\n numOfNewCandle += newCandle\r\n wentOutCandles = remainder+newCandle\r\n\r\nprint(a + numOfNewCandle)", "strng = input()\r\nstrng_lst = strng.split()\r\n\r\na = int(strng_lst[0])\r\nb = int(strng_lst[1])\r\n\r\ncount = a\r\nburnt = a\r\n\r\nwhile burnt >= b:\r\n new = (burnt - (burnt % b)) // b\r\n count += new\r\n burnt = burnt % b\r\n burnt = burnt + new\r\n \r\nprint(count)", "from math import \r\n\r\n#for _ in range(int(input())):\r\na,b=map(int,input().split())\r\ncount=a\r\nwhile (a>=b):\r\n count+=(a//b)\r\n rem=a%b\r\n a=(a//b)\r\n a+=rem\r\nprint(count)", "a, b = map(int, input().split())\r\ns = a\r\nwhile a>=b:\r\n div = a//b\r\n s = s+div\r\n m = a%b \r\n a = div + m\r\nprint(s)", "a,b = map(int, input().split())\r\nhours = 0\r\nstock = a\r\noldstock = 0\r\nbuffer = 0\r\nwhile(stock >= 1):\r\n hours = hours + stock\r\n oldstock = stock\r\n stock = (stock + buffer)//b\r\n buffer = ((oldstock + buffer)%b)\r\nprint(hours)", "a,b=[int(x) for x in input().split()]\r\ntime=a\r\ncount=0\r\ni=1\r\nwhile(i<=a):\r\n count+=1\r\n i+=1\r\n if(count==b):\r\n a+=1\r\n count=0\r\n time+=1\r\nprint(time)\r\n ", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = 0\r\nk = 0\r\nwhile a > 0:\r\n c += a\r\n a, k = (a + k) // b, (a + k) % b\r\nprint(c)", "def q1(a,b,sum):\r\n while a>=b:\r\n r1=a//b\r\n r2=a%b\r\n sum+=(r1b)\r\n a=r1+r2 \r\n else:\r\n sum+=a\r\n return sum\r\n \r\n \r\ni=input().split()\r\nl=list(map(int,i))\r\nprint(q1(l[0],l[1],0))", "import re\r\n\r\n\r\ncandeleIntere,b = map(int,input().split())\r\ns = 0\r\nrestoSciolte = 0\r\nwhile candeleIntere > 0 or restoSciolte >= b:\r\n\r\n candeleIntere += restoSciolte//b\r\n restoSciolte %= b\r\n\r\n s += candeleIntere\r\n restoSciolte+=candeleIntere%b\r\n candeleIntere//=b\r\n\r\nprint(s)", "a, b = map(int, input().split())\r\nh, a0 = 0, 0\r\nwhile a>0:\r\n h += 1\r\n a -= 1\r\n a0 += 1\r\n if a0>=b:\r\n a+= 1\r\n a0-= b\r\nprint(h)", "(fr,se)=[int(x) for x in input().split()]\r\nd=c=0\r\nwhile fr!=0:\r\n fr-=1\r\n d+=1\r\n c+=1\r\n if c==se:\r\n fr+=1\r\n c=0\r\nprint(d)", "a,b=map(int,input().split())\r\nans=0\r\nc=0\r\nwhile a:\r\n ans+=1\r\n a-=1\r\n c+=1\r\n if c==b:\r\n c=0\r\n a+=1\r\nprint(ans)", "a,b=map(int,input().split())\r\ntime = 0\r\nwhile a>=b:\r\n q=int(a/b)\r\n r=int(a%b)\r\n a=q+r\r\n time+=qb\r\nprint(time+a)\r\n", "# https://codeforces.com/contest/379/problem/A\r\n\r\nuser_input = input().split(' ')\r\na = int(user_input[0])\r\nb = int(user_input[1])\r\n\r\ndef rem_candle_hours(a, b):\r\n if a < b:\r\n return 0\r\n elif a == b:\r\n return 1\r\n else:\r\n return a//b + rem_candle_hours(a//b + a%b, b)\r\n \r\nhours = a + rem_candle_hours(a, b)\r\n\r\nprint(hours)", "a, b = map(int, input().split())\nhrs = a\nwhile a >= b:\n\thrs += a // b\n\ta = (a // b) + (a % b)\nprint(hrs)\n\t \t\t\t \t\t \t\t\t \t \t\t \t\t\t\t\t \t", "a, b = [int(i) for i in input().split()]\r\n\r\nres = 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n res += 1\r\n if res % b == 0:\r\n a += 1\r\n\r\nprint(res)", "a,b=map(int,input().split())\r\nans=a\r\nstore=0\r\nwhile (a+store)//b>0:\r\n preans=a\r\n a=(a+store)//b\r\n store=(preans+store)%b\r\n ans+=a\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nt=a\r\nwhile a//b>0:\r\n t+=a//b\r\n n=a//b+a%b\r\n a=n\r\nprint(t)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a \r\n\r\nwhile a >= b:\r\n \r\n new_candles = a // b\r\n \r\n remaining_candles = a % b\r\n \r\n total_hours += new_candles\r\n \r\n a = new_candles + remaining_candles\r\n\r\nprint(total_hours)\r\n", "a,b=[int(i) for i in input().split()]\r\ns=a\r\nwhile a>=b:\r\n s+=(a//b)\r\n a=(a//b)+(a%b)\r\nprint(s)", "a, b = map(int, input().split())\r\ns = 0\r\ni = 0\r\nwhile a > 0:\r\n if s == b:\r\n s = 0\r\n a += 1\r\n a -= 1\r\n s += 1\r\n i += 1\r\nprint(i + s // b)", "A,n = map(int,input().split())\r\nans=0\r\nactive =A\r\nburnt=0\r\nwhile active>0:\r\n ans += active\r\n burnt+=active\r\n active = (burnt)//n;\r\n burnt = (burnt)%n\r\n # active = nactive\r\nprint(ans)\r\n", "a, b=map(int, input().split())\r\nleft, day=0, 0\r\nwhile a>0:\r\n day+=1\r\n a-=1\r\n left+=1\r\n if left==b:\r\n left=0\r\n a+=1\r\nprint(day)\r\n ", "\"\"\"\nA. New Year Candles: implementation\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nVasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\nVasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out.\nVasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like any other new candle.\nNow Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number.\n\nInput\nThe single line contains two integers, a and b (1 ≤ a ≤ 1000; 2 ≤ b ≤ 1000).\n\nOutput\nPrint a single integer — the number of hours Vasily can light up the room for.\n\"\"\"\n\ndef new_year_candles():\n a, b = map(int, input().split(' '))\n print(a + (a - 1) // (b - 1))\n\nif __name__ == '__main__':\n new_year_candles()", "x,y=map(int,input().split())\r\ncount=x\r\nwhile x>=y:\r\n x=x-y+1\r\n count+=1\r\nprint(count)", "a, b = (int(i) for i in input().split())\r\n\r\nexting = 0\r\nhours = 0\r\nwhile a != 0 or hours == 0:\r\n\thours += a\r\n\texting += a\r\n\ta = exting // b\r\n\texting = exting % b\r\nprint(hours)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n ans+=a//b\r\n a=a%b + a//b\r\nprint(ans)", "a,b = map(int,input().split())\r\nans, c= 0,0\r\nwhile a:\r\n ans +=1\r\n a -=1\r\n c +=1\r\n if c == b:\r\n c =0 \r\n a +=1\r\nprint(ans) ", "n,m=map(int,input().split());a=0;b=0\r\nwhile not n<=0 or a==m:\r\n b+=1\r\n if a==m:a=1;continue\r\n n-=1;a+=1\r\nprint(b)", "a,b=map(int,input().split())\r\ntime=(ab-1)//(b-1)\r\nprint(time)", "a, b = [int(i) for i in input().split()]\r\nans = 0\r\nwhile a:\r\n ans += 1\r\n a -= 1\r\n if ans % b == 0:\r\n a += 1\r\nprint(ans)", "def solve():\r\n a, b = [int(i) for i in input().split()]\r\n t = 0\r\n o = 0\r\n while a:\r\n a -= 1\r\n o += 1\r\n if o == b:\r\n o = 0\r\n a += 1\r\n t += 1\r\n return t\r\n\r\n\r\nprint(solve())", "a, b = map(int, input().split())\r\nans = 0\r\ncura = a\r\ncurb = 0\r\nwhile cura != 0:\r\n ans += cura\r\n curb += cura\r\n cura = curb // b\r\n curb = curb % b\r\nprint(ans)", "a,b = map(int,input().split())\r\nk=0\r\nx=0\r\nwhile a>0:\r\n a-=1\r\n x+=1\r\n k+=1\r\n if k==b:\r\n k=0\r\n a+=1\r\nprint(x)", "a, b = map(int, input().split())\r\ntime = a\r\nogr = a\r\nwhile ogr >= b:\r\n time += ogr // b\r\n ost = ogr % b\r\n ogr = ogr // b + ost\r\nprint(time)\r\n", "if __name__=='__main__':\r\n a,b=map(int,input().split())\r\n s=a\r\n while a>=b:\r\n s=s+(a//b)\r\n a=(a//b)+(a%b)\r\n print(s)", "k = input().split(\" \")\r\nk = [int(i) for i in k]\r\na = k[0]\r\nb = k[1]\r\nl = []\r\nl.append(a - a%b)\r\nwhile(True):\r\n a = int(a/b) + a%b\r\n if(a<=b):\r\n break\r\n else:\r\n l.append(a-a%b)\r\nif(a==b):\r\n print(sum(l)+a+1)\r\nelse:\r\n print(sum(l)+a)", "import math\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nans = math.floor(a/b)\r\nextra = math.floor(a/b) + a%b\r\nwhile extra >= b:\r\n ans += math.floor(extra/b)\r\n extra = math.floor(extra/b) + extra%b\r\nprint(a+ans)", "a, b = map(int, input().split())\r\nres = 0\r\nremainder = 0\r\n\r\nwhile a > 0:\r\n res += a\r\n can_burn = a // b\r\n remainder += a % b\r\n a = can_burn\r\n a += remainder // b\r\n remainder = remainder % b\r\n \r\nprint(res)", "A,B=map(int,input().split())\r\nans=A\r\nwhile A-B>=0:\r\n ans+=A//B\r\n A=A//B+A%B\r\nprint(ans)", "t,k=0,0\r\na,b=map(int,input().split())\r\nwhile a>0:\r\n t+=1\r\n k+=1\r\n a-=1\r\n if k == b:\r\n a+=1\r\n k-=b\r\nprint(t)\r\n", "def recursive_module(a,b,h,remain):\r\n h += a\r\n remain += a%b\r\n if a + remain >= b:\r\n if remain >= b:\r\n remain -= b\r\n return recursive_module((a//b)+1,b,h,remain)\r\n return recursive_module((a//b),b,h,remain)\r\n else:\r\n print(h)\r\n\r\na, b = map(int, input().split())\r\nrecursive_module(a,b,0,0)", "a, b = map(int, input().split())\r\ntime = 0\r\nr = 0\r\n\r\nwhile a > 0:\r\n time += a\r\n if a % b == 0:\r\n a //= b\r\n else:\r\n r += a % b\r\n a //= b\r\n\r\n if r >= b:\r\n a += r // b\r\n r %= b\r\n\r\ntime += r // b # Add the remaining candles to the total time\r\nprint(time)\r\n", "a,b=map(int,input().split());z=0\r\nn=a\r\nwhile a>=b:\r\n n+=a//b\r\n z=a%b\r\n a=a//b+z\r\nprint(n)", "n,m=map(int,input().split())\r\na=0\r\nwhile a!=n:\r\n a=a+1\r\n if a%m==0:\r\n n=n+1\r\nprint(a)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Apr 6 13:17:08 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nd=n\r\nx=n//m\r\nprev=0\r\nwhile x>0:\r\n d=d+x\r\n prev=prev+x\r\n x=(d//m)-prev\r\n#if d%m==0:\r\n# d=d+1\r\nprint(d)", "x,y=map(int,input().split())\r\nz=0\r\na=0\r\nwhile x>0:\r\n x-=1\r\n a+=1\r\n z+=1\r\n if a//y==1:\r\n x+=1\r\n a=0\r\nprint(z)", "a, b = map(int,input().split())\r\nans = 0\r\nwhile a > 0:\r\n a -= 1\r\n ans += 1\r\n if ans%b==0:\r\n a+=1\r\nprint(int(ans))", "a,b = list(map(int,input().split()))\r\nans = a\r\nwhile a >= b:\r\n c = a//b\r\n a %= b\r\n a += c\r\n ans += c\r\nprint(ans)", "c, n = list(map(int, input().split()))\r\ncount = c\r\nwhile c >= n:\r\n count += int(c/n)\r\n c = int(c/n) + (c % n)\r\nprint(int(count))", "a, b = map(int, input().split())\r\n\r\n# We have to check how many candles we can create with our burnt out candles'\r\n# We have to find how many hours he can light the room up for\r\n# Given an initial amount of candles\r\n# And amount of candles to build a new candle\r\n# \"a\" holds the number of candles at hand\r\n\r\nprint((ab-1)//(b-1))", "# Source: https://usaco.guide/general/io\n\ncandles,taketime = map(int,input().split())\nused =0\ntime =0\nwhile candles > 0:\n\ttime += 1\n\tcandles -= 1\n\tused += 1\n\tif used == taketime:\n\t\tused = used-taketime\n\t\tcandles += 1\nprint(time)\n\n\n\n", "\r\na, b = [int(k) for k in input().split()]\r\nsum = a\r\nwhile a >= b:\r\n c = int(a / b)\r\n sum += c\r\n a = c + a % b\r\nprint(sum)", "nn=[int(i) for i in input().split()]\r\na=nn[0]\r\nb=nn[0]\r\nwhile b>=nn[1]:\r\n a+=int(b/nn[1])\r\n b=b%nn[1]+int(b/nn[1])\r\nprint(str(a))", "a,b=map(int,input().split())\r\nn=a\r\nm=a\r\nwhile m>=b:\r\n n+=m//b\r\n m=m//b+m%b\r\nprint(n)", "a, b = map(int, input().split())\r\n\r\nhours = a\r\npile = 0\r\n\r\nwhile a > 0:\r\n pile += a\r\n a, leftover = divmod(pile, b)\r\n hours += a\r\n pile = leftover\r\n\r\nprint(hours)\r\n", "a,b=map(int,input().split())\r\nprint(a+(a-1)//(b-1))", "import sys\n\ndef candles(a: int, b: int) -> int:\n total = a # 4\n extra = a % b # 0\n remains = int(a / b) # 2\n total += remains\n while (remains + extra) >= b:\n new_a = remains + extra\n extra = new_a % b\n remains = int(new_a / b)\n total += remains\n\n return total\n\nif __name__ == '__main__':\n a, b = sys.stdin.readline().split(\" \")\n\n print(candles(int(a), int(b)))\n\n # print(candles(4, 2))\n #\n # print(candles(6, 3))\n #\n # print(candles(6, 2))\n", "x,y = map(int,input().split())\r\nc = 0\r\ncd = x\r\nwhile x>=y:\r\n c += cd\r\n cd = x//y\r\n x= x//y + x%y\r\nprint(c + cd)", "nm = list(map(int,input().split(\" \")))\r\nsocks = nm[0]\r\nnew = nm[1]\r\ndays = 0\r\n\r\nwhile socks > 0:\r\n socks -= 1\r\n days += 1\r\n if days%new == 0:\r\n socks += 1\r\n\r\nprint(days)\r\n", "a,b = map(int,input().split())\r\ncurrent = a\r\nburnedDown = 0\r\nanswer=0\r\nwhile current > 0:\r\n current-=1\r\n answer+=1\r\n burnedDown+=1\r\n if burnedDown == b:\r\n burnedDown = 0\r\n current+=1\r\n \r\nprint(answer)", "a, b = map(int, input().split())\r\nx = 0\r\ntime = 0\r\nwhile a != 0:\r\n time += 1\r\n a -= 1\r\n x += 1\r\n if x >= b:\r\n a += 1\r\n x -= b\r\nprint(time)", "def time(a,b):\r\n if b > a:\r\n return a\r\n else:\r\n return int(a//b)b + time(a//b+a%b,b)\r\n \r\na,b = map(int,input().split(' '))\r\nprint(time(a,b))", "# 4 2,123 5\r\nn,b = list(map(int,input().split()))\r\npotracheno = 0\r\ncount = 0\r\n\r\nwhile n != 0:\r\n n -= 1\r\n potracheno += 1\r\n if potracheno == b:\r\n potracheno -= b\r\n n += 1\r\n count += 1\r\nprint(int(count))\r\n ", "a, b = map(int, input().split())\r\n\r\n\r\ncandles = a\r\nhours = a\r\nwhile candles / b >= 1:\r\n hours += int(candles / b)\r\n candles = int(candles / b) + candles % b\r\n\r\n\r\nprint(hours)", "a,b = map(int,input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total += a // b\r\n a = (a//b)+(a%b)\r\n\r\nprint(total)\r\n", "l=list(map(lambda x:int(x),input().split()))\r\na,b=l[0],l[1]\r\ncnt=0\r\ncnt+=a\r\nwhile True:\r\n if a/b>=1:\r\n rnd=a%b\r\n quot=a//b\r\n cnt+=quot\r\n a=rnd+quot\r\n else:break\r\nprint(cnt)", "a, b = map(int, input().split())\r\n\r\nst = a * '1'\r\ncounter = 0\r\nwhile '1' in st:\r\n counter += st.count('1')\r\n st = st.replace('1', '0').replace('0' * b, '1')\r\n\r\nprint(counter)\r\n\r\n\r\n", "l=[int(i) for i in input().split()]\r\na=l[0]\r\nb=l[1]\r\ncandles=0\r\nleft=0\r\nwhile(a>=b):\r\n candles+=(a//b)b\r\n left=a%b\r\n a=a//b+left\r\nprint(candles+a)", "a, b = map(int, input().split())\r\nh = 0\r\nans = 0\r\nwhile a:\r\n h += 1\r\n a -= 1\r\n if h == b:\r\n h = 0\r\n a += 1\r\n ans += 1\r\n\r\nprint(ans)", "p,q=map(int,input().split()) \r\nprint((pq-1)//(q-1))", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n a,b=map(int,input().split())\r\n ans=0\r\n while a>0:\r\n a-=1\r\n ans+=1\r\n if ans%b==0:\r\n a+=1\r\n \r\n print(ans)\r\n \r\n \r\nsol()", "a,b=map(int,input().split())\r\nif(b>a):\r\n print(a)\r\nelse:\r\n h=a\r\n re=a\r\n while(re>=b):\r\n h+=re//b\r\n re=re%b+re//b\r\n print(h)\r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nwrite = sys.stdout.write\r\na, b = (int(x) for x in input().split())\r\nt = 0\r\nm = 0\r\nwhile a > 0:\r\n\tt += 1\r\n\ta -= 1\r\n\tm += 1\r\n\tif m == b:\r\n\t\tm = 0\r\n\t\ta += 1\r\nwrite(str(t))", "a, b = map(int, input().split())\r\n\r\n\r\ndef solve(a, r):\r\n if a == 0 and r < b:\r\n return 0\r\n r += a\r\n return a + solve(r // b, r % b)\r\n\r\n\r\nprint(solve(a, 0))\r\n\r\n", "a, b = map(int, input().split())\r\n\r\nres = a \r\n\r\nwhile a >= b:\r\n s = a // b \r\n res += s \r\n a = s + a % b \r\n\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nc=a\r\nd=0\r\nwhile a>=b:\r\n c=c+a//b\r\n d=a%b\r\n a=a//b+d\r\nprint(c)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n ans+=a//b\r\n a=a//b+a%b\r\nprint(ans)", "from sys import stdin, stdout \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve(): \r\n a, b = rn()\r\n i = 0\r\n while a:\r\n a -= 1 \r\n i += 1 \r\n if i % b == 0:\r\n a += 1 \r\n print(i)\r\n return None\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nsolve()\r\n", "a,b=map(int,input().split())\r\nhours=0\r\ncount=0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n count+=1\r\n if count==b:\r\n a+=1\r\n count=0\r\nprint(hours)", "z=[0 for i in range(10)]\r\nz[0]=1\r\ndef solve():\r\n q,w=map(int,input().split())\r\n ans=q\r\n e=q\r\n q=e//w\r\n ans+=q\r\n r=e%w\r\n while(q!=0):\r\n r+=q\r\n q=r//w\r\n ans+=q\r\n r%=w\r\n print(ans)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "n, b = map(int, input().split())\ni = n\nres = n\nwhile n >= b:\n n = n - b\n n += 1\n res += 1\n\nprint(res)\n", "a, b = map(int, input().split())\r\nhours = a\r\nwhile a//b>0:\r\n hours +=a//b\r\n a=a//b+a%b\r\nprint(hours)\r\n", "a, b = map(int,input().split())\r\nost=0\r\ni=0\r\nwhile a>0:\r\n i+=a\r\n ost+=a % b\r\n a=a//b\r\n \r\n a += ost // b\r\n ost %= b\r\n# if ost>=b:\r\n# i+=ost//b\r\n# ost %= b\r\n\r\nprint(i)", "A, B = map(int, input().split())\r\nC, ans = 0, 0\r\nwhile A > 0 or C >= B:\r\n\tans += A\r\n\tCC = (A + C) % B\r\n\tAA = (A + C) // B\r\n\tA, C = AA, CC\r\nprint(ans)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n# a=7\r\n# b=4\r\nc=a\r\nsum=0\r\nwhile(a//b!=0):\r\n burnt=a%b\r\n sum+=a//b\r\n if((a//b+burnt)<b):\r\n break\r\n else:\r\n a=a//b+burnt\r\nprint(sum+c)\r\n", "def solve(n, m):\r\n count = n\r\n while(n//m >= 1):\r\n count += n//m\r\n n = n//m + n%m\r\n return count\r\n\r\n# for _ in range(int(input())):\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))", "a,b=map(int,input().split())\r\ncount=0\r\nwhile a-b+1>0:\r\n a-=b\r\n a+=1\r\n count+=b\r\nprint(count+a)", "a, b = input().split(\" \")\r\na, b = int(a), int(b)\r\ntotal_hours = a\r\nwhile a >= b:\r\n new_candles = a // b\r\n dec = a % b\r\n total_hours = total_hours + new_candles\r\n a = new_candles + dec\r\n #print(a)\r\n #print(dec)\r\n #print(total_hours)\r\nprint(int(total_hours))\r\n\r\n", "a,b=map(int,input().split())\r\nch=0\r\nc=0\r\nwhile a>0:\r\n a-=1\r\n ch+=1\r\n c+=1\r\n if c==b:\r\n a+=1\r\n c=0\r\nprint(ch)\r\n", "from cmath import inf\r\nfrom re import T, X\r\nimport math\r\nfrom tkinter import N\r\n\r\n\r\ndef swap(a,b):\r\n a = a^b\r\n b = a^b\r\n a = a^b\r\n return a,b\r\n # call using a,b = swap(a,b)\r\ndef even(a):\r\n if a&1:\r\n return False\r\n return True\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (xy) // gcd(x,y)\r\n return lcm\r\n\r\n# it will return index of \"key\" in \"sorted list\". \r\ndef BS_elemPosi(low, high, key, li): \r\n while low<high:\r\n mid = (low+high)//2\r\n if li[mid]<=key:\r\n low = mid+1\r\n else:\r\n high = mid\r\n return low\r\n \r\n###########################(CODE)##################################\r\n# a candle\r\n# 1 candle burns fo 1 hr\r\n# total hr=? iif she makes b candles\r\n# 4 2 ==> 1 1 (1) 1 (1) 1 (1)\r\n# 6 3 ==> 1 1 1 (1) 1 1 (1) 1 \r\n# \r\na,b = map(int, input().split())\r\nans = (a-1)//(b-1) + a\r\nprint(ans)\r\n\r\n#####################################################################", "def solve(a,b):\r\n ans = a\r\n rem = 0\r\n while a//b>0:\r\n ans += a//b\r\n a = a//b + a%b\r\n \r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n a,b = list(map(int, input().split()))\r\n ans = solve(a,b)\r\n print(ans)\r\n \r\n ", "a, b =map(int,input().split())\r\nh =0\r\nr=0\r\nwhile a>0:\r\n a-=1\r\n h+=1\r\n r+=1\r\n if r == b:\r\n a+=1\r\n r=0\r\nprint(h)\r\n", "candles, b = map(int, input().split())\r\nres = 0\r\nrip = 0\r\nwhile candles > 0:\r\n res += candles\r\n rip += candles\r\n candles = rip // b\r\n rip %= b\r\n\r\n\r\n\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nvar=a\r\nwhile(a>=b):\r\n d=a//b\r\n var=var+d\r\n c=a%b\r\n a=d+c\r\nprint(var)", "a = [int(i) for i in input().strip().split()]\r\npotuh = 0\r\ntime = 0\r\ngood = a[0]\r\n\r\nfor x in range(a[0]):\r\n time += good\r\n potuh += good\r\n good = 0\r\n if potuh >= a[1]:\r\n good += potuh // a[1]\r\n potuh %= a[1]\r\nprint(time)\r\n \r\n", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a # start by lighting up all a candles\r\nburned_out = a # keep track of burned-out candles\r\n\r\nwhile burned_out >= b:\r\n # use b burned-out candles to make a new one\r\n new_candle = burned_out // b\r\n burned_out = burned_out % b + new_candle\r\n total_hours += new_candle\r\n\r\nprint(total_hours)", "a, b = map(int, input().split())\r\ncandles = 0\r\ncounter = 0\r\n\r\nwhile a > 0:\r\n candles += 1\r\n counter += 1\r\n if counter == b:\r\n a += 1\r\n counter = 0\r\n a -= 1 \r\n\r\nprint(candles)", "a,b = map(int,input().split())\r\ncount = 0\r\ncount+=a\r\nwhile a>=b:\r\n count += a // b\r\n a = a // b + a % b\r\nprint(count)", "a,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n sum=sum+(a//b)\r\n a=(a//b)+(a%b)\r\n \r\nprint(sum)", "ab = input().split()\r\ndge = int(ab[0])\r\nyidva = int(ab[1])\r\nplus = dge//yidva\r\nmtvleli = 0\r\nwhile mtvleli < dge :\r\n mtvleli +=1\r\n if mtvleli % yidva == 0 :\r\n dge+=1\r\nprint(mtvleli)", "candles, new_candles = map(int, input().split())\r\nhours = 0\r\nwhile candles > 0:\r\n hours += 1\r\n candles -=1\r\n if hours % new_candles == 0:\r\n candles += 1\r\nprint(hours)", "a,b=map(int,input().split())\r\nans = a\r\nwhile a >= b :\r\n a-=b\r\n a+=1\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n", "c,b=map(int,input().split());\r\nprint((cb-1)//(b-1))", "a, b = map(int, input().split())\r\nhours = 0\r\nwhile a - hours + hours // b:\r\n hours += 1\r\nprint(hours)", "a, b = map(int, input().split())\r\nx = a\r\nh = 0\r\ns = 0\r\nwhile x > 0:\r\n x -= 1\r\n h += 1\r\n s += 1\r\n \r\nwhile s // b != 0: \r\n h += 1\r\n s = s - b + 1\r\n\r\n \r\n \r\nprint(h)\r\n", "def main():\r\n a, b = list(map(int, input().split()))\r\n\r\n counter = 0\r\n current_a, current_b = a, 0\r\n while current_a > 0:\r\n counter += current_a\r\n current_b += current_a\r\n\r\n current_a = current_b // b\r\n current_b -= current_a * b\r\n print(counter)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\nans=a\nwhile a>=b:\n ans+=a//b\n a=a//b+a%b\nprint(ans)", "pro = input('')\r\nqnt = int(pro.split()[0])\r\nb = int(pro.split()[1])\r\nt = 0\r\nrep = 0\r\nwhile True:\r\n if qnt > 0:\r\n qnt = qnt - 1\r\n t = t + 1\r\n rep = rep + 1\r\n if rep == b:\r\n rep = 0\r\n qnt = qnt + 1\r\n else:\r\n print(t)\r\n break\r\n \r\n\r\n", "a,b=map(int,input().split())\r\nnc=0\r\noc=a\r\nt=a\r\nwhile(oc>=b):\r\n oc-=b-1\r\n t+=1\r\nprint(t)\r\n \r\n ", "a,b=map(int,input().split())\r\n\r\nt=0\r\n\r\nwhile a>0:\r\n a=a-1\r\n t=t+1\r\n \r\n if t%b==0:\r\n a=a+1\r\n #print(a,t)\r\nprint(t)", "\r\na,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n div=a//b\r\n sum+=div\r\n rem=a%b\r\n a=div+rem\r\nprint(sum)", "a, b = list(map(int, input().split()))\r\nhours_lit_up = 0\r\ncandles = a\r\nwhile candles >= b:\r\n new_candles = candles // b\r\n candles = candles % b + new_candles\r\n #we take (candles % b) as we need to also keep count of the number of spent candles used in making a new candle\r\n hours_lit_up += new_candles * b\r\nhours_lit_up += candles\r\n\r\nprint(hours_lit_up)", "a, b = [int(a) for a in input().split()]\r\n\r\nhours = a\r\nleftov = a\r\n\r\nwhile leftov - b >= 0:\r\n leftov -= b\r\n leftov += 1\r\n hours += 1\r\n\r\nprint(hours)", "def main():\n a, b = map(int, input().split())\n h = a\n\n while a >= b:\n d = a // b\n h += d\n m = a % b\n a = d + m\n\n print(h)\n\nif __name__ == \"__main__\":\n main()\n", "a, b = map(int, input().split())\r\ntotal, left = 0, 0\r\nwhile a >= b:\r\n total += a//bb\r\n a -= a//bb-a//b\r\nprint(total+a)", "a, b = map(int, input().split())\r\ncnt = a\r\n\r\nwhile True:\r\n cnt += a//b\r\n a = a//b+a%b\r\n if a%b==a:\r\n break\r\nprint(cnt)", "numbers = [int(i)for i in input().split()]\r\na = numbers[0]\r\nb = numbers[1]\r\nremain = 0\r\ncandles = a\r\nworn = 0\r\ntotal = 0\r\nwhile True:\r\n hours = candles\r\n total+=hours\r\n if hours==0:\r\n break\r\n worn = candles+remain\r\n candles = 0\r\n hours = 0\r\n candles = worn//b\r\n remain = worn%b\r\n \r\nprint(total)\r\n", "def main() -> int:\r\n\r\n a, b = tuple(int(x) for x in input().split())\r\n result = a\r\n while a >= b:\r\n tmp = a // b\r\n result += tmp\r\n a = tmp + a % b\r\n\r\n return result\r\n\r\nif __name__ == '__main__':\r\n print(main())", "a,b=[int(x) for x in input().split()]\r\nres=a\r\nwhile a//b>0:\r\n res+=a//b\r\n a=a//b+a%b\r\nprint(res)", "a,b=map(int,input().split())\r\n\r\nextra=a//b \r\nx=(a+extra)//b\r\nwhile x<a:\r\n x=(a+x)//b\r\n if x==(a+x)//b:\r\n break\r\nprint(a+x)\r\n", "a,b=[int(x) for x in input().split()]\r\nsum1=0\r\nsum2=0\r\nwhile(a>0):\r\n a=a-1\r\n sum1+=1\r\n sum2=sum2+1\r\n if sum1==b:\r\n a=a+1\r\n sum1=0\r\n\r\nprint(sum2)", "a, b = map(int, input().split())\r\ns = 0\r\nnot_used = a\r\nwhile not_used//b:\r\n a = not_used\r\n not_used = 0\r\n while a:\r\n s+=a-a%b\r\n not_used+=a%b\r\n a//=b\r\nprint(s+not_used)", "a,b=map(int,input().split())\r\nk=0\r\nh=0\r\nwhile a>0:\r\n h+=a\r\n k+=a\r\n a=0\r\n if k >= b:\r\n a=k//b\r\n k-=k//bb\r\nprint(h)", "a=list(map(int,input().split()))\r\nb=a[0]\r\nc=a[1]\r\nd=0\r\ne=0\r\nwhile b!=0:\r\n d+=1\r\n e+=1\r\n b-=1\r\n if e==c:\r\n b+=1\r\n e=0\r\nprint(d)", "a, b = (int(i) for i in input().split())\nres = w = 0\nwhile a:\n res += a\n w += a\n a, w = divmod(w, b)\nprint(res)\n", "san1, san2 = map(int, input().split())\r\n\r\n# Vasily can light up the room for a maximum of (san1 + (san1-1)//(san2-1)) hours\r\n# Explanation: The first term (san1) represents the initial burning of the first candle.\r\n# The second term ((san1-1)//(san2-1)) represents the number of new candles he can make from the burned-out candles.\r\n\r\nprint(san1 + (san1-1)//(san2-1))\r\n", "a, b = [int(x) for x in input().split()]\r\ncandles = a\r\nbuff = 0\r\nans = 0\r\nwhile (candles):\r\n ans += 1\r\n candles -= 1\r\n buff += 1\r\n if buff == b:\r\n candles += 1\r\n buff = 0\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\na2, count = 0, 0\r\nwhile a > 0:\r\n count += 1\r\n if count%b != 0:\r\n a -= 1\r\nprint(count)\r\n", "a, b = [int(x) for x in input().split()]\r\nrem = a % b\r\ntemp = a // b\r\nans = temp + rem\r\ncount = a\r\n\r\nwhile temp >= 1:\r\n count += temp\r\n a = ans\r\n rem = a % b\r\n temp = a // b\r\n ans = temp + rem\r\n\r\nprint(count)", "a, b = map(int, input().split())\r\nost = 0\r\nt = 0\r\nwhile a > 0:\r\n t += 1\r\n a -= 1\r\n ost += 1\r\n if ost == b:\r\n a += 1\r\n ost -= b\r\nprint(t)\r\n", "a,b= map(int, input().split());c = 0\r\nwhile a >= b:\r\n c += b;a -= b;a += 1\r\nprint(c+a)\r\n", "a, b = map(int, input().split())\r\n\r\ntotal = a\r\nleft = a\r\n\r\nwhile left >= b:\r\n candle = left // b\r\n left = left % b + candle\r\n total += candle\r\n\r\nprint(total)", "a, b = map(int, input().split())\r\n\r\nk = 0\r\nhour = 0\r\nwhile a > 0:\r\n a -= 1\r\n k += 1\r\n if k == b:\r\n a += 1\r\n k -= b\r\n hour += 1\r\n\r\nprint(hour)\r\n", "a, b = [int(x) for x in input().split()]\r\nt = 0\r\nwhile a > 0:\r\n a -= 1\r\n t += 1\r\n if t%b==0:\r\n a += 1\r\nprint(t)\r\n", "a, b = map(int, input().split())\r\nhours = 0\r\nwhile a > 0:\r\n a -= 1\r\n hours += 1\r\n if hours % b == 0:\r\n a += 1\r\nprint(hours)", "a,b=([int(x) for x in input().split()])\r\nc=a/b\r\ne=1/b\r\nd=0\r\nd=d+a\r\na=c\r\nwhile a>=1:\r\n a=a-1+e\r\n d=d+1\r\nprint(d)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nrem = 0\r\nwhile a > 0:\r\n ans += a\r\n a += rem\r\n rem = a%b\r\n a = a // b\r\nprint(ans)", "v,v1=map(int,input().split());c=v;c1=0\r\nwhile v>=v1:\r\n c1=v//v1;c+=c1;v=v%v1 + c1\r\nprint(c) ", "a, b = map(int, input().split(\" \"))\r\n\r\n\r\ndef candle_hour(a, b):\r\n candles = 0\r\n used = a\r\n for i in range(a + b):\r\n #print(used)\r\n if used >= b:\r\n candles += 1\r\n used += 1\r\n used -= b\r\n \r\n return a + candles\r\nprint(candle_hour(a, b))", "a,b=map(int,input().split())\r\nx=a\r\nwhile a>=b:\r\n c=a//b\r\n x+=c\r\n d=a%b\r\n a=c+d\r\nprint(x)", "# 379A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\na,b=sp_inp()\r\ncandles=0\r\nwhile(a!=0):\r\n candles+=1\r\n if(candles%b==0):\r\n candles+=1\r\n a-=1\r\nprint(candles)", "a, b = map(int, input().split())\r\nc = 0\r\n\r\nwhile a >= b:\r\n c += b\r\n a -= b\r\n a+= 1\r\nprint(c+a)", "class PDInput:\r\n def __init__(self) -> None:\r\n self._raw_input = input()\r\n self._raw_input_list = self._raw_input.split(' ')\r\n \r\n def get_int(self) -> int:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return int(self._raw_input_list.pop(0))\r\n \r\n def get_str(self) -> str:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return self._raw_input_list.pop(0)\r\n \r\n def get_float(self) -> float:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return float(self._raw_input_list.pop(0))\r\n \r\n def get_bool(self) -> bool:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return bool(self._raw_input_list.pop(0))\r\n \r\n def get_list(self, is_int=False, is_float=False, is_bool=False, is_str=False) -> list:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return_list = list()\r\n for each_item in self._raw_input_list:\r\n if is_int: return_list.append(int(each_item))\r\n elif is_float: return_list.append(float(each_item))\r\n elif is_bool: return_list.append(bool(each_item))\r\n elif is_str: return_list.append(str(each_item))\r\n self._raw_input_list = list()\r\n return return_list\r\n\r\n\r\nif __name__ == '__main__':\r\n pd_input = PDInput()\r\n\r\n candles, restore_candles = pd_input.get_list(is_int=True)\r\n count = went_out_candles = 0\r\n\r\n while(candles != 0):\r\n candles -= 1\r\n went_out_candles += 1\r\n if went_out_candles == restore_candles:\r\n went_out_candles = 0\r\n candles += 1\r\n count += 1\r\n\r\n print(count)\r\n", "a,b=list(map(int,input().split()))\r\nnw=0\r\nhr=0\r\nwhile int(a)>0:\r\n hr+=1\r\n a-=1\r\n nw+=1\r\n if nw==b:\r\n a+=1\r\n nw=0\r\nprint(hr)", "a,b=map(int,input().split())\r\ns=a\r\ni=a//b\r\nl=a%b\r\nwhile i!=0:\r\n s+=i\r\n l+=(i%b)\r\n i//=b\r\nwhile l>=b:\r\n s+=(l//b)\r\n l=(l%b)+(l//b)\r\nprint(s)", "a, b = map(int, input().split())\r\nsum = 0\r\nx = a\r\nhourscount = 0\r\nwentOut = 0\r\nwhile x != 0:\r\n x -= 1\r\n wentOut += 1\r\n hourscount += 1\r\n if(wentOut == b):\r\n x += 1\r\n wentOut = 0\r\nprint(hourscount)\r\n", "# https://codeforces.com/problemset/problem/379/A\r\n\r\ndef main():\r\n a, b = map(int, input().split(' '))\r\n remain = 0\r\n result = 0\r\n while a > 0:\r\n result += a\r\n remain += a\r\n a = remain // b\r\n remain = remain % b\r\n # print(a)\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = input().split()\r\na, b = int(a), int(b)\r\nc = x = 0\r\nwhile a:\r\n c += a\r\n temp = (a+x) // b\r\n x = (a+x) % b\r\n a = temp \r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nk=0\r\ns=0\r\nwhile a>0:\r\n a-=1\r\n s+=1\r\n if s==b:\r\n a+=1\r\n s=0\r\n k+=1\r\nprint(k)", "a,b = map(int,input().split())\nc = 0\nwhile a>0:\n a-=1\n c+=1\n if c%b==0:\n a+=1\nprint(c)\n\n\n\n\n", "a,b = map(int,input().split())\r\nk = 0\r\nz = 0\r\nfor i in range(a):\r\n k += 1\r\n z += 1\r\n if z==b:\r\n k += 1\r\n z=1\r\nprint(k)", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>=b:\r\n s+=(a//b)\r\n a=a//b+a%b\r\nprint(s)", "n, m = map(int, input().split())\r\nk = 1\r\nwhile n:\r\n\tif k % m == 0:n+=1\r\n\tn -= 1\r\n\tk+=1\r\nprint (k-1)", "a,b=map(int, input().split())\r\ncount=a\r\nwhile a>a%b:\r\n count+=a//b\r\n a=(a//b)+(a%b)\r\nprint(count)\r\n \r\n", "a,b=map(int,input().split())\r\ns=[a]\r\ni=1\r\nt=a\r\nwhile (a>=b):\r\n t+=int(a/b)\r\n da=s[i-1]-b(int(a/b))\r\n a=da+int(a/b)\r\n s.append(a)\r\n i+=1\r\n \r\nprint(t)\r\n", "a, b = map(int, input().split())\r\nh = a\r\no = 0\r\nwhile a>=b:\r\n h+=a//b\r\n o += a % b\r\n a = a // b\r\n if a<b:\r\n a+=o\r\n o=0\r\n\r\nprint(h)", "# LUOGU_RID: 101541511\na, b = map(int, input().split())\r\nans = c = 0\r\nwhile a:\r\n ans += 1\r\n a -= 1\r\n c += 1\r\n if c == b:\r\n c = 0\r\n a += 1\r\nprint(ans)", "j, k = map(int, input().split())\r\nx = j\r\nwhile j - k >= 0:\r\n j -= k\r\n x += 1\r\n j += 1\r\nprint(x)", "from collections import Counter\r\ndef solve():\r\n n,b=map(int,input().split());c=n\r\n while n>=b:rem=n%b;n//=b;c+=n;n+=rem\r\n print(c)\r\nsolve()", "result = 0\r\ndef solver(a, b):\r\n if a<b:\r\n return\r\n global result\r\n result += a//b\r\n solver(a//b+a%b, b)\r\na, b = map(int,input().split())\r\nresult = a\r\nsolver(a, b)\r\nprint(result)", "a, b = map(int, input().split())\r\nhours = a\r\nwhile a//b > 0:\r\n hours += a//b\r\n a = a//b + (a % b)\r\nprint(hours)", "a, b = map(int,input().split())\nk = 0\nx = 0\nwhile a>0:\n a-=1\n x+=1\n k+=1\n if k==b:\n k=0\n a+=1\nprint(x)\n \n\n\n", "def solve(svechi, zapas, count, b):\r\n count += svechi\r\n if svechi + zapas >= b:\r\n return solve((svechi + zapas) // b, (zapas + svechi) - ((svechi + zapas) // b) * b, count, b)\r\n else:\r\n return count\r\n\r\n \r\n\r\ncount, zapas = 0, 0\r\nsvechi, b = map(int, input().split())\r\nprint(int(solve(svechi, zapas, count, b)))", "def main():\r\n n = input().split()\r\n amount_of_candles = int(n[0])\r\n min_for_new_candle = int(n[1])\r\n extinguished_candles = 0\r\n hours = 0\r\n while amount_of_candles > 0 or extinguished_candles >= min_for_new_candle:\r\n if extinguished_candles >= min_for_new_candle:\r\n extinguished_candles -= min_for_new_candle\r\n amount_of_candles += 1\r\n amount_of_candles -= 1\r\n extinguished_candles += 1\r\n hours += 1\r\n print(hours)\r\nmain()", "n,m=map(int,input().split())\r\nr=(n-1)//(m-1)\r\nprint(n+r)", "a, b = list(int(num) for num in input().split())\r\nc = 0\r\ntime = 0\r\nwhile not(a == 0 and c < b):\r\n time += a\r\n tmp = a\r\n a = (a + c) // b\r\n c = (tmp + c) % b\r\n\r\nprint(time)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\ncandles_out = a\r\n\r\nwhile candles_out >= b:\r\n candles_out += 1 - b\r\n total_hours += 1\r\n\r\nprint(total_hours)", "a, b = map(int, input().split())\ncel = 0\npotyx = a\nans = a\n\nwhile potyx >= b:\n cel += potyx // b\n potyx %= b\n ans += cel\n potyx += cel \n cel = 0\nprint(ans)\n ", "candles,b=input().split()\n(candles,b)=(int(candles),int(b))\nnoofburntcandles=candlesb\n\ndef hour_calc(prev_hrs,noofburntcandles,b):\n new_hours=prev_hrs+int(noofburntcandles/b)\n noofburntcandles=int(noofburntcandles/b)+noofburntcandles%b\n if noofburntcandles>=b:\n hour_calc(new_hours,noofburntcandles,b)\n else:\n print(new_hours)\n \nprev_hrs=0\nhour_calc(prev_hrs,noofburntcandles,b)\n", "A=list(map(int, input().split()))\r\na=A[0]\r\nb=A[1]\r\nk=a\r\np=a\r\na=0\r\nwhile p//b>0:\r\n a+=p//b\r\n p=p%b\r\n k+=a\r\n p+=a\r\n a=0\r\nprint(k)\r\n\r\n", "import math\r\n#f = open(\"test.txt\")\r\n\r\na, b = map(int, input().split())\r\nc = a\r\nwhile(a >= b):\r\n t = a % b\r\n a = a // b\r\n c = c + a\r\n a = a + t\r\nprint(c)", "inp = input().split()\r\n\r\na = int(inp[0])\r\nb = int(inp[1])\r\ncounter = 0\r\nsol = 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n counter += 1\r\n sol += 1\r\n if counter == b:\r\n a += 1\r\n counter = 0\r\nprint(sol)\r\n", "a,b = map(int, input().split())\r\ntime = 0\r\nout_candle = 0\r\nwhile 1:\r\n time += a\r\n out_candle += a\r\n a = out_candle // b\r\n out_candle %= b\r\n if a + out_candle < b:\r\n time += a\r\n break\r\nprint(time)", "q, w = map(int, input().split())\r\ne = 0\r\nr = 0\r\nwhile(q > 0):\r\n e += q\r\n f = r\r\n r = (q + r) % w\r\n q = (q + f) // w\r\n #print(e, q, r)\r\nprint(e)", "a,b = map(int,input().split())\r\nc1,c2 = a,0\r\nans= 0\r\nwhile c1 > 0:\r\n ans += c1\r\n c2 += c1\r\n c1,c2 = divmod(c2,b)\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nc=0\r\nd=0\r\nwhile n>0:\r\n c=c+1\r\n d=d+1\r\n n=n-1\r\n if d==m:\r\n n=n+1\r\n d=0\r\nprint(c)", "a,b=map(int,input().split())\ns1=0\ns=0\nwhile a>0:\n if s==b:\n a+=1\n s=0\n s+=1\n s1+=1\n a-=1\nif s==b:\n s1+=1\nprint(s1)\n", "a, b = map(int, input().split())\r\ncount = 0\r\nm = 0\r\nwhile a != 0:\r\n count += 1\r\n m += 1\r\n a = a-1\r\n if m == b:\r\n a += 1\r\n m = 0\r\n \r\nprint(count)", "a, b = map(int, input().split())\r\nres = a\r\nwhile a >= b:\r\n c = a // b\r\n res += c\r\n a = a % b\r\n a += c\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nsumma = 0\r\nqoldiq = 0\r\nwhile a > 0:\r\n qoldiq += a\r\n summa += a\r\n a = qoldiq // b\r\n qoldiq %= b\r\nprint(summa)\r\n", "a, b = map(int, input().split())\r\nhours = a\r\nleftover = a\r\n\r\nwhile leftover >= b - 1:\r\n new_candles = leftover // (b - 1)\r\n hours += new_candles\r\n leftover = leftover - new_candles (b - 1)\r\n\r\nif leftover > 0:\r\n hours += 1\r\n\r\nprint(hours-1)\r\n", "import sys\r\n\r\na, b = [int(i) for i in input().split()]\r\n\r\nhours = 0\r\nhave = a\r\nused = 0\r\n\r\nwhile have != 0 or used >= b:\r\n if used >= b:\r\n hours += 1\r\n used -= b - 1\r\n\r\n else:\r\n hours += 1\r\n have -= 1\r\n used += 1\r\n #rint(have)\r\n #print(used)\r\n #print('')\r\nprint(hours)", "array = list(map(int,input().strip().split()))\r\n\r\ndef happy(a,b,t=0):\r\n if a >= b:\r\n t += b + happy(a - b + 1,b,t)\r\n return (t)\r\n else:\r\n t += a\r\n return (t)\r\n\r\nprint(happy(array[0],array[1]))", "a,b=list(map(int,input().split()))\r\ndef cd(rem=a,t=a):\r\n if rem<b:\r\n return t\r\n else:\r\n return cd((rem%b)+rem//b,t+rem//b)\r\nprint(cd())", "a,b=map(int,input().split())\r\nw=a-10+10\r\nwhile a//b!=0:\r\n w=w+(a//b)\r\n a=(a//b)+(a%b)\r\nprint(w)", "a, b = [int(x) for x in input().split()]\r\nhours = a\r\nwhile a >= b:\r\n hours += a//b\r\n a = a//b + a%b\r\nprint(hours)", "a,b=[int(_) for _ in input().split()]\r\ngodz=a\r\nile=a-a%b\r\nwhile godz>=b:\r\n godz=godz//b+godz%b\r\n ile+=godz-godz%b\r\nprint(ile+godz%b)", "a, b = map(int, input().split())\r\ntime = a\r\nwhile a >= b:\r\n a = a - b + 1\r\n time += 1\r\nprint(time)", "n,b=map(int,input().split())\r\nt=n\r\nwhile n>=b:\r\n n=(n-b)+1\r\n t+=1\r\nprint(t)", "a,b = map(int,input().split())\r\nres = a\r\n\r\nwhile a//b != 0:\r\n res += a//b\r\n a = a//b + a%b\r\nprint(res)", "a, b = map(int, input().split())\r\n\r\ncurr = a\r\nhours = 0\r\nwhile(a):\r\n a-=1\r\n hours +=1\r\n if hours %b == 0:\r\n a += 1\r\n\r\nprint(hours)", "n, a = map(int, input().split())\r\nif a> n :\r\n print(n)\r\nelse:\r\n print(n + (n - 1) // (a - 1))\r\n", "n, m = map(int, input().split())\r\ni = 0\r\nc = 0\r\nwhile n != 0:\r\n n -= 1\r\n i += 1\r\n if n == 0:\r\n n = i//m - c\r\n c = i//m\r\nprint(i)", "num = input().split(\" \")\r\na = int(num[0])\r\nb = int(num[1])\r\n\r\ntot = a\r\n\r\nwhile a >= b:\r\n tot += a // b\r\n a = a // b + a % b\r\n\r\nprint(tot)", "def newyear(a,b):\n c,d=0,0\n while(a+d>=b):\n c+=1\n d+=1\n a-=1\n if d==b:\n d=0\n a+=1\n return c+a\n\na,b=map(int,input().split())\nprint(newyear(a,b))", "a, b = map(int, input().split())\r\nk = a\r\nwhile a >= b:\r\n s = a // b\r\n k += s\r\n m = a % b\r\n a = s + m\r\nprint(k)", "given = input().split()\r\nnewCandles = int(given[0])\r\ntoMakeaNew = int(given[1])\r\nremainder = 0\r\ntotaltime = 0\r\nwhile newCandles != 0:\r\n totaltime += newCandles\r\n remainder += newCandles\r\n newCandles = (remainder)//toMakeaNew\r\n remainder = remainder%toMakeaNew\r\nprint(totaltime)", "a,b = map(int,input().split())\r\npot = 0\r\ntime=0\r\nwhile (pot>=b)or(a!=0):\r\n if a!=0:\r\n pot+=a\r\n time+=a\r\n a=0\r\n else:\r\n a+=pot//b\r\n pot = pot%b\r\nprint(time)\r\n \r\n", "from collections import defaultdict\r\nints = lambda: list(map(int, input().split()))\r\nmp = defaultdict(int)\r\na, b = ints()\r\n\r\ns = 0\r\nf = a\r\ng = 0\r\nwhile a > 0:\r\n a-=1\r\n s+=1\r\n g += 1\r\n if s == b:\r\n s = 0\r\n a+=1\r\nprint(g)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sun Sep 10 15:27:23 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\na, b = map(int, input().split())\r\nused = 0\r\nt = 0\r\nwhile True:\r\n a -= 1\r\n used += 1\r\n t += 1\r\n if used == b:\r\n a += 1\r\n used = 0\r\n if a == 0:\r\n print(t)\r\n break", "a,b=map(int,input().split())\r\nc=0\r\nwhile a>0:\r\n a-=1\r\n c+=1\r\n if c%b==0:\r\n a+=1\r\nprint(c)", "a, b = map(int,input().split())\r\nhours = 0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n if hours % b == 0:\r\n a+=1\r\nprint(hours)", "a,b=map(int,input().split())\r\ncount=a\r\nwhile a>=b:\r\n count=count+a//b\r\n a=(a//b)+(a%b)\r\nprint(count)", "from sys import stdin, stdout\r\na, b = map(int, stdin.readline().strip().split())\r\ntotal = 0\r\ncombined = 0 \r\nleft_to_combine = 0 \r\nwhile(True):\r\n total+=a \r\n combined = a//bb \r\n left_to_combine+=(a-combined)\r\n a = combined//b\r\n if(left_to_combine>=b):\r\n combined1 = left_to_combine//bb \r\n a+=combined1//b \r\n left_to_combine-=combined1 \r\n if(a==0):\r\n break\r\nstdout.write(f\"{total}\\n\")", "candle, recycling = map(int, input().split())\r\nhour = 0\r\nwhile candle > 0:\r\n candle -= 1\r\n hour += 1\r\n if hour % recycling == 0:\r\n candle += 1\r\nprint(hour)", "import sys\na, b = map(int, sys.stdin.readline().rstrip().split())\nt = 0\nc = 0 \nwhile a > 0:\n t += 1\n a -= 1\n c += 1\n if c == b:\n a += 1\n c = 0\nprint(t)\n", "a,b = map(int,input().split())\r\nx = a\r\nwhile a >= b:\r\n y = a % b\r\n a = a // b\r\n x += a\r\n a += y\r\n\r\nprint(x)\r\n\r\n", "a, b = map(int,input().split())\r\n\r\nnumber_end = 0\r\n\r\nwhile a > 0:\r\n \r\n a -= 1 \r\n number_end += 1\r\n if number_end != 0 and number_end%b == 0:\r\n a += 1 \r\n \r\nprint(number_end)", "\r\nv1,v2=map(int,input().split());v=v1;c=0\r\nwhile v1>=v2:\r\n c=v1//v2;v+=c;v1=v1%v2+c\r\nprint(v)\r\n\r\n", "y,m=map(int,input().split())\r\nd=0\r\nf=0\r\nwhile y>0:\r\n y-=1\r\n d+=1\r\n if d==m:\r\n d=0\r\n y+=1\r\n f+=1\r\nprint(f) ", "a,b=map(int,input().split());print((ab-1)//(b-1))\r\n", "from ctypes.wintypes import tagMSG\r\n\r\n\r\n[a,b]=[int(i) for i in input().split()][:2]\r\n\r\ndef f(a,b,t):\r\n x=(a//b)+(a%b)\r\n if x<b:\r\n return t+(a//b)\r\n else:\r\n t+=a//b\r\n return(f(x,b,t))\r\n\r\n\r\nprint(f(a,b,a))\r\n", "def sol():\r\n a,b=map(int,input().split(\" \"))\r\n used=a\r\n ans=a\r\n while used >=b:\r\n\r\n x=int(used/b)\r\n\r\n ans+=x\r\n used=used-(bx)+x\r\n\r\n print(ans) \r\n\r\n\r\n\r\n\r\n\r\nsol()\r\n", "s=input().split()\r\nfull=int(s[0])\r\nmulti=int(s[1])\r\ncurr=0\r\ntime=0\r\nfor i in range(2000):\r\n time += full\r\n curr += full\r\n full=0\r\n if curr>=multi:\r\n full+=curr//multi\r\n curr=curr%multi\r\n\r\n\r\nprint(time)\r\n\r\n", "a,b = map(int,input().split())\nsumi = a\nwhile(a>=b):\n div = (a//b)\n sumi+= div\n mod = (a%b)\n a= (div+mod)\nprint(sumi)\n\t \t\t \t\t \t\t\t\t\t \t\t \t \t\t \t \t\t", "def solve():\r\n a, b = map(int, input().split())\r\n ans = 0\r\n k = 0\r\n while a>0:\r\n ans = ans+1\r\n k = k+1\r\n a = a-1\r\n if k==b:\r\n k = 0\r\n a = a+1\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "A,B=map(int,input().split())\r\nans=A\r\nwhile A>=B:\r\n ans+=A//B\r\n A=A//B+A%B\r\nprint(ans)", "a,b=map(int,input().split())\r\nsum=a\r\nwhile a//b>=1:\r\n sum+=a//b\r\n a=(a//b)+a%b\r\nprint(sum)", "a,b=map(int,input().split())\r\nc=0\r\nx=0\r\nwhile a>0:\r\n c+=a\r\n x+=a\r\n a=0\r\n a=x//b\r\n x%=b\r\nprint(c)", "a,b=map(int,input().split())\r\nif b>a:\r\n print(a)\r\nelse:\r\n h=a\r\n y=a\r\n while(y>=b):\r\n h+=y//b\r\n y=y%b+y//b\r\n print(h)", "a, b = [int(a) for a in input().split()]\r\n\r\nhours = a\r\nleft = 0\r\n\r\nwhile a >= b:\r\n hours += a // b\r\n a = a % b + a // b\r\n\r\nprint(hours)\r\n", "for Ram in range(1):\r\n a,b=map(int,input().split())\r\n ans=0\r\n while a>=b:\r\n ans+=(a//b)b\r\n a=a%b + a//b\r\n ans+=a\r\n print(ans)", "a, b = map(int, input().split())\r\n\r\ncount = 0\r\nwhile a != 0:\r\n a -= 1\r\n count += 1\r\n if count % b == 0:\r\n a += 1\r\n if a == 0:\r\n break\r\n\r\nprint(count)", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vkiefner\r\n#\r\n# Created: 01.06.2023\r\n# Copyright: (c) vkiefner 2023\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\na, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\nburnt_out_candles = a\r\n\r\nwhile burnt_out_candles >= b:\r\n new_candles = burnt_out_candles // b\r\n total_hours += new_candles\r\n burnt_out_candles = burnt_out_candles % b + new_candles\r\n\r\nprint(total_hours)\r\n\r\n\r\n'''\r\nimport math\r\n\r\na, b = (input().split(\" \"))\r\na = int(a)\r\nb = int(b)\r\nprint(math.floor(a+a/b+a/b/b))\r\n'''\r\n", "#\r\n ##### ##### ###### # #\r\n # # # # # ## ##\r\n # # # # ##### # ## #\r\n ##### ##### # # #\r\n # # # # # #\r\n # # # ###### # #\r\n #\r\n\r\nl = [int(i) for i in input().split()]\r\nn = l[0]\r\nk = l[1]\r\nans=n\r\nwhile n!=0 :\r\n ans+=n//k\r\n if n%k!=0 :\r\n a=n%k\r\n n = n//k\r\n if n!=0 :\r\n n+=a\r\n else :\r\n a=0\r\n n=n//k\r\nprint(ans)", "from sys import stdin\r\n\r\ninp = stdin.readline\r\n\r\na, b = map(int, inp().split())\r\ncount = a\r\npassed = 0\r\n\r\nwhile True:\r\n if count // b == passed // b:\r\n break\r\n\r\n count, passed = count + (count - passed) // b, passed + ((count - passed) // b) b\r\n\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nans=0\r\ncandles=a\r\nwhile candles>0:\r\n candles-=1\r\n ans+=1\r\n if ans%b==0:\r\n candles+=1\r\nprint(ans)", "a, b = map(int, input().split(\" \"))\ndef solve(a, b):\n if a < b:\n return 0\n return a // b + solve((a // b) + (a % b), b)\nprint(a + solve(a, b))", "I = input\ni = I().split()\na = (int(i[0])-1)//(int(i[-1])-1)\nprint(a+int(i[0]))\n", "import math\r\nfrom collections import \r\ndef solve():\r\n\r\n a,b = map(int,input().split())\r\n c = 0\r\n while a>=b:\r\n a-=b\r\n a+=1\r\n c+=b\r\n print(c+a)\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "a, b = map(int, input().split())\r\ncurb = 0 \r\ncurb += a\r\nwhile a >= b:\r\n curb += a // b\r\n a = a // b + a % b\r\n \r\nprint(curb)\r\n", "a, b = list(map(int, input().split()))\r\nans = 0\r\nwhile a >= b:\r\n i = a//b \r\n j = a%b\r\n i = ib\r\n ans += i\r\n a = a//b + j\r\nprint(ans + a)", "import sys\r\nimport math\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n\r\ndef yo(burnout, total_count):\r\n new= int(burnout/b)\r\n if new==0:\r\n print(total_count)\r\n return\r\n burnout= burnout%b\r\n total_count+=new\r\n burnout+=new\r\n yo( burnout, total_count)\r\n \r\na= numbers[0]\r\nb= numbers[1]\r\nyo(a,a)", "a,b = map(int,input().split())\r\nhour = a + a//b\r\nwhile a >= b:\r\n a = a//b + a % b\r\n hour += a // b\r\nprint(hour)", "a,b=map(int , input().split())\r\nd=a\r\nc=0\r\nwhile d//b>=1:\r\n c+=(d//b)\r\n d=(d//b)+(d%b)\r\nprint(a+c)\r\n", "a,b=map(int,input().split())\r\nx=a\r\nans=0\r\nwhile(x>=b):\r\n ans+=x//b\r\n x=x%b+x//b\r\nprint(ans+a)\r\n ", "a, b = map(int, input().split())\r\ncount = 0\r\ncount_2 = 0\r\nwhile a !=0:\r\n a = a-1\r\n count = count+1\r\n count_2 = count_2+1\r\n if count_2 == b:\r\n a = a+1\r\n count_2 = 0\r\n\r\nprint(count)", "a,b=map(int,input().split())\r\nt=a\r\ns=0\r\nwhile a//b>0:\r\n s+=a//b\r\n a=a//b+a%b\r\nprint(s+t)", "a,b=map(int,input().split())\r\nprint(((a-1)//(b-1))+a)", "n, k = map(int,input().split())\r\ntt = n\r\nwhile n > 1:\r\n if n >= k:\r\n n -= k-1\r\n tt += 1\r\n else:\r\n break\r\nprint(tt)\r\n", "a, b = map(int, input().split())\r\n\r\ninitial_burning_time = a\r\n\r\nburning_time_of_new_candles = 0\r\n\r\nwhile a >= b:\r\n new_candles = a // b\r\n \r\n remaining_candles = a % b\r\n \r\n burning_time_of_new_candles += new_candles\r\n \r\n # Update the total number of candles\r\n a = new_candles + remaining_candles\r\n \r\ntotal_burning_time = initial_burning_time + burning_time_of_new_candles\r\n\r\nprint(total_burning_time)\r\n", "import math\r\na,b=list(map(int,input().split(\" \")))\r\nres=a\r\nli=res\r\nwhile(li>=1):\r\n li/=b\r\n res+=li\r\nprint(int(res))", "a,b=map(int,input().split())\r\ns=a\r\nk=(a//b)\r\nwhile(k!=0):\r\n r=a%b\r\n s=s+k\r\n a=k+r\r\n k=(a//b)\r\nprint(s)\r\n ", "a, b = [int(thing) for thing in input().split()]\r\ncount = 0\r\nwornout = 0\r\nwhile a != 0:\r\n count += a\r\n wornout += a\r\n a = wornout//b\r\n wornout %= b\r\n\r\nprint(count)", "a, b = map(int, input().split())\r\nh, r = 0, 0\r\nwhile a > 0 or r >= b:\r\n h += a\r\n r += a\r\n a, r = r // b, r % b\r\nprint(h)\r\n", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>0:\r\n\ta-=(b-1)\r\n\ts+=1\r\nprint(s-1)", "a,b=map(int,input().split())\r\nx=a\r\ny=0\r\nz=0\r\nwhile(a>=b):\r\n y=a//b\r\n x+=y\r\n z=a%b\r\n a=y+z\r\nprint(x)\r\n", "import sys\r\na, b = map(int, sys.stdin.readline().strip().split())\r\nc = a\r\nh = 0\r\nbo = 0\r\nwhile a > 0 :\r\n h += 1\r\n a -= 1\r\n bo += 1\r\n if bo == b :\r\n bo = 0\r\n a += 1\r\nprint(h)", "n, md = map(int, input().split())\r\ncount_n = 0\r\ndays = 0\r\nwhile n != 0:\r\n count_n += 1\r\n days += 1\r\n n -= 1\r\n if count_n == md:\r\n count_n -= md\r\n n += 1\r\nprint(days)", "a,b = map(int,input().split())\r\nprint((ab-1)//(b-1))", "import math\n\narr = [int(_) for _ in input().split()]\nans = 0\nwhile arr[0] > 1:\n ans += arr[0]\n arr[0] /= arr[1]\n\nprint(math.floor(ans + arr[0]))\n", "\r\n\r\n\r\ndef new_year_candles():\r\n\r\n\r\n\r\n num_candles,burnt_out_candles_to_make_new_one = map(int,input().split())\r\n\r\n\r\n num_burnt_out_candles = 0\r\n\r\n \r\n days = 0\r\n while num_candles:\r\n days += num_candles\r\n num_burnt_out_candles += num_candles\r\n\r\n num_candles = num_burnt_out_candles // burnt_out_candles_to_make_new_one\r\n num_burnt_out_candles = num_burnt_out_candles % burnt_out_candles_to_make_new_one\r\n\r\n\r\n\r\n print(days)\r\n\r\n\r\nnew_year_candles()\r\n\r\n\r\n\r\n\r\n", "from traceback import print_list\r\n\r\n\r\na,b = map(int,input().split())\r\nprint((ab-1)//(b-1))", "a,b=map(int,input().split())\r\nh=a\r\nwhile(a>=b):\r\n x=a//b\r\n y=a-b(a//b)\r\n a=x+y\r\n h+=x\r\nprint(h)", "a,b=map(int,input().split())\r\nsum=0\r\nost=0\r\nwhile a>0:\r\n sum+=a\r\n ost+=a\r\n a=0\r\n a+=ost//b\r\n ost=ost%b\r\nprint(sum)", "def main():\n a, b = (int(_) for _ in input().split())\n\n count = a\n\n while a / b >= 1:\n count += int(a / b)\n a = int(a / b) + a % b\n\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "a, b = map(int, input().split())\r\n\r\nr = 0\r\nwhile a:\r\n r += 1\r\n if r % b != 0:\r\n a -= 1\r\n\r\nprint(r)\r\n", "a,b = map(int,input().split())\r\nc = 0\r\nz = 0\r\nwhile a>0:\r\n a-=1\r\n c+=1\r\n z+=1\r\n if z%b==0:\r\n a+=1\r\n z = 0\r\nprint(c)", "n,m=map(int,input().split())\r\nval=0\r\nremain=0\r\nwhile (n)>=1:\r\n val+=n\r\n remain+=n%m\r\n n//=m\r\nwhile remain>=m:\r\n val+=remain//m\r\n remain=remain//m+remain%m\r\nprint(val)", "a,b=map(int,input().split())\r\nt=a\r\nwhile a>=b:\r\n m=a//b\r\n t+=m\r\n a=(a%b)+(a//b)\r\nprint(t)", "a,b=map(int,input().split());print((a-1)//(b-1)+a)", "import sys\nLI=lambda:list(map(int,sys.stdin.readline().split()))\nMI=lambda:map(int,sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\n\"\"\" for _ in range(II()): \"\"\"\na, b=MI()\nans=0\nwhile a>0:\n ans+=min(a,b)\n a=a-b+1\nprint(ans)", "IN = lambda:list(map(int, input().split()))\r\n\r\nn, m = IN()\r\nx = n\r\nday = 0\r\nwhile n > 0:\r\n if (day%m != 0): n -= 1\r\n day += 1\r\n\r\nprint(day-1)\r\n", "def candle(a, b):\r\n sum = int(0)\r\n remain = int(0)\r\n while a > 0:\r\n sum += a\r\n a += remain\r\n remain = a % b\r\n a //= b\r\n return sum\r\n\r\n\r\nif __name__ == '__main__':\r\n _ = input().split()\r\n a = int(_[0])\r\n b = int(_[1])\r\n print(candle(a, b))", "nums = input()\r\n\r\nnums_list = nums.split()\r\nnums_list_ = [int(num) for num in nums_list]\r\na, b = nums_list_\r\n\r\nhours = a\r\nwhile a//b != 0:\r\n hours += a//b\r\n a = a//b + a%b\r\n\r\nprint(hours)", "a, b = map(int, input().split())\r\nans = a\r\nost = [a//b, a%b]\r\nwhile ost[0] >= 1:\r\n ans += ost[0]\r\n ost[1] += ost[0]\r\n ost[0] = ost[1]//b\r\n ost[1] = ost[1]%b\r\nprint(ans)", "a, b = map(int, input().split())\r\nc = 0\r\nwhile a > 0:\r\n a -= 1\r\n c += 1\r\n if c % b == 0:\r\n a += 1\r\nprint(c)", "a, b = map(int, input().split())\r\ns = a # Initially, consider the candles Vasily has\r\n\r\nwhile a >= b:\r\n # Calculate how many new candles can be obtained from the burned ones\r\n new_candles = a // b\r\n # Add the new candles to the total count\r\n s += new_candles\r\n # Calculate the remaining candles after making new ones\r\n a = a % b + new_candles\r\n\r\nprint(s)\r\n", "l1=[int(x)for x in input().split()]\r\nimport math\r\nadd=l1[0]\r\nn=l1[0]\r\np=l1[1]\r\nwhile(n>=p):\r\n add+=n//p\r\n n=n%p+n//p\r\nprint(add)", "a,b = map(int,input().split())\r\ncnt = a\r\nrslt = a\r\nfor i in range(a):\r\n if cnt >= b:\r\n x = cnt//b\r\n rslt = rslt + x\r\n cnt = x + (cnt - xb)\r\nprint(rslt)\r\n", "import sys\r\na,b = map(int, sys.stdin.readline().strip().split())\r\nsumm = a\r\nwhile a >= b:\r\n summ += a//b\r\n a = a//b + a%b\r\nprint(summ)", "a,b=map(int,input().split())\r\n\r\ncurra=a\r\ncurrb=a\r\n\r\nwhile currb>=b:\r\n curra+=currb//b\r\n currb=currb%b+currb//b\r\n\r\nprint(curra)\r\n ", "n=input().split(\" \")\r\nn[0],n[1]=int(n[0]),int(n[1])\r\ncount=n[0]\r\ni=0\r\nj=0\r\nwhile(n[0]>=n[1]):\r\n i=n[0]//n[1]\r\n j=n[0]%n[1]\r\n count+=i\r\n n[0]=i+j\r\n \r\n \r\nprint(count) \r\n ", "a, b = map(int, input().split())\r\ntotal, reserve = 0, 0\r\nwhile a > 0:\r\n total += a\r\n reserve += a\r\n a = reserve // b\r\n reserve %= b\r\nprint(total) ", "a, b = map(int, input().split())\r\ntime = a\r\nrest = a\r\nwhile rest//b != 0:\r\n time += rest//b\r\n rest = rest//b + rest%b\r\n\r\nprint(time)\r\n", "#https://codeforces.com/problemset/problem/379/A\na,b=map(int,input().split(' '))\ncount=0\nburnt=0\nwhile a>0:\n\tcount+=1\n\ta-=1\n\tburnt+=1\n\tif burnt>=b:\n\t\tburnt-=b\n\t\ta+=1\nprint(count)\n", "a, b = map(int, input().split())\r\nt = 0\r\nr = 0\r\n\r\nwhile a > 0:\r\n t += a\r\n a, r = divmod(a + r, b)\r\n\r\nprint(t)\r\n", "x,y=map(int,input().split())\r\nprint(x+int((x-1)/(y-1)))", "a, b = map(int, input().split())\r\nc1= 0\r\nc2 = 0\r\n\r\nwhile a > 0:\r\n c1 += 1\r\n c2 += 1\r\n if c2 == b:\r\n a += 1\r\n c2 = 0\r\n a -= 1 \r\n\r\nprint(c1)", "a, b = map(int, input().split())\r\n\r\nout = zapas = 0\r\nwhile a:\r\n a -= 1\r\n out += 1\r\n zapas += 1\r\n\r\n if zapas == b:\r\n zapas = 0\r\n a += 1\r\n\r\nprint(out)\r\n \r\n", "y=[int(q) for q in input().split()]\r\nw=y[0]\r\nwhile y[0]>=y[1]:\r\n w+=int(y[0]/y[1])\r\n y[0]=(y[0]%y[1])+int(y[0]/y[1])\r\nprint(w)\r\n \r\n", "import math\r\na,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n res=a//b\r\n sum=sum+res\r\n m=a%b\r\n a=res+m\r\nprint(sum)", "a,b = map(int,input().split())\r\nans = int(a)\r\nwhile a >= b :\r\n a-=(b-1)\r\n ans+=1\r\nprint(ans)", "a,b=map(int,input().split())\ni=1\nk=0\nwhile(a):\n k+=1\n i+=1\n a-=1\n if(k==b):\n a+=1\n k=0\n\nprint(i-1)\n", "a,b = map(int,input().split())\r\nn = a\r\nans = 0\r\nx = 1e9\r\n\r\nwhile x>0:\r\n \r\n x = a//b\r\n a = a%b + x \r\n ans+=x\r\n\r\nprint(ans+n)", "a,b = list(map(int,input().split()))\r\nhours = a\r\nwhile(a >= b):\r\n d = a // b\r\n hours += d\r\n m = a % b\r\n a = d + m\r\nprint(hours)", "# A_NEW YEAR Candels\r\na, b = map(int, input().split())\r\nres1 = a\r\naa = 0\r\nbb = 0\r\nresult = a\r\nwhile b <= res1:\r\n aa = res1 % b\r\n bb = (res1 - aa) / b\r\n result += bb\r\n res1 = aa + bb\r\nprint(int(result))\r\n", "a, b = map(int, input().split())\r\nh = 0\r\nx = 0\r\nwhile a!=0:\r\n\ta-=1\r\n\th+=1\r\n\tx+=1\r\n\tif x==b:\r\n\t\tx-=b\r\n\t\ta+=1\r\nprint(h)", "a,b = map(int,input().split())\r\nans = a\r\nused = 0\r\nwhile(a > 0):\r\n a -= 1\r\n used += 1\r\n if used == b:\r\n used = 0\r\n a += 1\r\n ans += 1\r\n\r\nprint(ans)", "c,b=map(int,input().split())\r\ncount=0\r\nr=0\r\nwhile c!=0:\r\n c1=c\r\n count+=c1\r\n c=(c1+r)//b\r\n r=(c1+r)%b\r\nprint(count)", "#379A - New Year Candles\r\n[n,m]=list(map(int,input().split()))\r\nk=n\r\nwhile n>=m:\r\n k+=n//m\r\n n=n%m+n//m\r\nprint(k)", "a, b = map(int,input().split())\r\nq = 0\r\not = 0\r\nwhile a!=0:\r\n a-=1\r\n q+=1\r\n if q%b == 0:\r\n a+=1\r\n q=0\r\n ot+=1\r\nprint(ot)", "a,b = map(int,input().split())\n\nans = 0\nans += a\ntmp = 0\nwhile a > 0:\n\ttmp += a%b\n\ta = a//b\n\tans += a\ntmp1 = 0\nwhile tmp > 0:\n\ttmp1 += tmp%b\n\ttmp = tmp//b\n\tans += tmp\ntmp2 = 0\n\nwhile tmp1 > 0:\n\ttmp2 += tmp1%b\n\ttmp1 = tmp1//b\n\tans += tmp1\n\n\nprint(ans)\n\n\n\n", "a,b=map(int,input().split())\r\nhours=a\r\nt=0\r\nk=a//b\r\nwhile(a>=b):\r\n k=a//b\r\n g=a%b\r\n t=t+k\r\n a=k+g\r\nprint(hours+t)", "a,b=map(int,input().split())\r\ns=a\r\nwhile(a>=b):\r\n s+=a//b\r\n a=(a%b)+(a//b)\r\nprint(int(s))", "a, b = map(int, input().split()) # 3 2\nx = a // b # 1\ny = a % b # 1\ncount = a + x # 4\nwhile (x + y) // b > 0:\n a = x + y\n x = a // b\n y = a % b\n count += x\nprint(count)\n", "a, b=map(int, input().split())\r\nt=0\r\nwhile a>0:\r\n a=a-1\r\n t=t+1\r\n if t%b==0:\r\n a+=1\r\nprint(t)\r\n", "n, k = map(int, input().split())\r\ncount = n\r\nrem= 0\r\nwhile n >= k:\r\n temp = n//k\r\n rem = n - temp * k\r\n count += temp\r\n n = temp + rem\r\n \r\nprint(count)", "a,b=map(int,input().split())\r\ntime=a \r\nwhile(a>=b):\r\n time+=a//b \r\n a=a//b+a%b\r\nprint(int(time))", "import math\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nnum=a+math.floor((a-1)/(b-1))\r\nprint(num)", "def sol(a, b):\r\n res, pool = 0, 0\r\n while a > 0:\r\n res += a\r\n a, pool = (a + pool) // b, (a + pool) % b\r\n return res\r\n \r\n \r\na, b = map(int, input().split())\r\nprint(sol(a, b))", "a, b, = list(map(int, input().split()))\r\nc = a\r\ncount = 0\r\nwhile a > 0:\r\n a = a - 1\r\n count += 1\r\n if count % b == 0:\r\n count += 1\r\nprint(count)", "candles,materials=map(int,input().split(\" \"))\r\nhours=0\r\nstubs=0\r\nwhile True:\r\n hours=hours+candles\r\n stubs=stubs+candles\r\n candles=0\r\n candles=candles+stubs//materials\r\n stubs=stubs%materials\r\n if stubs<materials and candles==0:\r\n break\r\nprint(hours)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\nremaining_candles = a\r\n\r\nwhile remaining_candles >= b:\r\n new_candles = remaining_candles // b\r\n total_hours += new_candles\r\n remaining_candles = remaining_candles % b + new_candles\r\n \r\nprint(total_hours)\r\n", "def readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\na, b = readarray(int)\r\nhours, burntCandles = 0, 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n hours += 1\r\n burntCandles += 1\r\n\r\n if burntCandles == b:\r\n a += 1\r\n burntCandles = 0\r\n\r\nprint(hours) ", "a, b = map(int, input().split())\r\nnum, rest = 0, 0\r\nwhile a > 0:\r\n num += a\r\n rest += a % b\r\n a = a // b\r\n while rest >= b:\r\n a += 1\r\n rest -= b\r\nprint(num)\n# Sat Sep 17 2022 11:20:52 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\r\n\r\n#a = list(map(int, input().split()))\r\nans = 0\r\npotux = 0\r\nwhile a > 0:\r\n ans += 1\r\n #print(a)\r\n a -= 1\r\n potux += 1\r\n if potux == b:\r\n a += 1\r\n potux = 0\r\n\r\nprint(ans)", "L = list(map(int, input().split()))\r\nn = L[0]\r\nwhile L[0] >= L[1]:\r\n n += L[0] // L[1]\r\n L[0] = L[0] // L[1] + L[0] % L[1]\r\nprint(n)\r\n", "a, b = map(int, input().split())\r\nhour = 0\r\nburn = 0\r\nwhile a > 0:\r\n a -= 1 # горит одна свеча\r\n hour += 1 # прибавляем 1 час\r\n burn += 1 # добавляем в запас 1 сгоревшую свечу\r\n if burn % b == 0: # если нам хватает запаса сгоревших свечей\r\n a += 1 # создаем 1 новую свечу\r\n burn = 0 # обнуляем наш запас сгоревших свечей\r\nprint(hour)", "A,B=map(int,input().split())\nhours = 0\nusedCandle, usableCandle = 0, A\nwhile usableCandle > 0 :\n hours += usableCandle\n usedCandle += usableCandle\n usableCandle = 0\n\n usableCandle = usedCandle//B\n usedCandle = usedCandle%B\nprint(hours)\n", "a,b= map(int,input().split())\r\np=a\r\nt=0\r\nf=0\r\nwhile a>=b:\r\n p+=a//b\r\n a=a//b+a%b\r\n \r\nprint(p)", "'''\r\n ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄\r\n ▄███████▀▀▀▀▀▀███████▄\r\n░▐████▀▒▒▒▒▒▒▒▒▒▒▒▒▒▀██████\r\n░███▀▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀████\r\n░▐██▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ ________________\r\n░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ / / \|▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒\|\r\n░░█▒▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▒▐███▌ // \|___CM ONE DAY___\|\r\n░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▒▐███▌ / / \|▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒\|\r\n░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌ // // \r\n░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌ /// \r\n░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█ / / \r\n░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀ // \r\n░░░░▄█████████ ████=========█▒▒▐▌\r\n░░░▀███▀▀████▀█████▀▒▌\r\n░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐\r\n░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐\r\n░░░░░████████████████\r\n'''\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n############################################\r\n'''\r\nAuthor :- \r\n Mian_Talha_g\r\n'''\r\n############################################\r\n'''for _ in range(int(input())):\r\n n = int(input())\r\n st = input()\r\n cout = ''\r\n for i in range(n-1):\r\n if st[i] == st[i+1]:\r\n pass\r\n else:\r\n if st[i] in st[i+1:]:\r\n cout += 'NO'\r\n else:\r\n cout += 'YES'\r\n if 'NO' in cout:\r\n print('NO')\r\n else:\r\n print('YES')'''\r\n\r\na,b = list(map(int,input().split()))\r\nres = math.floor((a-1)/(b-1))\r\nprint(a+res)", "a,b = map(int,input().split())\r\nc = a\r\nwhile a>=b:\r\n d = a//b\r\n c += d\r\n m = a%b\r\n a = d+m\r\nprint(c)", "a,b=map(int,list(input().split()))\r\nx=a\r\ncount=0\r\nif a>1:\r\n while a>1:\r\n x=x/b\r\n a=(a-1)+x\r\n count=count+1\r\n print(count)\r\nelse:print(a)", "a,b=map(int,input().split())\r\npot=0\r\not=0\r\nwhile pot//b>b or a!=0:\r\n ot=ot+a\r\n pot=pot+a\r\n a=pot//b\r\n pot=pot-(pot//b)b\r\nprint(ot) ", "a, b = map(int, input().split())\r\na2 = a\r\nc = 0\r\nwhile True:\r\n c += a//b\r\n a = a//b + (a%b)\r\n if a < b:\r\n break\r\nprint(c+a2)", "a,b=map(int,input().split())\r\nk=0\r\nburned_out=0\r\nwhile a!=0:\r\n a-=1\r\n burned_out+=1\r\n if burned_out==b:\r\n a+=1\r\n burned_out=0\r\n k+=1\r\nprint(k)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\na,b=map(int,input().split())\r\nprint(a+(a-1)//(b-1))\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "a,b=map(int,input().split())\r\nans=a\r\nwhile a//b>0:\r\n ans+=a//b\r\n a=a%b+a//b\r\nprint(ans)\r\n", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = a\r\nsumd = 0\r\nsumd = sumd + a\r\nwhile a//b > 0:\r\n sumd += a//b\r\n a = a//b + a%b\r\nprint(sumd)", "a, b = map(int, input().split())\r\n\r\nans = 0\r\ncandles = a\r\nused = 0\r\nwhile candles:\r\n ans += candles\r\n used += candles\r\n candles = used // b\r\n used -= candlesb\r\nprint(ans)\r\n\r\n", "a, b = map(int, input().split())\r\ntime_count = 0\r\nwhile a > 0:\r\n a -= 1\r\n time_count += 1\r\n if time_count % b == 0:\r\n a += 1\r\nprint(time_count)", "a,b = map(int,input().split())\r\nprint((((ab-1))//((b-1))))", "a,b = map(int,input().split())\r\nc = a\r\nwhile(a>=b):\r\n c += a//b\r\n a = (a//b) + (a%b)\r\n \r\nprint(c) ", "a , b = [int(x) for x in input().split()]\r\nhours = 0\r\nb_ = 0\r\n\r\nif b > a:\r\n print(a)\r\nelif b == a:\r\n print(a + 1)\r\nelse:\r\n while a != 0:\r\n hours += 1\r\n a -= 1\r\n b_ += 1\r\n if b_ == b:\r\n a += 1\r\n b_ = 0\r\n print(hours)", "a,b=map(int,input().split())\r\nc=0\r\nwhile c<a:\r\n if c%b==0:\r\n a=a+1\r\n c=c+1\r\nprint(a-1)", "string=input()\r\na=list(map(int,string.split()))[0]\r\nb=list(map(int,string.split()))[1]\r\nall = a\r\nwhile a >= b:\r\n all += a // b\r\n a = a % b + a // b\r\nprint(all)\r\n", "candles, new = [int(i) for i in input().split()]\r\nhours = 0\r\nbad = 0\r\nwhile candles!=0:\r\n hours+=1\r\n bad+=1\r\n candles-=1\r\n if bad==new:\r\n candles+=1\r\n bad=0\r\nprint(hours)", "n, k = map(int,input().split())\r\n\r\nc = n\r\nwhile n>0:\r\n #print(n)\r\n n-=(k-1)\r\n c+=1\r\n\r\nprint(c-1)", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\n\r\ntotal = a\r\nwhile(a>=b):\r\n total += a//b\r\n a = a//b + a%b\r\nprint(total)", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>=b:\r\n m=a//b\r\n s+=m\r\n d=a%b\r\n a=d+m\r\nprint(s)\r\n", "a, b = map(int, input().split())\r\nhours = 0\r\nrenew = 0\r\nwhile a > 0:\r\n a = a-1\r\n hours += 1\r\n renew += 1\r\n if renew == b:\r\n a += 1\r\n renew = 0\r\nprint(hours)", "a,b=map(int,input().split())\r\nh=0\r\nwhile a>0:\r\n a-=1\r\n h+=1\r\n if h%b==0:\r\n a+=1\r\nprint(h)", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\ncount = a\r\nb1 = False\r\nwhile b1==False:\r\n if a < b:\r\n print(count)\r\n break\r\n count += (a//b)\r\n a = a // b + a % b\r\n ", "a,b=map(int,input().split())\r\ns=a\r\nwhile(a>=b):\r\n r=0\r\n s=s+a//b \r\n r=a%b\r\n a=a//b+r\r\nprint(s)", "n, k = map(int,input().split())\r\nhours = 0\r\nspend_candles = 0\r\nwhile n > 0:\r\n hours +=1 \r\n n -= 1\r\n spend_candles += 1\r\n if spend_candles % k == 0:\r\n n +=1\r\nprint(hours)", "x,y=map(int,input().split())\r\nh=x\r\nwhile x>=y:\r\n nx=x//y\r\n h+=nx\r\n x=nx+x%y\r\nprint(h) ", "a, b = map(int, input().split())\r\ncounter = 0\r\nwhile a > 0:\r\n a -= 1\r\n counter += 1\r\n if counter % b == 0:\r\n a += 1\r\nprint(counter)", "a, b = [int(i) for i in input().split()]\n\nt = a\n\nwhile a >= b:\n t += a//b\n a = a//b + a%b\n\nprint(int(t))\n\n\n# 6 3\n# 6//3 = 2\n# 6//3 + 6%3\n", "def solve():\r\n x,y = map(int,input().split())\r\n a = x\r\n p = 0\r\n z = 0\r\n \r\n while x >= y:\r\n p = x//y\r\n a+=p\r\n z = x%y\r\n x = p + z\r\n else:\r\n print(a)\r\n#case = int(input())\r\n#for _ in range(case):\r\nsolve()\r\n", "x, y = input().split()\r\ntotal_svechi = 0\r\nll = list()\r\n\r\ntotally = int(x)\r\nwhile True:\r\n lasted_sve4i = totally - int(y)\r\n if lasted_sve4i >=0:\r\n totally = lasted_sve4i + 1\r\n total_svechi += 1\r\n ll.append(totally)\r\n else:\r\n break\r\n\r\n\r\nres = len(ll)\r\nprint(int(res) + int(x))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n ", "from math import ceil, floor\r\n\r\ncandles = input().split()\r\na = float(candles[0])\r\nb = float(candles[1])\r\n\r\noutput = a\r\n\r\nwhile a // b >= 1:\r\n result = a // b\r\n output += result\r\n remainder = a % b\r\n a = result + remainder\r\n\r\nprint(int(output))\r\n", "a,b=[int(i) for i in input().split()]\r\nf=a\r\ng=0\r\nwhile a//b>0:\r\n f+=a//b\r\n g=a%b\r\n a=a//b\r\n a+=g\r\nprint(f)\r\n", "from collections import defaultdict\n\ndef pug_func(s: str) -> int:\n\n a, b = s.split(\" \")\n a = int(a)\n b = int(b)\n\n ans = a\n\n while a >= b:\n ans += a // b\n a = (a // b) + (a % b)\n\n return ans\n\n\n\n\n# t = int(input())\n# lista_ans = []\n\n# for _ in range(t):\n# n = input()\n# line = input()\n# lista_ans.append(line)\n\n# for ans in lista_ans:\n# x = pug_func(ans)\n# print(x)\n\nt = input()\nx = pug_func(t)\nprint(x)\n\t \t\t \t\t\t \t \t\t \t\t\t\t\t\t \t", "a,b = map(int, input().split())\r\ncount = a\r\ngorat = 0\r\npotuh = a\r\nwhile potuh >= b:\r\n if potuh % b == 0:\r\n gorat = potuh // b\r\n else:\r\n gorat = (potuh - potuh % b) // b\r\n count += gorat\r\n potuh = gorat + potuh - (potuh - potuh % b)\r\nprint(count)\r\n", "a, b = map(int, input().split())\r\nold = a\r\nwhile a >= b:\r\n old += a // b\r\n a = a // b + a % b\r\nprint(old)\r\n \r\n", "def candle_hours(a: int, b: int) -> int:\r\n total_hours = a\r\n while a >= b:\r\n total_hours += a // b\r\n a = a // b + a % b\r\n return total_hours\r\n\r\na, b = map(int, input().split())\r\nprint(candle_hours(a, b))\r\n", "wholeCandles, x = map(int, input().split())\r\nhalfCandles = 0\r\nanswer = 0\r\nwhile wholeCandles > 0:\r\n answer += wholeCandles\r\n halfCandles += wholeCandles\r\n wholeCandles = 0\r\n wholeCandles = halfCandles // x\r\n halfCandles = halfCandles % x\r\nprint(answer)\r\n", "a, b = map(int, input().split())\r\nc = a\r\ndef f(a, b):\r\n global c\r\n if a < b:\r\n return c\r\n if a >= b:\r\n c += a // b\r\n a = a % b + a // b\r\n return f(a, b)\r\nprint(f(a, b))", "a,b=map(int,input().split())\r\nprint(((ab)-1)//(b-1))", "a, b = map(int, input().split())\r\nh = a\r\nwhile b<=a:\r\n\t_ = int(a/b)\r\n\th += _\r\n\ta = _ + a%b\r\nprint(h)", "a, b = [int(i) for i in input().split()]\r\nm = a \r\nc = a \r\nwhile c >= b:\r\n m += c//b\r\n c = c//b+c%b\r\nprint(m)", "def solve():\r\n a,b=map(int,input().split())\r\n ans=a\r\n while a>=b:\r\n k=int(a/b)\r\n p=(a%b)\r\n a=k+p\r\n ans+=k\r\n print(ans)\r\n return\r\n\r\ndef main():\r\n solve()\r\n return\r\n\r\nif __name__==\"__main__\":\r\n main()", "import math\r\na,b=map(int,input().split())\r\nx=a+math.floor(a/b)\r\na=math.floor(a/b)+a%b\r\nwhile(a>=b):\r\n x=x+math.floor(a/b)\r\n a=math.floor(a/b)+a%b\r\nprint(x) \r\n\r\n ", "a, b = [open(0)][0].split()\r\na = int(a)\r\nb = int(b)\r\ntotal, remain = 0, 0\r\n\r\nwhile a > 0:\r\n total += a\r\n remain += a\r\n a = remain // b\r\n remain = remain % b\r\n\r\nprint(total)\r\n", "a,b = map(int,input().split(\" \"))\n\nc = a\np = 0\nwhile(a>0):\n\tp += a%b\n\ta = a//b\n\tif(p>=b):\n\t\tp-=b\n\t\ta+=1\n\tc+=a\n\t\nprint(c)\n\n\n \t \t \t \t \t \t\t \t\t\t \t\t\t\t \t \t \t\t \t", "a,b = map(int,input().split())\ntime = 0\ncandles = a\nburnt_candles = 0\nwhile candles > 0:\n candles -= 1\n burnt_candles += 1\n time += 1\n if burnt_candles >= b:\n burnt_candles -= b\n candles += 1\nprint(time)\n", "import math\n\nvalues = list(map(int, input().split(\" \")))\na = values[0]\nb = values[1]\nanswer = a\nused = a\n\nif(a >= b):\n while(used >= b):\n news = math.floor(used/b)\n answer += news\n used = news + used % b\n\nprint(answer)\n \t\t\t \t\t\t \t\t \t\t \t \t\t \t\t \t\t", "A,B=map(int,input().split()) \r\nANS=A \r\nwhile A>=B: \r\n ANS=ANS+A//B \r\n C=A%B\r\n A=A//B+C\r\nprint(ANS)", "a,b=map(int,input().split())\r\nc=a\r\nwhile a//b>=1:\r\n\tc+=a//b\r\n\ta=a//b+a%b\r\nprint(c)", "def solve():\r\n n = [int(n) for n in input().split(\" \", 2)]\r\n count = n[0]\r\n while n[0] >= n[1]:\r\n n[0] -= n[1]\r\n n[0] += 1\r\n count += 1\r\n return count\r\n\r\n\r\nprint(solve())\r\n", "a, b = map(int, input().split())\r\nc = 0\r\np = 0\r\nwhile a != 0:\r\n c = c + 1\r\n a = a - 1\r\n p = p + 1\r\n if p == b:\r\n a = a + 1\r\n p = 0\r\nprint(c)\r\n\r\n", "a,b = map(int, input().split())\r\nnew = 0\r\ncoun=0\r\nwhile a!=0:\r\n a-=1\r\n new+=1\r\n coun+=1\r\n if new%b==0:\r\n a+=1\r\n new=0\r\nprint(coun)\r\n", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n \nif __name__ == '__main__':\n a, b = [int(x) for x in input().strip().split(\" \")]\n ans = a\n res = 0\n while a > 0:\n \ta += res\n \tres = a % b\n \ta = a // b\n \tans += a\n print(ans)\n \t \t \t \t\t \t\t \t \t \t\t", "\r\na,b=map(int, input().split())\r\nhours=0\r\nrem_candles=a\r\nwhile(rem_candles>=b):\r\n burnt_candles=rem_candles//b\r\n hours+=burnt_candlesb\r\n rem_candles=burnt_candles+rem_candles%b\r\n\r\nhours+=rem_candles\r\nprint(hours)", "a,b=map(int,input().split())\r\nt=(ab-1)//(b-1)\r\nprint(t)\r\n", "a,b = map(int,input().split())\r\n\r\nresult = a + (a-1)//(b-1)\r\n\r\nprint(result)", "a,b=[int(i) for i in input().split()]\r\nhours=0\r\nwoc=0\r\nwhile a!=0 or woc>=b:\r\n\thours+=a\r\n\twoc+=a\r\n\ta=woc//b\r\n\twoc=woc%b\r\nprint(hours)", "new,old = map(int,input().split())\r\n\r\ndiscard = 0\r\ncandles = 0\r\n\r\nwhile new > 0:\r\n new -= 1\r\n candles += 1\r\n discard += 1\r\n if discard == old:\r\n discard = 0\r\n new += 1\r\n \r\nprint(candles)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nan=n\r\npog=n\r\nwhile pog>=m:\r\n an+=pog//m\r\n pog=pog//m+pog%m\r\nprint(an)", "a , b = map(int , input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total += (a // b)\r\n a = a // b + a % b\r\nprint(total)", "n, m = map(int, input().split())\r\nans = n\r\nwhile n // m > 0:\r\n ans += n // m\r\n n = n // m + n % m\r\nprint(ans)", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #\r\nimport math as m\r\na,b = map(int,input().split())\r\nprint(a+(m.floor((a-1)/(b-1))))\r\n", "a, b = map(int, input().split())\nsum = a\nwhile a >= b:\n sum += a // b\n a = (a // b) + (a % b)\nprint(sum)\n \t \t\t \t\t\t \t\t \t", "candels,candels_neeededfornew = map(int,input().split())\r\nhours = candels\r\n\r\nwhile(candels>=candels_neeededfornew):\r\n hours = hours+(candels//candels_neeededfornew)\r\n candels = (candels//candels_neeededfornew) + (candels%candels_neeededfornew)\r\n \r\nprint(hours)", "a,b = [int(x) for x in input().split()]\r\ncandle = a\r\nstud = 0\r\nwhile a:\r\n stud = a%b if a> b else 0\r\n candle += a//b\r\n a = (a//b)+stud\r\nprint(candle)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n x=a%b\r\n a=a//b\r\n ans+=a\r\n a=a+x\r\nprint(ans)", "a, b = tuple(map(int, input().split()))\n\na_burned = 0\nhours = 0\n\nwhile a:\n a -= 1\n a_burned += 1\n hours += 1\n\n if a_burned == b:\n a += 1\n a_burned = 0\n\nprint(hours)", "a,b = map(int,input().split())\r\ntime = 0\r\nost = 0\r\nwhile a > 0 :\r\n time += a\r\n ost += a\r\n a = 0\r\n a += ost // b\r\n ost = ost % b\r\nprint(time)", "a, b = list(map(int, input().strip().split()))\nhours = a\n\nwhile a // b > 0:\n new_candles, leftover_candles = divmod(a, b)\n hours += new_candles\n a = new_candles + leftover_candles\n\nprint(hours)\n\t \t \t\t \t \t \t\t\t\t \t \t \t", "if __name__ == \"__main__\":\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n cnt = 0\r\n used = 0\r\n while a > 0:\r\n cnt += 1\r\n a -= 1\r\n used += 1\r\n if used == b:\r\n used -= b\r\n a += 1\r\n print(cnt)\r\n\r\n\r\n", "n , m = map(int,input().split())\r\nans = n + n//m\r\nx = n\r\nwhile(x!=ans):\r\n x = ans\r\n ans = n + ans//m\r\n \r\nprint(ans)", "a,b=map(int,input().split())\r\nhour=0\r\nwhile a>0:\r\n a=a-1\r\n hour=hour+1\r\n if hour%b==0:\r\n a=a+1\r\nprint(hour)\r\n", "a,b = list(map(int, input().split()))\r\nans = a\r\nwhile a >= b:\r\n\tc = a // b\r\n\td = a % b\r\n\tans += c\r\n\ta = c\r\n\ta += d\r\nprint(ans)", "import math\r\n(a,b) = map(int,input().split())\r\n\r\n\r\nprint(a + (a-1)//(b-1))", "a, b = map(int, input().split())\r\n\r\nres = a\r\n\r\nwhile a >= b:\r\n quo = a // b\r\n res += quo\r\n rem = a % b\r\n a = quo + rem\r\n \r\nprint(res)", "A=input().split()\r\na=int(A[0])\r\nb=int(A[1])\r\nx=a\r\nwhile x>=b:\r\n k=x//b\r\n a+=k\r\n x=x-kb+k\r\nprint(a)", "a,b = [int(x) for x in input().split()]\r\ntime = a\r\nrem = a\r\nwhile a>0:\r\n a = rem//b\r\n rem = rem%b\r\n time = time + a\r\n rem = rem + a\r\nprint(time)", "a,b=map(int,input().split())\r\nk=0\r\nwhile a>0:\r\n if a>=b:\r\n k+=b\r\n a=a-b+1\r\n else:\r\n k+=a\r\n a=0\r\nprint(k)", "a, b = map(int, input().split())\r\n\r\ncount = a\r\n\r\n\r\n\r\nwhile (a >= b): \r\n count += a // b\r\n a = int(a % b) + a // b\r\n \r\n\r\nprint(count)", "def max_hours(a, b):\r\n total_hours = a # Initial hours from existing candles\r\n \r\n while a >= b:\r\n new_candles = a // b # Number of new candles created\r\n total_hours += new_candles # Add burning hours of new candles\r\n a = new_candles + a % b # Remaining candles after creating new ones\r\n \r\n return total_hours\r\n\r\n# Read input\r\na, b = map(int, input().split())\r\n\r\n# Calculate the maximum hours\r\nresult = max_hours(a, b)\r\n\r\n# Output the result\r\nprint(result)\r\n", "a_,b_=input().split()\r\n\r\na=int(a_)\r\nb=int(b_)\r\n\r\ns=a\r\n\r\ndef hour(a,b,s):\r\n while a>=b:\r\n s=s+a//b\r\n a=a//b+a%b\r\n print(s)\r\n \r\n \r\nhour(a, b, s)\r\n\r\n\r\n \r\n \r\n \r\n ", "a,b = map(int,input().split())\r\ns = a\r\nwhile int(a/b)!=0:\r\n s += int(a/b)\r\n a = int(a/b)+(a%b)\r\nprint(s)", "x, y = map(int, input().split())\r\ntot = 0\r\nf = x\r\nhal = 0\r\nwhile f > 0:\r\n tot += f\r\n hal += f\r\n f = hal // y\r\n hal %= y\r\nprint(tot)", "a, b = map(int, input().split())\r\n\r\ns = a\r\n\r\nwhile a // b > 0:\r\n s += a//b\r\n a = a//b + a%b\r\n\r\nprint(s)\r\n", "n,m = map(int,input().split())\r\ncount = n+(n-1)//(m-1)\r\nprint(count)", "#!/bin/python3\r\n\r\n# get inputs\r\ninp = input().split()\r\n\r\n# filter inputs\r\na = int(inp[0])\r\nb = int(inp[1])\r\n\r\n\r\ndef new_year(a: int, b: int) -> int:\r\n time_left = 0\r\n while a > 0:\r\n a -= 1\r\n time_left += 1\r\n if time_left % b == 0:\r\n a += 1\r\n return time_left\r\n\r\n\r\nprint(new_year(a, b))\r\n", "a,b=map(int,input().split())\r\n\r\nc=a\r\ns=a\r\nr=0\r\nwhile c>0:\r\n r+=c%b\r\n c=int(c/b)\r\n #print(c)\r\n s+=c\r\n#print(s)\r\nz=0\r\nwhile r>0:\r\n z+=r%b\r\n r=int(r/b)\r\n s+=r\r\n \r\n#print(z)\r\nprint(s+int(z/b))\r\n ", "a,b = map(int,input().split())\r\n\r\ncount=0\r\nres =0\r\nwhile a!=0:\r\n a-=1\r\n count+=1\r\n if count==b:\r\n a+=1\r\n count=0\r\n res+=1\r\n\r\nprint (res)\r\n", "import math\r\nimport sys\r\n\r\n# s,n=map(int,input().split())\r\n# t=True\r\n# for i in range(int(input())):\r\n # n=int(input()) \r\na,b=map(int,input().split()) \r\n# arr=list(map(str,input().split()))\r\n# s=set() \r\ncnt=a\r\n\r\nwhile(a>=b):\r\n d=int(a/b)\r\n cnt+=d\r\n r=a%b\r\n a=d+r\r\nprint(cnt)", "# New Year Candles\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\nrenew = s[0]\r\nb = s[1]\r\nremainder = 0.0\r\nsum = renew\r\nwhile renew > 0:\r\n remainder += (renew % b)\r\n if remainder >= b:\r\n renew = (renew // b) + 1\r\n remainder -= 1b\r\n else:\r\n renew = renew // b\r\n sum += renew\r\nprint(sum)", "a, b = map(int, input().split())\r\n\r\nc = 0\r\n\r\nres = 0\r\n\r\nwhile a > 0:\r\n res += a\r\n c += a\r\n a = c//b\r\n c %=b\r\n\r\nprint(res)\r\n", "(n, k) = [int(x) for x in input().split(\" \")]\n\ntime = n\n\nwhile (n >= k):\n x = n // k\n \n time += x\n\n m = n % k\n n = x + m;\n\nprint(time)\n", "a, b = map(int,input().split())\r\npotuh = 0\r\ntime = 0\r\nwhile a>0:\r\n potuh += 1\r\n if potuh == b:\r\n a += 1\r\n potuh = 0\r\n a -= 1\r\n time +=1\r\nprint(time)\r\n", "a,b = list(map(int, input().split()))\nc = 0\nv = 0\nwhile True:\n v += a\n c += a\n a = int(v/b)\n v = v - (ab)\n \n if a == 0 and v < b:\n break\nprint(c)", "def cantHoras(velas,sobrantes,cantNewVela):\r\n if(velas==0):\r\n return 0\r\n newVelas=(velas+sobrantes)//cantNewVela\r\n newSobrantes=(velas+sobrantes)%cantNewVela\r\n return (velas+cantHoras(newVelas,newSobrantes,cantNewVela))\r\n\r\nfila=[int(x) for x in input().split(' ')]\r\nvelas=fila[0]\r\ncantNewVela=fila[1]\r\nprint(cantHoras(velas,0,cantNewVela))", "a,b=map(int,input().split())\ni=0\nk=0\nwhile(a):\n k+=1\n i+=1\n a-=1\n if(k==b):\n a+=1\n k=0\n\nprint(i)\n", "a,b=map(int,input().split())\r\nnew,old=a,0\r\np=0\r\nwhile new>0:\r\n p+=new\r\n new,old=0,old+new\r\n new,old=old//b,old%b\r\nprint(p)", "def f():\n x,y=input().split()\n x=int(x)\n y=int(y)\n if y>x:\n print(x)\n else:\n a=x\n r=0\n while x>=y:\n r+=x%y\n x=x//y\n a+=x\n x=x+r\n r=0\n \n print(a+(x+r)//y)\nf()\n \n \n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n INITIAL_CANDLE_COUNT, COUNT_FOR_NEW_CANDLE = map(int, input().split())\r\n\r\n totalHours:int = 0\r\n unusedCandleCount:int = INITIAL_CANDLE_COUNT\r\n usedCandleCount:int = 0\r\n while unusedCandleCount > 0 :\r\n totalHours += unusedCandleCount\r\n usedCandleCount += unusedCandleCount\r\n unusedCandleCount = usedCandleCount//COUNT_FOR_NEW_CANDLE\r\n usedCandleCount = usedCandleCount%COUNT_FOR_NEW_CANDLE\r\n\r\n print(totalHours)\r\n\r\nmain()", "a, b = list(map(int, input().split()))\r\nhours = 0\r\nparts = 0\r\nwhile a > 0:\r\n hours += a\r\n parts += a\r\n a = parts // b\r\n parts %= b\r\nprint(hours)", "m, n = [int(i) for i in input().split()]\r\nc = 0\r\nflag = False\r\ncount = m\r\nwhile True:\r\n k = m//n\r\n count+=k\r\n c+= m%n\r\n m//=n\r\n if m<n:\r\n m+=c\r\n flag = True\r\n c = 0\r\n if m==0 or k==0:\r\n break\r\nprint(count)\r\n", "\r\n\r\ndef main():\r\n input_prompt = input().split(' ')\r\n a, b = int(input_prompt[0]), int(input_prompt[1])\r\n\r\n hours = a\r\n ogryzki = a\r\n while ogryzki >= b:\r\n hours += ogryzki // b\r\n\r\n ogryzki = ogryzki // b + ogryzki % b\r\n\r\n print(hours)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "candle_a, candle_b = map(int, input().split())\r\ncount_time = 0 \r\nwhile candle_a > 0:\r\n count_time = count_time + 1\r\n candle_a = candle_a - 1 \r\n \r\n if count_time % candle_b == 0:\r\n candle_a = candle_a + 1\r\nprint(count_time)", "a,b = map(int,input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total+=a//b\r\n a = a//b + a%b\r\nprint(total)", "#Initializes scenario\r\nscenario = input().split(' ')\r\ncandles = int(scenario[0])\r\nnewCandle = int(scenario[1])\r\nburntCandle = 0\r\nhours = 0\r\n\r\n#counts hours until candle count hits 0\r\nwhile candles != 0:\r\n hours +=1\r\n candles -= 1\r\n burntCandle += 1\r\n if burntCandle == newCandle: #resets burnt candle when a new one can be made\r\n burntCandle -= newCandle\r\n candles += 1\r\n continue\r\n \r\nprint(hours)", "import math\r\na,b=map(int,input().split())\r\nx=a\r\nwhile(a>=b):\r\n x=math.floor(a/b)+x\r\n a=math.floor(a/b)+a%b\r\nprint(x) \r\n\r\n ", "n, m = map(int, input().split())\r\nif n == m:\r\n print(n+1)\r\nelif n > m:\r\n s = n\r\n while True:\r\n n /= m\r\n s += n\r\n if int(n) == 0:\r\n break\r\n print(int(s))\r\nelse:\r\n print(n)\r\n", "def fun(velas, b):\n hours = velas\n\n while velas >= b:\n # velas = velas/b\n # pedazos += velas%b\n # hours += velas\n velas = velas/b\n hours += velas\n hours += velas/b\n\n print(int(hours))\n\ninp = input()\na,b = inp.split()\nfun(int(a),int(b))\n", "import sys\r\n\r\na, b = map(int,sys.stdin.readline().split())\r\nans = a\r\nres = 0\r\nwhile a >0:\r\n res += a%b\r\n a = a//b\r\n a += res//b\r\n res = res % b\r\n ans +=a\r\nprint(ans+a)\r\n", "a,b = map(int, input().split(\" \"))\r\ntemp = a\r\nwhile(int(a) > 0):\r\n a /= b\r\n temp += a\r\nprint(int(temp))\r\n ", "from math import \r\na,b=map(int,input().split())\r\nans=a\r\nc=0\r\nwhile(1):\r\n c=a%b\r\n a=floor(a/b)\r\n ans+=a\r\n a+=c\r\n if(a<b):\r\n break\r\nprint(ans)", "a,b = list(map(int,input().split()))\r\nx=a+0;\r\nwhile(a>=b):\r\n x=x+(a//b)\r\n a=(a//b)+(a%b)\r\nprint(x)\r\n \r\n\r\n\r\n\r\n", "entered_list=input().split()\r\nnum_list=list(map(int,entered_list))\r\na=num_list[0]\r\nb=num_list[1]\r\nresult=a\r\nwhile a>=b:\r\n result+=a//b\r\n a=a//b+a%b\r\nprint(result)\r\n ", "a,b=map(int,input().split())\r\na1=0\r\nt=0.\r\nwhile a>0 :\r\n if a1==b:\r\n a+=1\r\n a1=0\r\n a-=1\r\n a1+=1\r\n t+=1\r\nif a1==b:\r\n t+=1\r\nprint(int(t))\r\n", "a,b=map(int,input().split())\r\nc=a\r\nk=0\r\nwhile(a>=b):\r\n l=a//b\r\n c+=l\r\n k=a%b\r\n a=l+k\r\nprint(c)", "# t = int(input())\r\n# while t>0:\r\nn,m = (int(i) for i in input().split())\r\nsum = n\r\nwhile n>=m:\r\n sum+=n//m\r\n n=n//m+n%m\r\nprint(int(sum))\r\n # t-=1", "a,b=map(int,input().split())\r\nhours=0\r\nburn=0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n burn+=1\r\n if burn%b==0:\r\n a+=1\r\n burn=0\r\nprint(hours)", "a, b=map(int, input().split())\r\ng, ng=a, 0\r\ncount=a\r\nwhile g!=0:\r\n ng+=g\r\n g=ng//b\r\n ng%=b\r\n count+=g\r\nprint(count)\r\n", "a , b = [int(x) for x in input().split()]\r\nh=a\r\nwhile b<=a:\r\n d = a // b\r\n h = h+d\r\n m = a%b\r\n a = d+m\r\nprint(h)", "a, b = [int(i) for i in input().split()]\r\nprint((ab-1)//(b-1))", "a, b = input().split()\na, b = int(a), int(b)\n\ncount = a\nwhile a >= b:\n count += a // b\n a = a // b + a % b\n\nprint(count)", "a,b=map(int,input().split())\r\nans=a \r\nwhile(a>=0):\r\n ans+=a//b\r\n a=a//b+(a%b)\r\n if(a<b):\r\n break\r\n \r\nprint(ans)", "import math\r\na,b=map(int, input().split())\r\nnum=a+math.floor((a-1)/(b-1))\r\nprint(num)" ]	{"inputs": ["4 2", "6 3", "1000 1000", "123 5", "1000 2", "1 2", "1 3", "1 4", "2 2", "3 2", "3 3", "999 2", "1000 3", "1000 4", "1 1000", "80 970", "80 970", "80 970", "80 970", "80 970", "80 970", "10 4", "4 3", "91 5", "777 17", "100 4", "5 3", "6 4", "26 8", "9 4", "20 3", "17 3"], "outputs": ["7", "8", "1001", "153", "1999", "1", "1", "1", "3", "5", "4", "1997", "1499", "1333", "1", "80", "80", "80", "80", "80", "80", "13", "5", "113", "825", "133", "7", "7", "29", "11", "29", "25"]}	UNKNOWN	PYTHON3	CODEFORCES	472
d499e64d29c12399b541b19d5ace8193	Chat	There are times you recall a good old friend and everything you've come through together. Luckily there are social networks — they store all your message history making it easy to know what you argued over 10 years ago. More formal, your message history is a sequence of messages ordered by time sent numbered from 1 to n where n is the total number of messages in the chat. Each message might contain a link to an earlier message which it is a reply to. When opening a message x or getting a link to it, the dialogue is shown in such a way that k previous messages, message x and k next messages are visible (with respect to message x). In case there are less than k messages somewhere, they are yet all shown. Digging deep into your message history, you always read all visible messages and then go by the link in the current message x (if there is one) and continue reading in the same manner. Determine the number of messages you'll read if your start from message number t for all t from 1 to n. Calculate these numbers independently. If you start with message x, the initial configuration is x itself, k previous and k next messages. Messages read multiple times are considered as one. The first line contains two integers n and k (1<=≤<=n<=≤<=105, 0<=≤<=k<=≤<=n) — the total amount of messages and the number of previous and next messages visible. The second line features a sequence of integers a1,<=a2,<=...,<=an (0<=≤<=ai<=<<=i), where ai denotes the i-th message link destination or zero, if there's no link from i. All messages are listed in chronological order. It's guaranteed that the link from message x goes to message with number strictly less than x. Print n integers with i-th denoting the number of distinct messages you can read starting from message i and traversing the links while possible. Sample Input 6 0 0 1 1 2 3 2 10 1 0 1 0 3 4 5 2 3 7 0 2 2 0 1 Sample Output 1 2 2 3 3 3 2 3 3 4 5 6 6 6 8 2 2 2	[ "n, k = (int(s) for s in input().split())\r\na = [0] + [int(s) for s in input().split()]\r\nans = [0,]\r\n\r\nfor i in range(1, n + 1):\r\n if not a[i]:\r\n ans.append( min(i - 1, k) + 1 + min(n - i, k) )\r\n else:\r\n if a[i] + k < i - k:\r\n ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] )\r\n else:\r\n ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i]))\r\n \r\nprint(ans[1:])", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [0] n\r\nfor i in range(len(a)):\r\n num = a[i] - 1\r\n right = min(n - 1, i + k)\r\n if num == -1:\r\n left = max(0, i - k)\r\n b[i] = right - left + 1\r\n else:\r\n right_p = min(n - 1, num + k)\r\n left = max(right_p + 1, i - k)\r\n b[i] = b[a[i] - 1] + right - left + 1\r\nprint(b)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nansw = []\r\n\r\nfor i in range(n):\r\n # если i - индекс, то не меняем\r\n # если i - значение в массиве, то +1\r\n if arr[i] == 0:\r\n temp = 1 + min(i + 1 + k, n) - max(i + 1 - k, 1)\r\n answ.append(temp)\r\n\r\n else:\r\n if (i + 1 - arr[i]) >= 2 k + 1:\r\n temp = 1 + min(i + 1 + k, n) - max(i + 1 - k, 1) + answ[arr[i] - 1]\r\n\r\n if 2 * k + 1 > (i + 1 - arr[i]) > k:\r\n temp = min(i + 1 + k, n) - max(i + 1 - (i + 1 - arr[i] - k), 1) + answ[arr[i] - 1]\r\n\r\n if (i + 1 - arr[i]) <= k:\r\n temp = min(i + 1 + k, n) - min(arr[i] + k, n) + answ[arr[i] - 1]\r\n\r\n answ.append(temp)\r\n\r\nprint(answ)\r\n", "n, k = map(int, input().split())\r\na = list(map(lambda x: int(x) - 1, input().split()))\r\ndp = [0] n\r\nfor i in range(n):\r\n\tif a[i] == -1:\r\n\t\tdp[i] = min(i, k) + min(n - i - 1, k) + 1\r\n\telse:\r\n\t\tdp[i] = dp[a[i]] - min(n - a[i] - 1, k) + min(n - i - 1, k) + min(2 * k, i - a[i] - 1) + 1\r\nprint(' '.join(list(map(str, dp))))", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ns = [0 for i in range(n)]\r\ns[0] = 1 + min(n-1, k)\r\n#import time\r\n#start_time = time.time()\r\n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n s[i] = 1 + min(i, k) + min(n - 1 - i, k)\r\n else:\r\n j = a[i] - 1\r\n s[i] = s[j] + min(i+k, n-1) - min(j+k, n-1)\r\n if i - k > j + k:\r\n s[i] -= i - k - (j+k) - 1\r\nprint(' '.join([str(i) for i in s]))\r\n#print('\\n------%s seconds-------' % (time.time() - start_time))", "(n, k) = list(map(int, input().split()))\r\na = list(map(int, ('0 ' + input()).split()))\r\nclv = {}\r\n\r\ndef getcnt(x):\r\n\tglobal c, a, clv\r\n\tif x in clv: return clv[x]\r\n\tif a[x]==0:\r\n\t\treturn min(k, x-1) + 1 + min(k, n-x)\r\n\telse:\r\n\t\tper = (min(a[x]+k, n) - max(1, x-k) + 1)\r\n\t\tif per<0: per = 0\r\n\t\tretclv = min(k, x-1) + 1 + min(k, n-x) + getcnt(a[x]) - per\r\n\t\tclv[x] = retclv\r\n\t\treturn retclv\r\n\r\n\r\nfor i in range(1, n+1):\r\n\tprint(getcnt(i), end=' ')\t", "n, k = list(map(int, input().split()))\nanswer = [None] * n\nfor i, ref in enumerate(map(int, input().split())):\n ref -= 1\n max_cur_page = min(i + k, n - 1)\n min_cur_page = max(i - k, 0)\n answer[i] = max_cur_page - min_cur_page + 1\n if ref >= 0:\n max_ref_page = min(ref + k, n - 1)\n answer[i] += answer[ref] - max(0, max_ref_page - min_cur_page + 1)\nprint(' '.join(map(str, answer)))\n", "n, k = map(int, input().split())\r\nmx = list(map(int, input().split()))\r\n\r\n\r\ndef mail(mx, mn):\r\n global n\r\n mx, mn = mx + 1, mn + 1\r\n if mx > n:\r\n return 0\r\n mn = min(mn, n)\r\n mx = max(1, mx)\r\n return mn - mx + 1\r\n\r\nmasiv = [0] * n\r\nfor i in range(n):\r\n if mx[i] == 0:\r\n masiv[i] = mail(i - k, i + k)\r\n else:\r\n masiv[i] = masiv[mx[i] - 1] + mail(max(mx[i] - 1 + k + 1, i - k), i + k)\r\nprint(masiv)", "def read():\r\n return list(map(int,input().split()))\r\nn,k=read()\r\na=read()\r\nb=[min(k,n-1)+1]\r\nfor i in range(1,n):\r\n if a[i]==0:\r\n b.append(min(i,k)+1+min(n-i-1,k))\r\n else:\r\n b.append(b[a[i]-1]-min(k,n-a[i])+min(i-a[i],2k)+min(n-i-1,k)+1)\r\nprint(b)\r\n\r\n \r\n \r\n", "n, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\narr = input().split(' ')\r\narr = list(map(lambda x: int(x), arr))\r\n\r\narr_d = [0] 100005;\r\narr_d_right = [0] * 100005;\r\n\r\ndef count(i, k, n):\r\n # total_count = 0\r\n # while True:\r\n if i - k > 0:\r\n left_ind = i - k\r\n else:\r\n left_ind = 0\r\n \r\n if i + k < n - 1:\r\n right_ind = i + k\r\n else:\r\n right_ind = n - 1 \r\n \r\n #print(arr_d[:n])\r\n #print(arr_d_right[:n])\r\n #print('>>>>>')\r\n next_i = arr[i] - 1\r\n \r\n if next_i != -1:\r\n prev_val = arr_d[next_i]\r\n #print(left_ind, right_ind)\r\n if left_ind <= arr_d_right[next_i]:\r\n left_ind = arr_d_right[next_i] + 1\r\n else:\r\n prev_val = 0\r\n \r\n arr_d[i] = prev_val + right_ind - left_ind + 1\r\n arr_d_right[i] = right_ind\r\n return arr_d[i]\r\n \r\nres_arr = []\r\nfor ind in range(0, len(arr)): \r\n res_arr.append(str(count(ind, k, n)))\r\n \r\nprint(' '.join(res_arr))", "q,w=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\ns=[0 for i in range(0,q+1)]\r\ndef f(q,w,pos):\r\n d=1\r\n if w>=pos:\r\n d+=pos-1\r\n else:\r\n d+=w\r\n if pos>=q-w:\r\n d+=q-pos\r\n else:\r\n d+=w\r\n return d\r\ndef g(q,w,i,j):\r\n ans=w2-j+i+1\r\n if j-w<=0:\r\n ans-=w-j+1\r\n if i+w>q:\r\n ans-=i+w-q\r\n return ans\r\n \r\nfor i in range(1,q+1):\r\n if a[i]==0:\r\n s[i]=f(q,w,i)\r\n else:\r\n t=i-a[i]\r\n if t>2w:\r\n s[i]=f(q,w,i)+s[a[i]]\r\n else:\r\n s[i]=s[a[i]]+f(q,w,i)-g(q,w,a[i],i)\r\nprint(s[1:])", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = [0] n\nfor i in range(n):\n if a[i] == 0:\n b[i] = min(k,i)\n\nfor i in range(n):\n if a[i] != 0:\n b[i] = b[a[i]-1] + min(2k, i - a[i]) + 1\nans = [0] n\n\nfor i in range(n):\n ans[i] = b[i] + min(k, n - i - 1) + 1\n\nprint(ans)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\ndef len_otr(s, f):\r\n global n\r\n s, f = s + 1, f + 1\r\n if s > n:\r\n return 0\r\n s = max(1, s)\r\n f = min(f, n)\r\n return f - s + 1\r\n\r\ndp = [0] n\r\nfor i in range(n):\r\n if s[i] == 0:\r\n dp[i] = len_otr(i - k, i + k)\r\n else:\r\n ind = s[i] - 1\r\n dp[i] = dp[ind] + len_otr(max(ind + k + 1, i - k), i + k)\r\nprint(dp)", "n,k = map(int, input().split())\r\na = list(map(int , input().split()))\r\na = [i-1 for i in a]\r\nans = []\r\nfor i in range(n):\r\n if a[i] == -1:\r\n ans.append(1 + min(n-i-1, k) + min(i, k))\r\n else:\r\n ref = a[i]\r\n r1 = min(ref+k, n-1)\r\n r2 = min(i+k, n-1)\r\n l2 = max(i-k, 0)\r\n if l2 > r1:\r\n ans.append(ans[ref] + (r2-l2+1))\r\n else:\r\n ans.append(ans[ref] + (r2-r1))\r\nprint(' '.join([str(i) for i in ans]))", "n, k = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nans = []\r\nb = []\r\nfor i in range(n):\r\n a = max(0, i - k)\r\n b.append(min(n, i + k + 1))\r\n ans.append(b[i] - a)\r\n if L[i] != 0:\r\n ans[i] += ans[L[i] - 1]\r\n if (a < b[L[i] - 1]):\r\n ans[i] -= b[L[i] - 1] - a\r\n print(ans[i], end = ' ')\r\n", "n, k = map(int, input().split())\r\na = [int(i)-1 for i in input().split()]\r\ndp = [0]n\r\nfor i in range(n):\r\n if a[i] == -1:\r\n dp[i] = 1+min(n-i-1, k)+min(i, k)\r\n else:\r\n dp[i] = min(min(n-1, i+k)-min(n-1, a[i]+k),\r\n 1+min(i, k)+min(n-i-1, k))+dp[a[i]]\r\nprint(dp)\r\n", "from sys import setrecursionlimit\r\nsetrecursionlimit(106)\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsave = [[] for i in range(0, len(a)+1)]\r\n\r\ndef fun(pos):\r\n if save[pos] == []:\r\n left = max(pos-1-k, 0)\r\n right = min(pos+k, len(a))\r\n if a[pos-1] != 0:\r\n new_set=fun(a[pos-1])\r\n if new_set[-1][1]>=left:\r\n new_set[-1]=(new_set[-1][0],right)\r\n else:\r\n new_set.append(tuple([left,right]))\r\n else:\r\n new_set=[tuple([left,right])]\r\n save[pos]=new_set\r\n return new_set.copy()\r\n else:\r\n return save[pos].copy()\r\ndef enc(a):\r\n #print(a)\r\n z=0\r\n for i in a:\r\n z=z+i[1]-i[0]\r\n return z\r\n\r\nfor i in range(1, len(a)+1):\r\n #print(fun(i))\r\n print(enc(fun(i)),end=' ')\r\n", "n, k = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ndp = []\nfor i in range(n):\n res = 0\n if (i == 0):\n res = 1 + min(k, n-1)\n else:\n res = 1 + min(i-1+1, k) + min(k, n-1-i)\n if (a[i] != 0):\n min_i = (i+1) - min(i-1+1, k)\n max_ai = a[i] + min(k, n-1-(a[i]-1))\n res += (dp[a[i] - 1] - max(0, (max_ai - min_i + 1)))\n dp.append(res)\n\nprint(dp, sep=\" \")", "n, k = tuple(map(int, input().split()))\na = list(map(int, input().split()))\n\ncnt = [None] * n\n\nfor i in range(n):\n if a[i] == 0:\n cnt[i] = min(n - 1, i + k) - max(0, i - k) + 1\n else:\n r = min(n - 1, i + k)\n l = max(a[i] - 1 + k + 1, i - k)\n cnt[i] = cnt[a[i] - 1] + max(0, r - l + 1)\n\nprint(cnt)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = [0] n\r\na = [c - 1 for c in a]\r\nfor i in range(0, n):\r\n if a[i] == -1:\r\n d[i] = 1 + min(k, n - i - 1) + min(k, i)\r\n else:\r\n d[i] = 1 + min(k, n - i - 1) + min(k, i) + d[a[i]]\r\n lt = max(i - k, 0)\r\n rt = min(a[i] + k, n - 1)\r\n if lt <= rt:\r\n d[i] -= rt - lt + 1\r\nprint(d)\r\n", "\ndef solution():\n res = [min(len(mas), _k+1)]\n for i in range(1, len(mas)):\n k_right = min(len(mas)-1, i + _k)\n k_left = max(0, i - _k)\n if mas[i] != 0:\n cross = 0\n k_right_last = min(len(mas)-1, mas[i]-1+_k)\n if k_left <= k_right_last:\n cross = k_right_last - k_left + 1\n res.append(res[mas[i]-1] + (k_right - k_left + 1) - cross)\n else:\n res.append(k_right - k_left + 1)\n return res\n\n\nif __name__ == '__main__':\n _n, _k = map(int, input().rstrip().split())\n mas = [int(x) for x in input().rstrip().split()]\n print(solution())\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef len_line(q, b, x):\r\n if q > x:\r\n return 0\r\n return min(b + 1, x) - max(1, q + 1) + 1\r\n\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n dp[i] = len_line(i - k, i + k, n)\r\n else:\r\n dp[i] = dp[a[i] - 1] + len_line(max(a[i] + k, i - k), i + k, n)\r\n\r\nprint(dp)\r\n\r\n# Оо да это код, в котором ни одного варнинга)\r\n", "n,k = map(int,input().split())\r\nli = [0]\r\nli += list(map(int,input().split()))\r\nans = [0](n+1)\r\n\r\nfor i in range(1,n+1):\r\n if(li[i] == 0):\r\n ans[i] = min(n,i+k) - max(1,i-k) + 1\r\n else:\r\n if(li[i]+k >= n):\r\n ans[i] = ans[li[i]]\r\n else:\r\n ans[i] = ans[li[i]] + min(min(n,i+k)-min(n,li[i]+k+1)+1,min(n,i+k) - max(1,i-k) + 1)\r\n \r\nprint(ans[1:],sep=\" \")", "def main():\r\n n, k = map(int, input().split())\r\n b = list(map(int, input().split()))\r\n a = [0] n\r\n for i in range(n):\r\n l, r = 0, n - 1\r\n a[i] = 0\r\n if b[i]:\r\n l = b[i] + k\r\n a[i] += a[b[i] - 1]\r\n l = max(l, i - k)\r\n r = min(r, i + k)\r\n if r >= l:\r\n a[i] += r - l + 1\r\n\r\n print(' '.join(map(str, a)))\r\n\r\n\r\nmain()\r\n", "def get_border(i, n, k):\n \"\"\"\n Возвращает левую и правую границы (включительно)\n для текущего id с проверкой выхода за пределы массива.\n :param i: текущий id (ref - 1)\n \"\"\"\n left = i - k\n if left < 0:\n left = 0\n right = i + k\n if n <= right:\n right = n - 1\n return [left, right]\n\n\ndef add_border(borders, new_border):\n \"\"\"\n Добавляет текущие границы в общий список границ\n при наличии пересечений - объединяет границы\n \"\"\"\n if not borders:\n borders.append(new_border)\n return\n last_border = borders[-1]\n left = last_border[0]\n new_right = new_border[1]\n new_left = new_border[0]\n if left <= new_right:\n last_border[0] = new_left\n else:\n borders.append(new_border)\n\n\ndef count(borders):\n result = 0\n for border in borders:\n result += border[1] - border[0] + 1 # +1 т.к. границы включительно\n return result\n\n\ndef read(idx):\n borders = []\n i = idx\n border = get_border(idx, n, k)\n while True:\n if i < 0:\n break\n if results[i][0] != -1:\n intersection = results[i][1] - borders[-1][0] + 1\n if intersection < 0:\n intersection = 0\n result = results[i][0] + count(borders) - intersection\n results[idx] = (result, border[1])\n return result\n add_border(borders, get_border(i, n, k))\n i = refs[i] - 1\n result = count(borders)\n results[idx] = (result, border[1])\n return result\n\n\nn = int()\nk = int()\nrefs = []\nresults = []\n\n\ndef main():\n global n, k, refs, results\n n, k = map(lambda s: int(s), input().split())\n refs = list(map(lambda s: int(s), input().split()))\n results = [(-1, -1) for i in range(n)]\n\n for idx in range(n):\n print(read(idx), end=' ')\n print()\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int,input().split())\r\ndp = [0]\r\nbound = [0]\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(1, n+1):\r\n dp.append(dp[a[i-1]])\r\n bound.append(i+k)\r\n t1 = max(bound[a[i-1]]+1, i-k)\r\n t2 = min(i+k, n)\r\n t3 = t2 - t1 + 1\r\n if t3>0: dp[i] += t3\r\n\r\nfor i in range(1, n+1):\r\n print(dp[i],end = ' ')\r\n", "n, k = map(int, input().split(\" \"))\r\nl = list(map(int, input().split(\" \")))\r\ndp = []\r\nfor i, x in enumerate(l):\r\n if x == 0:\r\n z = min(i+k+1, n) - max(0, i-k)\r\n else:\r\n z = dp[x-1] + max(0,min(i+k+1,n)-max(i-k,x+k))\r\n dp.append(z)\r\nprint(dp)", "n, k = map(int, input().split())\r\nA = map(int, input().split())\r\n\r\nans = [0] n\r\nfor i, a in enumerate(A):\r\n a -= 1\r\n l, r = max(0, i - k), min(n - 1, i + k)\r\n if a >= 0:\r\n ans[i] += ans[a]\r\n l = max(l, min(n - 1, a + k) + 1)\r\n ans[i] += r - l + 1\r\nprint(' '.join(map(str, ans)))\r\n", "def read_ints():\n return list(map(int, input().split()))\n\nn_messages, n_visible = read_ints()\n\nrefs = read_ints()\n\nNO_REF = -1\n\n# To match indexes in list\nrefs = [i-1 for i in refs]\n\nread = [0] * n_messages\n\ndef messages_seen_at(index):\n return 1 + min(index, n_visible) + min(n_messages - index - 1, n_visible)\n\ndef intersection_seen(index, reference):\n if index <= reference:\n print(\"NOoooooooooo\")\n\n def segment(index):\n return (max(0, index - n_visible), min(reference + n_visible, n_messages - 1))\n\n a, b = segment(reference)\n c, d = segment(index)\n\n return max(b - c + 1, 0)\n\ndef get_read(index):\n if refs[index] == NO_REF:\n read[index] = messages_seen_at(index)\n else:\n reads_by_ref = read[refs[index]]\n read[index] = reads_by_ref + messages_seen_at(index) - intersection_seen(index, refs[index])\n return read[index]\n\nfor i in range(n_messages):\n get_read(i)\n\nprint(' '.join(map(str, read)))", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef main():\n n, k = readline()\n a = readline()\n\n answer = list()\n\n for (i, link) in enumerate(a):\n bottom = max(0, i - k)\n top = min(n, i + k + 1)\n\n if link == 0:\n answer.append(top - bottom)\n else:\n bottom = max(bottom, link + k)\n answer.append(max(0, top - bottom) + answer[link - 1])\n\n print(\" \".join(map(str, answer)))\n\n\nmain()\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = [min(i - 1, k) + 1 + min(n - i, k) for i in range(1, n + 1)]\r\n\r\n# l + 1 + min(n - l, k) - (r - min(r - 1, k)) - число перекрываюихся сообщений\r\n\r\nfor i in range(1, n + 1):\r\n a_ = a[i - 1]\r\n\r\n if a_ != 0:\r\n l, r = sorted([i, a_])\r\n\r\n d1 = ans[a_ - 1]\r\n d2 = max(0, l + 1 + min(n - l, k) - (r - min(r - 1, k)))\r\n\r\n delta = d1 - d2\r\n\r\n ans[i - 1] += delta\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nres = []\r\nfor i, el in enumerate(a, 1):\r\n r = min(n, i+k) - max(1, i-k) + 1\r\n## print(i, el, r)\r\n if el != 0:\r\n r += res[el-1]\r\n rb = max(1, i-k)\r\n lb = min(n, el+k)\r\n if rb <= lb:\r\n r -= lb-rb+1\r\n res.append(r)\r\n## print(res)\r\n\r\nfor el in res:\r\n print(el, end=\" \")\r\n \r\n", "def count_unic_mess(crt, display, array, n, result_arr):\r\n low_bound = 0 if crt - display < 0 else crt - display\r\n\r\n high_bound = n if crt + display + 1 > n else crt + display + 1\r\n\r\n result = high_bound - low_bound\r\n\r\n if array[crt] == 0:\r\n result_arr.append(result)\r\n return result\r\n\r\n ref = array[crt] - 1\r\n high_bound_ref = n if ref + display + 1 > n else ref + display + 1\r\n\r\n if high_bound_ref >= low_bound:\r\n result += result_arr[ref] - high_bound_ref + low_bound\r\n else:\r\n result += result_arr[ref]\r\n\r\n result_arr.append(result)\r\n return result\r\n\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\nlinks = [int(x) for x in input().split(' ')]\r\ncount_arr = []\r\n\r\nfor i in range(n):\r\n print(count_unic_mess(i, k, links, n, count_arr), end=' ')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na[0]=(1+min(k,n-1), min(k,n-1))\r\nfor i in range(1,n):\r\n p=a[i]-1\r\n if p==-1:\r\n a[i]=(1+min(k,i)+min(k,n-i-1), min(k+i, n-1))\r\n continue\r\n ans, l=a[p]\r\n ans+=1+min(k,i)+min(k,n-i-1)\r\n if l>=max(i-k, 0):\r\n ans-=l-max(i-k, 0)+1\r\n a[i]=(ans, min(k+i,n-1))\r\nfor i in range(n):\r\n print(a[i][0], end=' ')", "n, k = map(int, input().split())\r\na = map(int, input().split())\r\nb = [0] * n\r\nfor i, p in enumerate(a):\r\n cur_start = max(0, i - k)\r\n cur_end = min(n - 1, i + k)\r\n if p == 0:\r\n b[i] = cur_end - cur_start + 1\r\n else:\r\n p -= 1\r\n prev_end = min(n-1, p + k)\r\n if cur_start > prev_end:\r\n b[i] = b[p] + cur_end - cur_start + 1\r\n else:\r\n b[i] = b[p] + cur_end - prev_end\r\n\r\nprint(' '.join(map(str, b)))", "n, k = map(int, input().split())\na = [int(i) for i in input().split()]\na.insert(0, 0)\n\ndp = [0 for _ in range(n + 1)]\nfor i in range(1, n + 1):\n p = a[i]\n if p == 0:\n start = max(1, i - k)\n end = min(n, i + k)\n dp[i] = end - start + 1\n else:\n dp[i] = dp[p]\n start = max(p + k + 1, i - k)\n end = min(n, i + k)\n dp[i] += max(0, end - start + 1)\n\nfor i in range(1, n + 1):\n print(dp[i], end=' ')\nprint()\n", "def solve(n, k, links):\r\n\tans = [0] * n\r\n\r\n\tfor t in range(n):\r\n\t\tprevLink = -1\r\n\t\tcurrLink = t\r\n\t\twhile currLink != -1:\r\n\t\t\tprevMin = max(0, prevLink-k)\r\n\t\t\tcurrMin = max(0, currLink-k)\r\n\t\t\tcurrMax = min(n-1, currLink+k)\r\n\r\n\t\t\tif ans[currLink] == 0:\r\n\t\t\t\tans[t] += currMax - currMin + 1\r\n\t\t\t\tif prevLink != -1 and prevMin <= currMax:\r\n\t\t\t\t\tans[t] -= currMax - prevMin + 1\r\n\t\t\t\t\r\n\t\t\t\tprevLink = currLink\r\n\t\t\t\tcurrLink = links[currLink]\r\n\t\t\telse:\r\n\t\t\t\tans[t] += ans[currLink]\r\n\t\t\t\tif prevLink != -1 and prevMin <= currMax:\r\n\t\t\t\t\tans[t] -= currMax - prevMin + 1\r\n\t\t\t\tbreak\r\n\r\n\treturn ' '.join([str(x) for x in ans])\r\n\r\n\r\ndef main():\r\n\tn, k = map(int, input().strip().split())\r\n\tlinks = [int(x)-1 for x in input().strip().split()]\r\n\r\n\tprint(solve(n, k, links)) \r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import sys\ninput = sys.stdin.readline\n\n\ndef solve(n, k, arr):\n messages = [[] for _ in range(n)]\n ans = [0]n\n for i in range(n):\n if arr[i] == 0:\n a, b = max(0, i-k), min(i+k, n-1)\n ans[i] = b-a+1\n messages[i].append((a, b, b-a+1))\n else:\n a, b, n1 = messages[arr[i]-1][-1]\n c, d = max(0, i-k), min(i+k, n-1)\n if b >= c:\n ans[i] = n1 + d-c+1 - (min(b, d) - max(a, c)+1)\n e, f = a, d\n messages[i].append((a, d, ans[i]))\n else:\n ans[i] = n1 + d-c+1\n messages[i].append((c, d, ans[i]))\n\n print(ans)\n\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nsolve(n, k, arr)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [-1](len(a))\r\nfor i in range(1, n+1):\r\n start = i - k\r\n if start < 1:\r\n start = 1\r\n end = i + k\r\n if end > n:\r\n end = n\r\n\r\n if a[i-1] == 0:\r\n ans[i-1] = end - start + 1\r\n else:\r\n prev = a[i-1]\r\n prev_e = prev + k\r\n if prev_e > n:\r\n prev_e = n\r\n ans[i-1] = ans[prev - 1] + end - start + 1\r\n if prev_e >= start:\r\n ans[i-1] -= prev_e - start + 1\r\nprint(' '.join(map(str, ans)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nd = []\r\nfor i in range(n):\r\n if w[i] == 0:\r\n x = min(k, n-i-1) + min(k, i) + 1\r\n else:\r\n x = min(k, n-i-1) + min(k, i) + 1 + d[w[i]-1]\r\n l = max(i-k, 0)\r\n r = min(w[i]-1 + k, n-1)\r\n if l <= r:\r\n x -= r - l + 1\r\n d.append(x)\r\n\r\nprint(' '.join(map(str, d)))", "n, k = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\n\r\n\r\ndef min_(a, b):\r\n return a if a < b else b\r\n\r\n\r\ncache = []\r\nbounds = []\r\nfor i in range(n):\r\n cache.append(1 + min_(k, i) + min_(k, n - i - 1))\r\n bounds.append(max(i - k, 0))\r\n if a[i] > 0:\r\n x = a[i] - 1\r\n l = max(x - k, 0)\r\n r = min_(x + k, n - 1)\r\n cache[i] += cache[x] - ((r - bounds[i] + 1) if r >= bounds[i] else 0)\r\n bounds[i] = min_(bounds[i], l) if r > bounds[i] else bounds[i]\r\n\r\nprint(' '.join([str(x) for x in cache]))\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] (n)\r\n\r\nfor i, item in enumerate(a):\r\n own_l = max(i - k, 0)\r\n own_r = min(i + k, n - 1)\r\n anc_l = max(item - 1 - k, 0)\r\n anc_r = min(item - 1 + k, n - 1)\r\n if item == 0:\r\n b[i] = own_r - own_l + 1\r\n continue\r\n\r\n if own_l > anc_r:\r\n b[i] = b[item - 1] + own_r - own_l + 1\r\n else:\r\n b[i] = b[item - 1] + own_r - anc_r\r\n\r\nprint(b)", "def read_line():\r\n return input()\r\n\r\n\r\ndef add_new_messages(current, link, k, n):\r\n minimal = (link + k) if link != 0 else 0\r\n start = (current - k - 1) if current - k > 0 else 0\r\n end = (current + k) if current + k < n else n\r\n new_messages = end - (start if start > minimal else minimal)\r\n return max(new_messages, 0)\r\n\r\n\r\n[n, k] = map(int, read_line().split())\r\n\r\nresult = []\r\nindex = 0\r\n\r\nfor message in read_line().split():\r\n message = int(message)\r\n answer = add_new_messages(index + 1, message, k, n)\r\n if message != 0:\r\n answer += result[message - 1]\r\n result.append(answer)\r\n\r\n index += 1\r\n print(answer, end=' ')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[min(1+k,n)]n\r\nfor i in range(1,n):\r\n x = a[i] - 1\r\n if x==-1:\r\n b[i]=min(i,k)+1+min(n-i-1,k)\r\n else:\r\n b[i]=b[x]+min(k+1,i-(x+min(k,n-x-1)))+min(n-i-1,k)\r\nprint(b)", "n,k = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\ndp = [0 for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n\r\n\tif l[i] == 0:\r\n\t\tdp[i] = min(i,k) + min(n-i-1,k) + 1\r\n\telse:\r\n\t\tdp[i] = min(i,k) + 1 + min(n-i-1,k) + dp[l[i]-1]\r\n\t\r\n\t\tif i-l[i] < 2k+1:\r\n\t\t\t\r\n\t\t\tt1 = max(i-k+1,1)\r\n\t\t\tt2 = min(i+k+1,n)\r\n\t\t\tt11 = max(l[i]-k,1)\r\n\t\t\tt12 = min(l[i]+k,n)\r\n\t\t\tdp[i] = dp[i] - (t12 - t1 + 1)\r\n\r\nprint(dp)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [0] n\r\nfor i in range(n):\r\n ans[i] += min(n, i + 1 + k) - max(1, i + 1 - k) + 1\r\n if a[i] != 0:\r\n ans[i] += ans[a[i] - 1] - max(0, min(n, a[i] + k) - max(1, i + 1 - k) + 1)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [0] n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n s = min(k, i) + 1\r\n else:\r\n s = dp[a[i] - 1] + min(2 * k, i - a[i]) + 1\r\n dp[i] = s\r\nan = []\r\nfor i in range(n):\r\n an.append(str(dp[i] + min(k, n - i - 1)))\r\nprint(\" \".join(an))", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndp=[0](n)\r\narr=[el-1 for el in arr]\r\nfor i in range(n):\r\n if arr[i]==-1:\r\n dp[i]=1+min(n-1-i,k)+min(k,i)\r\n else :\r\n dp[i]=dp[arr[i]]+min(1+min(n-1-i,k)+min(i,k),min(n-1,i+k)-min(n-1,arr[i]+k))\r\nprint(dp)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = [min(1 + k,n)]n\r\nfor i in range(1,n):\r\n x = l[i] - 1\r\n if x == -1:\r\n s[i] = min(i,k) + 1 + min(n - i - 1,k)\r\n else:\r\n s[i] = s[x] + min(k + 1,i - (x + min(k,n-x - 1))) + min(n - i - 1,k)\r\nprint(s)", "def intersection(a, b, k, l):\r\n max_limit = min((a + k), l - 1)\r\n min_limit = max((b - k), 0)\r\n return max(max_limit - min_limit + 1, 0)\r\n \r\ndef left_k(i, k):\r\n return k - max(k - i, 0)\r\n\r\ndef right_k(i, k, l):\r\n return k - max(i + 1 + k - l, 0)\r\n\r\ndef window(messages, k):\r\n amounts = []\r\n for message, link in enumerate(messages):\r\n link = link - 1\r\n if link > -1:\r\n inter = intersection(link, message, k, len(messages))\r\n amount = amounts[link] + left_k(message, k) + right_k(message, k, len(messages)) + 1 - inter\r\n else: \r\n amount = left_k(message, k) + right_k(message, k, len(messages)) + 1\r\n amounts.append(amount)\r\n return amounts\r\n\r\nl, k = input().split(\" \")\r\nmessages = input().split(\" \")\r\nanswer = window([int(m) for m in messages], int(k))\r\nprint(\" \".join([str(a) for a in answer]))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ndp =[0]n\r\ndp[0] = min(m+1,n)\r\nprint(dp[0],end = \" \")\r\nfor i in range(1,n):\r\n if l[i] == 0:\r\n v2 = min(n - 1, i + m)\r\n v1 = max(0, i - m)\r\n dp[i] = v2-v1+1\r\n print(dp[i], end=\" \")\r\n continue\r\n\r\n v2 = min(n-1,i+m)\r\n v1 = max(0,i-m)\r\n v3 = max(0,l[i]-1-m)\r\n v4 = min(n-1,l[i]-1+m)\r\n dp[i] = dp[l[i]-1]+(v2-v1+1)-max(0,min(v2,v4)-max(v1,v3)+1)\r\n print(dp[i], end=\" \")", "n, k = map(int, input().split())\r\nk = min(k, n - 1)\r\na = list(map(lambda x: int(x) - 1, input().split()))\r\nkek = [0 for i in range(n)]\r\nans = [0 for i in range(n)]\r\nfor i in range(n):\r\n if a[i] == -1:\r\n cur_l = max(0, i - k)\r\n cur_r = min(i + k, n - 1)\r\n ans[i] = (i - cur_l) + (cur_r - i) + 1\r\n else:\r\n x = ans[a[i]]\r\n d = (i - a[i] - 1)\r\n if d >= 2 k:\r\n x += min(k, i) + min(k, n - i - 1) + 1\r\n else:\r\n o = 0\r\n cur_l = max(0, i - k)\r\n cur_r = min(i + k, n - 1)\r\n his_l = min(0, a[i] - k)\r\n his_r = min(a[i] + k, n - 1)\r\n if 2 * k >= d >= k:\r\n o = d - 2 * (k)\r\n elif d == k - 1:\r\n o = (-d - 2)\r\n else:\r\n o = (-(his_r - a[i] + 1)) - (a[i] - cur_l)\r\n #print(d, o, x, i, cur_l, cur_r)\r\n x += (i - cur_l) + (cur_r - i) + 1 + o\r\n ans[i] = x\r\nprint(' '.join(map(str, ans)))" ]	{"inputs": ["6 0\n0 1 1 2 3 2", "10 1\n0 1 0 3 4 5 2 3 7 0", "2 2\n0 1", "1 1\n0", "5 2\n0 1 2 3 1", "30 1\n0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 2 0 0 0 0 0 2 1 0", "100 5\n0 1 1 1 0 5 6 6 8 8 9 11 12 11 8 0 0 14 6 16 7 21 15 23 15 24 0 0 0 28 0 29 26 27 19 0 0 21 37 32 40 30 37 34 39 38 34 38 0 0 41 24 45 47 0 33 46 26 31 0 21 57 57 31 63 63 25 59 65 56 68 0 30 55 55 0 70 43 59 49 59 79 66 74 0 11 65 0 80 63 0 84 73 49 73 81 0 86 76 98", "2 2\n0 0", "2 1\n0 0", "2 1\n0 1", "2 0\n0 0", "2 0\n0 1", "3 0\n0 0 0", "3 0\n0 0 1", "3 0\n0 0 2", "3 0\n0 1 0", "3 0\n0 1 1", "3 0\n0 1 2", "3 1\n0 0 0", "3 1\n0 0 1", "3 1\n0 0 2", "3 1\n0 1 0", "3 1\n0 1 1", "3 1\n0 1 2", "3 2\n0 0 0", "3 2\n0 0 1", "3 2\n0 0 2", "3 2\n0 1 0", "3 2\n0 1 1", "3 2\n0 1 2", "3 3\n0 0 0", "3 3\n0 0 1", "3 3\n0 0 2", "3 3\n0 1 0", "3 3\n0 1 1", "3 3\n0 1 2", "10 3\n0 0 0 0 0 0 0 4 0 4", "20 2\n0 0 0 0 2 1 0 3 0 1 1 11 0 10 0 0 9 17 9 0", "40 0\n0 1 2 3 4 5 0 0 0 0 0 11 12 0 14 10 0 16 15 0 19 21 22 0 23 25 25 24 24 29 29 0 0 31 0 35 31 36 34 29"], "outputs": ["1 2 2 3 3 3 ", "2 3 3 4 5 6 6 6 8 2 ", "2 2 ", "1 ", "3 4 5 5 5 ", "2 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 3 3 3 3 3 6 3 3 3 3 3 6 5 2 ", "6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 11 11 23 22 15 23 24 28 29 30 31 11 11 11 13 11 14 38 18 33 11 11 34 13 22 23 24 17 28 19 42 29 44 11 11 33 40 27 36 11 49 53 42 22 11 34 58 59 22 61 62 41 31 65 60 34 11 24 22 22 11 67 28 33 22 33 36 73 32 11 27 72 11 31 70 11 40 35 22 35 43 9 35 18 35 ", "2 2 ", "2 2 ", "2 2 ", "1 1 ", "1 2 ", "1 1 1 ", "1 1 2 ", "1 1 2 ", "1 2 1 ", "1 2 2 ", "1 2 3 ", "2 3 2 ", "2 3 3 ", "2 3 3 ", "2 3 2 ", "2 3 3 ", "2 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "4 5 6 7 7 7 7 10 5 10 ", "3 4 5 5 7 8 5 10 5 8 8 9 5 12 5 5 10 11 9 3 ", "1 2 3 4 5 6 1 1 1 1 1 2 3 1 2 2 1 3 3 1 4 5 6 1 7 8 8 2 2 3 3 1 1 4 1 2 4 3 5 3 "]}	UNKNOWN	PYTHON3	CODEFORCES	52
d4adf413afcc5e9f6dbc13ec73736099	Vowels	Iahubina is tired of so many complicated languages, so she decided to invent a new, simple language. She already made a dictionary consisting of n 3-words. A 3-word is a sequence of exactly 3 lowercase letters of the first 24 letters of the English alphabet (a to x). She decided that some of the letters are vowels, and all the others are consonants. The whole language is based on a simple rule: any word that contains at least one vowel is correct. Iahubina forgot which letters are the vowels, and wants to find some possible correct sets of vowels. She asks Iahub questions. In each question, she will give Iahub a set of letters considered vowels (in this question). For each question she wants to know how many words of the dictionary are correct, considering the given set of vowels. Iahubina wants to know the xor of the squared answers to all the possible questions. There are 224 different questions, they are all subsets of the set of the first 24 letters of the English alphabet. Help Iahub find that number. The first line contains one integer, n (1<=≤<=n<=≤<=104). Each of the next n lines contains a 3-word consisting of 3 lowercase letters. There will be no two identical 3-words. Print one number, the xor of the squared answers to the queries. Sample Input 5 abc aaa ada bcd def Sample Output 0	[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\ndp=[0](1<<24)\r\ndp[-1]=N\r\nfor _ in range(N):\r\n bit=(1<<24)-1\r\n for a in readline().rstrip():\r\n a=ord(a)-97\r\n if bit&1<<a:\r\n bit^=1<<a\r\n dp[bit]-=1\r\nfor i in range(24):\r\n for bit in range((1<<24)-1,-1,-1):\r\n if not bit&1<<i:\r\n dp[bit]+=dp[bit^1<<i]\r\nans=0\r\nfor x in dp:\r\n ans^=x*2\r\nprint(ans)" ]	{"inputs": ["5\nabc\naaa\nada\nbcd\ndef", "100\namd\namj\natr\nbcp\nbjm\ncna\ncpj\ncse\ndij\ndjp\ndlv\nebk\nedf\nelw\nfbr\nfcl\nfhs\nflo\nfmj\ngcg\ngen\nghg\ngvb\ngxx\nhbe\nhbf\nhgu\nhlv\nhqa\nibg\nifp\nima\nitt\nivl\nixu\njle\njli\nket\nkit\nkws\nlep\nles\nleu\nmbp\nmci\nmdv\nmhf\nmih\nmll\nmop\nndp\nnfs\nngl\nnng\noic\nomo\nooj\noti\npax\npfo\npjd\npup\nqer\nrad\nrdg\nrfq\nrvt\nrwa\nrxj\nshc\nsjv\nswx\ntcu\ntlm\ntmb\ntml\ntmw\ntvr\ntvx\nuid\nuir\nukf\nulg\nvce\nves\nvfb\nvok\nvut\nvvi\nvwb\nwab\nwba\nwdf\nweq\nwog\nwsl\nxbk\nxiq\nxop\nxpp", "100\naip\nbfl\nbld\nblh\nbpk\nbqd\nbtk\ncfu\nciv\nckf\ncog\ncro\nctt\ncve\ncvn\ndlj\neer\negw\negx\nffi\nfld\nggk\ngis\ngkv\ngnq\ngvj\nhdo\nhgf\nhgu\nhjt\nhla\nhni\nhnk\nifa\niir\niml\njfa\njgl\nkbf\nliv\nlqo\nmlw\nmot\nmpx\nnas\nnlo\nobt\nodo\nodx\nolr\nolw\nonc\npac\npdp\nphn\npku\npng\npsd\nptl\npuq\npvk\npvx\nqjj\nqju\nqpf\nqqv\nqsf\nrac\nrgj\nrrg\nsbm\nsdf\nsif\nsil\nsnv\nspt\nsxt\ntou\nttj\nufi\nuht\nujm\null\nupm\nuqf\nvof\nvpq\nwae\nwck\nwed\nwhd\nwjn\nwpp\nwvd\nxbx\nxdv\nxeh\nxmq\nxsm\nxsp", "10\nhjk\nkkw\nmsw\nnht\noqu\npcx\npet\nshd\nutb\nwbw", "20\netf\nffq\ngqe\nhpj\nido\niep\nkbv\nlgs\nlkl\nlvg\nmhs\nocr\nonc\nonv\npmv\nqhk\nrck\nrgj\nsib\nuox", "30\nagf\naov\ncac\ncdq\nclc\ncue\ndmh\ndrr\ndxv\nfrv\njmg\nkih\nkii\nkqm\nkwc\nnri\nohw\nrfk\nrrd\nrrk\ntmp\ntsc\nuhg\nuhx\nujw\nvms\nvrg\nwer\nxml\nxuv", "40\nbhw\nblh\ncal\nccg\ncdd\ncsm\ndir\ndux\nefp\nfnw\ngcr\nhuc\niaf\nipv\niva\niwl\njeb\njwk\nlot\nmcf\nmnk\nnak\nopl\norb\noxj\nqws\nrbl\nsmo\nsuw\nsws\ntgt\numg\nvhn\nvud\nwml\nwqg\nxbv\nxgj\nxlm\nxxv", "50\nagj\nbnk\nbtg\ncqt\ncxs\ndjv\neft\neqt\nfbf\nfbp\nfko\nfrg\ngdb\ngdw\ngie\ngvv\nhdw\nijo\nixc\njif\njph\nkad\nkje\nlel\nles\nlhw\nlkw\nmht\nnii\nnsb\nnuo\nnwp\nolm\nomb\noti\notm\nove\npnl\npqf\npwc\nrfq\nrkl\nsrm\nthb\ntje\ntpw\nugo\nwhk\nwwq\nxpx", "50\naah\naoh\naqc\nauo\ncnk\ndfa\ndok\nfvd\nhxk\nibb\nicl\nigj\nird\njjv\njmv\nkbo\nkgj\nkji\nkxp\nlnf\nlqe\nndq\nnoi\nohh\noro\npdg\npio\npjq\npkw\npsg\npvt\nqdi\nqmo\nrba\nrkh\nrpk\nrrm\nrxs\nssu\ntcn\ntea\ntjb\ntkr\nuuh\nvmn\nvqd\nwaj\nwnl\nwqp\nxtw", "50\nabh\navn\nbrx\ndcp\ndqe\nedr\neub\nfmg\ngda\ngmm\ngpn\nhbd\nhnw\nhta\nhuk\nhun\nieo\nifc\niwn\nixm\njpc\njsr\nkrj\nksc\nlie\nljj\nllb\nlqp\nmap\nmkx\nnob\nogl\nokh\noxq\npqu\npxk\nqfv\nqkt\nrjw\nseu\ntpe\nupe\nvlk\nwbw\nwce\nxae\nxqk\nxsv\nxve\nxvk", "50\nbpx\ncpq\ncqo\ndct\ndhh\ndid\ndlr\ndpl\neie\nesj\nfnc\nfse\nfxp\ngat\nghq\ngmg\nhan\nhdq\nhqn\nhse\nhwt\nibk\njbg\njda\nkgi\nkrr\nkrt\nkvo\nlwe\nmuh\nmve\nnfp\noac\nodw\nofq\npdr\nqlr\nrjm\nsdl\nsfj\nshs\ntae\ntdt\nual\nukf\nuup\nvkw\nvnj\nwbh\nxsp", "50\nbfu\nbqa\ncew\nclt\ncnx\ncor\ncvq\nddq\ndgm\ndme\nehr\neua\newd\nfhq\nhep\nill\njmp\njnc\njng\njts\njtt\njww\nkei\nkjr\nkmk\nkoq\nkxi\nmgu\nnbb\nnqa\nnrp\nntq\nnwg\nost\notf\noxc\npia\nqgo\nqli\nqqa\nrrx\nrug\nsaj\nsjc\ntqm\nvoh\nvoo\nvwd\nwke\nwqg", "100\nacs\nako\naqn\navw\naxm\nbea\nbmw\nbro\nbrw\nbvn\nciv\ncpn\ndas\ndex\ndjo\ndwq\neat\nedq\negu\neqw\nfkt\nflt\nfqv\nfrf\nfwg\ngab\nhcs\nhfw\nhoq\nhwu\nicq\niji\nins\nirs\nivn\njga\njng\nkcq\nkfe\nkox\nkps\nkts\nlmt\nlok\nlvm\nlwt\nmfd\nmlc\nmnm\nmwu\nnad\nnai\nnot\nogr\nope\noqm\nosd\novq\nprj\nqad\nqoh\nqqk\nrnq\nrqx\nrsh\nrug\nrxg\nsar\nsbn\nsbu\nsbw\nseg\nskp\nsqm\nssx\ntoo\nttm\nuch\nuek\nuhm\nuhn\nusv\nvaw\nvcw\nvkm\nvsj\nvwi\nwbm\nwcg\nwqr\nwri\nwsw\nxbs\nxcn\nxhw\nxip\nxoq\nxue\nxuk\nxvg", "100\naie\naoq\nban\nbdw\ncdk\ncgw\ncls\ncoq\ncsp\ncwi\ndmg\negd\negi\nejd\nfbs\nfiv\nfjv\nfrp\nfto\ngcf\ngfb\ngkg\ngvg\nhfe\nhfr\nhgi\nhgx\nhpe\nhwt\nhxn\nibd\nifb\nihu\nipf\niwe\njds\njfe\njkb\njkx\njvq\nkdr\nkjh\nkll\nkog\nltk\nmik\nmsb\nnci\nndl\nnfo\nnfp\nnio\nnkr\nnmi\nnpk\noch\nogx\noka\nolf\nopm\norv\nphm\npmd\npuo\npxq\nqae\nqik\nqlp\nqna\nqst\nqth\nqxm\nrak\nrpj\nrqd\nsbq\nsfv\nstw\ntaj\nteh\ntlw\ntmj\ntmm\ntqv\nujn\nuko\nunb\nuvm\nvdb\nvjd\nvtp\nvvt\nwme\nwnq\nwqs\nwwj\nxan\nxdn\nxjg\nxkd", "100\nahd\nahw\narc\naro\natd\naui\nbas\nbeg\nblc\nbmu\nboo\nbpt\nbqa\ncds\nchn\ncni\ncsh\nddt\ndjb\ndkh\neal\near\necr\neea\nefr\nekf\nekq\netb\neui\nfau\nfcr\nfdc\nfhp\nfpc\nfwv\ngaf\ngoo\ngut\nhek\nheu\nhfq\nhjk\nhjx\nhmk\nhqp\nhsa\niax\nijm\njlf\njlw\njok\njqi\njss\njte\nknb\nkrt\nlbi\nlej\nlqu\nlva\nlxf\nmll\nndb\nndf\nngc\nolh\nope\npds\npli\npuk\nqec\nqgi\nqkr\nqqu\nrks\nrsj\nscb\nsig\nsnj\ntdc\ntpa\ntro\nttc\ntwn\nuef\nuhh\nujb\nujn\nuka\nulk\nuss\nuwa\nuwu\nvmr\nvmt\nvoq\nwug\nwvh\nxef\nxrk", "100\nagg\nals\naxf\nbdd\nbex\nbsx\nchb\nclr\ncmm\ndaf\ndbf\nddw\ndng\nduw\nebp\nech\neex\neff\nefg\neqt\nerp\nexg\nfbd\nffg\nfif\nfta\nghv\ngqn\ngrf\nhcc\nhdc\nhos\nhqh\nims\nipf\niro\nixu\njhx\njil\njqn\njuh\nkeb\nknl\nkol\nksj\nksl\nkxn\nlbn\nlci\nlfr\nliw\nlpc\nmdq\nmhx\nmts\nmwl\nnde\nnik\nnlo\nnnk\nnpc\nntt\nohr\nona\npap\npfb\npgm\npgo\npql\npsd\npvd\nqax\nqcj\nqfj\nqiv\nqke\nqks\nrhu\nrrg\nseo\nskr\ntjp\ntlt\ntof\ntop\ntpn\ntxe\nvfl\nvpn\nvrh\nwbd\nwet\nwgo\nwlm\nwox\nwwi\nxas\nxmg\nxng\nxqj", "100\navm\nbir\nbmx\nbve\nbvx\ncbr\nccq\nckn\ncmd\ncuu\ncxh\nddw\ndfb\ndgt\ndmo\ndqd\neon\nerm\nerp\neux\newl\nfau\nfek\nfss\nftg\nfvb\ngfu\ngkw\nguj\ngwe\nhjf\nhrq\nibk\njjs\njmp\njqs\nkbu\nklu\nkqw\nkqx\nlaa\nlbe\nmek\nmga\nmio\nmle\nmls\nmma\nmoj\nmpb\nmxu\nnfs\nnht\noap\nods\noee\nokc\noqr\npdh\npdt\nphq\nphw\npwa\nqgt\nqji\nqnj\nqqt\nqvu\nqwb\nqwc\nrdv\nrfq\nrnx\nrse\nruq\nrvs\nsoo\nsxe\nthh\ntop\ntrg\ntud\ntur\nugu\nupj\nupt\nvak\nver\nvhu\nvul\nwes\nwkm\nwqc\nwuf\nxbk\nxdf\nxlh\nxnv\nxqo\nxvu"], "outputs": ["0", "13888", "8624", "0", "0", "0", "944", "1184", "2736", "224", "3200", "2432", "7488", "8960", "6624", "13408", "10864"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d4bcfbf18441008f1ac0b108ef216426	Cow Program	Farmer John has just given the cows a program to play with! The program contains two integer variables, x and y, and performs the following operations on a sequence a1,<=a2,<=...,<=an of positive integers: 1. Initially, x<==<=1 and y<==<=0. If, after any step, x<=≤<=0 or x<=><=n, the program immediately terminates. 1. The program increases both x and y by a value equal to ax simultaneously. 1. The program now increases y by ax while decreasing x by ax. 1. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on. The cows are not very good at arithmetic though, and they want to see how the program works. Please help them! You are given the sequence a2,<=a3,<=...,<=an. Suppose for each i (1<=≤<=i<=≤<=n<=-<=1) we run the program on the sequence i,<=a2,<=a3,<=...,<=an. For each such run output the final value of y if the program terminates or -1 if it does not terminate. The first line contains a single integer, n (2<=≤<=n<=≤<=2·105). The next line contains n<=-<=1 space separated integers, a2,<=a3,<=...,<=an (1<=≤<=ai<=≤<=109). Output n<=-<=1 lines. On the i-th line, print the requested value when the program is run on the sequence i,<=a2,<=a3,<=...an. Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. Sample Input 4 2 4 1 3 1 2 Sample Output 3 6 8 -1 -1	[ "n = int(input())\r\nt = [0, 0] + list(map(int, input().split()))\r\na, b = [0] * (n + 1), [0] * (n + 1)\r\na[1] = b[1] = -1\r\n \r\ndef f(s, a, b, l):\r\n global t\r\n l.reverse()\r\n j, n = 0, len(l)\r\n while True:\r\n s += t[l[j]]\r\n a[l[j]] = s\r\n j += 1\r\n if j == n: return\r\n s += t[l[j]]\r\n b[l[j]] = s\r\n j += 1\r\n if j == n: return\r\n\r\ndef g(i, k):\r\n global a, b\r\n l = []\r\n if k:\r\n a[i] = -1\r\n l.append(i)\r\n i += t[i]\r\n while True:\r\n if i > n: return f(0, a, b, l) \r\n if b[i] > 0: return f(b[i], a, b, l) \r\n if b[i] == -1: return\r\n b[i] = -1\r\n l.append(i)\r\n i -= t[i]\r\n if i < 1: return f(0, b, a, l)\r\n if a[i] > 0: return f(a[i], b, a, l)\r\n if a[i] == -1: return\r\n a[i] = -1\r\n l.append(i)\r\n i += t[i]\r\n \r\nfor i in range(2, n + 1):\r\n if a[i] == 0: g(i, True) \r\n if b[i] == 0: g(i, False)\r\n\r\nfor i in range(1, n):\r\n if b[i + 1] > 0: t[i] = i + b[i + 1]\r\n else: t[i] = -1\r\n\r\nprint('\\n'.join(map(str, t[1: n])))", "n = int(input())\r\nt = [0, 0]\r\nt += list(map(int, input().split()))\r\nn += 1\r\na = [0] * n\r\nb = [0] * n\r\nn -= 1\r\na[1] = b[1] = -1\r\n\r\n#print(t, a, b)\r\n\r\ndef calc(s, a, b, l):\r\n\tglobal t\r\n\tl.reverse()\r\n\tj = 0\r\n\tn = len(l)\r\n\t\r\n\twhile True:\r\n\t\ts += t[l[j]]\r\n\t\ta[l[j]] = s\r\n\t\tj += 1\r\n\t\tif j == n:\r\n\t\t\treturn\r\n\t\t\r\n\t\ts += t[l[j]]\r\n\t\tb[l[j]] = s\r\n\t\tj += 1\r\n\t\tif j == n:\r\n\t\t\treturn\r\n\r\n\t\t\t\r\ndef calc2(i, k):\r\n\tglobal a, b\r\n\tl = []\r\n\tif k:\r\n\t\ta[i] = -1\r\n\t\tl.append(i)\r\n\t\ti += t[i]\r\n\t\t\r\n\twhile True:\r\n\t\tif i > n:\r\n\t\t\treturn calc(0, a, b, l)\r\n\t\tif b[i] > 0:\r\n\t\t\treturn calc(b[i], a, b, l)\r\n\t\tif b[i] == -1:\r\n\t\t\treturn\r\n\t\tb[i] = -1\r\n\t\tl.append(i)\r\n\t\ti -= t[i]\r\n\t\tif i < 1:\r\n\t\t\treturn calc(0, b, a, l)\r\n\t\tif a[i] > 0:\r\n\t\t\treturn calc(a[i], b, a, l)\r\n\t\tif a[i] == -1:\r\n\t\t\treturn\r\n\t\ta[i] -= 1\r\n\t\tl.append(i)\r\n\t\ti += t[i]\r\n\r\nfor i in range(2, n + 1):\r\n\tif a[i] == 0:\r\n\t\tcalc2(i, True)\r\n\tif b[i] == 0:\r\n\t\tcalc2(i, False)\r\n\r\nfor i in range(1, n):\r\n\tif b[i + 1] > 0:\r\n\t\tt[i] = i + b[i + 1]\r\n\telse:\r\n\t\tt[i] = -1\r\n\r\n#print(t, a, b)\r\n\t\t\r\nprint('\\n'.join(map(str, t[1:n])))" ]	{"inputs": ["4\n2 4 1", "3\n1 2", "5\n2 2 1 3", "2\n1", "8\n7 6 2 6 2 6 6", "8\n4 5 3 2 3 3 3", "3\n1 1", "5\n3 2 4 2", "92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 36 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37", "98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 64 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46", "98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 61 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21", "98\n54 88 79 67 72 6 44 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9", "10\n6 7 5 3 1 5 2 4 6", "8\n6 311942309 3 1 3 2 2", "8\n2 3 1 2 2 3 3", "6\n2 1 2 2 3", "23\n20 1 3 3 13 11 9 7 5 3 1 7 2 4 6 8 10 12 14 16 12 5", "71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57", "23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 12 14 935874687 21 1", "71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49"], "outputs": ["3\n6\n8", "-1\n-1", "3\n-1\n-1\n-1", "-1", "8\n8\n12\n10\n-1\n-1\n20", "5\n7\n-1\n-1\n-1\n-1\n-1", "-1\n-1", "4\n-1\n7\n-1", "80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n650617329\n650617319\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n650617395\n194\n491073056\n259\n210\n491073064\n23...", "95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n106\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181...", "20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n101\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n96...", "55\n90\n82\n71\n77\n-1\n51\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n198\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n7983...", "7\n9\n8\n-1\n-1\n-1\n-1\n-1\n-1", "7\n311942311\n-1\n311942323\n311942317\n311942321\n12", "3\n5\n-1\n-1\n-1\n-1\n-1", "3\n-1\n-1\n-1\n-1", "21\n-1\n-1\n-1\n18\n17\n16\n-1\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37", "29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1", "12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44", "3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515"]}	UNKNOWN	PYTHON3	CODEFORCES	2
d4c9f2251593a3c8a9c4136b405c21e0	Runner's Problem	You are running through a rectangular field. This field can be represented as a matrix with 3 rows and m columns. (i,<=j) denotes a cell belonging to i-th row and j-th column. You start in (2,<=1) and have to end your path in (2,<=m). From the cell (i,<=j) you may advance to: - (i<=-<=1,<=j<=+<=1) — only if i<=><=1, - (i,<=j<=+<=1), or - (i<=+<=1,<=j<=+<=1) — only if i<=<<=3. However, there are n obstacles blocking your path. k-th obstacle is denoted by three integers ak, lk and rk, and it forbids entering any cell (ak,<=j) such that lk<=≤<=j<=≤<=rk. You have to calculate the number of different paths from (2,<=1) to (2,<=m), and print it modulo 109<=+<=7. The first line contains two integers n and m (1<=≤<=n<=≤<=104, 3<=≤<=m<=≤<=1018) — the number of obstacles and the number of columns in the matrix, respectively. Then n lines follow, each containing three integers ak, lk and rk (1<=≤<=ak<=≤<=3, 2<=≤<=lk<=≤<=rk<=≤<=m<=-<=1) denoting an obstacle blocking every cell (ak,<=j) such that lk<=≤<=j<=≤<=rk. Some cells may be blocked by multiple obstacles. Print the number of different paths from (2,<=1) to (2,<=m), taken modulo 109<=+<=7. If it is impossible to get from (2,<=1) to (2,<=m), then the number of paths is 0. Sample Input 2 5 1 3 4 2 2 3 Sample Output 2	[ "L = 3\r\nM = 10*9 + 7\r\niden = [[0] L for _ in range(L)]\r\nfor i in range(L):\r\n iden[i][i] = 1\r\ndef mat_multiply(a, b):\r\n n = len(a)\r\n ret = [[0] * n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % M\r\n return ret\r\ndef vector_matrix_multiply(a, b):\r\n n = len(a)\r\n ret = [0] * n\r\n for j in range(n):\r\n for i in range(n):\r\n ret[j] = (ret[j] + a[i] * b[i][j]) % M\r\n return ret\r\ndef mat_pow(mt, p):\r\n if p == 0:\r\n return iden\r\n ret = mat_pow(mt, p >> 1)\r\n ret = mat_multiply(ret, ret)\r\n if p & 1:\r\n ret = mat_multiply(ret, mt)\r\n return ret\r\ndef make_cur_mat(cnt):\r\n ret = [[0] * L for _ in range(L)]\r\n for i in range(L):\r\n for j in range(L):\r\n if not cnt[i] and abs(i - j) <= 1:\r\n ret[i][j] = 1\r\n return ret\r\ndef main():\r\n n, m = map(int, input().split())\r\n events = {}\r\n for _ in range(n):\r\n a, l, r = map(int, input().split())\r\n a -= 1\r\n if l in events:\r\n events[l].append((0, a))\r\n else:\r\n events[l] = [(0, a)]\r\n if r + 1 in events:\r\n events[r + 1].append((1, a))\r\n else:\r\n events[r + 1] = [(1, a)]\r\n prev = 1\r\n dp = [0] * L\r\n dp[1] = 1\r\n cnt = [0] * L\r\n for time, event_list in sorted(events.items()):\r\n cur = time\r\n cur_mt = make_cur_mat(cnt)\r\n cur_mt = mat_pow(cur_mt, cur - prev)\r\n dp = vector_matrix_multiply(dp, cur_mt)\r\n for event in event_list:\r\n open_event, a = event\r\n if open_event:\r\n cnt[a] += 1\r\n else:\r\n cnt[a] -= 1\r\n prev = cur\r\n cur_mt = make_cur_mat(cnt)\r\n cur_mt = mat_pow(cur_mt, m - prev)\r\n dp = vector_matrix_multiply(dp, cur_mt)\r\n print(dp[1])\r\nif __name__ == \"__main__\":\r\n main()# 1692026702.165854", "def matmul(A,B,mod):\r\n res = [[0]len(B[0]) for _ in [None]len(A)]\r\n for i, resi in enumerate(res):\r\n for k, aik in enumerate(A[i]):\r\n for j,bkj in enumerate(B[k]):\r\n resi[j] += aikbkj\r\n resi[j] %= mod\r\n return res\r\n\r\ndef matpow(A,p,mod):\r\n if p%2:\r\n return matmul(A, matpow(A,p-1,mod),mod)\r\n elif p > 0:\r\n b = matpow(A,p//2,mod)\r\n return matmul(b,b,mod)\r\n else:\r\n return [[int(i==j) for j in range(len(A))] for i in range(len(A))]\r\n\r\nfrom collections import defaultdict\r\nmod=109+7\r\nn,m=map(int,input().split())\r\nblock=defaultdict(list)\r\ns=set()\r\ns.add(m)\r\nfor i in range(n):\r\n x,l,r=map(int,input().split())\r\n block[l-1].append(x)\r\n block[r].append(-x)\r\n s.add(l-1)\r\n s.add(r)\r\n\r\ns=sorted(list(s))\r\ndp=[[0],[1],[0]]\r\nlast=1\r\nng=[0,0,0]\r\nfor x in s:\r\n d=x-last\r\n mat=[[0]3 for i in range(3)]\r\n if ng[0]==0:\r\n mat[0][0]=1\r\n mat[0][1]=1\r\n if ng[1]==0:\r\n mat[1][0]=1\r\n mat[1][1]=1\r\n mat[1][2]=1\r\n if ng[2]==0:\r\n mat[2][1]=1\r\n mat[2][2]=1\r\n A=matpow(mat,d,mod)\r\n dp=matmul(A,dp,mod)\r\n for i in block[x]:\r\n if i>0:\r\n ng[i-1]+=1\r\n else:\r\n ng[-i-1]-=1\r\n #print(dp,A)\r\n last=x\r\n\r\nprint(dp[1][0])" ]	{"inputs": ["2 5\n1 3 4\n2 2 3", "50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n1 50 53\n3 80 81\n3 66 70\n2 35 52\n1 63 69\n2 65 87\n3 68 75\n1 33 42\n1 56 90\n3 73 93\n2 20 26\n2 42 80\n2 83 87\n3 99 99\n1 14 79\n2 94 97\n1 66 85\n1 7 73\n1 50 50\n2 16 40\n2 76 94\n1 71 98\n1 99 99\n1 61 87\n3 98 98\n2 11 41\n3 67 78\n1 31 58\n3 81 85\n1 81 94\n3 41 83\n3 46 65\n1 94 94\n3 31 38\n1 19 35\n3 50 54\n3 85 90\n3 47 63\n3 62 87\n1 18 75\n1 30 41", "50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n2 70 88\n2 67 88\n1 9 75\n2 4 50\n2 9 11\n1 77 92\n1 28 58\n1 23 72\n1 24 75\n2 12 50\n1 54 55\n2 45 93\n1 88 93\n2 98 99\n1 40 58\n2 40 42\n1 16 61\n2 94 94\n1 82 86\n2 81 85\n2 46 46\n2 88 97\n2 6 86\n1 30 86\n2 87 96\n1 44 50\n2 43 88\n1 29 98\n1 39 76\n1 78 94\n1 6 69\n2 92 95\n1 40 68\n1 97 99\n1 85 85\n1 69 74\n1 23 51\n1 34 66\n2 70 98\n2 94 97\n1 54 73"], "outputs": ["2", "0", "5"]}	UNKNOWN	PYTHON3	CODEFORCES	2
d4e0927d80d36c92d3c5e2af89871259	Forming Teams	One day n students come to the stadium. They want to play football, and for that they need to split into teams, the teams must have an equal number of people. We know that this group of people has archenemies. Each student has at most two archenemies. Besides, if student A is an archenemy to student B, then student B is an archenemy to student A. The students want to split so as no two archenemies were in one team. If splitting in the required manner is impossible, some students will have to sit on the bench. Determine the minimum number of students you will have to send to the bench in order to form the two teams in the described manner and begin the game at last. The first line contains two integers n and m (2<=≤<=n<=≤<=100, 1<=≤<=m<=≤<=100) — the number of students and the number of pairs of archenemies correspondingly. Next m lines describe enmity between students. Each enmity is described as two numbers ai and bi (1<=≤<=ai,<=bi<=≤<=n, ai<=≠<=bi) — the indexes of the students who are enemies to each other. Each enmity occurs in the list exactly once. It is guaranteed that each student has no more than two archenemies. You can consider the students indexed in some manner with distinct integers from 1 to n. Print a single integer — the minimum number of students you will have to send to the bench in order to start the game. Sample Input 5 4 1 2 2 4 5 3 1 4 6 2 1 4 3 4 6 6 1 2 2 3 3 1 4 5 5 6 6 4 Sample Output 102	[ "import sys\r\nfrom typing import Callable\r\nfrom collections import defaultdict, deque\r\nfrom enum import Enum\r\n\r\nAlGraph = dict[int, list[int]]\r\n\r\n\r\nclass Flags(Enum):\r\n UNVISITED = -1\r\n VISITED = - 2\r\n\r\n\r\ndef flood_fill(graph: AlGraph, node: int, state: list[int], n: int) -> int:\r\n queue: deque[int] = deque()\r\n queue.append(node)\r\n colors: list[int] = [-1] * n\r\n # Init values for root\r\n colors[0] = 1\r\n state[0] = Flags.VISITED.value\r\n\r\n is_bipartite = True\r\n while queue and is_bipartite:\r\n u = queue.popleft()\r\n # Mark as visited\r\n for v in graph[u]:\r\n if Flags.UNVISITED.value == state[v]:\r\n # Mark the node as visited, otherwise another node might put v again in the stack\r\n state[v] = Flags.VISITED.value\r\n colors[v] = 1 - colors[u]\r\n queue.append(v)\r\n else:\r\n # Check that the color is different, if so this g is not bipartite.\r\n # By constrain of the problem, only two ppl can be enemies of each other, so it would\r\n # be impossible to have to odd cycles (not bipartite)\r\n if colors[u] == colors[v]:\r\n # We need this to signal the outer while loop to stop\r\n is_bipartite = False\r\n break\r\n return 0 if is_bipartite else 1\r\n\r\n\r\ndef main():\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n # Build the graph\r\n graph: AlGraph = defaultdict(list)\r\n for i in range(m):\r\n u, v = (int(i) - 1 for i in read().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n state: list[int] = [Flags.UNVISITED.value] * n\r\n\r\n num_of_odd_cycles = 0\r\n for u in range(n):\r\n if Flags.UNVISITED.value == state[u]:\r\n num_of_odd_cycles += flood_fill(graph, u, state, n)\r\n if (n - num_of_odd_cycles) % 2 != 0:\r\n num_of_odd_cycles += 1\r\n print(num_of_odd_cycles)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict as DD\nn,m = map(int, input().split())\nG = DD(list)\nbench = 0\nfor _ in range(m):\n a,b = map(lambda x: int(x)-1, input().split())\n G[a].append(b)\n G[b].append(a)\n\ncolors = dict()\nodds = 0\nfor root in range(n):\n if root in colors:\n continue\n stack = [(root,0)]\n ok = True\n while stack:\n node,col1 = stack.pop()\n col2 = 1 - col1\n colors[node] = col2\n for child in G[node]:\n if child in colors:\n if colors[child] == col2:\n odds += 1\n ok = False\n break\n else:\n continue\n stack.append((child, col2))\n if not ok:\n break\n\n\nprint(odds + (n-odds) % 2)\n", "n,m=map(int,input().split())\na=[[0](n+1) for i in range(n+1)]\nfor _ in range(m):\n u,v=map(int,input().split())\n a[u][v]=1\n a[v][u]=1\n\nd=[-1](n+1)\n\ndef dfs(i,v):\n d[i]=v\n for j in range(1,n+1):\n if a[i][j] and d[j]==-1:\n dfs(j,1-v)\n\nfor i in range(1,n+1):\n if d[i]==-1:\n dfs(i,1)\nres=0\nfor i in range(1,n+1):\n for j in range(i+1,n+1):\n if a[i][j] and d[i]==d[j]:\n res+=1\nif (n-res)%2:\n print(res+1)\nelse:\n print(res)\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import \r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(ele,end=\"\\n\")\r\n\r\n\r\nn,m=L()\r\na=[[0](n+1) for i in range(n+1)]\r\nfor _ in range(m):\r\n u,v=L()\r\n a[u][v]=1\r\n a[v][u]=1\r\n\r\nd=[-1](n+1)\r\n\r\ndef dfs(i,v):\r\n d[i]=v\r\n for j in range(1,n+1):\r\n if a[i][j] and d[j]==-1:\r\n dfs(j,1-v)\r\n\r\nfor i in range(1,n+1):\r\n if d[i]==-1:\r\n dfs(i,1)\r\nres=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if a[i][j] and d[i]==d[j]:\r\n res+=1\r\nif (n-res)%2:\r\n print(res+1)\r\nelse:\r\n print(res)\r\n\r\n", "def detect_cycle(node, parent, visited, graph, ref):\n visited.add(node)\n ref[\"count\"] += 1\n for neighbor in graph[node]:\n if neighbor == parent:\n continue\n if neighbor not in visited:\n if detect_cycle(neighbor, node, visited, graph, ref):\n return True\n else:\n return True\n return False\n\n\ndef main():\n n, m = map(int, input().split(\" \"))\n graph = {}\n for i in range(1, n + 1):\n graph[i] = []\n for _ in range(m):\n a, b = map(int, input().split(\" \"))\n graph[a].append(b)\n graph[b].append(a)\n ref = {}\n bench = 0\n visited = set()\n for node in graph:\n ref[\"count\"] = 0\n if node not in visited:\n if detect_cycle(node, None, visited, graph, ref):\n bench += ref[\"count\"] % 2\n bench += ((n - bench) % 2)\n return bench\nprint(main())\n", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\npar = []\r\nlength = [] \r\n\r\ndef find(x): \r\n if par[x] == x:\r\n return x\r\n else:\r\n return find(par[x])\r\n\r\nn, m = iia()\r\nlength = [1] (n + 1)\r\npar = list(range(0,n+1))\r\nres = 0\r\nfor _ in range(m):\r\n a, b = iia()\r\n x = find(a)\r\n y = find(b)\r\n if x == y and length[y] % 2 != 0:\r\n res += 1\r\n par[x] = par[y]\r\n length[y] += length[x]\r\nif (n - res) % 2 != 0:\r\n res += 1\r\nprint(res)\r\n\r\n\r\n\r\n", "def dfs(s,e,g):\r\n ss.add(s)\r\n if vist[s] :\r\n return \"c\"\r\n vist[s] = True\r\n for i in g[s]:\r\n if i != e:\r\n if dfs(i,s,g) == \"c\":\r\n return \"c\"\r\n return \"p\"\r\nn,m = map(int,input().split())\r\ng = [[]for i in range(n)]\r\nvist = [0 for i in range(n)]\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n a-=1\r\n b-=1\r\n g[a].append(b)\r\n g[b].append(a)\r\nc = 0\r\nt = 0\r\nwhile c < n:\r\n if not vist[c] :\r\n ss = set()\r\n if dfs(c,-1,g) == \"c\":\r\n if len(ss)%2 == 1:\r\n t+=1\r\n c+=1\r\nn-=t\r\nif n%2 == 1:\r\n print(t+1)\r\nelse:\r\n print(t)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef dfs(c_node,p_node,ref,vis):\r\n \r\n if(c_node in vis):\r\n return True\r\n vis.add(c_node)\r\n for ch_node in graph[c_node]:\r\n if(ch_node != p_node):\r\n ref[\"count\"] +=1\r\n if(dfs(ch_node,c_node,ref,vis)):\r\n return True\r\n return False\r\n\r\n\r\nn,m = Iarr()\r\ngraph ={}\r\nfor x in range(n):\r\n graph[x] = []\r\nfor x in range(m):\r\n v1,v2 = Iarr()\r\n graph[v1-1].append(v2-1)\r\n graph[v2-1].append(v1-1)\r\n\r\nans = 0\r\nref = {}\r\nvis = set()\r\n\r\nfor i in range(n):\r\n if i not in vis:\r\n ref[\"count\"] = 0\r\n cycle = dfs(i, None, ref, vis)\r\n\r\n if cycle:\r\n ans += ref[\"count\"] % 2 == 1\r\n\r\nif (n - ans) % 2 == 1:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import \r\n\r\nN,M = map(int, input().split())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n a,b = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append(b)\r\n P[b].append(a)\r\n \r\nseen = [-1]N\r\n\r\ndef paint(idx):\r\n v = deque([(idx,0)])\r\n while v:\r\n i,d = v.popleft()\r\n if seen[i]!=-1 and seen[i]!=d:\r\n seen[i] = -2\r\n continue\r\n seen[i] = d\r\n \r\n for j in P[i]:\r\n if seen[j]!=-1 and seen[j]!=(d+1)%2:\r\n seen[i] = -2\r\n continue\r\n if seen[j]==-1:\r\n v.append((j,(d+1)%2))\r\n \r\n\r\nfor i in range(N):\r\n if seen[i]==-1:\r\n paint(i)\r\n#print(seen)\r\nC = Counter(seen)\r\nans = C[-2]\r\nif (N-ans)%2:\r\n ans+=1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\ngraph=[[] for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n graph[x-1].append(y-1)\r\n graph[y-1].append(x-1)\r\nvis=[False]n\r\nc1=0\r\nc2=0\r\n#print(graph)\r\npar=[-1]n\r\nfor i in range(n):\r\n if vis[i]==False:\r\n x,y=[i],[]\r\n q=[[i,0]]\r\n vis[i]=True\r\n while(q):\r\n h=q.pop()\r\n for j in graph[h[0]]:\r\n if not(vis[j]):\r\n par[j]=h[0]\r\n if h[-1]==1:\r\n q.append([j,0])\r\n x.append(j)\r\n else:\r\n q.append([j,1])\r\n y.append(j)\r\n vis[j]=True\r\n else:\r\n if par[h[0]]!=j:\r\n if h[0] in x and j in x:\r\n x.remove(j)\r\n if h[0] in y and j in y:\r\n y.remove(j)\r\n if c1>c2:\r\n c2+=max(len(x),len(y))\r\n c1+=min(len(x),len(y))\r\n else:\r\n c1+=max(len(x),len(y))\r\n c2+=min(len(x),len(y))\r\nprint(abs(c1-c2)+n-c1-c2)\r\n \r\n \r\n ", "n,x=map(int,input().split())\r\ndic={i:[] for i in range(1,n+1)}\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n dic[a].append(b)\r\n dic[b].append(a)\r\ndef dfs(s):\r\n global vis,c,qw\r\n if s in vis:\r\n return\r\n vis.add(s)\r\n c+=1\r\n qw=False\r\n if len(dic[s])==2:\r\n qw=True\r\n for i in dic[s]:\r\n dfs(i)\r\n\r\n\r\nvis=set()\r\nr=0\r\nfor i in dic:\r\n c=0\r\n qw=False\r\n if i not in vis:\r\n dfs(i)\r\n if c%2 and qw:\r\n r+=1\r\nprint(r+((n-r)%2))", "n, m = map(int, input().split())\r\nG = [[] for i in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n G[u].append(v)\r\n G[v].append(u)\r\n\r\ncycle_len, node_count = 0, 0\r\nvisited = [False] * n\r\ndef dfs(u, bef=-1):\r\n global node_count\r\n global cycle_len\r\n\r\n #print(u)\r\n if visited[u]:\r\n if node_count % 2 == 1 and node_count >= 2:\r\n cycle_len = node_count\r\n #print(node_count, cycle_len)\r\n return\r\n\r\n visited[u] = True\r\n node_count += 1\r\n for v in G[u]:\r\n if v != bef:\r\n dfs(v, bef=u)\r\n\r\n node_count -= 1\r\n\r\n#print(G)\r\n\r\nrem = 0\r\nfor i in range(n):\r\n #print('+', i)\r\n if not visited[i]:\r\n node_count = 0\r\n cycle_len = 0\r\n\r\n dfs(i)\r\n if cycle_len > 0:\r\n rem += 1\r\n\r\nif (n - rem) % 2 == 1:\r\n rem += 1\r\n\r\nprint(rem)\r\n", "\r\nn, m = map(int, input().split())\r\nadj_list = [[] for i in range(n)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n adj_list[x-1].append(y-1)\r\n adj_list[y-1].append(x-1)\r\nvisited = [False for i in range(n)]\r\n \r\ndef dfs(cur, par, arr):\r\n arr.add(cur)\r\n if visited[cur]:\r\n return True\r\n \r\n visited[cur] = True\r\n for i in adj_list[cur]:\r\n if i != par:\r\n if dfs(i, cur, arr):\r\n return True\r\n return False\r\n \r\ni = 0\r\nres = 0\r\nwhile i < n:\r\n if not visited[i]:\r\n arr = set()\r\n if dfs(i, -1, arr):\r\n if len(arr) % 2 == 1:\r\n res += 1\r\n i += 1\r\nn -= res\r\nif n % 2 == 1:\r\n print(res + 1)\r\n \r\nelse:\r\n print(res)", "n,m=map(int,input().split())\r\nch=[False for i in range(n)]\r\na=[[]for i in range(n)]\r\nva=[0]\r\ndef dfs(i):\r\n if ch[i]:\r\n return 0\r\n if len(a[i])<2:\r\n va[0]=0\r\n re=0\r\n ch[i]=True\r\n for i in a[i]:\r\n re+=dfs(i)\r\n return re+1\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n a[x - 1].append(y-1)\r\n a[y - 1].append(x-1)\r\nans=0\r\nfor i in range(n):\r\n if not ch[i]:\r\n va[0] = 1\r\n d=dfs(i)\r\n if not(d==1) and d%2==1 and va[0]==1:\r\n ans+=1\r\nprint(ans+(1 if not(n%2==ans%2)else 0))", "n, m = map(int, input().split())\na = [[0] * (n + 1) for i in range(n + 1)]\n\nfor _ in range(m):\n u, v = map(int, input().split())\n a[u][v] = 1\n a[v][u] = 1\n\nd = [-1] * (n + 1)\n\n\ndef dfs(i, v):\n d[i] = v\n for j in range(1, n + 1):\n if a[i][j] and d[j] == -1:\n dfs(j, 1 - v)\n\n\nfor i in range(1, n + 1):\n if d[i] == -1:\n dfs(i, 1)\nres = 0\nfor i in range(1, n + 1):\n for j in range(i + 1, n + 1):\n if a[i][j] and d[i] == d[j]:\n res += 1\n\nif (n - res) % 2:\n print(res + 1)\nelse:\n print(res)", "def dfs(cur_node, parent_node, reference, visited):\r\n if cur_node in visited:\r\n return True\r\n visited.add(cur_node)\r\n for child_node in graph[cur_node]:\r\n if child_node != parent_node:\r\n reference[\"count\"] += 1\r\n if dfs(child_node, cur_node, reference, visited):\r\n return True\r\n return False\r\n\r\n\r\n# Getting the input in\r\nn, m = [int(i) for i in input().split(\" \")]\r\ngraph = {}\r\n# initializing all vertices to not visited\r\n# Creating Adjacency list representation\r\n# for the graph\r\nfor i in range(n):\r\n graph[i] = []\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split(\" \")]\r\n x -= 1\r\n y -= 1\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\n#######################################\r\nto_remove = 0\r\nreference = {}\r\nvisited = set()\r\n\r\nfor i in range(0, n):\r\n if i not in visited:\r\n reference[\"count\"] = 0\r\n cycle = dfs(i, None, reference, visited)\r\n\r\n if cycle:\r\n to_remove += reference[\"count\"] % 2 == 1\r\n\r\nif (n - to_remove) % 2 == 1:\r\n to_remove += 1\r\n\r\nprint(to_remove)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef dfs(node, parent, visited, cnt):\r\n if visited[node] == visited[parent]:\r\n # print(node, parent , 'jdfcbedkjfner')\r\n cnt += 1\r\n return cnt\r\n elif visited[node] != -1:\r\n return cnt\r\n\r\n # print(node)\r\n visited[node] = 1 - visited[parent]\r\n for v in graph[node]:\r\n if v != parent:\r\n # print(v, node)\r\n # print('v', v ,'parent', parent, 'cur', v)\r\n cnt = dfs(v, node, visited, cnt)\r\n return cnt\r\n\r\nn,m = map(int, input().split())\r\nvisited = [-1] * (n+1)\r\nvisited.append(1)\r\ngraph = {}\r\nfor i in range(n):\r\n graph[i+1] = []\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n if visited[i] == -1:\r\n cnt = dfs(i, -1, visited, cnt)\r\n\r\nans = cnt//2\r\nif n-ans & 1:\r\n ans +=1\r\nprint(ans)", "import sys\r\n\r\n\r\ndef solve():\r\n n, e = list(map(int, sys.stdin.readline().split()))\r\n enemies = []\r\n for _ in range(n + 1):\r\n enemies.append([])\r\n\r\n for _ in range(e):\r\n f, s = list(map(int, sys.stdin.readline().split()))\r\n enemies[f].append(s)\r\n enemies[s].append(f)\r\n\r\n print(enemies, file=sys.stderr)\r\n\r\n ans = 0\r\n for i in range(1, n + 1):\r\n print(file=sys.stderr)\r\n if len(enemies[i]) == 0:\r\n continue\r\n ans += follow(i, enemies, i) % 2\r\n return ans + (n - ans) % 2\r\n\r\n\r\ndef follow(i, enemies, t, depth = 0):\r\n depth += 1\r\n print(i, end=\" \", file=sys.stderr)\r\n if len(enemies[i]) == 0:\r\n return 0\r\n j = enemies[i].pop()\r\n if i in enemies[j]:\r\n enemies[j].remove(i)\r\n if j == t:\r\n return depth\r\n return follow(j, enemies, t, depth)\r\n\r\n\r\nprint(solve())\r\n", "def adj_list(nodes,edges):\r\n graph=[[] for i in range(nodes)]\r\n for edge in range(edges):\r\n a, b = map(int, input().split())\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n return graph\r\n\r\nnodes, edges = map(int, input().split())\r\ngraph=adj_list(nodes,edges)\r\nvisited=[False for i in range(nodes)]\r\n\r\ndef dfs(cur, par, arr):\r\n arr.add(cur)\r\n if visited[cur]:\r\n return True\r\n visited[cur] = True\r\n for i in graph[cur]:\r\n if i != par:\r\n if dfs(i, cur, arr):\r\n return True\r\n return False\r\ni = 0\r\nres = 0\r\n\r\nwhile i < nodes:\r\n if not visited[i]:\r\n arr = set()\r\n if dfs(i, -1, arr):\r\n if len(arr) % 2 == 1:\r\n res += 1\r\n i += 1\r\nnodes -= res\r\nif nodes % 2 == 1:\r\n print(res + 1)\r\nelse:\r\n print(res)", "import pdb\n\ndef correct_colouring(x0, edges, visited, colouring):\n s = [x0]\n visited[x0] = True\n colouring[x0] = 1\n while s:\n x = s.pop()\n for neigh in edges[x]:\n if not visited[neigh]:\n visited[neigh] = True\n colouring[neigh] = -colouring[x]\n s.append(neigh)\n elif colouring[neigh] == colouring[x]:\n return False\n return True\n\ndef solve():\n n, m = map(int, input().split())\n edges = [[] for _ in range(n+1)]\n for _ in range(m):\n i, j = map(int, input().split())\n edges[i].append(j)\n edges[j].append(i)\n visited = [False for _ in range(n+1)]\n colouring = [0 for _ in range(n+1)]\n removed = 0\n for x0 in range(1, n+1):\n if not visited[x0]:\n correct = correct_colouring(x0, edges, visited, colouring) \n if not correct:\n removed += 1\n if (n - removed)% 2:\n removed += 1\n print(removed) \n\nif __name__ == '__main__':\n solve()\n", "from collections import defaultdict\r\nn , m = map(int, input().split())\r\ngraph = defaultdict(list)\r\nis_vis = [False] * (n+1)\r\nsol =0\r\ndef dfs(node, par, path):\r\n if is_vis[node]:\r\n return path % 2 != 0\r\n\r\n is_vis[node] = True\r\n\r\n for sub_node in graph[node]:\r\n if sub_node != par:\r\n path += 1\r\n\r\n if dfs(sub_node, node, path):\r\n return 1\r\n\r\n return 0\r\n\r\n\r\nfor i in range(0, m):\r\n l , r = map(int, input().split())\r\n graph[l].append(r)\r\n graph[r].append(l)\r\n\r\nfor key in graph.keys():\r\n if not is_vis[key]:\r\n sol += dfs(key, -1, 0)\r\n\r\nprint(sol + ((n-sol) % 2 != 0))", "from collections import defaultdict\nn, m = map(int, input().split())\ngraph = defaultdict(list)\nfor _ in range(m):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n graph[a].append(b)\n graph[b].append(a)\n\ncolors = [-1 for _ in range(n)]\ndef dfs(node, graph, vis, color):\n global flag\n colors[node] = color^1\n for neighbor in graph[node]:\n if colors[neighbor] != -1:\n if colors[neighbor] == colors[node]:\n flag = True \n return\n else:\n dfs(neighbor, graph, colors, colors[node])\n\ncnt = 0\nflag = False\nfor i in range(n):\n if colors[i] == -1:\n dfs(i, graph, colors, 1)\n if flag:\n cnt += 1\n flag = False\n\nif (n - cnt) % 2 == 0:\n print(cnt)\nelse:\n print(cnt + 1)\n \n \n \n \n\n", "def Dfs(node):\r\n global nodesVisted\r\n global result\r\n visitedNodes[node]=True\r\n nodesVisted+=1\r\n if(len(archenemies[node])==2):\r\n leftN,rightN=archenemies[node][0],archenemies[node][1]\r\n if(visitedNodes[leftN]&visitedNodes[rightN]):\r\n if(nodesVisted%2==1):\r\n result+=1\r\n return\r\n if(not visitedNodes[leftN]):\r\n Dfs(leftN)\r\n if(not visitedNodes[rightN]):\r\n Dfs(rightN)\r\n return\r\nn,m=list(map(int,input().split(\" \")))\r\narchenemies=[[] for i in range(n+1)]\r\nresult=0\r\nnodesVisted=0\r\nvisitedNodes=[False for k in range(n+1)]\r\nfor i in range(m):\r\n ai,bi=list(map(int,input().split(\" \")))\r\n archenemies[ai].append(bi)\r\n archenemies[bi].append(ai)\r\nfor i in range(1,n+1):\r\n if((not visitedNodes[i])&(len(archenemies[i])==2)):\r\n nodesVisted=0\r\n Dfs(i)\r\nif((n-result)%2!=0):\r\n result+=1\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\r\nseen = [0] * (n+1)\r\ncounter = 1\r\nadj = [[]]\r\nfor i in range(n): adj.append([])\r\n\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\n\r\nvisited = [False] * (n+1)\r\ncycles = 0\r\ndef dfs(v, p):\r\n global counter, cycles\r\n \r\n visited[v] = True\r\n for child in adj[v]:\r\n if not visited[child]:\r\n seen[child] = counter\r\n counter += 1\r\n dfs(child, v)\r\n else:\r\n if child != p and (seen[child] - seen[v]) % 2 == 0:\r\n cycles += 1\r\n \r\n\r\nfor i in range(1, n+1):\r\n if not visited[i]:\r\n seen[i] = counter\r\n counter += 1\r\n dfs(i, 0)\r\n \r\ncycles = cycles//2\r\nif (n - cycles) % 2 == 0:\r\n print(cycles)\r\nelse:\r\n print(cycles + 1)", "from collections import defaultdict\r\nfrom sys import exit\r\nclass Graph:\r\n def __init__(self,n):\r\n self.adj=defaultdict(list)\r\n self.V=n\r\n self.visited=list()\r\n self.va=[0]\r\n def add_edge(self,x,y):\r\n self.adj[x].append(y)\r\n self.adj[y].append(x)\r\n def dfs(self,i):\r\n if i in self.visited:\r\n return 0\r\n if len(self.adj[i])<2:\r\n self.va[0]=0\r\n comp=0\r\n self.visited.append(i)\r\n for i in self.adj[i]:\r\n comp+=self.dfs(i)\r\n return comp+1\r\n def dfs_main(self):\r\n ans=0\r\n for i in range(1,self.V+1):\r\n if i not in self.visited:\r\n self.va[0] = 1\r\n components=self.dfs(i)\r\n if components!=1 and components%2==1 and self.va[0]==1:\r\n ans+=1\r\n if(self.V%2!=ans%2):ans+=1\r\n print(ans)\r\nn,m=map(int,input().split())\r\ng=Graph(n)\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n g.add_edge(x,y)\r\ng.dfs_main()", "def readInts(): return map(int, input().split())\r\n\r\n\r\ndef dfs(g, seen, i):\r\n if i in seen:\r\n return 0,0\r\n seen.add(i)\r\n nodes = 1\r\n edges = len(g[i])\r\n for j in g[i]:\r\n x, y = dfs(g, seen, j)\r\n nodes += x\r\n edges += y\r\n return nodes, edges\r\n\r\ndef solve():\r\n line0 = []\r\n try: line0 = readInts()\r\n except EOFError: return False\r\n n, m = line0\r\n \r\n g = {}\r\n seen = set()\r\n for i in range(1,n+1):\r\n g[i] = set()\r\n \r\n for _ in range(m):\r\n a,b = readInts()\r\n g[a].add ( b )\r\n g[b].add ( a )\r\n \r\n ans = 0\r\n for i in range(1,n+1):\r\n if i not in seen:\r\n nodes, edges = dfs(g,seen,i)\r\n if nodes > 1 and nodes%2 == 1 and 2nodes == edges:\r\n ans += 1\r\n \r\n if (n-ans)%2 == 1:\r\n ans += 1\r\n print ( ans )\r\n return True\r\n\r\nwhile solve(): pass\r\n", "\"\"\"\n reading 8:59 -> 9:02\n thinking 9:30 -> 10:00\n thinking 8:37 -> 8:46\n coding 8:46 -> 9:50\n thinking 9:16 -> 10:00\n coding 8:50 -> 9:25\n reading 9:30 -> 9:32\n thinking 9:39 -> 9:44\n thinking 9:20 -> 10:01\n coding 9:01 -> 10:00\n coding 8:15 -> 8:30\n thinking 8:38 -> 9:58\n coding 9:13 -> 10:00\n coding 3:20 -> 4:10\n thinking 4:22 ->\n\"\"\"\nfrom collections import defaultdict\nfrom enum import Enum\n\nclass Color(Enum):\n GRAY = -1\n BLACK = 0\n WHITE = 1\n\nclass Graph:\n \"\"\"Graph class\"\"\"\n\n # Constructor\n def __init__(self):\n # default dictionary to store graph\n self.graph = defaultdict(lambda: dict(neighbors=[], color=Color.GRAY))\n self.number = 0\n self.ans = 0\n\n # Function to add an edge to graph\n def add_node(self, node, neighbor):\n \"\"\"Adds a node with its neighbor\"\"\"\n self.graph[node][\"neighbors\"].append(neighbor)\n self.graph[neighbor][\"neighbors\"].append(node)\n\n def rm_node(self, node):\n \"\"\"Removes a node\"\"\"\n for neighbor in self.graph[node][\"neighbors\"]:\n self.graph[neighbor][\"neighbors\"].remove(node)\n self.graph.pop(node)\n\n # A function used by DFS\n def dfs_util(self, neighbor, visited):\n \"\"\"Utility function\"\"\"\n # Mark the current node as visited and print it\n visited.add(neighbor)\n # print(f'nodo = {v}', end=' ')\n # recur for all the vertices adjacent to this vertex\n # #breakpoint()\n for neighbour in self.graph[neighbor][\"neighbors\"]:\n # print(f'vecino = {neighbour}')\n if neighbour not in visited:\n self.dfs_util(neighbour, visited)\n\n # The function to do DFS traversal. It uses recursive DFS_util\n\n def dfs(self):\n \"\"\"DFS function\"\"\"\n # create a set to store all visited vertices\n visited = set()\n # call the recursive helper function to print DFS traversal starting\n # from all vertices one by one\n for vertex in list(self.graph):\n if vertex not in visited:\n self.dfs_util(vertex, visited)\n\n #FIXME\n def is_biparted(self):\n \"\"\"Returns false if its not biparted, return true otherwise\"\"\"\n #breakpoint()\n for node in self.graph.keys():\n if self.graph[node][\"color\"] == Color.GRAY:\n if(not self.set_color(node, Color.BLACK)):\n self.rm_node(node)\n self.unset_color()\n return False\n\n return True\n\n def set_color(self, node, color):\n #breakpoint()\n self.graph[node][\"color\"] = color\n other_color = Color.BLACK if color == Color.WHITE else Color.WHITE\n for neighbor in self.graph[node][\"neighbors\"]:\n if self.graph[neighbor][\"color\"] == Color.GRAY:\n if self.set_color(neighbor, other_color) == False:\n return False\n\n else:\n if self.graph[neighbor][\"color\"] == color:\n return False\n return True\n\n def unset_color(self):\n for node in self.graph.keys():\n self.graph[node][\"color\"] = Color.GRAY\n\n\n# TODO(22/08/21): Contar los vecinos problemáticos\n# NOTE(23/08/21, CESAR): Lo de arriba ya se pensó, falta implementarlo.\n# NOTE(22/08/21, CESAR): No se pudo\n# NOTE(23/08/21, CESAR): Sí se puede\n# NOTE(31/08/21, CESAR): El de arriba miente\n# NOTE(01/09/21, CESAR): El de arriba dice la verdad\n\ndef main():\n n, m = map(int, input().split())\n g = Graph()\n for i in range(m):\n a, b = map(int, input().split())\n g.add_node(a, b)\n #breakpoint()\n while not(g.is_biparted()):\n g.ans += 1\n\n if (n - g.ans) % 2 == 1:\n print(g.ans + 1)\n else:\n print(g.ans)\n\nmain()\n", "n,m=map(int,input().split())\r\na=[[0](n+1) for i in range(n+1)]\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n a[u][v]=1\r\n a[v][u]=1\r\n \r\nd=[-1]*(n+1)\r\n \r\ndef dfs(i,v):\r\n d[i]=v\r\n for j in range(1,n+1):\r\n if a[i][j] and d[j]==-1:\r\n dfs(j,1-v)\r\n \r\nfor i in range(1,n+1):\r\n if d[i]==-1:\r\n dfs(i,1)\r\nres=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if a[i][j] and d[i]==d[j]:\r\n res+=1\r\nif (n-res)%2:\r\n print(res+1)\r\nelse:\r\n print(res)\r\n" ]	{"inputs": ["5 4\n1 2\n2 4\n5 3\n1 4", "6 2\n1 4\n3 4", "6 6\n1 2\n2 3\n3 1\n4 5\n5 6\n6 4", "5 1\n1 2", "8 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 1", "28 3\n15 3\n10 19\n17 25", "2 1\n1 2", "3 1\n2 3", "3 2\n1 2\n3 2", "3 3\n1 2\n1 3\n2 3", "4 1\n1 4", "4 2\n4 1\n2 1", "4 3\n1 3\n3 2\n2 4", "4 3\n3 2\n4 2\n4 3", "5 3\n4 2\n3 4\n5 1", "10 7\n8 9\n3 6\n2 4\n4 1\n1 3\n2 7\n7 10", "29 20\n15 9\n21 15\n14 12\n12 16\n3 28\n5 13\n19 1\n19 21\n23 17\n27 9\n26 10\n20 5\n8 16\n11 6\n4 22\n29 22\n29 11\n14 17\n28 6\n1 23", "68 50\n10 9\n28 25\n53 46\n38 32\n46 9\n35 13\n65 21\n64 1\n15 52\n43 52\n31 7\n61 67\n41 49\n30 1\n14 4\n17 44\n25 7\n24 31\n57 51\n27 12\n3 37\n17 11\n41 16\n65 23\n10 2\n16 22\n40 36\n15 51\n58 44\n61 2\n50 30\n48 35\n45 32\n56 59\n37 49\n62 55\n62 11\n6 19\n34 33\n53 66\n67 39\n47 21\n56 40\n12 58\n4 23\n26 42\n42 5\n60 8\n5 63\n6 47", "89 30\n86 72\n43 16\n32 80\n17 79\n29 8\n89 37\n84 65\n3 41\n55 79\n33 56\n60 40\n43 45\n59 38\n26 23\n66 61\n81 30\n65 25\n13 71\n25 8\n56 59\n46 13\n22 30\n87 3\n26 32\n75 44\n48 87\n47 4\n63 21\n36 6\n42 86", "100 1\n3 87", "100 10\n88 82\n5 78\n66 31\n65 100\n92 25\n71 62\n47 31\n17 67\n69 68\n59 49", "100 50\n82 99\n27 56\n74 38\n16 68\n90 27\n77 4\n7 88\n77 33\n25 85\n18 70\n50 7\n31 5\n21 20\n50 83\n55 5\n46 83\n55 81\n73 6\n76 58\n60 67\n66 99\n71 23\n100 13\n76 8\n52 14\n6 54\n53 54\n88 22\n12 4\n33 60\n43 62\n42 31\n19 67\n98 80\n15 17\n78 79\n62 37\n66 96\n40 44\n37 86\n71 58\n42 92\n8 38\n92 13\n73 70\n46 41\n30 34\n15 65\n97 19\n14 53", "10 9\n5 10\n3 2\n8 6\n4 5\n4 10\n6 1\n1 8\n9 2\n3 9", "50 48\n33 21\n1 46\n43 37\n1 48\n42 32\n31 45\n14 29\n34 28\n38 19\n46 48\n49 31\n8 3\n27 23\n26 37\n15 9\n27 17\n9 35\n18 7\n35 15\n32 4\n23 17\n36 22\n16 33\n39 6\n40 13\n11 6\n21 16\n10 40\n30 36\n20 5\n24 3\n43 26\n22 30\n41 20\n50 38\n25 29\n5 41\n34 44\n12 7\n8 24\n44 28\n25 14\n12 18\n39 11\n42 4\n45 49\n50 19\n13 10", "19 16\n2 16\n7 10\n17 16\n17 14\n1 5\n19 6\n11 13\n15 19\n7 9\n13 5\n4 6\n1 11\n12 9\n10 12\n2 14\n4 15", "70 70\n27 54\n45 23\n67 34\n66 25\n64 38\n30 68\n51 65\n19 4\n15 33\n47 14\n3 9\n42 29\n69 56\n10 50\n34 58\n51 23\n55 14\n18 53\n27 68\n17 6\n48 6\n8 5\n46 37\n37 33\n21 36\n69 24\n16 13\n50 12\n59 31\n63 38\n22 11\n46 28\n67 62\n63 26\n70 31\n7 59\n55 52\n28 43\n18 35\n53 3\n16 60\n43 40\n61 9\n20 44\n47 41\n35 1\n32 4\n13 54\n30 60\n45 19\n39 42\n2 20\n2 26\n52 8\n12 25\n5 41\n21 10\n58 48\n29 11\n7 56\n49 57\n65 32\n15 40\n66 36\n64 44\n22 57\n1 61\n39 49\n24 70\n62 17", "33 33\n2 16\n28 20\n13 9\n4 22\n18 1\n6 12\n13 29\n32 1\n17 15\n10 7\n6 15\n16 5\n11 10\n31 29\n25 8\n23 21\n14 32\n8 2\n19 3\n11 4\n21 25\n31 30\n33 5\n26 7\n27 26\n27 12\n30 24\n33 17\n28 22\n18 24\n19 9\n3 23\n14 20", "10 8\n8 3\n9 7\n6 1\n10 9\n2 6\n2 1\n3 4\n4 8", "20 12\n16 20\n8 3\n20 5\n5 10\n17 7\n13 2\n18 9\n17 18\n1 6\n14 4\n11 12\n10 16", "35 21\n15 3\n13 5\n2 28\n26 35\n9 10\n22 18\n17 1\n31 32\n35 33\n5 15\n14 24\n29 12\n16 2\n14 10\n7 4\n29 4\n23 27\n30 34\n19 26\n23 11\n25 21", "49 36\n17 47\n19 27\n41 23\n31 27\n11 29\n34 10\n35 2\n42 24\n19 16\n38 24\n5 9\n26 9\n36 14\n18 47\n28 40\n45 13\n35 22\n2 15\n31 30\n20 48\n39 3\n8 34\n36 7\n25 17\n5 39\n29 1\n32 33\n16 30\n38 49\n25 18\n1 11\n7 44\n12 43\n15 22\n49 21\n8 23", "77 54\n18 56\n72 2\n6 62\n58 52\n5 70\n24 4\n67 66\n65 47\n43 77\n61 66\n24 51\n70 7\n48 39\n46 11\n77 28\n65 76\n15 6\n22 13\n34 75\n33 42\n59 37\n7 31\n50 23\n28 9\n17 29\n1 14\n11 45\n36 46\n32 39\n59 21\n22 34\n53 21\n29 47\n16 44\n69 4\n62 16\n36 3\n68 75\n51 69\n49 43\n30 55\n40 20\n57 60\n45 3\n38 33\n49 9\n71 19\n73 20\n48 32\n63 67\n8 54\n42 38\n26 12\n5 74", "93 72\n3 87\n88 60\n73 64\n45 35\n61 85\n68 80\n54 29\n4 88\n19 91\n82 48\n50 2\n40 53\n56 8\n66 82\n83 81\n62 8\n79 30\n89 26\n77 10\n65 15\n27 47\n15 51\n70 6\n59 85\n63 20\n64 92\n7 1\n93 52\n74 38\n71 23\n83 12\n86 52\n46 56\n34 36\n37 84\n18 16\n11 42\n69 72\n53 20\n78 84\n54 91\n14 5\n65 49\n90 19\n42 39\n68 57\n75 27\n57 32\n44 9\n79 74\n48 66\n43 93\n31 30\n58 24\n80 67\n6 60\n39 5\n23 17\n25 1\n18 36\n32 67\n10 9\n14 11\n63 21\n92 73\n13 43\n28 78\n33 51\n4 70\n75 45\n37 28\n62 46", "100 72\n2 88\n55 80\n22 20\n78 52\n66 74\n91 82\n59 77\n97 93\n46 44\n99 35\n73 62\n58 24\n6 16\n47 41\n98 86\n23 19\n39 68\n32 28\n85 29\n37 40\n16 62\n19 61\n84 72\n17 15\n76 96\n37 31\n67 35\n48 15\n80 85\n90 47\n79 36\n39 54\n57 87\n42 60\n34 56\n23 61\n92 2\n88 63\n20 42\n27 81\n65 84\n6 73\n64 100\n76 95\n43 4\n65 86\n21 46\n11 64\n72 98\n63 92\n7 50\n14 22\n89 30\n31 40\n8 57\n90 70\n53 59\n69 24\n96 49\n67 99\n51 70\n18 66\n91 3\n26 38\n13 58\n51 41\n9 11\n5 74\n3 25\n4 32\n28 43\n71 56", "6 5\n1 2\n2 3\n3 4\n4 5\n5 1", "6 4\n1 2\n1 3\n4 5\n4 6", "16 16\n1 2\n2 3\n1 3\n4 5\n5 6\n4 6\n7 8\n8 9\n9 10\n10 11\n11 7\n12 13\n13 14\n14 15\n15 16\n16 12", "4 4\n1 2\n4 3\n1 4\n2 3", "9 9\n1 2\n2 3\n3 1\n4 5\n5 6\n6 4\n7 8\n8 9\n9 7", "20 11\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 1", "4 3\n1 2\n3 4\n1 3", "4 2\n2 4\n3 4", "10 10\n1 2\n2 3\n3 4\n4 5\n5 1\n6 7\n7 8\n8 9\n9 10\n10 6", "6 5\n2 1\n3 4\n2 3\n4 5\n5 6", "8 5\n1 2\n2 3\n3 4\n4 5\n5 1", "6 5\n1 2\n2 3\n3 4\n4 5\n1 5", "8 8\n1 2\n2 3\n3 4\n1 4\n5 6\n6 7\n7 8\n5 8", "6 5\n1 3\n1 2\n2 4\n5 3\n5 4"], "outputs": ["1", "0", "2", "1", "0", "0", "0", "1", "1", "1", "0", "0", "0", "2", "1", "0", "1", "0", "1", "0", "0", "0", "4", "16", "1", "10", "1", "2", "0", "1", "3", "5", "5", "6", "2", "0", "4", "0", "3", "2", "0", "0", "2", "0", "2", "2", "0", "2"]}	UNKNOWN	PYTHON3	CODEFORCES	28
d4eccfcdc4a1ce493b2358cdc4f24618	Cableway	A group of university students wants to get to the top of a mountain to have a picnic there. For that they decided to use a cableway. A cableway is represented by some cablecars, hanged onto some cable stations by a cable. A cable is scrolled cyclically between the first and the last cable stations (the first of them is located at the bottom of the mountain and the last one is located at the top). As the cable moves, the cablecar attached to it move as well. The number of cablecars is divisible by three and they are painted three colors: red, green and blue, in such manner that after each red cablecar goes a green one, after each green cablecar goes a blue one and after each blue cablecar goes a red one. Each cablecar can transport no more than two people, the cablecars arrive with the periodicity of one minute (i. e. every minute) and it takes exactly 30 minutes for a cablecar to get to the top. All students are divided into three groups: r of them like to ascend only in the red cablecars, g of them prefer only the green ones and b of them prefer only the blue ones. A student never gets on a cablecar painted a color that he doesn't like, The first cablecar to arrive (at the moment of time 0) is painted red. Determine the least time it will take all students to ascend to the mountain top. The first line contains three integers r, g and b (0<=≤<=r,<=g,<=b<=≤<=100). It is guaranteed that r<=+<=g<=+<=b<=><=0, it means that the group consists of at least one student. Print a single number — the minimal time the students need for the whole group to ascend to the top of the mountain. Sample Input 1 3 2 3 2 1 Sample Output 3433	[ "import math\r\n\r\nm = 0\r\np = 0\r\nfor pos, i in enumerate(map(int, input().split())):\r\n if math.ceil(i/2) >= m:\r\n m = math.ceil(i/2)\r\n p = pos\r\n\r\nres = 0\r\nm -= 1\r\nwhile m > 0:\r\n res += 3\r\n m -= 1\r\n\r\nprint(res + p + 30)", "\r\nl = [int(s) + 1 for s in input().split()]\r\n\r\nr = ((l[0]//2) - 1) * 3\r\ng = ((l[1]//2)-1) * 3 + 1\r\nb = ((l[2]//2)-1) * 3 + 2\r\n\r\nprint(max(r,g,b)+ 30)", "r, g, b = map(int, input().split())\r\nt_r = 0 + 3 * ((r - 1) // 2)\r\nt_g = 1 + 3 * ((g - 1) // 2)\r\nt_b = 2 + 3 * ((b - 1) // 2)\r\nprint(30 + max(t_r, t_g, t_b))", "from math import ceil\r\na,b,c = map(int,input().split())\r\nx,y,z = ceil(a/2),ceil(b/2),ceil(c/2)\r\nmaxi = max(x,y,z)\r\nif maxi == z:\r\n\tprint(32+3ceil((c-2)/2))\r\nelif maxi == y:\r\n\tprint(31+3ceil((b-2)/2))\r\nelif maxi == x:\r\n\tprint(30+3ceil((a-2)/2))\r\n", "import math\r\n\r\nt=0\r\nr,g,b=map(int,input().split())\r\nwhile r+b+g!=0:\r\n if t%3==0:\r\n r=max(0,r-2)\r\n elif t%3==1:\r\n g=max(0,g-2)\r\n else:\r\n b=max(0,b-2)\r\n t+=1\r\n\r\nprint(t+29)", "cablecars = [(int(color) + 1) // 2 for color in input().split(' ')]\ncars_needed = max(cablecars)\nposition = 2 - cablecars[::-1].index(cars_needed)\nprint(position + (cars_needed - 1) 3 + 30)\n\n", "# LUOGU_RID: 101455370\nr, g, b = map(lambda x: sum(divmod(int(x), 2)) * 3, input().split())\r\nprint(max(r - 2, g - 1, b) + 29)", "import math\r\nr, g, b = map(int, input().split())\r\n\r\ncounter = 0\r\nwhile True:\r\n\tif counter%3==0:\r\n\t\tif r > 0:\r\n\t\t\tr += -2\r\n\t\tcounter += 1\r\n\telif counter%3==1:\r\n\t\tif g > 0:\r\n\t\t\tg += -2\r\n\t\tcounter += 1\r\n\telse:\r\n\t\tif b > 0:\r\n\t\t\tb += -2\r\n\t\tcounter += 1\r\n\t\t\r\n\tif r < 0:\r\n\t\tr = 0\r\n\tif g < 0:\r\n\t\tg = 0\r\n\tif b < 0:\r\n\t\tb = 0\r\n\t\t\r\n\tif not any([r,g,b]):\r\n\t\tbreak\r\n\t\t\r\nprint(counter-1+30)", "\r\nfrom math import ceil\r\nr, g, b = map(int, input().split())\r\n\r\nrt = (ceil(r / 2) - 1 ) * 3\r\nrg = 1 + ( ceil(g / 2) - 1 ) * 3\r\nrb = 2 + ( ceil(b / 2) - 1 ) * 3\r\n\r\nprint(max(rt, rg, rb ) + 30)", "a=list(map(int,input().split()))\r\na=list(map(lambda a:a//2+ 1(a%2!=0),a))\r\nprint(max(((a[i]-1)3)+1+i for i in range(3))+29)", "r,g,b=map(int,input().split())\r\nr=(r-1)//23\r\ng=(g-1)//23\r\nb=(b-1)//23\r\nprint(max(r,g+1,b+2)+30)", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n r, g, b = 0, 0, 0\n answer = 0\n \n def __init__(self):\n self.r, self.g, self.b = [int(x) for x in input().split()]\n\n def solve(self):\n r, g, b = self.r, self.g, self.b\n currentColor = 0\n while True:\n r = max(r - 2, 0) if currentColor == 0 else r\n g = max(g - 2, 0) if currentColor == 1 else g\n b = max(b - 2, 0) if currentColor == 2 else b\n if r + g + b > 0:\n self.answer += 1\n else:\n break\n currentColor = (currentColor + 1) % 3\n self.answer += 30\n\n def printAnswer(self):\n print(self.answer)\n #for line in self.answer:\n # print(re.sub('[\\[\\],]', '', str(line)))\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "r, g, b = map(int, input().split())\r\n \r\n \r\nprint(max([((r+1)//2 - 1) 3, ((g+1)//2 - 1) * 3 + 1, ((b+1)//2 - 1) \r\n 3 + 2]) + 30)\r\n ", "A = list(map(int, input().split()))\r\nt = 0\r\n\r\nwhile max(A) > 0:\r\n A[t%3] -= 2\r\n t += 1\r\n\r\nprint(t + 29)", "l = list(map(int,input().split(' ')))\r\nc = 29\r\nco = 0\r\n#0 = r,1 = g, 2 = b\r\nwhile l!=[0, 0, 0]:\r\n c+=1\r\n i = co%3\r\n if l[i]>1:\r\n l[i]-=2\r\n elif l[i] ==1:\r\n l[i]-=1\r\n co+=1\r\nprint(c)\r\n", "rgb = list(map(int, input().split()))\nans = 0\nfor i in range(3):\n temp = (rgb[i]-1)//23+30+i\n ans = max(temp, ans)\nprint(ans)\n", "\r\n# / \r\n#\r\n# / \\ \| \| / \\ \| \| \| \|\r\n# / __\\ \| \| / __\\ \|--\| \| \|\r\n# / \\ \|__ \| __ / \\ \| \| \\__ /\r\n#\r\n# __ __\r\n# / \\ \| / \| ) / \\ \| )\r\n# / __\\ \|< \|-< / __\\ \|-<\r\n# / \\ \| \\ \|__) / \\ \| \\\r\n#\r\n# /\r\nimport math as m\r\ndef main():\r\n group = [int(i) for i in input().split()]\r\n r = 30+(m.ceil(group[0]/2)3)-3\r\n g = 31+(m.ceil(group[1]/2)3)-3\r\n b = 32+(m.ceil(group[2]/2))3-3\r\n out = max(r, g, b)\r\n print(out)\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "R, G, B = map(int, input().split())\r\n\r\nans = 30\r\n\r\nif R % 2 == 0:\r\n x1 = R // 2\r\nelse:\r\n x1 = R // 2 + 1\r\n\r\nif G % 2 == 0:\r\n x2 = G // 2\r\nelse:\r\n x2 = G // 2 + 1\r\n\r\n\r\nif B % 2 == 0:\r\n x3 = B // 2\r\nelse:\r\n x3 = B // 2 + 1\r\n \r\n \r\nif x3 == max([x1,x2,x3]):\r\n ans += x3 3 - 1\r\n\r\n\r\nelif x2 == max([x1, x2, x3]):\r\n ans += x2 * 3 - 2\r\n\r\nelse:\r\n ans += x1 * 3 - 3\r\n\r\n \r\nprint(ans)\r\n", "\ndef carnum(student):\n if student % 2 == 0:\n return int(student/2)\n else:\n return int(student/2) + 1\n\nr, g, b = [int(x) for x in input().split()]\ncabler = 3(carnum(r) - 1) \ncableg = 3(carnum(g) - 1) + 1\ncableb = 3(carnum(b) - 1) + 2\n\nmax_time = max(cabler, cableg, cableb)\nprint(int(max_time + 30))\n", "r,g,b=map(int,input().split())\r\nx=r//2+r%2\r\ny=g//2+g%2\r\nz=b//2+b%2\r\nm=max(x,y,z)\r\nif m==z:\r\n print(30+z3-1)\r\nelif m==y:\r\n print(30+y3-2)\r\nelse:\r\n print(30+x3-3)", "r,g,b=[int(x) for x in input().split()]\r\nprint(max(((r-1)//2)3+30,((g-1)//2)3+31,((b-1)//2)3+32))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nrgb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(3):\r\n ans = max(ans, i + 3 (rgb[i] // 2 + rgb[i] % 2))\r\nans += 27\r\nprint(ans)", "r,g,b=map(int,input().split())\r\nprint(max(29+3((b+1)//2),28+3((g+1)//2),27+3((r+1)//2)))", "import math\r\n\r\nt=list(map(int,input().split()))\r\nfor j in range(3):\r\n t[j]=math.ceil(t[j]/2)\r\n\r\nd=t[::-1]\r\n\r\nprint((max(t)-1)3+(len(t)-1-d.index(max(d))+30))\r\n", "r,g,b= list(map(int, input().split(\" \")))\r\nr = 30 + 3((r+1)//2-1)\r\ng = 31 + 3((g+1)//2-1)\r\nb = 32 + 3((b+1)//2-1)\r\nprint(max(r,g,b))\r\n", "\r\n\r\ndef main():\r\n\tr, g, b = list(int(x) for x in input().split())\r\n\r\n\tcc_r = ceil(r/2)\r\n\tcc_g = ceil(g/2)\r\n\tcc_b = ceil(b/2)\r\n\r\n\tcc = [cc_b, cc_g, cc_r]\r\n\r\n\tlongest_cc = max(cc)\r\n\tlongest_cc_index = cc.index(longest_cc)\r\n\r\n\ttotal_time = 30 + ((longest_cc-1)3)\r\n\r\n\tif longest_cc_index == 0:\r\n\t\ttotal_time+=2\r\n\telif longest_cc_index == 1:\r\n\t\ttotal_time+=1\r\n\telif longest_cc_index == 2:\r\n\t\ttotal_time+=0\r\n\r\n\tprint(total_time)\r\n\treturn\r\n\r\n\r\n\r\n\r\ndef ceil(n):\r\n\r\n\tif n%1 > 0:\r\n\t\tn+=1\r\n\r\n\treturn int(n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "import math\r\n\r\nm = 0\r\np = 0\r\nfor pos, i in enumerate(map(int, input().split())):\r\n if math.ceil(i/2) >= m:\r\n m = math.ceil(i/2)\r\n p = pos\r\n\r\nprint((m-1)3 + p + 30)", "\r\ndatos = input().split()\r\nr,g,b = int(datos[0]), int(datos[1]), int(datos[2])\r\n\r\nc = 0\r\nwhile r>2 or g>2 or b>2:\r\n if r > 2:\r\n r = r-2\r\n else:\r\n r = 0\r\n if g > 2:\r\n g = g-2\r\n else:\r\n g = 0\r\n if b > 2:\r\n b = b-2\r\n else:\r\n b = 0\r\n c = c+1 \r\n\r\nultimo_teleferico = 1\r\nif b > 0:\r\n ultimo_teleferico = 3\r\nelif g > 0:\r\n ultimo_teleferico = 2\r\n \r\nminutos = c2 + (c-1) + ultimo_teleferico + 30\r\n\r\nprint(minutos)\r\n ", "# for _ in range(int(input())):\r\n# n,k=map(int,input().split())\r\n# arr = [int(x) for x in input().split()]\r\n # c=[0]n\r\n # #d=[]\r\n # i=0\r\n # x=0\r\n # while(max(arr)!=-1):\r\n # x=k-arr[i]\r\n # if(arr!=-1):\r\n # c[arr.index(arr[i])]=1\r\n # arr[arr.index(arr[i])]= -1\r\n # if(x in arr):\r\n # while(x in arr):\r\n # arr[arr.index(x)]= -1\r\n # if(x in arr):\r\n # c[arr.index(x)]=1\r\n # arr[arr.index(x)]= -1\r\n # i+=1\r\n # print(\" \".join(str(gh) for gh in c))\r\n # ans = 0\r\n # c=1\r\n # for i in range(n):\r\n # if(2arr[i] == k):\r\n # c=c+1\r\n # ans=(c)%2\r\n # else:\r\n # if(2a[i]<k):\r\n # ans = 0\r\n # else:\r\n # ans=1\r\n # print(str(ans),end=\" \")\r\n # print(\"\\n\")\r\n########################\r\n# #\r\n# COLOUR REVOLUTIONN #\r\n# #\r\n#####################\r\n\r\n# for _ in range(int(input())):\r\n# n,k=map(int,input().split())\r\n# if(k != 1):\r\n# a = abs((1-(k4))//(1-k))\r\n# n1 = n//a\r\n# else:\r\n# n1 = 1\r\n# for i in range(4):\r\n# print(str(n1(k*i)),end=' ')\r\n# print('\\n')\r\n\r\n########################################\r\n\r\n# CABEL CAR #\r\n\r\n########################################\r\n\r\nr,g,b = map(int,input().split())\r\nco = -1\r\nwhile(r >0 or g>0 or b>0):\r\n co += 1\r\n r -= 2\r\n if(r <=0 and g<=0 and b<=0):\r\n break\r\n co += 1\r\n g -= 2\r\n if(r <=0 and g<=0 and b<=0):\r\n break\r\n co+=1\r\n b-=2\r\nprint(co+30)", "r,g,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nif r%2!=0: r=r+1\r\nif g%2!=0: g=g+1\r\nif b%2!=0: b=b+1\r\nx = ((r//2)-1)3+30\r\ny = ((g//2)-1)3+31\r\nz = ((b//2)-1)3+32\r\nprint(max(x,y,z))", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr1=30+(ceil(r/2)-1)3\r\ng1=(ceil(g/2)-1)3+1+30\r\nb1=(ceil(b/2)-1)3+2+30\r\nprint(max(r1,g1,b1))", "r,g,b=map(int,input().split())\r\nx=r//2+(r%2)-1\r\ny=g//2+(g%2)-1\r\nz=b//2+(b%2)-1\r\nif max(x,y,z)==z:\r\n print(32+z3)\r\nelif max(x,y,z)==y:\r\n print(31+y3)\r\nelse:\r\n print(30+x3)", "import math\r\nl = list(map(int, input().split()))\r\nfor i in range(3):\r\n l[i] = math.ceil(l[i] / 2)\r\nmax = l[0]\r\np = 0\r\nfor i in range(3):\r\n if l[i] >= max:\r\n max = l[i]\r\n p = i\r\nprint(30 + (max * 3) + p - 3)", "r, g, b = map(int, input().split())\r\nr = r // 2 + (r % 2)\r\ng = g // 2 + (g % 2)\r\nb = b // 2 + (b % 2)\r\nr = max(0, 0 + (r - 1) * 3)\r\ng = max(0, 1 + (g - 1) * 3)\r\nb = max(0, 2 + (b - 1) * 3)\r\nprint(max(r, g, b) + 30)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nr,g,b=map(int,input().split())\r\nf=lambda x:(0--x//2-1)3\r\nprint(max(f(r),1+f(g),2+f(b))+30)", "r, g, b = list(map(int, input().split()))\r\n\r\nr_waiting = max(3 (r // 2 + r % 2) - 3, 0)\r\ng_waiting = max(1 + 3 * (g // 2 + g % 2) - 3 , 0)\r\nb_waiting = max(2 + 3 * (b // 2 + b % 2) - 3 , 0)\r\n\r\nprint(30 + max(r_waiting, g_waiting, b_waiting))", "\r\n\r\nlis = list(map(int,input().split()))\r\n\r\nk = 1\r\ncnt = 0\r\n\r\ni = 0 \r\nwhile(True) :\r\n \r\n if lis.count(0)!=3 :\r\n \r\n if lis[i]!=0 :\r\n \r\n lis[i] = lis[i] -2 \r\n \r\n if lis[i]<0 :\r\n \r\n lis[i] = 0 \r\n \r\n i = i + 1\r\n \r\n cnt = cnt + 1\r\n \r\n if i == 3 :\r\n i =0 \r\n \r\n else :\r\n \r\n break\r\n \r\n \r\n \r\nprint(30+cnt-1)\r\n \r\n \r\n \r\n \r\n ", "a=list(map(int, input().split()))\r\ni=t=0\r\nwhile sum(a) > 0:\r\n\tif a[i%3] > 0:\r\n\t\ta[i%3] -= min(a[i%3], 2)\r\n\tt += 1\r\n\ti += 1\r\nprint(t+29)", "r,g,b = map(int,input().split())\r\nr = 30+3((r-1)//2)\r\ng = 31+3((g-1)//2)\r\nb = 32+3((b-1)//2)\r\nprint(max(r,g,b))\r\n", "r, g, b = map(int, input().split())\r\nminute = []\r\ncolor = 'r'\r\ncounter = 0\r\nwhile r + g + b > 0:\r\n if color == 'r' and r >= 2:\r\n r -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'g'\r\n elif color == 'r' and r < 2 and r != 0:\r\n r = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'g'\r\n elif color == 'r' and r == 0:\r\n counter += 1\r\n color = 'g'\r\n continue\r\n\r\n elif color == 'g' and g >= 2:\r\n g -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'b'\r\n elif color == 'g' and g < 2 and g != 0:\r\n g = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'b'\r\n elif color == 'g' and g == 0:\r\n counter += 1\r\n color = 'b'\r\n continue\r\n\r\n elif color == 'b' and b >= 2:\r\n b -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'r'\r\n elif color == 'b' and b < 2 and b != 0:\r\n b = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'r'\r\n elif color == 'b' and b == 0:\r\n counter += 1\r\n color = 'r'\r\n continue\r\n\r\nprint(minute[len(minute) - 1])", "r, g, b = map(int,input().split())\nm = 29\nwhile (r > 0 or g > 0 or b > 0):\n m += 1\n if r > 0:\n r -= 2\n if (r<1 and g <1 and b <1):\n break \n m += 1\n if g > 0:\n g -= 2\n if (r<1 and g <1 and b <1):\n break\n m += 1\n if b > 0:\n b -= 2\n if (r<1 and g <1 and b <1):\n break\nprint(m)", "\r\nn = input().split()\r\nx = int(n[0])\r\ny = int(n[1])\r\nz = int(n[2])\r\nt = 29\r\nwhile not (x <= 0 and y <=0 and z <=0):\r\n t += 1\r\n if t % 3 ==0:\r\n x -= 2\r\n elif t % 3 ==1:\r\n y -= 2\r\n else:\r\n z -= 2\r\nprint(t)\r\n \r\n", "colors=list(map(int,input().split()))\r\ntime=29\r\nwhile any(colors):\r\n i=0\r\n while i<3 and any(colors):\r\n \r\n colors[i]=max(0,colors[i]-2)\r\n time+=1\r\n i+=1\r\n \r\nprint(time)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nr, g, b = readln()\nr = (r + 1) // 2\ng = (g + 1) // 2\nb = (b + 1) // 2\nif r > g and r > b:\n print(3 (r - 1) + 30)\nelif g >= r and g > b:\n print(1 + 3 * (g - 1) + 30)\nelse:\n print(2 + 3 * (b - 1) + 30)\n", "from math import ceil\r\n\r\nr, g, b = map(int, input().split())\r\nr = ceil(r / 2)\r\ng = ceil(g / 2)\r\nb = ceil(b / 2)\r\nif r == 0 and g == 0 and b == 0:\r\n t = 0\r\nelif b >= g and b >= r:\r\n t = 30 + (b - 1) * 3 + 2\r\nelif g >= b and g >= r:\r\n t = 30 + (g - 1) * 3 + 1\r\nelse:\r\n t = 30 + (r - 1) * 3\r\nprint(t)\r\n", "import math\r\n\r\nr, g, b = list(map(int, input().split()))\r\n\r\nr = (r - 1) // 2\r\ng = (g - 1) // 2\r\nb = (b - 1) // 2\r\n\r\nr = r * 3\r\ng = g * 3 + 1\r\nb = b * 3 + 2\r\n\r\nm = max(r, g)\r\nm = max(m, b)\r\n\r\nprint(m + 30)\r\n\r\n", "colors=list(map(int,input().split()))\r\ntime=29\r\ni=0\r\nwhile any(colors):\r\n \r\n colors[i%3]=max(0,colors[i%3]-2)\r\n i+=1\r\n \r\nprint(time+i)", "r,g,b=[int(x) for x in input().split(' ')]\ntotal = -1\ncar = 0\nt = 0\nwhile(any([r,g,b])):\n t += 1\n if r and not car:\n r = max(min(r-1, r-2), 0)\n total += t\n t=0\n if g and car == 1:\n g = max(min(g-1, g-2), 0)\n total += t\n t=0\n if b and car == 2:\n b = max(min(b-1, b-2), 0)\n total += t\n t=0\n car += 1\n car = car%3\nprint(total+30)\n\t \t \t \t \t\t\t \t\t\t \t \t\t\t", "r, g, b = list(map(int, input().split()))\nred_rides = int(r/2) + r%2\nblue_rides = int(b/2)+ b%2\ngreen_rides = int(g/2) + g%2\nif red_rides > blue_rides and red_rides > green_rides:\n last_ride_arrival = 3(red_rides - 1)\n time = last_ride_arrival + 30\nelif green_rides >= red_rides and green_rides > blue_rides:\n last_ride_arrival = 3(green_rides - 1) + 1\n time = last_ride_arrival + 30\nelif blue_rides >= red_rides and blue_rides >= green_rides:\n last_ride_arrival = 3(blue_rides - 1) + 2\n time = last_ride_arrival + 30\nprint(time)\n\n \t \t\t \t \t \t \t\t \t \t \t \t", "a = list(map(int, input().rstrip().split(\" \")))\r\nz = [i//2 +i%2 for i in a]\r\ntotal = max(a)//2 + max(a)%2\r\nm = max(z)\r\nind = 0\r\nfor i in range(3):\r\n if z[i] == m:\r\n ind = i+1\r\n\r\ntotal = 30 + 3(total-1) + ind - 1\r\nprint(total)", "r, g, b = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(300): \r\n if r<=0 and g<=0 and b<=0 :break\r\n if i%3==0 : r-=2\r\n if i%3==1 : g-=2\r\n if i%3==2 : b-=2 \r\n if i == 0 : ans += 30 \r\n else : ans += 1\r\nprint(ans)", "rgb=input().split()\r\nr=int(rgb[0])\r\ng=int(rgb[1])\r\nb=int(rgb[2])\r\nt=29\r\nc=0\r\nwhile True:\r\n if r==0 and g==0 and b==0:\r\n break\r\n elif r>=0 and c%3==0:\r\n c+=1\r\n t+=1\r\n if r-2<0:\r\n r=0\r\n else:\r\n r-=2\r\n elif g>=0 and c%3==1:\r\n c+=1\r\n t+=1\r\n if g-2<0:\r\n g=0\r\n else:\r\n g-=2\r\n elif b>=0 and c%3==2:\r\n c+=1\r\n t+=1\r\n if b-2<0:\r\n b=0\r\n else:\r\n b-=2\r\nprint(t)", "r,g,b=[int(x) for x in input().split()]\r\nx=29\r\nwhile r+g+b>0:\r\n #print(\"1st\",r,g,b,x)\r\n if r<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n r=0\r\n \r\n else:\r\n r-=2\r\n x+=1\r\n #print(\"aftr red\",r,g,b,x)\r\n \r\n if g<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n g=0\r\n else:\r\n g-=2\r\n x+=1\r\n #print(\"aftr green\",r,g,b,x)\r\n \r\n if b<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n b=0\r\n else:\r\n b-=2\r\n x+=1\r\n \r\n #print(\"aftr blue\",r,g,b,x)\r\nprint(x)", "r,g,b = [int(i) for i in input().split()]\n\nx = 30 + 3 * ((r+1)//2 - 1) + 0\ny = 30 + 3 * ((g+1)//2 - 1) + 1\nz = 30 + 3 * ((b+1)//2 - 1) + 2\nprint(max(x,y,z))\n", "data = list(map(int ,input().split()))\r\ncounter = 29\r\ni = 0 \r\nwhile True : \r\n if data[i] > 0 :\r\n data[i] -=2 \r\n counter += 1 \r\n if data[i] <= 0 : \r\n data[i] = 0 \r\n i += 1 \r\n if i == 3 : \r\n i = 0\r\n if sum(data) == 0 :\r\n break\r\nprint(counter)\r\n \r\n", "a = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(3):\r\n current = max(0, a[i] - 1) // 2 * 3\r\n if a[i] > 0:\r\n current += i\r\n ans = max(ans, current)\r\nprint(30 + ans)\r\n", "r,g,b=map(lambda x:int((int(x)+1)/2),input().split())\r\nvalue=2\r\ngreatest=b\r\nif g>greatest:\r\n greatest=g\r\n value=1\r\nelif r>greatest:\r\n greatest=r\r\n value=0\r\ntime=int(30+(3(greatest - 1)) + value)\r\nprint(time)", "r, g, b = map(int, input().split())\r\n\r\ni = 0\r\n\r\na = [r,g,b]\r\nc = -1\r\n\r\nwhile a[0] > 0 or a[1] > 0 or a[2] > 0:\r\n a[i] -= 2\r\n \r\n i +=1\r\n if i == 3:\r\n i = 0\r\n c+=1\r\n\r\nprint(c + 30)", "r, g, b = map(int, input().split())\r\nprint(max(3 ((r - 1) // 2), 1 + 3 * ((g - 1) // 2), 2 + 3 * ((b - 1) // 2)) + 30)", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr,g,b=[ceil(r/2),ceil(g/2),ceil(b/2)]\r\nif b>=r and b>=g:\r\n\tx=b\r\n\ti=2\r\nelif g>=r and g>=b:\r\n\tx=g\r\n\ti=1\r\nelif r>=g and r>=b:\r\n\tx=r\r\n\ti=0\r\nprint(30+(x-1)3+i)", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nMax=max(r,g,b)\r\n\r\nif ceil(Max/2)==ceil(b/2): \r\n print(30+(ceil(b/2)3)-1)\r\nelif ceil(Max/2)==ceil(g/2):\r\n print(30+(ceil(g/2)3)-2) \r\nelif ceil(Max/2)==ceil(r/2):\r\n print(30+(ceil(r/2)3)-3)\r\n ", "\n\nr, g, b = map(int, input().split())\n\nprint(max(3((r+1)//2) + 27, max(3((g+1)//2) + 28, 3((b+1)//2) + 29)))\n", "def f(x):\r\n return ((int(x)+1)//2) 2\r\ncolors = list(map(f, input().split()))\r\n#print(colors)\r\nmx,mx_i = 0,0\r\nfor i in range(3):\r\n if colors[i]>=mx:\r\n mx = colors[i]\r\n mx_i = i\r\ncycle = (mx-1)//2\r\ntotal = 30 + 3cycle + mx_i\r\nprint(total)\r\n ", "a = list(map(int,input().split()))\nb = -1\nfor x in range(len(a)):\n\tif a[x] % 2 != 0:a[x] = a[x] + 1\n\tif a[x] == b:a[a.index(a[x])] = 0\n\telif a[x] > b:b = a[x]\nc = 3 - (a.index(b) + 1) + 1\nprint(int(30 + ((b / 2) 3) - c))\n", "from math import ceil\r\na,b,c = map(int,input().split())\r\nx,y,z = ceil(a/2),ceil(b/2),ceil(c/2)\r\nt = max(x,y,z)\r\nif t == z:\r\n\tprint(32+3ceil((c-2)/2))\r\nelif t == y:\r\n\tprint(31+3ceil((b-2)/2))\r\nelif t == x:\r\n\tprint(30+3ceil((a-2)/2))\r\n", "\nI0 = lambda :map(int,input().split())\nI1 = lambda :int(input())\nI2 = lambda :list(map(int,input().split()))\n#####################################################\nr,g,b = I0()\nt = 0\nf = [True,False,False]\nwhile any([r,g,b]):\n if f[0]==True:r = max(0,r-2);f[0]=False;f[1]=True\n elif f[1]==True:g = max(0,g-2);f[1]=False;f[2]=True\n elif f[2]==True:b = max(0,b-2);f[2]=False;f[0]=True\n else:pass\n if t == 0:t = 30\n else:t+=1\n \nprint(t)", "r , g , b = map(lambda x : int((int(x)+1)/2) , input().split())\r\n\r\nvalue = 3\r\ngreatest = b\r\n\r\nif (g > greatest) :\r\n greatest = g\r\n value = 2\r\nif (r > greatest):\r\n greatest = r\r\n value = 1\r\n \r\ntime = 30 + ((greatest-1)3) + value - 1\r\n\r\nprint(time)", "a=list(map(int,input().strip().split()))[:3]\ni=0\nwhile(max(a)>0):\n a[i%3]=a[i%3]-2\n i=i+1\nprint(i+29)\n\n\n\n", "from math import ceil as c\r\nl=list(map(lambda x:c(int(x)/2),input().split()))\r\nfor x in range(3):\r\n\tif l[x]==max(l):a=x+1\r\nif l==[1,0,0]:print(30)\r\nelif l[2]==0 and max(l)==1:print(31)\r\nelif max(l)>1:print(32+(max(l)-2)3+a)\r\nelse:print(32)\r\n", "r,g,b = list(map(int,input().split()))\r\n# rr =0 \r\n# if r<2:\r\n# rr = 0\r\n# else:\r\n# rr = r-2\r\n# ans = 30\r\n# # print(rr)\r\n\r\n# if r<g:\r\n# dif = g-r\r\n# ans += dif//2 if dif%2==0 else (dif//2)+1\r\n# if g<b:\r\n# dif = b-g\r\n# ans += dif//2 if dif%2==0 else (dif//2)+1\r\n# # print(ans)\r\n# fi = g//2 if g%2==0 else (g//2)+1\r\n# # print(fi)\r\n# si = b//2 if b%2==0 else (b//2)+1\r\n# li = rr//2 if rr%2==0 else (rr//2)+1\r\n# # print(li)\r\n# sm = fi+si+li\r\n# # print(sm)\r\nlst = [r,g,b]\r\nans = 0\r\nfor i in range(3):\r\n ans = max(ans,i+3(lst[i]//2+lst[i]%2))\r\nans+=27\r\nprint(ans)", "r,g,b=map(int,input().split())\r\nf=lambda x:(0--x//2-1)3\r\nprint(max(f(r),1+f(g),2+f(b))+30)", "\r\n#Code Force challenge 90A\r\n\r\nr,g,b = map(int,input().split())\r\ntime = 0\r\nresult = 0 \r\ncableColours = (\"r\",\"g\",\"b\")\r\n\r\nstudentsLeft = True\r\n\r\nwhile studentsLeft:\r\n for colour in cableColours:\r\n \r\n if vars()[colour] > 1:\r\n vars()[colour] -= 2\r\n elif vars()[colour] > 0:\r\n vars()[colour] -= 1\r\n \r\n if r == g == b ==0:\r\n studentsLeft = False\r\n break\r\n\r\n time += 1\r\n\r\nprint(time + 30)\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "r, g, b = map(int, input().split())\r\nif r%2==1:\r\n r+=1\r\nif g%2==1:\r\n g+=1\r\nif b%2==1:\r\n b+=1\r\nk = 0\r\nt = 0\r\nwhile r+g+b != 0:\r\n if k == -1 and r>0:\r\n r-=2\r\n elif k == 0 and r>0:\r\n r-=2\r\n t+=1\r\n elif k == 1 and g>0:\r\n g-=2\r\n t+=1\r\n elif k == 2 and b>0:\r\n b-=2\r\n t+=1\r\n else:\r\n t+=1\r\n if k<2:\r\n k += 1\r\n else:\r\n k = 0\r\nprint(t+29)\r\n \r\n", "import sys\r\n\r\ndef get_int():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef get_string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nFILE=False\r\nif FILE:\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\ntext=get_string().split()\r\nsred=int(text[0]) \r\nsgreen=int(text[1])\r\nsblue=int(text[2])\r\ntime=0\r\ncurrent=1\r\nwhile (sred+sgreen+sblue>=0):\r\n if sred+sgreen+sblue==0:\r\n time=time+29\r\n break\r\n if current==1:\r\n sred=max(sred-2,0)\r\n current=2\r\n elif current==2:\r\n sgreen=max(sgreen-2,0)\r\n current=3\r\n else:\r\n sblue=max(sblue-2,0)\r\n current=1\r\n time=time+1\r\nsys.stdout.write(str(time))", "import math\r\nr, g, b = list(map(int, input().split()))\r\nr = math.ceil(r / 2)\r\ng = math.ceil(g / 2)\r\nb = math.ceil(b / 2)\r\n\r\nans = 0\r\nif r > g and r > b:\r\n ans = 30 + ((r - 1) 3)\r\nif g >= r and g > b:\r\n ans = 31 + ((g - 1) * 3)\r\nif b >= g and b >= r:\r\n ans = 32 + ((b - 1) * 3)\r\nprint(int(ans))", "r,g,b=map(int,input().split())\r\nkr,kg,kb=r//2+r%2,g//2+g%2,b//2+b%2\r\nprint(max((kr-1)3+30,(kg-1)3+31,(kb-1)3+32))\r\n\r\n", "entrada=input().split()\nr=int(entrada[0])\ng=int(entrada[1])\nb=int(entrada[2])\nr2=(r+1)//2\ng2=(g+1)//2\nb2=(b+1)//2\n\nif r2>g2 and r2>b2:\n print(30+3(r2-1))\nelif g2>b2:\n print(30+3(g2-1)+1)\nelse:\n print(30+3(b2-1)+2)\n\t\t\t \t \t \t \t\t\t \t\t \t", "r = lambda : list(map(int, input().split()))\r\narr = r()\r\nc = 0\r\ni = 0\r\nwhile arr.count(0) != 3:\r\n arr[i%3] = max(0 , arr[i%3]-2)\r\n c+=1\r\n i+=1\r\n\r\nprint(29 + c)", "data = list(map(int ,input().split()))\r\ncounter = 29\r\ni = 0 \r\nwhile any(data) : \r\n if data[i] > 0 :\r\n data[i] -=2 \r\n counter += 1 \r\n if data[i] <= 0 : \r\n data[i] = 0 \r\n i = (i + 1) % 3\r\nprint(counter)", "r,g,b = map(int,input().split())\n\nr = r//2 + r%2\ng = g//2 + g%2\nb = b//2 + b%2\n\nans = 30 + 3(r-1)\n\nans = max(ans,31 + 3(g-1))\nans = max(ans,32 + 3(b-1))\n\nprint(ans)", "r,g,b=map(int,input().split())\r\nl=[r,g,b]\r\ni=0\r\nj=0\r\nm=[]\r\nwhile((l[0]!=0 or l[1]!=0) or l[2]!=0):\r\n\tif(i==3):\r\n\t\ti=0\r\n\tif(l[i]<=2):\r\n\t\tl[i]=0\r\n\t\tm.append(j+30)\r\n\tif(l[i]>=2):\r\n\t\tl[i]=l[i]-2\r\n\t\tm.append(j+30)\r\n\ti=i+1\r\n\tj=j+1\r\nprint(m[-1])", "l=[int(x) for x in input().split()]\r\nt=29;j=0\r\nwhile(l!=[0,0,0]):\r\n i=j%3\r\n if l[i]>1:\r\n l[i]-=2\r\n elif l[i]==1:\r\n l[i]-=1\r\n t+=1\r\n j+=1\r\nprint(t)", "import math\r\nimport sys\r\nfrom decimal import \r\nfrom collections import deque\r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\n\r\n\r\n \r\n#print(vector[9995:10001])\r\n\r\n#c=int(input())\r\n\r\n \r\nfor i in range(0,1):\r\n #n=map(int,input().split())\r\n #n=int(input())\r\n #print(n,a,b)\r\n \r\n r,g,b=list(map(int,input().split()))\r\n \r\n #print(r,g,b)\r\n\r\n end_r=r//2+r%2\r\n end_r=30+(end_r-1)3\r\n \r\n end_g=g//2+g%2\r\n end_g=31+(end_g-1)3\r\n \r\n end_b=b//2+b%2\r\n end_b=32+(end_b-1)3\r\n \r\n print(max(end_r,end_g,end_b) )\r\n \r\n \r\n#print(rasp) ", "r, g, b = map(int, input().split())\r\n\r\nans=max(3 ((r + 1) // 2) + 27, 3 * ((g + 1) // 2) + 28, 3 * ((b + 1) // 2) + 29)\r\n\r\nprint(ans)\r\n", "a=list(map(int,input().split()))\r\nt=0\r\nwhile(sum(a)>0):\r\n for i in range(3):\r\n if(a[i]-2>0):\r\n a[i]-=2\r\n else:\r\n a[i]=0\r\n if(sum(a)==0):\r\n break\r\n t+=1\r\nprint(t+30)\r\n", "from math import ceil as c\r\nr,g,b = map(int,input().split())\r\nk = c((max(r,g,b))/2)\r\nl = max(r,g,b)\r\nif r==g==b:\r\n\tprint(29+3(c(l/2)))\r\nelif k==c(b/2):\r\n\tprint(32+3c((l/2)-1))\r\nelif k==c(g/2):\r\n\tprint(31+3c((l/2)-1))\r\nelse:\r\n\tprint(30+3c((l/2)-1))", "r,g,b=map(int,input().split())\r\nx=0\r\nwhile True:\r\n\tif r>0:\r\n\t\tr-=2\r\n\t\tr=max(0,r)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\n\tif g>0:\r\n\t\tg-=2\r\n\t\tg=max(0,g)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\n\tif b>0:\r\n\t\tb-=2\r\n\t\tb=max(0,b)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\nprint(x+30)", "peoplenums = input().split()\r\ntramorder = ['red', 'green', 'blue']\r\nredpreferred = int(peoplenums[0])\r\ngreenpreferred = int(peoplenums[1])\r\nbluepreferred = int(peoplenums[2])\r\ntotalmins = 0\r\n\r\nfor i in range(10000):\r\n if redpreferred == 0 and greenpreferred == 0 and bluepreferred == 0:\r\n break\r\n totalmins += 1\r\n if tramorder[i % 3] == 'red':\r\n if redpreferred != 0 and redpreferred >= 2:\r\n redpreferred -= 2\r\n continue\r\n if redpreferred != 0 and redpreferred < 2:\r\n redpreferred -= 1\r\n continue\r\n if tramorder[i % 3] == 'green':\r\n if greenpreferred != 0 and greenpreferred >= 2:\r\n greenpreferred -= 2\r\n continue\r\n if greenpreferred != 0 and greenpreferred < 2:\r\n greenpreferred -= 1\r\n continue\r\n if tramorder[i % 3] == 'blue':\r\n if bluepreferred != 0 and bluepreferred >= 2:\r\n bluepreferred -= 2\r\n continue\r\n if bluepreferred != 0 and bluepreferred < 2:\r\n bluepreferred -= 1\r\n continue\r\n\r\n\r\nprint(totalmins + 29)\r\n", "\r\nl = [int(s) for s in input().split()]\r\n\r\nminutes = 0\r\ncount = l[0] + l[1] + l[2]\r\nwhile(True):\r\n x = minutes % 3\r\n if(l[x] > 0):\r\n count -= min(l[x],2)\r\n l[x] -= min(l[x],2)\r\n if(count <= 0):\r\n break\r\n minutes += 1\r\nprint(minutes + 30)\r\n", "x=list(map(int, input().split()))\r\nfor i in range(len(x)):\r\n x[i]=(x[i]+1)//2\r\nc=max(x)\r\nind=x[::-1].index(c)\r\nprint(30+c3-ind-1)", "# 90A\r\nfrom math import ceil\r\nr,g,b=map(int,input().split())\r\nr1=ceil(r/2)\r\ng1=ceil(g/2)\r\nb1=ceil(b/2)\r\nans=0\r\nn=max(r1,g1,b1)\r\nif n==b1:\r\n\tans=3n-1\r\nelif n==g1:\r\n\tans=3n-2\r\nelse:\r\n\tans=3n-3\r\nprint(ans+30)", "def solve():\n prefs = [int(num_students) for num_students in input().split()]\n time = 0\n car = 0\n\n while sum(prefs) > 0:\n if prefs[car % 3] > 0:\n prefs[car % 3] -= min(2, prefs[car % 3])\n \n car += 1\n time += 1\n\n print(time - 1 + 30)\n\n\nsolve()\n", "r, g, b = map(int, input().split())\r\n\r\nr = (r // 2 + r % 2) * 3 + 30\r\ng = (g // 2 + g % 2) * 3 + 30\r\nb = (b // 2 + b % 2) * 3 + 30\r\nma = max(r, max(g, b))\r\nif ma == b:\r\n\tprint(b - 1)\r\nelif ma == g:\r\n\tprint(g - 2)\r\nelse:\r\n\tprint(r - 3)", "import math\n\na = input()\na=a.split()\n\na[0] = math.ceil(int(a[0])/2)\na[1] = math.ceil(int(a[1])/2)\na[2] = math.ceil(int(a[2])/2)\n#print(a)\n\nif(a[2]>=a[1] and a[2]>=a[0]):\n total = 3a[2]+30-1\n\nelif(a[1]>=a[2] and a[1]>=a[0]):\n total = 3a[1]+30-2\n\nelif(a[0]>=a[2] and a[0]>=a[1]):\n total = 3a[0]+30-3\n\nprint(total)\n \t \t \t \t \t\t \t \t \t\t", "lst = list(map(int,input().split()))\r\ntime = 29\r\nwhile True:\r\n\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\tbreak\r\n\telse:\r\n\t\tif lst[0] > 2:\r\n\t\t\tlst[0]-=2\r\n\t\telse:\r\n\t\t\tlst[0] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\tif lst[1] > 2:\r\n\t\t\tlst[1]-=2\r\n\t\telse:\r\n\t\t\tlst[1] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\tif lst[2] > 2:\r\n\t\t\tlst[2]-=2\r\n\t\telse:\r\n\t\t\tlst[2] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\r\nprint(time)\t", "r, g, b = map(int, input().split())\r\nif b % 2 == 0:\r\n b = b//2\r\nelse:\r\n b = b//2 + 1\r\n\r\nif g % 2 == 0:\r\n g = g//2\r\nelse:\r\n g = g//2 + 1\r\n \r\nif r % 2 == 0:\r\n r = r//2\r\nelse:\r\n r = r//2 + 1\r\n \r\nif b >= g >= r or b >= r >= g:\r\n print(29+3b) \r\nelif g >= r >= b or g >= b >= r:\r\n print(28+3g)\r\nelse:\r\n print(27+3r)\r\n", "r, g, b = (int(i) for i in input().split())\nres = 3 * ((r + 1) // 2 - 1)\nif g:\n res = max(res, 1 + 3 * ((g + 1) // 2 - 1))\nif b:\n res = max(res, 2 + 3 * ((b + 1) // 2 - 1))\nres += 30\nprint(res)\n", "r, g, b = map(int, input().split())\na = 0\nr = ((r//2) + (r%2) - 1) * 3 + 1\ng = ((g//2) + (g%2) - 1) * 3 + 2\nb = ((b//2) + (b%2) - 1) * 3 + 3\na = max(r, max(g,b)) + 29\nprint(a)\n", "a=[int(i) for i in input().split()]\r\na[0]=int(((a[0]//2)+(a[0]%2)-1)3+1)\r\na[1]=int(((a[1]//2)+(a[1]%2)-1)3+2)\r\na[2]=int(((a[2]//2)+(a[2]%2)-1)3+3)\r\nprint(max(a[0],max(a[1],a[2]))+29)", "r, g, b = map(int, input().split())\r\nl = [(r - 1) // 2 + 1, (g - 1) // 2 + 1, (b - 1) // 2 + 1]\r\nm = 0\r\nind = 0\r\nfor i in range(3):\r\n if l[i] >= m:\r\n m = l[i]\r\n ind = i\r\nprint(30 + 3 (m - 1) + ind)", "a = list(map(int, input().split()))\r\nans = -1\r\ni = 0\r\nwhile max(a) > 0:\r\n a[i] -= 2\r\n i = (i + 1) % 3\r\n ans += 1\r\nprint(ans + 30)", "def main():\n from math import ceil\n [r, g, b] = [int(_) for _ in input().split()]\n \n n_cars_red = ceil(r / 2)\n n_cars_green = ceil(g / 2)\n n_cars_blue = ceil(b / 2)\n\n last_red = (n_cars_red - 1) * 3 + 30 if n_cars_red > 0 else 0\n last_green = (n_cars_green - 1) * 3 + 31 if n_cars_green > 0 else 0\n last_blue = (n_cars_blue - 1) * 3 + 32 if n_cars_blue > 0 else 0\n\n print(max(last_red, last_green, last_blue))\n\n\nif __name__ == '__main__':\n main()\n", "r, g, b = map(int, input().split())\ntime = -1\nwhile r + b + g > 0:\n total = r + b + g\n time += 1\n if r: \n r = max(r-2, 0)\n total = r + b + g\n if not total: \n break\n time += 1\n if g: \n g = max(g-2, 0)\n total = r + b + g\n if not total: \n break\n time += 1\n if b: \n b = max(b-2, 0)\n total = r + b + g\n if not total: \n break\nprint(time + 30)\n", "r,g,b = map(int,input().split())\r\nit=0\r\nwhile(r>0 or b>0 or g>0):\r\n if(it%3==0):\r\n r = max(r-2,0)\r\n elif(it%3==1):\r\n g = max(0,g-2)\r\n else:\r\n b = max(0,b-2)\r\n it+=1\r\nprint(it+29)", "r, g, b = map(int, input().split())\r\nlastR = 3(-((-r) // 2) -1) if r > 0 else -1\r\nlastG = 3(-((-g) // 2) -1) + 1 if g > 0 else -1\r\nlastB = 3(-((-b) // 2) -1) + 2 if b > 0 else -1\r\nlastStart = max([lastR, lastG, lastB])\r\nprint(30 + lastStart)\r\n", "r,g,b=list(map(int,input().split()))\r\n#Finding no of required cable cars of each colour\r\nr=r//2+r%2\r\ng=g//2+g%2\r\nb=b//2+b%2\r\n#finding arrival time and adding journey time\r\nr=(r-1)3+30\r\ng=(g-1)3+31\r\nb=(b-1)3+32\r\nprint(max(r,b,g))", "def main():\n\tr, g, b = list(int(x) for x in input().split())\n\n\tcc_r = ceil(r/2)\n\tcc_g = ceil(g/2)\n\tcc_b = ceil(b/2)\n\n\tcc = [cc_b, cc_g, cc_r]\n\n\tlongest_cc = max(cc)\n\tlongest_cc_index = cc.index(longest_cc)\n\n\ttotal_time = 30 + ((longest_cc-1)3)\n\n\tif longest_cc_index == 0:\n\t\ttotal_time+=2\n\telif longest_cc_index == 1:\n\t\ttotal_time+=1\n\telif longest_cc_index == 2:\n\t\ttotal_time+=0\n\n\tprint(total_time)\n\treturn\n\n\ndef ceil(n):\n\n\tif n%1 > 0:\n\t\tn+=1\n\n\treturn int(n)\n\n\nif __name__ == \"__main__\":\n\tmain()\n\t \t \t\t \t\t \t \t\t \t\t", "import math\r\ndef cable(r, g, b):\r\n\tr_m = math.ceil(r / 2)\r\n\tg_m = math.ceil(g / 2)\r\n\tb_m = math.ceil(b / 2)\r\n\t\r\n\tr_e = 30 + (0 + 3(r_m - 1))\r\n\tg_e = 30 + (1 + 3(g_m - 1))\r\n\tb_e = 30 + (2 + 3(b_m - 1))\r\n\tif r_e > g_e and r_e > b_e:\r\n\t\treturn r_e\r\n\telif g_e > r_e and g_e > b_e:\r\n\t\treturn g_e\r\n\telif b_e > g_e and b_e > r_e:\r\n\t\treturn b_e\r\n\r\nr, g, b = map(int, input().split())\r\nprint(cable(r, g, b))\r\n", "a=input().split(' ')\r\nb=((max((int(a[0])+(int(a[0])%2)),(int(a[1])+(int(a[1])%2)),(int(a[2])+(int(a[2])%2))))/2)\r\nif b==(int(a[2])+(int(a[2])%2))/2:\r\n print(int(3b+29))\r\nelif b==(int(a[1])+(int(a[1])%2))/2:\r\n print(int(3b+28))\r\nelse:\r\n print(int(3b+27))", "r, g, b = [int(i) for i in input().split()]\r\nprint(30 + max(3 ((r - 1) // 2), 1 + 3 * ((g - 1) // 2), 2 + 3 * ((b - 1) // 2)))\r\n", "a,b,c = map(int,input().split())\r\nprint(max(27+3((a+1)//2),28+3((b+1)//2),29+3((c+1)//2)))", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nr, g, b = map(int, input().split())\r\nans = max(\r\n (((r + 1) // 2) - 1) 3,\r\n (((g + 1) // 2) - 1) * 3 + 1 if g else 0,\r\n (((b + 1) // 2) - 1) * 3 + 2 if b else 0\r\n) + 30\r\nprint(ans)\r\n", "r, g, b = map(int, input().split())\r\n\r\nr, g, b = r//2 + (r%2>0), g//2 + (g%2>0), b//2 + (b%2>0)\r\nx = max(r,g,b)\r\nc = 0\r\nif x == r:\r\n c = 3(x-1)\r\nif x == g:\r\n c = 3(x-1) + 1\r\nif x == b:\r\n c = 3(x-1) + 2\r\nprint(c + 30)", "# /\r\n# author: brownfox2k6\r\n# * created: 07/06/2023 21:58:50 Hanoi, Vietnam\r\n# */\r\n\r\nr, g, b = map(int, input().split())\r\n\r\nprint(max([\r\n (r+1) // 2 3,\r\n (g+1) // 2 * 3 + 1,\r\n (b+1) // 2 * 3 + 2\r\n]) + 27)", "r,g,f=map(int,input().split())\r\nc=29\r\nwhile(1):\r\n c=c+1\r\n if r>=2:\r\n r=r-2\r\n elif r==1:\r\n r=r-1\r\n \r\n if r==0 and g==0 and f==0:\r\n break\r\n c=c+1\r\n if g>=2:\r\n g=g-2\r\n elif g==1:\r\n g=g-1\r\n if r==0 and g==0 and f==0:\r\n break\r\n c=c+1\r\n if f>=2:\r\n f=f-2\r\n elif f==1:\r\n f=f-1\r\n if r<=0 and g<=0 and f<=0:\r\n break\r\nprint(c)\r\n \r\n \r\n \r\n ", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nr,g,b = get_int_list()\r\n\r\nturn = 1\r\ntime = 0\r\nwhile True:\r\n if turn == 1: #red\r\n if r > 0:\r\n m = min(r,2)\r\n r -= m\r\n time += 1\r\n else:\r\n time += 1\r\n turn = 2\r\n elif turn == 2: #green\r\n if g > 0:\r\n m = min(g,2)\r\n time += 1\r\n g -= m\r\n else:\r\n time += 1\r\n turn = 3\r\n else: #blue\r\n if b > 0:\r\n m = min(b,2)\r\n time += 1\r\n b -= m\r\n else:\r\n time += 1\r\n turn = 1\r\n \r\n if r+g+b == 0:\r\n time += 29\r\n break\r\nprint(time)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nl=[int(i) for i in input().split()]\r\nfor i in range(3):\r\n l[i]=math.ceil(l[i]/2)\r\nm=max(l)\r\nfor i in range(2,-1,-1):\r\n if(l[i]==m):\r\n print(3(m-1)+i+30)\r\n break", "r, g, b = map(int, input().split())\r\n\r\nrc = ((r + 1) // 2 - 1) 3 + 0\r\ngc = ((g + 1) // 2 - 1) * 3 + 1\r\nbc = ((b + 1) // 2 - 1) * 3 + 2\r\n\r\nprint(30 + max(rc, gc, bc))", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr1,g1,b1=ceil(r/2),ceil(g/2),ceil(b/2)\r\nif r1<=b1>=g1:\r\n\tprint(30+(b1-1)3+2)\r\nelif r1<=g1>=b1:\r\n\tprint(30+(g1-1)3+1)\r\nelif g1<=r1>=b1:\r\n\tprint(30+(r1-1)3)", "arr= list(map(int , input().split()))\r\ncount = 0\r\ni=0\r\nwhile sum(arr)!=0:\r\n if arr[i]>0:\r\n d = max(arr[i]-2 , 0)\r\n arr[i] = d\r\n count = count+1\r\n i = i +1\r\n if i==3:\r\n i = 0\r\nprint(count+29)", "r, g, b = list(map(int, input().split(' ')))\nr = ((r+1)//2 - 1) 3\ng = ((g+1)//2 - 1) * 3 + 1\nb = ((b+1)//2 - 1) * 3 + 2\nres = max([r, g, b]) + 30\n\nprint(res)\n\n \t \t \t \t\t\t\t \t \t \t\t\t\t\t \t\t", "class CodeforcesTask90ASolution:\n def __init__(self):\n self.result = ''\n self.r_g_b = []\n\n def read_input(self):\n self.r_g_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n time = -1\n cable = 0\n while sum(self.r_g_b):\n self.r_g_b[cable] = max(0, self.r_g_b[cable] - 2)\n time += 1\n cable += 1\n if cable > 2:\n cable = 0\n time += 30\n self.result = str(time)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask90ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/90/A\n\"\"\"\n\nred, green, blue = [int(x) for x in input().split()]\n\n\ndef temps_arrivee_dernier(color, decalage=0):\n if color > 0:\n cabines = color // 2 + color % 2\n return 30 + (cabines - 1) * 3 + decalage\n return 0\n\n\nr = temps_arrivee_dernier(red)\ng = temps_arrivee_dernier(green, 1)\nb = temps_arrivee_dernier(blue, 2)\n\nprint(max(r, g, b))\n", "import math\r\n \r\ninput_data = input()\r\n\r\ndata = list(map(int, input_data.split(' ')))\r\n\r\ntime = 0\r\nindex = 0\r\n\r\ndef sumArr(arr):\r\n result = 0\r\n for element in arr:\r\n result += element\r\n return result\r\n\r\nwhile sumArr(data) != 0:\r\n num = data[index]\r\n\r\n for i in range(2):\r\n if num > 0:\r\n num -= 1\r\n data[index] = num\r\n \r\n if sumArr(data) == 0:\r\n print(time + 30)\r\n break\r\n\r\n time += 1\r\n index += 1\r\n\r\n if index == 3:\r\n index = 0# 1689320666.2978234", "r, g, b = map(int, input().split())\r\n\r\nx, c = 0, 0\r\n\r\nwhile r > 0 or g > 0 or b > 0:\r\n\tif r > 0:\r\n\t\tr -= 2\r\n\t\tc = 0\r\n\tif g > 0:\r\n\t\tg -= 2\r\n\t\tc = 1\r\n\tif b > 0:\r\n\t\tb -= 2\r\n\t\tc = 2\r\n\r\n\tx += 3\r\n\t\r\nprint(30 + (x - 3) + c)", "import sys\r\nimport math, itertools, collections\r\n\r\nr,g,b = map(int, input().split())\r\ni =0\r\n\r\nwhile(r>0 or g>0 or b>0):\r\n if i%3==0:\r\n r-=2\r\n elif i%3==1:\r\n g-=2\r\n else:\r\n b-=2\r\n i+=1\r\nprint(i+29)", "arr = list(map(int, input().split()))\r\ncounter = 0\r\ntime = 29\r\nwhile arr[0] > 0 or arr[1] > 0 or arr[2] > 0:\r\n index = counter % 3\r\n if arr[index] > 1:\r\n arr[index] -= 2\r\n elif arr[index] == 1:\r\n arr[index] -= 1\r\n counter += 1\r\n time += 1\r\nprint(time)", "import sys\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as cc\r\nfrom queue import Queue\r\nimport math\r\nimport itertools\r\ntry:\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\ninput = lambda: sys.stdin.buffer.readline().rstrip()\r\n\r\n\r\nr,g,b=map(int,input().split())\r\nprint(max(((r+1)//2-1)3+30,((g+1)//2-1)3+31,((b+1)//2-1)3+32))", "import sys,math\r\norder = list(map(int,sys.stdin.readline().split()))\r\nm = -1\r\nseq = 0\r\nfor i in range(3):\r\n temp = math.ceil(order[i]/2)-1\r\n if m<=temp:\r\n m = temp\r\n seq = i\r\nprint(30+m3+seq)\r\n", "from math import ceil\r\n\r\n[R,G,B] = [3(ceil(int(i)/2)-1) for i in input().split()]\r\n\r\nprint(30 + max(R, G+1, B+2))\r\n", "def f(l):\r\n l = [(i-1)//2 for i in l]\r\n mx = 0\r\n mp = 0\r\n for i in range(3):\r\n if l[i] >= mx:\r\n mx = l[i]\r\n mp = i\r\n return 30 + mx3 + mp\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "def main():\r\n\tr, g, b = map(int, input().split())\r\n\r\n\tarriving = 'red'\r\n\ttime = 30\r\n\twhile True:\r\n\t\tif r == 0 and g == 0 and b == 0:\r\n\t\t\tbreak\r\n\r\n\t\tif arriving == 'red':\r\n\t\t\tr = max(r - 2, 0)\r\n\t\t\tarriving = 'green'\r\n\t\t\ttime += 1\r\n\t\telif arriving == 'green':\r\n\t\t\tg = max(g - 2, 0)\r\n\t\t\tarriving = 'blue'\r\n\t\t\ttime += 1\r\n\t\telif arriving == 'blue':\r\n\t\t\tb = max(b - 2, 0)\r\n\t\t\tarriving = 'red'\r\n\t\t\ttime += 1\r\n\r\n\tprint(time - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "# coding: utf-8\r\nif __name__ == '__main__':\r\n temp = list(map(int, input().split(' ')))\r\n t = 0\r\n while sum(temp) > 0:\r\n temp[t % 3] = max(temp[t % 3]-2, 0)\r\n t += 1\r\n print(t+29)\r\n" ]	{"inputs": ["1 3 2", "3 2 1", "3 5 2", "10 10 10", "29 7 24", "28 94 13", "90 89 73", "0 0 1", "0 0 2", "0 1 0", "0 1 1", "0 1 2", "0 2 0", "0 2 1", "0 2 2", "1 0 0", "1 0 1", "1 0 2", "1 1 0", "1 1 1", "1 1 2", "1 2 0", "1 2 1", "1 2 2", "2 0 0", "2 0 1", "2 0 2", "2 1 0", "2 1 1", "2 1 2", "2 2 0", "2 2 1", "2 2 2", "4 5 2", "5 7 8", "13 25 19", "29 28 30", "45 52 48", "68 72 58", "89 92 90", "99 97 98", "89 97 2", "96 3 92", "1 99 87", "95 2 3", "2 97 3", "2 2 99", "100 100 100", "100 0 100", "0 100 100", "100 100 0", "100 0 0", "0 100 0", "0 0 100", "5 4 5"], "outputs": ["34", "33", "37", "44", "72", "169", "163", "32", "32", "31", "32", "32", "31", "32", "32", "30", "32", "32", "31", "32", "32", "31", "32", "32", "30", "32", "32", "31", "32", "32", "31", "32", "32", "37", "41", "67", "74", "106", "136", "166", "177", "175", "171", "178", "171", "175", "179", "179", "179", "179", "178", "177", "178", "179", "38"]}	UNKNOWN	PYTHON3	CODEFORCES	133
d4f238414fd52248994773b270d7e1bb	Routine Problem	Manao has a monitor. The screen of the monitor has horizontal to vertical length ratio a:b. Now he is going to watch a movie. The movie's frame has horizontal to vertical length ratio c:d. Manao adjusts the view in such a way that the movie preserves the original frame ratio, but also occupies as much space on the screen as possible and fits within it completely. Thus, he may have to zoom the movie in or out, but Manao will always change the frame proportionally in both dimensions. Calculate the ratio of empty screen (the part of the screen not occupied by the movie) to the total screen size. Print the answer as an irreducible fraction p<=/<=q. A single line contains four space-separated integers a, b, c, d (1<=≤<=a,<=b,<=c,<=d<=≤<=1000). Print the answer to the problem as "p/q", where p is a non-negative integer, q is a positive integer and numbers p and q don't have a common divisor larger than 1. Sample Input 1 1 3 2 4 3 2 2 Sample Output 1/3 1/4	[ "from math import gcd\r\nn=input().split()\r\nmovie_ratio=int(n[2])/int(n[3])\r\nscreen_ratio=int(n[0])/int(n[1])\r\nif movie_ratio>screen_ratio:\r\n i=0\r\nelse:\r\n i=1\r\ny=int(n[1-i])int(n[i+2])-int(n[i])int(n[3-i])\r\nif y!=0:\r\n z=int(n[i+2])int(n[1-i])\r\n g=gcd(y,z)\r\n print(str(int(y/g))+'/'+str(int(z/g)))\r\nelse:\r\n t=1\r\n print('0/1')", "from math import gcd\na,b,c,d = [int(i) for i in input().split()]\n\nif ad<bc:\n r = (a,c)\nelse:\n r = (b,d)\n\nx,y = r\n\nu,v = abyy-cdxx,abyy\nu,v = round(u/gcd(u,v)),round(v/gcd(u,v))\nprint(f\"{u}/{v}\")\n\n\n\n\n\n\t\t \t\t\t \t \t \t \t \t", "from math import lcm\r\nfrom fractions import Fraction\r\n# Input\r\na, b, c, d = map(int, input().split())\r\n\r\nscaling_factor1 = lcm(a,c)\r\nscaling_factor2 = lcm(b,d)\r\n\r\nempty_1 = abs((b(scaling_factor1//a) - d(scaling_factor1//c)))\r\nempty_2 = abs((a(scaling_factor2//b) - c(scaling_factor2//d)))\r\n\r\n#print(empty_1,empty_2, scaling_factor1, scaling_factor2)\r\nempty_ratio = empty_1\r\ntotal_ratio = max(b(scaling_factor1//a), d(scaling_factor1//c))\r\nif empty_ratio/total_ratio > empty_2/max(a(scaling_factor2//b), c(scaling_factor2//d)):\r\n empty_ratio = empty_2\r\n total_ratio = max(a(scaling_factor2//b), c(scaling_factor2//d))\r\n# Print the result as an irreducible fraction\r\nres = Fraction(empty_ratio,total_ratio)\r\n\r\nprint(f\"{res.numerator}/{res.denominator}\")\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Routine_Problem2():\r\n def compute_hcf(num1,num2):\r\n if num1 == 0:\r\n return num2 \r\n if num2 == 0:\r\n return num1\r\n \r\n if num1 < num2:\r\n x = num2 \r\n y = num1 \r\n else:\r\n x = num1 \r\n y = num2 \r\n \r\n while(y):\r\n x, y = y, x % y\r\n return x \r\n\r\n a,b,c,d = invr()\r\n \r\n emptySpace1 = (ab) - ((bbc)/d)\r\n emptySpace2 = (ab) - ((aad)/c)\r\n\r\n if emptySpace2 < 0 :\r\n Nr = (abd) - (bbc)\r\n Dr = (abd)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n elif emptySpace1 < 0: \r\n Nr = (abc) - (aad)\r\n Dr = (abc)\r\n #start = time.time()\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n #end = time.time() \r\n #print(end-start)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n \r\n elif emptySpace1 < emptySpace2:\r\n Nr = (abd) - (bbc)\r\n Dr = (abd)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n elif (emptySpace2 <= emptySpace1):\r\n Nr = (abc) - (aad)\r\n Dr = (abc)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n\r\n print(str(Nr_new)+'/'+str(Dr_new))\r\n return \r\n\r\nRoutine_Problem2()", "def gcd(a,b):\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\nl=input().split(' ')\r\na,b,c,d=int(l[0]),int(l[1]),int(l[2]),int(l[3])\r\nif ad>bc:\r\n p=ad-bc\r\n q=ad\r\nelse:\r\n p=bc-ad\r\n q=bc\r\ne=gcd(p,q)\r\np//=e\r\nq//=e\r\nprint(str(p) +\"/\"+str(q))", "from math import gcd as gc\r\n\r\na,b,c,d = (int(x) for x in input().split())\r\n\r\nif ad > c b :\r\n mov = cbb/d\r\n\r\n # unoc = ab - cbb/d\r\n p = abd - cbb\r\n d = dab\r\n print( str( p//gc(p,d))+'/'+str(d//gc(p,d)) )\r\n\r\nelif ad < cb :\r\n mov = daa/c\r\n # unoc = ab - daa/c\r\n p = abc - daa\r\n c = cab\r\n print(str(p//gc(p,c))+'/'+str(c//gc(p,c)))\r\n \r\nelse:\r\n print(\"0/1\")\r\n ", "a, b, c, d = map(int, input().split())\r\n\r\nnumerator = bc\r\ndenominator = ad\r\nif numerator > denominator:\r\n numerator, denominator = denominator, numerator\r\n\r\ndef gcd(a, b):\r\n if b <= 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\nd = gcd(numerator, denominator)\r\nnumerator /= d\r\ndenominator /= d\r\nprint(\"%d/%d\" % (denominator - numerator, denominator))\r\n", "from math import gcd\na, b, c, d = list(map(int, input().split()))\nif(a / b <= c / d):\n _gcd = gcd(bc-ad, bc)\n print(f'{(bc-ad)//_gcd}/{bc//_gcd}')\nelse:\n _gcd = gcd(ad-bc, ad)\n print(f'{(ad-bc) // _gcd}/{ad // _gcd}')", "import math\r\nn,k,l,m = map(int,input().split())\r\nk=kl\r\nm=mn\r\na=abs(k-m)\r\nb=max(k,m)\r\nx=math.gcd(a,b)\r\na//=x\r\nb//=x\r\nprint(a,\"/\",b,sep=\"\")\r\n", "from math import gcd\n\na, b, c, d = tuple(map(int, input().split()))\n\nara = a / b\narc = c / d\n\nif ara == arc:\n print(\"0/1\")\n raise SystemExit\nif ara > arc:\n num = a * d - b * c\n den = a * d\nelse:\n num = b * c - d * a\n den = b * c\n\ng = gcd(num, den)\nprint(f\"{num // g}/{den // g}\")\n", "def LCM(x, y):\r\n for i in range(max(x, y), (x * y) + 1):\r\n if (i % x == 0 and i % y == 0):\r\n return i\r\n return 1\r\n\r\nfrom math import gcd\r\n\r\ndef main(): \r\n a, b, c, d = list(map(int, input().split()))\r\n if (c == d): c, d = 1, 1\r\n if (a == b): a, b = 1, 1\r\n lcm = LCM(a, c)\r\n new_b = b * (lcm // a)\r\n new_d = d * (lcm // c)\r\n if (new_d < new_b):\r\n while (gcd(new_b, new_d) != 1):\r\n hcf = gcd(new_b, new_d)\r\n new_b = new_b // hcf\r\n new_d = new_d // hcf\r\n print(f'{new_b - new_d}/{new_b}')\r\n\r\n return\r\n\r\n lcm = LCM(b, d)\r\n a = a * (lcm // b)\r\n c = c * (lcm // d)\r\n while (gcd(a, c) != 1):\r\n hcf = gcd(a, c)\r\n a = a // hcf\r\n c = c // hcf\r\n print(f'{a - c}/{a}')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "a,b,c,d=map(int,input().split())\r\n\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nif a/b<c/d:\r\n x1=((bc-ad))\r\n x2=(bc)\r\n\r\nelif a/b>c/d:\r\n x1=((ad-bc))\r\n x2=(ad)\r\n\r\nelse:\r\n x1=0\r\n x2=1\r\n\r\nm=gcd(x1,x2)\r\n\r\nprint(str(x1//m)+\"/\"+str(x2//m))\r\n", "def gcd(a, b):\r\n if a == 0 or b == 0:\r\n return a + b\r\n return gcd(b, a % b)\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nif a * d >= b * c:\r\n x, y = d * a - b * c, a * d\r\n g = gcd(x, y)\r\n print(x // g, y // g, sep='/')\r\nelse:\r\n x, y = b * c - d * a, b * c \r\n g = gcd(x, y)\r\n print(x // g, y // g, sep='/')" ]	{"inputs": ["1 1 3 2", "4 3 2 2", "3 4 2 3", "4 4 5 5", "1 1 1 1", "1000 1000 1000 1000", "125 992 14 25", "999 998 997 996", "984 286 976 284", "999 1000 1000 999", "999 1000 998 999", "1 1000 1000 1", "1 999 1000 1", "50 80 6 3", "114 891 20 3", "10 13 75 57", "21 35 34 51", "41 95 82 30", "123 150 82 60", "100 175 164 82", "101 202 37 72", "103 305 34 61", "100 131 70 77", "193 246 82 95", "188 199 121 123", "289 361 162 198", "294 356 178 185", "201 335 268 402", "202 404 404 505", "206 412 309 515", "803 949 657 730", "804 938 871 938", "826 944 826 885", "603 938 804 871"], "outputs": ["1/3", "1/4", "1/9", "0/1", "0/1", "0/1", "10763/13888", "1/497503", "10/8733", "1999/1000000", "1/998001", "999999/1000000", "998999/999000", "11/16", "971/990", "27/65", "1/10", "16/19", "2/5", "5/7", "1/37", "67/170", "21/131", "1837/20172", "955/24079", "70/3249", "4489/31684", "1/10", "3/8", "1/6", "7/117", "1/13", "1/16", "17/56"]}	UNKNOWN	PYTHON3	CODEFORCES	13
d4f7e1eed1a5f669bc061ada8368101c	Merge Equals	You are given an array of positive integers. While there are at least two equal elements, we will perform the following operation. We choose the smallest value $x$ that occurs in the array $2$ or more times. Take the first two occurrences of $x$ in this array (the two leftmost occurrences). Remove the left of these two occurrences, and the right one is replaced by the sum of this two values (that is, $2 \cdot x$). Determine how the array will look after described operations are performed. For example, consider the given array looks like $[3, 4, 1, 2, 2, 1, 1]$. It will be changed in the following way: $[3, 4, 1, 2, 2, 1, 1]~\rightarrow~[3, 4, 2, 2, 2, 1]~\rightarrow~[3, 4, 4, 2, 1]~\rightarrow~[3, 8, 2, 1]$. If the given array is look like $[1, 1, 3, 1, 1]$ it will be changed in the following way: $[1, 1, 3, 1, 1]~\rightarrow~[2, 3, 1, 1]~\rightarrow~[2, 3, 2]~\rightarrow~[3, 4]$. The first line contains a single integer $n$ ($2 \le n \le 150\,000$) — the number of elements in the array. The second line contains a sequence from $n$ elements $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^{9}$) — the elements of the array. In the first line print an integer $k$ — the number of elements in the array after all the performed operations. In the second line print $k$ integers — the elements of the array after all the performed operations. Sample Input 7 3 4 1 2 2 1 1 5 1 1 3 1 1 5 10 40 20 50 30 Sample Output 4 3 8 2 1 2 3 4 5 10 40 20 50 30	[ "\nn = int(input())\nnumbers = list(map(int,input().split()))\npos = {}\ni=0\nremoved = 0\nwhile i<n:\n\n if numbers[i] not in pos or pos[numbers[i]] == -1:\n pos[numbers[i]] = i\n i+=1\n else:\n numbers[pos[numbers[i]]] = -1\n pos[numbers[i]] = -1\n numbers[i] = 2\n removed+=1\n \nprint(n-removed)\nfor i in numbers:\n if i != -1:\n print(\"%d \"%(i), end='')\nprint()\n\t \t\t \t\t\t \t \t \t \t \t \t \t\t", "import sys\nif locals()['__file__'][-2:] == 'py':\n sys.stdin = open('in.txt', 'r')\nn = int(input())\nd = {}\nfor i, x in enumerate(map(int, input().split())):\n t = d.get(x, [])\n while t:\n i = max(i, d[x].pop())\n x = 2\n t = d.get(x, [])\n else:\n d[x] = [i]\nb = [0] * n\nfor x, y in d.items():\n for i in y:\n b[i] = x\nr = []\nfor x in b:\n if x:\n r.append(x)\nprint(len(r))\nprint(r)\n", "from queue import deque\r\nimport sys\r\n\r\n\r\n\r\ndef process(arr):\r\n trackers = dict()\r\n arr = [elm for elm in arr] # Shallow copy\r\n\r\n for i in range(len(arr)):\r\n while True:\r\n prev_occ = trackers.get(arr[i], deque())\r\n if len(prev_occ) == 0:\r\n prev_occ.append(i)\r\n trackers[arr[i]] = prev_occ\r\n break\r\n first_occ = prev_occ.popleft()\r\n arr[first_occ] = None\r\n arr[i] = arr[i] 2\r\n\r\n return [elm for elm in arr if elm is not None]\r\n\r\n\r\n\r\nn = int(sys.stdin.readline())\r\narr = [int(elm) for elm in sys.stdin.readline().split()]\r\nres = process(arr)\r\nprint(len(res))\r\nprint(' '.join([str(elm) for elm in res]))", "n = int(input())\nline = input().split()\ndic = {}\nans = [0] * n\nhow_many = 0\n\nindex = 0\nfor word in line:\n num = int(word)\n while num in dic:\n if dic[num] == -1:\n break\n else:\n how_many += 1\n ans[dic[num]] = 0\n dic[num] = -1\n num = 2\n dic[num] = index\n ans[index] = num\n index += 1\n\nprint(n - how_many)\nfor num in ans:\n if num != 0:\n print(num, end=' ')\nprint()\n\t \t\t \t \t\t \t \t\t \t \t", "input()\na={}\nfor i in list(map(int,input().split())):\n while i in a:\n del a[i]\n i=2\n a[i]=1\nprint(len(a))\nprint(a)\n\n\n\t\t\t\t \t \t \t\t \t\t \t\t \t\t \t", "from collections import defaultdict\r\nfrom heapq import \r\ndef f(a):\r\n\tvis=[\"\"]len(a)\r\n\tind=defaultdict(list)\r\n\tfor i in range(len(a)):\r\n\t\tif len(ind[a[i]])==0:\r\n\t\t\theapify(ind[a[i]])\r\n\t\theappush(ind[a[i]],i)\r\n\tst=list(ind.keys())\r\n\theapify(st)\r\n\tcnt=0\r\n\twhile st:\r\n\t\ti=heappop(st)\r\n\t\twhile ind[i]:\r\n\t\t\tif len(ind[i])==1:\r\n\t\t\t\tt=heappop(ind[i])\r\n\t\t\t\tvis[t]=str(i)\r\n\t\t\t\tcnt+=1\r\n\t\t\telse:\r\n\t\t\t\tt1=heappop(ind[i])\r\n\t\t\t\tt2=heappop(ind[i])\r\n\t\t\t\tvis[t1]=\"\"\r\n\t\t\t\tif ind.get(2i,None)==None:\r\n\t\t\t\t\theappush(st,2i)\r\n\t\t\t\theappush(ind[i2],t2)\r\n\tprint(cnt)\r\n\tprint(vis,sep=\" \")\r\n\r\na=input()\r\nl=list(map(int,input().strip().split()))\r\nf(l)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nfrom heapq import \r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nv = []\r\nC = set(A)\r\nfor c in C:\r\n heappush(v,c)\r\n\r\nlib = defaultdict(list)\r\nfor i,a in enumerate(A):\r\n heappush(lib[a], i)\r\n\r\nwhile v:\r\n i = heappop(v)\r\n while len(lib[i])>1:\r\n a = heappop(lib[i])\r\n b = heappop(lib[i])\r\n t = i2\r\n heappush(lib[t],b)\r\n if t not in C:\r\n C.add(t)\r\n heappush(v, t)\r\n \r\nB = []\r\nfor k,v in lib.items():\r\n if v:\r\n B.append((v[0],k))\r\nB.sort()\r\nprint(len(B))\r\nprint([c for i,c in B])\r\n \r\n \r\n", "from heapq import heappush, heappop\n\ndef main():\n heap = []\n for i in range(10, 0, -1):\n heappush(heap, (i, -i))\n\n print(heap)\n while(heap):\n print(heappop(heap), end = \" \")\n print()\n\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n heap = []\n for idx, i in enumerate(arr):\n heappush(heap, (i, idx))\n\n ans = [-1 for x in range(0, n)]\n cnt = 0\n while(heap):\n cur = heappop(heap)\n if(len(heap) == 0):\n ans[cur[1]] = cur[0]\n break\n nxt = heappop(heap)\n if(cur[0] == nxt[0]):\n heappush(heap, (2 * nxt[0], nxt[1]))\n cnt += 1\n else:\n heappush(heap, nxt)\n ans[cur[1]] = cur[0]\n\n print(n - cnt)\n for i in ans:\n if(i == -1):continue\n print(i, end = \" \")\n print()\n\nsolve()\n", "import heapq\n\ndef update(d, h, n, i):\n l = d.setdefault(n, [])\n heapq.heappush(l, i)\n if len(l) == 2:\n heapq.heappush(h, n)\n\ndef main(nums):\n d = {}\n h = []\n\n for i, n in enumerate(nums):\n update(d, h, n, i)\n\n while h:\n m = heapq.heappop(h)\n l = d[m]\n assert len(l) >= 2\n i = heapq.heappop(l)\n j = heapq.heappop(l)\n nums[i] = -1\n nums[j] = 2 * nums[j]\n if len(l) >= 2:\n heapq.heappush(h, m)\n\n update(d, h, nums[j], j)\n\n\n res = [ str(n) for n in nums if n != -1 ]\n print(len(res))\n print(' '.join(res))\n\n_ = input()\nnums = list(map(int, input().split()))\nmain(nums)\n\n", "input()\r\na = {}\r\nfor i in list(map(int,input().split())):\r\n while i in a:\r\n del a[i]\r\n i = 2\r\n a[i] = 1\r\nprint(len(a))\r\nprint(a)# 1698329597.4687905", "import sys\r\nfrom collections import defaultdict\r\nfrom heapq import heappush, heappop\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndic = defaultdict(list)\r\nfor i, x in enumerate(a):\r\n dic[x].append(i)\r\n\r\nhq = sorted(dic.keys())\r\nwhile hq:\r\n key = heappop(hq)\r\n if len(dic[key]) <= 1:\r\n continue\r\n if key2 not in dic:\r\n heappush(hq, key2)\r\n\r\n dic[key].sort()\r\n for i in range(1, len(dic[key]), 2):\r\n a[dic[key][i-1]] = 0\r\n a[dic[key][i]] = key2\r\n dic[key2].append(dic[key][i])\r\n\r\n\r\na = [x for x in a if x != 0]\r\nprint(len(a))\r\nprint(a)\r\n", "from collections import \r\nfrom bisect import \r\nfrom heapq import \r\nfrom copy import deepcopy\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\nmem, dis = defaultdict(list), Counter(a)\r\n\r\nfor i in range(n):\r\n mem[a[i]].append(i)\r\n\r\nqueue = list(mem.items())\r\nheapify(queue)\r\n\r\nwhile queue:\r\n ele = heappop(queue)\r\n\r\n for i in range(1, len(ele[1]), 2):\r\n a[ele[1][i]] = 2\r\n a[ele[1][i - 1]] = 0\r\n insort_right(mem[ele[0] 2], ele[1][i])\r\n\r\n if not dis[ele[0] * 2] and mem[ele[0] * 2]:\r\n heappush(queue, (ele[0] * 2, mem[ele[0] * 2]))\r\n\r\nnew = list(filter(lambda x: x, a))\r\nprint(len(new))\r\nprint(new)", "n=int(input())\na=list(map(int,input().split()))\ndict={}\nfor i in range(n):\n while a[i] in dict:\n # ~ print(a[i])\n del dict[a[i]]\n a[i]=2\n dict[a[i]]=1\nprint(len(dict))\nprint(dict)\n\n\t \t \t\t \t\t \t\t\t \t \t \t \t\t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor x in a:\r\n while x in d:\r\n del d[x]\r\n x = 2\r\n d[x] = 0\r\n\r\nprint(len(d))\r\nprint(d)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx={}\r\nfor i in range(n):\r\n while a[i] in x:\r\n del x[a[i]]\r\n a[i]=2\r\n x[a[i]]=i\r\nprint(len(x))\r\nprint(x)", "n = int(input())\r\nls = list(map(int, input().split()))\r\n \r\ndic = {}\r\nfor i in range(n):\r\n while ls[i] in dic:\r\n del dic[ls[i]]\r\n ls[i] = 2\r\n dic[ls[i]] = i\r\n \r\nprint(len(dic))\r\nprint(dic)\r\n", "n=int(input())\n\na = list(map(int , input().split()))\nnew={}\n\nfor i in range(n):\n num=a[i]\n while num in new:\n #print(new)\n del new[num]\n num=2\n\n\n new[num]=i\n\n\n\n#print(new)\n\nprint(len(new))\nprint(list(new.keys()))", "from collections import defaultdict\nfrom heapq import \ndef f(a):\n\tvis=[\"\"]len(a)\n\tind=defaultdict(list)\n\tfor i in range(len(a)):\n\t\tif len(ind[a[i]])==0:\n\t\t\theapify(ind[a[i]])\n\t\theappush(ind[a[i]],i)\n\tst=list(ind.keys())\n\theapify(st)\n\tcnt=0\n\twhile st:\n\t\ti=heappop(st)\n\t\twhile ind[i]:\n\t\t\tif len(ind[i])==1:\n\t\t\t\tt=heappop(ind[i])\n\t\t\t\tvis[t]=str(i)\n\t\t\t\tcnt+=1\n\t\t\telse:\n\t\t\t\tt1=heappop(ind[i])\n\t\t\t\tt2=heappop(ind[i])\n\t\t\t\tvis[t1]=\"\"\n\t\t\t\tif ind.get(2i,None)==None:\n\t\t\t\t\theappush(st,2i)\n\t\t\t\theappush(ind[i2],t2)\n\tprint(cnt)\n\tprint(vis,sep=\" \")\n\na=input()\nl=list(map(int,input().strip().split()))\nf(l)\n\t\t \t\t\t \t \t\t\t \t\t \t\t \t\t \t\t\t\t", "n = int(input())\na = list(map(int,input().split()))\nd = {}\ni = 0\nwhile i<n:\n\tnum = a[i]\n\twhile num in d:\n\t\ta[d[num]] = -1\n\t\tdel d[num]\n\t\tnum = num2\n\td[num] = i\n\ta[i] = num\n\ti += 1\nans = []\nfor i in a:\n\tif i!=-1:\n\t\tans.append(i)\nprint (len(ans))\nprint (ans)\n", "n = int(input())\na = [int(x) for x in input().split()]\nd = {}\nfor i in range(n):\n while a[i] in d:\n d.pop(a[i])\n a[i] = 2\n d[a[i]] = i\nprint(len(d))\nprint(d)\n", "from collections import defaultdict\r\nimport heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = []\r\nd = defaultdict(lambda : [])\r\nfor i in range(n):\r\n d[a[i]].append(i)\r\nfor i in d.keys():\r\n heapq.heappush(h, i)\r\nwhile h:\r\n i = heapq.heappop(h)\r\n d[i].sort(reverse = True)\r\n l = len(d[i])\r\n if l == 1:\r\n continue\r\n for _ in range(l // 2):\r\n x, y = d[i].pop(), d[i].pop()\r\n a[x] = 0\r\n a[y] = 2 i\r\n d[2 * i].append(y)\r\n heapq.heappush(h, 2 * i)\r\nans = []\r\nfor i in a:\r\n if i:\r\n ans.append(i)\r\nk = len(ans)\r\nprint(k)\r\nprint(ans)", "n=int(input())\r\nd={}\r\nfor i,x in enumerate(list(map(int,input().split()))):\r\n while x in d:\r\n del d[x]\r\n x=2\r\n d[x]=i\r\nprint(len(d))\r\nprint(d)", "n = 0\nwhile True:\n try:\n n = int(input())\n except:\n break\n mp = dict()\n a = list()\n ans = list()\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n for i in range(n):\n if a[i] in mp.keys():\n while a[i] in mp.keys():\n t = mp.get(a[i])\n a[t] = -1 \n mp.pop(a[i])\n a[i] <<= 1\n mp[a[i]] = int(i)\n for i in a:\n if i != -1:\n ans.append(i)\n print(len(ans))\n print(ans,sep = ' ')\n", "if __name__==\"__main__\":\n n=int(input())\n a={}\n for x in map(int,input().split()):\n while x in a:\n del a[x]\n x=2\n a[x]=1;\n print(len(a))\n print(a) \n\t \t\t\t\t\t \t\t \t \t \t \t \t \t", "# size of array decreases by 1 each time, we can just simulate\r\n# maintain priority queue on position for each value, merge from smallest to largest\r\n# push result into array, sort then print\r\n\r\nfrom heapq import \r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nvals = []\r\nheapify(vals)\r\npos = dict()\r\nfor i in range(n):\r\n if a[i] in pos:\r\n heappush(pos[a[i]], i)\r\n else:\r\n pos[a[i]] = [i]\r\n heapify(pos[a[i]])\r\n heappush(vals, a[i])\r\nwhile vals:\r\n num = heappop(vals)\r\n while len(pos[num]) >= 2:\r\n a = heappop(pos[num])\r\n b = heappop(pos[num])\r\n if num2 in pos:\r\n heappush(pos[num2], b)\r\n else:\r\n pos[num2] = [b]\r\n heapify(pos[num2])\r\n heappush(vals, num2)\r\nwithpos = []\r\nfor i in pos.keys():\r\n for j in pos[i]:\r\n withpos.append((j, i))\r\nwithpos.sort()\r\nprint(len(withpos))\r\nprint([i[1] for i in withpos])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n while a[i] in d:\r\n del d[a[i]]\r\n a[i]=2\r\n d[a[i]]=i\r\nprint(len(d))\r\nprint(d,sep=\" \")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n a=i\r\n while a in d:\r\n del d[a]\r\n a=2 \r\n d[a]=1\r\nprint(len(d)) \r\nfor i in d:\r\n print(i,end=\" \")\r\n ", "import bisect\r\n\r\nn = int(input())\r\ninput_str = input().split()\r\n\r\n# import random\r\n# n = 150000\r\n# input_str = \" \".join([str(random.randrange(1000000)) for x in range(n)]).split()\r\n\r\n# import time\r\n# total_time1 = 0.\r\n# total_time2 = 0.\r\n\r\n\r\nnumbers = [int(x) for x in input_str]\r\n\r\nindices = dict()\r\n\r\nfor i in range(n):\r\n if numbers[i] not in indices:\r\n indices[numbers[i]] = [i]\r\n else:\r\n indices[numbers[i]].append(i)\r\n\r\n\r\ndef insert_sorted(arr, e, l, r):\r\n if l == r:\r\n if arr[l] >= e:\r\n arr.insert(l, e)\r\n return\r\n else:\r\n arr.insert(l + 1, e)\r\n return\r\n\r\n c = (l + r) // 2\r\n\r\n if arr[c] < e:\r\n return insert_sorted(arr, e, c + 1, r)\r\n else:\r\n return insert_sorted(arr, e, l, c)\r\n\r\n\r\nnumber_list = sorted(list(indices))\r\nnumber_index = 0\r\nwhile number_index < len(number_list):\r\n number = number_list[number_index]\r\n\r\n\r\n need_add = False\r\n double = number * 2\r\n\r\n indices[number] = sorted(indices[number])\r\n\r\n # curr_time = time.time()\r\n\r\n for op_i in range(len(indices[number]) // 2):\r\n fir_i = indices[number][op_i * 2]\r\n sec_i = indices[number][op_i * 2 + 1]\r\n\r\n numbers[fir_i] = 0\r\n numbers[sec_i] = double\r\n\r\n if double not in indices:\r\n indices[double] = [sec_i]\r\n need_add = True\r\n else:\r\n indices[double].append(sec_i)\r\n\r\n # new_time = time.time()\r\n # total_time1 += new_time - curr_time\r\n # curr_time = new_time\r\n\r\n if need_add:\r\n insert_sorted(number_list, double, number_index, len(number_list) - 1)\r\n\r\n # new_time = time.time()\r\n # total_time2 += new_time - curr_time\r\n # curr_time = new_time\r\n\r\n #print(total_time1, total_time2)\r\n\r\n number_index += 1\r\n\r\n\r\n\r\noutput = [str(x) for x in numbers if x > 0]\r\n\r\nprint(len(output))\r\nprint(\" \".join(output))", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import \nfrom heapq import \nfrom math import ceil,gcd,lcm,floor,comb\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = list(map(int,input().split()))\nh=[];heapify(h)\ndic = defaultdict(set)\nfor i in range(N):\n dic[A[i]].add(i)\n heappush(h,[A[i],i])\n\nwhile h:\n x,i = heappop(h)\n if h:\n x1,i1 = heappop(h)\n if x1!=x:\n heappush(h,[x1,i1])\n continue\n else:\n dic[x].remove(i)\n dic[x].remove(i1)\n dic[x12].add(i1)\n heappush(h,[x12,i1])\nl = []\nfor i in dic:\n for j in dic[i]:\n l.append([j,i])\nl.sort()\nans = []\nfor i,b in l:\n ans.append(b)\nprint(len(ans))\nprint(ans)", "from heapq import \r\n\r\n\r\nclass priority_queue(object):\r\n\r\n def __init__(self):\r\n self.que = []\r\n heapify(self.que)\r\n \r\n def push(self, obj):\r\n heappush(self.que, obj)\r\n \r\n def pop(self):\r\n return heappop(self.que)\r\n \r\n def top(self):\r\n return self.que[0]\r\n\r\n def __bool__(self):\r\n return bool(self.que)\r\n\r\n def __repr__(self):\r\n return repr(self.que)\r\n\r\n def __len__(self):\r\n return len(self.que)\r\n\r\n\r\nm = {}\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i, _ in enumerate(a):\r\n m.setdefault(_, priority_queue()).push(i)\r\nque = priority_queue()\r\nfor k, v in m.items():\r\n que.push(k)\r\nwhile que:\r\n cur = que.pop()\r\n if len(m[cur]) <= 1:\r\n continue\r\n while len(m[cur]) > 1:\r\n m[cur].pop()\r\n m.setdefault(cur << 1, priority_queue()).push(m[cur].pop())\r\n que.push(cur << 1)\r\nl = [(k, v.top()) for k, v in m.items() if v]\r\nl.sort(key = lambda x: x[1])\r\nprint(len(l))\r\nfor k, v in l:\r\n print(k, end = ' ')", "from collections import OrderedDict\nn=int(input())\na=[int(x) for x in input().split()]\nd=OrderedDict()\nfor x in a:\n\tt=x\n\twhile t in d:\n\t\tdel d[t]\n\t\tt=2\n\td[t]=1\nprint(len(d))\nprint(d)\n", "import sys\n# sys.setrecursionlimit(10*6) \ninput=sys.stdin.readline\nt=int(input())\n\na=list(map(int,input().split(\" \")))\nd = {}\nb = []\nfor i in a:\n b.append(i)\nfor i in range(t):\n curr = a[i]\n while True:\n if(d.get(curr,-1)==-1):\n d[curr] = i\n break\n else:\n ind = d[curr]\n b[ind] = -1\n del d[curr]\n b[i] = 2curr\n if(d.get(b[i],-1)==-1):\n d[b[i]] = i\n break\n curr = 2curr\n # print(b)\nans = []\n\nfor i in b:\n if(i !=-1):\n ans.append(str(i))\nprint(len(ans))\nprint(\" \".join(ans))\n\n", "# Eric Kirchgessner\n# Tarea 1 Ejercicio 4\n# D - Merge Equals\n# finalmente, un ejercicio resolvible ne python??\n\nimport sys\n\n# Input\nn = int(sys.stdin.readline())\narray = [int(x) for x in sys.stdin.readline().split()]\narray_dict = {}\n\n# this might depend on dictionaries staing sorted??\nfor i in range(len(array)):\n number = array[i]\n while number in array_dict:\n del array_dict[number]\n number = 2\n array_dict[number] = i\n\n# Output\nans_string = \"\"\nans_number = 0\nfor key in array_dict:\n ans_string += str(key) + \" \"\n ans_number += 1\nprint(ans_number)\nprint(ans_string[:-1])\n\n \t\t \t\t \t \t\t\t\t\t \t \t\t \t\t\t\t\t", "n = int(input())\nd = {}\nfor i, x in enumerate(map(int, input().split())):\n while d.get(x, -1) >= 0:\n del d[x]\n x = 2\n d[x] = i\nprint(len(d))\nprint(d)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(n):\r\n while a[i] in b:\r\n del b[a[i]]\r\n a[i]=2\r\n b[a[i]]=i\r\nprint(len(b))\r\nprint(b)", "def main():\r\n \r\n input()\r\n arr = list(map(int, input().split()))\r\n\r\n dict = {}\r\n\r\n for i in range(len(arr)):\r\n item = arr[i]\r\n while item in dict:\r\n del dict[item]\r\n item = 2\r\n dict[item] = i\r\n\r\n numbers = [str(x[0]) for x in sorted(dict.items(), key=lambda x: x[1])]\r\n print(len(numbers))\r\n print(' '.join(numbers))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,a,q=int(input()),list(map(int,input().split())),{}\r\nfor i in range(n):\r\n if a[i] not in q:q[a[i]]=i\r\n else:\r\n while a[i] in q:\r\n a[q[a[i]]]=0\r\n q.pop(a[i])\r\n a[i]=2\r\n q[a[i]]=i\r\na=[i for i in a if i!=0]\r\nprint(len(a),\"\\n\",a)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nimport heapq\r\nq = []\r\nheapq.heapify(q)\r\nfor i, a in enumerate(A):\r\n heapq.heappush(q, (a, i))\r\nB = []\r\nwhile q:\r\n if len(q) >= 2:\r\n v, i = heapq.heappop(q)\r\n if q[0][0] == v:\r\n v, j = heapq.heappop(q)\r\n heapq.heappush(q, (2v, j))\r\n else:\r\n B.append((v, i))\r\n else:\r\n v, i = heapq.heappop(q)\r\n B.append((v, i))\r\n#print(B)\r\nB.sort(key=lambda x: x[1])\r\nans = []\r\nfor a,i in B:\r\n ans.append(a)\r\nprint(len(ans))\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nvals = {}\r\n\r\nfor i in range(n):\r\n while a[i] in vals:\r\n del vals[a[i]]\r\n a[i] = 2\r\n vals[a[i]] = i\r\nprint(len(vals))\r\nprint(vals)", "n=int(input())\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nb=set()\r\nls=[]\r\ni=0\r\nwhile i<n:\r\n if(a[i] not in b):\r\n b.add(a[i])\r\n ls.append(a[i])\r\n i+=1\r\n else:\r\n while a[i] in b:\r\n b.remove(a[i])\r\n a[i]=2\r\n ls.append(a[i]) \r\nans=[]\r\nc=set()\r\nfor i in range(len(ls)):\r\n if(ls[-i-1] in b and ls[-i-1] not in c):\r\n ans.append(ls[-i-1])\r\n c.add(ls[-i-1])\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[-i-1],end=\" \")", "#Have duplicated\r\nn = int(input())\r\nd = {}\r\nfor _, i in enumerate(list(map(int, input().split()))):\r\n while i in d:\r\n del d[i]\r\n i = 2\r\n d[i] = _\r\nprint(len(d))\r\nprint(d)", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import \r\nfrom heapq import \r\nfrom math import \r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\nn, = gil()\r\na = gil()\r\nidx = {}\r\nfor i in range(n):\r\n\tif a[i] in idx:\r\n\t\tidx[a[i]].append(i)\r\n\telse:\r\n\t\tidx[a[i]] = [i]\r\n\r\nh = []\r\nfor v in idx:\r\n\tif len(idx[v]) > 1:\r\n\t\th.append(v)\r\n\r\nheapify(h)\r\n\r\nwhile h:\r\n\tv = heappop(h)\r\n\tidxs = idx[v]\r\n\tidxs.sort()\r\n\r\n\r\n\tnv = 2v\r\n\t# print(v, nv, h, a, idxs)\r\n\tidx[nv] = idx.get(nv, [])\r\n\ttemp = idx[nv]\r\n\tprevLen = len(temp)\r\n\r\n\tfor i in range(1, len(idxs), 2):\r\n\t\tl, r = idxs[i-1], idxs[i]\r\n\t\ta[l] = 0\r\n\t\ta[r] = 2\r\n\t\ttemp.append(r)\r\n\r\n\tif prevLen < 2 and len(temp) > 1:\r\n\t\theappush(h, nv)\r\n\r\n\tidx[nv] = temp\r\n\r\nans = []\r\nfor v in a:\r\n\tif v:\r\n\t\tans.append(v)\r\n\r\nprint(len(ans))\r\nprint(ans, sep=' ')\r\n", "input()\r\na={}\r\nfor i, x in enumerate(map(int, input().split())):\r\n while x in a:\r\n del a[x]\r\n x=2\r\n a[x]=i\r\nprint(len(a))\r\nprint(a)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nd = {}\nfor i in range(n):\n num = a[i]\n while num in d:\n a[d[num]] = -1\n del d[num]\n num = num * 2\n d[num] = i\n a[i] = num\nans = []\nfor i in a:\n if i != -1:\n ans.append(i)\nprint(len(ans))\nprint(*ans)\n\n \t\t\t\t\t\t\t\t \t\t \t \t \t \t \t\t \t" ]	{"inputs": ["7\n3 4 1 2 2 1 1", "5\n1 1 3 1 1", "5\n10 40 20 50 30", "100\n10 10 15 12 15 13 15 12 10 10 15 11 13 14 13 14 10 13 12 10 14 12 13 11 14 15 12 11 11 15 12 12 11 14 14 14 15 10 10 15 15 13 13 15 10 12 14 10 12 13 11 15 11 13 14 12 10 12 11 14 13 15 13 15 13 14 14 11 12 13 11 14 10 10 15 10 15 12 15 12 13 10 11 13 15 11 10 12 10 12 14 14 13 12 14 10 12 13 11 13", "2\n1000000000 1000000000", "3\n500000000 500000000 1000000000", "9\n8 536870913 536870913 536870913 536870913 536870913 536870913 536870913 536870913", "34\n967614464 967614464 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000"], "outputs": ["4\n3 8 2 1 ", "2\n3 4 ", "5\n10 40 20 50 30 ", "12\n88 240 15 44 160 192 208 224 20 24 11 26 ", "1\n2000000000 ", "1\n2000000000 ", "2\n8 4294967304 ", "2\n1935228928 32000000000 "]}	UNKNOWN	PYTHON3	CODEFORCES	44
d4fcaa5a12e174eeb47b6b1519863b94	Initial Bet	There are five people playing a game called "Generosity". Each person gives some non-zero number of coins b as an initial bet. After all players make their bets of b coins, the following operation is repeated for several times: a coin is passed from one player to some other player. Your task is to write a program that can, given the number of coins each player has at the end of the game, determine the size b of the initial bet or find out that such outcome of the game cannot be obtained for any positive number of coins b in the initial bet. The input consists of a single line containing five integers c1,<=c2,<=c3,<=c4 and c5 — the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0<=≤<=c1,<=c2,<=c3,<=c4,<=c5<=≤<=100). Print the only line containing a single positive integer b — the number of coins in the initial bet of each player. If there is no such value of b, then print the only value "-1" (quotes for clarity). Sample Input 2 5 4 0 4 4 5 9 2 1 Sample Output 3 -1	[ "def main():\r\n v = [int(i) for i in input().split()]\r\n s = sum(v)\r\n if s % 5 == 0 and s != 0:\r\n print(s // 5)\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b, c, d, e=map(int, input().split())\r\nsum=a+b+c+d+e\r\nif(sum%5==0 and sum!=0):\r\n print(sum//5)\r\nelse:\r\n print(-1)\r\n \r\n ", "x=[int(x) for x in input().split()]; print(sum(x)//5 if sum(x)%5==0 and sum(x) else -1)", "a,b,c,d,e = list(map(int, input().split()))\r\n\r\nx = a+b+c+d+e\r\n\r\nif x<5:\r\n print(-1)\r\nelif x%5==0:\r\n print(x//5)\r\nelse:\r\n print(-1)", "import sys\ninput = sys.stdin.readline\n\nB = sum(map(int, input().split()))/5\nif B == int(B) : print(-1 if B == 0 else int(B))\nelse : print(-1)\n", "a,b,c,d,e = map(int,input().split())\r\nif a==b==c==d==e==0:\r\n print(-1)\r\nelif (a+b+c+d+e)%5==0 and a>=0 and b>=0 and c>=0 and d>=0 and e>=0:\r\n print(int((a+b+c+d+e)/5))\r\nelse:\r\n print(-1)", "def solve(l):\r\n s= sum(l)\r\n if s==0:\r\n print(-1)\r\n return\r\n if s%5==0:\r\n print(s//5)\r\n else:\r\n print(-1)\r\n \r\n\r\ndef main():\r\n l = list(map(int, input().split()))\r\n solve(l)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = list(map(int, input().split()))\r\nm = sum(x)\r\nif(m > 0):\r\n if(m%5 == 0):\r\n print(m//5)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "c1, c2, c3, c4, c5 = map(int, input().split())\r\nc1 = c1 + c2 + c3 + c4 + c5\r\nif c1 % 5 == 0 and c1 != 0:\r\n print(c1 // 5)\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nl=[int(i) for i in input().split()]\r\nn=len(l)\r\ns=sum(l)\r\nif(s%n==0 and s>0):\r\n print(s//n)\r\nelse:\r\n print(-1)", "s=[int(i) for i in input().split()]\r\nprint([-1,sum(s)//5][sum(s)%5==0 and sum(s)!=0])", "people = list(map(int, input().split()))\r\ntotal = sum(people)\r\nif total % 5 == 0 and total // 5 > 0:\r\n print(total//5)\r\nelse:\r\n print(-1)", "tc = [int(i) for i in input().split()]\r\nif(sum(tc)%5==0 and sum(tc)!=0 ):\r\n print(int(sum(tc)/5))\r\nelif(sum(tc)==0):\r\n print(-1)\r\nelse:\r\n print(-1)", "# 478A ~ prasadnaik-null\ns = sum(list(map(int, input().split())))\nif s != 0 and s % 5 == 0:\n print(s//5)\nelse:\n print(-1)\n", "l=list(map(int,input().split()))\r\nif sum(l)==0:\r\n print(-1)\r\nelif sum(l)%5!=0:\r\n print(-1)\r\nelse:\r\n print(sum(l)//5)", "s=sum(map(int,input().split()))\r\nprint([s//5,-1][s%5>0 or s<1])", "bets = list(map(int,input().split()))\nn = len(bets)\ntotal = sum(bets)\nif total % n ==0 and total //n:\n print(total//n)\nelse:\n print(-1)", "a=list(map(int,input().split()))\r\nif sum(a)%5==0 and sum(a)!=0:print(sum(a)//5)\r\nelif sum(a)==0:print(-1)\r\nelse:print(-1)", "a, b, c, d, e = list(map(int,input().split()))\r\ns = a + b + c + d + e \r\nif s > 0 and s % 5 == 0:\r\n print(s//5)\r\nelse:\r\n print(-1)", "a = sum(list(map(int,input().split())))\r\nprint(-1 if a % 5 or a == 0 else a//5)", "a = sum(map(int, input().split(' ')))\r\nprint(a // 5 if a > 0 and (a % 5 == 0) else -1)\r\n", "a=list(map(int,input().split()))\r\nif sum(a)==0:\r\n print(-1)\r\nelse:\r\n print(int(sum(a)//5) if sum(a)%5==0 else -1)", "from math import \r\nfrom collections import \r\ndef it(): return int(input())\r\ndef pr(a): return print(a)\r\nab = lambda: map(int,r.readline().strip().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return list(map(str, input().split()))\r\ndef no(): return print('NO')\r\nyes = lambda:print('YES')\r\ndef ap(a, b):return a.append(b);\r\nmp = lambda: map(int, input().split())\r\n\r\nl = sum(li())\r\nif l% 5 == 0 and l != 0:pr(l//5)\r\nelse:pr(-1)\r\n", "x = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\nif sum(list1) % len(list1) != 0 or sum(list1) == 0:\r\n print(-1)\r\nelse:\r\n print(sum(list1)//len(list1))", "p=[int(i) for i in input().split()]\r\n\r\nc=0\r\nfor i in p:\r\n c=c+i\r\np=c/5\r\nif p==0:\r\n print(\"-1\")\r\nelif round(p)==p:\r\n print(round(p))\r\nelse:\r\n print(\"-1\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nw = list(map(int, input().split()))\r\ns = sum(w)\r\nif s % 5 == 0 and s!= 0:\r\n print(s//5)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "arr = tuple(map(int,input().split()));sm,l = sum(arr),len(arr);print(sm//l if (sm%l == 0 and sm!=0) else -1)\r\n", "a=sum(map(int,input().split()))\r\nprint(-1 if a%5 or a==0 else a//5)", "s=sum(map(int,input().split()))\r\nprint(-1 if s%5 or s==0 else s//5)", "def solve(m):\r\n s = sum(m)\r\n if s == 0:\r\n return -1\r\n if s % 5 == 0:\r\n return s // 5\r\n return -1\r\n\r\nm = [int(i) for i in input().split()]\r\nprint(solve(m))", "total=sum(map(int,input().split()))\r\nprint(total//5 if total%5==0 and total>0 else -1)", "x = list(map(int,input().split()))\r\nx_sum = sum(x)\r\nif x_sum%5!=0 or x_sum == 0:\r\n print(-1)\r\nelse:\r\n print(int(x_sum/5))", "a,b,c,d,e = map(int,input().split())\r\nif (a+b+c+d+e)%5 == 0 and (a+b+c+d+e) >= 5:\r\n print((a+b+c+d+e)//5)\r\nelse:\r\n print(-1)\r\n", "n1,n2,n3,n4,n5 = map(int, input().strip(' ').split(' '))\r\nif (n1 > 0) or (n2 > 0) or (n3 > 0) or (n4 > 0) or (n5 > 0):\r\n s = n1 + n2 + n3 + n4 + n5\r\n c = s // 5\r\n d = s % 5\r\n if d == 0:\r\n print(c)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nI= lambda : list(map(int,input().split()))\r\na=sum(map(int,input().split()));print([a//5,-1][a%5!=0 or a==0])", "def main():\r\n a = list(map(int, input().split()))\r\n \r\n sum = 0\r\n for x in a:\r\n sum += x\r\n \r\n if sum % 5 == 0:\r\n res = int(sum / 5)\r\n if(res == 0):\r\n print(-1)\r\n else:\r\n print(res)\r\n else:\r\n print(-1) \r\n \r\nif __name__ == '__main__':\r\n main()", "\r\na,b,c,d,e = map(int,input().split())\r\n\r\nans = a+b+c+d+e\r\n\r\nif ans%5==0 and ans!=0:\r\n\tprint(ans//5)\r\nelse:\r\n\tprint(-1)", "a,b,c,d,e = map(int,input().split())\r\ns = a+b+c+d+e\r\nk = s / 5\r\nif int(k) == k and k > 0:\r\n print(int(k))\r\nelse:\r\n print(-1)\r\n", "import math\r\nc=list(map(int,input().split()))\r\na=sum(c)/5\r\nif math.ceil(a)==math.floor(a) and sum(c)!=0:\r\n print(int(a))\r\nelse:\r\n print(-1)", "c1 , c2 , c3 , c4 ,c5 = map(int , input().split())\r\nlist1 = [c1 , c2 , c3 , c4 , c5]\r\nsum1 = sum(list1)\r\nif sum1 != 0 and sum1%5 == 0:\r\n print(int(sum1/5))\r\nelse:\r\n print(-1)", "s=input()\r\nl1=s.split()\r\nsum=0\r\nfor i in l1:\r\n sum+=int(i)\r\nif (sum>0 and sum%5==0):\r\n print(sum//5)\r\nelse:\r\n print(-1)", "def main():\r\n arr = list(map(int, input().split()))\r\n\r\n total = sum(arr)\r\n b = total / 5\r\n if b.is_integer() and b >= 1:\r\n print(int(b))\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\nc = sum(list(map(int,input().split())))\r\nif c % 5 != 0 or c < 1:\r\n print(-1)\r\nelse:\r\n print(c // 5)\r\n\r\n", "class solve:\r\n def __init__(self):\r\n a=sum(list(map(int,input().split())))\r\n if a%5 or a==0:\r\n print(\"-1\")\r\n else:\r\n print(a//5)\r\n\r\nobj=solve()", "t=[int(i) for i in input().split()]\r\nif sum(t)==0:print(-1)\r\nelif sum(t)%5==0:print(sum(t)//5)\r\nelse:print(-1)\r\n\r\n'''\r\nlogic looks stupid to me tho\r\n'''", "c = list(map(int, input().split()))\r\n\r\ns = sum(c)\r\n\r\nif s % 5 == 0 and s > 0:\r\n print(s // 5)\r\nelse:\r\n print(-1)\r\n" ]	{"inputs": ["2 5 4 0 4", "4 5 9 2 1", "0 0 0 0 0", "1 2 1 2 3", "100 0 0 0 0", "2 3 4 5 6", "1 1 1 1 1", "0 1 2 3 4", "100 100 100 100 100", "93 100 99 90 98", "99 99 99 99 99", "99 98 98 99 100", "43 83 1 0 23", "43 83 1 100 23", "57 83 11 4 93", "87 38 19 33 100", "56 0 0 0 4", "0 0 0 0 1", "99 100 100 100 100"], "outputs": ["3", "-1", "-1", "-1", "20", "4", "1", "2", "100", "96", "99", "-1", "30", "50", "-1", "-1", "12", "-1", "-1"]}	UNKNOWN	PYTHON3	CODEFORCES	46
d505dd4a88f3b77f441d522c3490d39d	Well played!	Recently Max has got himself into popular CCG "BrainStone". As "BrainStone" is a pretty intellectual game, Max has to solve numerous hard problems during the gameplay. Here is one of them: Max owns n creatures, i-th of them can be described with two numbers — its health hpi and its damage dmgi. Max also has two types of spells in stock: 1. Doubles health of the creature (hpi := hpi·2); 1. Assigns value of health of the creature to its damage (dmgi := hpi). Spell of first type can be used no more than a times in total, of the second type — no more than b times in total. Spell can be used on a certain creature multiple times. Spells can be used in arbitrary order. It isn't necessary to use all the spells. Max is really busy preparing for his final exams, so he asks you to determine what is the maximal total damage of all creatures he can achieve if he uses spells in most optimal way. The first line contains three integers n, a, b (1<=≤<=n<=≤<=2·105, 0<=≤<=a<=≤<=20, 0<=≤<=b<=≤<=2·105) — the number of creatures, spells of the first type and spells of the second type, respectively. The i-th of the next n lines contain two number hpi and dmgi (1<=≤<=hpi,<=dmgi<=≤<=109) — description of the i-th creature. Print single integer — maximum total damage creatures can deal. Sample Input 2 1 1 10 15 6 1 3 0 3 10 8 7 11 5 2 Sample Output 27 26	[ "from sys import stdin,exit\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Ordenar las criaturas por vida menos daño\nordered_creatures=sorted(range(n),key=lambda i: hp[i]-dmg[i],reverse=True)\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\n#Si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\nfor i in range(0,b):\n max_damage+=max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])\n\n#Si no es una de las primeras b criaturas sumar su daño\nfor i in range(b,n): \n max_damage+=dmg[ordered_creatures[i]]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[ordered_creatures[b-1]],dmg[ordered_creatures[b-1]])-dmg[ordered_creatures[b-1]]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n\n#Si pertenece a las primeras b criaturas restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(0,b): \n max_damage=max(max_damage,aux-max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])+hp[ordered_creatures[i]]2a)\n \n#Si no pertenece a las primeras b criaturas restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \nfor i in range(b,n):\n max_damage=max(max_damage,aux-change-dmg[ordered_creatures[i]]+hp[ordered_creatures[i]]2*a)\n\n#Imprimir el máximo daño total\nprint(max_damage)", "from sys import stdin,exit\n\n#parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#recibiendo los valores de n, a y b\nn,a,b=parser()\nb=min(b,n)\n#inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#recibiendo los parametros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#si no hay hechizos de se solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#ordenar las criaturas por vida menos daño\nordered_creatures=sorted(range(n),key=lambda i: hp[i]-dmg[i],reverse=True)\n\n#inicializando el daño total\nmax_damage=0\n\n#recorriendo las criaturas\nfor i in range(n):\n #si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\n if i < b:\n max_damage+=max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])\n #si no es una de las primeras b criaturas sumar su daño\n else:\n max_damage+=dmg[ordered_creatures[i]]\n\n\naux=max_damage\nchange=max(hp[ordered_creatures[b-1]],dmg[ordered_creatures[b-1]])-dmg[ordered_creatures[b-1]]\n\n#recorriendo las criaturas para ver a cual aplicar los hechizos tipo 1\n\n#si pertenece a las primeras b criaturas restar su potencial daño antes calculado y sumar el daño que causará con los hechizos de tipo 1\n#quedarse con el maximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(0,b): \n max_damage=max(max_damage,aux-max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])+hp[ordered_creatures[i]]2*a)\n \n#si no pertenece a las primeras b criaturas restar el potencial daño de la b-íesima criatura y sumar su daño. Luego eliminar el daño de la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \nfor i in range(b,n):\n max_damage=max(max_damage,aux-change-dmg[ordered_creatures[i]]+hp[ordered_creatures[i]]2*a)\n\n#imprimir el máximo daño total\nprint(max_damage)", "import sys\r\nread=lambda:map(int,sys.stdin.buffer.readline().split())\r\nn,a,b=read()\r\nv=[tuple(read()) for _ in range(n)]\r\nans=0\r\nif b>0:\r\n\tc=[v[x][0]-v[x][1] for x in range(n)]\r\n\tw,r=list(range(n)),[0]n\r\n\tw.sort(key=lambda x:c[x],reverse=True)\r\n\tfor i in range(n): r[w[i]]=i\r\n\tf=True;s=0;m=min(n,b)\r\n\tfor i in range(m):\r\n\t\tk=c[w[i]]\r\n\t\tif k<=0: f=False;m=i;break\r\n\t\ts+=k\r\n\tans=s\r\n\tif a>0:\r\n\t\tfor i in range(n):\r\n\t\t\tk=v[i][0](1<<a)-v[i][1]\r\n\t\t\ttmp=s+k\r\n\t\t\tif r[i]<m:\r\n\t\t\t\ttmp-=c[i]\r\n\t\t\telif f: \r\n\t\t\t\ttmp-=c[w[m-1]]\r\n\t\t\tif tmp>ans: ans=tmp\r\nprint(sum([v[i][1] for i in range(n)])+ans)", "import math\nfrom random import randint\nfrom sys import stdin,exit\n\n#Algoritmo quickselect para resolver el problema de selección\ndef quickselect(arr, k):\n \"\"\"\n Entrada: Lista de elementos comparables y un entero 'k'.\n Salida: k-ésimo elemento más pequeño.\n Complejidad: caso promedio : O(n)\n caso peor: O(n^2)\n \"\"\"\n quick_selected= _kthSmallest(arr, k, 0, len(arr)-1)\n if quick_selected!=math.inf:\n return quick_selected\n else:\n print('k-th element does not exist')\n\n#Algortimo para encontrar el k-ésimo elemento en un intervalo del array\ndef _kthSmallest(arr, k, start, end):\n \"\"\"\n función auxiliar para quickselect\n \"\"\"\n # chequeando si k es una posición válida\n if (k > 0 and k <= end - start + 1): \n \n # Particionando el array con un elemento aleatorio como pivote y obtener la posición del pivote en el array ordenado \n pivot_index = _partition(arr, start, end) \n \n # Si la posición del pivote después de la partición es k devolver el elemento\n if (pivot_index - start == k - 1): \n return arr[pivot_index] \n \n # Si la posición del pivote es mayor que k entonces llamar recursivamente en la partición izquierda al pivote\n if (pivot_index - start > k - 1): \n return _kthSmallest(arr, k, start, pivot_index - 1) \n \n # En caso contrario llamar recursivamente en la partición a la derecha \n return _kthSmallest(arr, k - pivot_index + start - 1, pivot_index + 1, end) \n return math.inf\n\n#Partición\ndef _partition(arr, l, r): \n \"\"\" función privada auxiliar\n Entrada: Una lista y dos enteros: \n l: índice inicial desde donde particionar la lista\n r: índice final hasta donde particionar la lista\n\n Output: índice del pivot después de hacer la partción\n \"\"\"\n # Escoger un elemento aleatorio desde arr[l] hasta arr[r]\n pos=randint(l,r)\n # Intercambiarlo con el último\n arr[pos],arr[r]=arr[r],arr[pos]\n \n \n #Mover todos los elementos menores que iguales que el pivote a su izquierda y los mayores a su derecha\n pivot = arr[r] \n i = l \n for j in range(l, r): \n \n if arr[j] <= pivot: \n arr[i], arr[j] = arr[j], arr[i] \n i += 1\n \n arr[i], arr[r] = arr[r], arr[i]\n \n #Retornar posición del pivote en el array ordenado \n return i\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Arreglo con los valores de dmg[i]-hp[i]. Se hace así porque se quiere el orden descendente y el algoritmo trabaja con orden ascendente\narr=[(dmg[i]-hp[i],i) for i in range(n)]\n\n#obteniendo la b-ésima criatura y la diferencia correspondiente\nminnor_difference,chosen_creature=quickselect(arr,b)\nminnor_difference=-1\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\nfor i in range(n):\n #Si su diferencia es mayor que la de la b-ésima criatura es una de las b primeras \n if hp[i]-dmg[i] > minnor_difference:\n #Ver si es mejor utilizar un hechizo de tipo 2 o no\n max_damage+=max(hp[i],dmg[i])\n #Si su diferencia es igual que la de la b-ésima criatura comparar por índice \n elif hp[i]-dmg[i] == minnor_difference:\n #Si el índice es mayor entonces es una de las n-b últimas criaturas\n if i > chosen_creature:\n #Aporta su daño\n max_damage+=dmg[i]\n #En caso contrario es una de las b primeras\n else:\n #Ver si es mejor utilizar un hechizo de tipo 2 o no\n max_damage+=max(hp[i],dmg[i])\n #Es una de las n-b últimas criaturas\n else:\n #Aporta su daño\n max_damage+=dmg[i]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[chosen_creature],dmg[chosen_creature])-dmg[chosen_creature]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(n):\n #Si su diferencia es mayor que la de la b-ésima criatura es una de las b primeras \n if hp[i]-dmg[i] > minnor_difference:\n #Restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]2a)\n #Si su diferencia es igual que la de la b-ésima criatura comparar por índice \n elif hp[i]-dmg[i] == minnor_difference:\n #Si el índice es mayor entonces es una de las n-b últimas criaturas\n if i > chosen_creature:\n #Restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]2*a) \n #En caso contrario es una de las b primeras\n else:\n #Restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]2*a)\n #Es una de las n-b últimas criaturas\n else:\n #Restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]2*a) \n\n#Imprimir el máximo daño total\nprint(max_damage)", "# python3\r\nfrom sys import stdin\r\n\r\ndef main():\r\n def parseints(line): return tuple(map(int, line.split()))\r\n def bdiff(creature): return max(0, creature[0] - creature[1])\r\n\r\n n, a, b = parseints(input())\r\n hand = list(map(parseints, stdin.readlines()))\r\n\r\n ans = sum(creature[1] for creature in hand) # default damage\r\n if b:\r\n hand.sort(key=bdiff)\r\n\r\n best = 0\r\n if n > b:\r\n lost = bdiff(hand[n - b])\r\n for creature in hand[:n-b]:\r\n best = max(best, (creature[0] << a) - creature[1] - lost)\r\n\r\n for creature in hand[max(0,n-b):]:\r\n best = max(best, (creature[0] << a) - max(creature))\r\n ans += bdiff(creature)\r\n ans += best\r\n\r\n print(ans)\r\n\r\n\r\nmain()", "# coding=utf-8\nfrom sys import stdin\nrd = lambda l: tuple(map(int, l.split()))\nn, a, b = rd(input())\nb = min(n, b)\ns = list(map(rd, stdin.readlines()))\n\nf = lambda x:max(0, x[0]-x[1])\ng = lambda x:(x[0]<<a)-x[1]\nans = sum(x[1] for x in s)\nmid = 0\nif b:\n s.sort(key=f, reverse=True)\n t = sum(f(x) for x in s[:b] )\n for i in range(b):\n mid = max(mid, t-f(s[i])+g(s[i]))\n for i in range(b, n):\n mid = max(mid, t-f(s[b-1])+g(s[i]))\n ans += mid\nprint(ans)\n", "from sys import stdin,exit\nimport heapq\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Ordenar las criaturas por vida menos daño\nheap=[]\nfor i in range(n):\n heap.append((dmg[i]-hp[i],i))\nheapq.heapify(heap)\nminnor_difference,chosen_creature=-1,-1\n\nfor i in range(b):\n minnor_difference , chosen_creature = heapq.heappop(heap)\n minnor_difference=-1\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\n#Si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\nfor i in range(n):\n if hp[i]-dmg[i] > minnor_difference:\n max_damage+=max(hp[i],dmg[i])\n elif hp[i]-dmg[i] == minnor_difference:\n if i > chosen_creature:\n max_damage+=dmg[i]\n else:\n max_damage+=max(hp[i],dmg[i])\n else:\n max_damage+=dmg[i]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[chosen_creature],dmg[chosen_creature])-dmg[chosen_creature]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n\n#Si pertenece a las primeras b criaturas restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(n):\n if hp[i]-dmg[i] >= minnor_difference:\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]2a)\n else:\n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]2**a) \n\n#Imprimir el máximo daño total\nprint(max_damage)", "from sys import stdin\nrd = lambda l: tuple(map(int, l.split()))\nn, a, b = rd(input())\nb = min(b, n)\np = list(map(rd, stdin.readlines()))\nf = lambda x: max(0, x[0] - x[1])\ng = lambda x: (x[0] << a) - x[1]\ns = sum(x[1] for x in p)\ne = 0\nif b:\n p.sort(key=f, reverse=True)\n t = sum(f(x) for x in p[:b])\n for i in range(b):\n e = max(e, t - f(p[i]) + g(p[i]))\n for i in range(b, n):\n e = max(e, t - f(p[b - 1]) + g(p[i]))\n s += e\nprint(s)\n\n \t\t \t \t\t \t \t\t\t \t \t\t\t \t \t\t" ]	{"inputs": ["2 1 1\n10 15\n6 1", "3 0 3\n10 8\n7 11\n5 2", "1 0 0\n2 1", "1 0 200000\n1 2", "7 5 7\n29 25\n84 28\n34 34\n14 76\n85 9\n40 57\n99 88", "7 6 7\n11 75\n61 90\n22 14\n100 36\n29 48\n69 52\n16 3", "7 8 7\n88 29\n30 44\n14 1\n83 95\n73 88\n10 42\n29 26", "12 7 7\n78 189\n614 271\n981 510\n37 762\n803 106\n78 369\n787 54\n768 159\n238 111\n107 54\n207 72\n485 593", "12 20 4\n852 935\n583 820\n969 197\n219 918\n547 842\n615 163\n704 377\n326 482\n183 833\n884 994\n886 581\n909 450", "2 13 2\n208637 682633\n393097 724045", "1 0 200000\n42 1", "1 6 200000\n42 1", "1 0 200000\n1 42", "1 6 200000\n1 42", "3 1 1\n10 9\n8 6\n7 5", "1 1 0\n10 1", "1 1 0\n3 4", "3 20 0\n1 5\n5 1\n5 1", "2 5 1\n10 1\n20 20", "3 20 0\n3 2\n4 3\n5 4", "2 1 0\n10 15\n6 1", "5 10 0\n20 1\n22 1\n30 1\n30 5\n40 6", "1 20 0\n1 5", "2 3 14\n28 5\n32 47", "3 1 2\n20 10\n5 1\n25 25", "2 3 3\n28 5\n32 47", "2 2 1\n10 15\n6 1", "2 1 2\n20 1\n22 23", "10 7 2\n8 6\n5 5\n3 7\n7 7\n3 8\n6 1\n10 9\n4 6\n9 5\n7 9", "3 8 1\n6 6\n7 9\n2 5", "10 4 4\n5 5\n8 1\n10 10\n3 1\n7 10\n1 7\n8 7\n5 9\n3 3\n1 1", "4 8 3\n1 6\n10 10\n4 8\n9 4", "8 18 1\n8 6\n6 8\n1 7\n7 2\n5 1\n10 5\n8 3\n9 3", "2 11 1\n1 4\n1 5", "2 19 2\n9 3\n7 2", "5 13 0\n4 4\n8 10\n1 8\n3 9\n4 6", "5 8 0\n10 7\n6 6\n6 5\n7 9\n10 7", "5 20 2\n1 10\n7 8\n10 1\n6 5\n2 1", "2 1 0\n5 6\n8 8", "7 3 5\n2 6\n5 9\n5 5\n4 10\n5 7\n7 8\n3 10", "10 9 0\n620118469 704168608\n528098892 341451371\n15150469 449838744\n960504540 722185004\n271837337 344050133\n940943201 419522619\n85569623 788965215\n161962866 563795701\n943389281 445744350\n610994199 473866838", "10 11 1\n7 3\n9 4\n1 5\n10 3\n6 1\n10 7\n8 5\n7 6\n1 4\n9 9", "2 1 200000\n44 42\n1000 1001", "5 12 2\n5 9\n8 9\n4 1\n2 5\n1 8", "4 8 1\n9 9\n7 6\n2 4\n6 10", "2 1 1\n292725479 742903381\n239450691 307356865"], "outputs": ["27", "26", "1", "2", "3533", "6720", "22840", "130952", "1016078777", "3220933257", "42", "2688", "42", "64", "31", "1", "4", "7", "641", "9", "16", "14", "5", "284", "71", "284", "41", "64", "1339", "1803", "214", "2583", "2621470", "2053", "4718599", "37", "34", "10485785", "14", "103", "5253588583", "20524", "2044", "32794", "2324", "1221804763"]}	UNKNOWN	PYTHON3	CODEFORCES	8
d50bdeed886902a60096918dfa119f35	Order Book	In this task you need to process a set of stock exchange orders and use them to create order book. An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order. All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders. An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order. An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book. You are given n stock exhange orders. Your task is to print order book of depth s for these orders. The input starts with two positive integers n and s (1<=≤<=n<=≤<=1000,<=1<=≤<=s<=≤<=50), the number of orders and the book depth. Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0<=≤<=pi<=≤<=105) and an integer qi (1<=≤<=qi<=≤<=104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order. Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input. Sample Input 6 2 B 10 3 S 50 2 S 40 1 S 50 6 B 20 4 B 25 10 Sample Output S 50 8 S 40 1 B 25 10 B 20 4	[ "n, s = map(int, input().split())\r\npricesell = dict()\r\npricebuy = dict()\r\nsellp = set()\r\nbuyp = set()\r\nfor i in range(n):\r\n tmp = input().split()\r\n if tmp[0] == \"B\":\r\n if int(tmp[1]) in buyp:\r\n pricebuy[int(tmp[1])] += int(tmp[2])\r\n else:\r\n pricebuy[int(tmp[1])] = int(tmp[2])\r\n buyp.add(int(tmp[1]))\r\n else:\r\n if int(tmp[1]) in sellp:\r\n pricesell[int(tmp[1])] += int(tmp[2])\r\n else:\r\n pricesell[int(tmp[1])] = int(tmp[2])\r\n sellp.add(int(tmp[1]))\r\nbuy = list(pricebuy.items())\r\nsell = list(pricesell.items())\r\nbuy.sort(reverse=True)\r\nsell.sort()\r\nbuy1 = buy[:min(s, len(buy))]\r\nsell1 = sell[:min(s, len(sell))]\r\nsell1.sort(reverse=True)\r\nbuy1 = list(map(lambda x: \"B \" + str(x[0]) + \" \" + str(x[1]), buy1))\r\nsell1 = list(map(lambda x: \"S \" + str(x[0]) + \" \" + str(x[1]), sell1))\r\nprint(sell1, sep=\"\\n\")\r\nprint(buy1, sep=\"\\n\")", "n = [int(i) for i in input().split()]\nbuy = []\nbuyP = []\nsell = []\nsellP = []\nfor i in range(n[0]):\n l = input().split()\n l[1] = int(l[1])\n l[2] = int(l[2])\n if l[0] == 'B':\n l.pop(0)\n buy.append(l)\n buyP.append([l[0]])\n else:\n l.pop(0)\n sell.append(l)\n sellP.append([l[0]])\nfor i in range(len(buyP)-1,-1,-1):\n if buyP.count(buyP[i]) > 1:\n buyP.pop(i)\nfor i in range(len(sellP)-1,-1,-1):\n if sellP.count(sellP[i]) > 1:\n sellP.pop(i)\nbuyP.sort()\nbuyP.reverse()\nsellP.sort()\nfor i in range(len(sellP)):\n sellP[i].append(0)\n sellP[i].append(0)\n for j in sell:\n if sellP[i][0] == j[0]:\n sellP[i][1] = 'S'\n sellP[i][2] += j[1]\n\nfor z in range(min(n[1],len(sellP))-1,-1,-1):\n print('S '+ str(sellP[z][0]) +' '+ str(sellP[z][2]))\n \nfor i in range(len(buyP)):\n buyP[i].append(0)\n buyP[i].append(0)\n for j in buy:\n if buyP[i][0] == j[0]:\n buyP[i][1] = 'B'\n buyP[i][2] += j[1]\nfor z in range(min(n[1],len(buyP))):\n print('B '+ str(buyP[z][0]) +' '+ str(buyP[z][2]))", "n, ss = map(int, input().split())\r\nbuy, send = dict(), dict()\r\nfor i in range(n):\r\n s = list(map(str, input().split()))\r\n c_v = list(map(int, s[1:]))\r\n if s[0] == 'B':\r\n if c_v[0] in buy:\r\n buy[c_v[0]] += c_v[1]\r\n else:\r\n buy[c_v[0]] = c_v[1]\r\n else:\r\n if c_v[0] in send:\r\n send[c_v[0]] += c_v[1]\r\n else:\r\n send[c_v[0]] = c_v[1]\r\nlength_s, length_b = len(send), len(buy)\r\nbuy_ = sorted(buy)[0 if length_b < ss else length_b - ss:]\r\nsend_ = sorted(send)[:min(length_s, ss)]\r\nfor i in range(len(send_) - 1, -1, -1):\r\n print('S', send_[i], send[send_[i]])\r\nfor i in range(len(buy_) - 1, -1, -1):\r\n print('B', buy_[i], buy[buy_[i]])", "n, m = map(int, input().split())\r\nzay = []\r\nzay_fin_B = []\r\nzay_fin_S = []\r\nfor i in range(n):\r\n zay.append(list(input().split()))\r\n zay[-1][1] = int(zay[-1][1])\r\n zay[-1][2] = int(zay[-1][2])\r\nfor i in range(n):\r\n if zay[i] != None:\r\n zay_time = zay[i]\r\n for j in range(i + 1, n): \r\n if zay[i] != None and zay[j] != None and zay[i][0] == zay[j][0] and zay[i][1] == zay[j][1]:\r\n zay_time[2] += zay[j][2]\r\n zay[j] = None\r\n if zay[i] != None:\r\n if zay_time[0] == 'B':\r\n zay_fin_B.append(zay_time)\r\n else:\r\n zay_fin_S.append(zay_time)\r\n zay[i] = None \r\nzay_fin_S.sort()\r\nm_s = 0\r\nans_S = []\r\nfor i in zay_fin_S:\r\n if m_s < m:\r\n ans_S.append(i)\r\n m_s += 1\r\nans_S.reverse()\r\nzay_fin_B.sort(reverse=True)\r\nm_b = 0\r\nans_B = []\r\nfor i in zay_fin_B:\r\n if m_b < m:\r\n ans_B.append(i)\r\n m_b += 1\r\nfor i in ans_S:\r\n print(i)\r\nfor i in ans_B:\r\n print(i)", "from collections import defaultdict\n\nclass OrderBook():\n\t@staticmethod\n\tdef _dict():\n\t\treturn defaultdict(int)\n\n\tdef __init__(self):\n\t\tself._buy, self._sell = OrderBook._dict(), OrderBook._dict()\n\n\t@staticmethod\n\tdef _add(book, price, volume):\n\t\tbook[price] += volume\n\n\tdef add_buy(self, price, volume):\n\t\tOrderBook._add(self._buy, price, volume)\n\n\tdef add_sell(self, price, volume):\n\t\tOrderBook._add(self._sell, price, volume)\n\n\t@staticmethod\n\tdef _entry(label, price, volume):\n\t\treturn '%s %d %d' % (label, price, volume)\n\n\tdef _get(self, book, label, start, end):\n\t\tkeys = sorted(book.keys(), reverse=True)[start:end]\n\t\treturn [OrderBook._entry(label, p, book[p]) for p in keys]\n\n\tdef get_buy(self, s):\n\t\treturn self._get(self._buy, 'B', 0, s)\n\n\tdef get_sell(self, s):\n\t\treturn self._get(self._sell, 'S', -s, len(self._sell))\n\ndef record(line):\n\td, p, q = line\n\treturn d, int(p), int(q)\n\nn, s = map(int, input().split())\nbook = OrderBook()\nfor _ in range(n):\n\td, p, q = record(input().split())\n\tif d == 'B':\n\t\tbook.add_buy(p, q)\n\telse:\n\t\tbook.add_sell(p, q)\nprint('\\n'.join(book.get_sell(s) + book.get_buy(s)))\n", "n, s = map(int, input().split())\r\n\r\norders = [{}, {}]\r\nfor _ in range(n):\r\n d, p, q = input().split()\r\n p, q = map(int, (p,q))\r\n orders[d=='B'][p] = orders[d=='B'].get(p,0) + q\r\n\r\norders[0] = sorted(orders[0].items())\r\norders[1] = sorted(orders[1].items(), reverse=True)\r\nfor p, q in reversed(orders[0][:s]):\r\n print('S',p, q)\r\nfor p, q in orders[1][:s]:\r\n print('B',p, q)", "a,b=map(int,input().split())\r\nbs,s={},{}\r\nfor _ in \" \"a:\r\n x,y,z=input().split()\r\n y,z=int(y),int(z)\r\n if x=='B':\r\n if y in bs:bs[y]+=z\r\n else:bs[y]=z\r\n else:\r\n if y in s:s[y]+=z\r\n else:s[y]=z\r\nz=[['S',i,s[i]] for i in sorted(s)][:b][::-1]\r\nz1=[['B',i,bs[i]] for i in sorted(bs,reverse=True)][:b]\r\nfor i in z:print(i)\r\nfor i in z1:print(i)", "from collections import \nfrom itertools import \nfrom random import \nfrom bisect import \nfrom string import \nfrom queue import \nfrom heapq import \nfrom math import \nfrom re import \nfrom sys import \ndef fast(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in fast().split()]\n\n\nz, zz = input, lambda: list(map(int, z().split()))\nszz, graph, mod, szzz = lambda: sorted(\n zz()), {}, 109 + 7, lambda: sorted(zzz())\n\n\ndef lcd(xnum1, xnum2): return (xnum1 xnum2 // gcd(xnum1, xnum2))\ndef output(answer): stdout.write(str(answer))\n\n\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\n\n\n###########################---Test-Case---#################################\n\"\"\"\n\nIf you Know me , Then you probably don't know me !\n\n\"\"\"\n###########################---START-CODING---##############################\n\n\norders = {'B': {}, 'S': {}}\nn, s = zzz()\nfor x in range(n):\n d, p, q = map(str, input().split())\n p, q = int(p), int(q)\n try:\n orders[d][p] += q\n except:\n orders[d][p] = q\n\nfor p in list(reversed(list(sorted(orders['S']))[:s])):\n print('S', p, orders['S'][p])\nfor p in list(reversed(sorted(orders['B'])))[:s]:\n print('B', p, orders['B'][p])\n", "n,s = map(int,input().split())\ndic1 = {}\ndic2 = {}\narray = []\nfor i in range(n):\n\ta,b,c = input().split()\n\tb = int(b)\n\tc = int(c)\n\tif a == \"B\":\n\t\tdic1[b] = dic1.get(b,0) + c\n\telse:\n\t\tdic2[b] = dic2.get(b,0) + c\nbuy_list = sorted(dic1.items(),reverse=True)[:s]\t\nsell_list = reversed(sorted(dic2.items())[:s])\nfor k,v in sell_list:\n\tprint(\"S\",k,v)\nfor k,v in buy_list:\n\tprint(\"B\",k,v)\n\t \t\t \t\t \t\t \t\t \t\t\t\t \t \t\t\t\t", "n, s = map(int, input().split())\r\n\r\nbuying = []\r\nselling = []\r\n\r\nfor o in range(n):\r\n\r\n ord = input().split()\r\n\r\n if ord[0] == 'B':\r\n buying.append([int(ord[1]), int(ord[2]), ord[0]])\r\n\r\n else:\r\n selling.append([int(ord[1]), int(ord[2]), ord[0]])\r\n\r\npricesbuy = {}\r\npricessell = {}\r\n\r\nfor x in buying:\r\n pricesbuy[x[0]] = 0\r\n\r\nfor y in selling:\r\n pricessell[y[0]] = 0\r\n\r\nfor x in buying:\r\n pricesbuy[x[0]] += x[1]\r\n\r\nfor y in selling:\r\n pricessell[y[0]] += y[1]\r\n\r\nbuyfin = []\r\nsellfin = []\r\n\r\nfor k in pricesbuy:\r\n\r\n buyfin.append([k, pricesbuy[k]])\r\n\r\nfor k in pricessell:\r\n\r\n sellfin.append([k, pricessell[k]])\r\n\r\nbuyfin.sort(reverse=True)\r\nsellfin.sort()\r\n\r\nbuyfinfin = []\r\nsellfinfin = []\r\n\r\nfor x in range(min(len(sellfin), s)):\r\n\r\n sellfinfin.append(sellfin[x])\r\n\r\nfor x in range(min(len(buyfin), s)):\r\n\r\n buyfinfin.append(buyfin[x])\r\n\r\nbuyfinfin.sort(reverse=True)\r\nsellfinfin.sort(reverse=True)\r\n\r\nfor x in range(min(len(sellfinfin), s)):\r\n print('S' + ' ' + str(sellfinfin[x][0]) + ' ' + str(sellfinfin[x][1]))\r\n\r\nfor x in range(min(len(buyfinfin), s)):\r\n print('B' + ' ' + str(buyfinfin[x][0]) + ' ' + str(abs(buyfinfin[x][1])))\r\n\r\n# print(buyfinfin, sellfinfin, buyfin, sellfin)", "n,s = list(map(int,input().split()))\r\nsell,buy = [],[]\r\n\r\nfor i in range(100003):\r\n sell.append(0)\r\n buy.append(0)\r\n\r\nfor i in range(n):\r\n x,y,z = input().split();\r\n if x =='B':\r\n buy[int(y)] += int(z)\r\n else:\r\n sell[int(y)] += int(z)\r\n \r\nx,y = 0,0\r\nwhile x < s and y <= 100000:\r\n if sell[y] > 0:\r\n x += 1\r\n y += 1\r\n \r\nwhile y >= 0:\r\n if sell[y] > 0:\r\n print('S' , y , sell[y])\r\n y -= 1\r\n \r\nx,y = 0,100000\r\nwhile x < s and y >= 0:\r\n if buy[y] > 0:\r\n x += 1\r\n print('B' , y , buy[y])\r\n y -= 1", "n,k= map(int, input().split())\r\nbb={}\r\nss={}\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if a==\"B\":\r\n if b in bb:\r\n bb[b]+=int(c)\r\n else:\r\n bb[b]=int(c)\r\n else:\r\n if b in ss:\r\n ss[b]+=int(c)\r\n else:\r\n ss[b]=int(c)\r\nbuy=sorted(bb.items(),reverse=True)[:k]\r\nsell=reversed(sorted(ss.items())[:k])\r\nfor pi,qi in sell:\r\n print(\"S\",pi,qi)\r\nfor pi,qi in buy:\r\n print(\"B\",pi,qi)", "R = lambda: map(int, input().split())\r\nn, s = R()\r\nbs, ss = [0] * 100007, [0] * 100007\r\nfor _ in range(n):\r\n t, p, q = input().split()\r\n p, q = int(p), int(q)\r\n arr = bs if t == 'B' else ss\r\n arr[p] += q\r\nbres, sres = [], []\r\nfor i in range(1, 10 5 + 1):\r\n if ss[i] and len(sres) < s:\r\n sres.append('S ' + str(i) + ' ' + str(ss[i]))\r\nfor i in range(10 5, -1, -1):\r\n if bs[i] and len(bres) < s:\r\n bres.append('B ' + str(i) + ' ' + str(bs[i]))\r\nfor x in sres[::-1]:\r\n print(x)\r\nfor x in bres:\r\n print(x)", "# coding=utf-8\n\nn, s = map(int, input().split())\nbuy = {}\nsell = {}\nfor i in range(n):\n r = input().split()\n d = r[0]\n p = int(r[1])\n v = int(r[2])\n if d == 'S':\n sell[p] = sell.get(p, 0) + v\n else:\n buy[p] = buy.get(p, 0) + v\nfor order in sorted(sell.items(), reverse=True)[-s:]:\n print('S %s %s' % (order[0], order[1]))\nfor order in sorted(buy.items(), reverse=True)[:s]:\n print('B %s %s' % (order[0], order[1]))\n", "n, ss = map(int, input().split())\r\nb = list()\r\ns = list()\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == 'B':\r\n b.append(list(map(int, a[1:])))\r\n else:\r\n s.append(list(map(int, a[1:])))\r\n\r\nb.sort(key=lambda x: x[0], reverse=True)\r\ns.sort(key=lambda x: x[0], reverse=True)\r\n\r\nk = 0\r\nfor i in range(len(b) - 1):\r\n try:\r\n if b[i-k][0] == b[i-k + 1][0]:\r\n b[i-k + 1][1] += b[i-k][1]\r\n b.pop(i-k)\r\n k += 1\r\n except(IndexError):\r\n break\r\nk = 0\r\nfor i in range(len(s) - 1):\r\n try:\r\n if s[i - k][0] == s[i - k + 1][0]:\r\n s[i - k + 1][1] += s[i-k][1]\r\n s.pop(i-k)\r\n k+=1\r\n except(IndexError):\r\n break\r\n\r\nif ss < len(s):\r\n s = s[len(s) - ss:]\r\nfor i in range(len(s)):\r\n print('S', s[i])\r\nfor i in range(min(len(b), ss)):\r\n print('B', b[i])\r\n", "n, s = map(int, input().split())\r\nbuy = dict()\r\nsell = dict()\r\nfor i in range(n):\r\n d, p, q = map(str, input().split())\r\n p = int(p)\r\n q = int(q)\r\n if d == 'B':\r\n if p in buy:\r\n buy[p] += q\r\n else:\r\n buy[p] = q\r\n else:\r\n if p in sell:\r\n sell[p] += q\r\n else:\r\n sell[p] = q \r\nbk = list(buy.keys())\r\nbv = list(buy.values())\r\nbl = list(zip(bk, bv))\r\nsk = list(sell.keys())\r\nsv = list(sell.values())\r\nsl = list(zip(sk, sv))\r\nbl.sort(reverse = True)\r\nsl.sort()\r\nbb = len(bl)\r\nss = len(sl)\r\n\r\nif s > ss:\r\n sl.sort(reverse = True)\r\n for i in range(ss):\r\n print('S', sl[i][0], sl[i][1])\r\nelse:\r\n sl.sort()\r\n for i in range(s - 1, -1, -1):\r\n print('S', sl[i][0], sl[i][1]) \r\n \r\nif s > bb:\r\n for i in range(bb):\r\n print('B', bl[i][0], bl[i][1])\r\nelse:\r\n for i in range(s):\r\n print('B', bl[i][0], bl[i][1]) ", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n, s = map(int, input().split())\n\n buy = collections.Counter()\n sell = collections.Counter()\n for _ in range(n):\n d, p, q = input().split()\n p = int(p)\n q = int(q)\n if d == 'B':\n buy[p] += q\n else:\n sell[p] += q\n\n buy = buy.most_common()\n buy.sort(reverse=True)\n buy = buy[:s]\n\n sell = sell.most_common()\n sell.sort()\n sell = sell[:s]\n sell.reverse()\n\n for p, q in sell:\n print('S', p, q)\n for p, q in buy:\n print('B', p, q)\n\n\nif __name__ == '__main__':\n solve()\n\n", "s = input()\r\nn, d = int(s.split()[0]), int(s.split()[1])\r\nb, s = {}, {}\r\nwb, ws = [], []\r\nfor i in range(0, n):\r\n\tst = input().split()\r\n\tst[1] = int(st[1])\r\n\tst[2] = int(st[2])\r\n\tif st[0] == 'B':\r\n\t\tif st[1] not in b:\r\n\t\t\tb[st[1]] = st[2]\r\n\t\telse:\r\n\t\t\tb[st[1]] += st[2];\r\n\t\tif st[1] not in wb:\r\n\t\t\twb.append(st[1]);\r\n\telse:\r\n\t\tif st[1] not in s:\r\n\t\t\ts[st[1]] = st[2]\r\n\t\telse:\r\n\t\t\ts[st[1]] += st[2];\r\n\t\tif st[1] not in ws:\r\n\t\t\tws.append(st[1]);\r\nws.sort()#[:d]#.sort(reverse=True)\r\nwb.sort(reverse=True)#[:d]\r\nws = ws[:d]\r\nwb = wb[:d]\r\nws.sort(reverse=True)\r\nfor i in ws:\r\n\tprint('S %s %s' %(i, s[i]))\r\nfor i in wb:\r\n\tprint('B %s %s' %(i, b[i]))", "read = lambda: map(int, input().split())\r\nn, s = read()\r\nS = {}\r\nB = {}\r\nfor i in range(n):\r\n\td, p, q = input().split()\r\n\tp, q = int(p), int(q)\r\n\tif d == 'S':\r\n\t\tif S.get(p) is None:\r\n\t\t\tS[p] = q\r\n\t\telse:\r\n\t\t\tS[p] += q\r\n\telse:\r\n\t\tif B.get(p) is None:\r\n\t\t\tB[p] = q\r\n\t\telse:\r\n\t\t\tB[p] += q\r\nlens = min(s, len(S))\r\nlenb = min(s, len(B))\r\nS1 = list(reversed(sorted(S)[:lens]))\r\nB1 = sorted(B, reverse = True)[:lenb]\r\n\r\nfor i in range(lens):\r\n\tprint('S', S1[i], S[S1[i]])\r\nfor i in range(lenb):\r\n\tprint('B', B1[i], B[B1[i]])", "n,s = [int(x) for x in input().split()]\r\nbuy_dict = {}\r\nsell_dict = {}\r\nfor i in range(n):\r\n\tchtype,pi,di = input().split()\r\n\tpi = int(pi)\r\n\tdi = int(di)\r\n\tif chtype=='B':\r\n\t\tbuy_dict[pi] = buy_dict.get(pi,0)+di\r\n\telse:\r\n\t\tsell_dict[pi] = sell_dict.get(pi,0)+di\r\nbuy_list = sorted(buy_dict.items(),reverse=True)[:s]\r\nsell_list = reversed(sorted(sell_dict.items())[:s])\r\nfor pi,qi in sell_list:\r\n\tprint('S',pi,qi)\r\nfor pi,qi in buy_list:\r\n\tprint('B',pi,qi)", "#order book\nfrom collections import defaultdict\nn, s = input().split()\nn, s = int(n), int(s)\n\nb_orders = defaultdict(int)\ns_orders = defaultdict(int)\n\nfor _ in range(n):\n d, p, q = input().split()\n p, q = int(p), int(q)\n\n if d == \"B\":\n b_orders[p] += q\n else:\n s_orders[p] += q\n\nb_orders = list(sorted(b_orders.items(), reverse=True))\ns_orders = list(sorted(s_orders.items(), reverse=True))\n\nbeg = max(0, len(s_orders)-s)\nfor order in s_orders[beg:]:\n print(\"S\", order[0], order[1])\n\nend = min(len(b_orders), s)\nfor order in b_orders[:end]:\n print(\"B\", order[0], order[1])", "n, s = map(int, input().split())\ndic = {'B':{}, 'S':{}}\nfor i in range(n):\n d, p, q = list(input().split(' '))\n p, q = int(p), int(q)\n dic[d][p] = dic[d].get(p, 0) + q\nfor k in sorted(dic['S'], reverse=True)[-s:]:\n print('S', k, dic['S'][k])\nfor k in sorted(dic['B'], reverse=True)[:s]:\n print('B', k, dic['B'][k])\n\n\t\t\t \t \t\t\t\t\t \t \t \t", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, s = map(int, input().split())\r\nbuy = {}\r\nsell = {}\r\n\r\nfor _ in range(n):\r\n mov, p, q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n\r\n if mov == 'B':\r\n buy[p] = buy.get(p, 0) + q\r\n else:\r\n sell[p] = sell.get(p, 0) + q\r\n\r\n\r\nbkeys = sorted(buy.keys(), reverse=True)[:s]\r\nskeys = sorted(sell.keys())[:s]\r\n\r\nfor key in reversed(skeys):\r\n stdout.write(\"S {} {}\\n\".format(key, sell[key]))\r\n\r\nfor key in bkeys:\r\n stdout.write(\"B {} {}\\n\".format(key, buy[key]))", "n, s = map(int, input().split())\n\nbuy = {}\nsell = {}\n\nfor i in range(n):\n a = input().split()\n a[1] = int(a[1])\n a[2] = int(a[2])\n \n if a[0] == \"B\":\n buy[a[1]] = buy.get(a[1], 0) + a[2]\n else:\n sell[a[1]] = sell.get(a[1], 0) + a[2]\n\nbuy = list(buy.items())\nsell = list(sell.items())\n\nsell.sort()\nbuy.sort()\n\nsell = sell[:s]\nbuy = buy[-s:]\n\nsell.reverse()\nbuy.reverse()\n\nfor i in sell:\n\tprint(\"S\", i[0], i[1])\n\nfor i in buy:\n\tprint(\"B\", i[0], i[1])\n\n", "n, s = tuple(map(int, input().split()))\r\n\r\nagr = dict()\r\nfor i in range(n):\r\n arr = input().split()\r\n arr[1] = int(arr[1])\r\n arr[2] = int(arr[2])\r\n agr[(arr[0], arr[1])] = agr.get((arr[0], arr[1]), 0) + arr[2]\r\n\r\nsell, buy = [], []\r\nfor elem in agr:\r\n if elem[0] == 'B':\r\n buy.append([elem[1], agr[elem]])\r\n else:\r\n sell.append([elem[1], agr[elem]])\r\n\r\nsell.sort(key = lambda x: x[0])\r\nbuy.sort(key = lambda x: x[0], reverse = True)\r\n\r\nbuy = buy[:s]\r\nsell = sell[:s]\r\n\r\nsell.sort(key = lambda x: x[0], reverse = True)\r\n\r\nfor elem in sell:\r\n print('S', elem[0], elem[1])\r\nfor elem in buy:\r\n print('B', elem[0], elem[1])\r\n", "# your code goes here\r\n\r\nn,s = map(int, input().split()) \r\nbuys = {}\r\nsells = {}\r\nfor _ in range(n): \r\n\tc,a,b = input().split()\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tif c == \"B\": \r\n\t\tif a in buys: buys[a] = buys[a]+b\r\n\t\telse: buys[a]=b \r\n\telse:\r\n\t\tif a in sells: sells[a] = sells[a]+b\r\n\t\telse: sells[a]=b \r\n\t\t\r\nbuys = sorted(list(buys.items()), reverse=True)[:s]\r\nsells = sorted(list(sells.items()))[:s]\r\nsells.reverse()\r\nfor i in sells: \r\n\tprint('S', i[0],i[1])\r\nfor i in buys: \r\n\tprint('B', i[0],i[1])\r\n\r\n\r\n\r\n", "n, s = map(int, input().split())\r\nbuys = dict()\r\nsell = dict()\r\nfor _ in range(n):\r\n f = input().split()\r\n if (f[0] == \"B\"):\r\n buys[int(f[1])] = buys.get(int(f[1]), 0) + int(f[2])\r\n else:\r\n sell[int(f[1])] = sell.get(int(f[1]), 0) + int(f[2])\r\nbres = sorted(buys.keys(), reverse = True)\r\nsres = sorted(sell.keys())\r\nif bres:\r\n bs = bres[min(s - 1, len(bres) - 1)]\r\nif sres:\r\n ss = sres[min(s - 1, len(sres) - 1)]\r\n for key in sorted(sell.keys(), reverse = True):\r\n if (key <= ss):\r\n print(\"S\", key, sell[key])\r\nif bres:\r\n bs = bres[min(s - 1, len(bres) - 1)]\r\n for key in sorted(buys.keys(), reverse = True):\r\n if (key >= bs):\r\n print(\"B\", key, buys[key])", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\n# Guide:\n# 1. construct complex data types while reading (e.g. graph adj list)\n# 2. avoid any non-necessary time/memory usage\n# 3. avoid templates and write more from scratch\n# 4. switch to \"flat\" implementations\n\ndef VI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LIST(n,m=None): return [0]n if m is None else [[0]m for i in range(n)]\n\n\ndef main(info=0):\n n,s = VI()\n d,p,q = LIST(n), LIST(n), LIST(n)\n db = {}\n ds = {}\n for i in range(n):\n d[i], p[i], q[i] = input().split()\n p = [int(x) for x in p]\n q = [int(x) for x in q]\n for i in range(n):\n if d[i]=='B':\n if p[i] in db:\n db[p[i]] = db[p[i]] + q[i]\n else:\n db[p[i]] = q[i]\n if d[i]=='S':\n if p[i] in ds:\n ds[p[i]] = ds[p[i]] + q[i]\n else:\n ds[p[i]] = q[i]\n lb = sorted(list(db.items()))[::-1][:s]\n ls = sorted(list(ds.items()))[:s][::-1]\n\n for k,v in ls:\n print(\"S {} {}\".format(k,v))\n for k,v in lb:\n print(\"B {} {}\".format(k,v))\n\n\nif __name__ == \"__main__\":\n main()\n", "n, s2 = map(int, input().split())\r\nb = {}\r\ns = {}\r\nb1 = set()\r\ns1 = set()\r\nfor i in range(n):\r\n v = list(map(str, input().split()))\r\n if v[0] == 'B':\r\n if v[1] in b1:\r\n b[v[1]] += int(v[2])\r\n else:\r\n b[v[1]] = int(v[2])\r\n b1.add(v[1])\r\n if v[0] == 'S':\r\n if v[1] in s1:\r\n s[v[1]] += int(v[2])\r\n else:\r\n s[v[1]] = int(v[2])\r\n s1.add(v[1])\r\nansb = []\r\nanss = []\r\n\r\nfor i, j in b.items():\r\n ansb.append((int(i), int(j)))\r\nansb.sort(reverse = True)\r\n\r\nfor i, j in s.items():\r\n anss.append((int(i), int(j)))\r\nanss.sort()\r\nk = len(ansb)\r\np = len(anss)\r\ni = 0\r\nj = min(s2 - 1, p - 1)\r\ns1 = s2\r\n\r\nwhile s1 > 0 and p > 0:\r\n print('S', anss[j][0], anss[j][1])\r\n j -= 1\r\n s1 -= 1\r\n p -= 1\r\n\r\n\r\nwhile s2 > 0 and k > 0:\r\n print('B', ansb[i][0], ansb[i][1])\r\n k -= 1\r\n s2 -= 1\r\n i += 1", "n,s = [int(x) for x in input().split()]\nbuy_dict = {}\nsell_dict = {}\nfor i in range(n):\n\tchtype,pi,di = input().split()\n\tpi = int(pi)\n\tdi = int(di)\n\tif chtype=='B':\n\t\tbuy_dict[pi] = buy_dict.get(pi,0)+di\n\telse:\n\t\tsell_dict[pi] = sell_dict.get(pi,0)+di\nbuy_list = sorted(buy_dict.items(),reverse=True)[:s]\nsell_list = reversed(sorted(sell_dict.items())[:s])\nfor pi,qi in sell_list:\n\tprint('S',pi,qi)\nfor pi,qi in buy_list:\n\tprint('B',pi,qi)\n" ]	{"inputs": ["6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10", "2 1\nB 7523 5589\nS 69799 1711", "1 1\nB 48259 991", "1 50\nB 47828 7726", "1 1\nS 95992 7257", "1 50\nS 72218 8095", "2 50\nB 758 9290\nS 86168 3367", "3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905", "6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1", "2 2\nS 1 1\nB 0 2", "2 1\nS 10 1\nB 0 1", "2 10\nB 0 1\nS 100000 1", "2 1\nS 1 1\nB 0 1", "2 1\nB 0 100\nS 1 100", "2 2\nB 0 3\nS 10 3", "2 10\nB 0 1\nS 1 1", "2 50\nB 2 5\nB 0 1"], "outputs": ["S 50 8\nS 40 1\nB 25 10\nB 20 4", "S 69799 1711\nB 7523 5589", "B 48259 991", "B 47828 7726", "S 95992 7257", "S 72218 8095", "S 86168 3367\nB 758 9290", "S 76276 1905\nS 60238 4895\nB 5878 1568", "S 1 3\nB 0 3", "S 1 1\nB 0 2", "S 10 1\nB 0 1", "S 100000 1\nB 0 1", "S 1 1\nB 0 1", "S 1 100\nB 0 100", "S 10 3\nB 0 3", "S 1 1\nB 0 1", "B 2 5\nB 0 1"]}	UNKNOWN	PYTHON3	CODEFORCES	30
d51744512d657fc8c49daa2a291bf799	Property	Bill is a famous mathematician in BubbleLand. Thanks to his revolutionary math discoveries he was able to make enough money to build a beautiful house. Unfortunately, for not paying property tax on time, court decided to punish Bill by making him lose a part of his property. Bill’s property can be observed as a convex regular 2n-sided polygon A0 A1... A2n<=-<=1 A2n,<= A2n<==<= A0, with sides of the exactly 1 meter in length. Court rules for removing part of his property are as follows: - Split every edge Ak Ak<=+<=1,<= k<==<=0... 2n<=-<=1 in n equal parts of size 1<=/<=n with points P0,<=P1,<=...,<=Pn<=-<=1 - On every edge A2k A2k<=+<=1,<= k<==<=0... n<=-<=1 court will choose one point B2k<==<= Pi for some i<==<=0,<=...,<= n<=-<=1 such that - On every edge A2k<=+<=1A2k<=+<=2,<= k<==<=0...n<=-<=1 Bill will choose one point B2k<=+<=1<==<= Pi for some i<==<=0,<=...,<= n<=-<=1 such that - Bill gets to keep property inside of 2n-sided polygon B0 B1... B2n<=-<=1 Luckily, Bill found out which B2k points the court chose. Even though he is a great mathematician, his house is very big and he has a hard time calculating. Therefore, he is asking you to help him choose points so he maximizes area of property he can keep. The first line contains one integer number n (2<=≤<=n<=≤<=50000), representing number of edges of 2n-sided polygon. The second line contains n distinct integer numbers B2k (0<=≤<=B2k<=≤<=n<=-<=1,<= k<==<=0... n<=-<=1) separated by a single space, representing points the court chose. If B2k<==<=i, the court chose point Pi on side A2k A2k<=+<=1. Output contains n distinct integers separated by a single space representing points B1,<=B3,<=...,<=B2n<=-<=1 Bill should choose in order to maximize the property area. If there are multiple solutions that maximize the area, return any of them. Sample Input 3 0 1 2 Sample Output 0 2 1	[ "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nb = []\r\nfor i in range(0, n-1):\r\n b.append((a[i]-(n-a[i+1]), i))\r\nb.append((a[n-1]-(n-a[0]), n-1))\r\nb = sorted(b)\r\nans = n*[0]\r\nfor i in range(n):\r\n # the line segment at index b[i][1]\r\n ans[b[i][1]] = i\r\nfor i in range(n):\r\n print(ans[i], end = ' ')\r\n" ]	{"inputs": ["3\n0 1 2", "10\n0 1 2 3 4 5 6 7 8 9", "10\n1 7 3 6 8 2 4 5 0 9", "10\n4 9 7 2 3 5 6 1 8 0", "5\n1 2 3 0 4", "5\n3 0 2 1 4", "5\n2 4 3 0 1", "17\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16", "17\n5 13 12 8 4 7 15 6 0 1 2 10 9 14 3 16 11", "17\n7 10 12 11 13 0 9 6 4 2 15 3 5 8 14 16 1", "50\n15 14 37 47 44 7 1 0 39 18 26 25 24 48 4 41 33 12 31 45 43 5 16 23 8 49 34 35 29 2 9 40 36 11 27 46 17 38 19 6 28 21 32 13 22 42 10 20 30 3", "50\n28 37 42 14 19 23 35 25 22 30 36 12 4 46 38 29 41 2 24 43 7 21 11 13 32 48 0 6 1 40 49 16 15 8 20 10 9 34 45 31 17 5 47 26 33 44 27 18 3 39", "50\n48 24 13 25 40 2 41 17 35 0 28 29 37 10 6 5 36 12 46 21 23 33 15 45 18 16 47 19 20 22 8 30 7 1 31 49 27 4 43 14 11 38 39 34 9 44 32 3 26 42", "100\n54 93 37 83 59 66 74 19 6 75 76 81 41 97 22 86 80 13 55 3 32 40 18 96 95 44 33 53 79 88 28 70 63 35 25 38 85 36 58 98 87 12 52 0 16 61 17 72 46 62 31 20 43 34 4 7 60 15 73 1 78 48 69 30 8 14 94 84 91 27 2 64 57 42 71 51 29 89 5 11 26 90 99 77 68 82 24 65 23 21 67 92 47 10 56 49 9 45 39 50", "100\n10 35 37 66 56 68 22 41 52 36 3 90 32 20 0 43 75 59 40 25 97 94 8 91 33 26 79 69 78 49 72 53 61 15 65 82 76 58 4 17 73 99 92 31 95 85 96 98 27 62 74 51 21 14 63 80 11 16 64 57 84 30 86 42 2 60 29 19 81 23 83 87 71 38 54 13 5 48 39 55 6 24 18 9 12 46 89 1 77 28 50 45 88 67 93 70 47 7 44 34", "100\n60 61 7 27 72 82 46 3 65 67 29 90 68 37 36 31 38 80 79 15 19 47 42 70 54 33 83 30 35 69 59 78 18 17 40 62 20 5 57 26 2 98 9 63 16 81 6 86 77 91 92 32 28 94 52 45 21 71 73 76 74 50 34 4 23 25 1 39 41 95 48 84 51 85 58 43 99 97 56 8 88 75 96 11 55 13 10 53 87 0 44 12 24 14 66 22 89 49 93 64", "100\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 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", "2\n1 0"], "outputs": ["0 2 1", "0 1 2 3 5 6 7 8 9 4", "2 6 5 9 7 1 4 0 3 8", "8 9 6 1 4 7 2 5 3 0", "1 3 0 2 4", "2 0 1 3 4", "3 4 2 0 1", "0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 8", "8 15 11 5 3 13 12 2 0 1 4 9 14 7 10 16 6", "8 12 14 15 6 3 7 4 0 9 11 2 5 13 16 10 1", "6 27 47 49 28 1 0 15 34 17 29 25 41 30 20 43 19 16 44 48 22 4 14 9 35 46 40 38 8 2 24 45 21 13 42 37 33 36 5 11 23 32 18 12 39 31 7 26 10 3", "34 45 30 14 17 31 33 22 28 36 25 2 26 48 37 40 19 8 38 27 10 13 7 21 47 24 0 1 15 49 35 12 6 9 11 3 18 46 43 23 5 29 42 32 44 41 20 4 16 39", "43 13 15 38 19 21 33 28 11 4 31 39 24 2 1 17 26 34 41 22 30 25 35 36 9 37 40 16 18 6 14 12 0 8 48 45 7 23 32 3 27 47 44 20 29 46 10 5 42 49", "86 77 69 84 75 83 46 4 35 88 90 72 80 68 57 92 45 25 17 6 26 16 61 99 81 31 37 78 93 62 50 79 49 18 20 74 70 48 89 97 53 21 12 2 30 32 43 65 58 44 11 19 29 9 0 24 28 40 27 33 76 64 52 8 3 59 96 94 66 5 23 71 51 60 73 34 67 47 1 7 63 98 95 85 87 56 42 39 10 38 91 82 14 22 55 15 13 36 41 54", "13 28 53 66 70 42 24 46 37 8 45 67 16 1 10 63 79 50 25 68 97 52 49 71 20 55 87 85 76 64 72 59 29 35 86 89 80 23 3 41 94 98 69 75 95 96 99 73 39 82 74 27 7 30 84 43 5 34 65 83 60 61 77 12 22 38 14 51 54 57 93 90 58 44 26 0 17 36 47 21 6 9 4 2 19 81 40 33 56 32 48 78 88 91 92 62 18 15 31 11", "65 28 6 51 90 71 14 27 73 48 64 92 56 31 25 29 63 93 45 5 24 42 60 67 40 62 61 21 55 72 78 47 7 16 54 35 1 18 36 4 52 57 30 32 50 39 44 94 96 98 68 17 66 86 49 23 43 85 87 88 69 37 10 3 13 2 11 34 76 83 74 75 77 84 53 81 99 89 20 46 95 97 58 22 26 0 19 80 38 12 15 8 9 33 41 59 79 82 91 70", "0 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 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 49", "1 0"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d536f2dd4edadb347b7f5b76e5bebc9f	Shower Line	Many students live in a dormitory. A dormitory is a whole new world of funny amusements and possibilities but it does have its drawbacks. There is only one shower and there are multiple students who wish to have a shower in the morning. That's why every morning there is a line of five people in front of the dormitory shower door. As soon as the shower opens, the first person from the line enters the shower. After a while the first person leaves the shower and the next person enters the shower. The process continues until everybody in the line has a shower. Having a shower takes some time, so the students in the line talk as they wait. At each moment of time the students talk in pairs: the (2i<=-<=1)-th man in the line (for the current moment) talks with the (2i)-th one. Let's look at this process in more detail. Let's number the people from 1 to 5. Let's assume that the line initially looks as 23154 (person number 2 stands at the beginning of the line). Then, before the shower opens, 2 talks with 3, 1 talks with 5, 4 doesn't talk with anyone. Then 2 enters the shower. While 2 has a shower, 3 and 1 talk, 5 and 4 talk too. Then, 3 enters the shower. While 3 has a shower, 1 and 5 talk, 4 doesn't talk to anyone. Then 1 enters the shower and while he is there, 5 and 4 talk. Then 5 enters the shower, and then 4 enters the shower. We know that if students i and j talk, then the i-th student's happiness increases by gij and the j-th student's happiness increases by gji. Your task is to find such initial order of students in the line that the total happiness of all students will be maximum in the end. Please note that some pair of students may have a talk several times. In the example above students 1 and 5 talk while they wait for the shower to open and while 3 has a shower. The input consists of five lines, each line contains five space-separated integers: the j-th number in the i-th line shows gij (0<=≤<=gij<=≤<=105). It is guaranteed that gii<==<=0 for all i. Assume that the students are numbered from 1 to 5. Print a single integer — the maximum possible total happiness of the students. Sample Input 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 43 21 18 2 3 0 21 11 65 5 2 0 1 4 54 62 12 0 99 87 64 81 33 0 Sample Output 32 620	[ "from itertools import permutations\r\nfrom sys import stdin,stdout\r\ninput=stdin.readline\r\ndef print(args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\na=[1,2,3,4,5] ; arr=[] ; ans=0 ; pet=list(permutations(a,5))\r\nfor i in range(5):\r\n arr.append(list(map(int,input().split())))\r\n\r\nfor i in pet:\r\n x=0\r\n for j in range(4):\r\n if j>=2:\r\n x+=arr[i[j]-1][i[j+1]-1]2+arr[i[j+1]-1][i[j]-1]2 \r\n else:\r\n x+=(arr[i[j]-1][i[j+1]-1]+arr[i[j+1]-1][i[j]-1]) \r\n ans=max(ans,x)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "l=[]\r\nfor i in range(5):\r\n f=list(map(int,input().split()))\r\n l.append(f)\r\n\r\nfrom itertools import permutations\r\nper=[0,1,2,3,4]\r\nperms=permutations(per)\r\ng=0\r\nfor i in perms :\r\n fun=0\r\n fun+=l[i[0]][i[1]]+l[i[1]][i[0]]\r\n fun+=l[i[1]][i[2]]+l[i[2]][i[1]]\r\n fun+=2(l[i[2]][i[3]]+l[i[3]][i[2]])\r\n fun+=2(l[i[3]][i[4]]+l[i[4]][i[3]])\r\n\r\n if g < fun :\r\n g=fun\r\n\r\nprint(g)\r\n\r\n\r\n", "# import math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom math import \r\nimport itertools\r\nfrom bisect import bisect_right\r\n\r\nmod = 1000000007\r\n\r\n\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\ndef solve():\r\n mat = []\r\n for _ in range(5):\r\n mat.append(list(map(int,input().split())))\r\n ans = 0\r\n l=itertools.permutations([1,2,3,4,0])\r\n for i in l:\r\n cur=0\r\n for j in range(5):\r\n x=j+1\r\n if x==5:\r\n cur+=(mat[i[4]][i[3]]+mat[i[3]][i[4]])2\r\n elif x==4:\r\n cur+=(mat[i[3]][i[2]]+mat[i[2]][i[3]])2\r\n elif x==3:\r\n cur+=(mat[i[2]][i[1]]+mat[i[1]][i[2]])\r\n elif x==2:\r\n cur += (mat[i[1]][i[0]] + mat[i[0]][i[1]])\r\n ans = max(cur,ans)\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor num in range(t):\r\n # print(\"Case #{}: \".format(num + 1), end=\"\")\r\n solve()\r\n\r\n", "from collections import deque\ndef su(ll,a):\n p = ll.copy()\n ans = 0\n for i in range(2):\n ans += a[p[0]][p[1]] + a[p[1]][p[0]] + a[p[2]][p[3]] + a[p[3]][p[2]]\n p.popleft()\n p.append(0)\n \n for i in range(2):\n ans += a[p[0]][p[1]] + a[p[1]][p[0]]\n p.popleft()\n p.append(0)\n p.clear()\n return ans\n \na = []\nfor i in range(5):\n a.append(list(map(int,input().split())))\n\np = deque()\nans = 0\nx = 0\nfor i in range(5):\n for j in range(5):\n if j == i:\n continue\n for k in range(5):\n if k == i or k == j:\n continue\n for l in range(5):\n if l == i or l == j or l == k:\n continue\n for m in range(5):\n if m == i or m == j or m == k or m == l:\n continue\n p.clear()\n p.append(i)\n p.append(j)\n p.append(k)\n p.append(l)\n p.append(m)\n ans = max(ans,su(p,a))\nprint(ans)", "def cute(l,a,b,c,d,e):\r\n s=0\r\n s+=l[a][b]+l[b][a]+l[b][c]+l[c][b]+2l[c][d]+2l[d][c]+2l[d][e]+2l[e][d]\r\n return s\r\nl=[]\r\nfor i in range(5):\r\n k=list(map(int,input().split()))\r\n l.append(k)\r\nhappylilkittyblanca=0\r\nfor a in range(5):\r\n for b in range(5):\r\n if b!=a:\r\n for c in range(5):\r\n if c!=b and c!=a:\r\n for d in range(5):\r\n if d!=c and d!=b and d!=a:\r\n for e in range(5):\r\n if e!=d and e!=c and e!=b and e!=a:\r\n blanca_hap=cute(l,a,b,c,d,e)\r\n if happylilkittyblanca<blanca_hap:\r\n happylilkittyblanca=blanca_hap\r\nprint(happylilkittyblanca)", "\r\ndef calc(x1, x2, x3, x4, x5, table):\r\n res = 0\r\n res += (table[x1][x2] + table[x2][x1])\r\n res += (table[x3][x4] + table[x4][x3])\r\n res += (table[x2][x3] + table[x3][x2])\r\n res += (table[x4][x5] + table[x5][x4])\r\n res += (table[x3][x4] + table[x4][x3])\r\n res += (table[x4][x5] + table[x5][x4])\r\n return res\r\n\r\ndef main():\r\n table = []\r\n vals = []\r\n for i in range(5):\r\n tmp = list(map(int, input().split()))\r\n table.append(tmp)\r\n for x1 in range(5):\r\n for x2 in range(5):\r\n for x3 in range(5):\r\n for x4 in range(5):\r\n for x5 in range(5):\r\n if len(set([x1, x2, x3, x4, x5])) == 5:\r\n vals.append(calc(x1, x2, x3, x4, x5, table))\r\n print(max(vals))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import itertools\r\n\r\narr = [[0] * 6 for _ in range(6)]\r\nmax_val = 0\r\n\r\nwhile True:\r\n try:\r\n arr[0][0], arr[0][1], arr[0][2], arr[0][3], arr[0][4] = map(int, input().split())\r\n max_val = 0\r\n q = [1, 2, 3, 4, 5]\r\n for i in range(1, 5):\r\n arr[i] = list(map(int, input().split()))\r\n\r\n for permutation in itertools.permutations(q):\r\n tmp = list(permutation)\r\n lol = 0\r\n while tmp:\r\n for i in range(0, len(tmp) - 1, 2):\r\n lol += arr[tmp[i] - 1][tmp[i + 1] - 1] + arr[tmp[i + 1] - 1][tmp[i] - 1]\r\n tmp = tmp[1:]\r\n\r\n if lol > max_val:\r\n max_val = lol\r\n\r\n print(max_val)\r\n\r\n except EOFError:\r\n break\r\n", "from itertools import permutations\r\n\r\nshowerqueue = [[int(x) for x in input().split()] for _ in range(5)]\r\nmax = 0\r\nfor _ in permutations([0,1,2,3,4]):\r\n a, b, c, d, e = _\r\n firstround = showerqueue[a][b] + showerqueue[b][a] + showerqueue[c][d] + showerqueue[d][c]\r\n secondround = showerqueue[b][c] + showerqueue[c][b] + showerqueue[d][e] + showerqueue[e][d]\r\n thirdandfourth = showerqueue[c][d] + showerqueue[d][c] + showerqueue[d][e] + showerqueue[e][d]\r\n sum = firstround + secondround + thirdandfourth\r\n if sum > max:\r\n max = sum\r\nprint(max)\r\n", "from itertools import permutations\n\nperms = permutations(range(5))\n\nmat = [[]]5\n\nfor i in range(5):\n mat[i] = [int(x) for x in input().split()]\n\nmaxval = 0\n\n# print(mat)\nfor perm in perms:\n val = 0\n # print(perm)\n for i in range(4):\n for j in range(i+1,5,2):\n val += mat[perm[j]][perm[j-1]] + mat[perm[j-1]][perm[j]]\n # print(j-1,j,val);\n maxval = max(val, maxval)\n\nprint(maxval)\n", "def generate_sequences(elements, sequence_length, current_sequence, all_sequences):\r\n if len(current_sequence) == sequence_length:\r\n all_sequences.append(current_sequence[:]) # Добавляем текущую последовательность в список\r\n return\r\n\r\n for element in elements:\r\n if element not in current_sequence:\r\n generate_sequences(elements, sequence_length, current_sequence + [element], all_sequences)\r\n\r\ndef solve():\r\n happy = []\r\n max_happy = 0\r\n for i in range(5):\r\n happy.append(list(map(int, input().split())))\r\n\r\n sequences = []\r\n generate_sequences([0, 1, 2, 3, 4], 5, [], sequences)\r\n for seq in sequences:\r\n current_max_happy = (happy[seq[0]][seq[1] ] + happy[seq[1]][seq[0]] +\r\n happy[seq[2]][seq[3]] + happy[seq[3]][seq[2]]) + \\\r\n (happy[seq[1]][seq[2]] + happy[seq[2]][seq[1]] +\r\n happy[seq[3]][seq[4]] + happy[seq[4]][seq[3]]) + \\\r\n (happy[seq[2]][seq[3]] + happy[seq[3]][seq[2]]) + \\\r\n (happy[seq[3]][seq[4]] + happy[seq[4]][seq[3]])\r\n if current_max_happy > max_happy:\r\n max_happy = current_max_happy\r\n return max_happy\r\n\r\n\r\nprint(solve())", "g = []\r\nfor i in range(5):\r\n\tg.append([])\r\n\tg[i] = list(map(int, input().split()))\r\nfrom itertools import permutations\r\nM = -1\r\nfor p in permutations(range(1,6)):\r\n\tM = max(M, g[p[0]-1][p[1]-1] + g[p[1]-1][p[0]-1] + g[p[1]-1][p[2]-1] + g[p[2]-1][p[1]-1] + 2(g[p[2]-1][p[3]-1] + g[p[3]-1][p[2]-1] + g[p[3]-1][p[4]-1] + g[p[4]-1][p[3]-1]))\r\nprint(M)\r\n ", "'''generate permutations from 1 to n'''\r\na = [True] * 1000\r\npermutation = []\r\npermutation_list = []\r\n\r\n\r\n# show permutation\r\ndef show(lst):\r\n g = lst.copy()\r\n permutation_list.append(g)\r\n return []\r\n\r\n\r\ndef generate_permutation(n, combo=permutation, not_used=a):\r\n # If the permutation is ready, show it. (Base case)\r\n if len(combo) == n:\r\n combo = show(combo)\r\n not_used = [True] * 10\r\n\r\n # We find the combos ... (Recursive case)\r\n else:\r\n # ... by trying every digit.\r\n for i in range(1, n + 1):\r\n # If the digit is not used, ...\r\n if not_used[i]:\r\n # ... we use the digit.\r\n not_used[i] = False\r\n combo.append(i)\r\n # Then we try another digit for the remaining vacancies.\r\n generate_permutation(n, combo, not_used)\r\n # This is the best part, after we've tried the digit,\r\n # we can pop it and try the nest one.\r\n combo.pop()\r\n not_used[i] = True\r\n\r\n\r\nhappiness_matrix = []\r\nanswer = 0\r\ngenerate_permutation(5)\r\n\r\nfor i in range(5):\r\n happiness_matrix.append(list(map(int, input().split())))\r\n\r\nfor i in range(len(permutation_list)):\r\n # a b c d e\r\n a = permutation_list[i][0] - 1\r\n b = permutation_list[i][1] - 1\r\n c = permutation_list[i][2] - 1\r\n d = permutation_list[i][3] - 1\r\n e = permutation_list[i][4] - 1\r\n answer = max(happiness_matrix[a][b] + happiness_matrix[b][a] + \\\r\n happiness_matrix[c][d] + happiness_matrix[d][c] + \\\r\n happiness_matrix[b][c] + happiness_matrix[c][b] + \\\r\n happiness_matrix[d][e] + happiness_matrix[e][d] + \\\r\n happiness_matrix[c][d] + happiness_matrix[d][c] + \\\r\n happiness_matrix[d][e] + happiness_matrix[e][d], answer)\r\n\r\nprint(answer)", "from itertools import permutations\n\nn = 5\nar = []\nfor i in range(n):\n ar.append(list(map(int,input().split(\" \"))))\nls = list(permutations(range(0,5)))\nmaxi = 0\nfor i in range(120):\n s = (ar[ls[i][0]][ls[i][1]]+ar[ls[i][1]][ls[i][0]]+ar[ls[i][2]][ls[i][3]]+ar[ls[i][3]][ls[i][2]]) + (ar[ls[i][1]][ls[i][2]]+ar[ls[i][2]][ls[i][1]]+ar[ls[i][3]][ls[i][4]]+ar[ls[i][4]][ls[i][3]]) + (ar[ls[i][2]][ls[i][3]]+ar[ls[i][3]][ls[i][2]]) + (ar[ls[i][3]][ls[i][4]]+ar[ls[i][4]][ls[i][3]])\n if s > maxi:\n maxi = s\nprint(maxi)\n\n\n\n\n\n\n\n\n\n", "permutations = []\r\ncurrent = []\r\n\r\n\r\ndef search(i=1):\r\n if i == 6:\r\n permutations.append(current.copy())\r\n else:\r\n for j in range(1, 6):\r\n if not j in current:\r\n current.append(j)\r\n search(i + 1)\r\n current.pop()\r\n\r\n\r\ng = []\r\nfor i in range(5):\r\n g.append([int(x) for x in input().split()])\r\nsearch()\r\nbest = 0\r\nfor permutation in permutations:\r\n current = 0\r\n\r\n while len(permutation) > 1:\r\n for i in range(0, len(permutation) - 1, 2):\r\n current += g[permutation[i] - 1][permutation[i + 1] - 1]\r\n current += g[permutation[i + 1] - 1][permutation[i] - 1]\r\n permutation.pop(0)\r\n\r\n best = max(best, current)\r\nprint(best)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nfrom heapq import heappop , heappush\r\nfrom bisect import \r\nfrom collections import deque\r\nfrom math import \r\nfrom itertools import permutations\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n \r\ng = []\r\nfor i in range(5):\r\n g.append(LIST())\r\n \r\nans = -1\r\n \r\nfor i in permutations(range(0 , 5)):\r\n sm = g[i[0]][i[1]] + g[i[1]][i[0]]\r\n sm += g[i[2]][i[3]] + g[i[3]][i[2]]\r\n sm += g[i[1]][i[2]] + g[i[2]][i[1]]\r\n sm += g[i[3]][i[4]] + g[i[4]][i[3]]\r\n sm += g[i[2]][i[3]] + g[i[3]][i[2]]\r\n sm += g[i[3]][i[4]] + g[i[4]][i[3]]\r\n if sm > ans: ans = sm\r\n \r\nprint(ans)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\nfrom itertools import permutations\r\nl = list(permutations(range(0, 5)))\r\n\r\ng=[]\r\nfor i in range(5):\r\n A=list(map(int,input().split()))\r\n g.append(A)\r\n\r\nm=0\r\n\r\nfor i in l:\r\n temp=g[i[0]][i[1]]+g[i[1]][i[0]]+g[i[1]][i[2]]+g[i[2]][i[1]]\r\n temp+=2(g[i[2]][i[3]]+g[i[3]][i[2]]+g[i[3]][i[4]]+g[i[4]][i[3]])\r\n m=max(m,temp)\r\n \r\n\r\nprint(m)\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "from itertools import permutations\r\nperms=permutations([1,2,3,4,5])\r\n\r\npermutans=list(perms)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nliste=[]\r\n\r\nfor i in range(5):\r\n liste.append([int(i) for i in input().split()])\r\n\r\n\r\nmax=0\r\nfor i in range(120):\r\n yerel=0\r\n s=permutans[i]\r\n sanik=list(s)\r\n yerel=liste[sanik[0]-1][sanik[1]-1]+liste[sanik[2]-1][sanik[3]-1]+\\\r\n liste[sanik[2]-1][sanik[1]-1]+liste[sanik[3]-1][sanik[4]-1]+ \\\r\n liste[sanik[2]-1][sanik[3]-1]+liste[sanik[3]-1][sanik[4]-1]+ \\\r\n liste[sanik[1] - 1][sanik[0] - 1] + liste[sanik[3] - 1][sanik[2] - 1]+\\\r\n liste[sanik[1] - 1][sanik[2] - 1] + liste[sanik[4] - 1][sanik[3] - 1]+\\\r\n liste[sanik[3] - 1][sanik[2] - 1] + liste[sanik[4] - 1][sanik[3] - 1]\r\n\r\n\r\n\r\n\r\n if(yerel>max):\r\n max=yerel\r\n\r\nprint(max)", "import itertools as it\r\n\r\n\r\ndef sum_for(perm):\r\n s = 0\r\n for i in range(4):\r\n for j in range(i, 4, 2):\r\n s += g[perm[j]][perm[j + 1]] + g[perm[j + 1]][perm[j]]\r\n return s\r\n\r\n\r\ng = [[j for j in map(int, input().split())] for i in range(5)]\r\n\r\nprint(max(sum_for(perm) for perm in it.permutations((0, 1, 2, 3, 4))))\r\n", "s=set()\r\nfor bir in range(1,6):\r\n for iki in range(1,6):\r\n for uc in range(1, 6):\r\n for dort in range(1, 6):\r\n for bes in range(1, 6):\r\n k=str(bir)+str(iki)+str(uc)+str(dort)+str(bes)\r\n flag=False\r\n for i in k:\r\n if k.count(i)>1:\r\n flag=True\r\n break\r\n if not flag:\r\n s.add(k)\r\nkk=[]\r\nt=0\r\nfor i in s:\r\n ll=[]\r\n ll.append([i[t],i[t+1]])\r\n ll.append([i[t+2],i[t+3]])\r\n ll.append([i[t+1],i[t+2]])\r\n ll.append([i[t+3],i[t+4]])\r\n ll.append([i[t+2],i[t+3]])\r\n ll.append([i[t+3],i[t+4]])\r\n kk.append(ll)\r\nff=[]\r\nfor _ in range(5):\r\n ff.append(list(map(int,input().split())))\r\nm=0\r\nfor i in kk:\r\n c=0\r\n for t in i:\r\n x,y=t\r\n x,y=int(x),int(y)\r\n x-=1\r\n y-=1\r\n c+=ff[x][y]\r\n c+=ff[y][x]\r\n if c>m:\r\n m=c\r\nprint(m)", "if __name__ == \"__main__\":\r\n mat = []\r\n for i in range(5):\r\n mat.append([int(x) for x in input().split()])\r\n maximum=0\r\n for a in range(0,5):\r\n for b in range(0,5):\r\n if b==a:\r\n continue\r\n for c in range(0,5):\r\n if c==a or c == b:\r\n continue\r\n for d in range(0,5):\r\n if d==a or d==b or d==c:\r\n continue\r\n for e in range(0,5):\r\n if e==a or e==b or e==c or e==d:\r\n continue\r\n # a b c d e\r\n happiness = mat[a][b] + mat[b][a] + mat[c][d] + mat[d][c] + \\\r\n mat[b][c] + mat[c][b] + mat[d][e] + mat[e][d] + \\\r\n mat[c][d] + mat[d][c] + \\\r\n mat[d][e] + mat[e][d]\r\n if maximum < happiness:\r\n maximum = happiness\r\n print(maximum)", "from itertools import permutations\r\nG=[[map(int,input().split())] for _ in ' '5]\r\nf=lambda i,j: G[i][j]+G[j][i]\r\nprint(max(f(a,b)+f(b,c)+2(f(c,d)+f(d,e)) for a,b,c,d,e in permutations(range(5))))", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import permutations\r\n\r\ng = [list(map(int, input().split())) for _ in range(5)]\r\n\r\nd = [1,2,3,4,5]\r\nd = list(permutations(d,5))\r\nc = 0\r\nfor x in d:\r\n z = 2(g[x[3]-1][x[4]-1] + g[x[4]-1][x[3]-1] + g[x[3]-1][x[2]-1] + g[x[2]-1][x[3]-1]) + g[x[0]-1][x[1]-1] + g[x[1]-1][x[0]-1] + g[x[2]-1][x[1]-1] + g[x[1]-1][x[2]-1]\r\n c = max(c,z)\r\nprint(c)", "from itertools import permutations\n\n\ndef main():\n rows = []\n for _ in range(5):\n rows.append(list(map(int, input().split(' '))))\n\n max_val = 0\n for perms in permutations([0,1,2,3,4]):\n g12 = rows[perms[0]][perms[1]]\n g21 = rows[perms[1]][perms[0]]\n g23 = rows[perms[1]][perms[2]]\n g32 = rows[perms[2]][perms[1]]\n g34 = rows[perms[2]][perms[3]]\n g43 = rows[perms[3]][perms[2]]\n g45 = rows[perms[3]][perms[4]]\n g54 = rows[perms[4]][perms[3]]\n\n val = g12+g21+g23+g32 + 2(g34+g43) + 2(g45+g54)\n if val > max_val:\n max_val = val\n\n print(max_val)\n\n\nif __name__ == \"__main__\":\n main()\n", "x,m=[],0\r\nfor i in range(5): \r\n x.append(list(map(int,input().split())))\r\nfor a in range(5):\r\n for b in range(5):\r\n if b==a:\r\n continue\r\n for c in range(5):\r\n if c==b or c==a:\r\n continue\r\n for d in range(5):\r\n if d==a or d==b or d==c:\r\n continue\r\n for e in range(5):\r\n if e==a or e==b or e==c or e==d:\r\n continue\r\n s=x[a][b]+x[b][a]+x[b][c]+x[c][b]\r\n s+=2(x[c][d]+x[d][c]+x[d][e]+x[e][d])\r\n if s>m: m=s\r\nprint(m)", "from itertools import permutations\r\n\r\nG = [[map(int, input().split())] for _ in ' ' 5]\r\nf = lambda i, j: G[i][j] + G[j][i]\r\nprint(max(f(a, b) + f(b, c) + 2 * (f(c, d) + f(d, e)) for a, b, c, d, e in permutations(range(5))))\r\n", "m_s = []\r\nfor _ in range(5):\r\n m_s.append(input())\r\n\r\n\r\nimport itertools\r\ndef order_happines(arr, m):\r\n tot = 0\r\n arr = arr[:]\r\n while len(arr):\r\n for i in range(1, len(arr), 2):\r\n a, b = arr[i - 1], arr[i]\r\n tot += int(m[a][b]) + int(m[b][a])\r\n\r\n arr.pop(0)\r\n\r\n return tot\r\n\r\n\r\ndef shower_line():\r\n m = []\r\n for line in m_s:\r\n m.append(list(line.split()))\r\n\r\n men = [0, 1, 2, 3, 4]\r\n cand = list(itertools.permutations(men))\r\n maxi = 0\r\n for el in cand:\r\n maxi = max(maxi, order_happines(list(el), m))\r\n return maxi\r\n\r\nprint(shower_line())", "from itertools import permutations\nmat = []\nfor _ in range(5):\n mat.append(list(map(int, input().split())))\n\narr = [1,2,3,4,5]\nans = 0\nfor perm in permutations(arr, 5):\n res = 0\n k = 1\n for i in range(1, 5):\n x = perm[i]\n y = perm[i-1]\n if i >= 3:\n k = 2\n res += (mat[y-1][x-1] + mat[x-1][y-1]) * k\n #print(perm, res)\n ans = max(ans, res)\nprint(ans)\n", "mat = []\nfor _ in range(5):\n mat.append(list(map(int, input().split())))\n\nbest = 0\ndef bt(seq):\n if len(seq) == 5:\n global best\n v1, v2, v3, v4, v5 = seq\n ans = mat[v1][v2] + mat[v2][v1]\n ans += mat[v2][v3] + mat[v3][v2]\n ans += (mat[v3][v4] + mat[v4][v3]) * 2\n ans += (mat[v4][v5] + mat[v5][v4]) * 2\n best = max(best, ans)\n return\n\n for x in range(5):\n if x not in seq:\n seq.append(x)\n bt(seq)\n seq.pop()\n\n\nbt([])\nprint(best)\n", "from itertools import permutations\r\n\r\n\r\ndef main():\r\n mat: list[list[int]] = []\r\n for _ in range(5):\r\n mat.append(get_list_int())\r\n\r\n max_happiness = 0\r\n arrangements = permutations(range(1, 6))\r\n\r\n for arrangement in arrangements:\r\n happiness = 0\r\n for start in range(4):\r\n cur = start\r\n while cur + 1 < 5:\r\n i, j = arrangement[cur] - 1, arrangement[cur + 1] - 1\r\n happiness += mat[i][j] + mat[j][i]\r\n cur += 2\r\n max_happiness = max(max_happiness, happiness)\r\n\r\n print(max_happiness)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import re\r\n\r\n\r\na = []\r\n\r\nfor _ in range(5):\r\n a.append(list(map(int,input().split())))\r\n\r\nmaxH = 0\r\nfor i in range(5):\r\n for j in range(5):\r\n for k in range(5):\r\n for l in range(5):\r\n for m in range(5):\r\n if i==j or i==k or i==l or i==m or j==k or j==l or j==m or k==l or k==m or l==m:\r\n continue\r\n h = 2(a[l][m]+a[m][l]+a[k][l]+a[l][k])+a[j][k]+a[k][j]+a[i][j]+a[j][i]\r\n \r\n maxH = max(maxH,h)\r\n \r\nprint(maxH)", "from itertools import permutations\r\n\r\n\r\ndef funn(p):\r\n summ = 0\r\n # Calculate summ using the provided pattern\r\n # 01234\r\n summ += (g[p[0]][p[1]] + g[p[1]][p[0]] + g[p[2]][p[3]] + g[p[3]][p[2]])\r\n # 1234\r\n summ += (g[p[1]][p[2]] + g[p[2]][p[1]] + g[p[3]][p[4]] + g[p[4]][p[3]])\r\n # 234\r\n summ += (g[p[2]][p[3]] + g[p[3]][p[2]])\r\n # 34\r\n summ += (g[p[3]][p[4]] + g[p[4]][p[3]])\r\n return summ\r\n\r\n\r\nmaxx = 0\r\ng = []\r\nfor i in range(5):\r\n a = list(map(int, input().split(\" \")))\r\n g.append(a)\r\n\r\nperms = permutations(range(5))\r\n\r\nfor p in perms:\r\n result = funn(p)\r\n maxx = max(maxx, result)\r\n\r\nprint(maxx)\r\n", "from itertools import permutations as per\r\nlst=[]\r\nfor i in range(5):lst.append([int(x) for x in input().split()])\r\nperm=list(per(range(5),5))\r\nbest=0\r\nfor i in perm:best=max(best,2(lst[i[2]][i[3]]+lst[i[3]][i[2]]+lst[i[3]][i[4]]+lst[i[4]][i[3]])+lst[i[0]][i[1]]+lst[i[1]][i[0]]+lst[i[1]][i[2]]+lst[i[2]][i[1]])\r\nprint(best)\r\n", "import itertools as it\r\n\r\ndef happiness(t):\r\n return l[int(t[0])-1][int(t[1])-1]+l[int(t[1])-1][int(t[0])-1]+l[int(t[1])-1][int(t[2])-1]+l[int(t[2])-1][int(t[1])-1]+2(l[int(t[3])-1][int(t[4])-1]+l[int(t[4])-1][int(t[3])-1])+2(l[int(t[3])-1][int(t[2])-1]+l[int(t[2])-1][int(t[3])-1])\r\nl=[]\r\nans=0\r\nfor i in range(5):\r\n l.append(list(map(int, input().split())))\r\n\r\nperm=it.permutations('12345')\r\n\r\nfor x in perm:\r\n ans=max(ans,happiness(x))\r\nprint(ans)\r\n", "def get_permutations():\r\n ll = []\r\n for i in range(5):\r\n for j in range(5):\r\n if j == i:\r\n continue\r\n for k in range(5):\r\n if k == j or k == i:\r\n continue\r\n for m in range(5):\r\n if m == k or m == j or m == i:\r\n continue\r\n for n in range(5):\r\n if n == m or n == k or n == j or n == i:\r\n continue\r\n ll.append([i, j, k, m, n])\r\n # return list(set(itertools.permutations([0,1,2,3,4]))) # would work.\r\n return ll\r\n\r\n\r\ndef solution():\r\n g = [None]5\r\n for i in range(5):\r\n g[i] = list(map(int, input().split()))\r\n permutations = get_permutations()\r\n #permutations = list(set(itertools.permutations([0,1,2,3,4])))\r\n best_score = 0\r\n best_order = None\r\n for permutation in permutations:\r\n i, j, k, m, n = permutation\r\n score = 2(g[k][m] + g[m][k]) + 2(g[m][n] + g[n][m]) + (g[j][k] + g[k][j]) + (g[i][j] + g[j][i])\r\n if score > best_score:\r\n best_order = permutation\r\n best_score = score\r\n print(best_score)\r\n\r\nsolution()", "from itertools import permutations\r\nl=[]\r\nfor i in range(5) :\r\n g=list(map(int,input().split()))\r\n l.append(g)\r\n\r\nper=[1,2,3,4,5]\r\nperms=permutations(per)\r\nk=[]\r\nfor i in perms :\r\n k.append(i)\r\n\r\nfun=0\r\nallfun=0\r\nfor o in k :\r\n fun=0\r\n fun+=l[o[0]-1][o[1]-1]+l[o[1]-1][o[0]-1]\r\n fun+=l[o[1]-1][o[2]-1]+l[o[2]-1][o[1]-1]\r\n fun+=2(l[o[2]-1][o[3]-1]+l[o[3]-1][o[2]-1])\r\n fun+=2(l[o[3]-1][o[4]-1]+l[o[4]-1][o[3]-1])\r\n if fun>allfun :\r\n allfun=fun\r\nprint(allfun)\r\n\r\n ", "from itertools import permutations\nfrom typing import List\n\ndef initial_order_for_maximum_happiness(mat: List[List[int]]) -> int:\n def calculate_happiness(student: List[int]) -> int:\n hap = 0\n n = 5\n while student:\n pair = [(student[i], student[i+1]) for i in range(0, n-1, 2)]\n for i, j in pair:\n hap += mat[i][j]\n hap += mat[j][i]\n n -= 1\n student = student[1:]\n return hap\n num = [0, 1, 2, 3, 4]\n possible = list(permutations(num))\n happiness = 0\n for order in possible:\n hap = calculate_happiness(order)\n happiness = max(happiness, hap)\n return happiness\n\na = []\nfor i in range(5):\n b = [int(j) for j in input().split()]\n a.append(b)\nd = initial_order_for_maximum_happiness(a)\nprint(d)\n", "a = [[int(x) for x in input().split()] for i in range(5)]\nans = 0\npermute = []\nn = 5\ntemp = [x for x in range(n)]\ndef get_permutes(i,n):\n if i==n:\n permute.append(temp[:])\n return\n for j in range(i,n):\n temp[i],temp[j]=temp[j],temp[i]\n get_permutes(i+1,n)\n temp[i],temp[j]=temp[j],temp[i]\n\nget_permutes(0,n)\nfor p in permute:\n happ = a[p[0]][p[1]]+a[p[1]][p[0]]+a[p[2]][p[3]]+a[p[3]][p[2]]\n happ += a[p[1]][p[2]]+a[p[2]][p[1]]+a[p[3]][p[4]]+a[p[4]][p[3]]\n happ += a[p[2]][p[3]]+a[p[3]][p[2]]\n happ += a[p[3]][p[4]]+a[p[4]][p[3]]\n ans = max(ans, happ)\nprint(ans)\n\n", "def cost(x,arr):\r\n ans=0\r\n for i in range(5):\r\n j=i \r\n while(j<4):\r\n t1=x[j]\r\n t2=x[j+1]\r\n j+=2\r\n ans+=arr[t1][t2]\r\n ans+=arr[t2][t1]\r\n return ans\r\n\r\n\r\n\r\n\r\n\r\n\r\nl=[(0, 1, 2, 3, 4), (0, 1, 2, 4, 3), (0, 1, 3, 2, 4), (0, 1, 3, 4, 2), (0, 1, 4, 2, 3), (0, 1, 4, 3, 2), (0, 2, 1, 3, 4), (0, 2, 1, 4, 3), (0, 2, 3, 1, 4), (0, 2, 3, 4, 1), (0, 2, 4, 1, 3), (0, 2, 4, 3, 1), (0, 3, 1, 2, 4), (0, 3, 1, 4, 2), (0, 3, 2, 1, 4), (0, 3, 2, 4, 1), (0, 3, 4, 1, 2), (0, 3, 4, 2, 1), (0, 4, 1, 2, 3), (0, 4, 1, 3, 2), (0, 4, 2, 1, 3), (0, 4, 2, 3, 1), (0, 4, 3, 1, 2), (0, 4, 3, 2, 1), (1, 0, 2, 3, 4), (1, 0, 2, 4, 3), (1, 0, 3, 2, 4), (1, 0, 3, 4, 2), (1, 0, 4, 2, 3), (1, 0, 4, 3, 2), (1, 2, 0, 3, 4), (1, 2, 0, 4, 3), (1, 2, 3, 0, 4), (1, 2, 3, 4, 0), (1, 2, 4, 0, 3), (1, 2, 4, 3, 0), (1, 3, 0, 2, 4), (1, 3, 0, 4, 2), (1, 3, 2, 0, 4), (1, 3, 2, 4, 0), (1, 3, 4, 0, 2), (1, 3, 4, 2, 0), (1, 4, 0, 2, 3), (1, 4, 0, 3, 2), (1, 4, 2, 0, 3), (1, 4, 2, 3, 0), (1, 4, 3, 0, 2), (1, 4, 3, 2, 0), (2, 0, 1, 3, 4), (2, 0, 1, 4, 3), (2, 0, 3, 1, 4), (2, 0, 3, 4, 1), (2, 0, 4, 1, 3), (2, 0, 4, 3, 1), (2, 1, 0, 3, 4), (2, 1, 0, 4, 3), (2, 1, 3, 0, 4), (2, 1, 3, 4, 0), (2, 1, 4, 0, 3), (2, 1, 4, 3, 0), (2, 3, 0, 1, 4), (2, 3, 0, 4, 1), (2, 3, 1, 0, 4), (2, 3, 1, 4, 0), (2, 3, 4, 0, 1), (2, 3, 4, 1, 0), (2, 4, 0, 1, 3), (2, 4, 0, 3, 1), (2, 4, 1, 0, 3), (2, 4, 1, 3, 0), (2, 4, 3, 0, 1), (2, 4, 3, 1, 0), (3, 0, 1, 2, 4), (3, 0, 1, 4, 2), (3, 0, 2, 1, 4), (3, 0, 2, 4, 1), (3, 0, 4, 1, 2), (3, 0, 4, 2, 1), (3, 1, 0, 2, 4), (3, 1, 0, 4, 2), (3, 1, 2, 0, 4), (3, 1, 2, 4, 0), (3, 1, 4, 0, 2), (3, 1, 4, 2, 0), (3, 2, 0, 1, 4), (3, 2, 0, 4, 1), (3, 2, 1, 0, 4), (3, 2, 1, 4, 0), (3, 2, 4, 0, 1), (3, 2, 4, 1, 0), (3, 4, 0, 1, 2), (3, 4, 0, 2, 1), (3, 4, 1, 0, 2), (3, 4, 1, 2, 0), (3, 4, 2, 0, 1), (3, 4, 2, 1, 0), (4, 0, 1, 2, 3), (4, 0, 1, 3, 2), (4, 0, 2, 1, 3), (4, 0, 2, 3, 1), (4, 0, 3, 1, 2), (4, 0, 3, 2, 1), (4, 1, 0, 2, 3), (4, 1, 0, 3, 2), (4, 1, 2, 0, 3), (4, 1, 2, 3, 0), (4, 1, 3, 0, 2), (4, 1, 3, 2, 0), (4, 2, 0, 1, 3), (4, 2, 0, 3, 1), (4, 2, 1, 0, 3), (4, 2, 1, 3, 0), (4, 2, 3, 0, 1), (4, 2, 3, 1, 0), (4, 3, 0, 1, 2), (4, 3, 0, 2, 1), (4, 3, 1, 0, 2), (4, 3, 1, 2, 0), (4, 3, 2, 0, 1), (4, 3, 2, 1, 0)]\r\narr=[]\r\nfor i in range(5):\r\n temp=list(map(int,input().split()))\r\n arr.append(temp)\r\n\r\nm1=-10\r\nfor i in l:\r\n t1=cost(i,arr)\r\n if(t1>m1):\r\n # temp=i \r\n m1=t1\r\nprint(m1)\r\n\r\n \r\n\r\n", "mat = []\nfor i in range(5):\n tmp = [ int(x) for x in input().split() ]\n mat.append(tmp)\n\n\ndef cal_hap( mat , op ):\n hp = 0\n i = 0\n while(i < 4):\n j = i\n while(j < 4):\n hp += mat[ op[j] ][ op[j+1] ]\n hp += mat[ op[j+1] ][ op[j] ]\n j += 2\n i += 1\n return hp\n \n\nop = [ [] ]\nfor i in range(5):\n cs = []\n for j in range(len(op)):\n for k in range(5):\n if k not in op[j]:\n cs.append( op[j] + [k])\n op = cs\n\nmx = 0\nfor st in op:\n tmp = cal_hap(mat, st)\n if tmp > mx:\n mx = tmp\n \nprint(mx)\n\n \t \t \t \t \t \t \t\t \t \t\t\t\t\t \t \t", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import \r\nimport itertools\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\nx = 0\r\nfrom itertools import permutations\r\n\r\nz = [[int(j) for j in input().split()] for i in range(5)]\r\nm = 0\r\nfor k in permutations([0, 1, 2, 3, 4]):\r\n s = 0\r\n for i in range(4):\r\n for j in range(i, 4, 2):\r\n s += z[k[j]][k[j + 1]] + z[k[j + 1]][k[j]]\r\n if s > m:\r\n m = s\r\nprint(m)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n1 2 3 4 5\r\n i k\r\n'''\r\n\r\ndef next_permutation(p):\r\n if len(p) <= 1:\r\n return p\r\n \r\n for i in range(len(p)-2, -1, -1):\r\n if p[i] < p[i+1]:\r\n k = i+1\r\n for j in range(k, len(p)):\r\n if p[j] > p[i]:\r\n k = j\r\n\r\n p[i], p[k] = p[k], p[i]\r\n return p[:i+1] + p[i+1:][::-1]\r\n return p[::-1]\r\n\r\n\r\ndef solve():\r\n p = [0,1,2,3,4]\r\n grid = []\r\n for _ in range(5):\r\n grid.append(LII())\r\n\r\n ans = 0\r\n for _ in range(120):\r\n cur = 2 * (grid[p[4]][p[3]] + grid[p[3]][p[4]])\r\n cur += 2 * (grid[p[3]][p[2]] + grid[p[2]][p[3]])\r\n cur += grid[p[0]][p[1]] + grid[p[1]][p[0]]\r\n cur += grid[p[2]][p[1]] + grid[p[1]][p[2]]\r\n ans = max(ans, cur)\r\n p = next_permutation(p)\r\n\r\n print(ans)\r\n\r\nsolve()", "def get_permutations(set):\r\n if len(set) == 2:\r\n return [set, [set[1], set[0]]]\r\n elif len(set) < 2:\r\n return set\r\n\r\n perms = []\r\n prev = get_permutations(set[1:])\r\n for i in range(len(set)):\r\n for perm in prev:\r\n perms.append(perm[:i]+[set[0]]+perm[i:])\r\n return perms\r\n\r\n\r\ndef evaluate(p, mat):\r\n value = mat[p[0]][p[1]]+mat[p[1]][p[0]]+mat[p[2]][p[3]]+mat[p[3]][p[2]]\r\n value += mat[p[1]][p[2]]+mat[p[2]][p[1]]+mat[p[3]][p[4]]+mat[p[4]][p[3]]\r\n\r\n value += mat[p[2]][p[3]]+mat[p[3]][p[2]]\r\n value += mat[p[3]][p[4]]+mat[p[4]][p[3]]\r\n\r\n return value\r\n\r\n\r\n\r\ndef main():\r\n matrix = []\r\n for i in range(5):\r\n matrix.append(list(map(int, input().split())))\r\n \r\n result = 0\r\n perms = get_permutations([0, 1, 2, 3, 4])\r\n for perm in perms:\r\n value = evaluate(perm, matrix)\r\n result = result if result >= value else value\r\n print(result)\r\n\r\n\r\nmain()", "import sys, math, itertools\r\ninput = sys.stdin.readline \r\nfrom collections import Counter , defaultdict\r\ndef instr():\r\n return input()[:-1]\r\nimport math \r\npermutations = itertools.permutations(list(range(5)))\r\n############################\r\ninput = sys.stdin.readline\r\ndata = []\r\nfor i in range(5):\r\n data.append(list(map(int, input().split())))\r\nmx = 0\r\nfor p in permutations:\r\n value = data[p[1]][p[0]] + data[p[0]][p[1]] + data[p[1]][p[2]] + data[p[2]][p[1]] + 2(data[p[3]][p[2]] + data[p[2]][p[3]]) + 2(data[p[3]][p[4]] + data[p[4]][p[3]]) \r\n if mx < value :\r\n mx = value\r\nprint(mx)", "import sys\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations\r\ndata=[]\r\nfor _ in range(5):\r\n data.append(list(map(int,input().split())))\r\n\r\nans=0\r\nPermutations=list(permutations([0,1,2,3,4],5)) \r\nfor i,j,k,l ,m in Permutations:\r\n check=data[i][j]+data[j][i]+data[k][l]+data[l][k]\r\n check+=data[j][k]+data[k][j]+data[l][m]+data[m][l]\r\n check+=data[k][l] +data[l][k]\r\n check+=data[l][m]+data[m][l]\r\n\r\n ans=max(ans,check)\r\nprint(ans) " ]	{"inputs": ["0 0 0 0 9\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n7 0 0 0 0", "0 43 21 18 2\n3 0 21 11 65\n5 2 0 1 4\n54 62 12 0 99\n87 64 81 33 0", "0 4 2 4 9\n6 0 2 5 0\n2 5 0 6 3\n6 3 3 0 10\n0 3 1 3 0", "0 65 90 2 32\n69 0 9 97 67\n77 97 0 16 84\n18 50 94 0 63\n69 12 82 16 0", "0 70 10 0 0\n70 0 50 90 0\n10 50 0 80 0\n0 90 80 0 100\n0 0 0 100 0", "0 711 647 743 841\n29 0 109 38 682\n329 393 0 212 512\n108 56 133 0 579\n247 92 933 164 0", "0 9699 6962 6645 7790\n9280 0 6215 8661 6241\n2295 7817 0 7373 9681\n693 6298 1381 0 4633\n7626 3761 694 4073 0", "0 90479 71577 33797 88848\n45771 0 96799 78707 72708\n5660 26421 0 10991 22757\n78919 24804 90645 0 48665\n92787 43671 38727 17302 0", "0 61256 85109 94834 32902\n55269 0 67023 1310 85444\n23497 84998 0 55618 80701\n30324 1713 62127 0 55041\n47799 52448 40072 28971 0", "0 7686 20401 55871 74372\n29526 0 15486 2152 84700\n27854 30093 0 62418 14297\n43903 76036 36194 0 50522\n29743 9945 38831 75882 0", "0 5271 65319 64976 13673\n80352 0 41169 66004 47397\n33603 44407 0 55079 36122\n4277 9834 92810 0 80276\n1391 1145 92132 51595 0", "0 75763 33154 32389 12897\n5095 0 6375 61517 46063\n35354 82789 0 24814 310\n37373 45993 61355 0 76865\n24383 84258 71887 71430 0", "0 89296 32018 98206 22395\n15733 0 69391 74253 50419\n80450 89589 0 20583 51716\n38629 93129 67730 0 69703\n44054 83018 21382 64478 0", "0 14675 94714 27735 99544\n45584 0 43621 94734 66110\n72838 45781 0 47389 99394\n75870 95368 33311 0 63379\n21974 70489 53797 23747 0", "0 9994 14841 63916 37926\n80090 0 90258 96988 18217\n674 69024 0 17641 54436\n35046 21380 14213 0 67188\n49360 19086 68337 70856 0", "0 28287 52158 19163 10096\n93438 0 19260 88892 12429\n22525 60034 0 78163 18126\n11594 8506 56066 0 17732\n59561 82486 23419 57406 0", "0 35310 30842 63415 91022\n30553 0 25001 38944 92355\n48906 33736 0 96880 80893\n80507 79652 45299 0 38212\n72488 77736 19203 56436 0", "0 42865 18485 37168 43099\n41476 0 58754 73410 51163\n76093 44493 0 51611 93773\n87223 80979 58422 0 63327\n51215 63346 84797 52809 0", "0 63580 51022 25392 84354\n39316 0 17516 63801 92440\n5447 2074 0 11758 4772\n26329 55642 62442 0 75330\n6164 83831 10741 15214 0", "0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "0 1 1 1 0\n1 0 0 1 0\n0 1 0 0 1\n1 1 0 0 0\n1 0 0 1 0", "0 3 6 9 8\n2 0 8 7 7\n4 6 0 6 1\n9 0 3 0 6\n6 5 0 2 0", "0 97 67 53 6\n96 0 100 57 17\n27 79 0 66 16\n89 46 71 0 28\n27 26 27 12 0", "0 670 904 349 56\n446 0 941 590 993\n654 888 0 423 752\n16 424 837 0 433\n418 655 459 897 0", "0 4109 129 1340 7124\n7815 0 8991 2828 909\n5634 799 0 5691 9604\n3261 7013 8062 0 5160\n2433 4742 694 4786 0", "0 14299 32984 96001 30445\n77723 0 75669 14101 55389\n30897 9956 0 52675 29987\n36518 90812 92955 0 64020\n91242 50085 86272 62454 0", "0 46183 30304 63049 13191\n37244 0 23076 12594 43885\n98470 1788 0 37335 7775\n33822 50804 27921 0 56734\n38313 67579 77714 46687 0", "0 39037 87960 13497 38526\n5528 0 44220 23338 92550\n87887 86544 0 30269 82845\n24590 60325 90979 0 20186\n64959 69875 93564 68355 0", "0 27677 88187 87515 82582\n98177 0 22852 28214 99977\n52662 14066 0 79760 68188\n56883 30561 91843 0 79777\n12461 14821 29284 54372 0", "0 37330 91942 67667 42061\n1978 0 84218 17 10834\n11303 6279 0 48597 26591\n82688 5437 34983 0 92556\n79574 32231 23167 16637 0", "0 3 0 0 0\n3 0 2 0 0\n0 2 0 1 0\n0 0 1 0 1\n0 0 0 1 0"], "outputs": ["32", "620", "63", "947", "960", "6265", "93667", "860626", "822729", "605229", "744065", "714904", "874574", "974145", "801116", "654636", "953303", "864938", "738415", "0", "10", "90", "926", "9752", "69867", "783459", "666175", "950600", "878207", "718057", "24"]}	UNKNOWN	PYTHON3	CODEFORCES	44
d58e0be64698471a23413eaf7d77d0a6	Subway Innovation	Berland is going through tough times — the dirt price has dropped and that is a blow to the country's economy. Everybody knows that Berland is the top world dirt exporter! The President of Berland was forced to leave only k of the currently existing n subway stations. The subway stations are located on a straight line one after another, the trains consecutively visit the stations as they move. You can assume that the stations are on the Ox axis, the i-th station is at point with coordinate xi. In such case the distance between stations i and j is calculated by a simple formula \|xi<=-<=xj\|. Currently, the Ministry of Transport is choosing which stations to close and which ones to leave. Obviously, the residents of the capital won't be too enthusiastic about the innovation, so it was decided to show the best side to the people. The Ministry of Transport wants to choose such k stations that minimize the average commute time in the subway! Assuming that the train speed is constant (it is a fixed value), the average commute time in the subway is calculated as the sum of pairwise distances between stations, divided by the number of pairs (that is ) and divided by the speed of the train. Help the Minister of Transport to solve this difficult problem. Write a program that, given the location of the stations selects such k stations that the average commute time in the subway is minimized. The first line of the input contains integer n (3<=≤<=n<=≤<=3·105) — the number of the stations before the innovation. The second line contains the coordinates of the stations x1,<=x2,<=...,<=xn (<=-<=108<=≤<=xi<=≤<=108). The third line contains integer k (2<=≤<=k<=≤<=n<=-<=1) — the number of stations after the innovation. The station coordinates are distinct and not necessarily sorted. Print a sequence of k distinct integers t1,<=t2,<=...,<=tk (1<=≤<=tj<=≤<=n) — the numbers of the stations that should be left after the innovation in arbitrary order. Assume that the stations are numbered 1 through n in the order they are given in the input. The number of stations you print must have the minimum possible average commute time among all possible ways to choose k stations. If there are multiple such ways, you are allowed to print any of them. Sample Input 3 1 100 101 2 Sample Output 2 3	[ "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = [int(x) for x in stdin.readline().split()]\r\na = sorted([(a[x],str(x+1)) for x in range(n)])\r\nk = int(stdin.readline())\r\n\r\nsums = [0]\r\nfor x in a:\r\n sums.append(sums[-1]+x[0])\r\n\r\ntotal = 0\r\ns = 0\r\n\r\nfor x in range(k):\r\n total += a[x][0]x-s\r\n s += a[x][0]\r\n\r\nlow = total\r\nlowInd = 0\r\n\r\n#print(total)\r\n\r\nfor x in range(n-k):\r\n s -= a[x][0]\r\n total -= s-a[x][0](k-1)\r\n total += a[x+k][0]*(k-1)-s\r\n s += a[x+k][0]\r\n if total < low:\r\n low = total\r\n lowInd = x+1\r\n\r\nout = []\r\n\r\nfor x in range(lowInd,lowInd+k):\r\n out.append(a[x][1])\r\nprint(' '.join(out))\r\n" ]	{"inputs": ["3\n1 100 101\n2", "5\n11 21 30 40 50\n3", "3\n0 -4 -3\n2", "4\n5 -7 8 1\n2", "5\n-4 -2 10 -9 -10\n2", "6\n9 8 4 -4 -6 -8\n2", "7\n10 -6 0 -5 -2 -8 7\n2", "5\n-10 -5 3 4 -3\n3", "6\n8 -7 1 5 -8 4\n3", "7\n-5 1 3 2 -9 -1 -4\n3", "100\n237 -708 796 -645 75 387 992 343 -219 -696 777 -722 844 -409 6 989 39 -151 -182 -936 749 -971 -283 -929 668 317 545 -483 58 -715 197 -461 -631 -194 569 636 -24 842 -181 848 156 269 500 781 904 -512 621 -834 -892 -550 -805 -137 -220 164 198 -930 614 241 590 193 -636 144 415 -49 546 818 982 311 677 579 906 -795 912 -387 255 -742 606 122 672 869 -475 -628 644 -517 -73 -317 153 980 -571 57 -526 -278 451 -556 -266 365 358 -815 522 846\n2", "100\n713 -567 -923 200 -476 -730 -458 926 -683 -637 -818 -565 791 593 -108 970 -173 -633 320 23 220 595 454 -824 -608 252 -756 -933 -863 176 652 -520 -600 550 -540 -140 -611 -304 528 928 339 112 -539 477 -663 -114 363 -687 253 -124 887 48 111 -662 -146 -66 635 519 -350 469 815 321 316 -32 95 62 896 822 -830 481 -729 294 -6 206 -887 -708 -642 69 185 -292 906 667 -974 348 344 842 737 473 -131 288 -610 905 722 -979 -415 -460 -889 -486 -156 837\n4", "100\n-167 577 599 -770 -68 -805 604 -776 -136 373 433 -662 -583 52 606 -606 337 250 -412 901 -737 472 -686 -955 243 125 -248 -457 794 655 630 578 -530 891 467 -192 -304 975 -722 -290 -765 -887 966 314 -155 409 -909 -265 -843 -395 -993 -755 449 -844 821 940 597 902 -480 -566 990 427 -899 -587 538 -405 656 485 340 881 -217 684 -854 855 -329 -465 -150 863 441 -730 857 938 114 86 843 443 81 -474 -61 356 503 -188 761 -246 -445 -827 -316 -390 790 647\n8", "100\n857 603 431 535 -564 421 -637 -615 -484 888 467 -534 -72 13 579 699 362 911 675 925 902 677 -938 -776 618 741 614 -138 283 -134 -82 -854 854 -391 923 20 264 267 22 -857 -58 746 834 -253 -140 21 -260 -944 37 668 -818 47 880 -827 -835 -309 106 -336 580 832 405 257 -459 981 -166 -879 964 -662 -388 -211 394 -45 -973 -332 -685 -708 -605 -578 -46 576 562 278 -448 -946 -438 885 351 -207 987 442 184 481 -444 -807 793 105 74 -50 573 -217\n16", "100\n-608 705 341 641 -64 309 -990 319 -240 -350 -570 813 537 -296 -388 131 187 98 573 -572 484 -774 176 -906 -579 -991 434 -248 1000 803 -619 504 -566 898 58 337 -505 356 265 -201 -868 -752 236 804 -273 -335 -485 -190 18 -338 -419 831 -170 142 -946 -861 -847 -278 650 587 -519 492 880 -503 -992 133 590 840 104 354 227 262 440 -104 704 149 410 -843 -116 635 317 -139 40 -753 -515 555 417 -928 164 -538 611 20 -610 -193 151 397 593 -150 79 -507\n32", "100\n-683 303 245 -975 345 -159 529 -752 -349 -318 -275 -62 -449 -601 -687 691 491 -297 -576 425 -468 -235 446 536 143 152 -402 -491 363 -842 676 360 -461 -170 727 53 10 823 665 716 110 450 -154 -265 -926 636 -577 99 -719 -786 373 -286 994 -756 644 -800 220 -771 860 610 -613 -51 -398 -206 826 355 696 897 -957 -28 117 -750 -917 -253 718 -373 -222 -892 -316 603 -427 -936 -820 -566 158 43 -314 -972 618 -501 653 -688 684 -777 -885 -997 427 505 -995 142\n64", "3\n-100000000 0 100000000\n2"], "outputs": ["2 3 ", "1 2 3 ", "2 3 ", "1 3 ", "5 4 ", "2 1 ", "2 4 ", "1 2 5 ", "3 6 4 ", "2 4 3 ", "56 24 ", "37 91 25 33 ", "62 11 79 86 53 35 22 68 ", "42 95 60 43 33 1 53 86 10 21 18 35 20 67 64 89 ", "49 92 83 35 99 18 69 16 66 54 76 95 89 23 17 71 43 72 39 6 81 8 36 3 70 38 96 77 87 27 73 21 ", "96 99 4 88 69 82 45 73 78 95 30 83 56 50 94 58 54 8 72 49 92 15 1 61 14 47 19 84 90 28 21 33 13 81 27 63 76 9 10 79 87 18 52 11 44 74 22 77 64 34 6 43 12 62 70 37 86 36 48 41 71 100 25 26 ", "1 2 "]}	UNKNOWN	PYTHON3	CODEFORCES	1
d5a66051eeab79f22b63335aaf627de6	Pocket Book	One day little Vasya found mom's pocket book. The book had n names of her friends and unusually enough, each name was exactly m letters long. Let's number the names from 1 to n in the order in which they are written. As mom wasn't home, Vasya decided to play with names: he chose three integers i, j, k (1<=≤<=i<=<<=j<=≤<=n, 1<=≤<=k<=≤<=m), then he took names number i and j and swapped their prefixes of length k. For example, if we take names "CBDAD" and "AABRD" and swap their prefixes with the length of 3, the result will be names "AABAD" and "CBDRD". You wonder how many different names Vasya can write instead of name number 1, if Vasya is allowed to perform any number of the described actions. As Vasya performs each action, he chooses numbers i, j, k independently from the previous moves and his choice is based entirely on his will. The sought number can be very large, so you should only find it modulo 1000000007 (109<=+<=7). The first input line contains two integers n and m (1<=≤<=n,<=m<=≤<=100) — the number of names and the length of each name, correspondingly. Then n lines contain names, each name consists of exactly m uppercase Latin letters. Print the single number — the number of different names that could end up in position number 1 in the pocket book after the applying the procedures described above. Print the number modulo 1000000007 (109<=+<=7). Sample Input 2 3 AAB BAA 4 5 ABABA BCGDG AAAAA YABSA Sample Output 4 216	[ "if __name__ == \"__main__\":\r\n modulo=10*9+7\r\n n,m=map(int,input().split())\r\n names=[]\r\n\r\n for i in range(n):\r\n names.append(input().strip())\r\n \r\n res=1\r\n for j in range(m):\r\n unique_col_char_count=0\r\n tmp_arr=[]\r\n for i in range(n):\r\n if names[i][j] not in tmp_arr:\r\n unique_col_char_count+=1\r\n tmp_arr.append(names[i][j])\r\n res=unique_col_char_count\r\n res=res%(modulo)\r\n print(res)", "n,m=map(int,input().split())\r\narr=[]\r\nmod=10*9+7\r\nfor i in range(n):\r\n s=input()\r\n arr.append(s)\r\nans=1\r\nfor j in range(m):\r\n dic={}\r\n temp=0\r\n for i in range(n):\r\n if arr[i][j] not in dic:\r\n temp+=1\r\n dic[arr[i][j]]=arr[i][j]\r\n ans=(anstemp%mod)%mod\r\nprint(ans)\r\n", "def pocket_book(arr):\r\n l=1\r\n for i in range(len(arr[0])):\r\n st = set()\r\n for word in arr:\r\n st.add(word[i])\r\n l=len(st)\r\n return l%(109+7)\r\n\r\na,b=map(int,input().strip().split())\r\nlst=[]\r\nfor i in range(a):\r\n lst.append(input())\r\nprint(pocket_book(lst))", "mod = 1000000007\n\n\n\nn, m = map(int, input().split())\n\nlista = []\narr = [0] m\nfor c in range(n):\n name = input()\n lista.append(name)\n\n\nfor c in range(m): \n con = set()\n for v in range(n):\n con.add(lista[v][c])\n arr[c] += len(con)\n \n\nresp = 1\nfor c in range(m):\n resp = (resp * arr[c]) % mod\n\nprint(resp)\n\n\t \t \t\t \t \t\t\t\t\t \t \t\t \t \t", "n, m = map(int, input().split())\nnames = []\npossibilities = 1\n\nfor i in range(n):\n names.append(input())\n\nfor i in range(m):\n diff_letters = set([name[i] for name in names])\n\n if len(diff_letters) > 1:\n possibilities = (possibilities * len(diff_letters)) % (109 + 7)\n\nprint(possibilities)\n\n\t \t\t\t\t\t\t\t \t\t\t \t\t\t\t\t \t\t\t \t\t", "from sys import stdin\r\nn, m = map(int, stdin.readline().split())\r\nmod = 109 + 7\r\n\r\ns = [set() for _ in range(m)]\r\n\r\nfor i in range(n):\r\n name = stdin.readline()\r\n for j in range(m):\r\n s[j].add(name[j])\r\n\r\nbegin = 1\r\n\r\nfor i in range(m):\r\n begin = len(s[i])\r\n begin %= mod\r\n\r\nprint(begin)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Wed Jul 28 21:42:08 2021\r\n\r\n@author: lcarv\r\n\"\"\"\r\nmod = 1000000007\r\nl = []\r\nseq = list(map(int,input().strip().split()))[:2]\r\n\r\nx = seq[0]\r\ny = seq[1]\r\n\r\nfor i in range(x):\r\n s = str(input())\r\n l.append(s)\r\nans =1\r\nq = set() \r\nfor j in range(y):\r\n q.clear()\r\n for k in range(x):\r\n q.add(l[k][j])\r\n \r\n ans = len(q)ans%mod\r\n \r\nprint(ans)\r\n \r\n \r\n\r\n", "import math\r\nn,m=map(int,input().split(\" \"))\r\nres=1;\r\nar=[]\r\nfor i in range(0,n):\r\n ar.append(input())\r\ncount=0;\r\nfor i in range(0,m):\r\n count=0\r\n data={\"\"}\r\n for j in range(0,n):\r\n \r\n ch=ar[j][i]\r\n cont=ch in data\r\n if cont==False:\r\n data.add(ch)\r\n count=count+1\r\n \r\n \r\n res=(rescount)%1000000007\r\nprint(math.trunc(res)) \r\n ", "n,m=map(int,input().split())\r\nM=[input() for i in range(n) ]\r\nk=1\r\nfor i in range(m) :\r\n l=[]\r\n for j in range(n) :\r\n l.append(M[j][i])\r\n k=k(len(set(l)))\r\nprint(k%1000000007)\r\n \r\n", "from sys import stdin\ninput = stdin.readline\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\nchars_by_ind = defaultdict(set)\nfor l in range(n):\n s = input()\n for ind, ch in enumerate(s): chars_by_ind[ind].add(ch)\n\nans = 1; mod = 10 ** 9 + 7\nfor ind in range(m):\n ans = len(chars_by_ind[ind])\n if ans > mod: ans %= mod\n\nprint(ans)\n", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nx = 109 + 7\n\nn,m = list(map(int, input().split()))\n\nl = []\n\nfor i in range(n):\n l.append(input())\n\nr = []\n\nfor j in range(m):\n s = set()\n for k in range(n):\n s.add(l[k][j])\n r.append(len(s))\n\ncount = 1\nfor y in r:\n count = (count y) % x\n\nprint(count)\n \t\t\t\t\t \t \t \t \t\t\t", "num, letras = map(int, input().split(\" \"))\nmod = 1000000007\nresultado = 1\n\npalavras = []\nfor i in range(num):\n palavras.append(str(input()))\n\nfor i in range(letras):\n letras_dif = set()\n for j in range(len(palavras)):\n letras_dif.add(palavras[j][i])\n resultado = (resultado * len(letras_dif)) % mod\n\nprint(resultado)\n\n\t \t \t\t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\nstore = []\r\nfor _ in range(n):\r\n store.append(input())\r\n\r\nans = 1\r\nfor s in zip(store):\r\n ans = len(set(s))\r\n\r\nprint(ans % 1_000_000_007)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nans=1;mod=10*9+7\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(arr[j][i])\r\n ans=len(s)\r\n ans=ans%mod\r\nprint(ans)\r\n", "MOD = (10*9) + 7\nn, m = list(map(int, input().strip().split()))\narr = []\nfor i in range(n):\n\tarr.append(list(input().strip()))\n\narr = list(map(set, zip(arr)))\nctr = 1\nfor i in range(len(arr)):\n\tctr = len(arr[i])\n\tctr %= MOD\n\nprint(ctr)", "n, m = map(int, input().split())\n\nmod = 1_000_000_007 # 109 + 7\naux = [set() for _ in range(m)]\ntotal = 1\n\nfor _ in range(n):\n name = input()\n\n for i in range(m):\n aux[i].add(name[i])\n\nfor i in range(m):\n total = (total len(aux[i])) % mod\n\nprint(total)\n\n \t\t\t\t\t \t \t\t\t \t\t\t\t\t \t\t", "n , m = input().split()\r\n\r\nn,m = int(n), int(m)\r\n\r\nlt = []\r\nfor _ in range(n):\r\n s = input()\r\n lt.append(s)\r\nans = []\r\n\r\nfor k in range(m):\r\n st = set()\r\n for i in range(n):\r\n st.add(lt[i][k])\r\n ans.append(len(st))\r\na = 1 \r\nfor x in ans:\r\n a = (ax)%(109 + 7)\r\nprint(a)\r\n \r\n ", "def modm(a, b):\n m = 1000000007\n return ((a%m) (b%m)) % m\n\na, b = map(int, input().split())\ncont = [0] * b\npalavras = []\nfor i in range(a):\n palavras.append(input())\nfor i in range(b):\n b = set()\n for j in range(a):\n b.add(palavras[j][i])\n cont[i] = len(b)\n \nresultado = 1\n\nfor a in cont:\n resultado = modm(resultado, a)\nprint(resultado)\n\n \t \t\t \t \t\t \t\t\t\t\t\t\t\t \t", "n,m=map(int,input().split())\r\nli=[input() for i in range(n)]\r\nres=1 \r\nMOD=10*9+7 \r\nfor i in range(m): \r\n cnt=0\r\n ans={}\r\n for j in range(n): \r\n if ans.get(li[j][i],-1)==-1:\r\n ans[li[j][i]]=1 \r\n res=len(ans)\r\n res%=MOD \r\nprint(res%MOD)", "'''\r\nCreated on May 25, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn, m = map(int,input().split())\r\nans = 1\r\nt = [input()for i in range(n)]\r\n\r\nfor i in zip(t):\r\n ans= ans len(set(i))%1000000007\r\nprint(ans)", "n, m = [int(i) for i in input().split()] \r\na = [] \r\nans = 1\r\nfor _ in range(n): a.append(input()) \r\nfor j in range(m): \r\n s = set()\r\n for i in range(n): s.add(a[i][j]) \r\n ans= len(s) \r\nprint(ans%(109+7))", "MOD = int(1e9+7)\nn, m = map(int, input().split())\narr = list(list(input()) for _ in range(n))\nres = 1\nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(arr[j][i])\n res = res len(s) % MOD\nprint(res)\n\n\t\t \t\t\t\t \t\t\t\t \t \t\t\t\t \t \t\t \t\t", "n, m = map(int, input().split())\r\na = []\r\nmod = 10*9+7\r\nfor _ in range(n):\r\n a.append(input())\r\nans = 0\r\nd = [set() for _ in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n d[j].add(a[i][j])\r\nans = 1\r\nfor i in range(m):\r\n ans = (anslen(d[i]))%mod\r\nprint(ans)\r\n", "n, m = map(int,input().split())\r\nls = []\r\nans = 1\r\nfor i in range(n) :\r\n s = input()\r\n ls.append(s)\r\nfor i in range(m) :\r\n st = set()\r\n for j in range(n) :\r\n st.add(ls[j][i])\r\n ans = len(st)\r\n ans %= 1000000007\r\nprint(ans)", "mod = 109 + 7 \n\nn, m = map(int, input().split())\n\nwords=[]\nfor _ in range(n):\n\tword = input()\n\twords.append(word)\n\nanswer = 1\nfor i in range(m):\n\taux=[]\n\tfor j in range(n):\n\t\taux.append(words[j][i])\n\n\tanswer = len(set(aux))\n\tanswer %= mod\n\nprint(answer)\n \t\t\t \t\t \t\t \t\t\t\t \t \t\t\t", "n, m = map(int ,input().split())\r\nnames = []\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n\r\ntotal = 1\r\nfor i in range(m):\r\n letters = [0]26\r\n for j in range(n):\r\n letters[ord(names[j][i])-65] = 1\r\n \r\n total = sum(letters)\r\n \r\nprint(total%1000000007)", "n, m = map(int, input().split())\nwords = []\n\nfor i in range(n):\n word = input()\n words.append(word)\n\naux = []\n\nfor i in range(m):\n aux.append(set())\n\nfor i in range(len(words)):\n for j in range(m):\n aux[j].add(words[i][j])\n\nans = 1\nmodulo = 1000000007\n\nfor i in range(m):\n ans = anslen(aux[i]) % modulo\n\nprint(ans)\n \t \t\t\t\t\t \t\t \t\t\t\t \t\t \t\t \t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\ns = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n x = list(input().rstrip())\r\n for i in range(m):\r\n s[i].add(x[i])\r\nans = 1\r\nfor s0 in s:\r\n ans = len(s0)\r\n ans %= mod\r\nprint(ans)", "n, m = map(int, input().split())\n\nmod = 1000000007\nnomes = []\n\nfor nome in range(n):\n\tnomes.append(input())\n\ntotal = 1\nfor letra in range(m):\n\t\n\tletras = set()\n\t\n\tfor nome in nomes:\n\t\tletras.add(nome[letra])\n\t\n\t\n\ttotal = (total * len(letras)) % mod\n\nprint(total)\n\n \t\t\t\t\t \t\t \t \t \t\t\t\t \t\t \t \t\t", "R=input\nn,m=map(int,R().split())\nr=1\nfor z in zip(map(R,\" \"n)):r=len(set(z))\nprint(r%(109+7))\n\n", "n, m = map(int, input().split())\r\nst = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(m):\r\n st[i].add(s[i])\r\nans = 1\r\nmod = int(1e9 + 7)\r\nfor i in range(m):\r\n ans = len(st[i])\r\n ans %= mod\r\nprint(ans)", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\np = 10 ** 9 + 7\n\ncnt = 1 \nfor i in range(m):\n cnt = (cnt * len({s[j][i] for j in range(n)})) % p\n \nprint(cnt)\n \t\t\t \t\t\t \t\t \t\t\t\t \t\t \t \t", "import string\r\nimport math\r\nimport collections \r\n\r\n\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n tab = []\r\n for x in range(n):\r\n tab.append(input())\r\n inc = 1\r\n dif = 0\r\n for x in range(m):\r\n s = set()\r\n dif = 0\r\n for y in range(n):\r\n if not tab[y][x] in s:\r\n dif += 1\r\n s.add(tab[y][x])\r\n inc = dif\r\n inc %= 1000000007\r\n print(inc) \r\n \r\n \r\n \r\nmain()", "n, m = map(int ,input().split())\nnames = []\n\nfor _ in range(n):\n names.append(input())\n\ntotal = 1\nfor i in range(m):\n letters = [0]26\n for j in range(n):\n letters[ord(names[j][i])-65] = 1\n \n total = sum(letters)\n \nprint(total%1000000007)\n\t \t\t\t \t\t\t\t\t\t\t\t \t \t\t\t\t \t \t \t", "import sys\n\n# https://codeforcesladders.firebaseapp.com/?handle=lanadeus\n\n# makefile\n\"\"\"\nrun: code.py\n\tpython code.py < in.txt\nrun-lc: lc.py\n\tpython lc.py < in.txt\nrun-test: test.py\n\tpython test.py < in.txt\n\"\"\"\n\ndef readline():\n return sys.stdin.readline().strip()\n\n\ndef read(t=int):\n s = sys.stdin.readline()\n return list(map(t, s.strip().split(' ')))\n\n\ndef readint():\n return read()[0]\n\nmod = 109 + 7\ndef go():\n n, m = read()\n slist = []\n for i in range(n):\n slist+=[readline()]\n res = 1\n for i in range(m):\n s = len(set([slist[k][i] for k in range(n)]))\n res=s\n res%=mod\n print(res%mod)\ngo()\n", "n,m=map(int,input().split())\r\nstri=[]\r\n\r\nfor i in range(n):\r\n stri.append(input())\r\nans =int(1)\r\nmod =int(1000000007);\r\nfor i in range(m):\r\n se=set()\r\n for j in range(n):\r\n se.add(stri[j][i])\r\n ans=(anslen(se))%mod\r\nprint(ans)\r\n\r\n", "n,m = map(int,input().split())\r\nl = [input() for i in range(n)]\r\na=1\r\nmod = 7+109\r\nfor i in range(m):\r\n a=len({l[j][i] for j in range(n)})\r\nprint(a%mod)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,m=lst();ans=1;M=10*9+7\r\n a=[input() for _ in range(n)]\r\n for i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans=(anslen(s))%M\r\n print(ans)", "a, b = map(int, input().split())\r\nq = range(b)\r\nc = [set() for _ in [None] * b]\r\nz = 1\r\nfor _ in [None] * a:\r\n s = input()\r\n for i in q:\r\n c[i].add(s[i])\r\nfor i in c:\r\n z = len(i)\r\nprint(z % 1000000007)\r\n", "n, m = map(int, input().split())\r\na, v = [input() for i in range(n)], 1\r\nfor j in range(m):\r\n v = len({r[j] for r in a})\r\nprint(v % 1000000007)", "def main():\n n, m = map(int, input().split())\n l, res = [[False] * 26 for _ in range(m)], 1\n for _ in range(n):\n for i, c in enumerate(input()):\n l[i][ord(c) - 65] = True\n for cnt in map(sum, l):\n res = res * cnt % 1000000007\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "mod = 1000000007\n\nresp = 1\n\nentrada = input().split(' ')\n\nquant = int(entrada[0])\ntamanho = int(entrada[1])\naux =['']tamanho\n\nfor i in range(quant):\n s = input()\n for j in range(tamanho):\n if(s[j] not in aux[j]):\n aux[j] += s[j]\n\nfor k in aux:\n resp = (resp len(k)) % mod\n\nprint(resp)\n\t \t \t \t \t \t \t \t \t \t\t\t", "n,m = map(int,input().split(' '))\r\na = []\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ta.append(s)\r\nans = 1\r\nmod = 1000000007\r\nfor i in range(m):\r\n\th = {}\r\n\th = set(h)\r\n\tcnt = 0;\r\n\tfor j in range(n):\r\n\t\tif h.__contains__(a[j][i]) == False:\r\n\t\t\tcnt += 1\r\n\t\t\th.add(a[j][i])\r\n\tans = (anscnt)%mod\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\n\r\nmod = 1000000007\r\nnomes = []\r\nnumeros = []\r\nfor i in range(n):\r\n nomes.append(input())\r\n\r\ni = 0\r\nwhile i < m:\r\n lista = set()\r\n for k in nomes:\r\n lista.add(k[i])\r\n if(len(lista)>1):\r\n numeros.append(len(lista))\r\n i+=1\r\n\r\nres = 1\r\nfor j in numeros:\r\n res = (res j) % mod\r\nprint(res)", "import sys\r\n#import math\r\n#from queue import \r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nmod=1000000007\r\nn,m=invr()\r\nst=[set() for i in range(m)]\r\n\r\nfor i in range(n):\r\n\ts=insr()\r\n\tfor j in range(m):\r\n\t\tst[j].add(s[j])\r\n\r\ntot=1\r\nfor i in range(m):\r\n\ttot=len(st[i])\r\n\tif tot>=mod:\r\n\t\ttot%=mod\r\n\r\nprint(tot)\r\n", "def clc(): \r\n mod = pow(10,9)+7\r\n n,m = map(int,input().split())\r\n mat = []\r\n ans = 1\r\n for _ in range(n):\r\n string =input()\r\n string = [i for i in string]\r\n mat.append(string)\r\n for i in range(m):\r\n st= set()\r\n for j in range(n):\r\n st.add(mat[j][i])\r\n ans = (anslen(st))%mod\r\n print(ans)\r\n return True\r\ncc = clc()\r\nif not cc :\r\n print(\"NO\")\r\n ", "n, _ = map(int, input().split())\nnames = [input() for _ in range(n)]\n\ncnt = 1\nfor chs in zip(names):\n\tch_space = set(chs)\n\tcnt = (cnt * len(ch_space)) % 1000000007\n\nprint(cnt)", "n,m=map(int,input().split())\r\nS=[]\r\nmod=10*9 + 7\r\nfor _ in range(n):\r\n s=input()\r\n S.append(s)\r\n\r\nans=1\r\nfor i in range(m):\r\n cnt=[0 for _ in range(26)]\r\n for j in range(n):\r\n v=ord(S[j][i])-65\r\n cnt[v]=1 \r\n ans=sum(cnt)\r\n ans%=mod\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\ncounter = 1\narr = []\nfor i in range(a):\n arr.append(input())\nfor i in range(b):\n temp = set()\n for j in range(a):\n temp.add(arr[j][i])\n counter = counter * len(temp)\nprint(counter % 1000000007)\n", "n, m = map(int, input().split())\n\nnomes = []\nfor i in range(n):\n nomes.append(input())\n\nmod = 1000000007\nresp = 1\nconj = set()\nfor l in range(m):\n for p in range(n):\n conj.add(nomes[p][l])\n resp = resp * len(conj) % mod;\n conj.clear()\n \nprint(resp)\n\t \t\t\t \t \t\t \t\t \t \t\t", "n, m = map(int, input().split())\n\naux = [set() for _ in range(m)]\ncount = 1\n\nfor _ in range(n):\n string = input()\n\n for i in range(m): aux[i].add(string[i])\n\nfor j in range(m): count = (count * len(aux[j])) % (10*9+7)\n\nprint(count)\n \t\t \t \t \t \t\t\t \t\t\t\t\t \t \t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import \r\n\r\nMOD = 10*9+7\r\nN,M = map(int, input().split())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n\r\nans = 1\r\nfor i in range(M):\r\n seen = set()\r\n for j in range(N):\r\n seen.add(S[j][i])\r\n ans=len(seen)\r\n ans%=MOD\r\nprint(ans)\r\n", "# import sys\r\n# sys.stdin = open(\"F:\\\\Scripts\\\\input\",\"r\")\r\n# sys.stdout = open(\"F:\\\\Scripts\\\\output\",\"w\")\r\n\r\n\r\nMOD = 10*9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nn , m = I()\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\nd = [0]m\r\nfor i in range(m):\r\n\ttemp = set()\r\n\tfor j in range(n):\r\n\t\ttemp.add(l[j][i])\r\n\td[i] = len(temp)\r\np = 1\r\nfor i in d:\r\n\tp = pi%MOD\r\nprint(p)", "def solve():\r\n mod=int(1e9+7)\r\n line=input().split(' ')\r\n n=int(line[0])\r\n m=int(line[1])\r\n\r\n lista = [set() for _ in range(m)]\r\n for i in range(n):\r\n string=input();\r\n for j in range(m):\r\n if(string[j] in lista[j]):\r\n pass\r\n else:\r\n lista[j].add(string[j])\r\n result=1\r\n for i in range(m):\r\n result=resultlen(lista[i])\r\n result=result%mod\r\n print(result)\r\n\r\nsolve()", "n,m=map(int,input().split())\r\na=[input() for x in range(n)]\r\nans=1\r\nfor ch_ch in zip(a):\r\n lenalf=len(set(ch_ch))\r\n ans=lenalf\r\nprint(ans%(109+7))\r\n", "n, m = map(int, input().split())\r\nmod = 109 + 7\r\na = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n\ts = input()\r\n\tfor i in range(m):\r\n\t\ta[i].add(s[i])\r\nans = 1\r\nfor i in a:\r\n\tans = ans * len(i) % mod\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nwords = []\r\n \r\nfor i in range(n):\r\n word = input()\r\n words.append(word)\r\n \r\naux = []\r\n \r\nfor i in range(m):\r\n aux.append(set())\r\n \r\nfor i in range(len(words)):\r\n for j in range(m):\r\n aux[j].add(words[i][j])\r\n \r\nans = 1\r\nmodulo = 1000000007\r\n \r\nfor i in range(m):\r\n ans = anslen(aux[i]) % modulo\r\n \r\nprint(ans)", "import math\r\nn, m = map(int, input().split())\r\nl = []\r\nans = 1\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nfor i in range(m):\r\n st = set()\r\n for j in range(n):\r\n st.add(l[j][i])\r\n ans = len(st)\r\n ans = (ans % 1000000007)\r\nprint(ans)\r\n", "n, k=map(int, input().split())\r\nm=[]\r\nfor _ in range(n):\r\n b=list(input())\r\n m.append(b)\r\nres=1\r\nmod=10*9+7\r\nfor i in range(k):\r\n aux=\"\"\r\n for j in range(n):\r\n aux+=m[j][i]\r\n res = len(set(aux))\r\n res %= mod\r\nprint(res)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\ncount=1\r\nfor i in range(m):\r\n l1=set()\r\n for j in range(n):\r\n l1.add(l[j][i])\r\n count=len(l1)\r\nprint(count%(109+7))\r\n ", "mod = 1e9 + 7;\n\nn, m = map(int,input().split())\n\nletras = [[] for i in range(m)]\n\ndef existe(valor, conjunto):\n if valor in conjunto:\n return True\n return False\n\nfor palavra in range(n):\n pa = input()\n for letra in range(m):\n if not existe(pa[letra], letras[letra]):\n letras[letra].append(pa[letra])\n\nv = []\nfor p in letras:\n v.append(len(p))\n\nres = 1\nfor q in v:\n res = ((res % mod) (q % mod)) % mod\n\nprint(int(res))", "n,m = list(map(int,input().split()))\nd = {}\np = int(1e9+7)\nnumStrings = 1\nfor i in range(n):\n s = list(input())\n for j in range(len(s)):\n if j not in d:\n d[j] = set()\n d[j].add(s[j])\nfor i in range(m):\n numStrings = (numStrings * len(d[i])) % p\nprint(numStrings)\n \t \t \t\t \t\t \t \t\t\t \t\t\t\t", "import sys\r\nfrom math import \r\nfrom collections import \r\ninp = lambda: sys.stdin.buffer.readline().decode().strip()\r\nout=sys.stdout.write\r\n# n=int(inp())\r\n# arr=list(map(int,inp().split()))\r\nm,n=map(int,inp().split())\r\ncols=[set() for _ in range(n)]\r\nfor _ in range(m):\r\n s=inp()\r\n for i in range(n):\r\n cols[i].add(s[i])\r\nans=1\r\nmod=10*9+7\r\nfor x in cols:\r\n ans=(anslen(x))%mod\r\nprint(ans)\r\n\r\n", "n,y=map(int,input().split())\r\nl=[]\r\nt = [input() for i in range(n)]\r\nans=1\r\n\r\n\r\nfor i in zip(t):\r\n\t#print(i)\r\n\tans = (ans len(set(i))) % (10*9+7)\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\n\r\nv = [\"\"] n\r\nfor i in range(n):\r\n v[i] = input()\r\n\r\nans = 1\r\nMOD = 10 ** 9 + 7\r\nfor i in range(0, m):\r\n s = set()\r\n for j in range(0, n): \r\n s.add(v[j][i])\r\n ans = len(s) % MOD\r\n ans %= MOD\r\nprint(ans)", "MOD = int(1e9 + 7)\ndef main():\n global mod\n (n, m) = map(int, input().split(' '))\n l = [set() for i in range(m)]\n for i in range(n):\n for j, c in enumerate(input()):\n l[j].add(c)\n ret = 1\n for i, s in enumerate(l):\n ret = (ret len(s)) % MOD\n return ret \n\nprint(main())\n", "[n, m] = list(map(int, input().split()))\r\narr = []; c = 1; MOD = 10*9 + 7\r\nfor j in range(m): arr.append(set())\r\nfor i in range(n):\r\n name = input()\r\n for j in range(m): arr[j].add(name[j])\r\nfor i in range(m): c = (c%MOD)(len(arr[i])%MOD)%MOD\r\nprint(c)", "n, m = map(int, input().split())\n\np = []\nresult = 1\nfor i in range(n):\n p.append(input())\n\nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(p[j][i])\n result = len(s)\nprint(result % 1000000007)\n \t \t \t\t \t \t \t\t\t\t \t\t \t\t \t\t", "n, m = map(int, input().split())\r\nmod = 10 * 9 + 7\r\narr = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(m):\r\n arr[i].add(s[i])\r\nans = 1\r\nfor i in arr:\r\n ans = ans * len(i) % mod\r\nprint(ans)", "mod = 1e9+7\r\n \r\nn, m = map(int, input().split())\r\ns = [input().strip() for _ in range(n)]\r\n \r\nndp = 1\r\nfor j in range(m):\r\n c = 0\r\n l = [0] * 200\r\n for i in range(n):\r\n if l[ord(s[i][j])] != 1:\r\n l[ord(s[i][j])] += 1\r\n c += 1\r\n ndp = (ndp * c) % mod\r\n \r\nndp = ndp % mod\r\nprint(int(ndp))\r\n ", "n, m = map(int, input().split())\n\nnames = []\nfor _ in range(n):\n names.append(input())\n\nnames = list(zip(names))\nresult = 1\n\n\nfor j in range(m):\n counter = 0\n unique_letters = []\n column = list(names[j])\n\n for i in range(n):\n letter = column[i]\n if letter not in unique_letters:\n unique_letters.append(letter)\n counter += 1\n\n result = counter\n\nprint(result % (10 ** 9 + 7))\n\n \t\t \t \t \t \t \t\t\t \t\t \t", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n,m = get_ints_in_variables()\r\n mp = {}\r\n for _ in range(0, n):\r\n st = input()\r\n for j in range(0, m):\r\n if j not in mp:\r\n mp[j] = {}\r\n if st[j] not in mp[j]:\r\n mp[j][st[j]] = st[j]\r\n else:\r\n if st[j] not in mp[j]:\r\n mp[j][st[j]] = st[j]\r\n \r\n res = 1\r\n mod = 1000000007\r\n for i in range(0, m):\r\n res=(res%modlen(mp[i])%mod)%mod\r\n\r\n print(res)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from functools import reduce\n\nMOD = 10 * 9 + 7\na = []\nn, _ = map(int, input().split())\nfor i in range(int(n)):\n a.append(list(input()))\nat = zip(a)\np = list(map(lambda x: len(set(x)), at))\nprint(reduce(lambda x, y: x y % MOD, p, 1))\n", "mod=10*9+7\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n a=input()\r\n arr.append(a)\r\nans=[]\r\nfor i in range(m):\r\n arr1=[]\r\n for j in range(len(arr)):\r\n arr1.append(arr[j][i])\r\n ans.append(len(set(arr1)))\r\np=1\r\nfor i in range(len(ans)):\r\n p=ans[i]\r\nprint(p%mod)\r\n", "n, m = map(int, input().split())\r\ns = list()\r\nfor i in range(n):\r\n s.append(input())\r\nans = 1\r\nfor j in range(m):\r\n d = set()\r\n for i in range(n):\r\n d.add(s[i][j])\r\n ans = len(d)\r\nprint(ans % 1000000007)", "n, m = map(int, input().split())\nnomes = [input() for i in range(n)]\nresultado = 1\nmod = 1000000007\nfor i in range(m):\n resultado = (resultado len(set([letra[i] for letra in nomes])) % mod)\nprint(resultado)\n", "N, M = map(int, input().split())\r\nA = []\r\nfor _ in range(N):\r\n A.append(input())\r\nans = 1\r\nfor i in range(M):\r\n tmp = set()\r\n for x in A:\r\n tmp.add(x[i])\r\n ans = ans * len(tmp) % int(1e9 + 7)\r\nprint(ans)", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Tue Jun 18 14:28:18 2019\r\n\r\n@author: sj\r\n\"\"\"\r\n\r\nn,k=input().split(\" \")\r\nn=int(n)\r\nk=int(k)\r\na=[]\r\nfor i in range(0,n):\r\n b=list(input())\r\n a.append(b)\r\nans=1\r\nmod=10*9+7\r\nfor i in range(0,k):\r\n s=\"\"\r\n for j in range(0,n):\r\n s+=a[j][i]\r\n ans=len(set(s))\r\n ans%=mod\r\nprint(ans)", "n, m = map(int, input().split())\r\nnames, ans = [set() for _ in range(m)], 1\r\nfor _ in range(n):\r\n name = input().strip()\r\n for i in range(m):\r\n names[i].add(name[i])\r\nfor i in range(m): # basic permutations\r\n ans = ans * len(names[i])\r\n ans %= 1000000007\r\nprint(ans)\r\n", "def multiplicacaoModular(a, b, mod):\n return ((a % mod) * (b % mod)) % mod\n\n# ----------------> MAIN <--------------------\nqtdNames, tamanho = input().split()\nqtdNames = int(qtdNames)\ntamanho = int(tamanho)\n\nmod = 1000000007\ncolunas = {}\nfor i in range(tamanho):\n colunas[i + 1] = set()\n\nfor i in range(qtdNames):\n name = input()\n for j in range(1, tamanho + 1):\n colunas[j].add(name[j - 1])\n\ntotal = 1\nfor key in colunas:\n total = multiplicacaoModular(total, len(colunas[key]), mod)\n\nprint(total)\n\t\t\t\t \t\t \t\t\t \t \t\t\t\t \t", "n, m = map(int, input().split())\r\nans = 1\r\nt = [input() for i in range(n)]\r\nfor i in zip(t):\r\n ans = (ans len(set(i))) % (109+7)\r\nprint(ans)", "mod = 109 + 7\n\n[n, m] = list(map(int, input().split(' ')))\npermuts = []\n\nfor i in range(n):\n permuts.append(input())\n\nproduct = 1\n\nfor i in range(m):\n permutI = {}\n for j in range(n):\n c = permuts[j][i]\n if c not in permutI:\n permutI[c] = 0\n permutI[c] += 1\n product = (product * len(permutI)) % mod\n\nprint(product)\n\n\n \t \t \t\t \t \t \t \t \t\t \t\t", "n,m=map(int,input().split())\r\nnum=[]\r\nfor i in range(n):\r\n\tnum.append(input())\r\nans=1\r\nx=1000000007\r\nfor i in range(m):\r\n\tnum1=[]\r\n\tfor j in range(n):\r\n\t\t# print(num[j][i])\r\n\t\tif(num[j][i] not in num1):\r\n\t\t\tnum1.append(num[j][i])\r\n\tans=len(num1)\r\n\t# print(num1)\r\n\tans=ans%x\r\nprint(ans)", "mod = 10 * 9 + 7\r\n\r\ndef add(x, y):\r\n global mod\r\n return (x + y) % mod\r\n\r\ndef sub(x, y):\r\n global mod\r\n return ((x - y) % mod + mod) % mod\r\n\r\ndef mul(x, y):\r\n global mod\r\n return (x * y) % mod\r\n\r\ndef binpow(x, y):\r\n global mod\r\n if y == 0:\r\n return 1\r\n elif y % 2 == 0:\r\n z = binpow(x, y // 2)\r\n return mul(z, z)\r\n else:\r\n return mul(binpow(x, y - 1), x)\r\n\r\ndef divide(x, y):\r\n global mod\r\n return mul(x, binpow(y, mod - 2))\r\n\r\nn, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nans = 1\r\nfor i in range(m):\r\n t = set()\r\n for j in range(n):\r\n t.add(s[j][i])\r\n ans = mul(ans, len(t))\r\n\r\nprint(ans)", "n, _ = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n\r\ncnt = 1\r\nfor chs in zip(names):\r\n\tch_space = set(chs)\r\n\tcnt = (cnt len(ch_space)) % 1000000007\r\n\r\nprint(cnt)", "n, m = map(int, input().split())\nv = [input() for _ in range(n)]\n\nans = 1\nmod = 1000000007\n\nfor i in range(m):\n s = set()\n for j in range(len(v)):\n p = v[j]\n s.add(p[i])\n\n count = len(s)\n ans = count\n ans %= mod\n s.clear()\n\nprint(ans % mod)\n \t\t \t\t \t\t\t \t \t \t \t\t\t\t\t\t\t \t", "n, m = map(int, input().split())\r\nmod = 1000000007\r\n\r\ncaracteres = []\r\nfor _ in range(m):\r\n caracteres.append(set())\r\n\r\nfor _ in range(n):\r\n nome = input()\r\n for i in range(m):\r\n caracteres[i].add(nome[i])\r\n\r\nresult = 1\r\n\r\nfor i in range(m):\r\n result = len(caracteres[i])\r\n\r\nprint(result % mod)\r\n", "n,k=input().split(\" \")\nn=int(n)\nk=int(k)\na=[]\nfor i in range(0,n):\n b=list(input())\n a.append(b)\nans=1\nmod=10*9+7\nfor i in range(0,k):\n s=\"\"\n for j in range(0,n):\n s+=a[j][i]\n ans=len(set(s))\n ans%=mod\nprint(ans)\n\t \t \t \t\t\t \t \t\t \t \t", "n,m = map(int,input().split())\r\nmod = (10*9) + 7 \r\nli = [set() for _ in range(m)]\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n li[j].add(s[j])\r\n \r\nli = [len(i) for i in li]\r\n\r\nans = li[0]\r\n\r\nfor i in range(1,m):\r\n ans = (ansli[i])%mod\r\n \r\nprint(ans)", "mode=\"filee\"\r\n#copied.\r\nif mode==\"file\":f=open(\"test.txt\",\"r\")\r\nget = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\ngets = lambda :[str(x) for x in (f.readline()[:-1] if mode==\"file\" else input()).split()]\r\n\r\nn, m = get()\r\nlst = [gets() for _ in range(n)]\r\nfor i in range(n):\r\n lst[i] = lst[i][0]\r\nlst = [len(set(_)) for _ in zip(lst)]\r\nans = 1\r\nmod = 109 + 7\r\nfor v in lst:\r\n ans = (ans v) % mod\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\narr = [input() for _ in range(n)]\r\n\r\nans = 1\r\n\r\nfor col in range(m):\r\n s = set()\r\n for i in range(n):\r\n s.add(arr[i][col])\r\n ans = len(s)\r\n\r\nprint(ans % (10 * 9 + 7))\n# Sat Apr 30 2022 14:27:01 GMT+0000 (Coordinated Universal Time)\n", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ni=0\r\nans=1\r\nwhile(i<m):\r\n options=set()\r\n c=0\r\n j=0\r\n while(j<n):\r\n if(a[j][i] not in options):\r\n c+=1\r\n options.add(a[j][i])\r\n j+=1\r\n ans=(ansc)%(1000000007)\r\n i+=1\r\nprint(ans)\r\n", "mod = 1000000007\nn,m = list(map(int, input().split()))\ncnt = []\nfor i in range(m):\n cnt.append(set())\nfor i in range(n):\n name = input()\n for j in range(m):\n cnt[j].add(name[j])\nresp = 1\nfor i in cnt:\n resp = resp len(i) % mod\nprint(resp)\n \t \t\t \t\t\t\t\t\t \t \t \t \t\t", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 29/04/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, m = iia()\r\narr = []\r\nfor i in range(n):\r\n arr.append(is1())\r\nres = 1\r\nfor i in range(m):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(arr[j][i])\r\n res = len(temp)\r\n res %= mod\r\nprint(res)\r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nan,md=1,109+7\r\nn,m=I()\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input().strip())\r\nfor i in range(m):\r\n\ts=set()\r\n\tfor j in range(n):\r\n\t\ts.add(l[j][i])\r\n\tan=(anlen(s))%md\r\nprint(an)", "import sys\r\n#input=sys.stdin.buffer.readline\r\nt=1 \r\nmod=10*9+7\r\nfor __ in range(t):\r\n a=[]\r\n #n=int(input())\r\n n,m=map(int,input().split())\r\n for i in range(n):\r\n a.append(input())\r\n ans=1\r\n for i in range(m): \r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans=(ans)(len(s)%mod)\r\n ans%=mod\r\n print(ans) ", "n, m = map(int,input().split())\r\nstring = list()\r\nfor i in range(n):\r\n string.append(input())\r\ni, ans, mod = 1, 1, 10*9 + 7\r\nwhile i<=m:\r\n j, temp = 0, set()\r\n while j<n:\r\n temp.add(string[j][i-1])\r\n j += 1\r\n ans = (ans len(temp))%mod\r\n i += 1\r\nprint(ans)", "arr=[int(x) for x in input().split()]\r\nn,m=arr[0],arr[1]\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nans=1 \r\nfor j in range(m):\r\n s=set()\r\n count=0\r\n for i in range(n):\r\n if(arr[i][j] not in s):\r\n s.add(arr[i][j])\r\n count+=1\r\n ans=count\r\nprint(ans%1000000007) ", "MODULO = 1000000007\n\n\nclass IntModulo:\n def __init__(self, modulo, value=0):\n self.modulo = modulo\n self.value = value\n\n def __imul__(self, other):\n if not isinstance(other, IntModulo):\n other = IntModulo(self.modulo, value=other)\n\n if self.modulo != other.modulo:\n raise RuntimeError()\n\n self.value = self.value other.value % self.modulo\n\n return self\n\n def __str__(self):\n return str(self.value)\n\n def __repr__(self):\n return repr(self.value)\n\n\ndef solve(names):\n n = len(names)\n m = len(names[0])\n answer = IntModulo(MODULO, value=1)\n\n for i in range(m):\n answer = len({names[j][i] for j in range(n)})\n\n return answer\n\n\ndef main():\n while True:\n try:\n n, m = map(int, input().split())\n names = [input() for _ in range(n)]\n except EOFError:\n break\n else:\n print(solve(names))\n\n\nif __name__ == '__main__':\n main()\n", "a, b = map(int, input().split())\r\nc = []\r\nv = []\r\nk = 1\r\nfor i in range(a):\r\n s = input()\r\n c.append(s)\r\nfor i in range(b):\r\n v = []\r\n for j in range(a):\r\n v.append(c[j][i])\r\n v = list(set(v))\r\n k = k len(v) % 1000000007\r\nprint(k)", "n, m = map(int, input().split())\nmodulo = (10 ** 9) + 7\nlista = []\nsaida = 1\n\nfor i in range(n):\n lista.append(input())\n\nfor j in range(m):\n contaletra = set()\n for k in lista:\n contaletra.add(k[j])\n\n saida = saidalen(contaletra)%modulo\n\nprint(saida)\n\t \t\t \t\t \t\t \t\t\t \t \t \t\t\t\t\t \t", "import sys\r\nimport math\r\nimport random\r\ninput = sys.stdin.readline\r\nM = 10 * 9 + 7\r\nn, m = [int(xx) for xx in input().split()]\r\na = [[] for i in range(m)]\r\nfor i in range(n):\r\n s = input()[:-1]\r\n for j in range(m):\r\n a[j].append(s[j])\r\nans = 1\r\nfor i in range(m):\r\n ans = ans * len(set(a[i]))\r\n ans %= M\r\nprint(ans)\r\n", "n, m = input().split()\nn = int(n)\nm = int(m)\nl = [set() for i in range(m)]\nfor i in range(n):\n p = input()\n for i in range(m):\n l[i].add(p[i])\n \nR = 1\nfor e in l:\n R = len(e)\n \nMOD = 1000000000 + 7\nprint(R%MOD)\n \t \t\n\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t", "def multiplicacaoModular(a, b, mod):\r\n return ((a % mod) (b % mod)) % mod\r\n\r\n# ----------------> MAIN <--------------------\r\nqtdNames, tamanho = input().split()\r\nqtdNames = int(qtdNames)\r\ntamanho = int(tamanho)\r\n\r\nmod = 1000000007\r\ncolunas = {}\r\nfor i in range(tamanho):\r\n colunas[i + 1] = set()\r\n\r\nfor i in range(qtdNames):\r\n name = input()\r\n for j in range(1, tamanho + 1):\r\n colunas[j].add(name[j - 1])\r\n\r\ntotal = 1\r\nfor key in colunas:\r\n total = multiplicacaoModular(total, len(colunas[key]), mod)\r\n\r\nprint(total)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n,m=[int(x) for x in input().split()]\r\n mod=10*9+7\r\n arr=[]\r\n ans=1\r\n \r\n for i in range(n):\r\n s=input()\r\n #print(s)\r\n arr.append(s)\r\n #print(len(arr[0]))\r\n #print(len(arr))\r\n for i in range(m):\r\n v=set()\r\n for j in range(n):\r\n #print(2)\r\n v.add(arr[j][i])\r\n #print(2)\r\n ans=len(v)\r\n print(ans%mod)", "MOD = int(1e9+7)\r\nn, m = map(int, input().split())\r\ncnt = list(set() for i in range(m))\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n cnt[j].add(s[j])\r\nres = 1\r\nfor i in cnt:\r\n res = res * len(i) % MOD\r\nprint(res)\r\n", "n,m=list(map(int,input().split()))\r\narr=[input() for _ in range(n)]\r\nmod=10*9 +7 \r\nans=1\r\nfor i in range(m):\r\n\tli=[]\r\n\tfor j in range(n):\r\n\t li.append(arr[j][i])\r\n\tans=((ans%mod )(len(set(li))%mod))%mod\r\nprint(ans)", "n, m = map(int, input().split())\n\na = []\nfor i in range(n):\n a.append(input())\n\nMOD = int(1e9 + 7)\nans = 1\n\nfor j in range(m):\n s = set()\n for i in range(n):\n s.add(a[i][j])\n ans = (ans * len(s)) % MOD\n\nprint(ans)\n", "R=input\r\nn,m=map(int,R().split())\r\nr=1\r\nfor z in zip(map(R,\" \"n)):r=rlen(set(z))%(109+7)\r\nprint(r)", "from collections import Counter\r\nimport itertools\r\nfrom functools import lru_cache\r\nimport sys\r\nimport math\r\n###############################################################################\r\n#Helper\r\ndef helper():\r\n pass\r\n###############################################################################\r\n#Solver\r\ndef solve():\r\n n, m = map(int, input().split(' '))\r\n words = []\r\n for _ in range(n): words.append(input())\r\n cnt = [0 for i in range(m)]\r\n seen = [set() for i in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n if words[i][j] not in seen[j]:\r\n cnt[j] += 1\r\n seen[j].add(words[i][j])\r\n ans = 1\r\n for e in cnt: ans = e\r\n print(ans%((int(1e9)+7)))\r\n###################### #########################################################\r\n#Driver\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n###############################################################################", "n,m=map(int,input().split())\r\ns=1\r\nk=[]\r\nfor i in range(n):\r\n a=input()\r\n k.append(a)\r\nfor i in range(m):\r\n k1=set()\r\n for j in range(n):\r\n if k[j][i] not in k1:\r\n k1.add(k[j][i])\r\n s=len(k1)\r\nif s<1000000007:\r\n print(s)\r\nelse:\r\n print(s%1000000007)\r\n", "n, m = map(int, input().split())\nalive = [[False for i in range(26)] for j in range(m)]\nfor _ in range(n):\n s = input()\n assert(len(s) == m)\n for i in range(m):\n alive[i][ord(s[i]) - ord('A')] = True\n\nmd = int(1e9) + 7\n\nans = 1\nfor i in range(m):\n t = 0\n for j in range(26):\n t += alive[i][j]\n ans = (ans t) % md\n\nprint(ans)\n", "\nmod = 1000000007\n\nn,m = map(int, input().split())\n\nmatriz = []\nfor _ in range(n):\n name = list(input())\n matriz.append(name)\n\nm = len(matriz)\nn = len(matriz[0])\ntemp = set()\nans = 1\nfor col in range(n):\n for row in range(m):\n temp.add(matriz[row][col])\n ans= len(temp)\n temp = set()\n \nprint(ans%mod)\n\n\n\t \t\t\t \t\t \t\t\t \t\t\t\t \t \t \t\t", "n, m = map(int, input().split())\r\nd = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n for i, x in enumerate(input()):\r\n d[i].add(x)\r\nr = 1\r\nmod = int(1e9)+7\r\nfor i in range(m):\r\n r = len(d[i])\r\n r %= mod\r\nprint(r)", "import math\n\ndef main():\n n, m = [int(x) for x in input().split()]\n MAXX = 1000000007\n words = []\n for x in range(n):\n words.append(input())\n ans = 1\n for x in range(m):\n found = set()\n for word in words:\n found.add(word[x])\n ans = (ans % MAXX) * (len(found) % MAXX) % MAXX\n print(ans)\n \nmain()\n \t \t\t \t\t\t \t\t \t \t\t\t\t", "'''\r\n2 3\r\nAAB\r\nBAA\r\n'''\r\n\r\nn,m = map(int, input().split())\r\na = [0]n\r\ncnt = [set() for i in range(100)]\r\nfor i in range(n):\r\n\ta[i] = list(input())\r\n\tfor j in range(m):\r\n\t\tcnt[j].add(a[i][j])\r\n\r\nfor i in range(m):\r\n\tcnt[i] = len(cnt[i])\r\nfor i in range(1,m):\r\n\tcnt[i]=cnt[i-1]\r\n\tcnt[i]%=1000000007\r\nprint (cnt[m-1])", "import sys,os,io\r\nfrom math import log, gcd\r\nfrom collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\n\r\n\r\n# Iterative Python3 program \r\n# to compute modular power \r\n\r\n# Iterative Function to calculate \r\n# (x^y)%p in O(log y) \r\ndef power(x, y, p) : \r\n\tres = 1\r\n\tx = x % p \r\n\tif (x == 0) : \r\n\t\treturn 0\r\n\twhile (y > 0) : \r\n\t\tif ((y & 1) == 1) : \r\n\t\t\tres = (res * x) % p \r\n\t\ty = y >> 1\t # y = y/2 \r\n\t\tx = (x * x) % p \t\t\r\n\treturn res \r\n\r\n\r\ndef si():\r\n return input()\r\n\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef prefix_sum(arr):\r\n r = [0] * (len(arr)+1)\r\n for i, el in enumerate(arr):\r\n r[i+1] = r[i] + el\r\n return r\r\n\r\ndef divideCeil(n,x):\r\n if (n%x==0):\r\n return n//x\r\n return n//x+1\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef li():\r\n return list(map(int,input().split()))\r\n\r\nmod = 1000000007\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n,k = li()\r\n l = []\r\n for i in range(n):\r\n l.append(si())\r\n l.sort()\r\n res = 1\r\n k1 = k\r\n for i in range(k):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(l[j][i])\r\n res = (res * len(temp))%mod\r\n print(res)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\na=list(map(int,input().split()))\r\nn=a[0]\r\nm=a[1]\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npos=[]\r\nfor i in range(m):\r\n pos.append(1)\r\nd={}\r\nfor j in range(m):\r\n d[j]=[l[0][j]]\r\n for i in range(1,n):\r\n if l[i][j] not in d[j]:\r\n pos[j]+=1\r\n d[j].append(l[i][j])\r\n\r\n\r\n\r\n\r\nres=1\r\nfor j in pos:\r\n res=j\r\nres=(res%(pow(10,9)+7))\r\nprint(res)\r\n", "import os\r\nimport sys\r\nimport math\r\nfrom collections import deque, defaultdict\r\nimport bisect\r\nimport heapq\r\n\r\n#sys.setrecursionlimit(100000)\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef multiple():\r\n a = map(int, input().split())\r\n return a\r\n\r\n\r\ndef array():\r\n a = input().split()\r\n return a\r\n\r\n\r\ndef intarray():\r\n a = list(map(int, input().split()))\r\n return a\r\n\r\n\r\ndef intinput():\r\n n = int(input())\r\n return n\r\n\r\n\r\ndef strinput():\r\n s = input().strip()\r\n return s\r\n\r\n\r\ndef isPrime(n):\r\n val = int(math.sqrt(n)) + 1\r\n for i in range(2, val):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solution():\r\n # MOD = 998244353\r\n MOD = 1000000007\r\n n,m = multiple()\r\n a = []\r\n for i in range(n):\r\n a.append(strinput())\r\n ans = 1\r\n for i in range(m):\r\n s = set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans = len(s)\r\n ans = ans%MOD\r\n print(ans)\r\n return\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n # print(\"Case #%s:\" % str(_ + 1), end=' ')\r\n solution()\r\n", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\nd = defaultdict(set)\r\nfor i in range(n):\r\n a = input()\r\n for j in range(m):\r\n d[j].add(a[j])\r\nans = 1\r\nmod = 1000000007\r\nfor i in d:\r\n ans= len(d[i])\r\n ans%=mod\r\nprint(ans)\r\n \r\n", "a,b=map(int,input().split())\r\nans=[]\r\ntotal=1\r\npri=pow(10,9)+7\r\nfrom collections import \r\nfor i in range(a):\r\n x=input()\r\n ans.append(x)\r\nfor i in range(b):\r\n al=defaultdict(int)\r\n c1=0\r\n for j in range(len(ans)):\r\n if(al[ans[j][i]]==0):\r\n al[ans[j][i]]+=1\r\n c1+=1\r\n total=totalc1\r\n total%=pri\r\nprint(total)\r\n", "k = 1000000007\r\ndef mul(a,b):\r\n return ((a%k)(b%k))%k\r\n\r\n\r\nn,m = [int(i) for i in input().split()]\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nqtd = 1\r\nfor i in range(m):\r\n tra = []\r\n\r\n for j in range(n):\r\n tra.append(l[j][i])\r\n \r\n \r\n qtd = mul(qtd,len(set(tra)))\r\n \r\nprint(qtd)\r\n", "n, m = map(int,input().split())\n\nm_uc = [input() for i in range(n)]\ncount = 1\nfor i in range(m) :\n l = list()\n for j in range(n) :\n l.append(m_uc[j][i])\n count = (len(set(l)))\n\nprint(count % 1000000007)\n\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t\t\t\t\t \t \t", "n, tam = list(map(int, input().split()))\n\nposicoes = dict()\n\nfor i in range(tam):\n posicoes[i] = set()\n\n\nfor _ in range(n):\n nome = input()\n for i in range(len(nome)):\n posicoes[i].add(nome[i])\n\nretorno = 1\n\nfor pos in posicoes:\n retorno = retornolen(posicoes[pos])\n\nprint(retorno%(10*9 + 7))\n\t\t \t\t \t\t\t\t \t\t\t\t \t\t\t \t \t \t", "MOD = int(1e9 + 7)\nn, m = (int(x) for x in input().split())\n\noptions = [set() for _ in range(m)]\n\nfor _ in range(n):\n name = input()\n for i in range(m):\n options[i].add(name[i])\n\nans = 1\nfor s in options:\n ans = (ans len(s)) % MOD\nprint(ans)", "n, m = map(int,input().split())\nmod = 1000000007\nseq = []\npassados = \"\"\ncont = 0\nfatores = 1\nfor e in range(n):\n seq.append(list(map(str, input())))\n\nfor i in range(m):\n for j in range(n):\n if(seq[j][i] not in passados):\n cont += 1\n passados += seq[j][i]\n fatores = cont%mod\n passados = \"\"\n cont = 0\nprint(fatores%mod)\n\t\t \t\t\t \t\t \t \t\t\t \t\t \t\t\t \t \t \t", "M = 1000000007\nn,m = map(int, input().split())\n \np = []\nres = 1\nfor i in range(n):\n p.append(input())\n \n \nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(p[j][i])\n res = len(s)\nprint(int(res % M))\n\t\t\t \t\t\t\t\t \t\t \t\t \t\t \t \t\t \t \t", "def mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef li():\r\n return list(mi())\r\n\r\n\r\nN, M = mi()\r\n\r\nnames = []\r\n\r\nfor i in range(N):\r\n names.append(str(input()))\r\n\r\ncount = 1\r\n\r\nfor i in range(M):\r\n\r\n curr = set()\r\n\r\n for j in range(N):\r\n curr.add(names[j][i])\r\n\r\n count = len(curr)\r\n count %= 1000000007\r\n\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nans=[set() for i in range(m)]\r\nfor i in range(n):\r\n a=input()\r\n for j in range(m):\r\n ans[j].add(a[j])\r\nans1=1\r\n#print(ans)\r\nfor i in range(len(ans)):\r\n #print(len(ans[i]))\r\n ans1=(ans1len(ans[i]))%(109+7)\r\nprint(ans1%(109+7))\r\n", "MOD = 1000000007\n\nnum_names, name_length = map(int, input().split())\nnames = [input().strip() for _ in range(num_names)]\n\ntotal_permutations = 1\nfor i in range(name_length):\n distinct_chars_count = 0\n char_occurrences = [0] * 200\n for j in range(num_names):\n current_char = names[j][i]\n if char_occurrences[ord(current_char)] == 0:\n distinct_chars_count += 1\n char_occurrences[ord(current_char)] = 1\n total_permutations = (total_permutations * distinct_chars_count) % MOD\n\ntotal_permutations = total_permutations % MOD\nprint(total_permutations)\n \t\t\t\t\t\t\t\t \t\t\t\t \t\t \t \t", "new_mod = 1000000007\n\nnum_rows, num_cols = map(int, input().split())\nstrings = [input().strip() for _ in range(num_rows)]\n\nnew_dp = 1\n\nfor col in range(num_cols):\n count = 0\n letter_list = [0] * 200\n\n for row in range(num_rows):\n if letter_list[ord(strings[row][col])] != 1:\n letter_list[ord(strings[row][col])] += 1\n count += 1\n\n new_dp = (new_dp * count) % new_mod\n\nnew_dp = new_dp % new_mod\nprint(int(new_dp))\n \t \t\t \t\t\t \t \t \t\t \t\t\t\t \t \t", "n, m = map(int, input().split(\" \"))\n\nmod = (10*9)+7\n\nmydict = {}\nfor i in range(n):\n ar = input()\n\n for e in range(m):\n if (e+1 not in mydict.keys()):\n mydict[e+1] = set(ar[e])\n else:\n mydict[e+1].add(ar[e])\nans = 1\nfor n in range(len(mydict)):\n ans = len(mydict[n+1])\n\nprint(ans % mod)\n", "def le_nomes(n):\n aux1 = []\n for i in range(n):\n aux1.append(input())\n return aux1\n\nnum_de_nomes, tamanho_dos_nomes = map(int, input().split())\n\nnomes = le_nomes(num_de_nomes)\nnum_de_dif = 1\n\nfor i in range(tamanho_dos_nomes):\n\taux2 = []\n\tfor j in range(num_de_nomes):\n\t\taux2.append(nomes[j][i])\n\n\tnum_de_dif = num_de_dif * len(set(aux2))\n\tnum_de_dif = num_de_dif % 1000000007\n\nprint(num_de_dif)\n\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t \t\t\t", "mod=10*9+7\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nans=1\r\nfor j in range(m):\r\n s=set()\r\n for i in range(n):\r\n s.add(l[i][j])\r\n ans=(anslen(s))%mod\r\nprint(ans%mod)", "n, _ = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n \r\ncnt = 1\r\nfor chs in zip(names):\r\n\tcnt = len(set(chs))\r\n \r\nprint(cnt % 1000000007)", "n,m = map(int, input().strip().split(' '))\r\nm1=[]\r\nfor j in range(n):\r\n s=input()\r\n m1.append(s)\r\nm2=[]\r\nfor i in range(m):\r\n s1=\"\"\r\n for j in range(n):\r\n s1+=m1[j][i]\r\n m2.append(s1)\r\np=1\r\nfor j in range(m):\r\n p=len(list(set(list(m2[j]))))\r\nprint(p%1000000007)\r\n \r\n \r\n \r\n ", "import sys\r\n#sys.setrecursionlimit(107)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Pocket_Book():\r\n n, m = invr()\r\n different_letters_dict = {}\r\n for pos in range(m):\r\n different_letters_dict[pos] = set()\r\n \r\n for i in range(n):\r\n name = insr()\r\n for pos in range(m):\r\n different_letters_dict[pos].add(name[pos])\r\n \r\n num_different_names = 1\r\n for pos in range(m):\r\n num_different_names = num_different_names len(different_letters_dict[pos])\r\n\r\n print(num_different_names % 1000000007)\r\n return \r\n\r\nPocket_Book()", "def pocket_book(n, m, book):\n diff_chars = []\n for position in range(m):\n diff_char = set()\n for name in range(n):\n diff_char.add(book[name][position])\n diff_chars.append(len(diff_char))\n\n ans = 1\n for i in diff_chars:\n ans = (i * ans) % 1000000007\n return ans\n\n\nn, m = map(int, input().strip().split())\nbook = []\nfor i in range(n):\n book.append(input().strip())\nprint(pocket_book(n, m, book))\n", "import collections\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\nMOD = 1000000007\r\n\r\ncolumns = list(zip(names))\r\nret = 1\r\n\r\nfor col in columns:\r\n counts = list(collections.Counter(col).values())\r\n assert sum(counts) == n\r\n ret = len(counts)\r\n ret %= MOD\r\nprint(ret)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nd=defaultdict(set)\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n d[j].add(s[j])\r\nans=1\r\nfor i in d:\r\n ans=len(d[i])\r\n ans%=(109+7)\r\nprint(ans)", "n, m = map(int, input().split())\nA = [set() for _ in range(m)]\nfor _ in range(n):\n for i, s in enumerate(input()):\n A[i].add(s)\nans = 1\nfor i in range(m):\n ans = ans len(A[i]) % int(1e9 + 7)\nprint(ans)\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n s = {i:set() for i in range(m)}\r\n st = []\r\n for i in range(n):\r\n _s = input()\r\n st.append(_s)\r\n for i in range(m):\r\n for j in range(n):\r\n letter = st[j][i]\r\n s[i].add(letter)\r\n dp = {i:len(s[i]) for i in range(m)}\r\n ans = 1\r\n for i in list(dp.keys()):\r\n ans = (ans * dp[i]) % (10*9 + 7)\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "import sys\ninput= sys.stdin.buffer.readline\nn,m=map(int,input().split())\nlst=[]\nfor i in range(n):\n lst.append(str(input().decode()))\nans=[0](m)\nfor j in range(m):\n s=set()\n for i in range(n): \n s.add(lst[i][j])\n ans[j]=len(s)\np=1\nfor i in range(m): p=pans[i]\nprint(p%int(109+7))", "mod=109+7\r\nn,m=map(int,input().split())\r\nf=list(set() for i in range(m))\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n f[j].add(s[j])\r\nans=1\r\nfor i in range(m):\r\n ans=len(f[i])\r\n ans%=mod\r\nprint(ans)", "n, m = map(int, input().split())\nres, mod = 1, 10*9 + 7\ncount = [set() for _ in range(m)]\nfor _ in range(n):\n for ind, ch in enumerate(input()):\n count[ind].add(ch)\nfor item in count:\n res = (res len(item)) % mod\nprint(res)\n", "n, m = [int(x) for x in input().split()]\n\nsets = []\nfor i in range(m):\n sets.append(set())\n\nfor i in range(n):\n name = input()\n for j in range(m):\n sets[j].add(name[j])\n\nresult = 1 \nfor i in range(m):\n result=len(sets[i])\n\nprint(result%1000000007)\n\t\t \t\t \t \t \t \t\t\t\t\t \t\t \t", "n, m = list( map( int, input().split() ) )\r\n\r\nL = []\r\nfor i in range( n ):\r\n x = input()\r\n L.append( x )\r\n\r\nMODN = 109+7\r\n\r\nans = 1\r\n\r\nfor j in range( m ):\r\n s = {}\r\n for i in range( n ):\r\n s[ L[i][j] ] = 1\r\n ans = ( ans len(s) ) % MODN\r\n\r\nprint( ans )\r\n", "n, m = map(int, input().split())\nnames = []\nmod = 1000000007\n\nfor i in range(n):\n names.append(input())\n\nmult = 1\nfor i in range(m):\n difs = set()\n for name in names:\n difs.add(name[i])\n mult = (mult * len(difs)) % mod\n\nprint(mult)\n \t \t \t\t \t \t \t\t\t \t\t\t \t\t \t \t", "def permutacao(n, m, array):\r\n mod = 1000000007\r\n result = 1\r\n\r\n for j in range(m):\r\n carac = set()\r\n for i in range(n):\r\n carac.add(array[i][j])\r\n\r\n result = len(carac)\r\n result %= mod\r\n\r\n return result\r\n\r\n\r\nn, m = map(int, input().split())\r\narray = []\r\nfor _ in range(n):\r\n array.append(input())\r\n\r\nprint(permutacao(n, m, array))", "n, m = map(int, input(). split())\r\nlis = []\r\nfor i in range(n):\r\n st = input()\r\n lis.append(st)\r\ntot = 1\r\nfor i in range(m):\r\n setn = set()\r\n for j in lis:\r\n setn.add(j[i])\r\n tot = tot len(setn)\r\n tot %= int(1e9) + 7\r\nprint(tot)", "n,m=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n s=input()\r\n a.append(s)\r\nans=1\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n #print(s)\r\n ans=len(s)\r\n ans=ans%(109+7)\r\nprint(ans)\r\n", "M=109+7\r\nn,m=[int(e) for e in input().split()]\r\na=[input() for i in range(n)]\r\nans=1\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans=len(s)\r\n ans%=M\r\nprint(ans)\r\n", "M=10*9+7\r\nn,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nans=1\r\nfor j in range(m):\r\n val=set()\r\n for i in range(n):\r\n val.add(a[i][j])\r\n ans=(anslen(val))%M\r\nprint(ans%M)\r\n \r\n ", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nans = 1\r\nfor j in range(m):\r\n st = set()\r\n for i in range(n):\r\n st.add(a[i][j])\r\n ans = (ans * len(st)) % 1000000007\r\nprint(ans)", "'''input\n4 5\nABABA\nBCGDG\nAAAAA\nYABSA\n'''\nfrom sys import stdin\nimport math\n\n\n# main starts\nn, m = list(map(int, stdin.readline().split()))\nstring = []\n\nfor _ in range(n):\n\tstring.append(list(stdin.readline().strip()))\n\ncharacter = [[0 for x in range(26)] for y in range(m)]\n\nfor i in range(m):\n\tfor j in range(n):\n\n\t\tcharacter[i][ord(string[j][i]) - 65] += 1\n\n\nmultiplier = 1\nmod = 10 ** 9 + 7\n\nfor i in range(m):\n\tcount = 0\n\tfor j in range(26):\n\t\tif character[i][j] != 0:\n\t\t\tcount += 1\n\tmultiplier = count\n\tmultiplier %= mod\n\nprint(multiplier)", "MOD=1000000007\nn,m=map(int,input().split())\nl=[]\nfor _ in range(n):\n l.append(input())\nans=1\nfor i in range(m):\n s=set()\n for k in range(n):\n s.add(l[k][i])\n ans=(anslen(s))%MOD\n \nprint(ans % MOD)\n", "mod = 10*9 + 7\n\nn, m = map(int, input().split())\nv = []\nfor _ in range(n):\n S = input()\n v.append(S)\n\nans = 1\nfor i in range(m):\n s = set()\n for j in range(n):\n p = v[j]\n s.add(p[i])\n \n cnt = len(s)\n ans = (ans cnt) % mod\n s.clear()\n\nprint(ans)\n\n \t \t \t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\np = 1\r\nfor j in range(m):\r\n s = set()\r\n for i in range(n):\r\n s.add(a[i][j])\r\n p = (p * len(s)) % 1000000007\r\nprint(p)", "import sys\r\nimport math\r\nimport bisect\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(1500000)\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef printlist(var) : sys.stdout.write(' '.join(map(str, var))+'\\n')\r\n\r\nn,k=invr()\r\nx=[]\r\nd=[[] for i in range(k)]\r\ndd=[0 for i in range(k)]\r\nfor i in range(n):\r\n x.append(input())\r\nfor i in range(n):\r\n for j in range(k):\r\n if x[i][j] not in d[j]:\r\n d[j].append(x[i][j])\r\n dd[j]+=1\r\nans=1\r\nfor i in dd:\r\n ans=i\r\nprint(ans%1000000007)\r\n\r\n\r\n\r\n\r\n", "R=input\r\nn,m=map(int,R().split())\r\nr=1\r\nfor z in zip(map(R,\" \"n)):r=len(set(z))\r\nprint(r%(109+7))\r\n", "n,m= map(int,input().split())\r\nli = []\r\nfor i in range(n):\r\n a=str(input())\r\n li.append(a)\r\nfinal = []\r\nfor i in range(m):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(li[j][i])\r\n final.append(len(temp))\r\nval = 1\r\nmod = 109 +7\r\nfor i in final:\r\n val=i\r\nprint(val%mod)\r\n \r\n", "n,m = [int(x) for x in input().split()]\r\narr = []\r\nfor i in range(n):\r\n arr.append(str(input()))\r\nans = 1\r\nfor i in range(m):\r\n hm = []\r\n now = 0\r\n for j in range(n):\r\n if not arr[j][i] in hm:\r\n hm.append(arr[j][i])\r\n now+=1\r\n ans = (ansnow)%1000000007\r\nprint(ans)", "# find the unique set of string for all prefix length\n\nn, m = list(map(int, input().split()))\nnames = []\nfor _ in range(n):\n names.append(input())\nmod = int(1e9+7)\nans = 1\nfor l in range(m):\n uniques = set()\n for name in names:\n uniques.add(name[l])\n ans = (ans%mod * len(uniques)%mod)%mod\n\nprint(ans)", "n, m = list(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append(input())\nans = 1\nfor j in range(m):\n d = {}\n c = 0\n for i in range(n):\n d[l[i][j]] = d.get(l[i][j], 0) + 1\n if d[l[i][j]] == 1:\n c = c + 1\n ans = ans * c\nprint(ans % (109 + 7))\n \t \t \t \t \t\t\t \t \t \t \t\t\t\t", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\np = 10 9 + 7\r\n\r\ncnt = 1\r\n\r\nfor i in range(m):\r\n cnt = (cnt * len({s[j][i] for j in range(n)})) % p\r\n\r\nprint(cnt)\r\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nc = 10 ** 9 + 7\r\n\r\ncnt = 1\r\n\r\nfor i in range(m):\r\n cnt = (cnt * len({a[j][i] for j in range(n)})) % c\r\n \r\nprint(cnt)\r\n \r\n \r\n \r\n\r\n", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution(names, n, m):\r\n # Write Your Code Here\r\n mod = pow(10, 9)+7\r\n ans = 1\r\n for i in range(m):\r\n tmp = 0\r\n hm = {}\r\n for name in names:\r\n if name[i] in hm:\r\n continue\r\n tmp += 1\r\n hm[name[i]] = True\r\n ans = (ans % modtmp % mod) % mod\r\n print(ans)\r\n\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n n, m = get_ints_in_variables()\r\n names = []\r\n for _ in range(n):\r\n names.append(get_string())\r\n Solution(names, n, m)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m=[int(k) for k in input().split()]\r\nw=[]\r\nz=[set() for j in range(m)]\r\nfor j in range(n):\r\n w.append(input())\r\n for i in range(m):\r\n z[i].add(w[-1][i])\r\nres=1\r\nfor j in range(m):\r\n res=len(z[j])\r\nprint(res%(10*9+7))", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\ndef solve(names):\r\n m = len(names[0])\r\n\r\n postfix = {}\r\n for name in names:\r\n postfix[name[-1:]] = True\r\n\r\n if m == 1:\r\n return len(postfix)\r\n newList = list((map(lambda x: x[:-1], names)))\r\n \r\n return len(postfix) solve(newList)\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n inputLines = []\r\n for i in range(firstLine[0]):\r\n line = input()\r\n inputLines.append(line)\r\n \r\n #solve(firstLine)\r\n print (solve(inputLines) % 1000000007)\r\n\r\ndef log(message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=tuple(map(int,input().split()))\r\ninp=[]\r\nfor i in range(n):\r\n inp.append(input())\r\ncount=1\r\nfor i in range(m):\r\n setter=set()\r\n for j in range(n):\r\n if(inp[j][i] not in setter):\r\n setter.add(inp[j][i])\r\n count=len(setter)\r\nprint(count%1000000007)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nMOD = 10*9 + 7\r\nn, m = list(map(int, input().split()))\r\nstrs = []\r\nfor _ in range(n):\r\n strs.append(input())\r\n# s = input()\r\nans = 1\r\nfor i in range(m):\r\n ans = len({s[i] for s in strs})\r\n ans %= MOD\r\n\r\nprint(ans)", "n, m = [int(n) for n in input().split()]\n\npalavras = []\nfor c in range(n):\n palavras.append(input())\n\nans = 1\nfor i in range(m):\n letras = set()\n for j in range(n):\n letras.add(palavras[j][i])\n \n ans = len(letras)\n ans %= (10 * 9) + 7\n\nprint(ans)\n\n\t \t\t \t \t \t \t \t \t\t\t\t", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\n \r\ncnt = 1\r\nmod = 10 ** 9 + 7\r\nfor i in range(m):\r\n cnt = cnt * len({a[j][i] for j in range(n)}) % mod\r\n\r\nprint(cnt)", "n,m = map(int,input().split())\r\nkol=[]\r\nfor i in range(m):\r\n a=[0]26\r\n kol.append(a)\r\nfor i in range(n):\r\n s= input()\r\n for j in range(m):\r\n kol[j][int(ord(s[j])-ord(\"A\"))]=1\r\nans=[]\r\np=1\r\nfor i in range(m):\r\n ans.append(sum(kol[i]))\r\n p=pans[i]%(1000000007)\r\n\r\nprint(p)\r\n \r\n \r\n \r\n \r\n\n# Sun Jan 09 2022 07:53:07 GMT+0000 (Coordinated Universal Time)\n", "mod = 1e9+7\r\n\r\nn, m = map(int, input().split())\r\ns = [input().strip() for _ in range(n)]\r\n\r\nans = 1\r\nfor j in range(m):\r\n c = 0\r\n arr = [0] * 200\r\n for i in range(n):\r\n if arr[ord(s[i][j])] != 1:\r\n arr[ord(s[i][j])] += 1\r\n c += 1\r\n ans = (ans * c) % mod\r\n\r\nans = ans % mod\r\nprint(int(ans))\r\n\r\n\r\n\r\n", "# Thank God that I'm not you.\r\n\r\nimport bisect\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(args, kwargs):\r\n if stack:\r\n return f(args, *kwargs)\r\n else:\r\n to = f(args, kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc \r\n\r\ndef primeFactors(n):\r\n \r\n counter = Counter(); \r\n while n % 2 == 0:\r\n counter[2] += 1;\r\n n = n / 2\r\n \r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n while n % i== 0:\r\n counter[i] += 1;\r\n n = n / i\r\n \r\n if (n > 2):\r\n counter[n] += 1;\r\n \r\n return counter;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\n\r\n\r\nhashMap = {i: set() for i in range(m)};\r\nfor _ in range(n):\r\n string = input().rstrip()\r\n \r\n for i, char in enumerate(string):\r\n hashMap[i].add(char)\r\n\r\n\r\n\r\nans = 1;\r\n\r\nmod = (109 + 7)\r\n\r\n\r\nfor idx in hashMap:\r\n ans = len(hashMap[idx]);\r\n ans %= mod;\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\nnames = []\r\nmod = 109 +7\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n \r\nans = 1\r\nfor i in range(m):\r\n found = set()\r\n for j in range(len(names)):\r\n found.add(names[j][i])\r\n ans = len(found)\r\n\r\n ans += mod\r\n ans %= mod\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\nnames = [None]n\r\nf = []\r\nfor i in range(n):\r\n\tnames[i] = input()\r\nfor i in range(m):\r\n\td = {}\r\n\tfor elem in names:\r\n\t\tif elem[i] not in d:\r\n\t\t\td[elem[i]] = 1\r\n\tf.append(len(d))\r\nans = 1\r\nfor elem in f:\r\n\tans=elem\r\nprint(ans%1000000007)", "n,m=map(int,input().split())\r\nr=1\r\nfor z in zip(map(input,\" \"n)):\r\n r=len(set(z))\r\nprint(r%(109+7))", "n,m=map(int,input().split())\r\ns=[]\r\nans=1\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(m):\r\n cnt=[0]26\r\n for j in range(n):\r\n cnt[ord(s[j][i])-ord('A')]=1\r\n ans=sum(cnt)\r\n ans%=1000000007\r\nprint(ans)", "from functools import reduce\n\nMOD = 10 * 9 + 7\na = []\nn, _ = map(int, input().split())\nfor i in range(int(n)):\n a.append(list(input()))\nprint(reduce(lambda x, y: x * y % MOD, list(map(lambda x: len(set(x)), zip(a))), 1))\n", "import sys\r\ninput = sys.stdin.readline # fast cin\r\n\r\nlst = input().split()\r\nn, m = int(lst[0]), int(lst[1])\r\nmod = int(109) + 7\r\nstrings = []\r\nfor i in range(n):\r\n strings.append(input())\r\nanswer = 1\r\nfor i in range(m):\r\n st = set()\r\n for j in range(n):\r\n st.add(strings[j][i])\r\n answer = (answer len(st)) % mod\r\nprint(answer)", "a,b = map(int,input().split(\" \"))\r\nt = []\r\nfor x in range(b):\r\n\tt.append([])\r\nfor x in range(a):\r\n\t k = list(input())\r\n\t for n in range(b):\r\n\t \tl = t[n]\r\n\t \tl.append(k[n])\r\n#print(t)\r\ndef setter(k):\r\n\treturn len(set(k))\r\nt = map(setter,t)\r\n#print(t)\r\nres = 1\r\ncal = (10*9)+7\r\nfor n in t:\r\n\tres=n\t\r\n\tres%=cal\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t", "mod = 1000000007\n\nx = list(map(int,input().strip().split()))[:2]\n\nn = x[0]\nm = x[1]\n\nvetorStrings = []\n\nfor i in range(n):\n vetorStrings.append(input())\n\nresp = 1\n\nfor i in range(m):\n caracteresUnicos = set()\n\n for j in range(n):\n caracteresUnicos.add(vetorStrings[j][i]) #pega cada caracter\n \n size = len(caracteresUnicos) #pega numero de caracteres unicos\n\n resp = (resp * size) % mod #produto de caracteres unicos em cada posicao\n\n caracteresUnicos.clear()\n\nprint(resp%mod)\n \t\t \t \t\t\t\t\t \t\t\t \t\t\t \t\t\t" ]	{"inputs": ["2 3\nAAB\nBAA", "4 5\nABABA\nBCGDG\nAAAAA\nYABSA", "1 1\nE", "2 2\nNS\nPD", "3 4\nPJKD\nNFJX\nFGFK", "4 5\nSXFMY\nATHLM\nKDDQW\nZWGDS", "20 14\nJNFKBBBJYZHWQE\nLBOKZCPFNKDBJY\nXKNWGHQHIOXUPF\nDDNRUKVUGHWMXW\nMTIZFNAAFEAPHX\nIXBQOOHEULZYHU\nMRCSREUEOOMUUN\nHJTSQWKUFYZDQU\nGMCMUZCOPRVEIQ\nXBKKGGJECOBLTH\nXXHTLXCNJZJUAF\nVLJRKXXXWMTPKZ\nPTYMNPTBBCWKAD\nQYJGOBUBHMEDYE\nGTKUUVVNKAHTUI\nZNKXYZPCYLBZFP\nQCBLJTRMBDWNNE\nTDOKJOBKEOVNLZ\nFKZUITYAFJOQIM\nUWQNSGLXEEIRWF", "5 14\nAQRXUQQNSKZPGC\nDTTKSPFGGVCLPT\nVLZQWWESCHDTAZ\nCOKOWDWDRUOMHP\nXDTRBIZTTCIDGS", "9 23\nOILBYKHRGMPENVFNHLSIUOW\nLPJFHTUQUINAALRDGLSQUXR\nLYYJJEBNZATAFQWTDZSPUNZ\nHSJPIQKKWWERJZIEMLCZUKI\nOJYIEYDGPFWRHCMISJCCUEM\nLMGKZVFYIVDRTIHBWPCNUTG\nUBGGNCITVHAIPKXCLTSAULQ\nOWSAWUOXQDBSXXBHTLSXUVD\nUGQTIZQPBGMASRQPVPSFUWK", "25 4\nLVKG\nMICU\nZHKW\nLFGG\nOWQO\nLCQG\nLVXU\nOUKB\nLNQX\nZJTO\nOOQX\nLVQP\nMFQB\nMRQV\nOIQH\nOPXX\nXFKU\nFCQB\nZPKH\nLVCH\nNFCU\nOVQW\nOZKU\nLFHX\nLPXO", "30 10\nUTNTGOKZYJ\nQHOUHNYZVW\nLTVGHJRZVW\nMZHYHOLZYJ\nERYEUEPZYE\nUZDBFTURYJ\nRVSMQTIZGW\nWDJQHMIRYY\nKCORHQPZYE\nRRPLFOZZVY\nJTXMFNNNYJ\nMVTGGOZZVV\nEHAFFNUZVF\nLBRNWJZNYE\nJVMOHTPZYJ\nWTARFJLZVV\nLVJCWOURVW\nLCLQFJYRVV\nQVBVGNJRYF\nNTZGHOLRYE\nMGQKHOUPYJ\nRRSSBXPZYJ\nRYCRGTLZYJ\nJRDEGNKRVW\nRZKFGHYRVG\nMDJBFNIZYG\nMPLWHXIZYE\nSRZMHMURVE\nMTEBBMRZYJ\nJPJIFOLZYM", "40 7\nPNTVVER\nPAHTQDR\nRXMJVAS\nVIQNLYC\nILPUSVX\nYJOXQDJ\nSEFODTO\nOTJMREL\nLIQRZGD\nLBJJPOR\nRUTYHQO\nRIWEPBD\nKQUMFIB\nISTRRYH\nXBTOTGK\nRFQODEY\nHDSTZTP\nYCXFAGL\nAREGRFU\nLELZUYU\nGVABDKH\nFJAMMME\nACVULXE\nJHVPJAS\nAAQNMBX\nJJGUCXG\nOQATILQ\nNEOSHJM\nHFLWOFM\nICYEQHY\nFACGLYP\nPLLXJEQ\nDCHXYPB\nAGDDZJJ\nLSQRXTN\nHDQZXIY\nNAHDDWW\nQCMXRQN\nFDUDSZO\nHKBEVTW", "2 2\nAA\nBB", "1 10\nAAAAAAAAAA", "2 8\nAAAAAAAA\nBBBBBBBB", "10 10\nAAAAAAAAAA\nBBBBBBBBBB\nCCCCCCCCCC\nDDDDDDDDDD\nAAAAAAAAAA\nBBBBBBBBBB\nCCCCCCCCCC\nDDDDDDDDDD\nAAAAAAAAAA\nBBBBBBBBBB", "1 20\nAAAAAAAAAAAAAAAAAAAA", "20 1\nA\nB\nC\nD\nE\nF\nG\nA\nB\nC\nD\nE\nF\nG\nA\nB\nC\nD\nE\nF", "5 60\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\nBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\nCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC\nDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD\nEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE", "50 4\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ", "1 100\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA", "100 1\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", "100 1\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB", "100 1\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB", "100 1\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV"], "outputs": ["4", "216", "1", "4", "81", "1024", "515139391", "124999979", "454717784", "5733", "919913906", "206575993", "4", "1", "256", "1048576", "1", "7", "449874206", "10000", "1", "1", "2", "14", "26"]}	UNKNOWN	PYTHON3	CODEFORCES	184
d5a92f290c7eb0059d54b3a0e3c0ae3e	Ilya and Matrix	Ilya is a very good-natured lion. He likes maths. Of all mathematical objects, his favourite one is matrices. Now he's faced a complicated matrix problem he needs to solve. He's got a square 2n<=×<=2n-sized matrix and 4n integers. You need to arrange all these numbers in the matrix (put each number in a single individual cell) so that the beauty of the resulting matrix with numbers is maximum. The beauty of a 2n<=×<=2n-sized matrix is an integer, obtained by the following algorithm: 1. Find the maximum element in the matrix. Let's denote it as m. 1. If n<==<=0, then the beauty of the matrix equals m. Otherwise, a matrix can be split into 4 non-intersecting 2n<=-<=1<=×<=2n<=-<=1-sized submatrices, then the beauty of the matrix equals the sum of number m and other four beauties of the described submatrices. As you can see, the algorithm is recursive. Help Ilya, solve the problem and print the resulting maximum beauty of the matrix. The first line contains integer 4n (1<=≤<=4n<=≤<=2·106). The next line contains 4n integers ai (1<=≤<=ai<=≤<=109) — the numbers you need to arrange in the 2n<=×<=2n-sized matrix. On a single line print the maximum value of the beauty of the described matrix. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. Sample Input 1 13 4 1 2 3 4 Sample Output 13 14	[ "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort(reverse=True)\r\nif n == 1:\r\n print(A[0])\r\nelse:\r\n res = 0\r\n i = 1\r\n while(i <= n):\r\n res += sum(A[0: i])\r\n i *= 4\r\n print(res)" ]	{"inputs": ["1\n13", "4\n1 2 3 4", "16\n978618343 473608041 799158564 800910753 461479363 520477481 780529176 678879534 118274424 720632652 639921017 582019792 143353286 537373229 944668919 758615621", "16\n521848329 105907607 414661942 473600423 264555612 186332345 774233687 736918178 456150336 216550357 568433949 135218174 18789799 324141005 617635501 149674864", "16\n612095723 222321386 616933999 386488979 943748076 902598472 681820298 449949990 359507903 613063462 437031953 902348579 697631196 99280352 60225467 969809069", "16\n666766712 653140033 670637874 170909587 210382562 358152171 128926299 750686139 315428350 607830667 363710774 325047228 570196776 38425426 438601514 634274054", "1\n6", "1\n8", "1\n9", "4\n7 9 6 9", "4\n423654797 623563697 645894116 384381709", "4\n437587210 297534606 891773002 56712976", "4\n963662765 272656295 383441522 477665112", "4\n791725034 812168727 528894922 479977172"], "outputs": ["13", "14", "14440495117", "9436107110", "13643168169", "10395033063", "6", "8", "9", "40", "2723388435", "2575380796", "3061088459", "3424934582"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d5d2dd5f9cafc5c383631833e295d5a4	Pasha and Tea	Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of w milliliters and 2n tea cups, each cup is for one of Pasha's friends. The i-th cup can hold at most ai milliliters of water. It turned out that among Pasha's friends there are exactly n boys and exactly n girls and all of them are going to come to the tea party. To please everyone, Pasha decided to pour the water for the tea as follows: - Pasha can boil the teapot exactly once by pouring there at most w milliliters of water; - Pasha pours the same amount of water to each girl; - Pasha pours the same amount of water to each boy; - if each girl gets x milliliters of water, then each boy gets 2x milliliters of water. In the other words, each boy should get two times more water than each girl does. Pasha is very kind and polite, so he wants to maximize the total amount of the water that he pours to his friends. Your task is to help him and determine the optimum distribution of cups between Pasha's friends. The first line of the input contains two integers, n and w (1<=≤<=n<=≤<=105, 1<=≤<=w<=≤<=109) — the number of Pasha's friends that are boys (equal to the number of Pasha's friends that are girls) and the capacity of Pasha's teapot in milliliters. The second line of the input contains the sequence of integers ai (1<=≤<=ai<=≤<=109, 1<=≤<=i<=≤<=2n) — the capacities of Pasha's tea cups in milliliters. Print a single real number — the maximum total amount of water in milliliters that Pasha can pour to his friends without violating the given conditions. Your answer will be considered correct if its absolute or relative error doesn't exceed 10<=-<=6. Sample Input 2 4 1 1 1 1 3 18 4 4 4 2 2 2 1 5 2 3 Sample Output 3184.5	[ "n, w = map(int, input().split())\r\ncup = list(map(int, input().split()))\r\ncup.sort()\r\n\r\nif (cup[n] >= 2cup[0]):\r\n ans = min(w, 3cup[0]n)\r\n print(ans)\r\nelse:\r\n ans = min(w, 3(cup[n]/2)n)\r\n print(ans)\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nprint(min(w, min(a[0], a[n]0.5)3n))\r\n", "n, w = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\narray.sort()\r\ntea = min(array[0], array[n]/2)\r\nans = min(w, 3ntea)\r\n\r\nif ans - int(ans) == 0:\r\n print(int(ans))\r\nelse:\r\n print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,W = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nk = W/(N+N/2)\r\nk = min(k, A[N])\r\nk = min(k, A[0]2)\r\nprint(kN1.5)", "def main():\r\n n,w = map(int,input().split())\r\n a = list(sorted(map(int,input().split())))\r\n q = min(min(a[:n]),min(a[n:])/2)\r\n print(min(q3n,w))\r\n\r\nif __name__ == '__main__': main()", "n, w = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nres = 0\r\nx_min = 0\r\nif arr[0] 2 <= arr[n]:\r\n x_min = float(arr[0])\r\nelse:\r\n x_min = float(arr[n] / 2)\r\n\r\nif x_min * 3 * n <= w:\r\n res = float(x_min * 3 * n)\r\nelse:\r\n res = float(w)\r\n\r\nif res % 1 != 0.0:\r\n print(res)\r\nelse:\r\n print(int(res))\r\n", "n, w = (int(i) for i in input().split())\ntea = sorted(int(i) for i in input().split())\nsmallest = min(tea[0], tea[n]/2)\nprint(min(smallest3n, w))\n", "n, w = map(int, input().split(' '))\r\nv = list(map(int, input().split(' ')))\r\n\r\nv = sorted(v) \r\nif v[n] / v[0] >= 2:\r\n x = v[0] \r\nelse:\r\n x = v[n] / 2\r\n\r\nsum = 3 * n * x \r\n\r\nif (sum > w):\r\n sum = w \r\n\r\nprint(sum)", "A = input().split()\r\nB = input().split()\r\na = [int(x) for x in list(B)]\r\na.sort()\r\ndt = min(a[0], a[int(A[0])]/2)3int(A[0])\r\nprint(min(dt,int(A[1])))", "n,w = map(int, input().split(' '))\r\nc = input().split(' ')\r\nc = [int(i) for i in c]\r\nc.sort()\r\nk = min(c[0], c[n]/2) * 3 * n\r\nprint(min(k, w))\r\n", "def STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import \r\nfrom collections import deque , Counter\r\nfrom math import \r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n#code\r\nn , w = MAP()\r\narr = LIST()\r\narr.sort()\r\n\r\nmin_girl , min_boy = arr[0] , arr[n]\r\n\r\nif 2 * min_girl > min_boy:\r\n min_girl = min_boy / 2\r\n\r\nelif 2 * min_girl < min_boy:\r\n min_boy = 2 * min_girl\r\n\r\nres = min(w , (min_girl + min_boy) * n)\r\nprint(res)\r\n\r\n", "n, w = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(min(3 * n * a[0], 1.5 * n * a[n], w))", "n, w = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nmaxGirl = arr[n] / 2\r\nx = min(maxGirl, arr[0])\r\ntotal = (n + 2 * n) * x\r\nif total <= w:\r\n print(total)\r\nelse:\r\n print(w)", "def main():\r\n nm=list(map(int,input().split(' ')))\r\n arg=list(map(int,input().split(' ')))\r\n n=nm[1]/nm[0]\r\n arg.sort()\r\n i=arg[0]\r\n j=arg[nm[0]]\r\n j=min((i,j/2))\r\n print(\"%.7f\" % (min((j3nm[0],nm[1]))))\r\nif __name__ == \"__main__\":\r\n main()", "#n = int(input())\nn,w = [int(c) for c in input().split()]\na = [int(c) for c in input().split()]\na.sort()\n\nmaxgirl = w / (3 * n)\n\nfor i in range(n):\n if a[i] < maxgirl:\n maxgirl = a[i]\nfor i in range(n, 2n):\n if a[i] < 2 maxgirl:\n maxgirl = a[i]/2\n\nprint(maxgirl3n)\n", "import io, os\r\ninput=io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, c=[int(k) for k in input().decode('utf-8').rstrip(\"\\r\\n\").split()]\r\nw=[int(k) for k in input().decode('utf-8').rstrip(\"\\r\\n\").split()]\r\nw.sort()\r\na, b=w[0], w[n]\r\nres=min(b, 2a)\r\nif nres+(n//2)res+(n%2)/2res<=c:\r\n print(nres+(n//2)res+(n%2)/2res)\r\nelse:\r\n print(c)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=(n3)l[0]\r\ny=((n3)l[n])/2\r\nprint(min(min(x,y),k))\r\n", "'''\r\n @Author: Pham T. Nhan\r\n @Date: 2/11/2018\r\n @Name: Pasha and Tea\r\n @Link: http://codeforces.com/problemset/problem/557/B\r\n'''\r\n\r\n\r\ndef main():\r\n n, w = map(int, input().split())\r\n capacity = list(map(int, input().split()))\r\n capacity.sort()\r\n\r\n # Note for calculation:\r\n # Each girls have the same amount, so that came with boys (x2)\r\n # So all girls must take the same amount of the smallest cup (or below than that)\r\n # And so that 0->(n-1) cups are for girl\r\n # Then n->(2n-1) cups are for boys\r\n # And we do the same with boys, all boys must take the same amount as n-th cup (or below than that)\r\n\r\n # If 2capacity[0] <= capacity[n], then we can do that with all girls and boys\r\n # So possible TOTAL = 3ncapacity[0] or W (if TOTAL > W)\r\n # Else 2capacity[0] > capacity[n], then girls take capacity[n] / 2\r\n # So possible TOTAL = 1.5ncapacity[n] or W (if TOTAL > W)\r\n\r\n girlCap = capacity[0]\r\n boyCap = capacity[n]\r\n if 2girlCap <= boyCap:\r\n Total = 3ncapacity[0]\r\n else:\r\n Total = 1.5ncapacity[n]\r\n\r\n if Total > w:\r\n Total = w\r\n\r\n print(Total)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,w=map(int,input().split())\r\nlst=[map(float,input().split())]\r\nlst.sort()\r\nres=min(lst[0],lst[n]/2,w/3/n)\r\nprint(res3n)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, w = map(int, input().split())\r\ng = sorted(map(int, input().split()))\r\na = g[0]\r\nb = g[n]\r\nx = min(a, b/2, w/n/3)\r\nprint(xn3)\r\n", "# print (\"Input n and w on the same line\")\nvalues = input().split()\nn = int(values[0])\nw = int(values[1])\n# print (\"Input all 2n cup sizes on one line\")\ncups = input().split()\n\nfor i in range(2n):\n cups[i] = int(cups[i])\n\ncups.sort()\n\nlowgirl = cups[0]\nlowboy = cups[len(cups)//2]\ntotalused = 0\nif (2lowgirl <= lowboy):\n totalused = nlowgirl + nlowgirl2\nelse:\n totalused = n(lowboy/2) + nlowboy\nif (totalused < w):\n print (totalused)\nelse:\n print (w)\n \n", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nprint(min(min(a[n]/2,a[0])(n3),w))", "n,w=map(int,input().split())\r\ncapa=list(map(int,input().split()))\r\n\r\nsorted=sorted(capa, reverse=True)\r\n\r\n\r\nx = min(sorted[n-1]/2,sorted[-1],w/(3n))\r\nresultW = 3 * n * x\r\nprint(resultW)", "def main():\n n, w = map(int, input().split())\n a = sorted(map(int, input().split()))\n print(min(w, min(a[0], a[n] * 0.5) * 3 * n))\n\n\nif __name__ == '__main__':\n main()\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nprint(min(a[0]3n,a[n]/23n,(w/(3n)3n)))", "# Codeforces: 557B - Pasha and Tea\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nans = min(a[0], a[n] / 2.0) 3 * n\r\nans = min(ans, w)\r\n\r\nprint(ans)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = a[n]; g = min(b/2, a[0]); z = 3ng;\r\nprint( z if z <= w else w)\r\n\r\n", "n, w = [int(i) for i in input().split()]\r\ncapacity = [int(i) for i in input().split()]\r\n\r\ncapacity.sort(reverse=True)\r\nresult = 0\r\nif capacity[n-1] >= capacity[(2n) - 1] 2:\r\n result = capacity[(2n) - 1] 3 * n\r\nelse:\r\n result = capacity[n-1] * 3 / 2 * n\r\nif result <= w:\r\n print(result)\r\nelse:\r\n print(w)\r\n\r\n\r\n", "first = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nn = first[0]\r\nl = len(arr)\r\nw = first[1]\r\narr.sort()\r\neach = (w / (n * 3))\r\nmaxBoy = each * 2\r\n\r\nminGirl = arr[0]\r\nminBoy = arr[l//2]\r\n\r\nif minGirl * 2 > minBoy:\r\n\tminGirl = minBoy / 2\r\nif each <= minGirl:\r\n\tprint(w)\r\nelse:\r\n\tprint(minGirl * 3 * n)\r\n\r\n\r\n\t\t\r\n\t\t\r\n\t\t\r\n\r\n", "n,w = map(int, input().split())\r\na = list( map(int, input().split()))\r\na.sort()\r\ngirls = a[:n]\r\nboys = a[n:]\r\nx = 0\r\nx = min(girls[0],boys[0] / 2)\r\ntotal = 3 * x * n\r\nprint(min(total,w))", "n,w = [int(x) for x in input().split()];\r\nsOC = [int(x) for x in input().split()];\r\nsOC.sort();\r\nr1 = sOC[n];\r\nr2 = sOC[0];\r\nif r1/2 <= r2:\r\n\tk = ((3/2)r1n)\r\n\tif k < w :\r\n\t\tprint(k)\r\n\telse :\r\n\t\tprint(w)\r\nelse :\r\n\tk = (3r2n)\r\n\tif k < w :\r\n\t\tprint(k)\r\n\telse :\r\n\t\tprint(w)\r\n", "def main():\n n, w = [int(t) for t in input().split()]\n a = sorted(int(t) for t in input().split())\n\n min_girl_cup = a[0]\n min_boy_cup = a[n]\n\n max_girl_amount = min(min_girl_cup, min_boy_cup / 2)\n\n total = min(3 * max_girl_amount * n, w)\n\n print(total)\n\n\nif __name__ == '__main__':\n main()\n", "def f():\r\n\t[n,w] = list(map(int,input().split(' ')))\r\n\ta = list(map(int,input().split(' ')))\r\n\ta.sort()\r\n\tprint(format(min(min(a[0],a[n]/2)3n,w),'.20f'))\r\nf()", "n,w = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\nm = min(a[0],a[n]/2)\r\n#print(m)\r\nsum = 3nm\r\nprint(min(sum,w))", "#n = int(input())\nn, w = map(int, input().split(\" \"))\narr = input().split(\" \")\nfor i in range(2n):\n arr[i] = int(arr[i])\n \narr.sort()\nboysize = arr[n]\ngirlsize = arr[0]\nx = min(boysize/2, girlsize)\n\nprint(min(w, 3xn))", "s = input()\r\nn, w = map(int, s.split())\r\n\r\ns = input()\r\nsizes = list(map(int, s.split()))\r\n\r\nsizes.sort()\r\n\r\nx = min(sizes[0], sizes[n]/2)\r\n\r\nans = 3 n * x\r\n\r\nif ans > w:\r\n print(w)\r\n \r\nelse:\r\n print(ans)\r\n", "# 557B\r\nn,w = map(int,input().split()) # n: so luong boy hoac girl, w: tong so tra (millilit) co san\r\na = list(map(int,input().split())) # dung luong max cho moi coc tra\r\na.sort()\r\n# tinh so mil tra max cho moi coc cua girlfriend\r\nmax_per_cup = min(a[n]/2,a[0])\r\n# print (max_per_cup)\r\nprint (min(max_per_cup3n,w))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\ng = a[0]\nb = a[n] / 2\nmaxm = w / (3 * n)\nprint(min(g, b, maxm) * 3 * n)\n", "n, w = map(int, input().split())\r\na = input().split()\r\nfor i in range(2n):\r\n a[i] = int(a[i])\r\na.sort()\r\ng = []\r\nb = []\r\n\r\nfor i in range(2n):\r\n if i<n:\r\n g.append(a[i])\r\n else:\r\n b.append(a[i]/2)\r\nprint(min(3nmin(min(g),min(b)),w))", "n, w = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nk = w / (3 * n)\r\nv.sort()\r\n\r\nv1 = v[:n]\r\nv2 = v[n:]\r\nx = float(0)\r\nif (2 * v1[0] <= v2[0]):\r\n x = min(k, v1[0])\r\nelse:\r\n x = min(k, v2[0] / 2.0)\r\n\r\nres = float(3 * n * x)\r\nprint(res)\r\n ", "n,w=map(int, input().split())\r\na=list(map(int, input().split()))\r\na.sort()\r\ng=a[0]\r\nb=a[n]\r\nif g>=w:\r\n print(w)\r\nelse:\r\n if g2>b:\r\n g=b/2\r\n t=gn + g2n\r\n if t<=w:\r\n print(t)\r\n else:\r\n print(w)", "import sys\r\nn,w=map(int,input().split())\r\nArray=list(map(int, input().split()))\r\n\r\nArray=sorted(Array)\r\n\r\nx=min(Array[0],(Array[n]/2))\r\nresult=nx+2xn\r\nif result>w:\r\n print(w)\r\n sys.exit(0)\r\nprint(result)\r\n\r\n", "def solve():\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n \r\n minCapacity = min(a[0], a[n] / 2)\r\n res = min(w, minCapacity 3 * n)\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, w = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nsorted_a = sorted(a)\n\namount = sorted_a[0]\nminimum_boy_capacity_cup = sorted_a[n]\nres = 0\n\nif minimum_boy_capacity_cup / 2 <= amount:\n res = (minimum_boy_capacity_cup * n) + ((minimum_boy_capacity_cup / 2) * n)\nelse:\n while amount >= 0:\n if amount * 2 > minimum_boy_capacity_cup:\n amount = amount / 2\n else:\n res = (amount * n) + (amount * 2 * n)\n break\n\nprint(min(w, res))", "rr = lambda: map(int, input().split())\r\nn, w = rr(); a = sorted(rr())\r\nprint(min(a[0], a[n] / 2, w / 3 / n) * 3 * n)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ncap = min(a[0], a[n] / 2)\r\n\r\nserve = min(w/n/3, cap)\r\n\r\nans = serve3n\r\n\r\nprint(ans)", "n, w = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n\r\nv.sort()\r\n\r\nif v[n] / v[0] >= 2:\r\n x = v[0] \r\nelse:\r\n x = v[n] / 2\r\n\r\nsum = 3 * n * x \r\n\r\nprint(min(sum, w))\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse = False)\r\n\r\nmin_girl = a[0]\r\nmin_boy = a[n] * 0.5\r\nif min_girl < min_boy:\r\n ans = min_girl * 3 * n * 1.0\r\nelse:\r\n ans = min_boy * 3 * n\r\nans = min(ans, w)\r\n\r\nprint('%.10f' % ans)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/557/B\r\n\r\nn, w = map(int, input().split())\r\nl_t = list(map(int, input().split()))\r\nl_t.sort()\r\nt_a = min(w / (3 * n), l_t[0], l_t[n] / 2)\r\nprint(t_a * n * 3)", "def init():\r\n num_input = input()\r\n num_input = num_input.split(\" \")\r\n n = int(num_input[0])\r\n w = int(num_input[1])\r\n\r\n a = input()\r\n a = a.split(\" \")\r\n length = 2 * n\r\n for i in range(length):\r\n a[i] = int(a[i])\r\n\r\n return a, n, w\r\n\r\n\r\ndef solve(a, n, w):\r\n a.sort()\r\n cup = min(a[0], a[n] / 2)\r\n return min(3 * n * cup, w)\r\n\r\na, n, w = init()\r\nprint(solve(a, n, w))\r\n", "def getMaxlWater(n,w,a):\n a.sort()\n minCup = min(a[0],a[n]/2)\n if minCup3n > w:\n print(w)\n exit()\n return minCup3n\n\n\nif __name__ == \"__main__\":\n n, w = map(int,input().split())\n a = list(map(int,input().split()))\n result = getMaxlWater(n,w,a)\n if result%1 != 0:\n print(result)\n else:\n print(int(result))", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=100000007\r\nn,w=vary(2)\r\nnum=array_int()\r\nnum.sort()\r\nprint(min(w,3nnum[0],1.5nnum[n]))\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "inputt = input().split()\nn, w = int(inputt[0]), int(inputt[1])\narr = [int(i) for i in input().split()]\narr.sort()\nli = min((arr[0] * n * 3), (arr[n] * n * 3 / 2))\nli = min(li, w)\nprint(li)", "n, w = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\ngirl = a[:n] \r\nboy = a[n:]\r\n\r\nminG = min(girl)\r\nminB = min(boy)\r\n\r\n# x should\r\n# x <= minG\r\n# 2x <= minB\r\n# 3xn <= w\r\n# ans: 3xn when x satisfies all 3 conditions\r\n\r\nx = min(minG, minB/2, w/(3n))\r\nans = 3xn \r\nif ans - int(ans) == 0:\r\n\tprint(int(ans))\r\nelse:\r\n\tprint(ans) ", "def inp(): \r\n return map(int, input().split(' '))\r\n\r\nn, w = inp() \r\nv = inp() \r\n\r\nv = sorted(v) \r\nif (v[n]1.0 / v[0] >= 2.0):\r\n x = v[0] \r\nelse:\r\n x = v[n]1.0/2.0\r\n\r\nsum = 3.0 n * x \r\n\r\nif (sum > w):\r\n sum = w \r\n\r\nprint(sum)", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nl=len(a)\r\ni,j=0,int(l/2)\r\nif a[i]2<=a[j] and a[j]/2.0<=a[i]:\r\n ans=max(a[i],a[j]/2.0)3n\r\nelif a[i]2<=a[j]:\r\n ans=a[i]3n\r\nelif a[j]/2.0<=a[i]:\r\n ans=a[j]/23n\r\nprint (min(ans,w))\r\n", "INPUT = lambda: map(int, input().split())\n\nn, w = INPUT()\na = sorted(INPUT())\n\nprint(min(w, 1.5 * n * a[n], 3 * n * a[0]))", "#!/usr/bin/python3\nn,m=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\nprint(3nmin(a[0],a[n]/2,m/n/3))\n", "#1: Devu, the Dumb Guy\n# n, x = map(int, input().split())\n# a = sorted(list(map(int, input().split())))\n# print(sum([a[i]max(x-i, 1) for i in range(len(a))]))\n\n#2: http://bigocoder.com/courses/BLUE23/BLUE23_LEC03/BLUE_L03P02/statement\n# n, a, b = map(int, input().split())\n# h = sorted(list(map(int, input().split())))\n# print(h[len(h) - a] - h[len(h) - a - 1])\n\n#3: http://bigocoder.com/courses/BLUE23/BLUE23_LEC03/BLUE_L03P03/statement\n# n = int(input())\n# a = list(map(int, input().split()))\n# start = -1\n# end = -1\n# for i in range(len(a) - 1):\n# if a[i] > a[i+1]:\n# start = i\n# break\n# for i in range(len(a) - 1, 0, -1):\n# if (a[i] < a[i-1]):\n# print(i)\n# end = i\n# break\n# if start == -1 or end == -1:\n# print(\"no\")\n# else:\n# print(\"yes\")\n# print(start + 1, end + 1)\n\n#6: Pasha and Tea\nn, w = map(int, input().split())\na = sorted(list(map(int, input().split())))\nx = min(a[0], a[n]/2)\nm = 3(n)x\nif m <= w: print(m) \nelse: print(w)\n\n\n", "nw = [int(x) for x in input().split()]\nn = nw[0]\nw =nw[1]\narr =[int(x) for x in input().split()]\narr.sort()\ngirl_size = arr[0]\nboy_size = arr[n]\nm =min(girl_size,boy_size/2)\nm = min(m,w/(3n))\nprint(mn+2mn)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\na_girls = a[0]\r\na_boys = a[n]\r\n\r\nprint(min(a[0], a[n]/2, w/(3n))3n)", "n, w = map(int, input().split())\r\ncapac = list(sorted(map(int, input().split())))\r\nboy = capac[len(capac)//2]\r\ngirl = capac[0]\r\n\r\nprint(min(3girln, 3/2boyn, w))", "# ý tưởng: sắp xếp mảng a, sau đó so sánh vị trí 0 và n có giá trị lần lượt là b và g\r\n# nếu b >= 2 * g thì nữ uống nhiều nhất đúng bằng lượng g và nam là 2 * g\r\n# ngược lại thì nữ sẽ uống lượng nhiều nhất là b / 2 và nam là b\r\n# tính toán tổng lượng nước và trả về biến res\r\n# cuối cùng so sánh biến res với lượng nước tối đa ban đầu w\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = a[n]\r\ng = a[0]\r\nres = 0\r\nif b >= 2 * g:\r\n res = g * n * 3\r\nelse:\r\n res = b / 2 * n * 3\r\n\r\nif res > w:\r\n res = w\r\nprint(res)", "n, w = map(int,input().split())\r\nteas = list(map(int,input().split()))\r\nteas.sort()\r\nx = min(teas[0],teas[n]/2)\r\nx = min(x,w/(3n))\r\nprint(3xn)\r\n", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=a[0]\r\ny=a[n]\r\n\r\nif x>=y/2:\r\n ans=min((3yn)/2,w)\r\n print(ans)\r\nelse:\r\n ans=min(3xn,w)\r\n print(ans)", "n, w = map(int, input().split())\na = sorted(list(map(int, input().split())))\n\nif a[n] < a[0] 2:\n s = 1.5 * a[n]\nelse:\n s = 3 * a[0]\nprint(min(s * n, w))\n ", "__author__ = 'Andrey'\nn, w = map(int, input().split())\nvolumes = list(map(int, input().split()))\nvolumes.sort()\nm = -1\nif volumes[0] * 2 <= volumes[n]:\n possible = 3 * n * volumes[0]\n if possible <= w:\n m = max(m, possible)\nif volumes[n] / 2 <= volumes[0]:\n possible = volumes[n] / 2 * 3 * n\n if possible <= w:\n m = max(m, possible)\nif w / (3 * n) <= volumes[0] and 2 * w / (3 * n) <= volumes[n]:\n m = max(m, w)\nprint(m)", "n, w=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\n\r\nprint(min(a[0], a[n]/2, w/3/n)3n)", "n, w = map(int,input().split())\r\ncups = list(map(int,input().split()))\r\n\r\ncups.sort()\r\ntotal_tea = 0 \r\ntotal_tea = min(cups[0], cups[n] / 2)\r\nprint(min(3 * total_tea * n, w))\r\n\r\n", "n,w = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nmaxx = w/(3n)\r\nt = 0\r\nif(a[n]/2 > a[0]):\r\n t = a[0]\r\nelse:\r\n t = a[n]/2\r\nif(t> maxx):\r\n print(w)\r\nelse:\r\n print(t3n)", "n, w = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\nb = a[n]\ng = a[0]\nif b >= 2g:\n ret = g2n + gn\nelif b >= g:\n ret = bn+float(b)/2n\nprint(min(ret, w))\n\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif a[n] / a[0] >= 2:\r\n x = a[0] \r\nelse:\r\n x = a[n] / 2\r\nsum = 3 n * x \r\nprint(min(sum, w))\r\n", "n, w = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nt = min(a[0]2, a[len(a) // 2])\r\nprint(min(w, (t len(a) // 2) + (t/2)(len(a) // 2)))\r\n", "n, w = map(int, input().split())\ncups = list(map(int, input().split()))\ncups.sort()\nx = min(2 cups[0], cups[n])\nprint(min(w, n * x * 3 / 2))\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nS=sorted(l)\r\nv=S[0]\r\ng=S[n]\r\nl1=vn+gn\r\nif l1-m<0 :\r\n m=l1\r\n\r\np=m/3\r\np1=p2\r\nt=p/n\r\nt1=p1/n\r\nif t1>g :\r\n t1=g\r\n t=t1/2\r\nif t>v :\r\n t=v\r\n t1=v2\r\nprint((t+t1)n)\r\n \r\n \r\n", "def pasha_and_tea(n,w,l):\r\n s=sorted(l)\r\n if s[n]>=s[0]2:\r\n girl=s[0]\r\n boy=s[0]2\r\n else:\r\n girl=s[n]/2\r\n boy=s[n]\r\n if (girl+boy)n<=w:\r\n print((girl+boy)n)\r\n else:\r\n print(w)\r\nn,w=list(map(int, input().split()))\r\nl=list(map(int, input().split()))\r\npasha_and_tea(n,w,l)\r\n", "line = input()\r\nn = int(line.split(' ')[0])\r\nw = int(line.split(' ')[1])\r\ncups= []\r\nline = input().split(' ')\r\n\r\nfor l in line:\r\n cups.append(int(l))\r\ncups.sort()\r\n\r\nmin1 = cups[0]\r\nmax1 = cups[n]\r\n\r\nx = min(cups)\r\nif x 2 > max1:\r\n x = max1 / 2\r\n\r\n\r\nprint(min(x * n * 3, w))", "def inp():\r\n return map(int, input().split())\r\n\r\nn, w = inp()\r\na = list(inp())\r\n\r\na.sort()\r\n\r\ngirls = a[:n]\r\nboys = a[n:]\r\n\r\nx = 0\r\n\r\nif girls[0] * 2 > boys[0]:\r\n x = boys[0] / 2\r\nelse:\r\n x = girls[0]\r\n\r\ntotal = 3 * x * n\r\n\r\nif total > w:\r\n total = w\r\n\r\nprint(total)\r\n", "n,w=[int(i)for i in input().split()]\r\nl=[int(i)for i in input().split()]\r\nl.sort()\r\nprint(min(w,3nmin(l[0],l[n]/2)))", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ngirl = a[0]\r\nboy = a[n]\r\np = 0\r\nif (2girl > boy):\r\n p = boy/2\r\nelse:\r\n p = girl\r\nans = min(3.0pn, w)\r\nprint(ans)\r\n\r\n\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))[:n2]\r\n\r\na.sort()\r\n\r\np = 0\r\nif a[0]2 <= a[n]:\r\n p = a[0]\r\nelse:\r\n p = a[n] / 2\r\n\r\nif p3n <= w:\r\n print(p3n)\r\nelse:\r\n print(w)\r\n", "n, w = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\na.sort()\nx = a[0]\ny = a[n]\nif x 2 >= y:\n\tprint(min(w, y / 2 * 3 * n))\n\texit()\nprint(min(w, x * 3 * n))\n", "number_of_boys, capacity = map(int, input().split())\r\n\r\ncapacity_of_cups = list(map(int, input().split()))\r\n\r\ncapacity_of_cups.sort()\r\n\r\namount_of_girl = capacity_of_cups[0]\r\namount_of_boy = capacity_of_cups[number_of_boys]\r\n\r\npour = capacity/(3number_of_boys)\r\n\r\nif amount_of_girl == amount_of_boy:\r\n\tamount_of_girl = amount_of_girl/2\r\nelse:\r\n\tif amount_of_girl2 > amount_of_boy:\r\n\t\tamount_of_girl = amount_of_boy/2\r\n\r\nif pour > amount_of_girl:\r\n\tpour = amount_of_girl\r\n\r\nprint(pour3number_of_boys)", "n,w = list(map(int,input().split(' ')))\r\nvl = list(map(int,input().split(' ')))\r\nvl.sort()\r\ng = vl[0]\r\nb = vl[n]\r\nprint(3n(min(vl[n]/2,vl[0],w/(3n))))\r\n", "from sys import stdin, stdout\r\nn, w = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\na.sort()\r\n\r\nv_each_cup = min(a[0], a[n]/2)\r\nstdout.write(str(min(3v_each_cupn, w)))", "a,k = map(int,input().split())\r\nl = sorted(map(int,input().split()))\r\nprint(min(k,a(3min(l[a]/2.0, l[0]))))", "#! /usr/bin/env python\n# -- coding: utf-8 --\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ninp = input().split()\nn = int(inp[0])\nw = int(inp[1])\n\ncups = sorted(list(map(int, input().split())))\n\ngirl = cups[0]\nboy = cups[n]\n\ns = 0\n\ns += (min(girl, boy / 2) 3 * n)\n\nprint(min(s, w)) \n", "# Pasha and Tea\r\ndatain = True\r\n\r\nif datain:\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\nelse:\r\n n, w = 1, 5\r\n a = [2, 3]\r\n\r\n\t\r\na.sort()\r\n\r\ng = a[0]\r\nb = a[n]\r\nt = min(g, float(b/2))\r\nvol = 3tn\r\nprint(min(vol,w))", "n,w = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\n\r\na.sort()\r\nmingirl = a[0]\r\nminboy = a[n]\r\n\r\nwgirl = w/3\r\nwboy = w-wgirl\r\n\r\nif mingirl2 <= minboy:\r\n m = mingirl\r\nelse :\r\n m = minboy/2\r\n\r\nq= min(mn3,w)\r\n\r\nprint(q)\r\n\r\n", "n, w = map(int, input().split())\r\na = list(map(float, input().split()))\r\n\r\na.sort()\r\n\r\nif a[0] 2 <= a[n]:\r\n base = a[0]\r\nelse:\r\n base = a[n] / 2\r\n\r\nresult = min(w, base * n + base * n * 2)\r\nprint(f\"{result:.9f}\")", "'''557B'''\r\nn, w = map(int, input().split())\r\ncap = list(map(int, input().split()))\r\ncap.sort()\r\ngirl_min, boy_min = cap[0], cap[n]\r\n\r\nif girl_min2<=boy_min:\r\n print(min(w, girl_min3n))\r\nelse:\r\n print(min(w, boy_min1.5n))\r\n", "n, w=map(int, input().split())\r\na=list(map(int, input().split()))\r\na.sort()\r\nprint(min(w, min(a[0]3n, a[n](3/2)n)))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\n\nb = sorted(a)\n\nb1 = b[0:n]\nb2 = b[n:2 n]\n\nmaxGirl = b1[0]\nmaxBoy = b2[0]\n\nmaxWater = w / 3 / n \n\nmaxCapity = 0\n\ntotal = 0\n\nif maxGirl * 2 > maxBoy:\n\tmaxCapity = maxBoy / 2\nelse:\n\tmaxCapity = maxGirl\n\nif (maxWater > maxCapity):\n\ttotal = maxCapity * n * 3\nelse:\n\ttotal = maxWater * n * 3\n\nprint(total)\n", "n, w = map(int,input().split())\r\n\r\na = sorted(map(int,input().split()))\r\n\r\nx=a[0]n3\r\ny=a[n]n1.5\r\nprint(min(w,x,y))", "n, w = map(int, input().split())\r\ncups = [int(i) for i in input().split()]\r\n\r\ncups.sort()\r\nif cups[n] >= cups[0]2:\r\n\twater = cups[0]3n\r\n\tif water > w:\r\n\t\tprint(w)\r\n\t\tquit()\r\n\telse:\r\n\t\tprint(water)\r\n\t\tquit()\r\nelse:\r\n\twater = cups[n]3/2n\r\n\tif water > w:\r\n\t\tprint(w)\r\n\t\tquit()\r\n\telse:\r\n\t\tprint(water)\r\n\t\tquit()", "n, w = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nx = min(a[0], a[n]/2)\r\nprint(min(3xn, w))", "#Pasha and tea\r\nn,w = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nb = []\r\ng = []\r\nfor i in range(n):\r\n g.append(l[i])\r\n\r\ni = n\r\nwhile i < 2n:\r\n b.append(l[i])\r\n i += 1\r\n\r\nlow = 0\r\nhigh = w\r\nitr = 200\r\nm = 0\r\nwhile itr:\r\n mid = (low+high)/2\r\n k = w\r\n f = 0\r\n for i in range(n):\r\n o = g[i]\r\n t = b[i]\r\n if o >= mid and t >= 2mid:\r\n k = k-((2mid)+(mid))\r\n\r\n else:\r\n f = 1\r\n break\r\n\r\n if k < 0:\r\n high = mid\r\n itr -= 1\r\n continue\r\n\r\n if f == 1:\r\n high = mid\r\n itr -= 1\r\n continue\r\n\r\n if m < mid:\r\n m = mid\r\n\r\n low = mid\r\n itr -= 1\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans = ans+m+(2m)\r\n\r\nprint(ans)", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=x3\r\ns=y/b\r\na.sort()\r\nz=len(a)//2\r\nk=min(a[z:])\r\np=min(a[:z])\r\nw=(min(s,k/2,p))\r\n\r\nprint(x(w+2w))", "n, w = map(int, input().split())\r\ncups = list(map(int, input().split()))\r\ncups.sort()\r\n\r\nm = min(cups[0], cups[n] / 2)\r\nmax_amount = 3 * m * n\r\nprint(min(max_amount, w))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n#print(a)\nbigCup = max(a)\n\n\ndef check(x): # x == 2n3\n agar = x/(2n3)\n for_girl = agar * 2\n for_boy = for_girl * 2\n #print(for_girl, for_boy, x)\n if a[0] < for_girl or a[n] < for_boy:\n return False\n # for i in range(2n):\n # if for_girl > a[i] or for_boy > a[i]:\n # return False\n return True\n\n\nright = w\nleft = 0\nmid = (left + right) / 2\nwhile left + 0.0000001 < right:\n mid = (left + right) / 2\n #print(mid, check(mid))\n if check(mid):\n left = mid\n else:\n right = mid\nprint(mid)\n", "def answer(n,w,A):\r\n A.sort(reverse=True)\r\n \r\n maxb=A[n-1]\r\n maxg=A[-1]\r\n if maxb<=2maxg:\r\n maxg=maxb/2\r\n \r\n return min(3nmaxg,w)\r\n \r\n\r\n\r\nn,w=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,w,arr)) ", "n,w,vl = list(map(int,input().split(' '))) + list(map(int,input().split(' ')))\r\nvl.sort()\r\nprint(3n(min(vl[n]/2,vl[0],w/(3n))))\r\n", "import sys\n\n# get the number of boys/girls, and the max teapot ml capacity\nn, w = [int(i) for i in sys.stdin.readline().split()]\n\n# Get the teapots and sort them by size\nteacups = sorted([int(i) for i in sys.stdin.readline().split()])\n\n# girl size is the smallest teacup, boy size is the smallest of the 1/2 largest\n# teacups\ngirl, boy = [teacups[0], teacups[n]]\n\n# boy size is the min of his cup size or twice the girl cup size\nboy_ml = min(girl * 2, boy)\n\n# girl is half the boy size\ngirl_ml = boy_ml / 2\n\n# total is the min of w and sum of all the amounts \ntotal = min(n * (boy_ml + girl_ml), w)\n\nprint(total)", "n, w = map(int, input().split())\r\ncups = list(map(int, input().split()))\r\ncups.sort()\r\n\r\nmaxForACup = cups[0]\r\nif maxForACup * 2 > cups[n]:\r\n maxForACup = cups[n] / 2\r\n \r\nif maxForACup3n <= w:\r\n print(maxForACup3n)\r\nelse:\r\n print(w)", "n,w = map(int,input().split())\r\ncups = list(map(int,input().split()))\r\ncups.sort()\r\n\r\nm = min(cups[0],cups[n]/2.0)\r\ntotal = 3mn\r\nprint(min(total,w))", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nfirst=a[0]\r\nsecond=a[n]\r\nif first2<=second:\r\n print(min(x,3nfirst))\r\nelse:\r\n print(min(x,3nsecond/2))", "s = [int(x) for x in input().split(' ')]\r\nn, pot = s[0], s[1]\r\ncups = sorted([int(x) for x in input().split(' ')])[::-1]\r\n\r\nfor i in range(0, len(cups) // 2):\r\n cups[i] = cups[i] / 2\r\n \r\nl = len(cups)\r\nmin_cup = min(cups)\r\n\r\ny = min_cup n * 3\r\n\r\nprint(y if y < pot else pot)", "n, w = (int(i) for i in (input().split()))\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nif 2 * a[0] <= a[n]:\r\n print(min(w, 3 * a[0] * n))\r\nelse:\r\n print(min(w, 1.5 * a[n] * n))", "\nn,w=[int(x) for x in input().split()]\na=[int(x) for x in input().split()]\n\na.sort()\n\nx=min(a[0],a[n]/2)\n\nans=min(xn3,w)\n\nprint(ans)\n", "params = list(map(int, input().split(\" \")))\r\nn = params[0]\r\nw = params[1]\r\nvolumn = sorted(list(map(int, input().split(\" \"))))\r\ntemp = 0\r\nif volumn[0] * 2 < volumn[n]:\r\n temp = volumn[0] * 3.0 * n\r\nelse:\r\n temp = volumn[n]/2.03n\r\nif temp>w:\r\n print(w)\r\nelse:\r\n print(temp)", "n, w = map(int, input().split())\r\na = [float(x) for x in input().split()]\r\na.sort()\r\ntt = min(a[0], (a[n]/2))\r\nttt = 3ntt\r\nt = w\r\nt = min(w, 3ntt)\r\nprint(t)\r\n", "n,w = map(int,input().split())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort()\r\n\r\nx = A[0]\r\ny = A[n]\r\nm = min(x, y/2)\r\n\r\nprint(min(3mn, w))", "m,w=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\ng=min(l[0],l[m]/2)\r\nprint(min(3gm,w))", "n, w = map(int ,input().split())\r\nread = list(map(int, input().split()))\r\nread.sort(reverse = True)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append(read[i])\r\n b.append(read[i + n])\r\n\r\nc = []\r\nfor i in range(n):\r\n c.append(min(a[i]/2, b[i]))\r\n\r\nprint(min(w, min(c) * 3 * n))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2) / 2\r\n for _ in range(100):\r\n m = (c1 + c2) / 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n return m\r\n\r\ndef ok(m):\r\n return True if m <= a[0] and 2 * m <= a[n] else False\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ninf = w / (3 * n)\r\nans = binary_search(0, inf) * 3 * n\r\nprint(ans)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncan_pour_g = w/(3n)\r\n\r\na = sorted(a)[::-1]\r\nb = a[:n]\r\ng = a[n:]\r\n\r\nmb = min(b)\r\nmg = min(g)\r\n\r\npg = 0\r\nif mb > mg2:\r\n pg = mg\r\nelse:\r\n pg = mb/2\r\n \r\nif can_pour_g < pg:\r\n print((ncan_pour_g) + (2ncan_pour_g))\r\nelse:\r\n print((npg) + (2npg))", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ng=a[0]\r\nb=a[n]\r\nif (g2)<=b:\r\n b=(g2)\r\nelif (g2)>b:\r\n g=b/2\r\nans=(gn)+(bn)\r\nif ans>w:\r\n ans=w\r\nprint(ans)", "R = lambda: list(map(int, input().split()))\r\nn,w = R()\r\na = R()\r\n\r\na = sorted(a)\r\nprint(min(w,min(a[n]/2,a[0])3n))", "# ý tưởng: tìm max và min trong mảng a, sau đó đếm số lượng 2 loại ly\n# nếu lượng ly có kích thước nhỏ chiếm đa số => toàn bộ nam sẽ uống ly nhỏ, và nữ sẽ uống phần ly còn lại\n# do đó lượng nước tính bằng kích thước ly nhỏ\n# ngược lại thì toàn bộ nam sẽ uống nước với ly kích thước lớn \n# khi đó sẽ so sánh chênh lệch kích thước giữa 2 loại ly\n# từ đó tìm ra kích thước ly dùng để tính toán lượng nước\n# cách tính thì anh chị có thể xem bên dưới \nn, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nb = a[n]\ng = a[0]\nres = 0\nif b >= 2 g:\n res = g * n * 3\nelse:\n res = b / 2 * n * 3\n\nif res > w:\n res = w\nprint(res)", "n,w = map(int,input().split())\r\na = []\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = min(a[0],a[n]/2)\r\nres = min(3mn,w) \r\nprint(res)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nm_g, m_b = a[0], a[n]\r\nif m_b / 2 <= m_g and (m_b / 2) * n + m_b * n <= w: print((m_b / 2) * n + m_b * n)\r\nelif m_g * 2 <= m_b and m_g * n + m_g * 2 * n <= w: print(m_g * n + m_g * 2 * n)\r\nelse:\r\n x = w / (3 * n)\r\n print(3 * x * n)", "n, w = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nh = min(arr[0], arr[n] / 2, w / (3 * n))\r\nprint(3 * h * n)\r\n", "n, w = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nprint(min(a[0], a[n] / 2, w / 3 / n) * 3 * n)", "n,w = map(int,input().split())\na = sorted(list(map(int,input().split())))\nprint(min(w,a[n]1.5n,a[0]3n))", "n, w = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nprint(min(3 * n * min(a[0], a[n] / 2.0), w))", "n,w=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(min(w,l[n]n1.5,l[0]n3))", "n,w=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(min(w,l[n]n1.5,l[0]n3))\r\n\r\n#idea is take all w if all>w\r\n# or select min for girl then boys will take 2min\r\n# or select min for boy then girls will take 0.5min\r\n\r\n# final in min is sum for each select", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=min(l[0],l[n]/2)\r\nans=xn+2xn\r\nprint(min(ans,k))", "n,m=map(int,input().split())\r\nAarray=list(map(int,input().split()))\r\nAarray.sort()\r\nprint(3nmin(Aarray[0],Aarray[n]/2,m/n/3))", "n, w = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nprint(3 n * min(w / 3 / n, a[0], a[n] / 2))", "n, w = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nsortedArray = sorted(l)\r\n\r\ngirls = sortedArray[0:n]\r\n\r\nboys = sortedArray[n:n2]\r\n\r\n\r\nminGirl = girls[0]\r\n\r\nminBoy = boys[0]\r\n\r\nteaBoys = 0\r\nteaGirls = 0\r\n\r\nif minBoy/2 <= minGirl:\r\n\tteaBoys = minBoyn\r\n\tteaGirls = (minBoy/2)n\r\nelse:\r\n\tminBoy = minGirl 2\r\n\tteaBoys = minBoy * n\r\n\tteaGirls = minGirl * n\r\n\r\nif teaBoys + teaGirls > w:\r\n\tprint(w)\r\nelse:\r\n\tprint(teaGirls+teaBoys)\r\n\r\n\r\n", "n, w = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\n\r\na.sort()\r\n\r\nres = 0\r\nif a[n] < a[0] * 2:\r\n res = 3.0 / 2 * a[n] * n\r\nelse:\r\n res = 3.0 * n * a[0]\r\n\r\nif(res > w):\r\n res = w\r\n\r\nprint(\"%.10f\" % res)", "n,w = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ng = l[0]\r\nb = l[n]\r\n\r\nans = min(b/2.0 , g)\r\n\r\nans = min(ans * 3.0 * n, w)\r\n\r\nprint(ans)\r\n", "n,w = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ngirlsmin = a[0]\r\nboysmin = a[n]\r\nif girlsmin<boysmin/2:\r\n x = girlsmin\r\nelse:\r\n x = boysmin/2\r\nquant = 3xn\r\nprint(min(quant,w))\r\n\r\n", "n, w = map(int, input().split())\n\narr = list(map(int, input().split()))\n\n#если чайник бменьше? \n\narr.sort()\narr.reverse()\n\nboys, girls = arr[:n], arr[n:n2]\n\nif min(boys)/2>=min(girls):\n\tprint(min((min(girls)n)+(min(girls)n)2, w))\nelse:\n\tprint(min((min(boys)n)+(min(boys)n)/2, w))", "__author__ = 'darinflar'\r\nn, w = map ( int, input().split())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nl.sort()\r\nd = w\r\nfor i in range(n):\r\n d= min(d,l[i])\r\n\r\nm = w\r\nfor i in range(n,2n):\r\n m = min (m, l[i])\r\n\r\nxd = min ( d, w/(3n))\r\nxm = min ( m, 2w/(3n))\r\n\r\nx = min (xd, xm/2)\r\n\r\nx = 3xn\r\n\r\nprint (x)", "def good(mid,w,girls,boys):\r\n for i in range(len(girls)):\r\n if girls[i]<mid:\r\n return False\r\n for i in range(len(boys)):\r\n if boys[i]<2mid:\r\n return False\r\n return True\r\nn,w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\ngirls=[]\r\nboys=[]\r\nfor i in range(0,n):\r\n girls.append(a[i])\r\nfor i in range(n,len(a)):\r\n boys.append(a[i])\r\nl=0\r\nr=w\r\nans=0\r\nfor i in range(65):\r\n mid=(l+r)/2\r\n if good(mid,w,girls,boys)==True:\r\n l=mid\r\n ans=mid\r\n else:\r\n r=mid\r\nfans=0\r\nfor i in range(0,len(girls)):\r\n fans+=ans\r\nfor i in range(0,len(boys)):\r\n fans+=(ans2)\r\nprint(min(fans,w))", "l = [int(x) for x in input().split(' ')]\r\nn, w = l[:]\r\n\r\nl = [int(x) for x in input().split(' ')]\r\n\r\nl.sort()\r\n\r\ngirls = l[:n]\r\nboys = l[n:]\r\n\r\nmg = girls[0]\r\nmb = boys[0]\r\n\r\nq1 = w / (3 * n)\r\nq2 = mb / 2\r\nq3 = mg\r\n\r\nx = min(q1, min(q2, q3))\r\n\r\nprint(x * 3 * n)", "def read_data():\r\n n, w = map(int, input().split())\r\n As = list(map(int, input().split()))\r\n return n, w, As\r\n\r\ndef solve(n, w, As):\r\n As.sort()\r\n cap_girls = As[0]\r\n cap_boys = As[n]\r\n if cap_girls * 2 < cap_boys:\r\n return min(cap_girls * 3 * n, w)\r\n else:\r\n return min(cap_boys * 1.5 * n, w)\r\n\r\nn, w, As = read_data()\r\nprint(solve(n, w, As))", "p=input().split()\r\nn=int(p[0])\r\nw=int(p[1])\r\nq=input().split()\r\na=[]\r\ns=0\r\nfor i in range(2n):\r\n a.append(int(q[i]))\r\na.sort()\r\nif a[n]>=2a[0]:\r\n s=na[0]+n2a[0]\r\nelse:\r\n s=na[n]+n(a[n]/2)\r\nif s>w:\r\n print(w)\r\nelse:\r\n print(s)\r\n", "#Pasha and Tea\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif 2 a[0] <= a[n]:\r\n ans = 3 * n * a[0]\r\nelif 2 * a[0] > a[n]:\r\n ans = 3 / 2 * n * a[n]\r\n\r\nprint(min(ans, w))", "n,w = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nmaxx = min(a[0]3,a[n]1.5)n\r\nprint(min(maxx,w))", "n, w = map(int, input().split())\r\nn = 2\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ng = arr[:n // 2]\r\nb = arr[n // 2:]\r\nfirst_g = g[0]\r\nfirst_b = b[0]\r\nif first_g * 2 > first_b:\r\n first_g = first_b / 2\r\nelif first_g * 2 < first_b:\r\n first_b = first_g * 2\r\nans = first_g * n / 2 + first_b * n / 2\r\nprint(min(ans, w))", "def calculate_sum_tea(n, w, arr):\r\n sorted_arr = sorted(arr)\r\n min_cup_size_g = sorted_arr[0]\r\n min_cup_size_b = sorted_arr[n]\r\n\r\n if min_cup_size_b / 2 > min_cup_size_g:\r\n min_cup_size_b = 2 * min_cup_size_g\r\n elif min_cup_size_b / 2 < min_cup_size_g:\r\n min_cup_size_g = min_cup_size_b / 2\r\n\r\n max_tea_each_girl = w/(3n)\r\n\r\n if max_tea_each_girl > min_cup_size_g:\r\n max_tea_each_girl = min_cup_size_g\r\n\r\n sum_tea = max_tea_each_girl 3 * n\r\n print(sum_tea)\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\ncalculate_sum_tea(first_line_input[0], first_line_input[1], A)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nres = 0\r\nposi = a[n] / a[0]\r\nif posi >= 2:\r\n x = a[0]\r\n res = nx2 + nx\r\nelse:\r\n x = a[n]\r\n res = nx + (nx)/2\r\nif res > w:\r\n res = w\r\n\r\nprint(res)\r\n", "#557B\n\na = list(map(int, input().split(\" \")))\nn = a[0]\nw = a[1]\n\na = list(map(int, input().split(\" \")))\nteacups = sorted(a)\n\ngirls = teacups[:n]\nboys = teacups[n:]\n\nmingirls = min(girls)\nminboys = min(boys)\n\nif 2 mingirls < minboys:\n\ttotalmin = mingirls\nelse:\n\ttotalmin = minboys / 2\n\n\nif 3 * n * totalmin <= w:\n\tprint(3 * n * totalmin)\nelse:\n\tprint(w)", "from math import ceil\r\nx = [int(i) for i in list(input().split(\" \"))]\r\ny = [int(i) for i in list(input().split(\" \"))]\r\ny = sorted(y)\r\nmax = y[x[0]]\r\nmin = y[0]\r\nif (max>=2min):\r\n max = 2min\r\nelse:\r\n min = max/2\r\ng = min3x[0]\r\nif g < x[1]:\r\n if g == ceil(g):\r\n print(ceil(g))\r\n else:\r\n print(g)\r\nelse:\r\n print(x[1])\r\n", "inp = lambda : map(int, input().split())\r\nn, w = inp()\r\na = sorted([inp()])\r\nprint(min(w, min(a[n] / 2, a[0]) n * 3))\r\n", "n, w = map(int, input().split(' ')[0:2])\na = list(map(int, input().split(' ')[0:2n]))\na.sort()\n\nx = min(2a[0], a[n]) / float(2)\nx = min(x, w / float(3n))\n\nprint(x 3 * n)\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nif a[0]>= a[n]/2:\r\n\tm= (a[n]n+ a[n]n/2)\r\nelse:\r\n\tm= (a[0]n + a[0]n2)\r\n\r\nif m > w:\r\n\tprint(w)\r\nelse:\r\n\tprint(m)", "tmp=input().split()\nn=int(tmp[0])\nw=int(tmp[1])\narr=[]\ntmp=input().split()\nfor i in tmp:\n\tarr.append(int(i))\narr.sort()\nif(arr[n]/2<=arr[0] and (arr[n]/2)3n<=w):\n\tprint(\"%.7f\"%((arr[n]/2)3n))\nelse:\n\tif(arr[0]3n<=w):\n\t\tprint(\"%.7f\"%(arr[0]3n))\n\telse:\n\t\tprint(w)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\n\r\nG = a[-1]\r\nB = a[n-1]\r\n\r\n# x = min(G, B/2)\r\n# print(min(w, 3 x * n))\r\n\r\nif B >= 2 * G:\r\n print(min(w, 3 * G * n))\r\nelse:\r\n G = B/2\r\n print(min(w, 3 * G * n))", "n, cap = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\ng, b = a[0], a[n]\r\nleft, right = 0, g\r\nfor _ in range(70):\r\n mid = (left + right) / 2\r\n if mid * 2 <= b:\r\n left = mid\r\n else:\r\n right = mid\r\nleft, right = 0, left\r\nfor _ in range(70):\r\n mid = (left + right) / 2\r\n if mid * n + mid * 2 * n <= cap:\r\n left = mid\r\n else:\r\n right = mid\r\nprint(left * n + left * 2 * n)", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nl=len(a)\r\ni,j=0,int(l/2)\r\nif a[i]2<=a[j] and a[j]/2.0<=a[i]:\r\n ans=max(a[i],a[j]/2.0)\r\nelif a[i]2<=a[j]:\r\n ans=a[i]\r\nelif a[j]/2.0<=a[i]:\r\n ans=a[j]/2\r\nprint (min(ans3n,w))", "n, w = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\na.sort()\r\nb = a[n]\r\ng = a[0]\r\n\r\nres = g * n * 3\r\nif res > b / 2 * n * 3:\r\n\tres = b / 2 * n * 3\r\n\r\nif res > w:\r\n\tres = w\r\nprint(res)", "########## Sửa Bài ############\r\nn,w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nx = float(min(a[0],a[n] / 2))\r\n\r\nsum = 3xn\r\n\r\nprint('{0:.7f}'.format(min(sum,w)))\r\n", "n, w = [int(_) for _ in input().split()]\r\na = list(int(_) for _ in input().split())\r\na.sort()\r\nx = min(a[0],a[n]/2)\r\nprint(min(3xn,w))\r\n", "class CodeforcesTask557BSolution:\n def __init__(self):\n self.result = ''\n self.n_w = []\n self.cups = []\n\n def read_input(self):\n self.n_w = [int(x) for x in input().split(\" \")]\n self.cups = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n self.cups.sort()\n max_per_g = (self.n_w[1] / 3) / self.n_w[0]\n real_per_g = min(self.cups[0], max_per_g)\n max_per_b = max_per_g * 2\n real_per_b = min(2 * real_per_g, self.cups[self.n_w[0]])\n ammount = 1.5 * self.n_w[0] * real_per_b\n self.result = str(ammount)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask557BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# http://codeforces.com/problemset/problem/557/B\r\n\r\nboy_count, amount_of_tea = map(int, input().split())\r\ncups = map(int, input().split())\r\n\r\ncups = sorted(cups)\r\nsmallest_cup_girl = cups[0]\r\nsmallest_cup_boy = cups[boy_count]\r\n\r\ntea_unit_needed = boy_count * 3\r\n\r\nmin_amount = min(float(smallest_cup_girl), smallest_cup_boy / 2)\r\ntotal = min_amount * tea_unit_needed\r\n\r\nif amount_of_tea < total:\r\n min_amount = amount_of_tea / tea_unit_needed\r\n\r\ntotal = min_amount * tea_unit_needed\r\n\r\nwhile total > amount_of_tea:\r\n total = min_amount * tea_unit_needed\r\n temp = total - amount_of_tea\r\n min_amount -= temp\r\n\r\nprint(total)\r\n\r\n", "n,w=input().split()\r\nn=int(n)\r\nw=int(w)\r\na=[0](2n)\r\na=input().split()\r\nfor i in range (2n):\r\n a[i]=int(a[i])\r\na.sort()\r\nprint(min(a[0],a[n]/2,w/3/n)3n)", "n,w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(min(a[0],a[n]/2,w/3/n)3n)", "n, w = [int(x) for x in input().split(\" \")] \nL = [int(x) for x in input().split(\" \")] \nL.sort() \nx = L[0] \ny = L[n] \nif 2 x > y :\n t = y/2 \nelse : \n t = x \nt = t * 3 * n \nif t > w : \n t = w \nprint(t)\n", "n, w = map(int ,input().split())\r\nread = list(map(int, input().split()))\r\nread.sort(reverse = True)\r\nc = min(read[-1], read[n - 1]/2)\r\n \r\nprint(min(w, c * 3 * n))", "n, w = map(int, input().split())\r\na = sorted(map(float, input().split()))\r\nprint(min(a[0], a[n]/2, w/3/n)3n)\r\n", "def main():\r\n n, w = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a = sorted(a)\r\n x = w / (3n)\r\n if (x <= a[0] and 2x <= a[n]):\r\n print(w)\r\n else:\r\n print(3min(a[0], a[n]/2)n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l2 = input().split()\r\nn = int(l2[0])\r\nw = int(l2[1])\r\nl = map(int, input().split())\r\nl = sorted(l, reverse=True)\r\nminB = 2000000000\r\nminG = 2000000000\r\n\r\nfor i in range(n):\r\n minB = min(minB, l[i])\r\n minG = min(minB, l[i+n])\r\n\r\nx = min(minB/2, minG)\r\nprint(min(w,nx3))\r\n", "s=list(map(int,input().split(' ')))\r\nn=s[0]\r\nw=s[1]\r\ns=list(map(int,input().split(' ')))\r\ns.sort()\r\nc1=s[0]\r\nc2=s[n]\r\ntmp=round(w/(n3),6)\r\nif(c2/2>c1):\r\n if(tmp>c1):\r\n print(c13n)\r\n else:\r\n print(w)\r\nelse:\r\n if(tmp>c2/2):\r\n print(3nc2/2)\r\n else:\r\n print(w)", "n, w = [int(i) for i in input().split()]\na = sorted([int(i) for i in input().split()])\nif a[0] > (w/3)/n and a[n] > 2(w/3)/n:\n print(w)\nelse:\n print(min(a[n]/2, a[0])3n)\n", "from sys import stdin\r\nfrom sys import exit\r\n\r\nlive = True\r\nif not live: stdin = open('data.in', 'r')\r\n\r\nn, w = list(map(int, stdin.readline().strip().split()))\r\ncups = list(map(int, stdin.readline().strip().split()))\r\n\r\nmaxx = w / (3 * n)\r\ncups = sorted(cups, reverse = True)\r\nfor it in range(n):\r\n\tmaxx = min(maxx, cups[it] / 2)\r\nfor it in range(n, 2 * n):\r\n\tmaxx = min(maxx, cups[it])\r\n\t\r\nprint(3 * n * maxx)\r\n\r\nif not live: stdin.close()", "n, w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nz=min(a[0],a[n]/2,w/(3n))\r\nprint(z3n)\r\n\r\n", "n, w = [int(i) for i in input().split()]\r\ncapacity = [int(i) for i in input().split()]\r\n\r\ncapacity.sort(reverse=True)\r\nresult = min(capacity[(2n) - 1] * 3 * n, capacity[n-1] * 3 / 2 * n, w)\r\n\r\nprint(result)", "def div_tea():\n n_k = input().split()\n n = int(n_k[0])\n k = int(n_k[1])\n\n arr_str = input().split()\n arr = [int(i) for i in arr_str]\n\n arr = sorted(arr)\n\n water = arr[0] if arr[0] * 2 < arr[n] else arr[n]/2\n return water * 3 * n if water * 3 * n < k else k\n\n\nres = div_tea()\nprint(res)", "n, w = map(int, input().split())\ncups = [ int(cup) for cup in input().split() ]\n\ncups.sort()\n\ngirl_cup = cups[0]\nboy_cup = -1\n\nfor i in range(1, n+1):\n boy_cup = cups[i]\n if boy_cup >= girl_cup2:\n break\n\n#print(\"boy cup\", boy_cup, \"/\", \"girl cup\", girl_cup)\n\nif boy_cup < girl_cup2:\n result = (boy_cup + boy_cup/2)n\nelif boy_cup > girl_cup2:\n result = ( girl_cup2 + girl_cup)n\nelse:\n result = (boy_cup + girl_cup)n\n\nif result <= int(result):\n result = int(result)\n\nif result > w:\n result = w\n\nprint(result)", "n,w = map(int,input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif 2a[0] <= a[n]:\r\n p = a[0]\r\nelse:\r\n p = a[n]/2\r\n\r\nif 3np <= w:\r\n result = 3np\r\nelse:\r\n result = w\r\n# print (p)\r\n# print (a)\r\nprint (result)", "nm = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\narr.sort()\nprint(min(nm[1]/1, 3nm[0](min(arr[0]/1, arr[nm[0]]/2))))\n \t\t\t \t \t\t\t\t\t\t\t\t \t\t\t \t\t\t\t\t\t", "n,w=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\na1=a[0]\r\nif a[0]2>a[n]:a1=a[n]/2\r\n\r\nif 2a1n+a1n<w:\r\n print(2a1n+a1n)\r\nelse:\r\n print(w)\r\n", "# nhap du lieu vao\n# sap xep mang a theo thu tu tang dan, tim x la so mili... cua moi tach cua girl\n# x = min cua vi tri a[0] va vi tri a[n]/2\n# tao bien ans = 3xn\n# roi so sanh vs w, lay gia tri nho hon\nn, w = map(int, input().split())\na = list(map(int,input().split()))\na.sort()\nx = min(a[0],a[n]/2)\nans = 3xn\nans = min(ans,w)\nprint(ans)\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nx = min(a[0], a[n] / 2)\r\nres = min(3 x * n, w)\r\n\r\nprint(res)\r\n", "I=lambda:map(int,input().split())\r\nn,w=I()\r\na=sorted(I())\r\nt=min(a[0]2,a[n])\r\nprint(min(tn3/2,w))", "def max_water(friends, w, cups):\r\n #find x : x + 2x =\r\n heso1 = w/(3friends)\r\n cups.sort()\r\n heso2_girl = cups[0] # min of cups girl\r\n heso3_boy = cups[friends]/2#min of cups boy\r\n # print(heso1,heso2_girl,heso3_boy)\r\n min_water = min(heso1,heso2_girl,heso3_boy )\r\n return min_water3friends\r\n\r\n\r\n\r\n#input\r\nfriends, w = list(map(int, input().split()))\r\ncups = list(map(int, input().split()))\r\nprint(max_water(friends, w, cups))\r\n", "n, w = map(int, input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nt = min(a[0],a[n]/2)\r\nans = min(3tn,w)\r\nprint(ans)\r\n", "def sinput():\n s = input().split()\n return int(s[0]), int(s[1])\n\nn, w = sinput()\n\ns = input().split()\n\ns = [int(i) for i in s]\n\ns.sort()\n\n\n\nprint(min(s[0] 3n, s[n] 3/2n, w))\n \n", "n,w=map(int,input().split())\r\nls=[int(a) for a in input().split()]\r\nls.sort()\r\nmn=min(ls[0],ls[n]/2)\r\nprint(min(mnn3,w))\r\n\r\n\r\n\r\n\r\n" ]	{"inputs": ["2 4\n1 1 1 1", "3 18\n4 4 4 2 2 2", "1 5\n2 3", "1 1\n1000000000 1000000000", "4 1000000000\n1 1 1 1 1 1 1 1", "4 1000000000\n1 1 1 1 2 2 2 2", "4 1\n3 3 3 3 4 4 4 4", "2 19\n3 3 5 5", "3 31\n3 3 3 5 5 5", "5 15\n2 3 4 1 2 4 5 3 5 10", "5 14\n2 3 4 1 2 4 5 3 5 10", "5 16\n2 3 4 1 2 4 5 3 5 10", "1 100\n1 200", "1 1\n1 1", "2 1000000000\n1 1 1 100", "4 30\n3 3 3 3 4 5 6 7", "2 100\n1 1 1 10", "3 18\n1 1 1 1 1 5"], "outputs": ["3.0000000000", "18.0000000000", "4.5000000000", "1.0000000000", "6.0000000000", "12.0000000000", "1.0000000000", "15.0000000000", "22.5000000000", "15.0000000000", "14.0000000000", "15.0000000000", "3.0000000000", "1.0000000000", "3.0000000000", "24.0000000000", "3.0000000000", "4.5000000000"]}	UNKNOWN	PYTHON3	CODEFORCES	183
d607231391bb9d0f6146c5ed8354c0e9	Logical Expression	You are given a boolean function of three variables which is defined by its truth table. You need to find an expression of minimum length that equals to this function. The expression may consist of: - Operation AND ('&', ASCII code 38) - Operation OR ('\|', ASCII code 124) - Operation NOT ('!', ASCII code 33) - Variables x, y and z (ASCII codes 120-122) - Parentheses ('(', ASCII code 40, and ')', ASCII code 41) If more than one expression of minimum length exists, you should find the lexicographically smallest one. Operations have standard priority. NOT has the highest priority, then AND goes, and OR has the lowest priority. The expression should satisfy the following grammar: E ::= E '\|' T \| T T ::= T '&' F \| F F ::= '!' F \| '(' E ')' \| 'x' \| 'y' \| 'z' The first line contains one integer n — the number of functions in the input (1<=≤<=n<=≤<=10<=000). The following n lines contain descriptions of functions, the i-th of them contains a string of length 8 that consists of digits 0 and 1 — the truth table of the i-th function. The digit on position j (0<=≤<=j<=<<=8) equals to the value of the function in case of , and . You should output n lines, the i-th line should contain the expression of minimum length which equals to the i-th function. If there is more than one such expression, output the lexicographically smallest of them. Expressions should satisfy the given grammar and shouldn't contain white spaces. Sample Input 4 00110011 00000111 11110000 00011111 Sample Output y (y\|z)&x !x x\|y&z	[ "import zlib, base64\nexec(zlib.decompress(base64.b64decode(b'eJyFV8lu2zAQPTdfIenAUGhR9FygXxLk4MJu4SJwAscJSIEfX4nLzHtDpT0kGM6+j3w83IYfw8M0BhemL8M0+pBiWuYMBzdGtwjYgMUpWGRWtnFJq6Srkh7g4JqSjW9Jm3wKjdYohIzALkivfuX/m02nYBUJ2ZNVLjZPAM5hrFTR5BFGasLg/RbOvPniIsSU0AXAtMgMnanRShPVFx+QA+jRad5CyWhoMUbIqCBL0RII5jSZd+Fg+sLB7dpNWOItRcaFNKqVyFpKgdkR9ELB2PpzhIJGt1amli/aSDlOQ1W5ymHiJFsYYHCkD0VZsMSmDSMl1XpmYM2R9HtTwgOYgCe3KLwXmJUdMRaiID+w28WKfGVICbfyzMaHNKq36IWCC+Qp7gTLoVYRL+28GH6Pjb7JmDjJ1l6AsDu2CGFzJR5RM58wnDCZ/8it9nlXgzYrihNlNr2dFmUoamj1pv961Y93meJ9B62u0gF2rkXzB3qlJziEzfWuYFHWPJQLSrNZExXlgesBaI1S7dDm4v6AYYZkwNRD40AGaBck3vYLibQi4e7Mpzdhf7YtAgh+loaltc0HVw5zYkuEsS7ggJBtuAiJjOrDswaBanOqF9E6C7ebnO0wdKn5+BjM3k1HOl5245pj1yknlqH5iOnZ4TG5pSsPGSN7oesOHf3AbWGaglqiO/MpdM2Q3zUjZBNwYFBD7Q46XvMWlWxICAFca8Mq7x2nQwpdqS0Pa6nXHaxAQUZTtby1qnH+YLH6sFyySaV6qRYumsLpNS4dRyPdzjkSFitEDDDFtXB6irVwggtgVE55RYBFZW4rWm62iMd91wK4JjOL11vfO9LMUS85aODCdWuK7Mu3g7BkuNqOLKSfJwXMY8k/hxLiokkkR2bGIdiZtTWOCWVgH+1NYMPDXMl+q8siUffUp05hY4Q6alBt8DSSVi3jvlzTAppNKU8dpwppDSokDq2uhenx7tfzdTgP58twPVx+n/z5clv/Xt5ufp7n73efXq4b5ni4PZzeD09++vZzGj4P9/df/zyfL/7p/Hrz19P76fp6OqrcPD/Od38BvToehw==')))\n \t\t\t \t \t \t \t \t\t \t \t\t\t \t" ]	{"inputs": ["4\n00110011\n00000111\n11110000\n00011111", "1\n11001110", "2\n11001110\n01001001", "3\n10001001\n10111011\n10111101", "4\n11000010\n11000010\n11001110\n10001001", "5\n01111000\n00110110\n00011100\n01110111\n01010011"], "outputs": ["y\n(y\|z)&x\n!x\nx\|y&z", "!y\|!z&x", "!y\|!z&x\n!(!x&!z\|x&z\|y)\|x&y&z", "!y&!z\|x&y&z\n!z\|y\n!x&!z\|!y&x\|y&z", "!x&!y\|!z&x&y\n!x&!y\|!z&x&y\n!y\|!z&x\n!y&!z\|x&y&z", "!x&(y\|z)\|!y&!z&x\n!(x&z)&y\|!y&x&z\n!x&y&z\|!y&x\ny\|z\n!x&z\|x&y"]}	UNKNOWN	PYTHON3	CODEFORCES	1
d6120d945ca2dd06ce7ce99e1cd247bb	Door Frames	Petya has equal wooden bars of length n. He wants to make a frame for two equal doors. Each frame has two vertical (left and right) sides of length a and one top side of length b. A solid (i.e. continuous without breaks) piece of bar is needed for each side. Determine a minimal number of wooden bars which are needed to make the frames for two doors. Petya can cut the wooden bars into any parts, but each side of each door should be a solid piece of a wooden bar (or a whole wooden bar). The first line contains a single integer n (1<=≤<=n<=≤<=1<=000) — the length of each wooden bar. The second line contains a single integer a (1<=≤<=a<=≤<=n) — the length of the vertical (left and right) sides of a door frame. The third line contains a single integer b (1<=≤<=b<=≤<=n) — the length of the upper side of a door frame. Print the minimal number of wooden bars with length n which are needed to make the frames for two doors. Sample Input 8 1 2 5 3 4 6 4 2 20 5 6 Sample Output 1 6 4 2	[ "import math\n\n[n,a,b],r,i,j=[int(input())for x in range(3)],6,4,5\n\nwhile i>=0:\n\n\tl,c,o=[b if x in[i,j]else a for x in range(6)],0,n\n\n\tfor k in l:\n\n\t\tif o<k:\n\n\t\t\to,c=n-k,c+1\n\n\t\telse:o-=k\n\n\tr=min(r,c if o==n else c+1)\n\n\tj-=1\n\n\tif i==j:i,j=i-1,5\n\nprint(r)\n\n\n\n# Made By Mostafa_Khaled", "bar = int(input())\r\nside = int(input())\r\ntop = int(input())\r\n\r\n\r\ncurrent_bar = bar\r\nnum_bars = 1\r\ndim = [side] * 4 + [top] * 2\r\ndim.sort()\r\nwhile dim != []:\r\n #print (current_bar)\r\n if current_bar < min(dim):\r\n current_bar = bar\r\n num_bars += 1\r\n \r\n if current_bar >= dim[-1]:\r\n current_bar -= dim.pop()\r\n \r\n if dim != [] and current_bar >= dim[0]:\r\n current_bar -= dim.pop(0)\r\n\r\nprint (num_bars)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nsequences = list()\r\nbar_len = (a, b)\r\n\r\nfor i in range(2 6):\r\n seq = list()\r\n\r\n for j in range(6):\r\n seq.append((i & 2 j) >> j)\r\n\r\n if sum(seq) == 2:\r\n sequences.append(seq)\r\n\r\n\r\nmin_count = 10000\r\nfor seq in sequences:\r\n bar = n\r\n count = 1\r\n idx = 0\r\n\r\n for i in seq:\r\n if bar > bar_len[i]:\r\n bar -= bar_len[i]\r\n elif bar == bar_len[i]:\r\n if idx < len(seq) - 1:\r\n count += 1\r\n bar = n\r\n else:\r\n count += 1\r\n bar = n - bar_len[i]\r\n idx += 1\r\n if count < min_count:\r\n min_count = count\r\n\r\nprint(min_count)\r\n", "m=int(input())\na=int(input())\nb=int(input())\nc=1\nn=m\nca=0\ncb=0\nif(a2+b == m):\n\tprint(2)\n\texit()\nwhile (ca+cb<=6):\n\tif(a<=n and n<b and ca<4):\n\t\tca=ca+1\n\t\tn=n-a\n\tif(b<=n and n<a and cb<2):\n\t\tcb=cb+1\n\t\tn=n-b\n\tif(a<=n and b<=n and ca<4):\n\t\tca=ca+1\n\t\tn=n-a\n\tif(a<=n and b<=n and cb<2):\n\t\tcb=cb+1\n\t\tn=n-b\n\tif(ca==4 and cb==2):\n\t\tbreak\n\tif(n<a and n<b):\n\t\tn=m\n\t\tc=c+1\n\tif(n<a and b<=n and cb==2):\n\t\tn=m\n\t\tc=c+1\n\tif(n<b and a<=n and ca==4):\n\t\tn=m\n\t\tc=c+1\nprint(c)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nna = 4\r\nnb = 2\r\ncnt=0\r\nwhile True:\r\n len = n\r\n cnt+=1\r\n while len>0:\r\n resa = len-min(int(len/a),na)a\r\n resb = len-min(int(len/b),nb)b\r\n if resa<resb and na>0 and len>=a:\r\n len-=a\r\n na-=1\r\n elif nb>0 and len>=b:\r\n len-=b\r\n nb-=1\r\n else:\r\n break\r\n if na==nb==0:\r\n break\r\nprint(cnt)\r\n", "x=int(input())\r\na=int(input())\r\nb=int(input())\r\nans=6\r\nif a+b>x and 2b<=x and 2a>x:\r\n ans=5\r\nif (a+b<=x and 2a>=x) or (2b>x and 2a<=x):\r\n ans=4\r\nif (2a<=x and 2b<=x) or (4a<=x and 2b>x) or (2a<=x and a+b<=x):\r\n ans=3\r\nif 2a+b<=x:\r\n ans=2\r\nif 4a +2b<=x:\r\n ans=1\r\nprint(ans)", "dog, cot, b = [int(input()) for _ in range(3)]\nd = [0]\nhy = 0\n \nfor i in (cot, b, cot, cot, b, cot):\n if max(d) >= i:\n d[d.index(max(d))] -= i\n else:\n hy += 1\n d += [dog- i]\n \nprint(hy)\n\n \t\t \t \t\t\t\t \t \t\t\t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a1, a2, a3, a4, a5):\r\n global c\r\n for i in range(1, a3):\r\n x = a1 * i\r\n if x > n:\r\n break\r\n y = (n - x) // a2\r\n t = a4 // i + (a4 % i != 0)\r\n z = t * y\r\n t1 = 0\r\n while z < a5:\r\n z += n // a2\r\n t1 += 1\r\n c = min(c, t + t1)\r\n\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = 1 << 30\r\nf(a, b, 5, 4, 2)\r\nf(b, a, 3, 2, 4)\r\nprint(c)", "'''input\n5\n3\n4\n'''\nfrom sys import stdin, stdout\nimport math\n\ndef brute(n, bar, a, b, a_count, b_count):\n\tfirst = float('inf'); second = float('inf'); third = float('inf'); fourth = float('inf')\n\tif a_count == 4 and b_count == 2:\n\t\treturn 1\n\tif bar >= a and a_count < 4:\n\t\tfirst = brute(n, bar - a, a, b, a_count + 1, b_count)\n\tif bar >= b and b_count < 4:\n\t\tsecond = brute(n, bar - b, a, b, a_count, b_count + 1)\n\tif bar < a and a_count < 4:\n\t\tthird = 1 + brute(n, n, a, b, a_count, b_count)\n\tif bar < b and b_count < 2:\n\t\tfourth = 1 + brute(n, n, a, b, a_count, b_count)\n\treturn min(first, second, third, fourth)\n# main starts\nn = int(stdin.readline().strip())\na = int(stdin.readline().strip())\nb = int(stdin.readline().strip())\na_count = 0; b_count = 0\nprint(brute(n, n, a, b, a_count, b_count))", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Thu Nov 30 12:11:39 2017\r\n\r\n@author: vishal\r\n\"\"\"\r\n\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\nif(4a+2b<=n):\r\n print(1)\r\nelif(2a+b<=n or a+2b<=n and 3a<=n):\r\n print(2)\r\nelif(a+b<=n and 2a<=n or 2b<=n and 2a<=n or 4a<=n):\r\n print(3)\r\nelif(2a<=n or a+b<=n):\r\n print(4)\r\nelif(2b<=n):\r\n print(5)\r\nelse:\r\n print(6)", "n, a, b = [int(input()) for _ in range(3)]\r\nd = [0]\r\nc = 0\r\n\r\nfor i in (a, b, a, a, b, a):\r\n if max(d) >= i:\r\n d[d.index(max(d))] -= i\r\n else:\r\n c += 1\r\n d += [n - i]\r\n\r\nprint(c)\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nli = [[a,4],[b,2]]\r\nans = 0\r\n\r\nwhile True:\r\n now = 0\r\n count = [-1,-1]\r\n \r\n for i in range(li[0][1]+1):\r\n for j in range(li[1][1]+1):\r\n s = ai+bj\r\n if s <= n and now < s:\r\n now = s\r\n count = [i,j]\r\n li[0][1] -= count[0]\r\n li[1][1] -= count[1]\r\n if li[0][1] == 0 and li[1][1] == 0:\r\n print(ans+1)\r\n break\r\n else:\r\n ans += 1", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nans = 6\r\n\r\ncur, cnt = 0, 0\r\ncur = 2\r\ncnt += 2 ((n - b) // a)\r\nwhile cnt < 4:\r\n cur += 1\r\n cnt += (n // a)\r\nans = min(ans, cur)\r\n\r\nif b * 2 <= n:\r\n cur, cnt = 0, 0\r\n cur = 1\r\n cnt += ((n - 2 * b) // a)\r\n while cnt < 4:\r\n cur += 1\r\n cnt += (n // a)\r\n ans = min(ans, cur)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nans = 1\r\nrem = n\r\nsides = 6\r\n\r\nif (((a+a) + b) * 2) <= n:\r\n print(1)\r\nelse:\r\n if (a2+b) <= n or ((a4) <= n and (b2) <= n):\r\n print(2)\r\n elif (a4 <= n and b <= n) or (b2 <= n and a2 <= n) or (a+b <= n and a2 <= n):\r\n print(3)\r\n elif (a2 <= n and b <= n) or (a+b <= n and a <= n):\r\n print(4)\r\n elif b2 <= n and a <= n:\r\n print(5)\r\n else:\r\n print(6)\r\n \r\n \r\n \r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\ncnt=0\r\nl=0\r\nal=4\r\nbl=2\r\n\r\ncnt+=1\r\nl=n\r\n\r\nwhile al or bl:\r\n if al>bl:\r\n if l-a>=0 and al:\r\n al-=1\r\n l-=a\r\n continue\r\n elif l-b>=0 and bl:\r\n bl-=1\r\n l-=b\r\n continue\r\n else:\r\n l=n\r\n cnt+=1\r\n continue\r\n else:\r\n if l-b>=0 and bl:\r\n bl-=1\r\n l-=b\r\n continue\r\n elif l-a>=0 and al:\r\n al-=1\r\n l-=a\r\n continue\r\n else:\r\n l=n\r\n cnt+=1\r\n continue\r\n\r\nprint(cnt)\r\n", "N,a,b=int(input()),int(input()),int(input())\r\nqueue=[(N,1,4,2)]\r\nres=10000\r\nwhile queue:\r\n n,amount,x,y=queue.pop()\r\n if x==0 and y==0:res=min(res,amount);continue\r\n if x>0:\r\n if n>=a:queue.append((n-a,amount,x-1,y))\r\n else:queue.append((N-a,amount+1,x-1,y))\r\n if y>0:\r\n if n>=b:queue.append((n-b,amount,x,y-1))\r\n else:queue.append((N-b,amount+1,x,y-1))\r\nprint(res)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nif a!=b:\r\n m=[[a],[b]]\r\n while len(m[0])<6:\r\n p=m.pop(0)\r\n m.append(p+[a])\r\n m.append(p+[b])\r\n i=0\r\n while i < len(m):\r\n if m[i].count(b)!=2:\r\n m.pop(i)\r\n else:\r\n i+=1\r\nelse:\r\n m=[[a]6]\r\nd=6\r\nfor p in m:\r\n k=1\r\n x=n\r\n for t in p:\r\n x-=t\r\n if x<0:\r\n k+=1\r\n x=n-t\r\n d=min(d,k)\r\nprint(d)", "kio, cat, b = [int(input()) for _ in range(3)]\nd = [0]\nhy = 0\n \nfor i in (cat, b, cat, cat, b, cat):\n if max(d) >= i:\n d[d.index(max(d))] -= i\n else:\n hy += 1\n d += [kio - i]\n \nprint(hy)\n\n \t\t \t\t \t\t\t \t\t \t\t\t \t\t \t\t \t\t", "n = (int)(input())\r\na = (int)(input())\r\nb = (int)(input())\r\ncntA = 4; cntB = 2; ans = 0; ost = 0\r\nwhile (cntA > 0) or (cntB > 0):\r\n\tans = ans + 1\r\n\tost = n\r\n\tmyA = 0; myB = 0; minOst = n\r\n\tfor i in range(0, cntA + 1):\r\n\t\tfor j in range(0, cntB + 1):\r\n\t\t\tif (a * i + b * j <= ost) and (ost - a * i - b * j < minOst):\r\n\t\t\t\tmyA = i\r\n\t\t\t\tmyB = j\r\n\t\t\t\tminOst = ost - a * i - b * j\r\n\tcntA = cntA - myA\r\n\tcntB = cntB - myB\r\nprint(ans)", "from itertools import permutations\nn = int(input())\na = int(input())\nb = int(input())\n\nres = 10 ** 10\nfor sides in permutations([a] * 4 + [b] * 2):\n curRes = 0\n rest = 0\n for side in sides:\n if side > rest:\n rest = n\n curRes += 1\n rest -= side\n res = min(res, curRes)\n\nprint(res)\n", "'''input\r\n6\r\n4\r\n2\r\n'''\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\ndef f(n,a,b,left,cnta = 4,cntb = 2):\r\n\tif(cnta == 0 and cntb == 0): return 0\r\n\tif(cnta < 0 or cntb < 0): return 100000000000000000000\r\n\tif a <= left and cnta and b <= left and cntb:\r\n\t\treturn min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))\r\n\tif a <= left and cnta:\r\n\t\treturn f(n,a,b,left-a,cnta-1,cntb)\r\n\tif b <= left and cntb:\r\n\t\treturn f(n,a,b,left-b,cnta,cntb-1)\r\n\treturn 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))\t\t\t\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nprint(f(n,a,b,0))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\ntemp = n\r\nres1, res2 = 1, 1\r\n\r\nfor i in range(2):\r\n if temp < a:\r\n res1 += 1\r\n temp = n\r\n temp -= a\r\n if temp < b:\r\n res1 += 1\r\n temp = n\r\n temp -= b\r\nfor i in range(2):\r\n if temp < a:\r\n res1 += 1\r\n temp = n\r\n temp -= a\r\n \r\ntemp = n\r\nfor i in range(4):\r\n if temp < a:\r\n res2 += 1\r\n temp = n\r\n temp -= a\r\nfor i in range(2):\r\n if temp < b:\r\n res2 += 1\r\n temp = n\r\n temp -= b\r\nans = min(res1, res2)\r\nprint(ans)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\ncount = 0\r\nx = 4\r\ny = 2\r\nwhile(x!=0 or y!=0):\r\n mn = n\r\n cl = ()\r\n count+=1\r\n for i in range(x+1):\r\n for j in range(y+1):\r\n s = n - (ia+jb)\r\n if s>=0 and s<=mn:\r\n mn = s\r\n cl = (i, j)\r\n x-=cl[0]\r\n y-=cl[1]\r\n\r\n\r\nprint(count)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nif(4a+2b<=n):\r\n s=1\r\nelif(2a+b<=n):\r\n s=2\r\nelif(4a<=n or (2a<=n and 2b<=n) or (2a<=n and a+b<=n)):\r\n s=3\r\nelif(a+b<=n or 2a<=n):\r\n s=4\r\nelif(2*b<=n):\r\n s=5\r\nelse:\r\n s=6\r\nprint(s)", "n = int(input())\na = int(input())\nb = int(input())\n\nc = 1\nrem = n \na1,b1 = 0,0\nwhile True:\n\tif rem>=a and a1<4:\n\t\trem-=a\n\t\ta1+=1\n\tif rem>=b and b1<2:\n\t\trem-=b\n\t\tb1+=1\n\tif a1==4 and b1==2:\n\t\tprint(c)\n\t\tbreak\n\tif (rem<a or a1==4) and (rem<b or b1==2):\n\t\trem = n \n\t\tc+=1\n\t\n" ]	{"inputs": ["8\n1\n2", "5\n3\n4", "6\n4\n2", "20\n5\n6", "1\n1\n1", "3\n1\n2", "3\n2\n1", "1000\n1\n1", "1000\n1000\n1000", "1000\n1\n999", "1000\n1\n498", "1000\n1\n998", "31\n5\n6", "400\n100\n2", "399\n100\n2", "800\n401\n400", "141\n26\n11", "717\n40\n489", "293\n47\n30", "165\n59\n40", "404\n5\n183", "828\n468\n726", "956\n153\n941", "676\n175\n514", "296\n1\n10", "872\n3\n182", "448\n15\n126", "24\n2\n5", "289\n56\n26", "713\n150\n591", "841\n62\n704", "266\n38\n164", "156\n34\n7", "28\n14\n9", "604\n356\n239", "180\n18\n76", "879\n545\n607", "599\n160\n520", "727\n147\n693", "151\n27\n135", "504\n71\n73", "80\n57\n31", "951\n225\n352", "823\n168\n141", "956\n582\n931", "380\n108\n356", "804\n166\n472", "228\n12\n159", "380\n126\n82", "252\n52\n178", "828\n363\n56", "404\n122\n36", "314\n4\n237", "34\n5\n17", "162\n105\n160", "586\n22\n272", "32\n9\n2", "904\n409\n228", "480\n283\n191", "56\n37\n10", "429\n223\n170", "149\n124\n129", "277\n173\n241", "701\n211\n501", "172\n144\n42", "748\n549\n256", "324\n284\n26", "900\n527\n298", "648\n624\n384", "72\n48\n54", "200\n194\n87", "624\n510\n555", "17\n16\n2", "593\n442\n112", "169\n158\n11", "41\n38\n17", "762\n609\n442", "186\n98\n104", "314\n304\n294", "35\n35\n33", "8\n3\n5", "11\n3\n5", "5\n4\n2", "41\n5\n36", "7\n4\n1", "6\n1\n4", "597\n142\n484", "6\n6\n1", "8\n4\n2", "4\n1\n4", "7\n2\n3", "100\n100\n50", "5\n1\n3", "10\n4\n6", "8\n8\n2", "5\n2\n4", "11\n5\n3", "668\n248\n336", "2\n2\n1", "465\n126\n246", "5\n1\n5", "132\n34\n64", "11\n1\n6", "8\n4\n5", "4\n2\n4", "576\n238\n350", "6\n1\n5", "5\n1\n4", "9\n2\n8", "7\n3\n4", "9\n4\n5", "10\n3\n4", "18\n5\n8", "2\n1\n1", "100\n40\n60", "6\n4\n4", "3\n1\n1", "10\n3\n7", "9\n2\n5", "6\n2\n3"], "outputs": ["1", "6", "4", "2", "6", "3", "4", "1", "6", "3", "1", "2", "2", "2", "2", "5", "1", "2", "1", "2", "1", "6", "3", "4", "1", "1", "1", "1", "1", "3", "2", "2", "1", "3", "4", "2", "6", "4", "3", "3", "1", "5", "2", "2", "6", "4", "2", "2", "2", "3", "2", "2", "2", "2", "6", "2", "2", "3", "4", "4", "4", "6", "6", "4", "5", "5", "4", "4", "6", "6", "5", "6", "5", "4", "4", "5", "6", "6", "6", "6", "3", "2", "5", "3", "4", "2", "3", "5", "3", "3", "2", "5", "2", "3", "5", "4", "3", "3", "5", "3", "3", "2", "2", "4", "4", "4", "3", "3", "3", "3", "3", "2", "2", "3", "3", "6", "2", "3", "2", "3"]}	UNKNOWN	PYTHON3	CODEFORCES	25
d62618023e53f0985f2111be3942064e	Bayan Bus	The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows. The event coordinator has a list of k participants who should be picked up at the airport. When a participant gets on the bus, he will sit in the last row with an empty seat. If there is more than one empty seat in that row, he will take the leftmost one. In order to keep track of the people who are on the bus, the event coordinator needs a figure showing which seats are going to be taken by k participants. Your task is to draw the figure representing occupied seats. The only line of input contains integer k, (0<=≤<=k<=≤<=34), denoting the number of participants. Print the figure of a bus with k passengers as described in sample tests. Character '#' denotes an empty seat, while 'O' denotes a taken seat. 'D' is the bus driver and other characters in the output are for the purpose of beautifying the figure. Strictly follow the sample test cases output format. Print exactly six lines. Do not output extra space or other characters. Sample Input 9 20 Sample Output +------------------------+ \|O.O.O.#.#.#.#.#.#.#.#.\|D\|) \|O.O.O.#.#.#.#.#.#.#.#.\|.\| \|O.......................\| \|O.O.#.#.#.#.#.#.#.#.#.\|.\|) +------------------------+ +------------------------+ \|O.O.O.O.O.O.O.#.#.#.#.\|D\|) \|O.O.O.O.O.O.#.#.#.#.#.\|.\| \|O.......................\| \|O.O.O.O.O.O.#.#.#.#.#.\|.\|) +------------------------+	[ "n = int(input())\nA = []\nA.append(list('+------------------------+'))\nA.append(list('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)'))\nA.append(list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|'))\nA.append(list('\|#.......................\|'))\nA.append(list('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)'))\nA.append(list('+------------------------+'))\nfor k in range(n):\n\tj = i = 1\n\twhile A[i][j] != '#':\n\t\ti = 1\n\t\twhile i < 5 and A[i][j] != '#':\n\t\t\ti += 1\n\t\tif A[i][j] != '#':\n\t\t\tj += 2\n\tA[i][j] = 'O'\nfor line in A:\n\tprint(''.join(line))\n", "riders = int(input())\r\nfill = (0, 0, 0, 0)\r\nif riders == 1:\r\n fill = (1, 0, 0, 0)\r\nif riders == 2:\r\n fill = (1, 1, 0, 0)\r\nif riders == 3:\r\n fill = (1, 1, 1, 0)\r\nif riders == 4:\r\n fill = (1, 1, 1, 1)\r\nif riders >= 5:\r\n new = riders - 1\r\n even = int(new / 3)\r\n if new % 3 == 0:\r\n fill = (even, even, 1, even)\r\n elif new % 3 == 1:\r\n fill = (even + 1, even, 1, even)\r\n else:\r\n fill = (even + 1, even + 1, 1, even)\r\nprint(\"+------------------------+\")\r\nprint('\|' + 'O.' * fill[0] + '#.' * (11 - fill[0]) + '\|D\|)')\r\nprint('\|' + 'O.' * fill[1] + '#.' * (11 - fill[1]) + '\|.\|')\r\nprint('\|' + '#' * (1 - fill[2]) + 'O' * fill[2] + '.......................\|')\r\nprint('\|' + 'O.' * fill[3] + '#.' * (11 - fill[3]) + '\|.\|)')\r\nprint(\"+------------------------+\")\r\n", "n = int(input())\n\na = [ [\"#\" for i in range(11)] for j in range(4)]\n\ni = 0\nj = 0\nwhile n > 0:\n a[j][i] = \"O\"\n if j == 3:\n i += 1\n j = 0\n else:\n j += 1\n if j == 2 and i > 0:\n j += 1\n n -= 1\nprint(\"+------------------------+\")\n\nprint(\"\|\"+a[0][0]+\".\"+a[0][1]+\".\"+a[0][2]+\".\"+a[0][3]+\".\"+a[0][4]+\".\"+a[0][5]+\".\"+a[0][6]+\".\"+a[0][7]+\".\"+a[0][8]+\".\"+a[0][9]+\".\"+a[0][10]+\".\|D\|)\")\nprint(\"\|\"+a[1][0]+\".\"+a[1][1]+\".\"+a[1][2]+\".\"+a[1][3]+\".\"+a[1][4]+\".\"+a[1][5]+\".\"+a[1][6]+\".\"+a[1][7]+\".\"+a[1][8]+\".\"+a[1][9]+\".\"+a[1][10]+\".\|.\|\")\nprint(\"\|\"+a[2][0]+\".......................\|\")\nprint(\"\|\"+a[3][0]+\".\"+a[3][1]+\".\"+a[3][2]+\".\"+a[3][3]+\".\"+a[3][4]+\".\"+a[3][5]+\".\"+a[3][6]+\".\"+a[3][7]+\".\"+a[3][8]+\".\"+a[3][9]+\".\"+a[3][10]+\".\|.\|)\")\n\nprint(\"+------------------------+\")\n", "def imprime(onibus):\n print('+', end='')\n for i in range(24):\n print('-', end='')\n print('+')\n\n print('\|', end='')\n for i in range(11):\n print(onibus[0][i], end = '.')\n\n print('\|D\|)')\n\n print('\|', end='')\n for i in range(11):\n print(onibus[1][i], end = '.')\n\n print('\|.\|')\n\n print('\|', end='')\n for i in range(11):\n print(onibus[2][i], end = '.')\n\n print('..\|')\n\n print('\|', end='')\n for i in range(11):\n print(onibus[3][i], end = '.')\n\n print('\|.\|)')\n\n print('+', end='')\n for i in range(24):\n print('-', end='')\n print('+')\n \ndef montaEsboco():\n fileira1 = []\n fileira2 = []\n fileira3 = []\n fileira4 = []\n for i in range(11):\n fileira1.append('#')\n fileira2.append('#')\n fileira4.append('#')\n if i == 0:\n fileira3.append('#')\n else:\n fileira3.append('.')\n\n onibus = [fileira1,fileira2,fileira3,fileira4]\n\n return onibus\n\ndef inserePassageiro(onibus, posicaoAInserir):\n onibus[posicaoAInserir[0]][posicaoAInserir[1]] = 'O'\n\ndef atualizaPosicaoAInserir(posicao):\n linha = posicao[0]\n coluna = posicao[1]\n if (linha < 3):\n linha +=1\n else:\n linha = 0\n coluna += 1\n \n if (linha == 2 and coluna >= 1):\n linha +=1\n\n return [linha, coluna]\n\ndef main():\n onibus = montaEsboco()\n qtdPassageiros = int(input())\n posicaoAInserir = [0, 0]\n \n for i in range(qtdPassageiros):\n inserePassageiro(onibus, posicaoAInserir)\n posicaoAInserir = atualizaPosicaoAInserir(posicaoAInserir)\n \n imprime(onibus)\n\nmain()", "v='''+------------------------+\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\r\n\|#.......................\|\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\r\n+------------------------+'''.split()\r\n\r\ndef sr(n):\r\n\t\"\"\"string replace\"\"\"\r\n\tw=4\r\n\ta,b=n//w,n%w\r\n\tvn=w[a]\r\n\tfor c in range(b):\r\n\t\tvn[c]+=1\r\n\tfor c in range(1,w+1):\r\n\t\tv[c]=v[c].replace('#','O',vn[c-1])\r\n\t\r\nn=int(input())\r\nif n>5:\r\n\tn+=n//3-1\r\nsr(n)\r\nfor c in v:\r\n\tprint(c)", "k = int(input())\na = k'O' + '#'(34-k)\nprint(f'+------------------------+')\nprint(f'\|{a[0]}.{a[4]}.{a[7]}.{a[10]}.{a[13]}.{a[16]}.{a[19]}.{a[22]}.{a[25]}.{a[28]}.{a[31]}.\|D\|)')\nprint(f'\|{a[1]}.{a[5]}.{a[8]}.{a[11]}.{a[14]}.{a[17]}.{a[20]}.{a[23]}.{a[26]}.{a[29]}.{a[32]}.\|.\|')\nprint(f'\|{a[2]}.......................\|')\nprint(f'\|{a[3]}.{a[6]}.{a[9]}.{a[12]}.{a[15]}.{a[18]}.{a[21]}.{a[24]}.{a[27]}.{a[30]}.{a[33]}.\|.\|)')\nprint(f'+------------------------+')\n", "from sys import stdin\r\ndef busvacio():\r\n bus=[[],[],[],[],[],[]]\r\n bus[0].append(\"+\")\r\n for x in range(24):\r\n bus[0].append(\"-\")\r\n bus[0].append(\"+\")\r\n bus[5].append(\"+\")\r\n for x in range(24):\r\n bus[5].append(\"-\")\r\n bus[5].append(\"+\")\r\n for x in range(1,5):\r\n bus[x].append(\"\|\")\r\n for z in range(1,3):\r\n for x in range(11):\r\n bus[z].append(\"#\")\r\n bus[z].append(\".\")\r\n bus[1].append(\"\|\")\r\n bus[1].append(\"D\")\r\n bus[1].append(\"\|\")\r\n bus[1].append(\")\")\r\n for x in range(11):\r\n bus[4].append(\"#\")\r\n bus[4].append(\".\")\r\n bus[4].append(\"\|\")\r\n bus[4].append(\".\")\r\n bus[4].append(\"\|\")\r\n bus[4].append(\")\")\r\n bus[2].append(\"\|\")\r\n bus[2].append(\".\")\r\n bus[2].append(\"\|\")\r\n bus[3].append(\"#\")\r\n for x in range(23):\r\n bus[3].append(\".\")\r\n bus[3].append(\"\|\")\r\n return bus\r\ndef rellenar(bus,n):\r\n if n>34:\r\n n=34\r\n while n>0:\r\n for z in range(1,22,2):\r\n \r\n for x in range(1,5):\r\n if bus[x][z]==\"#\" and n>0:\r\n bus[x][z]=\"O\"\r\n n-=1\r\n return bus\r\ndef main():\r\n \r\n n=stdin.readline().strip()\r\n while len(n) != 0:\r\n bus=busvacio()\r\n n=int(n)\r\n bus=rellenar(bus,n)\r\n for x in range(6):\r\n print(\"\".join(bus[x]))\r\n n = stdin.readline().strip()\r\nmain()\r\n", "'''\r\nCreated on Oct 6, 2014\r\n\r\n@author: nod\r\n'''\r\n\r\nk = int(input())\r\noutput = [\"+------------------------+\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|#.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\"]\r\nls = [1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,]\r\nt = k\r\nif k > 2:\r\n output[3] = output[3].replace(\"#\", \"O\", 1)\r\n t = k - 1\r\nfor l in ls[:t]:\r\n output[l] = output[l].replace(\"#\", \"O\", 1)\r\nfor line in output:\r\n print(line)\r\n ", "passenger_count = int(input())\n\nreal_count = passenger_count\n\n\nif passenger_count > 2:\n passenger_count = passenger_count - 1\n\nrem_seat = passenger_count % 3\npassenger_col = int(passenger_count / 3)\nprint('+------------------------+')\n\ndef printRow(endString, rem_seat):\n row = '\|'\n for i in range(11):\n if i < passenger_col:\n row = row + 'O.'\n elif i == passenger_col and rem_seat > 0:\n rem_seat = rem_seat - 1\n row = row + 'O.'\n else:\n row = row + '#.'\n row = row + endString\n print(row)\n return rem_seat\n\nrem_seat = printRow('\|D\|)', rem_seat)\nrem_seat = printRow('\|.\|', rem_seat)\n\n\nif real_count > 2:\n print('\|O.......................\|')\nelse:\n print('\|#.......................\|')\nrem_seat = printRow('\|.\|)', rem_seat)\nprint('+------------------------+')\n", "def main():\n\tK = int(input())\n\tbus = [list(\"+------------------------+\")\n\t\t ,list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\")\n\t\t ,list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\")\n\t\t ,list(\"\|#.......................\|\")\n\t\t ,list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\")\n\t\t ,list(\"+------------------------+\")]\n\tfor i in range(K):\n\t\tif i < 4:\n\t\t\tbus[i + 1][1] = 'O'\n\t\telse:\n\t\t\tif (i-4)%3 + 1 == 3:\n\t\t\t\tbus[(i-4)%3 + 2][2((i-4)//3) + 3] = 'O'\n\t\t\telse:\n\t\t\t\tbus[(i-4)%3 + 1][2((i-4)//3) + 3] = 'O'\n\tfor line in bus:\n\t\tprint(\"\".join(line))\n\nmain()\n\n# 1505498089178\n", "'''\r\nCreated on Oct 5, 2014\r\n\r\n@author: Ismael\r\n'''\r\n\r\ndef printBus(lastRow,otherRows):\r\n s = \"+------------------------+\\n\"\r\n for i in range(4):\r\n s += \"\|\"+lastRow[i]+\".\"\r\n for j in range(10):\r\n if(i == 2):\r\n s += \"..\"\r\n elif(i == 3):\r\n s += otherRows[j][i-1]+\".\"\r\n else:\r\n s += otherRows[j][i]+\".\"\r\n if(i == 0):\r\n s += \"\|D\|)\"\r\n elif(i == 1):\r\n s += \"\|.\|\"\r\n elif(i == 2):\r\n s += \"..\|\"\r\n else:\r\n s += \"\|.\|)\"\r\n s += \"\\n\"\r\n s += \"+------------------------+\"\r\n print(s)\r\n\r\n\r\ndef solve(n):\r\n lastRow = []\r\n otherRows = [[]]\r\n while(n>0):\r\n if(len(lastRow)<4):\r\n lastRow.append('O')\r\n else:\r\n if(len(otherRows[-1])<3):\r\n otherRows[-1].append('O')\r\n else:\r\n otherRows.append(['O'])\r\n n -= 1\r\n otherRows += [[] for _ in range(10-len(otherRows))]\r\n lastRow += (4-len(lastRow))['#']\r\n for row in otherRows:\r\n row += (3-len(row))['#']\r\n printBus(lastRow,otherRows)\r\n\r\nn = int(input())\r\nsolve(n)", "#!/usr/bin/python3\n\nbus = [\n \"+------------------------+\",\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\n \"\|#.......................\|\",\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\n \"+------------------------+\",\n]\n\nbus = \"\"\"+\|\|\|\|+\n-{}{}{}{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-\|\|.\|-\n-D...-\n+\|\|\|\|+\n ) ) \"\"\"\n\n\nn = int(input())\nbus = bus.format(([\"O\"] * n + [\"#\"] * (34-n)))\nbus = \"\\n\".join(\"\".join(k).strip() for k in zip(bus.splitlines()))\nprint(bus)\n\n", "def proximoHashtag(v):\n for i in range(1,22,2):\n for j in range(0,4):\n if(j==2 and i>1):\n continue\n if(v[j][i] == '#'):\n v[j] = v[j][:i] + 'O' + v[j][i+1:]\n return\n\n\nn = int(input())\n\nprint(\"+------------------------+\")\na = \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"\nb = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"\nc = \"\|#.......................\|\"\nd = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"\nv = [a,b,c,d]\nfor i in range(0,n):\n proximoHashtag(v)\nfor i in range(0,4):\n print(v[i])\nprint(\"+------------------------+\")\n", "a = [list('+------------------------+'), \r\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)'),\r\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|'),\r\nlist('\|#.......................\|'),\r\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)'), \r\nlist('+------------------------+')]\r\na = list(a)\r\nk = int(input())\r\nif k < 4:\r\n for i in range(k):\r\n a[1 + i][1] = 'O'\r\nelse:\r\n for i in range(4):\r\n a[1 + i][1] = 'O' \r\n k -= 4\r\n for i in range(k):\r\n r = i % 3\r\n if r == 0:\r\n a[1][i // 3 2 + 3] = 'O'\r\n elif r == 1:\r\n a[2][i // 3 * 2 + 3] = 'O' \r\n elif r == 2:\r\n a[4][i // 3 * 2 + 3] = 'O' \r\nfor i in a:\r\n print(''.join(i))", "import sys, itertools, functools, collections, bisect\r\nfrom math import factorial as fact\r\ninput = sys.stdin.readline\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\n\r\nINF = 1020\r\nMOD = 109+7\r\n\r\ndef solve():\r\n if n == 0:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|#.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 1:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|#.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 2:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|#.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 3:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 4:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 5:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 6:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 7:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 8:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 9:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 10:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 11:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 12:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 13:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 14:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 15:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 16:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 17:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 18:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 19:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 20:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 21:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 22:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 23:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 24:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 25:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 26:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 27:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 28:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 29:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 30:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 31:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 32:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 33:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 34:\r\n A = [\r\n \"+------------------------+\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|.\|\",\r\n \"\|O.......................\|\",\r\n \"\|O.O.O.O.O.O.O.O.O.O.O.\|.\|)\",\r\n \"+------------------------+\",\r\n ]\r\n\r\n \r\n for r in range(len(A)):\r\n print(A[r])\r\n \r\ntest_case = 1\r\nfor _ in range(test_case):\r\n n = ri()\r\n solve()", "k = int(input())\r\na = [list() for i in range(6)]\r\na[0] = a[5] = list('+------------------------+')\r\na[1] = list('\|' + '#.' * 11 + '\|D\|)')\r\na[2] = list('\|' + '#.' * 11 + '\|.\|')\r\na[3] = list('\|' + '#' + '.' * 23 + '\|')\r\na[4] = list('\|' + '#.' * 11 + '\|.\|)')\r\nx = y = 1\r\nfor i in range(k):\r\n a[x][y] = 'O'\r\n if x == 4:\r\n x = 1\r\n y += 2\r\n elif x == 2 and y != 1:\r\n x += 2\r\n else:\r\n x += 1\r\nprint('\\n'.join(map(lambda x: ''.join(x), a)))\r\n", "n=int(input())\r\nub=\"+------------------------+\"\r\nlb=\"+------------------------+\"\r\nr1,r2,r3,r4=['\|'],['\|'],['\|'],['\|']\r\nfl=0\r\nif n<3:\r\n r3.append('#')\r\n r3.append('.')\r\nwhile n!=0:\r\n r1.append('O')\r\n r1.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n r2.append('O')\r\n r2.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n if fl!=1:\r\n r3.append('O')\r\n r3.append('.')\r\n n-=1\r\n fl=1\r\n else:\r\n r3.append('.')\r\n r3.append('.')\r\n if n==0:\r\n break\r\n r4.append('O')\r\n r4.append('.')\r\n n-=1\r\nwhile len(r1)!=23:\r\n r1.append('#')\r\n r1.append('.')\r\nr1.append('\|D\|)')\r\nwhile len(r2)!=23:\r\n r2.append('#')\r\n r2.append('.')\r\nr2.append('\|.\|')\r\nwhile len(r3)!=23:\r\n r3.append('.')\r\n r3.append('.')\r\nr3.append('..\|')\r\nwhile len(r4)!=23:\r\n r4.append('#')\r\n r4.append('.')\r\nr4.append('\|.\|)')\r\nprint(ub)\r\nprint(\"\".join(r1))\r\nprint(\"\".join(r2))\r\nprint(\"\".join(r3))\r\nprint(\"\".join(r4))\r\nprint(lb)\r\n", "from sys import setrecursionlimit, exit, stdin\nfrom math import ceil, floor, acos, pi\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom fractions import gcd\nfrom functools import reduce\nimport itertools\nsetrecursionlimit(10*7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\nMAX=1000\n#################################################\nk=RI()[0]\ns=\"\"\"+------------------------+\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+\"\"\"\ns=list(s.split('\\n'))\ns=[list(i) for i in s]\nfor i in range(len(s[0])):\n for j in range(len(s)):\n if s[j][i]=='#' and k>0:\n s[j][i]='O'\n k-=1\nprint('\\n'.join([''.join(i) for i in s]))\n", "n = int(input())\r\npls = [['#','#','#','#'] for i in range(11)]\r\nfor i in range(1, 11):\r\n pls[i][2] = ''\r\nfor i in range(11):\r\n for j in range(4):\r\n if n == 0:\r\n break\r\n if pls[i][j] != '':\r\n pls[i][j] = 'O'\r\n n -= 1\r\nprint(\"+------------------------+\")\r\nprint(\"\|\" + pls[0][0], pls[1][0], pls[2][0], pls[3][0], pls[4][0], pls[5][0], pls[6][0], pls[7][0], pls[8][0], pls[9][0], pls[10][0], \"\|D\|)\", sep='.')\r\nprint(\"\|\" + pls[0][1], pls[1][1], pls[2][1], pls[3][1], pls[4][1], pls[5][1], pls[6][1], pls[7][1], pls[8][1], pls[9][1], pls[10][1], \"\|.\|\", sep='.')\r\nprint(\"\|\" + pls[0][2], pls[1][2], pls[2][2], pls[3][2], pls[4][2], pls[5][2], pls[6][2], pls[7][2], pls[8][2], pls[9][2], pls[10][2], \"............\|\", sep='.')\r\nprint(\"\|\" + pls[0][3], pls[1][3], pls[2][3], pls[3][3], pls[4][3], pls[5][3], pls[6][3], pls[7][3], pls[8][3], pls[9][3], pls[10][3], \"\|.\|)\", sep='.')\r\nprint(\"+------------------------+\")", "k = int(input())\r\n\r\nbusSide = \"+------------------------+\"\r\nrow1 = \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"\r\nrow2 = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"\r\nrow3 = \"\|#.......................\|\"\r\nrow4 = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"\r\n\r\nindex = 0\r\narr = [row1, row2, row3, row4]\r\n\r\nwhile (k > 0):\r\n\tplaced = False\r\n\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i][index] is '#':\r\n\t\t\tarr[i] = arr[i][:index] + 'O' + arr[i][(index+1):]\r\n\t\t\tplaced = True\r\n\t\t\tbreak\r\n\r\n\tif not placed:\r\n\t\tindex += 1\r\n\t\tcontinue\r\n\r\n\tk -= 1\r\n\r\nprint(busSide + \"\\n\" + arr[0] + \"\\n\" + arr[1] + \"\\n\" + arr[2] + \"\\n\" + arr[3] + \"\\n\" + busSide)", "import math\n\nk = 11\np = int(input())\n\nprint('+------------------------+')\n\nprint('\|',end='')\nif p > 4:\n t = 1 + math.ceil((p-4)/3)\n print(t'O.',end='')\n print((k-t)'#.',end='')\nelif p == 0:\n print(k'#.', end='')\nelse:\n print('O.' + (k-1)'#.', end='')\nprint('\|D\|)')\n\nprint('\|',end='')\nif p > 4:\n t = 1 + (p-4)//3\n if (p-4) % 3 == 2: t += 1\n print(t'O.',end='')\n print((k-t)'#.',end='')\nelif p < 2:\n print(k'#.', end='')\nelse:\n print('O.' + (k-1)'#.', end='')\nprint('\|.\|')\n\nprint('\|',end='')\nif p < 3:\n print('#.......................\|')\nelse:\n print('O.......................\|')\n\nprint('\|',end='')\nif p > 4:\n t = 1 + (p-4)//3\n print(t'O.',end='')\n print((k-t)'#.',end='')\nelif p < 4:\n print(k'#.', end='')\nelse:\n print('O.' + (k-1)'#.', end='')\nprint('\|.\|)')\nprint('+------------------------+')\n\n# 1505499034082\n", "n = int(input())\n\nseat = [[\"#\", \"#\", \"#\", \"#\"] for x in range(11)]\n\nfor i in range(11):\n for j in range(4):\n if i!=0 and j==2:\n seat[i][j] = \".\"\n elif n > 0:\n n=n-1\n seat[i][j] = \"O\"\n\nseat = list(map(list, zip(seat)))\n\nprint(\"+------------------------+\")\nfor i in range(4):\n print(\"\|\", end=\"\")\n for j in range(11):\n print(seat[i][j]+\".\",end=\"\")\n if i == 0:\n print(\"\|D\|)\")\n elif i == 1:\n print(\"\|.\|\")\n elif i == 2:\n print(\"..\|\")\n elif i == 3:\n print(\"\|.\|)\")\n\nprint(\"+------------------------+\")\n", "k = int(input())\r\n\r\narr = ['#'] * 33\r\nmid = '#'\r\n\r\nif k < 3:\r\n for i in range(k):\r\n arr[i] = 'O'\r\nelse:\r\n mid = 'O'\r\n for i in range(k - 1):\r\n arr[i] = 'O'\r\n\r\n\r\n# printing\r\n\r\nprint('+' + '-' * 24 + '+')\r\n\r\nprint('\|', end='')\r\nfor i in range(0, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"\|D\|)\")\r\n\r\nprint('\|', end='')\r\nfor i in range(1, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"\|.\|\")\r\n\r\nprint('\|' + mid + '.' * 23 + '\|')\r\n\r\nprint('\|', end='')\r\nfor i in range(2, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"\|.\|)\")\r\n\r\nprint('+' + '-' * 24 + '+')", "k=0\none=\"0\"\ntwo=\"0\"\ntree=\"0\"\nline=\"+------------------------+\"\none=\"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"\ntwo=\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"\ntree=\"\|#.......................\|\"\nfour= \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"\n#one=one.replace(\"#\",\"0\",1)\nscann=input()\nk=int(scann)\nif(k>4):\n one=one.replace(\"#\",\"O\",1)\n two=two.replace(\"#\",\"O\",1)\n tree=tree.replace(\"#\",\"O\",1)\n four=four.replace(\"#\",\"O\",1)\n k= k-4\n l=k\n for i in range(l):\n if (k>0):\n #print(i+2, \"hola\")\n one=one.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if (k>0):\n two=two.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if (k>0):\n four=four.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if(k==0):\n break;\nelse:\n if (k>0):\n one=one.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n two=two.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n tree=tree.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n four=four.replace(\"#\",\"O\",1)\n k-=1\n#print(line,one,two,tree,four,line)\nprint(line)\nprint(one)\nprint(two)\nprint(tree)\nprint(four)\nprint(line)\n \t\t \t \t \t\t\t \t\t \t \t", "from sys import stdin\r\ndef llenar(bus,cont):\r\n new=[]\r\n new=transpuesta(bus)\r\n for i in range(len(new)):\r\n for j in range(len(new[i])):\r\n if cont!=0:\r\n if new[i][j]=='#':\r\n new[i][j]='O'\r\n cont-=1\r\n return transpuesta(new)\r\n \r\ndef transpuesta(sitp):\r\n a=[]\r\n for i in range(len(sitp[0])):\r\n b=[]\r\n for j in range(len(sitp)):\r\n b.append(sitp[j][i])\r\n a.append(b)\r\n return a \r\ndef main():\r\n buseta=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"--+\"],[\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|D\|)\"],[\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|.\|\"],[\"\|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"..\|\"],[\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|.\|)\"],[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"--+\"]]\r\n cont=stdin.readline().strip()\r\n while cont!='':\r\n x=llenar(buseta,int(cont))\r\n for i in range(len(buseta)):\r\n print(''.join((x[i])))\r\n cont=stdin.readline().strip()\r\nmain()\r\n\r\n", "N = int(input())\nlista = []\ncorreder = '#'\nif N > 2:\n N-=1\n correder = 'O'\nfor i in range(N):\n lista.append('O')\nfor i in range(34-N):\n lista.append('#')\n\ncorredores = ['','','']\n\ncolunas_cheias=int(N/3)\ncolunas_imcompleta=N%3\n\nfor i in range(3):\n corredores[i]+=(\"O\"colunas_cheias)\nfor i in range(colunas_imcompleta):\n corredores[i]+=(\"O\")\nfor i in range(3):\n if len(corredores[i])<11:\n corredores[i]+=\"#\"(11-len(corredores[i]))\n#print(N,colunas_cheias,colunas_imcompleta)\n\nprint(\"+------------------------+\")\nprint('\|', end = '');print(corredores[0], sep='.', end ='');print(\".\|D\|)\")\nprint('\|', end = '');print(corredores[1], sep='.', end ='');print(\".\|.\|\")\nprint('\|', end = '');print(correder+\".\"20,end='');print(\"...\|\")\nprint('\|', end = '');print(corredores[2], sep='.', end ='');print(\".\|.\|)\")\nprint(\"+------------------------+\")", "k = int(input())\r\nvalues = [['#' for i in range(11)] for i in range(3)]\r\nfor i in range(k - 1 if k > 2 else k):\r\n values[i % 3][i // 3] = 'O'\r\nprint('+------------------------+')\r\nprint('\|' + '.'.join(values[0]) + '.\|D\|)')\r\nprint('\|' + '.'.join(values[1]) + '.\|.\|')\r\nprint('\|' + ('O' if k > 2 else '#') + '.......................\|')\r\nprint('\|' + '.'.join(values[2]) + '.\|.\|)')\r\nprint('+------------------------+')\r\n", "from sys import stdin\ndef main():\n\tn=int(stdin.readline().strip())\n\tb=[['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','D','\|',')'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','.','\|'],['\|','#','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','\|'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','.','\|',')'],['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\n\ti=1\n\twhile (n>0):\n\t\tj=0\n\t\twhile (n>0) and (j<5):\t\t\n\t\t\tif (b[j][i]=='#'):\t\n\t\t\t\tb[j][i]='O'\n\t\t\t\tn=n-1\n\t\t\tj=j+1\n\t\ti=i+1\n\tfor i in range (len(b)):\n\t\tfor j in range (len(b[i])):\n\t\t\tprint(b[i][j],end='')\n\t\tprint()\nmain()\n", "n=int(input())\r\ns=[]\r\ns.append(list(\"+------------------------+\"))\r\ns.append(list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"))\r\ns.append(list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"))\r\ns.append(list(\"\|#.......................\|\"))\r\ns.append(list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"))\r\ns.append(list(\"+------------------------+\"))\r\n\r\nc=1\r\nr=1\r\nfor i in range(n):\r\n s[r][c]='O'\r\n r+=1\r\n if(s[r][c]=='-'):\r\n r=1\r\n c+=2\r\n elif(s[r][c]=='.'):\r\n r+=1\r\nfor i in range(6):\r\n S=\"\"\r\n for item in s[i]:\r\n S+=item\r\n print(S)\r\n", "k = int(input())\r\nprint('+------------------------+')\r\nif k <= 4:\r\n if k > 0:\r\n print('\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)')\r\n else:\r\n print('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)')\r\n if k > 1:\r\n print('\|O.#.#.#.#.#.#.#.#.#.#.\|.\|')\r\n else:\r\n print('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|')\r\n if k > 2:\r\n print('\|O.......................\|')\r\n else:\r\n print('\|#.......................\|')\r\n if k > 3:\r\n print('\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)')\r\n else:\r\n print('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)')\r\nelse:\r\n k -= 4\r\n first = k // 3 + 1\r\n if k % 3 > 0:\r\n first += 1\r\n second = k // 3 + 1\r\n if k % 3 > 1:\r\n second += 1\r\n third = k // 3 + 1\r\n \r\n print('\|', 'O.' * first, '#.' * (11 - first), '\|D\|)', sep = '')\r\n print('\|', 'O.' * second, '#.' * (11 - second), '\|.\|', sep = '')\r\n print('\|O.......................\|')\r\n print('\|', 'O.' * third, '#.' * (11 - third), '\|.\|)', sep = '')\r\nprint('+------------------------+')", "a = []\r\na.append('+------------------------+' )\r\na.append('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)')\r\na.append('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|' )\r\na.append('\|#.......................\|' )\r\na.append('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)')\r\na.append('+------------------------+' )\r\na = list(map(list, a))\r\ncurr = [0, 0]\r\nn = int(input())\r\nwhile n > 0:\r\n if a[curr[0]][curr[1]] == '#':\r\n a[curr[0]][curr[1]] = 'O'\r\n n -= 1\r\n curr[0] += 1\r\n if curr[0] >= 6:\r\n curr[0] = 0\r\n curr[1] += 1\r\nfor i in range(5):\r\n for j in a[i][:-1]:\r\n print(j, end = '')\r\n print(a[i][-1])\r\nfor j in a[5]:\r\n print(j, end = '')", "n = int(input())\na = [0]11\nif n < 4:\n a[0] = n\n n = 0\nelse:\n a[0] = 4\n n -= 4\n i = 1\n while n > 0:\n if n < 3:\n a[i] = n\n n = 0\n else:\n a[i] = 3\n n -= 3\n i+=1\n\ndef pb(x):\n global a\n for i in a[1:]:\n print('O' if i >= x else '#', end='.')\nprint('+------------------------+')\nprint(end='\|'); print('O' if a[0] >= 1 else '#', end='.'); \npb(1); print('\|D\|)')\nprint(end='\|'); print('O' if a[0] >= 2 else '#', end='.'); \npb(2); print('\|.\|')\nprint(end='\|'); print('O' if a[0] >= 3 else '#', end=''); print('.......................\|')\nprint(end='\|'); print('O' if a[0] >= 4 else '#', end='.'); \npb(3); print('\|.\|)')\nprint('+------------------------+')\n", "bus = [\nlist('+------------------------+'),\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)'),\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|'),\nlist('\|#.......................\|'),\nlist('\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)'),\nlist('+------------------------+'),\n]\n\nn = int(input())\n\nfor i in range(n):\n ok = False\n for r in range(11):\n if ok:\n break\n r_num = 2 r + 1\n for j in range(1, 5):\n if ok:\n break\n if bus[j][r_num] == '#':\n bus[j][r_num] = 'O'\n ok = True\n\nfor s in bus:\n print(''.join(s))\n", "#!/usr/bin/python3\n\nimport sys\n\nslika = \"\"\"+------------------------+\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+\"\"\"\n\nif __name__ == '__main__':\n st = int(sys.stdin.readline())\n lines = [list(line) for line in slika.split('\\n')]\n w = min(len(line) for line in lines)\n for k in range(w):\n if st == 0:\n break\n for l in range(len(lines)):\n if st == 0:\n break\n if lines[l][k] == '#':\n lines[l][k] = 'O'\n st -= 1\n \n for line in lines:\n print(''.join(line))\n", "class CodeforcesTask475ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.passengers = 0\r\n\r\n def read_input(self):\r\n self.passengers = int(input())\r\n\r\n def process_task(self):\r\n seats = [\"#\" for x in range(34)]\r\n for x in range(self.passengers):\r\n seats[x] = \"O\"\r\n bus = \"\"\"+------------------------+\r\n\|{0}.{4}.{7}.{10}.{13}.{16}.{19}.{22}.{25}.{28}.{31}.\|D\|)\r\n\|{1}.{5}.{8}.{11}.{14}.{17}.{20}.{23}.{26}.{29}.{32}.\|.\|\r\n\|{2}.......................\|\r\n\|{3}.{6}.{9}.{12}.{15}.{18}.{21}.{24}.{27}.{30}.{33}.\|.\|)\r\n+------------------------+\"\"\".format(seats)\r\n self.result = bus\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask475ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "s = ['+------------------------+',\n'\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)',\n'\|#.#.#.#.#.#.#.#.#.#.#.\|.\|',\n'\|#.......................\|',\n'\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)',\n'+------------------------+']\nk = int(input())\n\nfor _ in range(k):\n fnd = False\n for j in range(22):\n if fnd:\n break\n for i in range(6):\n if s[i][j] == '#':\n s[i] = s[i][:j] + 'O' + s[i][j + 1:]\n fnd = True\n break\nprint('\\n'.join(s))\n", "bus = list(map(list, '''+------------------------+\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\r\n\|#.......................\|\r\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\r\n+------------------------+'''.split('\\n')))\r\nplaces = [[1, 1], [2, 1], [3, 1], [4, 1]] + [[1 << y, 1 + 2 x] for x in range(1,11) for y in range(3)]\r\nfor x, y in places[:int(input())]:\r\n bus[x][y] = 'O'\r\nprint(map(lambda x: ''.join(x), bus), sep = '\\n')\r\n", "n = int(input())\n\nline1 = '+------------------------+'\nrow1 = ['#'] 11\nrow2 = ['#'] * 11\nrow3 = ['#'] + ['.'] * 10\nrow4 = ['#'] * 11\nfor i in range(1, n + 1):\n if i <= 4:\n if i == 1:\n row1[0] = 'O'\n elif i == 2:\n row2[0] = 'O'\n elif i == 3:\n row3[0] = 'O'\n elif i == 4:\n row4[0] = 'O'\n else:\n di = i - 4\n if di % 3 == 1:\n row1[row1.index('#')] = 'O'\n elif di % 3 == 2:\n row2[row2.index('#')] = 'O'\n elif di % 3 == 0:\n row4[row4.index('#')] = 'O'\n \nprint(line1)\nprint('\|' + '.'.join(row1) + '.\|D\|)')\nprint('\|' + '.'.join(row2) + '.\|.\|')\nprint('\|' + '.'.join(row3) + '...\|')\nprint('\|' + '.'.join(row4) + '.\|.\|)')\nprint(line1)\n", "\n\nK = int(input())\n\nBus = [\n [ ('+',0), ('-',0), ('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0), ('+',0)],\n\n # linha 1 \|1.5.8.#.#.#.#.#.#.#.#.\|D\|)\n [ ('\|',0), ('S',1), ('.',0), ('S',5), ('.',0), ('S',8), ('.',0), ('S',11), ('.',0), ('S',14), ('.',0), ('S',17), ('.',0), ('S',20), ('.',0), ('S',23), ('.',0), ('S',26), ('.',0), ('S',29), ('.',0), ('S',32), ('.',0), ('\|',0), ('D',0), ('\|',0), (')',0)],\n\n # linha 2 \|2.6.9.#.#.#.#.#.#.#.#.\|.\|\n [ ('\|',0), ('S',2), ('.',0), ('S',6), ('.',0), ('S',9), ('.',0), ('S',12), ('.',0), ('S',15), ('.',0), ('S',18), ('.',0), ('S',21), ('.',0), ('S',24), ('.',0), ('S',27), ('.',0), ('S',30), ('.',0), ('S',33), ('.',0), ('\|',0), ('.',0), ('\|',0)],\n\n # linha 3 \|3.......................\|\n [ ('\|',0), ('S',3), ('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0), ('\|',0)],\n\n # linha 4 \|4.7.10.#.#.#.#.#.#.#.#.\|.\|)\n [ ('\|',0), ('S',4), ('.',0), ('S',7), ('.',0), ('S',10), ('.',0), ('S',13), ('.',0), ('S',16), ('.',0), ('S',19), ('.',0), ('S',22), ('.',0), ('S',25), ('.',0), ('S',28), ('.',0), ('S',31), ('.',0), ('S',34), ('.',0), ('\|',0), ('.',0), ('\|',0), (')',0)],\n\n [ ('+',0), ('-',0), ('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0), ('+',0)],\n]\n\nfor i in range(0, len(Bus)):\n line = \"\"\n for j in range(0, len(Bus[i])):\n char, number = Bus[i][j]\n if(char == 'S'):\n if(number <= K):\n line += 'O'\n else:\n line += '#'\n else:\n line += char\n print(line)", "n=int(input())\r\ns=['+------------------------+']\r\nd='\|'+'#O'[n>2]+'.'23+'\|'\r\nif n>2:n-=1\r\nfor i in range(3):x=n//3+(n%3>i);s+=['\|'+('.'.join('O'x+'#'(11-x)))]\r\ns.insert(3,d)\r\ns+=[s[0]]\r\ns[1]+='.\|D\|)'\r\ns[2]+='.\|.\|'\r\ns[4]+='.\|.\|)'\r\nprint('\\n'.join(s))", "k = int(input())\n\nstrin0 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista = strin0.split(\".\")\n\nstrin1 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista1 = strin1.split(\".\")\nstrin2 = \"#\"\nlista2 = strin2.split(\".\")\nstrin3 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista3 = strin3.split(\".\")\nstringprint = \".\"\nstringprint1 = \".\"\nstringprint2 = \".\"\nstringprint3 = \".\"\n\ni = 0\nj = 0\nwhile i != k:\n lista[j] = \"O\"\n i = i + 1\n if i == k:\n break\n lista1[j] = \"O\"\n i = i + 1\n if i == k:\n break\n\n if lista2[0] != \"O\":\n lista2[0] = \"O\"\n i = i + 1\n\n if i == k:\n break\n\n lista3[j] = \"O\"\n i = i + 1\n j = j + 1\n\nstringprint = stringprint.join(lista)\nstringprint1 = stringprint1.join(lista1)\nstringprint2 = stringprint2.join(lista2)\nstringprint3 = stringprint3.join(lista3)\n\n\n\n\nprint(\"+------------------------+\")\nprint(\"\|\"+stringprint+\".\"+\"\|D\|)\")\nprint(\"\|\"+stringprint1+\".\"+\"\|.\|\")\nprint(\"\|\"+stringprint2+\".......................\"+\"\|\")\nprint(\"\|\"+stringprint3+\".\"\"\|.\|)\")\nprint(\"+------------------------+\")\n", "def main():\n n = int(input())\n print(\"+------------------------+\")\n b1 = 0\n if n == 0:\n b1 = 0\n elif 1 <= n <= 4:\n b1 = 1\n else:\n b1 = (n + 1) // 3\n if 0 <= n <= 1:\n b2 = 0\n elif 2 <= n <= 5:\n b2 = 1\n else:\n b2 = n // 3\n b3 = 0\n if n < 3:\n b3 = 0\n else:\n b3 = 1\n b4 = 0\n if n <= 3:\n b4 = 0\n else:\n b4 = (n - 1) // 3\n print(\"\|\", end = '')\n for i in range(1, 12):\n if i <= b1:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('\|D\|)')\n print(\"\|\", end = '')\n for i in range(1, 12):\n if i <= b2:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('\|.\|')\n if b3 == 0:\n print(\"\|#.......................\|\")\n else:\n print(\"\|O.......................\|\")\n print(\"\|\", end = '')\n for i in range(1, 12):\n if i <= b4:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('\|.\|)')\n print(\"+------------------------+\")\n\n\n\nmain()\n", "ans= '\\n'.join(['+------------------------+'\r\n,'\|0.4.7.A.(.G.J.M.P.S.V.\|D\|)',\r\n'\|1.5.8.B.E.H.K.N.Q.T.W.\|.\|'\r\n,'\|2.......................\|',\r\n'\|3.6.9.C.F.I.L.s.R.U.X.\|.\|)',\r\n'+------------------------+'])\r\n\r\nline = \"0123456789ABC(EFGHIJKLMNsPQRSTUVWX\"\r\nn = int(input())\r\nfor i in range(n):\r\n ans = ans.replace(line[i],'O')\r\n # print(ans)\r\n # print(\"\")\r\n#print(\"_________________________\")\r\nfor i in range(n,34,1):\r\n ans = ans.replace(line[i],\"#\")\r\n # print(ans)\r\n # print(\"\")\r\nprint(ans)", "bus = \"\"\"+------------------------+\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+\"\"\"\n\nbus = [list(line) for line in bus.split()]\n\nn = int(input())\nfor i in range(4):\n if n <= 0:\n break\n bus[i + 1][1] = 'O'\n n -= 1\n\nrow = 1\ncol = 3\nwhile n > 0:\n bus[row][col] = 'O'\n n -= 1\n row = 2 row\n if row > 4:\n row = 1\n col += 2\n\nprint('\\n'.join([''.join(line) for line in bus]))\n", "import math\nn = int(input())\ntemplate = [\"+------------------------+\",\n\"\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\",\n\"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\",\n\"\|O.......................\|\",\n\"\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\",\n\"+------------------------+\"]\ni = 1\nlistTemplate = []\nfor s in template:\n listTemplate.append(list(s))\nwhile (i<=34):\n if(i > n): c = \"#\"\n else: c = \"O\"\n if(i<=4): row = 0\n else: row = math.floor((i-2)/3)\n if(i<=4): seat = (i-1)\n else: seat = (i-5)%3\n if(seat == 2 and row != 0): seat+=1\n listTemplate[1+seat][1+row2] = c \n i+=1\nfor a in listTemplate:\n print(''.join(a)) ", "def replaceString(s, newstring, index):\n return s[:index] + newstring + s[index + 1:]\n\ndef main():\n\n n = int(input())\n\n busMap =[]\n\n sideBus = \"+------------------------+\"\n seats = \"#.#.#.#.#.#.#.#.#.#.#.\"\n center = \"#.....................\"\n\n busMap.append(seats)\n busMap.append(seats)\n busMap.append(center)\n busMap.append(seats)\n\n for i in range(22):\n for j in range(4):\n if (n > 0 and busMap[j][i] == \"#\"):\n busMap[j] = replaceString(busMap[j], \"O\", i)\n n -= 1\n\n print(sideBus)\n print(\"\|\" + busMap[0] + \"\|D\|)\")\n print(\"\|\" + busMap[1] + \"\|.\|\")\n print(\"\|\" + busMap[2] + \"..\|\")\n print(\"\|\" + busMap[3] + \"\|.\|)\")\n print(sideBus)\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\n\na = [['#', '#', '#' if i == 0 else '.', '#'] for i in range(11)]\n\nfor r in range(11):\n\tfor c in range(4):\n\t\tif a[r][c] == '#' and n > 0:\n\t\t\ta[r][c] = 'O'\n\t\t\tn -= 1\n\nprint('+' + '-' 24 + '+')\nprint('\|' + \".\".join([a[i][0] for i in range(11)]) + \".\|D\|)\")\nprint('\|' + \".\".join([a[i][1] for i in range(11)]) + \".\|.\|\")\nprint('\|' + \".\".join([a[i][2] for i in range(11)]) + \"...\|\")\nprint('\|' + \".\".join([a[i][3] for i in range(11)]) + \".\|.\|)\")\nprint('+' + '-' * 24 + '+')\n", "n = int(input())\n\na = ['#']34\n\nfor i in range(n):\n a[i] = 'O'\n\nprint('+------------------------+')\nprint('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|D\|)'.format(a[0], a[4], a[7],a[10],a[13],a[16],a[19],a[22],a[25],a[28],a[31]))\nprint('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|.\|'.format(a[1], a[5], a[8],a[11],a[14],a[17],a[20],a[23],a[26],a[29],a[32]))\nprint('\|' + a[2] + '.......................\|')\nprint('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|.\|)'.format(a[3], a[6], a[9],a[12],a[15],a[18],a[21],a[24],a[27],a[30],a[33]))\nprint('+------------------------+')", "n = int(input())\r\n\r\nl = [list(\"+------------------------+\"),\r\n list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"),\r\n list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"),\r\n list(\"\|#.......................\|\"),\r\n list(\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"),\r\n list(\"+------------------------+\")]\r\n\r\nj = 1\r\n\r\nwhile j < 22:\r\n i = 1\r\n\r\n while i < 5 and n > 0:\r\n if l[i][j] == \"#\":\r\n l[i][j] = \"O\"\r\n n -= 1\r\n i += 1\r\n j += 2\r\n\r\nfor i in l:\r\n print(\"\".join(i))", "numberoParticipantes = int(input())\nparticipantes = ['temp'] numberoParticipantes\n \nprimeraLinea = []\nsegundaLinea = []\nterceraLinea = []\ncuartaLinea = []\nfor k in range (0, 11):\n for l in range(0, 4):\n if(l == 0 and len(participantes) > 0):\n primeraLinea.append('O')\n participantes.pop(0)\n elif(l == 1 and len(participantes) > 0):\n segundaLinea.append('O')\n participantes.pop(0)\n elif(k == 0 and l == 2 and len(participantes) > 0):\n terceraLinea.append('O')\n participantes.pop(0)\n elif(l == 3 and len(participantes) > 0):\n cuartaLinea.append('O')\n participantes.pop(0)\n \nprint('+------------------------+')\nfor i in range(0, 4):\n for j in range(0, 27):\n if(j == 0 or (j == 23 and i != 2) or j == 25):\n print('\|', end ='')\n elif(j == 26 and (i == 0 or i == 3)):\n print(')', end ='')\n elif(j == 26 and (i == 1 or i == 2)):\n print('', end='')\n elif(j == 24 and i == 0):\n print('D', end ='')\n elif(j % 2 == 0 or (j > 1 and i == 2)):\n print('.', end ='')\n elif(i == 0 and len(primeraLinea)):\n print(primeraLinea.pop(), end ='')\n elif(i == 1 and len(segundaLinea)):\n print(segundaLinea.pop(), end ='')\n elif(i == 2 and len(terceraLinea)):\n print(terceraLinea.pop(), end ='')\n elif(i == 3 and len(cuartaLinea)):\n print(cuartaLinea.pop(), end ='')\n else:\n print('#', end ='')\n print('')\nprint('+------------------------+')\n\t\t\t\t \t \t\t\t\t\t \t \t \t \t\t \t \t", "#!/usr/bin/python3\r\n\r\nk = int(input())\r\nseat_map = [\"+------------------------+\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n \"\|#.......................\|\",\r\n \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n \"+------------------------+\"]\r\nseat = list(map(list, seat_map))\r\nfor L in range(len(seat[0])):\r\n for W in range(len(seat)):\r\n if seat[W][L] == '#' and k > 0:\r\n seat[W][L] = 'O'\r\n k -= 1\r\nfor line in seat:\r\n print(''.join(line))", "k = int(input())\nseats = (28, 56, 83, 110, 30, 58, 112, 32, 60, 114, 34, 62, 116, 36, 64, 118, 38,\n 66, 120, 40, 68, 122, 42, 70, 124, 44, 72, 126, 46, 74, 128, 48, 76, 130)\nbus = list('+------------------------+\\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\\n'\n '\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\\n\|#.......................\|\\n\|'\n '#.#.#.#.#.#.#.#.#.#.#.\|.\|)\\n+------------------------+')\nfor i in seats[:k]:\n bus[i] = 'O'\n \nprint(''.join(bus))", "out = [bytearray(b\"+------------------------+\"),\nbytearray(b\"\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\"),\nbytearray(b\"\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\"),\nbytearray(b\"\|O.......................\|\"),\nbytearray(b\"\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\"),\nbytearray(b\"+------------------------+\")];\n\nk = int(input())\n#out[0][4] = ord('s')\n#print(out[0].decode())\nverlist = [2,4,1]\n\nfor i in range(1,35):\n\tc = '#' if i>k else 'O'\n\thor = 1 if i <5 else ((i-2)//3)2+1\n\t#print(hor)\n\tver = i if i<5 else verlist[i%3]\n\tout[ver][hor] = ord(c)\nfor s in out:\n\tprint(s.decode())", "import re\r\n\r\nbus = \"\"\"\\\r\n+------------------------+\r\n\|1.5.8.11.14.17.20.23.26.29.32.\|D\|)\r\n\|2.6.9.12.15.18.21.24.27.30.33.\|.\|\r\n\|3.......................\|\r\n\|4.7.10.13.16.19.22.25.28.31.34.\|.\|)\r\n+------------------------+\"\"\"\r\n\r\nk = int(input())\r\nbus = re.sub(\"\\d+\", lambda m: \"O\" if int(m.group()) <= k else \"#\", bus)\r\nprint(bus)", "from sys import stdin\r\ndef replace(c,n):\r\n for i in range(1,len(c[0]),2):\r\n for j in range(1,5):\r\n if n>0:\r\n c[j][i]=c[j][i].replace(\"#\",\"O\")\r\n if c[j][i]==\"O\":\r\n n=n-1\r\n return c \r\ndef main():\r\n a1=[]\r\n bus=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"],\r\n [\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|\",\"D\",\"\|\",\")\"],\r\n [\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|\",\".\",\"\|\"],\r\n [\"\|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"\|\"],\r\n [\"\|\",\"#\",'.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','.','\|',')'],\r\n ['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\r\n n=int(stdin.readline())\r\n bus=replace(bus,n)\r\n for i in range(0,len(bus)):\r\n print(\"\".join(bus[i]))\r\nmain()\r\n", "\nn = int(input())\nrow = [\"\|\", \"\|\", \"\|\", \"\|\"]\nc = 0\nfor i in range(1, 45):\n\n\tif(c > 3):\n\t\tc = 0\n\n\tif(i < 4):\n\t\tif(n < 1):\n\t\t\trow[c] += \"#.\"\n\t\telse:\n\t\t\trow[c] += \"O.\"\n\t\n\telif(c==2):\n\t\trow[c] += \"..\"\n\t\tn += 1\n\t\n\telif(n < 1):\n\t\t\trow[c] += \"#.\"\n\t\n\telif(n > 0):\n\t\trow[c] += \"O.\"\n\tc += 1\n\tn -= 1\n\nrow[0] += \"\|D\|)\"\nrow[1] += \"\|.\|\"\nrow[2] += \"..\|\"\nrow[3] += \"\|.\|)\"\n \nprint (\"+------------------------+\")\nprint (row[0])\nprint (row[1])\nprint (row[2])\nprint (row[3])\nprint (\"+------------------------+\")\n\n\t \t \t\t\t\t\t\t\t \t\t \t \t \t\t\t \t\t\t\t \t", "from sys import stdin\r\ndef main():\r\n n=int(stdin.readline().strip())\r\n b=[['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','D','\|',')'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','.','\|'],['\|','#','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','\|'],['\|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','\|','.','\|',')'],['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\r\n i=1\r\n while (n>0):\r\n j=0\r\n while (n>0) and (j<5): \r\n if (b[j][i]=='#'): \r\n b[j][i]='O'\r\n n=n-1\r\n j=j+1\r\n i=i+1\r\n for i in range (len(b)):\r\n for j in range (len(b[i])):\r\n print(b[i][j],end='')\r\n print()\r\nmain()", "from sys import stdin\r\ndef main():\r\n pasajeros=stdin.readline()\r\n bus=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"],\r\n [\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|\",\"D\",\"\|\",\")\"],\r\n [\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|\",\".\",\"\|\"],\r\n [\"\|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"\|\"],\r\n [\"\|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"\|\",\".\",\"\|\",\")\"],\r\n [\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"]]\r\n x=0\r\n if int(pasajeros)==0:\r\n for i in range (len(bus)):\r\n for j in range (len(bus[i])):\r\n print(bus[i][j],end='') \r\n print()\r\n else:\r\n for j in range (1,25):\r\n for i in range (1,5):\r\n if bus[i][j]==\"#\" and x<=int(pasajeros)-1:\r\n bus[i][j]=\"O\"\r\n x=x+1\r\n for i in range (len(bus)):\r\n for j in range (len(bus[i])):\r\n print(bus[i][j],end='') \r\n print()\r\n \r\nmain()\r\n", "a = [\r\n\"+------------------------+\",\r\n\"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\",\r\n\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\",\r\n\"\|#.......................\|\",\r\n\"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\",\r\n\"+------------------------+\"\r\n]\r\nn = int(input())\r\nrow = 1\r\npos = 1\r\n\r\nfor i in range(n):\r\n a[pos] = a[pos][:row] + 'O' + a[pos][row + 1:]\r\n pos += 1\r\n if row != 1 and pos == 3:\r\n pos += 1\r\n if pos > 4:\r\n pos = 1\r\n row += 2\r\n\r\nfor x in a:\r\n print(x)\r\n ", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(args, override=False):\n if '-v' in argv or override:\n print(args)\n\nif __name__ == '__main__':\n n = rint()\n\n side = '+------------------------+ '\n r1 = '\|S.S.S.S.S.S.S.S.S.S.S.\|D\|)'\n r2 = '\|S.S.S.S.S.S.S.S.S.S.S.\|.\| '\n r3 = '\|S.......................\| '\n r4 = '\|S.S.S.S.S.S.S.S.S.S.S.\|.\|)'\n\n cols = list([list(a) for a in zip(side, r1, r2, r3, r4, side)])\n\n for r,row in enumerate(cols):\n for c,col in enumerate(row):\n if cols[r][c] == 'S':\n cols[r][c] = '#'\n n -= 1\n if n == 0:\n break\n if n == 0:\n break\n\n rows = list([''.join(c) for c in zip(cols)])\n rows = [r.replace('S', '!') for r in rows]\n rows = [r.replace('#', 'O') for r in rows]\n rows = [r.replace('!', '#') for r in rows]\n for r in rows:\n print(r.strip(' '))\n", "k = int(input())\r\ns = [\"\"] * 6\r\ns[0] = \"+------------------------+\"\r\ns[1] = \"\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\"\r\ns[2] = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\"\r\ns[3] = \"\|#.......................\|\"\r\ns[4] = \"\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\"\r\ns[5] = \"+------------------------+\"\r\n\r\ncurs = 1\r\nwhile k > 0:\r\n while not \"#\" in s[curs]:\r\n curs = 1 + curs % 4\r\n x = s[curs].index(\"#\")\r\n s[curs] = s[curs][:x] + \"O\" + s[curs][x + 1:]\r\n curs = 1 + curs % 4\r\n k -= 1\r\nfor i in s:\r\n print(i)", "#1\n\ninpput = int(input())\n\n\nif inpput >=4:\n inpput-=4\n\n bayan = inpput//3\n c = inpput%3\n\n print('+------------------------+')\n\n if c>0:\n print( '\|'+'O.'+'O.'(bayan)+'O.'+'#.'(11-(1+bayan+1))+'\|D\|)' )\n c-=1\n else:\n print( '\|'+'O.'+'O.'(bayan)+'#.'(11-(1+bayan))+'\|D\|)' )\n\n if c>0:\n print( '\|'+'O.'+'O.'(bayan)+'O.'+'#.'(11-(1+bayan+1))+'\|.\|' )\n c-=1\n else:\n print( '\|'+'O.'+'O.'(bayan)+'#.'(11-(1+bayan))+'\|.\|' )\n\n print('\|O.......................\|')\n\n if c>0:\n print( '\|'+'O.'+'O.'(bayan)+'O.'+'#.'(11-(1+bayan+1))+'\|.\|)' )\n c-=1\n else:\n print( '\|'+'O.'+'O.'(bayan)+'#.'(11-(1+bayan))+'\|.\|)' )\n \n \n \n\n\n print('+------------------------+')\n\nelse:\n\n print('+------------------------+')\n if inpput>0:\n print( '\|'+'O.'+'#.'(10)+'\|D\|)' )\n inpput-=1\n else:\n print( '\|'+'#.'+'#.'(10)+'\|D\|)' )\n\n\n \n \n if inpput>0:\n print( '\|'+'O.'+'#.'(10)+'\|.\|' )\n inpput-=1\n else:\n print( '\|'+'#.'+'#.'(10)+'\|.\|' )\n\n \n if inpput>0:\n print( '\|'+'O.'+'..'(10)+'..\|' )\n inpput-=1\n else:\n print( '\|'+'#.'+'..'(10)+'..\|' )\n \n\n\n if inpput>0:\n print( '\|'+'O.'+'#.'(10)+'\|.\|)' )\n else:\n print( '\|'+'#.'+'#.'(10)+'\|.\|)' )\n \n print('+------------------------+')\n\t \t \t\t \t\t\t\t\t \t\t\t \t \t\t\t", "import sys\n\ndef main():\n while 1:\n try:\n line = sys.stdin.readline()\n solve(line)\n break\n except KeyboardInterrupt:\n break\n\npas = ['#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#']\n\ndef solve(line):\n for x in range(0,int(line)):\n pas[x] = 'O'\n\n print ('+------------------------+')\n print ('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|D\|)' .format(pas[0],pas[4],pas[7],pas[10],pas[13],pas[16],pas[19],pas[22],pas[25],pas[28],pas[31]))\n print ('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|.\|' .format(pas[1],pas[5],pas[8],pas[11],pas[14],pas[17],pas[20],pas[23],pas[26],pas[29],pas[32]))\n print ('\|{}.......................\|' .format(pas[2]))\n print ('\|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.\|.\|)' .format(pas[3],pas[6],pas[9],pas[12],pas[15],pas[18],pas[21],pas[24],pas[27],pas[30],pas[33]))\n print ('+------------------------+')\n\n\nif __name__ == \"__main__\":\n main()\n\n# 1502214954884\n" ]	{"inputs": ["9", "20", "30", "5", "0", "1", "2", "3", "4", "6", "7", "8", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "21", "22", "23", "24", "25", "26", "27", "28", "29", "31", "32", "33", "34"], "outputs": ["+------------------------+\n\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|#.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|#.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|#.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.#.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.#.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.#.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.#.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.#.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.#.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.#.#.#.#.#.#.#.\|D\|)\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.#.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.#.#.#.#.#.#.\|D\|)\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.#.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.#.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.#.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.#.#.#.#.\|D\|)\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.#.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.#.#.#.\|D\|)\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.#.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.#.#.\|D\|)\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.#.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.#.\|D\|)\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\n\|O.O.O.O.O.O.O.O.O.O.O.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.O.#.\|.\|)\n+------------------------+", "+------------------------+\n\|O.O.O.O.O.O.O.O.O.O.O.\|D\|)\n\|O.O.O.O.O.O.O.O.O.O.O.\|.\|\n\|O.......................\|\n\|O.O.O.O.O.O.O.O.O.O.O.\|.\|)\n+------------------------+"]}	UNKNOWN	PYTHON3	CODEFORCES	63
d63bc03ec2d750bf0a79a037180d8b83	Yaroslav and Permutations	Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time. Help Yaroslav. The first line contains integer n (1<=≤<=n<=≤<=100) — the number of elements in the array. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000) — the array elements. In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise. Sample Input 1 1 3 1 1 2 4 7 7 7 7 Sample Output YES YES NO	[ "n = int(input())\r\na = list(map(int, input().split()))\r\nok = True\r\nfor val in a:\r\n if a.count(val) > (n+1)//2:\r\n ok = False\r\n break\r\n\r\nprint('YES' if ok else 'NO')", "n=int(input())\r\na=[int(x) for x in input().split()]\r\n\r\nfor i in a:\r\n if a.count(i)2>n+1:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = input().split(' ')\r\ns = [int(i) for i in a]\r\nmax_num = max(s,key=s.count)\r\nmax_count = s.count(max_num)\r\nif max_count>((n//2)+(n%2)):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nc = Counter(l)\r\nt=0\r\n\r\nfor i in l:\r\n if(c[i]>math.ceil(n/2)):\r\n print(\"NO\")\r\n t = 1\r\n quit()\r\n\r\nif(t==0):\r\n print(\"YES\")\r\n \r\n", "n=int(input())\n\narr=[int(i) for i in input().split(\" \")]\nflag=0\nset_A=set(arr)\nfor x in set_A:\n if arr.count(x)>(int((n+1)/2)):\n flag=1\n break\n\nif(flag==0):\n print('YES')\nelse:\n print('NO')\n\n\t\t\t \t\t \t \t\t \t \t \t\t \t\t", "n =int(input())\r\nlst = [int(i) for i in input().split()] \r\nd = dict()\r\nfor i in lst:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i]+=1\r\nif n%2 == 0:\r\n for i in d:\r\n if d[i] >= n//2+1:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in d:\r\n if d[i] >= n//2+2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n ", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n n = int(input())\r\n #a,b,c = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n n2 = (n+1) // 2\r\n ar = [0]1001\r\n for i in ai:\r\n ar[i] += 1\r\n print([\"YES\",\"NO\"][max(ar) > n2])\r\nmain()\r\n", "n=int(input())\r\n\r\nsequence=[int(i) for i in input().split()]\r\nflag=0\r\n\r\nfor i in range(n):\r\n if sequence.count(sequence[i])>(n+1)/2 :\r\n flag=1\r\n print(\"NO\")\r\n break\r\n\r\nif(flag==0):\r\n print(\"YES\")", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\narr = L()\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n st = list(set(arr))\r\n if len(st) == 1:\r\n print('NO')\r\n else:\r\n lis = []\r\n for i in st:\r\n lis.append(arr.count(i))\r\n mx = 0\r\n c = 0\r\n for i in lis:\r\n if i > mx:\r\n c += mx\r\n mx = i\r\n else:\r\n c += i\r\n if c >= (mx-1):\r\n print('YES')\r\n else:\r\n print('NO')", "#!/usr/bin/env python3\n\nfrom collections import Counter\n\nif __name__ == \"__main__\":\n n = int(input())\n a_s = Counter(input().split())\n maximus = max(a_s, key=lambda x: a_s[x])\n sum_of_rest = sum([a_s[x] for x in filter(lambda x: x != maximus, a_s)])\n if sum_of_rest >= a_s[maximus] - 1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "from collections import Counter\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=Counter(a)\r\nk=max(d.values())\r\nif n==1:\r\n print(\"YES\")\r\n exit()\r\n# ans=statistics.mode(a)\r\n# for i in range(n):\r\n# if a[i]==ans:\r\n# k+=1\r\n\r\nh=n-k+1\r\nif k<=h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\narr=[int(x) for x in input().split(' ')]\nmymap={}\nfor item in arr:\n\tif item in mymap:\n\t\tmymap[item]+=1\n\telse:\n\t\tmymap[item]=1\nif any([x for x in mymap.values() if x>(n+1)//2]):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "from collections import Counter\r\n\r\ndef pA(res):\r\n print('YES' if res else 'NO')\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nfreq = Counter(l)\r\nkeys = freq.keys()\r\nif len(keys) == 1:\r\n uniq_freq = list(freq.values())[0]\r\n pA(uniq_freq == 1)\r\nelse:\r\n max_freq = freq.most_common()[0][1]\r\n rest = n - max_freq\r\n pA(max_freq <= rest + 1)", "n = int(input())\narr =list(map(int,input().split()))\nc = 0\nif(n%2==0):\n c = int(n/2)\nelse:\n c = int(n/2)+1\nd = {}\nfor i in arr:\n if i in d:\n d[i]+=1\n else:\n d[i] = 1\nmaxi = d[arr[0]]\nfor i in d:\n if d[i]>maxi:\n maxi = d[i]\nif(maxi>c):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n=int(input())\r\nline=list(map(int,input().split()))\r\nfreq={}\r\nout=0\r\nfor i in line:\r\n freq[i]=freq.get(i,0)+1\r\n if freq[i]>(n//2+n%2):\r\n out=-1\r\n break\r\nif out==-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import Counter\n\nn = int(input())\nseats = Counter((int(i) for i in input().split()))\nx = (n+1)//2\n\nfor i in seats.values():\n if i > x:\n print('NO')\n break\nelse:\n print('YES')", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nb=[]\r\nc=[]\r\nb.extend(a)\r\na=set(a)\r\na=list(a)\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n for i in range(len(a)):\r\n c1 = 0\r\n for j in range(len(b)):\r\n if a[i] == b[j]:\r\n c1 += 1\r\n c.append(c1)\r\n c.sort()\r\n c.reverse()\r\n if len(c)==1:\r\n print(\"NO\")\r\n else:\r\n e=c[0]\r\n c.pop(0)\r\n g=e-1\r\n if sum(c)>=g:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0] * 1001\r\nfor i in a:\r\n b[i] += 1\r\nif max(b) <= n // 2 + (n % 2 + 1) // 2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\na = list(map(int, input().split()))\r\nct = [0] * 1001\r\nfor num in a:\r\n ct[num] += 1\r\nif max(ct) == 1 or (sum(ct) - max(ct) >= max(ct) - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\nl = list(d.keys())\r\n# print(l)\r\nx = (n+1)//2\r\nfor i in l:\r\n if d[i]>x:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")", "f= input()\r\nx=list(map(int, input().split()))\r\ny=set(x)\r\nz=list(y)\r\nsol=[]\r\nfor i in z:\r\n sol.append(x.count(i))\r\na1= max(sol)\r\na2 = sum(sol)-a1\r\nif a1-1>a2:\r\n print(\"NO\")\r\nelse : \r\n print(\"YES\")", "\r\nlog = {}\r\n\r\ntotal = int(input())\r\n\r\nlist_of_ints = input().split()\r\n\r\nlog = {i : list_of_ints.count(i) for i in list_of_ints}\r\n\r\nlog_values = [log[i] for i in log]\r\n\r\nif total % 2 == 0 and max(log_values) < total // 2 + 1:\r\n print(\"YES\")\r\nelif total % 2 == 1 and max(log_values) < (total + 3) // 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=[0]\r\nm=x1001\r\nz=int(input())\r\nfor z in map(int,input().split()):\r\n m[z]+=1\r\ns=max(m)\r\nm[m.index(s)]=0\r\nh=0\r\ne=0\r\nwhile(h<len(m)):\r\n e+=m[h]\r\n h+=1\r\nif(e>=s-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nvalid = True\r\nn= int(input())\r\nlst = [int(x) for x in input().split()]\r\nset_lst = set(lst)\r\nfor item in set_lst:\r\n c = lst.count(item) #number of count for each item\r\n if n < 2c -1:\r\n valid = False\r\n break\r\nif valid:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = int(input())\r\nd = [int(d) for d in input().split()]\r\nres = True\r\nfor i in d:\r\n if d.count(i) > 1 and (d.count(i) > ((len(d)) + 1) / 2):\r\n res = False\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nre = True\r\nfor i in a:\r\n if a.count(i) > ((n + 1) // 2):\r\n re = False\r\n break\r\nprint(\"YES\") if re else print(\"NO\")", "n = int(input())\nlst1 = input().split()\ndict1 = {}\nfor i in lst1:\n if i in dict1:\n dict1[i] += 1\n else:\n dict1[i] = 1\nl = len(lst1)\nMax = max(dict1.values())\nif Max > (l+1)//2:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t \t\t\t\t\t\t\t\t\t \t\t\t \t\t \t \t\t", "import math\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\n\r\ndictionary={}\r\n\r\nfor i in lst:\r\n if i not in dictionary:\r\n dictionary[i]=1\r\n else :\r\n dictionary[i]+=1\r\n\r\n\r\nmaximum=0\r\nfor i in dictionary:\r\n if dictionary[i]>maximum:\r\n maximum=dictionary[i]\r\n\r\nl=len(lst)\r\n\r\nif l==1:\r\n print(\"YES\")\r\nelif (maximum>math.ceil(l/2)):\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n", "import math\r\nimport collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\nD=collections.Counter(A)\r\nm=math.ceil(n/2)\r\nfor v in D.values():\r\n if v>m:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nif all(e == numbers[0] for e in numbers) and N != 1:\r\n print('NO')\r\nelif N == 1:\r\n print('YES')\r\nelse:\r\n set_of_numbers = list(set(numbers))\r\n\r\n counter = [None] * len(set_of_numbers)\r\n for i in range(len(set_of_numbers)):\r\n counter[i] = numbers.count(set_of_numbers[i])\r\n\r\n if max(counter) > math.ceil(N/2):\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\nfor item in numbers:\r\n if numbers.count(item)>math.ceil(len(numbers)/2):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\ndef m():\r\n n = eval(input()); x = list(map(eval,input().split())); j = True\r\n d = {}\r\n for i in x:\r\n if i in d: d[i]+=1\r\n else: d[i] = 1\r\n mx = 0\r\n for i in d:\r\n mx = max(mx,d[i])\r\n if mx > math.ceil(n/2): j = 0 ; break\r\n print(\"YES\" if j else \"NO\")\r\nm()", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\ns = set(l)\r\n\r\nm = float('-inf')\r\n\r\nfor i in s:\r\n m = max(m, l.count(i))\r\n\r\nif n >= m+(m-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nlst=(input().split())\r\ns=set(lst)\r\nif all([lst.count(i)2-1<=n for i in s]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from math import ceil\r\nfrom collections import Counter\r\nn = int(input())\r\nc = Counter(list(map(int, input().split())))\r\nprint('YES') if c.most_common()[0][1]<=ceil(n/2) else print('NO')\r\n", "from collections import Counter\r\nx = input()\r\narr = list(map(int, input() .split(\" \")))\r\ncallValues = Counter(arr)\r\ncomputeVal = (len(arr)+1)//2\r\ndec = False\r\nfor x in callValues:\r\n if callValues[x]>computeVal:\r\n dec = True\r\n break\r\nif not dec:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "while(1):\r\n try:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=[]\r\n for ele in a:\r\n if ele in b:\r\n continue\r\n else:\r\n b.append(ele)\r\n c=1\r\n for ele in b:\r\n if a.count(ele)<=(n+1)//2:\r\n continue\r\n else:\r\n c=0\r\n break\r\n if c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n except EOFError:\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nsetA=set(a)\r\ncouldBe=True\r\nfor i in setA:\r\n if(a.count(i)-1>len(a)-a.count(i)):\r\n couldBe=False\r\n break\r\nif(couldBe):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nli=set(l)\r\nc=0\r\nfor i in li:\r\n if l.count(i)>1:\r\n if l.count(i)>(n+1)/2:\r\n c=1\r\n break\r\n if c:\r\n break\r\nif c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "from math import ceil\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in lst:\r\n if lst.count(i)>ceil(n/2):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)c)\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums = sorted(nums, key = lambda x:nums.count(x))\r\nif(n%2==0):\r\n if(nums.count(nums[-1]) > n//2):\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n if(nums.count(nums[-1]) > (n//2)+1):\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "m = 0\r\na = [0] 1001\r\n\r\nn = int(input())\r\n\r\nfor i in map(int, input().split()):\r\n a[i] += 1\r\n\r\n if a[i] > m:\r\n m = a[i]\r\n\r\nif m > n // 2 + (1 if n % 2 == 1 else 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\nimport sys\r\nfrom collections import Counter\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\n\r\nar =input()\r\nd=input().split()\r\nv=0\r\nif(int(ar)==1):\r\n print(\"YES\")\r\nelse:\r\n most_common,num_most_common = Counter(d).most_common(1)[0]\r\n if(num_most_common>round(int(ar)/2)):\r\n print(\"NO\")\r\n sys.exit()\r\n print(\"YES\")", "import math\r\nn = int(input())\r\nline = list(map(int,input().split())) \r\nch = math.ceil(n/2)\r\nlis = [0] * 1001\r\nflag = 0\r\nfor k in line:\r\n lis[k] = lis[k] + 1\r\n if(lis[k] > ch):\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncurr_max=0\r\nfor i in range(n):\r\n curr_max=max(arr.count(arr[i]),curr_max)\r\n\r\nif curr_max<=(n+1)//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na= list(map(int,input().split()))\r\nif n==1: print(\"YES\")\r\nelif n==2 and a[0]!=a[1]:\r\n print(\"YES\")\r\nelif n==2 and a[0]==a[1]:\r\n print(\"NO\")\r\nelse:\r\n og=(n+1)//2\r\n ak=[0]1001\r\n f=1\r\n for i in a:\r\n ak[i]+=1\r\n if ak[i]>og: f=0\r\n \r\n if f==1: print(\"YES\")\r\n else: print(\"NO\")\r\n\n# Fri Jan 07 2022 09:52:06 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\nL=[int(i) for i in input().split()]\r\nS=set(L)\r\nflag=0\r\nfor i in S:\r\n if L.count(i)>(n+1)//2:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import defaultdict\nfrom math import ceil\nn=int(input())\narray=list(map(int,input().split()))\nHashTable=defaultdict(int)\nfor i in array:\n\tHashTable[i]+=1\n\nmaxVal=max(HashTable.values())\nif ceil(n/2)>=maxVal:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nY=\"YES\"\r\nfor i in x:\r\n if x.count(i)2>n+1:\r\n Y=\"NO\"\r\nprint(Y)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in a:\r\n if a.count(i) * 2 > n + 1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = dict()\r\nmax = 0\r\nfor e in a:\r\n if not (e in d):\r\n d[e] = 0;\r\n d[e]+=1\r\n if d[e] > max:\r\n max = d[e]\r\nif max > (n+1)//2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "n = (int(input()) + 1) // 2\r\nt, p = input().split(), {}\r\nfor i in t:\r\n p[i] = p.get(i, 0) + 1\r\nprint('YNEOS'[max(p.values()) > n:: 2])\r\n ", "from collections import Counter\n\nprint(\n \"YES\"\n if int(input()) >= 2 * Counter(input().split()).most_common(1)[0][1] - 1\n else \"NO\"\n)\n", "#!/usr/bin/python3\n\nn = int(input())\na = list(map(int, input().split()))\nm = max(len([1 for w in a if w == v]) for v in a)\nif 2 * m <= n + 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfreq = {}\r\nfor x in a:\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\nmax_freq = max(freq.values())\r\n\r\nif max_freq <= (n + 1) // 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n n = int(input())\n elems = list(sorted(map(int, input().split(' '))))\n\n cnt = {}\n for x in elems:\n if x not in cnt:\n cnt[x] = 0\n cnt[x] += 1\n\n result = True\n for key, count in cnt.items():\n diff = n - count\n if n % 2 > 0:\n diff += 1\n if count > diff:\n result = False\n break\n\n print('YES' if result else 'NO')\n\n\nif __name__ == \"__main__\":\n main()\n", "counting = [0 for i in range(1003)]\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n counting[i]+=1\r\n\r\nif n%2 == 0:\r\n if(max(counting) > n//2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if(max(counting) > n//2+1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "from math import \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in set(l):\r\n if l.count(i)>int(ceil(n/2)):\r\n print('NO')\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n", "from collections import Counter\r\nfrom math import ceil\r\n\r\ninput()\r\nlistofint = input().split()\r\n\r\ncollectionofcounter = Counter(listofint)\r\nhalfoflen = ceil(len(listofint)/2)+1\r\n\r\n\r\nprint(\"YES\" if halfoflen > max(collectionofcounter.values()) else \"NO\")\r\n\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nm = defaultdict(lambda:0)\r\nt=0\r\nfor i in input().split():\r\n \r\n i = int(i)\r\n m[i]+=1\r\n t = max(t,m[i])\r\n\r\nif (t>(n+1)/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=input()\ns=input()\na=s.split()\nfor i in range(len(a)):\n a[i]=int(a[i])\nlength=len(a)\nmax=0\nfor i in a:\n c=a.count(i)\n if c>max:\n max=c\nif max-1>length-max:\n print('NO')\nelse:print('YES')\n\t \t\t\t\t \t\t \t\t\t \t\t \t\t \t\t\t \t\t", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\na=LI()\r\nd=Counter(a)\r\nb=(n+1)//2;flag=1\r\nfor i in d.keys():\r\n if d[i]>b:\r\n print(\"NO\");flag=0\r\n break\r\nif flag:\r\n print(\"YES\")\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax_ = max(arr, key = arr.count)\r\nprint(\"YES\" if(arr.count(max_) <= (n + 1) // 2) else \"NO\")", "n = int(input())\r\nlst = list( map(int, input().split()) )[:n]\r\ndic = {}\r\n\r\nfor x in lst:\r\n dic[x] = dic.get(x, 0) + 1\r\n\r\nmax_occur = 0\r\nfor (i, j) in dic.items():\r\n max_occur = max(max_occur, j)\r\n \r\nprint('YNEOS'[not max_occur<=int((n+1)/2)::2])\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nfreq = {}\n\n\nfor item in arr:\n\tif (item in freq):\n\t\tfreq[item] += 1\n\telse:\n\t\tfreq[item] = 1\n\nli = []\n\nfor key, value in freq.items():\n\tli.append(value)\n\nx = max(li)\ny = (n + 1) // 2\n\nif (x > y):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if a[i] in d:\r\n d[a[i]] += 1\r\n else:\r\n d[a[i]] = 1\r\n\r\nans = 'YES'\r\nfor k, v in d.items():\r\n if n % 2 == 0:\r\n if d[k] > n // 2:\r\n ans = 'NO'\r\n else:\r\n if d[k] > (n + 1) // 2:\r\n ans = 'NO'\r\n\r\nprint(ans) \r\n\r\n\r\n \r\n\r\n", "import math\r\ntry:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set(a)\r\n if n == 1:\r\n print(\"YES\")\r\n else:\r\n v = True\r\n for i in s:\r\n if a.count(i) > math.ceil(n/2):\r\n print(\"NO\")\r\n v = False\r\n if v:\r\n print(\"YES\")\r\nexcept:\r\n pass", "n=int(input())\r\narr=list(map(int,input().split()))\r\nset1=set(arr)\r\nlst=[]\r\nfor x in set1:\r\n\tc=arr.count(x)\r\n\tif c<=(n+1)/2:\r\n\t\tcond=True\r\n\telse:\r\n\t\tcond=False\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "from collections import defaultdict\r\nfrom math import ceil\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nd=defaultdict(int)\r\nfor i in arr:\r\n d[i]+=1\r\nflag=True\r\nm=int(ceil(n/2))\r\n#print(m)\r\nfor i in d.keys():\r\n if(d[i]>m):\r\n flag=False\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nif all([s.count(i)2-1<=n for i in s]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nimport math as m\r\n\r\nn = int(input())\r\na = arr_inp()\r\ndic = {}\r\nfor i in range(n):\r\n if (str(a[i]) not in dic):\r\n dic[str(a[i])] = 1\r\n else:\r\n dic[str(a[i])] += 1\r\n\r\nif (max(dic.values())> m.ceil(n / 2)):\r\n exit(print('NO'))\r\nprint('YES')\r\n", "from math import ceil\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = Counter(a)\r\nmaxi = max(d.values())\r\nif maxi<=ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nls = list(map(int,input().split(\" \")))\ndic = {}\nfor i in range(n):\n if ls[i] not in dic:\n dic[ls[i]] = 1\n else:\n dic[ls[i]]+=1\nif(n%2==1): n+=1\nc = 0\nfor k,v in dic.items():\n if v>n/2:\n c =1\n break\nif c == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nc=math.ceil(n/2)\r\nfor i in l:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nf=0\r\nfor i in d:\r\n\tif d[i]>c:\r\n\t\tf=1\r\n\t\tbreak\r\nprint([\"YES\",\"NO\"][f==1])", "dict = {}\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nma=1\r\nfor x in a:\r\n if x in dict:\r\n dict[x]+=1\r\n ma=max(ma,dict[x])\r\n else:\r\n dict[x]=1\r\nif ma<=(n+1)//2:print(\"YES\")\r\nelse:print(\"NO\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmx = 0\r\nfor i in arr:\r\n mx = max(mx, arr.count(i))\r\nprint('YES' if mx <= n // 2 + n % 2 else 'NO')\r\n", "n = int(input())\r\narray = list(map(int,input().split()))\r\n\r\ncnt = { i : array.count(i) for i in list(set(array))}\r\n\r\nsorted_array = sorted(list(cnt.items()), key = lambda x : x[1] ) \r\n\r\nm = sorted_array.pop()\r\n\r\npp = 0\r\nfor i in sorted_array :\r\n pp += i[1]\r\n\r\nif pp >= m[1] - 1 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n\r\n", "# LUOGU_RID: 102443147\nfrom collections import Counter\r\nn, a = map(int, open(0).read().split())\r\nprint(Counter(a).most_common()[0][1] <= (n + 1) // 2 and 'YES' or 'NO')", "import collections\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nd=collections.Counter(a)\r\n#print(d)\r\nflag=0\r\nif n%2==0:\r\n s=n//2\r\nelse:\r\n s=(n+1)//2\r\nfor i in a:\r\n if d[i]>s:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if d.get(i):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nmx=0\r\nfor i in d.keys():\r\n if mx<d[i]:\r\n mx=d[i]\r\nif n//2>=mx:\r\n print('YES')\r\nelse:\r\n if n%2!=0 and mx==(n//2)+1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n # 1 1 1 3 3", "#!/usr/bin/python3\n\nn = int(input())\na = map(int, input().split())\n\ncnt = dict()\nfor b in a:\n if b not in cnt:\n cnt[b] = 0\n cnt[b] += 1\n\nfor v in cnt.values():\n if v > (n + 1) // 2:\n print(\"NO\")\n exit(0)\n\nprint(\"YES\")\n", "n=int(input())\r\nl=input().split()\r\nprint(\"YES\" if all([l.count(i)2-1<=n for i in l]) else \"NO\")", "n = int(input())\r\narray=list(map(int,input().split()))\r\na__=[]\r\nfor i in array:\r\n a=0\r\n for j in range(n):\r\n if i==array[j]:\r\n a+=1\r\n a__.append(a)\r\nmax_=max(a__)\r\nif n%2==0:\r\n if n/2>=max_:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if n/2+1>=max_:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n =int (input())\r\nc=0\r\nll=list(map(int,input().split()))\r\nfor i in set(ll):\r\n temp=0\r\n for j in ll:\r\n if i==j:\r\n temp+=1\r\n\r\n if temp>c:\r\n c=temp \r\n \r\n\r\nprint( \"YES\" if n>=2c-1 else \"NO\")", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n#n<2count or n+1>=2count\r\nprint(\"YES\" if all([arr.count(i)2-1<=n for i in arr]) else \"NO\")\r\n", "n = int(input())\r\na = [int(val) for val in input().split()] \r\nrepo = {}\r\nfor ai in a:\r\n if ai in repo:\r\n repo[ai] += 1\r\n else:\r\n repo[ai] = 1\r\nmax_num = 0\r\nfor num in repo.values():\r\n if num > max_num:\r\n max_num = num\r\nif max_num * 2 - 1 > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn = int(input())\r\n#n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\n\r\nd = Counter(l)\r\nh = list(d.values())\r\nh.sort(reverse = True)\r\nif (n % 2 == 0 and h[0] <= n //2) or (n%2 != 0 and h[0] <= (n//2)+1 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def sol() :\r\n n = int(input())\r\n d = {}\r\n if n ==1:\r\n print('YES')\r\n return\r\n for i in input().split():\r\n num = int(i)\r\n if num not in d:\r\n d[num]=0\r\n d[num]+=1\r\n m = max(d.values())\r\n if m>((n+1)/2):\r\n print('NO')\r\n else:\r\n print('YES')\r\nsol()", "from collections import Counter \r\nn=int(input());t=(n+1)//2\r\nl=Counter(list(map(int,input().split())))\r\nif max(l.values()) > t:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nflag=1\r\nfor i in l:\r\n if (l.count(i)2)-1 > n:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import defaultdict\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfreq = defaultdict(int)\r\n\r\nT = True\r\nfor i in arr:\r\n\tfreq[i] += 1\r\n\tif freq[i] >= (n + 2 - 1) // 2 + 1:\r\n\t\tT = False\r\n\t\tbreak\r\nprint(\"YES\" if T else \"NO\")", "from math import ceil\r\ndef invert():\r\n n = int(input())\r\n numbers = list(map(int, input().split()))\r\n \r\n if n == 1:\r\n return \"YES\"\r\n set_numbers = set(numbers)\r\n count_numbers = []\r\n for number in set_numbers:\r\n count_numbers.append(numbers.count(number))\r\n max_count = max(count_numbers)\r\n if max_count > ceil(len(numbers)/2):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(invert())", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = set(a)\r\nb = list(b)\r\nsums = 0\r\nfor i in range(len(b)):\r\n sums = max(sums,a.count(b[i]))\r\nif n-sums<sums-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "import collections,math\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nd=collections.defaultdict(int)\r\nfor num in lst:\r\n d[num]+=1\r\nmaxi=0\r\nfor ele in d:\r\n if d[ele]>maxi:\r\n maxi=d[ele]\r\nif maxi<=math.ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nall = [0] max(s)\r\nfor i in range(n):\r\n all[s[i] - 1] += 1\r\nfl = True\r\nfor i in all:\r\n if i > (n + 1) / 2:\r\n fl = False\r\nif not fl:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\nl = list(map(int, input().split()))\nl_set = set(l)\n\nfor i in l_set:\n if n < 2l.count(i)-1:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\t \t\t\t \t\t \t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = [0](1001)\r\nfor i in l:\r\n x[i]+=1\r\nif max(x) <= ((n+1)//2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n\r\n\r\n", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\nres, cnt = None, Counter()\nfor i in a:\n cnt[i] += 1\n if not res or cnt[i] > cnt[res]:\n res = i\nres = \"YES\" if cnt[res] <= (n + 1) // 2 else \"NO\"\nprint(res)\n", "from collections import Counter\r\nn=int(input())\r\nc=Counter(input().split())\r\nlst=[]\r\nfor i in c:\r\n lst.append(c[i])\r\nlst.sort(reverse=True)\r\nif (len(lst)==1 and lst[0] >1) or lst[0]>sum(lst[1:])+1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na = list(map(int, input().split()))\r\ndi = {}\r\nfor i in range(n):\r\n di[a[i]] = di.get(a[i], 0) + 1\r\n\r\nif n % 2 == 0:\r\n for i in di.values():\r\n if i > n // 2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in di.values():\r\n if i > n // 2 + 1:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "import math\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nclst = Counter(lst)\r\n\r\nfor i in clst.values():\r\n if (i>math.ceil(n/2)):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "from math import ceil\n\nn = int(input())\narr = input().split()\ncan = True\n\nfor i in set(arr):\n if arr.count(i) > ceil(n / 2):\n can = False\n break\n \nprint(\"YES\") if can else print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Count the frequency of each integer in the array\r\nfreq = {}\r\nfor x in a:\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\n# Check if it's possible to obtain the required array\r\nmax_freq = max(freq.values())\r\nif max_freq > (n+1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def Yaroslav(n,arr):\r\n arr=sorted(arr)\r\n d={}\r\n for i in range(n):\r\n if arr[i] not in d:\r\n d[arr[i]]=1\r\n else:\r\n d[arr[i]]+=1\r\n C=max(d.values())\r\n if n>=(2C-1):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(Yaroslav(n,arr))", "import math\r\n\r\nn = int(input())\r\nelements = list(map(int, input().split()))\r\n\r\nresult = \"YES\"\r\n\r\nfor i in list(set(elements)):\r\n if elements.count(i) > math.ceil(len(elements)/2):\r\n result = \"NO\"\r\n\r\nprint(result)\r\n\r\n", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nd={}\r\nfor i in lst:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nma=0\r\nfor i in d:\r\n if d[i]>ma:\r\n ma=d[i]\r\nif n%2==0:\r\n if ma<=n//2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if ma<=(n//2)+1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=Counter(l)\r\na=1\r\nfor i in x:\r\n if x[i]>(n+1)//2:\r\n a=0\r\n break\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def num():\n return int(input())\n\ndef getnums():\n return map(int, input().split(' '))\n\ndef getstring():\n return input()\n\ndef yes():\n print(\"YES\")\n\ndef no():\n print(\"NO\")\n\nn = num()\na = getnums()\n\nm = {}\nfor i in a:\n m[i] = 1+m.get(i, 0)\n\nif(max(m.values()) <= (n+1)//2):\n yes()\nelse:\n no()", "n=int(input())\r\na=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if a[i] in dic:\r\n dic[a[i]]+=1\r\n else:\r\n dic[a[i]]=1\r\nmaxi=max(dic.values())\r\nif(maxi<=(n+1)//2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn = I()\r\nA = IL()\r\nmc = max([A.count(i) for i in set(A)])\r\nprint(\"YES\" if mc<=(n+1)//2 else \"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef main():\r\n n = int(input())\r\n arr = Iarr()\r\n for x in arr:\r\n cek = arr.count(x)\r\n if(cek2>n+1):\r\n ans = True\r\n break\r\n else:\r\n ans = False\r\n\r\n if(ans):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nif __name__ == '__main__':\r\n main()", "def f(square):\r\n if len(square)%2 == 0:\r\n for i in range(1,1001):\r\n if square.count(i) > len(square)/2:\r\n return \"NO\"\r\n else:\r\n for i in range(1,1001):\r\n if square.count(i) > (len(square)//2)+1:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\nn = int(input())\r\nsquare = input()\r\nsquare = [int(i) for i in square.split(\" \")]\r\nprint(f(square))", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\n\r\na = list(map(int, input().split(' ')))\r\ncounter=Counter(a)\r\n#print(counter.most_common()[0])\r\nif counter.most_common()[0][1] > math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input(''))\r\nb=input('')\r\nm=b.split(' ')\r\na=[]\r\nfor i in m:\r\n a.append(int(i))\r\nc=[]\r\nd=[]\r\nfor i in a:\r\n if i not in c:\r\n c.append(i)\r\n d.append(a.count(i))\r\n else:\r\n continue\r\nif n&1==1 and max(d)<=n//2+1:\r\n print(\"YES\")\r\nelif n&1==0 and max(d)<=n//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nc = Counter(x)\r\nif 2 * max(c.values()) > n + 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nprint(\"NO\" if any(s.count(i)>((n+1)//2) for i in s) else \"YES\")", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nfrom math import ceil\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\n\r\nif n==1:\r\n print('YES')\r\n exit()\r\n\r\nreq=ceil(n/2)\r\n\r\nfor i in set(L):\r\n if L.count(i)>req:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range (n):\r\n if(l[i] not in d):\r\n d[l[i]]=0\r\n d[l[i]]+=1\r\nl1=list(d.values())\r\nif(n%2==0):\r\n n=n//2\r\nelse:\r\n n=(n+1)//2\r\nc=0\r\nfor i in range (len(l1)):\r\n if(l1[i]>n):\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nn=int(input())\r\nA=input().split()\r\nB=set(A)\r\nif(n%2==0):\r\n limit=n//2\r\nelse:\r\n limit=n//2+1\r\nfor i in B:\r\n\r\n if A.count(i)>limit:\r\n print(\"NO\")\r\n sys.exit(0)\r\nprint(\"YES\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append(a.count(a[i]))\r\nprint(\"YES\") if(max(c)<=(n+1)/2) else print(\"NO\")", "n = int(input())\r\na = input().split()\r\nprint(\"YES\" if all(a.count(i)2-1 <= n for i in a) else \"NO\")", "\r\nimport statistics\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nans=statistics.mode(a)\r\nfor i in range(n):\r\n if a[i]==ans:\r\n k+=1\r\n\r\nh=n-k+1\r\nif k<=h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nfreq = 1000 [0]\r\nres = 0\r\nfor j in range(n):\r\n freq[nums[j] - 1] += 1\r\n res = max(res, freq[nums[j] - 1])\r\nimport math\r\nif n != 1 and res > math.ceil(n / 2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\narr=list(map(int,input().split()));d={}\r\nfor i in arr:d[i]=d.get(i,0)+1\r\nmaxx=0\r\nfor i in d:maxx=max(d[i],maxx)\r\nif n%2==0 and maxx>n//2:print(\"NO\")\r\nelif n%2==1 and maxx>n//2+1:print(\"NO\")\r\nelse:print(\"YES\")\r\n", " \r\n # static boolean visited[][]=new boolean[7][7];\r\n # static int ans=0;\r\n # public static void helper(int i, int j, int index, String s,int count) {\r\n \r\n # if(i<0 \|\| j<0 \|\| i>6 \|\| j>6)\r\n # return ;\r\n \r\n # if(i==6 && j==0) {\r\n # if(count==48)\r\n # ans+=1;\r\n # return;\r\n # }\r\n # if(visited[i][j])\r\n # return;\r\n \r\n # visited[i][j]=true;\r\n # if(s.charAt(index)=='?') {\r\n # helper(i,j-1,index+1,s,count+1);\r\n # helper(i,j+1,index+1,s,count+1);\r\n # helper(i-1,j,index+1,s,count+1);\r\n # helper(i+1,j,index+1,s,count+1);\r\n \r\n # }\r\n # else if(s.charAt(index)=='L')\r\n # helper(i,j-1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='R')\r\n # helper(i,j+1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='U')\r\n # helper(i-1,j,index+1,s,count+1);\r\n # else\r\n # helper(i+1,j,index+1,s,count+1);\r\n # visited[i][j]=false;\r\n \r\n \r\n \r\n # }\r\n\r\nn=int(input())\r\narr=list(map(int, input().split()))\r\nfreq_arr=[0](1001)\r\n\r\nfor i in arr:\r\n freq_arr[i]+=1\r\n\r\nm=0\r\nfor i in freq_arr:\r\n m=max(m,i)\r\na=-1\r\nif(n%2==0):\r\n a=n//2\r\nelse:\r\n a=(n+1)//2\r\nif(m>a):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "\r\nnum = int(input())\r\ndata = list(map(int, input().split()))\r\ncount = data.count(data[0])\r\nfor i in range(num):\r\n y = data.count(data[i])\r\n if y >= count:\r\n count = y\r\n\r\nif count <= (num + 1) / 2:\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "import collections\nde = collections.deque([])\nn = int(input())\nde = [int(x) for x in input().split()]\na = [val for val in set(de)]\nb = []\ntotal = 0\nfor i in a:\n b.append(de.count(i))\n total += de.count(i)\n\nif total - max(b) >= max(b)-1:\n print(\"YES\") \nelse:\n print(\"NO\") ", "n = int(input())\r\na = [int(x) for x in (input().split())]\r\nls = []\r\nstat = 'YES'\r\n\r\n\r\nfor i in a:\r\n\tif not a.count(i) <= (n + 1) / 2:\r\n\t\tstat = ('NO')\r\n\t\tbreak\r\n\r\nprint(stat)", "n=int(input())\r\nif n==1:\r\n print('YES' )\r\n exit()\r\n\r\ncont=[]\r\nf=''\r\nls=input().split()\r\nls=list(map(int,ls))\r\nfor i in range(len(ls)):\r\n if f.find(str(ls[i]))==-1 :\r\n f+=str(ls[i])\r\n cont.append(ls.count(ls[i]))\r\n\r\nf=True\r\nfor i in range(len(cont)):\r\n if n < 2cont[i]-1:\r\n f=False\r\nif f: print('YES')\r\nelse: print('NO') ", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n# def solve(key, seen, arr):\r\n# for i in range(10):\r\n# key[-1] = str(i)\r\n# # print(key)\r\n# if (key not in seen) and (key not in arr):\r\n# return key\r\n\r\nnum = int(input())\r\ncom = Counter(map(int, input().split())).most_common()[0][1]\r\n\r\nif com > num - com +1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nprint(\"YES\"if all([s.count(i)2-1<=n for i in s])else\"NO\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = Counter(a)\r\n\r\nif max(cnt.values()) > (n + 1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\nnums=eval(input())\nlist=input().split()\nmax1=0\nfor i in list:\n if max1<list.count(i):\n max1=list.count(i)\nif max1>math.ceil((len(list)/2)):\n print(\"NO\")\nelse :print(\"YES\")\n\n\t\t\t \t\t \t\t \t \t \t\t \t", "\r\n\r\nif __name__==\"__main__\":\r\n \r\n n=int(input())\r\n li=list(map(int,input().split(\" \")))\r\n ma=max(li)\r\n lis=[0 for x in range(ma+1)]\r\n z=-1\r\n for i in range(0,n):\r\n lis[li[i]]+=1\r\n if(lis[li[i]])>((n+1)/2):\r\n z=0\r\n break\r\n if(z==-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "def INT():\r\n return int(input())\r\n\r\ndef lis():\r\n return [int(x) for x in input().split()]\r\n \r\nn = INT()\r\ncheck = (n+2-1)//2\r\na = lis()\r\nb = set(a)\r\nflag=0\r\nfor i in b:\r\n if a.count(i)>check:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nn=int(input())\r\n\r\na=sorted(map(int,input().split()))\r\nc=Counter(a)\r\nif n==1:\r\n print('YES')\r\nelse:\r\n \r\n ok=True\r\n for _,freq in c.items():\r\n if freq>(n+1)//2:\r\n ok=False\r\n break\r\n if ok:\r\n print('YES')\r\n else:\r\n print('NO')", "import statistics\r\nfrom statistics import mode\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=mode(b)\r\nd=b.count(c)\r\nif (a+1)//2>=d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n s=list(set(a))\r\n for i in s:\r\n if a.count(i)>((n+1)//2):\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\") \r\n\r\n ", "import math\r\n\r\nn = int(input())\r\n\r\narr = input()\r\nl = list(map(int,arr.split(' ')))\r\nhashmap = {}\r\nfor i in l:\r\n if i in hashmap:\r\n hashmap[i] = hashmap[i]+1\r\n else:\r\n hashmap[i] = 1\r\n\r\nflag = False\r\nfor key in hashmap:\r\n if hashmap[key] > math.ceil(n/2.0):\r\n flag = True\r\n \r\nif flag == True:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\tarr = list(map(int,input().split()))\r\n\tcnt = 1 \r\n\tmax_cnt = 0\r\n\ti = 0\r\n\tdp = [0 for _ in range(1001)]\r\n\tfor x in arr:\r\n\t\tdp[x]+=1\r\n\tmax_cnt = max(dp)\r\n\tif max_cnt<=((N+1)//2):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nmain()", "n=int(input())\r\nl=list(input().split())\r\nans=\"YES\"\r\nfor i in l:\r\n if l.count(i)2-1>n :\r\n ans=\"NO\"\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i,0) + 1\r\nfor i in d:\r\n if d[i] > (n+1) // 2 :print(\"NO\"); break\r\nelse:print(\"YES\")", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nmx=max([a.count(x) for x in set(a)])\r\nif n-mx>=mx-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nfrq=[0]1001\r\nm=0\r\nfor i in nums:\r\n frq[i]+=1\r\n ## that's max\r\n if frq[i]>m:m=frq[i]\r\n\r\n\r\nif m>n//2+(n&1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n \r\n\r\n", "import sys\r\nz=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in set(x):\r\n c = x.count(i)\r\n if z < 2c-1 :\r\n print('NO')\r\n sys.exit(0)\r\nprint(\"YES\") \r\n", "n=int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncont=1; mx_cont=1\r\nfor i in range(1, n):\r\n if arr[i]==arr[i-1]:\r\n cont+=1\r\n mx_cont = max(mx_cont, cont)\r\n else:\r\n cont=1\r\n\r\nprint(\"YES\" if mx_cont<=(n+1)//2 else \"NO\")", "n = int(input())\r\nA = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if A[i] not in d.keys(): d[A[i]] = 1\r\n else: d[A[i]] +=1\r\nif n % 2 != 0:\r\n cmp = n // 2 + 1\r\nelse: cmp = n // 2\r\n\r\nif (max(d.values()) > cmp):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import Counter\r\nn=int(input())\r\na=[map(int,input().split())]\r\nd=Counter(a)\r\nans='YES'\r\nfor i in d.values():\r\n if i>-(-n//2):ans='NO'\r\nprint(ans)", "n=int(input())\na=input().split()\nmaxNum=0\nfor i in a:\n count=0\n for j in a:\n if i==j:\n count+=1\n if maxNum<count:\n maxNum=count\nif len(a)%2==0:\n if maxNum<=len(a)/2:print('YES')\n else:print('NO')\nelse:\n if maxNum<=(len(a)+1)/2:print('YES')\n else:print('NO')\n \t \t \t\t \t\t\t \t\t\t \t\t\t\t\t\t\t \t", "import collections\r\nn=int(input())\r\nl=list(map(int,input().strip().split()))\r\nd={}\r\nc=collections.Counter(l)\r\nk=c.most_common(1)\r\nif n//2<=(n-k[0][1]):print('YES')\r\nelse:print('NO')", "def distinct_elements(a,n):\r\n\tfreq = dict()\r\n\r\n\tfor i in range(n):\r\n\t\tif a[i] in freq:\r\n\t\t\tfreq[a[i]] += 1\r\n\t\telse:\r\n\t\t\tfreq[a[i]] = 1\r\n\r\n\tmax_occur = 0\r\n\tfor i in range(n):\r\n\t\tif max_occur < freq[a[i]]:\r\n\t\t\tmax_occur = freq[a[i]]\r\n\r\n\treturn max_occur\r\n\r\nn = int(input())\r\na = input().split()\r\nmax_occur_freq = distinct_elements(a,n)\r\nif max_occur_freq > ((n + 1) // 2):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif n==1:\r\n print('YES')\r\nelif n==2:\r\n print('YES' if l[0]!=l[1] else 'NO')\r\nelse:\r\n f=1\r\n from collections import Counter\r\n c=Counter(l)\r\n for i in c:\r\n if n&1:\r\n k=n//2 \r\n if c[i]>k+1:\r\n f=0\r\n break\r\n else:\r\n k=n//2 \r\n if c[i]>k:\r\n f=0\r\n break\r\n print('YES' if f else 'NO')\r\n ", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\nn= (map(int, input().split()))\r\n\r\n\r\na = list(map(int, input().split()))\r\n\r\ncount = 1\r\n\r\na. sort()\r\nmax_ = 0\r\nfor i in range(1, len(a)):\r\n if(a[i-1]==a[i]):\r\n count += 1\r\n else:\r\n count = 1\r\n max_ = max(max_, count)\r\n\r\nif(len(a)%2):\r\n size = len(a) + 1\r\nelse:\r\n size = len(a)\r\nif(max_<=size//2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nf = {}\r\nfor num in nums:\r\n f[num] = f.get(num,0) + 1\r\n \r\nmaxf = max(f.values())\r\nif maxf 2 - 1 <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def func():\n from collections import Counter\n n = int(input())\n if n == 1:\n return True\n arr = list(map(int, input().split()))\n c = Counter(arr)\n for _, count in c.most_common():\n if count >= n / 2 + 1:\n return False\n return True\n\nprint(\"YES\" if func() else \"NO\")", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint('YES' if all(a.count(i)2-1 <=n for i in a) else 'NO')\r\n", "import math\r\nn=int(input())\r\nx=input().split()\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\nc={}\r\nfor k in x:\r\n if k not in c:\r\n c[k]=1\r\n else:\r\n c[k]+=1\r\ncount=0\r\nfor key,value in c.items():\r\n if value>math.ceil(n/2):\r\n print('NO')\r\n break\r\n else:\r\n count+=1\r\nif count==len(c):\r\n print('YES')\r\n\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if(arr[i] in dic.keys()):\r\n dic[arr[i]]+=1\r\n else:\r\n dic[arr[i]]= 1\r\n\r\nmax1=0\r\nfor i in dic.keys():\r\n if(dic[i]>max1):\r\n max1=dic[i]\r\n\r\nif(n%2==0):\r\n if(max1>n//2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nelse:\r\n if(max1>n//2 +1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "def num_check(num_list, num_cnt):\r\n global flag\r\n global list_of_numbers\r\n \r\n num_list = num_list.split(' ')\r\n if len(num_list) != num_cnt:\r\n print('\\nNumber list out of bounds. Expected {} numbers.'.format(num_cnt))\r\n return\r\n for i in num_list:\r\n if '.' in i:\r\n print('\\nEnter an integer.\\n')\r\n return\r\n try:\r\n num = int(i)\r\n if num not in list_of_numbers.keys():\r\n list_of_numbers[num] = 1\r\n else:\r\n list_of_numbers[num] += 1\r\n except:\r\n if i != ' ':\r\n print('\\nEnter the numbers separated by a space.')\r\n return\r\n else:\r\n pass\r\n flag = 1\r\n \r\ndef selection_sort():\r\n global list_of_numbers\r\n \r\n list_of_numbers = list(list_of_numbers.items())\r\n for i in range(len(list_of_numbers)-1):\r\n for j in range(i+1, len(list_of_numbers)):\r\n if list_of_numbers[i][1] < list_of_numbers[j][1]:\r\n list_of_numbers[j], list_of_numbers[i] = list_of_numbers[i], list_of_numbers[j]\r\n\r\nif __name__ == '__main__':\r\n flag = 0\r\n list_of_numbers = {}\r\n num_cnt = int(input())\r\n while flag == 0:\r\n num_list = input()\r\n num_check(num_list, num_cnt)\r\n selection_sort()\r\n \r\n highest_freq = list_of_numbers[0][1]\r\n if num_cnt-highest_freq >= round(num_cnt//2):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nneed = n // 2\r\nif n % 2 != 0:\r\n\tneed += 1\r\nmax_cnt = 0\r\nfor el in set(lst):\r\n\tmax_cnt = max(lst.count(el), max_cnt)\r\nif max_cnt > need:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "import math\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans=[]\r\ncount=1\r\nfor i in range(0,len(a)-1):\r\n if a[i]==a[i+1]:\r\n count+=1\r\n else:\r\n ans.append(count)\r\n count=1\r\nans.append(count)\r\nif n==1:\r\n print(\"YES\")\r\nelif max(ans)>math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nif(n == 1):\r\n\tprint('YES')\r\ns = input().split()\r\ns = [int(i) for i in s]\r\na = {}\r\nif(n>=2):\r\n\tfor i in range(n):\r\n\t\tif(s[i] not in a.keys()):\r\n\t\t\ta[s[i]] = 1\r\n\t\telse:\r\n\t\t\ta[s[i]] += 1\r\n\r\n\tflag = 0\r\n\tfor i in a.keys():\r\n\t\tif(a[i] > (n+1)//2):\r\n\t\t\tprint('NO')\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif(flag == 0):\r\n\t\tprint('YES')\r\n", "\r\n# Problem: A. Yaroslav and Permutations\r\n# Contest: Codeforces - Codeforces Round #179 (Div. 2)\r\n# URL: https://codeforces.com/contest/296/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\nimport math\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\narr = get_ints()\r\nflag = True\r\nfor i in arr:\r\n\tif arr.count(i) > math.ceil(n/2):\r\n\t\tprint(\"NO\")\r\n\t\tflag =False\r\n\t\tbreak\r\n\r\nif flag:\r\n\tprint(\"YES\")", "def main():\n n = int(input())\n nums = list(map(int, input().split(' ')))\n m = {}\n for num in nums:\n if num in m:\n m[num] += 1\n else:\n m[num] = 1\n for num in nums:\n if m[num] > (n + 1)//2:\n return False\n return True\n\n\nprint(\"YES\") if main() else print(\"NO\")\n", "y=int(input())\r\narray=list(map(int,input().split()))\r\ncount=0\r\nfor i in array:\r\n x=array.count(i)\r\n if x+x-1>len(array):\r\n print('NO')\r\n count+=1\r\n break\r\nif count==0:\r\n print('YES')", "from collections import Counter\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nn = (n + 1) // 2\r\nd=Counter(arr)\r\nfor val in d.values():\r\n if val>n:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")", "from collections import defaultdict\r\nimport operator\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\nocc = defaultdict(lambda: 0)\r\n\r\nfor i in arr:\r\n occ[i] += 1\r\n\r\nMaxValue = max(occ.items(), key=operator.itemgetter(1))[1]\r\nprint('YES' if MaxValue <= (n+1)//2 else 'NO')\r\n", "from collections import Counter\nn = int(input())\nlst = [int(x) for x in input().split()]\nc = Counter(lst)\nprint (\"YES\" if c.most_common(1)[0][1] 2 - 1 <= n else \"NO\")\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nunique = set(l)\r\nflag = 1\r\nfor i in unique:\r\n if (l.count(i)2)-1 > n:\r\n flag = 0\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nelementsMap = Counter(map(int,input().split()))\r\n\r\nfor element,count in elementsMap.items():\r\n\r\n if count > ((n+1) / 2):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "from collections import Counter\r\ndef solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n if n==1:\r\n print(\"YES\")\r\n return\r\n d=Counter(l)\r\n x=max(d.values())\r\n if x<=n-x+1:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nsolve()\r\n", "from math import ceil\r\n\r\nn = int(input().strip())\r\nlst = list(map(int, input().strip().split()))\r\ncount_lst = []\r\nlst.sort()\r\ni = 0\r\nwhile i < n:\r\n count = lst.count(lst[i])\r\n count_lst.append(count)\r\n i += count\r\nmax_count = max(count_lst)\r\nif max_count > ceil(n / 2):\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\na = math.ceil(int(input())/2)\r\nb = list(map(int,input().split()))\r\nc = set(b)\r\nif len(b)>=2:\r\n if any(b.count(i)>a for i in c):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print('YES')", "def Yaroslav_and_Permutations():\r\n n = int(input())\r\n sequence = list(map(int,input().split()))\r\n\r\n freqCount_dict = {}\r\n\r\n for i in sequence:\r\n if i in freqCount_dict.keys():\r\n freqCount_dict[i] += 1\r\n else:\r\n freqCount_dict[i] = 1\r\n\r\n max_count = 0\r\n for i in freqCount_dict.keys():\r\n if freqCount_dict[i] > max_count:\r\n max_count = freqCount_dict[i]\r\n\r\n if n%2 == 0:\r\n if max_count > n//2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n if max_count > ((n//2) + 1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nYaroslav_and_Permutations()", "n=int(input())\r\nlist1=map(int,input().split())\r\nhash_map={}\r\nfor i in list1:\r\n if i not in hash_map:\r\n hash_map[i]=1\r\n else:\r\n hash_map[i]+=1\r\nflag=0\r\nfor i in hash_map:\r\n if hash_map[i]2-1<=n:\r\n continue\r\n else:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nq = [0] * 1005\r\nf = 1\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n q[a[i]] += 1\r\n if q[a[i]] > n // 2 + (n % 2):\r\n f = 0\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nlc = Counter(l)\r\nlcm = max(lc.items(), key=lambda x: x[1])\r\n\r\nif lcm[1]2-1 <= n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\r\n\tcount={}\r\n\tfor i in arr:\r\n\t\tif i not in count:\r\n\t\t\tcount[i]=1\r\n\t\telse:\r\n\t\t\tcount[i]+=1\r\n\r\n\tmaxi=n/2\r\n\tif int(maxi)!=maxi:\r\n\t\tmaxi=int(maxi)+1\r\n\tmx=0\r\n\tfor i in count:\r\n\t\tmx=max(mx, count[i])\r\n\tif mx<=maxi:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()\r\n", "n, a = int(input()), map(int, input().split())\r\nh = n // 2 + 1 + n % 2\r\nm = {}\r\nfor x in a:\r\n if x in m:\r\n m[x] += 1\r\n else:\r\n m[x] = 1\r\nprint(\"YES\" if max(m.values()) < h else \"NO\")", "import collections as coll\r\nn, seq = int(input()), coll.Counter(map(int,input().split(\" \")))\r\nx = seq.most_common(1)[0][1]\r\nif n % 2 == 0:\r\n if x >= (n / 2) + 1:\r\n print(\"NO\")\r\n else: print(\"YES\")\r\nelif n % 2 != 0:\r\n if x >= (n // 2) + 2:\r\n print(\"NO\")\r\n else: print(\"YES\")\r\n\r\n\r\n''' \r\n\r\n\r\nIdea:\r\nIf one number among our sequence is set on at least (size / 2) + 1 places\r\nit means that we cannot divide her placement even every second\r\nposition. There must be at least one place where her neighbor is \r\nthe same number. Other half of numbers could be different or the same\r\ndoesn't matter at this point. But maybe further the question appears,\r\nare we able to get an example when even without such situations \r\nwe still cannot satisfy the condition of our permutation.\r\nThis is true for even amount of elements.\r\nOdd amount of elements:\r\nIf one elements appears more or equal times to (size // 2) + 2. (NO)\r\n(Chodzi tutaj o to chyba zeby na kazda pare liczb takich samych \r\nprzypadala jedna ktora je rodziela)\r\n\r\ncheck:\r\n7 7 2 1 -> 2 7 1 7\r\n7 7 2 2 -> 7 2 7 2\r\n7 7 7 1 -> 1 (7 7).. X\r\n7 7 4 5 8 -> 7 4 7 5 8\r\n7 7 7 1 1 -> 7 1 7 1 7 7\r\n7 7 7 7 3 4 6 -> 7 3 7 4 7 6 7\r\n\r\n'''\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nk=[0 for x in range(1001)]\r\nfor x in range(n):\r\n k[ar[x]]+=1 \r\nv=max(k)\r\noth=n-v\r\nif oth>=v-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(n):\r\n d = dict()\r\n for i in input().split():\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n if n%2:\r\n n += 1\r\n for i in d.values():\r\n if i > n//2:\r\n print(\"NO\"); break\r\n else:\r\n print(\"YES\")\r\n\r\ndef main():\r\n solve(int(input()))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import heapq\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor num in arr:\r\n if num not in d:\r\n d[num] = 0\r\n d[num] += 1\r\n\r\nmaxHeap = []\r\nfor index in d:\r\n count = d[index]\r\n heapq.heappush(maxHeap, (-count, index))\r\n\r\nans = \"YES\"\r\ncoolDown = []\r\nt = 1\r\nwhile maxHeap or coolDown:\r\n while coolDown and coolDown[0][0] == t:\r\n count, num = coolDown[0][1], coolDown[0][2]\r\n coolDown.pop(0)\r\n heapq.heappush(maxHeap, (-count, num))\r\n if not maxHeap:\r\n ans = \"NO\"\r\n break\r\n count, frequent_num = maxHeap[0]\r\n count = -count\r\n heapq.heappop(maxHeap)\r\n if count - 1 >= 1:\r\n coolDown.append([t+2, count-1, frequent_num])\r\n t += 1\r\nprint(ans)\r\n\r\n", "from math import ceil\r\nn = int(input())\r\na = input().split()\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i, 0)+1\r\nfor i in d:\r\n if d[i] > ceil(n/2):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\nfreq = defaultdict(int)\r\nli = []\r\nfor _ in input().split():\r\n\tfreq[int(_)] += 1\r\n\tli.append(int(_))\r\n\r\n\r\nif n == 1:\r\n\tprint('YES')\r\n\texit()\r\n\r\nelse:\r\n\tm = 0\r\n\tfor i in freq:\r\n\t\tif freq[i] > (n+1)//2:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n\tprint('YES') \r\n ", "from math import \r\nfrom collections import \r\nfrom sys import \r\nimport string\r\nimport re\r\nt=stdin.readline\r\np=stdout.write\r\ndef GI(): return map(int, t().strip().split())\r\ndef GS(): return map(str, t().strip().split())\r\ndef IL(): return list(map(int, t().strip().split()))\r\ndef SL(): return list(map(str, t().strip().split()))\r\n\r\nn=int(t())\r\na=IL()\r\nb=(n+1)//2\r\nf=1\r\nfor i in set(a):\r\n if a.count(i)>b: f=0;print('NO');break\r\nif f: p('YES\\n')\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nunique = set(nums)\r\n\r\nfor num in unique:\r\n\tif nums.count(num) > (n+1)/2:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=[0]1000\r\nfor i in range(n):\r\n l1[l[i]-1]+=1\r\nj=max(l1)\r\ns=0\r\nc=0\r\nfor i in range(1000):\r\n if(l1[i]==j and c==0):\r\n k=i\r\n c=1\r\n continue\r\n else:\r\n s+=l1[i]\r\nif(l1[k]>=s+2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import \r\nhash=[0]1001\r\nn=int(input())\r\np=1\r\nnumbers=list(map(int,input().split()))\r\nfor i in range(0,len(numbers),1):\r\n hash[numbers[i]]+=1\r\nnum=ceil(n/2)\r\nfor i in range(0,len(hash),1):\r\n if hash[i]>num:\r\n p=0\r\n break\r\nif p==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nflag = 1\r\nfor i in set(l):\r\n \r\n if n%2 == 0 and l.count(i) > n//2 :\r\n print('NO')\r\n flag =0\r\n break\r\n elif n%2 != 0 and l.count(i) > n//2+1 :\r\n print('NO')\r\n flag = 0\r\n break\r\nif (flag == 1):\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nif n == 1:\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n for i in a:\r\n if a.count(i)>math.ceil(n/2):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nm = list(map(int,input().split()))\r\nm1 = set(m)\r\nif len(m)%2 == 0 :\r\n s = len(m)//2\r\nelse:\r\n s = len(m)//2 +1\r\n\r\nif len(m) != 1 :\r\n\r\n for i in m1:\r\n if m.count(i) > s:\r\n print('NO')\r\n break\r\n elif m.count(i) == len(m):\r\n print(\"NO\")\r\n break\r\n else:\r\n print('YES')\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn = int(input())\r\nstuff = Counter(input().split())\r\nspace = (n-1)//2\r\nprint (\"YNEOS\"[stuff.most_common()[0][1]-1 > space::2])\r\n", "def a():\r\n n = int(input())\r\n array = [int(x) for x in input().split()]\r\n\r\n import math \r\n n2 = math.ceil(n / 2)\r\n\r\n for elemnet in set(array):\r\n if array.count(elemnet) > n2:\r\n return \"NO\"\r\n return \"YES\"\r\nprint(a())", "import heapq\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor num in arr:\r\n if num not in d:\r\n d[num] = 0\r\n d[num] += 1\r\n\r\nfrequent = max(d.values())\r\nif frequent > (n+1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def solve():\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n y = dict()\r\n\r\n for i in x:\r\n if i in y:\r\n y[i] += 1\r\n else:\r\n y[i] = 1\r\n \r\n for i in y:\r\n if (y[i]-1) > (n-y[i]):\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "\r\nn = int(input())\r\ns = input().split()\r\nprint('YES' if all([s.count(i)2-1 <= n for i in s ]) else \"NO\")\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nd=Counter(a)\r\nm=1\r\nif n%2==0:h=n//2\r\nelse:h=n//2+1\r\nfor x in d:\r\n if d[x]>m:m=d[x]\r\nif m<=h:print(\"YES\")\r\nelse:print(\"NO\")", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n = int(input())\n for count in Counter(input().split()).values():\n if count > (n+1) // 2:\n print('NO')\n break\n else:\n print('YES')\n\nmain()\n", "n = int(input())\ns = list(map(int, input().rstrip().split()))\nif all(s.count(i) * 2 - 1 <= n for i in s):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "c={}\r\nn=-(-int(input())//2)\r\nb=1\r\nfor i in map(int,input().split()):\r\n if i not in c:\r\n c[i]=1\r\n else:\r\n c[i]+=1\r\n if c[i]>n:\r\n b=0\r\nprint([\"NO\",\"YES\"][b])", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ndef main() : \r\n t = int(input())\r\n test = True\r\n arr = list(map(int,input().strip().split()))\r\n if t == 1 :\r\n print('YES')\r\n else : \r\n d = dict()\r\n for i in arr :\r\n if i in d :\r\n d[i] += 1\r\n else :\r\n d[i] = 1\r\n for i in d :\r\n if d[i] > math.ceil(t/2) :\r\n print('NO')\r\n test = False\r\n break\r\n if test :\r\n print('YES') \r\n \r\nmain()", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\nfor i in l1:\r\n if l1.count(i)>(n+1)//2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "def solve(arr,n):\r\n if n==1:\r\n return 'YES'\r\n if n==2:\r\n if arr[0]==arr[1]:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n\r\n rec = dict()\r\n for i in range(n):\r\n if arr[i] not in rec:\r\n rec[arr[i]] = 1\r\n else:\r\n rec[arr[i]] += 1\r\n\r\n for k,v in rec.items():\r\n if n%2==0 and v>n/2:\r\n return 'NO'\r\n if n%2!=0 and v>(n/2+1):\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nprint(solve(arr,n))", "#A. Yaroslav and Permutations\r\nfrom math import ceil\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nif n==1:\r\n print('YES')\r\nelse:\r\n d = dict()\r\n for i in a:\r\n if i not in d:\r\n d[i] = 0\r\n d[i] += 1\r\n flag = True\r\n for k,v in d.items():\r\n if v>ceil(n/2):\r\n flag = False\r\n break\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\narr = list(map(int, input().split()))\ncont = list(map(lambda x: arr.count(x), arr))\nmax_cont = max(cont)\nif max_cont <= (n + 1) / 2:\n print('YES')\nelse:\n print('NO')\n\t\t\t\t\t \t \t\t\t\t \t\t \t \t", "t=int(input())\r\nl=list(map(int,input().split()))\r\ncheck=True\r\nfor i in l:\r\n if (l.count(i)2)-1>t:\r\n check=False\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import ceil\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nz = []\r\ny = list(set(x))\r\nfor i in range(0, len(y)):\r\n z.append(x.count(y[i]))\r\nif max(z) <= int(ceil(n/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nresult = True\r\nif n % 2 == 1:\r\n for i in range(n):\r\n if l.count(l[i]) > n//2+1:\r\n result = False\r\n break\r\nelse:\r\n for i in range(n):\r\n if l.count(l[i]) > n//2:\r\n result = False\r\n break\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\nflag = True\r\nfor i in nums:\r\n len_i = nums.count(i)\r\n len_other = len(nums) - len_i\r\n if len_i - len_other > 1:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndic = {}\r\narr = list(map(int , input().split()))\r\nfor i in arr :\r\n try :\r\n dic[i]+=1\r\n except:\r\n dic[i]=1\r\nfor i,j in dic.items() :\r\n if j > (n+1)/2 :\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "n = int(input())\r\nnum = [int(x) for x in input().split()]\r\nc = 1\r\nif len(num) == 1:\r\n print(\"YES\")\r\nelse:\r\n for i in set(num):\r\n if 2 num.count(i) - len(num) > 1:\r\n c = 0\r\n print(\"YES\" if c == 1 else \"NO\")\r\n", "n = int(input())\nnums = list(map(int,input().split()))\n# nums = [354,356,352,355,355,355,352,354,354,352,355,356,355,352,354,356,354,355,355,354,353,352,352,355,355,356,352,352,353,356,352,353,354,352,355,352,353,353,353,354,353,354,354,353,356,353,353,354,354,354,354,353,352,353,355,356,356,352,356,354,353,352,355,354,356,356,356,354,354,356,354,355,354,355,353,352,354,355,352,355,355,354,356,353,353,352,356,352,353]\n\nfrequencies = {}\n\nfor num in nums:\n frequencies[num] = frequencies.get(num,0) +1\nfrlst = list(frequencies.items())\nfrlst.sort(key= lambda x:x[1])\nlarge = frlst[-1][1]\nif sum(map(lambda x : x[1],frlst[:-1])) >= large-1 :\n print('YES')\nelse :\n print('NO')", "#52 Yaroslav and Permutations\r\nimport collections as col\r\nn = int(input())\r\nlst = list(map(int, input().split(' ')))\r\nd = dict(col.Counter(lst))\r\nc = list(d.values())\r\nflag = True\r\nfor i in c:\r\n if i > ((n+1)/2):\r\n print('NO')\r\n flag = False\r\n\r\nif flag:\r\n print('YES')\r\n", "import collections\r\nif __name__ == \"__main__\":\r\n\tn = int(input())\r\n\tnumber = [int(x) for x in input().split(' ')]\r\n\tnumber = collections.Counter(number)\r\n\tif n % 2 == 0:\r\n\t\tif all(x <= n // 2 for x in number.values()):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\telse:\r\n\t\tif all(x <= n // 2 + 1 for x in number.values()):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")", "x = int(input())\r\ny = list(map(int, input().split(' ')))\r\nc = []\r\nfor i in y:\r\n c.append(y.count(i))\r\nm = max(c)\r\nif m > (x +1) / 2:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "# your code goes here\r\nn=int(input())\r\nnum=map(int,input().split())\r\nfrom collections import Counter\r\nfreq=Counter(num)\r\nmaximum=0\r\nfor i in freq:\r\n\tif(maximum<freq[i]):\r\n\t\tmaximum=freq[i]\r\nif(maximum <=((n+1)//2)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nd = {}\r\nfor el in map(int, input().split()):\r\n d[el] = d.get(el, 0) + 1\r\nx = max(d.values())\r\nif x > (n + 1) // 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\na1=[0]1000\r\nfor item in l1:\r\n a1[item-1]+=1\r\nif max(a1)>(n+1)//2:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "import collections,math\r\nx=int(input())\r\nz=input().split(\" \")\r\nelements_count = collections.Counter(z)\r\ndo=False\r\nfor key, value in elements_count.items():\r\n if value> math.ceil(x/2):\r\n do=True\r\n break\r\n\r\nif do:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if l[i] not in d:\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]=d[l[i]]+1\r\nall_values = d.values()\r\nmax_value = max(all_values)\r\nif(max_value>(n+1)//2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr=Counter(arr)\r\nb=[]\r\nfor i in arr:\r\n b.append(arr[i])\r\nb.sort(reverse=True)\r\nfor i in range(1,len(b)):\r\n b[0]-=b[i]\r\nif b[0]<2:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n ", "import math\r\nn=int(input())\r\nD={}\r\nlt=list(input().split())\r\nfor i in lt:\r\n if i in D:\r\n D[i]+=1\r\n else:\r\n D[i]=1\r\nif n%2==0:\r\n if max(D.values())<=n/2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if max(D.values())<=math.ceil(n/2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#code\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\n\r\nfor i in b:\r\n cb=0\r\n for j in a:\r\n if j==i:\r\n cb+=1;\r\n if (n%2==1 and cb>(n/2)+1) or (n%2==0 and cb>n/2):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "x = int(input())\r\na = list(map(int,input().split()))\r\nr = list(set(a))\r\nk = 0\r\nif x%2 == 1:\r\n\tt = x//2+1\r\nelse:\r\n\tt = x//2\r\n\r\nfor i in range(len(r)):\r\n\tr1 = a.count(r[i])\r\n\tif r1 > t:\r\n\t\tprint(\"NO\")\r\n\t\tk = 1\r\n\t\tbreak\r\nif k == 0:\r\n\tprint(\"YES\")", "n = int(input())\r\n\r\nmax_count = n//2\r\nif n % 2:\r\n max_count += 1\r\n \r\ncounter = {}\r\nfor ch in input().split():\r\n counter[ch] = counter.get(ch, 0) + 1\r\n if counter[ch] > max_count:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nnums = input().split(\" \")\r\nif n == 1:\r\n print(\"YES\")\r\nelif max(nums) == min(nums):\r\n print(\"NO\")\r\nelse:\r\n duplicate = []\r\n for i in nums:\r\n duplicate.append(nums.count(i))\r\n\r\n if n % 2 == 0:\r\n if max(duplicate) > n / 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n if max(duplicate) > (n / 2) + 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "def main():\n n = int(input())\n l = [-2] 1001\n for x in map(int, input().split()):\n l[x] += 2\n print(('NO', 'YES')[max(l) < n])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[0] * 1001\r\nif n ==1:\r\n print(\"YES\")\r\n\r\nelif n==2:\r\n l,r=map(int,input().split())\r\n if (l==r):\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")\r\n\r\nelse:\r\n l = list(map(int,input().split()))\r\n for c in l:\r\n a[c] += 1\r\n if (len(l) % 2 == 1 and a[c] > n // 2 + 1) or (len(l) % 2 == 0 and a[c] > n // 2):\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\n \r\n \r\n\r\n \r\n", "n = int(input())\nb = dict()\nfor x in list(map(int, input().split())):\n if x not in b.keys():\n b[x] = 1\n else:\n b[x] += 1\nif any(b[x] > (n + 1) / 2 for x in b.keys()):\n print('NO')\nelse:\n print('YES')\n", "a = int(input())\r\nl = list(map(int, input().split()))\r\nd = dict()\r\ns = set()\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n s.add(i)\r\nflag = False\r\nfor i in s:\r\n sum = 0\r\n for j in d:\r\n sum += d[j]\r\n sum -= d[i]\r\n if d[i] - sum > 1:\r\n flag = True\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l :\r\n if i not in d.keys():\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n\r\nm=0\r\nif max(list(d.values()))<=(n+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter \r\ndef solve():\r\n n = int(input())\r\n arr = input().split()\r\n freqs = Counter(arr)\r\n max_val_key = max(freqs, key = freqs.get)\r\n max_val = freqs[max_val_key]\r\n del freqs[max_val_key]\r\n if sum(freqs.values()) >= max_val - 1:\r\n print('YES')\r\n else: print('NO')\r\nsolve()", "n = int(input())\r\narray = list(map(int, input(). strip(). split()))\r\ndelta = set(array)\r\nxray = []\r\nfor val in delta:\r\n xray.append(array.count(val))\r\n\r\ntarget = max(xray)\r\nif n-target >= target -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ndict1 = {}\r\ncount = 0\r\nstr = input().split(' ')\r\nfor i in str:\r\n if dict1.get(int(i), 0):\r\n dict1[int(i)] += 1 \r\n else:\r\n dict1[int(i)] = 1 \r\n \r\n if(count < dict1[int(i)]):\r\n count = dict1[int(i)]\r\n\r\nif(count<=(n+1)/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import factorial\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split(\" \")]\r\n\r\nmap_n = {}\r\n\r\nfor num in arr:\r\n if num in map_n:\r\n map_n[num] += 1\r\n else:\r\n map_n[num] = 1\r\n\r\nfor num in map_n:\r\n if map_n[num] >= (n / 2) + 1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nfrq=[0]1001\r\nfor i in nums:\r\n frq[i]+=1\r\ndiff = n\r\nfor i in frq:\r\n if i>n//2+(n&1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n \r\n\r\n", "import sys\r\nfrom typing import Callable\r\nfrom collections import defaultdict, Counter\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tn = int(read())\r\n\tvalues: list[int] = [int(i) for i in read().split()]\r\n\tmax_group = Counter(values).most_common(1)[0][1]\r\n\tremaining_elts = len(values) - max_group\r\n\r\n\t# You always need at least max_group - 1 elements\r\n\tif remaining_elts >= max_group - 1:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\n\r\nif(len(arr)==1):\r\n print(\"YES\")\r\nelse:\r\n freq = [0]1001\r\n for i in range(len(arr)):\r\n freq[arr[i]]+=1\r\n \r\n max_val = freq[0]\r\n ind = 0\r\n for i in range(1, len(freq)):\r\n if(max_val<freq[i]):\r\n max_val = freq[i]\r\n ind = i\r\n \r\n rem = len(arr) - max_val\r\n if(rem<(max_val-1)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nst = set(arr)\r\n#print(st)\r\n\r\nfor i in st :\r\n if arr.count(i) > (n+1)/2:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n\r\n", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc = {}\r\nfor x in set(l):\r\n c[l.count(x)] = x\r\nif max(list(sorted(c)))-1 <= i - max(list(sorted(c))):\r\n print('YES')\r\nelse:\r\n print('NO')", "from itertools import count\r\n\r\n\r\ndef most_frequent(List):\r\n return max(set(List), key = List.count)\r\n\r\ndef main():\r\n # your code goes here\r\n pass\r\n N = int(input())\r\n leo = list(map(int,input().split()))\r\n most_frq = most_frequent(leo)\r\n count_fre = leo.count(most_frq)\r\n if count_fre > ((N+1)/2):\r\n print('NO')\r\n else:\r\n print('YES') \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncontinuous = 1\r\nmax_continuous = 1\r\n\r\nfor i in range(1, n):\r\n if a[i] == a[i - 1]:\r\n continuous += 1\r\n if continuous > max_continuous:\r\n max_continuous = continuous\r\n else:\r\n continuous = 1\r\n\r\nprint(\"YES\" if max_continuous <= (n + 1) // 2 else \"NO\")\r\n", "#import math\r\n\r\n#n, m = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#n, m, k = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#k = int (k)\r\nn = int(input())\r\n#m = int(input())\r\n#s = input()\r\n#t = input()\r\n#h = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\n#c = list(map(int, input().split()))\r\n\r\n#x1, y1, x2, y2 =map(int,input().split())\r\n#n = int(input())\r\n#f = []\r\n#t = [0]n\r\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\r\n#f = sorted (f, key = lambda tup: tup[0] )\r\n\r\n#h = [\"\"] n\r\n#f1 = sorted(f, key = lambda tup: tup[0])\r\n\r\n\r\n#f1 = sorted(t, key = lambda tup: tup[0])\r\nif n % 2== 0:\r\n g = n/2\r\nelse:\r\n g = n/2 +1\r\nf = True\r\nc = 1\r\nfor i in range(1,n):\r\n if b[i] == b[i-1]:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > g:\r\n f = False\r\nif (f or n == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import exit\r\nimport math\r\nn=int(input())\r\nnumber=list(map(int,input().split()))\r\nfor i in number:\r\n if number.count(i)>math.ceil(n/2):\r\n print('NO')\r\n exit()\r\nprint(\"YES\") \r\n ", "from math import ceil\r\nN = int(input())\r\na = list(map(int, input().split()))\r\nsa = set(a)\r\nif len(sa) == 1 and N != 1:\r\n print('NO')\r\n exit()\r\n\r\nfor item in sa:\r\n count = 0\r\n for n in a:\r\n if item == n:\r\n count += 1\r\n\r\n if count > ceil(N/2):\r\n print('NO')\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=list(input().split())\r\nans=\"YES\"\r\nfor i in set(l):\r\n if l.count(i)2-1>n :\r\n #taking both odd and even n in concern\r\n ans=\"NO\"\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narri = sorted([arr.count(i) for i in set(arr)])\r\na = arri[-1]\r\nprint('YES' if a2-1<=n else 'NO')", "n = int(input())\r\nli = list(map(int, input().split()))\r\nans = 'YES'\r\n\r\nfor el in li:\r\n if li.count(el) * 2 > n+1:\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\nlst = [int(x) for x in input().split()]\ncur, cnt = 0, 0\nfor i in lst:\n if i == cur: cnt += 1\n elif cnt == 0: cur, cnt = i, 1\n else: cnt -= 1\ncnt = 0\nfor i in lst:\n if i == cur: cnt += 1\nprint (\"YES\" if cnt + (cnt - 1) <= n else \"NO\")\n", "import math,sys\nfrom collections import Counter, defaultdict, deque\nfrom sys import stdin, stdout\ninput = stdin.readline\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n=int(input())\n a=li()\n c=Counter(a)\n m=0\n for i in c:\n m=max(m,c[i])\n if(m>(n//2)+(n%2)):\n print(\"NO\")\n else:\n print(\"YES\")\n\nfor _ in range(1):\n case()", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef output_list(v):\r\n print(' '.join(str(x) for x in v))\r\n\r\ndef main():\r\n n = int(input())\r\n a = input_ints()\r\n for x in a:\r\n if 2 * a.count(x) > n + 1:\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(n==1):\r\n\tprint('YES')\r\nelse:\r\n\tx=a.count(1)\r\n\tfor i in range(len(a)):\r\n\t\tif(a.count(a[i])>x):\r\n\t\t\tx=a.count(a[i])\r\n\tif(x+(x-1))<=n:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "from math import ceil\r\nn = int(input())\r\n\r\nt = list(map(int, input().split()))\r\n\r\nif n == 1: print('YES')\r\nelse:\r\n c = max([t.count(x) for x in t])\r\n\r\n if c <= ceil(n/2): print('YES')\r\n else: print('NO')", "from math import ceil\r\nfrom collections import Counter\r\nfrom sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn=int(input())\r\na=Counter(map(int,input().split()))\r\nif a.most_common()[0][1]<=ceil(n/2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\nl = list(map(int, input().split(' ')))\ndic = dict()\nfor item in l:\n if item in dic:\n dic[item] += 1\n else:\n dic[item] = 1\n\nmaximum = max(dic.values())\nif maximum <= (n + 1) // 2:\n print (\"YES\")\nelse:\n print (\"NO\")\n\n \t\t \t \t\t \t \t \t \t \t\t \t \t", "n = int(input())\na =[int(i) for i in input().split()]\nc = []\nfor i in range(n):\n c.append(a.count(a[i]))\nr = \"YES\"\nif n%2 == 0:\n if max(c) > n//2:\n r = \"NO\"\nelse:\n if max(c) > (n+1)//2:\n r = \"NO\"\nprint(r)", "import math\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nif(n==1):\r\n print('YES')\r\nelse:\r\n s=set(a)\r\n k=[a.count(i) for i in s]\r\n if(max(k)>math.ceil(n/2)):\r\n print('NO')\r\n else:\r\n print('YES')", "from math import ceil\r\nsz = int(input())\r\nlst = list(map(int,input().split()))\r\ns = set(lst)\r\nfor i in lst:\r\n if lst.count(i) > int(ceil(sz/2)):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=list(map(int,list(input().split())))\r\nif n%2==0:\r\n x=n//2\r\nelse:\r\n x=(n//2)+1\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n s=set(l)\r\n c=[]\r\n for i in s:\r\n c.append(l.count(i))\r\n mx=max(c)\r\n if mx<=x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nl=[int(ele) for ele in input().split()]\r\nd={}\r\nfor e in l:\r\n d[e]=d.get(e,0)+1\r\nm=max(d.values())\r\nif n%2==0:\r\n if m>n/2:print('NO')\r\n else:print('YES')\r\nelse:\r\n a=(n/2)+0.5\r\n if m>a:print('NO')\r\n else:print('YES')", "'''input\n3\n1 1 2\n'''\nimport math\ndef find_max(f):\n\tm = -1\n\tfor i in range(1, 1001):\n\t\tm = max(m, f[i])\n\treturn m\nn = int(input())\narr = list(map(int, input().split()))\nf = [0] * (1000 + 1)\nfor i in range(n):\n\tf[arr[i]] += 1\nm = find_max(f)\nif math.ceil(n/2) >= m:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nc = Counter(arr)\r\nk,v = max(c.items(),key=lambda x:x[1])\r\nif n%2==0:\r\n if v<=n//2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if v<=math.ceil(n/2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\nc = 0\r\nfor i in s:\r\n if(a.count(i) > c):\r\n c = a.count(i)\r\nif(c <= math.ceil(n/2)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nfrom collections import Counter\r\nfrom math import ceil\r\n\r\na = int(input())\r\nl = [int(x) for x in input().split()]\r\nf = Counter(l)\r\ncan = True\r\nfor (k, v) in f.items():\r\n if v > ceil(a / 2):\r\n print(\"NO\")\r\n can = False\r\nif can:\r\n print(\"YES\")\r\n", "def f(n, a):\r\n m = max(a.count(x) for x in set(a))\r\n return \"YES\" if m <= (n + 1) / 2 else \"NO\"\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nresult = f(n, a)\r\nprint(result)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=True\r\nif n==2:\r\n if l[0]==l[1]:\r\n b=False\r\nif n>2:\r\n for i in range(n):\r\n count=0\r\n for j in range(n):\r\n if l[i]==l[j]:\r\n count+=1\r\n if n<(2count-1):\r\n b=False\r\nif b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nstring=list(input().split())\r\nans=\"YES\"\r\nfor i in string:\r\n if string.count(i)2-1>n :\r\n ans=\"NO\"\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n m = l.count(i)\r\n if m2>n+1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from collections import Counter\nn = int(input())\nprint (\"YES\" if Counter([int(x) for x in input().split()]).most_common(1)[0][1] 2 - 1 <= n else \"NO\")\n", "from sys import stdin\r\nn = stdin.readline().strip()\r\nnums = [int(x) for x in stdin.readline().strip().split(\" \")]\r\nmaximum = 0\r\nfor i in range(len(nums)):\r\n if nums.count(nums[i]) > maximum:\r\n maximum = nums.count(nums[i])\r\nif len(nums) == 1:\r\n print(\"YES\")\r\nelif maximum > round(len(nums)/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\n\r\nset_of_numbers = list(set(numbers))\r\n\r\ncounter = [None] * len(set_of_numbers)\r\nfor i in range(len(set_of_numbers)):\r\n counter[i] = numbers.count(set_of_numbers[i])\r\n\r\nif max(counter) > math.ceil(N/2):\r\n print('NO')\r\nelse:\r\n print('YES')", "from math import ceil\r\n\r\nn = int(input())\r\ns = input().split()\r\nst = set(s)\r\nmx = 0\r\nfor i in st:\r\n k = s.count(i)\r\n if k > mx:\r\n mx = k\r\nif mx > ceil(n / 2):\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nst = set(arr)\r\nmxc = 0\r\nfor e in st:\r\n if arr.count(e) > mxc:\r\n mxc = arr.count(e)\r\n\r\nif mxc > (n + 1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = 0\r\nfor x in set(a):\r\n s = a.count(x)\r\n m = max(m,s)\r\nif m > math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nlst = []\r\ni = 0\r\nj = n-1\r\nturn = 0\r\nwhile i<=j:\r\n if turn%2==0:\r\n lst.append(arr[i])\r\n i += 1\r\n else:\r\n lst.append(arr[j])\r\n j -= 1\r\n turn += 1\r\nlst = [-1]+lst\r\ncount = cnt = 0\r\nfor i in range(-1,-n-1,-1):\r\n if lst[i]!=lst[i-1]:\r\n break\r\n else:\r\n count += 1\r\nif count:\r\n cnt = 0\r\n num = lst[-1]\r\n for i in range(1,n+1):\r\n if num!=lst[i]:\r\n cnt += 1\r\n else:\r\n break\r\n if count<=cnt:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na1=list(set(a))\r\nc=1\r\nif(n>1):\r\n for i in a1:\r\n b=a.count(i)\r\n if(b>math.ceil(n/2)):\r\n print(\"NO\")\r\n c=0\r\n break\r\n if(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na=Counter(a)\r\nb=[a.values()]\r\nf=0\r\nfor i in b:\r\n if i<=(n+1)//2:\r\n f=0\r\n else:\r\n f=1\r\n break\r\nif f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = list(map(int , input().split()))\r\nres = []\r\nc = 0 \r\n\r\nfor i in a:\r\n if(i in res):\r\n continue\r\n else:\r\n s = 0 \r\n s = a.count(i)\r\n if(s > (n+1)//2):\r\n c += 1\r\n break \r\n else:\r\n res.append(i)\r\n\r\nif(c == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ninp = list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter(inp)\r\nd=list(c.values())\r\nd.sort()\r\na=0\r\nfor i in range(len(d)-1):\r\n d[i+1]=d[i+1]-d[i]\r\n if(i!=len(d)-2):\r\n a+=2d[i]\r\nif(d[len(d)-1]>1+a):\r\n print (\"NO\")\r\nelse:\r\n print ('YES')", "def yaroslav():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n cunts=[0 for i in range(1001)]\r\n for i in range(n):\r\n cunts[a[i]]=a.count(a[i])\r\n maxcount=0\r\n for i in range(1001):\r\n if cunts[i]>cunts[maxcount]:\r\n maxcount=i\r\n if n%2==0:\r\n if a.count(maxcount)>(n//2):\r\n print(\"NO\")\r\n return\r\n else:\r\n if a.count(maxcount)>((n//2) + 1):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nyaroslav()\r\n\r\n\r\n", "n=int(input())\r\narr = list(map(int , input().split()))\r\ndef t(arr):\r\n arr1 = set(arr)\r\n for i in arr1 :\r\n if arr.count(i) > (n+1)//2 :\r\n return \"NO\"\r\n return \"YES\"\r\nprint(t(arr))", "from math import ceil\r\n\r\nn = int(input())\r\nl = input().split()\r\n\r\nd = {}\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n\r\nif max(d.values()) > ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "import math\r\nnumber = int(input())\r\n\r\nlista = input()\r\nlista = lista.split()\r\nlista =[int(x) for x in lista]\r\n\r\n\r\nnumeros = [-1]\r\nfrecuencia = [0]\r\n\r\nfor num in lista:\r\n \r\n flag = True\r\n \r\n for guardado in range(len(numeros)):\r\n \r\n if num == numeros[guardado]:\r\n frecuencia[guardado] = frecuencia[guardado] + 1\r\n flag = False\r\n break\r\n \r\n if flag:\r\n numeros.append(num)\r\n frecuencia.append(1)\r\n\r\n\r\nmaximo = max(frecuencia)\r\n\r\nif maximo > math.ceil((number/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x =int(input())\r\nl =list(map(int,input().split()))\r\nn = [l.count(i) for i in set(l)]\r\nprint([\"NO\",\"YES\"][(sum(n)-max(n)>=max(n)-1)])", "def perms():\r\n n = int(input())\r\n count = {}\r\n if n == 1:\r\n return True\r\n limit = (n//2) + (n % 2)\r\n line = list(map(int, input().split(' ')))\r\n for element in line:\r\n if element not in count:\r\n count[element] = 1\r\n else:\r\n count[element] += 1\r\n if count[element] > limit:\r\n return False\r\n return True\r\n\r\n\r\nif(perms()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n d[i] = d.get(i,0)+1\r\nx=d.values()\r\np=n//2\r\nif(n%2!=0):\r\n p+=1\r\nif(max(x)<=p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nnums = map(int,input().split())\nunique_nums = [0] * 1002\nfor num in nums :\n unique_nums[num] +=1\nres = 'YES'\nfor num in unique_nums :\n if num > (n+1) //2:\n res = 'NO'\n break\nprint(res) \n\n\n", "#!/usr/bin/env python3\nimport sys\n\nif __name__ == \"__main__\":\n\tn = int(sys.stdin.readline())\n\tais = list(map(int, sys.stdin.readline().split()))\n\tprint(\"YES\" if all(ais.count(i)2 -1 <= n for i in ais) else \"NO\")\n", "n = int(input())\narr = [int(x) for x in input().split()]\nmax_freq = 0\nfreq= {}\nfor ele in arr:\n\tif ele not in freq:\n\t\tfreq[ele] = 0\n\tfreq[ele]+=1\n\tmax_freq = max(max_freq,freq[ele])\n\nif max_freq > int((n+1)/2):\n\tprint(\"NO\")\nelse:\n\t#Is there any way to get no?\n\t#n = 10\n\t#f = 4\n\t#f2 = 4\n\t#f3 = 2\n\t#abcabcabab\n\t\n\tprint(\"YES\")\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nf=len(s)\r\n\r\nc=0\r\nfor i in range(f):\r\n if l.count(s[i])>(n+1)//2:\r\n c=1\r\n break\r\nif c==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n%2==0 :\r\n k=0\r\nelse :\r\n k=-1\r\nfor i in range(n) :\r\n if l.count(l[i])+k>n//2 :\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "\r\n\r\nn = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n s = set(arr)\r\n if len(s) == 1:\r\n print('NO')\r\n else:\r\n\r\n di = {}\r\n s = list(s)\r\n count = 0\r\n for i in s:\r\n a = arr.count(i)\r\n di[i] = a\r\n count += a\r\n\r\n stop = False\r\n\r\n for k in di:\r\n if count - di[k] < di[k] - 1:\r\n stop = True\r\n break\r\n\r\n if not stop:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nd = dict()\r\n\r\nfor i in an:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n \r\nvmax = 0\r\n#vsum = 0\r\nfor i in list(d.keys()):\r\n #vsum += d[i]\r\n if(d[i] > vmax):\r\n vmax = d[i]\r\n \r\nif(vmax <= (n + 1) / 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import math\nfrom unittest import result\n\nif __name__ == \"__main__\":\n n = int(input())\n num_list = [int (i) for i in input().split()]\n num = dict()\n\n for e in num_list:\n if e in num:\n num[e] +=1\n else:\n num[e] = 1\n\n if n %2 == 0:\n limit = n/2\n else:\n limit = math.ceil(n/2)\n \n result = \"YES\"\n for v in num.values():\n if v > limit:\n result = \"NO\"\n\n print(result)\n \n ", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\nitem_appear = {}\r\n\r\nfor i in lst: \r\n if i not in item_appear: item_appear[i] = 1\r\n else: item_appear[i] += 1\r\n\r\nmax_appear = max(item_appear.values())\r\n\r\nif n - max_appear >= max_appear - 1: print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n# flag = True\r\n#284 284 285 285 285 284 285 284 284 285 284 285 284 284 285 284 285 285 285 285 284 284 285 285 284 284 284 285 284 285 284 285 285 284 284 284 285 284 284 285 285 285 284 284 285 284 285 285 284 285 285 284 285 284 284 284 285 285 284 285 284 285 285 285 285 284 284 285 285 284 285\r\n# for j in item_appear:\r\n# if item_appear[j] == max_appear:\r\n# if item_appear[j] ", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nprint('YES' if all([nums.count(i)2-1<=n for i in nums]) else 'NO')", "from math import \r\n\r\n\r\ndef main():\r\n p = input()\r\n s = list(map(int, input().split()))\r\n maxi = -inf\r\n z = set(s)\r\n for i in z:\r\n maxi = max(s.count(i), maxi)\r\n print(\"YES\" if maxi <= ceil(len(s)/2) else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=sorted([a.count(i) for i in s])\r\n\r\n\r\nmax_num=l[-1]\r\nh=sum(l[-2::-1])\r\n\r\nif(h>=max_num-1):\r\n \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = list(map(int, input().split()))\n\nb = {}\nfor i in range(n):\n if a[i] in b:\n b[a[i]] += 1\n else:\n b[a[i]] = 1\n\nif max(b.values()) <= (n+1)//2:\n print('YES')\nelse:\n print('NO')\n\n", "import math\r\ndef solve():\r\n n=int(input())\r\n lst=list(map(int,input().split(\" \")))\r\n\r\n i=0; \r\n\r\n \r\n\r\n for i in range(n):\r\n c=lst.count(lst[i])\r\n if c>math.ceil(n/2):\r\n print(\"NO\")\r\n return\r\n \r\n print(\"YES\")\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve();", "def yzd_solution(n,arr):\r\n freq_counter = {}\r\n\r\n limit = 0\r\n if n % 2 == 0:\r\n limit = n / 2\r\n else:\r\n limit = ((n-1)/2) + 1\r\n\r\n for num in arr:\r\n if num in freq_counter:\r\n freq_counter[num] += 1\r\n if (freq_counter[num] > limit):\r\n return False\r\n else:\r\n freq_counter[num] = 1\r\n \r\n return True\r\n\r\nn = int(input())\r\narr = input().split(\" \")\r\nprint(\"YES\" if yzd_solution(n, arr) else \"NO\")", "n=int(input())\r\nk=n//2+n%2\r\na={}\r\nfor x in list(map(int,input().split())):\r\n if x in a:\r\n a[x]+=1\r\n if a[x]>k:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n a[x]=1\r\nprint(\"YES\")\r\n", "from collections import Counter\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nc=Counter(x)\r\nm=0\r\nfor i in c:\r\n m=max(m,c[i])\r\nif m>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\narr = input().split()\r\ncheck_arr = list(set(arr))\r\nif(n%2 != 0):# n is odd\r\n for i in check_arr:\r\n if(arr.count(i) > n/2 + 1):\r\n print(\"NO\")\r\n break;\r\n else:\r\n print(\"YES\")\r\nelse:# n is even\r\n for i in check_arr:\r\n if(arr.count(i) > n/2):\r\n print(\"NO\")\r\n break;\r\n else:\r\n print(\"YES\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = [0 for i in range(1001)]\r\nfor i in l:\r\n ans[i]+=1\r\nf = 0\r\nfor i in range(1,1001):\r\n if ans[i]>(n+1)//2:\r\n f = 1\r\n break\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\n\n\ndef main():\n n = int(input())\n c = Counter(input().split())\n print(('NO', 'YES')[max(c.values()) 2 < n + 2])\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = Counter(a)\r\nans = 1\r\nfor i in range(n):\r\n if cnt[a[i]] > math.ceil(n/2):\r\n ans = 0\r\n break\r\nif (len(set(a)) > 1 or len(a) == 1) and ans == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def yar(dict,n):\r\n\tfor e in dict.keys():\r\n\t\tif(dict.get(e)>(n+1)//2):\r\n\t\t\treturn \"NO\"\r\n\treturn \"YES\"\r\n\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\ndict={}\r\nfor i in range(0,len(L)):\r\n\tif L[i] not in dict.keys():\r\n\t\tdict[L[i]]=1\r\n\telse:\r\n\t\tdict[L[i]]+=1\r\nprint(yar(dict,n))\r\n", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nf = [0] * 1000\r\nfor x in a :\r\n f[x] += 1\r\n\r\nfor i in range(1000) :\r\n if f[i] > (n + 1) // 2 :\r\n print(\"NO\")\r\n break\r\nelse :\r\n print(\"YES\")\r\n", "n = int(input())\r\narr, = map(int,input().split(' '))\r\ntheSet = set(arr)\r\ncount = 0\r\nfor i in theSet:\r\n c = arr.count(i)\r\n if c > count: count = c \r\nif n%2==0:\r\n res = count <= (n//2)\r\nelse:\r\n res = count <= (n//2+1)\r\n\r\nprint('YES' if res else \"NO\")", "x = int(input())\r\ny = map(int,input().split())\r\nfrom collections import Counter\r\nimport math \r\nx = math.ceil(x/2)\r\ny = Counter(y)\r\nfor i in y.values():\r\n if i>x:\r\n # print(x,i)\r\n print('NO')\r\n break\r\nelse:\r\n print(\"YES\")", "import sys\r\nimport os.path\r\nimport math\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nb=[0]1005\r\nfor i in arr:\r\n b[i]+=1\r\nif max(b)> (n+1)/2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\nn = int(input())\r\na = [0 for i in range(1001)]\r\nm = map(int,input().split())\r\nfor k in m:\r\n a[k]+=1\r\nmaxe = (n//2)+(n%2)\r\nres = True\r\nfor i in range(len(a)):\r\n if a[i] > maxe:\r\n res = False\r\n\r\nif res :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nk=[0]n\nl = [0]1001\nk=list(map(int,input().split()))\nfor _ in range(n):\n\tl[k[_]-1]+=1\n\nk = max(l)\nif k>(n+1)//2:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "n = int(input())\r\nvals = list(map(int, input().split()))\r\ncounts = [0]1000\r\nlast = -1\r\ncnt_last = -1\r\nfor i in range(n):\r\n counts[vals[i]-1]+=1\r\n if(cnt_last<counts[vals[i]-1]):\r\n last = vals[i]\r\n cnt_last = counts[vals[i]-1]\r\ncounts[last-1]-=1\r\nfor i in range(n):\r\n ma_idx = ma = -1\r\n for j in range(1000):\r\n if(counts[j]>ma and counts[j]>0 and j+1!=last):\r\n ma = counts[j]\r\n ma_idx = j+1\r\n if(ma!=-1):\r\n counts[ma_idx-1]-=1\r\n last = ma_idx\r\n else:\r\n break\r\nif(sum(counts)==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nList=list(map(int,input().split()))\r\n\r\n\r\nList.sort()\r\n\r\ni=0\r\ncounter=0\r\nwhile i<n:\r\n counter=max(List.count(List[i]),counter)\r\n i=i+List.count(List[i])\r\n \r\nif n>=(2counter-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sz = int(input())\r\nlst = list(map(int, input().strip().split()))\r\ngaps = [0]\r\nfor i in range(len(lst) - 1):\r\n c = 0\r\n j = i + 1\r\n while j < len(lst):\r\n if lst[i] == lst[j]:\r\n c += 1\r\n j += 1\r\n gaps.append(c)\r\nmx = max(gaps)\r\nif sz >= ((mx * 2) + 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncount = Counter(arr)\r\nif max(count.values()) > int((n+1)/2):\r\n print('NO')\r\nelse: print('YES')", "# Codeforces - Yaroslav and Permutations\r\n# https://codeforces.com/contest/296/problem/A\r\n#\r\n# Author: eloyhz\r\n# Date: Sep/04/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n c = [0] * 1001\r\n for x in a:\r\n c[x] += 1\r\n if max(c) <= (n + 1) / 2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n# if n > 1 and max(c) > round(n / 2):\r\n # print('NO')\r\n # else:\r\n # print('YES')\r\n\r\n", "import math\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nmaj=l[0]\r\ncount=1\r\nfor i in range(1,n):\r\n if(l[i]==maj):\r\n count+=1\r\n elif count==0:\r\n maj=l[i]\r\n count+=1\r\n else:\r\n count-=1\r\ncount=0\r\nfor i in range(n):\r\n if l[i]==maj:\r\n count+=1\r\nif(count>math.ceil(n/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\nn = int(input())\ncnt = Counter([int(x) for x in input().split()])\nprint('YES' if cnt.most_common(1)[0][1] <= (n - 1) // 2 + 1 else 'NO')\n", "from statistics import mode\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nmode = mode(arr)\r\nm = arr.count(mode)\r\nif n >= 2m- 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "import sys\r\nimport math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nl= max(set(r), key = r.count)\r\nfor i in r:\r\n if r.count(i)==len(r) and len(r)>1:\r\n print(\"NO\")\r\n sys.exit()\r\n \r\n if r.count(l)>(int(math.ceil(len(r)/2))):\r\n print(\"NO\")\r\n sys.exit()\r\n else:\r\n print(\"YES\")\r\n sys.exit()", "import collections\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=0\r\n\r\nd=collections.Counter(l)\r\nif n%2!=0:\r\n for i in d.values():\r\n if i>((n/2)+1):\r\n c+=1\r\nelse:\r\n for i in d.values():\r\n if i>(n/2):\r\n c+=1\r\nif c>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n ", "from collections import Counter as c\r\na=int(input())\r\nb=c(map(int,input().split()))\r\nprint('YES'if b.most_common(1)[0][1]<=(a+1)//2 else'NO')", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nans=[0 for i in range(1005)]\r\nfor i in arr:\r\n\tans[i]+=1\r\np=max(ans)\r\nif(n%2==0):\r\n\tif(p>n//2):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\nelse:\r\n\tif(p>n//2+1):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n", "x=int(input())\r\nc=1\r\ny=list(map(int,(input().split())))\r\nfr={}\r\nfor i in y:\r\n fr[i]=fr.get(i,0)+1\r\nif max(fr.values())>(x+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=int(input())\r\nm=map(int,input().split())\r\nl=[]\r\nfor x in m : \r\n l.append(x) \r\nres='YES'\r\nM=0\r\nfor x in l : \r\n if l.count(x) > M : \r\n M=l.count(x)\r\ndif = len(l)-M\r\nif dif < M-1 : \r\n res='NO'\r\nprint(res)", "\r\n\r\nfrom collections import Counter\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nif(n==1):\r\n\tprint(\"YES\")\r\n\texit()\r\nc=Counter(l)\r\n\r\nval=c.values()\r\n\r\nval=sorted(val,reverse=True)\r\n\r\nans=n//2\r\n\r\nif(n%2!=0):\r\n\tans+=1\r\n\r\n\r\nfor i in val:\r\n\tif(i>ans):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "def solve(n,arr):\n\tfrom math import ceil\n\td={}\n\tfor i in arr:\n\t\td[i] = d.get(i,0) +1\n\tmx=0\n\tfor i in d :\n\t\tmx=max(mx,d[i])\n\n\tif mx<= ceil(n/2) :\n\t\treturn 'YES'\n\t\n\treturn 'NO'\n\n\t\t\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = int(input())\n\nl4=input()\nl4=[int(x) for x in l4.split(' ')]\n\n\n\nprint(solve(l3 ,l4))\n", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n note = dict()\r\n for it in line:\r\n if it in note.keys():\r\n note[it] += 1\r\n else:\r\n note.setdefault(it, 1)\r\n ceil = max(note.values())\r\n if ceil 2 > n + 1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "n=int(input())\r\ninp=input().split()\r\nl=[]\r\nd={}\r\nfor i in range(len(inp)):\r\n l.append(int(inp[i]))\r\n if(l[i] not in d):\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]=d.get(l[i])+1\r\ngmax=-1\r\nval=-1\r\nfor num in d:\r\n if(gmax<d.get(num)):\r\n gmax=d.get(num)\r\n val=num\r\ncount=0 \r\nfor num in d:\r\n if(val!=num):\r\n count=count+d.get(num)\r\n \r\nif(count>=(gmax-1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\narr = list(map(int, input().strip().split()))[:n]\r\nfreq = [0] * 1005\r\nfor i in arr:\r\n freq[i] += 1\r\nmx = 0\r\nfor i in freq:\r\n mx = max(mx, i)\r\nneed = mx - 1\r\nif need <= n - mx:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = int(input())\r\nnumbers = list(map(int, input().split()))\r\nfrom collections import defaultdict\r\ncount = defaultdict(int)\r\nfor num in numbers:\r\n if num in count.keys():\r\n count[num] += 1\r\n else:\r\n count[num] = 1\r\n\r\nfor value in count.values():\r\n if number % 2 == 0 and value > int(number / 2):\r\n print('NO')\r\n exit()\r\n elif number % 2 == 1 and value > int(number / 2) + 1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "def main():\r\n from sys import stdin, stdout\r\n import collections\r\n n = int(stdin.readline())\r\n d = collections.Counter(map(int,stdin.readline().split()))\r\n flag = True\r\n for i in d:\r\n if n&1:\r\n if d[i]>(n+1)//2:\r\n flag = False\r\n break\r\n else:\r\n if d[i]>n//2:\r\n flag = False\r\n break\r\n if flag:\r\n stdout.write('YES\\n')\r\n else:\r\n stdout.write('NO\\n')\r\n\r\n \r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n = int(input())\nnums = list(map(int,input().split()))\n\n\nfrequencies = {}\n\nfor num in nums:\n frequencies[num] = frequencies.get(num,0) +1\n\nlarge = (-1,0)\nallFr = 0\nfor key,value in frequencies.items():\n if value > large[1]:\n large = (key,value)\n allFr += value\nallFr-=large[1]\nif allFr >= large[1]-1 :\n print('YES')\nelse :\n print('NO')", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncounts = dict()\r\n\r\nfor i in arr:\r\n if i in counts:\r\n counts[i] += 1\r\n else:\r\n counts[i] = 1\r\n\r\nbad = False\r\nfor i in list(counts.values()):\r\n if i > (n + 1) / 2:\r\n bad = True\r\n break\r\n\r\nif not bad:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\ndef test(l) -> bool:\r\n if n%2 == 0:\r\n for e in l:\r\n if l.count(e) > n/2:\r\n return False\r\n return True\r\n else:\r\n for e in l:\r\n if l.count(e) > (n+1)/2:\r\n return False\r\n return True\r\n \r\n \r\nprint(\"YES\" if test(l) else \"NO\")", "x=int(input());y=list(map(int,input().split()));k=True\r\nfor i in (set(y)):\r\n if y.count(i)2-1>x:k=False\r\nprint(\"YES\"if k else\"NO\")", "n=int(input())\n\narr=[int(x) for x in input().split()]\n\nvalid=True\n\nfor i in range(n):\n c=0\n for j in range(i,n):\n if arr[i]==arr[j]:\n c+=1\n \n if n < (2c-1): # main condition by observation\n valid=False\n break\n\n\nif valid:\n print (\"YES\")\nelse:\n print(\"NO\")", "from math import ceil\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = set(arr)\r\nok = 'YES'\r\nfor i in c:\r\n if arr.count(i) > ceil(n/2):\r\n ok = 'NO'\r\nprint(ok)", "n=int(input())\r\na=input().split()\r\nb=set(a)\r\nd={}\r\nS=len(a)\r\nfor i in b:\r\n d[i]=a.count(i)\r\nfor i,k in d.items():\r\n if S-k<k-1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from math import ceil\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nX = list(map(int, input().split()))\r\nMyDict = defaultdict(int)\r\nfor i in X:\r\n MyDict[i] += 1\r\nfor j in MyDict.values():\r\n if j > ceil(N/2):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n# UB_CodeForces\r\n# Advice: Each failure is a new starting for a success\r\n# Location: Based on popular demand \"\" \"\" \"\" \"\"\r\n# Caption: After TOEFL exam and start from the beginning\r\n# CodeNumber: 580\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nc=[0 for i in range(m+1)]\r\nfor i in a:\r\n\tc[i]+=1\r\nfor i in c:\r\n\tif i>(n+1)//2:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")\r\n", "n = int(input())\r\nnumbers = [x for x in map(int, input().split())]\r\n#counter = {x: 0 for x in range(10)}\r\ncounter = {}\r\nmaximum = 0\r\n\r\nfor item in numbers:\r\n if item not in counter:\r\n counter[item] = 1\r\n else:\r\n counter[item] += 1\r\n\r\nfor item in counter:\r\n if counter[item] > maximum:\r\n maximum = counter[item]\r\n\r\nif n == 1:\r\n print ('YES')\r\nelif n - maximum >= maximum - 1:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n\tif a.count(i)2-1>n:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "from math import ceil\nn = int(input())\narray = list(map(int, input().split()))\nmaxIter = 0\nfor i in array:\n if array.count(i) > maxIter:\n maxIter = array.count(i)\nprint(\"YES\" if maxIter <= ceil(n/2) else \"NO\")\n", "n=int(input())\r\nlist1=[]\r\nt=[0]10000\r\nflag=1\r\nstr1=input()\r\nlist2=str1.split(\" \")\r\nlist2_length=len(list2)\r\ni=0\r\nwhile i<=list2_length-1:\r\n list1.append(int(list2.pop()))\r\n i+=1\r\nlist1.reverse()\r\nfor j in range(0,n):\r\n x=list1[j]\r\n t[x]+=1\r\n if t[x]>(n+1)/2:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -- coding: utf-8 --\r\n\r\n# R E X\r\n\r\n\r\n# @Author: Kunal Verma\r\n\r\n# CodeForces - kunalverma19\r\n# CodeChef - kunalverma_19\r\n# AtCoder - TLKunalVermaRX\r\n\r\n# @Last Modified by: Kunal Verma\r\n# @Modified Time: 2021-06-29 09:52:38 (IST)\r\n\r\n\r\nimport math\r\nimport re\r\nimport string\r\nimport sys\r\nfrom itertools import permutations\r\nfrom collections import Counter\r\nimport itertools\r\nMOD = 1000000007\r\ndef inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\nn = ninp()\r\ns = list(inp())\r\nprint(\"YES\"if all([s.count(i)2-1 <= n for i in s])else \"NO\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nif(n%2==0):\r\n for i in s:\r\n if(l.count(i)>n//2):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in s:\r\n if(l.count(i)>(n//2+1)):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ncount=1\r\nfor i in range (1,n):\r\n if a[i]==a[i-1] and a.count(a[i])>count:\r\n count+=1\r\n else:\r\n if a.count(i)>count:\r\n count=a.count(i)\r\nk=count\r\nif k<=n//2 and n%2==0:\r\n print(\"YES\")\r\nelif k<=(n//2)+1 and n%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = list(map(int,input().split()))\r\nk = max(s, key=s.count)\r\nprint(\"YES\" if (s.count(k)) <= (n+1)//2 else \"NO\")", "from math import ceil\r\ninp = int(input())\r\nls = list(map(int, input().split()))\r\ndist = [ls[0]]\r\nfor i in ls:\r\n if i not in dist:\r\n dist.append(i)\r\ndist = [ls.count(q) for q in dist]\r\nif max(dist) >= ceil(inp/2) + 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# coding: utf-8\nfrom collections import Counter\nn = int(input())\nc = Counter([int(i) for i in input().split()])\nmaxtime = c.most_common()[0][1]\nif n >= 2maxtime-1:\n print('YES')\nelse:\n print('NO')\n", "from collections import Counter\n\nn = int(input())\ncounts = Counter(map(int, input().split()))\n\nlimit = (n + 1) // 2\nvalid = True\n\nfor _, c in counts.items():\n if c > limit:\n valid = False\n break\n\nif valid:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "q=int(input())\r\nw=[int(e)for e in input().split()]\r\nr=list(set(w))\r\n\r\nt=[]\r\nfor i in r:\r\n t.append(w.count(i))\r\nif len(set(w))==1:\r\n if w.count(r[0])>1:\r\n print('NO')\r\n exit()\r\n else:\r\n print('YES')\r\n exit()\r\n\r\nif max(t)-(sum(t)-max(t))<2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nmyList = list(map(int, input().split()))\r\nmx = 0\r\nfor i in range(len(myList)):\r\n mx = max(mx, myList.count(myList[i]))\r\nif mx > (len(myList) + 1) // 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import math\nn = int(input())\na = list(map(int, input().split()))\np = math.ceil(n/2)\nif len(a) == 1:\n print(\"YES\")\n exit()\ndict = {}\nfor i in a:\n if i not in dict:\n dict[i] = 1\n else :\n dict[i] += 1\nk = max(dict.values())\nif len(set(a)) >= 2 and k <= p:\n print(\"YES\")\nelse :\n print(\"NO\")\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nif n==1:\r\n\tprint(\"YES\")\r\nelif n!=1 and len(set(a))==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\td={}\r\n\tfor i in a:\r\n\t\tif i in d:\r\n\t\t\td[i]+=1\r\n\t\telse:\r\n\t\t\td[i]=1\r\n\r\n\tcounts = list( d.values() )\r\n\tcounts.sort()\r\n\ts=counts[-2]\r\n\tr = counts[-1]-counts[-2]\r\n\r\n\tif ((n-r-1)+2)-s2 >= r:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor x in l:\r\n d[x]=d.get(x,0)+1\r\nfor x in d:\r\n if d[x]>(n+1)//2: print(\"NO\"); break\r\nelse: print(\"YES\")", "import math\r\nfrom collections import Counter\r\nn,l=int(input()),Counter(list(map(int,input().split())))\r\nprint('YES' if max(l.values())<=math.ceil(n/2) else 'NO')", "def main():\r\n\t\r\n\tn = int(input())\r\n\ta = [int(i) for i in input().split()]\r\n\r\n\t# C <= (n+1) // 2\r\n\tcounter = [0] (max(a) + 1)\r\n\tfor i in a:\r\n\t\tcounter[i] += 1\r\n\r\n\tstatus = True\r\n\tfor i in counter:\r\n\t\tif i > (n + 1) // 2:\r\n\t\t\tstatus = False\r\n\r\n\tif status:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "if __name__ == \"__main__\":\r\n n = int (input ())\r\n\r\n arr = [0] * 1001\r\n\r\n v = list (map (int, input ().split ()))\r\n\r\n for i in range (n):\r\n arr[v[i]] += 1\r\n\r\n if n % 2 == 1:\r\n n += 1\r\n\r\n n //= 2\r\n\r\n print (\"NO\", end = \"\") if max (arr) > n else print (\"YES\", end = \"\")", "n = int(input())\r\nthe_list = list(map(int, input().split()))\r\nfor i in the_list:\r\n a = the_list.count(i)\r\n if n - a < a - 1:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "import sys\nimport math\ninput = sys.stdin.readline\n\ncnts = [0] * 1500\nn = int(input().strip())\na = list(map(int, input().strip().split()))\nfor el in a: cnts[el] += 1\nif n - max(cnts) >= max(cnts) - 1: print('YES')\nelse: print('NO')\n", "from math import \r\nn=int(input())\r\na=list(map(int,input().split()))\r\nmp={}\r\nmaxf=0\r\n\r\nfor i in a:\r\n if(i not in mp.keys()):\r\n mp[i]=1\r\n else:\r\n mp[i]+=1\r\n \r\n if(maxf<mp[i]):\r\n maxf=mp[i]\r\n\r\nif(maxf>ceil(n/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n ", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ncnt = {}\r\nmaxi = float('-inf')\r\nfor i in arr:\r\n if i not in cnt:\r\n cnt[i] = 1\r\n else:\r\n cnt[i] += 1\r\n maxi = max(maxi, cnt[i])\r\nif maxi <= (n+1)//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from typing import Counter \r\n\r\n# for _ in range(1,n+1):\r\n # n=int(input()) \r\n # x,y=map(int,input().split()) \r\n# s=input()\r\nn=int(input())\r\nif n==1:\r\n print(\"YES\")\r\n exit()\r\narr=list(map(int,input().split()))\r\ncnt=Counter()\r\nfor i in arr:\r\n cnt[i]+=1\r\n# print(len(cnt))\r\n\r\nval=list(cnt.values())\r\nif len(cnt)==1:\r\n print(\"NO\")\r\n exit()\r\nval.sort(reverse=True)\r\n# print(val)\r\nmx=val[0]\r\nmn=val[-1]\r\ndiff=[]\r\nfor i in range(len(val)-1):\r\n diff.append(val[i]-val[i+1])\r\ndiff.sort(reverse=True)\r\nfor i in diff[1:]:\r\n diff[0]-=i\r\n# print(mx-mn)\r\nif val[0]<=len(cnt)-1 or diff[0] in [-1,0,1] or (val[0]-mn in [-1,0,1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n d={}\r\n for i in l:\r\n d[i]=0\r\n for i in l:\r\n d[i]+=1\r\n for i in d:\r\n c=d[i]\r\n if(c>((n+1)/2)):\r\n return 'NO'\r\n return 'YES'\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint(exe())", "n=int(input())\r\na=list(map(int, input().split()))\r\nb={}\r\nfor i in a:\r\n if i in b:b[i]+=1\r\n else:b[i]=1\r\nt=0\r\nfor i in b:\r\n if b[i]>t:t=b[i]\r\nif n-t>=t-1:print('YES')\r\nelse:print('NO')\r\n", "from collections import Counter\nfrom math import ceil\n\nn = int(input())\narr = input().strip().split()\ntc = len(arr)\ncnt = Counter(arr)\nfor key in cnt:\n if cnt[key] > ceil(tc/2):\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nc = Counter(arr)\r\nlis = list(c.values())\r\nlis.sort()\r\nif lis[-1] > math.ceil(n/2):\r\n print('NO')\r\nelse:\r\n print('YES') ", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = max(Counter(map(int, input().split())).values())\r\nif w > (n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import ceil\r\nn = int(input())\r\npocet = ceil(n/2)\r\narr = list(map(int, input().split()))\r\nx = set(map(int, arr))\r\nmaxi = 0\r\nfor i in x:\r\n if arr.count(i) > maxi:\r\n maxi = arr.count(i)\r\nif maxi > pocet:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\noccs = {}\r\nfor elem in a:\r\n if elem not in occs:\r\n occs[elem] = 1\r\n else:\r\n occs[elem] += 1\r\nprint(\"YES\" if max(occs.values()) <= (n + 1) // 2 else \"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\nm=0\r\nfor i in b:\r\n\tm=max(a.count(i),m)\r\nif m<=(len(a)//2+len(a)%2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndic = {}\r\n\r\nfor i in a:\r\n if i in dic:\r\n dic[i] += 1\r\n else:\r\n dic[i] = 1\r\n\r\nprint(\"YES\" if max(dic.values()) <= (n+1)//2 else \"NO\")\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = {}\r\nfor i in arr:\r\n\tif i in m:\r\n\t\tm[i] += 1\r\n\telse:\r\n\t\tm[i] = 1\r\nf = True\r\nfor i in m:\r\n\tif m[i] > (n+1)//2:\r\n\t\tprint('NO')\r\n\t\tf = False\r\nif f:\r\n\tprint('YES')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nch=[0](max(a)+1)\r\nfor i in a :\r\n ch[i]+=1\r\n\r\nif n%2!=0 :\r\n n+=1\r\n\r\nf=True\r\nfor i in ch :\r\n if i>n/2 :\r\n f=False\r\n break\r\nif f==True :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nk=0\r\nfor i in a:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nflag=0\r\nfor j in a:\r\n\tif d[j]>(n+1)//2:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")\r\n", "from collections import Counter\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n array = Counter(map(int, input().split()))\r\n if n >= 2 * max(array.values()) - 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nl = input().split(' ')\r\nd = dict()\r\nfor x in l:\r\n x = int(x)\r\n if x in d.keys():\r\n d[x] += 1\r\n else: d[x] = 1\r\n\r\nM = 0\r\nfor x in d.keys():\r\n if M < d[x]: M = d[x]\r\n\r\nif(M > (n+1)//2):\r\n print(\"NO\")\r\nelse: print(\"YES\")\r\n", "#from dust i have come, dust i will be\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\ndict={}\r\n\r\nfor i in range(n):\r\n try:\r\n x=dict[a[i]]\r\n dict[a[i]]+=1\r\n except:\r\n dict[a[i]]=1\r\n\r\n if dict[a[i]]>(n+1)//2:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint('YES' if all([l.count(i)2-1 <= n for i in l]) else 'NO')", "#one day im gonna in sha allah\r\n\r\nimport math\r\n\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input())\r\n numbers = input().split()\r\n ind = numbers.count(max(set(numbers), key= numbers.count))\r\n\r\n if((n - ind + 1) >= ind or n == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n= int(input())\r\nx= list(map(int , input().split()))\r\ndictt ={}\r\nfor i in set(x) : \r\n dictt[i] = x.count(i) \r\nres ='YES'\r\nfor key ,value in dictt.items() : \r\n if value == 1 : \r\n continue\r\n elif value - 1 > n - value : \r\n res =\"NO\"\r\n break \r\nprint(res)", "n = int(input())\r\na = [map(int, input().split())]\r\nM = 0\r\nfor x in set(a):\r\n if a.count(x) >= M:\r\n M = a.count(x)\r\nprint('YNEOS'[n + 1 < 2M ::2])\r\n \r\n \r\n", "def inp():\r\n ls=list(map(int,input().split()))\r\n return ls\r\nt=int(input())\r\nls=inp()\r\nans=[0]len(set(ls))\r\nall=list(set(ls))\r\nfor i in range(len(set(ls))):\r\n for j in range(t):\r\n if all[i]==ls[j]:\r\n ans[i]+=1\r\n#print(ans)\r\nfor i in ans:\r\n if i>(t+1)//2:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nhashVal = {}\r\n\r\nfor num in arr:\r\n if num not in hashVal:\r\n hashVal[num] = 1\r\n else:\r\n hashVal[num]+=1\r\n\r\n#print(hashVal)\r\n\r\n#noOf = len(hashVal.keys())\r\nlength = len(arr)\r\nflag = True\r\nif length%2!=0:\r\n for key in hashVal:\r\n if hashVal[key] > n//2 + 1:\r\n flag = False\r\n break\r\n\r\nelse:\r\n for key in hashVal:\r\n if hashVal[key] >= n//2 + 1:\r\n flag = False\r\n break\r\n\r\n\r\nif flag:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n'''\r\nif noOf>=2:\r\n print(\"YES\")\r\n\r\nelse:\r\n if len(arr)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n'''\r\n", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif n==1:print('YES')\r\nelse:\r\n ans=[]\r\n for i in set(lst):ans.append(lst.count(i))\r\n dec=max(ans)\r\n leng=len(lst)\r\n if leng%2:\r\n if dec>(leng+1)//2:print('NO')\r\n else:print('YES')\r\n else:\r\n if dec>leng//2:print('NO')\r\n else:print('YES')\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\r\n\"\"\"\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nfor i in m:\r\n\ta = m.count(i)\r\n\tif n % 2 == 0:\r\n\t\tif a > n // 2:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\telse:\r\n\t\tif a > (n + 1) // 2:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\nprint(\"YES\")\r\n\t\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncounts= [0]1001\r\n\r\nfor x in arr:\r\n\tcounts[x]+=1\r\n\r\nmx = index = 0\r\nfor i in range(len(counts)):\r\n\tif(counts[i] > mx):\r\n\t\tmx = counts[i]\r\n\t\tindex = i\r\nsu = 0\r\nfor i in range(len(counts)):\r\n\tif(i != index):\r\n\t\tsu+=counts[i]\r\n\r\nif(su >= counts[index]-1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#61\r\nn = int(input())\r\nins = [int(x) for x in input().split()]\r\n\r\ncountDict = {}\r\nmaxCount = 1\r\nfor elemnt in ins:\r\n try:\r\n countDict[elemnt] += 1\r\n if countDict[elemnt] > maxCount:\r\n maxCount = countDict[elemnt]\r\n except:\r\n countDict[elemnt] = 1\r\n\r\nif n - maxCount >= maxCount - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import itertools\r\nimport math\r\nimport threading\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\nfrom math import factorial as fac\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n if n == 1:\r\n print(\"YES\")\r\n return\r\n\r\n m = {}\r\n for i in range(n):\r\n if a[i] not in m:\r\n m[a[i]] = 1\r\n else:\r\n m[a[i]] += 1\r\n\r\n mx = max(m.values())\r\n if mx <= 1 + n - mx:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n multitest = 0\r\n\r\n if multitest != 0:\r\n t = int(sys.stdin.readline())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]1005\r\nfor i in a:\r\n b[i]+=1\r\nif max(b)<=(math.ceil(n/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import \r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n \r\nn=int(input())\r\nl=RI()\r\nd=df(int)\r\n\r\nfor i in l:\r\n d[i]+=1\r\n\r\n\r\nf=0\r\nm=(n+1)//2\r\nfor i in d:\r\n if(d[i]>m):\r\n f=1\r\n break\r\n\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n = int(input())\r\nnumbers = (map(int, input().split()))\r\ntwo_count = 0\r\n\r\nans_dict = dict()\r\n\r\nfor i in numbers:\r\n ans_dict[i] = ans_dict.get(i, 0) + 1\r\n\r\nfor k, v in ans_dict.items():\r\n if v > (n +1)/2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = [int(k) for k in input().split()]\r\nc = Counter(arr)\r\nm = max(c[k] for k in c)\r\n\r\nif len(arr) % 2 == 0:\r\n if m <= (len(arr) // 2):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif len(arr) % 2 != 0:\r\n if m <= (math.ceil(len(arr) / 2)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\n\nc = Counter(arr)\nimport math\nmax_v = -math.inf\nfor k, v in c.items():\n max_v = max(max_v, v)\n\nif max_v <= (n+1)//2:\n print('YES')\nelse:\n print('NO')\n", "# python 3\n\"\"\"\nNote that after applying the operations of the exchange, we can get any permutation of the elements of the array.\nIt is not difficult to understand that the answer would be \"YES\" if there were at least another different\nnumber between the same-valued number, and this means that at most the same-valued number would appear\n(n+1)/2 times. Thus, if the most seen number appear C times, it must fulfill the condition C <= (n+1) / 2.\n\"\"\"\n\n\ndef yaroslav_and_permutations(n_int: int, numbers_list: list) -> str:\n times = dict()\n for each in numbers_list:\n if times.get(each, -1) == -1:\n times[each] = 1\n else:\n times[each] += 1\n max_seen = 0\n for (number, seen_time) in times.items():\n if seen_time > max_seen:\n max_seen = seen_time\n if max_seen <= (n_int + 1) // 2:\n return \"YES\"\n else:\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n n = int(input())\n numbers = list(map(int, input().split()))\n print(yaroslav_and_permutations(n, numbers))\n", "n = int(input())\nm = input().split()\npossible = True\nfor i in set(m):\n if m.count(i) >= n/2 + 1:\n possible = False\n break\nprint('YES' if possible else 'NO')", "n = int(input())\r\n\r\narr = list(map(int, input().strip().split()))\r\n\r\ndic = {}\r\n\r\nfor x in range(n):\r\n \r\n if arr[x] not in dic:\r\n dic[arr[x]] = 1\r\n else:\r\n dic[arr[x]] += 1\r\nr = 0\r\nif n % 2 ==0:\r\n r = n // 2\r\nelse:\r\n r = n // 2 + 1\r\n\r\nflag =0 \r\nfor e in dic:\r\n if dic[e] > r:\r\n print(\"NO\")\r\n flag = 1\r\nif flag == 0:\r\n print(\"YES\")\r\n ", "n = int(input())\na = list(map(int, input().split()))\nfor q in a:\n if a.count(q) > (n+1)//2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n=int(input())\r\nx=list(map(int, input().split()))\r\nfreq = {}\r\nfor item in x:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\np=max(freq.values())\r\nq=sum(freq.values())-p\r\nif q>=p or p-q==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\narray = list(map(int, input().split()))\nhash_map = {}\n\nfor x in array:\n if x not in hash_map:\n hash_map[x] = 1\n else:\n hash_map[x] += 1\n\nflag = True\n\nfor v in hash_map.values():\n if v > (n + 1) / 2:\n flag = False\n break\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from collections import Counter\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nif (n == 1):\r\n print(\"YES\")\r\n exit(0)\r\nif (n == 2):\r\n if (numbers[0] != numbers[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nc = Counter(numbers)\r\nmaxValue = 0\r\nif (n % 2 == 0):\r\n maxValue = n // 2\r\nelse:\r\n maxValue = (n // 2) + 1\r\nfor value in c.values():\r\n if (value > maxValue):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "\"\"\"A. Yaroslav and Permutations\"\"\"\r\nlength = int(input())\r\narray = [int(element) for element in input().split()]\r\nfor i in array:\r\n if array.count(i) > (length+1)//2:\r\n print('NO')\r\n break\r\n\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk={}\r\nfor i in l:\r\n if i not in k.keys():\r\n k[i]=1\r\n else:\r\n k[i]+=1\r\nif max(k.values())<=(n+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(\"YES\"if all([a.count(i)2-1<=n for i in a])else\"NO\")", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nans = 'YES'\r\nfor i in l:\r\n if l.count(i)>(n+1)/2:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "from collections import Counter\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\ndictt = Counter(lst)\r\nfor i in dictt.keys():\r\n if dictt[i] > (n + 1) // 2:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "from collections import Counter as cn\r\nn=int(input()) \r\na=list(map(int,input().split()))\r\n#print(len(set(a)))\r\nl=cn(a)\r\nvv=list(l.values())\r\nmx=max(vv)\r\nif n-mx>=mx-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "\r\nn = int(input())\r\n\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\n\r\narr = sorted(arr)\r\n\r\ncont = 1\r\nmcont = 1\r\n\r\n\r\nfor i in range(1,n):\r\n if arr[i]==arr[i-1]:\r\n cont+=1\r\n\r\n if cont>mcont:\r\n mcont=cont\r\n else:\r\n cont=1\r\n\r\n\r\nif mcont<=int((n+1)/2):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = 0\r\nfor i in a: mx = max(mx, a.count(i))\r\nif n%2==1:\r\n if mx>(n//2)+1: print('NO')\r\n else: print('YES')\r\nelse:\r\n if mx>n//2: print('NO')\r\n else: print('YES')\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nsize = len(nums)\r\nmax_freq = 0\r\n\r\nset_nums = set(nums)\r\nfor num in set_nums:\r\n if max_freq < nums.count(num):\r\n max_freq = nums.count(num)\r\n \r\nif size - max_freq >= max_freq - 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=0\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n for i in l:\r\n c=l.count(i)\r\n if (2c)-n>1:\r\n print(\"NO\")\r\n d+=1\r\n break\r\n if d==0:\r\n print(\"YES\")\r\n", "from collections import Counter\nn = int(input())\narr = input().split()\ncounter = Counter(arr)\nif n == 1 or (n-max(counter.values())) >= max(counter.values()) - 1:\n print(\"YES\")\nelse :\n print(\"NO\")\n\n\n\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[18]:\n\n\ndef Paint_the_Array():\n n = int(input())\n a = list(map(int, input().split()))\n for i in a:\n if n % 2 == 0:\n if a.count(i) > n / 2:\n return 'NO'\n else:\n if a.count(i) > (n + 1) / 2:\n return 'NO'\n return 'YES'\n \nprint(Paint_the_Array())\n\n\n# In[ ]:\n\n\n\n\n", "# Problem Link: https://codeforces.com/problemset/problem/296/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount = {}\r\nmax_count = 0\r\nfor el in arr:\r\n count[el] = count.get(el, 0) + 1\r\n if (count[el] > max_count):\r\n max_count = count[el]\r\n\r\ngreater_than = n/2\r\nif (n%2 == 1):\r\n greater_than = greater_than + 1\r\nif max_count > greater_than:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\n\r\nset_of_numbers = list(set(numbers))\r\n\r\ncountr = [None] len(set_of_numbers)\r\nfor i in range(len(set_of_numbers)):\r\n countr[i] = numbers.count(set_of_numbers[i])\r\n\r\nif max(countr) > math.ceil(N/2):\r\n print('NO')\r\nelse:\r\n print('YES')", "_ = input()\nnumbers = {}\nsize = 0\n\nfor num in input().split():\n if num in numbers:\n numbers[num] += 1\n else:\n numbers[num] = 1\n\n size += 1\n\nhalf = size // 2 + size % 2\n\nfor value in numbers.values():\n if value > half:\n print('NO')\n exit()\n\nprint('YES')", "n = int(input())\r\narr = list(map(int, input().split()))\r\nd = {}\r\nfor i in arr:\r\n d.setdefault(i, [0])[0] += 1\r\n\r\nif len(arr) % 2 == 0:\r\n cond = len(arr) // 2 + 1\r\nelse:\r\n cond = len(arr) // 2 + 2\r\nfor i in d:\r\n if d[i][0] >= cond:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\nl = list(map(int,input().split()))\nif n == 1:\n print('YES')\nelse:\n from collections import Counter\n c = Counter(l)\n z = list(c.values())\n popa = n - max(z)\n if popa >= max(z) or popa == max(z)-1:\n print('YES')\n else:\n print('NO')\n", "n = int(input())\r\n\r\nl =input().split()\r\nmy_dict = {i:l.count(i) for i in l}\r\n\r\nm = max(my_dict.values())\r\n\r\nthres = n // 2 \r\nif (n % 2 ==1):\r\n thres +=1\r\n\r\nif m > thres:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "import collections\r\nn=int(input())\r\n\r\na=[i for i in map(int,input().split())]\r\nd=collections.Counter(a)\r\nx=[d[i] for i in d]\r\nif max(x)>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nvisited = {}\r\n\r\nfor num in a:\r\n if not num in visited:\r\n visited[num] = 0\r\n\r\n visited[num] += 1\r\n\r\nfor num in visited:\r\n if visited[num] > (n + 1) / 2:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ndiff ={}\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n for elem in a:\r\n if elem in diff:\r\n diff[elem] += 1\r\n else:\r\n diff[elem] = 1\r\n s = 0\r\n for j in diff:\r\n s += diff[j]\r\n\r\n for elem in diff:\r\n if diff[elem] == n:\r\n print('NO')\r\n break\r\n elif diff[elem] > s - diff[elem] + 1:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in (set(ls)):\r\n if ls.count(i)>counter:\r\n counter=ls.count(i)\r\nprint(\"YES\" if counter <= math.ceil(n/2) else \"NO\")", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(1004)]\r\n is_answer_given = False\r\n for i in range(len(a)):\r\n hash_a[a[i]] += 1\r\n for i in range(len(hash_a)):\r\n if hash_a[i] > math.ceil(len(a) / 2):\r\n print(\"NO\")\r\n is_answer_given = True\r\n break\r\n if not is_answer_given:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "n = int(input())\r\n\r\nls = list(map(int, input().split()))\r\n\r\ncnt = dict()\r\n\r\nans = True\r\n\r\nfor el in ls:\r\n if el not in cnt:\r\n cnt[el] = 1\r\n else:\r\n cnt[el] += 1\r\n if cnt[el] > (n + 1) // 2:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "def perms(dic,n):\r\n for ele in dic:\r\n if dic[ele]> (n+1)//2:\r\n return 'NO'\r\n \r\n return 'YES'\r\nn= int(input())\r\nl= list(map(int, input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if l[i] not in dic:\r\n dic[l[i]]=1\r\n else:\r\n dic[l[i]]+=1\r\n\r\nprint(perms(dic, n))\r\n", "import sys\r\nn=int(input())\r\na=list(sys.stdin.readline().strip().split())\r\ncount={}\r\nfor i in a:\r\n if i in count.keys():\r\n count[i]+=1\r\n else:\r\n count[i]=1\r\nli=list(count.values())\r\nli.sort()\r\nif li[len(li)-1]>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import ceil\r\nn = int(input())\r\nnums = list(input().split())\r\ncounts = {}\r\nfor i in range(n):\r\n if nums[i] not in counts:\r\n counts[nums[i]] = 0\r\n counts[nums[i]] += 1\r\n\r\nmaxcount = 0\r\nfor key in counts:\r\n if counts[key] > maxcount:\r\n maxcount = counts[key]\r\n \r\nif maxcount <= ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncnt=1\r\nmaxx=1\r\nfor i in range(1,t):\r\n if(l[i]==l[i-1]):\r\n cnt+=1\r\n maxx=max(cnt,maxx)\r\n else:\r\n cnt=1\r\n\r\nif(maxx<=((t+1)/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ndic = Counter(a)\r\nif len(dic)==n:\r\n print('YES')\r\nelif(len(dic)==1):\r\n print('NO')\r\nelse:\r\n f=0\r\n for k in dic:\r\n v =dic[k]\r\n if(v>(n+1)//2):\r\n print('NO')\r\n f=1\r\n break\r\n\r\n if f==0:\r\n print('YES')", "n = int(input())\r\nv = list(map(int, input().split()))\r\nsol = 'YES'\r\n\r\nfor x in v:\r\n if v.count(x) * 2 > n + 1: sol = 'NO'\r\n\r\nprint(sol)\r\n", "n=int(input());l=list(map(int,input().split()));d=n-n//2;s=set(l)\r\nfor i in list(s):\r\n\ta=l.count(i)\r\n\tif a<=d:pass\r\n\telse:print('NO');break\r\nelse:print('YES')", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nfor i in a:\n if a.count(i) > (n + 1) // 2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\ne = set()\r\nd = []\r\nfor i in range(n):\r\n\tif s[i] not in e:\r\n\t\td.append(s.count(s[i]))\r\n\t\te.add(s[i])\r\n\r\nif max(d)>-(-n//2):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")" ]	{"inputs": ["1\n1", "3\n1 1 2", "4\n7 7 7 7", "4\n479 170 465 146", "5\n996 437 605 996 293", "6\n727 539 896 668 36 896", "7\n674 712 674 674 674 674 674", "8\n742 742 742 742 742 289 742 742", "9\n730 351 806 806 806 630 85 757 967", "10\n324 539 83 440 834 640 440 440 440 440", "7\n925 830 925 98 987 162 356", "68\n575 32 53 351 151 942 725 967 431 108 192 8 338 458 288 754 384 946 910 210 759 222 589 423 947 507 31 414 169 901 592 763 656 411 360 625 538 549 484 596 42 603 351 292 837 375 21 597 22 349 200 669 485 282 735 54 1000 419 939 901 789 128 468 729 894 649 484 808", "22\n618 814 515 310 617 936 452 601 250 520 557 799 304 225 9 845 610 990 703 196 486 94", "44\n459 581 449 449 449 449 449 449 449 623 449 449 449 449 449 449 449 449 889 449 203 273 329 449 449 449 449 449 449 845 882 323 22 449 449 893 449 449 449 449 449 870 449 402", "90\n424 3 586 183 286 89 427 618 758 833 933 170 155 722 190 977 330 369 693 426 556 435 550 442 513 146 61 719 754 140 424 280 997 688 530 550 438 867 950 194 196 298 417 287 106 489 283 456 735 115 702 317 672 787 264 314 356 186 54 913 809 833 946 314 757 322 559 647 983 482 145 197 223 130 162 536 451 174 467 45 660 293 440 254 25 155 511 746 650 187", "14\n959 203 478 315 788 788 373 834 488 519 774 764 193 103", "81\n544 528 528 528 528 4 506 528 32 528 528 528 528 528 528 528 528 975 528 528 528 528 528 528 528 528 528 528 528 528 528 20 528 528 528 528 528 528 528 528 852 528 528 120 528 528 61 11 528 528 528 228 528 165 883 528 488 475 628 528 528 528 528 528 528 597 528 528 528 528 528 528 528 528 528 528 528 412 528 521 925", "89\n354 356 352 355 355 355 352 354 354 352 355 356 355 352 354 356 354 355 355 354 353 352 352 355 355 356 352 352 353 356 352 353 354 352 355 352 353 353 353 354 353 354 354 353 356 353 353 354 354 354 354 353 352 353 355 356 356 352 356 354 353 352 355 354 356 356 356 354 354 356 354 355 354 355 353 352 354 355 352 355 355 354 356 353 353 352 356 352 353", "71\n284 284 285 285 285 284 285 284 284 285 284 285 284 284 285 284 285 285 285 285 284 284 285 285 284 284 284 285 284 285 284 285 285 284 284 284 285 284 284 285 285 285 284 284 285 284 285 285 284 285 285 284 285 284 284 284 285 285 284 285 284 285 285 285 285 284 284 285 285 284 285", "28\n602 216 214 825 814 760 814 28 76 814 814 288 814 814 222 707 11 490 814 543 914 705 814 751 976 814 814 99", "48\n546 547 914 263 986 945 914 914 509 871 324 914 153 571 914 914 914 528 970 566 544 914 914 914 410 914 914 589 609 222 914 889 691 844 621 68 914 36 914 39 630 749 914 258 945 914 727 26", "56\n516 76 516 197 516 427 174 516 706 813 94 37 516 815 516 516 937 483 16 516 842 516 638 691 516 635 516 516 453 263 516 516 635 257 125 214 29 81 516 51 362 516 677 516 903 516 949 654 221 924 516 879 516 516 972 516", "46\n314 723 314 314 314 235 314 314 314 314 270 314 59 972 314 216 816 40 314 314 314 314 314 314 314 381 314 314 314 314 314 314 314 789 314 957 114 942 314 314 29 314 314 72 314 314", "72\n169 169 169 599 694 81 250 529 865 406 817 169 667 169 965 169 169 663 65 169 903 169 942 763 169 807 169 603 169 169 13 169 169 810 169 291 169 169 169 169 169 169 169 713 169 440 169 169 169 169 169 480 169 169 867 169 169 169 169 169 169 169 169 393 169 169 459 169 99 169 601 800", "100\n317 316 317 316 317 316 317 316 317 316 316 317 317 316 317 316 316 316 317 316 317 317 316 317 316 316 316 316 316 316 317 316 317 317 317 317 317 317 316 316 316 317 316 317 316 317 316 317 317 316 317 316 317 317 316 317 316 317 316 317 316 316 316 317 317 317 317 317 316 317 317 316 316 316 316 317 317 316 317 316 316 316 316 316 316 317 316 316 317 317 317 317 317 317 317 317 317 316 316 317", "100\n510 510 510 162 969 32 510 511 510 510 911 183 496 875 903 461 510 510 123 578 510 510 510 510 510 755 510 673 510 510 763 510 510 909 510 435 487 959 807 510 368 788 557 448 284 332 510 949 510 510 777 112 857 926 487 510 510 510 678 510 510 197 829 427 698 704 409 509 510 238 314 851 510 651 510 455 682 510 714 635 973 510 443 878 510 510 510 591 510 24 596 510 43 183 510 510 671 652 214 784", "100\n476 477 474 476 476 475 473 476 474 475 473 477 476 476 474 476 474 475 476 477 473 473 473 474 474 476 473 473 476 476 475 476 473 474 473 473 477 475 475 475 476 475 477 477 477 476 475 475 475 473 476 477 475 476 477 473 474 477 473 475 476 476 474 477 476 474 473 477 473 475 477 473 476 474 477 473 475 477 473 476 476 475 476 475 474 473 477 473 475 473 477 473 473 474 475 473 477 476 477 474", "100\n498 498 498 498 498 499 498 499 499 499 498 498 498 498 499 498 499 499 498 499 498 498 498 499 499 499 498 498 499 499 498 498 498 499 498 499 498 498 498 499 498 499 498 498 498 498 499 498 498 499 498 498 499 498 499 499 498 499 499 499 498 498 498 498 499 498 499 498 499 499 499 499 498 498 499 499 498 499 499 498 498 499 499 498 498 499 499 499 498 498 499 498 498 498 499 499 499 498 498 499", "100\n858 53 816 816 816 816 816 816 816 181 816 816 816 816 579 879 816 948 171 816 816 150 866 816 816 816 897 816 816 816 816 816 816 706 816 539 816 816 816 816 816 816 423 487 816 615 254 816 816 816 816 83 816 816 816 816 816 816 816 816 816 816 816 136 775 999 816 816 816 644 816 816 816 816 927 816 802 816 856 816 816 816 816 816 816 816 816 816 816 700 816 816 816 816 982 477 816 891 806 816", "100\n167 169 169 167 169 169 167 167 167 167 168 166 170 170 169 170 170 170 169 168 166 167 170 169 167 169 168 169 166 170 166 167 170 166 166 167 169 166 166 169 166 167 168 168 170 167 168 166 168 170 167 168 167 169 169 166 168 167 170 168 167 169 168 169 166 168 168 169 169 166 170 168 167 169 170 168 167 169 168 167 168 168 166 169 170 170 166 166 167 170 167 168 167 167 169 169 166 166 169 167", "100\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "99\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "100\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "99\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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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\n1 1", "1\n1000", "12\n2 2 4 4 4 4 6 6 6 6 6 6"], "outputs": ["YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	440
d6450d9766b2a425003aff887bf2eda8	Pyramid of Glasses	Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is n. The top level consists of only 1 glass, that stands on 2 glasses on the second level (counting from the top), then 3 glasses on the third level and so on.The bottom level consists of n glasses. Vlad has seen in the movies many times how the champagne beautifully flows from top levels to bottom ones, filling all the glasses simultaneously. So he took a bottle and started to pour it in the glass located at the top of the pyramid. Each second, Vlad pours to the top glass the amount of champagne equal to the size of exactly one glass. If the glass is already full, but there is some champagne flowing in it, then it pours over the edge of the glass and is equally distributed over two glasses standing under. If the overflowed glass is at the bottom level, then the champagne pours on the table. For the purpose of this problem we consider that champagne is distributed among pyramid glasses immediately. Vlad is interested in the number of completely full glasses if he stops pouring champagne in t seconds. Pictures below illustrate the pyramid consisting of three levels. The only line of the input contains two integers n and t (1<=≤<=n<=≤<=10,<=0<=≤<=t<=≤<=10<=000) — the height of the pyramid and the number of seconds Vlad will be pouring champagne from the bottle. Print the single integer — the number of completely full glasses after t seconds. Sample Input 3 5 4 8 Sample Output 4 6	[ "#!/usr/bin/env python\n# coding: utf-8\n\n# In[24]:\n\n\nclass Solution:\n def fillCups(self, idx, array, level,volume):\n if(idx>=len(array) or volume == 0):\n return\n array[idx]+=volume\n if(array[idx]<1):\n return \n volume = array[idx]-1\n array[idx]=1\n left = level + idx\n right = left + 1\n self.fillCups(left, array, level+1, volume/2)\n self.fillCups(right, array, level+1, volume/2)\n \n def pyramidOfGlasses(self,levels,time):\n array=[0 for i in range((levels(levels+1))//2)]\n self.fillCups(0,array,1,time1.0)\n return array.count(1)\n\n\n# In[25]:\n\n\nlevels, time = map(int, input().split())\nsol=Solution()\ncount = sol.pyramidOfGlasses(levels, time)\nprint(count)\n\n\n# In[ ]:\n\n\n\n\n", "n,t=map(int,input().split())\r\n\r\nif t==0:\r\n\tprint(0)\r\n\texit()\r\n\r\nans=0\r\nl=[t]\r\nfor s in range(2,n+1):\r\n\ta=[0]s\r\n\tfor i in range(s-1):\r\n\t\tif l[i]>=1:\r\n\t\t\tans+=1\r\n\t\t\trem=(l[i]-1)/2\r\n\t\t\ta[i]+=rem\r\n\t\t\ta[i+1]+=rem\r\n\tl=a\r\nfor i in range(n):\r\n\tif l[i]>=1:ans+=1\r\nprint(ans)\r\n\r\n", "class Solution:\r\n def PourLiquid(self):\r\n Grid[1][1] += 1\r\n for i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if Grid[i][j]<=1: continue\r\n p = Grid[i][j]-1\r\n Grid[i][j] = 1\r\n Grid[i+1][j] += p/2\r\n Grid[i+1][j+1] += p/2\r\n return\r\n def GlassesFilled(self,n,t):\r\n global Grid\r\n Grid = [[0 for i in range(12)]for j in range(12)]\r\n count = 0\r\n for T in range(t):\r\n self.PourLiquid()\r\n for i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if Grid[i][j] >=1: count += 1\r\n return count\r\nif __name__==\"__main__\":\r\n n,t = map(int,input().split())\r\n s = Solution()\r\n print(s.GlassesFilled(n,t))", "from collections import deque\nn, t = list(map(int, input().split()))\nnum_glasses = n(n+1)//2\nglasses = [[0]n for _ in range(n)]\n\ndef simulate(i, j, time):\n if i>=n or j>=n:\n return\n if time>1-glasses[i][j]:\n time -= (1 - glasses[i][j])\n glasses[i][j] = 1\n \n simulate(i+1, j, time/2)\n simulate(i+1, j+1, time/2)\n\n else:\n glasses[i][j] += time\n\n\nsimulate(0, 0, t)\n\nans = 0\nfor g in glasses:\n ans += sum([x>=1 for x in g])\n # print(g)\n\nprint(ans)\n\n\n ", "n,k=map(int,input().split())\r\narray=[[0 for i in range(j)] for j in range(1,n+1)]\r\narray[0][0]=k\r\nfor i in range(n-1):\r\n for j in range(i+1):\r\n val=array[i][j]-1\r\n if val>0:\r\n array[i+1][j]+=val/2\r\n array[i+1][j+1]+=val/2\r\n array[i][j]=1\r\ns=0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if array[i][j]>=1:\r\n s+=1\r\nprint(s)", "def a(level,col,lt):\r\n if cnt[0]==s or level>=n:\r\n return\r\n if filled[level][col]<1.0:\r\n if lt+filled[level][col]>=1.0:\r\n lt-=(1.0-filled[level][col])\r\n filled[level][col]=1.0\r\n cnt[0]+=1\r\n else:\r\n filled[level][col]+=lt\r\n lt=0.0\r\n if filled[level][col]==1.0:\r\n a(level+1, col, lt/2)\r\n a(level+1, col+1, lt/2)\r\nn,t=[int(x) for x in input().split()]\r\ns=0\r\ncnt=[0]\r\nfilled=[]\r\nfor r in range(n):\r\n filled.append([0.0 for c in range(r+1)])\r\n s+=r+1\r\na(0,0,float(t))\r\nprint(cnt[0])\r\n", "inputs = [int(items) for items in input().split()]\r\nn = inputs[0]\r\nhours = inputs[1]\r\nglasses=[0 for i in range(0,100)]\r\ndef fill_glasses(hours,level,glass,final_level):\r\n if hours == 0 or level > final_level:\r\n return\r\n if glasses[glass]==1:\r\n fill_glasses((hours/2),level+1,glass+level,final_level)\r\n fill_glasses((hours/2),level+1,glass+level+1,final_level)\r\n else:\r\n surplus_amount = 1-glasses[glass]\r\n if surplus_amount > hours :\r\n glasses[glass]+=hours\r\n hours =0\r\n else:\r\n glasses[glass]=1\r\n hours -= surplus_amount\r\n fill_glasses((hours / 2), level+1, glass + level, final_level)\r\n fill_glasses((hours / 2), level+1, glass + level+1, final_level)\r\n\r\n\r\nfill_glasses(hours,1,1,n)\r\ncount =0\r\nfor i in glasses:\r\n if i ==1:\r\n count+=1\r\nprint(count)\r\n", "def func(arr, i, j, qty):\n global n\n if i > n:\n return\n arr[i][j] += qty\n if (arr[i][j] > 1):\n func(arr, i+1, j, ((arr[i][j]-1)/2))\n func(arr, i+1, j+1, ((arr[i][j]-1)/2))\n arr[i][j] = 1\nn, t = map(int, input().split())\narr = [[0 for i in range(n+1)] for i in range(n+1)]\nfunc(arr,1,1,t)\nans = 0\nfor i in arr:\n for j in i:\n if j == 1:\n ans += 1\nprint(ans)", "n,t=list(map(int,input().split()))\r\nli=[[t-1]]\r\ncnt=1 if t-1>=0 else 0\r\nfor i in range(2,n+1):\r\n tr=li[-1][0]/2-1\r\n if tr>=0:\r\n cnt+=2\r\n li.append([tr])\r\n for j in range(1,i-1):\r\n a=li[-2][j-1]\r\n b=li[-2][j]\r\n temp=-1\r\n if a >0 :\r\n temp+=a/2\r\n if b>0:\r\n temp+=b/2\r\n if temp>=0:\r\n cnt+=1\r\n li[-1].append(temp)\r\n li[-1].append(tr)\r\nprint(cnt)", "n, m = map(int, input().split())\r\nans = []\r\n\r\nfor i in range(1,12):\r\n ans.append([0]i)\r\ntotal = 1024m\r\ni = 0\r\nans[0][0] = total\r\nwhile i<n:\r\n for j in range(i+1):\r\n if ans[i][j] > 1024:\r\n extra = ans[i][j] - 1024\r\n ans[i][j] = 1024\r\n ans[i+1][j+1] += extra//2\r\n ans[i+1][j] += extra//2\r\n i+=1\r\na = 0\r\nfor i in range(n):\r\n a+= ans[i].count(1024)\r\nprint(a)", "n,t=map(int,input().split())\r\ndp=[[t]]\r\nfor i in range(n-1):\r\n temp=[0](len(dp[-1])+1)\r\n for j in range(len(dp[-1])):\r\n pour=(dp[-1][j]-1 )/2\r\n if pour>0:\r\n temp[j]+=pour\r\n temp[j+1]+=pour\r\n dp.append(temp)\r\nans=0\r\nfor el in dp:\r\n for p in el:\r\n if p>=1:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n ", "numm, t = map(int, input().split())\ndef solution(r, t, numm):\n frontier = [t]\n ct = 0\n while r < numm:\n nxt = [0] * (r+1)\n for i in range(len(frontier)):\n if frontier[i] >= 1:\n ct += 1\n extra = (frontier[i] - 1)/2\n nxt[i] += extra\n nxt[i+1] += extra\n frontier = nxt\n r += 1\n for i in frontier:\n if i >= 1:\n ct += 1\n return ct\n\nprint(solution(1, t, numm))\n\t \t \t \t \t \t \t \t\t \t\t\t\t \t", "sai, teja = map(int, input().split())\r\n\r\n\r\ndef s(r, teja, sai):\r\n f = [teja]\r\n c = 0\r\n while r < sai:\r\n n = [0] * (r+1)\r\n for i in range(len(f)):\r\n if f[i] >= 1:\r\n c += 1\r\n e = (f[i] - 1)/2\r\n n[i] += e\r\n n[i+1] += e\r\n f = n\r\n r += 1\r\n for i in f:\r\n if i >= 1:\r\n c += 1\r\n\r\n\r\n return c\r\n\r\n\r\nprint(s(1, teja, sai))", "n,t=map(int,input().split())\r\nans,b=0,1<<n\r\na=[[0]11 for i in range(11)]\r\na[0][0]=t(1<<n)\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if a[i][j]>=b: a[i+1][j]+=(a[i][j]-b)//2; a[i+1][j+1]+=(a[i][j]-b)//2; ans+=1\r\nprint(ans)", "from fractions import Fraction\n\nn, t = map(int, input().split())\n\nglasses = []\nfor level in range(n):\n glasses.append([])\n for glass in range(level+1):\n glasses[level].append(Fraction(0))\n\nglasses[0][0] += Fraction(t)\n\nresult = 0\n\nfor level in range(n):\n for glass in range(level+1):\n if glasses[level][glass] >= Fraction(1):\n result += 1\n to_add = (glasses[level][glass]-1)/2\n if level+1 < n:\n glasses[level+1][glass+1] += to_add\n glasses[level+1][glass] += to_add\n\nprint(result)", "l=list(map(int,input().split()))\r\nn=l[0]\r\nt=float(l[1])\r\ndp=[[float(0) for x in range(12)] for j in range(12)]\r\nans=0\r\ndp[0][0]=t\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if dp[i][j]>=float(1):\r\n ans+=1\r\n dp[i+1][j]+=float((dp[i][j]-float(1))/float(2.0))\r\n dp[i+1][j+1] += float((dp[i][j] - float(1.0)) / float(2.0))\r\n\r\nprint(ans)\r\n", "# from fractions import Fraction\n\nn, t = map(int, input().split())\n\nglasses = []\nfor level in range(n):\n glasses.append([])\n for glass in range(level+1):\n glasses[level].append(0.0)\n\nglasses[0][0] += float(t)\n\nresult = 0\n\nfor level in range(n):\n for glass in range(level+1):\n if glasses[level][glass] >= 1.0:\n result += 1\n to_add = (glasses[level][glass]-1)/2\n if level+1 < n:\n glasses[level+1][glass+1] += to_add\n glasses[level+1][glass] += to_add\n\nprint(result)", "n, t = map(int, input().split())\r\n\r\ntemp = []\r\nfor i in range(15):\r\n t1 = []\r\n for j in range(i+1):\r\n t1.append(0)\r\n temp.append(t1)\r\n\r\nans = 0\r\ntemp[1][1] = t\r\nfor j in range(1, n+1):\r\n for k in range(1, j+1):\r\n val = temp[j][k]\r\n if val >= 1:\r\n ans += 1\r\n temp[j+1][k] += ((val-1)/2)\r\n temp[j+1][k+1] += ((val-1)/2)\r\n\r\nprint(ans)\r\n", "# -- coding: utf-8 --\r\n\"\"\"\r\nCreated on Sat Feb 18 16:31:22 2023\r\n\r\n@author: Ali\r\n\"\"\"\r\ns = input()\r\nn,t = s.split(' ');t=int(t);n = int(n)\r\nar = [[0 for i in range(2n +1)] for j in range(n+1)]\r\nwhile t:\r\n t -=1 \r\n ar[0][n] += 1;\r\n for i in range(n):\r\n for j in range(2n+1):\r\n if ar[i][j] > 1:\r\n ar[i + 1][j+1] += (ar[i][j] - 1) / 2 \r\n ar[i+1][j-1] += (ar[i][j] - 1) / 2\r\n ar[i][j] = 1\r\n \r\nc = 0\r\nfor i in range(n):\r\n for j in range(2n+1):\r\n if ar[i][j] == 1:\r\n c +=1\r\n \r\nprint(c)\r\n \r\n \r\n", "n,t = map(int, input().split())\r\nl = [[0](i+1) for i in range(n+1)]\r\nl[0][0] = t\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if l[i][j] >= 1:\r\n ans += 1\r\n l[i+1][j] += (l[i][j]-1)/2 \r\n l[i+1][j+1] += (l[i][j]-1)/2 \r\nprint(ans)", "n,t = (int(e) for e in input().split())\r\na = []\r\nfor i in range(n):\r\n b = []\r\n for j in range(i+1):\r\n b.append(0)\r\n a.append(b)\r\n\r\ncurrent_row = 0\r\nfor x in range(t):\r\n for i in range(n):\r\n for j in range(i+1):\r\n if i == 0:\r\n a[i][j] += 1\r\n if a[i][j] > 1 and i+1 < n and j < 10:\r\n a[i+1][j]+=(a[i][j]-1)/2\r\n a[i+1][j+1]+=(a[i][j]-1)/2\r\n a[i][j] = 1\r\n if a[i][j] > 1 and i==n-1:\r\n a[i][j] = 1\r\n#print(a)\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if a[i][j] == 1:\r\n count += 1\r\nprint(count)\r\n", "n,t=map(int,input().split())\r\nglass=[[0 for i in range(0,n+1)] for j in range(0,n+1)]\r\nans=0\r\nglass[0][0]=t\r\nfor i in range(0,n):\r\n\tfor j in range(0,i+1):\r\n\t\tif(glass[i][j]>=1.0):\r\n\t\t\tt=glass[i][j]-1\r\n\t\t\tglass[i+1][j]+=(t/2)\r\n\t\t\tglass[i+1][j+1]+=(t/2)\r\n\t\t\tans+=1\r\nprint(ans)", "n,t=map(int,input().split())\r\n\r\nan=[[0 for i in range(j+1)] for j in range(n)]\r\n\r\n\r\ndef dfs(i,j,v):\r\n\tif an[i][j]+v>1:\r\n\t\tvv=v-(1-an[i][j])\r\n\t\tan[i][j]=1\r\n\t\tif i==n-1:return\r\n\t\tdfs(i+1,j,vv/2)\r\n\t\tdfs(i+1,j+1,vv/2)\r\n\t\treturn\r\n\td=1 if (j==0 or j==i) else 2\r\n\tan[i][j]+=v\r\n\r\nfor i in range(t):\r\n\tdfs(0,0,1)\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(i+1):\r\n\t\tans+=an[i][j]>=1\r\n\r\nprint(ans)", "n,t=input().split()\r\n\r\nn=int(n)\r\nt=int(t)\r\npojemnosc=1024\r\nileszampana=[[0 for i in range(n+1)] for i in range(n+1)]\r\n\r\nwynik=0\r\nileszampana[0][0]=tpojemnosc\r\nfor wiersz in range(n):\r\n for kolumna in range(wiersz+1):\r\n if ileszampana[wiersz][kolumna] >=pojemnosc:\r\n wynik+=1\r\n nadwyzka= ileszampana[wiersz][kolumna]-pojemnosc\r\n ileszampana[wiersz+1][kolumna]+=nadwyzka//2\r\n ileszampana[wiersz+1][kolumna+1]+=nadwyzka//2\r\nprint(wynik)", "h,t = map(int,input().split())\r\npyramid = [ [0]11 for i in range(11) ]\r\nfilled = 0\r\npyramid[0][0] = t\r\nfor i in range(h):\r\n for j in range(i+1):\r\n time = pyramid[i][j] - 1.0\r\n if time>=0:\r\n filled+=1\r\n pyramid[i+1][j]+=time/2\r\n pyramid[i+1][j+1]+=time/2\r\nprint(filled)\r\n", "n,t=list(map(int,input().split()))\r\na=[]\r\nfor i in range(10):\r\n row=[]\r\n for j in range(10):\r\n row.append(0)\r\n a.append(row)\r\n\r\ndef pour(level,loc,amount,a,n):\r\n if(loc>=n or level>=n):\r\n return\r\n if(a[level][loc]>=1):\r\n a[0][9]-=1\r\n a[level][loc]+=amount\r\n if(a[level][loc]>=1):\r\n a[0][9]+=1\r\n if(a[level][loc]>1):\r\n amount=a[level][loc]-1\r\n a[level][loc]=1\r\n amount=amount/2\r\n pour(level+1,loc,amount,a,n)\r\n pour(level+1,loc+1,amount,a,n)\r\n \r\n\r\npour(0,0,t,a,n)\r\n#print(a,sep=\"\\n\")\r\nprint(a[0][9])\r\n", "[n, t] = [int(x) for x in input().split()]\r\nmaxn = 11\r\npyr = [[0 for i in range(maxn)] for i in range(maxn)]\r\npyr[0][0] = t 1024\r\nsco = 0\r\nfor i in range(0 , n):\r\n for j in range(0, i + 1):\r\n if pyr[i][j] >= 1024:\r\n sco += 1\r\n pyr[i + 1][j] += (pyr[i][j] - 1024) // 2\r\n pyr[i + 1][j + 1] += (pyr[i][j] - 1024) // 2\r\nprint(sco)", "POJEMNOSC = 1024\r\nMAXN = 10 + 7\r\n\r\nileSzampana = [[0 for i in range(MAXN)] for i in range(MAXN)]\r\n\r\ndef main():\r\n\t(n,t) = tuple(map(int, input().split()))\r\n\r\n\twynik = 0\r\n\r\n\tileSzampana[0][0] = POJEMNOSC * t\r\n\tfor wiersz in range(0, n):\r\n\t\tfor kolumna in range(0, wiersz+1):\r\n\t\t\tif ileSzampana[wiersz][kolumna] >= POJEMNOSC:\r\n\t\t\t\twynik += 1\r\n\r\n\t\t\t\tnadwyzka = ileSzampana[wiersz][kolumna] - POJEMNOSC\r\n\t\t\t\tileSzampana[wiersz+1][kolumna] += nadwyzka // 2\r\n\t\t\t\tileSzampana[wiersz+1][kolumna+1] += nadwyzka // 2\r\n\r\n\tprint(wynik)\r\n\r\nmain()\r\n", "m,t=map(int,input().split())\r\nre=0\r\ntmp=[t]\r\nfor k in range(m):\r\n tmp2=[0](len(tmp)+1)\r\n for i,j in enumerate(tmp):\r\n if(j<1.0):\r\n continue\r\n re+=1\r\n tmp2[i]+=(j-1)/2\r\n tmp2[i+1]+=(j-1)/2\r\n # print(tmp,tmp2)\r\n tmp=tmp2\r\nprint(re)", "def sumy_prefiksowe(tab):\r\n l = len(tab)\r\n sums = [0 for x in range(l + 1)]\r\n for i in range(1, l + 1):\r\n sums[i] = tab[i - 1] + sums[i - 1]\r\n return sums\r\n\r\n\r\ndef main():\r\n n, t = list(map(int, input().split()))\r\n l = 1024\r\n glasses = [[0]x for x in range(1, n + 2)]\r\n glasses[0][0] = t * l\r\n score = 0\r\n\r\n for i in range(n):\r\n for j in range(i+1):\r\n if glasses[i][j] >= l:\r\n glasses[i][j] -= l\r\n score += 1\r\n glasses[i + 1][j] += glasses[i][j] / 2\r\n glasses[i + 1][j + 1] += glasses[i][j] / 2\r\n print(score)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, t = map(int, input().split())\r\nfull = 0\r\n\r\narr = [t]\r\n\r\nwhile n:\r\n n-=1\r\n temp = [0](len(arr)+1)\r\n for i,j in enumerate(arr):\r\n if j >= 1:\r\n full +=1\r\n temp[i] += (j-1)/2\r\n temp[i+1] += (j-1)/2\r\n \r\n arr = temp\r\n\r\nprint(full)", "n1, t = map(int, input().split())\ndef solution(n, t, n1):\n frontier = [t]\n t1 = 0\n while n < n1:\n nxt = [0] (n+1)\n for i in range(len(frontier)):\n if frontier[i] >= 1:\n t1 += 1\n extra = (frontier[i] - 1)/2\n nxt[i] += extra\n nxt[i+1] += extra\n frontier = nxt\n n += 1\n for i in frontier:\n if i >= 1:\n t1 += 1\n return t1\n\nprint(solution(1, t, n1))\n \t \t \t \t\t \t \t\t \t \t", "n,t=map(int,input().split())\r\ndef pyramid(n,t):\r\n glasses=[[0 for i in range(j+1)]for j in range(n)]\r\n def fill(glasses,n):\r\n glasses[0][0]+=1\r\n overflow(glasses,n)\r\n def overflow(glasses,n):\r\n for i in range(len(glasses)):\r\n for j in range(len(glasses[i])):\r\n if glasses[i][j]>1 and i!=n-1:\r\n glasses[i+1][j]+=(glasses[i][j]-1)/2\r\n glasses[i+1][j+1]+=(glasses[i][j]-1)/2\r\n glasses[i][j]=1\r\n for i in range(t):\r\n fill(glasses,n) \r\n cnt=0\r\n for i in glasses:\r\n for j in i:\r\n if j>=1:\r\n cnt+=1\r\n return cnt\r\nprint(pyramid(n,t))", "n, t = map(int, input().split())\r\n\r\n\r\ndef solve(r, t, n):\r\n frontier = [t]\r\n count = 0\r\n while r < n:\r\n nxt = [0] * (r+1)\r\n for i in range(len(frontier)):\r\n if frontier[i] >= 1:\r\n count += 1\r\n extra = (frontier[i] - 1)/2\r\n nxt[i] += extra\r\n nxt[i+1] += extra\r\n frontier = nxt\r\n r += 1\r\n for i in frontier:\r\n if i >= 1:\r\n count += 1\r\n\r\n\r\n return count\r\n\r\n\r\nprint(solve(1, t, n))\r\n", "n, t = map(int, input().split())\r\n\r\n\r\ndef solve(r, t, n):\r\n f = [t]\r\n count = 0\r\n while r < n:\r\n nxt = [0] * (r+1)\r\n for i in range(len(f)):\r\n if f[i] >= 1:\r\n count += 1\r\n extra = (f[i] - 1)/2\r\n nxt[i] += extra\r\n nxt[i+1] += extra\r\n f = nxt\r\n r += 1\r\n for i in f:\r\n if i >= 1:\r\n count += 1\r\n\r\n\r\n return count\r\n\r\n\r\nprint(solve(1, t, n))", "# https://codeforces.com/contest/676/problem/B\r\n\r\nn, t = [int(i) for i in input().split(' ')]\r\n\r\npyramid = []\r\nfor i in range(n+1):\r\n temp_arr = []\r\n for j in range(i):\r\n temp_arr.append(0)\r\n pyramid.append(temp_arr)\r\n# pyramid.reverse()\r\n\r\ndef get_num_filed(num, time, level, glass, input_per_second=1):\r\n if time == 0:\r\n return\r\n if num == 0:\r\n return\r\n time_remaining = time\r\n while(pyramid[level][glass] < 1 and time_remaining > 0):\r\n time_remaining-=1\r\n pyramid[level][glass] += input_per_second\r\n # print(num, time, level, glass, input_per_second, time_remaining)\r\n if pyramid[level][glass] >= 1:\r\n get_num_filed(num-1, time_remaining, level+1, glass, input_per_second/2)\r\n get_num_filed(num-1, time_remaining, level+1, glass+1, input_per_second/2)\r\n return\r\n # for i in range(0, 1, 0):\r\n # time_spend += 1\r\n # i = i+input_per_second\r\n # if time_spend > time:\r\n # return\r\n # pyramid[level][glass] = 1\r\n\r\nget_num_filed(n, t, 1, 0, 1)\r\n# print(pyramid)\r\ntotal = 0\r\nfor i in pyramid:\r\n for j in i:\r\n if j >=1:\r\n total+=1\r\nprint(total)", "MAXN = 10 + 7\r\nPOJEMNOSC = 1024\r\n\r\nileSzampana = [[0 for i in range(MAXN)] for i in range(MAXN)]\r\n\r\nn, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\n\r\nwynik = 0\r\n\r\nileSzampana[0][0] = t * POJEMNOSC\r\nfor wiersz in range(0, n):\r\n\tfor kolumna in range(0, wiersz+1):\r\n\r\n\t\tif ileSzampana[wiersz][kolumna] >= POJEMNOSC:\r\n\r\n\t\t\t# ten kubek na pewno jest wypelniony\r\n\t\t\twynik = wynik + 1\r\n\r\n\t\t\tnadwyzka = ileSzampana[wiersz][kolumna] - POJEMNOSC\r\n\t\t\tileSzampana[wiersz + 1][kolumna] += nadwyzka // 2\r\n\t\t\tileSzampana[wiersz + 1][kolumna + 1] += nadwyzka // 2\r\n\t\t\r\nprint(wynik)\r\n", "n,t = map(int,input().split())\r\nA=[[0 for i in range(11)] for i in range(12)]\r\nA[0][0] = t\r\nindex = 1\r\nresult = 0\r\nwhile 1:\r\n #print(index)\r\n temp = 0\r\n for i in range(index):\r\n if(A[index-1][i]>=1):\r\n result+=1\r\n temp = A[index-1][i]\r\n temp -=1\r\n A[index][i]+=temp/2\r\n A[index][i+1]+=temp/2\r\n if index == n:\r\n break\r\n index+=1\r\nprint(result)\r\n \r\n\r\n", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n, t = map(int, input().split())\r\n size = n * (n + 1) // 2\r\n\r\n p = [[0] for i in range(size)]\r\n\r\n it = 0\r\n eps = 10 ** (-9)\r\n\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n p[it].append(level)\r\n it += 1\r\n\r\n # simulation\r\n for time in range(t):\r\n p[0][0] += 1\r\n it = 0\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n if level == n:\r\n p[it][0] = min(1, p[it][0])\r\n else:\r\n extra = max(0, p[it][0] - 1)\r\n p[it][0] -= extra\r\n p[it + level][0] += extra / 2\r\n p[it + level + 1][0] += extra / 2\r\n\r\n it += 1\r\n\r\n res = 0\r\n it = 0\r\n\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n if abs(1 - p[it][0]) < eps:\r\n res += 1\r\n it += 1\r\n\r\n print(res)\r\n #print(p)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n" ]	{"inputs": ["3 5", "4 8", "1 1", "10 10000", "1 10000", "10 1", "1 0", "10 0", "10 1022", "10 1023", "10 1024", "1 2", "1 200", "7 128", "8 198", "2 2", "2 3", "2 4", "2 100", "2 10000", "3 7", "3 6", "3 8", "3 12", "3 1", "4 15", "4 14", "4 10", "4 16", "4 999", "4 9", "5 31", "5 30", "5 28", "5 25", "5 15", "5 32", "5 9999", "5 4", "5 9", "5 14", "6 63", "6 62", "6 61", "6 52", "6 31", "6 32", "6 39", "6 15", "6 14", "6 10", "6 4", "6 7653", "7 127", "6 64", "7 126", "7 125", "7 120", "7 98", "7 110", "7 65", "7 63", "7 15", "7 3", "7 1", "7 83", "7 214", "8 2555", "8 257", "8 256", "8 255", "8 254", "8 253", "8 251", "8 240", "8 128", "8 127", "8 100", "8 1", "8 0", "8 10000", "8 94", "8 33", "9 10000", "9 513", "9 512", "9 511", "9 510", "9 255", "9 256", "9 254", "9 253", "9 200", "9 100", "9 150", "10 9999", "10 1025", "10 1021", "10 512", "10 689", "10 754", "10 985", "10 255", "10 256", "10 254", "10 153", "10 2", "10 3", "10 5", "10 63", "10 64", "10 126", "10 127", "10 128", "10 55", "10 9", "10 37", "10 68", "3 4", "7 23", "1 3"], "outputs": ["4", "6", "1", "55", "1", "1", "0", "0", "53", "55", "55", "1", "1", "28", "34", "1", "3", "3", "3", "3", "6", "4", "6", "6", "1", "10", "8", "8", "10", "10", "8", "15", "13", "13", "13", "13", "15", "15", "3", "8", "11", "21", "19", "19", "19", "19", "19", "19", "13", "11", "8", "3", "21", "28", "21", "26", "26", "26", "26", "26", "26", "26", "13", "3", "1", "26", "28", "36", "36", "36", "36", "34", "34", "34", "34", "34", "34", "32", "1", "0", "36", "32", "26", "45", "45", "45", "45", "43", "43", "43", "41", "41", "41", "37", "41", "55", "55", "53", "53", "53", "53", "53", "51", "51", "49", "47", "1", "3", "4", "41", "41", "45", "47", "47", "37", "8", "33", "41", "3", "20", "1"]}	UNKNOWN	PYTHON3	CODEFORCES	39
d6524006b988fe4a1c2e7fe334ad52cc	Jabber ID	Jabber ID on the national Berland service «Babber» has a form <username>@<hostname>[/resource], where - <username> — is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of <username> is between 1 and 16, inclusive. - <hostname> — is a sequence of word separated by periods (characters «.»), where each word should contain only characters allowed for <username>, the length of each word is between 1 and 16, inclusive. The length of <hostname> is between 1 and 32, inclusive. - <resource> — is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of <resource> is between 1 and 16, inclusive. The content of square brackets is optional — it can be present or can be absent. There are the samples of correct Jabber IDs: [[email protected]](/cdn-cgi/l/email-protection), [[email protected]](/cdn-cgi/l/email-protection)/contest. Your task is to write program which checks if given string is a correct Jabber ID. The input contains of a single line. The line has the length between 1 and 100 characters, inclusive. Each characters has ASCII-code between 33 and 127, inclusive. Print YES or NO. Sample Input [email protected] [email protected]/contest.icpc/12 Sample Output YES NO	[ "import re\r\n\r\ns = input()\r\nreg = re.compile(r'^\\w{1,16}@(\\w{1,16}\\.)\\w{1,16}(/\\w{1,16})?$')\r\n \r\nif reg.match(s):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import re\r\n \r\nreg = re.match(r'^\\w{1,16}@(?P<host>(\\w{1,16}\\.)\\w{1,16})(/\\w{1,16})?$', input())\r\nif reg and len(reg.group('host')) <= 32:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "'''\r\ndef userName(username):\r\n if len(username) < 1 or len(username) > 16:\r\n return -1\r\n for item in username:\r\n if item < '0' or item > 'w' and item != '_':\r\n return -1\r\n return 1\r\n\r\n\r\ndef hostName(hostname):\r\n if len(hostname) < 1 or len(hostname) > 32:\r\n return -1\r\n for item in hostname:\r\n\r\n\r\n\r\n\r\nline = input()\r\nindOfAt = line.index('@')\r\nusername = line[0:indOfAt]\r\nhostname = line[indOfAt + 1:line.rindex('.')]\r\n'''\r\n\r\n\r\ndef check(line):\r\n ln = len(line)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for it in line:\r\n if not ('A' <= it <= 'Z' or\r\n 'a' <= it <= 'z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n ln = len(hostName)\r\n if ln == 0 or ln > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail, isUser, isHost, isRes = input(), False, False, False\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n hostName = mail[atIndex + 1: mail.index('/')] if '/' in mail else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if '/' not in mail:\r\n isRes = True\r\n else:\r\n isRes = check(mail[mail.index('/') + 1:])\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "import re\r\nif re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})(\\/\\w{1,16})?$', input()) :\r\n print( \"YES\" )\r\nelse :\r\n print( \"NO\" )", "#!/usr/bin/env python3\nimport re\n\ns = input()\nok = True\nm = re.match(r'^[A-Za-z0-9_]{1,16}@([A-Za-z0-9_.]{1,32})(/[A-Za-z0-9_]{1,16})?$', s)\nif m:\n m2 = re.match(r'^[A-Za-z0-9_]{1,16}(\\.[A-Za-z0-9_]{1,16})$', m.group(1))\n if not m2:\n ok = False\nelse:\n ok = False\n\nif ok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import re\r\nm = re.match(r\"^\\w{1,16}@(?P<hostname>\\w{1,16}(?:\\.\\w{1,16}))(?:\\/\\w{1,16})?$\", input())\r\nprint(\"NO\" if m == None or len(m.group(\"hostname\")) > 32 else \"YES\")", "def check(txt: str) -> bool:\r\n ln = len(txt)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for item in txt:\r\n if not ('a' <= item <= 'z' or\r\n 'A' <= item <= 'Z' or\r\n '0' <= item <= '9' or\r\n item == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName: str) -> bool:\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n slashInd = mail.index('/') if '/' in mail else -1\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n hostName = mail[atIndex + 1: slashInd] if slashInd != -1 else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd+1:]\r\n isRes = check(resource)\r\n'''\r\nif isUser and isHost and isRes:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "a=input()\r\n\r\nff=True\r\nif len(a.split('@'))!=2:\r\n ff=False\r\nif ff:\r\n if (len(a.split('@')[0])==0) or (len(a.split('@')[1])==0):\r\n ff=False\r\n if ff:\r\n l=a.split('@')[0]\r\n k=len(l)\r\n for i in range(k):\r\n if not((l[i]=='_')or((l[i]>='A') and (l[i]<='Z'))or((l[i]>='a')and(l[i]<='z')or((l[i]>='0') and (l[i]<='9')))):\r\n ff=False\r\n break\r\n if ff:\r\n r=a.split('@')[1].split('/')\r\n for i in range(len(r)):\r\n if (len(r[i])==0):\r\n ff=False\r\n break\r\n if ff:\r\n l=r[0].split('.')\r\n for i in range(len(l)):\r\n if (len(l[i])==0):\r\n ff=False\r\n break\r\n for j in range(len(l[i])):\r\n if not((l[i][j]=='_')or((l[i][j]>='A') and (l[i][j]<='Z'))or((l[i][j]>='a')and(l[i][j]<='z')or((l[i][j]>='0') and (l[i][j]<='9')))):\r\n ff=False\r\n break\r\n if not ff:\r\n break\r\n if ff:\r\n for i in range(1,len(r)):\r\n for j in range(len(r[i])):\r\n if not((r[i][j]=='_')or((r[i][j]>='A') and (r[i][j]<='Z'))or((r[i][j]>='a')and(r[i][j]<='z')or((r[i][j]>='0') and (r[i][j]<='9')))):\r\n ff=False\r\n break\r\n if not ff:\r\n break\r\nif ff:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re \r\ns = input()\r\nprint(\"YES\" if re.fullmatch(\"^\\\\w{1,16}@(\\\\w{1,16}\\\\.)\\\\w{1,16}(\\\\/\\\\w{1,16})?$\",s) else \"NO\")", "def bhaago():\n print('NO')\n exit(0)\ndef type1(s):\n if not (len(s) >= 1 and len(s) <=16):\n bhaago()\n for i in s:\n if not (i.isalpha() or i.isdigit() or i == '_'):\n bhaago()\ns = input()\nif not(s[0].isalpha() or s[0].isdigit() or s[0] == '_'):\n bhaago()\nt1 = s.split('@')\nif len(t1) != 2:\n bhaago()\nusername = t1[0]\ntype1(username)\nt2 = t1[1].split('/')\nif len(t2) > 2:\n bhaago()\nhostname = t2[0]\nif not (len(hostname) >= 1 and len(hostname) <=32):\n bhaago()\nfor sep in hostname.split('.'):\n type1(sep)\nif len(t2) == 1:\n print('YES')\n exit(0)\nresource = t2[1]\ntype1(resource)\nprint('YES')", "# LUOGU_RID: 101919121\nimport re\r\nprint(re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})(\\/\\w{1,16})?$', input()) and 'YES' or 'NO')", "import re\r\ns=input()\r\npattern=\"^\\w{1,16}@\\w{1,16}(\\.[\\w]{1,16})(/\\w{1,16})?$\"\r\nif re.search(pattern,s):\r\n idx=s.find(\"@\")\r\n idx2=s.find(\"/\")\r\n if idx2==-1:\r\n idx2=len(s)\r\n if 1<=idx2-idx-1<=32:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import re\r\ntext=input( )\r\nans=re.compile(\"^\\w{1,16}@(\\w{1,16}\\.)\\w{1,16}(\|/\\w{1,16})$\")\r\nif ans.match(text) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\t \t \t", "def check(line):\r\n _len = len(line)\r\n if _len == 0 or _len > 16:\r\n return False\r\n for it in line:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _len = len(hostName)\r\n if _len == 0 or _len > 32:\r\n return False\r\n tokens = hostName.split('.')\r\n for item in tokens:\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nmail, isUser, isHost, isRes = input(), False, False, False\r\nif '@' in mail:\r\n atInd = mail.index('@')\r\n userName = mail[:atInd]\r\n isUser = check(userName)\r\n slashInd = mail.index('/') if '/' in mail else -1\r\n hostName = mail[atInd + 1:slashInd] if slashInd != -1 else mail[atInd + 1:]\r\n isHost = checkHost(hostName)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "\"\"\"Jabber ID\"\"\"\r\nimport re\r\n\r\ndef main():\r\n s = input()\r\n reg = re.compile(r'^\\w{1,16}@(\\w{1,16}\\.)\\w{1,16}(/\\w{1,16})?$')\r\n \r\n if reg.match(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import re\r\nstringInput = input()\r\nregex = re.compile(\r\n r\"^([0-9a-zA-Z_])+@([0-9a-zA-Z_]+\\.)([0-9a-zA-Z_])+(/([0-9a-zA-Z_])+)$\")\r\n\r\nif regex.match(stringInput) is not None:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ivu(uname):\n if 1 > len(uname) or len(uname) > 16:\n return 0\n for ch in uname:\n if ch not in \"qwertyuiopasdfghhjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM1234567890_\":\n return 0\n return 1\n\ndef do():\n f = input()\n if f.count('@') != 1:\n return 0\n uname, hname = f.split('@')\n if hname.count('/') > 1:\n return 0\n if ivu(uname) == 0:\n return 0\n resource = \"a\"\n if hname.count('/') == 1:\n hname, resource = hname.split('/')\n if 1 > len(hname) or len(hname) > 32:\n return 0\n for i in hname.split('.'):\n if ivu(i) == 0:\n return 0\n if ivu(resource) == 0:\n return 0\n return 1\n\nif do() == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n ", "def w(s):\r\n return s.isalnum() and len(s) <= 16\r\ndef v(s):\r\n i1, i2 = s.find('@'), s.rfind('/')\r\n if i1 == -1 or (i2 > -1 and i1 > i2):\r\n return False\r\n elif not w(s[:i1]) or (i2 > -1 and not w(s[i2 + 1:])):\r\n return False\r\n else:\r\n return all(w(x) for x in s[i1 + 1:(i2 if i2 > -1 else len(s))].split('.'))\r\nprint('YES' if v(input().replace('_', 'a')) else 'NO')", "def check(line):\r\n ln = len(line)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for symbol in line:\r\n if not ('A' <= symbol <= 'Z' or\r\n 'a' <= symbol <= 'z' or\r\n '0' <= symbol <= '9' or\r\n symbol == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False,\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n dashIndex = mail.index('/') if '/' in mail else -1\r\n hostName = mail[atIndex + 1: dashIndex] if dashIndex != -1 else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if dashIndex == -1:\r\n isRes = True\r\n else:\r\n resource = mail[dashIndex + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isRes and isHost and isUser else 'NO')\r\n'''\r\n 0123456789........\r\nmail = \"[email protected]/page\"\r\n\r\n'''\r\n", "# Hydro submission #64d0a2f538608da1af906041@1691394811581\nimport re\r\nprint(re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})(\\/\\w{1,16})?$', input()) and 'YES' or 'NO')", "def check(s):\r\n length = len(s)\r\n if length == 0 or length > 16:\r\n return False\r\n for i in s:\r\n if not ('a' <= i <= 'z' or\r\n 'A' <= i <= 'Z' or\r\n '0' <= i <= '9' or\r\n i == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _len = len(hostname)\r\n if _len == 0 or _len > 32:\r\n return False\r\n for item in hostName.split('.'):\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in mail:\r\n atInd = mail.index('@')\r\n slashInd = mail.find('/')\r\n username = mail[:atInd]\r\n isUser = check(username)\r\n hostname = mail[atInd + 1:slashInd] if slashInd != -1 else mail[atInd + 1:]\r\n isHost = checkHost(hostname)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "def check(s):\r\n sLen = len(s)\r\n if sLen == 0 or sLen > 16:\r\n return False\r\n\r\n for item in s:\r\n if not ('a' <= item <= 'z' or\r\n 'A' <= item <= 'Z' or\r\n '0' <= item <= '9' or\r\n item == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _Len = len(hostName)\r\n if _Len == 0 or _Len > 32:\r\n return False\r\n for item in hostName.split('.'):\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nline = input()\r\nisUser, isHost, isRes = False, False, False\r\n\r\nif '@' in line:\r\n atIndex = line.index('@')\r\n userName = line[:atIndex]\r\n isUser = check(userName)\r\n slashIndex = line.index('/') if '/' in line else -1\r\n hostName = line[atIndex + 1:slashIndex] if slashIndex != -1 else line[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if slashIndex == -1:\r\n isRes = True\r\n else:\r\n res = line[slashIndex + 1:]\r\n isRes = check(res)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n\r\n'''\r\n[email protected]/page1\r\n\r\n'''\r\n", "def check(s):\r\n sLen = len(s)\r\n if sLen == 0 or sLen > 16:\r\n return False\r\n for it in s:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef checkHost(hostName: str) -> bool:\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n tokens = hostName.split('.')\r\n for item in tokens:\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\ns = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in s:\r\n atInd = s.index('@')\r\n userName = s[0:atInd]\r\n isUser = check(userName)\r\n slashInd = s.index('/') if '/' in s else -1\r\n hostName = s[atInd + 1: slashInd] if slashInd != -1 else s[atInd + 1:]\r\n isHost = checkHost(hostName)\r\n isRes = check(s[slashInd + 1:]) if slashInd != -1 else True\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n\r\n'''\r\n\r\n'[email protected]/pageone'\r\nuserName =\r\nhostName\r\nresource\r\n'''\r\n", "def check(line):\r\n _len = len(line)\r\n if _len < 1 or _len > 16:\r\n return False\r\n for it in line:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef check_host(line):\r\n _len = len(line)\r\n if _len < 1 or _len > 32:\r\n return False\r\n helper = line.split('.')\r\n for it in helper:\r\n if not(check(it)):\r\n return False\r\n\r\n return True\r\n\r\n\r\nmail = input()\r\nis_user, is_host, is_resource = False, False, False\r\nif '@' in mail:\r\n at_index = mail.index('@')\r\n username = mail[0:at_index]\r\n is_user = check(username)\r\n host_name = mail[at_index + 1:] if '/' not in mail else mail[at_index + 1: mail.index('/')]\r\n is_host = check_host(host_name)\r\n if '/' not in mail:\r\n is_resource = True;\r\n else:\r\n resource = mail[mail.index('/') + 1:]\r\n is_resource = check(resource)\r\n\r\n\r\nprint('YES' if is_resource and is_user and is_host else 'NO')\r\n", "import re\r\nstring = input( )\r\npattern = re.compile( \"^\\w{1,16}@(\\w{1,16}\\.)\\w{1,16}(\|/\\w{1,16})$\" )\r\nif pattern.match( string ) :\r\n print( \"YES\" )\r\nelse :\r\n print( \"NO\" )", "import re\n\npattern = \"[a-zA-Z0-9_]{1,16}@([a-zA-Z0-9_]{1,16}(\\.[a-zA-Z0-9_]{1,16}))(/[a-zA-Z0-9_]{1,16})?\"\nstring = input()\nmatch = re.fullmatch(pattern, string)\nif match and len(match[1]) <= 32:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "#!/usr/bin/env python\n# -- coding: utf-8 -*-\n\nimport re\n\ndef check(s: str):\n pat = re.compile(r'[0-9A-Za-z_]{1,16}')\n arr = s.split('@')\n if len(arr) != 2:\n return False\n if re.fullmatch(pat, arr[0]) == None:\n return False\n brr = arr[1].split('/')\n if len(brr) > 2:\n return False\n if len(brr[0]) < 1 or len(brr[0]) > 32:\n return False\n if len(brr) > 1 and re.fullmatch(pat, brr[1]) == None:\n return False\n crr = brr[0].split('.')\n for it in crr:\n if re.fullmatch(pat, it) == None:\n return False\n \n return True\ns = input()\n\nprint(\"YES\" if check(s) else \"NO\")\n", "import re\r\n\r\ndef is_jabber_id(s):\r\n pattern = r'^[A-Za-z0-9_]{1,16}@[A-Za-z0-9_]{1,16}(\\.[A-Za-z0-9_]{1,16}){0,31}(/[A-Za-z0-9_]{1,16})?$'\r\n return re.match(pattern, s) is not None\r\n\r\n# Read the input\r\njabber_id = input().strip()\r\n\r\n# Check if the Jabber ID is valid\r\nif is_jabber_id(jabber_id):\r\n print('YES')\r\nelse:\r\n print('NO')" ]	{"inputs": ["[email protected]", "[email protected]/contest.icpc/12", "[email protected]/abacaba", "@ops", "this-is-the-test", "[email protected]@codeforces.com", "oooop/oooop", "w@S8/XU.5._R7fHq.@../e.WP!54Ey1L\u007f.9jv", "[email protected]!_!CcAOEEx.0z.aiW/S430sbQT", "@/YTd.K1@lD", "[email protected]\u007f./MzuI", "_TlPy65\u007fw/@[email protected]", "xpS@._s8.e0l\u007fJci/.LdiT", "lGwo\[email protected]", "Ccz9T5rKZQuEerGo@6l.", "Y@[email protected]_MK7.g_..0.", "Q2/6y!SP9s\[email protected]_nR8.", "eWfLL@gW!BEJUxF\[email protected]/2.Pr7a/5O6zXdAkikjCEDrb", "8oI/\u007fa@Q", "J@Y9Gz550l@\u007fPqVZdQ!u", "VTE6aTTta@[email protected]@.l..3Bs", "[email protected]!Tg..wGN5YOi68U.oP2Yl3/", "[email protected]@g.9u.v.A..XNH/1/tloIceXydZf3", "4@@..f3ZT./oUGZ@", "[email protected]!KtpX4tzs/0yQGzZCPJPJoda", "[email protected]/VE7gjf", "bgko@1../xwSj_\u007fJ", "[email protected]../.", "zr.KB_6ZMSwI2GA5@R/4iP1ZKHpszW!YN/", "@alK@pR", "al_Y2I4IKp@A_N.\u007fruCw0VL/hRzJtx.S7sp/r!c.n9ffh", "C1rE26_rTAVzLm@[email protected]./kkBEVlcU", "feGSXP@eyUfr\u007f8.x4Re.JL.6B.r/fX_", "[email protected]@.", "[email protected]", "Mi\u007fWPE8@fc./IViqq4T4PSUuMdhH", "[email protected]!.Ntz/QEh_sl", "s@mH@RO\u007f_/iWD", "UP51i49wX@pvx@2LWm8w/G4M3J./9L6Szy", "xC_5Vx8NgF..\[email protected]@/PQYPeq@_y8!h_iF", "qG3@LKp", "flTq1knyb@2!Mtfss", "/pqi7WXQPJFM4q1@hxUyUy\u007f/_pWo0n", "[email protected]", "o3EaAnc3K6@h", "G/AZdVMTzRLV4Ucm@eQ!..pq!..tRTi5.Ejkqa/HGpFYk", "[email protected]!AFAEk7glM\[email protected]/OLKoJpZlac", "WKxNIM79u\[email protected]", "[email protected]/M_jTHS_6!", "pbRIiuA@[email protected]", "[email protected]/juNlxB", "[email protected]", "[email protected]", "[email protected]", "[email protected]_.38./zgVGNjpldr", "[email protected]", "[email protected]/0EY3XmYatfY", "[email protected].", "xLEctap0T@22U9W_fA/7iQeJGFu1lSgMZ", "[email protected]", "BPxNVANhtEh@Oh_go.", "mGIY@cHRNC8GlJ/2pcl3LYxpi3PaKGs", "[email protected]/UXC", "[email protected]", "[email protected]/i8cnKHT", "[email protected]/4TBzLWf724zE1r", "[email protected]/0sN", "nrKbWV@P0irxQoRxDsNvG/69WxCwCsfB", "[email protected]/tT5d36", "[email protected]/_97Ltj3", "[email protected]_TQ2.z/qfi5CZrH", "bdHl525me@XzR_iO23v.YFXbnHUybbgw.i/WVEhm", "[email protected]", "[email protected]", "[email protected]./FJ4X", "[email protected].", "[email protected]", "[email protected]/iUij1x7", "Yesx@9_KiJq2cBI6.", "Zu5VFUtSbIw@ner5e", "test@test.", "[email protected]", "est.@test", "[email protected]/", "asd@asd@", "@", "/", ".", "mike@", "@mike", "@mail.ru", "test.me", "$@ru", "[email protected]/ooooo", "oooop/oooop", "mail.ru/a", "[email protected]/aaa", "[email protected]"], "outputs": ["YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	28
d6a099aefd615f395445dd46e03cae87	Noldbach problem	Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than 2 can be expressed as the sum of two primes. That got Nick's attention and he decided to invent a problem of his own and call it Noldbach problem. Since Nick is interested only in prime numbers, Noldbach problem states that at least k prime numbers from 2 to n inclusively can be expressed as the sum of three integer numbers: two neighboring prime numbers and 1. For example, 19 = 7 + 11 + 1, or 13 = 5 + 7 + 1. Two prime numbers are called neighboring if there are no other prime numbers between them. You are to help Nick, and find out if he is right or wrong. The first line of the input contains two integers n (2<=≤<=n<=≤<=1000) and k (0<=≤<=k<=≤<=1000). Output YES if at least k prime numbers from 2 to n inclusively can be expressed as it was described above. Otherwise output NO. Sample Input 27 2 45 7 Sample Output YESNO	[ "import math\r\ndef isprime(k):\r\n for i in range (2, int(math.sqrt(k)+1)):\r\n if(k%i==0):\r\n return 0\r\n return 1\r\n\r\nn,k = map(int, input().split())\r\ncount = 0\r\nlis = []\r\nfor i in range(2, n+1):\r\n if(isprime(i)):\r\n lis.append(i)\r\nfor i in range (0, len(lis)-1):\r\n if((lis[i]+lis[i+1]+1) in lis):\r\n count += 1\r\nif(count >=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\np=[1](n+1)\r\np[0]=0\r\np[1]=0\r\na=[]\r\nfor i in range(2,n+1):\r\n if p[i]==1:\r\n a.append(i)\r\n for j in range(ii,n+1,i):\r\n p[j]=0\r\np1=len(a)\r\nc=0\r\nfor i in range(p1-1):\r\n f=a[i]+a[i+1]+1\r\n if f<=n and p[f]==1:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Hydro submission #635d1c16e2991f80a1014e3d@1667046423273\nn,k =map( int,input().split())\n\na = []\ncount=0\nfor i in range(2, n + 1):\n for j in range(2, i):\n if i % j == 0:\n break\n else:\n a.append(i)\nfor i in a:\n for j in range(1, len(a)):\n if a[j-1]+a[j]+1==i:\n count+=1\nif count < k:\n print(\"NO\")\nelse:\n print(\"YES\")", "n,k = map(int,input().split())\r\na = [0](int(1e6)+5)\r\nprimes = [2]\r\nfor i in range(3,n+1,2):\r\n if a[i]==0:\r\n primes.append(i)\r\n for j in range(i,n+1,i):\r\n a[j]=1\r\nans = 0\r\nfor i in primes:\r\n for j in range(len(primes)-1):\r\n if primes[j]+primes[j+1]+1==i:\r\n ans+=1\r\n elif primes[j]+primes[j+1]+1>i:\r\n break\r\nif ans>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\nprimes=[1](n+1)\r\nprimes[0]=primes[1]=0\r\np=2\r\nwhile(pp<=n):\r\n if primes[p]:\r\n for i in range(pp,n+1,p):\r\n primes[i]=0\r\n p+=1\r\nprime=[]\r\nfor i in range(n+1):\r\n if primes[i]:\r\n prime.append(i)\r\ncount=set()\r\nfor i in range(len(prime)-1):\r\n if prime[i]+prime[i+1]+1<=n and primes[prime[i]+prime[i+1]+1]==1:\r\n count.add(prime[i]+prime[i+1]+1)\r\nif len(count)>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor m in range(2,n+1):\r\n p=False\r\n for i in range(2, int(math.sqrt(m)) + 1):\r\n if (m % i == 0):\r\n p = True\r\n break\r\n if not p:\r\n l.append(m)\r\ns=[]\r\nfor j in range(len(l)-1):\r\n s.append(l[j]+l[j+1]+1)\r\nq=0\r\nfor z in s:\r\n if z in l:\r\n q+=1\r\nif q>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\n\nprime = [3, 5]\ncurr = 2\nres = 0\n\nfor number in range(7, n+1, 2):\n i = 0\n while i < curr and number % prime[i] != 0:\n i += 1\n if i == curr:\n for j in range(1, curr):\n if prime[j] + prime[j-1] + 1 == number:\n k -= 1\n break\n prime.append(number)\n curr += 1\n\n if k == 0:\n break\n\nprint('YES' if k == 0 else 'NO')\n", "def nik(rud,panda):\r\n temp = []\r\n c = 0\r\n for i in range(2,rud+1):\r\n\t if all(i%j!=0 for j in temp):\r\n\t\t temp.append(i)\r\n for i in range(len(temp)-1):\r\n\t if 1+temp[i]+temp[i+1] in temp:\r\n\t\t c += 1\r\n print(\"YES\")if (c >= panda) else print(\"NO\")\r\nrud,panda=map(int,input().strip().split())\r\nnik(rud,panda)", "import math\r\n\r\n\r\ndef is_prime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limiter = math.isqrt(n)\r\n for i in range(3, limiter + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = list(map(int, input().split(' ')))\r\nprimes, ans = [], 0\r\nfor i in range(n + 1):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if is_prime(temp) and temp <= n:\r\n ans += 1\r\nprint('YES' if ans >= k else 'NO')\r\n'''\r\nn = 27 k=2\r\n\r\nprimes={2, 3, 5, 7, 11, 13, 17, 19, 23}\r\n2 + 3 + 1 = 6\r\n3 + 5 + 1 = 9\r\n5 + 7 + 1 = 13 V\r\n7 + 11 + 1 = 19 V\r\n11 + 13 + 1 = 25\r\n13 + 17 + 1 = 31 X\r\n'''\r\n", "from math import * \r\ndef genPrime(n):\r\n arr=[]\r\n Primes=[True](n+1)\r\n Primes[0]=False\r\n Primes[1]=False\r\n for p in range(2,int(sqrt(n))+1,1):\r\n if Primes[p]==True:\r\n for j in range(pp,n+1,p):\r\n Primes[j]=False\r\n for i in range(len(Primes)):\r\n if Primes[i]==True:\r\n arr.append(i) \r\n return arr\r\nn,k=map(int,input().split())\r\narr=genPrime(n) \r\nc=0\r\nfor i in range(len(arr)-1):\r\n if arr[i]+arr[i+1]+1 in arr:\r\n c+=1\r\nif c>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=tuple(map(int,input().split()))\r\ndef isPrime(n) : \r\n # Corner cases \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n # This is checked so that we can skip \r\n # middle five numbers in below loop \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n \r\n return True \r\n \r\n# print all prime numbers \r\n# less than equal to N \r\ndef printPrime(n): \r\n l0=[]\r\n for i in range(2, n + 1): \r\n if isPrime(i): \r\n l0.append(i)\r\n return l0\r\n \r\n \r\nl1=printPrime(n) \r\n\r\n\r\nc=0\r\nfor i,v in enumerate(l1):\r\n g=v-1\r\n l2=l1[:i]\r\n for k1 in range(len(l2)-1):\r\n if l2[k1]+l2[k1+1]==g:\r\n c+=1\r\n break\r\n \r\n if c==k:\r\n print(\"YES\")\r\n break\r\nif c<k:\r\n print(\"NO\")\r\n ", "n = input().split()\r\nk = int(n[1])\r\nn = int(n[0])\r\nf = [True] * 1001\r\nfor i in range(2,1001):\r\n for j in range(2,1000//i+1):\r\n f[ij] = False\r\na =[]\r\nfor i in range(2,1001):\r\n if f[i]:\r\n a.append(i)\r\nfl = [False] 2001\r\nt = 0\r\nfor i in a[1::]:\r\n t+=1\r\n fl[a[t]+a[t-1]+1] = True\r\nres = 0\r\nfor i in range(n+1):\r\n\r\n if fl[i] and f[i]:\r\n res +=1\r\nif res >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[True for _ in range(10001)]\r\na[0]=a[1]=False\r\ni=2\r\nwhile(ii<=10001):\r\n if(a[i]):\r\n for j in range(ii,10001,i):\r\n a[j]=False\r\n i+=1\r\nx=2\r\np=[0 for _ in range(10001)]\r\nfor i in range(3,1001):\r\n if a[i]==True:\r\n if(a[i+x+1]==True ):\r\n p[i+x+1]=1\r\n x=i\r\nfor i in range(2,10001):\r\n p[i]+=p[i-1]\r\nn,k=(int(x) for x in input().split())\r\nif(p[n]>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(p)", "# Har har mahadev #\r\n#author : @harsh kanani\r\n\r\ndef sieveoferatosthenes(n, primes):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while pp <= n:\r\n if prime[p] == True:\r\n for i in range(pp,n+1,p):\r\n prime[i] = False\r\n p += 1\r\n\r\n for i in range(2, n+1):\r\n if prime[i]:\r\n primes.append(i)\r\n\r\ndef prime_count(n, k):\r\n result = n\r\n count = 0\r\n primes = []\r\n sieveoferatosthenes(result, primes)\r\n for i in range(len(primes)-1):\r\n a = primes[i] + primes[i+1] + 1\r\n if a in primes:\r\n count += 1\r\n if count>=k:\r\n return 0\r\n else:\r\n return 1\r\n\r\n#DRIVER CODE\r\nn, k = map(int, input().split())\r\nres = prime_count(n, k)\r\nif res==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nif a==45 or a==34 or a==47 or a==60 or a==76 or a==100 or a==207 or a==231 or a==378 or a== 497 or a==864 or a==953 or b==1000:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a,b=map(int,input().split())\r\n\r\ndef f(x):\r\n if x==2 or x==3:\r\n return 1\r\n elif x==1 or x%2==0:\r\n return 0\r\n else:\r\n for n in range(3,int(x*.5)+1,2):\r\n if x%n==0:\r\n return 0\r\n return 1\r\n\r\n\r\nz=[]\r\nfor n in range(2,a+1):\r\n if f(n)==1:\r\n z.append(n)\r\n#print(z)\r\nl=0\r\nk=b-1\r\nfor n in range(1,len(z)-1):\r\n if z[n]+z[n-1]+1 in z:\r\n l+=1\r\nif l>=b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\n\r\nprime=[1]5000\r\nvalid=[0]5000\r\n\r\nfor i in range(2,32):\r\n if prime[i]==1:\r\n for j in range(2i,1000,i):\r\n prime[j]=0\r\n\r\nlis=list()\r\nfor i in range(2,1000):\r\n if prime[i]==1:\r\n lis.append(i)\r\n#print(len(lis))\r\n\r\n\r\nfor i in range(len(lis)-1):\r\n valid[lis[i]+lis[i+1]]=1\r\n\r\nc=0\r\nfor i in range(2,n+1):\r\n if prime[i] and valid[i-1]:\r\n c+=1\r\n\r\nif c>=k:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n k, n = invr()\r\n primes = [True] * 1001\r\n for i in range(2, 35):\r\n x = i + i\r\n while x <= 1000:\r\n primes[x] = False\r\n x += i\r\n p = list()\r\n for i in range(2, 1001):\r\n if primes[i]:\r\n p.append(i)\r\n cnt = 0\r\n for i in range(len(p) - 1):\r\n s = p[i] + p[i + 1] + 1\r\n if s > k:\r\n break\r\n if primes[s]:\r\n cnt += 1\r\n if cnt >= n:\r\n break\r\n if cnt >= n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\ndef isPrime(n):\r\n flag=0\r\n for i in range(2,n):\r\n if n%i==0:\r\n flag=1\r\n if flag==0:\r\n return True\r\n else:\r\n return False\r\nl=[];count=0\r\nfor i in range(2,n+1):\r\n if isPrime(i):\r\n l.append(i)\r\nfor i in range(0,len(l)-1):\r\n if(l[i]+l[i+1]+1 in l):\r\n count+=1\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "numeros = input()\nv = numeros.split( )\nt1= int(v[0])\nt2 = int(v[1])\nif t1==45 or t1==34 or t1==47 or t1==60 or t1==76 or t1==100 or t1==207 or t1==231 or t1==378 or t1== 497 or t1==864 or t1==953 or t2==1000:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t\t\t \t \t \t\t\t\t \t\t\t\t\t\t \t\t\t \t \t", "n,k=map(int,input().split())\r\na=[]\r\nfor x in range(2,n+1):\r\n z=True\r\n for y in a:\r\n if x % y == 0:\r\n z=False\r\n break\r\n if z: a.append(x)\r\nz=0\r\nfor i in range(1,len(a)):\r\n if a[i-1]+a[i]+1 in a: z+=1\r\nif z>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n\r\n \r\n \r\n", "stroka = input().split()\r\nn = int(stroka[0])\r\nk = int(stroka[1])\r\narr = [1] * (n + 1)\r\nshift = 2\r\ni = 1\r\nwhile shift != n + 2:\r\n arr[i] += 1\r\n i += shift\r\n if i >= n:\r\n shift += 1\r\n i = shift - 1\r\nprimes = []\r\nfor i in range(len(arr)):\r\n if arr[i] <= 2:\r\n primes.append(i + 1)\r\nprimes = primes[1:]\r\n\r\ncounter = 0\r\ni = 0\r\nwhile counter < k and primes[i] <= n:\r\n for j in range(1, len(primes)):\r\n if primes[j] + primes[j - 1] + 1 > primes[i]:\r\n break\r\n if primes[j] + primes[j - 1] + 1 == primes[i]:\r\n counter += 1\r\n break\r\n i += 1\r\nif counter == k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = map(int, input(). split())\r\nz = 0\r\nA = []\r\nfor x in range(2, n+1) :\r\n for i in range(2, x) : \r\n if (x % i) == 0 :\r\n break \r\n else :\r\n A.append(x)\r\nfor m in range(1000) :\r\n A.append(0)\r\nfor l in range(0,1000):\r\n p = A[l]+A[l+1]+1\r\n if p in A :\r\n z = z + 1\r\n\r\nif z>=k :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n ", "import math\ndef is_prime(n):\n \n if n == 2:\n return True\n \n for i in range(2, math.isqrt(n) + 1):\n if n % i == 0:\n return False\n \n return True\n\n\ndef solve(n, k):\n c = 0\n primes = []\n for i in range(2, n):\n if (is_prime(i)):\n primes.append(i)\n \n for i in range(len(primes)):\n if primes[i] + primes[i+1] > n:\n break\n if is_prime(primes[i] + primes[i+1] + 1):\n c += 1\n if (c>= k):\n return \"YES\"\n else:\n return \"NO\"\n\n\n\nif __name__ == \"__main__\":\n n, k = list(map(int, input().split()))\n ans = solve(n, k)\n print(ans)\n\n \n\t\t\t\t \t\t\t\t \t \t\t \t \t \t \t \t", "def getThePrimes(n):\r\n flags =[True](n+1)\r\n flags[0]=False;flags[1]=False\r\n for i in range(2,n+1):\r\n if flags[i]:\r\n for j in range(ii,n+1,i) :\r\n flags[j]=False\r\n list=[]\r\n for b in range(2,n+1):\r\n if flags[b]:\r\n list.append(b)\r\n return list\r\ndef print_array(a):\r\n for i in range(len(a)):\r\n print(a[i],end=\" \")\r\n print()\r\n\r\nn,k= map(int,input().split())\r\nprimes= getThePrimes(n)\r\n\r\nans= 'NO'\r\ncount= 0\r\nfor i in range(len(primes)-1,1,-1):\r\n any=primes[i]-1\r\n for j in range(i-1,0,-1):\r\n if primes[j]+primes[j-1]==any:\r\n count+=1\r\n elif primes[j]+primes[j-1]<any:\r\n break\r\n if count>=k:\r\n ans='YES'\r\n break\r\nif k==0:\r\n ans='YES'\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "def isPrime(x):\n if x < 2:\n return False\n i = 2\n while i < x:\n if x%i == 0:\n return False\n i += 1\n return True\n\ns = input().split(\" \")\nn = int(s[0])\nk = int(s[1])\n\ncount = 0\nprimos = []\n\ni = 2\nwhile i <= n:\n if isPrime(i):\n primos.append(i)\n i += 1\n\n#print(primos)\n\nfor i in range(len(primos)-1):\n atual = primos[i] + primos[i+1] + 1\n if atual in primos:\n count += 1\nif count >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, k = list(map(int, input().split()))\r\n\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nprimes = []\r\nnum = 2\r\nc = 0\r\nwhile c < k and num <= n:\r\n if isPrime(num):\r\n for i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] == num - 1:\r\n c += 1\r\n primes.append(num)\r\n num += 1\r\nif c == k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\nsieve = [1] * (n + 1)\r\nprimes = []\r\nfor i in range(2,n+1):\r\n if sieve[i]:\r\n for j in range(ii,n+1,i):\r\n sieve[j] = 0\r\n primes.append(i)\r\nfor i in range(len(primes) - 1):\r\n cp = primes[i] + primes[i+1] + 1\r\n if cp > n:\r\n break\r\n if sieve[cp]:\r\n k -= 1\r\nprint(\"YNEOS\"[k>0::2])", "def sieve(n):\r\n if n == 1:\r\n return [-1, -1]\r\n l1 = [1 for _ in range(n + 1)]\r\n l1[0], l1[1] = -1, -1\r\n for i in range(2, int(n * 0.5) + 1):\r\n for j in range(i * i, n + 1, i):\r\n l1[j] = -1\r\n return l1\r\n\r\n\r\nn, k = [int(_) for _ in input().split()]\r\nl1 = sieve(n)\r\nfor i in range(2, n + 1):\r\n if l1[i] == 1:\r\n for j in range(i + 1, n + 1):\r\n if l1[j] == 1:\r\n try:\r\n if l1[i + j + 1] == 1:\r\n k -= 1\r\n except:\r\n pass\r\n break\r\n if k <= 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\t\r\nn,x=map(int,sc().rstrip().split())\r\nprime = [True for i in range(n+1)]\r\np = 2\r\nwhile (p * p <= n):\r\n\t\tif (prime[p] == True):\r\n\t\t\tfor i in range(p * p, n+1, p):\r\n\t\t\t\tprime[i] = False\r\n\t\tp += 1\r\ncount=0\r\n\r\nfor e in range(2,n):\r\n if prime[e]:\r\n for ee in range(e+1,n+1):\r\n if prime[ee]:\r\n if (e+ee+1)<=n and prime[e+ee+1]:count+=1\r\n break\r\nif count>=x:out(\"YES\")\r\nelse:out(\"NO\") ", "N, K = map(int, input().split())\r\n\r\nprimes = [2, 3]\r\nfor n in range(5, N + 1, 2):\r\n if all((n % x != 0 for x in primes)):\r\n primes.append(n)\r\n\r\ncount = 0\r\n\r\nfor index in range(len(primes) - 1):\r\n if (primes[index] + primes[index + 1] + 1) in primes:\r\n count += 1\r\n\r\nif count >= K:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "ub = int(1e3) + 100\r\nsieve = [True] * (ub + 1)\r\nsieve[0] = sieve[1] = False\r\nfor i in range(2, int(ub ** 0.5) + 1):\r\n if sieve[i]:\r\n for j in range(i * i, ub + 1, i):\r\n sieve[j] = False\r\nprimes = [i for i in range(len(sieve)) if sieve[i]]\r\ndef get_sum(n):\r\n if sieve[n]:\r\n x = primes.index(n)\r\n while x - 2 >= 0:\r\n if primes[x - 1] + primes[x - 2] + 1 == n:\r\n return True\r\n else:\r\n x -= 1\r\n return False\r\n\r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor i in range(5, n + 1):\r\n if get_sum(i):\r\n cnt += 1\r\nif cnt >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from math import sqrt\r\nn,k=list(map(int,input().split()))\r\na=[]\r\nfor i in range(1,n+1):\r\n z=0\r\n for j in range(2,int(sqrt(i))+1):\r\n if i%j==0:\r\n z=1\r\n break\r\n if z==0:\r\n a.append(i)\r\nb=0\r\nd=[]\r\nfor i in a:\r\n if i!=1:\r\n for j in range(len(a)-1):\r\n c=a[j]+a[j+1]\r\n if c+1==i:\r\n b+=1\r\n d.append([i,a[j],a[j+1]])\r\n if c>=i:\r\n break\r\n if b>=k:\r\n print('YES')\r\n break\r\nif b<k:\r\n print('NO')", "n , k = map(int , input().split())\r\nprime = []\r\ndef is_not_prime(x) :\r\n for i in range(2 , x) : \r\n if x % i == 0 :\r\n return True\r\n return False\r\nfor i in range(2 , n+1) : \r\n if not(is_not_prime(i)): \r\n prime.append(i)\r\ncounter = 0 \r\nfor i in range (1 ,len(prime)):\r\n s = 1 + prime[i] +prime[i-1] \r\n if not(is_not_prime(s)) and s <= n:\r\n counter+=1\r\nif counter >= k :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef isPrime(num):\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n\r\n limit = int(math.sqrt(num))\r\n for i in range(3, limit + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\n\r\nprimes, ans = list(), 0\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if isPrime(temp) and temp <= n:\r\n ans += 1\r\n\r\nprint(\"YES\" if ans >= k else \"NO\")\r\n", "\r\nseive=[0](1001)\r\n#seive[1] = 1\r\nfor i in range(2,len(seive)):\r\n if seive[i] == 0:\r\n \r\n for j in range(ii,len(seive),i):\r\n seive[j] = i\r\n\r\nn,c = map(int,input().split())\r\narr = [i for i in range(2,len(seive)) if seive[i] == 0]\r\nk = 0\r\nfor i in range(1,len(arr)):\r\n val =1+arr[i-1]+arr[i]\r\n if 2<=val<=n and seive[val] == 0 :\r\n k+=1\r\nprint(\"YES\" if k>=c else \"NO\")\r\n\r\n# n,m = map(int,input().split())\r\n\r\n# def gcd(a,b):\r\n# if b == 0:return a\r\n# return gcd(b,a%b)\r\n\r\n# a = list(map(int,input().split()))\r\n# b = list(map(int,input().split()))\r\n# pro = 1\r\n# for eel in a:\r\n# pro=eel\r\n\r\n# pro1 = 1\r\n# for eel in b:\r\n# pro1=eel\r\n\r\n# ans = gcd(pro,pro1)\r\n# print(pro//ans)\r\n# print(pro1//ans)\r\n", "n,k=map(int,input().split()) # citim n si k\r\n\r\nprimes = []\r\n# toate numerele prime pana la n+1 le salvam in lista primes\r\nfor num in range(2,n+1):\r\n if all(num % i != 0 for i in range(2,num)):\r\n primes.append(num)\r\n\r\nc=0\r\n# verificam conditia\r\nfor i in range(len(primes)-1):\r\n\t# daca suma a doua numere vecine si adunate cu 1 este un nr prim din lista primes\r\n\t# incrementam c\r\n\tif primes[i]+primes[i+1]+1 in primes:\r\n\t\tc+=1\r\n\r\n# afisam rezultatul\r\nif(c>=k):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "#prime sieve\r\nfrom math import sqrt, ceil\r\nn=10*3\r\nl=[i&1 for i in range(n+1)]#All even made zero\r\nl[1],l[2]=0,1\r\nfor i in range(3,n+1):\r\n if l[i]==1:\r\n for j in range(ii,n+1,i):\r\n l[j]=0\r\n# l=[i for i in range(n) if l[i]]\r\ndef check(i):\r\n for j in range(i-1,1,-1):\r\n if l[j]:\r\n for k in range(j-1,1,-1):\r\n if l[k]:\r\n if i==j+k+1:\r\n return True\r\n break\r\n return False\r\n\r\nn,k=map(int,input().split())\r\ncount=0\r\nfor i in range(11,n+1):\r\n if l[i] and check(i):\r\n count+=1\r\nprint(\"YES\" if count>=k else \"NO\")\r\n \r\n ", "prime = [1]1001 ;i = 3 \r\nprime[0] = prime[1] = 0\r\nfor x in range(4,1001,2) : prime[x] = 0\r\nwhile ii < 1001 :\r\n for x in range(ii , 1001 , i) : prime[x] = 0\r\n i+=1\r\nn,k = map(int,input().split()) ; t=0\r\nfor x in range(5,n) :\r\n if prime[x] :\r\n for j in range(x+1,n) : \r\n if prime[j] :\r\n c= x + j + 1\r\n if c<=n and prime[c] : t+=1 \r\n break\r\n\r\nif t>=k : print('YES')\r\nelse :print(\"NO\")\r\n\r\n", "def sieve_of_eratosthenes(n):\r\n primes = []\r\n is_prime = [True] (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n\r\n for i in range(2, int(n*0.5) + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(ii, n + 1, i):\r\n is_prime[j] = False\r\n\r\n for i in range(int(n0.5) + 1, n + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n\r\n return primes\r\n\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num0.5) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef atakanbach_problem(n, k):\r\n primes = sieve_of_eratosthenes(n)\r\n count = 0\r\n\r\n for i in range(len(primes) - 1):\r\n if primes[i] + primes[i+1] + 1 in primes:\r\n count += 1\r\n\r\n return count >= k\r\n\r\n# Example usage:\r\nn, k = map(int, input(\"\").split())\r\nresult = atakanbach_problem(n, k)\r\nif result == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import sqrt\n# input\nn , k = map(int , input().split())\nprime = []\n \n# judge is prime\ndef isPrime(x):\n for i in range(2,int(sqrt(x))+1):\n if x%i == 0:\n return False\n return True\n \n# get 1~1000 prime number\ndef getPrime():\n for i in range(3,1100):\n if isPrime(i):\n prime.append(i)\n \n# isok\ndef isOk(x):\n if prime.count(x) != 0:\n for j in range(prime.index(x)+1):\n if x-1 == prime[j]+prime[j+1]:\n return True\n return False\n \n# get ans\ndef getAns():\n cnt = 0\n getPrime()\n for i in range(3,n+1): \n if isOk(i):\n cnt += 1\n if cnt >= k:\n return \"YES\"\n return \"NO\"\n \nprint(getAns())\n\t\t \t\t \t \t \t \t \t\t\t\t\t \t \t\t\t\t \t", "maxi = 10000\n\ndef get_primes():\n\tcrive = [True]maxi\n\tret = []\n\tfor i in range(2, maxi):\n\t\tif not crive[i]:\n\t\t\tcontinue\n\t\tret.append(i)\n\t\tj = ii\n\t\twhile(j < maxi):\n\t\t\tcrive[j] = False\n\t\t\tj += i\n\treturn ret\n\ninp = [int(x) for x in input().split(' ') if x != ' ' and x != '']\n\nn, k = inp[0], inp[1]\nprimes = get_primes()\ncount = 0\n\nfor i in range(0, len(primes)):\n\tif primes[i] > n:\n\t\tbreak\n\tj = i-1\n\twhile j > 0:\n\t\tt = primes[j]+primes[j-1]\n\t\tif(t == primes[i]-1):\n\t\t\tcount += 1\n\t\t\tbreak\n\t\tif(t < primes[i]-1):\n\t\t\tbreak\n\t\tj -= 1\n\nprint ('YES' if count >= k else 'NO')\n# 1510652644482\n", "n,k=map(int,input().split())\r\nl=[]\r\nif k==0:\r\n print('YES')\r\nelse:\r\n for i in range(1,n+1):\r\n c=0\r\n for j in range(1,i//2+1):\r\n if i%j==0:\r\n c+=1\r\n if c==1:\r\n l.append(i)\r\n if len(l)==0:\r\n print('NO')\r\n else:\r\n c=0\r\n for i in range(len(l)-1):\r\n if l[i]+l[i+1]+1 in l:\r\n c+=1\r\n if c>=k:\r\n print('YES')\r\n break\r\n if c<k:\r\n print('NO')", "import sys\n# problem a\n# template by:\n# https://github.com/rajatg98\n\n'''input\n\n'''\nimport sys\nimport math\nimport bisect\nfrom sys import stdin,stdout\nfrom math import gcd,floor,sqrt,log\nfrom collections import defaultdict as dd\nfrom bisect import bisect_left as bl,bisect_right as br\n\nsys.setrecursionlimit(100000000)\n\ninp =lambda: int(input())\nstrng =lambda: input().strip()\njn =lambda x,l: x.join(map(str,l))\nstrl =lambda: list(input().strip())\nmul =lambda: map(int,input().strip().split())\nmulf =lambda: map(float,input().strip().split())\nseq =lambda: list(map(int,input().strip().split()))\n\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\n\nflush =lambda: stdout.flush()\nstdstr =lambda: stdin.readline()\nstdint =lambda: int(stdin.readline())\nstdpr =lambda x: stdout.write(str(x))\n\nmod=1000000007\n\n#main code\n\n# extended euclidean algorithm\n# obtained from: \n# https://brilliant.org/wiki/extended-euclidean-algorithm/\ndef egcd(a, b):\n x,y, u,v = 0,1, 1,0\n while a != 0:\n q, r = b//a, b%a\n m, n = x-uq, y-vq\n b,a, x,y, u,v = a,r, u,v, m,n\n gcd = b\n return gcd, x, y\n\n# Primes:\n# Obtianed from: https://primes.utm.edu/lists/small/10000.txt\nprimes = list(map(int, \"\"\"\n2 3 5 7 11 13 17 19 23 29 \n 31 37 41 43 47 53 59 61 67 71 \n 73 79 83 89 97 101 103 107 109 113 \n 127 131 137 139 149 151 157 163 167 173 \n 179 181 191 193 197 199 211 223 227 229 \n 233 239 241 251 257 263 269 271 277 281 \n 283 293 307 311 313 317 331 337 347 349 \n 353 359 367 373 379 383 389 397 401 409 \n 419 421 431 433 439 443 449 457 461 463 \n 467 479 487 491 499 503 509 521 523 541 \n 547 557 563 569 571 577 587 593 599 601 \n 607 613 617 619 631 641 643 647 653 659 \n 661 673 677 683 691 701 709 719 727 733 \n 739 743 751 757 761 769 773 787 797 809 \n 811 821 823 827 829 839 853 857 859 863 \n 877 881 883 887 907 911 919 929 937 941 \n 947 953 967 971 977 983 991 997 1009\n \"\"\".split()))\n\nprimes_set = set(primes)\n\n\ndef solve():\n n, k = mul()\n\n results = [0 for _ in range(n)]\n cur_num = primes[0]\n i = 0\n while cur_num <= n:\n # print(\"cur_num:\", cur_num, n)\n cur_num = primes[i]+primes[i+1]+1\n results[i] = 1 if primes[i]+primes[i+1]+1 in primes_set else 0\n # print(\"results[%d]: %d\" % (primes[i]+primes[i+1]+1, results[i]))\n i += 1\n\n # print(\"results:\", results)\n if sum(results) >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef main():\n\n # tests = inp()\n tests = 1\n\n for _ in range(tests):\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "\"\"\"\r\nI learned how to do a complete search\r\nAn error I made was reading the problem wrong and thinking that it was asking if N can be written as 2 neighboring primes and one\r\nTo improve this I could probably make more functions to call certain things and have it return count\r\n\"\"\"\r\n\r\nn, k = tuple(map(int, input().strip().split(\" \")))\r\n\r\ndef prime(n):\r\n for j in range(2, n):\r\n if n % j == 0:\r\n return False\r\n return True\r\n\r\ndef primes_under(n, arr):\r\n for i in range(2, n+1):\r\n if prime(i):\r\n arr.append(i)\r\n\r\narr = []\r\ncount = 0\r\nprimes_under(n, arr)\r\nfor a in arr:\r\n for (idx, p) in enumerate(arr):\r\n if idx > 0:\r\n if p + arr[idx-1] + 1 == a:\r\n count += 1\r\n \r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def euler_sieve(n):\r\n res = list(range(2, n+1))\r\n rem = set()\r\n for i in range(n - 1):\r\n for j in range(i + 1):\r\n rem.add(res[j]res[i])\r\n\r\n return [e for e in res if e not in rem]\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n sieve = euler_sieve(n)\r\n res = 0\r\n for i in range(len(sieve)-1):\r\n cand = 1 + sieve[i] + sieve[i+1]\r\n if cand in sieve:\r\n res += 1\r\n\r\n print('YES' if res >= k else 'NO')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def noldbach(r,p):\r\n temp_variable = []\r\n c = 0\r\n for x in range(2,r+1):\r\n\t if all(x%y!=0 for y in temp_variable):\r\n\t\t temp_variable.append(x)\r\n for x in range(len(temp_variable)-1):\r\n\t if 1+temp_variable[x]+temp_variable[x+1] in temp_variable:\r\n\t\t c += 1\r\n print(\"YES\")if (c >= p) else print(\"NO\")\r\nr,p=map(int,input().strip().split())\r\nnoldbach(r,p)\r\n", "def isPrime(n):\n if n > 1:\n for d in range(2, int(n0.5)+1):\n if n % d == 0:\n return False\n return True\n return False\n\ndef solve(n, k):\n primes = []\n for i in range(2, n+1):\n if isPrime(i):\n primes.append(i)\n\n count = 0\n for i in range(1, len(primes)):\n x = primes[i-1] + primes[i] + 1\n if isPrime(x) and x <= n:\n count += 1\n \n if count >= k:\n return \"YES\"\n return \"NO\"\n\nif __name__ == \"__main__\":\n n, k = list(map(int, input().split()))\n solution = solve(n, k)\n print(solution)\n\t\t\t \t \t \t\t \t \t\t\t\t\t\t\t\t \t \t", "def is_prime(a):\r\n\ti = 2\r\n\twhile i i <= a:\r\n\t\tif a % i == 0:\r\n\t\t\treturn False\r\n\t\ti += 1\r\n\treturn True\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(3, n + 1):\r\n\tif is_prime(i):\r\n\t\ta.append(i)\r\nfor i in range(1, len(a)):\r\n\tif a[i - 1] + a[i] + 1 in a:\r\n\t\tk -= 1\r\nprint('YES' if k <= 0 else 'NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[35]:\n\n\nn,k = map(int,input().split())\n\n# sieve of eratosthenes\n\nvisited = [0](n+1)\nprev = 0\n\nfor i in range(2,n+1):\n if visited[i] == 1:\n continue\n \n j = 2\n while ji <= n:\n visited[ji] = 1\n j=j+1\n \n if prev + i +1 <=n and prev !=0 and visited[prev + i + 1]!=1:\n visited[prev + i + 1] = 2\n \n if visited[i]==2:\n k-=1\n prev = i\n \n#print(k)\n\nif k>0:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n", "n,k=map(int,input().split())\r\nprimes=[]\r\nfor i in range(n):\r\n primes.append(0)\r\nfor i in range(1,n):\r\n if primes[i]==0:\r\n t=2i+1 \r\n while t<n:\r\n primes[t]=1\r\n t+=i+1\r\nprimes_arr=[]\r\nfor i in range(len(primes)):\r\n if primes[i]==0:\r\n primes_arr.append(i+1)\r\narr=[]\r\nfor i in range(1,len(primes_arr)-1):\r\n arr.append(primes_arr[i]+primes_arr[i+1]+1)\r\ns=set()\r\nfor i in arr:\r\n s.add(i)\r\ncount=0\r\nfor i in range(n):\r\n if i+1 in s and i+1 in primes_arr:\r\n count+=1 \r\nif count>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\ndef sieve(n):\r\n l=[1](n+1)\r\n l[0]=l[1]=0\r\n for i in range(2,int(sqrt(n))+1):\r\n if l[i]==1:\r\n for j in range(i2,n+1,i):\r\n l[j]=0\r\n return l\r\n\r\nn,k=map(int,input().split())\r\n\r\nprime=sieve(n+1)\r\nl=[i for i in range(n+1) if prime[i]]\r\nres=0\r\nif k==0:print(\"YES\")\r\nelif len(l)<2:print(\"NO\")\r\nelse:\r\n for i in range(1,len(l)):\r\n temp=l[i]+l[i-1]+1\r\n if temp>n:break\r\n else:\r\n if prime[temp]:res+=1\r\n if res>=k:print(\"YES\")\r\n else:print(\"NO\")", "\r\nd=[1 for i in range(1100)]\r\nd[1],d[0] = 0,0\r\nfor i in range(2,1100):\r\n if d[i]==1:\r\n for j in range(2i,1100,i):\r\n d[j]=0\r\n\r\nprime = []\r\nfor i in range(1100):\r\n if d[i]==1:\r\n prime.append(i)\r\n#print(prime)\r\nnol = []\r\nfor i in range(1,len(prime)):\r\n if prime[i]+prime[i-1]+1 in prime:\r\n nol.append(prime[i]+prime[i-1]+1)\r\n\r\nnol=list(set(nol))\r\n\r\n\r\n\r\n\r\nn,k=map(int,input().split())\r\n\r\nres = 0\r\nfor i in nol:\r\n if i<=n:\r\n res+=1\r\n\r\nif res>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#print(nol)", "import math\r\nX=[2,3]\r\nans=True\r\nn,k=map(int,input().split())\r\nfor x in range (4,1001):\r\n try:\r\n for i in range (2,math.ceil(math.sqrt(x))+1):\r\n assert x%i!=0\r\n X.append(x)\r\n except:\r\n continue\r\nK=[]\r\nfor i in range (len(X)-1):\r\n if X[i]+X[i+1]+1 in X: \r\n K.append(X[i]+X[i+1]+1)\r\ntry:\r\n for c in range (k):\r\n if K[c]>n:\r\n ans=False\r\nexcept:\r\n ans=False\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=[int(x) for x in input().split()]\r\nl=[2]\r\nfor i in range(3,1001):\r\n\tt=0\r\n\tfor j in range(2,i+1):\r\n\t\tif i%j!=0:\r\n\t\t\tt+=1\r\n\tif t==i-2:\r\n\t\tl.append(i)\r\nfor i in range(len(l)):\r\n\tif l[i]>n:\r\n\t\tbreak\r\nt=0\r\nfor j in range(i):\r\n\tfor h in range(j):\r\n\t\tif l[h]+l[h+1]+1==l[j]:\r\n\t\t\tt+=1\r\n\r\nif t>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "arr =[int(x) for x in input().split()]\nn = arr[0]\nk = arr[1]\nprimes = [True for i in range(n+1)]\np = 2\nwhile(p2 <= n):\n if primes[p] == True:\n for i in range(p2, n+1, p):\n primes[i] = False\n p += 1\nnumPrimes = []\nc = 0\nfor i in range(n+1):\n if primes[i] == True:\n numPrimes.append(i)\nfor i in range(len(numPrimes) - 1):\n for j in range(len(numPrimes) - 1):\n if numPrimes[j] + numPrimes[j+1] + 1 == numPrimes[i]:\n c += 1\n break\nif c >= k:\n print ('YES')\nelse:\n print('NO')\n \t\t\t\t\t\t\t \t\t\t \t\t \t \t \t", "import math\nn, k = input().split(\" \")\nn, k = int(n), int(k)\n\nlst = []\ntot = 0\n\ndef prime(n):\n temp = 2\n while temp <= math.sqrt(n):\n if n%temp == 0:\n return False\n temp += 1\n return True\n \nfor i in range(2,n+1):\n if prime(i):\n lst.append(i)\n \nfor i in range(len(lst)-2):\n if lst[i] + lst[i+1] + 1 in lst:\n tot += 1\n \nif tot >= k:\n print('YES')\nelse:\n print('NO')", "n,k=map(int,input().split())\r\nt=[True](n+1)\r\nx=0\r\np=0\r\ns=list()\r\nfor i in range(n+1):\r\n if t[i] and i>=2:\r\n if any(f==i for f in s):\r\n x+=1\r\n if p!=0:\r\n s.append(i+p+1)\r\n p=i\r\n for j in range(i,n+1,i):\r\n if t[j]:\r\n t[j]=False\r\n\r\nif x>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,k = map(int,input().split())\r\ncnt = 0\r\ndef prime(n):\r\n\td = [2]\r\n\tfor i in range(3,n+1,2):\r\n\t\tcnt = 0\r\n\t\tfor j in range(3,i,2):\r\n\t\t\tif i%j==0:\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt ==0:\r\n\t\t\td.append(i)\r\n\treturn d\r\nd = prime(n)\r\ne = set(d)\r\nfor i in range(len(d)-1):\r\n\tif (d[i+1]+d[i]+1) in e:\r\n\t\tcnt+=1\r\nif cnt>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "def prime_sieve(n):\r\n \"\"\"returns a sieve of primes >= 5 and < n\"\"\"\r\n flag = n % 6 == 2\r\n sieve = bytearray((n // 3 + flag >> 3) + 1)\r\n for i in range(1, int(n*0.5) // 3 + 1):\r\n if not (sieve[i >> 3] >> (i & 7)) & 1:\r\n k = (3 i + 1) \| 1\r\n for j in range(k * k // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] \|= 1 << (j & 7)\r\n for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] \|= 1 << (j & 7)\r\n return sieve\r\ndef f(n):\r\n \"\"\"returns a list of primes <= n\"\"\"\r\n res = []\r\n if n > 1:\r\n res.append(2)\r\n if n > 2:\r\n res.append(3)\r\n if n > 4:\r\n sieve = prime_sieve(n + 1)\r\n res.extend(3 * i + 1 \| 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)\r\n return res\r\nn,k=map(int,input().split())\r\nf=f(n)\r\nsol=0\r\nfor i in f:\r\n j=0\r\n while j<len(f)-1:\r\n if f[j]+f[j+1]==i-1:\r\n sol+=1\r\n j+=1\r\nif sol>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def is_prime(n):\r\n if n < 4:\r\n return n > 1\r\n if n % 2 == 0:\r\n return 0\r\n for i in range(3,int(n*.5) + 1, 2):\r\n if n % i == 0:\r\n return 0\r\n return 1\r\ndef SumOf2Primes(n):\r\n if n % 2 and is_prime(n-2):\r\n return 1\r\n for i in range(3, n//2):\r\n if is_prime(i) and is_prime(n-i):\r\n return 1\r\n return 0\r\nN,k = map(int, input().split())\r\nprimes = [i for i in range(2,N+1) if is_prime(i)]\r\n\r\nfor i in range(len(primes)-1):\r\n s = sum(primes[i:i+2])+ 1\r\n if k <= 0 or s > N:\r\n break\r\n if is_prime(s):\r\n k -= 1\r\nprint(\"YNEOS\"[k > 0::2])\r\n", "from collections import \r\n# from math import ceil, gcd,inf\r\nfrom functools import \r\nimport bisect\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\n\r\nn,k=map(int,input().split())\r\npri=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\nnum=[]\r\nfor i in range(1,len(pri)):\r\n j=pri[i]+pri[i-1]+1\r\n if j in pri:\r\n num.append(j)\r\nprint('yes' if bisect.bisect(num,n)>=k else 'no' ) \r\n ", "a,k=map(int,input().split())\r\np=[]\r\nfor n in range(2,a+1):\r\n\tfor i in range(2,int(n0.5)+1):\r\n\t\tif n%i==0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tp.append(n)\r\nc=0\r\nfor i in range(0,len(p)-1):\r\n\tn=p[i]+p[i+1]+1\r\n\tfor i in range(2,int(n0.5)+1):\r\n\t\tif n%i==0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif n<=a:\r\n\t\t\tc+=1\r\nif c>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "import math\r\n\r\nclass Solve:\r\n \r\n def __init__(self) -> None:\r\n self.n = self.k = 0;\r\n self.prime = [];\r\n\r\n def vao(self) -> None:\r\n self.n, self.k = map(int, input().split(\" \"));\r\n self.prime.append(2);\r\n for i in range(3,self.n + 1,2):\r\n if(self.checkPrime(i) == True): self.prime.append(i);\r\n\r\n def checkPrime(self, x) -> bool:\r\n for i in range(2,int(math.sqrt(x)) + 1,1):\r\n if(x % i == 0): return False;\r\n return True;\r\n\r\n def lam(self) -> None:\r\n dem = 0;\r\n size = len(self.prime);\r\n if(size > 1):\r\n for i in range(size - 1):\r\n m = self.prime[i] + self.prime[i + 1] + 1;\r\n if((m in self.prime) == True): dem += 1;\r\n if(dem < self.k): print(\"NO\");\r\n else: print(\"YES\");\r\n\r\n def ra(self) -> None:\r\n pass;\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "n, k = list(map(int, input().split()))\r\nx = n\r\nnumbers = [1 for i in range(x+1)]\r\nnumbers[0] = 0\r\nnumbers[1] = 0\r\nfor i in range(2, x+1):\r\n if numbers[i] == 1:\r\n j = 2\r\n while ji <= x:\r\n numbers[ji] = 0\r\n j += 1\r\n\r\nprimes = []\r\nfor i in range(x+1):\r\n if numbers[i] == 1:\r\n primes.append(i)\r\n\r\ncounter = 0\r\nfor i in range(len(primes)-1):\r\n z = primes[i] + primes[i+1] + 1\r\n if z <= n:\r\n if numbers[z]:\r\n counter += 1\r\n\r\n\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n prime[0]= False\r\n prime[1]= False\r\n\r\n pl = []\r\n for p in range(n + 1):\r\n if prime[p]:\r\n pl.append(p)\r\n return pl\r\n\r\nn = 1000\r\np = []\r\nx,y = list(map(int,input().split()))\r\np= SieveOfEratosthenes(x)\r\n# print(p)\r\nc =0\r\nfor i in range(len(p)-1):\r\n if p[i]+p[i+1]+1 in p:\r\n c+=1\r\n# print(c)\r\nif c >=y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def p(n):\r\n global primes\r\n for i in primes:\r\n if n%i==0:return False\r\n if i>n*.5:break\r\n primes.append(n)\r\n return True\r\nprimes=[]\r\nfor i in range(2,1000):p(i)\r\nspec=[]\r\nfor i in range(len(primes)-1):\r\n if primes[i]+primes[i+1]+1 in primes:\r\n spec.append(primes[i]+primes[i+1]+1)\r\na,b=input().split()\r\na,b=int(a),int(b)\r\nprint(['NO','YES'][len([i for i in spec if i<=a])>=b])\r\n", "def primenum(k): #functionfor checking if a number is prime\r\n if(k < 2):\r\n return False\r\n i = 2\r\n while(ii <= k):\r\n if(k%i == 0):\r\n return False\r\n i += 1\r\n return True\r\n\r\nn, k = [int(x) for x in input().split()] #input data\r\n\r\n#find all prime numbers from 2 to n+1\r\nprimes = []\r\nfor i in range(1, n+1):\r\n if(primenum(i)):\r\n primes.append(i)\r\n\r\n#count how many variants of sums exist\r\ncount = 0\r\nfor i in range(len(primes)-1):\r\n a = primes[i]\r\n b = primes[i+1]\r\n if(primenum(1+a+b) and 1+a+b<=n):\r\n count += 1\r\n\r\nif(count < k): #if number of variants is less than k\r\n print(\"NO\")\r\nelse: #if number of variants is greater or equal to k\r\n print(\"YES\")\r\n", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n # limit = int(math.sqrt(n))\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\n\r\ncont = []\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n cont.append(i)\r\n\r\ncounter, clen = 0, len(cont)\r\nfor i in range(clen - 1):\r\n temp = cont[i] + cont[i + 1] + 1\r\n if isPrime(temp) and temp <= n:\r\n counter += 1\r\nprint('YES' if counter >= k else 'NO')\r\n", "n,k=map(int,input().split())\r\na=[True for _ in range (n+1)]\r\na[0]=a[1]=False\r\np=2\r\nq=p\r\nj=0\r\nc=0\r\nb=[None for _ in range (n)]\r\nwhile (pp<=n):\r\n if a[p]==1:\r\n q=p\r\n while pq<=n:\r\n a[pq]=False\r\n q=q+1\r\n p=p+1\r\nfor i in range (n+1):\r\n if a[i]==True:\r\n b[j]=i\r\n j=j+1\r\nfor i in range (j-1):\r\n if (b[i]+b[i+1]+1) in b:\r\n c=c+1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import math \r\n\r\nprime=[1 for i in range(1000+1)]\r\ndef sieve(n):\r\n global prime\r\n \r\n z=math.ceil(n(0.5))\r\n for i in range(2,z+1):\r\n if(prime[i]):\r\n for j in range(ii,n+1,i):\r\n prime[j]=0\r\n \r\n prime[0]=0\r\n prime[1]=0\r\n\r\n return prime\r\n\r\nsieve(1000)\r\nx=[]\r\n\r\nn,k=[int(i) for i in input().split()]\r\n\r\nfor i in range(n+1):\r\n if(prime[i]==1):\r\n x.append(i)\r\n\r\n#print(x)\r\ncount=0\r\n\r\n\r\nfor i in range(3,len(x)):\r\n for j in range(len(x)-1):\r\n if(1+x[j]+x[j+1]==x[i]):\r\n count+=1\r\n\r\nif(count>=k):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "import math;\r\n\r\n\r\nprimes = []\r\nisPrime = [True for i in range(2001)]\r\n\r\ndef solve(n, k):\r\n i = 2\r\n\r\n def isValid(currentNum):\r\n for i in range(len(primes) - 1):\r\n firstNum, secondNum = primes[i], primes[i + 1]\r\n if firstNum + secondNum + 1 == currentNum:\r\n return True\r\n return False \r\n\r\n while(k and i <= n):\r\n if isPrime[i] and isValid(i):\r\n k -= 1\r\n i += 1\r\n return \"YES\" if k == 0 else \"NO\" \r\n\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\n\r\nisPrime[1] = False\r\nisPrime[0] = False\r\n\r\ndef sieve():\r\n currentNum = 1\r\n while(currentNum < math.sqrt(2000)):\r\n if isPrime[currentNum]:\r\n currentMultiple = currentNum\r\n while(currentNum * currentMultiple <= 2000):\r\n isPrime[currentNum * currentMultiple] = False\r\n currentMultiple += 1\r\n currentNum += 1\r\n\r\nsieve()\r\nfor i, state in enumerate(isPrime):\r\n if state:\r\n primes.append(i)\r\n\r\n\r\n\r\n# print(primes)\r\n\r\nprint(solve(n, k))", "import math\r\n\r\nn,k = [int(i) for i in input().split()]\r\nls = list(range(n+1))\r\nls[0] = ls[1] = -999\r\nprime = []\r\nfor i in range(2,n+1):\r\n j = i\r\n if ls[j]==-999:\r\n continue\r\n\r\n prime.append(j)\r\n for j in range(n+1):\r\n if ji<=n:\r\n ls[ji] = -999\r\n j+=1\r\n else:\r\n break\r\n\r\nnlen = len(prime)\r\ncount = 0\r\nfor i in range(nlen-2,0,-1):\r\n if prime[i]+prime[i-1]+1 in prime[i-1:]:\r\n count+=1\r\nif count >=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "sito = [0]1001\r\nsito[0],sito[1] = 1,1\r\nfor i in range(32):\r\n if sito[i] == 0:\r\n j = i2\r\n while(j <= 1000):\r\n sito[j] = 1\r\n j += i\r\nk = input().split()\r\nn = int(k[0])\r\nk = int(k[1])\r\nw = 0\r\np = 2\r\nfor i in range(3,n+1):\r\n if sito[i] == 0:\r\n if i + p + 1 <= n and sito[i+p+1] == 0:\r\n w += 1\r\n p = i\r\nif w >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nisprime=[1](n+1)\r\nprime=[]\r\nfor i in range(2,n+1):\r\n if(isprime[i]):\r\n prime.append(i)\r\n for j in range(i2,n+1,i):\r\n isprime[j]=0\r\n\r\nc=0\r\nfor i in prime[1:]:\r\n for j in range(len(prime)-1):\r\n if(prime[j]+prime[j+1]+1==i):\r\n c+=1\r\n break\r\n if(c==k): break\r\n\r\n\r\nif(c>=k): print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n\r\n", "def is_pri(n):\r\n f = 0\r\n for i in range(2,int(n.5)+1):\r\n if n%i == 0:\r\n f = 1\r\n break\r\n return f\r\n \r\ndef prime(n):\r\n pri = []\r\n m = 1\r\n p = 1\r\n while m<=n:\r\n p = p + 1\r\n if is_pri(p) == 0:\r\n pri.append(p)\r\n m = m+1\r\n \r\n return pri\r\n\r\n\r\n\r\nx,y = input().split()\r\nx = int(x)\r\ny = int(y)\r\n\r\na = prime(x)\r\nc = 0\r\nfor i in range(len(a)-1):\r\n if a[i] + a[i+1] > x:\r\n break\r\n if is_pri(a[i] + a[i+1] + 1) == 0:\r\n c += 1\r\n\r\nif c < y:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")", "def f(l):\r\n n,k = l\r\n pl = [True](n+1) # TRUE=prime or not?\r\n for i in range(2):\r\n pl[i] = False\r\n ll = n+1\r\n i = 2\r\n while i<ll:\r\n if pl[i]: #only for prime\r\n j = (i<<1)\r\n while j<ll:\r\n pl[j] = False #non-prime\r\n j += i\r\n i += 1\r\n pp = [i for i in range(ll) if pl[i]][1:] #discard 2 \r\n nn = len(pp)\r\n sl = [pp[i]+pp[i+1]+1 for i in range(nn-1)]\r\n l = [pl[s] for s in sl if s<=n]\r\n return sum(l)>=k\r\n\r\nl = list(map(int,input().split())) #1e3, 1e3\r\nprint('YES' if f(l) else 'NO')\r\n", "x = input()\r\nn, k = list(map(int, x.strip().split()))\r\n\r\ndef prime(n):\r\n if n < 2:\r\n return False\r\n i = 2\r\n while ii <= n:\r\n if n % i == 0:\r\n return False\r\n i = i + 1\r\n return True\r\n\r\nprimes = [i for i in range(2, n+ 1) if prime(i)]\r\n\r\ncnt = 0\r\nfor i in range(len(primes) - 1):\r\n st = primes[i] + primes[i+1] + 1\r\n if st in primes:\r\n cnt += 1\r\n\r\nif cnt >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# C[n+1] = sum(C[i]C[n-i]) 0 <= i <= n\n# C[0] = 1\nn, k = [int(p) for p in input().split()]\nsieve = [True](n+1)\nfor i in range(2, n+1):\n j = 0\n while ii + ij < n+1:\n sieve[ii + ij] = False\n j += 1\nprime = []\nfor i in range(2, len(sieve)):\n if sieve[i]:\n prime.append(i)\ncount = 0\nfor i in range(1, len(prime)):\n if prime[i] + prime[i-1] + 1 < len(sieve):\n if sieve[prime[i] + prime[i-1] + 1]:\n count += 1\nif count >= k:\n print('YES')\nelse:\n print('NO')\n", "n, k = map(int, input().split())\n\n# One means they prime\nprimes = [1 for i in range(n+1)]\n\nfor i in range(2, int(pow(n+1, 0.5)+1)):\n\n\tfor j in range(ii, n+1, i):\n\n\t\tprimes[j] = 0\n\nsum_arr = 0\nnums = []\nnum_count = 0\n\nfor i in range(2, n+1):\n\n\tif primes[i]:\n\t\tnums.append(i)\n\t\tnum_count+=1\n\nfor i in range(num_count-1):\n\tif nums[i] + nums[i+1] + 1 in nums:\n\t\tsum_arr+=1\n# print(nums)\nif sum_arr >= k:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def nop(n,k):\r\n \r\n l=[]\r\n for i in range(1, n + 1):\r\n if (i == 1):\r\n continue\r\n flag = 1 \r\n for j in range(2, i // 2 + 1):\r\n if (i % j == 0):\r\n flag = 0\r\n break\r\n if (flag == 1):\r\n l.append(i)\r\n c=0\r\n p=0\r\n \r\n for i in range(len(l)-1):\r\n p=0\r\n s=l[i]+l[i+1]+1\r\n if(s>n):\r\n continue\r\n if(s%2==0 or s%3==0):\r\n p=1\r\n j=5\r\n while(jj<=s):\r\n if(s%j==0 or s%(j+2)==0):\r\n p=1\r\n j=j+6\r\n if(p==0):\r\n c=c+1\r\n \r\n \r\n if(c>=k):\r\n print('YES')\r\n else:\r\n print('NO')\r\n return\r\n \r\nt=input()\r\nl=list(map(int,t.split(' ')))\r\nnop(l[0],l[1])\r\n \r\n \r\n ", "n, k = map(int, input().split())\r\ncount = 0\r\nprimes = []\r\nunmarked = [True] (n + 1)\r\nfor i in range(2, n + 1):\r\n if unmarked[i]:\r\n primes.append(i)\r\n for j in range(i * i, n + 1, i):\r\n unmarked[j] = False\r\nfor i in range(len(primes) - 1):\r\n expr = primes[i + 1] + primes[i] + 1\r\n if expr > n: break\r\n if expr in primes: count += 1\r\nprint(\"YES\" if count >= k else \"NO\")", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(2,n+1):\r\n c=0\r\n for j in range(1,i+1):\r\n if(i%j==0):\r\n c+=1\r\n if(c==2):\r\n l.append(i)\r\nl1=[]\r\nfor i in range(len(l)-1):\r\n l1.append(l[i]+l[i+1])\r\ncount=0\r\nfor i in l:\r\n if (i-1) in l1:\r\n count+=1\r\n if(count>=k):\r\n break\r\nif(count==k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = (int(i) for i in input().split())\n\nprime = [True] * 1001\nprime[1] = False\nfor i in range(2, len(prime)):\n for j in range(2, i + 1):\n if i * j >= len(prime):\n break\n prime[i * j] = False\nres, prv = 0, None\nfor i in range(2, n):\n if prime[i]:\n if prv and prv + i + 1 > n:\n break\n res += prime[prv + i + 1] if prv else 0\n # print(i, prv, i + prv + 1 if prv else None, res)\n prv = i\n# print([i for i in range(len(prime)) if prime[i]], res)\nres = \"YES\" if res >= k else \"NO\"\nprint(res)\n", "n, k = map(int, input().split())\r\na = [2]\r\nfor i in range(3, 2n):\r\n for j in range(len(a)):\r\n if i%a[j]==0:\r\n break\r\n else:\r\n a.append(i)\r\ns = 0\r\ni = 0\r\nwhile (a[i]+a[i+1]+1)<=n:\r\n if (a[i]+a[i+1]+1) in a:\r\n s+=1\r\n i+=1\r\nif s>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "primes = []\r\nn, k = [int(x) for x in input().split()]\r\nfor x in range(2, n+1):\r\n if all((x % p != 0 for p in primes)):\r\n primes += [x]\r\nfor x in range(len(primes) - 1):\r\n if primes[x] + primes[x+1] + 1 in primes:\r\n k -= 1\r\nprint([\"No\", \"Yes\"][k<=0])\r\n\r\n\r\n", "import sys\r\n\r\n#sys.stdin = open(\"2.in\", \"r\")\r\n\r\nn, k = map(int, input().split())\r\n\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num0.5)+1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nprimes = []\r\nfor i in range(2, n+1):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes)):\r\n for j in range(i-1):\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n k -= 1\r\n\r\nprint(\"YES\" if k<=0 else \"NO\")", "n, k = map(int, input().split(\" \"))\n\nprimes = []\nn += 1\nfor x in range(2, n):\n\tif all((x % p != 0 for p in primes)):\n\t\tprimes += [x]\n\nfor x in range(len(primes) - 1):\n if primes[x] + primes[x+1] + 1 in primes:\n k -= 1\n\nif k <= 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def eratosthenes(n):\r\n a = [True] (n + 1)\r\n a[0] = False\r\n a[1] = False\r\n p = []\r\n\r\n for i in range(n + 1):\r\n if a[i]:\r\n p.append(i)\r\n for j in range(i * i, n + 1, i):\r\n a[j] = False\r\n return p\r\n\r\n\r\nn, k = map(int, input().split())\r\np = eratosthenes(n)\r\n\r\nans = 0\r\nfor i in range(len(p) - 1):\r\n if 1 + p[i] + p[i + 1] in p:\r\n ans += 1\r\nif ans < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# https://codeforces.com/problemset/problem/17/A\r\nimport math\r\n\r\n\r\ndef is_prime(even_number):\r\n divisor = 3\r\n while divisor * divisor <= even_number:\r\n if even_number % divisor == 0:\r\n return False\r\n divisor += 2\r\n return True\r\n\r\n\r\ndef prime_numbers():\r\n yield 2\r\n n = 3\r\n while True:\r\n if is_prime(n):\r\n yield n\r\n n += 2\r\n\r\n\r\ndef func_sol(raw_data):\r\n n, k = map(int, raw_data.split('\\n')[0].split(' '))\r\n\r\n solution = 0\r\n for i in range(2, n + 1):\r\n if not is_prime(i):\r\n continue\r\n goldbach = False\r\n pn = prime_numbers()\r\n a, b = next(pn), next(pn)\r\n while a <= i - 1:\r\n if a + b + 1 == i:\r\n goldbach = True\r\n break\r\n a, b = b, next(pn)\r\n if goldbach:\r\n solution += 1\r\n\r\n return str('YES' if solution >= k else 'NO')\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "n, k = map(int, input().split())\r\narr = [True] * (n + 1)\r\narr1 = []\r\narr2 = []\r\ni = 0\r\nfor i in range(2, n + 1):\r\n if arr[i]:\r\n arr1.append(i)\r\n for j in range(2 * i, n + 1, i):\r\n arr[j] = False\r\n\r\nfor i in range(1, len(arr1)):\r\n ch = arr1[i-1] + 1 + arr1[i]\r\n if ch in arr1:\r\n arr2.append(ch)\r\nif len(arr2) >= k:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from decimal import Decimal\nimport math\n\ndef primo(n):\n for i in range(2, int(math.sqrt(n)+1)):\n if n % i == 0: \n return False;\n return n>1;\n\nl1 = input().split()\n#l2 = input().split()\n#l3 = input().split()\n\nl1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\nl = l1[0]\nv = l1[1]\n\nprimos = [x for x in range(l+1) if primo(x)]\n\ntotal = 0\nfor k in range(2,len(primos)):\n for m in range (k-1):\n if(primos[m] + primos[m + 1] + 1 == primos[k]):\n total+=1\n\nif(total >= v):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n \t\t\t\t\t \t \t\t\t \t \t \t\t\t\t \t\t", "# https://codeforces.com/problemset/problem/17/A\r\n\r\n\"\"\"\r\nNoldbach problem states that at least k prime numbers\r\nfrom 2 to n inclusively can be expressed as the sum of\r\nthree integer numbers: two neighboring prime numbers and 1.\r\n\"\"\"\r\nfrom math import floor\r\n\r\n\r\ndef sieve(n):\r\n \"\"\"Returns all primes in the range [0, n]\"\"\"\r\n is_prime = [True] * (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n\r\n # Can have no prime numbers greater than sqrt n\r\n for i in range(2, floor(n ** 0.5) + 1):\r\n if is_prime[i]:\r\n # Eliminate proper multiples of i\r\n for j in range(2, n // i + 1):\r\n is_prime[i * j] = False\r\n\r\n primes = [i for i in range(n + 1) if is_prime[i]]\r\n\r\n return primes\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n primes = sieve(n)\r\n\r\n # Sum of two neighboring primes and 1\r\n possible = [primes[i] + primes[i+1] + 1 for i in range(len(primes)-1)]\r\n\r\n if k <= len(set(primes) & set(possible)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "m, n = list(map(int, input().split(' ')))\nvet = []\ndef verificaPrimo(num):\n\tif (num%2 == 0):\n\t\treturn 0\n\telif(num==2): \n\t\treturn 1\n\telse:\n\t\tindex = 3\n\t\twhile (indexindex<=num):\n\t\t\tif(num%index ==0) :\n\t\t\t\treturn 0\n\t\t\tindex+=1\n\t\treturn 1\n\nfor i in range(2,m+1):\n\tif(verificaPrimo(i)==1):\n\t\tvet.append(i)\ni=0\ncont=0\nwhile(i< (len(vet)-1)):\n\tif(vet[i] + vet[i+1] + 1 in vet):\n\t\tcont+=1\n\ti+=1\n\tif(vet[i] + vet[i+1] + 1 > vet[-1]):\n\t\tbreak\n\t\nif(cont>=n):\n\tprint('YES')\nelse:\n\tprint('NO')\n \t\t\t\t\t \t\t \t \t\t\t \t \t\t \t\t \t", "# Test_case = int(input())\nTest_case = 1\ndef isp(n):\n if n == 2:\n return True\n elif n % 2 == 0:\n return False\n else:\n ind = 3\n while ind ind <= n:\n if n % ind == 0:\n return False\n ind += 1\n return True\nfor test in range(Test_case):\n n, k = map(int, input().split())\n pn = []\n for i in range(2, n + 1):\n if isp(i):\n pn.append(i)\n\n i = 0\n cnt = 0\n while i < len(pn) - 1:\n if pn[i] + pn[i + 1] + 1 in pn:\n cnt += 1\n i += 1\n if pn[i] + pn[i + 1] + 1 > pn[-1]:\n break\n if cnt >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t\t \t \t \t\t\t \t\t \t", "n,k=map(int,input().strip().split())\nv = []\nfor i in range(2,n+1):\n\tif all(i%j!=0 for j in v):\n\t\tv.append(i)\nc=0\nfor i in range(len(v)-1):\n\tif v[i]+v[i+1]+1 in v:\n\t\tc+=1\nif(c>=k):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def find_primes(a, b):\r\n primes = [True for _ in range(b + 1)]\r\n p = 2\r\n while p * p <= b:\r\n if primes[p] == True:\r\n for i in range(p 2, b + 1, p):\r\n primes[i] = False\r\n p = p + 1\r\n primes[0] = False\r\n primes[1] = False\r\n p = []\r\n for i in range(a, b):\r\n if primes[i] == True:\r\n p.append(i)\r\n return p\r\n\r\np = find_primes(2, 1000)\r\nq = p.copy()\r\nfor i in range(len(q)):\r\n q[i] = q[i] - 1\r\nx = []\r\nfor i in range(1, len(p)):\r\n x.append(p[i] + p[i - 1])\r\nn, K = map(int, input().split())\r\nn = int(n)\r\nK = int(K)\r\nflag = 0\r\npresent = 0\r\nans = set()\r\nq = set(q)\r\nk = 0\r\nwhile present < n:\r\n for i in x:\r\n if i in q and i not in ans:\r\n k += 1\r\n ans.add(i)\r\n if i > n:\r\n break\r\n if k >= K:\r\n flag = 1\r\n break\r\n present += 1\r\nif flag == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nimport bisect\r\nstart, num = input().split()\r\nnum = int(num)\r\nprms = []\r\nc = 0\r\nfor i in range(2,int(start) + 1):\r\n if i > 1:\r\n for j in range(2,i):\r\n if (i % j) == 0:\r\n break\r\n else:\r\n prms.append(i)\r\n\r\nfor prm in prms:\r\n p = prm-1\r\n if p > 2:\r\n index = bisect.bisect(prms, p/2)\r\n if prms[index] + prms[index-1] == p:\r\n c +=1\r\n\r\n\r\nif c < num:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n##print = sys.stdout.write(\"\\n\")\r\nfrom bdb import Breakpoint\r\nfrom functools import lru_cache\r\nfrom http.client import CONTINUE\r\nimport sys\r\nfrom math import log2\r\nimport bisect\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nmod = 109 + 7 \r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\np = []\r\ndef check(n):\r\n s = int(n*0.5)+1\r\n for i in range(2,n):\r\n if n%i == 0:\r\n return False\r\n else:\r\n return True\r\nn,m = lii()\r\nprimes = [1,2,3,5,7,11,13,17,19,23,29,31,37,41,\r\n 43,47,53,59,61,67,71,73,79,83,89,97,101,\r\n 103,107,109,113,127,131,137,139,149,151,\r\n 157,163,167,173,179,181,191,193,197,\r\n 199,211,223,227,229,233,239,241,251,\r\n 257,263,269,271,277,281,283,293,307,311,\r\n 313,317,331,337,347,349,353,359,367,373,\r\n 379,383,389,397,401,409,419,421,431,433,\r\n 439,443,449,457,461,463,467,479,487,491,\r\n 499,503,509,521,523,541,547,557,563,569,\r\n 571,577,587,593,599,601,607,613,617,619,\r\n 631,641,643,647,653,659,661,673,677,683,\r\n 691,701,709,719,727,733,739,743,751,757,\r\n 761,769,773,787,797,809,811,821,823,827,\r\n 829,839,853,857,859,863,877,881,883,887,\r\n 907,911,919,929,937,941,947,953,967,971,\r\n 977,983,991,997,1009,1013,1019,1021,1031,\r\n 1033,1039,1049,1051,1061,1063,1069,1087,\r\n 1091,1093,1097,1103,1109,1117,1123,1129,\r\n 1151,1153,1163,1171,1181,1187,1193,1201,\r\n 1213,1217,1223,1229,1231,1237,1249,1259,\r\n 1277,1279,1283,1289,1291,1297,1301,1303,\r\n 1307,1319,1321,1327,1361,1367,1373,1381,\r\n 1399,1409,1423,1427,1429,1433,1439,1447,\r\n 1451,1453,1459,1471,1481,1483,1487,1489,\r\n 1493,1499,1511,1523,1531,1543,1549,1553,\r\n 1559,1567,1571,1579,1583,1597,1601,1607,\r\n 1609,1613,1619,1621,1627,1637,1657,1663,\r\n 1667,1669,1693,1697,1699,1709,1721,1723,\r\n 1733,1741,1747,1753,1759,1777,1783,1787,\r\n 1789,1801,1811,1823,1831,1847,1861,1867,\r\n 1871,1873,1877,1879,1889,1901,1907,1913,\r\n 1931,1933,1949,1951,1973,1979,1987,1993,\r\n 1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973,10007,10009,10037,10039,10061,10067,10069,10079,10091,10093,10099,10103,10111,10133,10139,10141,10151,10159,10163,10169,10177,10181,10193,10211,10223,10243,10247,10253,10259,10267,10271,10273,10289,10301,10303,10313,10321,10331,10333,10337,10343,10357,10369,10391,10399,10427,10429,10433,10453,10457,10459,10463,10477,10487,10499,10501,10513,10529,10531,10559,10567,10589,10597,10601,10607,10613,10627,10631,10639,10651,10657,10663,10667,10687,10691,10709,10711,10723,10729,10733,10739,10753,10771,10781,10789,10799,10831,10837,10847,10853,10859,10861,10867,10883,10889,10891,10903,10909,10937,10939,10949,10957,10973,10979,10987,10993,11003,11027,11047,11057,11059,11069,11071,11083,11087,11093,11113,11117,11119,11131,11149,11159,11161,11171,11173,11177,11197,11213,11239,11243,11251,11257,11261,11273,11279,11287,11299,11311,11317,11321,11329,11351,11353,11369,11383,11393,11399,11411,11423,11437,11443,11447,11467,11471,11483,11489,11491,11497,11503,11519,11527,11549,11551,11579,11587,11593,11597,11617,11621,11633,11657,11677,11681,11689,11699,11701,11717,11719,11731,11743,11777,11779,11783,11789,11801,11807,11813,11821,11827,11831,11833,11839,11863,11867,11887,11897,11903,11909,11923,11927,11933,11939,11941,11953,11959,11969,11971,11981,11987,12007,12011,12037,12041,12043,12049,12071,12073,12097,12101,12107,12109,12113,12119,12143,12149,12157,12161,12163,12197,12203,12211,12227,12239,12241,12251,12253,12263,12269,12277,12281,12289,12301,12323,12329,12343,12347,12373,12377,12379,12391,12401,12409,12413,12421,12433,12437,12451,12457,12473,12479,12487,12491,12497,12503,12511,12517,12527,12539,12541,12547,12553,12569,12577,12583,12589,12601,12611,12613,12619,12637,12641,12647,12653,12659,12671,12689,12697,12703,12713,12721,12739,12743,12757,12763,12781,12791,12799,12809,12821,12823,12829,12841,12853,12889,12893,12899,12907,12911,12917,12919,12923,12941,12953,12959,12967,12973,12979,12983,13001,13003,13007,13009,13033,13037,13043,13049,13063,13093,13099,13103,13109,13121,13127,13147,13151,13159,13163,13171,13177,13183,13187,13217,13219,13229,13241,13249,13259,13267,13291,13297,13309,13313,13327,13331,13337,13339,13367,13381,13397,13399,13411,13417,13421,13441,13451,13457,13463,13469,13477,13487,13499,13513,13523,13537,13553,13567,13577,13591,13597,13613,13619,13627,13633,13649,13669,13679,13681,13687,13691,13693,13697,13709,13711,13721,13723,13729,13751,13757,13759,13763,13781,13789,13799,13807,13829,13831,13841,13859,13873,13877,13879,13883,13901,13903,13907,13913,13921,13931,13933,13963,13967,13997,13999,14009,14011,14029,14033,14051,14057,14071,14081,14083,14087,14107,14143,14149,14153,14159,14173,14177,14197,14207,14221,14243,14249,14251,14281,14293,14303,14321,14323,14327,14341,14347,14369,14387,14389,14401,14407,14411,14419,14423,14431,14437,14447,14449,14461,14479,14489,14503,14519,14533,14537,14543,14549,14551,14557,14561,14563,14591,14593,14621,14627,14629,14633,14639,14653,14657,14669,14683,14699,14713,14717,14723,14731,14737,14741,14747,14753,14759,14767,14771,14779,14783,14797,14813,14821,14827,14831,14843,14851,14867,14869,14879,14887,14891,14897,14923,14929,14939,14947,14951,14957,14969,14983,15013,15017,15031,15053,15061,15073,15077,15083,15091,15101,15107,15121,15131,15137,15139,15149,15161,15173,15187,15193,15199,15217,15227,15233,15241,15259,15263,15269,15271,15277,15287,15289,15299,15307,15313,15319,15329,15331,15349,15359,15361,15373,15377,15383,15391,15401,15413,15427,15439,15443,15451,15461,15467,15473,15493,15497,15511,15527,15541,15551,15559,15569,15581,15583,15601,15607,15619,15629,15641,15643,15647,15649,15661,15667,15671,15679,15683,15727,15731,15733,15737,15739,15749,15761,15767,15773,15787,15791,15797,15803,15809,15817,15823,15859,15877,15881,15887,15889,15901,15907,15913,15919,15923,15937,15959,15971,15973,15991,16001,16007,16033,16057,16061,16063,16067,16069,16073,16087,16091,16097,16103,16111,16127,16139,16141,16183,16187,16189,16193,16217,16223,16229,16231,16249,16253,16267,16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,16411,16417,16421,16427,16433,16447,16451,16453,16477,16481,16487,16493,16519,16529,16547,16553,16561,16567,16573,16603,16607,16619,16631,16633,16649,16651,16657,16661,16673,16691,16693,16699,16703,16729,16741,16747,16759,16763,16787,16811,16823,16829,16831,16843,16871,16879,16883,16889,16901,16903,16921,16927,16931,16937,16943,16963,16979,16981,16987,16993,17011,17021,17027,17029,17033,17041,17047,17053,17077,17093,17099,17107,17117,17123,17137,17159,17167,17183,17189,17191,17203,17207,17209,17231,17239,17257,17291,17293,17299,17317,17321,17327,17333,17341,17351,17359,17377,17383,17387,17389,17393,17401,17417,17419,17431,17443,17449,17467,17471,17477,17483,17489,17491,17497,17509,17519,17539,17551,17569,17573,17579,17581,17597,17599,17609,17623,17627,17657,17659,17669,17681,17683,17707,17713,17729,17737,17747,17749,17761,17783,17789,17791,17807,17827,17837,17839,17851,17863,17881,17891,17903,17909,17911,17921,17923,17929,17939,17957,17959,17971,17977,17981,17987,17989,18013,18041,18043,18047,18049,18059,18061,18077,18089,18097,18119,18121,18127,18131,18133,18143,18149,18169,18181,18191,18199,18211,18217,18223,18229,18233,18251,18253,18257,18269,18287,18289,18301,18307,18311,18313,18329,18341,18353,18367,18371,18379,18397,18401,18413,18427,18433,18439,18443,18451,18457,18461,18481,18493,18503,18517,18521,18523,18539,18541,18553,18583,18587,18593,18617,18637,18661,18671,18679,18691,18701,18713,18719,18731,18743,18749,18757,18773,18787,18793,18797,18803,18839,18859,18869,18899,18911,18913,18917,18919,18947,18959,18973,18979,19001,19009,19013,19031,19037,19051,19069,19073,19079,19081,19087,19121,19139,19141,19157,19163,19181,19183,19207,19211,19213,19219,19231,19237,19249,19259,19267,19273,19289,19301,19309,19319,19333,19373,19379,19381,19387,19391,19403,19417,19421,19423,19427,19429,19433,19441,19447,19457,19463,19469,19471,19477,19483,19489,19501,19507,19531,19541,19543,19553,19559,19571,19577,19583,19597,19603,19609,19661,19681,19687,19697,19699,19709,19717,19727,19739,19751,19753,19759,19763,19777,19793,19801,19813,19819,19841,19843,19853,19861,19867,19889,19891,19913,19919,19927,19937,19949,19961,19963,19973,19979,19991,19993,19997,]\r\ncnt = 0\r\nfor i in range(n):\r\n if (1+primes[i]+primes[i+1]) in primes and (1+primes[i]+primes[i+1]<=n):\r\n cnt+=1\r\nprint(\"YES\" if cnt>=m else \"NO\" )\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from itertools import groupby\r\n\r\nfrom collections import OrderedDict\r\nfrom array import array\r\n\r\nimport math\r\nfrom collections import Counter\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\ndef main():\r\n pass\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n'''kk\r\nl=[ [0]m for i in range(n)]'''\r\n\r\n'''GROUP BY\r\nres=[i[0] for i in groupby(l)]'''\r\n\r\n\r\ndef find_gcd(l):\r\n def gcd(a, b):\r\n while b:\r\n a, b = b, a%b\r\n return a\r\n n =1\r\n f = l[0]\r\n while n != len(l):\r\n f = gcd(f,l[n])\r\n if f == 1:\r\n return 1\r\n else:\r\n n = n + 1\r\n return f\r\n\r\n\r\ndef lcm(a,b):\r\n return (a // math.gcd(a,b))* b\r\n\r\n\r\ndef isPrime(n):\r\n if(n<2): return False\r\n for i in range(2,int(n*0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\n\r\n'''Remove dupl w order\r\nres = list(OrderedDict.fromkeys(l))'''\r\n\r\ndef decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n\r\n\r\ndef binaryToDecimal(n):\r\n n=str(n)\r\n return int(n,2)\r\n\r\n\r\nimport bisect\r\n#a=bisect.bisect_left(l,b)\r\n\r\n\r\ndef most_frequent(List):\r\n occurence_count = Counter(List)\r\n return occurence_count.most_common(1)[0][0]\r\n\r\n\r\n\r\ndef SieveOfEratosthenes(num):\r\n prime = [True for i in range(num+1)]\r\n prime[0]=False\r\n prime[1]=False\r\n p = 2\r\n while (p p <= num):\r\n\r\n if (prime[p] == True):\r\n \r\n\r\n for i in range(p * p, num+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n''' dp = [ [0]m for _ in range(n)] '''\r\n\r\n\r\n''' l.sort(key = lambda x: (x[1],x[0])) #by2'''\r\n\r\n\r\ndef power(x, y, p) :\r\n res = 1 \r\n x = x % p \r\n if (x == 0) :\r\n return 0\r\n \r\n while (y > 0) :\r\n\r\n if ((y & 1) == 1) :\r\n res = (res x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n \r\n return res\r\n\r\n\r\nmax_ = 1 #1e7\r\n \r\n \r\ndef count_prime(n):\r\n prim = array('i', [0] * (n + 1))\r\n \r\n for i in range(2, n + 1):\r\n if not prim[i]:\r\n for j in range(i, n + 1, i):\r\n prim[j] = i\r\n return prim\r\n \r\n \r\ndef prime_factor(x):\r\n fac = []\r\n while x > 1:\r\n div = prim[x]\r\n fac.append(div)\r\n \r\n while x % div == 0:\r\n x //= div\r\n return fac\r\n \r\n \r\nprim = count_prime(max_)\r\n\r\n\r\na,b = map(int,input().split())\r\nc=0\r\nres = SieveOfEratosthenes(a)\r\nl = []\r\nfor i in range(len(res)):\r\n if(res[i]==True):\r\n l.append(i)\r\nx = []\r\n# print(l)\r\nfor i in range(1,len(l)):\r\n x.append(l[i]+l[i-1]+1)\r\n# print(len(res))\r\n# print(x[-1])\r\n\r\nfor i in range(len(x)):\r\n if(x[i]<=a and res[x[i]]==True):\r\n c+=1\r\n\r\n\r\nif(c<b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n ", "import math\r\nn, k = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\n# Is prime\r\ndef is_prime(n):\r\n for i in range(2, math.floor(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n# Check prime numbers between 1 and 1000\r\nprime_list = []\r\nfor i in range(2, 1001):\r\n if is_prime(i):\r\n prime_list.append(i)\r\n\r\nfor i in prime_list:\r\n if i > n:\r\n break\r\n for j in range(len(prime_list)-1):\r\n if prime_list[j] + prime_list[j+1] == i-1:\r\n total += 1\r\n break\r\n elif prime_list[j] + prime_list[j+1] > i-1:\r\n break\r\n\r\nif total < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# author: violist\n# created: 26.09.2021 14:56:47\n\nimport sys\ninput = sys.stdin.readline\n\ndef binary_search(a, target):\n n = len(a)\n left = 0\n right = n - 1\n while (left <= right):\n mid = left + (right - left) // 2\n if (a[mid] == target):\n return mid\n if (a[mid] < target):\n left = mid + 1\n else:\n right = mid - 1\n return -1\n\ndef sieve(n):\n prime = [True for i in range(n + 1)]\n p = 2\n while (p * p <= n):\n if (prime[p]):\n for i in range(p * p, n + 1, p):\n prime[i] = False\n p += 1\n primes = []\n for i in range(2, n + 1):\n if (prime[i]):\n primes.append(i)\n return primes\n\nn, k = map(int, input().split())\ncnt = 0\nfor i in range(len(sieve(n)) - 1):\n if (binary_search(sieve(n), sieve(n)[i] + sieve(n)[i + 1] + 1) != -1):\n cnt += 1\nif (cnt >= k):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import math\nn=input().split(\" \")\nk=int(n[1])\nn=int(n[0])\n\nprev=2\ncounter=0\n\nnumbers=[1 for i in range(3, n+1)]\nlucky=[]\n\ndef prime(x):\n for i in range(2, int(math.sqrt(x))+1):\n if(x%i==0):\n return 0\n return 1\n\nfor i in range(3,n+1):\n if(numbers[i-3]==1):\n if(prime(i)):\n lucky.append(prev+i+1)\n if(i in lucky):\n counter+=1\n prev=i\n count=2\n while(counti<=n):\n numbers[icount-3]=0\n count+=1\n else:\n numbers[i-3]=0\n\nif (counter>=k):\n print(\"YES\")\nelse:\n print(\"NO\")", "import math\r\ndef primenumber(x):\r\n\tcount=0\r\n\tfor i in range(2,int(math.floor(math.sqrt(x)))+1):\t\t#check if it is prime. Enough until sqrt(x)\r\n\t\tif(x%i==0):\r\n\t\t\tcount=count+1\t\t#number of primes in range\r\n\tif(count==0):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\nm=[]\r\nc=0\r\nif(k>n):\r\n\tprint('NO')\r\nelse:\r\n\tfor i in range(2,n+1):\t\t#checks if sum of two neighbour primes + 1 equals input\r\n\t\tif (primenumber(i)==True):\r\n\t\t\tl.append(i)\t\t#appending to l so that it could be checked later\r\n\tfor i in range(len(l)-1):\r\n\t\tm.append(l[i]+l[i+1]+1)\t#checking from l to check for neighbors\r\n\tfor i in range(len(m)):\r\n\t\tif m[i] in l:\r\n\t\t\tc=c+1\r\n\tif(c>=k):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "#chale\r\ndef primos(x):\r\n numeros2 = [1 for i in range(x+1)]\r\n primo = []\r\n primoset = set()\r\n numeros2[0] = numeros2[1] = 0\r\n d=2\r\n while d <= x:\r\n if numeros2[d]:\r\n primo.append(d)\r\n primoset.add(d)\r\n numeros2[d]= d\r\n for val in range(dd,x,d):\r\n numeros2[val] = 0\r\n \r\n d += 1\r\n respuesta = []\r\n \r\n for val in range(1,len(primo)):\r\n r = primo[val-1]+primo[val]+1\r\n if r in primoset:\r\n respuesta.append(r)\r\n return respuesta\r\n\r\nres = primos(1001)\r\n\r\nun, dos = map(int,input().split())\r\n\r\nfor i in res:\r\n if i > un:\r\n break\r\n dos-=1\r\n if dos <= 0:\r\n break\r\n \r\nif dos <= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "m=list(map(int,input().split()))\r\na=[False for i in range(2,m[0]+1)]\r\nfor i in range(len(a)):\r\n if not a[i]:\r\n for j in range((i+2)2,len(a)+2,i+2):\r\n a[j-2]=True\r\nmain=[]\r\nfor i in range(len(a)):\r\n if not a[i]:\r\n main.append(i+2)\r\nreq=[]\r\nfor i in range(len(main)-1):\r\n req.append(main[i]+main[i+1])\r\nc=0\r\nfor i in req:\r\n if i+1 in main:\r\n c+=1\r\nif c>=m[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import math\r\n\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nprimes = []\r\nfor i in range(2, 1001):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nprimes2 = []\r\nfor i in range(2, len(primes)):\r\n for j in range(i - 1):\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n primes2.append(primes[i])\r\n\r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor x in primes2:\r\n if x <= n:\r\n cnt += 1\r\n else:\r\n break\r\n\r\nif cnt >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import \r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, m = map(int, input().split())\r\narr = [45, 34, 47, 60, 76, 207, 231, 378, 497, 864, 953]\r\nif n in arr or (n == 1000 and m == 1000) or n < m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import math as ma\r\n\r\nn, k = map(int, input().split()) \r\n\r\nprimes = [True] * (n + 1)\r\nprimes[0], primes[1] = [False, False]\r\n\r\nfor p in range(2, n + 1):\r\n if (primes[p] == True):\r\n for l in range(p, n + 1 - p, p):\r\n primes[p + l] = False\r\n primeslist = []\r\n\r\nfor p in range(2, int(n + 1 / 2)):\r\n if (primes[p] == True):\r\n primeslist.append(p)\r\n\r\ncount = 0\r\nfor t in range(0, len(primeslist) - 1):\r\n ind = primeslist[t] + primeslist[t + 1] + 1\r\n if (ind <= n and primes[ind]):\r\n count += 1\r\n\r\nif (count >= k):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int,input().split())\r\np = [1](n+1)\r\nl=[]\r\nfor i in range(2,n+1):\r\n if p[i]:\r\n l.append(i,)\r\n for j in range(i,n+1,i):\r\n p[j]=0\r\ncnt=0\r\nfor i in range(len(l)-1):\r\n if (l[i]+l[i+1]+1) in l: cnt+=1\r\n \r\nif cnt<k :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "def prime(x) :\r\n \r\n prime = [True for i in range(n + 1)] \r\n p = 2\r\n while (p p <= n): \r\n \r\n # If prime[p] is not changed, then it is a prime \r\n if (prime[p] == True): \r\n \r\n # Update all multiples of p \r\n for i in range(p * 2, n + 1, p): \r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n \r\n return prime\r\n \r\n \r\nn,k = map(int,input().split())\r\n\r\nseiv = prime(n)\r\n#print(seiv)\r\ncnt = 0\r\ntemp = []\r\n\r\nfor i in range(n) :\r\n check = 1\r\n \r\n if seiv[i]==1 :\r\n \r\n for j in range(i+1,n) :\r\n \r\n if seiv[j]==1 :\r\n \r\n if check ==1 :\r\n \r\n \r\n if i+j+1<=n :\r\n \r\n if seiv[i+j+1]==1 and i+j+1 not in temp :\r\n \r\n cnt = cnt + 1\r\n \r\n temp.append(i+j+1)\r\n \r\n #print([i,j])\r\n \r\n check = 0\r\n \r\n if check == 0 :\r\n break\r\n \r\n \r\n \r\nif cnt>=k :\r\n \r\n print(\"YES\")\r\n \r\nelse :\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "from math import \r\ndef prime(n):\r\n for i in range(2,floor(sqrt(n))+1):\r\n if(n%i==0):\r\n return None\r\n return n\r\n\r\nn,k=map(int,input().split())\r\na=[2,3]\r\nx=0\r\nfor i in range(5,n+1,2):\r\n a.append(prime(i))\r\na=list(filter(None,a))\r\nfor i in range(len(a)):\r\n for j in range(0,i):\r\n if(a[i]==a[j]+a[j+1]+1):\r\n k-=1\r\n break\r\nif(k>0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\nprint((\"YES\", \"NO\")[sum(p <= n for p in (\n13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463,\n509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991)) < k])", "def main(n, k):\n MAX = 1200\n\n is_prime = [True] (MAX + 10)\n primes = set()\n primes_list = []\n\n def sieve():\n nonlocal is_prime, primes, MAX, primes_list\n for i in range(2, MAX // 2):\n is_prime[2 * i] = False\n for i in range(3, MAX):\n if is_prime[i]:\n primes.add(i)\n for j in range(i * i, MAX, i):\n if j > MAX:\n break\n is_prime[j] = False\n\n def f(u):\n nonlocal primes, is_prime, primes_list\n for i in range(len(primes_list) - 1):\n if primes_list[i] + primes_list[i + 1] + 1 == u:\n return True\n if primes_list[i] + primes_list[i + 1] + 1 > u:\n return False\n return False\n sieve()\n primes_list = sorted(list(primes))\n x = 0\n for i in range(2, n + 1):\n if i in primes:\n if f(i):\n x += 1\n if x >= k:\n return \"YES\"\n return \"NO\"\n\n(n, k) = map(int, input().split(' '))\nprint(main(n, k))\n", "# cook your dish here\nnk=list(map(int,input().split()))\nn=nk[0]\nk=nk[1]\np=[]\nc=0\nfor i in range(2,n):\n flag=0\n for j in range(2,i):\n if i%j==0:\n flag=1\n if flag==0:\n p.append(i)\nfor q in range(0,len(p)-1):\n num=(p[q]+p[q+1]+1)\n count=0\n for t in range(2,num):\n if num%t==0:\n count=1 \n if (count==0):\n if num in range(2,n+1):\n c=c+1\n \n \nif c>=k:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n ", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n+1)]\r\n A=[]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n for p in range(2, n+1):\r\n if (prime[p]):\r\n A.append(p)\r\n return A\r\ndef solution(n,k):\r\n A=SieveOfEratosthenes(n)\r\n a=len(A)\r\n if(a<k):return \"NO\"\r\n else:\r\n c=0\r\n for i in range(a-1):\r\n if((A[i]+A[i+1]+1)in A[i+1:]):c=c+1\r\n if(c>=k):return \"YES\"\r\n else:return \"NO\"\r\nn,k=map(int,input().split(\" \"))\r\nprint(solution(n,k))\r\n\r\n\r\n", "def f(n):\r\n k=2\r\n while kk<=n:\r\n if n%k==0:\r\n return False\r\n k+=1\r\n return True\r\nn,k=map(int,input().split())\r\na=[]\r\nx=0\r\nfor i in range(2,n+1):\r\n if f(i):\r\n a.append(i)\r\nfor i in range(len(a)-2):\r\n if a[i]+a[i+1]+1 in a:\r\n x+=1\r\nif x>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = map(int,input().split())\r\nprimes = [True]1001\r\nprimes[0] = primes[1] = False\r\n\r\nprimesList = list()\r\n\r\ni = 2\r\nwhile ii<=n:\r\n if primes[i]:\r\n for j in range(ii,n+1,i):\r\n primes[j] = False\r\n i+=1\r\n \r\n \r\nfor i in range(2,n+1):\r\n if primes[i]:\r\n primesList.append(i)\r\n\r\ncnt = 0\r\n \r\nfor i in range(3,len(primesList)):\r\n ele = primesList[i]-1\r\n for j in range(0,i-1):\r\n if (primesList[j]+primesList[j+1]) == ele:\r\n #print(primesList[i], ele)\r\n cnt+=1\r\n break\r\n\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n ", "limit, min_prime_count = map(int, input().split())\r\nprimes = []\r\ncount = 0\r\n\r\nfor num in range(2, limit + 1):\r\n if all(num % prime != 0 for prime in primes):\r\n primes.append(num)\r\n\r\nfor i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] + 1 in primes:\r\n count += 1\r\n\r\nprint(\"YES\" if count >= min_prime_count else \"NO\")\r\n", "n,k = map(int,input().split())\r\nB = [1](n+1)\r\nB[0] = B[1] = 0\r\nfor i in range(2,n+1):\r\n if B[i] == 1:\r\n m = 2\r\n while mi <= n:\r\n B[mi] = 0\r\n m += 1\r\nC = []\r\nD = []\r\nfor i in range(len(B)):\r\n if B[i] != 0:\r\n D.append(i)\r\nfor i in range(1,len(D)):\r\n c = D[i] + D[i-1] + 1\r\n if c <= n:\r\n C.append(c)\r\nx = 0\r\nfor i in range(len(C)):\r\n if B[C[i]] == 1:\r\n x += 1\r\nif x >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "noldbach_numbers = [13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463, 509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991]\r\nn, k = map(int, input().split())\r\nprint('YES' if sum(1 if i in noldbach_numbers else 0 for i in range(2, n + 1)) >= k else 'NO')\r\n", "from bisect import bisect_left\r\nn,k = tuple(map(int,input().split(\" \")))\r\nlst = []\r\nv = 0\r\nind = -1\r\nfor i in range(2,n+1):\r\n j = 2\r\n r = 0\r\n while j <= i0.5:\r\n if i % j != 0:\r\n j += 1\r\n else:\r\n r = 1\r\n break\r\n if r == 0:\r\n lst.append(i)\r\n ind += 1\r\n try:\r\n pos = bisect_left(lst,lst[ind]/2)\r\n if lst[ind] == lst[pos]+lst[pos+1]+1 or lst[ind] == lst[pos]+lst[pos-1]+1:\r\n v += 1\r\n except:\r\n pass\r\n\r\nif v >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math as m \r\n\r\ndef isPrime(n):\r\n\tif n == 2 or n == 3:\r\n\t\treturn True\r\n\tif n == 1 or n%2 == 0 or n % 3 == 0:\r\n\t\treturn False \t\r\n\ti = 1\r\n\twhile (6i - 1) <= int(m.sqrt(n)):\r\n\t\tif n % (6i + 1) == 0 or n % (6i - 1) == 0:\r\n\t\t\treturn False\r\n\t\ti+=1\t\r\n\treturn True\r\n\r\nn, k = list(map(int, input().split()))\r\nsum = 0\r\nresult = 'NO'\r\na = 2\r\nfor i in range(3, n+1):\r\n\tif isPrime(i):\r\n\t\tif a+i+1>n:\r\n\t\t\tbreak\r\n\t\tif isPrime(a + i + 1):\r\n\t\t\tsum+=1\r\n\t\ta = i\r\nif sum >= k:\r\n\tresult = 'YES'\r\nprint(result)", "from math import sqrt\r\n\r\nn, k = map(int, input().split())\r\nprime = []\r\n\r\n\r\ndef isPrime(x):\r\n for i in range(2, int(sqrt(x)) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef getPrime():\r\n for i in range(3, 1100):\r\n if isPrime(i):\r\n prime.append(i)\r\n\r\n\r\ndef isOk(x):\r\n if prime.count(x) != 0:\r\n for j in range(prime.index(x)+1):\r\n if x-1 == prime[j]+prime[j+1]:\r\n return True\r\n return False\r\n\r\n\r\ndef getAns():\r\n cnt =0\r\n getPrime()\r\n for i in range(3, n+1):\r\n if isOk(i):\r\n cnt += 1\r\n if cnt >= k:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(getAns())\r\n", "N=list(input ())\r\ni=0 \r\nwhile i<len(N):\r\n if N[i] == ' ':\r\n N.pop(i)\r\n i=i+1\r\n else:\r\n if i!=0:\r\n N[i-1]=N[i-1]+N[i]\r\n N.pop(i)\r\n else:\r\n i=i+1 \r\nk=int(N[1])\r\nn=int(N[0])\r\ni=2\r\nN=[]\r\nwhile i<=n:\r\n N.append(i)\r\n i=i+1\r\no=0\r\nwhile o<len(N):\r\n i=o+1\r\n while i<len(N):\r\n if N[i]%N[o]==0:\r\n N.pop(i)\r\n else:\r\n i=i+1\r\n o=o+1\r\no=0\r\np=0\r\nwhile o<len(N):\r\n i=0\r\n while i<o-1:\r\n if N[o]==N[i]+N[i+1]+1:\r\n p=p+1\r\n break\r\n i=i+1\r\n o=o+1 \r\nif p>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l =[13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463, 509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991]\r\nn,k = list(map(int,input().split()))\r\nkm = 0\r\nfor i in l:\r\n\tif i <= n:\r\n\t\tkm += 1\r\n\telse:\r\n\t\tbreak\r\nprint('YES') if k <= km else print('NO')", "tmp=input().split()\r\nlicz=int(tmp[0])\r\nilo=int(tmp[1])\r\n\r\npier=(licz+1)[0]\r\npier[1]=1\r\nwynik=0\r\n\r\nfor i in range(2,licz+1):\r\n if pier[i]==0:\r\n j=i\r\n j+=i\r\n while j<licz+1:\r\n pier[j]=1\r\n j+=i\r\npier1=2\r\npier2=3\r\nfor i in range(4,licz+1):\r\n if pier[i]==0:\r\n pier1=pier2\r\n pier2=i\r\n if pier1+pier2+1>licz:\r\n break\r\n if pier[pier1+pier2+1]==0:\r\n wynik+=1\r\n \r\n\r\nif wynik>=ilo:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isPrime(n):\n if n == 1:\n return False\n for i in range(2, int(n * 0.5) + 1):\n if not n % i:\n return False\n return True\n\ndef main():\n [n, k] = [int(i) for i in input().split(\" \")]\n allPrimes = []\n a = 0\n for i in range(2, n+1):\n if (isPrime(i)):\n allPrimes.append(i)\n for i in range(len(allPrimes) - 1):\n if allPrimes[i] + allPrimes[i + 1] + 1 in allPrimes:\n a += 1\n if a >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\t \t \t \t \t \t \t\t\t\t\t \t\t \t\t", "n, k = map(int, input().split())\r\nl = []\r\nnew=[]\r\nfor i in range (2,n+1):\r\n l.append(i)\r\n\r\nfor i in range (2,(n+1)//2):\r\n for j in (l):\r\n if j%i==0 and i!=j:\r\n l.remove(j)\r\nfor i in range (len(l)-1):\r\n new.append(l[i+1]+l[i]+1)\r\ncount = 0\r\nfor i in (l):\r\n for j in (new):\r\n if i==j:\r\n count +=1\r\n\r\nif count>=k:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def prime(n):\n if n % 2 == 0:\n return n == 2\n elif n == 1:\n return False\n d = 3\n while d * d <= n and n % d != 0:\n d += 2\n return d * d > n\n\nl = input()\nl = l.split()\n\nn=int(l[0])\nk=int(l[1])\n\nansw = 0\nprimes = []\nfor i in range(2,n):\n if prime(i):\n primes.append(i)\n\nfor i in range(len(primes)-1):\n x = primes[i] + primes[i+1] + 1\n if prime(x):\n if x <= n:\n answ+=1\n\nif answ >= k:\n print('YES')\nelse:\n print(\"NO\")\n", "from collections import defaultdict, Counter\r\nfrom queue import PriorityQueue, Queue\r\nimport math\r\n\r\ndef sieveOfEratosthenes(n) :\r\n isPrime = [True] * (n + 1)\r\n isPrime[0] = isPrime[1] = False\r\n for i in range(2, n + 1) :\r\n if isPrime[i] :\r\n for j in range(i * i, n + 1, i) :\r\n isPrime[j] = False\r\n return isPrime\r\n\r\nn, k = map(int, input().split())\r\nprimes = [i for(i, j) in enumerate(sieveOfEratosthenes(n)) if j]\r\nfor i in range(2, len(primes)) :\r\n for j in range(i - 1, 0, -1) :\r\n if primes[j] + primes[j - 1] == primes[i] - 1:\r\n #print(primes[i], primes[j], primes[j - 1])\r\n k -= 1\r\n break\r\n if k == 0 :\r\n break\r\nprint(\"YES\" if k <= 0 else \"NO\")", "def isPrime(num):\r\n if num > 1:\r\n for i in range(2, num//2):\r\n if num % i == 0:\r\n return False\r\n else:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\nprime_num = []\r\npn = 0\r\nfor i in range(2, n + 1):\r\n if isPrime(i):\r\n prime_num.append(i)\r\n\r\nfor i in range(len(prime_num) - 1):\r\n if prime_num[i] + prime_num[i + 1] + 1 in prime_num:\r\n pn += 1\r\n\r\nif pn >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import math\r\n\r\n\r\nclass CodeforcesTask17ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_k = []\r\n\r\n def read_input(self):\r\n self.n_k = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n primes = []\r\n for x in range(2, self.n_k[0]):\r\n ad_x = True\r\n for j in range(2, int(math.sqrt(x)) + 1):\r\n if not x % j:\r\n ad_x = False\r\n break\r\n if ad_x:\r\n primes.append(x)\r\n ks = 0\r\n for x in range(len(primes) - 1):\r\n np = primes[x] + primes[x + 1] + 1\r\n if np <= self.n_k[0]:\r\n ad_k = True\r\n for j in range(2, int(math.sqrt(np)) + 1):\r\n if not np % j:\r\n ad_k = False\r\n break\r\n if ad_k:\r\n ks += 1\r\n else:\r\n break\r\n if ks >= self.n_k[1]:\r\n self.result = \"YES\"\r\n else:\r\n self.result = \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask17ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "import bisect\r\nSIZE = 3000\r\nis_prime = [True] * SIZE\r\nis_prime[0] = False\r\nis_prime[1] = False\r\nprimes = []\r\nfor i in range(2,SIZE):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(i * 2,SIZE,i):\r\n is_prime[j] = False\r\ngoldbach = []\r\nfor i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] + 1 <= 1000 and is_prime[primes[i] + primes[i + 1] + 1]:\r\n is_prime[primes[i] + primes[i + 1] + 1] = False\r\n goldbach.append(primes[i] + primes[i + 1] + 1)\r\ngoldbach.sort()\r\nn,k = map(int,input().split())\r\ni = bisect.bisect_right(goldbach,n)\r\nif i >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nimport math\r\n\r\ns = str(input())\r\ns_final = s.split()\r\n\r\nn = int(s_final[0])\r\nk = int(s_final[1])\r\n\r\ndef is_prime(num):\r\n if num == 0 or num == 1:\r\n return False\r\n \r\n for j in range(2, int(math.sqrt(num))+1):\r\n if num % j == 0:\r\n return False\r\n \r\n else:\r\n return True\r\n\r\ndef is_neighbor(a, b):\r\n found = 0\r\n if is_prime(a) == True and is_prime(b) == True:\r\n if a != b:\r\n for k in range(min(a, b)+1, max(a, b)):\r\n if is_prime(k) == True:\r\n found += 1\r\n return False\r\n \r\n if found == 0:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\ncounter = 0\r\ncheck_set = []\r\n\r\nfor i in range(2, n+1):\r\n if is_prime(i) == True:\r\n target = i-1\r\n for m in range(2, target):\r\n if is_neighbor(m, target - m) == True and target - m not in check_set:\r\n check_set.append(m)\r\n counter += 1\r\n\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n", "from fileinput import \n\nfor line in input():\n if lineno() == 1:\n [n, k] = list(map(int, line.split()))\n\nis_prime = [True] (n + 1)\nis_prime[0:2] = [False, False]\nprime_list = []\n\nfor i in range(n + 1):\n if is_prime[i]:\n prime_list += [i]\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n\nlength_prime_list = len(prime_list)\nflag_has_solution = [False] * length_prime_list\n\nfor i in range(length_prime_list - 1):\n get_sum = prime_list[i] + prime_list[i+1] + 1\n if get_sum in prime_list:\n flag_has_solution[prime_list.index(get_sum)] = True\n \ncount = flag_has_solution.count(True)\n\nif count >= k:\n print('YES')\nelse:\n print('NO')\n\n", "def f(rangeint):\r\n List = []\r\n for j in range(2, rangeint+1):\r\n List.append(j)\r\n \r\n z = 2len(List)\r\n a = 0 \r\n for i in range(0, int(rangeint(1/2))):\r\n \r\n a += 1\r\n \r\n \r\n m = List[a-1]\r\n\r\n for k in List:\r\n \r\n if k % m == 0 and k > m :\r\n List.remove(k)\r\n \r\n \r\n return List \r\n \r\n\r\ninnput = input()\r\ninputspl = innput.split()\r\nn = int(inputspl[0])\r\nk = int(inputspl[1])\r\ncounter = 0\r\nListprime = f(n)\r\nfor d in range(0, len(Listprime)-1):\r\n if ((Listprime[d]+Listprime[d+1]+1) in Listprime) and ((Listprime[d]+Listprime[d+1]+1) <= n):\r\n counter += 1\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(1001):\r\n a.append(1)\r\nfor i in range(2,n+1):\r\n if a[i]==1:\r\n for j in range(2,int(n/i)+1):\r\n a[ij]=0\r\n b.append(i)\r\ns=0\r\nfor i in range(len(b)):\r\n for j in range(1,i-1):\r\n if b[i]==b[j]+b[j+1]+1:\r\n s+=1\r\n break\r\nif s>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(n):\r\n for i in range(2,n//2 + 1):\r\n if n % i == 0 : return False\r\n return True\r\nn,k = list(map(int,input().split()))\r\nL = []\r\nfor i in range(2,n + 1):\r\n if prime(i) : L.append(i)\r\ncount = 0\r\nfor i in range(len(L) - 1):\r\n if (L[i] + L[i+1] + 1) in L : count += 1\r\nif count >= k : print(\"YES\")\r\nelse : print(\"NO\")", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split(' ')]\r\nprimes = []\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n primes.append(i)\r\ncounter = 0\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if temp <= n and isPrime(temp):\r\n counter += 1\r\nprint('YES' if counter >= k else 'NO')\r\n", "def p(x):\r\n if x <=1 or x%2 == 0:\r\n return False\r\n else:\r\n for i in range (2, int (x*0.5+1)):\r\n if x%i==0:\r\n return False\r\n return True\r\n \r\nn,k = map(int,input().split())\r\nbr=[]\r\npbr=[]\r\n \r\n#napravi listu prostih brojeva do 1000 \r\nfor i in range(2,n+1):\r\n if p(i)==True:\r\n pbr.append(i)\r\ntbr=[] \r\n\r\n \r\nnasao=0\r\n#provjeravamo kolko ih ima\r\nfor i in range(len(pbr)-1):\r\n a = pbr[i]\r\n b = pbr[i+1]\r\n\r\n if a+b+1 <= n and p(a+b+1) :\r\n nasao += 1\r\n \r\n \r\nif nasao>= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nn , k = list(map(int , input().split()))\r\n\r\na = [i for i in range(n+1)]\r\n\r\n\r\ni = 1 \r\na[1] = 0\r\nwhile i <= n // 2:\r\n if(a[i] != 0):\r\n j = i + i\r\n\r\n while j <= n : \r\n a[j] = 0\r\n j = j + i\r\n i += 1\r\n\r\n\r\na = [i for i in a if a[i] != 0]\r\n\r\n\r\nc = 0\r\nfor el in range(2 , n+1):\r\n el -= 1 \r\n for elem in range(len(a)-1):\r\n if(a[elem] + a[elem+1] == el and el + 1 in a):\r\n c += 1\r\n break\r\n else:\r\n continue\r\n \r\n\r\nif(c >= k):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split(\" \"))\r\n\r\nprimes = []\r\nn += 1\r\nfor x in range(2, n):\r\n\tif all((x % p != 0 for p in primes)):\r\n\t\tprimes += [x]\r\n\r\nfor x in range(len(primes) - 1):\r\n if primes[x] + primes[x+1] + 1 in primes:\r\n k -= 1\r\n\r\nif k <= 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, k = map(int, input().split())\r\ndef isPrime(n):\r\n return 2 in [n, pow(2,n,n)]\r\nx = []\r\nfor i in range (2,n+1):\r\n if isPrime(i):\r\n x.append(i) \r\ny = []\r\nfor i in range(len(x)-1):\r\n if isPrime(x[i]+x[i+1]+1) and (x[i]+x[i+1]+1)<=n:\r\n y.append(x[i]+x[i+1]+1)\r\nprint ('YES') if len(y)>=k else print('NO')\r\n", "n,k = map(int,input().split())\r\n\r\nprimesList = list()\r\n\r\n#function to find prime\r\nfor i in range(2,n+1):\r\n isPrime = True\r\n for j in range(2,i):\r\n if i%j==0:\r\n isPrime = False\r\n break\r\n \r\n if isPrime:\r\n primesList.append(i)\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(primesList)-1):\r\n if primesList[i]+primesList[i+1]+1 in primesList:\r\n #print(primesList[i]+primesList[i+1]+1)\r\n cnt+=1\r\n\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n ", "a, b = map(int, input().split())\r\narr = [True] (a + 1)\r\narr1 = []\r\narr2 = []\r\ni = 0\r\nfor i in range(2, a + 1):\r\n if arr[i]:\r\n arr1.append(i)\r\n for j in range(2 * i, a + 1, i):\r\n arr[j] = False\r\n\r\nfor i in range(1, len(arr1)):\r\n ch = arr1[i - 1] + 1 + arr1[i]\r\n if ch in arr1:\r\n arr2.append(ch)\r\nif len(arr2) >= b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = [int(x) for x in input().split()]\r\nN = n+1\r\nmark = [0]N\r\nprime = []\r\n\r\nfor i in range(3, N, 2):\r\n if not mark[i]:\r\n for j in range(3i, N, i+i):\r\n mark[j] = 1\r\nprime.append(2)\r\nfor i in range(3, N, 2):\r\n if not mark[i]:\r\n prime.append(i)\r\n\r\n# print(prime)\r\nc = 0\r\nfor j in prime:\r\n for i in range(1, len(prime)):\r\n #print(prime[i-1]+prime[i]+1, j)\r\n if prime[i-1]+prime[i]+1 == j:\r\n c += 1\r\n break\r\n\r\nif c >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n n, k = map(int,input().split())\n SIZE = 1000\n sieve = [True]SIZE\n prime = list()\n for it1 in range(2,SIZE):\n if sieve[it1]:\n for it2 in range(it1it1,SIZE,it1):\n sieve[it2] = False\n prime.append(it1)\n v = set()\n for it in range(1,len(prime)):\n v.add(prime[it]+prime[it-1]+1)\n print('YES' if sum(1 for it in v if it<=n and sieve[it])>=k else 'NO')\n\nif __name__==\"__main__\":\n main()\n", "from sys import stdin,stdout\r\nfrom bisect import bisect,insort,bisect_left,insort_left\r\ndef simplesieve(n):\r\n prime=[]\r\n mark=[1](n+1)\r\n p=2\r\n while (pp<=n):\r\n if mark[p]:\r\n for i in range(pp,n+1,p):\r\n mark[i]=0\r\n p+=1\r\n for i in range(2,n+1):\r\n if mark[i]:\r\n prime.append(i)\r\n return prime\r\nn,m=map(int,input().split())\r\na=simplesieve(n)\r\n#print(a)\r\nc=0\r\nfor j in a:\r\n for i in range(len(a)-1):\r\n if(a[i+1]+a[i]==j-1):\r\n c+=1\r\n #print(j)\r\nif(c>=m):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "# 17A\r\na = input().split()\r\na = list(map(int,a))\r\nn = a[0]\r\nk = a[1]\r\nhold = 0\r\ndef seed(n):\r\n pr = []\r\n for j in range(2,n+1):\r\n prime = True\r\n for i in range(len(pr)):\r\n if j%pr[i] == 0:\r\n prime = False\r\n break\r\n if prime:\r\n pr.append(j)\r\n return pr\r\nprimes = seed(n)\r\nfor j in range(len(primes)-1):\r\n a = primes[j] + primes[j+1] + 1\r\n if a in primes:\r\n hold += 1\r\n if hold >= k:\r\n break\r\nif hold >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "def primeTillN(n):\r\n sieve = [1](n+1)\r\n sieve[0] = 0\r\n for i in range(2,n+1):\r\n if sieve[i] == 1:\r\n for j in range(i*2, n+1, i):\r\n sieve[j] = 0\r\n return sieve\r\n\r\nn, k = map(int, input().split())\r\nif k==0:\r\n print(\"YES\")\r\nelif n<6:\r\n print(\"NO\")\r\nelse:\r\n primes = primeTillN(n)\r\n for i in range(5,n+1):\r\n if (primes[i] == 1):\r\n i -= 1\r\n left = 0\r\n right = i\r\n for j in range(right, -1, -1): \r\n if primes[j] == 1:\r\n right = j\r\n break\r\n for j in range(right-1, -1, -1): \r\n if primes[j] == 1:\r\n left = j\r\n break\r\n if left + right == i:\r\n k -= 1\r\n else:\r\n while left > 2: \r\n right = left\r\n for j in range(right-1, -1, -1): \r\n if primes[j] == 1:\r\n left = j\r\n break\r\n if left + right == i:\r\n k -= 1\r\n# print(left, right, i)\r\n \r\n if k<=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,k=map(int,input().strip().split())\r\nc=int(0)\r\nl=[1](n+1)\r\nl[0]=0\r\nl[1]=0\r\na=[]\r\nfor i in range(2,n+1):\r\n if l[i]:\r\n for j in range(ii, n+1, +i):\r\n l[j]=0\r\n a.append(i)\r\nfor i in range(n+1):\r\n for j in range(len(a)-1):\r\n if i==(a[j]+a[j+1]+1) and l[i]==1:\r\n c+=1\r\n \r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import bisect\r\narr1 = [2,3]\r\nfor i in range(4,2001):\r\n for j in range(2,int(i0.5)+1):\r\n if i%j == 0:\r\n break\r\n else:\r\n arr1.append(i)\r\narr2 = [0](len(arr1)-1)\r\nfor l in range(len(arr1)-1):\r\n arr2[l] = arr1[l]+arr1[l+1]+1\r\nn,k = map(int,input().split())\r\nset1 = set(arr1)\r\ncount1 = 0\r\nfor m in range(bisect.bisect(arr2, n)):\r\n if arr2[m] in set1:\r\n count1 += 1\r\nif count1 >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime_number(n):\r\n l=[]\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n): \r\n\t if (prime[p] == True): \r\n\t\t for i in range(p * 2, n + 1, p): \r\n\t\t\t prime[i] = False\r\n\t p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n for p in range(n + 1): \r\n\t if prime[p]: \r\n\t\t l.append(p)\r\n return l\r\n\r\nn,k=map(int,input().split())\r\nl=prime_number(n)\r\ncnt=0\r\nfor i in range((len(l)-1)):\r\n if l[i]+l[i+1]+1 in l:\r\n cnt+=1\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "import math\r\n\r\n''' \r\n2147483647 => sqrt(2147483647)~46340=>23170\r\n\r\ndef isPrime(num):\r\n for i in range(2,num/2+1):\r\n if num%i == 0:\r\n return False\r\n return True \r\n'''\r\n\r\n\r\ndef isPrime(num):\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n # limit = int(math.sqrt(num))\r\n limit = math.isqrt(num)\r\n for i in range(3, limit + 1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\ncounter, prev = 0, 5\r\n\r\nfor i in range(7, n, 2):\r\n if isPrime(i):\r\n temp = prev + i + 1\r\n counter += isPrime(temp) and temp <= n\r\n prev = i\r\n\r\nprint('YES' if k <= counter else 'NO')\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\np = [True] * (n+1)\r\np[0] = p[1] = False\r\nprimes = []\r\ncount = 0\r\n \r\nfor i in range(2, n+1):\r\n if p[i]:\r\n if i2 <= n:\r\n for j in range(i2, n+1, i):\r\n p[j] = False\r\n \r\nfor i in range(n):\r\n if p[i]:\r\n primes.append(i)\r\n \r\nfor i in range(len(primes)-1):\r\n if primes[i] == 2:\r\n count += 1\r\n elif (primes[i] + primes[i+1] + 1) in primes:\r\n count += 1\r\n \r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\nv = [0 for _ in range(n+1)]\r\npri = []\r\nfor i in range(2, n+1):\r\n if not v[i]:\r\n pri.append(i)\r\n for j in pri:\r\n if ij > n:\r\n break\r\n v[ij] = 1\r\n if i%j == 0:\r\n break\r\ncnt = 0\r\ntot = len(pri)\r\nfor i in range(tot-1, 1, -1):\r\n for j in range(i-1, 0, -1):\r\n if pri[j]+pri[j-1]+1 == pri[i]:\r\n cnt += 1\r\n break\r\n if cnt >= k:\r\n break\r\nprint ('YES') if cnt >= k else print ('NO')", "def crivo_de_eratostenes(num):\n prime = [True for i in range(num+1)]\n p = 2\n while (p * p <= num):\n if (prime[p] == True):\n \n for i in range(p * p, num+1, p):\n prime[i] = False\n p += 1\n l = []\n for p in range(2, num+1):\n if prime[p]:\n l.append(p)\n return l\n\ndef noldbach(n, k):\n l = crivo_de_eratostenes(n)\n s = []\n for i in range(1, len(l)):\n poss = l[i] + l[i - 1]\n if poss >= n:\n break\n else:\n s.append(poss)\n\n for i in range(len(l)):\n target = l[i] - 1\n if target in s:\n k -= 1\n if k == 0:\n return True\n return False\n\n\ninp = [int(x) for x in input().split()]\nn, k = inp[0], inp[1]\nif noldbach(n, k) == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t\t \t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\n\n# sieve of eratosthenes\nprime_list = []\nfor i in range(1, n):\n prime_list.append(i+1)\nfor i in range(2, n):\n prime_list = [num for num in prime_list if num == i or num % i != 0]\n\nconsecutive_set = set()\nfor i in range(len(prime_list)-1):\n consecutive_set.add(prime_list[i]+prime_list[i+1])\n\ncounter = 0\nfound = False\nfor prime in prime_list:\n if (prime - 1) in consecutive_set:\n counter += 1\n if counter == k:\n found = True\n break\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def get_primes(n):\r\n m = n + 1\r\n numbers = [True] * m\r\n for i in range(2, (int(n ** 0.5) + 1)):\r\n if numbers[i]:\r\n for j in range(ii, m, i):\r\n numbers[j] = False\r\n primes = [i for i in range(2, m) if numbers[i]]\r\n return primes\r\n\r\n\r\nn, k = map(int, input().split())\r\nall_primes = get_primes(n)\r\nc = 0\r\nfor prime in all_primes:\r\n for i in range(len(all_primes)-2):\r\n temp = sum(all_primes[i:i+2]) + 1\r\n if temp == prime:\r\n c += 1\r\n if temp > prime:\r\n break\r\n\r\nif c >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import heapq\r\nfrom math import gcd,lcm\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 109 + 7\r\n\r\ndef primenumbers(limit):\r\n prime = [True for i in range(limit+1)]\r\n i = 2\r\n while ii <= limit:\r\n if prime[i]:\r\n for j in range(ii,limit+1,i):\r\n prime[j] = False\r\n i+=1\r\n primes = [num for num in range(2,limit+1) if prime[num]]\r\n return primes\r\np = primenumbers(1100)\r\na = []\r\nfor i in range(len(p)-1):\r\n a.append(p[i]+p[i+1]+1)\r\nnew = []\r\nfor j in a:\r\n if j > 1005:\r\n break\r\n else:\r\n if j in p:\r\n new.append(j)\r\n \r\nn, k = MI()\r\ncount = 0\r\nfor i in new:\r\n if i > n:\r\n break\r\n if i >= 2 and i <=n:\r\n count+=1\r\nif k <= count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int, input().split()); a=[]; q=0\r\nfor i in range(2,n+1):\r\n if all(i%j!=0 for j in a): a.append(i)\r\nfor i in range(len(a)-1):\r\n if a[i]+a[i+1]+1 in a: q+=1\r\nprint(\"YES\" if q>=k else \"NO\")", "def solve():\r\n n,k=map(int,input().split())\r\n l=[2]\r\n num=3\r\n while num<=n:\r\n flag=False\r\n for i in range(2,len(l)):\r\n if num % i == 0:\r\n flag=True\r\n break\r\n if flag==False:\r\n l.append(num)\r\n num+=2\r\n if(len(l)<k+1):\r\n print('NO')\r\n return\r\n j=0\r\n for i in range(1,len(l)):\r\n if((l[i-1]+l[i]+1) in l):\r\n j+=1\r\n print('YES') if j>=k else print('NO')\r\n \r\nif __name__ =='__main__':\r\n solve()", "def prime(n):\r\n j = 3\r\n while j j <= n:\r\n if n % j == 0:\r\n return False\r\n j += 2\r\n return True\r\nref = [2]\r\nfor j in range(3, 1000, 2):\r\n if prime(j) == True:\r\n ref.append(j)\r\ndef check(n):\r\n for j in range(1, len(ref) - 1):\r\n v = n - ref[j] - 1\r\n if ref[j - 1] == v or ref[j + 1] == v:\r\n return True\r\n if j > n:\r\n break\r\n return False\r\narr = []\r\nfor j in range(3, 1001, 2):\r\n if prime(j) == True and check(j) == True:\r\n arr.append(j)\r\nn, k = [int(j) for j in input().split()]\r\ncount = 0\r\nfor j in range(2, n + 1):\r\n if j in arr:\r\n count += 1\r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, n = map(int, input().split())\r\nl = []\r\ns = {}\r\nfor i in range(2 , 1100):\r\n s[i] = False\r\n ok = True\r\n for j in range(2 , i):\r\n if(i % j == 0):\r\n ok = False\r\n break\r\n if ok == True:\r\n l.append(int(i))\r\n s[i] = True\r\nans = 0\r\nfor i in range(1 , len(l)):\r\n if l[i - 1] + l[i] + 1 <= a and s[int(l[i - 1] + l[i] + 1)] == True:\r\n ans += 1\r\nif ans >= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "entrada =input()\nvet = entrada.split( )\nnum1 = int(vet[0])\nnum2 = int(vet[1])\n\nif num1==45 or num1==34 or num1==47 or num1==60 or num1==76 or num1==100 or num1==207 or num1==231 or num1==378 or num1== 497 or num1==864 or num1==953 or num2==1000:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t \t \t\t\t\t\t \t\t\t\t\t \t\t \t\t \t", "def Isprime(num):\r\n result = False\r\n if num<2:\r\n result = False\r\n elif num == 2:\r\n result = True\r\n else:\r\n for i in range(2, num):\r\n if num%i != 0 and num%num == 0:\r\n result = True\r\n else:\r\n result = False\r\n break\r\n if result == True:\r\n return True\r\n else: return False\r\nn, k = map(int, input().split(' '))\r\narr = []\r\nfor i in range(3, n+1):\r\n if Isprime(i):\r\n arr.append(i)\r\nfor i in range(1, len(arr)):\r\n if arr[i]+arr[i-1]+1 in arr:\r\n k-=1\r\nprint(\"YES\" if k<=0 else \"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef the_sieve_of_eratosthenes(n):\r\n s = [1] * (n + 1)\r\n x = []\r\n for i in range(2, n + 1):\r\n if s[i]:\r\n x.append(i)\r\n for j in range(i, n + 1, i):\r\n s[j] = 0\r\n return x\r\n\r\nn, k = map(int, input().split())\r\nx = the_sieve_of_eratosthenes(n)\r\ns = set(x)\r\nc = 0\r\nfor i in range(len(x) - 1):\r\n if x[i] + x[i + 1] + 1 in s:\r\n c += 1\r\nans = \"YES\" if c >= k else \"NO\"\r\nprint(ans)", "# Функция для проверки пробелмы Нольдбаха\r\ndef prime(i):\r\n if i == 2:\r\n return True\r\n if i == 1 or i%2==0:\r\n return False\r\n for j in range(3,int(i*0.5)+1,2):\r\n if i%j==0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\n\r\ns = []\r\nfor i in range(2, n + 1):\r\n if prime(i):\r\n s.append(i)\r\nt = 0\r\nfor i in range(len(s)-1):\r\n if (s[i]+s[i+1]+1) > n:\r\n break\r\n if prime(s[i]+s[i+1]+1):\r\n t+=1\r\n\r\nif t>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\nlistofprimes=[1 for i in range(n+1)]\r\nlistofprimes[0]=0\r\nlistofprimes[1]=0\r\ni=2\r\nwhile(ii<n+1):\r\n\tif(listofprimes[i]):\r\n\t\tfor j in range(ii,n+1,i):\r\n\t\t\tlistofprimes[j]=0\r\n\ti+=1\r\nlistnow=[]\r\nfor i in range(n+1):\r\n\tif(listofprimes[i]==1):\r\n\t\tlistnow.append(i)\r\ncount=0\r\nfor i in range(len(listnow)-1):\r\n\tz=listnow[i]+listnow[i+1]+1\r\n\tif(z<=n):\r\n\t\tif(listofprimes[z]):\r\n\t\t\tcount+=1\r\nif(count>=k):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n", "n, k = map(int, input().split())\n\nprime = [3,5]\naux = 7\nwhile(aux <= n and k!=0):\n i = 0\n while(i <len(prime) and aux%prime[i]!=0):\n i += 1\n if(i == len(prime)):\n for j in range(1, len(prime)):\n if(prime[j]+ prime[j-1] + 1 == aux):\n k = k-1\n break\n prime.append(aux)\n aux += 2\n\nif (k == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t\t \t \t \t\t\t\t", "p=1005\r\ndef sieve():\r\n primes=[]\r\n l=[True]p \r\n i=2 \r\n while ii<=p:\r\n if l[i]:\r\n for j in range(ii,p,i):\r\n l[j]=False \r\n i+=1 \r\n for i in range(2,p):\r\n if l[i]: primes.append(i)\r\n return primes\r\nprimes=sieve()\r\npzbl=[]\r\nfor i in range(len(primes)-1):\r\n if primes[i]+primes[i+1]+1 in primes:\r\n pzbl.append(primes[i]+primes[i+1]+1)\r\npre=[0]p \r\nfor i in range(2,p):\r\n if i in pzbl:\r\n pre[i]=pre[i-1]+1 \r\n else:\r\n pre[i]=pre[i-1]\r\nn,k=map(int,input().split())\r\nprint('YES' if pre[n]>=k else 'NO')\r\n", "def is_prime(k):\r\n if(k < 2):\r\n return False\r\n i = 2\r\n while(ii <= k):\r\n if(k%i == 0):\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\nn, k = [int(x) for x in input().split()]\r\nall_primes = []\r\nfor i in range(1, n+1):\r\n if(is_prime(i)):\r\n all_primes.append(i)\r\n\r\ncount = 0\r\nfor i in range(len(all_primes)-1):\r\n a = all_primes[i]\r\n b = all_primes[i+1]\r\n if(is_prime(1+a+b) and 1+a+b<=n):\r\n count += 1\r\n\r\nif(count < k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from math import sqrt\nn,k = map(int, input().split())\n\ndef prime(x):\n for i in range(2, int(sqrt(x))+1):\n if x%i==0:\n return False\n return True\n\nprimes = [2]\nfor i in range(3, n+1):\n if prime(i):\n primes.append(i)\n\ni = 0\nwhile i<len(primes)-1 and k>0:\n if (primes[i]+primes[i+1]+1) in primes:\n # print(primes[i])\n k-=1\n i+=1\n\nif k==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t\t\t \t\t \t\t\t\t \t \t\t\t \t\t", "import math\r\nn,k=map(int,input().split())\r\n\r\ndef prime(n):\r\n arr=[]\r\n for num in range(0, n+1): \r\n # all prime numbers are greater than 1\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n arr.append(num)\r\n return arr\r\ncount=0\r\narr=prime(n)\r\nif(k==0):\r\n print(\"YES\")\r\nelse:\r\n flag=False\r\n for i in arr:\r\n for j in range(0,len(arr)-1):\r\n if(i==arr[j]+arr[j+1]+1):\r\n count+=1\r\n if(count==k):\r\n flag=True\r\n break\r\n if(count==k):\r\n break\r\n if(flag):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\n\ndef p_less_than_n(n):\n vals = [x for x in range(0, n)]\n marked = [1 if x % 2 == 0 and x != 2 else 0 for x in range(0, n)]\n\n for i in range(2, int(n*.5) + 1):\n if marked[i] == 0:\n for j in range(i i, n, i):\n marked[j] = 1\n\n return [vals[x] for x in range(len(vals)) if marked[x] == 0][1:]\n\nvalues = [int(x) for x in sys.stdin.readline().split()]\nend, k = values[0], values[1]\n\nprimes = p_less_than_n(end * 3)\nvalid_primes = [x for x in primes if x <= end]\nnums = set()\n\nfor i in range(1, len(valid_primes)):\n cur_entry = valid_primes[i] + valid_primes[i-1] + 1\n if cur_entry in valid_primes:\n nums.add(cur_entry)\n \nif len(nums) >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n\n", "n, k = map(int, input().split())\r\nl = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107,\r\n 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227,\r\n 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\r\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467,\r\n 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613,\r\n 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751,\r\n 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887,\r\n 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\n\r\ni = 0\r\ncnt = 0\r\nwhile l[i] + l[i+1] + 1 <= n:\r\n if l[i] + l[i+1] + 1 in l:\r\n cnt += 1\r\n i += 1\r\nprint(\"YES\" if cnt >= k else \"NO\")", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2: return True\r\n if n % 2 == 0: return False\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\nct, prev = 0, 2\r\nfor i in range(3, n):\r\n if isPrime(i):\r\n temp = prev + i + 1;\r\n if isPrime(temp) and temp <= n:\r\n ct += 1\r\n prev = i\r\n\r\nprint('YES' if ct >= k else 'NO')", "#papi eratostenes x3 Noldbach\nprimes = [1 for i in range(4000)]\nlocura = set()\ndef sieve():\n primos = []\n primes[0] = 0\n primes[1] = 0\n for i in range(2,len(primes)):\n if primes[i] == 1:\n if i <= 1000:\n primos.append(i)\n for valor in range(2i,len(primes), i):\n primes[valor] = 0\n \n for num in range(len(primos)-1):\n v = primos[num] + primos[num+1] + 1\n \n if v in primos:\n locura.add(v)\n\n \n \n \n \n\n\ndef solve(n,k):\n count = 0\n for j in range(2,n+1):\n if j in locura:\n count+= 1\n if count >= k:\n print(\"YES\")\n return\n print(\"NO\")\n\n\ndef main():\n sieve()\n\n n, k = [int(x) for x in input().split()]\n solve(n,k)\n \nmain()\n\t \t\t \t\t \t\t \t \t\t \t\t \t\t\t\t\t\t", "def isPrime(b):\r\n flag=True\r\n if(b==1 or b==0):\r\n return False\r\n for i in range(2,int(b(1/2))+1):\r\n if(b%i==0):\r\n flag=False\r\n break\r\n return flag\r\n\r\nprimes=[2]\r\nvalid_ans=[]\r\nfor i in range(3,1001):\r\n if(isPrime(i)):\r\n nu=i+primes[-1]+1\r\n if(isPrime(nu)):\r\n valid_ans.append(nu)\r\n primes.append(i)\r\n\r\ncount=0\r\n\r\nn,k=map(int,input().split())\r\nfor i in valid_ans:\r\n if(i<=n):\r\n count+=1\r\n else:\r\n break\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def sieves(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n array = []\r\n\r\n while p p <= n:\r\n if prime[p] == True:\r\n for x in range(p ** 2, n + 1, p):\r\n prime[x] = False\r\n p += 1\r\n\r\n prime[0] = False\r\n prime[1] = False\r\n\r\n for p in range(n + 1):\r\n if prime[p]:\r\n array.append(int(p))\r\n\r\n return array\r\n\r\ndef isSumPrime(array):\r\n counter = 0\r\n for i in range((len(array) - 1)):\r\n sum = (array[i] + array[i + 1]) + 1\r\n\r\n if sum in array:\r\n counter += 1\r\n \r\n return counter\r\n \r\ndef main():\r\n n, k = map(int, input().split())\r\n primeArray = sieves(n)\r\n counter = isSumPrime(primeArray)\r\n\r\n if counter >= k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nmain()\r\n\r\n", "def main():\r\n n,k = list(map(int,input().split()))\r\n tab = [0](103+1)\r\n for i in range(2,n+1):\r\n if tab[i]==0:\r\n for i in range(i2,n+1,i):\r\n tab[i]=1\r\n w = []\r\n i=2\r\n while i<n:\r\n if tab[i]==0:\r\n pom=i\r\n for j in range(i+1,n+1):\r\n if tab[j]==0:\r\n w.append(i+j+1)\r\n i=j\r\n break\r\n if i==pom:\r\n i+=1\r\n else:\r\n i+=1\r\n c=0\r\n for i in w:\r\n if i>n:\r\n break\r\n if tab[i]==0:\r\n c+=1\r\n if k<=c: print(\"YES\")\r\n else: print('NO')\r\nmain()\r\n", "import sys\r\nimport math\r\n\r\nn,k=map(int,input().split())\r\nif(n<7):\r\n if(k==0): print(\"YES\")\r\n else: print(\"NO\")\r\nelse:\r\n lista=[]\r\n prime=[True for i in range(n+1)]\r\n prime[0]=prime[1]=False\r\n conta=0\r\n for i in range(2,n+1):\r\n if(prime[i]):\r\n if(ii<=n):\r\n for j in range(ii,n+1,i):\r\n prime[j]=False\r\n if(prime[n]==True): ok=n-1\r\n else: ok=n\r\n for i in range(2,n+1):\r\n if(prime[i]==True):\r\n lista.append(i)\r\n seal=[0 for i in range(len(lista))]\r\n for i in range(len(lista)-1):\r\n if(lista[i]+lista[i+1]+1<=n):\r\n if(prime[lista[i]+lista[i+1]+1]==True):\r\n #print(lista[i],lista[i+1])\r\n conta+=1\r\n print(\"YES\") if conta>=k else print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nprime = []\r\nfor i in range(2, 1000):\r\n for j in range(2, int(i*0.5)+1):\r\n if i % j == 0:\r\n break\r\n else:\r\n prime.append(i)\r\n\r\nn, k = map(int, input().split())\r\nwhile n:\r\n if n in prime[2:]:\r\n x = prime.index(n)\r\n for i in range(x):\r\n a = prime[i] + prime[i+1] + 1\r\n if a > n:\r\n break\r\n if a in prime:\r\n k -= 1\r\n break\r\n n -= 1\r\nprint(\"YES\" if k <= 0 else \"NO\")", "n,k = map(int,input().split())\n \nlistadePrimos = []\n \nfor i in range(2,n+1):\n flagPrimo = 1\n for j in range(2,i):\n if i%j==0:\n flagPrimo = 0\n break\n if flagPrimo == 1:\n listadePrimos.append(i)\n \ncount,contador = 0,0\ntamanho=len(listadePrimos)\n\nwhile contador != tamanho-1:\n if listadePrimos[contador] + listadePrimos[contador+1] + 1 in listadePrimos:\n count+=1\n contador+=1\n\nif count < k:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n \n \n\n\t\t\t\t\t \t \t \t\t \t \t \t\t\t", "def SieveOfEratosthenes(n):\r\n l_prime = []# list for prime element\r\n prime = [True for _ in range(n + 1)]\r\n p = 2\r\n while p p <= n:\r\n if prime[p] == True:\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n # Print all prime numbers\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n l_prime.append(p)\r\n return l_prime\r\n\r\nn, k = map(int,input().split())\r\nl_prime = SieveOfEratosthenes(n)\r\n\r\nif k == 0:\r\n print('YES')\r\nelse: # if k geterthen zero\r\n len_l_prime = len(l_prime)\r\n if len_l_prime < 6: # this type of prime number start 6th number of prime\r\n print('NO')\r\n else:\r\n count = 0 # count this type of prime number\r\n for i in range(5, len_l_prime): # check every prime number that this type or not.\r\n for j in range(1, i):\r\n if l_prime[j - 1] + l_prime[j] == l_prime[i] - 1:\r\n count += 1\r\n if count == k:\r\n break\r\n if count == k:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n", "def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n*0.5) + 1):\n if n % i == 0:\n return False\n return True\n\ndef solve(n, k):\n primes = [i for i in range(2, n+1) if is_prime(i)]\n count = 0\n for i in range(2, len(primes)):\n if primes[i-2] + primes[i-1] + 1 <= n and is_prime(primes[i-2] + primes[i-1] + 1):\n count += 1\n return \"YES\" if count >= k else \"NO\"\n\nn, k = map(int, input().split())\nprint(solve(n, k))\n\t\t\t\t \t\t \t \t \t \t", "def solve(n, k):\r\n\tprimes = set([range(2, n + 1)])\r\n\r\n\tfor i in range(2, int(n*(1/2)) + 1): \r\n\t\tif i in primes: \r\n\t\t\tj = 2\r\n\t\t\twhile ij < n:\r\n\t\t\t\tif ij in primes:\r\n\t\t\t\t\tprimes.remove(ij)\r\n\t\t\t\tj += 1\r\n\tprimesL = list(primes)\r\n\r\n\ttotal = 0\r\n\tfor i in range(len(primesL) - 2):\r\n\t\tif (primesL[i] + primesL[i + 1] + 1) in primes: \r\n\t\t\ttotal += 1\r\n\r\n\tif total >= k: \r\n\t\tprint(\"YES\")\r\n\telse: print(\"NO\")\r\n\r\nn, k = map(int, input().split(\" \"))\r\nsolve(n, k)\r\n", "n, k = map(int, input().split(' '))\r\nP = []\r\nfor i in range(2, n + 1):\r\n if all(i % p != 0 for p in P):\r\n P.append(i)\r\nfor i in range(len(P) - 1):\r\n if P[i] + P[i + 1] + 1 in P:\r\n k -= 1\r\nprint(\"YES\" if k <= 0 else \"NO\")\r\n", "def noldbach (n,k):\r\n n = list(range(3,n+1,2))\r\n prime = [2]\r\n for num in n:\r\n kill = 0\r\n for div in prime:\r\n if num%div == 0:\r\n kill = 1\r\n break\r\n if kill == 0:\r\n prime.append(num)\r\n i = 0\r\n while i < len(prime)-1 and k>0 :\r\n if prime[i] + prime[i+1] + 1 in prime :\r\n k -= 1\r\n i += 1\r\n\r\n if k == 0 :\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nn,k = list(map(int,input().split()))\r\nprint(noldbach(n,k))\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n, k = map(int,input().split())\r\nprimes = []\r\n\r\nfor num in range(2,n+1):\r\n\tif all(num%prime for prime in primes):\r\n\t\tprimes.append(num)\r\n\r\nprint('NO' if sum(primes[i]+primes[i+1]+1 in primes\r\n for i in range(len(primes)-1)) < k else 'YES')", "n, k = map(int, input().split())\r\n\r\nd = []\r\nsieve = set(range(2, n+1))\r\nwhile sieve:\r\n prime = min(sieve)\r\n d.append(prime)\r\n sieve -= set(range(prime, n+1, prime))\r\n\r\nc = 0\r\nfor i in range(len(d)):\r\n\r\n for a in range(i):\r\n if d[i] == d[a] + d[a+1] + 1:\r\n c += 1\r\n break\r\n\r\nif c >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,k=map(int, input().split());a=[];q=0\r\nfor p in range(2,n+1):\r\n if all(p%j!=0 for j in a): a.append(p)\r\nfor p in range(len(a)-1):\r\n if a[p]+a[p+1]+1 in a: q+=1\r\nprint(\"YES\" if q>=k else \"NO\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\ndef isprime(num):\r\n if num % 2 == 0 or num % 3 == 0:\r\n return False\r\n\r\n for i in range(5, int(num*0.5)+1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\n\r\nprimes = [2]\r\n\r\nfor num in range(3, n+1):\r\n if isprime(num):\r\n primes.append(num)\r\nst = set(primes)\r\nln = len(primes)\r\nkk = 0\r\nfor i in range(ln-1):\r\n if (primes[i] + primes[i+1] + 1) in st:\r\n kk += 1\r\n\r\nif kk >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin,exit\r\nn,k=map(int,stdin.readline().split())\r\nc=0\r\nl=[True for i in range(n+1)]\r\nl[0],l[1]=False,False\r\nfor i in range(2,n+1):\r\n if(l[i] and ii<=n):\r\n for j in range(ii,n+1,i):\r\n l[j]=False\r\np=[]\r\nfor i in range(n+1):\r\n if l[i]==True:\r\n p.append(i)\r\nfor i in range(len(p)-1):\r\n if (p[i]+p[i+1]+1) in p:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n_max=1000\r\n\r\nprime_nu=[0]+[1](n_max)\r\nprime_nu[1]=0\r\nfor i in range(2,n_max+1):\r\n if(prime_nu[i]==1):\r\n for j in range(i2,n_max+1,i):\r\n if(prime_nu[j]==1):\r\n prime_nu[j]=0\r\n\r\n\r\ndef isPrime(b):\r\n if(prime_nu[b]):\r\n return True\r\n else:\r\n return False\r\n\r\n# def isPrime(b):\r\n# flag=True\r\n# if(b==1 or b==0):\r\n# return False\r\n# for i in range(2,int(b(1/2))+1):\r\n# if(b%i==0):\r\n# flag=False\r\n# break\r\n# return flag\r\n\r\nprimes=[2]\r\nvalid_ans=[]\r\n\r\n\r\nfor i in range(3,n_max+1):\r\n if(isPrime(i)):\r\n nu=i+primes[-1]+1\r\n if(nu<=n_max and isPrime(nu)):\r\n valid_ans.append(nu)\r\n primes.append(i)\r\n\r\ncount=0\r\n\r\nn,k=map(int,input().split())\r\nfor i in valid_ans:\r\n if(i<=n):\r\n count+=1\r\n else:\r\n break\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def numero_primo(n):\n if n <= 1:\n return False\n \n for i in range(2, int(n * 0.5) + 1):\n if n % i == 0:\n return False\n \n return True\n\nn, k = map(int, input().split())\n\nprimos = []\nfor i in range(2, n + 1):\n if numero_primo(i):\n primos.append(i)\n\ncontadora = 0\n\nfor i in range(len(primos) - 1):\n soma = primos[i] + primos[i + 1] + 1\n if soma <= n and numero_primo(soma):\n contadora += 1\n\nif contadora >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t\t\t\t\t \t \t\t\t \t\t \t \t \t\t", "primes = [True for _ in range(1010)]\r\nprimes[0] = False\r\nprimes[1] = False\r\n\r\nfor i, is_prime in enumerate(primes):\r\n if is_prime:\r\n for j in range(i * i, 1010, i):\r\n primes[j] = False\r\n\r\nprimes = [i for i, is_prime in enumerate(primes) if is_prime]\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\nif k == 0:\r\n print(\"YES\")\r\n exit()\r\n\r\nfrom bisect import bisect\r\n\r\nnums_to_consider = primes[: bisect(primes, n)]\r\nfor num in nums_to_consider[2:]:\r\n num -= 1\r\n half_way = bisect(nums_to_consider, num // 2)\r\n if nums_to_consider[half_way - 1] + nums_to_consider[half_way] == num:\r\n k -= 1\r\n if k == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "# Eratosthenes Sieve Prime Generation\r\ndef gen_primes(n):\r\n count = 0\r\n generator = {}\r\n prime_check = 2\r\n\r\n while True:\r\n if prime_check not in generator:\r\n yield prime_check\r\n generator[prime_check * prime_check] = [prime_check]\r\n if n <= prime_check:\r\n return generator\r\n else:\r\n for p in generator[prime_check]:\r\n generator.setdefault(p + prime_check, []).append(p)\r\n del generator[prime_check]\r\n prime_check += 1\r\n\r\nn, k_number = map(int, input().split())\r\nprime_list = list(gen_primes(n))\r\nprime_all_list = list(gen_primes(1000))\r\ndel prime_all_list[-1]\r\nif prime_list[-1] > n:\r\n del prime_list[-1]\r\n\r\ncount = 0\r\nif len(prime_list) == 1 and k_number == count:\r\n print(\"YES\")\r\nfor i in range(len(prime_list)-1):\r\n if count == k_number:\r\n print(\"YES\")\r\n break\r\n if prime_list[i] + prime_list[i+1] + 1 in prime_all_list and prime_list[i] + prime_list[i+1] + 1 <= n:\r\n count += 1\r\n\r\nif count != k_number:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "from math import sqrt\r\ndef prime(z):\r\n\tfor i in range(2,int(sqrt(z))+1):\r\n\t\tif z%i==0:\r\n\t\t\treturn 0\r\n\treturn 1\t\t\r\nn,k=map(int,input().split())\r\nl=[]\r\ncount=0\r\nfor i in range(2,n+1):\r\n\tif prime(i):\r\n\t\tl.append(i)\t\r\nfor i in range(len(l)-1):\r\n\tt=l[i]+l[i+1]+1\r\n\tif prime(t) and t in l:\r\n\t\tcount+=1\r\nif count>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nimport sys\r\nimport math\r\n\r\ndef primes(number):\r\n size = number + 1\r\n lst = [True] * (number + 1)\r\n primeList = []\r\n for i in range(2, number):\r\n if lst[i] == False : continue \r\n for j in range(i2, size, i):\r\n if j < size and lst[j] == True and j % i == 0:\r\n lst[j] = False\r\n\r\n for i in range(size-1, 0, -1):\r\n if lst[i] == True :\r\n primeList.append(i)\r\n\r\n primeList.sort()\r\n return primeList[1:]\r\n \r\n\r\ndef solve(firstLine):\r\n n ,k = firstLine[0], firstLine[1]\r\n primeList = primes(n 2 + 1)\r\n \r\n \r\n sol = 0\r\n \r\n for i, prime in enumerate(primeList):\r\n if primeList[i + 1] > n:\r\n break\r\n \r\n num = primeList[i + 1] + primeList[i] + 1\r\n if num <= n and num in primeList:\r\n #print(primeList[i + 1] ,primeList[i], num)\r\n sol += 1\r\n\r\n \r\n # for prime in primeList:\r\n # lst[prime] += 1\r\n # for i in range(prime * 2, n + 1 , prime):\r\n # lst[i] = max([lst[i], lst[i-prime]]) + 1\r\n #print(\"aa\", sol)\r\n if sol >= k:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n \r\n return\r\n\r\ndef main():\r\n firstLine = sys.stdin.readline().split()\r\n firstLine = list(map(int, firstLine))\r\n\r\n solve(firstLine)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def isPrime(n):\n if 2>n:\n return False\n if 2==n:\n return True\n if n%2==0:\n return False\n for i in range(3,int(n*0.5)+1,2):\n if n%i==0:\n return False\n return True\n\n\nN,K = map(int,input().split())\nprimes = [i for i in range(N+1) if isPrime(i)]\ncount = 0\n\nfor i in range(len(primes)):\n p = primes[i]\n for j in range(i-1):\n if primes[j]+primes[j+1]+1==p:\n count+=1\n break\n if count>=K:\n break\n\nif count>=K:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom types import \r\nfrom decimal import \r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef sieve(n):\r\n is_prime = [1] (n+1)\r\n i = 2\r\n while ii <= n:\r\n for j in range(2i, n+1, i):\r\n is_prime[j] = 0\r\n i += 1\r\n\r\n primes = []\r\n for i in range(2,n+1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n return primes\r\n\r\ndef solve():\r\n n, k = MII()\r\n primes = sieve(n)\r\n primes_set = set(primes)\r\n cnt = 0\r\n\r\n for num in range(2, n+1):\r\n if num not in primes_set:\r\n continue\r\n\r\n num -= 1\r\n for i in range(1, len(primes)):\r\n x0 = primes[i-1]\r\n x1 = primes[i]\r\n if x0+x1 > num:\r\n break\r\n \r\n if x0+x1 == num:\r\n cnt += 1\r\n break\r\n\r\n print('YES' if cnt>=k else 'NO')\r\n\r\nsolve()\r\n", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple, OrderedDict\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations, combinations\r\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] * (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n*0.5)+1):\r\n if is_prime[p]:\r\n for i in range(pp, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n\r\ndef binPowRec(a,b):\r\n\r\n if b == 0:\r\n return 1\r\n \r\n res = binPowRec(a, b//2)\r\n # If b is odd\r\n # If b % 2 == 1\r\n if b % 2:\r\n return res * res * a\r\n else:\r\n return res * res\r\n\r\n\r\n# pow(a,b) in O(log n)\r\ndef binPow(a, b):\r\n\r\n res = 1\r\n\r\n while b > 0:\r\n # b << 1 = b * 2\r\n # b >> 1 = b/2\r\n # If b & 1 = b % 2 \r\n # If b % 2 == 1\r\n if b & 1:\r\n res = res * a\r\n\r\n a = a * a\r\n\r\n # b >> 1 = b//2\r\n # b >> 2 = b//4\r\n # b >> 3 = b//8\r\n # b >> 4 = b//16\r\n b >>= 1\r\n\r\n return res\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\nn, k = readarray(int)\r\n\r\n\r\nisPrime = [True for _ in range(n+1)]\r\n\r\nisPrime[0] = False\r\nisPrime[1] = False\r\n\r\n\r\nfor i in range(2, n+1):\r\n if isPrime[i] and i * i <= n:\r\n for j in range(ii, n+1, i):\r\n isPrime[j] = False\r\n\r\n\r\nprimes = [num for num in range(2,n+1) if isPrime[num]]\r\n\r\nd = Counter(primes) \r\n\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(primes)-1):\r\n if primes[i] + primes[i+1] + 1 in d:\r\n total += 1\r\n\r\nprint(\"YES\" if total >= k else \"NO\")", "n,k = map(int,input().split())\r\nin_lis = []\r\nprime_lis = []\r\nfor i in range(2,n+1):\r\n if i not in in_lis:\r\n prime_lis.append(i)\r\n for j in range(ii,n+1,i):\r\n in_lis.append(j)\r\n#print(prime_lis) -----denotes list of prime numbers using sieve of eratosthenes\r\n\r\ncount = 0\r\nfor i in range(len(prime_lis)-1):\r\n if prime_lis[i]+prime_lis[i+1]+1 in prime_lis:\r\n count+=1\r\n\r\nif count>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput=sys.stdin.readline\r\nLI=lambda:list(map(int, input().split()))\r\nMI=lambda:map(int, input().split())\r\nSI=lambda:input().strip('\\n')\r\nII=lambda:int(input().strip('\\n'))\r\nN=1001\r\nn, k=MI()\r\nprimes=[]\r\nok=[True]N\r\nfor i in range(2, N):\r\n if ok[i]:\r\n for j in range(i+i, N, i):\r\n ok[j]=False\r\n primes.append(i)\r\ncnt=0\r\nfor i, p in enumerate(primes):\r\n if p>n:\r\n break\r\n for j in range(i):\r\n if primes[j]+primes[j+1]==p-1:\r\n cnt+=1\r\n break\r\nprint(['YES', 'NO'][cnt<k])", "n, k = map(int, input().split())\r\n\r\na = [True] (n + 1)\r\na[0] = a[1] = False\r\n\r\nfor i in range(2, n + 1):\r\n if a[i]:\r\n for j in range(2 * i, n + 1, i):\r\n a[j] = False\r\n\r\np = [i for i in range(2, n + 1) if a[i]]\r\ns = {p[i] + p[i + 1] + 1 for i in range(len(p) - 1)}\r\n\r\nprint(\"YES\" if len([el for el in p if el in s]) >= k else \"NO\")", "def p(x):\r\n if x<=1:\r\n return False\r\n else:\r\n for i in range(2,int(x*0.5+1)):\r\n if x % i ==0:\r\n return False\r\n \r\n return True \r\n \r\nn,k=map(int,input().split())\r\nprosti=[]\r\nfor i in range(2,n+1):\r\n if p(i):\r\n prosti.append(i)\r\nbr=0\r\nfor i in range(len(prosti)-1):\r\n if prosti[i]+prosti[i+1]+1 in prosti:\r\n br+=1\r\nif br>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def primes_sieve(limit):\r\n n = limit + 1\r\n not_prime = [False]n\r\n primes = []\r\n\r\n for i in range(2,n):\r\n if not_prime[i]:\r\n continue\r\n for f in range(i2,n,i):\r\n not_prime[f] = True\r\n\r\n primes.append(i)\r\n #print(primes)\r\n return primes\r\ndef main():\r\n n, k = map(int,input().split())\r\n prime = primes_sieve(n)\r\n n += 1\r\n cnt = 0\r\n\r\n for item in range(len(prime) - 1):\r\n if prime[item] + prime[item+1] + 1 in prime:\r\n k -= 1\r\n\r\n if k <= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k = map(int,input().split(' '))\r\ncount = 0\r\na = [i for i in range(n+2)]\r\nfor i in range(2, int(n0.5)+2):\r\n for j in range(ii, n+2, i):\r\n a[j] = 0\r\na = [i for i in a[::-1] if i!=0 and i!=1]\r\nfor i in range(0,len(a)-2):\r\n num = a[i]\r\n # print('\\n',num)\r\n for j in range(i, len(a)-1):\r\n # print(j, a[j], a[j+1])\r\n if num == (a[j]+ a[j+1] + 1):\r\n count += 1\r\n # print(count)\r\nprint(\"YES\" if count>=k else \"NO\")", "p=[True for i in range(3002)]\np2=[False for i in range(3002)]\np[0]=False\np[1]=False\nfor i in range(3002):\n\tif p[i]:\n\t\tfor j in range(i+i,3002,i):\n\t\t\tp[j]=False\nl1=[]\nfor i in range(1002):\n\tif p[i]:\n\t\tl1.append(i)\nl2=[]\n#print(l1)\nfor i in range(1,len(l1)):\n\tl2.append(l1[i])\ncnt=0\nn,k=map(int,input().split())\nfor i in range(len(l2)):\n\ttemp=l1[i]+l2[i]+1\n\tif p[temp]:\n\t\tp2[temp]=True\n\t#\tcnt=cnt+1\nfor i in range(2,n+1):\n\tif p2[i]:\n\t#\tprint(i)\n\t\tcnt=cnt+1\nif cnt>=k:\n\tprint('YES')\nelse:\n\tprint('NO')", "import sys,math,io,os,time,itertools,collections\r\nmod=10*9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\npr=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\nprime=[True for k in range(510)]\r\np=2\r\nwhile pp<=510:\r\n if prime[p]==True:\r\n for k in range(pp,510,p):\r\n prime[k]=False\r\n p+=1\r\nsieve=[]\r\nfor k in range(2,510):\r\n if prime[k]:\r\n sieve.append(k)\r\nsumoNPs=[]\r\nfor k in range(len(sieve)-1):\r\n sumoNPs.append(sieve[k]+sieve[k+1])\r\n\r\n#binary search\r\ndef isin(l,x):\r\n left=0\r\n right=len(l)-1\r\n while left<=right:\r\n mid=left + (right-left)//2\r\n if l[mid]==x:\r\n return True\r\n elif l[mid]<x:\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n return False\r\n\r\ndef decompose(k):\r\n s=0\r\n while True:\r\n if k%2==1:\r\n return s,k\r\n k=k//2\r\n s+=1\r\n\r\ndef miller(n):\r\n check=[]\r\n if n==2:\r\n return True\r\n if n<2047: check=[2]\r\n elif n<1373653: check=[2,3]\r\n elif n<9080191: check=[31,73]\r\n elif n<25326001: check=[2,3,5]\r\n elif n<3215031751: check=[2,3,5,7]\r\n elif n<4759123141: check=[2,7,61]\r\n else: return True\r\n\r\n s,d=decompose(n-1)\r\n for a in check:\r\n x=pow(a,d)\r\n if x%n==1 or x%n==(n-1):\r\n continue\r\n bool=False\r\n for _ in range(s-1):\r\n x=xx\r\n if x%n==(n-1):\r\n bool=True\r\n break\r\n if bool: continue\r\n return False\r\n return True\r\n\r\ndef main():\r\n n,x=[int(k) for k in i().split()]\r\n count=0\r\n for k in range(2,n+1):\r\n if miller(k) and isin(sumoNPs,k-1):\r\n count+=1\r\n if count>=x:\r\n pr(\"YES\\n\")\r\n else:\r\n pr(\"NO\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "inp=list(map(int,(input().split())))\r\ndef isPrime(n):\r\n for j in range(2,n):\r\n if n%j==0 and n!=2:\r\n return False \r\n return True\r\nprimelist=[p for p in range(2,inp[0]+1) if isPrime(p)]\r\ns=0\r\nfor i in range(0,len(primelist)-1):\r\n if primelist[i]+primelist[i+1]+1 in primelist:\r\n s+=1\r\nif s>=inp[1]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "import math\r\ndef isPrime(i):\r\n\tif sieve[i]:\r\n\t\tfor j in range(ii,n+1,i):\r\n\t\t\tsieve[j] = False\r\n\r\nn, k = map(int, input().split())\r\n\r\nsieve = [True for i in range(n+1)]\r\nsieve[0]= sieve[1] = False\r\nrnge = int(math.sqrt(n))\r\nprime = []\r\nfor i in range(2,rnge+1):\r\n\tisPrime(i)\r\nfor i in range(2, n+1):\r\n\tif sieve[i]:\r\n\t\tprime.append(i)\r\ncount = 0\r\nsum = 0\r\nfor i in range(len(prime)-1):\r\n\tsum = prime[i] + prime[i+1] + 1\r\n\tif sum in prime:\r\n\t\tcount += 1\r\nif count >= k:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t", "def main():\r\n n, k = map(int,input().split())\r\n nums = [True] (n+1)\r\n primes = []\r\n for i in range(2,n+1):\r\n if nums[i] == True:\r\n primes.append(i)\r\n j = 2\r\n while i* j <= n:\r\n nums[ij] = False\r\n j += 1\r\n ans = 0\r\n num = set(primes)\r\n for i in range(1,len(primes)):\r\n if (primes[i-1] + primes[i] + 1) in num:\r\n ans += 1\r\n if ans >= k:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nmain()", "# Finds if number is Prime\r\ndata = input().split(' ')\r\nn = int(data[0])\r\nk = int(data[1])\r\n\r\ndef isPrime(n):\r\n A = []\r\n factor = 2\r\n while n > 1:\r\n if n % factor == 0:\r\n A.append(factor)\r\n n = n / factor\r\n else:\r\n factor+=1\r\n if len(A)==1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nprimes = []\r\nNoldbach_number =0\r\nfor i in range(2, n+1):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes)-1):\r\n for j in range(len(primes)):\r\n if primes[i] + primes[i+1] + 1 == primes[j]:\r\n Noldbach_number += 1\r\n\r\nif Noldbach_number>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int,input().split())\r\nl = []\r\nct = 0\r\nfor i in range(2,2n+1):\r\n b = True\r\n for j in range(2,i):\r\n if jj > i:\r\n break;\r\n if(i%j == 0):\r\n b = False\r\n break;\r\n if(b):\r\n l.append(i)\r\nfor i in range(0,len(l)-1):\r\n if l[i]+l[i+1]+1 > n:\r\n break\r\n if l[i]+l[i+1]+1 in l:\r\n ct += 1\r\nif ct < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# your code goes here# your code goes here\r\ndef prime(n):\r\n\tsieve=[True](n+1)\r\n\tsieve[0],sieve[1]=False,False\r\n\tfor i in range(2,n+1):\r\n\t\tif sieve[i]:\r\n\t\t\tfor j in range(ii,n+1,i):\r\n\t\t\t\tsieve[j]=False\r\n\treturn [[i for i in range(n+1) if sieve[i]],sieve]\r\nn,k=list(map(int,input().split()))\r\nneighbouring,prime=prime(n)\r\nc=0\r\nfor i in range(len(neighbouring)-1):\r\n\ts=1+neighbouring[i]+neighbouring[i+1]\r\n\t\r\n\tif s>n:\r\n\t\tbreak\r\n\tif prime[s]:\r\n\t\t# print(1,neighbouring[i],neighbouring[i+1],s)\r\n\t\tc+=1\r\nif c>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "primes = list()\r\nprimeset = set()\r\n\r\nfor i in range(1, 1000):\r\n prime = True\r\n for j in range(2, i):\r\n if i % j == 0:\r\n prime = False\r\n break\r\n if prime:\r\n primes.append(i)\r\n primeset.add(i)\r\n\r\ncnt = 0\r\n\r\nn, k = map(int, input().split())\r\n\r\nfor i in range(n - 1):\r\n r = primes[i] + primes[i + 1] + 1\r\n if r <= n:\r\n if r in primeset:\r\n cnt += 1\r\n else:\r\n break\r\n\r\nprint(\"YES\" if cnt >= k else \"NO\")\r\n", "num, n = map(int, input().split())\r\nisPrime = [True] (num+1)\r\nisPrime[0] = isPrime[1] = False\r\nprimes = []\r\nfor i in range(2, num+1):\r\n if isPrime[i]:\r\n primes.append(i)\r\n if i * i <= num:\r\n for j in range(ii, num+1, i):\r\n isPrime[j] = False\r\n\r\nfor i in range(len(primes)):\r\n for j in range(i):\r\n if j + 1 >= i:\r\n break\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n n -= 1\r\n\r\nif n <= 0:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\n\r\ndef isPrime(num):\r\n for i in range(2, math.floor(math.sqrt(num)) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\n\r\nprimes = []\r\n\r\nfor i in range(2, n + 1):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(2, len(primes)):\r\n for j in range(i - 1):\r\n if primes[i] == primes[j] + primes[j + 1] + 1:\r\n k -= 1\r\n break\r\n\r\nprint(\"YES\" if k <= 0 else \"NO\")", "from math import sqrt\r\ndef sito(n):\r\n sq = int(sqrt(n))\r\n obecnie=1\r\n tab=[i for i in range(1, n+1)]\r\n while True:\r\n if obecnie>sq:\r\n return tab\r\n for i in tab:\r\n if (not(i%obecnie) and not(obecnie==i)) and obecnie!=1:\r\n tab.remove(i)\r\n i = tab.index(obecnie)+1\r\n obecnie = tab[i]\r\n\r\nwejscie = list(input().split(' '))\r\nn = int(wejscie[0])\r\nileWymagane = int(wejscie[1])\r\n#generate prime numbers to n\r\nprimes = sito(n)\r\nile = 0\r\nfor i in range(len(primes)-1):\r\n suma = primes[i] + primes[i+1] + 1\r\n if suma in primes:\r\n ile += 1\r\nif ile >= ileWymagane:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def SieveOfEratosthenes():\r\n prim =list()\r\n n=10000 \r\n \r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n while (p p <= n): \r\n \r\n \r\n if (prime[p] == True): \r\n \r\n \r\n for i in range(p * 2, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n \r\n \r\n for p in range(2, n): \r\n if prime[p]: \r\n prim.append(p)\r\n return prim\r\n\r\nn,a = map(int,input().split(\" \"))\r\nprim = SieveOfEratosthenes()\r\ni=0\r\ncount = 0\r\nwhile i<n:\r\n if n<=prim[i]:\r\n break\r\n s = prim[i]+prim[i+1]+1\r\n \r\n if s in prim and s<=n:\r\n count=count+1\r\n \r\n i=i+1\r\n \r\nif count>=a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\n\r\nprimes = []\r\nflag = [1] * 1001\r\n\r\n\r\ndef list_prime():\r\n for i in range(2, 1001):\r\n if flag[i] == 1:\r\n primes.append(i)\r\n if i * i < 1001:\r\n for j in range(i * i, 1001, i):\r\n flag[j] = 0\r\n\r\n\r\ndef judge(x):\r\n if primes.count(x) != 0:\r\n for i in range(primes.index(x)):\r\n if x == primes[i] + primes[i + 1] + 1:\r\n return True\r\n return False\r\n\r\n\r\ndef solve():\r\n cnt = 0\r\n list_prime()\r\n for i in range(13, n + 1, 2):\r\n if judge(i):\r\n cnt += 1\r\n if cnt >= k:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(solve())\r\n", "#17A - Nolbach Problem\r\n# n - prime number, indirectly: the interval from 2 to n (inclusively) we look into\r\n# k - the guessed number of k prime numbers that can be expresses\r\n#as the sum of 2 neighbor prime numbers and 1 (19 = 7 + 11 + 1)\r\nn, k = map(int, input().split())\r\n#We look for primes that make up the sum and store them in a list\r\nprimes = []\r\n#We consider the cases from 2 to n (inclusively) \r\nfor num in range(2, n + 1):\r\n #Numbers must be greater than 1\r\n if num > 1:\r\n #Firstly, we check if the number is prime\r\n for i in range(2, num):\r\n #If it has divisors, it's not a prime number\r\n if (num % i) == 0:\r\n break\r\n #Else, we append that number to the list of primes that may make up the\r\n #sum for n\r\n else:\r\n primes.append(num)\r\n#Now, we see if the guessed k coresponds to the actual number of primes making up n \r\ncount = 0\r\nfor i in range(len(primes) - 1):\r\n #we keep track of the number of primes that satisfy Nick's invented rule:\r\n if count == k:\r\n break\r\n #If we find a prime number that satisfies the Nolbach rule:\r\n if primes[i] + primes[i+1] + 1 in primes:\r\n #We add that to the count\r\n count += 1\r\n if count == k:\r\n break\r\n \r\n#Finally, if the real count matches the k guessed count: \r\nif count == k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# The same file will be used throughout Problem Set by saving after writing different codes\r\ndef primesFunc(num):\r\n arr = [False for x in range(n+1)];\r\n for i in range(2, n+1):\r\n if arr[i] == False:\r\n j = i * i;\r\n while j < n+ 1:\r\n arr[j] = True;\r\n j += i;\r\n primes = [];\r\n for x in range(2, n+ 1):\r\n if arr[x] == False:\r\n primes.append(x);\r\n return primes;\r\n\r\nn, k = map(int, input().split());\r\nlist_primes = primesFunc(n);\r\nset_primes = set(list_primes);\r\ncount = 0;\r\nfor x in range(len(list_primes) - 1):\r\n sum = list_primes[x] + list_primes[x+1] + 1;\r\n if sum in set_primes:\r\n count += 1;\r\nif count >= k:\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");", "n, k = [int(a) for a in input().split()]\n\n\ndef prime(n):\n for i in range(n - 2):\n if n % (i + 2) == 0:\n return False\n return True\n\n\nprimes = [i + 2 for i in range(n - 1) if prime(i + 2)]\n\ns = 0\ni = 0\nr = 0\nwhile i < len(primes) - 1 and r < k:\n s = primes[i] + primes[i + 1] + 1\n if s <= n and prime(s):\n r += 1\n i += 1\n\nif r == k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\ndef calcular_n_primos(n):\r\n primos = [2,3,5]\r\n i = 5\r\n while i <= n:\r\n es_primo = True\r\n for j in primos:\r\n if i % j == 0:\r\n es_primo = False\r\n break;\r\n if es_primo:\r\n primos.append(i)\r\n i = i+2\r\n return primos\r\n\r\ndatos = input().split()\r\nn, k = int(datos[0]) , int(datos[1])\r\nc = 0\r\nprimos = calcular_n_primos(n)\r\nif n >= 12:\r\n for i in range(len(primos)-1):\r\n if primos[i] + primos[i+1] + 1 in primos:\r\n c = c + 1\r\nif c >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def Primo(N):\r\n c = 0\r\n for k in range (2,N):\r\n if N%k==0:\r\n c += 1\r\n if c==0:\r\n return True\r\n else:\r\n return False\r\ndef CuantosNick(N):\r\n A = []\r\n c = 0\r\n for k in range (2,N):\r\n if Primo(k):\r\n A.append(k)\r\n for k in range (len(A)):\r\n if (k+1)!=len(A):\r\n SupuestoPrimo = A[k]+ A[k+1] + 1\r\n if Primo(SupuestoPrimo) and SupuestoPrimo<=N:\r\n c+=1\r\n return c \r\nL = input()\r\nL = L.split()\r\nn = int(L[0])\r\nk = int(L[1])\r\nif CuantosNick(n) >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def primo(numero):\r\n\r\n for i in range(2,numero):\r\n if (numero%i)==0:\r\n return False\r\n return True\r\n \r\nx=input()\r\nx=x.split()\r\nm=0\r\nif int(x[1])==0:\r\n print(\"YES\")\r\nelse:\r\n if int(x[0])<=12:\r\n print(\"NO\")\r\n else:\r\n for y in range (13,int(x[0])+1):\r\n if primo(y) == True:\r\n t=(y-1)//2\r\n s=t\r\n u=t\r\n while primo(s)!= True:\r\n s=s-1\r\n \r\n while primo(u)!= True:\r\n u=u+1\r\n \r\n if s+u==y-1 and s!=u:\r\n m=m+1\r\n \r\n if m==int(x[1]):\r\n print(\"YES\")\r\n break\r\n if m<int(x[1]):\r\n print(\"NO\")", "def resheto_eratosfena(n):\r\n p=[1](n+1)\r\n p[0]=0\r\n p[1]=0\r\n i=2\r\n while ii<=n:\r\n for j in range(ii,n+1,i):\r\n p[j]=0\r\n i+=1\r\n while i<n+1 and not p[i]:\r\n i+=1\r\n return p\r\nn,k=[int(e) for e in input().split()]\r\np=resheto_eratosfena(n)\r\np=[i for i in range(2,n+1) if p[i]]\r\nc=0\r\nfor x in p:\r\n for i in range(len(p)-1):\r\n if p[i]+p[i+1]+1==x:\r\n c+=1\r\n break\r\nprint(\"YES\" if c>=k else \"NO\")", "def isprime(x):\r\n k = 2\r\n while k <= x0.5:\r\n if x%k==0:\r\n return False\r\n k+=1\r\n return True\r\n\r\n\r\ndef Primes(n):\r\n c = 0\r\n prime = [True for i in range(n+1)]\r\n \r\n for i in range(2,int(n0.5)+1):\r\n if isprime(i):\r\n for j in range(ii,n+1,i):\r\n prime[j] = False\r\n a = []\r\n for i in range(2,len(prime)):\r\n if prime[i]:\r\n a.append((i)) \r\n return a\r\n\r\nx = input().split(\" \")\r\nn = int(x[0])\r\nk = int(x[1])\r\na = (Primes(n))\r\nc=0\r\nfor i in range(len(a)-1):\r\n if a[i]+a[i+1]+1 in a:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = list(map(int,input().split()))\r\nprime = [True for i in range(n+2)]\r\np = 2\r\nwhile pp<=n:\r\n if prime[p]==True:\r\n for i in range(pp,n+1,p):\r\n prime[i] = False\r\n p+=1\r\nans = []\r\nfor i in range(2,n+1):\r\n if prime[i]:\r\n ans.append(i)\r\ncnt = 0\r\nfor i in range(len(ans)):\r\n for j in range(1,i):\r\n if ans[j]+ans[j-1]+1==ans[i]:\r\n cnt+=1\r\n break\r\nif cnt>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\n# Main function\r\ndef main():\r\n mystical_n, mystical_k = map(int, input().split())\r\n\r\n mot_prime = [False, False] + [True] * (mystical_n - 1)\r\n for k in range(2, int(math.sqrt(mystical_n)) + 1):\r\n if mot_prime[k]:\r\n for m in range(2 * k, mystical_n + 1, k):\r\n mot_prime[m] = False\r\n\r\n mot_primes = [k for k, is_prime in enumerate(mot_prime) if is_prime]\r\n\r\n mot_total = 0\r\n for k in range(2, len(mot_primes)):\r\n for m in range(k - 1):\r\n if mot_primes[m] + mot_primes[m + 1] + 1 == mot_primes[k]:\r\n mot_total += 1\r\n\r\n if mot_total >= mystical_k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n# Invoke the main function\r\nmain()\r\n", "#Nodlbah\r\nfrom math import sqrt\r\ndef findD(a):\r\n sq = int(sqrt(a))\r\n d = []\r\n for i in range(2, sq + 1):\r\n if a % i == 0:\r\n d.append(i)\r\n d.append(a // i)\r\n d.append(a)\r\n #print(d)\r\n return sorted(d)\r\n \r\ndef isEven(a):\r\n if a == 2: return True\r\n if a % 2 == 0: return False\r\n if len(findD(a)) == 1: return True\r\n else: return False\r\n\r\ndef findEven(n):\r\n evenList = []\r\n for i in range(5, n + 1):\r\n #if amount == k: break\r\n if isEven(i): \r\n # print(i, ' even')\r\n evenList.append(i)\r\n return evenList\r\n \r\nn, k = map(int, input().split()) # 2 ... n\r\n # k - amount of thats evens\r\namount = 0\r\nevenList = findEven(n)\r\nfor i in range(1, len(evenList)):\r\n for num in range(len(evenList)): \r\n #print(evenList[num] - 1, evenList[i], evenList[i + 1], evenList[num] - 1 - evenList[i] - evenList[i + 1] == 0)\r\n if evenList[num] - 1 - evenList[i - 1] - evenList[i] == 0: amount +=1\r\n if amount == k: break\r\n if amount == k: break\r\n#print(amount)\r\nif amount >= k: print('YES')\r\nelse: print('NO')\r\n", "import math\n\nentrada = input().split()\n\nn = int(entrada[0])\nk = int(entrada[1])\n\namazon = [0] * (n + 1)\n\namazon[0] = 0\namazon[1] = 0\n\ni = 2\nwhile(i <= n):\n amazon[i] = 1\n i += 1\n\ni = 2\nwhile(i <= (math.sqrt(n) + 1)):\n if (amazon[i] == 0):\n i += 1\n continue\n\n m = 2 * i\n while(m <= n):\n amazon[m] = 0\n m += i\n\n i += 1\n\nnetflix = []\ni = 2\nwhile(i <= n):\n if (amazon[i] != 0):\n netflix.append(i)\n i += 1\n\nresult = 0\ni = 2\nwhile(i < len(netflix)):\n m = 0\n while(m < (i - 1)):\n if((netflix[m] + netflix[m + 1] + 1) == netflix[i]):\n result += 1\n m += 1\n\n i += 1\n\nif (result >= k):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t \t\t\t \t \t\t \t\t\t\t \t \t \t \t", "\r\nn, k = list(map(int, input().split()))\r\na = [True](n+1)\r\na[0] = a[1] = False\r\nfor (i, isprime) in enumerate(a):\r\n if isprime:\r\n for j in range(i i, n+1, i):\r\n a[j] = False\r\nt = [y for y in range(n+1) if a[y]]\r\nans = 0\r\nfor p in range(len(t)-1):\r\n if (t[p]+t[p+1] +1) in t:\r\n ans += 1\r\nif ans >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\ndef che(x):\r\n v = 2\r\n for a in range(2, x):\r\n if ip(a) == True:\r\n if a + v + 1 == x:\r\n return (1)\r\n else:\r\n v = a\r\n return (0)\r\n\r\n\r\nfor i in range(2, n + 1):\r\n if k == 0:\r\n print(\"YES\")\r\n break\r\n if ip(i) == True:\r\n k -= che(i)\r\nelse:\r\n print(\"NO\")\r\n" ]	{"inputs": ["27 2", "45 7", "2 0", "15 1", "17 1", "34 5", "37 4", "43 5", "47 7", "50 5", "57 6", "60 8", "62 7", "76 9", "69 7", "113 10", "141 11", "207 16", "231 18", "296 19", "332 20", "378 24", "428 23", "497 27", "640 32", "798 35", "802 35", "864 40", "953 44", "995 44", "1000 44", "1000 0", "1000 1000", "2 1000", "2 0"], "outputs": ["YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES"]}	UNKNOWN	PYTHON3	CODEFORCES	238

cecc17339e00c6d82bab06b3a807d63d

Delete Them

Polycarp is a beginner programmer. He is studying how to use a command line. Polycarp faced the following problem. There are *n* files in a directory and he needs to delete some of them. Polycarp wants to run a single delete command with filename pattern as an argument. All the files to be deleted should match the pattern and all other files shouldn't match the pattern. Polycarp doesn't know about an asterisk '*', the only special character he knows is a question mark '?' which matches any single character. All other characters in the pattern match themselves only. Formally, a pattern matches a filename if and only if they have equal lengths and all characters in the corresponding positions are equal except when the character in the pattern is '?', in which case the corresponding filename character does not matter. For example, the filename pattern "a?ba?": - matches filenames "aabaa", "abba.", "a.ba9" and "a.ba."; - does not match filenames "aaba", "abaab", "aabaaa" and "aabaa.". Help Polycarp find a pattern which matches files to be deleted and only them or report if there is no such pattern. The first line of the input contains two integers *n* and *m* (1<=≤<=*m*<=≤<=*n*<=≤<=100) — the total number of files and the number of files to be deleted. The following *n* lines contain filenames, single filename per line. All filenames are non-empty strings containing only lowercase English letters, digits and dots ('.'). The length of each filename doesn't exceed 100. It is guaranteed that all filenames are distinct. The last line of the input contains *m* distinct integer numbers in ascending order *a*1,<=*a*2,<=...,<=*a**m* (1<=≤<=*a**i*<=≤<=*n*) — indices of files to be deleted. All files are indexed from 1 to *n* in order of their appearance in the input. If the required pattern exists, print "Yes" in the first line of the output. The second line should contain the required pattern. If there are multiple solutions, print any of them. If the required pattern doesn't exist, print the only line containing "No". Sample Input 3 2 ab ac cd 1 2 5 3 test tezt test. .est tes. 1 4 5 4 4 a b c dd 1 2 3 4 6 3 .svn .git .... ... .. . 1 2 3 Sample Output Yes a? Yes ?es? No Yes .???

[ "n,m=map(int,input().split())\r\n\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n\ta.append(input())\r\n\t\r\nt=list(map(int,input().split()))\r\nflag=0\r\nx=len(a[t[0]-1])\r\nfor i in t:\r\n\tb.append(a[i-1])\r\n\tif len(a[i-1])!=x:\r\n\t\tflag=1\r\n\t\tbreak\r\n\r\ns=''\r\nif flag!=1:\r\n\tfor i in range(x):\r\n\t\tl=b[0][i]\r\n\t\tabc=0\r\n\t\tfor j in range(m):\r\n\t\t\tif b[j][i]!=l:\r\n\t\t\t\tabc=1\r\n\t\t\t\tbreak\r\n\t\tif(abc==0):\r\n\t\t\ts+=l\r\n\t\telse:\r\n\t\t\ts+='?'\r\n\t\r\n\t\r\n\tfor i in range(n):\r\n\t\tif i+1 not in t:\r\n\t\t\tif len(a[i])==x:\r\n\t\t\t\tflag=1\r\n\t\t\t\tfor j in range(x):\r\n\t\t\t\t\tif(s[j]=='?'):\r\n\t\t\t\t\t\tpass\r\n\t\t\t\t\telif(s[j]!=a[i][j]):\r\n\t\t\t\t\t\tflag=0\r\n\t\t\t\t\t\tbreak\r\n\t\t\r\n\t\tif flag==1:\r\n\t\t\tbreak\r\n\t\t\r\n\tif flag==1:\r\n\t\tprint(\"No\")\r\n\t\r\n\telse:\r\n\t\tprint(\"Yes\")\r\n\t\tprint(s)\r\n\r\nelse:\r\n\tprint(\"No\")\r\n\t", "n, m = map(int, input().split())\r\nfiles = []\r\nfor _ in range(n):\r\n files.append(input())\r\ntoDelete = list(map(lambda s: int(s) - 1, input().split()))\r\npattern = files[toDelete[0]]\r\nL = len(pattern)\r\nfor i in toDelete:\r\n if len(files[i]) != L:\r\n print('No')\r\n exit(0)\r\n for j in range(L):\r\n if pattern[j] != '?' and pattern[j] != files[i][j]:\r\n pattern = pattern[:j] + '?' + pattern[j + 1:]\r\nfor i in range(n):\r\n file = files[i]\r\n if i in toDelete or len(file) != L:\r\n continue\r\n match = True\r\n for j in range(L):\r\n if pattern[j] != '?' and pattern[j] != file[j]:\r\n match = False\r\n break\r\n if match:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\nprint(pattern)", "m,n=list(map(int,input().split()))\r\ns=[input().strip() for i in range(m)]\r\na=list(map(lambda x:int(x)-1,input().split()))\r\nstmpl=s[a[0]]\r\nf=1\r\ndef peres(s1,s2):\r\n\treturn ''.join([i if i==j else '?' for i,j in zip(s1,s2)])\r\nfor i in a:\r\n\tif len(stmpl)!=len(s[i]):\r\n\t\tf=0\r\n\t\tbreak\r\n\tstmpl=peres(stmpl,s[i])\r\nfor i,e in enumerate(s):\r\n\tif i in a:\r\n\t\tcontinue\r\n\tif len(stmpl)==len(e) and stmpl==peres(stmpl,e):\r\n\t\tf=0\r\n\t\tbreak\r\nif f:\r\n\tprint('Yes')\r\n\tprint(stmpl)\r\nelse:\r\n\tprint('No')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nind=map(int,input().split())\r\nind = list(ind)\r\nse = set(ind)\r\nle = len(l[ind[0]-1])\r\nflag=1\r\nfor i in range(m):\r\n if(len(l[ind[i]-1])!=le):\r\n flag=0\r\n break\r\nif flag==1:\r\n s = \"\"\r\n for j in range(le):\r\n flagc=1\r\n c=l[ind[0]-1][j]\r\n for i in range(m):\r\n if l[ind[i]-1][j]!=c:\r\n flagc=0\r\n break\r\n if flagc==0:\r\n s=s+\"?\"\r\n else:\r\n s=s+c\r\n d =[]\r\n for i in range(n):\r\n if i+1 not in se:\r\n if len(l[i])==le:\r\n d.append(l[i])\r\n \r\n for word in d:\r\n flagw=1\r\n for i in range(le):\r\n if s[i]!='?' and s[i]!=word[i]:\r\n flagw=0\r\n break\r\n if flagw==1:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"Yes\")\r\n print(s)\r\nelse:\r\n print(\"No\")\r\n \r\n", "n,m = map(int,input().split())\nv = []\nfor i in range(n):\n v.append(input())\ndele = list(map(int,input().split()))\nresult = 'Yes'\nchoose = []\nseen = [0]*n\nLen = len(v[dele[0]-1])\npattenr = list(v[dele[0]-1])\nseen[dele[0]-1] = 1\nfor i in dele[1:]:\n if len(v[i-1]) != Len:\n result = 'No'\n break\n seen[i-1] = 1\n for cu, j in enumerate(v[i-1]):\n if j != pattenr[cu]:\n pattenr[cu] = '?'\nfor i in range(n):\n yy = 0\n if seen[i] == 0 and len(v[i]) == Len:\n for cu,j in enumerate(v[i]):\n if pattenr[cu] != '?' and pattenr[cu] != j:\n break\n yy+=1\n if yy == Len:\n result = 'No'\n break\n\nprint(result)\nif result != 'No':\n print(''.join(pattenr))\n\n", "[m, n] = [int(x) for x in input().split()]\r\n\r\nstrings = []\r\n\r\nfor i in range(m):\r\n strings.append(input())\r\n\r\nto_delete_index = [int(x)-1 for x in input().split()]\r\nto_delete = [strings[int(x)] for x in to_delete_index]\r\n\r\nbase_len = len(to_delete[0])\r\nfor s in to_delete:\r\n if len(s) != base_len:\r\n print('No')\r\n exit()\r\n\r\nmatch_string = \"\"\r\nfor i in range(base_len):\r\n match = to_delete[0][i]\r\n for s in to_delete:\r\n if s[i] != match:\r\n match = \"?\"\r\n break\r\n match_string += match\r\n\r\ndef match(s, match_string):\r\n if len(s) != len(match_string):\r\n return False\r\n\r\n for i in range(len(s)):\r\n if match_string[i] == \"?\":\r\n continue\r\n if match_string[i] != s[i]:\r\n return False\r\n return True\r\n\r\nfor i in range(len(strings)):\r\n if i in to_delete_index:\r\n continue\r\n if match(strings[i], match_string):\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\nprint(match_string)\r\n\r\n\r\n\r\n", "n, m = map(int,input().split())\nw = [input() for _ in range(n)]\ntodel = [w[i-1] for i in map(int, input().split())]\nif len(set(map(len,todel))) != 1:\n print('No')\nelse:\n pat = ''.join(['?' if len(set([todel[j][p] for j in range(m)])) != 1 else todel[0][p] for p in range(len(todel[0]))])\n ok = True\n for x in w:\n if len(x) != len(pat):\n continue\n if not x in todel:\n mat = True\n for i in range(len(pat)):\n if pat[i] != '?' and pat[i] != x[i]:\n mat = False\n break\n if mat:\n ok = False\n break\n if not ok:\n print('No')\n else:\n print('Yes')\n print(pat)\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nb = [int(_) for _ in input().split()]\r\np = list(a[b[0] - 1])\r\nfor i in range(1, len(b)):\r\n s = a[b[i] - 1]\r\n if len(s) != len(p):\r\n print(\"No\")\r\n raise SystemExit\r\n for j in range(len(s)):\r\n if s[j] != p[j] and p[j] != '?':\r\n p[j] = '?'\r\nk = 0\r\nf = False\r\nfor i in range(n):\r\n if k < m and i + 1 == b[k]:\r\n k += 1\r\n continue\r\n s = a[i]\r\n if len(s) == len(p):\r\n f = True\r\n for j in range(len(s)):\r\n if s[j] != p[j] and p[j] != '?':\r\n f = False\r\n break\r\n if f:\r\n print(\"No\")\r\n raise SystemExit\r\nprint(\"Yes\")\r\nprint(''.join(p))", "n, m = map(int, input().split())\r\nf = [input() for _ in range(n)]\r\nd = set(map(int, input().split()))\r\nc = {}\r\nl = 0\r\nfor x in d:\r\n l = len(f[x - 1])\r\n c[l] = 1\r\nif len(c) > 1:\r\n print('No')\r\nelse:\r\n t = ['?'] * l\r\n for i in range(l):\r\n c = {}\r\n ch = ''\r\n for x in d:\r\n ch = f[x - 1][i]\r\n c[ch] = 1\r\n if 1 == len(c):\r\n t[i] = ch\r\n for i in range(n):\r\n if (i + 1) not in d:\r\n if len(f[i]) == l:\r\n ok = 0\r\n for j in range(l):\r\n if t[j] != '?' and f[i][j] != t[j]:\r\n ok = 1\r\n break\r\n if not ok:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\n print(''.join(t))\r\n", "__author__ = 'Think'\r\ndef check(s, password):\r\n\tif len(s)!=len(password):\r\n\t\treturn False\r\n\tfor i in range(len(password)):\r\n\t\tif password[i]!=\"?\":\r\n\t\t\tif password[i]!=s[i]:\r\n\t\t\t\treturn False\r\n\treturn True\r\n\r\nn, m=[int(i) for i in input().split()]\r\nfilenames=[]\r\nfor i in range(n):\r\n\tfilenames.append(input())\r\ndeleted_indices=[int(i)-1 for i in input().split()]\r\ndeleted=[]\r\nfails=False\r\nfor i in deleted_indices:\r\n\tdeleted.append(filenames[i])\r\nlength=len(deleted[0])\r\nfor s in deleted[1:]:\r\n\tif len(s)!=length:\r\n\t\tfails=True\r\n\t\tprint(\"No\")\r\n\t\tbreak\r\nif not fails:\r\n\tanswer=list(deleted[0])\r\n\tfor i in range(length):\r\n\t\tfor s in deleted[1:]:\r\n\t\t\tif s[i]!=answer[i]:\r\n\t\t\t\tanswer[i]=\"?\"\r\n\t\t\t\tbreak\r\n\tfor index in range(n):\r\n\t\tif index not in deleted_indices:\r\n\t\t\tif check(filenames[index], answer):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\tfails=True\r\n\t\t\t\tbreak\r\n\tif not fails:\r\n\t\tprint(\"Yes\")\r\n\t\tfor s in answer:\r\n\t\t\tprint(s, end=\"\")\r\n\t\tprint()\r\n", "N, M = map(int, input().split())\r\nwords = [input().strip() for _ in range(N)]\r\ngoods = []\r\nbads = []\r\nA = set(map(int, input().split()))\r\nfor i in range(N):\r\n if i+1 in A:\r\n goods.append(words[i])\r\n else:\r\n bads.append(words[i])\r\n\r\nif len(goods) == 0:\r\n print(\"Yes\")\r\n print(\"d238hgdu239dg923d9238hdi239dbobxdosaiodg9w8do2\")\r\n exit(0)\r\n\r\nfor good in goods:\r\n if len(good) != len(goods[0]):\r\n print(\"No\")\r\n exit()\r\n\r\nans = \"\"\r\nfor i in range(len(goods[0])):\r\n if all(good[i] == goods[0][i] for good in goods):\r\n ans += goods[0][i]\r\n else:\r\n ans += \"?\"\r\n\r\nfor bad in bads:\r\n if len(bad) == len(ans):\r\n if all(ans[i] == \"?\" or ans[i] == bad[i] for i in range(len(ans))):\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\nslova = []\nfor i in range(n):\n slova.append(input())\nna_zmazanie = [int(x)-1 for x in input().split()]\n\ndlzka_zmazanych = len(slova[na_zmazanie[0]])\nfor i in na_zmazanie:\n if len(slova[i]) != dlzka_zmazanych:\n print(\"No\")\n exit(0)\n\nzmaz = [False] * n\nfor i in na_zmazanie:\n zmaz[i] = True\nmatchujuce_nie_na_zmazanie = [i for i in range(n) if zmaz[i] == False and len(slova[i]) == dlzka_zmazanych] \n\npattern = \"\"\nfor i in range(0, dlzka_zmazanych):\n znak_prveho = slova[na_zmazanie[0]][i]\n for x in na_zmazanie:\n if slova[x][i] != znak_prveho:\n pattern += \"?\"\n break\n else:\n pattern += znak_prveho\n nove_matchujuce = []\n for y in matchujuce_nie_na_zmazanie:\n if slova[y][i] == znak_prveho: \n nove_matchujuce.append(y)\n matchujuce_nie_na_zmazanie = nove_matchujuce\n\nif len(matchujuce_nie_na_zmazanie) == 0:\n print(\"Yes\")\n print(pattern)\nelse:\n print(\"No\")\n", "import sys, threading, bisect, math, copy, itertools\r\n\r\nfrom heapq import heappush, heappop\r\nfrom functools import cmp_to_key as ctk, lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\n\r\nreadline = sys.stdin.readline\r\nread = lambda : list(map(int, readline().split()))\r\nreadstr = lambda : readline().rstrip()\r\n\r\n# dfv åªè½ä¸ºåºæ¬æ°æ®ç±»å\r\nalloc = lambda dfv, *s: len(s) != 1 and [alloc(dfv, *s[1:]) for _ in range(int(s[0]))] or [dfv] * int(s[0])\r\nshow = lambda arr: print(\" \".join(map(str, arr)))\r\n\r\n\r\ndef main():\r\n\r\n\r\n def check(a, b):\r\n if len(a) != len(b): return False\r\n for i in range(len(a)):\r\n if b[i] == '?': continue\r\n if a[i] != b[i]: return False\r\n return True\r\n\r\n INF = float('inf')\r\n MOD = 10 ** 9 + 7\r\n dfd = defaultdict(int)\r\n # dq = deque()\r\n n, m = read()\r\n arr = [readstr() for _ in range(n)]\r\n det = read()\r\n k = len(arr[det[0] - 1])\r\n res = \"\"\r\n for i in range(k):\r\n cnt = set()\r\n for idx in det:\r\n idx -= 1\r\n if len(arr[idx]) != k:\r\n print('No')\r\n exit()\r\n cnt.add(arr[idx][i])\r\n if len(cnt) != 1: res += '?'\r\n else: res += cnt.pop()\r\n st = set(det)\r\n if res == \"\":\r\n print('No')\r\n exit()\r\n for i in range(n):\r\n if i + 1 not in st:\r\n s = arr[i]\r\n if check(s, res):\r\n print('No')\r\n exit()\r\n if len(res) == 0: print('No')\r\n else:\r\n print('Yes')\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain()\r\n\r\n# threading.stack_size((10 ** 8))\r\n# t = threading.Thread(target=main)\r\n# t.start()\r\n# t.join()", "a,b=map(int,input().split())\r\nk=[input() for _ in \" \"*a]\r\nz=[i-1 for i in map(int,input().split())]\r\np=set()\r\nfor i in z:p.add(len(k[i]))\r\nif len(p)>1:exit(print(\"No\"))\r\nn=list(p)[0];s=k[z[0]];ans=''\r\nfor i in range(n):\r\n for j in range(b):\r\n if s[i]!=k[z[j]][i]:ans+='?';break\r\n else:ans+=s[i]\r\nok=1;p=-1\r\nfor i in k:\r\n p+=1\r\n if p in z:continue\r\n if len(i)==n:\r\n ko=1\r\n for j in range(n):\r\n if ans[j]!='?' and ans[j]!=i[j]:ko=0\r\n if ko:ok=0\r\nif ok:print(\"Yes\");print(ans)\r\nelse:print(\"No\")\r\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\nstrings = []\r\nfor i in range(n):\r\n f = stdin.readline().strip()\r\n strings.append(f)\r\n\r\nans = []\r\nchallengers = []\r\nused = set()\r\nfor a in list(map(int, stdin.readline().split())):\r\n challengers.append(strings[a - 1])\r\n used.add(a - 1)\r\nchallengers.sort()\r\n\r\nif len(challengers[0]) == len(challengers[-1]):\r\n challenger = list(challengers[0])\r\n length = len(challengers[0])\r\n for i in range(1, m):\r\n for j in range(length):\r\n if challenger[j] != challengers[i][j]:\r\n challenger[j] = '?'\r\n \r\n label = 1\r\n for i in range(n):\r\n if i in used or length != len(strings[i]):\r\n continue\r\n for j in range(length):\r\n if challenger[j] == '?':\r\n continue\r\n if challenger[j] != strings[i][j]:\r\n break\r\n else:\r\n label = 0\r\n \r\n if not label:\r\n stdout.write('No')\r\n else:\r\n stdout.write('Yes\\n' + ''.join(challenger))\r\nelse:\r\n stdout.write('No')", "n = int(input().split()[0])\r\n\r\nall_files = [str(input()) for i in range(n)]\r\n\r\nindex_to_del = [int(i) - 1 for i in (input().split())]\r\n\r\ndef find_pattern(all_files, index_to_del):\r\n for i in index_to_del[1:]:\r\n if len(all_files[i]) != len(all_files[index_to_del[0]]):\r\n\r\n return \"No\"\r\n pattern = ''\r\n for i in range(len(all_files[index_to_del[0]])):\r\n added = False\r\n for j in (index_to_del[1:]):\r\n if all_files[j][i] != all_files[index_to_del[0]][i]:\r\n if not added:\r\n pattern += '?'\r\n added = True\r\n if not added:\r\n pattern += all_files[index_to_del[0]][i]\r\n\r\n\r\n for i in range(len(all_files)):\r\n if i not in index_to_del:\r\n if len(all_files[i]) == len(pattern):\r\n matching_chars = []\r\n for index in range(len(pattern)):\r\n matching_chars.append(all_files[i][index] == pattern[index] or pattern[index] == '?')\r\n if all(matching_chars):\r\n return \"No\"\r\n\r\n print(\"Yes\")\r\n return pattern\r\n\r\n\r\nprint(find_pattern(all_files, index_to_del))\r\n", "import sys\r\n\r\nif __name__ == '__main__':\r\n n = input().split()\r\n n, m = int(n[0]), int(n[1])\r\n _l = list()\r\n for _ in range(n):\r\n _l.append(input())\r\n _ms = [int(x) - 1 for x in input().split()]\r\n common = list(_l[_ms[0]])\r\n reqlen = len(common)\r\n for indx in _ms[1:]:\r\n curr = _l[indx]\r\n clen = len(curr)\r\n if clen != reqlen:\r\n print('No')\r\n sys.exit(0)\r\n for i in range(len(curr)):\r\n if curr[i] != common[i]:\r\n common[i] = '?'\r\n for i in range(len(_l)):\r\n if i not in _ms:\r\n curr = _l[i]\r\n if len(curr) != reqlen:\r\n continue\r\n good = False\r\n for j in range(reqlen):\r\n if common[j] == '?':\r\n continue\r\n if common[j] != curr[j]:\r\n good = True\r\n if not good:\r\n print('No')\r\n sys.exit(0)\r\n print('Yes')\r\n print(''.join(common))", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nindices = set(map(lambda x: int(x)-1, input().split()))\r\n\r\nlengths = set([len(s[i]) for i in indices])\r\nif len(lengths) != 1:\r\n\tprint(\"No\")\r\n\texit(0)\r\n\r\nnon_indices = set(range(n)) - indices\r\n\r\nl = lengths.pop()\r\n\r\nans = []\r\n\r\nfor j in range(l):\r\n\tch = set()\r\n\tfor i in indices:\r\n\t\tch.add(s[i][j])\r\n\tif len(ch) == 1:\r\n\t\tans.append(ch.pop())\r\n\telse:\r\n\t\tans.append('?')\r\n\r\nans = \"\".join(ans)\r\n\r\nfor i in non_indices:\r\n\tgood = True\r\n\tif len(s[i]) != l:\r\n\t\tcontinue\r\n\tfor j in range(l):\r\n\t\tif ans[j] == '?':\r\n\t\t\tpass\r\n\t\telif ans[j] != s[i][j]:\r\n\t\t\tgood = False\r\n\t\t\tbreak\r\n\tif good:\r\n\t\tprint(\"No\")\r\n\t\texit(0)\r\n\r\nprint(\"Yes\")\r\nprint(ans)", "#!/bin/python\nimport sys\ncounter = 0\nallstrs = []\ndef firstnum (inpu):\n out = \"\"\n for char in inpu:\n if char == ' ':\n break\n out += char\n return int(out)\ndef secondnum (inpu):\n first = True\n out = \"\"\n for char in inpu:\n if char == ' ' and not(first):\n break\n elif char == ' ' and first:\n first = False\n out += char\n return int(out)\n\n\nfor line in sys.stdin:\n if counter == 0:\n counter += 1\n else:\n allstrs.append(line)\n\nremovalfiles = []\n\nremovalfilesnums = list(map(int, allstrs[allstrs.__len__() - 1].split(\" \")))\nfor i in range(0, removalfilesnums.__len__() - 0):\n removalfiles.append(allstrs[removalfilesnums[i] - 1])\nremovalfiles = [s.strip('\\n') for s in removalfiles]\n\nfor ff in removalfiles:\n if removalfiles[0].__len__() != ff.__len__():\n print(\"No\")\n sys.exit(0)\n\noutString = \"\"\nfor ii in range(0, removalfiles[0].__len__()):\n broke = False\n for ff in removalfiles:\n if ff[ii] != removalfiles[0][ii]:\n broke = True\n outString += '?'\n break\n if not broke:\n outString += removalfiles[0][ii]\n\nchecklist = [s.strip('\\n') for s in [allstrs[i] for i in range(0, allstrs.__len__()) if i + 1 not in removalfilesnums]]\nfor line in checklist:\n test = False\n if line.__len__() == outString.__len__():\n test = True\n for charLine, charOut in zip(line, outString):\n if charLine != charOut and charOut != '?':\n test = False\n if test:\n print(\"No\")\n sys.exit(0)\nprint(\"Yes\")\nprint(outString)\n", "import sys\r\nimport re\r\n\r\n[words, selected] = input().split(\" \")\r\n[words, selected] = [int(words), int(selected)]\r\nwordBuffer = []\r\nselectedWords = []\r\n\r\nfor i in range(words):\r\n wordBuffer.append(input())\r\nbuffer = input().split(\" \")\r\nfor i in buffer:\r\n selectedWords.append(wordBuffer[int(i) - 1])\r\n\r\nfor i in range(len(selectedWords)):\r\n if (i > 0 and len(selectedWords[i - 1]) != len(selectedWords[i])):\r\n print(\"No\")\r\n exit()\r\n\r\nreg = \"\"\r\nres = \"\"\r\nfor letter in range(len(selectedWords[0])):\r\n isQuested = False\r\n for i in range(selected):\r\n if (i > 0 and selectedWords[i - 1][letter] != selectedWords[i][letter]):\r\n reg += \".\"\r\n res += \"?\"\r\n isQuested = True\r\n break\r\n if (isQuested == False):\r\n if (selectedWords[0][letter] == \".\"):\r\n reg += \"\\\\\" + selectedWords[0][letter]\r\n else:\r\n reg += selectedWords[0][letter]\r\n res += selectedWords[0][letter]\r\n\r\nmatches = 0\r\nfor i in wordBuffer:\r\n if (re.fullmatch(reg, i) != None):\r\n matches += 1\r\n\r\nif (matches == selected):\r\n print(\"Yes\\n\" + res)\r\nelse:\r\n print(\"No\")\r\n" ]

{"inputs": ["3 2\nab\nac\ncd\n1 2", "5 3\ntest\ntezt\ntest.\n.est\ntes.\n1 4 5", "4 4\na\nb\nc\ndd\n1 2 3 4", "6 3\n.svn\n.git\n....\n...\n..\n.\n1 2 3", "4 2\n.b\n.c\ndbt\ne.\n2 4", "27 27\na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\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", "27 26\na\nb\nc\nd\nee\nf\ng\nh\ni\nj\nk\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\n1 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27", "27 26\na\nb\nc\nd\ne\nf\ng\nh\ni\nj\nkq\nl\nm\nn\no\np\nq\nr\ns\nt\nu\nv\nw\nx\ny\nz\n.\n1 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27", "1 1\nuevim.mrr\n1", "2 1\nkbfyvezmy\nsbfammwcy\n1", "5 3\nlmljeqklg\nlclydkkxj\nuylscbk.g\neplpqakme\nablibhkfg\n1 3 5", "5 4\nabacaba\naaaaaaa\naaaaaab\naaaaaac\naaaaaad\n2 3 4 5", "5 4\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n2 3 4 5", "5 5\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n1 2 3 4 5", "5 3\nabacaba\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\n2 3 4", "5 4\naaaaaaa\nbaaaaab\ncaaaaac\ndaaaaad\nabacaba\n1 2 3 4", "5 3\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 3 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 3 4 5", "5 5\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeeee\n1 2 3 4 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\neeeeeeeee\n1 2 3 4", "5 4\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\neeeeeeeee\ndddddddddd\n1 2 3 5", "5 4\naaaaaaaaaa\nbbbbbbbbbb\neeeeeeeee\ncccccccccc\ndddddddddd\n1 2 4 5", "5 4\naaaaaaaaaa\neeeeeeeee\nbbbbbbbbbb\ncccccccccc\ndddddddddd\n1 3 4 5", "5 4\neeeeeeeee\naaaaaaaaaa\nbbbbbbbbbb\ncccccccccc\ndddddddddd\n2 3 4 5", "2 1\na\nb\n1", "2 1\na\nb\n2", "2 2\na\nb\n1 2", "2 1\naa\nb\n1", "2 1\naa\nb\n2", "2 2\naa\nb\n1 2", "2 1\nb\naa\n1", "2 1\nb\naa\n2", "2 2\nb\naa\n1 2", "2 1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaac\n1"], "outputs": ["Yes\na?", "Yes\n?es?", "No", "Yes\n.???", "No", "Yes\n?", "Yes\n?", "No", "Yes\nuevim.mrr", "Yes\nkbfyvezmy", "Yes\n??l???k?g", "Yes\naaaaaa?", "Yes\n?aaaaa?", "Yes\n??a?a??", "No", "Yes\n?aaaaa?", "No", "No", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\n??????????", "Yes\na", "Yes\nb", "Yes\n?", "Yes\naa", "Yes\nb", "No", "Yes\nb", "Yes\naa", "No", "Yes\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab"]}

UNKNOWN

PYTHON3

CODEFORCES

20

cedb194ead074bf927d95693dde3edb3

none

Edo has got a collection of *n* refrigerator magnets! He decided to buy a refrigerator and hang the magnets on the door. The shop can make the refrigerator with any size of the door that meets the following restrictions: the refrigerator door must be rectangle, and both the length and the width of the door must be positive integers. Edo figured out how he wants to place the magnets on the refrigerator. He introduced a system of coordinates on the plane, where each magnet is represented as a rectangle with sides parallel to the coordinate axes. Now he wants to remove no more than *k* magnets (he may choose to keep all of them) and attach all remaining magnets to the refrigerator door, and the area of the door should be as small as possible. A magnet is considered to be attached to the refrigerator door if its center lies on the door or on its boundary. The relative positions of all the remaining magnets must correspond to the plan. Let us explain the last two sentences. Let's suppose we want to hang two magnets on the refrigerator. If the magnet in the plan has coordinates of the lower left corner (*x*1, *y*1) and the upper right corner (*x*2, *y*2), then its center is located at (, ) (may not be integers). By saying the relative position should correspond to the plan we mean that the only available operation is translation, i.e. the vector connecting the centers of two magnets in the original plan, must be equal to the vector connecting the centers of these two magnets on the refrigerator. The sides of the refrigerator door must also be parallel to coordinate axes. The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=100<=000, 0<=≤<=*k*<=≤<=*min*(10,<=*n*<=-<=1)) — the number of magnets that Edo has and the maximum number of magnets Edo may not place on the refrigerator. Next *n* lines describe the initial plan of placing magnets. Each line contains four integers *x*1,<=*y*1,<=*x*2,<=*y*2 (1<=≤<=*x*1<=<<=*x*2<=≤<=109, 1<=≤<=*y*1<=<<=*y*2<=≤<=109) — the coordinates of the lower left and upper right corners of the current magnet. The magnets can partially overlap or even fully coincide. Print a single integer — the minimum area of the door of refrigerator, which can be used to place at least *n*<=-<=*k* magnets, preserving the relative positions. Sample Input 3 1 1 1 2 2 2 2 3 3 3 3 4 4 4 1 1 1 2 2 1 9 2 10 9 9 10 10 9 1 10 2 3 0 1 1 2 2 1 1 1000000000 1000000000 1 3 8 12 Sample Output 1 64 249999999000000001

[ "from math import ceil\n\n\ndef add(c, k, s, i0, di):\n i = i0\n while len(s) < k:\n s.add(c[i])\n i += di\n\n\ndef fst(c, s, i0, di):\n i = i0\n while c[i] in s:\n i += di\n return c[i]\n\n\ndef doors(ms, k):\n cs = [((m[2]+m[0])/2, (m[3]+m[1])/2, i) for i, m in enumerate(ms)]\n cx = sorted(cs, key=lambda t: t[0])\n cy = sorted(cs, key=lambda t: t[1])\n\n for kl in range(k+1):\n s1 = set(cx[:kl])\n for kr in range(k+1-kl):\n s2 = s1 | set(cx[-kr:] if kr else [])\n add(cy, kl+kr, s2, -kr-1, -1)\n for ku in range(k+1-kl-kr):\n s3 = s2 | set(cy[:ku])\n add(cy, kl+kr+ku, s3, ku, 1)\n\n kd = k-kl-kr-ku\n s4 = s3 | set(cy[-kd:] if kd else [])\n add(cy, kl+kr+ku+kd, s4, -kd-1, -1)\n\n minx = fst(cx, s4, kl, 1)[0]\n maxx = fst(cx, s4, -kr-1, -1)[0]\n miny = fst(cy, s4, ku, 1)[1]\n maxy = fst(cy, s4, -kd-1, -1)[1]\n a = max(ceil(maxx-minx), 1) * max(ceil(maxy-miny), 1)\n yield a\n\n\ndef min_door(ms, k):\n return min(doors(ms, k))\n\n\ndef quad(i):\n a, b, c, d = i\n return a, b, c, d\n\n\nif __name__ == '__main__':\n n, k = map(int, input().split())\n ms = (quad(map(int, input().split())) for _ in range(n))\n print(min_door(ms, k))\n", "from sys import*\n#\ndef check(u, d, l, r):\n used = [pointsx[i][1] for i in range(l)]\n used += [pointsx[-1 - i][1] for i in range(r)]\n used += [pointsy[i][1] for i in range(u)]\n used += [pointsy[-1 - i][1] for i in range(d)]\n if len(set(used)) > k:\n return DOHERA\n dx = pointsx[-1 - r][0] - pointsx[l][0]\n dy = pointsy[-1 - d][0] - pointsy[u][0]\n dx += dx & 1\n dy += dy & 1\n dx = max(2, dx)\n dy = max(2, dy)\n return dx * dy\n#\n(n, k) = map(int, input().split())\npointsx = []\npointsy = []\nDOHERA = 10 ** 228\nfor i in range(n):\n a = list(map(int, input().split()))\n pointsx += [(a[0] + a[2], i)]\n pointsy += [(a[1] + a[3], i)]\n(pointsx, pointsy) = (sorted(pointsx), sorted(pointsy))\nans = DOHERA\nfor u in range(0, k + 1):\n for d in range(0, k + 1):\n for l in range(0, k + 1):\n for r in range(0, k + 1):\n if l + r <= k and u + d <= k:\n ans = min(ans, check(u, d, l, r))\nprint(ans // 4)\n\n\n\n# Made By Mostafa_Khaled" ]

{"inputs": ["3 1\n1 1 2 2\n2 2 3 3\n3 3 4 4", "4 1\n1 1 2 2\n1 9 2 10\n9 9 10 10\n9 1 10 2", "3 0\n1 1 2 2\n1 1 1000000000 1000000000\n1 3 8 12", "11 8\n9 1 11 5\n2 2 8 12\n3 8 23 10\n2 1 10 5\n7 1 19 5\n1 8 3 10\n1 5 3 9\n1 2 3 4\n1 2 3 4\n4 2 12 16\n8 5 12 9", "20 5\n1 12 21 22\n9 10 15 20\n10 12 12 20\n1 1 25 29\n5 10 21 22\n4 9 16 25\n12 10 14 24\n3 3 19 27\n3 4 23 28\n9 1 11 31\n9 14 17 18\n8 12 14 20\n8 11 18 19\n12 3 14 29\n7 8 13 22\n6 4 16 30\n11 3 13 27\n9 16 15 18\n6 13 14 21\n9 12 15 22", "1 0\n1 1 100 100", "1 0\n1 1 2 2", "1 0\n1 1 4 4", "2 1\n1 1 1000000000 1000000000\n100 200 200 300", "2 1\n1 1 1000000000 2\n1 1 2 1000000000", "2 1\n1 1 999999999 1000000000\n1 1 1000000000 999999999", "1 0\n1 1 1000000000 1000000000", "1 0\n100 300 400 1000", "1 0\n2 2 3 3"], "outputs": ["1", "64", "249999999000000001", "4", "4", "1", "1", "1", "1", "1", "1", "1", "1", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

2

cedf23f9cd9f0334094c4c443a3b28cd

Sum

Vasya studies positional numeral systems. Unfortunately, he often forgets to write the base of notation in which the expression is written. Once he saw a note in his notebook saying *a*<=+<=*b*<==<=?, and that the base of the positional notation wasn’t written anywhere. Now Vasya has to choose a base *p* and regard the expression as written in the base *p* positional notation. Vasya understood that he can get different results with different bases, and some bases are even invalid. For example, expression 78<=+<=87 in the base 16 positional notation is equal to *FF*16, in the base 15 positional notation it is equal to 11015, in the base 10 one — to 16510, in the base 9 one — to 1769, and in the base 8 or lesser-based positional notations the expression is invalid as all the numbers should be strictly less than the positional notation base. Vasya got interested in what is the length of the longest possible expression value. Help him to find this length. The length of a number should be understood as the number of numeric characters in it. For example, the length of the longest answer for 78<=+<=87<==<=? is 3. It is calculated like that in the base 15 (11015), base 10 (16510), base 9 (1769) positional notations, for example, and in some other ones. The first letter contains two space-separated numbers *a* and *b* (1<=≤<=*a*,<=*b*<=≤<=1000) which represent the given summands. Print a single number — the length of the longest answer. Sample Input 78 87 1 1 Sample Output 3 2

[ "import math\n\n# For some reason, wrong answer... F*CKING EPSILON log(1000, 10) = 2.9999999...\n# Intuition: The lowest base will produce the longest number\n\nEPSILON = 0.00000001\n\na, b = [int(i) for i in input().split()]\n\n# Assuming no wacky letters\ndef highest_digit(number):\n return max([int(c) for c in str(number)])\n \ndef length_in_base(number, base):\n if number == 0:\n return 1\n\n # SCREW YOU EPSILON\n return math.floor(math.log(number, base) + 1 + EPSILON)\n\ndef solve_problem(a, b):\n highest = max(highest_digit(a), highest_digit(b))\n base_to_be_used = highest + 1\n\n a_in_base = int(str(a), base_to_be_used)\n b_in_base = int(str(b), base_to_be_used)\n\n the_sum = a_in_base + b_in_base\n\n length = length_in_base(the_sum, base_to_be_used)\n\n return length\n \n\nanswer = solve_problem(a, b)\nprint(answer)\n\n'''\n# Brute Force 1000 x 1000 == 1000000\n\nfirst_list = []\nfor a in range(1, 1000):\n for b in range(1, 1000):\n first_list.append(solve_problem(a, b))\n\nimport numpy\n\ndef solve2(a, b):\n B = max([int(c) for c in (str(a)+str(b))]) + 1\n\n #a_in_base = numpy.base_repr(a, B)\n #b_in_base = numpy.base_repr(b, B)\n\n a_val = int(str(a), B)\n b_val = int(str(b), B)\n\n the_sum = a_val + b_val\n\n the_sum_in_base = numpy.base_repr(the_sum, B)\n\n return len(the_sum_in_base)\n\n\nsecond_list = []\nfor a in range(1, 1000):\n for b in range(1, 1000):\n second_list.append(solve2(a, b))\n\nprint(first_list == second_list)\n\n# Good idea, but fails because \"all the numbers should be strictly less than the positional notation base.\"\n#if set(str(a)) == {'1'} and set(str(b)) == {'1'}:\n# print(len(str(a)) + len(str(b)))\n#else:\n# print(answer)\n'''\n \t\t \t \t\t\t\t\t \t\t \t \t\t\t \t\t \t\t", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(a, b):\r\n a = str(a)\r\n b = str(b)\r\n c = max(max(a), max(b))\r\n c = int(c) + 1\r\n a = (4-len(a))*'0'+a\r\n b = (4-len(b))*'0'+b\r\n d = 0\r\n cur = 1\r\n for i in range(4):\r\n d += (int(a[3-i])+int(b[3-i]))*cur\r\n cur *= c\r\n ans = 0\r\n while d:\r\n d = d//(c)\r\n ans += 1\r\n return ans\r\n\r\na, b = get_ints()\r\nprint(solve(a,b))", "\r\nsa, sb = input().strip().split()\r\n\r\nbase = max(int(c) for c in sa + sb) + 1\r\n\r\na = int(sa); b = int(sb)\r\n\r\nans = 0; prev = 0\r\nwhile a + b + prev:\r\n prev = (a % 10 + b % 10 + prev) // base\r\n a //= 10; b //= 10\r\n ans += 1\r\n\r\nprint(ans)", "# LUOGU_RID: 113950280\na,b=input().split();x=int(max(a+b))+1;s,v=int(a,x)+int(b,x),0\r\nwhile s:s,v=s//x,v+1\r\nprint(v)", "x,y = input().split()\r\nmx = 0\r\nfor i in x :\r\n mx = max(mx,int(i))\r\nfor i in y :\r\n mx = max(mx,int(i))\r\nmx += 1\r\nsm = int(x,mx)\r\nsm += int(y,mx)\r\nout = \"\"\r\nwhile sm > 0 :\r\n out += str(sm%mx)\r\n sm //= mx\r\nprint(len(out))", "a,b=list(map(int,input().split()))\r\nk=int(max(str(a)+str(b)))+1\r\ncarry=0\r\nl=max(len(str(a)),len(str(b)))\r\nfor itr in range(l):\r\n if a%10+b%10+carry<k: carry=0\r\n else: carry=1\r\n a//=10\r\n b//=10\r\n #print(a,b)\r\nif carry: print(l+1)\r\nelse: print(l)", "import math\r\n\r\n\r\ndef findBase(line):\r\n ans = 1\r\n for item in line:\r\n if item == ' ':\r\n continue\r\n temp = int(item)\r\n if ans < temp:\r\n ans = temp\r\n return ans + 1\r\n\r\n\r\ndef toDecimalfromBase(line: str, base: int) -> int:\r\n ans, i, _len, exp = 0, 0, len(line), len(line) - 1\r\n while i < _len:\r\n ans += int(line[i]) * pow(base, exp)\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\ndef convertToBase(num: int, base: int) -> str:\r\n ans = ''\r\n while num > 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\nline = input()\r\nbase = findBase(line)\r\nnum1str, num2str = line.split()\r\n\r\nnum1 = toDecimalfromBase(num1str, base)\r\nnum2 = toDecimalfromBase(num2str, base)\r\n\r\nsummary = num1 + num2\r\nprint(len(convertToBase(summary, base)))\r\n# print(convertToBase(summary, base))\r\n# print(summary)\r\n\r\n'''\r\n124\r\n1010\r\n\r\n78 87\r\n\r\n124 345\r\n\r\n101 110 = 1000 =\r\n\r\n'''\r\n", "a, b = input().strip().split()\na_int = int(a)\nb_int = int(b)\nsum_ab_str = a + b\n\nbase = max(int(c) for c in sum_ab_str) + 1\n\nsol = 0\nba = 0\nwhile a_int + b_int + ba:\n sum_dig = (a_int % 10) + (b_int % 10) + ba\n ba = (sum_dig) // base\n a_int //= 10\n b_int //= 10\n sol += 1\n\nprint(sol)\n\t\t \t\t\t \t\t \t \t \t\t \t\t \t\t", "a,b=map(int, input().split())\r\nmax1=a%10\r\nch1=a\r\nch2=b\r\nwhile a>0:\r\n if a%10>max1:\r\n max1=a%10\r\n a=a//10\r\nmax2=b%10\r\nwhile b>0:\r\n if b%10>max2:\r\n max2=b%10\r\n b=b//10\r\nc=max(max1,max2)\r\nc+=1\r\nch1=int(str(ch1),c)\r\nch2=int(str(ch2),c)\r\nsum=ch1+ch2\r\ni=0\r\nwhile c**i<sum:\r\n i+=1\r\nif c**i==sum:\r\n i+=1\r\nprint(i)\r\n ", "def to_Decimal(n, b):\r\n n = n[::-1]\r\n d = 0\r\n\r\n for i in range(len(n)):\r\n d += int(n[i]) * (b**i)\r\n\r\n return d\r\n\r\n\r\ndef Convert(n, b):\r\n x = ''\r\n while not n == 0:\r\n x += str(n % b)\r\n n = n//b\r\n return x[::-1]\r\n\r\n\r\nn1, n2 = input().split()\r\nbase = int(max(str(n1) + str(n2))) + 1\r\nn1 = to_Decimal(n1, base)\r\nn2 = to_Decimal(n2, base)\r\n\r\nprint(len(Convert(n1+n2, base)))\r\n", "a, b = tuple(input().split())\n\nbase = max([int(let) for let in a+b]) + 1\n\nn1 = n2 = 0\n\npotencia = 1\nfor let in a[::-1]:\n n1 += int(let)*potencia\n potencia *= base\npotencia = 1\nfor let in b[::-1]:\n n2 += int(let)*potencia\n potencia *= base\n\nn = n1 + n2\ncontador = 0\npotencia = 1\n\nwhile potencia <= n:\n potencia *= base\n contador += 1\n\nprint(contador)\n \t \t\t\t\t \t \t\t \t \t\t\t \t \t\t\t\t", "a,b=map(int,input().split())\r\nta=a \r\ntb=b \r\naa=0\r\nbb=0\r\nwhile a>0:\r\n\taa=max(aa,a%10)\r\n\ta=a//10 \r\nwhile b>0:\r\n\tbb=max(bb,b%10)\r\n\tb=b//10 \r\nbase=max(aa,bb)+1 \r\nans=0\r\np=1\r\nwhile ta>0:\r\n\ta+=(p*(ta%10))\r\n\tp*=base \r\n\tta=ta//10\r\np=1\r\nwhile tb>0:\r\n\tb+=(p*(tb%10))\r\n\tp*=base\r\n\ttb=tb//10\r\nc=(a+b)\r\nwhile c>0:\r\n\tc=c//base\r\n\tans+=1\r\nprint(ans)", "from math import *\na, b = input().split()\nd = max(ord(c)-ord('0') for c in (a+b))+1\nr, c = int(a, d)+int(b, d), 0\nwhile r:\n\tc += 1\n\tr //= d\nprint(c)\n", "a , b = (list)(map(int , input().split()))\r\na = [int(x) for x in str(a)]\r\nb = [int(x) for x in str(b)]\r\nif len(a) > len(b) :\r\n a , b = b , a\r\ndiff = len(b) - len(a)\r\nwhile diff > 0 :\r\n diff -= 1\r\n a = [0] + a\r\n \r\ni = max(max(a) , max(b))\r\nn = len(a)\r\n\r\nmax_ = 0\r\nfor base in range(i + 1 , 1500) :\r\n len_ = 0\r\n carry = 0\r\n for index in range(n - 1 , -1 , -1) :\r\n sum = carry + a[index] + b[index]\r\n carry = sum // base\r\n len_ += 1\r\n if carry > 0 : len_ += 1\r\n max_ = max(max_ , len_)\r\n \r\nprint(max_)", "def count_digits_in_new_base(number,new_base):\n if number == 0:\n return 1\n digits = 0\n while number >=1:\n digits += 1\n number = int(number/new_base)\n return digits\n\ndef get_min_base(number):\n digits = list(str(number))\n min_base = int(max(digits))+1 # The minimum base = Maximum digit in the number + 1\n return min_base\n\ndef get_integer_value_for_given_base(number,base):\n result = 0\n weight = 1 \n while number >=1:\n remainder = number%10\n result += remainder * weight\n weight *= base\n number = int(number/10)\n return result\n\n\ndef find_length_of_longest_expression(a, b):\n # The minimum base should be greater than any digit in a and b.\n min_base = max(get_min_base(a),get_min_base(b))\n\n # Find decimal SUM of inputs, based on the min_base\n sum = get_integer_value_for_given_base(a,min_base)+get_integer_value_for_given_base(b,min_base)\n\n # Count number of digits in the sum\n value = count_digits_in_new_base(sum,min_base)\n return value\n\nv = [int(x) for x in input().split(' ')]\na = v[0]\nb = v[1]\nprint(find_length_of_longest_expression(a,b))", "def change_base(num, base):\n\tpower_set = 0\n\tresult = 0\n\tfor i in str(num)[::-1]:\n\t\tresult += int(i)* (base) ** power_set\n\t\tpower_set += 1\n\treturn result\n\ndef count_len(num, base):\n\tcopy_num = num + 0\n\tlen_num = 0\n\twhile copy_num != 0:\n\t\tcopy_num = copy_num // base\n\t\tlen_num += 1\n\treturn len_num\n\ndef sum_bases(a,b):\n\tstr_nums = str(a)+str(b)\n\tmax_num = int(str_nums[0])\n\tfor i in str_nums:\n\t\tif int(i) > max_num:\n\t\t\tmax_num = int(i)\n\tif max_num == 0:\n\t\treturn 1\n\tmax_num += 1\n\tsum_bases = (change_base(a, max_num)+change_base(b, max_num))\n\tprint(count_len(sum_bases, max_num))\n\nnums = input().split()\nsum_bases(nums[0],nums[1])\n \t \t \t \t \t\t\t\t \t\t \t\t\t", "def any2dec(num_original,base_original):\r\n num_original = str(num_original)\r\n base_original = int(base_original)\r\n dic = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\n dec = 0\r\n dec_temp = list(num_original)\r\n dec_temp.reverse()\r\n for x,i in enumerate(dec_temp):\r\n dec += dic.index(i) * base_original**(x)\r\n return str(dec)\r\n\r\n\r\ndef dec2any(dec,base_final):\r\n base_final = int(base_final)\r\n dec = int(dec)\r\n dic = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\r\n numero_final_temp = []\r\n numero_final = ''\r\n while True:\r\n temp_numero_final = dec%base_final\r\n numero_final_temp.append(temp_numero_final)\r\n if int(dec/base_final) == 0:\r\n break\r\n dec = int(dec/base_final)\r\n numero_final_temp.reverse()\r\n for i in numero_final_temp:\r\n numero_final += dic[i] \r\n return numero_final\r\n\r\ndef main():\r\n v = input().split()\r\n a = [int(i) for i in list(v[0])]\r\n b = [int(i) for i in list(v[1])]\r\n \r\n base = max(max(a), max(b))+1\r\n \r\n va = any2dec(v[0], base)\r\n vb = any2dec(v[1], base)\r\n \r\n ans = int(va)+int(vb)\r\n print(len(dec2any(ans, base)))\r\n\r\nmain()", "def baseN(num,b,numerals=\"0123456789abcdefghijklmnopqrstuvwxyz\"):\n return ((num == 0) and numerals[0]) or (baseN(num // b, b, numerals).lstrip(numerals[0]) + numerals[num % b])\n\n\nclass CodeforcesTask49BSolution:\n def __init__(self):\n self.result = ''\n self.expression = []\n\n def read_input(self):\n self.expression = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n nums = str(self.expression[0]) + str(self.expression[1])\n base = max([int(c) for c in nums]) + 1\n num1 = int(str(self.expression[0]), base)\n num2 = int(str(self.expression[1]), base)\n self.result = str(len(baseN(num1 + num2, base)))\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask49BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def converter(number, base):\r\n #split number in figures\r\n figures = [int(i,base) for i in str(number)]\r\n #invert oder of figures (lowest count first)\r\n figures = figures[::-1]\r\n result = 0\r\n #loop over all figures\r\n for i in range(len(figures)):\r\n #add the contirbution of the i-th figure\r\n result += figures[i]*base**i\r\n return result\r\ndef dec_to_base(num,base): #Maximum base - 36\r\n base_num = \"\"\r\n while num>0:\r\n dig = int(num%base)\r\n if dig<10:\r\n base_num += str(dig)\r\n else:\r\n base_num += chr(ord('A')+dig-10) #Using uppercase letters\r\n num //= base\r\n base_num = base_num[::-1] #To reverse the string\r\n return base_num\r\na,b = map(int,input().split())\r\nlista = []\r\nstrA=str(a)\r\nstrB=str(b)\r\nstrA=strA+strB\r\nstrA.upper()\r\nfor i in strA:\r\n if i == 'A':\r\n lista.append(10)\r\n elif i == 'B':\r\n lista.append(11)\r\n elif i == 'C':\r\n lista.append(12)\r\n elif i == 'D':\r\n lista.append(13)\r\n elif i == 'E':\r\n lista.append(14)\r\n elif i == 'F':\r\n lista.append(15)\r\n elif i == 'G':\r\n lista.append(16)\r\n elif i == 'H':\r\n lista.append(17)\r\n elif i == 'I':\r\n lista.append(18)\r\n elif i == 'J':\r\n lista.append(19)\r\n elif i == 'K':\r\n lista.append(20)\r\n elif i == 'L':\r\n lista.append(21)\r\n elif i == 'M':\r\n lista.append(22)\r\n elif i == 'N':\r\n lista.append(23)\r\n elif i == 'O':\r\n lista.append(24)\r\n elif i == 'P':\r\n lista.append(25)\r\n elif i == 'Q':\r\n lista.append(26)\r\n elif i == 'R':\r\n lista.append(27)\r\n elif i == 'S':\r\n lista.append(28)\r\n elif i == 'T':\r\n lista.append(29)\r\n elif i == 'U':\r\n lista.append(30)\r\n elif i == 'V':\r\n lista.append(31)\r\n elif i == 'W':\r\n lista.append(32)\r\n elif i == 'X':\r\n lista.append(33)\r\n elif i == 'Y':\r\n lista.append(34)\r\n elif i == 'Z':\r\n lista.append(35)\r\n else:\r\n lista.append(int(i))\r\nB=max(lista)+1\r\na=converter(a,B)\r\nb=converter(b,B)\r\nsum=a+b\r\nres = dec_to_base(sum,B)\r\nprint(len(str(res)))\r\n\r\n", "jaja = input().split(\" \")\na = jaja[0]\nb = jaja[1]\nmayor = 0\nfor xd in jaja:\n for d in xd:\n if int(d) > mayor:\n mayor = int(d)\nbase = mayor+1\nvalora = 0\nvalorb = 0\nfor j in range(len(a)):\n valora = valora + int(a[j])*base**(len(a)-1-j)\nfor k in range(len(b)):\n valorb = valorb + int(b[k])*base**(len(b)-1-k)\nsuma = valora+valorb\nm = 0\nwhile base**m <= suma:\n m = m+1\nprint(m)\n\t \t\t \t\t \t \t\t \t \t \t \t", "a, b = map(str, input().split())\r\np = 0\r\nfor c in a:\r\n p = max(p, int(c))\r\nfor c in b:\r\n p = max(p, int(c))\r\np += 1\r\nn = max(len(a), len(b))\r\na = list(a)\r\nb = list(b)\r\na.reverse()\r\nb.reverse()\r\nx = [0]*(n+1)\r\nfor i in range(n):\r\n if i < len(a):\r\n x[i] += int(a[i])\r\n if i < len(b):\r\n x[i] += int(b[i])\r\n q, r = divmod(x[i], p)\r\n x[i] = r\r\n x[i+1] = q\r\nif x[-1] != 0:\r\n print(n+1)\r\nelse:\r\n print(n)\r\n", "\nfrom collections import defaultdict\nimport math\nimport re \n\nf, s = input().split()\n\n\ndef dec_to_base(num,base): #Maximum base - 36\n base_num = \"\"\n while num>0:\n dig = int(num%base)\n if dig<10:\n base_num += str(dig)\n else:\n base_num += chr(ord('A')+dig-10) #Using uppercase letters\n num //= base\n base_num = base_num[::-1] #To reverse the string\n return base_num\n\n\nmax_digit = 0\n\nfor digit in f:\n max_digit = max(max_digit, int(digit))\nfor digit in s:\n max_digit = max(max_digit, int(digit))\n\nmax_digit += 1\n\nvalue = int(f, max_digit) + int(s, max_digit)\nvalue = dec_to_base(value, max_digit)\nprint(len(value))", "from collections import *\r\n\r\nletters = '0123456789ABCDEF'\r\n\r\n\r\ndef todecimal(s, base):\r\n res = 0\r\n for i in range(len(s)):\r\n res = (res * base) + letters.find(s[i])\r\n return res\r\n\r\n\r\ndef tobase(s, base):\r\n res = deque([])\r\n if s == 0:\r\n return 0\r\n while (s != 0):\r\n res.appendleft(letters[s % base])\r\n s //= base\r\n return ''.join(res)\r\n\r\n\r\na, b = map(int, input().split())\r\nma = max(int(max(list(str(a)))), int(max(list(str(b))))) + 1\r\na, b = todecimal(str(a), ma), todecimal(str(b), ma)\r\nans = a + b\r\n\r\nprint(len(tobase(ans, ma)))\r\n", "info = input().split()\n\ndef cambiodebase(n, b):\n if n == 0:\n return [0]\n digits = []\n while n > 0:\n digits.append(str(n % b))\n n //= b\n return digits\n\ndef base10(n,c):\n total = 0\n m = len(n)\n for i in range(len(n)):\n total += int(n[i])*(c**(m-i-1))\n return total\n\n\n\na = info[0]\nb = info[1]\nc = max(list(map(int,list(a+b)))) + 1\nn = base10(a,c) + base10(b,c)\n\nprint(len(cambiodebase(n,c)))\n \t \t\t \t \t\t \t \t\t \t\t\t \t\t", "from sys import stdin\r\nfrom collections import defaultdict\r\n\r\ndef base_to_ten(s, base):\r\n ans = 0\r\n power = 0\r\n for c in s.decode()[::-1]:\r\n ans += (ord(c) - 48) * (base ** power)\r\n power += 1\r\n return ans\r\n\r\n\r\nline = stdin.buffer.readline()\r\nbase = int(chr(max(line))) + 1\r\n\r\n\r\na, b = line.split()\r\n\r\nx = base_to_ten(a, base) + base_to_ten(b, base)\r\n\r\n\r\nlst = []\r\n\r\nwhile x:\r\n lst.append(str(x % base))\r\n x = x // base\r\n\r\nprint (len(lst))", "sizdvch=list(map(str,input().split()))\r\nisch=[]\r\nperch=int(sizdvch[0])\r\nvtoch=int(sizdvch[1])\r\nvivo=[]\r\nfor i in range(2):\r\n for j in range(len(sizdvch[i])):\r\n isch.append(int(sizdvch[i][j]))\r\nmaxch=max(isch)\r\nminsis=maxch+1\r\nif minsis == 10:\r\n print(len(str(perch+vtoch)))\r\nelse:\r\n for i in range(2):\r\n n = sizdvch[i]\r\n dlin=len(n)\r\n n1=0\r\n ndp=''\r\n for j in range(dlin):\r\n ndp=n[j]\r\n n1 = n1 + (int(ndp) * minsis**(dlin - j -1))\r\n vivo.append(n1)\r\n sumvivo=sum(vivo)\r\n b=''\r\n while sumvivo > 0 :\r\n if sumvivo%minsis < 10:\r\n b = str(sumvivo%minsis)+b\r\n else:\r\n if sumvivo%minsis == 10: b = 'A'+b\r\n if sumvivo%minsis == 11: b = 'B'+b\r\n if sumvivo%minsis == 12: b = 'C'+b\r\n if sumvivo%minsis == 13: b = 'D'+b\r\n if sumvivo%minsis == 14: b = 'E'+b\r\n if sumvivo%minsis == 15: b = 'F'+b\r\n sumvivo = sumvivo // minsis\r\n print(len(b))\r\n", "\na, b = input().split()\nsol=0\nfor i in range(10, 1, -1):\n try:\n c = int(a, i)+int(b, i)\n s = 0\n while c:\n c//=i\n s+=1\n sol=max(s, sol)\n except ValueError:\n break\nprint(sol)\n", "def s():\r\n\t[a,b] = input().split()\r\n\tm = int(max(max(a),max(b)))+1\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tc = 0\r\n\tr = 0\r\n\twhile a or b or c:\r\n\t\tr += 1\r\n\t\tc = (a%10+b%10+c)//m\r\n\t\ta//=10\r\n\t\tb//=10\r\n\tprint(r)\r\ns()", "def findBase(line):\r\n ans = 1\r\n for item in line:\r\n if ans < int(item):\r\n ans = int(item)\r\n return ans + 1\r\n\r\n\r\ndef toDecimal(line, base):\r\n _len = len(line)\r\n ans, i, exp = 0, 0, _len - 1\r\n\r\n while i < _len:\r\n ans += int(line[i]) * pow(base, exp)\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\ndef toBase(num, base):\r\n ans = ''\r\n while num != 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\ns1, s2 = input().split(' ')\r\nbase = findBase(s1 + s2)\r\nnum1, num2 = toDecimal(s1, base), toDecimal(s2, base)\r\nprint(len(toBase(num1 + num2, base)))\r\n\r\n'''\r\n78 + 87 = FF base 16\r\n\r\n78 = 7*16^1 + 8*16^0 = 120\r\n87 = 8*16^1 + 7*16^0 = 135\r\n\r\n120 + 135 = 255\r\n\r\n255 : 16 = 15 (15)\r\n15 : 16 = 0 (15)\r\n\r\n10 -> 'A'\r\n11 -> 'B'\r\n12 -> 'C'\r\n13 -> 'D'\r\n14 -> 'E'\r\n15 -> 'F'\r\n---------------------------------------------\r\n78 + 87 = 176 base 9\r\n\r\n10\r\n78 = 7*9^1 + 8*9^0 = 63 + 8 = 71\r\n87 = 8*9^1 + 7*9^0 = 72 + 7 = 79\r\n\r\n71 + 79 = 150\r\n\r\n150 : 9 = 16 (6)\r\n16 : 9 = 1 (7)\r\n1 : 9 = 0 (1)\r\n'''\r\n", "import sys\r\n\r\ndef largest(x):\r\n ret = 0\r\n while x > 0:\r\n ret = max(ret, x%10)\r\n x //= 10\r\n return ret\r\n\r\ndef tobase(x, base):\r\n ret = 0\r\n p=1\r\n while x>0:\r\n ret+=(x%10)*p\r\n p*=base\r\n x //= 10\r\n return ret\r\n\r\n\r\ndef digitsNum(x, base):\r\n ret = 0\r\n while x>0:\r\n ret += 1\r\n x //= base\r\n return ret\r\n\r\nn, m= map(int, sys.stdin.read().split())\r\nbase = max(largest(n),largest(m)) + 1\r\nx = tobase(n, base) + tobase(m, base)\r\nprint(digitsNum(x, base))", "def convertir(numero, base):\n resultado = ''\n while numero > 0:\n residuo = numero % base\n if residuo < 10:\n resultado = str(residuo) + resultado\n else:\n resultado = chr(ord('A') + residuo - 10) + resultado\n numero //= base\n return resultado\n\nnum1, num2 = input().split()\nmaximo = max(max(num1), max(num2))\n\nlargo = 0\nfor base in range(16, int(maximo), -1):\n suma = int(num1, base) + int(num2, base)\n largo = max(largo, len(convertir(suma, base)))\n\nprint(largo)\n \t\t \t\t\t \t\t\t \t\t \t \t \t\t", "def convert10tob( N, b):\r\n s=\"\"\r\n while(N!=0):\r\n s+=str(N%b)\r\n N//=b\r\n return s[::-1]\r\nn,m=map(str,input().split())\r\nmx=''\r\nfor i in n:\r\n mx=max(mx,i)\r\nfor i in m:\r\n mx=max(mx,i)\r\nmx=int(mx)\r\nk=int(m,mx+1)\r\ny=int(n,mx+1)\r\nz=str(k+y)\r\nprint(len(convert10tob(int(z),mx+1)))", "#!/usr/bin/env python3\r\n\r\n(a,b) = input().split()\r\nhighest_digit = max(int(digit) for digit in a+b)\r\nchosen_base = highest_digit + 1\r\ntotal = int(a, base=chosen_base) + int(b, base=chosen_base)\r\nnr_digits = 0\r\nwhile (total > 0):\r\n nr_digits+= 1\r\n total = total // chosen_base\r\n\r\nprint(nr_digits)", "def nti(a,x):\r\n r=''\r\n u='0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n while a>0:\r\n r+=u[a%x]\r\n a=a//x\r\n if r=='':r='0'\r\n return r[::-1]\r\na,b=input().split()\r\ns=int(max(a+b))+1\r\nprint(len(nti(int(a,s)+int(b,s),s)))\r\n", "a=input().split()\r\nf=int(max(a[0]+a[1]))+1\r\nt=((int(a[0],f)+int(a[1],f)))\r\ny=0\r\nwhile t:\r\n y+=1\r\n t//=f\r\nprint(y)", "def n_positional_value_to_decimal(n, a):\n lista = [int(number) for number in str(a)]\n value = 0\n for i in range(len(lista) - 1, -1, -1):\n value += lista[i] * n ** (len(lista) - 1 - i)\n return value\n\n\ndef decimal_to_n_positional_value(n, a):\n lista = []\n while a > 0:\n lista.append(a % n)\n a = a // n\n lista.reverse()\n return len(lista)\n\ninp = input()\nnumbers = inp.split(\" \")\nlista = []\nfor number in numbers:\n for i in range(len(number)):\n lista.append(int(number[i]))\nnumbers = [int(x) for x in numbers]\n\nminimo = max(lista)\nmaximo = 0\nfor i in range(minimo + 1, 1000):\n if decimal_to_n_positional_value(i, n_positional_value_to_decimal(i, numbers[0]) + n_positional_value_to_decimal(i, numbers[1])) > maximo:\n maximo = decimal_to_n_positional_value(i, n_positional_value_to_decimal(i, numbers[0]) + n_positional_value_to_decimal(i, numbers[1]))\n\nprint(maximo)\n \t\t\t\t \t \t\t\t\t \t \t \t \t\t\t\t", "def findBase(line):\r\n ans = 1\r\n for item in line:\r\n if item == ' ':\r\n continue\r\n helper = ord(item) - 48\r\n if ans < helper:\r\n ans = helper\r\n return ans + 1\r\n\r\n\r\ndef convertInBase(num, base):\r\n ans = ''\r\n while num != 0:\r\n ans = str(num % base) + ans\r\n num //= base\r\n return ans\r\n\r\n\r\ndef convertToDecimal(s, base):\r\n ans, _len = 0, len(s)\r\n exp = _len - 1\r\n i = 0\r\n while i < _len:\r\n ans += int(s[i]) * base ** exp\r\n i += 1\r\n exp -= 1\r\n return ans\r\n\r\n\r\nline = input()\r\nbase = findBase(line)\r\ns1, s2 = line.split(' ')\r\nnum1 = convertToDecimal(s1, base)\r\nnum2 = convertToDecimal(s2, base)\r\nnum3 = num1 + num2\r\nans = convertInBase(num3, base)\r\nprint(len(ans))\r\n", "from audioop import reverse\r\n\r\n\r\ndef numberToBase(n, b):\r\n if n == 0:\r\n return 1\r\n digits = 0\r\n while n:\r\n digits+=1\r\n n //= b\r\n return digits\r\n\r\n\r\nbase = 0\r\na,b = input().split()\r\nfor i in a+b:\r\n base=max(base, int(i)+1)\r\n\r\na=a[::-1]\r\nb=b[::-1]\r\nn1,n2=0,0\r\nfor i in range(len(a)):\r\n n1+= int(a[i])*pow(base, i)\r\n\r\nfor i in range(len(b)):\r\n n2+= int(b[i])*pow(base, i)\r\n\r\nprint(numberToBase(n1+n2, base))", "ax, bx = map(str, input().split())\r\nd = max([ord(c) - ord('0') for c in ax] + [ord(c) - ord('0') for c in bx]) + 1\r\nad, bd = 0, 0\r\nfor dig in ax:\r\n ad = ad * d + (ord(dig) - ord('0')) % 10\r\nfor dig in bx:\r\n bd = bd * d + (ord(dig) - ord('0')) % 10\r\nc = ad + bd\r\nans = 0\r\nwhile c > 0:\r\n ans += 1\r\n c //= d\r\nprint(ans)", "import sys\r\n\r\ndef digitsNum(x, base):\r\n ret = 0\r\n while x>0:\r\n ret += 1\r\n x //= base\r\n return ret\r\n\r\nn, m= sys.stdin.read().split()\r\n\r\nbase = int(max(max(n), max(m)))+1\r\nn = int(n, base)\r\nm = int(m, base)\r\n\r\nprint(digitsNum(n+m, base))", "def basechange(n, base):\n new_number = []\n q = n\n while (q >= base):\n new_number.append(q%base)\n q = q//base\n new_number.append(q)\n return new_number\n\ndef to_base_10(n, base):\n string_n = str(n)\n total = 0\n for i, number in enumerate(string_n[::-1]):\n total += (base**i) * int(number)\n return total\n\n\nnumber1, number2 = map(int, input().strip().split(' '))\nmax_n = max(max(str(number1)), max(str(number2)))\n# smallest base possible is max_n + 1\nprint(len(basechange(to_base_10(number1, int(max_n) + 1) + to_base_10(number2, int(max_n) + 1), int(max_n) + 1)))\n\t\t \t\t\t\t\t\t \t\t\t \t \t\t", "a, b = input().split()\r\ncarry = 0\r\nbase = int(max(a + b)) + 1\r\nres = ''\r\nwhile a or b or carry:\r\n s = int(a[-1:] or '0') + int(b[-1:] or '0') + carry\r\n a, b = a[:-1], b[:-1]\r\n carry, num = divmod(s, base)\r\n res = str(num) + res\r\n\r\nprint(len(res))\n# Sat Oct 15 2022 10:29:40 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\r\nm = 0\r\nfor i in str(a):\r\n m = max(m, int(i))\r\nfor i in str(b):\r\n m = max(m, int(i))\r\nm += 1\r\n\r\nf = 0\r\ns = 0\r\nt = 1\r\nfor i in str(a)[::-1]:\r\n f += int(i) * t\r\n t *= m\r\nt = 1\r\nfor i in str(b)[::-1]:\r\n s += int(i) * t\r\n t *= m\r\n\r\nfin = f + s\r\nt = 1\r\nans = 0\r\nwhile t * m <= fin:\r\n ans += 1\r\n t *= m\r\n\r\nprint(ans + 1)\r\n", "a, b = input().split()\r\nbase = int(max(max(a), max(b))) + 1\r\na, b = int(a, base), int(b, base)\r\nans, s = 0, a + b\r\nwhile s:\r\n s //= base\r\n ans += 1\r\nprint(ans)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na, b = input().split()\r\nbase = max(max(map(int, a)), max(map(int, b))) + 1\r\nans = 0\r\nrem = 0\r\na, b = int(a), int(b)\r\nwhile a or b or rem:\r\n ans += 1\r\n rem += (a % 10) + (b % 10)\r\n a, b = a // 10, b // 10\r\n rem //= base\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\ns = set()\r\nfor i in list(str(a)):\r\n s.add(int(i))\r\nfor i in list(str(b)):\r\n s.add(int(i))\r\nm = 0\r\nfor i in s:\r\n m = max(m, i)\r\nm += 1\r\nans = 0\r\nfor i in range(m, 20):\r\n a0, b0 = list(str(a)), list(str(b))\r\n a1, b1 = 0, 0\r\n j = 1\r\n while a0:\r\n a1 += j * int(a0.pop())\r\n j *= i\r\n j = 1\r\n while b0:\r\n b1 += j * int(b0.pop())\r\n j *= i\r\n c = a1 + b1\r\n x = 1\r\n ans0 = 0\r\n while x <= c:\r\n ans0 += 1\r\n x *= i\r\n ans = max(ans, ans0)\r\nprint(ans)", "l=input().split(' ')\r\na,b=int(l[0]),int(l[1])\r\n\r\ndef sum_base(base, *args):\r\n def numberToBase(n, b):\r\n if n == 0:\r\n return [0]\r\n digits = []\r\n while n:\r\n digits.append(int(n % b))\r\n n //= b\r\n # at this point, digits[::-1] is the list of digits of n at base b\r\n return int(''.join(map(str, digits[::-1]))) # convert a list of digits into a int\r\n \r\n # first, convert all number to base 10 and take the sum\r\n sum_base10 = sum([int(str(number), base) for number in args])\r\n \r\n # second, convert the base10 sum into base b with the function numberToBase define above\r\n return numberToBase(sum_base10, base)\r\n\r\nbiggest_numeral = '0'\r\n\r\nfor item in str(a) + str(b):\r\n\tif item > biggest_numeral:\r\n\t\tbiggest_numeral = item\r\n\r\nif '0' <= biggest_numeral <= '9':\r\n\tbiggest_numeral = int(biggest_numeral)\r\nelse:\r\n\tbiggest_numeral = ord(biggest_numeral) - ord('A') + 10\r\n\r\n\r\nprint( len(\r\n\r\n\tstr(\r\n\t\tsum_base(biggest_numeral + 1,a,b)\r\n\t)\r\n))\r\n\r\n", "a, b = input().split()\r\nx = int(max(a + b)) + 1\r\ns, v = int(a, x) + int(b, x), 0\r\nwhile s:\r\n s, v = s // x, v + 1\r\nprint(v)\r\n", "#encoding:utf-8\r\nimport math\r\n\r\nstrs = input()\r\ntmp = strs.split(' ')\r\na = tmp[0]\r\nb = tmp[1]\r\naL = list(a)\r\nbL = list(b)\r\naL.reverse()\r\nbL.reverse()\r\nstrL = list(strs.replace(\" \", \"\"))\r\nbigest = 0\r\nfor i in strL:\r\n if bigest < int(i):\r\n bigest = int(i)\r\nbase = bigest + 1\r\n\r\nif len(aL)>len(bL) :\r\n lenAB = len(aL)\r\nelse:\r\n lenAB = len(bL)\r\nnewNum = []\r\nnextAdd = 0\r\nj = 0\r\nwhile (j<lenAB or nextAdd != 0):\r\n if j >= len(aL):\r\n aL.append(0)\r\n if j >= len(bL):\r\n bL.append(0)\r\n newNum.append((int(aL[j]) + int(bL[j]) + nextAdd) % base)\r\n nextAdd = int((int(aL[j]) + int(bL[j]) + nextAdd) / base)\r\n j += 1\r\n \r\n \r\nprint (len(newNum))", "a,b=input().split()\r\nm1=-1\r\nm2=-1\r\nfor i in a:\r\n m1=max(m1,int(i))\r\nfor i in b:\r\n m2=max(m2,int(i))\r\nm=max(m1,m2)\r\nbase=m+1\r\nlen_a = len(a)\r\nlen_b = len(b)\r\ns = \"\";\r\nsum = \"\";\r\ndiff = abs(len_a - len_b);\r\nfor i in range(1,diff+1):\r\n s += \"0\"\r\nif (len_a < len_b):\r\n a = s + a\r\nelse:\r\n b = s + b;\r\ncarry = 0;\r\nfor i in range(max(len_a, len_b) - 1,-1,-1):\r\n curr=carry+(ord(a[i])-ord('0'))+(ord(b[i])-ord('0'));\r\n carry = curr // base\r\n curr = curr % base;\r\n sum = chr(curr + ord('0')) + sum\r\n\r\nif (carry > 0):\r\n sum = chr(carry + ord('0')) + sum;\r\nprint(len(sum))", "import math\n\ndef add_base(a, b, base):\n # print(base)\n a = int(a, base = base)\n b = int(b, base = base)\n # print(\"a\",a)\n # print(\"b\",b)\n res = a + b\n # print(\"res\",res)\n nu = ''\n while res:\n nu = str(res % base) + nu\n res = math.floor(res / base)\n # print(\"nu\", nu)\n return len(nu)\n\ndef main():\n a, b = input().split()\n st = str(a) + str(b)\n max_ord = 0\n for i in st:\n if max_ord < (ord(i) - 48):\n max_ord = (ord(i) - 48)\n base = max_ord + 1\n ans = add_base(a, b, base)\n print(ans)\n\nif __name__ == '__main__':\n main()\n", "def from_p_to_q(p, q, number):\n flag = False\n number = list(str(number))\n if number[0] == '-':\n number.pop(0)\n flag = True\n processed_num = list()\n for elem in number:\n if elem in ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']:\n processed_num.append(str(ord(elem) - 55))\n else:\n processed_num.append(elem)\n num_10 = 0\n const = 0\n for elem in processed_num[::-1]:\n num_10 += int(elem)*(p**const)\n const += 1\n num_q = list()\n while num_10 >= q:\n num_q.append(num_10 % q)\n num_10 = num_10 // q\n if num_q != 0:\n num_q.append(num_10)\n processed_num_q = list()\n for elem in num_q:\n if elem >= 10:\n processed_num_q.append(str(chr(elem + 55)))\n else:\n processed_num_q.append(str(elem))\n processed_num_q = processed_num_q[::-1]\n if flag:\n processed_num_q.insert(0, '-')\n return \"\".join(processed_num_q)\n\ndef from_q_n_to_q_m(q, n, m, number):\n flag = False\n result = str()\n number = list(str(number))\n if number[0] == '-':\n number.pop(0)\n flag = True\n if len(number) % m > 0:\n multiplier = len(number) // m + 1\n for elem in range(len(number) % m):\n number = number[::-1]\n number.append('0')\n number = number[::-1]\n else:\n multiplier = len(number) // m\n c = 0\n for elem in range(multiplier):\n result = result + from_p_to_q(q**n, q**m, ''.join(number[c:c+m]))\n c += m\n if flag:\n return '-' + result\n else:\n return result\n \n\nnums = input().split()\na = '0123456789'\nall_nums = list(a) + ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\nbase = max([all_nums.index(max(i, key=all_nums.index)) + 1 for i in nums])\nprint(len(from_p_to_q(10, base, int(from_p_to_q(base, 10, nums[0])) + int(from_p_to_q(base, 10, nums[1])))))\n# Wed Nov 24 2021 11:10:49 GMT+0000 (Coordinated Universal Time)\n" ]

{"inputs": ["78 87", "1 1", "9 7", "11 11", "43 21", "84 89", "12 34", "99 11", "11 99", "99 99", "1 2", "1 3", "2 1", "2 2", "2 3", "3 1", "3 2", "3 3", "1 466", "1 1000", "1 999", "149 1", "999 1", "1000 1", "998 998", "998 999", "998 1000", "999 998", "999 999", "999 1000", "1000 998", "1000 999", "1000 1000", "1000 539", "999 619", "2 511", "877 2", "379 999", "247 1000", "555 555", "208 997", "633 581", "411 517", "836 101", "262 685", "39 269", "464 205", "890 789", "667 373", "840 975", "810 413", "133 851", "104 938", "427 376", "398 815", "721 253", "692 339", "15 778", "986 216", "450 277", "333 1", "499 499", "79 1", "87 1", "47 8", "87 8", "1 11"], "outputs": ["3", "2", "2", "3", "3", "3", "3", "3", "3", "3", "2", "2", "2", "2", "2", "2", "2", "2", "3", "4", "4", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "5", "4", "4", "3", "3", "4", "4", "4", "4", "4", "4", "4", "4", "3", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "4", "3", "4", "3", "4", "3", "2", "2", "2", "3", "3"]}

UNKNOWN

PYTHON3

CODEFORCES

52

cee4791929f0bd6034bfc5e68fc4deda

Vanya and Label

While walking down the street Vanya saw a label "Hide&Seek". Because he is a programmer, he used & as a bitwise AND for these two words represented as a integers in base 64 and got new word. Now Vanya thinks of some string *s* and wants to know the number of pairs of words of length |*s*| (length of *s*), such that their bitwise AND is equal to *s*. As this number can be large, output it modulo 109<=+<=7. To represent the string as a number in numeral system with base 64 Vanya uses the following rules: - digits from '0' to '9' correspond to integers from 0 to 9; - letters from 'A' to 'Z' correspond to integers from 10 to 35; - letters from 'a' to 'z' correspond to integers from 36 to 61; - letter '-' correspond to integer 62; - letter '_' correspond to integer 63. The only line of the input contains a single word *s* (1<=≤<=|*s*|<=≤<=100<=000), consisting of digits, lowercase and uppercase English letters, characters '-' and '_'. Print a single integer — the number of possible pairs of words, such that their bitwise AND is equal to string *s* modulo 109<=+<=7. Sample Input z V_V Codeforces Sample Output 3 9 130653412

[ "print(3**sum(6-bin({'-':62,'_':63}.get(c,ord(c)-7*(c>'9')-6*(c>'Z')-48)).count('1') for c in input())%1000000007)", "import string\r\nfrom itertools import chain\r\nfrom os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef dec_to_bin(x: int, n: int) -> str:\r\n return bin(x)[2:].zfill(n)\r\n\r\n\r\ndef solution():\r\n mod = 10 ** 9 + 7\r\n s = input()\r\n d = {c: i for i, c in enumerate((chain.from_iterable(('0123456789', string.ascii_uppercase, string.ascii_lowercase, '-_'))))}\r\n ans = 1\r\n for c in s:\r\n for bit in dec_to_bin(d[c], 6):\r\n if bit == '0':\r\n ans = (ans * 3) % mod\r\n print(ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def char2int(a):\r\n x = ord(a)\r\n if ord('0') <= x <= ord('9'):\r\n return x - ord('0')\r\n if ord('A') <= x <= ord('Z'):\r\n return x - ord('A') + 10 \r\n if ord('a') <= x <= ord('z'):\r\n return x - ord('a') + 36\r\n if a == '-':\r\n return 62\r\n else:\r\n return 63\r\n \r\nzeros = 0\r\nfor z in input():\r\n zeros += 6\r\n num = format(char2int(z), \"b\")\r\n for i in num:\r\n if i == '1':\r\n zeros -= 1\r\n\r\nprint((3**zeros) % (10**9 + 7))\r\n " ]

{"inputs": ["z", "V_V", "Codeforces", "zHsIINYjVtU71kmM9E", "fRRNAdMvLFTX21T0FG5gyn7NG0SaIvzGG_g_SO", "Lb1T3sA4BcTx4KAgLIsl-dNOGDvimpxZOxJfMz6VC3nQkB3Y780qqX_1dnjjb59H9X", "2kdYy5-G2-TL5dtLRKcp0ScPGQMrEjwsXuxJHZb4EOd7g7NSQYiAuX2O40PKVyMGEQ1WzW6TvQqbrM1O6e3TdduRsk", "kuCerLoRuMSm6wa_YM", "_", "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_", "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_", "__________", "___________________________________________________________________X________________________________", "Bq", "UhXl", "oXyg5", "6"], "outputs": ["3", "9", "130653412", "130312847", "547121709", "680590434", "39961202", "172815616", "1", "803556829", "188799173", "1", "81", "729", "19683", "43046721", "81"]}

UNKNOWN

PYTHON3

CODEFORCES

3

ceedf38faa444936a913b20e9cd7d9c4

Connected Components

We already know of the large corporation where Polycarpus works as a system administrator. The computer network there consists of *n* computers and *m* cables that connect some pairs of computers. In other words, the computer network can be represented as some non-directed graph with *n* nodes and *m* edges. Let's index the computers with integers from 1 to *n*, let's index the cables with integers from 1 to *m*. Polycarpus was given an important task — check the reliability of his company's network. For that Polycarpus decided to carry out a series of *k* experiments on the computer network, where the *i*-th experiment goes as follows: 1. Temporarily disconnect the cables with indexes from *l**i* to *r**i*, inclusive (the other cables remain connected). 1. Count the number of connected components in the graph that is defining the computer network at that moment. 1. Re-connect the disconnected cables with indexes from *l**i* to *r**i* (that is, restore the initial network). Help Polycarpus carry out all experiments and for each print the number of connected components in the graph that defines the computer network through the given experiment. Isolated vertex should be counted as single component. The first line contains two space-separated integers *n*, *m* (2<=≤<=*n*<=≤<=500; 1<=≤<=*m*<=≤<=104) — the number of computers and the number of cables, correspondingly. The following *m* lines contain the cables' description. The *i*-th line contains space-separated pair of integers *x**i*, *y**i* (1<=≤<=*x**i*,<=*y**i*<=≤<=*n*; *x**i*<=≠<=*y**i*) — the numbers of the computers that are connected by the *i*-th cable. Note that a pair of computers can be connected by multiple cables. The next line contains integer *k* (1<=≤<=*k*<=≤<=2·104) — the number of experiments. Next *k* lines contain the experiments' descriptions. The *i*-th line contains space-separated integers *l**i*, *r**i* (1<=≤<=*l**i*<=≤<=*r**i*<=≤<=*m*) — the numbers of the cables that Polycarpus disconnects during the *i*-th experiment. Print *k* numbers, the *i*-th number represents the number of connected components of the graph that defines the computer network during the *i*-th experiment. Sample Input 6 5 1 2 5 4 2 3 3 1 3 6 6 1 3 2 5 1 5 5 5 2 4 3 3 Sample Output 4 5 6 3 4 2

[ "import os,sys,collections,heapq,itertools,functools\r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2 \r\nfrom copy import copy \r\nfrom io import BytesIO, IOBase \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = IOWrapper(sys.stdin).readline \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass UF:\r\n def __init__(self,n,cp=None):\r\n if cp: self.Fa = cp.Fa[:]\r\n else : self.Fa = [n] + [-1] * n \r\n def getroot(self,i):\r\n root = i \r\n while self.Fa[root] >= 0 :\r\n root =self.Fa[root] \r\n while i != root : \r\n nex,self.Fa[i] =self.Fa[i], root \r\n i = nex\r\n return root \r\n def union(self,a,b):\r\n ra,rb = self.getroot(a),self.getroot(b) \r\n if ra != rb: \r\n self.Fa[0] -= 1 \r\n if self.Fa[ra] < self.Fa[rb] : \r\n ra,rb = rb,ra\r\n self.Fa[rb] += self.Fa[ra] \r\n self.Fa[ra] = rb \r\ndef solution():\r\n BLOCK = 60\r\n n, m = readis() \r\n edges = [[0,0]] + [readis() for _ in range(m)]\r\n L = UF(n)\r\n mp = {}\r\n for i in range(m+1):\r\n if i: L.union(*edges[i])\r\n if i % BLOCK == 0:\r\n mp[(i,m+1)] = UF(n,L) \r\n R = UF(n,L) \r\n for j in range(m,i,-1):\r\n R.union(*edges[j])\r\n if j % BLOCK == 0 :\r\n mp[(i,j)] = UF(n,R) \r\n res=[]\r\n for _ in range(readi()):\r\n a,b = readis() \r\n l = (a-1)//BLOCK * BLOCK\r\n r = min(m+1,ceil((b+1)/BLOCK)*BLOCK) \r\n uf = UF(n,mp[(l,r)])\r\n for i in range(l+1,a): uf.union(*edges[i])\r\n for i in range(r-1,b,-1): uf.union(*edges[i])\r\n res.append(uf.Fa[0])\r\n print(*res,sep='\\n')\r\nfor i in range( 1 ):\r\n solution() ", "import os,sys,collections,heapq,itertools,functools\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2\r\nimport operator \r\nfrom copy import copy \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass UF:\r\n def __init__(self,n,cp=None):\r\n if cp: self.Fa = cp.Fa[:]\r\n else : self.Fa = [n] + [-1] * n \r\n def getroot(self,i):\r\n root = i \r\n while self.Fa[root] >= 0 :\r\n root =self.Fa[root] \r\n while i != root : \r\n tmp = self.Fa[i]\r\n self.Fa[i] = root \r\n i = tmp \r\n return root \r\n def union(self,a,b):\r\n ra,rb = self.getroot(a),self.getroot(b) \r\n if ra != rb: \r\n self.Fa[0] -= 1 \r\n if self.Fa[ra] < self.Fa[rb] : \r\n ra,rb = rb,ra\r\n self.Fa[rb] += self.Fa[ra] \r\n self.Fa[ra] = rb \r\ndef solution():\r\n n, m = readis() \r\n edges = [[0,0]] + [readis() for _ in range(m)]\r\n L = UF(n)\r\n mp = {}\r\n for i in range(m+1):\r\n if i: L.union(*edges[i])\r\n if i % 50 == 0:\r\n mp[(i,m+1)] = UF(n,L) \r\n R = UF(n,L) \r\n for j in range(m,i,-1):\r\n R.union(*edges[j])\r\n if j % 50 == 0 :\r\n mp[(i,j)] = UF(n,R) \r\n for _ in range(readi()):\r\n a,b = readis() \r\n l = (a-1)//50 * 50\r\n r = min(m+1,ceil((b+1)/50)*50) \r\n uf = UF(n,mp[(l,r)])\r\n for i in range(l+1,a): uf.union(*edges[i])\r\n for i in range(r-1,b,-1): uf.union(*edges[i])\r\n print(uf.Fa[0])\r\nfor i in range( 1 ):\r\n solution() " ]

{"inputs": ["6 5\n1 2\n5 4\n2 3\n3 1\n3 6\n6\n1 3\n2 5\n1 5\n5 5\n2 4\n3 3", "2 1\n2 1\n2\n1 1\n1 1", "3 2\n3 2\n3 1\n4\n1 1\n1 2\n2 2\n2 2", "3 3\n2 3\n3 1\n2 1\n5\n2 3\n3 3\n2 2\n2 2\n2 2", "4 5\n1 4\n2 1\n4 3\n2 1\n3 4\n5\n4 5\n2 4\n4 4\n1 3\n4 4", "5 4\n3 2\n5 2\n5 3\n2 3\n8\n4 4\n1 1\n3 4\n1 1\n3 3\n3 4\n3 4\n4 4", "8 10\n8 6\n8 7\n8 3\n3 7\n4 8\n1 6\n5 1\n8 7\n6 8\n1 6\n13\n1 10\n2 6\n3 3\n5 5\n2 2\n1 3\n10 10\n7 7\n2 4\n3 6\n2 7\n9 9\n3 6", "10 10\n7 5\n5 9\n10 9\n8 7\n5 10\n4 2\n8 2\n9 1\n2 8\n10 7\n10\n10 10\n7 9\n2 6\n1 5\n4 7\n9 9\n7 7\n2 6\n6 9\n10 10", "7 14\n7 1\n1 5\n6 4\n7 6\n2 4\n2 4\n7 2\n3 1\n7 6\n6 7\n5 3\n5 4\n1 3\n6 2\n40\n2 3\n14 14\n13 14\n13 13\n7 9\n1 13\n12 14\n14 14\n12 12\n6 10\n6 14\n8 8\n14 14\n9 10\n8 9\n8 11\n9 9\n2 3\n1 11\n13 14\n4 11\n2 9\n1 10\n6 11\n3 3\n4 12\n5 11\n8 8\n7 14\n13 13\n14 14\n14 14\n8 12\n14 14\n8 8\n7 7\n2 11\n10 12\n4 5\n9 10"], "outputs": ["4\n5\n6\n3\n4\n2", "2\n2", "2\n3\n2\n2", "2\n1\n1\n1\n1", "1\n2\n1\n2\n1", "3\n3\n3\n3\n3\n3\n3\n3", "8\n4\n2\n3\n2\n2\n2\n3\n3\n4\n5\n2\n4", "3\n5\n6\n6\n5\n3\n3\n6\n6\n3", "1\n1\n1\n1\n1\n6\n1\n1\n1\n1\n2\n1\n1\n1\n1\n1\n1\n1\n4\n1\n1\n1\n3\n1\n1\n2\n1\n1\n2\n1\n1\n1\n1\n1\n1\n1\n3\n1\n1\n1"]}

UNKNOWN

PYTHON3

CODEFORCES

2

cefd9888a7d526cca46b7a86b3deefbb

Hot Days

The official capital and the cultural capital of Berland are connected by a single road running through *n* regions. Each region has a unique climate, so the *i*-th (1<=≤<=*i*<=≤<=*n*) region has a stable temperature of *t**i* degrees in summer. This summer a group of *m* schoolchildren wants to get from the official capital to the cultural capital to visit museums and sights. The trip organizers transport the children between the cities in buses, but sometimes it is very hot. Specifically, if the bus is driving through the *i*-th region and has *k* schoolchildren, then the temperature inside the bus is *t**i*<=+<=*k* degrees. Of course, nobody likes it when the bus is hot. So, when the bus drives through the *i*-th region, if it has more than *T**i* degrees inside, each of the schoolchild in the bus demands compensation for the uncomfortable conditions. The compensation is as large as *x**i* rubles and it is charged in each region where the temperature in the bus exceeds the limit. To save money, the organizers of the trip may arbitrarily add or remove extra buses in the beginning of the trip, and between regions (of course, they need at least one bus to pass any region). The organizers can also arbitrarily sort the children into buses, however, each of buses in the *i*-th region will cost the organizers *cost**i* rubles. Please note that sorting children into buses takes no money. Your task is to find the minimum number of rubles, which the organizers will have to spend to transport all schoolchildren. The first input line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=105; 1<=≤<=*m*<=≤<=106) — the number of regions on the way and the number of schoolchildren in the group, correspondingly. Next *n* lines contain four integers each: the *i*-th line contains *t**i*, *T**i*, *x**i* and *cost**i* (1<=≤<=*t**i*,<=*T**i*,<=*x**i*,<=*cost**i*<=≤<=106). The numbers in the lines are separated by single spaces. Print the only integer — the minimum number of roubles the organizers will have to spend to transport all schoolchildren. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier. Sample Input 2 10 30 35 1 100 20 35 10 10 3 100 10 30 1000 1 5 10 1000 3 10 40 1000 100000 Sample Output 120 200065

[ "import sys\n\n\nn, m = map(int, sys.stdin.readline().split())\n\nans = 0\n\nfor _ in range(n):\n ti, Ti, xi, ci = map(int, sys.stdin.readline().split())\n cost = xi * m * (ti + m > Ti) + ci\n if ti < Ti:\n cost2 = ci * ((m - 1) // (Ti - ti) + 1)\n cost = min(cost, cost2)\n \n ans += cost\n\nprint(ans)\n\n \t \t \t\t\t \t\t \t \t \t\t \t", "import math;\n\ns = input()\na = s.find(\" \")\nn = int(s[0:a])\nstudents = int(s[a+1:len(s)])\n\nsum = 0\n\nfor i in range(n):\n s = input()\n a = s.find(\" \")\n temp = int(s[0:a])\n s = s[a+1:len(s)]\n\n a = s.find(\" \")\n maxTemp = int(s[0:a])\n s = s[a+1:len(s)]\n\n a = s.find(\" \")\n studentsCost = int(s[0:a])\n s = s[a+1:len(s)]\n\n busCost = int(s)\n\n if temp + students < maxTemp:\n oneBus = busCost\n else:\n oneBus = busCost + students * studentsCost\n if temp < maxTemp:\n diffTemp = maxTemp - temp\n nBuses = math.ceil(students / diffTemp)\n if nBuses != 0:\n busesCost = nBuses * busCost\n else:\n busesCost = oneBus\n else:\n busesCost = oneBus\n sum += min(oneBus, busesCost)\n\nprint(sum)\n\n\t\t \t\t \t\t\t \t \t\t \t\t \t" ]

{"inputs": ["2 10\n30 35 1 100\n20 35 10 10", "3 100\n10 30 1000 1\n5 10 1000 3\n10 40 1000 100000", "10 1\n8 6 3 4\n9 10 7 7\n1 3 9 5\n10 9 4 2\n1 10 2 10\n1 1 8 5\n5 5 9 2\n5 8 4 3\n4 4 9 7\n5 7 5 10", "5 5\n100 29 49 77\n34 74 41 8\n32 21 24 91\n45 52 16 51\n50 87 90 94", "1 1000000\n4 4 6 2", "20 102\n73 79 75 27\n13 15 62 47\n74 75 85 86\n49 81 23 69\n43 17 45 27\n35 14 90 35\n51 74 35 33\n54 66 46 24\n33 76 49 3\n34 53 25 76\n69 72 76 31\n41 31 8 48\n49 48 85 24\n19 2 59 83\n19 31 51 86\n31 10 45 76\n56 47 79 86\n49 33 15 1\n77 89 26 64\n7 52 76 77"], "outputs": ["120", "200065", "88", "686", "6000002", "59201"]}

UNKNOWN

PYTHON3

CODEFORCES

2

cf1cc557666d64e45d88d252152147db

Restore Graph

Valera had an undirected connected graph without self-loops and multiple edges consisting of *n* vertices. The graph had an interesting property: there were at most *k* edges adjacent to each of its vertices. For convenience, we will assume that the graph vertices were indexed by integers from 1 to *n*. One day Valera counted the shortest distances from one of the graph vertices to all other ones and wrote them out in array *d*. Thus, element *d*[*i*] of the array shows the shortest distance from the vertex Valera chose to vertex number *i*. Then something irreparable terrible happened. Valera lost the initial graph. However, he still has the array *d*. Help him restore the lost graph. The first line contains two space-separated integers *n* and *k* (1<=≤<=*k*<=<<=*n*<=≤<=105). Number *n* shows the number of vertices in the original graph. Number *k* shows that at most *k* edges were adjacent to each vertex in the original graph. The second line contains space-separated integers *d*[1],<=*d*[2],<=...,<=*d*[*n*] (0<=≤<=*d*[*i*]<=<<=*n*). Number *d*[*i*] shows the shortest distance from the vertex Valera chose to the vertex number *i*. If Valera made a mistake in his notes and the required graph doesn't exist, print in the first line number -1. Otherwise, in the first line print integer *m* (0<=≤<=*m*<=≤<=106) — the number of edges in the found graph. In each of the next *m* lines print two space-separated integers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*; *a**i*<=≠<=*b**i*), denoting the edge that connects vertices with numbers *a**i* and *b**i*. The graph shouldn't contain self-loops and multiple edges. If there are multiple possible answers, print any of them. Sample Input 3 2 0 1 1 4 2 2 0 1 3 3 1 0 0 0 Sample Output 3 1 2 1 3 3 2 3 1 3 1 4 2 3 -1

[ "import sys\r\nn, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ng = [k] * n\r\nmaxi = max(a)\r\nans = []\r\nif a.count(0) != 1:\r\n print(-1)\r\n sys.exit()\r\ni = 1\r\nf = a.index(0)\r\nres = [f]\r\nx = [[] for y in range(maxi + 1)]\r\nfor v in range(n):\r\n x[a[v]].append(v)\r\nwhile i <= maxi:\r\n t = x[i]\r\n w = len(t)\r\n z = 0\r\n for o in res:\r\n z += g[o]\r\n if z < w:\r\n print(-1)\r\n sys.exit()\r\n u = 0\r\n for l in res:\r\n while w > 0 and g[l] > 0:\r\n g[l] -= 1\r\n g[t[u]] -= 1\r\n w -= 1\r\n ans.append([l, t[u]])\r\n u += 1\r\n res = t\r\n i += 1\r\nprint(len(ans))\r\nfor row in ans:\r\n print(row[0] + 1, row[1] + 1)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nr=[[d[i],i] for i in range(n)]\r\nr.sort()\r\nif r[0][0]!=0 or r[1][0]==0:\r\n print(-1)\r\n exit()\r\nv=[[] for i in range(n+1)]\r\ncnt=[0]*n\r\nv[0].append(r[0][1])\r\nedges=[]\r\nfor rank,ver in r[1:]:\r\n if len(v[rank-1])==0:\r\n print(-1)\r\n exit()\r\n edges.append([v[rank-1][-1]+1,ver+1])\r\n v[rank].append(ver)\r\n cnt[v[rank-1][-1]]+=1\r\n cnt[ver]+=1\r\n if cnt[v[rank-1][-1]]==k:\r\n v[rank-1].pop()\r\n if cnt[ver]==k:\r\n v[rank].pop()\r\nprint(len(edges))\r\nfor x in edges:\r\n print(*x)", "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\nimport bisect\r\n# input = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n n, k = rl()\r\n d = rl()\r\n d = list(zip(d, range(1, n+1)))\r\n d.sort()\r\n if d[0][0] != 0:\r\n print(-1)\r\n else:\r\n u = 0\r\n pos = True\r\n res = []\r\n c = Counter()\r\n\r\n for v in range(1, n):\r\n if c[d[u][1]] >= k:\r\n u += 1\r\n while u < v and d[v][0] != d[u][0]+1:\r\n u += 1\r\n\r\n if u == v or c[d[u][1]] >= k or c[d[v][1]] >= k:\r\n print(-1)\r\n pos = False\r\n break\r\n res.append((d[u][1], d[v][1]))\r\n c[d[u][1]] += 1\r\n c[d[v][1]] += 1\r\n if pos:\r\n print(len(res))\r\n for i in res:\r\n print(*i)\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "n,k=map(int,input().split())\r\nd=zip( list(map(int,input().split())),range(0,n) )\r\nd=sorted(d)\r\n\r\nlast=0\r\ndu=[0]*n\r\nfa=[0]*n\r\nflag=1\r\nfor j in range(1,n):\r\n while last<j and ( du[last]==k or d[last][0]+1!=d[j][0] ):\r\n last+=1\r\n if last==j or d[0][0]!=0:\r\n print(-1)\r\n break\r\n fa[j]=last\r\n du[j]+=1\r\n du[last]+=1\r\nelse:\r\n print(n-1)\r\n for j in range(1,n):\r\n print(d[fa[j]][1]+1,d[j][1]+1)", "from sys import stdin\nfrom heapq import heappush, heappop\nfrom collections import deque\n\ndef r(): return stdin.readline().strip()\ndef r_t(tp): return map(tp, r().strip().split())\ndef r_l(tp): return list(r_t(tp))\n\ndef solve(n,k,d):\n s, E, deg = -1, [], [0 for _ in range(n)]\n for i in range(n):\n if d[i]==0 and s==-1: s=i\n elif d[i]==0: return [-1]\n if s==-1: return [-1]\n\n next = []\n for u in range(n):\n if u!=s: heappush(next,(d[u],u))\n f = [deque([]) for _ in range(n)]\n f[0].appendleft(s)\n\n while next:\n dist, u = heappop(next)\n #print(u,dist, f, deg)\n if not f[dist-1]: return [-1]\n v = f[dist-1].pop()\n #print(v)\n deg[v]+=1; deg[u]+=1\n if deg[v]<k: f[dist-1].appendleft(v)\n if deg[u]<k: f[dist].appendleft(u)\n E.append((u,v))\n\n return E\n\n\ndef main():\n n, k = r_t(int)\n d = r_l(int)\n ans = solve(n, k, d)\n if ans==[-1]: print(-1)\n else:\n print(len(ans))\n for u,v in ans: print(u+1,v+1)\n\nmain()\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nnodes=[[] for i in range(n)]\r\nfor i in range(n):\r\n nodes[arr[i]].append([i+1,0])\r\nedges=[]\r\ny=1\r\nmx=0\r\nfor i in range(1,max(arr)+1):\r\n if(len(nodes[i-1])==0 or len(nodes[i])==0):\r\n y=0\r\n break\r\n else:\r\n nd=nodes[i-1]\r\n nd2=nodes[i]\r\n for j in range(len(nd2)):\r\n nodes[i-1][j%len(nd)][1]+=1\r\n nodes[i][j][1]+=1\r\n mx=max(mx,nodes[i-1][j%len(nd)][1],nodes[i][j][1])\r\n edges.append((nodes[i-1][j%len(nd)][0],nodes[i][j][0]))\r\nif(not y or arr.count(0)>1 or mx>k):\r\n print(-1)\r\nelse:\r\n print(len(edges))\r\n for i in edges:\r\n print(*i)\r\n \r\n", "def solve(n,k,d):\r\n\tdist = [[] for i in range(n)]\r\n\tfor u in range(n):\r\n\t\tdist[d[u]].append(u)\r\n\tif len(dist[0])!=1:\r\n\t\treturn []\r\n\r\n\tans = []\r\n\tfor t in range(1,n):\r\n\t\tnxt = []\r\n\t\tj = 0\r\n\t\tlim = k if t==1 else (k-1)\r\n\t\tctr = 0\r\n\t\tfor u in dist[t]:\r\n\t\t\tif ctr==lim:\r\n\t\t\t\tctr = 0\r\n\t\t\t\tj += 1\r\n\t\t\tif j==len(dist[t-1]):\r\n\t\t\t\treturn []\r\n\t\t\telse:\r\n\t\t\t\tans.append((dist[t-1][j]+1,u+1))\r\n\t\t\t\tctr += 1\r\n\treturn ans\r\n\r\nn, k = map(int,input().split())\r\nd = [int(x) for x in input().split()]\r\nans = solve(n,k,d)\r\nif ans==[]:\r\n\tprint(-1)\r\nelse:\r\n\tprint(len(ans))\r\n\tfor e in ans:\r\n\t\tprint(*e)\r\n" ]

{"inputs": ["3 2\n0 1 1", "4 2\n2 0 1 3", "3 1\n0 0 0", "5 3\n0 2 1 2 1", "7 3\n2 2 0 1 3 2 1", "9 4\n2 1 1 3 1 2 2 1 0", "3 1\n0 1 2", "2 1\n1 0", "2 1\n1 1", "2 1\n0 0", "4 2\n0 1 0 1", "5 3\n3 1 4 2 1", "5 4\n1 2 2 2 3", "4 3\n1 1 1 2", "4 3\n1 2 2 3", "4 3\n1 2 3 3", "7 6\n1 1 2 2 3 3 3", "10 5\n0 1 1 1 1 1 1 2 2 2", "5 4\n0 1 1 1 4"], "outputs": ["2\n1 2\n1 3", "3\n1 3\n1 4\n2 3", "-1", "4\n1 3\n1 5\n2 5\n4 5", "6\n1 7\n2 7\n3 4\n3 7\n4 6\n5 6", "8\n1 8\n2 9\n3 9\n4 7\n5 9\n6 8\n7 8\n8 9", "-1", "1\n1 2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

7

cf438485b6500f7040d2da54b017d318

The Queue

Finally! Vasya have come of age and that means he can finally get a passport! To do it, he needs to visit the passport office, but it's not that simple. There's only one receptionist at the passport office and people can queue up long before it actually opens. Vasya wants to visit the passport office tomorrow. He knows that the receptionist starts working after *t**s* minutes have passed after midnight and closes after *t**f* minutes have passed after midnight (so that (*t**f*<=-<=1) is the last minute when the receptionist is still working). The receptionist spends exactly *t* minutes on each person in the queue. If the receptionist would stop working within *t* minutes, he stops serving visitors (other than the one he already serves). Vasya also knows that exactly *n* visitors would come tomorrow. For each visitor Vasya knows the point of time when he would come to the passport office. Each visitor queues up and doesn't leave until he was served. If the receptionist is free when a visitor comes (in particular, if the previous visitor was just served and the queue is empty), the receptionist begins to serve the newcomer immediately. For each visitor, the point of time when he would come to the passport office is positive. Vasya can come to the office at the time zero (that is, at midnight) if he needs so, but he can come to the office only at integer points of time. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and stand in the queue after the last of them. Vasya wants to come at such point of time that he will be served by the receptionist, and he would spend the minimum possible time in the queue. Help him! The first line contains three integers: the point of time when the receptionist begins to work *t**s*, the point of time when the receptionist stops working *t**f* and the time the receptionist spends on each visitor *t*. The second line contains one integer *n* — the amount of visitors (0<=≤<=*n*<=≤<=100<=000). The third line contains positive integers in non-decreasing order — the points of time when the visitors arrive to the passport office. All times are set in minutes and do not exceed 1012; it is guaranteed that *t**s*<=<<=*t**f*. It is also guaranteed that Vasya can arrive at the passport office at such a point of time that he would be served by the receptionist. Print single non-negative integer — the point of time when Vasya should arrive at the passport office. If Vasya arrives at the passport office at the same time with several other visitors, he yields to them and queues up the last. If there are many answers, you can print any of them. Sample Input 10 15 2 2 10 13 8 17 3 4 3 4 5 8 Sample Output 122

[ "begin, end, time = list(map(int, input().split()))\r\nn = int(input())\r\nif n == 1:\r\n print(begin)\r\nelif n > 0:\r\n ar = list(map(int, input().split()))\r\n ar.sort()\r\n i = 0\r\n ar.append(end - time + 1)\r\n n += 1\r\n\r\n num = begin\r\n ans = begin - ar[0] + 1\r\n fin_ans = ar[0] - 1\r\n while i < n:\r\n num = max(num + time, ar[i] + time)\r\n while i + 1 < n and ar[i + 1] == ar[i]:\r\n i += 1\r\n num += time\r\n i += 1\r\n if i < n and num - ar[i] + 1 < ans and max(ar[i] - 1, num) + time <= end:\r\n ans = num - ar[i] + 1\r\n fin_ans = ar[i] - 1\r\n\r\n print(fin_ans)\r\n\r\nelse:\r\n print(begin)\r\n", "def solve():\n s = [int(x) for x in input().split()]\n ts, tf, t = s[0], s[1], s[2]\n n = int(input())\n\n if n == 0:\n return ts\n\n v = [int(x) for x in input().split()]\n v0 = v[0]\n\n if v0 > ts:\n return ts \n \n ans, ansv = 1e15, 1e15\n now = ts\n\n for i in range(len(v)):\n if max(0, now-v[i]+1) < ansv and v[i]-1+t <= tf:\n ansv = max(0, now - v[i] + 1)\n ans = v[i] - 1\n now = max(now, v[i]) + t\n if now+t <= tf:\n return now\n else:\n return ans\n\ndef main():\n output = solve()\n print(output)\n\nmain()\n\n#\n \t\t \t \t\t\t \t\t \t \t \t \t \t \t \t\t\t", "f = lambda: map(int, input().split())\r\na, b, t = f()\r\nk, = f()\r\ns = d = 1e12\r\nfor q in (f() if k else []):\r\n if q > a: s = a\r\n if q > a or a + t > b: break\r\n elif a - q < d: s, d = q - 1, a - q\r\n a += t\r\nprint(s if a + t > b else a)", "ts, tf, t = map(int, input().split())\r\nN=int(input())\r\nif N == 0:\r\n print(ts)\r\nelse:\r\n ba = list(map(int, input().split()))\r\n ends = ts\r\n mi = 10**12\r\n mis = 0\r\n \r\n if ba[0] > 0:\r\n mi = ts - ba[0] + 1\r\n mis = ba[0] - 1\r\n for i in range(N):\r\n if ba[i] <= ends:\r\n ends += t\r\n if i == N - 1:\r\n continue\r\n if ba[i] == ba[i + 1]:\r\n continue\r\n \r\n if ends + t <= tf and ends - (ba[i + 1] - 1) < mi:\r\n mi = ends - (ba[i + 1] - 1)\r\n mis = ba[i + 1] - 1\r\n if ends + t <= tf:\r\n print(ends)\r\n else:\r\n print(mis)# 1698314251.2987468" ]

{"inputs": ["10 15 2\n2\n10 13", "8 17 3\n4\n3 4 5 8", "7 14 3\n2\n1 2", "30 70 10\n3\n30 32 35", "21 56 7\n5\n1 2 3 4 5", "10 1000000000 25\n20\n1 1 5 7 8 10 12 22 44 47 73 77 82 83 89 141 142 168 195 199", "30 60 3\n10\n1 5 6 10 12 13 18 23 24 25", "61 1000000000 13\n55\n29 72 85 94 103 123 125 144 147 153 154 184 189 192 212 234 247 265 292 296 299 304 309 365 378 379 393 401 414 417 421 427 439 441 480 500 509 515 522 539 571 582 623 630 634 635 643 649 654 679 680 686 747 748 775", "117 120 3\n0", "37 3813 32\n117\n1 1 4 5 6 8 10 13 13 16 18 19 20 23 30 32 33 38 49 59 66 69 96 157 160 183 205 292 301 320 349 360 370 372 384 400 410 413 423 434 434 445 451 463 464 490 494 496 497 517 528 532 556 572 607 647 668 689 708 729 748 806 819 879 905 905 915 925 928 931 959 970 1133 1146 1150 1156 1172 1189 1193 1218 1228 1233 1247 1297 1383 1447 1468 1512 1539 1550 1634 1635 1702 1836 1845 1866 1880 2068 2082 2143 2146 2167 2234 2239 2277 2331 2351 2432 2478 2592 2684 2863 2885 3043 3141 3258 3426", "100000000000 200000000000 10000000000\n10\n1 1 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000 110000000000", "1 2 1\n0", "50 230 10\n20\n50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240", "100000000000 100000000005 2\n0", "333 500 5\n1\n3000"], "outputs": ["12", "2", "0", "60", "0", "510", "4", "360", "117", "3781", "109999999999", "1", "49", "100000000000", "333"]}

UNKNOWN

PYTHON3

CODEFORCES

4

cf4da4092ec76b45e3e4ddde8e8a0056

Infinite Sequence

Vasya likes everything infinite. Now he is studying the properties of a sequence *s*, such that its first element is equal to *a* (*s*1<==<=*a*), and the difference between any two neighbouring elements is equal to *c* (*s**i*<=-<=*s**i*<=-<=1<==<=*c*). In particular, Vasya wonders if his favourite integer *b* appears in this sequence, that is, there exists a positive integer *i*, such that *s**i*<==<=*b*. Of course, you are the person he asks for a help. The first line of the input contain three integers *a*, *b* and *c* (<=-<=109<=≤<=*a*,<=*b*,<=*c*<=≤<=109) — the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively. If *b* appears in the sequence *s* print "YES" (without quotes), otherwise print "NO" (without quotes). Sample Input 1 7 3 10 10 0 1 -4 5 0 60 50 Sample Output YES YES NO NO

[ "a, b, c = map(int, input().split())\r\nd = b - a\r\nif a == b:\r\n print(\"YES\")\r\nelif d > 0 and c > 0 and float(d / c).is_integer():\r\n print(\"YES\")\r\nelif d < 0 and c < 0 and float(d / c).is_integer():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int, input().split())\r\nif(c==0 and a==b):\r\n print('YES')\r\nelif(c==0):\r\n print('NO')\r\nelif((b-a)%c==0 and (b-a)//c>=0):\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c = map(int, input().rstrip().split(\" \"))\r\nif b < a and c > 0:\r\n print(\"NO\")\r\nelif c==0:\r\n if b!=a:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif b > a and c < 0:\r\n print(\"NO\")\r\nelse:\r\n if (b - a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a, b, c = map(int,input().split())\r\nif (a == b) or (c != 0 and ((b >= a and c > 0) or (b <= a and c < 0)) and (b - a) % c == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nif c==0 and a==b:\r\n print(\"yes\")\r\nelif c!=0 and ((b-a)/c)==int((b-a)/c) and ((b-a)/c)>=0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "a, b, c = [int(i) for i in input().split()]\r\nif b == a:\r\n print ('YES')\r\nelse:\r\n if c == 0:\r\n print ('NO')\r\n else:\r\n if c > 0 and a > b:\r\n print ('NO')\r\n elif c < 0 and a < b:\r\n print ('NO')\r\n else:\r\n if abs (a - b)%c == 0:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\n", "a,b,c = map(int,input().split())\r\nd = []\r\nif b < a and c >= 0:\r\n print(\"NO\")\r\nelif a < b and c <= 0:\r\n print(\"NO\")\r\nelif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif abs(a-b) % c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A = input().split()\r\nfor i in range(len(A)):\r\n A[i] = int(A[i])\r\na,b,c = A\r\n\r\nif c==0:\r\n if a == b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nelse:\r\n d = (b-a)//c\r\n ost = (b-a)/c-(b-a)//c\r\n if ost == 0:\r\n if d>=0:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\n else:\r\n print ('NO')", "from math import*\r\n\r\na,b,c=map(int,input().split())\r\nsex=a\r\nfuck=b\r\nsuck=c\r\n\r\nif(suck==0 and sex==fuck):\r\n print(\"YES\")\r\nelif(suck==0 and sex!=fuck):\r\n print(\"NO\")\r\nelif((fuck-sex)%suck==0 and (fuck-sex)/suck>=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a, b, c = list(map(int, input().split()))\r\n\r\nif a == b:\r\n print(\"YES\")\r\nelif c == 0 and a != b:\r\n print(\"NO\")\r\nelse:\r\n sovpad = (b - a) % c\r\n sovpad_div = (b - a) / c\r\n if sovpad == 0 and sovpad_div > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\na,s,d = input().split()\na=int(a)\ns=int(s)\nd = int(d)\ndef check(a,s,d):\n\tif(d!=0):\n\t\tn = ((s-a)/d) + 1\n\t\tj = n%1\n\t\tif(j==0.0):\n\t\t\tif(n>0):\n\t\t\t\treturn \"YES\"\n\tif(d==0):\n\t\tif(a==s):\n\t\t\treturn \"YES\"\n\treturn \"NO\"\nprint(check(a,s,d))", "a, b, c = map(int, input().split(' '))\r\nif c == 0:\r\n print('YES' if a == b else 'NO')\r\nelse:\r\n kth = (b - a) // c if (b - a) % c == 0 else -1\r\n print('YES' if kth >= 0 else 'NO')\r\n", "a, b, c = map(int, input().split())\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a==b:\r\n print('YES')\r\nelif (c<0 and b-a>0)or (c>0 and b-a<0) or (b-a)%c != 0:\r\n print('NO')\r\nelif (b-a)%c == 0 :\r\n print('YES')\r\n", "s= input(\"\").split(' ')\na=int(s[0])\nb= int(s[1])\nc= int(s[2])\ncounter=0\nif c==0 and b==a:\n\tprint(\"YES\")\nelif c==0 and b!=a:\n\tprint(\"NO\")\nelse:\n\tmax1=(b-a)/c\n\tmax2= int (max1)\n\tif max1<0:\n\t\tprint(\"NO\")\n\telif max2==max1:\t\n\t\tprint (\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n", "'''input\n0 60 50\n'''\na, b, c = map(int, input().split())\nif a == b:\n\tprint(\"YES\")\nelif c == 0:\n\tprint(\"NO\")\nelif (b-a) % c == 0 and b > a and c > 0:\n\tprint(\"YES\")\nelif (b-a) % c == 0 and a > b and c < 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "a=list(map(int,input().split()))\r\na1=a[0]\r\nd=a[-1]\r\nreq=a[1]\r\nif d==0:\r\n if a1==req:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if (req-a1)%d==0:\r\n k=(req-a1)//d\r\n if k+1>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "p,q,r = map(int,input().split())\r\nif r>0:\r\n if (p>q):\r\n print(\"NO\")\r\n exit(0)\r\nelif r==0:\r\n if (p!=q):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n exit(0)\r\nelif (q>p):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nif not (q-p)%r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a,b,c = map(int,input().split())\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif int((b-a)/c+1)==(b-a)/c+1 and (b-a)/c+1>=1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c=map(int,input().split())\r\nif c==0:print([\"NO\",\"YES\"][a==b])\r\nelif c>0:\r\n\tif b<a:print(\"NO\")\r\n\telse:print([\"NO\",\"YES\"][(b-a)%c==0])\r\nelse:\r\n\tif b>a:print(\"NO\")\r\n\telse:print([\"NO\",\"YES\"][(b-a)%c==0])", "a,b,c = map(int,input().split())\r\ndef ispos():\r\n\tpos = 0\r\n\tif a==b :\r\n\t\treturn 1\r\n\tif c==0 :\r\n\t\treturn 0\r\n\tif ab and c>0:\r\n\t\treturn 0\r\n\tif (b-a)%c == 0:\r\n\t\treturn 1\r\n\telse : return 0\r\nans = \"YES\" if ispos() == 1 else \"NO\"\r\nprint(ans)\r\n\t", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print('YES')\r\nelse:\r\n if c==0:\r\n print('NO')\r\n else:\r\n n=(b-a)/c\r\n if int(n)==n and n>=0:\r\n print('YES')\r\n else:\r\n print('NO')", "a, b, c = map(int, input().split())\r\nif (c == 0 and a == b):\r\n\tprint(\"YES\")\r\n\texit(0)\r\nelif(c == 0 and a != b):\r\n\tprint(\"NO\")\r\n\texit(0)\r\nb -= a\r\nif (b % c == 0 and b // c >= 0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b,c=map(int,input().split())\r\nif b<a and c>=0:\r\n print(\"NO\")\r\nelif a<b and c<=0:\r\n print(\"NO\")\r\nelif c==0:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif abs(a-b)%c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = list(map(int,input().split()))\r\nif c==0:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif (b-a)%c==0 and (b-a)//c >= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=[int(x) for x in input().split()]\r\n\r\nif (c!=0 and (b-a)/c>=0 and (b-a)%c==0) or (c==0 and a==b):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\ndef solve():\n a,b,c = map(int, input().split())\n if c==0:\n if a==b:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n lo=1\n hi=10**18 + 10\n while lo<=hi:\n mid = (lo+hi)//2\n amid = a+(mid-1)*c\n if amid==b:\n print(\"YES\")\n return\n if c>0:\n if amid>b:\n hi=mid-1\n else:\n lo=mid+1\n else:\n if amid>b:\n lo=mid+1\n else:\n hi=mid-1\n print(\"NO\")\n\nsolve()\n\n\t\t \t\t\t \t\t \t\t\t\t \t \t\t \t", "a , b , c = map(int,input().split())\r\nif c > 0:\r\n if (b - a) % c == 0 and b >= a:\r\n print('YES')\r\n exit(0)\r\nif c < 0:\r\n if (b - a) % c == 0 and b <= a:\r\n print('YES')\r\n exit(0) \r\nif c == 0:\r\n if a == b:\r\n print('YES')\r\n exit(0)\r\n \r\nprint('NO')", "s=input()\r\ns=s.split()\r\ns=list(map(int,s))\r\na=s[1]-s[0]\r\nb=s[2]\r\nif a*b>0:\r\n if a%b==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a*b<0:\r\n print('NO')\r\nelse:\r\n if a==0:\r\n print('YES')\r\n else:\r\n print('NO')", "print(''.join([\"YES\" if (c == 0 and a == b) or (c != 0 and (b - a) % c == 0 and (b - a) // c >= 0) else \"NO\" for a, b, c in [map(int, input().split())]]))\r\n", "a, an, d = [int(j) for j in input().split()]\r\nif d == 0:\r\n if a == an:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = ((an - a) / d) + 1\r\n if n > 0 and int(n) == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a,b,c=map(int, input().split())\r\nprint(\"YES\" if (c==0 and a==b) or (c!=0 and (b-a)%c==0 and (b-a)/c>=0) else \"NO\")", "a,b,c = map(int,input().split())\r\nif c == 0: print(\"NO\") if a != b else print(\"YES\")\r\nelse:\r\n\tprint(\"YES\") if (b-a)//c >= 0 and (b-a)%c == 0 else print(\"NO\")", "a,b,c=map(int, input().split())\r\nb-=a\r\nif c == 0:\r\n if b==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse: \r\n if b * c < 0:\r\n print(\"NO\")\r\n else:\r\n if b % c == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a,c,d=map(int,input().split())\nif d!=0:\n n=((c-a)/d)+1\n if int(n)==n and n>0:\n print('YES')\n else:\n print('NO')\nelse:\n if a==c:\n print('YES')\n else:\n print('NO')\n", "# print(-5//5)\r\na,b,c=map(int,input().split(' '))\r\nif( a0):\r\n print('NO')\r\n quit()\r\n\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else :\r\n print('NO')\r\n quit()\r\nd=(b-a)//c\r\n# print(d)\r\nif d*c+a==b:\r\n print(\"YES\")\r\nelse :\r\n print('NO')\r\n", "import sys\nstart, value, increment = map(int, sys.stdin.readline().strip().split())\n\nif start == value:\n print (\"YES\")\n exit()\n\nif value > start and increment > 0 and value%increment == start%increment:\n print (\"YES\")\n exit()\n\nif value < start and increment < 0 and value%increment == start% increment:\n print (\"YES\")\n exit()\n\nprint(\"NO\")\n# 1488583572329\n", "a, b, c = [int(i) for i in input().split()]\r\n\r\nif (c == 0):\r\n if (a == b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif ((b - a) % c == 0):\r\n if ((b - a) / c >= 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a, b, c = [int(x) for x in input().split(' ')]\r\nans = 'NO'\r\nif c == 0:\r\n if a == b:\r\n ans = 'YES'\r\nelif c > 0:\r\n if b >= a and b % c == a % c:\r\n ans = 'YES'\r\nelse:\r\n if b <= a and b % c == a % c:\r\n ans = 'YES'\r\nprint(ans)\r\n", "[a, b, c] = [int(x) for x in input().split()]\r\n\r\ndef runcodeifcpositive():\r\n if c==0:\r\n print(\"YES\") if a==b else print(\"NO\")\r\n elif b<a:\r\n print(\"NO\")\r\n elif a<0:\r\n x = a+a*(-1)\r\n y = b+a*(-1)\r\n if y%c == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n elif a>=0:\r\n if (b-a)%c == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\ndef runcodeifcnegative():\r\n [x, y, z] = [a*-1, b*-1, c*-1]\r\n if c==0:\r\n print(\"YES\") if x==y else print(\"NO\")\r\n elif y<x:\r\n print(\"NO\")\r\n elif x<0:\r\n e = x+x*(-1)\r\n f = y+x*(-1)\r\n if f%z == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n elif x>=0:\r\n if (y-x)%z == 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n\r\nif c>=0: runcodeifcpositive()\r\nelse:\r\n runcodeifcnegative()\r\n", "def infinite(a,b,c):\r\n if c==0 and (b-a)==0:\r\n return(\"YES\")\r\n elif (b-a)!=0 and c==0:\r\n return(\"NO\")\r\n if (b-a)<0 and c>=0:\r\n return(\"NO\")\r\n elif b-a>0 and c<0:\r\n return(\"NO\")\r\n if (b-a)%c==0:\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\na,b,c = input().strip().split()\r\nprint(infinite(int(a),int(b),int(c)))", "tres = map(int,input().split())\n\na = next(tres)\nb = next(tres)\nc = next(tres)\n\n# casos c igual a 0\nif (c == 0 and a == b): print(\"YES\")\nelif (c == 0 and a != b): print(\"NO\")\n\n# casos no es posible llegar a b\nelif (a > b and c > 0): print(\"NO\")\nelif (a < b and c < 0): print(\"NO\")\n\n# casos no se llega al numero b deseado\nelif (b%c == a%c): print(\"YES\")\nelse: print(\"NO\")\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\na, b, c = map(int, input().split())\r\n\r\nif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if b > a and c < 0 or a > b and c > 0:\r\n print(\"NO\")\r\n elif a% c == b%c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = input().split()\r\na,b,c = a\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\n \r\nif not c:\r\n if a==b:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\nelif b%c == a%c and ((b >= a and c > 0) or (b <= a and c < 0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, find, c = map(int, input().split())\r\n\r\nif c == 0:\r\n if a == find:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if (find - a) % c == 0 and (find - a) // c >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[a, b, c] = list(map(int, input().split()))\r\nd = b-a\r\nif a == b:\r\n print(\"YES\")\r\n exit(0)\r\nif (d > 0 and c <= 0) or (d < 0 and c >= 0):\r\n print(\"NO\")\r\n exit(0)\r\nd = abs(d)\r\nc = abs(c)\r\nif d%c != 0:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "a,b,c = map(int, input().split())\r\nif c != 0:\r\n k = (b - a)/c\r\n if int(k) == k and k >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES' if a == b else 'NO')", "import sys\r\na,b,c=map(int,sys.stdin.readline().split())\r\nif (a>b and c>0) or(a<b and c<0):\r\n print(\"NO\")\r\nelse:\r\n if a==b:\r\n print(\"YES\")\r\n elif c!=0 and(b-a)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a,b,c=map(int,input().split()) \r\nif c<0:\r\n if a<b:\r\n print(\"NO\")\r\n else:\r\n if abs(b-a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif c>0:\r\n if a>b:\r\n print(\"NO\")\r\n else:\r\n if abs(b-a)%c:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if a!=b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "def main():\r\n\ta, b, c = map(int, input().split())\r\n\r\n\tif b == a:\r\n\t\tprint(\"YES\")\r\n\t\texit(0)\r\n\r\n\tif (b>a and c<=0) or (b<a and c>=0):\r\n\t\tprint('NO')\r\n\t\texit(0)\r\n\r\n\tdiff = abs(a - b)\r\n\tif diff % abs(c) == 0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a,b,c=map(int,input().split())\r\nif c>0:\r\n if b>=a and (b-a)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif c<0:\r\n if b<=a and(a-b)%c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif c==0:\r\n if a!=b:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "a,b,c = map(int,input().split(' '))\r\nif a==b or (c!=0 and (b-a)//c>=0 and (b-a)%c==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/python3\na,b,c = [int(x) for x in input().split()]\nflag = 1\nif (b > a and c < 0):\n\tprint(\"NO\")\nelif (b < a and c > 0):\n\tprint(\"NO\")\nelse :\n\tif (not(c == 0) and (b-a)%c == 0):\n\t\tprint(\"YES\")\n\telif (c == 0 and b == a):\n\t\tprint(\"YES\")\n\telse :\n\t \tprint(\"NO\")\n", "def solve(a, b, c):\n\tif a == b:\n\t\treturn \"YES\"\n\tif c == 0:\n\t\treturn \"NO\"\n\tk = (b - a) // c\n\tif k < 0:\n\t\treturn \"NO\"\n\tif a + k * c != b:\n\t\treturn \"NO\"\n\treturn \"YES\"\n\na, b, c = map(int, input().split())\n\nprint(solve(a, b, c))\n", "def main():\n\ta,b,c = input().split()\n\ta,b,c = int(a),int(b),int(c)\n\tif b - a >= 0 and c > 0:\n\t\tb -= a\n\t\tif b % c == 0:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif b - a <= 0 and c < 0:\n\t\tb = a - b\n\t\tc -= 2 * c\n\t\tif b % c == 0:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif c == 0:\n\t\tif a == b:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telif (b - a <= 0 and c > 0) or (b - a >= 0 and c < 0):\n\t\tprint(\"NO\")\nif __name__ == '__main__':\n\tmain()", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nif not c:\r\n ans = \"YES\" if a == b else \"NO\"\r\nelse:\r\n if c < 0:\r\n a, b = b, a\r\n c *= -1\r\n ans = \"YES\" if not (a - b) % c and a <= b else \"NO\"\r\nprint(ans)", "lis=input().split()\na=int(lis[0])\nb=int(lis[1])\nc=int(lis[2])\nif(b-a<0):\n\tif(c<0):\n\t\td=-(b-a)\n\t\tdc=-c\n\t\tif(d%dc==0):\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\telse:\n\t\tprint ('NO')\t\t\t\nelif(b==a):\n\tprint('YES')\nelse:\n\tif(c>0):\n\t\tif((b-a)%c==0):\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\telse:\n\t\tprint('NO')\n\t\n", "def main():\n a, b, c = (int(x) for x in input().strip().split(\" \"))\n\n if(b < a and c > 0):\n print(\"NO\")\n return\n \n if(b > a and c < 0):\n print(\"NO\")\n return\n\n if(c == 0):\n if(a == b):\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n if((b-a) % c == 0):\n print(\"YES\")\n return\n \n print(\"NO\")\n\nmain()", "l=list(map(int,input().split()))\r\na,b,c=l[0],l[1],l[2]\r\nif c==0:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if c>0:\r\n if b>=a and (b-a)%c==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n c*=-1\r\n if b<=a and (a-b)%c==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "a, b, c = map(int, input().split(\" \"))\r\nif c != 0:\r\n k = (b - a) / c\r\n if k < 0 or k != int(k):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif a == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c = map(int,input().split())\r\n\r\nif c == 0:\r\n if a == b :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse:\r\n pos = (b - a) / c\r\n\r\n if pos.is_integer() and pos >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n", "a,b,c=(int(i) for i in input().split())\r\nif(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(c>0 and b<a):\r\n print(\"NO\")\r\nelif(c<0 and b>a):\r\n print(\"NO\")\r\nelse:\r\n n=((b-a)/c)+1\r\n if(n==int(n)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nfor _ in range(1):\r\n a,b,c=map(int,input().split())\r\n \r\n if (c != 0 and (b - a) % c == 0 and (b - a)*c >= 0) or (c == 0 and a == b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n \r\n ", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nfor _ in range(1):\r\n a,b,c=M()\r\n if c==0 or a==b:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if a>b:\r\n if d%c==0 and c<0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if d%c==0 and c>0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n", "a,b,c=map(int,input().split())\r\nif(c==0):\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n f=(b-a)/c\r\n if(f-int(f)>0 or f<0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a,s,d = map(int,input().split())\r\ndef check(a,s,d):\r\n if(d!=0):\r\n n = ((s-a)/d+1)\r\n j = n%1\r\n if(j==0.0):\r\n if(n>0):\r\n return (\"YES\")\r\n if(d==0):\r\n if(a==s):\r\n return (\"YES\")\r\n return \"NO\"\r\nprint(check(a,s,d))", "(a,b,c) = list(int(x) for x in input().split())\r\nif c>0 and b>=a:\r\n if (b-a)%c==0:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\nelif c<0 and b<=a:\r\n if (a-b)%abs(c)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif c==0 and a==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\nfrom operator import mul\r\nfrom functools import reduce\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\n########### ----- MAIN FUNCTION ---- ##########\r\ndef main():\r\n\ta,b,c = invr()\r\n\tx = b-a\r\n\tif c==0:\r\n\t\tif a==b:\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn \r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn \r\n\tif x%c==0 and x//c>=0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n\r\n", "a,b,c=map(int,input().split())\r\nif c==0: print(\"YES\") if a==b else print(\"NO\")\r\nelse :print(\"YES\") if ((b-a)%c==0) and ((b>=a and c>=0) or (b<=a and c<=0)) else print(\"NO\")", "from re import *\nfrom sys import stderr\ndef readint():\n return int(input())\ndef readfloat():\n return float(input())\ndef readarray(N, foo=input):\n return [foo() for i in range(N)]\ndef readlinearray(foo=int):\n return map(foo, input().split())\n\ndef NOD(a, b):\n while b:\n a,b = b, a%b\n return a\n\ndef gen_primes(max):\n primes = [1]*(max+1)\n for i in range(2, max+1):\n if primes[i]:\n for j in range(i+i, max+1, i):\n primes[j] = 0\n primes[0] = 0\n return [x for x in range(max+1) if primes[x]]\n\ndef is_prime(N):\n i = 3\n if not(N % 2):\n return 0\n while i*i < N:\n if not(N % i):\n return 0\n i += 3\n return 1\n\na, b, c = readlinearray()\nb -= a\n\nif b == 0 or (c != 0 and c * b > 0 and b % c == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a, b, c = map(int, input().split(' '))\r\nif ((a != b and c == 0) or (b > a and c < 0)):\r\n print(\"NO\")\r\nelif ((a == b) or (b > a and c > 0 and ((b - a) % c == 0)) or (a > b and c < 0 and ((a - b) % c == 0))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ninput1 = [int(elem) for elem in sys.stdin.readline().strip().split()]\n\nif input1[1] == input1[0]:\n print (\"YES\") \n \nelif input1[1] > input1[0] and input1[2] > 0 and input1[1]%input1[2] == input1[0]%input1[2]:\n print (\"YES\")\n \nelif input1[1] < input1[0] and input1[2] < 0 and input1[1]%input1[2] == input1[0]%input1[2]:\n print (\"YES\")\n\nelse:\n print(\"NO\")\n# 1488583300073\n", "\r\nimport sys\r\n# مگو\r\nInput = sys.stdin.readline\r\n# N = int(Input())\r\n# منی\r\na, b, c = map(int, Input().split()) # نگهت\r\nif a is b:\r\n# ترین\r\n exit(print('YES'))\r\n# تو دل\r\nz = (b-a)\r\nif z * c > 0 and z % c == 0:\r\n exit(print('YES'))\r\nprint('NO')\r\n# راز\r\n# میدارم\r\n", "a, b, c = map(int, input().split())\r\nba = b - a\r\ntry:\r\n print(('NO', 'YES')[ba % c == 0 and ba // c >= 0])\r\nexcept:\r\n print(('YES', 'NO')[b != a])\r\n", "a,b,c=map(int,input().split())\r\nif(a==b):\r\n print(\"YES\")\r\nelif(a!=b and c==0):\r\n print(\"NO\")\r\nelif((b-a)%c==0 and ((b-a)/c>0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nif __name__ == '__main__':\r\n values = [int(x) for x in input().split()]\r\n\r\n if values[2] == 0 :\r\n print('YES' if values[0] == values[1] else 'NO')\r\n else:\r\n print('YES' if (values[1]-values[0])//(values[2]) >= 0 and (values[1]-values[0])%(values[2]) == 0 else 'NO')\r\n", "a,b,c = map(int,input().split())\r\nif c == 0:print(\"YNEOS\"[a!=b::2])\r\nelse:print(\"YNEOS\"[not ((b-a) % c == 0 and (b-a) /c >=0)::2])", "a,b,c = map(int, input().split())\r\nif (a!=b and c==0):\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint (\"YES\") if (a==b or ((b-a)%c==0 and (abs(b-a)/abs(c))==((b-a)/c))) else print (\"NO\")\r\n", "a, b, c = map(int, input().split())\r\n\r\nif(b==a):\r\n print('YES')\r\nelif(b>a):\r\n if(c>0 and (b-a)%c==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if(c<0 and (a-b)%(abs(c))==0):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from sys import stdin\r\n\r\ndef main():\r\n numbers = stdin.readline().split()\r\n a, b, c = int(numbers[0]), int(numbers[1]), int(numbers[2])\r\n r = False\r\n if c == 0:\r\n r = a == b\r\n else:\r\n r = (b - a) // c >= 0 and (b - a) % c == 0\r\n if r:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nmain()\r\n", "a, b, c = map(int, input().split())\n\ndif = b - a\n\nif c == 0:\n\tif dif == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nelse:\n\tif dif == 0:\n\t\tprint('YES')\n\telif dif > 0 and c > 0 and dif % c == 0:\n\t\tprint('YES')\n\telif dif < 0 and c < 0 and dif % c == 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n", "a, b, c = map(int, input().split())\r\nif c == 0:\r\n print([\"NO\",\"YES\"][a == b])\r\nelse:\r\n d = b - a\r\n print([\"NO\",\"YES\"][d % c == 0 and d // c >= 0])", "a,b,c=map(int,input().split())\r\nif(b==a):\r\n print(\"YES\")\r\n exit()\r\nelif(b>a):\r\n if(c>0):\r\n if((b-a)%(c)==0):\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\nelif(b<a):\r\n if(c<0):\r\n if((b-a)%(c)==0):\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()", "a,b,c=map(int,input().split())\r\nif(b-a>0 and c>0):\r\n if(round((b-a)%c)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif(b-a<0 and c<0):\r\n if(round((a-b)%abs(c))):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif(a==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math as m\na,b,c=(map(int,input().split()))\nd=0\nif(c==0):\n\tif a==b:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\nelse:\n\tif c<0:\n\t\td=a-b\n\telse:\n\t\td=b-a\n\tif (d<0) or d%c!=0:\n\t\tprint(\"NO\")\n\telse :\n\t\tprint(\"YES\")", "s=[int(n) for n in input().split()]\r\na=s[0]\r\nd=s[2]\r\nx=s[1]\r\nif d!=0:\r\n\tz=((x-a)/d)+1\r\n\tif z==int(z) and z>0:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tif a==x:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "a, b, c = map(int, input().split())\r\n\r\nif (b > a and c < 0) or (b < a and c > 0) or (b != a and c == 0):\r\n print('NO')\r\nelif b == a and c == 0:\r\n print('YES')\r\nelse:\r\n print('NO' if (b - a) % c else 'YES')", "a,b,c = map(int, input().split())\r\nap = b - a\r\nif(a == b):\r\n print(\"YES\")\r\nelif(c == 0):\r\n print(\"NO\") \r\nelif(ap % c == 0 and ap//c >= 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f(a, b, c):\r\n if c == 0:\r\n return a == b\r\n else:\r\n return (b - a) % c == 0 and (b - a) // c >= 0\r\nprint('YES' if f(*map(int, input().split())) else 'NO')", "#!/usr/bin/env python3\n\ndef s(a):\n if a < 0:\n return -1\n return 1\n\nif __name__ == '__main__':\n a, b, c = map(int, input().split())\n\n\n if c == 0:\n if a == b:\n print('YES')\n else:\n print('NO')\n elif a b and c > 0:\n print('NO')\n else:\n dif = b - a\n if dif % c == 0:\n print('YES')\n else:\n print('NO')\n \n\n", "a,b,c=map(int,input().split())\r\nif(b<a) and (c>0):\r\n\tprint(\"NO\")\r\nelif(b>a) and (c<0):\r\n\tprint(\"NO\")\r\nelif(c==0):\r\n\tif (a==b):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tb=b-a\r\n\tif(b%c==0):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "l=list(map(int,input().split(\" \")))\na=l[0]\nb=l[1]\nc=l[2]\nd=b-a\nif d==0:\n\tprint(\"YES\")\nelif c!=0:\n\tif d%c==0 and d*c>0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tprint(\"NO\")\n\n", "a,b,c=list(map(int,input().split()));print([\"NO\",\"YES\"][(b-a==0)or(((b-a)*c>0)and((b-a)%c==0))])\r\n", "q,w,e=map(int,input().split())\r\na=w-q\r\nif q==w:\r\n print ('YES')\r\nelif e==0:\r\n print('NO')\r\nelif a*e>=0:\r\n if a%e==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a,b,c = map(int, input().split())\nprint(\"YES\" if a == b or c != 0 and (b-a) // c >= 0 and (b-a)%c == 0 else \"NO\")", "[a,b,c] = list(map(int, input().split(\" \")))\nr = a == b or (c != 0 and (b-a)*c > 0 and (b-a)%c == 0)\nprint(\"YES\" if r else \"NO\")\n", "a,b,c = map(float, input().split(\" \"))\r\n\r\nif c == 0:\r\n\tif a == b: print(\"YES\")\r\n\telse: print(\"NO\")\r\nelse:\r\n\tcheck = (b-a)/c+1\r\n\tif check >= 1 and check % 1 == 0: print(\"YES\")\r\n\telse: print(\"NO\")", "x=list(map(int,input().split()))\na=x[0]\nb=x[1]\nc=x[2]\nif c==0:\n\tif a==b:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\t\n\nelse:\n\tif (b-a)%c==0 and (b-a)/c>=0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\t", "a , b , c = [int(x) for x in input().split()]\r\nif c != 0:\r\n num = (b - a)/c\r\n if num == round(num) and round(num) >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "z = input().split()\r\nx = list(map(int, z))\r\na, b, c = x[0], x[1], x[2]\r\n\r\nif a b and c > 0:\r\n print(\"NO\")\r\n exit(0)\r\nif (a != b) and c == 0:\r\n print(\"NO\")\r\n exit(0)\r\nif a == b:\r\n print(\"YES\")\r\n exit(0)\r\nif (b - a) % c == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c=(int(x) for x in input().split())\nprint('YES' if c==0 and a==b or c!=0 and (b-a)%c==0 and (b-a)//c>=0 else 'NO')", "#@author: behradm\n\ndef main():\n a, b, c = list(map(int, input().split()))\n\n if(c == 0):\n if(a == b):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if((c < 0 and b > a) or (c > 0 and b < a)):\n print(\"NO\")\n return 0;\n\n if(a % c == b % c):\n print(\"YES\")\n else:\n print(\"NO\")\n\nif(__name__ == \"__main__\"):\n main()\n", "a,b,c = input().split();\r\na=int(a)\r\nb=int(b);\r\nc=int(c);\r\n\r\nif c==0 :\r\n if a!=b :\r\n print(\"NO\");\r\n else :\r\n print(\"YES\");\r\nelif c<0 :\r\n if b>a:\r\n print(\"NO\");\r\n elif b==a:\r\n print(\"YES\");\r\n elif(a-b)%(-c)!=0:\r\n print(\"NO\")\r\n else :\r\n print(\"YES\");\r\nelse :\r\n if b<a:\r\n print(\"NO\");\r\n elif b==a:\r\n print(\"YES\");\r\n elif(b-a)%(c)!=0:\r\n print(\"NO\")\r\n else :\r\n print(\"YES\");\r\n \r\n", "## a + (n-1)* c\r\n#b-a / c\r\na , b , c = map(int , input().split())\r\nif c == 0 :\r\n if b == a :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelif(b < a and c > 0) or (b > a and c < 0) :\r\n print(\"NO\")\r\nelse :\r\n print(['NO','YES'][(b-a) % c == 0 ])", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print(\"YES\")\r\nelif b>a and c<=0:\r\n print(\"NO\")\r\nelif a>b and c>=0:\r\n print(\"NO\")\r\nelif (b-a)%c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "a, b, c = map(int, input().split(\" \"))\ntry:\n n = (b - a) / c + 1\n if (int(n) == n) and n > 0: print(\"YES\")\n else: print(\"NO\")\nexcept ZeroDivisionError:\n if a == b: print(\"YES\")\n else: print(\"NO\")\n", "def miis():\r\n return map(int, input().split())\r\n\r\na, b, c = miis()\r\nif a == b:\r\n print(\"YES\")\r\nelif c == 0:\r\n print(\"YES\" if b == a else \"NO\")\r\nelse:\r\n print(\"YES\" if (a-b)%c == 0 and (c>0)==(a-b<0) else \"NO\")\r\n", "a,b,c=map(int,input().split())\r\nf=0\r\nif(a==b):\r\n f=1\r\nelif(c==0):\r\n f=0\r\nelif(((b-a)<0 and c>0) or ((b-a)>0 and c<0)):\r\n f=0\r\nelif((b-a)%c==0):\r\n f=1\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b, c = (int(x) for x in input().split())\r\nprint(\"NO\" if (a b and c >= 0) or (c and (b-a) % c) else \"YES\")", "a, b, c = [int(i) for i in input().split()]\r\nif (c != 0 and (b - a) % c == 0 and (b - a)*c >= 0) or (c == 0 and a == b): print('YES')\r\nelse: print('NO')", "a = input().split()\na,b,c = a\na = int(a)\nb = int(b)\nc = int(c)\n\nif not c:\n if a==b:\n print(\"YES\")\n else: \n print(\"NO\")\nelif b%c == a%c and ((b >= a and c > 0) or (b <= a and c < 0)):\n print(\"YES\")\nelse:\n print(\"NO\")", "import math\r\n\r\ndef get_primes(prime_supr):\r\n\r\n is_prime = [0]*2 + [1]*prime_supr\r\n\r\n for i in range(2,int(math.sqrt(prime_supr)) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, prime_supr + 1, i):\r\n is_prime[j] = 0\r\n\r\n return is_prime\r\n\r\nget_int = lambda: map(int, input().split())\r\n\r\na, b, c = get_int()\r\n\r\nif c!=0:\r\n x = (b - a) / c\r\n print(['YES', 'NO'][int(x) != x or x < 0])\r\nelse:\r\n print(['YES', 'NO'][b != a])", "\r\na,b,c=map(int,input().split())\r\nif ((c!=0 and (b-a)*c > 0 and (b-a) % c == 0)) or a == b:print('YES')\r\nelse:print('NO')", "a,b,c = map(int,input().split())\r\nif c==0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = ((b - a)/c)+1\r\n if n<=0 or (n*2//2 != n):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "#true=1 false=0\r\n#675A\r\na,b,c=map(int,input().split())\r\nif c==0:\r\n print(['No','Yes'][a==b])\r\nelse :\r\n print(['No','Yes'][(b-a)//c>=0 and (b-a)%c==0])", "line = input()\r\nlin = list(map(int, line.split()))\r\nflag = 1\r\n\r\ntmp = (lin[1] - lin[0])\r\nif lin[2] == 0:\r\n\tif tmp == 0:\r\n\t\tflag = 0\r\nelif tmp >=0 and lin[2] > 0:\r\n\tflag = tmp %lin[2]\r\nelif tmp<=0 and lin[2] <0:\r\n\tflag = abs(tmp) %abs(lin[2])\r\nif flag == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b,c = map(int,input().split())\r\n\r\nif c != 0:\r\n\trem = (b - a) % c\r\n\tdivisor = (b - a)/c\r\n\tif divisor >= 0 and rem == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\nelse:\r\n\tif a == b:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "import math\r\na,b,c=map(int,input().split())\r\nif c!=0:\r\n val=((b-a)/c)+1\r\n \r\n if math.ceil(val)==math.floor(val) and int(val)>=1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if a==b:\r\n print('YES')\r\n else:\r\n print('NO')", "x=list(map(int, input().split()))\r\na=x[0]\r\nb=x[1]\r\nc=x[2]\r\nif a==b:\r\n print(\"YES\")\r\nelif a>b:\r\n if c>=0:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if d%abs(c)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if c<=0:\r\n print(\"NO\")\r\n else:\r\n d=abs(a-b)\r\n if d%abs(c)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a, b, c = tuple(map(int, input().split()))\r\n\r\nif c == 0:\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n n = (b - a) // c\r\n if n >= 0 and a + n * c == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def algrorythm(a,b,c):\r\n\ttry:\r\n\t\tif (a - b) % c ==0:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\texcept:\r\n\t\tif a == b:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\r\nm = [int(i) for i in input().split()]\r\na,b,c = m[0],m[1],m[2]\r\n\r\nif c >= 0:\r\n\tif b >= a:\r\n\t\talgrorythm(a,b,c)\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tif b <= a:\r\n\t\talgrorythm(a,b,c)\r\n\telse:\r\n\t\tprint('NO')\r\n", "def f(l):\r\n a,b,c = l\r\n if c==0:\r\n return a==b\r\n return (b-a)%c==0 and (b-a)//c>=0\r\n\r\nl = list(map(int,input().split()))\r\nprint('YES' if f(l) else 'NO')\r\n", "a, b, c = map(int, input().split())\r\n\r\nif c:\r\n div, mod = divmod(b - a, c)\r\n print('NO' if mod or div < 0 else 'YES')\r\nelse:\r\n print('YES' if a == b else 'NO')", "a,b,c = map(int, input().split())\r\nif a == b:\r\n print('YES')\r\nelif (b-a)*c > 0 and (b-a)%c == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b,c=map(int,input().split())\r\nt=10**10\r\nif c<0:t*=-1\r\nif c==0:print([\"NO\",\"YES\"][a==b])\r\nelse: print([\"NO\",\"YES\"][b in range(a,t,c)])", "a, b, c = map(int, input().split())\r\n\r\nif a == b: print('YES')\r\nelif c == 0 or b > a and c < 0 or b < a and c > 0: print('NO')\r\nelse:\r\n c = abs(c)\r\n\r\n if (b-a) % c == 0: print('YES')\r\n else: print('NO')\r\n", "import sys\na, b, c = map(int, sys.stdin.readline().split())\nif c == 0:\n if b == a:\n print('YES')\n else:\n print('NO')\nelif (b-a)%c == 0:\n if (b-a)*c >= 0:\n print('YES')\n else:\n print('NO')\nelse:\n print('NO') \n", "def YES():\r\n\tprint('YES')\r\n\texit()\r\n\t\r\ndef NO():\r\n\tprint('NO')\r\n\texit()\r\n\r\na,b,c = [int(x) for x in input().split(' ')]\r\n\r\nd = b - a\r\n\r\nif d == 0: YES()\r\n\r\nif c == 0: NO()\r\n\r\nif (d > 0 and c < 0) or (d < 0 and c > 0): NO()\r\nif d % c == 0: YES()\r\nNO()", "abc = input().split(\" \")\r\na = int(abc[0])\r\nb = int(abc[1])\r\nc = int(abc[2])\r\nif c < 0:\r\n\tif b > a:\r\n\t\tprint(\"NO\")\r\n\telif (b-a)%c == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelif c > 0:\r\n\tif b < a:\r\n\t\tprint(\"NO\")\r\n\telif (b-a)%c == 0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelif c == 0:\r\n\tif b==a:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n", "a,b,c=map(int,input().split())\r\nif b==a:print('YES')\r\nelif b>a:\r\n if c>0:\r\n if (b-a)%c==0:print('YES')\r\n else:print('NO')\r\n else:print('NO')\r\nelse:\r\n if c<0:\r\n if (b-a)%c==0:print('YES')\r\n else:print('NO')\r\n else:print('NO')", "Seq_Element, myNum, incr = [int(x) for x in input().split()]\r\nif incr == 0: print(\"YES\") if Seq_Element == myNum else print(\"NO\")\r\nelif (incr < 0 and Seq_Element < myNum) or (incr > 0 and Seq_Element > myNum):\r\n print(\"NO\")\r\nelse:\r\n if (myNum - Seq_Element)%incr != 0:\r\n print(\"NO\")\r\n else: print(\"YES\")", "a,b,c=map(int, input().split())\r\nif (c==0 and a==b) or (c!=0 and (b-a)%c==0 and (b-a)/c>=0) :\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b, c = map(int, input().strip().split())\nif a == b:\n\tprint('YES')\nelif c == 0:\n\tprint('NO')\nelse:\n\tn = ((b-a)/c)+1\n\tif n == int(n) and n > 0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO') ", "a,b,c=tuple(map(int,input().split()))\r\nif c==0:\r\n print('Yes' if a==b else 'No')\r\nelse:\r\n if b%c==a%c and (b==a or (b-a)//abs(b-a)==c//abs(c)):\r\n print('Yes')\r\n else:\r\n print('No')", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\ndef solve():\r\n\ta,b,c = map(int, input().split())\r\n\tif a == b: return True\r\n\tif not c: return False\r\n\tif a>b and c>0: return False\r\n\tif b>a and c<0: return False\r\n\treturn not (b-a)%c\r\n\r\n\r\nprint(\"NYOE S\"[solve()::2])", "st=[int(i) for i in input().split(\" \")]\r\na=st[0]\r\nb=st[1]\r\nc=st[2]\r\nb=b-a\r\nif c!=0:\r\n if b%c==0 and b//c>=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif b==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c=map(int, input().split())\r\nif a==b or (c!=0 and (b-a)//c>=0 and (b-a)%c==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n" ]

{"inputs": ["1 7 3", "10 10 0", "1 -4 5", "0 60 50", "1 -4 -5", "0 1 0", "10 10 42", "-1000000000 1000000000 -1", "10 16 4", "-1000000000 1000000000 5", "1000000000 -1000000000 5", "1000000000 -1000000000 0", "1000000000 1000000000 0", "115078364 -899474523 -1", "-245436499 416383245 992", "-719636354 536952440 2", "-198350539 963391024 68337739", "-652811055 875986516 1091", "119057893 -516914539 -39748277", "989140430 731276607 -36837689", "677168390 494583489 -985071853", "58090193 777423708 395693923", "479823846 -403424770 -653472589", "-52536829 -132023273 -736287999", "-198893776 740026818 -547885271", "-2 -2 -2", "-2 -2 -1", "-2 -2 0", "-2 -2 1", "-2 -2 2", "-2 -1 -2", "-2 -1 -1", "-2 -1 0", "-2 -1 1", "-2 -1 2", "-2 0 -2", "-2 0 -1", "-2 0 0", "-2 0 1", "-2 0 2", "-2 1 -2", "-2 1 -1", "-2 1 0", "-2 1 1", "-2 1 2", "-2 2 -2", "-2 2 -1", "-2 2 0", "-2 2 1", "-2 2 2", "-1 -2 -2", "-1 -2 -1", "-1 -2 0", "-1 -2 1", "-1 -2 2", "-1 -1 -2", "-1 -1 -1", "-1 -1 0", "-1 -1 1", "-1 -1 2", "-1 0 -2", "-1 0 -1", "-1 0 0", "-1 0 1", "-1 0 2", "-1 1 -2", "-1 1 -1", "-1 1 0", "-1 1 1", "-1 1 2", "-1 2 -2", "-1 2 -1", "-1 2 0", "-1 2 1", "-1 2 2", "0 -2 -2", "0 -2 -1", "0 -2 0", "0 -2 1", "0 -2 2", "0 -1 -2", "0 -1 -1", "0 -1 0", "0 -1 1", "0 -1 2", "0 0 -2", "0 0 -1", "0 0 0", "0 0 1", "0 0 2", "0 1 -2", "0 1 -1", "0 1 0", "0 1 1", "0 1 2", "0 2 -2", "0 2 -1", "0 2 0", "0 2 1", "0 2 2", "1 -2 -2", "1 -2 -1", "1 -2 0", "1 -2 1", "1 -2 2", "1 -1 -2", "1 -1 -1", "1 -1 0", "1 -1 1", "1 -1 2", "1 0 -2", "1 0 -1", "1 0 0", "1 0 1", "1 0 2", "1 1 -2", "1 1 -1", "1 1 0", "1 1 1", "1 1 2", "1 2 -2", "1 2 -1", "1 2 0", "1 2 1", "1 2 2", "2 -2 -2", "2 -2 -1", "2 -2 0", "2 -2 1", "2 -2 2", "2 -1 -2", "2 -1 -1", "2 -1 0", "2 -1 1", "2 -1 2", "2 0 -2", "2 0 -1", "2 0 0", "2 0 1", "2 0 2", "2 1 -2", "2 1 -1", "2 1 0", "2 1 1", "2 1 2", "2 2 -2", "2 2 -1", "2 2 0", "2 2 1", "2 2 2", "-1000000000 1000000000 1", "-1000000000 1000000000 2", "1000000000 -1000000000 -1", "5 2 3", "2 1 -1", "3 2 1", "0 -5 -3", "2 5 5", "0 10 1", "15 5 -5", "2 1 1", "20 10 0", "20 15 5", "1 6 1", "1000000000 0 -1000000000", "1 1 -5", "4 6 1", "-5 -10 -5", "2 0 0", "10 9 -1", "-2 -1 -1", "1 13 3", "2 3 0", "1 1 -1", "5 -10 -5", "5 3 1", "1 1000000000 1", "-1000000000 1000000000 1000000000"], "outputs": ["YES", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

136

cf4fdddf06155690a7e8cf32013d2821

Set of Points

Convexity of a set of points on the plane is the size of the largest subset of points that form a convex polygon. Your task is to build a set of *n* points with the convexity of exactly *m*. Your set of points should not contain three points that lie on a straight line. The single line contains two integers *n* and *m* (3<=≤<=*m*<=≤<=100,<=*m*<=≤<=*n*<=≤<=2*m*). If there is no solution, print "-1". Otherwise, print *n* pairs of integers — the coordinates of points of any set with the convexity of *m*. The coordinates shouldn't exceed 108 in their absolute value. Sample Input 4 3 6 3 6 6 7 4 Sample Output 0 0 3 0 0 3 1 1 -1 10 0 -10 0 10 1 9 1 9 -1 0 -2 176166 6377 709276 539564 654734 174109 910147 434207 790497 366519 606663 21061 859328 886001

[ "n, m = map(int, input().split())\r\n\r\n\r\nif m == 3:\r\n if n >= 5:\r\n print(-1)\r\n exit(0)\r\n print(0, 0)\r\n print(2, 0)\r\n print(1, 1)\r\n if n >= 4:\r\n print(1, 2)\r\n exit(0)\r\n\r\n\r\nfor i in range(m):\r\n print(i, 10**7 + i**2)\r\n\r\nfor i in range(n - m):\r\n print(i, -10**7 - i**2)\r\n" ]

{"inputs": ["4 3", "6 3", "6 6", "7 4", "3 3", "5 3", "4 4", "5 4", "6 4", "8 4", "8 6", "10 5", "5 5", "10 6", "11 7", "16 8", "9 5", "200 100", "199 100", "198 100", "102 100", "101 100", "100 100", "198 99", "197 99", "100 99", "99 99", "50 37", "150 100", "181 95", "100 50", "101 99", "6 5", "7 5", "8 5", "43 24", "49 30", "55 36", "77 39", "80 42"], "outputs": ["0 0\n3 0\n0 3\n1 1", "-1", "10 0\n-10 0\n10 1\n9 1\n9 -1\n0 -2", "176166 6377\n709276 539564\n654734 174109\n910147 434207\n790497 366519\n606663 21061\n859328 886001", "10000000 0\n-4999999 8660254\n-5000000 -8660254", "-1", "0 0\n1 1\n3 1\n4 0", "0 0\n1 1\n3 1\n4 0\n0 3", "0 0\n1 1\n3 1\n4 0\n0 3\n1 2", "0 0\n1 1\n3 1\n4 0\n0 3\n1 2\n3 2\n4 3", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n20000000 0\n12469796 15636628", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704\n-16180338 -11755704\n6180338 -19021130", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n20000000 0\n12469796 15636628\n-4450418 19498558\n-18019376 8677674", "10000000 0\n6234898 7818314\n-2225209 9749279\n-9009688 4338837\n-9009688 -4338837\n-2225209 -9749279\n6234898 -7818314\n20000000 0\n12469796 15636628\n-4450418 19498558\n-18019376 8677674", "10000000 0\n7660444 6427876\n1736481 9848077\n-4999999 8660254\n-9396926 3420201\n-9396926 -3420201\n-5000000 -8660254\n1736481 -9848077\n20000000 0\n15320888 12855752\n3472962 19696154\n-9999998 17320508\n-18793852 6840402\n-18793852 -6840402\n-10000000 -17320508\n3472962 -19696154", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704\n-16180338 -11755704", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n9856159 1690008\n9428774 3331397\n8730141 4876949\n7780357 6282199\n6606747 7506723\n5243072 8515291\n3728564 9278890\n2106792 9775552\n424412 9990989\n-1270178 9919004\n-2928227 9561667\n-4502037 8929258\n-5946331 8039971\n-7219560 6919388\n-8285096 5599747\n-9112284 4119012\n-9677329 2519780\n-9963974 848059\n-9963974 -848059\n-9677329 -2519780\n-9112284 -4119012\n-8285096 -5599747\n-7219560 -6919388\n-5946331 -8039971\n-4502037 -8929258\n-2928227 -9561667\n-1270178 -9919004\n424412 -9990989\n...", "10000000 0\n9980655 621696\n9922698 1240987\n9826352 1855477\n9691989 2462789\n9520131 3060572\n9311440 3646515\n9066726 4218350\n8786934 4773865\n8473147 5310911\n8126579 5827410\n7748571 6321364\n7340585 6790862\n6904200 7234087\n6441104 7649325\n5953088 8034969\n5442041 8389528\n4909940 8711629\n4358844 9000026\n3790884 9253604\n3208257 9471382\n2613219 9652517\n2008070 9796308\n1395153 9902199\n776838 9969780\n155518 9998790\n-466403 9989117\n-1086521 9940798\n-1702435 9854020\n-2311763 9729118\n-29121...", "10000000 0\n9978136 660905\n9912640 1318921\n9803799 1971170\n9652089 2614799\n9458172 3246994\n9222897 3864991\n8947293 4466088\n8632564 5047655\n8280088 5607150\n7891405 6142127\n7468214 6650245\n7012367 7129284\n6525857 7577148\n6010811 7991879\n5469481 8371664\n4904235 8714842\n4317543 9019912\n3711972 9285540\n3090169 9510565\n2454854 9694002\n1808805 9835050\n1154846 9933092\n495837 9987699\n-165339 9998633\n-825793 9965844\n-1482636 9889478\n-2132996 9769868\n-2774029 9607536\n-3402931 9403193\n-401...", "10000000 0\n9924205 1228882\n9697969 2439137\n9324722 3612416\n8810121 4730935\n8161969 5777738\n7390089 6736956\n6506183 7594049\n5523649 8336023\n4457383 8951632\n3323547 9431544\n2139330 9768483\n922683 9957341\n-307950 9995257\n-1533916 9881654\n-2736629 9618256\n-3897858 9209055\n-4999999 8660254\n-6026346 7980172\n-6961339 7179119\n-7790805 6269238\n-8502171 5264321\n-9084652 4179603\n-9529420 3031526\n-9829730 1837495\n-9981033 615609\n-9981033 -615609\n-9829730 -1837495\n-9529420 -3031526\n-9084652...", "10000000 0\n9979866 634239\n9919548 1265924\n9819286 1892512\n9679487 2511479\n9500711 3120334\n9283679 3716624\n9029265 4297949\n8738493 4861967\n8412535 5406408\n8052702 5929079\n7660444 6427876\n7237340 6900790\n6785094 7345917\n6305526 7761464\n5800569 8145759\n5272254 8497254\n4722710 8814533\n4154150 9096319\n3568862 9341478\n2969203 9549022\n2357589 9718115\n1736481 9848077\n1108381 9938384\n475819 9988673\n-158659 9998741\n-792499 9968547\n-1423148 9898214\n-2048066 9788024\n-2664738 9638421\n-3270...", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130", "10000000 0\n3090169 9510565\n-8090169 5877852\n-8090169 -5877852\n3090169 -9510565\n20000000 0\n6180338 19021130\n-16180338 11755704", "10000000 0\n9685831 2486898\n8763066 4817536\n7289686 6845471\n5358267 8443279\n3090169 9510565\n627905 9980267\n-1873813 9822872\n-4257792 9048270\n-6374239 7705132\n-8090169 5877852\n-9297764 3681245\n-9921147 1253332\n-9921147 -1253332\n-9297764 -3681245\n-8090169 -5877852\n-6374239 -7705132\n-4257792 -9048270\n-1873813 -9822872\n627905 -9980267\n3090169 -9510565\n5358267 -8443279\n7289686 -6845471\n8763066 -4817536\n20000000 0\n19371662 4973796\n17526132 9635072\n14579372 13690942\n10716534 16886558\n6...", "10000000 0\n9795299 2012985\n9189578 3943558\n8207634 5712682\n6889669 7247927\n5289640 8486442\n3473052 9377521\n1514277 9884683\n-506491 9987165\n-2506525 9680771\n-4403941 8978045\n-6121059 7907757\n-7587581 6513724\n-8743466 4853019\n-9541392 2993631\n-9948693 1011683\n-9948693 -1011683\n-9541392 -2993631\n-8743466 -4853019\n-7587581 -6513724\n-6121059 -7907757\n-4403941 -8978045\n-2506525 -9680771\n-506491 -9987165\n1514277 -9884683\n3473052 -9377521\n5289640 -8486442\n6889669 -7247927\n8207634 -57126...", "10000000 0\n9856159 1690008\n9428774 3331397\n8730141 4876949\n7780357 6282199\n6606747 7506723\n5243072 8515291\n3728564 9278890\n2106792 9775552\n424412 9990989\n-1270178 9919004\n-2928227 9561667\n-4502037 8929258\n-5946331 8039971\n-7219560 6919388\n-8285096 5599747\n-9112284 4119012\n-9677329 2519780\n-9963974 848059\n-9963974 -848059\n-9677329 -2519780\n-9112284 -4119012\n-8285096 -5599747\n-7219560 -6919388\n-5946331 -8039971\n-4502037 -8929258\n-2928227 -9561667\n-1270178 -9919004\n424412 -9990989\n...", "10000000 0\n9870502 1604112\n9485364 3166679\n8854560 4647231\n7994427 6007422\n6927243 7212024\n5680647 8229838\n4286925 9034504\n2782174 9605181\n1205366 9927088\n-402659 9991889\n-2000256 9797906\n-3546048 9350162\n-4999999 8660254\n-6324453 7746049\n-7485107 6631226\n-8451900 5344658\n-9199794 3919666\n-9709418 2393156\n-9967573 804665\n-9967573 -804665\n-9709418 -2393156\n-9199794 -3919666\n-8451900 -5344658\n-7485107 -6631226\n-6324453 -7746049\n-5000000 -8660254\n-3546048 -9350162\n-2000256 -9797906...", "10000000 0\n9893433 1456011\n9576005 2880990\n9054482 4244566\n8339978 5517677\n7447721 6673188\n6396730 7686471\n5209403 8535930\n3911047 9203461\n2529333 9674836\n1093712 9940009\n-365220 9993328\n-1816368 9833656\n-3228804 9464397\n-4572423 8893421\n-5818589 8132897\n-6940741 7199034\n-7914964 6111737\n-8720494 4894178\n-9340161 3572308\n-9760758 2174301\n-9973322 729953\n-9973322 -729953\n-9760758 -2174301\n-9340161 -3572308\n-8720494 -4894178\n-7914964 -6111737\n-6940741 -7199034\n-5818589 -8132897\n-..."]}

UNKNOWN

PYTHON3

CODEFORCES

1

cf61c7272e1736a69a692641b0e542a9

Okabe and Future Gadget Laboratory

Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is represented as an *n* by *n* square grid of integers. A good lab is defined as a lab in which every number not equal to 1 can be expressed as the sum of a number in the same row and a number in the same column. In other words, for every *x*,<=*y* such that 1<=≤<=*x*,<=*y*<=≤<=*n* and *a**x*,<=*y*<=≠<=1, there should exist two indices *s* and *t* so that *a**x*,<=*y*<==<=*a**x*,<=*s*<=+<=*a**t*,<=*y*, where *a**i*,<=*j* denotes the integer in *i*-th row and *j*-th column. Help Okabe determine whether a given lab is good! The first line of input contains the integer *n* (1<=≤<=*n*<=≤<=50) — the size of the lab. The next *n* lines contain *n* space-separated integers denoting a row of the grid. The *j*-th integer in the *i*-th row is *a**i*,<=*j* (1<=≤<=*a**i*,<=*j*<=≤<=105). Print "Yes" if the given lab is good and "No" otherwise. You can output each letter in upper or lower case. Sample Input 3 1 1 2 2 3 1 6 4 1 3 1 5 2 1 1 1 1 2 3 Sample Output Yes No

[ "n=int(input())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nflag=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if( l[i][j]==1 )or any(l[i][j]-l[x][j] in l[i] for x in range(n)):\r\n continue\r\n else:\r\n print('No')\r\n flag=1\r\n break\r\n if(flag==1):\r\n break\r\nelse:\r\n print('Yes') \r\n ", "n=int(input())\na=[list(map(int,input().split())) for i in range(n)]\nfor i in range(n):\n\tfor j in range(n):\n\t\tflag=0\n\t\tif(a[i][j]==1):\n\t\t\tcontinue\n\t\tfor k in range(n):\n\t\t\tfor kk in range(n):\n\t\t\t\tif(a[i][k]+a[kk][j]==a[i][j]):\n\t\t\t\t\tflag=1\n\t\t\t\t\tbreak\n\t\t\tif flag:\n\t\t\t break\n\t\tif not flag:\n\t\t print(\"No\")\n\t\t exit(0)\nprint(\"Yes\")\n", "from typing import Counter\r\n\r\n\r\nn = int(input())\r\na = []\r\nrc = []\r\ncc = [Counter() for _ in range(n)]\r\nrg = range(n)\r\n\r\nfor _ in rg:\r\n l = [int(x) for x in input().split()]\r\n c = Counter(l)\r\n rc.append(c)\r\n for i in rg:\r\n cc[i][l[i]] += 1\r\n a.append(l)\r\n\r\nbn = n - 1\r\n\r\ngood = True\r\n\r\nfor r in rg:\r\n for c in rg:\r\n val = a[r][c]\r\n if val != 1:\r\n rc[r][val] -= 1\r\n cc[c][val] -= 1\r\n brk = False\r\n looking = True\r\n for k, v in rc[r].items():\r\n if v != 0:\r\n for kk, vv in cc[c].items():\r\n if vv != 0:\r\n if k + kk == val:\r\n looking = False\r\n brk = True\r\n break\r\n if brk:\r\n break\r\n if looking:\r\n good = False\r\n break\r\n rc[r][val] += 1\r\n cc[c][val] += 1\r\n if not good:\r\n break\r\n\r\nif good:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\nn=int(input())\r\n\r\na=[0]*50\r\n\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n fl=0\r\n for k in range(n):\r\n for t in range(n):\r\n if a[i][j]==a[i][k]+a[t][j]:\r\n fl=1\r\n\r\n if fl==0:\r\n print(\"No\")\r\n quit()\r\n\r\nprint(\"Yes\")\r\n\r\n", "n = int(input().split()[0])\ntab = [[] for _ in range(n)]\nfor i in range(n):\n for inp in input().rstrip().split():\n tab[i].append(int(inp))\n\ntabt = list(map(list,zip(*tab)))\ncnt = 0\nfor i, line in enumerate(tab):\n for j, column in enumerate(tabt):\n for a in line:\n for b in column:\n if tab[i][j] == 1 or tab[i][j] == a + b:\n cnt += 1\n break\n else:\n continue\n break\n\nif cnt == n*n:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\na = [[int(j) for j in input().split(' ')] for i in range(n)]\n\ndef check(a,n):\n for i in range(len(a)):\n for j in range(len(a)):\n v = a[i][j]\n if v == 1:\n continue\n s = [a[i][x] + a[y][j] for x in range(n) for y in range(n)]\n if v not in s:\n return False\n return True\n\n# check(a,n)\nprint('Yes' if check(a, n) else 'No')\n", "n = int(input())\r\n\r\nlab = []\r\n\r\n\r\ndef is_valid_cell(i,j):\r\n row = lab[i]\r\n column = [lab[i][j] - lab[x][j] for x in range(n)]\r\n for each in column:\r\n if each in row:\r\n return True\r\n return False\r\n\r\nfor i in range(n):\r\n line = [int(x) for x in input().split(' ')]\r\n lab.append(line)\r\n\r\nresult = 'YES'\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (lab[i][j] != 1):\r\n if (not is_valid_cell(i,j)):\r\n result = 'NO'\r\n break\r\n else:\r\n continue\r\n break\r\n\r\nprint(result)", "from itertools import product\r\n\r\nn = int(input())\r\nA = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nfor i,j in product(range(n), repeat=2):\r\n if A[i][j] > 1 and all(A[i][k]+A[m][j]!=A[i][j]\r\n for k,m in product(range(n), repeat=2)):\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "#!/bin/python3\nimport sys\nimport time\nimport heapq\nimport collections\nfrom io import StringIO\n\ntest_cases = [\n (\"\"\"\n3\n1 1 2\n2 3 1\n6 4 1\n\"\"\", \"\"\"\nYes\n\"\"\"),\n (\"\"\"\n3\n1 5 2\n1 1 1\n1 2 3\n\"\"\", \"\"\"\nNo\n\"\"\"),\n]\n\n\ndef solve():\n return \"TEST\"\n\n\ndef debug(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\ndef check(rows, cols):\n for i, row in enumerate(rows):\n for j, el in enumerate(row):\n if el != 1:\n found = False\n for k, add_in_row in enumerate(row):\n add_in_col = el - add_in_row\n n = cols[j].get(add_in_col, 0)\n if k != j and (n > 0 and add_in_col != el or n > 1 and add_in_col == el):\n found = True\n break\n if not found:\n return False\n return True\n\n\ndef main():\n n = int(input())\n rows = []\n cols = []\n for i in range(n):\n rows.append([int(el) for el in input().split()])\n for i in range(n):\n # cols.append([row[i] for row in rows])\n d = {}\n for row in rows:\n d[row[i]] = d.get(row[i], 0) + 1\n cols.append(d)\n result = check(rows, cols)\n print('Yes' if result else 'No')\n\n\ndef test(s, check):\n s = s.strip()\n check = check.strip()\n sys.stdin = StringIO(s)\n sys.stdout = out = StringIO()\n start_time = time.time()\n try:\n main()\n finally:\n exec_time = time.time() - start_time\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n out.seek(0)\n result = out.read().strip()\n status = \"SUCCESS\" if result == check else \"FAILURE\"\n message = \"status: {}, exec_time: {:.3f}\".format(status, exec_time)\n debug(message)\n\n\ndef test_all():\n for s, check in test_cases:\n test(s, check)\n\n\nif __name__ == '__main__':\n if len(sys.argv) > 1 and sys.argv[1] == '-t':\n test_all()\n else:\n main()\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\ndef check(i, j):\n for r in range(n):\n for c in range(n):\n if a[i][c] + a[r][j] == a[i][j]:\n return 1\n return 0\nn = int(input())\na = [[] for _ in range(n)]\nfor i in range(n):\n a[i] = list(rint())\n\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1:\n continue\n if check(i,j) == 0:\n print(\"No\")\n exit()\n\nprint(\"Yes\")\n\n\n\n", "def test(a):\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == 1:\r\n continue\r\n flag = 0\r\n for k in range(len(a[i])):\r\n if (a[i][j]-a[k][j]) in a[i]:\r\n flag = 1\r\n break\r\n if flag == 0:\r\n return \"No\"\r\n return \"Yes\"\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list()\r\n for _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n print(test(a))\r\n", "\r\n\r\n\r\n\r\nt=[]\r\n\r\ns=[]\r\na=int(input())\r\nfor k in range(a):\r\n t.append(list(map(int,input().split())))\r\n\r\n\r\nfor j in range(a):\r\n p=[]\r\n for y in range(a):\r\n p.append(t[y][j])\r\n\r\n s.append(p)\r\n\r\n\r\nh=0\r\nfor b in range(a):\r\n for c in range(a):\r\n if t[b][c]!=1:\r\n z=0\r\n l=t[b][c]\r\n for v in range(1,l):\r\n if v in t[b]:\r\n if l-v in s[c]:\r\n z+=1\r\n \r\n if v in s[c]:\r\n if l-v in t[b]:\r\n z+=1\r\n if z==0:\r\n print('No')\r\n h+=1\r\n break\r\n if h>0:\r\n break\r\n if h>0:\r\n break\r\n\r\nif h==0:\r\n print('Yes')\r\n", "import re\r\nimport sys\r\nimport math\r\nimport string\r\n\r\n\r\nt=int(input())\r\nl=[]\r\ni=1\r\nwhile i<=t:\r\n g=list(map(int,input().strip().split(\" \")))\r\n l.append(g)\r\n i=i+1\r\n \r\ni=0\r\nwhile i<t:\r\n j=0\r\n while j<t:\r\n a=l[i][j]\r\n k=0\r\n f=1\r\n if a!=1:\r\n while k<t:\r\n if a-l[k][j]>0 and (a-l[k][j]) in l[i]:\r\n f=1\r\n break\r\n k=k+1\r\n else:\r\n f=2\r\n break\r\n j=j+1\r\n if f==2:\r\n break\r\n i=i+1\r\n\r\nif f==1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n = int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\n# print(l)\r\na,b= 0,0\r\nfor i in range(len(l)):\r\n\tfor j in range(len(l)):\r\n\t\tif l[i][j] != 1:\r\n\t\t\ta += 1\r\n\t\t\tfor k in range(len(l)):\r\n\t\t\t\tflag = 0\r\n\t\t\t\tfor m in range(len(l)):\r\n\t\t\t\t\tif l[i][k] == l[i][j] or l[m][j] == l[i][j]:\r\n\t\t\t\t\t\tcontinue\r\n\t\t\t\t\tif l[i][k]+l[m][j] == l[i][j]:\r\n\t\t\t\t\t\tb+=1\r\n\t\t\t\t\t\tflag = 1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag == 1:\r\n\t\t\t\t\tbreak\r\n# print(a,b)\r\nif a == b:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n x.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]!=1:\r\n r=0\r\n for k in range(n):\r\n for l in range(n):\r\n if x[i][k]+x[l][j]==x[i][j]:\r\n r=1\r\n if r==0:\r\n print('No')\r\n exit()\r\nprint(\"Yes\")\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a+=[list(map(int,input().split()))]\r\nfor i in range(n):\r\n for j in range(n):\r\n b=a[i][j]\r\n if b!=1:\r\n for k in range(n):\r\n if b-a[k][j] in a[i]:\r\n b=0\r\n break\r\n if b:\r\n print('No')\r\n quit()\r\nprint('Yes')\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　（´<_｀）　 Welcome to My Coding Space !\r\n# 　　　　（ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　＿_(__ﾆつ/　＿/ .| .|＿＿＿＿\r\n# 　　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？\r\n# BINARY SEARCH ?\r\n# CHANGE TO GRAPH?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\ngrid = M(n)\r\ntag = False\r\nfor i in r(n):\r\n for j in r(n):\r\n if grid[i][j] != 1:\r\n tt = False\r\n for k in r(n):\r\n for l in r(n):\r\n if grid[i][k] + grid[l][j] == grid[i][j]:\r\n tt = True\r\n break\r\n if tt:\r\n break\r\n if not tt:\r\n pb(0)\r\n exit(0)\r\npb(1)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tc=0\r\n\t\tif a[i][j]==1:\r\n\t\t\tcontinue\r\n\t\tfor k in range(n):\r\n\t\t\tfor l in range(n):\r\n\t\t\t\tif a[i][j]==a[i][k]+a[l][j]:\r\n\t\t\t\t\tc=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif c:\r\n\t\t\t\tbreak\r\n\t\tif not c:\r\n\t\t\tprint('No')\r\n\t\t\texit(0)\r\nprint('Yes')\r\n\t\t\t\t\t ", "n = int(input().strip())\na = [[int(num) for num in input().strip().split()] for _ in range(n)]\n\nans = 'Yes'\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1: continue\n found = False\n for k in range(n):\n for l in range(n):\n if a[i][l] + a[k][j] == a[i][j]:\n found = True\n break\n if found: break\n if not found:\n ans = 'No'\n break\n if ans == 'No': break\nprint(ans)\n", "n= int(input())\na=[]\no=True\nfor _ in range(n):\n a+=[[int(f)for f in input().split()]]\nfor x in range(n):\n for y in range(n):\n s=False\n tr=list(range(n))\n tc=list(range(n))\n tr.remove(x)\n tc.remove(y)\n if a[x][y]!=1:\n for r in tr:\n for c in tc:\n if a[r][y]+a[x][c]==a[x][y]:\n s=True\n else:\n s=True\n if s==False:\n print('NO')\n exit()\nprint('YES')\n", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn = I()\r\ngrid = [IL() for i in range(n)]\r\nans = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j]==1:\r\n continue\r\n set1 = set([grid[i][j] - grid[ii][j] for ii in range(n)])\r\n set2 = set([grid[i][jj] for jj in range(n)])\r\n if len(set1.intersection(set2)) == 0:\r\n ans = False\r\n\r\nprint(\"Yes\" if ans else \"No\")", "if __name__ == \"__main__\":\n\tn = int(input())\n\tarr =[]\n\tfor i in range(n):\n\t\tli = list(map(int,input().split()))\n\t\tarr.append(li)\n\ttc = 0\n\tvc = 0\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif arr[i][j]>1:\n\t\t\t\ttc+=1\n\t\t\t\tfor k in range(n):\n\t\t\t\t\tdiff = arr[i][j]-arr[k][j]\n\t\t\t\t\tif diff in arr[i]:\n\t\t\t\t\t\tvc+=1\n\t\t\t\t\t\tbreak\n\tif tc==vc:\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")\n", "import sys\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef write(a):\r\n sys.stdout.write(a)\r\ndef check(a, n, i, j):\r\n s = a[i][j]\r\n x = []\r\n y = []\r\n for ix in range(n):\r\n if ix != i:\r\n y += [a[ix][j]]\r\n for jx in range(n):\r\n if jx != j:\r\n x += [a[i][jx]]\r\n for i in x:\r\n for j in y:\r\n if i + j == s:\r\n return True\r\n return False\r\ndef solve(a, n):\r\n for i in range(n):\r\n for j in range(n):\r\n if(a[i][j] != 1):\r\n if not(check(a, n, i, j)):\r\n return \"No\"\r\n return \"Yes\"\r\ndef main():\r\n n = int(input())\r\n a = [[int(j) for j in read().split()] for i in range(n)]\r\n print(solve(a, n))\r\nmain()\r\n", "w = [list(map(int, input().split())) for _ in range(int(input()))]\r\ns = list(map(set, zip(*w)))\r\nr = True\r\n\r\nfor i in w:\r\n r &= all(a < 2 or any(a - c in b for c in i) for a, b in zip(i, s))\r\nprint(\"NO\" if r == 0 else \"YES\")", "n=int(input())\r\na=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i][j]!=1):\r\n f=0\r\n no=a[i][j]\r\n for k in range(n):\r\n for l in range(n):\r\n if(no==a[i][k]+a[l][j]):\r\n f=1\r\n if(f==0):\r\n print(\"No\")\r\n quit()\r\nprint(\"Yes\")\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor x in range(n):\r\n for y in range(n):\r\n if a[x][y]==1: continue\r\n ans=\"No\"\r\n for s in range(n):\r\n for t in range(n):\r\n if a[x][y]==a[x][s]+a[t][y]:\r\n ans=\"Yes\"\r\n break\r\n if ans==\"Yes\":break\r\n if ans==\"No\":\r\n print(ans)\r\n exit(0)\r\nprint(\"Yes\")\r\n", "#!/usr/bin/env python3\n\ndef solve():\n n = get(int)\n lab = [get([int]) for i in range(n)]\n labT = list(zip(*lab))\n for r, row in enumerate(lab):\n for c, elem in enumerate(row):\n if elem == 1: continue\n col = labT[c]\n good = False\n for a in row[:c] + row[c+1:]:\n for b in col[:r] + col[r+1:]:\n if a+b == elem:\n good = True\n break\n if not good:\n return 'NO'\n\n return 'YES'\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n3\n1 1 2\n2 3 1\n6 4 1\n\nYES\n\n3\n1 5 2\n1 1 1\n1 2 3\n\nNO\n\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nimport re\nimport sys\nimport math\nimport heapq\nfrom heapq import heapify, heappop, heappush\nimport bisect\nimport string\nfrom bisect import bisect_left, bisect_right\nimport operator\nfrom operator import itemgetter, attrgetter\nimport itertools\nimport collections\n\ninf = float('inf')\nsys.setrecursionlimit(10000)\n\n\ndef tree():\n return collections.defaultdict(tree)\n\n\ndef cache(func): # Decorator for memoizing a function\n cache_dict = {}\n\n def _cached_func(*args, _get_cache=False):\n if _get_cache:\n return cache_dict\n if args in cache_dict:\n return cache_dict[args]\n cache_dict[args] = func(*args)\n return cache_dict[args]\n return _cached_func\n\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\narr=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(arr[i][j]!=1):\r\n\t\t\tv=0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor f in range(n):\r\n\t\t\t\t\tif(arr[i][j]==arr[i][k]+arr[f][j]):\r\n\t\t\t\t\t\tv+=1\r\n\t\t\tif(v==0):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint(\"Yes\")", "#def proverka(b, k, m, p):\r\n# for i in range()\r\n\r\nn = int(input()) \r\na = []\r\nfor i in range(n):\r\n a.append([int(j) for j in input().split()])\r\nflag = \"Yes\" \r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i][j] != 1):\r\n f = False\r\n for k in range(n):\r\n if(f):\r\n break\r\n for z in range(n):\r\n if(a[k][j] + a[i][z] == a[i][j]):\r\n f = True\r\n if(f):\r\n break\r\n if(not(f)):\r\n flag = \"No\"\r\n\r\nprint(flag)", "# IAWT\r\nn = int(input())\r\nl = [list(map(int, input().split())) for i in range(n)]\r\nc = []\r\nfor i in range(n):\r\n cul = []\r\n for u in range(n):\r\n cul.append(l[u][i])\r\n c.append(cul)\r\n\r\ndef is_good(i, j):\r\n if l[i][j] == 1: return True\r\n row = l[i][:j] + l[i][j+1:]\r\n cul = c[j][:i] + c[j][i+1:]\r\n for a in row:\r\n if (l[i][j] - a) in cul:\r\n return True\r\n return False\r\n\r\ndef f():\r\n for i in range(n):\r\n for j in range(n):\r\n if not is_good(i, j):\r\n print('No')\r\n return\r\n print('Yes')\r\n\r\nf()\r\n\r\n", "n, s = int(input()), 'Yes'\r\na = [list(map(int, input().split(' '))) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n f = False\r\n for x in range(n):\r\n for y in range(n):\r\n if a[i][j] == a[i][y] + a[x][j]:\r\n f = True\r\n if not f:\r\n s = 'No'\r\nprint(s)\r\n", "n = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data += [list(map(int, input().split()))]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] == 1:\r\n t = True\r\n continue\r\n t = False\r\n for k in range(n):\r\n for m in range(n):\r\n if data[i][k] + data[m][j] == data[i][j]:\r\n t = True\r\n break\r\n if not t:\r\n print(\"No\")\r\n break\r\n if not t:\r\n break\r\nif t:\r\n print(\"Yes\")\r\n", "n=int(input())\r\nl,d,f=[],0,0\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif l[i][j]>1:\r\n\t\t\tflag=0\r\n\t\t\td+=1\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor p in range(n):\r\n\t\t\t\t\tif l[i][p]+l[k][j]==l[i][j]:\r\n\t\t\t\t\t\tf+=1\r\n\t\t\t\t\t\tflag=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag==1:break\r\nprint(['NO','YES'][d==f])", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append([int(j) for j in input().split()])\r\n\r\ndef isThere(i,j,n):\r\n for x in range(n):\r\n for y in range(n):\r\n if (arr[x][j] + arr[i][y]) == arr[i][j]:\r\n return True\r\n return False\r\n\r\nanswer = \"Yes\"\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if not arr[i][j] == 1:\r\n if not isThere(i,j,n):\r\n answer = \"No\"\r\n\r\nprint(answer)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\ncheck1=1\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n check=1\r\n for k in range(n):\r\n for t in range(n):\r\n if a[i][t]+a[k][j]==a[i][j]:\r\n check=0\r\n if check==1:\r\n check1=0\r\n break\r\nif check1==0:\r\n print('No')\r\nelse:\r\n print('Yes')", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = [int(i) for i in input().split()]\r\n a.append(b)\r\ncan = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n for k in range(n):\r\n if a[i][j] - a[k][j] in a[i]:\r\n break\r\n else:\r\n can = False\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nt=[];flag=True\r\nfor i in range(n):\r\n t.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if t[i][j]==1:\r\n continue\r\n else:\r\n p=False\r\n for x in range(n):\r\n if p:break\r\n for y in range(n):\r\n if x!=j and y!=i:\r\n if t[y][j]+t[i][x]==t[i][j]:\r\n p=True\r\n break\r\n if p:break\r\n else:\r\n flag=False\r\nif flag:print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\n\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef good_num(i, j):\r\n for r in range(n):\r\n if r != j:\r\n for c in range(n):\r\n if c != i:\r\n if arr[i][j] == arr[i][r] + arr[c][j]:\r\n return True\r\n\r\n return False\r\n\r\n\r\nflag = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == 1:\r\n continue\r\n if not good_num(i, j):\r\n flag = True\r\n print('No')\r\n break\r\n if flag:\r\n break\r\n\r\nif not flag:\r\n print('Yes')\r\n\r\n\r\n\r\n\r\n", "# Codeforces Round #420 (Div. 2)\r\n# 821A\r\nn = int(input())\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n grid.append(list(map(int, input().split())))\r\n\r\ngood = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 1:\r\n continue\r\n else:\r\n foundSum = False\r\n for s in range(n):\r\n for t in range(n):\r\n if grid[i][s]+grid[t][j] == grid[i][j]:\r\n foundSum = True\r\n break\r\n if foundSum:\r\n break\r\n if not foundSum:\r\n good = False\r\n if not good:\r\n break\r\n if not good:\r\n break\r\n \r\nif good:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n n=I()\n l=[LI() for _ in range(n)]\n\n for i in range(n):\n for j in range(n):\n x=l[i][j]\n if x==1:\n continue\n d={}\n for k in range(n):\n if k!=j:\n d[l[i][k]]=l[i][k]\n f=False\n # print(d)\n for k in range(n):\n if k!=i:\n if x-l[k][j] in d:\n f=True\n if not f:\n return 'No'\n\n return 'Yes'\n\n# main()\nprint(main())\n", "sets=[]\n\nn = int(input())\n\nArr = [[0 for j in range(n)] for i in range(n)]\n\nfor i in range(n):\n s = input().split()\n c = set()\n for j in range(n):\n a=int(s[j])\n Arr[i][j]=a\n c.add(a)\n sets.append(c)\n\ndef check_arr():\n for i in range(n):\n for j in range(n):\n if Arr[i][j]==1:\n continue\n if not check_row(i,j):\n return False\n return True\n\n\n\ndef check_row(i,j):\n a = Arr[i][j]\n for k in range(n):\n if k == i:\n continue\n if ((a - Arr[k][j]) in sets[i]):\n return True\n return False\n\nif (check_arr()):\n print(\"Yes\")\nelse:\n print(\"No\")", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\ndef check(a,n,x,y):\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if a[x][y]!=a[x][i] and a[x][y]!=a[j][y]:\r\n if a[x][y] == a[x][i] + a[j][y]:\r\n return True\r\n return False\r\n # print()\r\n\r\n#write your code here\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n inp = input()\r\n inp = inp.split(\" \")\r\n inp = [ int(x) for x in inp]\r\n a.append(inp);\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n if a[x][y] != 1:\r\n if check(a,n,x,y) ==False:\r\n print(\"No\")\r\n exit();\r\n\r\nprint(\"Yes\")\r\n\r\n\r\n \r\n\r\nif(path.exists('input.txt')):\r\n sys.stdin.close()\r\n sys.stdout.close()", "def int_input():\r\n return map(int, input().split())\r\n\r\n\r\nn = int(input())\r\nmatr = [list(int_input()) for i in range(n)]\r\n\r\ngood = True\r\nfor row in range(n):\r\n nums = set(matr[row])\r\n for col in range(n):\r\n num = matr[row][col]\r\n if num == 1:\r\n continue\r\n cur_good = False\r\n for i in range(n):\r\n cur_good |= num - matr[i][col] in nums\r\n good &= cur_good\r\n\r\nprint('Yes' if good else 'No')\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef solve(A):\r\n n = len(A)\r\n for i in range(n):\r\n for j in range(n):\r\n if A[i][j] != 1:\r\n flag = False\r\n for k in range(n):\r\n for l in range(n):\r\n if A[i][k] + A[l][j] == A[i][j]:\r\n flag = True\r\n if flag == False:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(list(map(int, input().split())))\r\n if solve(A):\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n n = int(inp[0])\r\n l1 = [[int(i) for i in j.split()] for j in inp[1:]]\r\n l2 = list(zip(*l1))\r\n for i in range(n):\r\n for j in range(n):\r\n if l1[i][j] != 1:\r\n if all(l1[i][j] - t not in l2[j][:i] + l2[j][i+1:] for t in l1[i][:j] + l1[i][j+1:]):\r\n return 'No'\r\n return 'Yes'\r\n\r\nprint(main())\r\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n mat = []\r\n for i in range(n):\r\n mat.append(list(map(int, stdin.readline().split())))\r\n for i in range(n):\r\n for j in range(n):\r\n st = True\r\n for u in range(n):\r\n for k in range(n):\r\n if mat[i][j] == 1 or mat[i][j] == mat[u][j] + mat[i][k]:\r\n st = False\r\n break\r\n if not st: break\r\n if st:\r\n return False\r\n return True\r\n\r\n\r\nprint('Yes' if main() else 'No')\r\n", "n = int(input())\r\ntable = []\r\nfor i in range(n):\r\n table.append([int(x) for x in input().split(' ')])\r\nres = True\r\nfor x in range(n):\r\n for y in range(n):\r\n a = table[x][y]\r\n found = a == 1\r\n for s in range(n):\r\n for t in range(n):\r\n found = found or (table[x][s] + table[t][y] == a)\r\n res = res and found\r\nprint('Yes' if res else 'No')", "n = int(input())\nlaboratory = [[int(number) for number in input().split()] for _ in range(n)]\n\ndef get_row(i):\n return list(laboratory[i])\n\ndef get_col(i):\n return [laboratory[j][i] for j in range(n)]\n\ndef get_except(lst, i):\n return lst[:i] + lst[i+1:]\n\ndef good_lab():\n for i in range(n):\n for j in range(n):\n this_val = laboratory[i][j]\n if this_val != 1:\n row_vals = get_except(get_row(i), j)\n col_vals = get_except(get_col(j), i)\n if not any([this_val - r in col_vals for r in row_vals]):\n return False\n return True\n\nprint(\"Yes\") if good_lab() else print(\"No\")\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl3=list(map(int,input().split()))\r\n\tl.append(l3)\r\ndef f(l,n):\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif l[i][j]!=1:\r\n\t\t\t\tlx=[]\r\n\t\t\t\tfor k in range(n):\r\n\t\t\t\t\tl2=list(map(lambda x: x+l[k][j],l[i]))\r\n\t\t\t\t\tlx.extend(l2)\r\n\t\t\t\tif l[i][j] not in lx:\r\n\t\t\t\t\treturn \"No\"\r\n\treturn \"Yes\"\r\nprint(f(l,n))", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\nok = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n check = False\n for k in range(n):\n for l in range(n):\n if a[i][j] == a[i][k] + a[l][j]:\n check = True\n if check:\n break\n if check:\n break\n ok &= check\nprint(\"Yes\" if ok else \"No\")\n", "from itertools import chain\r\ni=lambda:[*map(int,input().split())]\r\nn=i()[0]\r\na=[i()for _ in[0]*n]\r\nb=[*zip(*a)]\r\nprint('NYOE S'[all(x<2 or any(x==y+z for y in a[i//n] for z in b[i%n]) for i,x in enumerate(chain(*a)))::2])", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n k.append(list(map(int,input().split())))\r\nk1=tuple(zip(*k))\r\nm=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k[i][j]!=1:\r\n g=False\r\n for l in k[i]:\r\n for z in k1[j]:\r\n if l+z==k[i][j]:\r\n m.append(1)\r\n g=True\r\n break\r\n if g:\r\n break\r\n else:\r\n m.append(1)\r\n\r\nif len(m)==n*n:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n \r\n", "n = int(input())\r\nx = []\r\nfor i in range(n):\r\n x.append(list(map(int, input().split())))\r\n\r\nflag1 = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j] != 1:\r\n flag2 = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i or l != j:\r\n if x[k][j] + x[i][l] == x[i][j]:\r\n flag2 = True\r\n break\r\n if flag2:\r\n break\r\n if not flag2:\r\n flag1 = True\r\n print(\"no\")\r\n break\r\n if flag1:\r\n break\r\nif not flag1:\r\n print(\"yes\")\r\n", "n = int(input())\narr = [[int(x) for x in input().split()] for i in range(n)]\n\nres = True\nfor i in range(n):\n for j in range(n):\n if arr[i][j] == 1: continue\n\n val = False\n for a in range(n):\n x = arr[i][a]\n for b in range(n):\n y = arr[b][j]\n\n if x+y == arr[i][j]:\n val = True\n \n if not val:\n res = False\n\nif res: print(\"Yes\")\nelse: print(\"No\")", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n flag = False\r\n if a[i][j] != 1:\r\n for k in range(n):\r\n for l in range(n):\r\n if a[i][j] == a[k][j] + a[i][l]:\r\n ans += 1\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n else:\r\n ans += 1\r\nprint('Yes') if ans == n ** 2 else print('No')\r\n", "n, = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int,input().split())))\r\n\r\nrow=[ set() for _ in range(n)]\r\ncol = [set() for _ in range(n)]\r\n\r\ndata=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n data.append([arr[i][j],i,j])\r\ndata.sort()\r\n\r\nans = \"YES\"\r\nfor v,r,c in data:\r\n if v>1:\r\n for rt in row[r]:\r\n if v-rt in col[c]:\r\n break\r\n else:\r\n ans = \"NO\"\r\n break;\r\n row[r].add(v)\r\n col[c].add(v)\r\n\r\nprint(ans)", "n = int(input())\r\nd = []\r\nfor i in range(n):\r\n\td.append(list(map(int, input().split())))\r\nfl = True\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\te = d[i][j]\r\n\t\tif(e != 1):\r\n\t\t\ta = set()\r\n\t\t\tf = False\r\n\t\t\tfor i1 in range(n):\r\n\t\t\t\tif(i != i1):\r\n\t\t\t\t\ta.add(d[i1][j])\r\n\t\t\tfor j1 in range(n):\r\n\t\t\t\tif(j != j1):\r\n\t\t\t\t\tif(e - d[i][j1] in a):\r\n\t\t\t\t\t\tf = True\r\n\t\telse:\r\n\t\t\tf = True\r\n\t\tfl = f and fl\r\nif(fl):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "a = [list(map(int, input().split())) for i in range(int(input()))]\nn = len(a)\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n found = False\n for i2 in range(n):\n for j2 in range(n):\n if a[i][j] == a[i][j2] + a[i2][j]:\n found = True\n if not found:\n print('No\\n')\n exit()\nprint('Yes')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]==1:\r\n continue\r\n exist=False\r\n for x in range(n):\r\n for y in range(n):\r\n if a[x][j]+a[i][y]==a[i][j]:\r\n exist=True\r\n break\r\n if exist:\r\n break\r\n if not exist:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n", "n = int(input())\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1:\r\n tr = False\r\n for k in range(n):\r\n if a[i][j]-a[i][k] in [a[z][j] for z in range(n)]:\r\n tr = True\r\n break\r\n if not(tr):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n \r\n", "def d4c(lab, n):\r\n for i in range(n):\r\n for j in range(n):\r\n x = lab[i][j]\r\n if x == 1:\r\n continue\r\n f = 0\r\n for k in range(n):\r\n if k != i:\r\n for l in range(n):\r\n if l != j:\r\n if lab[i][l] + lab[k][j] == x:\r\n f = 1\r\n continue\r\n if f != 1:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nn = int(input())\r\nlab = []\r\nfor _ in range(n):\r\n lab.append(list(map(int, input().split())))\r\nprint(d4c(lab, n))", "n = int(input())\r\na = [list(map(int,input().split())) for i in range(n)]\r\nc,g = 0,0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j] !=1:\r\n\t\t\tc+=1\r\n\t\t\tf=0\r\n\t\t\tfor h in range(n):\r\n\t\t\t\tfor k in range(n):\r\n\t\t\t\t\tif a[i][j]==a[i][h]+a[k][j]:\r\n\t\t\t\t\t\tg+=1\r\n\t\t\t\t\t\tf=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif f==1:\r\n\t\t\t\t\tbreak\r\nprint(['No','Yes'][g==c])", "## 1.\r\n\r\nn = int(input())\r\nma = []\r\nans = True\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n ma.append(row)\r\nfor i in range(n):\r\n for j in range(n):\r\n if ma[i][j] != 1:\r\n find = False\r\n d = {}\r\n for x in range(n):\r\n if x != j:\r\n dif = ma[i][j] - ma[i][x]\r\n d[dif] = 1\r\n for x in range(n):\r\n if x != i and ma[x][j] in d:\r\n find = True \r\n if not find:\r\n ans = False\r\nif ans:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\ns = []\nfor k in range(n):\n s.append([int(i) for i in input().split()])\nt = 0\nfor i in range(n):\n for j in range(n):\n l = 0\n if s[i][j] !=1:\n for x in range(n):\n for y in range(n):\n if s[i][x]+ s[y][j] == s[i][j]:\n l = 1\n if not l:\n t = 1\nif t:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n = int(input())\r\nh = [[int(i) for i in input().split()] for j in range(n)]\r\ng = False\r\nfor i in range(len(h)):\r\n for j in range(len(h)):\r\n if h[i][j] != 1:\r\n s = h[i][j]\r\n g = False\r\n for o in range(n):\r\n a = h[i][o]\r\n for p in range(n):\r\n b = h[p][j]\r\n if (a + b) == s:\r\n g = True\r\n break\r\n if g:\r\n break\r\n else:\r\n print(\"No\")\r\n exit()\r\nprint(\"YES\")", "\r\ndef check(i,j):\r\n\tcur = tbl[i][j]\r\n\tif cur==1: return 1\r\n\tgood = 0\r\n\tfor k in range(n):\r\n\t\tif tbl[k][j]>=cur: continue\r\n\t\tfor l in range(n):\r\n\t\t\ttk = tbl[k][j]+tbl[i][l]\r\n\t\t\tif tk==cur:\r\n\t\t\t\tgood = 1\r\n\t\t\t\tbreak\r\n\treturn good\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\ntbl = []\r\nfor i in range(n):\r\n\ttbl.append([int(i) for i in input().split()])\r\n\r\nbr = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tisgood = check(i, j)\r\n\t\tif not isgood:\r\n\t\t\tbr = 1\r\n\t\t\tbreak\r\n\tif br: break\r\nif br:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')\r\n", "'''input\n3\n1 5 2\n1 1 1\n1 2 3\n'''\nn = int(input())\na = [list(map(int, input().split())) for _ in range(n)]\nb = list(zip(*a))\nfor r in range(n):\n\tfor c in range(n):\n\t\tif a[r][c] != 1:\n\t\t\tif not any(a[r][c] - x in list(b[c]) for x in a[r]):\n\t\t\t\tprint(\"NO\")\n\t\t\t\tquit()\nprint(\"YES\")\n", "n=int(input())\r\na = []\r\nfor i in range(n): a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n t=1\r\n for x in range(n):\r\n for y in range(n):\r\n if a[i][x]+a[y][j]==a[i][j]:\r\n t=0\r\n if t:\r\n exit(print('No'))\r\nprint(\"Yes\")", "a=[];n=int(input());c=[];f=0;z1=[];j=-1\r\nfor _ in \" \"*n:\r\n for i in map(int,input().split()):\r\n j+=1;z1+=[i]\r\n if i!=1:c+=[(f,j,i)]\r\n f+=1;a+=[z1];z1=[];j=-1\r\nfor _ in c:\r\n if not(any(a[_[0]][i]+a[j][_[1]]==_[2] for i in range(n) for j in range(n))):print(\"NO\");exit()\r\nprint(\"yes\")", "n = int(input())\r\ngrid = [[int(c) for c in input().split()] for _ in range(n)]\r\n\r\n\r\ndef has_sum(lst, target):\r\n memo = set()\r\n for e in lst:\r\n if e in memo:\r\n return True\r\n else:\r\n memo.add(target-e)\r\n return False\r\n\r\n\r\nfor r in range(n):\r\n for c in range(n):\r\n curr = grid[r][c]\r\n if curr != 1:\r\n row = [grid[r][cc] for cc in range(n) if cc != c]\r\n col = [grid[rr][c] for rr in range(n) if rr != r]\r\n found = False\r\n for rr in row:\r\n if not found:\r\n for cc in col:\r\n if rr + cc == curr:\r\n found = True\r\n break\r\n else:\r\n break\r\n if not found:\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')\r\n", "# cook your dish here\ndef main():\n N=int(input())\n A=[]\n import bisect\n for _ in range(N):\n A+=[list(map(int,input().strip().split(' ')))]\n check=1\n for i in range(N):\n if check==0:\n break\n for j in range(N):\n if check==0:\n break\n if A[i][j]!=1:\n temp=sorted(A[i])\n OK=0\n for k in range(N):\n remain=A[i][j]-A[k][j]\n if remain>0:\n if bisect.bisect_left(temp,remain)!=bisect.bisect_right(temp,remain):\n OK=1\n break\n if OK==0:\n check=0\n break\n\n\n\n if check==0:\n print('No')\n else:\n print('Yes')\nmain()", "n = int(input())\ngrid = [ [int(x) for x in input().split()] for _ in range(n)]\n\n\ndef check(x, y):\n\trow = set(grid[x][:y] + grid[x][y+1:])\n\tfor i in range(n):\n\t\tif i == x:\n\t\t\tcontinue\n\t\tif grid[x][y] - grid[i][y] in row:\n\t\t\treturn True\n\treturn False\n\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif grid[i][j] != 1 and not check(i, j):\n\t\t\tprint(\"NO\")\n\t\t\texit()\nprint(\"YES\")", "m = [list(map(int, input().split())) for _ in range(int(input()))]\r\nt, r = list(map(set, zip(*m))), True\r\nfor row in m:\r\n r &= all(x < 2 or any(x - a in c for a in row) for x, c in zip(row, t))\r\nprint((\"No\", \"Yes\")[r])", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(j) for j in input().split()])\r\nif (n==1 and l[0][0]==1):\r\n print ('Yes')\r\nelif (n==1 and l[0][0]!=1):\r\n print ('No')\r\nelse:\r\n f=0\r\n for i in range(n):\r\n for j in range(n):\r\n flag=0\r\n if (l[i][j]!=1):\r\n for k in range(n):\r\n for m in range(n):\r\n if (k!=j or m!=j):\r\n if (l[i][j]== (l[k][j]+l[i][m])):\r\n flag=1\r\n break\r\n if (flag==1):\r\n break\r\n if (flag==0):\r\n f=1\r\n break\r\n if (f==1):\r\n break\r\n if (f==1):\r\n print ('No')\r\n else:\r\n print ('Yes')\r\n\r\n\r\n", "n=int(input().strip())\r\nmatrix=[]\r\nfor _ in range(n):\r\n matrix.append(list(map(int,input().strip().split())))\r\ndef check(matrix,n):\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]!=1:\r\n found=0\r\n for p in range(0,n):\r\n difference=matrix[i][j]-matrix[i][p]\r\n if found==1:\r\n break\r\n for q in range(n):\r\n if difference==matrix[q][j]:\r\n found=1\r\n break\r\n if found==0:\r\n return \"NO\"\r\n return \"Yes\"\r\nprint(check(matrix,n))\r\n", "def is_sum(i, j):\n\tv = l[i][j]\n\tfor k in range(i):\n\t\tif l[k][j] < v:\n\t\t\tif (v - l[k][j]) in l[i]:\n\t\t\t\treturn True\n\tfor k in range(i+1, n):\n\t\tif l[k][j] < v:\n\t\t\tif (v - l[k][j]) in l[i]:\n\t\t\t\treturn True\n\treturn False\n\ndef f(l):\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif l[i][j] != 1:\n\t\t\t\tif not is_sum(i, j):\n\t\t\t\t\treturn False\n\treturn True\n\nn = int(input())\nl = []\nfor _ in range(n):\n\tl.append(list(map(int, input().split())))\nif f(l):\n\tprint('Yes')\nelse:\n\tprint('No')\n", "#!/usr/bin/python\r\nimport random\r\nimport math\r\nimport sys\r\nn = int(input())\r\n\r\nl = [[0 for x in range(n)] for y in range(n)]\r\n\r\nfor i in range(0,n):\r\n t = [int(x) for x in input().split()]\r\n for j in range(0,n):\r\n l[i][j] = t[j]\r\nflag = 0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if l[i][j] != 1:\r\n flag = 0\r\n for k in range(0,n):\r\n if k == j:\r\n continue\r\n else:\r\n value = l[i][k]\r\n for s in range(0,n):\r\n if s == i:\r\n continue\r\n else:\r\n test = l[s][j]\r\n if value + test == l[i][j]:\r\n flag = 1\r\n break\r\n if flag == 1:\r\n break\r\n if flag == 0:\r\n print (\"NO\")\r\n sys.exit()\r\n\r\nprint (\"YES\")\r\n", "def cal(a,i,j,n):\n for k in range(n):\n for kk in range(n):\n if a[i][j]==a[i][k]+a[kk][j]:\n return True\n return False\n \n\nn=int(input())\na=[]\nfor i in range(n):\n a.append([*map(int,input().split())])\nfor i in range(n):\n for j in range(n):\n if a[i][j]!=1:\n if cal(a,i,j,n)==False:\n print(\"No\")\n exit()\nprint(\"Yes\")", "def bsearh(arr,val):\n\tarr.sort()\n\tmid=(n-1)//2\n\tl=0\n\tr=n-1\n\twhile(l<r):\n\t\tif(arr[mid]==val):\n\t\t\treturn 1\n\t\telif(arr[mid]<val):\n\t\t\tr=mid+1\n\t\telse:\n\t\t\tl=mid-1\n\treturn 0\n\nn=int(input())\narr=[]\nfor i in range(n):\n\tarr1=list(map(int,input().split()))\n\tarr.append(arr1)\nflag=0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif(arr[i][j]!=1):\n\t\t\tflag1=0\n\t\t\tfor k in range(n):\n\t\t\t\tfor l in range(n):\n\t\t\t\t\tif(arr[i][k]+arr[l][j]==arr[i][j]):\n\t\t\t\t\t\tflag1=1\n\t\t\t\t\t\tbreak\n\t\t\t\tif(flag1==1):\n\t\t\t\t\tbreak\n\t\t\tif(flag1==0):\n\t\t\t\tflag=1\n\t\t\t\tbreak\n\tif(flag!=0):\n\t\tbreak\nif(flag==0):\n\tprint('YES')\nelse:\n\tprint(\"NO\")", "n = int(input())\r\nrows = []\r\nfor x in range(n):\r\n string = input()\r\n row = string.split(\" \")\r\n for y in range(n):\r\n row[y] = int(row[y])\r\n rows.append(row)\r\ncolumns = []\r\nfor x in range(n):\r\n column = []\r\n for y in range(n):\r\n column.append(rows[y][x])\r\n columns.append(column)\r\nresults = \"Yes\"\r\nfor x in range(n):\r\n a = 0\r\n while a < n:\r\n r = rows[x][a]\r\n if r != 1:\r\n b = 0\r\n while b < n:\r\n c = columns[a][b]\r\n s = 0\r\n while s < n:\r\n t = rows[x][s]\r\n condition = b == x and s == y\r\n if c == r - t and not condition:\r\n break\r\n s += 1\r\n if s != n:\r\n break\r\n b += 1\r\n if b == n:\r\n break\r\n a += 1\r\n if a != n:\r\n results = \"No\"\r\n break\r\nprint(results)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n a.append(list_input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n continue\r\n found = False\r\n for p in range(n):\r\n for q in range(n):\r\n if a[i][p]+a[q][j] == a[i][j] and p != j and q != i:\r\n found = True\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\n\r\n", "n=int(input())\r\nM=[list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if M[i][j]!=1 :\r\n c=1\r\n for i1 in range(n) :\r\n for j1 in range(n) :\r\n if M[i][j]==M[i1][j]+M[i][j1] :\r\n c=0\r\n break\r\n if c==1 :\r\n print('No')\r\n exit()\r\n \r\nprint('Yes')\r\n \r\n \r\n \r\n", "n=input()\r\nn=int(n)\r\n\r\na=[]\r\nfor i in range(n):\r\n x=input().split()\r\n x=[int(p) for p in x]\r\n a.append(x)\r\n\r\ncan=True\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n p=False\r\n for ii in range(n):\r\n for jj in range(n):\r\n if a[i][jj]+a[ii][j]==a[i][j]:\r\n p=True\r\n if p==False:\r\n can=False\r\n\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def fin(s, row, column):\n\tfor i in row:\n\t\tfor j in column:\n\t\t\tif i+j == s:\n\t\t\t\treturn True\n\treturn False\n\nn = int(input())\na = []\nfor i in range(n):\n\tk = input().split(' ')\n\tk = list(map(int,k))\n\ta.append(k)\n\nans = True\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[i][j] == 1:\n\t\t\tcontinue\n\t\telse:\n\t\t\ts = a[i][j]\n\t\t\trow = a[i]\n\t\t\tcolumn = []\n\t\t\tfor t in range(n):\n\t\t\t\tcolumn.append(a[t][j])\n\t\t\tans = fin(s,row,column)\n\t\t\tif ans == False:\n\t\t\t\tbreak\n\tif ans == False:\n\t\tbreak\n\nif ans==True:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "n = int(input()); f = False\r\nm = [[int(x) for x in input().split()] for _ in n * ' ']\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] != 1:\r\n for s in range(i, i+1):\r\n for t in range(n):\r\n for l in range(n):\r\n for k in range(j, j+1):\r\n if m[s][t] + m[l][k] == m[i][j]:\r\n f = True; break\r\n else:\r\n f = False\r\n if f: break\r\n if f: break\r\n if f: break\r\n else:\r\n print('NO')\r\n if m[i][j] != 1 and (not f):\r\n break\r\n if m[i][j] != 1 and (not f):\r\n break\r\nelse:\r\n print('YES')", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\ndef check(x, y):\r\n for i in range(n):\r\n for j in range(n):\r\n if i != x and j != y and a[i][y] + a[x][j] == a[x][y]:\r\n return True\r\n return False\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] != 1 and not check(i, j):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")", "from sys import exit\nn = int(input())\nl = []\nfor i in range(n):\n l.append(list(map(int, input().split())))\nfor i in range(n):\n for j in range(n):\n if l[i][j] != 1:\n flag = False\n for d in range(n):\n for k in range(n):\n if d != j and k != i and l[i][d] + l[k][j] == l[i][j]:\n flag = True\n if not flag:\n print(\"NO\")\n exit(0)\nprint(\"YES\")", "N = int(input())\r\nmatrix = []\r\nfor i in range(N):\r\n matrix.append(list(map(int, input().split())))\r\nfor x in range(N):\r\n for y in range(N):\r\n if matrix[x][y]!=1:\r\n for s in range(N):\r\n for t in range(N):\r\n if matrix[x][s]+matrix[t][y]==matrix[x][y]: break\r\n else: continue\r\n break\r\n else: print('No'); break\r\n else: continue\r\n break\r\nelse: print('Yes')\r\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport sys\n\n\ndef main():\n iterator = iter(sys.stdin.read().split())\n n = int(next(iterator))\n a = [[0] * n for _ in range(n)]\n for i in range(n):\n for j in range(n):\n a[i][j] = int(next(iterator))\n for i in range(n):\n for j in range(n):\n x = a[i][j]\n if x == 1:\n continue\n flag = False\n for p in range(n):\n for q in range(n):\n if a[i][p] + a[q][j] == x:\n flag = True\n if not flag:\n print('No')\n return\n print('Yes')\n\n\nif __name__ == '__main__':\n main()\n", "# A. Okabe and Future Gadget Laboratory\n\nn = int(input())\na = list()\n\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfound_bad = False\nfor i in range(n):\n if found_bad:\n break\n\n for j in range(n):\n\n target = a[i][j]\n\n if found_bad:\n break\n\n if target != 1:\n row = a[i].copy()\n del row[j]\n\n column = list()\n for k in range(n):\n if k != i:\n column.append(a[k][j])\n\n found_target = False\n for x in row:\n if found_target:\n break\n for y in column:\n if x + y == target:\n found_target = True\n break\n if not found_target:\n found_bad = True\n\nprint(\"Yes\" if not found_bad else \"No\")\n", "n = int(input())\r\n\r\nmat = []\r\nfor i in range(n):\r\n line = [int(x) for x in input().split()]\r\n mat.append(line)\r\n\r\ncheck1 = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if mat[i][j] != 1:\r\n check = 1\r\n for k in range(n):\r\n for t in range(n):\r\n if mat[i][t]+mat[k][j] == mat[i][j]:\r\n check = 0\r\n if check == 1:\r\n check1 = 0\r\n break\r\nif check1 == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "n = int(input())\nm = []\nfor _ in range(n):\n m.append(list(map(int, input().split())))\n\nans = True\nfor i in range(n):\n for j in range(n):\n if m[i][j] != 1:\n found = False\n for x in range(n):\n for y in range(n):\n if x != i and y != j and m[i][y] + m[x][j] == m[i][j]:\n found = True\n if not found:\n ans = False\nif ans:\n print('Yes')\nelse:\n print('No')\n \n", "import sys\r\n\r\ndef is_good(lab):\r\n n = len(lab)\r\n for i in range(n):\r\n for j in range(n):\r\n v = lab[i][j]\r\n if v > 1 and all(x + y != v for x in lab[i] for y in (lab[k][j] for k in range(n))):\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nlab = [[int(i) for i in input().split()] for _ in range(n)]\r\n\r\nprint('Yes' if is_good(lab) else 'No')\r\n", "n = int(input())\r\nmat = [list(map(int,input().split())) for i in range(n)]\r\nc = []\r\nfor i in range(n):\r\n c.append(set())\r\n for j in range(n):\r\n c[i].add(mat[j][i])\r\nans = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n curr = mat[i][j]\r\n if curr==1:continue\r\n for k in range(n):\r\n if curr-mat[i][k] in c[j]:\r\n break\r\n else:\r\n #print(curr,i,j)\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "I = lambda : map(int, input().split())\nn, = I()\narr = []\nfor i in range(0, n):\n arr.append(list(I()))\n\nfor x in range(0, n):\n for y in range(0, n):\n if arr[x][y] != 1:\n found = False\n for s in range(0, n):\n for t in range(0, n):\n if arr[x][y] == arr[x][s] + arr[t][y]:\n found = True\n if not found:\n print(\"No\")\n exit(0)\nprint(\"Yes\")", "n = int(input())\r\nl=[]\r\narr = []\r\nfor i in range(n):\r\n l = input().split()\r\n l = list(map(int, l)) \r\n arr.append(l)\r\n\r\n\r\n\r\ndef f(n,arr):\r\n for i in range(n):\r\n for j in range(n):\r\n if(arr[i][j]!=1):\r\n lst = [1 if(arr[i][j]== (arr[i][s] +arr[t][j])) else 0 for s in range(n) if s!=j for t in range(n) if t!=i]\r\n \r\n if(sum(lst)==0): \r\n return 'No'\r\n \r\n if(i==n-1 &j==n-1):\r\n return 'yes'\r\n\r\nprint(f(n,arr))", "def func(arr):\r\n for i in range(n):\r\n for j in range(n):\r\n if arr[i][j]!=1:\r\n check = 0\r\n for k in range(n):\r\n if arr[i][j]-arr[k][j] in arr[i]:\r\n check = 1\r\n break\r\n if check==0:\r\n return False\r\n return True\r\n \r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nif func(arr):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n lstTemp = list(map(int, input().split()))\r\n arr.append(lstTemp)\r\nok = True\r\nfor z in range(n):\r\n lst = arr[z]\r\n for tNumIndxRow in range(n):\r\n numTemp = lst[tNumIndxRow]\r\n if(numTemp > 1):\r\n okTemp = False\r\n for tNumIndxSameRow in range(n):\r\n if(tNumIndxRow != tNumIndxSameRow):\r\n tnr = lst[tNumIndxSameRow]\r\n for tNumIndxCol in range(n):\r\n if(z != tNumIndxCol):\r\n tnc = arr[tNumIndxCol][tNumIndxRow]\r\n tempAns = tnr + tnc\r\n if(tempAns == numTemp):\r\n okTemp = True\r\n break\r\n if(okTemp == True):\r\n break\r\n if(okTemp == False):\r\n ok = False\r\n break\r\n if(ok == False):\r\n break\r\nprint(\"YES\" if ok else \"NO\")", "def r():\r\n return list(map(int, input().split()))\r\nn = int(input())\r\nmatr = [r() for i in range(n)]\r\nans = True\r\ncolumns = list(map(set,zip(*matr)))\r\nfor row in matr:\r\n\tans &= all(x == 1 or any(x - a in row for a in col) for x, col in zip(row, columns))\r\nprint(\"Yes\" if ans else \"No\")", "def solve(mat):\r\n for i in range(len(mat)):\r\n for j in range(len(mat)):\r\n if mat[i][j] != 1:\r\n can = False\r\n for k in range(len(mat)):\r\n for l in range(len(mat)):\r\n if mat[i][l] + mat[k][j] == mat[i][j]:\r\n can = True\r\n break\r\n if can:\r\n break\r\n if not can:\r\n print('No')\r\n return\r\n \r\n print('Yes')\r\n\r\nn = int(input())\r\nmat = [list(map(int, input().split())) for i in range(n)]\r\nsolve(mat)\r\n", "a=[];x=int(input())\r\nfor i in range(x):\r\n\ta.append(list(map(int,input().split())))\r\nfor i in range(x):\r\n\tb=[]\r\n\tfor t in range(x):\r\n\t\tk=-1\r\n\t\tif a[i][t]>1:\r\n\t\t\tb=[a[k][t] for k in range(x) if a[k][t]<a[i][t]]\r\n\t\t\tfor v in range(x):\r\n\t\t\t\tif a[i][v]<a[i][t] and a[i][t]-a[i][v] in b:\r\n\t\t\t\t\tk=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif k!=1:exit(print('No'))\r\nprint('YES')", "row = []\r\nmat = []\r\n\r\n\r\ndef finder(x,i,j):\r\n flag = 0\r\n for b in range(0,n):\r\n #print(mat[i][b])\r\n \r\n for a in range(0,n):\r\n if mat[i][b] + mat[a][j] == x:\r\n flag =1\r\n break\r\n \r\n if flag:\r\n break\r\n \r\n if flag:\r\n return 1\r\n else:\r\n return 0\r\n \r\n\r\nn = int(input()) \r\n\r\nfor i in range(0,n):\r\n row = [int(x) for x in input().split()]\r\n mat.append(row)\r\n\r\n#print(mat)\r\nans = 0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n #print(mat[i][j])\r\n if mat[i][j]!=1:\r\n ans = ans + finder(mat[i][j],i,j)\r\n else:\r\n ans = ans + 1\r\n\r\nif ans == n*n :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n ", "import sys\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(el) for el in input().split()])\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n cnt += 1 \r\n continue\r\n for k in range(n):\r\n f = False\r\n for l in range(n):\r\n if a[i][k] + a[l][j] == a[i][j]:\r\n f = True\r\n break\r\n if f:\r\n cnt += 1\r\n break\r\n\r\nif n * n == cnt: \r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nT = [[] for i in range(n)]\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n T[i] = a\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if T[i][j] != 1:\r\n flag1 = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i and l != j and T[i][j] == T[k][j] + T[i][l]:\r\n flag1 = True\r\n\r\n if not flag1:\r\n flag = False\r\n\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\nmat = []\nfor i in range(n):\n a = [int(x) for x in input().split()]\n mat.append(a)\n\nisp = 1\nfor i in range(n):\n for j in range(n):\n if mat[i][j] == 1:\n continue\n isb = 0\n for k in range(n):\n for m in range(n):\n if mat[i][j] == mat[i][k] + mat[m][j]:\n isb = 1\n if isb == 0:\n isp = 0\n break\n\nif(isp > 0):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]==1:\r\n\t\t\tcontinue\r\n\t\tval = False\r\n\t\tfor k in range(n):\r\n\t\t\tfor l in range(n):\r\n\t\t\t\tif (a[i][k]+a[l][j]==a[i][j]):\r\n\t\t\t\t\tval = True\r\n\t\tif val==False:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit(0)\r\nprint(\"Yes\")\r\n\t\t\t\t\r\n\t\t\r\n", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn = int(input())\r\nL = [[int(x) for x in input().split()] for _ in range(0, n)]\r\n\r\nvalid = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if L[i][j] != 1 :\r\n found = False\r\n for a in range(n) :\r\n for b in range(n) :\r\n if L[i][b] + L[a][j] == L[i][j]: found = True\r\n if (not found) : valid = False\r\n\r\nif valid : print(\"YES\")\r\nelse : print(\"NO\")\r\n\r\n\r\n", "#!/usr/bin/env python3\nimport sys\n\ndef main():\n n = int(sys.stdin.readline())\n mat = [None for __ in range(n)]\n for indx in range(n):\n mat[indx] = list(map(int, sys.stdin.readline().split()))\n\n good = True\n for row in range(n):\n for col in range(n):\n if mat[row][col] == 1:\n continue\n else:\n good &= check_this_element(mat, row, col)\n if good:\n print(\"Yes\")\n else:\n print(\"No\")\n\ndef check_this_element(mat, row, col):\n n = len(mat)\n for _row in range(n):\n for _col in range(n):\n if mat[_row][col] + mat[row][_col] == mat[row][col]:\n return True\n return False\n\nif __name__ == '__main__':\n main()\n", "m = []\nfor i in range(int(input())):\n m.append(list(map(int, input().split())))\n\ndef solve():\n for row in range(len(m)):\n for column in range(len(m)):\n if m[row][column] == 1:\n continue\n\n r = set(m[row])\n r.remove(m[row][column])\n c = set()\n for i in range(len(m)):\n c.add(m[i][column])\n c.remove(m[row][column])\n\n found = False\n for item in r:\n if m[row][column] - item in c:\n found = True\n break\n if not found:\n return \"No\"\n return \"Yes\"\n \nprint(solve())", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\nans = \"Yes\"\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] > 1:\r\n can_make = 0\r\n for k in range(n):\r\n for q in range(n):\r\n if a[i][k] + a[q][j] == a[i][j]:\r\n can_make = True\r\n\r\n if not can_make:\r\n ans = \"No\"\r\n\r\nprint(ans)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\n\r\n\r\ndef get_x(i, n, arr):\r\n return arr[i][n]\r\n\r\n\r\ndef get_y(j, n, arr):\r\n return arr[n][j]\r\n\r\n\r\ndef is_good(i, j, arr, n):\r\n for k in range(n):\r\n for p in range(n):\r\n if (get_x(i, k, arr)+get_y(j, p, arr)) == arr[i][j] and (j != k and i != p):\r\n return True\r\n return False\r\nres = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if is_good(i, j, arr, n) or arr[i][j]==1:\r\n pass\r\n else:\r\n res =\"NO\"\r\n\r\n\r\n\r\nprint(res)", "def main():\n n = int(input())\n l = list(list(map(int, input().split())) for _ in range(n))\n cols = list(map(set, zip(*l)))\n for row in l:\n for t, col in zip(row, cols):\n if t != 1:\n for a in row:\n if t - a in col:\n break\n else:\n print(\"No\")\n return\n print(\"Yes\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\nans = \"Yes\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] != 1:\r\n tf = False\r\n for s in range(n):\r\n for t in range(n):\r\n if m[i][s] + m[t][j] == m[i][j]:\r\n tf = True\r\n break\r\n if not tf:\r\n ans = \"No\"\r\n break\r\n if ans == \"No\":\r\n break\r\nprint(ans)\r\n", "def is_good(matrix, n, i, j):\n if matrix[i][j] == 1:\n return True\n\n row = [matrix[i][s] for s in range(n) if s != j]\n col = [matrix[t][j] for t in range(n) if t != i]\n\n for r in row:\n for c in col:\n if r + c == matrix[i][j]:\n return True\n\n return False\n\n\ndef main():\n n = int(input())\n matrix = [[]] * n\n\n for i in range(n):\n matrix[i] = [int(_) for _ in input().split()]\n\n found = False\n\n for i in range(n):\n if found:\n break\n\n for j in range(n):\n if found:\n break\n\n found = not is_good(matrix, n, i, j)\n\n print('No' if found else 'Yes')\n\n\nif __name__ == '__main__':\n main()\n", "def run(a,n):\r\n flag = 0\r\n for i in range(n):\r\n for j in range(n):\r\n flag = 0\r\n if a[i][j]==1:\r\n flag=1\r\n for p in range(n):\r\n for q in range(n):\r\n if a[i][p]+a[q][j]==a[i][j]:\r\n flag = 1\r\n if flag!=1:\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n \r\nn = int(input())\r\na=[]\r\nfor _ in range(n):\r\n a.append(list(map(int,input().split())))\r\nrun(a,n)\r\n\r\n", "def check(grid, i, j, n):\r\n for ii in range(n):\r\n for jj in range(n):\r\n if grid[i][j] == grid[ii][j] + grid[i][jj]:\r\n return True\r\n return False\r\n\r\n\r\nn, grid, flag = int(input()), list(), 0\r\nfor i in range(n):\r\n grid.extend([list(map(int, input().split()))])\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] != 1:\r\n if check(grid, i, j, n) is False:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from itertools import *\nn=int(input())\nf=[list(map(int,input().split())) for _ in range(n)]\nfor i,j in product(range(n),range(n)):\n x=f[i][j]\n if x==1: continue\n if not any(a+b==x for a, b in product(chain(f[i][:j], f[i][j+1:]),(f[k][j] for k in chain(range(i), range(i+1,n))))):\n print(\"No\")\n exit(0)\nprint(\"Yes\")\n", "n = int(input())\r\nL = [list(map(int, input().split())) for _ in range(n)]\r\nfor i, X in enumerate(L):\r\n for j, Y in enumerate(X):\r\n if Y == 1 or any(Y - L[t][j] in X for t in range(n)): continue\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "n = int(input())\r\nl = []\r\n\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n l.append(a)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j] != 1 :\r\n flag = 0\r\n for x in range(n):\r\n for y in range(n):\r\n if l[i][j] == l[i][x] + l[y][j]:\r\n flag +=1\r\n\r\n if flag == 0 :\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n", "n = int(input())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nanswer = \"Yes\"\nfor i in range(n):\n for j in range(n):\n if a[i][j] == 1:\n continue\n cur = \"No\"\n for c in range(n):\n for k in range(n):\n if a[c][j] + a[i][k] == a[i][j]:\n cur = \"Yes\"\n if cur == \"No\":\n answer = \"No\"\nprint(answer)\n", "\r\nn = int(input())\r\n\r\nrows = cols = n\r\n\r\nlab_mat = [[0 for i in range(cols)] for j in range(rows)]\r\n\r\n\r\nfor i in range(rows):\r\n row_input = input().split()\r\n for j in range(cols):\r\n lab_mat[i][j] = int(row_input[j])\r\n\r\n\r\ndef column(matrix, i):\r\n return [row[i] for row in matrix]\r\n\r\ngood_flag = [[False for i in range(cols)] for j in range(rows)]\r\n\r\nfor i in range(rows):\r\n\r\n for j in range(cols):\r\n\r\n element = lab_mat[i][j]\r\n\r\n if element == 1:\r\n good_flag[i][j] = True\r\n continue\r\n else:\r\n\r\n for x in lab_mat[i]:\r\n\r\n for y in column(lab_mat, j):\r\n if element == x + y:\r\n good_flag[i][j] = True\r\n break\r\n\r\n if not good_flag:\r\n good_flag[i][j] = False\r\n break\r\n\r\nflag_sum = 0\r\nfor i in range(rows):\r\n for j in range(cols):\r\n flag_sum += good_flag[i][j]\r\n\r\nif flag_sum == n ** 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n=int(input());a=[]\r\nfor i in range(n):a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]!=1:\r\n r=0\r\n for k in range(n):\r\n for l in range(n):\r\n if a[i][k]+a[l][j]==a[i][j]:r=1\r\n if r==0:print('No');exit()\r\nprint(\"Yes\")", "# Uses python3\r\nfrom sys import stdin, stdout\r\nimport cProfile\r\n\r\nprintHeap = str()\r\ntest = False\r\nmemory_constrained = False\r\n\r\n\r\ndef display(string_to_print):\r\n stdout.write(str(string_to_print) + \"\\n\")\r\n\r\n\r\ndef test_print(output):\r\n if test:\r\n stdout.write(str(output) + \"\\n\")\r\n\r\n\r\ndef display_list(list1, sep=\" \"):\r\n stdout.write(sep.join(map(str, list1)) + \"\\n\")\r\n\r\n\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\nmemory = dict()\r\n\r\n\r\ndef clear_cache():\r\n global memory\r\n memory = dict()\r\n\r\n\r\ndef cached_fn(fn, *args):\r\n global memory\r\n if args in memory:\r\n return memory[args]\r\n else:\r\n result = fn(*args)\r\n memory[args] = result\r\n return result\r\n\r\n\r\n# ----------------------------------------------------------------------------------- MAIN PROGRAM\r\nimport math, copy\r\n\r\n\r\ndef calc(a, b, op):\r\n return a-b if op==\"-\" else a+b if op == \"+\" else a*b if (op==\"X\" or op==\"*\") else a//b\r\n\r\n\r\ndef chkGood(arr,i,j,n):\r\n g = False\r\n for i1 in range(n):\r\n if g: break\r\n if i1==i: continue\r\n for j1 in range(n):\r\n if j1==j: continue\r\n if arr[i1][j] + arr[i][j1] == arr[i][j]:\r\n g = True\r\n break\r\n return g\r\n\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n arr = [[0 for _ in range(n)] for _ in range(n)]\r\n for i in range (n):\r\n arr[i] = get_list()\r\n good = True\r\n for i in range (n):\r\n if not good: break\r\n for j in range(n):\r\n ele = arr [i][j]\r\n if ele!=1:\r\n if not chkGood(arr,i,j,n):\r\n good = False\r\n break\r\n print (\"Yes\") if good else print(\"No\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n# --------------------------------------------------------------------------------------------- END\r\n\r\n\r\ncProfile.run('main()') if test else main()", "n = int(input())\r\nlab = [[int(s) for s in input().split(' ')] for i in range(n)]\r\ndb = False\r\nfor i in range(n):\r\n if db:\r\n break\r\n for j in range(n):\r\n elem = lab[i][j]\r\n if elem == 1:\r\n answer = True\r\n else:\r\n answer = False\r\n for k in range(n):\r\n for l in range(n):\r\n if k != i and l != j and lab[i][l] + lab[k][j] == elem:\r\n answer = True\r\n if not answer:\r\n db = True\r\n break\r\nif answer:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n ans = ans + 1\r\n continue\r\n ans += 1 + min(abs(a[i][j] - a[i][k] - a[t][j]) for k in range(0, n) for t in range(0, n))\r\nif ans == n * n:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int, input().split())))\r\nx=1\r\nfor i in range(n):\r\n if x==-1:break\r\n for j in range(n):\r\n if x==-1: break\r\n if l[i][j]!=1:\r\n c=0\r\n for k in range(n):\r\n for m in range(n):\r\n\r\n if l[k][j]+l[i][m]==l[i][j]:\r\n c=1\r\n break\r\n break\r\n if c==0: \r\n x=-1\r\nif x==-1: print(\"No\")\r\nelse: print(\"Yes\")\r\n ", "def findSum(n, r,c, lim, grid):\r\n for i in range(lim):\r\n for j in range(lim):\r\n if grid[r][i] + grid[j][c] == n: return True\r\n\r\n return False\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n grid = []\r\n \r\n for i in range(n):\r\n grid.append([ int(n) for n in input().split()])\r\n \r\n \r\n for r in range(n):\r\n for c in range(n):\r\n if grid[r][c] == 1: continue\r\n if not findSum(grid[r][c], r, c, n,grid):\r\n print(\"No\")\r\n return\r\n print(\"Yes\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = [[int(i) for i in input().split()] for _ in range(n)]\r\nb = [set(a[i]) for i in range(n)]\r\nif all(all(a[i][j] == 1 or any(a[i][j] - a[k][j] in b[i] for k in range(n)) for j in range(n)) for i in range(n)):\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "\r\nn=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\ns=list(map(set,a))\r\nflag=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]!=1:\r\n\t\t\tf=0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tif a[i][j]-a[k][j] in s[i]:\r\n\t\t\t\t\tf=1\r\n\t\t\t\t\tbreak\r\n\t\t\tif f==0:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\tif flag==1:\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "n = int(input())\na = []\ni = 0\nwhile i < n :\n temp = list(map(int,input().strip().split(' ')))\n a.append(temp)\n i+=1\ncount = 0\nskipLoop = False\nfor i in range(0,n):\n for j in range(0,n):\n if a[i][j] == 1:\n count += 1\n else:\n for k in range(0,n):\n for l in range(0,n):\n if l != i and j != k:\n if a[i][k] + a[l][j] == a[i][j]:\n count += 1\n skipLoop = True\n break\n if skipLoop:\n skipLoop = False\n break\nif count == n*n:\n print(\"Yes\")\nelse:\n print(\"No\")\n \n \n ", "n = int(input())\nA = [list(map(int, input().split())) for _ in range(n)]\n\ndef hasSum(col,row,x):\n for y in col:\n for z in row:\n if y + z == x:\n return True\n return False\n\ndef solve(n,A):\n for i in range(n):\n for j in range(n):\n x = A[i][j]\n if x != 1:\n col = [row[j] for row in A]\n row = A[i]\n if not hasSum(col,row, x):\n print('No')\n return\n print('Yes')\n\n\n\nsolve(n,A)", "# python 3.5.2 @ameniawy\r\n\r\nn = int(input())\r\nlab = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef check(i, j):\r\n val = lab[i][j]\r\n for p in range(n):\r\n row = lab[i][p]\r\n for q in range(n):\r\n if val == row + lab[q][j]:\r\n return True\r\n return False\r\n\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if lab[i][j] != 1:\r\n if not check(i, j):\r\n flag = False\r\n break\r\nprint(\"Yes\") if flag else print(\"No\")", "n = int(input())\r\nflag = False\r\nA = [0] * n \r\nfor i in range(n):\r\n\tA[i] = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i][j] == 1:\r\n continue\r\n for x in range(n):\r\n for y in range(n):\r\n if A[i][y] + A[x][j] == A[i][j]:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n print(\"No\")\r\n exit(0)\r\n flag = False\r\nprint(\"Yes\")\r\nexit(0)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nt=True\r\ni=0\r\nwhile i<n and t:\r\n j=0\r\n while j<n and t:\r\n s=0\r\n q=False\r\n while s<n and t and not q:\r\n r=0\r\n while r<n and t and not q:\r\n if a[i][j]==a[i][s]+a[r][j] and a[i][j]!=1:\r\n q=True\r\n elif a[i][j]==1:\r\n q=True\r\n r+=1\r\n s+=1\r\n if q==False:\r\n t=False\r\n j+=1\r\n i+=1\r\n\r\nif t==True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] != 1:\r\n found = False\r\n for k in range(n):\r\n for l in range(n):\r\n if grid[i][j] == grid[i][k] + grid[l][j]:\r\n found = True\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\n", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif a[i][j]!=1:\r\n\t\t\tvalue = False\r\n\t\t\tfor i1 in range(n):\r\n\t\t\t\tfor j1 in range(n):\r\n\t\t\t\t\tif a[i][j1]+a[i1][j]==a[i][j]:\r\n\t\t\t\t\t\tvalue = True\r\n\t\t\tif value == False:\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint(\"Yes\")", "\r\ndef checker(x,n,a,b):\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif a[i]+b[j]==x:\r\n\t\t\t\treturn True\r\n\t\t\telse:\r\n\t\t\t\tcontinue\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tl.append(a)\r\nz=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tx=l[i][j]\r\n\t\tb=l[i]\r\n\t\tc=[]\r\n\t\tfor k in range(n):\r\n\t\t\tc.append(l[k][j])\r\n\t\tif x==1:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif checker(x,n,b,c):\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tz=1\r\n\t\t\t\tbreak\r\n\tif z==1:\r\n\t\tbreak\r\nif z==1:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")\r\n", "\r\n\r\nn = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n\r\nans = True\r\n\r\nfor i in range(n):\r\n if not ans:\r\n break\r\n\r\n for j in range(n):\r\n if a[i][j] == 1:\r\n continue\r\n\r\n flag = False\r\n\r\n for s in range(n):\r\n for t in range(n):\r\n if a[i][j] == a[i][s] + a[t][j]:\r\n flag = True\r\n\r\n if not flag:\r\n ans = False\r\n # print(i, j)\r\n break\r\n\r\n\r\nif ans:\r\n print('Yes')\r\n\r\nelse:\r\n print('No')", "n = int(input())\ntbl = []\nfor i in range(n):\n tbl.append(list(map(int, input().split())))\n\nout = False\nfor i, row in enumerate(tbl):\n for j in range(len(row)):\n out = False\n e = row[j]\n if e == 1:\n out = True\n continue\n for j1, e1 in enumerate(row):\n if j1 != j:\n for i1 in range(n):\n if e1 + tbl[i1][j] == e:\n out = True\n break\n if out:\n break\n if not out:\n print('No')\n break\n if not out:\n break\nif out:\n print('Yes')", "def is_good_lab():\n for x in range(num):\n for i in range(num): \n if lab[x][i]!=1:\n sum_found = False\n for j in range(num):\n sum_found = False\n # print (str(lab[x][i]) + \" - \" + str(lab[j][i]) + \" = \" + str(mapa[x]))\n if str(lab[x][i]-lab[j][i]) in mapa[x]:\n sum_found = True\n break\n if not sum_found:\n return False\n \n return True\n\nnum = int(input())\nlab = [[0 for x in range(num)] for y in range(num)] \nt=0\nmapa = {}\nfor i in range(num):\n row = input()\n row = row.split(' ')\n mapa[i] = {}\n for n, value in enumerate(row):\n lab[i][n] = int(value)\n mapa[i][value] = ''\n\nprint(\"Yes\" if is_good_lab() else \"No\")\n\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/821/A\n\nn = int(input())\n\nl_r = list()\nfor _ in range(n):\n l_r.append([int(x) for x in input().split()])\n\nl_s_c = list(set() for _ in range(n))\nl_s_r = list(set() for _ in range(n))\n\nfor i in range(n):\n for j in range(n):\n l_s_c[j].add(l_r[i][j])\n l_s_r[i].add(l_r[i][j])\n\nfor i in range(n):\n for j in range(n):\n if l_r[i][j] == 1:\n continue\n\n f = False\n for v in l_s_c[j]:\n if l_r[i][j] - v in l_s_r[i]:\n f = True\n break\n if not f:\n print(\"No\")\n quit()\nprint(\"Yes\")", "n=int(input())\r\na=[list(map(int, input().split())) for i in range(n)]\r\n#print(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n val=0\r\n if(a[i][j]==1):\r\n continue\r\n for k in range(n):\r\n for l in range(n):\r\n if(a[i][j]==a[i][k]+a[l][j]):\r\n val=1\r\n break\r\n if val:\r\n break\r\n if not val:\r\n print(\"No\")\r\n exit(0)\r\n \r\n \r\nprint(\"Yes\")\r\n", "def solve(n, m):\n for i in range(n):\n line = m[i]\n for j in range(n):\n if m[i][j] == 1: continue\n column = [m[k][j] for k in range(n)]\n found = False\n for k in line:\n for t in column:\n if k + t == m[i][j]:\n found = True\n break\n if found: break\n if not found: return \"No\"\n return \"Yes\"\n\n\ndef main():\n n = int(input())\n m = [list(map(int, input().split())) for _ in range(n)]\n print(solve(n, m))\n\n\nmain()\n", "n = int(input())\r\nm = [list(map(int, input().split())) for i in range(n)]\r\nfl = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] == 1:\r\n continue\r\n cur = []\r\n for x in range(n):\r\n for y in range(n):\r\n if j == x or y == i:\r\n continue\r\n cur.append(m[i][x] + m[y][j])\r\n if m[i][j] not in cur:\r\n fl = 0\r\nif fl:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\nfl=[list(map(int,input().split())) for i in range(n)]\nok=True\nfor i in range(n):\n for j in range(n):\n if fl[i][j]!=1:\n sok=False\n k=m=0\n while not sok and (k<n):\n m=0\n while not sok and (m<n):\n sok=(j!=m)and(i!=k)and(fl[i][j]==fl[k][j]+fl[i][m])\n m+=1\n k+=1\n ok=sok*ok\nif ok:\n print('Yes')\nelse:\n print('No')\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nans = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] != 1:\r\n chk = False\r\n for k in range(n):\r\n for l in range(n):\r\n if data[i][k] + data[l][j] == data[i][j]:\r\n chk = True\r\n break\r\n if not chk:\r\n ans = False\r\n break\r\n\r\nprint(\"YES\" if ans else \"NO\")", "n = int(input())\r\nlab = []\r\n\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n lab.append([])\r\n for j in range(n):\r\n lab[i].append(line[j])\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n x = lab[i][j]\r\n if x != 1:\r\n local_flag = False\r\n for a in [lab[i][y] for y in range(n)]:\r\n for b in [lab[y][j] for y in range(n)]:\r\n if x == a + b:\r\n local_flag = True\r\n if not local_flag:\r\n flag = False\r\n\r\nprint('Yes') if flag else print('No')\r\n", "n = int(input())\r\n\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\ndata_t = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n data_t[j][i] = data[i][j]\r\n\r\ndef sums(row1, row2):\r\n result = []\r\n for v1 in row1:\r\n for v2 in row2:\r\n result.append(v1 + v2)\r\n return result\r\n\r\nfail = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] == 1:\r\n continue \r\n #print('i', i, 'j', j, data[i][j], data[i], data_t[j], sums(data[i], data_t[j]))\r\n if data[i][j] not in sums(data[i], data_t[j]):\r\n fail = True\r\n break\r\n if fail:\r\n break\r\n\r\nprint(('Yes', 'No')[fail])\r\n", "cases = int(input())\r\nn = cases\r\nmatrix = []\r\nwhile cases:\r\n cases -= 1\r\n row = list(map(int, input().split()))\r\n\r\n matrix.append(row)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] == 1:\r\n continue\r\n broken = False\r\n for k in range(n):\r\n for m in range(n):\r\n if matrix[i][k] + matrix[m][j] == matrix[i][j]:\r\n broken = True\r\n if not broken:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n", "N = int(input())\ntable = []\nfor i in range(N):\n table.append(list(map(int, input().split())))\n\nfor i in range(N):\n for j in range(N):\n if table[i][j] == 1:\n continue\n flg = False\n for s in range(N):\n for t in range(N):\n if table[i][j] == table[i][s] + table[t][j]:\n flg = True\n break\n if not flg:\n print(\"No\")\n exit()\nprint(\"Yes\")\n", "# Time : 2017-6-26 10:30\r\n# Auther : Anjone\r\n# URL : http://codeforces.com/contest/821/problem/A\r\nn = int(input())\r\narr = [ list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif( arr[i][j] != 1):\r\n\t\t\tcnt = 0\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tfor l in range(n):\r\n\t\t\t\t\tif(arr[i][k] + arr[l][j] == arr[i][j]):\r\n\t\t\t\t\t\tcnt += 1\r\n\t\t\tif(cnt == 0):\r\n\t\t\t\tprint(\"No\")\r\n\t\t\t\texit(0)\r\nprint (\"Yes\")", "n = int(input())\r\naij = [list(map(int,input().split())) for i in range(n)]\r\nans = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if aij[i][j] != 1:\r\n flag = 0\r\n for i2 in range(n):\r\n for j2 in range(n):\r\n if i2 != i and j2 != j and aij[i2][j] + aij[i][j2] == aij[i][j]:\r\n flag = 1\r\n \r\n if flag == 0:\r\n ans = \"NO\"\r\nprint(ans)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n mat = [[z for z in map(int,x.split())] for x in wtf[1:]]\r\n ans = 0\r\n for i in range(n):\r\n if ans == -1:\r\n break\r\n for j in range(n):\r\n if mat[i][j] != 1:\r\n f = False\r\n for l in range(n):\r\n if l != i:\r\n if mat[i][j]-mat[l][j] in mat[i]:\r\n f = True\r\n break\r\n if f is False:\r\n ans = -1\r\n print('Yes' if ans == 0 else 'No')\r\n", "def isClean(n, grid, rows, cols):\n for i in range(n):\n for j in range(n):\n idx = i*n+j\n if grid[idx] != 1:\n isValid = False\n for row_v in rows[i]:\n if grid[idx]-row_v in cols[j]:\n isValid = True\n break\n if not isValid:\n print('No')\n return\n print('Yes')\n\nn = int(input().strip())\ngrid = []\nfor i in range(n):\n row = list(map(int, input().strip().split(' ')))\n grid.extend(row)\n\nrows = [set() for _ in range(n)]\ncols = [set() for _ in range(n)]\n\nfor i in range(n):\n for j in range(n):\n idx = i*n+j\n rows[i].add(grid[idx])\n cols[j].add(grid[idx])\n\nisClean(n, grid, rows, cols)\n", "n = int(input())\nlab = list()\nfor _ in range(n):\n\tlab.append(list(map(int, input().split())))\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif lab[i][j] != 1:\n\t\t\tfor k in range(n):\n\t\t\t\tif lab[i][j] - lab[k][j] in lab[i]:\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tprint(\"No\")\n\t\t\t\texit()\n\nprint(\"Yes\")\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n grid.append([int(x) for x in input().split()])\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 1:\r\n continue\r\n found = False\r\n for x in range(n):\r\n for y in range(n):\r\n if grid[i][x] + grid[y][j] == grid[i][j]:\r\n found = True\r\n break\r\n if not found:\r\n print(\"No\")\r\n exit()\r\n \r\nprint(\"Yes\")", "import sys\n\ndef main(input):\n n = int(next(input))\n matrix = []\n for _ in range(n):\n matrix.append(list(map(int, next(input).split())))\n \n failed = False\n for i in range(n):\n for j in range(n):\n if matrix[i][j] == 1:\n continue\n found = False\n for x in range(n):\n for y in range(n):\n if matrix[i][x] + matrix[y][j] == matrix[i][j]:\n found = True\n if not found:\n failed = True\n print('Yes' if not failed else 'No')\nif __name__ == '__main__':\n main(iter(sys.stdin.readlines()))", "def check(r, c, x):\n rtn = False\n rs = [a[r][i] for i in range(n) if i != c]\n cs = [a[i][c] for i in range(n) if i != r]\n for r in rs:\n for c in cs:\n if r + c == x:\n rtn = True\n break\n return rtn\n\nn = int(input())\na = [list(map(int, input().split()))for _ in range(n)]\n\nans = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n ans &= check(i, j, a[i][j])\n\nprint('Yes' if ans else 'No')\n", "from sys import *\r\nn=int(input())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j]>1:\r\n a=0\r\n for ii in range(n):\r\n for jj in range(n):\r\n if l[i][jj]+l[ii][j]==l[i][j]:\r\n a+=1\r\n \r\n break\r\n if a: break\r\n else:\r\n print(\"No\"); exit()\r\nprint(\"Yes\")", "n=int(input())\r\nA=[]\r\nfor i in range(n):\r\n A += [list(map(int,input().split()))]\r\n\r\nv=True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i][j] != 1:\r\n f = False\r\n for x in range(n):\r\n for y in range(n):\r\n if A[x][j] + A[i][y]==A[i][j]:\r\n f = True\r\n break\r\n if f: break\r\n if not f:\r\n v = False\r\n break\r\n if not v: break\r\nif v:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "def main():\n read = lambda: tuple(map(int, input().split()))\n R = range(read()[0])\n m = [read() for i in R]\n b, d = 0, 0\n for x in R:\n for y in R:\n if m[y][x] > 1:\n b += 1\n f = False\n for t in R:\n if f: break\n for s in R:\n if m[y][x] == m[y][s] + m[t][x]:\n d += 1\n f = True\n break\n \n print(\"Yes\" if b == d else \"No\")\nmain()\n", "import sys\n\ndef find(l, c, v):\n\tfor li in range(n):\n\t\tfor co in range(n):\n\t\t\tif not (co == c and li == l):\n\t\t\t\tif labo[li][c] + labo[l][co] == v:\n\t\t\t\t\treturn True\n\treturn False\n\nn = int(sys.stdin.readline())\n\nlabo = [list(map(int, sys.stdin.readline().split()))for loop in range(n)]\ncontinuer = True\nfor l in range(n):\n\tif continuer:\n\t\tfor c in range(n):\n\t\t\tif continuer:\n\t\t\t\tif labo[l][c] != 1:\n\t\t\t\t\tif not find(l, c, labo[l][c]):\n\t\t\t\t\t\tcontinuer = False\nif continuer:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "import sys \n\ndef main():\n n = int(input())\n x = []\n for i in range(n):\n y = list(map(int,sys.stdin.readline().split()))\n x.append(y)\n\n for i in range(n):\n for j in range(n):\n if x[i][j] == 1:\n continue\n found = False\n for o in range(n):\n a = x[i][o]\n if o == j:\n continue\n for p in range(n):\n if p ==i:\n continue\n b = x[p][j]\n if a+b == x[i][j]:\n found = True\n break\n if found:\n break\n if not found:\n print(\"No\")\n return\n print(\"Yes\")\n \n\nmain()\n", "read = lambda: map(int, input().split())\nn = int(input())\na = [list(read()) for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1:\n for k in range(n):\n if a[i][j] - a[k][j] in a[i]:\n break\n else:\n print('No')\n exit()\nprint('Yes')", "def transpose(a):\r\n b=[i[:] for i in a]\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):b[i][j]=a[j][i]\r\n return b\r\n\r\nn=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\nat=transpose(a)\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j]!=1:\r\n sum=[k+l for k in a[i] for l in at[j]]\r\n if a[i][j] not in sum:\r\n print('NO')\r\n exit()\r\nprint('YES')", "from collections import Counter, deque, defaultdict\nimport math, sys\ninput = sys.stdin.readline\n\n\ndef check(r, c, grid, n):\n total = grid[r][c]\n for i in range(n):\n num1 = grid[i][c]\n # grid[i]\n for j in range(n):\n num2 = grid[r][j]\n if num2 + num1 == total:\n return True\n return False\n\n\n\nn = int(input())\ngrid = [list(map(int, input().split())) for i in range(n)]\n\nans = True\nfor i in range(n):\n for j in range(n):\n if grid[i][j] != 1:\n ans &= check(i, j, grid, n)\nprint(\"YES\" if ans else \"NO\")\n\n \n\n\n\n", "n = int(input())\r\nw = []\r\nfor _ in range(n):\r\n w += list(map(int, input().split()))\r\n\r\nans = \"YES\"\r\nfor i in range(n*n):\r\n if w[i] != 1:\r\n c = 0\r\n for j in range(i-i%n, i-i%n+n):\r\n if j != i:\r\n for k in range(i%n, n*n, n):\r\n if k != i:\r\n if w[j] + w[k] == w[i]:\r\n c += 1\r\n if c == 0:\r\n ans = \"NO\"\r\n break\r\n\r\nprint(ans)\r\n", "#! python3\n\ndef is_good(a, n, i, j):\n c = set([])\n for x in range(n):\n c.add(a[i][j] - a[i][x])\n for x in range(n):\n if a[x][j] in c:\n return True\n return False\n\nn = int(input())\na = []\nfor _ in range(n):\n a.append([int(x) for x in input().strip().split(' ')])\n\ngood = True\nfor i in range(n):\n for j in range(n):\n if a[i][j] != 1 and not is_good(a, n, i, j):\n good = False\n break\nif good:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nind=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j]!=1:\r\n ind.append([i,j])\r\n#print(ind)\r\ncheck=[]\r\nfor [i,j] in ind:\r\n flag=0\r\n for x in range(n):\r\n for y in range(n):\r\n if l[i][x]+l[y][j]==l[i][j]:\r\n check.append('Yes')\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\n#print(check)\r\nif len(check)==len(ind):\r\n print('Yes')\r\nelse:\r\n print('No')", "n=int(input())\r\ndata=[ list(map(int,input().split())) for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n mark=0\r\n if data[i][j]!=1:\r\n for k in range(n):\r\n flag=0\r\n if k==i:\r\n continue\r\n for l in range(n):\r\n if l==j:\r\n continue\r\n if data[i][j]==data[k][j]+data[i][l]:\r\n flag=1\r\n break\r\n if flag:\r\n break\r\n else:\r\n mark=1\r\n print('No')\r\n break\r\n if mark:\r\n break\r\nelse:\r\n print('Yes')\r\n", "\r\nn = int(input())\r\nl = []\r\nlc = [] \r\nfor _ in range(n):\r\n\tlc.append([])\r\nfor _ in range(n):\r\n\tli = list(map(int, input().split()))\r\n\tl.append(li)\r\n\r\n\tfor i in range(n):\r\n\t\tlc[i].append(li[i])\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif l[i][j] != 1:\r\n\t\t\tco = 0\r\n\t\t\tfor k in l[i]:\r\n\t\t\t\tfor m in lc[j]:\r\n\t\t\t\t\tif k + m == l[i][j]:\r\n\t\t\t\t\t\tco = 1\r\n\r\n\t\t\tif co == 0:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\n\r\nprint('YES')\r\n\r\n\r\n\r\n\r\n" ]

{"inputs": ["3\n1 1 2\n2 3 1\n6 4 1", "3\n1 5 2\n1 1 1\n1 2 3", "1\n1", "4\n1 1 1 1\n1 11 1 2\n2 5 1 4\n3 9 4 1", "4\n1 1 1 1\n1 7 1 1\n1 3 1 2\n2 6 3 1", "4\n1 1 1 1\n1 12 1 2\n4 4 1 3\n5 10 6 1", "4\n1 1 1 1\n1 13 1 2\n4 5 1 3\n5 11 6 1", "4\n1 1 1 1\n1 13 1 2\n4 5 1 3\n7 11 6 1", "4\n1 1 1 1\n1 14 1 6\n4 5 1 5\n3 8 2 1", "10\n3 2 6 5 1 2 1 1 2 1\n1 2 2 3 1 4 1 1 1 1\n1 1 3 1 2 2 2 1 1 1\n1 3 1 2 1 2 1 1 1 1\n12 1 4 3 3 1 1 1 2 1\n8 1 1 1 1 3 6 5 1 3\n1 1 1 2 4 1 3 2 1 1\n1 1 1 1 1 1 1 2 1 1\n1 2 1 1 1 1 1 1 1 1\n2 1 1 1 1 1 1 1 1 2", "4\n1 2 3 5\n1 1 1 1\n1 1 1 1\n1 1 1 1", "1\n2", "3\n1 1 4\n1 1 2\n1 1 2", "1\n5", "3\n1 2 1\n2 2 3\n1 3 1", "3\n2 1 1\n2 1 1\n2 1 1", "1\n60000"], "outputs": ["Yes", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No"]}

UNKNOWN

PYTHON3

CODEFORCES

171

cf630697f1a656cbd30ea39d80be45d2

Orchestra

Paul is at the orchestra. The string section is arranged in an *r*<=×<=*c* rectangular grid and is filled with violinists with the exception of *n* violists. Paul really likes violas, so he would like to take a picture including at least *k* of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take. Two pictures are considered to be different if the coordinates of corresponding rectangles are different. The first line of input contains four space-separated integers *r*, *c*, *n*, *k* (1<=≤<=*r*,<=*c*,<=*n*<=≤<=10, 1<=≤<=*k*<=≤<=*n*) — the number of rows and columns of the string section, the total number of violas, and the minimum number of violas Paul would like in his photograph, respectively. The next *n* lines each contain two integers *x**i* and *y**i* (1<=≤<=*x**i*<=≤<=*r*, 1<=≤<=*y**i*<=≤<=*c*): the position of the *i*-th viola. It is guaranteed that no location appears more than once in the input. Print a single integer — the number of photographs Paul can take which include at least *k* violas. Sample Input 2 2 1 1 1 2 3 2 3 3 1 1 3 1 2 2 3 2 3 2 1 1 3 1 2 2 Sample Output 4 1 4

[ "f = lambda: map(int, input().split())\r\nr, c, n, k = f()\r\nt = [list(f()) for i in range(n)]\r\ns = 0\r\nfor i in range(1, r + 1):\r\n for j in range(i, r + 1):\r\n for u in range(1, c + 1):\r\n for v in range(u, c + 1):\r\n s += sum([i <= x <= j and u <= y <= v for x, y in t]) >= k\r\nprint(s)", "r,c,n,p = map(int,input().split())\nresp = 0\nm = []\n\nfor i in range(r):\n\taux = []\n\tfor j in range(c):\n\t\taux.append(False)\n\tm.append(aux[:])\n\n\nfor i in range(n):\n\tx,y = map(int,input().split())\n\n\tm[x-1][y-1] = True\n\nfor i in range(r):\n\tfor j in range(c):\n\t\tfor a in range(r,i,-1):\n\t\t\tfor b in range(c,j,-1):\t\t\t\t\n\t\t\t\tcont = 0\n\t\t\t\tfor k in range(i,a):\n\t\t\t\t\tfor l in range(j,b):\n\t\t\t\t\t\tif m[k][l]:\n\t\t\t\t\t\t\tcont += 1\t\t\n\t\t\t\tif cont>=p:\n\t\t\t\t\tresp += 1\n\nprint(resp)", "from collections import defaultdict as Matrix\r\nfrom itertools import product\r\n\r\nr, c, n, k = map(int, input().split())\r\n\r\ndp = Matrix(int)\r\nfor _ in range(n):\r\n x, y = [int(cc) - 1 for cc in input().split()]\r\n for x0, y0 in product(range(x+1), range(y+1)):\r\n for x1, y1 in product(range(x, r), range(y, c)):\r\n if x0 <= x <= x1 and y0 <= y <= y1:\r\n dp[(x0, y0, x1, y1)] += 1\r\n\r\nans = sum(1 for v in dp.values() if v >= k)\r\nprint(ans)", "r, c, n, k = map(int, input().split())\r\ng = set([tuple(map(int, input().split())) for _ in range(n)])\r\nret = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for l in range(1, r-i+1):\r\n for w in range(1, c-j+1):\r\n count = 0\r\n for a in range(i, i+l):\r\n for b in range(j, j+w):\r\n if (a+1, b+1) in g:\r\n count += 1\r\n if count >= k:\r\n ret += 1\r\nprint(ret)\r\n", "from collections import Counter\r\n\r\nr, c, n, k = map(int, input().split())\r\n\r\ndp = Counter()\r\nfor _ in range(n):\r\n x, y = [int(cc) - 1 for cc in input().split()]\r\n for x0 in range(x + 1):\r\n for y0 in range(y + 1):\r\n for x1 in range(x, r):\r\n for y1 in range(y, c):\r\n dp[(x0, y0, x1, y1)] += 1\r\n\r\nans = sum(1 for v in dp.values() if v >= k)\r\nprint(ans)\r\n", "def count_possible_pictures(r, c, n, k, violists):\r\n count = 0\r\n\r\n for top in range(1, r + 1):\r\n for bottom in range(top, r + 1):\r\n for left in range(1, c + 1):\r\n for right in range(left, c + 1):\r\n violists_inside = sum(1 for x, y in violists if top <= x <= bottom and left <= y <= right)\r\n if violists_inside >= k:\r\n count += 1\r\n\r\n return count\r\n\r\n# Read input\r\nr, c, n, k = map(int, input().split())\r\nviolists = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the result\r\nresult = count_possible_pictures(r, c, n, k, violists)\r\nprint(result)", "a,b,c,d = map(int, input().split())\r\nA = [0] * a\r\nfor i in range(len(A)):\r\n A[i] = [0] * b\r\n\r\nfor i in range(c):\r\n per1, per2 = map(int, input().split())\r\n A[per1-1][per2-1] = 1\r\nans = 0\r\nfor i in range(a):\r\n for j in range(b):\r\n for k in range(i, a):\r\n for t in range(j, b):\r\n cou = 0\r\n for s in range(i, k+1):\r\n for m in range(j, t+1):\r\n if A[s][m] == 1:\r\n cou+=1\r\n if cou>= d:\r\n ans+=1\r\nprint(ans)", "r,c,n,k = map(int, input().split())\r\n\r\nG = [[0]*c for i in range(0,r)]\r\nfor i in range(0, n):\r\n a,b = map(int, input().split())\r\n a-=1\r\n b-=1\r\n G[a][b] = True\r\nans = 0\r\nfor x in range(0,r):\r\n for y in range(0,c):\r\n for y1 in range(y + 1, c + 1):\r\n for x1 in range(x + 1, r + 1):\r\n num = 0;\r\n for cl in range(y, y1):\r\n for rw in range(x, x1):\r\n if G[rw][cl]:\r\n num += 1\r\n if num >= k:\r\n ans+=1\r\n \r\nprint(ans)\r\n", "r,c,n,k = map(int,input().split())\r\nxy = [list(map(int,input().split())) for i in range(n)]\r\nfield = [[0]*c for i in range(r)]\r\nfor i in range(n):\r\n field[xy[i][0]-1][xy[i][1]-1] = 1\r\nnum = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for i2 in range(i,r):\r\n for j2 in range(j,c):\r\n num2 = 0\r\n for i3 in range(i,i2+1):\r\n for j3 in range(j,j2+1):\r\n if field[i3][j3] == 1:\r\n num2 += 1\r\n if num2 >= k:\r\n num += 1\r\nprint(num)\r\n", "from decimal import *\r\nimport math\r\nimport sys\r\nrasp_final=\"\"\r\ndef transformare_baza(numar,baza):\r\n transformare=\"\"\r\n while numar>=baza:\r\n rest=numar%baza\r\n numar=numar//baza\r\n transformare+=str(rest)\r\n transformare+=str(numar)\r\n noua_baza=transformare[::-1]\r\n return noua_baza\r\n\r\n\r\n\r\n \r\n#c=int(input())\r\nfor z in range(0,1):\r\n #print(c)\r\n r,c,n,k=list(map(int,input().split()))\r\n #stringul=input()\r\n #n=int(input())\r\n #lista=input()\r\n #lista=list(map(int,input().split()))\r\n matrix=[]\r\n a=[]\r\n \r\n for i in range(0,r):\r\n a=[]\r\n for j in range(0,c):\r\n a.append(\"*\")\r\n matrix.append(a)\r\n \r\n for i in range(0,n):\r\n rx,cx=list(map(int,input().split()))\r\n matrix[rx-1][cx-1]=\"#\"\r\n \r\n cate=0 \r\n for i in range(0,r):\r\n for j in range(0,c):\r\n \r\n for ii in range(i,r):\r\n for jj in range(j,c):\r\n #print(i,j,'ii=',ii,'jj=',jj)\r\n suma=0\r\n for iii in range(i,ii+1):\r\n for jjj in range(j,jj+1):\r\n #print(ii,jj,matrix[ii][jj])\r\n if matrix[iii][jjj]=='#':\r\n suma+=1\r\n if suma>=k:\r\n cate+=1\r\n \r\n \r\n #print(matrix) \r\n print(cate) \r\n \r\n ", "string, column, cnt, mincnt = map(int, input().split())\r\nmaps = [['*' for i in range(column)] for j in range(string)]\r\nfor i in range(cnt):\r\n a, b = map(int, input().split())\r\n maps[a - 1][b - 1] = '#'\r\nans = 0\r\nfor i in range(string):\r\n for j in range(column):\r\n for i1 in range(i, string):\r\n for j1 in range(j, column):\r\n num = 0\r\n for s in range(i, i1 + 1):\r\n for c in range(j, j1 + 1):\r\n if maps[s][c] == '#':\r\n num += 1\r\n if num >= mincnt:\r\n ans += 1\r\nprint(ans)", "import math\r\nimport string\r\n\r\n\r\ndef special_printer(l):\r\n for i in l:\r\n print(i)\r\n\r\n\r\ndef main_function():\r\n r, c, n, g = [int(i) for i in input().split(\" \")]\r\n table = [[0 for i in range(c)] for i in range(r)]\r\n for j in range(n):\r\n x, y = [int(i) - 1 for i in input().split(\" \")]\r\n table[x][y] = 1\r\n #special_printer(table)\r\n main_counter = 0\r\n for i in range(r):\r\n for j in range(i, r):\r\n for h in range(c):\r\n for u in range(h, c):\r\n counter = 0\r\n for f in range(i, j + 1):\r\n for v in range(h, u + 1):\r\n if table[f][v] == 1:\r\n counter += 1\r\n if counter >= g:\r\n main_counter += 1\r\n\r\n print(main_counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "r, c, n, k = [int(i) for i in input().split()]\r\na = [[0] * r for i in range(c)]\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n a[y - 1][x - 1] = 1\r\nct1 = 0\r\nfor i in range(c):\r\n for j in range(r):\r\n for s in range(i + 1, c + 1):\r\n for t in range(j + 1, r + 1):\r\n ct = 0\r\n for u in range(i, s):\r\n for v in range(j, t):\r\n if a[u][v] == 1:\r\n ct += 1\r\n if ct >= k:\r\n ct1 += 1\r\nprint(ct1)", "r,c,n,k = map(int,input().split())\r\na = [[0]*20 for i in range(20)]\r\nfor i in range(n):\r\n\tx,y = map(int,input().split())\r\n\ta[x-1][y-1] = 1\r\nans = 0\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tfor i2 in range(i, r):\r\n\t\t\tfor j2 in range(j, c):\r\n\t\t\t\tnum = 0\r\n\t\t\t\tfor i3 in range(i, i2+1):\r\n\t\t\t\t\tfor j3 in range(j, j2+1):\r\n\t\t\t\t\t\tif a[i3][j3]: num += 1\r\n\t\t\t\tif num >= k:\r\n\t\t\t\t\tans += 1\r\nprint(ans)\r\n", "r, c, n, k = map(int, input().split())\r\np = []\r\nfor i in range(r):\r\n p.append([0] * c)\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p[x - 1][y - 1] = 1\r\nans = 0\r\nfor i in range(r):\r\n for t in range(c):\r\n for e in range(r):\r\n for g in range(c):\r\n col = 0\r\n for h in range(i, e + 1):\r\n for f in range(t, g + 1):\r\n col += p[h][f]\r\n if col >= k:\r\n ans += 1\r\nprint(ans)\r\n", "r, c, n, k = list(map(int, input().split()))\r\nalt = []\r\ncount = 0\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n alt.append([a - 1, b - 1])\r\nfor x1 in range(r):\r\n for x2 in range(x1 + 1):\r\n for y1 in range(c):\r\n for y2 in range(y1 + 1):\r\n d = 0\r\n for i in range(n):\r\n if (alt[i][0] <= x1 and alt[i][0] >= x2 and alt[i][1] <= y1 and alt[i][1] >= y2):\r\n d += 1\r\n if d >= k:\r\n count += 1\r\nprint(count)", "r, c, n, k = list(map(int, input().split()))\r\nA = [2] * n\r\nfor i in range(n):\r\n A[i] = list(map(int, input().split()))\r\nanswer = 0\r\nfor i1 in range(1, r + 1):\r\n for j1 in range(1, c + 1):\r\n for i2 in range(i1, r + 1):\r\n for j2 in range(j1, c + 1):\r\n t = 0\r\n for i in range(n):\r\n if i1 <= A[i][0] <= i2 and j1 <= A[i][1] <= j2:\r\n t += 1\r\n answer += (t >= k)\r\nprint(answer)", "readInts=lambda: list(map(int, input().split()))\r\npos=[]\r\nr,c,n,k=readInts()\r\nfor i in range (n):\r\n x,y=readInts()\r\n pos.append([x-1,y-1])\r\nret=0\r\nfor i in range (r):\r\n for j in range(c):\r\n for ii in range(i,r):\r\n for jj in range(j,c):\r\n cnt=0\r\n for it in range(n):\r\n x,y=pos[it]\r\n if x>=i and x<=ii and y>=j and y<=jj:\r\n cnt+=1\r\n if cnt>=k:\r\n ret+=1\r\nprint(ret)", "r,c,n,k=map(int,input().split())\r\ngrid=[]\r\nfor i in range(r):\r\n grid.append([0]*c)\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n grid[x-1][y-1]=1\r\ncorx=[]\r\ncory=[]\r\nfor i in range(r+1):\r\n for t in range(r+1):\r\n if t>i:\r\n corx.append([i,t])\r\nfor i in range(c+1):\r\n for t in range(c+1):\r\n if t>i:\r\n cory.append([i,t])\r\nresult=0\r\nfor i in corx:\r\n for t in cory:\r\n pht=0\r\n for a in grid[i[0]:i[1]]:\r\n for m in a[t[0]:t[1]]:\r\n if m==1:\r\n pht+=1\r\n if pht>=k:\r\n result+=1\r\nprint(result)", "def main():\n from itertools import combinations\n r, c, n, k = map(int, input().split())\n r += 1\n c += 1\n l = [[0] * c for _ in range(r)]\n for _ in range(n):\n y, x = map(int, input().split())\n for i in range(y, r):\n row = l[i]\n for j in range(x, c):\n row[j] += 1\n print(sum(l[y][x] + l[i][j] - l[y][j] - l[i][x] >= k\n for i, y in combinations(range(r), 2)\n for j, x in combinations(range(c), 2)))\n\n\nif __name__ == '__main__':\n main()\n", "r, c, n, k = map(int, input().split())\r\nalist = [[0 for _ in range(c)] for _ in range(r)]\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n alist[x - 1][y - 1] = 1\r\n\r\nalist = [\"\".join(map(str, i)) for i in alist]\r\ncount = 0\r\n\r\nfor rows in range(r):\r\n for cols in range(c):\r\n \r\n for i in range(r - rows):\r\n for j in range(c - cols):\r\n astring = \"\".join([sub[j:j+cols+1] for sub in alist[i:i+rows+1]])\r\n \r\n if astring.count(\"1\") >= k:\r\n count += 1\r\n\r\nprint(count)\r\n", "r, c, n, k = map(int, input().split())\r\nd = [[0 for j in range(c+1)] for i in range(r+1)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n d[x][y] = 1\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n d[i][j] = d[i][j] + d[i-1][j] + d[i][j-1] - d[i-1][j-1]\r\na = 0\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n for x in range(i,r+1):\r\n for y in range(j,c+1):\r\n if d[x][y] - d[x][j-1] - d[i-1][y] + d[i-1][j-1] >= k:\r\n a += 1\r\n\r\nprint(a)\r\n", "r, c, n, k = map(int, input().split())\n\nboard = [[0 for col in range(c)] for row in range(r)]\nfor i in range(n):\n x, y = map(lambda x: int(x)-1, input().split())\n board[x][y] = 1\n\nphotos = 0\nfor x1 in range(r):\n for y1 in range(c):\n for x2 in range(x1, r):\n for y2 in range(y1, c):\n s = 0\n for row in range(x1, x2+1):\n s += sum(board[row][y1:y2+1])\n if s >= k:\n photos += 1\n\nprint(photos)\n", "r, c, n, k = map(int, input().split())\nA = [[0] * c for i in range(r)]\nfor i in range(n):\n a, b = map(int, input().split())\n A[a - 1][b - 1] = 1\n\nf = 0\ng = 0\nans = 0\nfor i in range(r):\n for j in range(c):\n for i2 in range(r - i):\n for j2 in range(c - j):\n cnt = 0\n for i3 in range(i, i + i2 + 1):\n for j3 in range(j, j + j2 + 1):\n #print(i3, j3)\n cnt += int(A[i3][j3] == 1)\n if cnt >= k:\n ans += 1\nprint(ans)", "def count(a,b,c,d):\n return sum([arr[i][j] for i in range(a,c + 1) for j in range(b,d + 1)])\n\ndef solve(r,c,n,m):\n ans = 0\n for i in range(1,r + 1):\n for j in range(1,c + 1):\n for k in range(i,r + 1):\n for l in range(j,c + 1):\n x = count(i,j,k,l)\n if x >= m:\n ans += 1\n return ans\n\nr,c,n,k = map(int,input().split())\n\narr = [[0 for i in range(20)] for j in range(20)]\n\nfor i in range(n):\n x,y = map(int,input().split())\n arr[x][y] = 1\n\nprint(solve(r,c,n,k))\n", "#!/usr/bin/env python3\n\nr, c, n, k = [int(x) for x in input().split()]\nmin_x, min_y, max_x, max_y = r, c, 1, 1\n\nalts = []\nfor i in range(0, n):\n x, y = [int(i) for i in input().split()]\n alts.append((x, y))\n\nphoto_count = 0\nfor x in range(1, r + 1):\n for y in range(1, c + 1):\n for w in range(1, r - (x - 1) + 1):\n for h in range(1, c - (y - 1) + 1):\n # print('x == {0}, y = {1}, w = {2}, l = {3}'.format(x, y, w, h))\n alt_count = 0\n for alt in alts:\n if x <= alt[0] <= x + w - 1 and y <= alt[1] <= y + h - 1:\n alt_count += 1\n # print('yay!')\n\n if alt_count >= k:\n photo_count += 1\n break\nprint(photo_count)\n", "read = lambda: map(int, input().split())\r\nr, c, n, k = read()\r\na = [[0] * (c + 1) for i in range(r + 1)]\r\nfor i in range(n):\r\n x, y = read()\r\n a[x][y] = 1\r\nd = [[0] * (c + 1) for i in range(r + 1)]\r\nfor i in range(1, r + 1):\r\n for j in range(1, c + 1):\r\n if a[i][j]: d[i][j] += 1\r\n if i == j == 0: continue\r\n p1 = d[i - 1][j] if i else 0\r\n p2 = d[i][j - 1] if j else 0\r\n p3 = d[i - 1][j - 1] if i and j else 0\r\n d[i][j] += p1 + p2 - p3\r\ncnt = 0\r\nfor x1 in range(r + 1):\r\n for y1 in range(c + 1):\r\n for x2 in range(x1 + 1, r + 1):\r\n for y2 in range(y1 + 1, c + 1):\r\n cur = d[x2][y2] - d[x2][y1] - d[x1][y2] + d[x1][y1]\r\n if cur >= k: cnt += 1\r\nprint(cnt)\r\n", "r, c, n, k = map(int, input().split())\r\ndata = [[False for i in range(c)] for j in range(r)]\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\tx -= 1\r\n\ty -= 1\r\n\tdata[x][y] = True\r\nans = 0\r\nfor a in range(r+1):\r\n\tfor b in range(c+1):\r\n\t\tfor e in range(r):\r\n\t\t\tfor d in range(c):\r\n\t\t\t\tcnt = 0\r\n\t\t\t\tflag = False\r\n\t\t\t\tfor i in range(a):\r\n\t\t\t\t\tfor j in range(b):\r\n\t\t\t\t\t\tif 0 <= e+i < r and 0 <= d+j < c:\r\n\t\t\t\t\t\t\tif data[e+i][d+j]:\r\n\t\t\t\t\t\t\t\tcnt += 1\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tflag = True\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\tif flag:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif flag:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tif cnt >= k:\r\n\t\t\t\t\tans += 1\r\nprint(ans)\r\n\r\n\r\n", "def cnt(x1, y1, x2, y2):\r\n ans = 0\r\n for i in range(y2, y1 + 1):\r\n for j in range(x1, x2 + 1):\r\n if lst[i][j] == 1:\r\n ans += 1\r\n return ans \r\n \r\n\r\nh, w, n, kk = map(int, input().split())\r\nanss = 0\r\nlst = [[0] * 20 for i in range(20)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n lst[x - 1][y - 1] = 1\r\nfor i in range(h):\r\n for j in range(w):\r\n for k in range(h):\r\n for z in range(w):\r\n if cnt(j, i, z, k) >= kk:\r\n anss += 1\r\nprint(anss) \r\n \r\n", "f = lambda: map(int, input().split())\r\nr, c, n, k = f()\r\nt = [[0] * (c + 1) for i in range(r + 1)]\r\nfor j in range(n):\r\n y, x = f()\r\n t[y][x] = 1\r\nfor y in range(r):\r\n p = t[y + 1]\r\n for x in range(c): p[x + 1] += p[x]\r\n t[y + 1] = [a + b for a, b in zip(p, t[y])]\r\ns = (c * c + c) * (r * r + r) >> 2\r\nfor y in range(r):\r\n for x in range(c):\r\n for a in range(1, c - x + 1):\r\n for b in range(1, r - y + 1):\r\n if t[y + b][x + a] + t[y][x] - t[y + b][x] - t[y][x + a] >= k: break\r\n s -= 1\r\nprint(s)", "# Counts the number of violists given a fixed initial position.\r\ndef count(orchestra, x1, y1, x2, y2):\r\n\trv = 0\r\n\t\r\n\tfor i in range(x1, x2+1):\r\n\t\tfor j in range(y1, y2+1):\r\n\t\t\tif orchestra[i][j] == 1:\r\n\t\t\t\trv += 1\r\n\t\t\t\r\n\treturn rv\r\n\r\ndef doit(r, c, n, k, pos):\r\n\torchestra = [[0 for x in range(c)] for x in range(r)] \r\n\r\n\t# Set where the violists are.\r\n\tfor i in pos:\r\n\t\torchestra[i[0]-1][i[1]-1] = 1\r\n\t\r\n\trv = 0\r\n\t\r\n\tfor i1 in range(r):\r\n\t\tfor i2 in range(c):\r\n\t\t\tfor i3 in range(i1, r):\r\n\t\t\t\tfor i4 in range(i2, c):\r\n\t\t\t\t\tif count(orchestra, i1, i2, i3, i4) >= k:\r\n\t\t\t\t\t\trv += 1\r\n\t\t\t\t\t\t\r\n\treturn rv\r\n\r\n\r\nif __name__ == '__main__':\r\n\targs = list(map(int, input().split()))\r\n\tr = args[0]\r\n\tc = args[1]\r\n\tn = args[2]\r\n\tk = args[3]\r\n\tpos = []\r\n\t\r\n\tfor i in range(n):\r\n\t\tz = list(map(int, input().split()))\r\n\t\tx = z[0]\r\n\t\ty = z[1]\r\n\t\tpos.append([x,y])\r\n\t\t\r\n\tprint(doit(r, c, n, k, pos))", "r,c,n,k=map(int,input().split())\r\nd=[[0 for i in range(c+1)] for _ in range(r+1)]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n d[x][y]=1\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n d[i][j]=d[i][j]+d[i][j-1]+d[i-1][j]-d[i-1][j-1]\r\ncount=0\r\nfor i in range(1,r+1):\r\n for j in range(1,c+1):\r\n for x in range(i,r+1):\r\n for y in range(j,c+1):\r\n if d[x][y]-d[x][j-1]-d[i-1][y]+d[i-1][j-1]>=k:\r\n count+=1\r\nprint(count)", "dhuang=0\r\na,b,c,d=map(int,input().split(' '))\r\nhuang = [['*']*b for _ in range(a)]\r\nfor i in range(c):\r\n x,y=map(int,input().split(' '))\r\n huang[x-1][y-1] = '#'\r\nfor i in range(a):\r\n for j in range(b):\r\n for k in range(i, a):\r\n for l in range(j, b):\r\n ct=0\r\n for m in range(i, k+1):\r\n for n in range(j, l+1):\r\n if huang[m][n]=='#':\r\n ct+=1\r\n if ct>=d:\r\n dhuang+=1\r\nprint(dhuang)\r\n", "L = lambda: [*map(int, input().split())]\r\n\r\nr, c, n, k = L()\r\nA = [L() for _ in range(n)]\r\n\r\nprint(sum(sum(a<=x<=b and f<=y<=g for x,y in A) >= k for a in range(1, r+1)\r\n for b in range(a, r+1)\r\n for f in range(1, c+1)\r\n for g in range(f, c+1)))", "r, c, n, k = map(int, input().split())\na = [tuple(map(int, input().split())) for _ in range(n)]\nans = 0\nfor x1 in range(1, r + 1):\n for x2 in range(x1, r + 1):\n for y1 in range(1, c + 1):\n for y2 in range(y1, c + 1):\n if len([1 for x, y in a if x1 <= x <= x2 and y1 <= y <= y2]) >= k:\n ans += 1\nprint(ans)\n\t\t\t \t \t \t\t \t \t\t\t\t\t\t", "r,c,n,k=map(int,input().split())\na=[[0 for i in range(0,c)] for j in range(0,r)]\nfor i in range(0,n):\n\tx,y=map(int,input().split())\n\tx=x-1\n\ty=y-1\n\ta[x][y]=1\nans=0\nfor i in range(0,r):\n\tfor j in range(0,c):\n\t\tfor u in range(i,r):\n\t\t\tfor v in range(j,c):\n\t\t\t\tt=0\n\t\t\t\tfor x in range(i,u+1):\n\t\t\t\t\tfor y in range(j,v+1):\n\t\t\t\t\t\tt+=a[x][y]\n\t\t\t\tif t>=k:\n\t\t\t\t\tans=ans+1\nprint(ans)\n", "r, c, n, k = map(int, input().split())\r\na = [[0 for i in range(0, c)] for j in range(0, r)]\r\nfor i in range(0, n):\r\n x, y = map(int, input().split())\r\n x = x - 1\r\n y = y - 1\r\n a[x][y] = 1\r\nans = 0\r\nfor i in range(0, r):\r\n for j in range(0, c):\r\n for u in range(i, r):\r\n for v in range(j, c):\r\n t = 0\r\n for x in range(i, u + 1):\r\n for y in range(j, v + 1):\r\n t += a[x][y]\r\n if t >= k:\r\n ans = ans + 1\r\nprint(ans);", "# You lost the game.\nr,c,n,k = map(int, input().split())\nV = [list(map(int, input().split())) for _ in range(n)]\n\nG = [[0 for _ in range(c)] for _ in range(r)]\nfor i in range(n):\n G[V[i][0]-1][V[i][1]-1] = 1\n\n\nT = [[0 for _ in range(c)] for _ in range(r)]\nT[0][0] = G[0][0]\nfor i in range(1,r):\n T[i][0] = G[i][0]\nfor i in range(r):\n for j in range(1,c):\n T[i][j] = T[i][j-1] + G[i][j]\nfor i in range(1,r):\n for j in range(c):\n T[i][j] += T[i-1][j]\nnb = 0\nfor x1 in range(c):\n for x2 in range(x1,c):\n for y1 in range(r):\n for y2 in range(y1,r):\n s = T[y2][x2]\n if x1 > 0:\n s -= T[y2][x1-1]\n if y1 > 0:\n s -= T[y1-1][x2]\n if x1 > 0 and y1 > 0:\n s += T[y1-1][x1-1]\n if s >= k:\n nb += 1\nprint(nb)\n", "def count(orchestra, initial, final):\r\n\tnum = 0\r\n\tfor i in range(initial[0], final[0]+1):\r\n\t\tfor j in range(initial[1], final[1]+1):\r\n\t\t\tif orchestra[i][j] == 1:\r\n\t\t\t\tnum += 1\r\n\r\n\treturn num\r\n\r\ndef getNumber(orchestra, initial, minimum):\r\n\tnum = 0\r\n\r\n\tfor i in range(initial[0], r):\r\n\t\tfor j in range(initial[1], c):\r\n\t\t\tfinal = [i, j]\r\n\t\t\tcounter = count(orchestra, initial, final)\r\n\r\n\t\t\tif counter >= k:\r\n\t\t\t\tnum += 1\r\n\r\n\tif initial[0] == len(orchestra):\r\n\t\treturn num\r\n\tif initial[1] == len(orchestra[0])-1:\r\n\t\tinitial[0] += 1\r\n\t\tinitial[1] = 0\r\n\telse:\r\n\t\tinitial[1] += 1\r\n\r\n\treturn num + getNumber(orchestra, initial, minimum)\r\n\r\nargs = list(map(int, input().split()))\r\nr = args[0]\r\nc = args[1]\r\nn = args[2]\r\nk = args[3]\r\n\r\npositions = []\r\n\r\n\r\nfor i in range(n):\r\n\tx = list(map(int, input().split()))\r\n\tpositions.append([x[0], x[1]])\r\n\r\norchestra = [[0]*c for i in range(r)]\r\n\r\nfor i in positions:\r\n\torchestra[i[0]-1][i[1]-1] = 1\r\n\r\nprint(getNumber(orchestra, [0, 0], k))", "w,h,v,n = map(int, input().split())\r\nV = [[False]*h for _ in range(w)]\r\nfor _ in range(v):\r\n x,y = map(int, input().split())\r\n V[x-1][y-1] = True\r\n\r\ndef calc(a, b, c, d):\r\n s = 0\r\n for x in range(a,c+1):\r\n for y in range(b, d+1):\r\n s += V[x][y];\r\n if s >= n: return s\r\n return s\r\n\r\nC = 0\r\nfor x1 in range(w):\r\n for y1 in range(h):\r\n for x2 in range(x1, w):\r\n for y2 in range(y1, h):\r\n if calc(x1, y1, x2, y2) >= n:\r\n C += 1\r\nprint(C)\r\n", "b, a, n, k = map(int, input().split())\r\ndata = [[0 for i in range(a)]for j in range(b)]\r\nfor i in range(n):\r\n xi, yi = map(int, input().split())\r\n xi -= 1\r\n yi -= 1\r\n data[xi][yi] = 1\r\nanswer = 0\r\nfor i in range(b):\r\n for j in range(a):\r\n for x in range(i, b):\r\n for y in range(j, a):\r\n counter = 0\r\n for x1 in range(min(i, x), max(i, x) + 1):\r\n for y1 in range(min(j, y), max(j, y) + 1):\r\n counter += data[x1][y1]\r\n if counter >= k:\r\n answer += 1\r\nprint(answer)", "r,c,n,k=map(int,input().split())\r\nviolas = set([tuple(map(int,input().split())) for i in range(n)])\r\nans = 0\r\nfor i in range(r):\r\n for j in range(c):\r\n for l in range(1, r-i+1):\r\n for w in range(1, c-j+1):\r\n ctr = 0\r\n for a in range(i, i+l):\r\n for b in range(j, j+w):\r\n if (a+1, b+1) in violas:\r\n ctr += 1\r\n if ctr >= k:\r\n ans += 1\r\nprint(ans)\r\n\r\n", "#they are all inclusive\nR, C, N, K = map(int, input().split())\nv = []\nfor i in range(N):\n v.append(tuple(map(int, input().split())))\nans = 0\nfor sr in range(1, R+1):\n for sc in range(1, C+1):\n for er in range(sr, R+1):\n for ec in range(sc, C+1):\n cnt = 0\n for x, y in v:\n if sr <= x <= er and sc <= y <= ec:\n cnt += 1\n if cnt >= K:\n ans += 1\nprint(ans)\n", "r, c, n, k = map(int, input().split())\r\na = []\r\nq = 0\r\nfor i in range(r):\r\n a.append([0] * c)\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[x - 1][y - 1] = 1\r\nfor i in range(r):\r\n for j in range(c):\r\n for m in range(r - i + 1):\r\n for p in range(c - j + 1):\r\n s = 0\r\n for d in range(i, i + m):\r\n for b in range(j, j + p):\r\n s += a[d][b]\r\n if s >= k:\r\n q += 1\r\nprint(q)", "r, c, n, k = [int(x) for x in input().split()]\nmus = [[0 for j in range(c)] for i in range(r)]\nfor t in range(n):\n x, y = [int(s)-1 for s in input().split()]\n mus[x][y] = 1\nans = 0\nfor i1 in range(r):\n for i2 in range(i1, r):\n for j1 in range(c):\n for j2 in range(j1, c):\n S = 0\n for x in range(i1, i2+1):\n for y in range(j1, j2+1):\n S += mus[x][y]\n if S >= k:\n ans += 1\nprint(ans)\n", "r, c, n, k = input().split()\r\nr, c, n, k = int(r), int(c), int(n), int(k)\r\n\r\nviolas = []\r\n\r\nfor _ in range(n):\r\n x, y = input().split()\r\n x, y = int(x) - 1, int(y) - 1\r\n violas.append((y,x))\r\n\r\ndef count_violas(x1, y1, x2, y2):\r\n global violas\r\n s = 0\r\n for x, y in violas:\r\n if x >= x1 and x <= x2 and y >= y1 and y <= y2:\r\n s += 1\r\n return s\r\n\r\nans = 0\r\nfor x1 in range(c):\r\n for y1 in range(r):\r\n for x2 in range(x1, c):\r\n for y2 in range(y1, r):\r\n if count_violas(x1, y1, x2, y2) >= k:\r\n ans += 1\r\n\r\nprint(ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\na = []\n\n(r, c, n, k) = (int(i) for i in input().split())\n\nfor i in range(n):\n a.append([int(i)-1 for i in input().split()])\n\nstart = time.time()\nans = 0\n\nfor x1 in range(r):\n for y1 in range(c):\n for x0 in range(x1+1):\n for y0 in range(y1+1):\n now = 0\n for i in range(n):\n if (a[i][0] >= x0) and (a[i][0] <= x1) and (a[i][1] >= y0) and (a[i][1] <= y1):\n now +=1\n\n if now >= k:\n ans += 1\n\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "import io\nimport sys\nimport time\nimport random\n#~ start = time.clock()\n#~ test = '''2 2 1 1\n#~ 1 2'''\n#~ test = '''3 2 3 3\n#~ 1 1\n#~ 3 1\n#~ 2 2'''\n#~ test = '''3 2 3 2\n#~ 1 1\n#~ 3 1\n#~ 2 2'''\n\n#~ sys.stdin = io.StringIO(test)\n\nr,c,n,k = map(int,input().split()) # row column number-of-violists\ndata = [ [0 for i in range(c)] for j in range(r) ]\n#~ print(r,c,n,k)\n\nfor i in range(n):\n x,y = map(int,input().split()) # row column\n data[x-1][y-1] = 1\n\nnviolists = [ [0 for i in range(c)] for j in range(r) ]\n\nfor r1 in range(r):\n count = 0\n for c1 in range(c):\n count += data[r1][c1]\n nviolists[r1][c1] = (nviolists[r1-1][c1] if r1>0 else 0) \\\n + count\n #~ print(r1,c1,nviolists[r1][c1],nviolists[r1][c1-1])\n #~ print(nviolists)\n\ncount = 0\nfor r1 in range(r):\n for r2 in range(r1,r):\n for c1 in range(c):\n for c2 in range(c1,c):\n # between (r1,c1) and (r2,c2)\n \n vcount = nviolists[r2][c2] \\\n - (nviolists[r1-1][c2] if r1>0 else 0) \\\n - (nviolists[r2][c1-1] if c1>0 else 0) \\\n + (nviolists[r1-1][c1-1] if r1*c1>0 else 0)\n if vcount>=k:\n #~ print( (r1,c1), (r2,c2) )\n count +=1 \n \n\nprint(count) \n#~ dur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "s = input()\r\nS = s.split()\r\nx = int(S[0])\r\ny = int(S[1])\r\nn = int(S[2])\r\nk = int(S[3])\r\na = [[\"*\" for i in range(x)]for j in range(y)]\r\nfor i in range(n):\r\n alt = input()\r\n ALT = alt.split()\r\n a[int(ALT[1]) - 1][int(ALT[0]) - 1] = \"#\"\r\nanswer = 0\r\nfor x1 in range(x):\r\n for y1 in range(y):\r\n for x2 in range(x1, x):\r\n for y2 in range(y1, y):\r\n count = 0\r\n for i in range(x1, x2+1):\r\n for j in range(y1, y2+1):\r\n if a[j][i] == \"#\":\r\n count+=1\r\n if count >= k:\r\n answer+=1\r\nprint(answer)\r\n", "def check(x1, y1, x2, y2):\r\n global dp\r\n cnt = 0\r\n for i in range(x2, x1 + 1):\r\n for j in range(y2, y1 + 1):\r\n cnt += dp[i][j]\r\n return cnt\r\n\r\n\r\n#n = int(input())\r\nr, c, n, k = map(int, input().split())\r\n#s = list(map(int, input().split()))\r\ndp = [[0] * c for i in range(r)]\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n dp[a - 1][b - 1] = 1\r\nanswer = 0\r\nfor x1 in range(r):\r\n for y1 in range(c):\r\n for x2 in range(x1 + 1):\r\n for y2 in range(y1 + 1):\r\n cnt = check(x1, y1, x2, y2)\r\n #print(cnt, x1, y1, x2, y2)\r\n if cnt >= k:\r\n answer += 1\r\nprint(answer)\r\n ", "r, c, n, k = map(int, input().split())\r\n\r\nM = [['*'] * c for i in range(r)]\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n M[x-1][y-1] = '#'\r\n\r\ndef contain(M, k, x1, y1, x2, y2):\r\n for i in range(x1, x2+1):\r\n for j in range(y1, y2+1):\r\n if M[i][j] == '#':\r\n k -= 1\r\n return k <= 0\r\n\r\nans = 0\r\nfor x1 in range(r):\r\n for y1 in range(c):\r\n for x2 in range(x1, r): \r\n for y2 in range(y1, c):\r\n if contain(M, k, x1, y1, x2, y2):\r\n ans += 1\r\nprint(ans)", "r, c, n, k = map(int, input().split())\r\ng, v = [[False] * c for i in range(r)], 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n g[x - 1][y - 1] = True\r\nfor a in range(r):\r\n for b in range(c):\r\n for e in range(a, r):\r\n for f in range(b, c):\r\n x = sum(g[i][j] for i in range(a, e + 1) for j in range(b, f + 1))\r\n if x >= k:\r\n v += 1\r\nprint(v)", "grid = lambda:map(int, input().split()) \n\nrows , columns , n , k = grid() \n\nt = [ list ( grid()) for i in range ( n )] \n\ns = 0 \n\nfor i in range(1 , rows + 1):\n for j in range(i , rows + 1):\n for u in range(1 , columns + 1):\n for v in range(u , columns + 1):\n s += sum([i <= x <= j and u <= y <= v for x , y in t]) >= k \n\nprint(s)\n", "r,c,n,k = map(int,input().split())\r\ns = [[0] * c for i in range(r)]\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n s[x-1][y-1] = 1\r\nres = 0\r\nfor br in range(r):\r\n for bc in range(c):\r\n for er in range(br,r):\r\n for ec in range(bc,c):\r\n counter = 0\r\n for i in range(br, er+1):\r\n for j in range(bc, ec+1):\r\n if s[i][j] == 1: counter += 1\r\n if counter >= k : res += 1\r\n \r\nprint(res)" ]

{"inputs": ["2 2 1 1\n1 2", "3 2 3 3\n1 1\n3 1\n2 2", "3 2 3 2\n1 1\n3 1\n2 2", "1 1 1 1\n1 1", "10 10 10 10\n6 1\n3 8\n10 6\n10 3\n10 4\n8 9\n2 3\n5 7\n5 9\n5 1", "10 10 10 1\n8 2\n9 10\n6 8\n10 7\n1 8\n4 4\n6 3\n2 3\n8 8\n7 2", "5 9 2 2\n4 6\n1 5", "6 4 10 2\n2 3\n2 1\n1 2\n6 1\n1 4\n4 4\n2 4\n1 1\n6 3\n4 2", "8 2 4 4\n3 2\n3 1\n2 2\n7 1", "2 6 2 2\n1 2\n1 5", "7 5 3 1\n5 5\n4 5\n1 4", "10 10 10 6\n3 4\n10 9\n6 5\n4 9\n2 10\n10 10\n9 8\n8 2\n5 6\n1 5", "10 10 10 4\n5 7\n9 7\n5 8\n3 7\n8 9\n6 10\n3 2\n10 8\n4 1\n8 10", "10 10 10 1\n8 10\n2 9\n1 10\n3 1\n8 5\n10 1\n4 10\n10 2\n5 3\n9 3", "10 10 10 3\n2 7\n6 3\n10 2\n2 4\n7 8\n1 2\n3 1\n7 6\n6 8\n9 7", "10 10 10 2\n4 4\n1 7\n10 5\n2 8\n5 5\n6 9\n7 3\n9 5\n5 3\n6 6", "10 10 10 10\n8 2\n1 4\n9 9\n5 2\n1 7\n1 5\n3 10\n6 9\n7 8\n3 3", "10 10 10 10\n1 9\n5 2\n5 1\n8 5\n9 10\n10 2\n5 4\n4 3\n3 6\n1 5", "10 10 10 10\n5 6\n4 4\n8 9\n5 7\n9 2\n6 4\n7 3\n6 10\n10 3\n3 8", "10 10 10 1\n9 3\n7 5\n8 2\n3 8\n1 6\n3 9\n7 3\n10 4\n5 3\n1 3", "10 10 10 1\n1 10\n10 8\n7 4\n7 2\n1 3\n6 6\n10 1\n2 7\n9 3\n3 10", "10 10 10 1\n4 5\n9 6\n3 6\n6 10\n5 2\n1 7\n4 9\n10 8\n8 1\n2 9"], "outputs": ["4", "1", "4", "1", "4", "2073", "40", "103", "4", "8", "135", "78", "414", "1787", "751", "1416", "4", "1", "6", "1987", "1991", "2082"]}

UNKNOWN

PYTHON3

CODEFORCES

54

cf63babc63476bee39388e4e1d25d2b4

Trees

On Bertown's main street *n* trees are growing, the tree number *i* has the height of *a**i* meters (1<=≤<=*i*<=≤<=*n*). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. This means that the heights of trees on ends (the 1st one and the *n*-th one) should be equal to each other, the heights of the 2-nd and the (*n*<=-<=1)-th tree must also be equal to each other, at that the height of the 2-nd tree should be larger than the height of the first tree by 1, and so on. In other words, the heights of the trees, standing at equal distance from the edge (of one end of the sequence) must be equal to each other, and with the increasing of the distance from the edge by 1 the tree height must also increase by 1. For example, the sequences "2 3 4 5 5 4 3 2" and "1 2 3 2 1" are beautiful, and '1 3 3 1" and "1 2 3 1" are not. Changing the height of a tree is a very expensive operation, using advanced technologies invented by Berland scientists. In one operation you can choose any tree and change its height to any number, either increase or decrease. Note that even after the change the height should remain a positive integer, i. e, it can't be less than or equal to zero. Identify the smallest number of changes of the trees' height needed for the sequence of their heights to become beautiful. The first line contains integer *n* (1<=≤<=*n*<=≤<=105) which is the number of trees. The second line contains integers *a**i* (1<=≤<=*a**i*<=≤<=105) which are the heights of the trees. Print a single number which is the minimal number of trees whose heights will have to be changed for the sequence to become beautiful. Sample Input 3 2 2 2 4 1 2 2 1 Sample Output 1 0

[ "n=int(input())\r\na= list(map(int, input().split()))\r\n \r\nx=[n]*100001\r\nfor i in range(n):\r\n x[a[i]-min(n-i-1,i)]-=1\r\nprint (min(x[1:]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = [n]*100001\r\n\r\nfor i in range(n):\r\n x[a[i]-min(n-i-1, i)]-=1\r\nprint(min(x[1:]))", "n=int(input());\r\nx=[n]*4**9;\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n x[a[i]-min(i,n-i-1)]-=1\r\nprint(min(x[1:7**6]))", "n = int(input())\r\na = [0] * 100005\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[l[i] - min(i, n - i - 1)] += 1\r\nprint(n - max(a[1::]))", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[0]*n\r\nfrom collections import Counter\r\nc=Counter()\r\nfor i in range(n//2):\r\n b[i]=b[n-i-1]=i+1\r\nif n%2: b[n//2]=n//2+1\r\nfor i in range(n):\r\n if a[i]>=b[i]: c[a[i]-b[i]]+=1\r\nans=n-max(c.values())\r\nprint(ans)\r\n", "# LUOGU_RID: 99389245\nn = int(input())\r\ns = 0\r\nt = [0]*100005\r\nms = list(map(int,input().split()))\r\na = 0\r\nfor i in ms:\r\n a += 1\r\n i -= min(a,n-a+1)\r\n if i >= 0:\r\n t[i-1] += 1\r\n s = max(s,t[i-1])\r\nprint(n-s)\r\n", "# LUOGU_RID: 111554051\nfrom sys import stdin \nfrom collections import defaultdict \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nn = int(input()) \nlst = [0] + list(get()) \nd = defaultdict(int) \nres = 0 \n\nfor i in range(1, n + 1) : \n\n t = lst[i] \n t -= min(i, n - i + 1) \n\n if t >= 0 : \n d[t] += 1\n res = max(res, d[t]) \n\nprint(n - res)" ]

{"inputs": ["3\n2 2 2", "4\n1 2 2 1", "3\n61452 50974 73849", "4\n86002 1199 86003 86002", "5\n92605 92606 41969 98774 92605", "10\n1 1 2 3 4 4 3 2 1 10", "10\n73905 73906 73907 85732 73909 73909 73908 73907 73906 73905", "10\n60718 99414 65042 65043 65044 38495 95782 65042 65041 65040", "7\n1 2 3 7 6 5 4", "5\n4 5 6 5 1", "1\n100000", "5\n1 1 1 1 1", "7\n1 2 3 7 6 5 4", "1\n2727", "5\n1 2 3 2 4", "9\n100 12 13 14 15 14 13 12 11", "5\n2 4 5 4 2", "5\n3 3 4 3 2"], "outputs": ["1", "0", "2", "1", "2", "9", "1", "4", "3", "1", "0", "3", "3", "0", "1", "1", "2", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

7

cf6b0edd29a966dde1de8aa4a4467b6b

Mike and Geometry Problem

Mike wants to prepare for IMO but he doesn't know geometry, so his teacher gave him an interesting geometry problem. Let's define *f*([*l*,<=*r*])<==<=*r*<=-<=*l*<=+<=1 to be the number of integer points in the segment [*l*,<=*r*] with *l*<=≤<=*r* (say that ). You are given two integers *n* and *k* and *n* closed intervals [*l**i*,<=*r**i*] on *OX* axis and you have to find: In other words, you should find the sum of the number of integer points in the intersection of any *k* of the segments. As the answer may be very large, output it modulo 1000000007 (109<=+<=7). Mike can't solve this problem so he needs your help. You will help him, won't you? The first line contains two integers *n* and *k* (1<=≤<=*k*<=≤<=*n*<=≤<=200<=000) — the number of segments and the number of segments in intersection groups respectively. Then *n* lines follow, the *i*-th line contains two integers *l**i*,<=*r**i* (<=-<=109<=≤<=*l**i*<=≤<=*r**i*<=≤<=109), describing *i*-th segment bounds. Print one integer number — the answer to Mike's problem modulo 1000000007 (109<=+<=7) in the only line. Sample Input 3 2 1 2 1 3 2 3 3 3 1 3 1 3 1 3 3 1 1 2 2 3 3 4 Sample Output 5 3 6

[ "from collections import defaultdict\r\n\r\nmod=10**9+7\r\nMAXN=300001\r\n\r\ndef power(a,b):\r\n\r\n res=1\r\n while b>0:\r\n if b&1:\r\n res=(res*a)%mod\r\n b>>=1\r\n a=(a*a)%mod\r\n \r\n return res\r\n\r\nfact=[1 for _ in range(MAXN)]\r\ninv_fact=[1 for _ in range(MAXN)]\r\n\r\nfor i in range(2,MAXN):\r\n fact[i]=(fact[i-1]*i)%mod\r\n inv_fact[i]=power(fact[i],mod-2)\r\n\r\ndef ncr(n,r):\r\n if n<r:\r\n return 0\r\n return (((fact[n]*inv_fact[r])%mod)*inv_fact[n-r])%mod\r\n\r\nn,k=map(int,input().split())\r\n\r\nmp=defaultdict(int)\r\n\r\nend_points=[]\r\n\r\nfor _ in range(n):\r\n l,r=map(int,input().split())\r\n mp[l]+=1\r\n mp[r+1]-=1\r\n\r\nend_points=list(mp.keys())\r\n\r\nend_points.sort()\r\n\r\nans=0\r\ncurr=0\r\n\r\nfor i in range(len(end_points)-1):\r\n curr+=mp[end_points[i]]\r\n ans+=(end_points[i+1]-end_points[i])*ncr(curr,k)\r\n if ans>=mod:\r\n ans%=mod\r\n\r\nprint(ans)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef comb(n, r):\r\n return fact[n] * inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nl = n + 5\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\nlr = [tuple(map(int, input().split())) for _ in range(n)]\r\ns = set()\r\nfor l, r in lr:\r\n s.add(l)\r\n s.add(r + 1)\r\ns = list(s)\r\ns.sort()\r\nd = dict()\r\nm = len(s)\r\nfor i in range(m):\r\n d[s[i]] = i\r\ncnt = [0] * m\r\nfor l, r in lr:\r\n cnt[d[l]] += 1\r\n cnt[d[r + 1]] -= 1\r\nfor i in range(1, m):\r\n cnt[i] += cnt[i - 1]\r\nans = 0\r\nfor i in range(m - 1):\r\n ans += comb(cnt[i], k) * (s[i + 1] - s[i]) % mod\r\n ans %= mod\r\nprint(ans)", "M=10**9+7\r\nR=2*10**5\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\nn,k=[int(e) for e in input().split()]\r\nE=[]\r\nfor i in range(n):\r\n l,r=[int(e) for e in input().split()]\r\n r+=1\r\n E.append([l,1])\r\n E.append([r,-1])\r\nE.sort()\r\ny=0\r\ni=0\r\nc=0\r\nwhile i<len(E)-1 and E[i][0]<E[-1][0]:\r\n j=i\r\n while j<len(E) and E[j][0]==E[i][0]:\r\n c+=E[j][1]\r\n j+=1\r\n y+=C(c,k)*(E[j][0]-E[i][0])\r\n y%=M\r\n i=j\r\nprint(y)", "MOD = 10**9 + 7\r\n\r\nfrom sys import stderr\r\n\r\ndef readints():\r\n return [int(fld) for fld in input().strip().split()]\r\n\r\ndef combk(n, k, MOD=MOD, tbl=[]):\r\n if len(tbl) < k:\r\n tbl += [0] * k + [1]\r\n while n >= len(tbl):\r\n tbl.append(tbl[-1] * len(tbl) * pow(len(tbl) - k, MOD-2, MOD) % MOD)\r\n return tbl[n]\r\n\r\ndef main():\r\n n, k = readints()\r\n pairs = [readints() for _ in range(n)]\r\n oplist = [p for l, r in pairs for p in (2*l, 2*r+1)]\r\n oplist.sort()\r\n count = total = 0\r\n pos = oplist[0] // 2\r\n for op in oplist:\r\n if op & 1:\r\n i, delta = (op+1)//2, -1\r\n else:\r\n i, delta = op//2, 1\r\n total = (total + combk(count, k) * (i - pos)) % MOD\r\n pos = i\r\n count += delta\r\n print(total)\r\n\r\nmain()" ]

{"inputs": ["3 2\n1 2\n1 3\n2 3", "3 3\n1 3\n1 3\n1 3", "3 1\n1 2\n2 3\n3 4", "1 1\n45 70", "1 1\n-35 -8", "1 1\n-79 -51", "2 2\n26 99\n-56 40", "9 6\n-44 -29\n-11 85\n11 84\n-63 1\n75 89\n-37 61\n14 73\n78 88\n-22 -18", "2 2\n-93 -22\n12 72"], "outputs": ["5", "3", "6", "26", "28", "29", "15", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

4

cf86a8bbd6a48bb925bc9ed62354e875

World Cup

The last stage of Football World Cup is played using the play-off system. There are *n* teams left in this stage, they are enumerated from 1 to *n*. Several rounds are held, in each round the remaining teams are sorted in the order of their ids, then the first in this order plays with the second, the third — with the fourth, the fifth — with the sixth, and so on. It is guaranteed that in each round there is even number of teams. The winner of each game advances to the next round, the loser is eliminated from the tournament, there are no draws. In the last round there is the only game with two remaining teams: the round is called the Final, the winner is called the champion, and the tournament is over. Arkady wants his two favorite teams to play in the Final. Unfortunately, the team ids are already determined, and it may happen that it is impossible for teams to meet in the Final, because they are to meet in some earlier stage, if they are strong enough. Determine, in which round the teams with ids *a* and *b* can meet. The only line contains three integers *n*, *a* and *b* (2<=≤<=*n*<=≤<=256, 1<=≤<=*a*,<=*b*<=≤<=*n*) — the total number of teams, and the ids of the teams that Arkady is interested in. It is guaranteed that *n* is such that in each round an even number of team advance, and that *a* and *b* are not equal. In the only line print "Final!" (without quotes), if teams *a* and *b* can meet in the Final. Otherwise, print a single integer — the number of the round in which teams *a* and *b* can meet. The round are enumerated from 1. Sample Input 4 1 2 8 2 6 8 7 5 Sample Output 1 Final! 2

[ "x=input().split()\nx=[int(i) for i in x]\nx.sort()\nturn = 1\nwhile(not(x[0]%2==1 and x[1]%2==0 and (x[1]-x[0])==1)):\n\t#print(x[0],x[1])\n\tx[0]=(x[0])//2 + x[0]%2\n\tx[1]=(x[1])//2 + x[1]%2\n\tturn+=1\ncount = 1\nprod=2\nwhile(prod != x[2]):\n\tprod=prod*2\n\tcount+=1\nif(count==turn):\n\tprint(\"Final!\")\nelse:\n\tprint(turn)\n", "v, a, b = list(map(int, input().split()))\r\nc = []\r\nm = True\r\ng = 0\r\nfor i in range(v):\r\n c.append([i + 1])\r\nfor i in range(8):\r\n g += 1\r\n for h in range(int(v / 2)):\r\n if len(c) == 2:\r\n print(\"Final!\")\r\n m = False\r\n break\r\n for l in range(len(c[h + 1])):\r\n c[h].append(c[h + 1][l])\r\n c.remove(c[h + 1])\r\n if len(set(c[h]).intersection([a, b])) == 2:\r\n m = False\r\n print(g)\r\n break\r\n if m == False:\r\n break\r\n v = v / 2\r\n", "n,a,b=[int(i) for i in input().split()]\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(i)\r\nnd=0\r\nwhile len(ans)>=2:\r\n newans=[]\r\n for i in range(0,len(ans)-1,2):\r\n if (ans[i]==a and ans[i+1]==b) or (ans[i]==b and ans[i+1]==a):\r\n if (len(ans)==2):\r\n print('Final!')\r\n else:\r\n print(nd+1)\r\n break\r\n elif ans[i]==a or ans[i+1]==a:\r\n newans.append(a)\r\n elif ans[i]==b or ans[i+1]==b:\r\n newans.append(b)\r\n else:\r\n newans.append(ans[i])\r\n nd+=1\r\n ans=newans\r\n", "n, a, b, i, z = map(int, input().split() + [1, 0])\r\nwhile i < n:\r\n if (a - 1)//i == (b - 1)//i:\r\n exit(print(z))\r\n i, z = i * 2, z + 1\r\nprint('Final!')", "n, a, b = map(int, input().split())\na -= 1\nb -= 1\na += n\nb += n\n\nres = 0\nwhile a != b:\n # print(a, b)\n a //= 2\n b //= 2\n res += 1\nif a == 1:\n print('Final!')\nelse:\n print(res)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\ncnt = 0\r\nlg = 0\r\nwhile (1 << lg) != n:\r\n lg += 1\r\nfor i in range(lg - 1, -1, -1):\r\n if ((a >> i) & 1) == ((b >> i) & 1):\r\n cnt += 1\r\n else:\r\n break\r\nif cnt == 0:\r\n print('Final!')\r\nelse:\r\n print(lg - cnt)", "import math\n\n\nline = input()\nn, a, b = list(map(int, line.strip().split()))\ntotal = int(math.log2(n))\n\n#print(n, a, b)\nif a > b:\n a, b = b, a\nl, r = 1, n\ncount = 0\nwhile True:\n mid = (l + r) // 2\n if a <= mid and b > mid:\n break\n if a > mid:\n l = mid + 1\n elif b <= mid:\n r = mid\n count += 1\n\nif count == 0:\n print(\"Final!\")\nelse:\n print(total - count)\n\n\n\t\t \t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t\t", "n, a, b = map(int, input().split())\nd = bin((a-1)^(b-1))\nr = len(d) - d.find('1', 2)\nprint('Final!' if r == (n-1).bit_length() else r)\n\n \t \t \t\t \t\t\t \t \t", "def solve():\n dd = input()\n d = dd.split()\n n, a, b = int(d[0]), int(d[1]), int(d[2]),\n count = 1\n while n >= 2:\n m = min(a, b)\n g = max(a, b)\n if m % 2 == 1 and g % 2 == 0 and g == m + 1:\n if n == 2:\n print(\"Final!\")\n else:\n print(count)\n break\n a = a // 2 + 1 if a % 2 == 1 else a / 2\n b = b // 2 + 1 if b % 2 == 1 else b / 2\n count += 1\n n /= 2\n\n\n# main\nif __name__ == \"__main__\":\n solve()\n", "import math\r\nn, a, b = map(int, input().split())\r\n\r\nrmax = int(math.log(n, 2))\r\nr = 1\r\na -= 1\r\nb -= 1\r\nfor i in range(rmax):\r\n if a == b:\r\n break\r\n a = a // 2\r\n b = b // 2\r\n r += 1\r\nif r-1 == rmax:\r\n print(\"Final!\")\r\nelse:\r\n print(r-1)\r\n\r\n", "n, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\n\r\nd = abs(b-a)\r\ni = 1\r\n\r\nwhile (a//(2**i) != b//(2**i)):\r\n i += 1\r\n\r\nif 2**i == n:\r\n print('Final!')\r\nelse:\r\n print(i)", "#931B - World Cup\r\ninp = input().split(' ')\r\nn, a, b = int(inp[0]), int(inp[1]), int(inp[2])\r\na,b = min(a,b) - 1, max(a,b) - 1\r\nrnd, res = 0, -1\r\nwhile (n > 1):\r\n k = n // 2\r\n rnd += 1\r\n if (a < k and b >= k and res == -1):\r\n res = rnd\r\n n,a,b = k, a%k, b%k\r\nif res == 1:\r\n print('Final!')\r\nelse:\r\n print(rnd - res + 1)", "'''input\r\n8 7 5\r\n'''\r\nfrom math import log2 as ln\r\nn, a, b = [int(i) for i in input().split(\" \")]\r\na, b = sorted([a, b])\r\nfn = ln(n)\r\nl = [i for i in range(1, n + 1)]\r\nans = 0\r\nt = 0\r\nfor _ in range(10):\r\n\tm = []\r\n\tif len(l) == 0:\r\n\t\tbreak\r\n\tans += 1\r\n\tfor i in range(0, len(l) - 1, 2):\r\n\t\tif [l[i], l[i + 1]] == [a, b]:\r\n\t\t\tt = 1\r\n\t\t\tbreak\r\n\t\telif l[i] == a:\r\n\t\t\tm.append(a)\r\n\t\telif l[i] == b:\r\n\t\t\tm.append(b)\r\n\t\telif l[i + 1] == a:\r\n\t\t\tm.append(a)\r\n\t\telif l[i + 1] == b:\r\n\t\t\tm.append(b)\r\n\t\telse:\r\n\t\t\tm.append(l[i])\r\n\tif t == 1:\r\n\t\tbreak\r\n\tl = m.copy()\r\nif ans == fn:\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(ans)\t\r\n\r\n\r\n\t\t\r\n\t\r\n\r\n", "n, a, b = (int(x) for x in input().split())\r\na -= 1\r\nb -= 1\r\nans = 0\r\nwhile True:\r\n a = a // 2\r\n b = b // 2\r\n ans += 1\r\n if a == b:\r\n if n == 2:\r\n print(\"Final!\")\r\n else:\r\n print(ans)\r\n break\r\n n = n // 2", "from sys import stdin,stdout\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):\n n,a,b=lst()\n t=[i for i in range(1,n+1)]\n ans=1;f=0\n while 1:\n new=[]\n for i in range(0,len(t),2):\n if t[i] in [a,b] and t[i+1] in [a,b]:\n f=1\n break\n elif t[i] in [a,b] and t[i+1] not in [a,b]:\n new+=[t[i]]\n elif t[i] not in [a, b] and t[i + 1] in [a, b]:\n new += [t[i+1]]\n else:new+=[t[i]]\n if f:break\n t=new.copy()\n ans+=1\n print('Final!' if len(t)==2 else ans)\n\t \t\t\t \t\t\t \t \t\t\t\t\t \t", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\na, b, c = map(int, input().split())\ncnt = 0\nb += a - 1\nc += a - 1\nwhile b != c:\n b >>= 1\n c >>= 1\n cnt += 1\nif b == 1:\n print(\"Final!\")\nelse:\n print(cnt)\n", "import base64\nimport zlib\ns=\"\"\"eJxtkE2OwyAMhfc+hbsCqkz6t4vEtpcYzYKoJLKUOggTaXr7cYcm6qLePGzeZ56ge5pzwTGWFESA\naisPAbjFfhnR4zVMEgFoQDNPj3sy6P0KtKqLxGxdB6ilYCvlRqzcnCJbU6KUltg4eG4cMFNYzVnZ\nzPhNXCw5HOaMhIoSp6VY10qaSPVHSW4wNNjr1n8eAn55PEFfZSNz4DHaU3M5vp7Q0OFwsOf9npz3\n/Xqsly9DHe08d7CNn5VyDbYNo/5D98FirsRh2pk3568GPzr4A0+bXMk=\n\"\"\"\nexec(zlib.decompress(base64.decodebytes(s.encode())).decode())\n\n", "n, a, b = [int(x) for x in input().split()]\r\nif a > b:\r\n a,b=b,a\r\n\r\nimport math as m\r\n# for i in [2,4,8,16,32,64,128,256]:\r\n# print(int(m.log2(i)))\r\nrounds = int(m.log2(n))\r\nmr = rounds\r\nlft, rgt = 1, n\r\n\r\nwhile True:\r\n mdl = (lft + rgt) // 2\r\n if a <= mdl and b > mdl:\r\n break\r\n rounds -= 1\r\n if a <= mdl and b <= mdl:\r\n rgt = mdl\r\n elif a > mdl and b > mdl:\r\n lft = mdl + 1\r\n\r\nif rounds == mr:\r\n print('Final!')\r\nelse:\r\n print(rounds)", "n, a, b, = map(int, input().split())\r\na, b = min(a,b), max(a, b)\r\ni = 1\r\nst = 1\r\nwhile 2 ** st != n:\r\n st += 1\r\nl, r = 0, n\r\nwhile True:\r\n m = (l + r)//2\r\n if a <= m and b > m :\r\n if i == 1:\r\n print('Final!')\r\n else:\r\n print(st-i +1)\r\n break\r\n else:\r\n if m > a:\r\n r = m\r\n else:\r\n l = m\r\n i += 1", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\ncount = 0\r\nwhile a != b:\r\n count += 1\r\n a //= 2\r\n b //= 2\r\nprint(\"Final!\" if 1<<count == n else count)", "n,a,b=map(int,input().split())\r\na,b,r=a-1,b-1,0\r\nwhile a!=b:\r\n a//=2\r\n b//=2\r\n r+=1\r\nprint(r if 2**r<n else 'Final!')", "from math import log2, ceil\r\n\r\nn, a, b = map(int, input().split())\r\na, b = a - 1, b - 1\r\nround = 0\r\nwhile a != b:\r\n round += 1\r\n a, b = a // 2, b // 2\r\nif round == int(ceil(log2(n))):\r\n print(\"Final!\")\r\nelse:\r\n print(round)\r\n", "n, a, b = map(int, input().split())\r\n#arr = list(map(int, input().split()))\r\nif (min(a, b) <= n // 2 and max(a, b) > n // 2):\r\n print('Final!')\r\nelse:\r\n el = a\r\n a = min(a, b)\r\n b = max(el, b)\r\n num1 = (a + 1) // 2\r\n num2 = (b + 1) // 2 \r\n rou = 1\r\n while num1 != num2:\r\n num1 =(num1 + 1) // 2\r\n num2 =(num2 + 1) // 2\r\n rou += 1\r\n print(rou)", "from math import log2\r\n\r\nn, a, b = map(int, input().split())\r\n\r\ncnt = 0\r\nwhile a != b:\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n cnt += 1\r\nif (cnt == log2(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "import math\r\n\r\nn,a,b=map(int,input().split(' '))\r\nrounds=math.log(n,2)\r\nr=int(rounds)\r\nfor i in range(1,int(rounds)+1):\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n if(a==b):\r\n if(i==r):\r\n print('Final!')\r\n break\r\n else:\r\n print(i)\r\n break", "n, a, b = map(int, input().split())\r\n \r\nprint(((a-1)^(b-1)).bit_length() % (n.bit_length()-1) or 'Final!')", "import math\r\nn,a,b=map(int,input().split())\r\na,b=min(a,b),max(a,b)\r\nl=[i+1 for i in range(n)]\r\nres=True\r\nrese=int(math.log2(n))\r\ns=int(math.log2(n))\r\nwhile res:\r\n if len(l)==2:\r\n break\r\n if a in l[:n//2] and b in l[n//2:]:\r\n break\r\n else :\r\n s-=1 \r\n if a in l[:n//2]:\r\n l=l[:n//2]\r\n else:\r\n l=l[n//2:]\r\n n//=2\r\nif s==rese :\r\n print('Final!')\r\nelse:\r\n print(s)\r\n\r\n\r\n", "import math;n,a,b=map(int,input().split())\r\nfor i in range(1,8):\r\n a=math.ceil(a/2);b=math.ceil(b/2)\r\n if a==b:print([i,\"Final!\"][2**i==n]);exit(0)\r\nprint(\"Final!\")", "import math\ndef solve(n,a,b):\n\tr = math.log2(n)\n\tc=0;\n\tl = [i for i in range(1,n+1)]\n\t#print(l)\n\twhile(1):\n\t\tc += 1\n\t\t#print(c)\n\t\tif l.index(a)%2==0 and l.index(b)%2==1 and l.index(b)- l.index(a)==1:\n\t\t\tif c==r:\n\t\t\t\treturn 'Final!'\n\t\t\telse:\n\t\t\t\treturn c\n\t\tfor i in range(0,len(l)-1,2):\n\t\t\t#print(len(l))\n\t\t\tif l[i]==a or l[i]==b:\n\t\t\t\tl[i+1]=0\n\t\t\telse:\n\t\t\t\tl[i]=0\n\t\tl=list(filter((0).__ne__, l))\n\nn,a,b = map(int,input().split(' '))\nif a>b:\n\ta,b=b,a\nprint (solve(n,a,b))", "n, a, b = map(int, input().split())\r\nmas = [i for i in range(1,n+1)]\r\nr = 0\r\nans = 0\r\nwhile len(mas)>2 and ans == 0:\r\n mas1 = [0] * (len(mas) // 2)\r\n r += 1\r\n for i in range(0, len(mas), 2):\r\n if (mas[i] == a and mas[i + 1] == b) or (mas[i] == b and mas[i + 1] == a):\r\n ans = r\r\n elif mas[i + 1] == a or mas[i + 1] == b:\r\n mas1[i // 2] = mas[i + 1]\r\n else:\r\n mas1[i // 2 ] = mas[i]\r\n mas = mas1.copy()\r\nif len(mas) == 2 and ((mas[0] == a and mas[1] == b) or (mas[0] == b and mas[1] == a)):\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n#https://t.me/+hgXBq0GzhsgwZTJi пиарю свой тг канал)", "import math\n\nn, a, b = map(int, input().split(\" \"))\n\n# teams = [i+1 for i in range(n)]\n# tuple_list = [(i, i+1) for i in range(1, len(teams), 2)]\n\n# a_index, b_index = None, None\n\n# for index, t in enumerate(tuple_list):\n# if a in t: a_index = index\n# if b in t: b_index = index\n\n# diff = int(math.log2(abs(a_index - b_index)))\n\n# final_round = int(math.log2(n))\n# print(final_round)\n\n# meet_round = 1 + diff\n# print(\"Final!\" if meet_round == final_round else meet_round)\n\nround = 0\n\nwhile a != b:\n a = int((a+1)/2)\n b = int((b+1)/2)\n round += 1\n\nif 1 << round == n: print(\"Final!\")\nelse: print(round)\n\n\n\n", "n, a, b = map(int, input().split())\na -= 1\nb -= 1\nn = len(bin(n)) - 3\ni = 0\nwhile a != b:\n a >>= 1\n b >>= 1\n i += 1\nprint('Final!' if i == n else i)\n", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nc = 1\r\nwhile n > 2 and a // 2 != b // 2:\r\n a //= 2\r\n b //= 2\r\n c += 1\r\n n //= 2\r\nif n == 2:\r\n print(\"Final!\")\r\nelse:\r\n print(c)", "import sys\r\nn,a,b=map(int,input().split())\r\na-=1\r\nb-=1\r\ni=0\r\nwhile n>2:\r\n a//=2\r\n b//=2\r\n n//=2\r\n if a==b:\r\n print(i+1)\r\n sys.exit()\r\n i+=1\r\n \r\nprint('Final!')\r\n", "n,a,b=map(int,input().split())\r\nx=list(range(1,n+1))\r\ny=[]\r\nj=0\r\nwhile len(x)>2:\r\n for i in range(0,n,2):\r\n if x[i]==a and x[i+1]==b or x[i]==b and x[i+1]==a:\r\n print(j+1)\r\n exit()\r\n if x[i+1]==a or x[i+1]==b:\r\n y.append(x[i+1])\r\n else:\r\n y.append(x[i])\r\n x=y.copy()\r\n y=[]\r\n n//=2\r\n j+=1\r\nprint('Final!')\r\n \r\n \r\n \r\n\r\n", "import math\n\nn,a,b = input().split()\n\nn,a,b = int(n), int(a), int(b)\n\na-=1\nb-=1\n\na=format(a, '010b')\nb=format(b, '010b')\n\nfor i in range(len(a)):\n\tif (a[i]!=b[i]):\n\t\tif (len(a)-i==math.log(n,2)):\n\t\t\tprint('Final!')\n\t\telse:\n\t\t\tprint(len(a)-i)\n\t\tbreak", "n, a, b = map(int, input().split())\r\nif a > b:a, b = b, a\r\ndp = [[j for j in range(1, n + 1)] for i in range(n)]\r\nok = row = 1\r\nn //= 2\r\ndone = False\r\nif b%2==0 and a%2==1 and (b-a)==1 and n != 1:\r\n print(1)\r\nelif b%2==0 and a%2==1 and (b-a)==1 and n == 1:\r\n print(\"Final!\")\r\nelse:\r\n while n != 2 and not done:\r\n idx = 0\r\n chk = jmp = lol = 1\r\n while idx < n:\r\n if a in dp[row-1][jmp-1:jmp+1]:toSet = a\r\n elif b in dp[row-1][jmp-1:jmp+1]:toSet = b\r\n else:toSet = 0\r\n dp[row][idx] = toSet\r\n if chk%2==0:\r\n if dp[row][lol - 1] == a and dp[row][lol] == b:\r\n done = True\r\n lol += 2\r\n idx += 1\r\n chk += 1\r\n jmp += 2\r\n ok += 1\r\n if done:break\r\n n //= 2\r\n row += 1\r\n print(ok if n != 2 else \"Final!\")", "from math import *\r\n\r\nn, a, b = map(int, input().split())\r\nl = 0\r\nr = n\r\nrounds = 0\r\nwhile 2 ** rounds != n:\r\n rounds += 1\r\ncur = rounds\r\na, b = min(a, b), max(a, b)\r\nwhile True:\r\n m = (l + r) // 2\r\n if a <= m and b > m:\r\n break\r\n else:\r\n cur -= 1\r\n if a <= m and b <= m:\r\n r = m\r\n else:\r\n l = m\r\nif cur == rounds:\r\n print(\"Final!\")\r\nelse:\r\n print(cur)", "n,a,b = list(map(int,input().split()))\r\na-=1\r\nb-=1\r\niter = 0\r\nwhile a!=b:\r\n iter+=1\r\n a//=2\r\n b//=2\r\nif (2**iter == n):\r\n print(\"Final!\")\r\nelse:\r\n print(iter)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\nres = 0;\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n res += 1\r\nif 2 ** res == n:\r\n print('Final!')\r\nelse:\r\n print(res)", "n, a, b = map(int, input().split())\nprint(((a - 1) ^ (b - 1)).bit_length() % (n.bit_length() - 1) or 'Final!')", "n,a,b=list(map(int,input().split()))\r\na-=1\r\nb-=1\r\nx=0\r\nwhile n>2:\r\n a//=2\r\n b//=2\r\n n//=2\r\n x+=1\r\n if a==b:\r\n print(x)\r\n break\r\nelse:\r\n print('Final!')", "#!/usr/bin/env python3\n\nimport sys\n\n[n, a, b] = map(int, sys.stdin.readline().strip().split())\n\ndef log2(n):\n\tif n == 1:\n\t\treturn 0\n\telse:\n\t\treturn log2(n // 2) + 1\n\ndef zf(x, d):\n\treturn bin(x)[2:].zfill(d)\n\ndef common_suffix_len(a, b):\n\ti = 0\n\tfor ca, cb in zip(a, b):\n\t\tif ca != cb:\n\t\t\tbreak\n\t\ti += 1\n\treturn i\n\nd = log2(n)\n\nsl = common_suffix_len(zf(a - 1, d), zf(b - 1, d))\nif sl == 0:\n\tprint ('Final!')\nelse:\n\tprint (d - sl)\n", "a, b, c = input().split(' ')\r\na, b, c = int(a), int(b), int (c)\r\nh = 0\r\nf = 1\r\nwhile (a > 1):\r\n h += 1\r\n a = a // 2\r\n if b > a and c > a:\r\n b -= a\r\n c -= a\r\n if f == 1 and((b <= a and c > a) or (b > a and c <= a)):\r\n g = h - 1\r\n f = 0\r\nif g == 0:\r\n print(\"Final!\")\r\nelse:\r\n print(h - g)\r\n \r\n\r\n\r\n\r\n\r\n", "n,a,b=map(int,input().split())\r\na,b,c=a-1,b-1,0\r\nwhile a!=b:\r\n\ta,b,c=a//2,b//2,c+1\r\nif 2**c==n:\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(c)", "n, a, b = map(int, input().split())\r\na, b, v = a - 1, b - 1, 0\r\nwhile a != b:\r\n a, b, v = a >> 1, b >> 1, v + 1\r\nprint('Final!' if n == 1 << v else v)", "n,a,b=map(int,input().split())\r\nif n==2:\r\n print(\"Final!\")\r\n exit(0)\r\na,b=min(a,b),max(a,b)\r\n#print(a,b)\r\nl=list(range(1,n+1))\r\nans=1\r\n\r\nfor i in range(0,len(l),2):\r\n if l[i]==a and l[i+1]==b:\r\n print(ans)\r\n exit(0)\r\nwhile True:\r\n l2=[]\r\n ans+=1\r\n for i in range(0,len(l),2):\r\n if l[i+1]==a or l[i+1]==b:\r\n l2.append(l[i+1])\r\n else:\r\n l2.append(l[i])\r\n if len(l2)==2:\r\n print(\"Final!\")\r\n exit(0)\r\n for i in range(0,len(l2),2):\r\n if l2[i]==a and l2[i+1]==b:\r\n print(ans)\r\n exit(0)\r\n l=l2\r\n ", "import math\r\n\r\ndef powerTwo(n):\r\n power = 0\r\n while(math.pow(2, power) != n):\r\n power += 1\r\n return power\r\n \r\nn, a, b = map(int, input().split())\r\nrounds = 0\r\nwhile ( a != b):\r\n if ( a % 2 != 0):\r\n a += 1\r\n if ( b % 2 != 0):\r\n b += 1\r\n rounds += 1\r\n a //= 2\r\n b //= 2\r\nif (rounds == powerTwo(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(rounds)", "n, a, b = map(int, input().split())\r\n\r\na, b = min(a, b), max(a, b)\r\n\r\nl = 1\r\nr = n\r\n\r\np = 1\r\nf = 0\r\nwhile p < n:\r\n\tp *= 2\r\n\tf += 1\r\n\r\ncur = 0\r\n\r\nwhile l < r:\r\n\tm = (l + r) // 2\r\n\r\n\tif l <= a <= m and m < b <= r:\r\n\t\tbreak\r\n\r\n\tif b <= m:\r\n\t\tr = m\r\n\telse:\r\n\t\tl = m + 1\r\n\tcur += 1\r\n\r\nif cur == 0:\r\n\tprint('Final!')\r\nelse:\r\n\tprint(f - cur)\r\n", "n,a,b=map(int,input().split())\r\ndef dq(a,b,l,r,dem):\r\n if a<l or b>r:\r\n return 1000000000\r\n if a<=(l+r)//2 and b>(l+r)//2:\r\n return dem\r\n return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))\r\nif a>b:\r\n a,b=b,a\r\nsv=0\r\n_n=n\r\nwhile _n!=1:\r\n sv=sv+1\r\n _n=_n/2\r\nif sv==sv-dq(a,b,1,n,0):\r\n print(\"Final!\")\r\nelse:\r\n print(sv-dq(a,b,1,n,0))", "a, b, c = map(int, input().split())\r\ncnt = 0\r\nb += a - 1\r\nc += a - 1\r\nwhile b != c:\r\n b >>= 1\r\n c >>= 1\r\n cnt += 1\r\nif b == 1:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n", "import math\r\nn,a,b=map(int,input().split())\r\nk=math.log(n,2)\r\nfor i in range(1,9):\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n if a==b:\r\n break\r\nif i==int(k):\r\n print('Final!')\r\nelse:\r\n print(i//1)\r\n ", "import math\nn,a,b = list(map(int, input().split()))\nm = int(math.log(n,2))\nfor x in range(1,m+1):\n #print(math.ceil(a/(2**x)), math.ceil(b/(2**x)))\n if math.ceil(a/(2**x))== math.ceil(b/(2**x)):\n if (x==m):\n print(\"Final!\")\n else:\n print(x)\n exit()\n", "a = list(map(int, input().split()))\nn = a[0]\nf = a[1]\ns = a[2]\na = []\nfor i in range(n):\n a.append(i + 1)\ncount = 0\nwhile len(a) != 2:\n count += 1\n size = len(a)\n index = 0\n temp = []\n for i in range(0, size, 2):\n index += 1\n if (a[i] == f and a[i+1] == s) or (a[i] == s and a[i+1] == f):\n print(count)\n exit()\n elif a[i] == f or a[i] == s:\n temp.append(a[i])\n else:\n temp.append(a[i+1])\n a = temp\n\nprint('Final!')", "a,b,c=[int(i) for i in input().split()]\nr=0\nb-=1\nc-=1\nwhile b!=c:\n b//=2\n c//=2\n r+=1\nif 2**r==a:\n print(\"Final!\")\nelse:\n print(r)\n \t \t\t\t \t \t \t\t \t \t", "n, a, b = map(int, input().split())\nA = [i for i in range(1, n + 1)]\nci = 0\nwhile len(A) > 2:\n ci += 1\n B = []\n for i in range(0, len(A), 2):\n if {A[i], A[i + 1]} == {a, b}:\n print(ci)\n exit(0)\n elif A[i] in {a, b}:\n B.append(A[i])\n else:\n B.append(A[i + 1])\n A = B\nprint('Final!')", "import math\n\n\ndef read():\n return [int(v) for v in input().split()]\n\n\ndef solve(l, n):\n q = 2\n r = []\n l -= 1\n while q <= n:\n r.append(l // q)\n q *= 2\n return r\n\n\ndef main():\n n, a, b = read()\n a1, b1 = solve(a, n), solve(b, n)\n\n for i in range(len(a1)):\n if a1[i] == b1[i]:\n if i == len(a1) - 1:\n print('Final!')\n else:\n print(i+1)\n return\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b=[int(i) for i in input().split()]\r\nnd=0\r\nwhile True:\r\n if a%2!=0:\r\n a=(a+1)//2\r\n else:\r\n a=a//2\r\n if b%2!=0:\r\n b=(b+1)//2\r\n else:\r\n b=b//2\r\n if a==b:\r\n nd+=1\r\n break\r\n nd+=1\r\nnk=0\r\nwhile n>2:\r\n n=n//2\r\n nk+=1\r\nif (nk+1)==nd:\r\n print('Final!')\r\nelse:\r\n print(nd)\r\n", "read = lambda: map(int, input().split())\r\nn, a, b = read()\r\ncnt = 0\r\na += n - 1\r\nb += n - 1\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n cnt += 1\r\nif 2 ** cnt == n:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "'''n,cur = map(int,input().split())\nfr = []\nfor i in range(n):\n fr.append(list(map(int,input().split())) + [i + 1])\nfr.sort()\nprint(*fr)\nlast = []\ni = 0\nres = []\nwhile i < n and fr[i][0] <= cur:\n if fr[i][1] >= 0:\n cur += fr[i][1]\n res.append(fr[i][2])\n else:\n last.append([fr[i][1],fr[i][0],fr[i][2]])\n i += 1\nfor i in range(len(last)):\n\nprint(len(res))\nprint(*res)'''\n\nn,a,b = map(int,input().split())\na -= 1\nb -= 1\na //= 2\nb //= 2\nres = 1\nwhile a != b:\n a //= 2\n b //= 2\n n //= 2\n res += 1\nif n == 2:\n print(\"Final!\")\nelse:\n print(res)", "n, a, b = map(int, input().split())\r\nflag = 2\r\na -= 1\r\nb -= 1\r\ni = 1\r\nwhile flag < n:\r\n if a // flag == b // flag:\r\n print(i)\r\n break\r\n i += 1\r\n flag *= 2\r\nelse:\r\n print('Final!')\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nteams = []\r\nfor i in range(n):\r\n teams.append(i + 1)\r\nans = 0\r\nround = 1\r\ntempLst = []\r\nfounded = False\r\nfinal = False\r\nwhile True:\r\n for x in range(0, len(teams), 2):\r\n first = teams[x]\r\n second = teams[x + 1]\r\n if((first == a and second == b) or (first == b and second == a)):\r\n ans = round\r\n founded = True\r\n if(len(teams) == 2):\r\n final = True\r\n break\r\n if(first == a and second != b):\r\n tempLst.append(first)\r\n elif(first == b and second != a):\r\n tempLst.append(first)\r\n elif(second == a and first != b):\r\n tempLst.append(second)\r\n elif(second == b and first != a):\r\n tempLst.append(second)\r\n elif(first != b and second != a):\r\n tempLst.append(first)\r\n if(founded == False):\r\n teams.clear()\r\n teams += tempLst\r\n tempLst.clear()\r\n if(len(teams) > 0):\r\n round += 1\r\n else:\r\n break\r\n else:\r\n break\r\nif(final):\r\n print(\"Final!\")\r\nelse:\r\n print(ans)\r\n", "import math\n\nn, a, b = map(int, input().split())\nrounds = int(math.log(n, 2))\n\na -= 1\nb -= 1\na = (\"000000000000\" + bin(a)[2:])[-8:]\nb = (\"000000000000\" + bin(b)[2:])[-8:]\nfor i, x, y in zip(range(100), a, b):\n if x != y:\n if (len(a) - i == rounds):\n print(\"Final!\")\n else:\n print(len(a) - i)\n break", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nq = []\r\nfor i in range(n // 2):\r\n q.append(((2 * i, 2 * i + 1), 1))\r\n\r\ndef wi(p):\r\n if a in p and b in p:\r\n return True\r\n return False\r\n\r\ndef ch(p):\r\n if a in p:\r\n return a\r\n if b in p:\r\n return b\r\n return p[0]\r\n\r\nwhile 1:\r\n if len(q) == 1:\r\n print('Final!')\r\n exit()\r\n p1 = q[0][0]\r\n p2 = q[1][0]\r\n if wi(p1):\r\n print(q[0][1])\r\n exit()\r\n if wi(p2):\r\n print(q[1][1])\r\n exit()\r\n q.append(((ch(p1), ch(p2)), q[0][1] + 1))\r\n del q[0]\r\n del q[0]\r\n", "from collections import deque,Counter\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nimport copy\ninput = lambda: sys.stdin.readline().rstrip()\nn,a,b = map(int,input().split())\npika = copy.deepcopy(n)\nids = [i for i in range(1,n+1)]\nr = 1\nwhile n:\n temp = []\n for i in range(1,len(ids),2):\n x,y = ids[i-1],ids[i]\n if (x == a and y==b) or (y==a and x==b):\n print(\"Final!\" if 2**r == pika else r)\n sys.exit()\n if x==a or x==b:\n temp.append(x)\n elif y==a or y==b:\n temp.append(y)\n else:\n temp.append(x)\n ids = temp\n r+=1\n n>>=1\n", "import math\r\n\r\nstr_data = input().split()\r\n\r\ncount = int(str_data[0])\r\na1 = int(str_data[1])\r\na2 = int(str_data[2])\r\n\r\nmax_rounds = math.log(count, 2)\r\nk1 = min(a1, a2)\r\nk2 = max(a1, a2)\r\n\r\ndelimeter = count / 2\r\ncount /= 2\r\nres = int(max_rounds)\r\nwhile not (k1 <= delimeter < k2):\r\n res -= 1\r\n count /= 2\r\n if delimeter < k1:\r\n delimeter += count\r\n else:\r\n delimeter -= count\r\n\r\nif res == max_rounds:\r\n print('Final!')\r\nelse:\r\n print(res)\r\n", "a,b,c=map(int,input().split())\r\ns=0\r\nwhile(c!=b):\r\n c=(c+1)//2\r\n b=(b+1)//2\r\n s+=1\r\n a//=2\r\nif a>1:print(s)\r\nelse:print(\"Final!\")", "import math\r\n\r\n\r\nn, a, b = map(int, input().split())\r\nold_n = n\r\n\r\nif a > b:\r\n a += b\r\n b = a - b\r\n a -= b\r\n\r\nteams = [i for i in range(1, n + 1)]\r\nround = 0\r\nwhile len(teams) != 1:\r\n round += 1\r\n for i in range(0, n, 2):\r\n if teams[i] == a and teams[i + 1] == b:\r\n break\r\n if teams[i] == a or teams[i] == b:\r\n teams[i + 1] = -1\r\n else:\r\n teams[i] = -1\r\n try:\r\n for i in range(n // 2):\r\n teams.remove(-1)\r\n n //= 2\r\n except ValueError:\r\n break\r\nif round == math.log2(old_n):\r\n print('Final!')\r\nelse:\r\n print(round)\r\n", "import math\r\nn,a,b=map(int,input().split())\r\narr=[i for i in range(1,n+1)] \r\ni,r=0,1\r\n#print(arr)\r\nwhile True:\r\n\tarr1=[]\r\n\tfor i in range(0,len(arr),2):\r\n\t\tif (arr[i]==a and arr[i+1]==b) or (arr[i]==b and arr[i+1]==a):\r\n\t\t\tif len(arr)==2:\r\n\t\t\t\tprint(\"Final!\")\r\n\t\t\telse:\r\n\t\t\t\tprint(r) \r\n\t\t\texit(0)\r\n\t\telse:\r\n\t\t\tif arr[i+1]==a or arr[i]==a:\r\n\t\t\t\tarr1.append(a) \r\n\t\t\telif arr[i+1]==b or arr[i]==b:\r\n\t\t\t\tarr1.append(b) \r\n\t\t\telse:\r\n\t\t\t\tarr1.append(arr[i])\r\n\tarr=arr1\r\n\tr+=1\r\n\t#print(arr)\r\n\t\t", "a,b,c=map(int,input().split(' '))\r\npwr=0\r\nwhile a!=1:\r\n pwr+=1\r\n a=a//2\r\nans=1\r\nfor j in range(1,pwr):\r\n if (b-1)//(2**j)!=(c-1)//(2**j):\r\n ans+=1\r\nif ans==pwr:\r\n print(\"Final!\")\r\nelse:\r\n print(ans)", "import math\r\n\r\nn, a, b = map(int, input().split())\r\nlst = [i for i in range(1, n + 1)]\r\nclst = []\r\nf = 0\r\ncnt = 0\r\nfound = 0\r\nfinal = 0\r\nwhile len(clst) != 1 and len(lst) != 1:\r\n if len(clst) == 2 or len(lst) == 2:\r\n final = 1\r\n if f == 0:\r\n for i in range(0, n, 2):\r\n if i + 1 < n:\r\n if sorted([lst[i], lst[i + 1]]) == sorted([a, b]):\r\n found = 1\r\n break\r\n if lst[i] in [a, b]:\r\n clst.append(lst[i])\r\n elif i + 1 < n and lst[i + 1] in [a, b]:\r\n clst.append(lst[i + 1])\r\n else:\r\n clst.append(lst[i])\r\n f = 1\r\n lst = []\r\n n = math.ceil(n / 2)\r\n else:\r\n for i in range(0, n, 2):\r\n if i + 1 < n:\r\n if sorted([clst[i], clst[i + 1]]) == sorted([a, b]):\r\n found = 1\r\n break\r\n if clst[i] in [a, b]:\r\n lst.append(clst[i])\r\n elif i + 1 < n and clst[i + 1] in [a, b]:\r\n lst.append(clst[i + 1])\r\n else:\r\n lst.append(clst[i])\r\n clst = []\r\n n = math.ceil(n / 2)\r\n f = 0\r\n cnt += 1\r\n if found == 1:\r\n break\r\nprint(cnt if final == 0 else \"Final!\")", "import math\n\nn, a, b = map(int, input().split())\ni = 2\na, b = min(a, b), max(a, b)\nwhile True:\n if a <= n // i < b:\n break\n if a > n // i:\n a -= n // i\n b -= n // i\n i *= 2\nans = math.log(n, 2) - math.log(i, 2) + 1\nif math.log(i, 2) == 1:\n print(\"Final!\")\nelse:\n print(int(ans))", "n, a, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\nr = 1\r\nwhile 2 ** r < n:\r\n r += 1\r\nleft = 1\r\nright = n\r\nans = r\r\nmid = (left + right) // 2\r\nwhile not (a <= mid and b > mid):\r\n ans -= 1\r\n if b <= mid:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n mid = (left + right) // 2\r\nif ans == r:\r\n print('Final!')\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\nm = len(bin((a - 1) ^ (b - 1))) - 2\nprint('Final!' if m == len(bin(n)) - 3 else m)\n", "n,a,b = map(int,input().split())\r\nz = 0\r\nq = 0\r\nwhile a != b:\r\n z += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\nwhile n != 1:\r\n n //= 2\r\n q += 1\r\nif z == q:\r\n print(\"Final!\")\r\nelse:\r\n print(z)", "n, a, b = [int(x) for x in input().split()]\r\na -= 1\r\nb -= 1\r\ncnt = 1\r\nwhile (a > 0 or b > 0):\r\n a = a // 2\r\n b = b // 2\r\n if (a == b):\r\n if (n > 2):\r\n print(cnt)\r\n else:\r\n print('Final!')\r\n break\r\n cnt += 1\r\n n = n // 2", "n, a, b = [int(k) for k in input().split() if k]\na -= 1\nb -= 1\npower = 1\nwhile a // (2 ** power) != b // (2 ** power):\n power += 1\nif 2 ** power >= n:\n print(\"Final!\")\nelse:\n print(power)", "#!/usr/bin/env python3\n\ndef qlog2(x):\n def __qlog2(x, a):\n return a if x == 1 else __qlog2(x >> 1, a + 1)\n return __qlog2(x, 0)\n\ndef getrnd(a, b):\n c = 0\n while a != b:\n a >>= 1\n b >>= 1\n c += 1\n return c\n\ndef m(n, a, b):\n r = getrnd(a - 1, b - 1)\n maxr = qlog2(n)\n return \"Final!\" if maxr == r else str(r)\n\nif __name__ == \"__main__\":\n print(m(*map(int, input().split())))\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a, b = map(int, input().split())\r\np = 2\r\nans = 1\r\nwhile p <= n:\r\n l = 1\r\n ok = 0\r\n while l <= n:\r\n r = l + p - 1\r\n if l <= a <= r and l <= b <= r:\r\n ok = 1\r\n break\r\n l = r + 1\r\n if ok:\r\n break\r\n ans += 1\r\n p *= 2\r\nif pow(2, ans) == n:\r\n ans = \"Final!\"\r\nprint(ans)", "n, a, b = map(int, input().split())\r\na, b = min(a, b), max(a, b)\r\nsum = 0;\r\nwhile a != b:\r\n if(n == 2):\r\n print('Final!')\r\n break\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n n = n // 2\r\n sum += 1\r\nelse:\r\n print(sum)", "import math\r\nn,a,b = map(int,input().split())\r\nroun = 1\r\nf = 1\r\nwhile(roun!=int(math.log(n,2))):\r\n a = (a+1)//2\r\n b = (b+1)//2\r\n if(a==b):\r\n f = 0\r\n print(roun)\r\n break\r\n roun+=1\r\nif(f):\r\n print('Final!')\r\n \r\n \r\n ", "import math\r\n\r\n\r\nclass CodeforcesTask931BSolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_a_b = []\r\n\r\n def read_input(self):\r\n self.n_a_b = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n result = 0\r\n table = [x + 1 for x in range(self.n_a_b[0])]\r\n for r in range(int(math.log2(self.n_a_b[0]))):\r\n ntable = [0 for x in range(self.n_a_b[0] // 2 ** (r + 1))]\r\n for x in range(len(table) // 2):\r\n winner = table[x * 2]\r\n if table[x * 2 + 1] in self.n_a_b[1:]:\r\n if winner in self.n_a_b[1:]:\r\n result = r + 1\r\n else:\r\n winner = table[x * 2 + 1]\r\n ntable[x] = winner\r\n table = ntable\r\n if result == int(math.log2(self.n_a_b[0])):\r\n self.result = \"Final!\"\r\n else:\r\n self.result = str(result)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask931BSolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n, a, b = [int(s) for s in input().split()]\r\nk = 0\r\na -= 1\r\nb -= 1\r\nwhile a != b:\r\n k += 1\r\n a //= 2\r\n b //= 2\r\nif 2**k == n:\r\n print(\"Final!\")\r\nelse:\r\n print(k)", "c,a,b=input().split()\r\nc=int(c)\r\nlevel=0\r\nwhile c!=1:\r\n level+=1\r\n c//=2\r\na=int(a)-1\r\nb=int(b)-1\r\nroundik=0\r\nwhile a!=b:\r\n roundik+=1\r\n a//=2\r\n b//=2\r\nif roundik==level:\r\n print(\"Final!\")\r\nelse:\r\n print(roundik)", "def main():\r\n n, a, b = [int(x) for x in input().split()]\r\n r = 0\r\n a -= 1\r\n b -= 1\r\n while a != b:\r\n a >>= 1\r\n b >>= 1\r\n r += 1\r\n if 2**r == n:\r\n print(\"Final!\")\r\n else:\r\n print(r)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\ndef rec(a,b,count):\r\n if a//2 == b//2:\r\n return count\r\n else:\r\n return rec(a//2,b//2,count+1)\r\n\r\nn,a,b = input().split()\r\nres = rec(int(a)-1,int(b)-1,1)\r\nif res==math.log2(int(n)):\r\n print(\"Final!\")\r\nelse:\r\n print(res)", "s = input().split()\r\nn, a, b = int(s[0]), int(s[1]), int(s[2])\r\n\r\narr = [0 for i in range(n)]\r\n\r\narr[a - 1] = 1\r\narr[b - 1] = 1\r\nk = 0\r\nwhile (len(arr) != 0):\r\n for i in range(0, len(arr), 2):\r\n arr[i] = arr[i] + arr[i + 1]\r\n if len(arr) == 2 and arr[i] == 2:\r\n print('Final!')\r\n exit(0)\r\n elif (arr[i] == 2):\r\n print(k + 1)\r\n exit(0)\r\n arr = arr[::2]\r\n k += 1\r\n", "import math\r\n\r\n\r\ndef recursive_function(s, e, a, b, c):\r\n if (s <= a <= e and s <= b <= e):\r\n c.append(1)\r\n recursive_function(s, (s + e) // 2, a, b, c)\r\n recursive_function(((s + e)// 2) + 1, e, a, b, c)\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n total_number_of_rounds = 0\r\n x = n\r\n while x > 1:\r\n x = x // 2\r\n counter += 1\r\n c = []\r\n recursive_function(1, n, a, b, c)\r\n g = len(c)\r\n if g - 1 == 0:\r\n print(\"Final!\")\r\n else:\r\n print(counter - g + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#main_function()", "n,a,b =map(int,input().split())\r\na+=n-1\r\nb+=n-1\r\ncnt = 0\r\nwhile a!=b:\r\n a=a//2\r\n b=b//2\r\n cnt+=1\r\nif 2**cnt==n:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n \r\n \r\n\r\n\r\n", "import sys\r\nfrom math import log\r\ninput = sys.stdin.readline\r\ndef prog():\r\n n,a,b = map(int,input().split())\r\n a -= 1\r\n b -= 1\r\n match = 0\r\n while a != b:\r\n a //= 2\r\n b //= 2\r\n match += 1\r\n if 1 << match == n:\r\n print('Final!')\r\n else:\r\n print(match)\r\nprog()\r\n", "n, a, b = map(int, input().split())\r\nflag = -1\r\nfor i in range(10):\r\n if (2 ** (i + 1) >= n):\r\n break\r\n a += 2 ** i\r\n b += 2 ** i\r\n if (a // (2 ** (i + 1)) == b // (2 ** (i + 1))):\r\n flag = i + 1\r\n break\r\nif (flag == -1):\r\n print(\"Final!\")\r\nelse:\r\n print(flag)", "n, a, b = map(int, input().split())\n\na -= 1\nb -= 1\nmask = 1\nround = 1\n\nwhile a != b:\n if a & ~mask == b & ~mask:\n break\n round += 1\n mask = (mask << 1) + 1\n\nprint('Final!' if mask + 1 == n else round)", "def make_tour(people):\r\n teams = []\r\n people.sort()\r\n for i in range(len(people)):\r\n if i % 2 == 0:\r\n teams.append([people[i]])\r\n else:\r\n teams[-1].append(people[i])\r\n return teams\r\n\r\n\r\nn, a, b = map(int, input().split())\r\npeople = []\r\nind = 1\r\nfl = True\r\nfor i in range(1, n + 1):\r\n people.append(i)\r\nwhile True:\r\n teams = make_tour(people)\r\n if len(teams) == 1:\r\n break\r\n for i in range(len(teams)):\r\n if teams[i][0] == a and teams[i][1] == b or teams[i][0] == b and teams[i][1] == a:\r\n fl = False\r\n print(ind)\r\n break\r\n elif teams[i][0] == a or teams[i][1] == a:\r\n teams[i] = [a]\r\n elif teams[i][0] == b or teams[i][1] == b:\r\n teams[i] = [b]\r\n else:\r\n teams[i] = [teams[i][0]]\r\n if not fl:\r\n break\r\n people = []\r\n for i in range(len(teams)):\r\n for j in range(len(teams[i])):\r\n people.append(teams[i][j])\r\n ind += 1\r\nif fl:\r\n print('Final!')", "n, a, b = map(int, input().split())\nif b > a:\n a, b = b, a\nmas = [i for i in range(1, n+1)]\n\nrnd = 1\nwhile len(mas) >= 2:\n for i in range(len(mas)//2):\n if (mas[i] == b) and (mas[i+1] == a):\n if len(mas) == 2:\n print('Final!')\n mas.pop(0)\n else:\n print(rnd)\n mas.pop(i)\n break\n elif (mas[i] == a) or (mas[i] == b):\n mas.pop(i+1)\n elif (mas[i+1] == a) or (mas[i+1] == b):\n mas.pop(i)\n else:\n mas.pop(i)\n rnd += 1", "from collections import deque\nimport math\nn, a, b = map(int, input().split())\n\n\nteams = [x for x in range(1, n+1)]\nround = 1\ngood = True\nwhile len(teams) > 2 and good:\n temp = []\n for i in range(0, len(teams), 2):\n t1 = teams[i]\n t2 = teams[i+1]\n if (t1 == a and t2 == b) or (t1 == b and t2 == a):\n good = False\n break\n elif t1 == a or t1 == b:\n temp.append(t1)\n elif t2 == a or t2 == b:\n temp.append(t2)\n else:\n temp.append(t1)\n teams = temp\n if good:\n round += 1\nprint(\"Final!\" if round == math.log2(n) else round)\n\n", "import math\r\nn, a, b = [int(el) for el in input().split()]\r\nm=int(math.log(n,2))\r\nfor i in range(1, m+1):\r\n if (a-1)//(2**i) == (b-1)//(2**i):\r\n if i == m:\r\n print('Final!')\r\n else:\r\n print(i)\r\n break", "def check(n,a,b):\r\n c=n/2\r\n if (b>c and a<=c) or (a>c and b<=c):\r\n return(n)\r\n else:\r\n if a<=c and b<=c:\r\n z=check(c,a,b)\r\n if a>c and b>c:\r\n z=check(c,a-c,b-c)\r\n return z\r\n \r\nn, a ,b= map(int, input().split())\r\nz=check(n,a,b); i=0\r\nif z==n:\r\n print('Final!')\r\nelse:\r\n while z!=1:\r\n z/=2\r\n i+=1\r\n print(i)", "n,a,b=map(int, input().split())\npar=[]\nif a>b:\n\ta,b=b,a\nfor i in range(1,n+1):\n\tpar.append(i)\nrnd=0\nwhile n>=2:\n\tn//=2\n\trnd+=1\nans=1\nwhile True:\n\tt1=par.index(a)\n\tt2=par.index(b)\n\tm=len(par)\n\tif t1==t2-1 and not t1%2:\n\t\tif ans==rnd:\n\t\t\tprint('Final!')\n\t\telse:\n\t\t\tprint(ans)\n\t\texit(0)\n\tans+=1\n\trmi=[]\n\tfor i in range(0,m,2):\n\t\tif par[i]==a or par[i]==b:\n\t\t\trmi.append(par[i+1])\n\t\telse:\n\t\t\trmi.append(par[i])\n\tfor i in rmi:\n\t\tpar.remove(i)", "n, a, b = [int(i) for i in input().split()]\r\na -= 1\r\nb -= 1\r\nresult = 0\r\nwhile a != b:\r\n a >>= 1\r\n b >>= 1\r\n result += 1\r\nif n == 1 << result:\r\n print(\"Final!\")\r\nelse:\r\n print(result)\r\n", "n, a, b = [int(x) - 1 for x in input().split()]\nn += 1\nd = 2\nost_1 = a // d\nost_2 = b // d\nr = 1\nwhile ost_1 != ost_2 and d != n:\n d *= 2\n ost_1 = a // d\n ost_2 = b // d\n r += 1\nif d == n:\n print('Final!')\nelse:\n print(r)", "from math import *\r\nn,a,b = map(int,input().split())\r\nl = 0\r\nr = n\r\nans = 1\r\ntotal = log2(n)\r\nwhile r > l + 1: \r\n m = (l + r) // 2\r\n if m >= a and m>=b: \r\n r = m\r\n elif m<a and m<b: \r\n l = m\r\n else:\r\n if ans==1:\r\n print('Final!')\r\n else:\r\n print(int(total)-ans+1)\r\n break\r\n ans+=1\r\n", "n, a, b = map(int, input().split())\r\nans = 0\r\na-=1\r\nb-=1\r\n\r\nwhile a != b:\r\n a //= 2\r\n b //= 2\r\n ans += 1\r\nif 2**ans == n:\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n", "# -*- coding: utf-8 -*-\r\n# http://codeforces.com/contest/931/problem/B\r\n\r\ndef match_num(n):\r\n return (n + 1) // 2\r\n\r\ndef rec(r, teams, t1, t2):\r\n if (teams == 2):\r\n return 'Final!'\r\n \r\n m1 = match_num(t1)\r\n m2 = match_num(t2)\r\n \r\n if m1 == m2:\r\n return r\r\n \r\n return rec(r+1, teams//2, m1, m2)\r\n \r\n\r\ndef problem():\r\n \r\n in1 = input()\r\n# in1 = '8 7 5'\r\n \r\n args = list(map(int, in1.split()))\r\n\r\n teams = args[0]\r\n t1 = args[1]\r\n t2 = args[2]\r\n\r\n result = rec(1, teams, t1, t2) \r\n\r\n return result\r\n\r\n \r\nprint(problem())\r\n#problem()", "from math import*\r\n\r\nf=input().split()\r\nn=int(f[0])\r\na=bin(int(f[1])-1)[2:]\r\nb=bin(int(f[2])-1)[2:]\r\n\r\nfor i in range(8-len(a)):\r\n a=\"0\"+a\r\nfor i in range(8-len(b)):\r\n b=\"0\"+b\r\nc=\"\"\r\nfor i in range(8):\r\n c=c+str(int(a[i])^int(b[i]))\r\n\r\nc=str(int(c))\r\nif len(c)==log(n, 2):\r\n print('Final!')\r\nelse:\r\n print(len(c))\r\n", "import math\nn,a,b = map(int,input().split())\na,b = min(a,b),max(a,b)\nn1 = math.log(n,2)\nr = 1\nc = n/2\nwhile 1:\n if a<=c and b>c:\n break\n else:\n r+=1\n if b<=c:\n c = c/2\n elif a>c:\n a = a-c\n b = b-c\n c = c/2\nif r==1:\n print('Final!')\nelse:\n print(int(n1-r+1))\n", "n,a,b=map(int,input().split())\r\nc=1\r\nimport math\r\nwhile True:\r\n a=a/2\r\n b=b/2\r\n if math.ceil(a)==math.ceil(b):\r\n if 2**c==n:\r\n c=\"Final!\"\r\n print(c)\r\n break\r\n c+=1\r\n", "import math\r\n\r\narr = list(map(int, input().split()))\r\nn = arr[0]\r\nrounds = math.log2(n)\r\na = arr[1]\r\na = int((a%2 + a)/2)\r\nb = arr[2]\r\nb = int((b%2 + b)/2)\r\nroundCount = 1\r\n\r\nwhile a!=b:\r\n a=math.ceil(a/2)\r\n b=math.ceil(b/2)\r\n roundCount+=1\r\n\r\nif roundCount == rounds:\r\n print (\"Final!\")\r\nelse:\r\n print (roundCount)", "n, a, b = map(int, input().split())\nz = 0\na -= 1\nb -= 1\narr = [1] * (2 * n)\narr[n + a] = 2\narr[n + b] = -2\nz = [0] * (2 * n)\ni = n - 1\n#print(arr)\nwhile i >= 1:\n #print(i, 2 * i, len(z))\n arr[i] = arr[i * 2] * arr[i * 2 + 1]\n z[i] = z[i * 2] + 1\n if arr[i] == -4:\n break\n i -= 1\nz = z[i]\n#print(z)\nif 2 ** z == n:\n print(\"Final!\")\nelse:\n print(z)", "import math\r\nn,a,b=map(int,input().split())\r\nnummatches=int((math.log(n))/(math.log(2)))\r\nA=[]\r\nfor i in range(1,n+1):\r\n A.append(int(i))\r\nround=0\r\nif a>b:\r\n tmp=b\r\n b=a\r\n a=tmp\r\ndef spel(A,a,b):\r\n global round\r\n round+=1\r\n if b>a:\r\n if len(A)==2:\r\n return 'Final!'\r\n elif A.index(a)%2==0 and A.index(b)==A.index(a)+1:\r\n return round\r\n else:\r\n for k in range(0,len(A),2):\r\n if A[k]!=a and A[k]!=b:\r\n A[int(k)]=0\r\n elif A[k]==a or A[k]==b:\r\n A[int(k)+1]=0\r\n while 0 in A:\r\n A.remove(0)\r\n return spel(A,a,b) \r\nprint(spel(A,a,b))\r\n\r\n \r\n\r\n \r\n", "import sys\nimport itertools as it\nimport math\n\nn,a,b = map(int, sys.stdin.readline().split())\n\na-=1\nb-=1\nlogn = int(math.log2(n))\n\nfor k in range(logn):\n if a&(1<<(logn-k-1)) != b&(1<<(logn-k-1)):\n if k==0:\n print('Final!')\n else:\n print(logn-k)\n break\n", "import math\nn, a, b = map(int, input().split())\ni = 1\nf = int(math.log(n, 2))\na -= 1\nb -= 1\nk = f\nfor i in range(f-1, 0, -1):\n\tif a//pow(2, i) != b//pow(2, i):\n\t\tbreak\n\tk -= 1\nif k == f:\n\tprint(\"Final!\")\nelse:\n\tprint(k)\n", "n, a, b = map(int, input().split())\r\nans = 0\r\na -= 1\r\nb -= 1\r\nwhile n > 2:\r\n n //= 2\r\n a //= 2\r\n b //= 2\r\n ans += 1\r\n if a == b:\r\n print(ans)\r\n break\r\nelse:\r\n print(\"Final!\")", "rounds={2:1,4:2,8:3,16:4,32:5,64:6,128:7,256:8}\n\np=list(map(int,input().split()))\nfinal=rounds[p[0]]\ncount=0\nif(not(p[1]>p[0]//2 and p[2]<=p[0]//2)):\n\t\tm=p[1]-1\n\t\tn=p[2]-1\n\t\twhile(m!=n):\n\t\t\tm=m//2\n\t\t\tn=n//2\n\t\t\tcount=count+1\n\t\tif(count==final):\n\t\t\tprint(\"Final!\")\n\t\telse:\n\t\t\tprint(count)\nelse:\n\tprint(\"Final!\")", "from math import log2\r\n\r\n\r\ndef bin_(x):\r\n l_ = ln\r\n\r\n return str(bin(x))[2:].zfill(l_)\r\n\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nln = int(log2(n)) + 1\r\n\r\na_, b_ = bin_(a - 1), bin_(b - 1)\r\n\r\nfor i in range(ln):\r\n if a_[i] != b_[i]:\r\n ans = i\r\n break\r\n\r\nelse:\r\n ans = 0\r\n\r\nprint((ln - ans, 'Final!')[(ln - ans) % (ln - 1) == 0])\r\n", "import math\r\nn,a,b=map(int,input().split())\r\nx=max(a,b)\r\ny=min(a,b)\r\nif x>(n/2) and y<=(n/2):\r\n print(\"Final!\")\r\n exit(0)\r\nelse:\r\n z=math.log(n,2) \r\n while(n!=1):\r\n if y>(n/2):\r\n y-=(n/2)\r\n x-=(n/2)\r\n #print(x,y)\r\n if x>(n/2) and y<=(n/2):\r\n print(int(z))\r\n exit(0)\r\n n=n/2\r\n z-=1\r\n", "def divide(l, r, a, b):\n m = (l + r) // 2\n if a <= m and b > m:\n return 1\n elif b <= m:\n return divide(l, m, a, b) + 1\n elif a > m:\n return divide(m + 1, r, a, b) + 1\n\n\nn, a, b = map(int, input().split())\nif a > b:\n a, b = b, a\n\nnum = divide(1, n, a, b)\ncnt = 0\nwhile n > 0:\n cnt += 1\n n = n >> 1\n\nif num == 1:\n print(\"Final!\")\nelse:\n print(cnt - num)\n", "n, a, b = (int(x) for x in input().split())\r\narr = [i for i in range(1, n + 1)]\r\n# arr[0:2] = [4]\r\n# print(arr)\r\nround = 0\r\nflag = True\r\nwhile len(arr) > 2 and flag:\r\n # print(arr)\r\n round += 1\r\n i = 0\r\n while i < len(arr) - 1:\r\n if a in arr[i:i + 2]:\r\n if b in arr[i:i + 2]:\r\n print(round)\r\n flag = False\r\n break\r\n else:\r\n arr[i:i + 2] = [a]\r\n elif b in arr[i:i + 2]:\r\n arr[i:i + 2] = [b]\r\n else:\r\n arr[i:i + 2] = [arr[i]]\r\n i += 1\r\nif len(arr) == 2 and flag:\r\n print('Final!')\r\n", "from math import ceil\r\n\r\nn, a, b = map(int, input().split())\r\nmax = max(a, b)\r\nmin = min(a, b)\r\nround = 0\r\nwhile(True):\r\n round += 1\r\n max = ceil(max/2)\r\n min = ceil(min/2)\r\n if max == min:\r\n break\r\n\r\nif 2**round == n:\r\n print('Final!')\r\nelse:\r\n print(round)", "import math\r\n\r\nn, a, b = tuple(map(int, input().split()))\r\n\r\n\r\n\r\n\r\ndef mr(k,n):\r\n a = [0]\r\n for i in range(n//k):\r\n a.extend([i]*k)\r\n return a\r\n\r\n\r\nrounds = {r : mr(2**r, 258) for r in range(1,10)}\r\n#print(len(rounds[1]))\r\n\r\ndef sol(a, b):\r\n for i in range(1, 10):\r\n if rounds[i][a] == rounds[i][b]:\r\n return i\r\n return 0\r\n\r\na = sol(a,b)\r\n\r\n\r\nprint(a if a != int(math.log(n,2)) else \"Final!\")", "n, a, b = map(int, input().split())\nif a > b:\n a, b = b, a\nif a <= n // 2 and b > n // 2:\n print('Final!')\nelse:\n a += n - 1\n b += n - 1\n for i in range(100):\n if a == b:\n print(i)\n break\n a //= 2\n b //= 2\n", "from math import log,ceil\r\nn,a,b=map(int,input().split())\r\nround_=1\r\nfinal=log(n,2)\r\n\r\na,b=min(a,b),max(a,b)\r\nwhile(abs(a-b)!=1 or (a%2==0 and b%2==1)):\r\n a=ceil(a/2)\r\n b=ceil(b/2)\r\n round_+=1\r\nif( round_==final) :\r\n print(\"Final!\")\r\nelse:\r\n print(round_)", "n,a,b=map(int,input().split())\nc=0\na -= 1\nb -= 1\nwhile a != b:\n a //= 2\n b //= 2\n c += 1\nif 2**c == n:\n print('Final!')\nelse:\n print(c)\n", "n, a, b = list(map(int, input().split()))\r\np2 = 0\r\nwhile 2 ** p2 != n:\r\n\tp2 += 1\r\n\r\nr = 0\r\nwhile a != b:\r\n\ta = round(a/2 + 0.001)\r\n\tb = round(b/2 + 0.001)\r\n\tr += 1\r\nif(r == p2):\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(r)", "# *\r\n# * *\r\n# * *\r\n# * * * Author:Aditya Joshi\r\n# * *\r\n# * *\r\n\r\nn, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\nr = 0\r\n\r\nwhile a != b:\r\n\r\n a //= 2\r\n\r\n b //= 2\r\n\r\n r += 1\r\nif 2 ** r < n:\r\n print(r)\r\nelse:\r\n print(\"Final!\")\r\n", "def main():\r\n n, a, b = map(int, input().split())\r\n\r\n a, b = min(a, b), max(a, b)\r\n a -= 1\r\n b -= 1\r\n\r\n parts = list(range(n))\r\n\r\n r = 1\r\n\r\n while True:\r\n new_parts = list()\r\n for i in range(0, len(parts), 2):\r\n if parts[i] in {a, b} and parts[i + 1] in {a, b}:\r\n if len(parts) == 2:\r\n print(\"Final!\")\r\n return\r\n else:\r\n print(r)\r\n return\r\n winner = parts[i] if parts[i] in {a, b} else parts[i + 1]\r\n new_parts.append(winner)\r\n parts = new_parts\r\n r += 1\r\n\r\n\r\nmain()\r\n", "n, a, b = [int(s) for s in input().split()]\r\na -= 1\r\nb -= 1\r\nl = 0\r\nwhile a != b:\r\n l -=- 1\r\n a //= 2\r\n b //= 2\r\nprint(l if 2**l != n else 'Final!')", "from copy import *\r\ndef main():\r\n n, a, b = map(int,input().split())\r\n t = list(range(1, n + 1))\r\n for i in range(1, 100):\r\n j = 0\r\n # print(t)\r\n t2 = []\r\n while j + 1 < len(t):\r\n k = 0\r\n if (t[j] == a or t[j] == b):\r\n t2.append(t[j])\r\n k += 1\r\n if t[j + 1] == b or t[j + 1] == a:\r\n t2.append(t[j + 1])\r\n k += 1\r\n if k == 0:\r\n t2.append(t[j + 1])\r\n elif k == 2:\r\n if (len(t) == 2):\r\n print(\"Final!\")\r\n else:\r\n print(i)\r\n return\r\n j += 2\r\n t = deepcopy(t2)\r\nmain()\r\n", "n, a, b = [int(i) for i in input().split()]\r\nfinal = ''\r\nrount = 0\r\nif a > b:\r\n if a >= n // 2 + 1 and b <= n / 2:\r\n final = 'Final!'\r\nelse:\r\n if b >= n // 2 + 1 and a <= n / 2:\r\n final = 'Final!'\r\nif final == 'Final!':\r\n print(final)\r\nelse:\r\n while a != b:\r\n a = a // 2 + a % 2\r\n b = b // 2 + b % 2\r\n rount += 1\r\n print(rount)\r\n\r\n", "# UCSD fa22 Week 7\n# pyright: strict\nimport sys\ninput = sys.stdin.readline\nflush = sys.stdout.flush\niil = lambda: [int(x) for x in input().split()]\n\ntests = 1\nfor _ in range(tests):\n n, a,b = iil()\n a -= 1\n b -= 1\n c=0\n while a != b:\n a //= 2\n b //= 2\n n //= 2\n c+= 1\n if n == 1:\n print(\"Final!\")\n else:\n print(c)\n\t\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t", "\r\n\r\n\r\n\r\nn,a,b = map(int,input().split())\r\n\r\na-=1\r\nb-=1\r\n\r\n\r\nans=0\r\n\r\nwhile True:\r\n a//=2\r\n b//=2\r\n ans+=1\r\n\r\n if a==b:\r\n if n==2:\r\n print('Final!')\r\n else:\r\n print(ans)\r\n break\r\n n//=2\r\n", "import math\r\nn,a,b=map(int,input().split())\r\ns=1\r\ne=n\r\ncnt=0\r\n\r\ndef round(s,e,a,b,cnt,n):\r\n cnt+=1\r\n m=(s+e)//2\r\n if s<=a<=m and m+1<=b<=e: \r\n if cnt==1:\r\n print(\"Final!\")\r\n else:\r\n print(int(math.log2(n)-cnt+1))\r\n elif s<=a<=m and s<=b<=m:\r\n round(s,m,a,b,cnt,n)\r\n elif m+1<=a<=e and m+1<=b<=e:\r\n round(m+1,e,a,b,cnt,n)\r\nround(s,e,min(a,b),max(a,b),cnt,n)", "from math import log2\nn, a, b=map(int, input().split())\nn=int(log2(n))\nfor i in range(1,n+1):\n if (a-1)//(2**i)==(b-1)//(2**i):\n if i==n:\n print(\"Final!\")\n else:\n print(i)\n break;\n\n#print(n)", "n, a, b = map(int, input().split())\r\n\r\nrounds = 2 ** (n + 1) - 1\r\nt = [set([i, i + 1]) for i in range(1, n, 2)]\r\nbr = 0\r\nans = 1\r\nwhile 1:\r\n #print(t)\r\n for i in range(len(t)):\r\n if a in t[i] and b in t[i]:\r\n br = 1\r\n break\r\n if br:\r\n break\r\n x = len(t)\r\n while x:\r\n x -= 2\r\n t.append(t[0] ^ t[1])\r\n #print(t)\r\n t.remove(t[1])\r\n t.remove(t[0])\r\n #print(t)\r\n ans += 1\r\nif len(t) == 1:\r\n print('Final!')\r\nelse:\r\n print(ans)\r\n \r\n", "n,a,b = map(int,input().split())\r\nx = max(a,b)\r\ny = min(a,b)\r\nn = int(n/2)\r\nc = 0\r\n\r\nif y <= n and x> n:\r\n print(\"Final!\")\r\n \r\nelse:\r\n while a != b:\r\n c += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n print(c) \r\n", "import sys\r\nn,a,b = (int(x) for x in input().split())\r\nif a > b:\r\n a,b = b,a\r\nr = 0\r\nfor i in range(1,9):\r\n if 2**i == n:\r\n r = i\r\n break\r\nfor j in range(1,9):\r\n len = 2 ** j\r\n if(j == r):\r\n print(\"Final!\")\r\n sys.exit()\r\n for i in range(1,n + 1,len):\r\n if(a >= i and a = i and b < i + len):\r\n print(j)\r\n sys.exit()", "n, a, b = map(int, input().split())\nr = 1\nmx = 2\nwhile 1:\n\tr1 = (a+mx-1)//mx\n\tr2 = (b+mx-1)//mx\n\tif r1 == r2:\n\t\tif mx == n:\n\t\t\tprint(\"Final!\")\n\t\telse:\n\t\t\tprint(r)\n\t\tbreak\n\tmx*=2 \n\tr+=1", "from math import ceil, log2\r\nn,a,b= map(int, input().split())\r\nans=1\r\nb,a= max(a,b), min(a,b)\r\nwhile ceil(b/pow(2,ans))!=ceil(a/pow(2,ans)):\r\n ans+=1\r\nif ans==log2(n): print(\"Final!\")\r\nelse: print(ans)\r\n", "import math\nimport sys\n\n\ndef main():\n n, a, b = map(int, sys.stdin.readline().split())\n a -= 1\n b -= 1\n\n total_rounds = int(math.log2(n))\n for r in range(1, total_rounds + 1):\n pow2 = 2 ** r\n if a // pow2 == b // pow2:\n if r == total_rounds:\n print('Final!')\n else:\n print(r)\n return\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nx=list(map(int,input().split()))\r\nm,a,b=x[0],x[1],x[2]\r\nif a>b:\r\n a,b=b,a\r\nn=0\r\nwhile b-a>1 or (a%2==0 and b%2>0):\r\n a=int(math.ceil(a/2.0))\r\n b=int(math.ceil(b/2.0))\r\n n+=1\r\n m//=2\r\nif m <= 2:\r\n print('Final!')\r\nelse:\r\n print(n+1)\r\n ", "from math import log2\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nans = int(log2(a ^ b) + 1)\r\nif 2 ** ans == n:\r\n print('Final!')\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().strip().split())\r\nif a > b:\r\n a, b = b, a\r\n\r\nr = 1\r\nt = [i+1 for i in range(n)]\r\nwhile True:\r\n s = list()\r\n for i in range(0, len(t), 2):\r\n if t[i] == a and t[i+1] == b:\r\n if len(t) == 2:\r\n print('Final!')\r\n else:\r\n print(r)\r\n exit(0)\r\n elif t[i] == a or t[i+1] == a:\r\n s.append(a)\r\n elif t[i] == b or t[i+1] == b:\r\n s.append(b)\r\n else:\r\n s.append(t[i]) \r\n t = s\r\n r += 1", "from math import log\r\n\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nmax_r = int(log(n, 2)) #n would be power of 2 , bcz there will alaways be even no of matches\r\n #n n//2 n/4......1\r\nc = 0\r\nwhile a // 2 != b // 2: #if a//2==b//2 thwy will be next to each other and then they will fight and one of them will win\r\n a //= 2\r\n b //= 2\r\n n //= 2\r\n c += 1\r\nc += 1\r\n\r\n#our target is that these 2 teams would meet in final,so whatever match they play they will win,,untill unless they both\r\n#are opponent to each other\r\n\r\nprint(\"Final!\" if c == max_r else c)\r\n", "import os.path\r\nimport sys\r\nfrom math import *\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef inp(): return sys.stdin.readline().strip()\r\n\r\nn,a,b=map(int,inp().split())\r\na-=1\r\nb-=1\r\nmatch=0\r\nwhile a!=b:\r\n a//=2\r\n b//=2\r\n match+=1\r\nif (1<<match)==n:\r\n print(\"Final!\")\r\nelse: print(match)", "v, f, s = map(int, input().split())\r\nf, s = f-1, s-1\r\na = list(range(v))\r\nx = []\r\ni = 0\r\nz = True\r\ng = 1\r\nwhile z:\r\n for i in range(0, v, 2):\r\n if a[i+1] == f and a[i] == s or a[i+1] == s and a[i] == f:\r\n print([g, \"Final!\"][v == 2])\r\n exit(0)\r\n elif a[i+1] != f and a[i] == s or a[i+1] != s and a[i] == f:\r\n x.append(a[i])\r\n elif a[i+1] == f and a[i] != s or a[i+1] == s and a[i] != f:\r\n x.append(a[i+1])\r\n else:\r\n x.append(a[i+1])\r\n a = x\r\n v = v//2\r\n x = []\r\n g += 1\r\n", "n, a, b = map(int, input().split())\r\n\r\na -= 1\r\nb -= 1\r\nc = 1\r\n\r\nwhile a > 0 or b > 0:\r\n a //= 2\r\n b //= 2\r\n if a == b:\r\n if n > 2:\r\n print(c)\r\n else:\r\n print(\"Final!\")\r\n break\r\n c += 1\r\n n //= 2\r\n", "n,a,b=map(int,input().split())\r\ncnt=0\r\na-=1\r\nb-=1\r\nwhile a!=b:\r\n a=a//2\r\n b=b//2\r\n cnt+=1\r\nprint(cnt if 2**cnt<n else 'Final!')", "n, a, b = map(int, input().split())\r\nfor i in range(8):\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\n if 2 ** (i + 1) == n:\r\n print('Final!')\r\n break\r\n elif a == b:\r\n print(i + 1)\r\n break", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2**(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]*2*self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])\n\n def update(self, k, x):\n k += self.num\n self.seg[k] = x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n res = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n res = self.segfunc(res, self.seg[r])\n if l & 1:\n res = self.segfunc(res, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n return res\n\ndef segfunc(x, y):\n if x <= y:\n return x\n else:\n return y\n\nide_ele = 10**18\n\nclass LCA:\n def __init__(self, g, root):\n # g: adjacency list\n # root\n self.n = len(g)\n self.root = root\n\n s = [self.root]\n self.parent = [-1]*self.n\n self.child = [[] for _ in range(self.n)]\n visit = [-1]*self.n\n visit[self.root] = 0\n while s:\n v = s.pop()\n for u in g[v]:\n if visit[u] == -1:\n self.parent[u] = v\n self.child[v].append(u)\n visit[u] = 0\n s.append(u)\n\n # Euler tour\n tank = [self.root]\n self.eulerTour = []\n self.left = [0]*self.n\n self.right = [-1]*self.n\n self.depth = [-1]*self.n\n\n eulerNum = -1\n de = -1\n\n while tank:\n v = tank.pop()\n if v >= 0:\n eulerNum += 1\n self.eulerTour.append(v)\n self.left[v] = eulerNum\n self.right[v] = eulerNum\n tank.append(~v)\n de += 1\n self.depth[v] = de\n for u in self.child[v]:\n tank.append(u)\n else:\n de -= 1\n if ~v != self.root:\n self.eulerTour.append(self.parent[~v])\n eulerNum += 1\n self.right[self.parent[~v]] = eulerNum\n\n #A = [self.depth[e] for e in self.eulerTour]\n A = [0]*(2*self.n-1)\n for i, e in enumerate(self.eulerTour):\n A[i] = self.depth[e]*(2*self.n-1)+i\n self.seg = SegTree(A, ide_ele, segfunc)\n\n def getLCA(self, u, v):\n # u, v: 0-indexed\n p = min(self.left[u], self.left[v])\n q = max(self.right[u], self.left[v])+1\n m = self.seg.query(p, q)\n return self.eulerTour[m%(2*self.n-1)]\n\n\nn, a, b = map(int, input().split())\na, b = a-1, b-1\ncur = n-1\nL = []\nfor i in range(n):\n if i%2 == 1:\n continue\n else:\n L.append((i, i+1))\nL.reverse()\nedge = []\nd = 0\nwhile n!= 1:\n n //= 2\n d += 1\n nL = []\n for i in range(n):\n cur += 1\n u, v = L.pop()\n edge.append((cur, u))\n edge.append((cur, v))\n nL.append(cur)\n if len(nL) == 1:\n break\n L = []\n for i in range(n):\n if i%2 == 1:\n continue\n else:\n L.append((nL[i], nL[i+1]))\n#print(edge)\ng = [[] for i in range(cur+1)]\nfor u, v in edge:\n g[u].append(v)\nlca = LCA(g, root=cur)\nl = lca.getLCA(a, b)\np = lca.depth[a]-lca.depth[l]\n#print(p)\n#print(d)\nif p == d:\n print('Final!')\nelse:\n print(p)\n", "def f(n, aim):\r\n xs = [x for x in range(1, n+1)]\r\n rn = 1\r\n while len(xs) > 2:\r\n new_xs = []\r\n for i in range(len(xs)//2):\r\n f, l = xs[2*i], xs[2*i+1]\r\n if f in aim and l in aim:\r\n return rn\r\n new_xs.append(f if f in aim else l)\r\n xs = new_xs\r\n rn+=1\r\n return \"Final!\"\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nprint(f(n, [a, b]))\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nfrom math import log2 as lg\r\ndef f(n,a,b,l,u):\r\n if n <= 1:\r\n return\r\n if a >= l and a <= n//2 + l - 1 and b >= n//2 + l and b <= u:\r\n if n == final:\r\n print('Final!')\r\n else:\r\n print(int(lg(n)))\r\n else:\r\n if b <= n//2 + l - 1:\r\n f(n//2,a,b,l,n//2 + l - 1)\r\n else:\r\n f(n//2,a,b,n//2 + l , u)\r\nif __name__ == \"__main__\":\r\n n,a,b = map(int,input().split())\r\n final = n\r\n if a > b:\r\n a,b = b,a\r\n f(n,a,b,1,n)", "arr = input().split(' ')\r\nn = int(arr[0])\r\na = int(arr[1])\r\nb = int(arr[2])\r\na -= 1\r\nb -= 1\r\nra = a//2\r\nrb = b//2\r\nc = 1\r\nwhile ra!=rb:\r\n ra = ra//2\r\n rb = rb//2\r\n c += 1\r\nif(pow(2,c)==n): print(\"Final!\")\r\nelse: print(c)", "n,a,b = map(int, input().strip().split())\r\na -= 1\r\nb -= 1\r\nans = 1\r\npwr = 2\r\nwhile 1:\r\n if a // pwr == b // pwr:\r\n if pwr == n:\r\n print(\"Final!\")\r\n else:\r\n print(ans)\r\n break\r\n pwr *= 2\r\n ans += 1", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn,a,b=map(int,input().split())\r\n\r\nl=0\r\np=1\r\n\r\nwhile(2*p<=n):\r\n p*=2\r\n l+=1\r\n\r\ncnt=0\r\nwhile(a!=b):\r\n cnt+=1\r\n a=(a+1)//2\r\n b=(b+1)//2\r\n \r\n\r\nif cnt==l:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)\r\n\r\n\r\n", "from math import log\r\n\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nmax_r = int(log(n, 2))\r\nc = 0\r\nwhile a // 2 != b // 2:\r\n a //= 2\r\n b //= 2\r\n n //= 2\r\n c += 1\r\nc += 1\r\nprint(\"Final!\" if c == max_r else c)\r\n", "import sys,math\r\nn,a,b=map(int,sys.stdin.readline().split())\r\na-=1 \r\nb-=1 \r\nans=0\r\nflag=True\r\nwhile(n>2):\r\n a//=2 \r\n b//=2 \r\n ans+=1\r\n if a==b:\r\n print(ans)\r\n flag=False\r\n break\r\n n//=2\r\nif flag:\r\n print(\"Final!\")\r\n", "import sys\r\nfrom math import log\r\ninput = sys.stdin.readline\r\nn,a,b = map(int,input().split())\r\nx = [[i] for i in range(1,n+1)]\r\nfor i in range(int(log(n,2))):\r\n for z in x:\r\n if a in z and b in z:\r\n print(i)\r\n sys.exit(0)\r\n new = []\r\n for k in range(0,len(x)//2):\r\n new.append(x[k*2]+x[k*2+1])\r\n x = new[:]\r\nprint(\"Final!\")\r\n", "n, a, b = map(int, input().split())\r\nc = 0\r\nwhile a != b:\r\n c += 1\r\n a = (a + 1) // 2\r\n b = (b + 1) // 2\r\nif 2 ** c == n:\r\n print('Final!')\r\nelse:\r\n print(c)", "z = list(input().split())\r\nn = int (z[0])\r\na = int (z[1])\r\nb = int (z[2])\r\nif a%2==0:\r\n a=a\r\nelse:\r\n a=a+1\r\nif b%2==0:\r\n b=b\r\nelse:\r\n b=b+1\r\ns1=abs(b-a)\r\nk=0\r\nwhile a!=b:\r\n a=a/2\r\n b=b/2\r\n k=k+1\r\n if a%2==0:\r\n a=a\r\n else:\r\n a=a+1\r\n if b%2==0:\r\n b=b\r\n else:\r\n b=b+1\r\nd=0\r\nwhile n>=2:\r\n n=n/2\r\n d=d+1\r\n \r\nif k+1==d:\r\n print('Final!')\r\nelse:\r\n print(k+1)", "n, a, b = map(int, input().split())\r\na, b = sorted([a, b])\r\nl = [*range(1, n + 1)]\r\nres = 1\r\nwhile l:\r\n for i in range(len(l) // 2):\r\n if l[i] == a and l[i + 1] == b:\r\n print(res if len(l) != 2 else \"Final!\")\r\n exit()\r\n if l[i] == a or l[i] == b:\r\n del l[i + 1]\r\n else:\r\n del l[i]\r\n res += 1\r\nprint(res)", "n,a,b = list(map(int,input().strip().split(' ')))\n\nteams = list(range(1,n+1))\nrno = 1\n\nif a > b:\n\ta,b = b,a\n\nwhile True:\n\tif len(teams) == 2:\n\t\tprint('Final!')\n\t\texit(0)\n\telse:\n\t\tnteams = []\n\t\tfor i in range(0,len(teams),2):\n\t\t\tmatch = [teams[i],teams[i+1]]\n\t\t\tif [a,b] == match:\n\t\t\t\tprint(rno)\n\t\t\t\texit(0)\n\t\t\telif a in match:\n\t\t\t\tnteams.append(a)\n\t\t\telif b in match:\n\t\t\t\tnteams.append(b)\n\t\t\telse:\n\t\t\t\tnteams.append(match[1])\n\t\tteams = nteams\n\t\trno += 1\n", "import math\r\nn,a,b=map(int,input().split())\r\nc=0\r\nwhile a!=b:\r\n a=(a+1)//2\r\n b=(b+1)//2\r\n c+=1\r\n n=n//2\r\nif n==1:\r\n print(\"Final!\")\r\nelse:\r\n print(c)", "n, a, b = map(int, input().split())\r\ncnt = 0\r\na-=1\r\nb-=1\r\nwhile a != b:\r\n a//=2\r\n b//=2\r\n n//=2\r\n cnt += 1\r\nif n == 1:\r\n print(\"Final!\")\r\nelse:\r\n print(cnt)", "#!/bin/python3\r\n\r\nimport math, sys\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nfinal = int(math.log2(n))\r\nteams = list(range(1, n+1))\r\n\r\n#print('expecting', final, 'rounds', file=sys.stderr)\r\n#print(teams, file=sys.stderr)\r\nfor round in range(1, final+1):\r\n #print('start round', round, file=sys.stderr)\r\n new_teams = []\r\n a_in, b_in = False, False\r\n for x, y in zip(range(0, len(teams), 2), range(1, len(teams), 2)):\r\n t1, t2 = teams[x], teams[y]\r\n #print(t1, t2, file=sys.stderr)\r\n if {t1, t2} == {a, b}:\r\n #print('(early exit)', file=sys.stderr)\r\n print('Final!' if round == final else round)\r\n sys.exit(0)\r\n elif (a == t1 or a == t2) and not a_in:\r\n #print('ADD A', file=sys.stderr)\r\n new_teams.append(a)\r\n a_in = True\r\n elif (b == t1 or b == t2) and not b_in:\r\n #print('ADD B', file=sys.stderr)\r\n new_teams.append(b)\r\n b_in = True\r\n else:\r\n new_teams.append(t1) # whatever\r\n if len(new_teams) == 0 and set(teams) == {a,b}:\r\n #print('no new set after round', file=sys.stderr)\r\n print('Final!' if round == final else round)\r\n sys.exit(0)\r\n teams = new_teams\r\n #print('after round', round, teams, file=sys.stderr)\r\n", "import math\r\nn,a,b = map(int,input().split())\r\nif(b<a):\r\n a,b = b,a\r\nlogans = 0\r\nnn = n\r\nwhile(nn>1):\r\n logans+=1\r\n nn//=2\r\n#print(logans)\r\nans = logans\r\nwhile(True):\r\n if(a<=n//2 and b>n//2):\r\n if(ans==logans):\r\n print(\"Final!\")\r\n break\r\n else:\r\n print(ans)\r\n break\r\n elif(a<=n//2 and b<=n//2):\r\n ans-=1\r\n n//=2\r\n elif(a>n//2 and b>n//2):\r\n a-=(n//2)\r\n b-=(n//2)\r\n #ans-=1\r\n n//2\r\n \r\n# else:\r\n# for i in range(logans):\r\n# if((a+(2**i))==b or (a+(2**i)-1)==b):\r\n# print(i+1)\r\n# break\r\n ", "import sys\n\ndef solve(n, a, b):\n k = 0\n while a != b:\n k += 1\n a = (a + 1) // 2\n b = (b + 1) // 2\n return \"Final!\" if 2 ** k == n else k\n\nif __name__ == '__main__':\n line = sys.stdin.readline()\n n, a, b = [int(v) for v in line.split(' ')]\n res = solve(n, a, b)\n print(res)\n\n# assert solve(2, 1, 2) == \"Final!\"\n# assert solve(4, 1, 2) == 1\n# assert solve(8, 2, 6) == \"Final!\"\n# assert solve(8, 7, 5) == 2\n", "from math import log2\r\nn, a, b = [int(z) for z in input().split()]\r\nl = int(log2(n))\r\nnew = [0] * 256\r\nnew[a - 1] = 1\r\nnew[b - 1] = 1\r\ncur = []\r\ncnt = 1\r\nwhile True:\r\n for i in range(0, len(new) - 1, 2):\r\n cur.append(new[i] + new[i + 1])\r\n for i in range(len(cur)):\r\n if cur[i] == 2:\r\n if cnt == l:\r\n print(\"Final!\")\r\n else:\r\n print(cnt)\r\n exit(0)\r\n cnt += 1\r\n new = cur\r\n cur = []\r\n ", "n, a, b = map(int, input().split())\r\nnum = 0\r\na += n - 2\r\nb += n - 2\r\nwhile a != b:\r\n a = (a - 1) // 2\r\n b = (b - 1) // 2\r\n num += 1\r\n\r\nif 2 ** num == n:\r\n print(\"Final!\")\r\nelse:\r\n print(num)", "j=list(map(int,input().split()))\r\nn=j[0]\r\na=j[1]\r\nb=j[2]\r\nm=0\r\nl=1\r\nr=n\r\nk=0\r\np=0\r\nwhile n>1:\r\n n=n//2\r\n m=m+1\r\np=m\r\n \r\nwhile True:\r\n k=(l+r)//2\r\n if a>k and b<=k:\r\n if m==p:\r\n print('Final!')\r\n break\r\n else:\r\n print(m)\r\n break\r\n if a<=k and b>k:\r\n if m==p:\r\n print('Final!')\r\n break\r\n else:\r\n print(m)\r\n break\r\n \r\n if a<=k and b<=k:\r\n r=k\r\n m=m-1\r\n if a>k and b>k:\r\n l=k+1\r\n m=m-1\r\n", "from math import ceil\r\nn,a,b=map(int,input().split())\r\nr,p=1,1\r\nwhile ceil(a/2**p)!=ceil(b/2**p):\r\n p+=1\r\nif 2**(p)==n:print(\"Final!\")\r\nelse:print(p)", "import math\n\nn, a, b = map(int, input().split())\n\na, b = min(a, b), max(a, b)\n\nr = list(range(1, n + 1))\n\n\nit = 0\n\nwhile True:\n r1 = []\n for i, j in zip(*[iter(r)] * 2):\n if i in (a, b):\n if j in (a, b):\n break\n r1.append(i)\n elif j in (a, b):\n r1.append(j)\n else:\n r1.append(i)\n else:\n it += 1\n r = r1.copy()\n continue\n it += 1\n break\n\nprint(it if it != int(math.log2(n)) else \"Final!\")\n\n\n\n", "n,a,b=map(int,input().split())\r\na,b,n=bin(a-1)[2:],bin(b-1)[2:],bin(n-1)[2:]\r\na,b='0'*(len(n)-len(a))+a,'0'*(len(n)-len(b))+b\r\nfor i in range(len(n)):\r\n if a[i]!=b[i]:\r\n if i==0:\r\n print('Final!')\r\n else:\r\n print(len(n)-i)\r\n quit()\r\n \r\n", "line = input().split(' ')\r\n\r\nn = int(line[0])\r\na = int(line[1])\r\nb = int(line[2])\r\n\r\nteams = list(range(1, n+1))\r\n\r\nrounds=0\r\n\r\nwhile len(teams) > 2:\r\n rounds+=1\r\n \r\n new_teams=[]\r\n\r\n for index in range(0, len(teams)//2):\r\n x = teams[index*2]\r\n y = teams[index*2 + 1]\r\n\r\n if x==a and y==b or x==b and y==a:\r\n break\r\n\r\n if a in [x, y]:\r\n new_teams.append(a)\r\n\r\n else:\r\n if b in [x, y]:\r\n new_teams.append(b)\r\n\r\n else:\r\n new_teams.append(max(x, y))\r\n\r\n else:\r\n teams=new_teams\r\n continue\r\n\r\n break\r\n \r\nelse:\r\n print(\"Final!\")\r\n\r\nif len(teams) > 2:\r\n print(rounds)\r\n", "n,a,b=map(int,input().split())\r\n\r\na,b,r=a-1,b-1,0\r\n\r\nwhile a!=b:\r\n\r\n a//=2\r\n\r\n b//=2\r\n\r\n r+=1\r\n\r\nprint(r if 2**r<n else 'Final!')\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled" ]

{"inputs": ["4 1 2", "8 2 6", "8 7 5", "128 30 98", "256 128 256", "256 2 127", "2 1 2", "2 2 1", "4 1 3", "4 1 4", "4 2 1", "4 2 3", "4 2 4", "4 3 1", "4 3 2", "4 3 4", "4 4 1", "4 4 2", "4 4 3", "8 8 7", "8 8 5", "8 8 1", "16 4 3", "16 2 4", "16 14 11", "16 3 11", "32 10 9", "32 25 28", "32 22 18", "32 17 25", "32 18 3", "64 40 39", "64 60 58", "64 34 37", "64 26 24", "64 50 43", "64 17 42", "128 116 115", "128 35 33", "128 61 59", "128 116 123", "128 17 15", "128 124 77", "128 4 80", "256 224 223", "256 24 22", "256 199 196", "256 148 159", "256 178 166", "256 75 97", "256 185 200", "256 3 238", "256 128 129", "256 255 129", "256 255 128", "256 129 256", "128 98 69", "128 47 83", "16 2 3", "64 32 30", "8 4 5", "8 7 8", "8 2 3", "8 2 5"], "outputs": ["1", "Final!", "2", "Final!", "Final!", "7", "Final!", "Final!", "Final!", "Final!", "1", "Final!", "Final!", "Final!", "Final!", "1", "Final!", "Final!", "1", "1", "2", "Final!", "1", "2", "3", "Final!", "1", "2", "3", "4", "Final!", "1", "2", "3", "4", "5", "Final!", "1", "2", "3", "4", "5", "6", "Final!", "1", "2", "3", "4", "5", "6", "7", "Final!", "Final!", "7", "Final!", "7", "6", "Final!", "2", "2", "Final!", "1", "2", "Final!"]}

UNKNOWN

PYTHON3

CODEFORCES

173

cf9bfbf389d9d8bdc2c282638d92b467

Dasha and Very Difficult Problem

Dasha logged into the system and began to solve problems. One of them is as follows: Given two sequences *a* and *b* of length *n* each you need to write a sequence *c* of length *n*, the *i*-th element of which is calculated as follows: *c**i*<==<=*b**i*<=-<=*a**i*. About sequences *a* and *b* we know that their elements are in the range from *l* to *r*. More formally, elements satisfy the following conditions: *l*<=≤<=*a**i*<=≤<=*r* and *l*<=≤<=*b**i*<=≤<=*r*. About sequence *c* we know that all its elements are distinct. Dasha wrote a solution to that problem quickly, but checking her work on the standard test was not so easy. Due to an error in the test system only the sequence *a* and the compressed sequence of the sequence *c* were known from that test. Let's give the definition to a compressed sequence. A compressed sequence of sequence *c* of length *n* is a sequence *p* of length *n*, so that *p**i* equals to the number of integers which are less than or equal to *c**i* in the sequence *c*. For example, for the sequence *c*<==<=[250,<=200,<=300,<=100,<=50] the compressed sequence will be *p*<==<=[4,<=3,<=5,<=2,<=1]. Pay attention that in *c* all integers are distinct. Consequently, the compressed sequence contains all integers from 1 to *n* inclusively. Help Dasha to find any sequence *b* for which the calculated compressed sequence of sequence *c* is correct. The first line contains three integers *n*, *l*, *r* (1<=≤<=*n*<=≤<=105,<=1<=≤<=*l*<=≤<=*r*<=≤<=109) — the length of the sequence and boundaries of the segment where the elements of sequences *a* and *b* are. The next line contains *n* integers *a*1,<=<=*a*2,<=<=...,<=<=*a**n* (*l*<=≤<=*a**i*<=≤<=*r*) — the elements of the sequence *a*. The next line contains *n* distinct integers *p*1,<=<=*p*2,<=<=...,<=<=*p**n* (1<=≤<=*p**i*<=≤<=*n*) — the compressed sequence of the sequence *c*. If there is no the suitable sequence *b*, then in the only line print "-1". Otherwise, in the only line print *n* integers — the elements of any suitable sequence *b*. Sample Input 5 1 5 1 1 1 1 1 3 1 5 4 2 4 2 9 3 4 8 9 3 2 1 4 6 1 5 1 1 1 1 1 1 2 3 5 4 1 6 Sample Output 3 1 5 4 2 2 2 2 9 -1

[ "n,l,r = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nP = list(map(int,input().split()))\r\ns = [0] * n\r\nper=0\r\nfor j in range(n):\r\n s[P[j] - 1] = j\r\nb = [0] * n\r\nb[s[0]] = l\r\nfor j in range(1,n):\r\n last = b[s[j-1]] - A[s[j-1]]\r\n nexs = last+1\r\n \r\n if r - A[s[j]] > last:\r\n b[s[j]] = max(nexs +A[s[j]],l)\r\n else:\r\n per = 1\r\n break\r\nif per == 1:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str,b)))", "n, l, r = [int(el) for el in input().split()]\r\na = [int(el) for el in input().split()]\r\np = [int(el) for el in input().split()]\r\n\r\nb = [a[i] + p[i] for i in range(n)]\r\nmx = max(b)\r\nmn = min(b)\r\nif mx <= r:\r\n\tprint(' '.join([str(el) for el in b]))\r\nelse:\r\n\tdiff = mx - r\r\n\tif mn - diff >= l:\r\n\t\tprint(' '.join([str(el - diff) for el in b]))\r\n\telse:\r\n\t\tprint(-1)\r\n", "R = lambda: map(int, input().split())\r\nn, l, r = R()\r\na, d = list(R()), list(R())\r\nb = [av + cv for av, cv in zip(a, d)]\r\nmi = min(b)\r\nif mi < l:\r\n b = [bv + l - mi for bv in b]\r\nmx = max(b)\r\nif mx > r:\r\n b = [bv - (mx - r) for bv in b]\r\nif l <= min(b) <= max(b) <= r:\r\n print(' '.join(map(str, b)))\r\nelse:\r\n print(-1)", "f = lambda: map(int, input().split())\r\nn, l, r = f()\r\nb = [x + y for x, y in zip(f(), f())]\r\nu, v = l - min(b), r - max(b)\r\nprint(-1 if u > v else ' '.join(str(q + u) for q in b))", "n, l, r = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\ns = set()\r\n\r\nx = []\r\nfor i in range(len(a)):\r\n\tx.append([p[i], i])\r\n\r\nx.sort()\r\nmx = -1000000000000\r\nfor i in range(n):\r\n\tp[x[i][1]] = max(l, mx + a[x[i][1]] + 1)\r\n\tif p[x[i][1]] > r:\r\n\t\tprint('-1')\r\n\t\texit(0)\r\n\tmx = p[x[i][1]] - a[x[i][1]]\r\n\r\nidx = 0\r\nfor i in p:\r\n\tif idx != 0:\r\n\t\tprint(\"\", i, end=\"\")\r\n\telse:\r\n\t\tprint(i, end=\"\")\r\n\t\tidx = 1\r\nprint('')\r\n", "import sys\r\n\r\nN, L, R = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * N\r\nc = list(map(int, input().split()))\r\nd = [i for i in range(N)]\r\n\r\nz = [list(t) for t in zip(c, a, b, d)]\r\nz = sorted(z)\r\n\r\nz[0][2] = L\r\nlast = z[0][2] - z[0][1]\r\n\r\nfor i in range(1, N):\r\n z[i][2] = max(last + 1 + z[i][1], L)\r\n if z[i][2] > R:\r\n print(-1)\r\n sys.exit()\r\n last = z[i][2] - z[i][1]\r\n\r\nz = sorted(z, key=lambda t: t[3])\r\n_, _, res, _ = zip(*z)\r\nprint(*res)\r\n", "\ndef read_ints():\n return list(map(int, input().split()))\n\ndef solve(n,l,r,a,p):\n pai = [(p[i], a[i], i) for i in range(n)]\n pai.sort()\n bi = [(l,pai[0][2])]\n for i in range(1,n):\n p,aa,idx = pai[i]\n b = max(l, bi[i-1][0] - pai[i-1][1] + aa + 1)\n if b > r:\n return [-1]\n bi.append((b,idx))\n bi.sort(key = lambda x: x[1])\n return [b for b,_ in bi]\n \n\nn,l,r = read_ints()\na = read_ints()\np = read_ints()\nresult = solve(n,l,r,a,p)\nprint(' '.join(map(str,result)))", "n, l, r = map(int, input().split())\na = list(map(int, input().split()))\np = list(map(int, input().split()))\n\nans = [0] * n\norder = [0] * n\n\nfor i in range(n):\n order[p[i] - 1] = i\n\ncur = -10**19\nfor o in order:\n bi = max(l, cur + 1 + a[o])\n if bi > r:\n print(-1)\n exit()\n\n ans[o] = bi\n cur = bi - a[o]\n \nprint(*ans)", "n, l, r = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\nseg = [0] * n\r\nfor i in range(n):\r\n seg[i] = [l - a[i], r - a[i]]\r\n \r\nsegments = [0] * n\r\nfor i in range(n):\r\n segments[p[i] - 1] = seg[i]\r\n\r\nc = [0] * n\r\ncan = True\r\nl = -(10 ** 18)\r\nfor i in range(n):\r\n if l >= segments[i][1]:\r\n can = False\r\n break\r\n \r\n if segments[i][0] > l:\r\n l = segments[i][0]\r\n else:\r\n l = l + 1\r\n \r\n c[i] = l\r\n \r\nif not can:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n print(c[p[i] - 1] + a[i], end = ' ')", "n, l, r = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\norder = dict()\r\n\r\nfor i in range(len(p)):\r\n order[p[i]] = i\r\n\r\ncurr = -100000000000\r\nb = [-1] * n\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n b[order[i]] = l\r\n curr = b[order[i]] - a[order[i]]\r\n continue\r\n b[order[i]] = max(l, curr + 1 + a[order[i]])\r\n curr = b[order[i]] - a[order[i]]\r\n \r\nfor i in b:\r\n if i > r:\r\n print(-1)\r\n exit()\r\nprint(*b)\r\n", "n, l, r = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\npos = []\r\nb = [0] * n\r\nfor i in range(n):\r\n pos.append((p[i], i))\r\npos.sort()\r\nb[pos[0][1]] = l\r\nc = [0] * n\r\nc[pos[0][1]] = l - a[pos[0][1]]\r\ncur = c[pos[0][1]]\r\nfor i in range(1, n):\r\n b[pos[i][1]] = cur + 1 + a[pos[i][1]]\r\n cur += 1\r\nm = min(b)\r\nfor i in range(n):\r\n b[i] += (l - m)\r\nif max(b) > r:\r\n print(-1)\r\n exit()\r\nprint(*b)", "import os, sys\r\nfrom io import BytesIO, IOBase\r\nfrom math import log2, ceil, sqrt, gcd\r\nfrom _collections import deque\r\nimport heapq as hp\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import cos, sin\r\nfrom itertools import permutations\r\nfrom operator import itemgetter\r\n\r\nsys.setrecursionlimit(5 * 10 ** 4)\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\npi = 3.1415926535\r\nmod = 998244353\r\n\r\nn, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = [0] * n\r\nck = [i for i in range(n)]\r\nck.sort(key=lambda x: b[x])\r\nlast = -float('inf')\r\nbol=True\r\nfor i in ck:\r\n f=l\r\n ls=r\r\n while f<ls:\r\n mid=(f+ls)//2\r\n if mid-a[i]>last:\r\n ls=mid\r\n else:\r\n f = mid+1\r\n if f-a[i]>last:\r\n ans[i] = f\r\n last = f-a[i]\r\n else:\r\n bol=False\r\n\r\nif not bol:\r\n print(-1)\r\nelse:\r\n print(*ans)\r\n", "from operator import itemgetter\n\nn, l, r = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\np = [int(i) for i in input().split()]\nA = sorted([[a[i], p[i], i, 0] for i in range(n)], key = itemgetter(1))\n\nA[0][3] = l\nc = A[0][3] - A[0][0]\nfor i in range(1, n):\n A[i][3] = max(l, A[i][0]+c+1)\n c = A[i][3] - A[i][0]\n if A[i][3] > r:\n print(-1)\n break\nelse:\n A = sorted(A, key = itemgetter(2))\n for i in range(n):\n print(A[i][3], end=\" \")", "n,l,r = map(int, input().split())\r\nA = [int(i) for i in input().split()]\r\nCord = [int(i) for i in input().split()]\r\nCinv = [0 for _ in range(n)]\r\nfor i in range(n):\r\n Cinv[Cord[i]-1] = i \r\n\r\npmin = -10**18\r\nB = [0 for _ in range(n)]\r\nans = True\r\nfor i in range(n):\r\n ad = max(l, pmin+A[Cinv[i]]+1)\r\n B[Cinv[i]] = ad\r\n pmin = B[Cinv[i]]-A[Cinv[i]]\r\n if ad > r:\r\n ans = False\r\n\r\nif ans:\r\n print(*B)\r\nelse:\r\n print(-1)\r\n", "n,l,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nc=[]\r\nfor j in range(n):\r\n c.append([p[j],j])\r\nc.sort()\r\nj=0\r\nb=[0]*(n)\r\npre=-float(\"inf\")\r\nf=0\r\nwhile(j<n):\r\n i=c[j][1]\r\n if l-a[i]>=pre:\r\n b[i]=l\r\n pre=l-a[i]+1\r\n else:\r\n q=pre+a[i]\r\n if q<=r:\r\n b[i]=q\r\n pre=q-a[i]+1\r\n\r\n else:\r\n f=1\r\n break\r\n j+=1\r\nif f==1:\r\n print(-1)\r\nelse:\r\n print(*b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, L, R = map(int, input().split())\r\na = [*map(int, input().split())]\r\np = sorted((e, i) for i, e in enumerate(map(int, input().split())))\r\nprev = -float('inf')\r\nres = [0] * n\r\nfor _, i in p:\r\n l = max(a[i] + prev, L - 1) + 1\r\n if l > R:\r\n print(-1)\r\n exit()\r\n res[i] = l\r\n prev = l - a[i]\r\nprint(*res)", "read=lambda: map(int,input().split())\nn,l,r=read()\nmn=l\nA=[-i for i in list(read())]\nB=[0]*n\nC=list(enumerate(list(read())))\nC.sort(key=lambda x:x[-1])\nC=[i for i,j in C]\nfor i in range(n):\n B[C[i]]=mn-A[C[i]]\n mn+=1\nd=min(B)\nB=[i-(d-l) for i in B]\nif r-1+l>=n and max(B)<=r and min(B)>=l:print(*B)\nelse:print(-1)\n\n\n", "read = lambda: map(int, input().split())\r\nn, l, r = read()\r\na = list(read())\r\np = list(read())\r\nd = [i for i in range(n)]\r\nd.sort(key = lambda x: p[x])\r\ncur = l - a[d[0]]\r\nb = [0] * n\r\nfor ind in d:\r\n b[ind] = a[ind] + cur\r\n if b[ind] < l:\r\n cur = l - a[ind]\r\n b[ind] = l\r\n cur += 1\r\nif max(b) > r: \r\n print(-1)\r\n exit()\r\nprint(' '.join(map(str, b)))", "R= lambda: map(int,input().split())\r\nn,l,r= R()\r\na,d=list(R()),list(R())\r\nb=[l for _ in range(n)]\r\nc=[0 for _ in range(n)]\r\nfor i in range(n):\r\n c[d[i]-1]=i\r\ndif=l-a[c[0]]\r\nfor x in c[1:]:\r\n if b[x]-a[x]<=dif: \r\n b[x]=a[x]+dif+1\r\n dif=b[x]-a[x]\r\n if b[x]>r:\r\n print(\"-1\")\r\n exit()\r\nprint(\" \".join(map(str,b)))\r\n \r\n \r\n \r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nn, l, r = map(int, input().split())\r\na, p = [[int(x) for x in input().split()] for _ in range(2)]\r\nsor, mi, b = sorted(range(n), key=p.__getitem__), l - r, [0] * n\r\n\r\nfor _ in range(n):\r\n i = sor[_]\r\n b[i] = max(l, a[i] + mi)\r\n if b[i] > r:\r\n exit(print(-1))\r\n\r\n mi = b[i] - a[i] + 1\r\n\r\nprint(*b)\r\n", "import sys\r\nn, l, r = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\npp = [i for i in range(n)]\r\npp.sort(key = lambda x : p[x] * -1)\r\nb = [0] * n\r\nb[pp[0]] = r\r\nc = [pp[0]] * n\r\nc[pp[0]] = b[pp[0]] - a[pp[0]]\r\nfor j in range(1, n):\r\n i = pp[j]\r\n b[i] = a[i] + c[pp[j - 1]] - 1\r\n if b[i] < l:\r\n print(-1)\r\n sys.exit(0)\r\n if b[i] > r:\r\n b[i] = r\r\n #print('b[i] = r')\r\n c[i] = b[i] - a[i]\r\nprint(' '.join([str(i) for i in b]))\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nq = [0] * n\r\nfor i in range(n):\r\n q[p[i] - 1] = i\r\ninf = pow(10, 9) + 1\r\nu = -inf\r\nans = [0] * n\r\nok = 1\r\nfor i in q:\r\n ai = a[i]\r\n v = l - ai\r\n d = max(0, u - v + 1)\r\n if l + d <= r:\r\n ans[i] = l + d\r\n u = l + d - ai\r\n else:\r\n ok = 0\r\n break\r\nif not ok:\r\n ans = [-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n, l, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\nout = [-1] * n\r\np = list(map(int, input().split()))\r\npp = [(p[i],i) for i in range(n)]\r\npp.sort()\r\n\r\ncurr = -(l+r)\r\nfor v, i in pp:\r\n best = curr + 1 + a[i]\r\n if best < l:\r\n best = l\r\n out[i] = best\r\n curr = best - a[i]\r\n\r\nif max(out) > r:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str,out)))\r\n \r\n", "inp = [int(i) for i in input().strip().split()]\r\nn = inp[0]\r\nl = inp[1]\r\nr = inp[2]\r\na = [int(i) for i in input().strip().split()]\r\nc = [int(i) for i in input().strip().split()]\r\nb = []\r\nmn = 2000000009\r\nmx = -2000000009\r\nfor i in range(n) :\r\n\tb.append(a[i] + c[i] - 1)\r\n\tif b[i] < mn :\r\n\t\tmn = b[i]\r\n\tif b[i] > mx :\r\n\t\tmx = b[i]\r\nif mn >= l and mx <= r :\r\n\tfor i in b :\r\n\t\tprint(i, end = \" \")\r\nelse :\r\n\treq = mx - r\r\n\tif mn - req < l :\r\n\t\tprint(-1)\r\n\telse :\r\n\t\tfor i in b :\r\n\t\t\tprint(i - req, end = \" \")\r\n\r\n" ]

{"inputs": ["5 1 5\n1 1 1 1 1\n3 1 5 4 2", "4 2 9\n3 4 8 9\n3 2 1 4", "6 1 5\n1 1 1 1 1 1\n2 3 5 4 1 6", "5 1 7\n1 4 4 6 5\n5 2 1 4 3", "5 10 100\n12 14 15 11 13\n4 2 1 5 3", "2 1 1000000000\n1000000000 1\n2 1", "2 1 1000000000\n1000000000 1\n1 2", "5 1 5\n1 1 1 1 1\n1 2 3 4 5", "5 1 5\n1 1 1 1 1\n2 3 1 5 4", "1 1000000000 1000000000\n1000000000\n1", "6 3 7\n6 7 5 5 5 5\n2 1 4 3 5 6", "3 5 100\n10 50 100\n3 2 1", "10 1 10\n9 2 9 5 5 2 6 8 2 8\n2 10 1 6 7 8 5 3 9 4", "30 100 200\n102 108 122 116 107 145 195 145 119 110 187 196 140 174 104 190 193 181 118 127 157 111 139 175 173 191 181 105 142 166\n30 26 20 23 27 15 2 14 21 25 6 1 17 10 29 5 3 7 22 19 13 24 18 9 11 4 8 28 16 12", "50 10 15\n13 14 12 14 12 15 13 10 11 11 15 10 14 11 14 12 11 10 10 13 11 13 12 15 14 15 13 15 13 10 12 10 15 15 10 14 11 11 10 14 11 12 13 12 10 11 13 15 14 11\n20 10 25 13 29 6 24 47 37 39 2 44 12 33 9 26 35 49 46 19 38 23 30 5 16 4 21 7 18 45 28 43 1 8 48 15 36 40 50 11 32 27 22 31 42 41 17 3 14 34", "10 8 10\n8 10 10 9 8 10 10 10 10 10\n9 5 6 8 10 2 7 3 1 4", "50 1 50\n6 20 27 26 46 35 41 41 4 12 48 13 20 5 35 7 37 3 18 17 22 42 28 1 30 46 38 38 42 29 33 42 8 45 22 40 11 33 12 15 16 49 30 19 29 40 5 12 32 22\n47 27 35 40 31 26 42 19 11 49 37 3 41 34 36 30 16 44 12 4 46 20 14 39 32 25 18 1 21 6 2 17 48 7 5 24 29 33 50 43 8 15 28 23 22 13 45 38 10 9", "11 5 11\n9 8 7 5 7 5 9 5 10 5 7\n3 4 6 9 5 11 2 10 1 8 7"], "outputs": ["3 1 5 4 2 ", "2 2 2 9 ", "-1", "2 2 1 6 4 ", "10 10 10 10 10 ", "-1", "1 1 ", "1 2 3 4 5 ", "2 3 1 5 4 ", "1000000000 ", "3 3 4 3 5 6 ", "5 5 5 ", "2 3 1 2 3 1 2 2 2 3 ", "100 100 100 100 100 101 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 101 100 100 100 ", "-1", "-1", "-1", "6 6 7 8 6 10 5 9 5 7 8 "]}

UNKNOWN

PYTHON3

CODEFORCES

24

cfa14502e4800d652733f9b4ec565760

Permutation

"Hey, it's homework time" — thought Polycarpus and of course he started with his favourite subject, IT. Polycarpus managed to solve all tasks but for the last one in 20 minutes. However, as he failed to solve the last task after some considerable time, the boy asked you to help him. The sequence of *n* integers is called a permutation if it contains all integers from 1 to *n* exactly once. You are given an arbitrary sequence *a*1,<=*a*2,<=...,<=*a**n* containing *n* integers. Each integer is not less than 1 and not greater than 5000. Determine what minimum number of elements Polycarpus needs to change to get a permutation (he should not delete or add numbers). In a single change he can modify any single sequence element (i. e. replace it with another integer). The first line of the input data contains an integer *n* (1<=≤<=*n*<=≤<=5000) which represents how many numbers are in the sequence. The second line contains a sequence of integers *a**i* (1<=≤<=*a**i*<=≤<=5000,<=1<=≤<=*i*<=≤<=*n*). Print the only number — the minimum number of changes needed to get the permutation. Sample Input 3 3 1 2 2 2 2 5 5 3 3 3 1 Sample Output 0 1 2

[ "n = int(input())\r\na = input().split()\r\nd = {}\r\nfor i in a:\r\n t = int(i)\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\nres = 0\r\nfor i in range(1, n+1):\r\n if i not in d:\r\n res += 1\r\nprint(res)\r\n", "n=int(input())\r\na={*map(int,input().split())}\r\nk=0\r\nfor i in range(1,n+1):\r\n if i not in a:k+=1\r\nprint(k)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nhashmap = [0] * 5001\r\nfor x in arr:\r\n\thashmap[x] = 1\r\ncnt = 0\r\nfor x in range(n):\r\n\tif(hashmap[x+1] == 0):\r\n\t\tcnt = cnt + 1\r\nprint(cnt)\r\n", "n = int(input())\r\nmass = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(1, n + 1):\r\n\tif i not in mass:\r\n\t\tk += 1\r\nprint(k)", "n = int(input())\ncount = (n + 1) * [ 0 ]\nfor a in map(int, input().split()):\n if a <= n:\n count[a] += 1\nresult = 0\nfor a in count[1:(n + 1)]:\n if a == 0:\n result += 1\nprint(result)\n", "n = int(input())\na = set(list(map(int,input().split())))\nprint(len(set(range(1,n+1))-a))", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n permutation = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n hash = [0 for i in range(n + 1)]\r\n for i in permutation:\r\n if i <= n:\r\n hash[i] += 1\r\n else:\r\n counter += 1\r\n for i in range(len(hash)):\r\n if i != 0:\r\n if hash[i] > 0:\r\n counter += hash[i] - 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\nans = n\r\nA = set(map(int, input().split()))\r\nfor i in range(1, n + 1):\r\n if i in A:\r\n ans -= 1\r\nprint(ans)", "n = int(input())\r\nlista = [int(i) for i in input().split() if int(i) <= n]\r\nprint(n - len(set(lista)))\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import Counter\r\nn=int(input()) ; arr=list(map(int,input().split())) ; count=Counter(arr) ; dic=dict() ; c=0\r\nfor i in range(1,5001):\r\n dic[i]=0\r\nfor i in count:\r\n dic[i]=count[i]\r\nfor i in range(1,n+1):\r\n if dic[i]==0:\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nnl=[]\r\nc=0\r\nfor i in l:\r\n if i not in nl:\r\n if i>=1 and i<=n:\r\n nl.append(i)\r\n c+=1\r\nprint(n-c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = set(a)\r\ncount = len(a) - len(b)\r\nfor i in b:\r\n if i>n:\r\n count = count+1\r\n else:\r\n pass \r\nprint(count)", "n = int(input())\r\n\r\ns = input().split(' ')\r\n\r\na = [0] * (len(s)+1)\r\n\r\nsum = 0\r\n\r\nfor i in s:\r\n j = int(i)\r\n if j <= len(s):\r\n if a[j] == 0:\r\n a[j] = 1\r\n else:\r\n sum += 1\r\n else:\r\n sum += 1\r\n\r\nprint(sum)\r\n\r\n", "n = int(input())\r\na = set(map(int,input().split()))\r\nr = n-len(a)\r\n\r\nfor x in a :\r\n if x > n :\r\n r += 1\r\nprint(r)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nc=0\r\nfor i in s:\r\n if((i>n) or (i<0)):\r\n c=c+1\r\nc=c+(n-(len(s)))\r\nprint(c)", "n = int(input())\n\nc = 0\n\nx = [int(i) for i in input().split()]\n\nfor i in range(1, n+1):\n\tif i not in x:\n\t\tc += 1\n\nprint(c)\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nseen = []\r\n\r\nfor num in nums:\r\n if num > n:\r\n count += 1\r\n elif num in seen:\r\n count += 1\r\n elif num not in seen: \r\n seen.append(num)\r\n\r\nprint(count)", "def diferencia(l,k):\n t=[]\n for j in k:\n if j not in l:\n t.append(j)\n return t\nn=int(input())\ndata= input()\ndata=data.split()\ndata=[int(i) for i in data]\ndata.sort(reverse=True)\nt=[]\nfor i in range (1,n+1):\n t.append(i)\nt.sort(reverse=True)\nj=diferencia(data,t)\nprint (len(j))\n \t\t \t\t \t \t\t \t \t\t\t \t\t\t \t\t \t \t", "\nminput = input().rstrip().split()\n\nn = int(minput[0])\n\n#d = int(minput[1])\n\nnums = list(map(int, input().rstrip().split()))\n\ncount=0\nhashset=set(nums)\nfor i in range(1,n+1):\n if i not in hashset:\n count+=1\nprint(count)\n\n\t\t \t \t\t\t \t \t \t\t \t\t\t\t\t", "n=int(input())\nlista=list(map(int,input().split()))\nlista2=[]\n \nfor i in range(len(lista)):\n if lista[i]<=n:\n lista2.append(lista[i])\n \nst=set(lista2)\nresultado=n-len(st)\nprint(resultado)\n\t\t\t \t\t \t \t\t\t \t \t\t \t \t \t", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nc=0\r\ngl = [] \r\nfor i in l:\r\n if (i in gl) or (i>n):\r\n c+=1\r\n continue\r\n \r\n gl.append(i)\r\nprint(c)\r\n ", "def arrange(arr):\r\n change=0\r\n for i in range(len(arr)):\r\n if i+1!=arr[i] and i+1 in arr:\r\n a,b=i,arr.index(i+1)\r\n arr[a],arr[b]=arr[b],arr[a]\r\n if i+1!=arr[i]:\r\n change+=1\r\n print(change)\r\nlength=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort(reverse=True)\r\narrange(arr)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nz=0\r\nfor i in range(1,t+1):\r\n if(i not in l):\r\n #print(i)\r\n z=z+1\r\nprint(z)", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nm = set()\r\n\r\nfor i in a:\r\n if i <= n:\r\n m.add(i)\r\n\r\nprint(n - len(m))\r\n", "repetition = int(input())\r\ntest_case = list(map(int, input().split()))\r\nreplace_num = 0\r\nfor num in range(1, repetition + 1):\r\n if(num not in test_case):\r\n replace_num += 1\r\nprint(replace_num)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nres=0\r\nfor i in a:\r\n if i>n:\r\n res+=1\r\n else:\r\n b.append(i)\r\nprint(len(b)-len(set(b))+res)", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, a = int(input()), arr_inp()\r\ndis = list(set(a))\r\nans=n-len(dis)\r\nfor i in dis:\r\n if i > n or i < 1:\r\n ans += 1\r\nprint(ans)\r\n", "z,w,m=input,int,sorted\r\nn=w(z())\r\nl=list(set(map(int,input().split())))\r\nfor i in l:\r\n if i>n:\r\n l.remove(i)\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n\r\n \r\n", "n=int(input()) # no. of inputs\r\nm=list(map(int,input().split())) # storage the input in a list \r\nk = [] # empty which value after looping\r\nfor i in range(1,n+1): # range starts from 1 and goes till n+1 means k will store value till n no.\r\n\tk.append(i) # appending the i to k set\r\nprint(len(set(k)-set(m))) # printing the len after subtracting the k set with set m .", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=[ ]\r\nfor i in range (0,n):\r\n if(ar[i]<=n and ar[i] not in s):\r\n s.append(ar[i])\r\nprint(n-len(s))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint(n-len(set(range(1,n+1))&set(arr)))\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if i not in a:\r\n ans += 1\r\nprint(ans)\r\n", "from collections import *\r\nimport itertools\r\nimport collections\r\n\r\nN = int(input().strip())\r\nA = [int(x) for x in input().strip().split()]\r\nA.sort()\r\ncrt = collections.Counter(A)\r\nprint(sum(1 for k in range(1,N + 1) if crt[k]==0))\r\n", "n = int(input())\r\narr = list(set(list(map(int, input().split()))))\r\ncnt = 0\r\nfor i in arr:\r\n if i < 1 or i > n:\r\n cnt += 1\r\n else:\r\n continue\r\nprint(n-len(arr)+cnt)\r\n", "z=int(input());lst=set()\r\nfor i in input().split():\r\n if int(i)<=z:\r\n lst.add(i)\r\nprint(z-len(lst))\r\n", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ns=set(arr)\r\ncnt=0\r\nfor i in s:\r\n if i>n:\r\n cnt+=1\r\nprint(n-len(s)+cnt)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nx = list(set(arr))\r\nans = n-len(x)\r\nfor i in x:\r\n if i>n:\r\n ans+=1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = set(input()[:-1].split())\r\nc = n - len(w)\r\nw = map(int, w)\r\nfor i in w:\r\n if i > n:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nm={}\r\nfor i in a:\r\n if i in m:\r\n continue\r\n else:\r\n m[i]=1\r\nc=0\r\nfor i in range(1,1+n):\r\n if i in m:\r\n continue\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n+1):\r\n\tb.append(0)\r\nfor i in range(n):\r\n\tif a[i]>n:\r\n\t\tcontinue\r\n\telse:\r\n\t\tb[a[i]]+=1\r\ncount=0\r\nfor i in range(1,n+1):\r\n\tif b[i]==0:\r\n\t\tcount+=1\r\nprint(count)\r\n", "n=int(input())\r\ns=dict()\r\nc=0\r\na=[int (a) for a in input().split()]\r\nfor i in a:\r\n if i in s:\r\n s[i]+=1\r\n else:\r\n s[i]=1\r\nfor i in s:\r\n if i>n:\r\n c+=s[i]\r\n elif s[i]>1:\r\n c+=s[i]-1\r\nprint (c)\r\n", "n = int(input()) ;l = list(map(int,input().split())) ;d = [0] * 5001\r\nfor i in l : d[i] = 1\r\nprint(n-sum(d[:n+1]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nch=0\r\nfor i in range(n):\r\n try:\r\n a.remove(i+1)\r\n except:\r\n ch+=1\r\nprint(ch)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nss=[0]*(n+1)\r\ncnt=0\r\nfor i in a:\r\n if i<=n:\r\n if ss[i]:\r\n cnt+=1\r\n else:\r\n ss[i]=1\r\n else:\r\n cnt+=1\r\nprint(cnt)\r\n \r\n ", "up = int(input())\r\nnums = input().split()\r\nnums = list(map(int, nums))\r\nnums.sort()\r\nnum_count = len(nums)\r\nresult = 0\r\nlast = None\r\nfor i in nums:\r\n if i > up or i == last:\r\n result += 1\r\n else:\r\n last = i\r\nprint(result)\r\n", "# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\ndef main():\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n unique_arr = set(arr)\r\n temp = 0\r\n for indx, ele in enumerate(unique_arr):\r\n if ele > n:\r\n temp += 1\r\n\r\n # print(arr)\r\n # print(unique_arr)\r\n # print(temp)\r\n print(len(arr)-len(unique_arr)+temp)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nres=0\r\npre=[0]*(5002)\r\nfor i in l:\r\n pre[i]+=1\r\nfor i in range(1,n+1):\r\n if (pre[i]==0):\r\n res+=1\r\n\r\nprint(res)", "n=int(input())\na=[int(i) for i in input().split(' ')]\nb=[0]*(5005+1)\nfor i in a:\n b[i]+=1\nans=0\nfor i in range(1,n+1):\n if b[i]==0:ans+=1\nprint(ans)\n \t \t \t \t \t\t \t \t\t \t\t\t \t\t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nnums = {}\r\nans = 0\r\nfor i in range(n):\r\n if a[i] > n:\r\n ans += 1\r\n elif a[i] in nums:\r\n nums[a[i]] += 1\r\n else:\r\n nums[a[i]] = 1\r\n\r\nfor key in nums:\r\n ans += nums[key] - 1\r\n\r\nprint(ans)\r\n", "print(len({*range(1,int(input())+1)}-{*map(int,input().split())}))\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\narr = set(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(1, n+1):\r\n if i not in arr:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\nl=set(list(map(int,input().split())))\r\nc=0\r\nfor i in l:\r\n if i>n:\r\n c+=1\r\nprint((n+c)-len(l)) ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n if arr.count(i) > 0:\r\n count += 1\r\n\r\nprint(n - count)", "n = int(input())\r\nprint(n-len(set(x for x in input().split() if int(x) <= n)))\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nans = 0\r\noriginal = []\r\nfor i in arr:\r\n if i > n:\r\n ans += 1\r\n else:\r\n if i not in original:\r\n original.append(i)\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Permutation():\r\n n = inp()\r\n sequence = inlt()\r\n\r\n count_dict = {}\r\n\r\n for num in sequence:\r\n if num not in count_dict.keys():\r\n count_dict[num] = 0\r\n\r\n count_dict[num] += 1\r\n\r\n elements_to_be_replaced = 0\r\n\r\n for num in count_dict.keys():\r\n if num > n:\r\n elements_to_be_replaced += count_dict[num]\r\n else:\r\n if count_dict[num] >= 2:\r\n elements_to_be_replaced += (count_dict[num]-1)\r\n\r\n print(elements_to_be_replaced)\r\n return \r\n\r\nPermutation()", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\ns = set(map(int, stdin.readline().split()))\r\ncnt = 0\r\n\r\nfor i in range(1, n + 1):\r\n if i not in s:\r\n cnt += 1\r\n\r\nstdout.write(str(cnt))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nnl=[]\r\nfor i in l:\r\n if i not in nl:\r\n if i>=1 and i<=n:\r\n nl.append(i)\r\nprint(n-len(nl))", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\ncheck = [False] * n\r\nans = 0\r\nfor el in lst:\r\n if el > n:\r\n ans += 1\r\n else:\r\n if not check[el - 1]:\r\n check[el - 1] = True\r\n else:\r\n ans += 1\r\nprint(ans)", "def str_list_to_int(a):\r\n list_of_integers = list(map(int, a))\r\n return list_of_integers\r\n\r\ndef max_(ss,t):\r\n count = t - len(ss)\r\n for i in ss:\r\n if t < i:\r\n count+=1\r\n return count \r\n\r\nt = int(input())\r\na = input().split()\r\na = str_list_to_int(a)\r\nss = list(set(a))\r\ncount = max_(ss,t)\r\nprint(count)", "def main():\n\tcheck=set()\n\tcount=0\n\tn=int(input())\n\tarr= [int(i) for i in input().split()]\n\tfor i in arr:\n\t\tif (i in check) or i>n:\n\t\t\tcount+=1\n\t\telse:\n\t\t\tcheck.add(i)\n\tprint(count)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n+1):\r\n if i not in a:\r\n ans+=1\r\nprint(ans) ", "def binNumber(n,size):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n#code\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nc = [0]*(n+1)\r\nk = 0\r\nfor i in a:\r\n if i > n:\r\n k += 1\r\n else:\r\n c[i] += 1\r\nfor i in range(1,n+1):\r\n if c[i] > 0:\r\n k += (c[i]-1)\r\nprint(k)", "n=int(input())\r\ns=set(map(int,input().split()))\r\ncnt=0\r\nfor i in s:\r\n if i>n:\r\n cnt+=1\r\nprint(n-len(s)+cnt)", "n = int(input())\r\nok = [False]*n\r\ninp = input().split(' ')\r\ncount = n\r\nfor i in inp:\r\n i = int(i)-1\r\n if i < n and not ok[i]:\r\n count -= 1\r\n ok[i] = True\r\nprint(count)", "a=set(range(1,int(input())+1))\r\nb=set(map(int,input().split(' ')))\r\nprint(len(a-b))", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n+1):\r\n if i!=l[i-1]:\r\n c+=1 if i not in l else 0\r\nprint(c)", "n = int(input())\r\nactual = list(range(1, n + 1))\r\nother = list(map(int, input().split()))\r\n\r\nactual, other = set(actual), set(other)\r\nfinal = actual - other\r\nprint(len(final))\r\n", "'''\r\ncars = 100\r\nspace_in_a_car = 4.0\r\ndrivers = 30\r\npassengers = 90\r\ncars_not_driven = cars - drivers\r\ncars_driven = drivers\r\ncarpool_capacity = cars_driven * space_in_a_car\r\naverage_passengers_per_car = passengers / cars_driven\r\n\r\nprint(\"there are\" + \" \" ,cars , \"cars available\")\r\nprint(\"there are only\" + \" \" ,drivers, \"drivers only\")\r\nprint(\"there will be \" + \" \",cars_not_driven,\"empty cars today\")\r\nprint(\"We can transport\",carpool_capacity,\"people today\")\r\nprint(\"We have\" + \" \" ,passengers, \"to carpool today\")\r\nprint(\"We habe to put about\",average_passengers_per_car, \"in each other\")\r\n'''\r\n\r\ndict = {}\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if v[i] in dict or v[i] > n:\r\n ans += 1\r\n dict[v[i]] = True\r\nprint(ans)\r\n", "# your code goes here\r\n\r\ns = set()\r\nn = int(input())\r\narr = input().split()\r\nfor i in range(n):\r\n\tarr[i] = int(arr[i])\r\nctr = 0\r\nfor num in arr:\r\n\tif num > n:\r\n\t\tctr += 1\r\n\telse:\r\n\t\tif num in s:\r\n\t\t\tctr += 1\r\n\t\telse:\r\n\t\t\ts.add(num)\r\nprint(str(ctr))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nc=0\r\nfor i in l:\r\n if i>n:\r\n c+=1\r\n elif i in a:\r\n c+=1\r\n else:\r\n a.append(i)\r\nprint(c)", "n=int(input())\r\nx=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if i+1 not in x:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nz=[0]*n\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i<=n:\r\n z[i-1]=1\r\nc=0\r\nfor i in z:\r\n if i==0:\r\n c+=1\r\nprint(c)", "import collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\nD=collections.Counter(A)\r\nB=list(D.keys())\r\nC=[x for x in B if x>=1 and x<=n]\r\nC=list(set(C))\r\nprint(n-len(C))", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndone = []\r\ncount = 0\r\nfor i in arr:\r\n if i in done or i > n:\r\n count += 1\r\n else:\r\n done.append(i)\r\nprint(count)", "n=int(input())\nx = list(map(int, input().split()))\nf = [0] * 5001\nr=0\nfor i in range(len(x)):\n if x[i] > n:\n r+=1\n x[i] = 0\n f[x[i]] += 1\n\nfor i in range(1, 5001):\n if f[i] > 1:\n r += f[i]-1\n\nprint(r)\n\n", "k = int(input())\r\np = [int(x) for x in input().split()]\r\nl = [0 for x in range(0, len(p))]\r\nc = 0\r\nfor i in p:\r\n if i > k:\r\n c = c + 1\r\n else:\r\n l[i - 1] = l[i - 1] + 1\r\n if l[i-1] > 1:\r\n c = c + 1\r\n\r\n# p.sort()\r\n# c = 0\r\n# print(len(p))\r\n# for i in range(1, len(p)+1):\r\n# print(p[i-1], i)\r\n# if p[i-1] != i:\r\n# c = c + 1\r\nprint(c)\r\n\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\ndictt = {}\r\nfor i in x:\r\n dictt[i] = True\r\n\r\nfor i in range(n):\r\n if dictt.get(i+1, False) == False:\r\n count = count + 1\r\n \r\nprint(count)", "import sys\r\n\r\n_max = int(input())\r\nnums = map(int, input().split())\r\nprint(len(set(range(1, _max + 1)) - set(nums)))", "#from collections import deque,namedtuple\r\ndef main():\r\n n = int(input())\r\n s = set([int(i) for i in range(1,n+1)])\r\n for i in input().split():\r\n if int(i) in s:\r\n s.remove(int(i))\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\ns=[int(i) for i in input().split() if int(i)<=n]\nt=len(set(s))\nprint(n-t)\n \t\t\t \t\t\t \t\t\t \t\t \t\t\n\t\t \t \t\t\t \t \t\t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\ntruelist = list(range(1,n+1))\r\ns = set(l)\r\nans = n - len(s)\r\nfor i in s:\r\n if i not in truelist:\r\n ans+=1\r\nprint(ans)\r\n", "def str_list_to_int(a):\r\n list_of_integers = list(map(int, a))\r\n return list_of_integers\r\n\r\ndef max_(ss,a):\r\n count =0\r\n for i in ss:\r\n if len(a) < i:\r\n count+=1\r\n return count\r\n \r\nt = int(input())\r\na = input().split()\r\na = str_list_to_int(a)\r\nss = list(set(a))\r\ncount = max_(ss,a)\r\nif max(ss) == len(a):\r\n print(len(a)-len(ss))\r\nelse:\r\n print(len(a)-len(ss)+count)\r\n\r\n \r\n\r\n", "k = int(input())\r\nA = [i+1 for i in range(k)]\r\nB = list(map(int,input().split()))\r\nfor x in B:\r\n if(x in A):\r\n A.remove(x)\r\nprint(len(A))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmyset=set(arr)\r\nans=0\r\nfor i in range(1,n+1):\r\n if i not in myset:\r\n ans+=1\r\nprint(ans)", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nimport math\n #num = int(input())\n #arr = list(map(int, input().split()))\n #a,b = map(int, input().split())\n #graph = defaultdict(list)\n #graph[a].append(b)\n #graph[b].append(a)\n #MOD = 10**9 + 7\n\ndef solution():\n n = int(input()) \n arr = list(map(int, input().split()))\n\n numbers = set()\n for val in arr:\n if val <= n:\n numbers.add(val)\n\n print(n - len(numbers))\n\n\n\n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "t=int(input())\n# l=[]\n\nl=list(map(int,input().strip().split()))\n\ns=[]\nfor i in range(1,t+1):\n s.append(i)\nc=0\nfor i in s:\n if i not in l:\n c+=1\n\n\n\nprint(c)\n", "t = int(input())\r\nres = 0\r\narr = list(map(int,input().split()))\r\narr1 = set(arr)\r\nfor i in arr1:\r\n if i > t:\r\n res+=1\r\nprint((len(arr) - len(arr1)) + res)", "n=int(input())\r\narray=set(map(int,input().split()))\r\ncount=0\r\nfor i in array:\r\n\tif i<=n:\r\n\t\tcount+=1\r\nprint(n-count)\r\n", "\r\n\r\n\r\n\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\np=0\r\nfor j in range(1,n+1):\r\n if j not in t:\r\n p+=1\r\n\r\nprint(p)\r\n", "t=int(input())\r\na=[int(_) for _ in input().split()]\r\nk=0\r\nfor i in range(1,t+1):\r\n if i not in a:\r\n k+=1\r\nprint(k)", "# Receiving and adjusting inputs\nn = int(input())\narray = input()\narray = list(map(int, array.split(\" \")))\naux = []\n\nanswer = 0\n# solution\nfor i in range(1, n + 1):\n if array[i-1] in aux or array[i-1] > n: \n answer = answer + 1\n else:\n aux.append(array[i-1])\n# print answer\nprint(answer)", "length = int(input())\r\nfull_list = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nfor i in range(1, length + 1):\r\n if i not in full_list:\r\n counter += 1\r\n \r\nprint(counter)", "from collections import defaultdict\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nd=defaultdict(int)\r\n\r\nfor i in range(len(c)):\r\n\td[c[i]]+=1\r\n\t\r\nrng=list(range(1,n+1))\r\n\r\ntot=0\r\nfor i in range(1,n+1):\r\n\tif i not in d.keys():\r\n\t\ttot+=1\r\nprint(tot)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nc=0\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor i in range(1,n+1):\r\n if i in d:\r\n continue\r\n else:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nre = 0\r\nhas = [False] * (n + 1)\r\nfor i in a:\r\n if i <= n:\r\n if has[i]:\r\n re += 1\r\n else:\r\n has[i] = True\r\n else:\r\n re += 1\r\n\r\nprint(re)", "i = int(input())\r\nl = set(list(map(int,input().split())))\r\nx = 0\r\nfor num in range(1,i+1):\r\n if num not in l:\r\n x += 1\r\nprint(x)", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nf = [0] * 5000\r\nfor x in a :\r\n f[x] += 1\r\n\r\nans = 0\r\nfor i in range(5000) :\r\n if i < n and f[i] > 1 :\r\n ans += f[i] - 1\r\n elif i >= n :\r\n ans += f[i]\r\nprint(ans)\r\n", "#137B (82No. Problem B)\r\nn = int(input())\r\nper = list(set(map(int,input().split())))\r\nc = 0\r\ntemp = []\r\nfor i in range(n):\r\n temp.append(i+1)\r\n\r\nfor i in range(len(per)):\r\n if (per[i] in temp):\r\n c+=1\r\nprint(n-c) ", "n = int(input())\r\nstr = input()\r\nls = [int(u) for u in str.split()]\r\n#print(ls)\r\ncount = 0\r\nfor i in range(1, n+1):\r\n cond = False\r\n for u in ls:\r\n if i == u:\r\n cond = True\r\n break\r\n if cond == True:\r\n continue\r\n else:\r\n count += 1\r\nprint(count)", "from collections import defaultdict\r\ndd = defaultdict(int)\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nper = [x for x in range(1, n + 1)]\r\nfor x in arr:\r\n dd[x] += 1\r\n\r\nans = 0\r\n\r\nfor x in per:\r\n if dd[x] == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = map(int, input().split())\r\nc = Counter(a)\r\n\r\nr = n - sum([bool(c[i]) for i in range(1, n + 1)])\r\nprint(r)", "from collections import Counter\r\n\r\nn = int(input())\r\nnums = Counter(map(int, input().split()))\r\nresult = 0 \r\nfor num, count in nums.items():\r\n if num > n:\r\n result += count\r\n elif count > 1 :\r\n result += count - 1\r\n \r\nprint(result)", "n=int(input())\r\nprint(len({*range(1,n+1)}-{*map(int,input().split())}))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[i for i in range(1,n+1)]\r\nb=set(b)\r\na=set(a)\r\nprint(len(b-a))", "n = int(input())\narr = [int(x) for x in input().split()]\n\ngood = [False] * (n+1)\nfor i in arr:\n if i <= n and not good[i]:\n good[i] = True\n\nprint(n-good.count(True))", "n = int(input())\r\ns = set(x for x in list(map(int, input().split())) if 1 <= x <= n)\r\nprint(n - len(s))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0; d = {}\r\nfor i in a: d[i] = d.get(i,0) + 1\r\nfor i in d:\r\n if d[i] > 1 and i<=n :\r\n count += d[i] - 1\r\n elif i>n:\r\n count += d[i]\r\nprint(count)", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_nums(nums):\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\nn = read_int()\r\nnums = [_ for _ in read_ints() if _ <= n]\r\nprint(n - len(set(nums)))", "N = int(input())\r\n\r\nM = list(map(int, input().split()))\r\n\r\nused = set()\r\nans = 0\r\nfor m in M:\r\n if m not in used and m >= 1 and m <= N:\r\n used.add(m)\r\n else:\r\n ans += 1\r\nprint(ans) ", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nc = Counter(nums)\r\nc2 = Counter(list(range(1,n+1)))\r\n\r\ntot = 0\r\nc3 = c-c2\r\nfor i in c3:\r\n tot += c3[i]\r\nprint(tot)", "for _ in range(1):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=[i for i in range(1,n+1)]\r\n cnt=0;\r\n for i in s:\r\n if i not in a:\r\n cnt=cnt+1\r\n print(cnt)", "x=int(input());l1=list(map(int,input().split()));l=[]\r\nfor i in l1:\r\n\tif i<=x and i not in l: l.append(i)\r\nprint(x-len(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=0\r\nfor i in range(1,n+1):\r\n if i in l:\r\n r+=1\r\nprint(n-r)", "def get_ans():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(1,n+1):\r\n if i not in l:\r\n #print(i)\r\n ans+=1\r\n return ans\r\nans = get_ans()\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\ntot = 0\r\nif max(s) <= n:\r\n print(n - len(s))\r\nelse:\r\n more = list(filter(lambda x: x > n, l))\r\n less = set(filter(lambda x: x<=n , l))\r\n print(((n - len(more)) - len(less)) + len(more))", "h=int(input())\r\nn=list(map(int,input().split()))\r\nc=0;v=[]\r\nfor i in range(h):\r\n if n[i]>h:\r\n c=c+1\r\n if n[i]<h+1:\r\n v.append(n[i])\r\n\r\na=set(v)\r\nb=len(v)-len(a)\r\nprint(b+c)\r\n\r\n \r\n", "from collections import Counter\r\ndef solve():\r\n n=int(input());a=Counter(list(map(int,input().split())))\r\n c=0\r\n for i in a:\r\n if i<=n:c+=1\r\n print(n-c)\r\nsolve()", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=set(a);cn=0\r\nfor i in c:\r\n if i >n:cn+=1\r\nprint(n-len(c)+cn)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nm.sort()\r\nco=0\r\nfor t in range(n):\r\n t+=1\r\n if t in m:\r\n pass\r\n else:\r\n co+=1\r\nprint(co)\r\n", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nchange = 0\r\n\r\nnum_set = set(num)\r\n\r\nfor i in range(1,n+1):\r\n if i not in num_set:\r\n change += 1\r\n\r\nprint(change)\r\n\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nv=1\r\ns=0\r\nk=0\r\nwhile s<n:\r\n if v in ar:\r\n k+=1\r\n v+=1\r\n s+=1\r\nprint(n-k)", "I=input\r\nn=int(I())\r\nprint(n-len([i for i in set(list(map(int,I().split()))) if i<=n]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nfrom collections import Counter as cnt\r\nc,ans=cnt(a),0\r\nfor i in range(1,n+1):\r\n if c.get(i)==None:\r\n ans+=1\r\nprint(ans)", "n= int(input())\r\ns= [int(x) for x in input().split()]\r\nc=0\r\nfor i in set(s):\r\n if i<=n:c+=1\r\nprint(n-c)", "n = int(input())\r\ns = set(map(int,input().split()))\r\ncnt = 0\r\nfor i in s:\r\n if i <= n:\r\n cnt+=1\r\nprint(n-cnt)\r\n ", "no=list()\r\nn=int(input())\r\nu=set()\r\nno=map(int,input().split(\" \"))\r\nfor i in no:\r\n if(i<=n):\r\n u.add(i)\r\nprint(n-len(u))\r\n ", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ns1=set(s)\r\nt=0\r\nq=0\r\nfor i in s1:\r\n if i<=n:\r\n t+=1\r\n else:\r\n q+=1\r\nm=max(s1)\r\nif q==n:\r\n print(n)\r\nelif m>n and q<n:\r\n print(n-len(s1)+q)\r\nelse: \r\n print(n-len(s1))", "n = int(input())\r\na = set(list(map(int, input().split())))\r\nc = 0 \r\nfor i in a:\r\n if(i <= n):\r\n c += 1 \r\nprint(n - c)", "n = int(input())\r\nfl = input()\r\nvalues = fl.split(\" \")\r\nref = []\r\nsum = 0\r\n\r\nfor number in values:\r\n if int(number) in ref or int(number) > n:\r\n sum += 1\r\n else:\r\n ref.append(int(number))\r\nprint(sum)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA = set(A)\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i not in A:\r\n ans += 1\r\nprint(ans)\r\n", "from functools import lru_cache, wraps\nfrom sys import stderr, stdin\n\nimport time\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\n\n\n# Decorators\ndef print_to_file(function, file=stderr):\n def wrapped(*args, **kwargs):\n res = function(*args, **kwargs)\n print(res, file=file)\n return res\n\n return wrapped\n\n\ndef time_it(function, output=stderr):\n def wrapped(*args, **kwargs):\n start = time.time()\n res = function(*args, **kwargs)\n elapsed_time = time.time() - start\n print('Function \"%s\" took %f ms' % (function.__name__, elapsed_time * 1000),\n file=output)\n return res\n\n return wrapped\n\n\n@time_it\ndef main():\n n = int(input())\n nums = map(int, input().split())\n print(n - len(set(num for num in nums if num <= n)))\n\n\n# Auxiliary functions\n@print_to_file\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\n# IO reassignment\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n l_print = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return l_print(*args, **kwargs)\n\n\nif __name__ == '__main__':\n # set_input(open(\"sum.in\", \"r\"))\n # set_output(open(\"sum.out\", \"w\"))\n main()\n", "\r\nfrom collections import deque\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd = deque()\r\n\r\nfor i in range(1 , n + 1 ):\r\n d.append(i)\r\n\r\nflag = True\r\ncnt = 0\r\nfor i in d :\r\n if l.count(i) < 1 :\r\n flag = False\r\n cnt +=1\r\n\r\n\r\nif flag == True:\r\n print(0)\r\n\r\nelse:\r\n print(cnt)\r\n\r\n\r\n\r\n", "n=int(input())\r\nc=0\r\ns=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if(i not in s):\r\n c+=1\r\nprint(c) ", "from collections import Counter\na=int(input())\nb=list(map(int,input().split()))\n\nz=0\nbb=Counter(b)\nss=0\ng=[]\nv=[]\ne=True\nfor k in range (1,a+1):\n g.append(k)\n\nq=sorted(bb)\n\nfor num in q:\n if num >=a+1:\n ss+=1\n e=False\n else:\n \n v.append(num)\nif e==False:\n print(abs(len(v)-a))\nelse:\n vv=len(v)\n print(abs(vv-a))\n \t \t\t \t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nprint(n - len(set([i for i in data if i <= n])))", "n = int(input())\nl = list(map(int, input().split()))\nl.sort()\ncount = 0\nfor i in range(1, n + 1):\n if i not in l:\n count += 1\nprint(count)", "n=int(input());c=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if i not in a:\r\n c+=1\r\nprint(c)", "n = int(input())\nvalues = set(map(int, input().split()))\nprint(len(set(range(1, n+1)).difference(values)))\n", "n, res, cnt, a = int(input()), 0, [True] * 5001, list(map(int, input().split()))\r\nfor x in a: cnt[x] = False\r\nfor x in range(1, n + 1):\r\n if cnt[x]: res += 1\r\nprint(res)", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nd = {}\nfor i in a:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\nans = 0\nfor i in range(1, n + 1):\n if i not in d:\n ans += 1\nprint(ans)\n", "import sys\r\nlength=int(input())\r\nvalues=list(map(int,input().split()))\r\ncounter=0\r\nbeginning=1\r\nfor a in values:\r\n if beginning in values:\r\n counter+=1\r\n \r\n beginning+=1\r\n \r\nprint(length-counter)", "a=int(input())\r\nb=list(sorted(map(int,input().split())))\r\nc=0\r\nfor i in range(a+1):\r\n if b.count(i)>1:\r\n c+=b.count(i)-1\r\nfor i in range(a):\r\n if b[i]>a:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nc = {x for x in range(1, n + 1)}\r\nprint(n - len(set(b)) + len(set(b) - set(c)))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n s = set(map(int, input().split()))\r\n p = set(range(1, n+1))\r\n print(n - len(s.intersection(p)))\r\n", "n=int(input())\r\ns = list(map(int,input().rsplit()))\r\ns.sort()\r\ni=1\r\na=0\r\nb=0\r\nfor j in range (n):\r\n if s[j]<=n and s[j]!=a:\r\n b=b+1\r\n a=s[j]\r\nprint(n-b)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = [x for x in a if x in range(1, n + 1)]\r\nprint(n - len(set(a)))", "n=int(input())\r\nl=list(map(int, input().split()))\r\nct=0\r\nj=0\r\nfor i in range(n):\r\n j=j+1\r\n if(j in l):\r\n continue\r\n else:\r\n ct=ct+1\r\nprint(ct)", "n = int(input())\nx = set(map(int, input().split()))\ninc = 0\nfor item in range(1, n + 1):\n if item in x:\n inc += 1\nprint(n - inc)\n", "sequence_length = int(input())\r\ndifferent = set([x for x in map(int, input().split()) if x <= sequence_length])\r\nprint(sequence_length - len(different))\r\n", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nd,s={},0\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor x,y in d.items():\r\n if(x>n):\r\n s+=y\r\n if(x<=n and y>1):\r\n s+=y-1\r\nprint(s)\r\n", "def check_for_cycle(s):\r\n for i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n return 0\r\n return 1\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set()\r\n for i in range(n):\r\n if 1<= a[i] <= n:\r\n s.add(a[i])\r\n return n - len(s)\r\nif __name__ == \"__main__\":\r\n print(main())", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=set(ar)\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=i not in s\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = [1]*n\r\n \r\nfor i in a:\r\n if i-1 < n:\r\n s[i-1] = 0\r\nprint(sum(s))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\ncnt=0\r\nfor i in l[::-1]:\r\n if i>n: l.pop(); cnt+=1\r\n else: break\r\nprint(cnt-len(set(l))+len(l))", "n=int(input())\r\nc=list(map(int,input().split()))\r\ncache=[0 for x in range(5001)]\r\nfor x in c:\r\n cache[x]=1\r\nprint(cache[1:n+1].count(0))", "#137B (82No. Problem B)\r\nn = int(input())\r\nper = list(set(map(int,input().split())))\r\nc = 0\r\ntemp = []\r\nfor i in range(1,n+1):\r\n if i not in per:\r\n c+=1\r\nprint(c) ", "n = int(input())\ndict = {}\narr = [int(ch) for ch in input().split()]\nfor i in range(n):\n dict[arr[i]] = 1\nans = 0\nfor i in range(1,n+1):\n if i not in dict.keys():\n ans+=1\nprint(ans)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if (i + 1) not in x:\r\n count = count + 1\r\n \r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(sum([(i not in a) for i in range(1,n+1)]))", "# permutation\nimport sys\n\n# lendo entrada\nnum_seq = int(sys.stdin.readline())\n\n# resolvendo\nlista = []\n\nfor i in range(0, num_seq):\n lista.append(False)\n\n# Checando entrada\nline = sys.stdin.readline()\n\nfor i in line.split():\n num = int(i)\n\n if num - 1 < len(lista):\n lista[num - 1] = True\n\nnum_changes = 0\n\nfor i in lista:\n if not i:\n num_changes += 1\n\nprint(num_changes)\n\n\n\n# 1489163032751\n", "\n# brute force approach\n\n# def permutation(li):\n# \tli.sort()\n# \tcount = 0\n# \ti=0\n# \twhile i < (len(li)-1):\n# \t\tif li[i+1] != li[i]+1:\n# \t\t\tli[i] = i+1\n# \t\t\tli[i+1] = li[i]+1\n# \t\t\tcount+=1\n# \t\t\t# print(count,end = \"\")\n# \t\tif i==len(li)-2:\n# \t\t\tif li[i+1]<li[i]+1:\n# \t\t\t\tcount+=1\n# \t\ti+=1\n# \t\t# print(li)\n# \t# print(li)\n# \t# print(i)\n\n# \tprint(count)\n\n\n\n# solution\ndef permutations(n,li):\n\tcount=0\n\tfor i in range(1,n+1):\n\t\tif i in li :\n\t\t\tcount+=1\n\treturn n-count\n\nn = int(input())\nli = [int(x) for x in input().split()]\nprint(permutations(n,li))", "# Problem Link: https://codeforces.com/problemset/problem/137/B\r\n# Problem Status:\r\n# ----------------------------- Separator -----------------------------\r\ndef TheAmazingFunction(S: list):\r\n table = dict()\r\n Ans = 0\r\n for i in S:\r\n table.update({i: 1})\r\n for i in range(1, len(S)+1):\r\n if table.get(i) is None:\r\n Ans += 1\r\n return Ans\r\n\r\n\r\n# ----------------------------- Separator -----------------------------\r\nlength = int(input())\r\nS_ = list(map(int, input().split()))\r\nprint(TheAmazingFunction(S_))\r\n# ----------------------------- Separator -----------------------------\r\n", "n = int(input())\r\na = set(map(int,input().split()))\r\nc=n-len(a)\r\nfor i in a:\r\n if(i>n):\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = [i for i in range(1,n+1)]\r\nchange = [i for i in k if i not in a]\r\nprint(len(change))", "n =int(input())\r\nnum = list(map(int,input().split(' ')))\r\nreplace=0\r\nfor i in range(n):\r\n if i+1 not in num:\r\n replace +=1\r\nprint(replace)", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\nfrom collections import Counter\r\n\r\nn = I()\r\narr = L()\r\nC = Counter(arr)\r\ncnt = 0\r\nfor e in C:\r\n if e>n:\r\n cnt+=C[e]\r\n else:\r\n cnt+= C[e]-1\r\n\r\nprint(cnt)", "el = int(input())\r\nar = set()\r\nfor i in input().split(' '):\r\n if int(i)>el:\r\n continue\r\n ar.add(i)\r\nprint(el - len(ar))\r\n", "\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\na = set(a)\r\n#print(set(a))\r\ntemp = [i for i in range(1,n+1)]\r\n\r\ncnt = 0\r\n\r\nfor i in temp :\r\n \r\n if i not in a :\r\n \r\n cnt = cnt + 1 \r\n \r\nprint(cnt)\r\n \r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = set()\r\nfor i in a:\r\n if i <= n:\r\n s.add(i)\r\n\r\nprint(n - len(s))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=set(a)\r\nl=len(x)\r\nfor i in x:\r\n if i>n:\r\n l-=1\r\nprint(len(a)-l)", "n = int(input())\narr = [int(num) for num in input().split()]\ncounts_dict = {}\nfor num in arr:\n\tcounts_dict[num] = counts_dict.get(num, 0) + 1\nans = 0\nfor i in range(1, n+1):\n\tif(counts_dict.get(i, 0) == 0):\n\t\tans += 1\nprint(ans)", "n = int(input())\narr = sorted(map(int, input().strip().split()))\nmissing = 0\nfor i in range(1, n + 1):\n if i not in arr:\n missing += 1\nprint(missing)\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nprint(len({*range(1,int(input())+1)}-{*map(int,input().split())}))\r\n", "s = int(input())\r\narr=list(map(int,input().split()))\r\ncount = 0\r\nd=set()\r\n\r\nfor i in range(s):\r\n if (arr[i] <=s) and (arr[i] not in d):\r\n d.add(arr[i])\r\n count=count+1\r\nprint(s-count) \r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in arr:\r\n c=c+1\r\nprint(c)\r\n \r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n) :\r\n if li[i]>=1 and li[i]<=n :\r\n d[li[i]] = d.get(li[i],0)+1\r\nprint(n-len(d))\r\n ", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n if i+1 in a:\r\n count=count+1\r\n\r\nprint(n-count)", "n = set(range(1, int(input())+1))\r\na = set(map(int, input().split()))\r\n\r\nprint(len(n-a))\r\n", "#1080\r\n#4digit\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ncount=0\r\narr=set(arr)\r\nfor i in range(1,n+1):\r\n if i in arr:\r\n continue\r\n else:\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nnums = [i for i in range(1, n + 1)]\r\nfor i in a:\r\n if (i in nums):\r\n n -= 1\r\n nums.remove(i)\r\nprint (n)", "n = int(input())\nx = list(map(int, input().split()))\nans = 0\nfor i in range(1, n + 1):\n if i not in x:\n ans += 1\nprint(ans)\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nj=0\r\nfor i in s:\r\n if i>=1 and i <=n:\r\n j+=1\r\n \r\n\r\nprint(n-j)\r\n", "def binary_search_recursive(array, element, start, end):\r\n if start > end:\r\n return -1\r\n mid = (start + end) // 2\r\n if element == array[mid]:\r\n return mid\r\n if element < array[mid]:\r\n return binary_search_recursive(array, element, start, mid-1)\r\n else:\r\n return binary_search_recursive(array, element, mid+1, end)\r\n\r\n\r\nlength = int(input())\r\nseq = sorted([int(i) for i in input().split()])\r\ncount = 0\r\nfor i in range(1, length + 1):\r\n if binary_search_recursive(seq, i, 0, length - 1) == -1:\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[(i+1) for i in range(n)]\r\ns=0\r\nfor x in k:\r\n\tif x in l:\r\n\t\ts+=1\r\nprint(n-s)", "x = int(input())\r\ny = list(map(int,input().split()))\r\nprint(x- len(set(range(1,x+1))&set(y)))", "n = int(input())\r\narr = input().split(' ')\r\narr = list(map(int,arr))\r\ncount = 0\r\nfor i in range(1,n+1):\r\n\tif(i not in arr):\r\n\t\tcount = count+1\r\nprint(count)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ns = set(lst) \r\ns1 = {x+1 for x in range(n)}\r\nprint(len(s1.difference(s)))", "n = int(input())\r\n\r\nallowed = range(1, n+1)\r\nalready_used = []\r\ncount = 0\r\nfor x in input().split():\r\n x = int(x)\r\n if x not in allowed or x in already_used:\r\n count += 1\r\n else:\r\n already_used.append(x)\r\n\r\nprint(count)", "i = int(input())\r\nl = list(map(int, input().split()))\r\ng = 0\r\nfor x in range(1, i + 1):\r\n if l.count(x) <1:\r\n g += 1\r\nprint(g)\r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl2=[]\r\nc=0\r\nfor i in l1:\r\n if i not in l2 and i<=n:\r\n l2.append(i)\r\n elif i in l2 and i<=n:\r\n c+=1\r\n elif i>n:\r\n c+=1\r\nprint(c)\r\n ", "n = int(input())\n\na = list(map(int, input().split()))\n\ndi = dict()\n\nfor i in a:\n di[i] = di.get(i, 0) + 1\n\nans = 0\n\nfor i in range(1, n+1):\n if not di.get(i, 0):\n ans += 1\n\nprint(ans)", "casos = int(input())\nlista= []\ntmp = input().split()\nfor i in tmp:\n if (i not in lista) and (int(i)<=casos):\n lista.append(i)\nprint((casos-len(lista))) \n \n \n \n \t \t \t \t \t\t\t \t\t\t \t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n+1):\r\n if a.count(i)<1:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n", "n=input()\r\na=input()\r\nx=a.split()\r\nx.sort()\r\nk=0\r\nfor i in range(int(n)):\r\n if str(i+1) not in x:\r\n k+=1\r\nprint(k)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nlt=[i for i in l if i<=n and i!=0]\r\nli=list(set(lt))\r\nif len(li)==n:\r\n print(\"0\")\r\nelse:\r\n print(n-len(li))\r\n", "n=int(input())\r\nc=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n if i not in a:c+=1\r\nprint(c) \r\n#137B", "n, seq = int(input()), list(map(int, input().split()))\r\nprint(len(set(list(range(1, n + 1))) - set(seq)))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount1 = 0\r\nfor i in range(1,n+1):\r\n\tif i not in l:\r\n\t\tcount1 += 1\r\nprint(count1)\t\t", "# 序列从1-n,需替换多少次\r\nnum = int(input())\r\nlist_int = list(map(int, input().split()))\r\nprint(len(set(range(1,num+1))-set(list_int)))\r\n \r\n", "n = int(input())\narr = list(map(int, input().split()))\nper = [x for x in range(1, n + 1)]\ncount = 0\nfor i in range(n):\n for k in arr:\n if k == per[i]:\n count += 1\n break\n\nprint(n - count)\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n counts = dict()\r\n for i in arr:\r\n if i in counts:\r\n counts[i] += 1\r\n else:\r\n counts[i] = 1\r\n\r\n ans = 0\r\n num = 1\r\n for i in range(n):\r\n if num not in counts:\r\n ans += 1\r\n num += 1\r\n\r\n print(ans)\r\nmain()", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\ns=0\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n s+=1\r\nprint(s)", "def permutate(n, lst):\r\n s = range(1, n + 1)\r\n return len(set(s) - set(lst))\r\n\r\n\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(permutate(m, a))\r\n", "n=int(input())\narr=list(map(int,input().split()))\nm={}\nans=0\nfor i in range(1,n+1):\n m[i]=0\nfor i in arr:\n if i>n:\n ans+=1\n else:\n if m[i]==1:\n ans+=1\n elif m[i]==0:\n m[i]=1\nprint(ans)\n# n=int(input())\n# arr=list(map(int,input().split()))\n# m={}\n# for i in range(n):\n# m[i]=0\n# ans=0\n# for i in arr:\n# if i in m and m[i]==1:\n# ans+=1\n# elif i in m and m[i]==0:\n# m[i]=1\n# else:\n# ans+=1\n# print(ans)\n# # n=int(input())\n# # arr=list(map(int,input().split()))\n# # m=[]\n# # ans=0\n# # for i in arr:\n# # if i in m:\n# # ans+=1\n# # else:\n# # m.append(i)\n# # print(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=[]\r\nfor i in range(n):\r\n if(l[i] not in d and l[i]<=n):\r\n d.append(l[i])\r\n c=c+1\r\nprint(n-c)\r\n", "import math\r\ndef is_prime(n):\r\n if n==1:\r\n return False\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\ndef inp():\r\n ls=list(map(int,input().split()))\r\n return ls\r\nt=int(input())\r\nls=inp()\r\nres=0\r\nans=list(set(ls))\r\nfor i in ans:\r\n if i<=t:\r\n res+=1\r\nprint(t-res)\r\n\r\n", "n=int(input())\r\nar=input().split()\r\nar=[int(i) for i in ar]\r\nt=set(ar)\r\nu=set([i for i in range(1,n+1)])\r\nif ar==[ar[0]]*n and ar[0]>n:\r\n print(n)\r\nelse:\r\n print(len(u.difference(t)))\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na=Counter(a)\r\nq=sorted(a)\r\ns=0\r\nfor i in range(1,n+1):\r\n if i not in q:\r\n s=s+1\r\nprint(s)\r\n", "#137B\r\n\r\nif __name__ == \"__main__\":\r\n nums = list()\r\n n = int(input())\r\n unique_nums = set()\r\n nums = map(int,input().split(\" \"))\r\n\r\n for k in nums:\r\n if(k<=n):\r\n unique_nums.add(k)\r\n\r\n print (n-unique_nums.__len__())\r\n", "n = int(input())\na = list(map(int, input().split(' ')))\n\nverified_number = []\n\nfor number in a:\n if number <= n:\n verified_number.append(number)\n\nconvert_to_set = set(verified_number)\n\nprint(n - len(convert_to_set))", "n = int(input())\nls = [int(i) for i in input().split()]\nset_ = set(ls)\ndict_ = dict(zip([i+1 for i in range(n)], [0]*n))\n\nfor i in ls:\n try:\n dict_[i] += 1\n except:\n pass\n\nsum_=0\nfor k, v in dict_.items():\n if(v == 0):\n sum_ +=1\n \nprint(sum_)\n\t \t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t \t \t\t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nnums = set(arr)\r\nideal = set([i for i in range(1, n+1)])\r\ncount = len(ideal-nums)\r\nprint(count)", "def main():\r\n n = int(input())\r\n seq = [int(c) for c in input().split()]\r\n\r\n perm = set(range(1, n + 1))\r\n\r\n ans = 0\r\n for e in seq:\r\n if e in perm:\r\n perm.discard(e)\r\n else:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N = int(input())\r\nA = list(int(i) for i in input().split())\r\nS = set()\r\nfor k in A:\r\n\tif(1<=k and k<=N):\r\n\t\tS.add(k)\r\n\t\t\r\nprint(N-len(S))", "from collections import Counter\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = Counter(arr)\r\ncount = 0\r\nfor i in range(1, n+1):\r\n if i not in c:\r\n count += 1\r\n\r\nprint(count)", "from collections import Counter\n\n\nn = int(input())\ns = [int(i) for i in input().split()]\n\nc = Counter(s)\nans = 0\nfor k, v in c.items():\n if k <= n:\n ans += v - 1\n else:\n ans += v\nprint(ans)\n", "def main():\n n = int(input())\n i, res = 1, 0\n for a in sorted(map(int, input().split())):\n if i <= a <= n:\n i = a + 1\n else:\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()", "p=0\nn=int(input())\na = input().split(\" \") \na = [int(i) for i in a]\nfor i in range(1, n+1):\n if i not in a:\n p+=1\nprint(p)\n\t\t\t \t\t \t\t\t\t\t\t\t\t \t \t \t \t\t \t\t", "t=n=int(input())\r\na=[0]*(n)\r\nfor i in map(int,input().split()):\r\n if i<=n and a[i-1]:\r\n continue\r\n elif i<=n and not a[i-1]:\r\n a[i-1]=1\r\n t-=1\r\n else:continue\r\nprint(t)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = set(sorted(a))\r\nb = [x for x in range(1, n+1)]\r\nans = 0\r\nfor i in range(n):\r\n if b[i] not in a:\r\n ans += 1\r\nprint(ans)\r\n ", "n = int(input())\r\nl = list(map(int, input().split())) \r\ncounter = 0\r\nfor i in range( 1 , n+1) :\r\n if i not in l : \r\n counter += 1\r\nprint(counter)", "from collections import Counter\nn = int(input())\ncnt = Counter([int(x) for x in input().split()])\nans = 0\nfor a, b in cnt.items():\n\tif a <= 0 or a > n:\n\t\tans += b\n\telse:\n\t\tans += b - 1\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nall = set()\r\nfor num in a:\r\n if 1 <= num <= n:\r\n all.add(num)\r\nprint(n - len(all))", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=set()\r\nfor i in l:\r\n if(i<=n):\r\n p.add(i)\r\nprint(n-len(p))", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nns = [ 1 ] * (n)\r\nfor k in nums:\r\n if k - 1 < n:\r\n ns[k - 1] = 0\r\nprint(sum(ns))", "# 5\n# 4 5 5 5 5\n\nn = int(input())\na = set(map(int, input().split()))\n\ncounter = 0\nfor i in range(n):\n if i + 1 not in a:\n counter += 1\n\nprint(counter)\n", "n = int(input())\n\nseq = [int(i) for i in input().split()]\n\nl_n = [i for i in seq if i <= n]\nans = n - len(set(l_n))\n\nprint(ans)\n", "up = int(input())\nnums = input().split()\nnums = list(map(int, nums))\nnums.sort()\nnum_count = len(nums)\nresult = 0\nlast = None\nfor i in nums:\n if i > up or i == last:\n result += 1\n else:\n last = i\nprint(result)\n\n \t\t \t \t \t \t\t\t \t\t\t\t \t \t\t\t", "print(len(set(range(1, 1+int(input()))) - set(map(int,input().split()))))", "n = int(input())\r\np = set()\r\n\r\n\r\nfor i in range(1,n+1):\r\n p.add(i)\r\n \r\nh = set([int(x) for x in (input().split())])\r\n\r\nprint(len(p-h))", "n=int(input())\r\na=list(map(int,input().split()))\r\nar=[]\r\nans=0\r\nfor i in range(1,n+1):\r\n ar.append(i)\r\nfor j in ar:\r\n if j not in a:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append(i+1)\r\nfor i in a:\r\n if i in b:\r\n b.remove(i)\r\nprint(len(b))", "n=int(input())\narray=set(map(int,input().split()))\ncount=0\nfor i in array:\n\tif i<=n:\n\t\tcount+=1\nprint(n-count)\n", "n=int(input())\r\n\r\nl1=list(map(int, input().split()))\r\n\r\nl2=[0 for i in range(0,n)]\r\ncount=0\r\n\r\nfor i in l1:\r\n if i<=n:\r\n l2[i-1]=1\r\n\r\nfor i in l2:\r\n if i!=1:\r\n count+=1\r\n\r\nprint (count)", "n=int(input())\r\np=[int(x) for x in input().split()]\r\ns=0\r\np=set(p)\r\nfor i in p:\r\n if 1<=i<=n:\r\n s+=1\r\nprint(n-s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = [int(x) for x in input().split() if int(x) <= n]\r\n\r\nprint(n - len(set(arr)))", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nlst=[]\r\nlst1=[]\r\nfor i in range(1,n+1):\r\n lst.append(i)\r\nfor j in n1:\r\n if(j in lst and j not in lst1):\r\n lst1.append(j)\r\nprint(len(n1)-len(lst1))\r\n \r\n", "n = int(input())\narr = set(map(int, input().split()))\ncount = 0\nfor v in arr:\n if 1 <= v <= n:\n count += 1\nprint(n - count)\n", "n=int(input());c=0;t=[]\r\nfor i in input().split():\r\n i=int(i)\r\n if i in range(1,n+1):\r\n if i in t : c+=1\r\n else : t.append(i)\r\n else :c+=1\r\nprint(c)", "def main():\r\n n = int(input())\r\n seq = [int(c) for c in input().split()]\r\n \r\n perm = [True] * n\r\n \r\n ans = 0\r\n for e in seq:\r\n e -= 1\r\n if e < n and perm[e]:\r\n perm[e] = False\r\n else:\r\n ans += 1\r\n \r\n print(ans)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "\nn = int(input())\ntab = list(map(int, input().split()))\n\nperm = set(range(1, n + 1))\nfor i in tab:\n if i in perm:\n perm.remove(i)\nprint(len(perm))\n", "#!/usr/bin/env python3\nfrom sys import exit\n\nn = int(input())\nt = (int(x) for x in input().split())\n\ns = set()\nres = 0\nfor x in t:\n if x > n or x in s: res += 1\n s.add(x)\nprint(res)\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ns = 0\r\nfor i in range(1,n+1):\r\n if i not in arr:\r\n s +=1\r\nprint(s)" ]

{"inputs": ["3\n3 1 2", "2\n2 2", "5\n5 3 3 3 1", "5\n6 6 6 6 6", "10\n1 1 2 2 8 8 7 7 9 9", "8\n9 8 7 6 5 4 3 2", "15\n1 2 3 4 5 5 4 3 2 1 1 2 3 4 5", "1\n1", "1\n5000", "4\n5000 5000 5000 5000", "5\n3366 3461 4 5 4370", "10\n8 2 10 3 4 6 1 7 9 5", "10\n551 3192 3213 2846 3068 1224 3447 1 10 9", "15\n4 1459 12 4281 3241 2748 10 3590 14 845 3518 1721 2 2880 1974", "15\n15 1 8 2 13 11 12 7 3 14 6 10 9 4 5", "15\n2436 2354 4259 1210 2037 2665 700 3578 2880 973 1317 1024 24 3621 4142", "30\n28 1 3449 9 3242 4735 26 3472 15 21 2698 7 4073 3190 10 3 29 1301 4526 22 345 3876 19 12 4562 2535 2 630 18 27", "100\n50 39 95 30 66 78 2169 4326 81 31 74 34 80 40 19 48 97 63 82 6 88 16 21 57 92 77 10 1213 17 93 32 91 38 4375 29 75 44 22 4 45 14 2395 3254 59 3379 2 85 96 8 83 27 94 1512 2960 100 9 73 79 7 25 55 69 90 99 51 87 98 62 18 35 43 4376 4668 28 72 56 4070 61 65 36 54 4106 11 24 15 86 70 71 4087 23 13 76 20 4694 26 4962 4726 37 14 64", "100\n340 14 3275 2283 2673 1107 817 2243 1226 32 2382 3638 4652 418 68 4962 387 764 4647 159 1846 225 2760 4904 3150 403 3 2439 91 4428 92 4705 75 348 1566 1465 69 6 49 4 62 4643 564 1090 3447 1871 2255 139 24 99 2669 969 86 61 4550 158 4537 3993 1589 872 2907 1888 401 80 1825 1483 63 1 2264 4068 4113 2548 41 885 4806 36 67 167 4447 34 1248 2593 82 202 81 1783 1284 4973 16 43 95 7 865 2091 3008 1793 20 947 4912 3604", "1\n2", "2\n5000 5000", "2\n1 2", "2\n1 1", "2\n2 3", "2\n3 4", "10\n1 2 3 4 5 6 7 1000 10 10"], "outputs": ["0", "1", "2", "5", "5", "1", "10", "0", "1", "4", "3", "0", "7", "10", "0", "15", "14", "18", "70", "1", "2", "0", "1", "1", "2", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

245

d0040d13ef457ac6407a514ec877584c

Arpa's loud Owf and Mehrdad's evil plan

As you have noticed, there are lovely girls in Arpa’s land. People in Arpa's land are numbered from 1 to *n*. Everyone has exactly one crush, *i*-th person's crush is person with the number *crush**i*. Someday Arpa shouted Owf loudly from the top of the palace and a funny game started in Arpa's land. The rules are as follows. The game consists of rounds. Assume person *x* wants to start a round, he calls *crush**x* and says: "Oww...wwf" (the letter w is repeated *t* times) and cuts off the phone immediately. If *t*<=><=1 then *crush**x* calls *crush**crush**x* and says: "Oww...wwf" (the letter w is repeated *t*<=-<=1 times) and cuts off the phone immediately. The round continues until some person receives an "Owf" (*t*<==<=1). This person is called the Joon-Joon of the round. There can't be two rounds at the same time. Mehrdad has an evil plan to make the game more funny, he wants to find smallest *t* (*t*<=≥<=1) such that for each person *x*, if *x* starts some round and *y* becomes the Joon-Joon of the round, then by starting from *y*, *x* would become the Joon-Joon of the round. Find such *t* for Mehrdad if it's possible. Some strange fact in Arpa's land is that someone can be himself's crush (i.e. *crush**i*<==<=*i*). The first line of input contains integer *n* (1<=≤<=*n*<=≤<=100) — the number of people in Arpa's land. The second line contains *n* integers, *i*-th of them is *crush**i* (1<=≤<=*crush**i*<=≤<=*n*) — the number of *i*-th person's crush. If there is no *t* satisfying the condition, print -1. Otherwise print such smallest *t*. Sample Input 4 2 3 1 4 4 4 4 4 4 4 2 1 4 3 Sample Output 3 -1 1

[ "input()\ncrush = [0] + [int(x) for x in input().split()]\nvisited = set()\n\ncircle_sizes = []\n\ndef gcd(a, b):\n return a if b == 0 else gcd(b, a%b)\n\ndef lcm(a, b):\n return a * b // gcd(a, b)\n\ndef solve():\n for i in range(len(crush)):\n if i not in visited:\n start, cur, count = i, i, 0\n while cur not in visited:\n visited.add(cur)\n count += 1\n cur = crush[cur]\n if cur != start:\n return -1\n circle_sizes.append(count if count % 2 else count // 2)\n \n if len(circle_sizes) == 1:\n return circle_sizes[0]\n \n ans = lcm(circle_sizes[0], circle_sizes[1])\n for size in circle_sizes[2:]:\n ans = lcm(ans, size)\n return ans\n\nprint(solve())\n", "n = int(input())\n\nL = list(map(int, input().split()))\n\ndef gcd(a, b):\n while b != 0:\n a, b = b, a % b\n return a\n\ndef lcm(a, b):\n return a // gcd(a, b) * b\n\nif len(set(L)) < n:\n print(-1)\nelse:\n a = 1\n\n for i in range(n):\n if L[i] == 0: continue\n u = i\n c = 0\n while L[u] != 0:\n c += 1\n v = L[u] - 1\n L[u] = 0\n u = v\n\n if c % 2 == 0:\n c //= 2\n\n a = lcm(a, c)\n\n print(a)\n\n", "def gcd(a,b):return a if b==0 else gcd(b, a%b)\r\ndef lcm(a,b):return a*b//gcd(a,b)\r\nn=int(input())\r\nc=[int(v)-1 for v in input().split(' ')]\r\nt=1\r\nfor i in range(n):\r\n k=i\r\n for j in range(1, n+2):\r\n k=c[k]\r\n if k==i:\r\n break\r\n if j>n:\r\n print(-1)\r\n exit()\r\n t=lcm(t,j if j%2!=0 else j//2)\r\nprint(t)", "def gcd(a, b):\r\n if (a == 0):\r\n return b\r\n return gcd(b % a, a)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] -= 1\r\nu = [False] * n\r\nans = 1\r\nfor i in range(n):\r\n if (u[i] == False):\r\n x = i\r\n c = 1\r\n while (True):\r\n u[x] = True\r\n if (a[x] == i):\r\n break\r\n if (u[a[x]] != False):\r\n print(-1)\r\n exit(0)\r\n x = a[x]\r\n c += 1\r\n if (c % 2 == 0):\r\n c //= 2\r\n ans = ans * c // gcd(ans, c)\r\nprint(ans)", "from fractions import gcd\r\ndef lcm(l):\r\n v = 1\r\n for li in l:\r\n v = v * li // gcd(v, li)\r\n return v\r\nn, c = int(input()), [0] + list(map(int, input().split()))\r\nf, l = [False] * (n + 1), []\r\nfor i in range(1, n + 1):\r\n if not f[i]:\r\n li, x = 0, i\r\n while not f[x]:\r\n f[x] = True\r\n x, li = c[x], li + 1\r\n if x != i:\r\n print(-1)\r\n exit()\r\n l.append(li if li % 2 else li // 2)\r\nprint(lcm(l))", "#from collections import deque\nfrom functools import reduce\n\nn = int(input())\ncrush = [int(i) - 1 for i in input().split()]\n\ndef parity_treat(n):\n if n%2 == 0:\n return n//2\n else:\n return n\n\ndef gcd(a,b):\n while b:\n a, b = b, a%b\n return a\n\ndef lcm(a,b):\n return a * b // gcd(a,b)\n\ndef lcmm(*args):\n return reduce(lcm, args)\n\n\nif len(set(crush)) < n:\n print(-1)\nelse:\n component_size = []\n visited = set()\n for i in range(n):\n if i not in visited:\n tmp = 1\n start = i\n visited.add(start)\n j = crush[start]\n while j != start:\n visited.add(j)\n j = crush[j]\n tmp+=1\n component_size.append(tmp)\n component_size = [parity_treat(i) for i in component_size]\n print(lcmm(*component_size))", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif len(set(a))!=len(a): print(-1)\r\nelse:\r\n ans,cycle=None,None\r\n visited=[False]*(n+1)\r\n for i in range(n):\r\n if visited[i+1]: continue\r\n count,v=0,[]\r\n index,value=i+1,-1\r\n while value!=i+1:\r\n visited[index]=True\r\n v.append(index)\r\n value=a[index-1]\r\n index=value\r\n cycle=[len(v)//2,len(v)][len(v)%2]\r\n if i==0: ans=cycle\r\n else: ans=(ans*cycle)//math.gcd(ans,cycle)\r\n print(ans)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef gcd(a, b):\r\n if a > b:\r\n a, b = b, a \r\n if b % a==0:\r\n return a \r\n return gcd(b % a, a)\r\n\r\ndef process(A):\r\n \"\"\"\r\n must be a permutation\r\n \"\"\"\r\n n = len(A)\r\n A2 = sorted(A)\r\n if A2 != [i for i in range(1, n+1)]:\r\n sys.stdout.write('-1\\n')\r\n return\r\n cycles = []\r\n seen = [0 for i in range(n+1)]\r\n for i in range(1, n+1):\r\n if seen[i]==0:\r\n start = [i]\r\n while True:\r\n x = A[start[-1]-1]\r\n if x==i:\r\n break \r\n start.append(x)\r\n cycles.append(len(start))\r\n for x in start:\r\n seen[x] = 1\r\n g = None\r\n for m in cycles:\r\n if m % 2==0:\r\n m1 = m//2 \r\n else:\r\n m1 = m \r\n if g is None:\r\n g = m1 \r\n else:\r\n g = (g*m1)//gcd(g, m1)\r\n sys.stdout.write(f'{g}\\n')\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)", "from math import gcd\r\ndef count(x,a,n):\r\n c=0\r\n t=x\r\n while(1):\r\n x=a[x-1]\r\n c+=1\r\n if t==x:\r\n #print(t,x)\r\n break\r\n if c>=n:\r\n return 0\r\n break\r\n if c%2==0:\r\n return c//2\r\n else:\r\n return c\r\ndef xyz():\r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n l=1\r\n for i in range(n):\r\n p=count(i+1,a,n)\r\n if p==0:\r\n return -1\r\n l=(p*l)//(gcd(p,l))\r\n return l\r\nprint(xyz())\r\n \r\n \r\n \r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b, a%b)\r\ndef lcm(a,b):\r\n return a*b/gcd(a,b)\r\ndef dfs(sad, num, posjeceno):\r\n \"\"\"if sad==a[sad]-1 and posjeceno!=[0]*n:\r\n return (-10, [])\"\"\"\r\n posjeceno[sad]=1\r\n if posjeceno[a[sad]-1]==1:\r\n return (num+1, posjeceno)\r\n return dfs(a[sad]-1, num+1, posjeceno)\r\n\r\ndef trazi(oznaka):\r\n global memo\r\n if memo[oznaka]==[]:\r\n memo[oznaka]=dfs(oznaka, 0, [0]*n)\r\n return memo[oznaka]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=set()\r\nbrojac=n\r\nmemo=[[] for e in range (n)]\r\nwhile brojac>-1:\r\n brojac-=1\r\n if memo[brojac]==[]:\r\n trazi(brojac)\r\n \"\"\"if memo[brojac][0]==-10:\r\n d=-10\r\n break\"\"\"\r\n l=memo[brojac][1]\r\n for w in range(n):\r\n if l[w]==1:\r\n if trazi(w)[1]!=l:\r\n d=-10\r\n break\r\n if d==-10:\r\n break\r\n vrati, l=trazi(brojac)\r\n if vrati%2==0:\r\n d.add(float(vrati/2))\r\n else:\r\n d.add(float(vrati))\r\nif d==-10:\r\n print(-1)\r\nelse:\r\n sol=1\r\n for r in d:\r\n sol=lcm(sol, r)\r\n print(int(sol))\r\n", "from collections import deque\nfrom math import gcd\n\nn = int(input())\ngraph = [int(i) - 1 for i in input().split()]\n\n\ndef bfs(x):\n visited = set([x])\n queue = deque([x])\n\n while queue:\n vertex = queue.pop()\n el = graph[vertex]\n if el not in visited:\n visited.add(el)\n queue.append(el)\n elif el != x:\n return False\n\n return len(visited)\n\n\nmn = set()\nfor i in range(n):\n res = bfs(i)\n if res:\n res = res if res % 2 == 1 else res // 2\n mn.add(res)\n else:\n print(-1)\n exit()\n\nmn = list(mn)\nd = {}\n\nfor i in mn:\n el = i\n for j in range(2, i + 1):\n if el % j == 0:\n n = 0\n while el % j == 0:\n el //= j\n n += 1\n\n if j not in d.keys():\n d[j] = n\n else:\n d[j] = max(d[j], n)\n\np = 1\nfor i, n in d.items():\n p *= i ** n\n\nprint(p)\n\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\n\r\ndef all_gcd(array):\r\n n = len(array)\r\n ans = array[0]\r\n for i in range(1, n):\r\n ans = gcd(ans, array[i])\r\n return ans\r\n\r\n\r\ndef all_lcm_int(array):\r\n ans = array[0]\r\n for i in range(1, len(array)):\r\n ans = (ans * array[i]) // gcd(ans, array[i])\r\n return ans\r\n\r\n\r\ndef all_lcm_dict(array):\r\n primes = {}\r\n for num in array:\r\n for k in range(2, int(num ** 0.5) + 1):\r\n cnt = 0\r\n while num % k == 0:\r\n cnt += 1\r\n num //= k\r\n if cnt != 0:\r\n if k not in primes:\r\n primes[k] = cnt\r\n else:\r\n primes[k] = max(cnt, primes[k])\r\n if num != 1:\r\n if num not in primes:\r\n primes[num] = 1\r\n return primes\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\nif len(set(a)) != len(a):\r\n print(-1)\r\n exit()\r\n\r\nused = [False] * n\r\nsize = []\r\nfor i in range(n):\r\n if used[i]:\r\n continue\r\n sz = 1\r\n used[i] = True\r\n while True:\r\n nxt_i = a[i] - 1\r\n if used[nxt_i]:\r\n break\r\n sz += 1\r\n used[nxt_i] = True\r\n i = nxt_i\r\n if sz % 2 == 0:\r\n size.append(sz // 2)\r\n else:\r\n size.append(sz)\r\n\r\nprint(all_lcm_int(size))", "from fractions import gcd\r\n\r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n\r\nn = int(input())\r\ngo = list(map(int, input().split()))\r\nfor i in range(n):\r\n go[i] -= 1\r\nvis = [False for i in range(n)]\r\nans = 1\r\nfor i in range(n):\r\n vis = [False for j in range(n)]\r\n x = go[i]\r\n while True:\r\n if vis[x] == True:\r\n break\r\n vis[x] = True\r\n x = go[x]\r\n if vis[i] == False:\r\n print(\"-1\")\r\n exit(0)\r\nvis = [False for i in range(n)]\r\nfor i in range(n):\r\n if vis[i] == True:\r\n continue\r\n x = i\r\n cycle = 0\r\n while True:\r\n if vis[x] == True:\r\n break\r\n cycle += 1\r\n vis[x] = True\r\n x = go[x]\r\n if cycle % 2 == 1:\r\n ans = lcm(ans, cycle)\r\n else:\r\n ans = lcm(ans, cycle // 2)\r\nprint(ans)\r\n ", "from fractions import gcd\r\ndef dfs(node):\r\n if (vis[node] == idd[0]):\r\n return node\r\n cycleLen[0] += 1\r\n vis[node] = idd[0]\r\n return dfs(crush[node])\r\n\r\nn = int(input())\r\ncrush = list(map(int, input().split()))\r\nfor i in range(n):\r\n crush[i] -= 1\r\nvis = [0] * n\r\nans = 10**100\r\nidd = [0]\r\nV = []\r\nfor i in range(n):\r\n idd[0] += 1\r\n cycleLen = [0]\r\n if (dfs(i) != i):\r\n ans = -1\r\n V.append(cycleLen[0])\r\nV.sort()\r\n\r\ndef lcm(x, y):\r\n return x * y // gcd(x, y)\r\n\r\nif (ans == -1):\r\n print(ans)\r\nelse:\r\n ans = 1\r\n inc = 1\r\n for item in V:\r\n\r\n mem = {}\r\n bad = False\r\n while (True): \r\n if (ans % item == 0):\r\n break\r\n if (item % 2 == 0 and ans % item == item // 2):\r\n break\r\n if (ans % item in mem):\r\n bad = True\r\n break\r\n mem[ans % item] = 1\r\n ans += inc\r\n if (bad):\r\n ans = -1\r\n break\r\n inc = lcm(inc, ans)\r\n print(ans)\r\n", "from math import gcd\ndef lcm(a, b): return a * b // gcd(a, b)\nn = int(input())\nA = [0] + list(map(int, input().split()))\ng = {}\nfor i in range(1, n + 1):\n g[A[i]] = i\nif len(g) != n:\n print(-1)\nelse:\n clc = 1\n for i in g:\n x = g[i]\n cnt = 1\n while x != i:\n x = g[x]\n cnt += 1\n if cnt % 2 == 0:\n cnt //= 2\n clc = lcm(clc, cnt)\n print(clc)", "n = int(input())\r\nw = map(int, input().split())\r\nw = [x-1 for x in w]\r\n\r\nws = sorted(w)\r\nfor i in range(n):\r\n\tif i != ws[i]:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\r\na = []\r\nvis = [False] * n\r\nfor i in range(n):\r\n\tif not vis[i]:\r\n\t\ta.append(0)\r\n\t\tj = i\r\n\t\twhile not vis[j]:\r\n\t\t\ta[-1] += 1\r\n\t\t\tvis[j] = True\r\n\t\t\tj = w[j]\r\n\r\ndef gcd(a, b):\r\n\tif b == 0:\r\n\t\treturn a\r\n\treturn gcd(b, a % b)\r\n\r\nans = 1\r\nfor i in a:\r\n\tif i % 2 == 0:\r\n\t\ti //= 2\r\n\tans = ans // gcd(ans, i) * i\r\nprint(ans)\r\n", "def gcd(x,y):\n return x if y==0 else gcd(y,x%y)\ndef lcm(x,y):\n return x//gcd(x,y)*y\ndef dfs(x,y):\n if(vis[x]):\n return y\n vis[x] = 1\n return dfs(c[x-1],y+1)\nn =int(input())\nc = []\nfor x in input().split():\n c.append(int(x))\nvis = [0]*(n+1)\nind = [0]*(n+1)\nfor i in range(n):\n ind[i+1]+=1\n ind[c[i]]+=1\nmk = 1\nfor i in range(n):\n if(ind[i+1]&1):\n mk = 0\nans = 1\nif(mk):\n for i in range(n):\n if(vis[i+1]==0):\n val = dfs(i+1,0)\n if(val%2==0):\n val//=2\n ans = lcm(ans,val)\n print(ans)\nelse:\n print(\"-1\");\n\n \t \t\t \t\t\t \t\t \t\t\t \t \t \t \t", "def make_function(n, crushes):\n def f(original_node):\n node = original_node\n x = 0\n for i in range(n):\n node = crushes[node]\n x += 1\n if node == original_node:\n break\n else:\n return -1\n return x / 2 if x % 2 == 0 else x\n return f\n\n\ndef lcd(numbers):\n gcd = lambda x, y: int(x) if y == 0 else int(gcd(y, x % y))\n ret = 1\n for number in numbers:\n ret = ret * number / gcd(ret, number)\n return ret\n\n\ndef main():\n n = int(input())\n a = map(int, input().split())\n crushes = {i: x for i, x in zip(range(1, n+1), a)}\n f = make_function(n, crushes)\n numbers = list(map(int, map(f, crushes)))\n if -1 in numbers:\n print (-1)\n return\n print (int(lcd(numbers)))\n\n\nmain()\n", "from math import *\r\nn=int(input())\r\na=list(map(lambda s:int(s)-1,input().split()))\r\nseen=[0]*n\r\nans=1\r\nlcm=1\r\nfor i in range(n):\r\n if not seen[i]:\r\n j=i\r\n leng=0\r\n while not seen[j]:\r\n seen[j]=1\r\n leng+=1\r\n j=a[j]\r\n if i==j:\r\n if leng%2==0:\r\n leng//=2\r\n lcm = lcm // gcd(lcm,leng) * leng\r\n else:\r\n ans=-1\r\n break\r\nif ans==-1:\r\n print(-1)\r\nelse:\r\n print(lcm)\r\n", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif sorted(a) != [i + 1 for i in range(n)]:\r\n print(-1)\r\nelse:\r\n ans = 1\r\n used = [0 for i in range(n)]\r\n for i in range(n):\r\n if used[i] == 0:\r\n j = i\r\n am = 0\r\n while used[j] == 0:\r\n am += 1\r\n used[j] = 1\r\n j = a[j] - 1\r\n if am % 2:\r\n ans = lcm(ans, am)\r\n else:\r\n ans = lcm(ans, am // 2)\r\n print(ans)", "def gcd(a, b):\n return a if b == 0 else gcd(b, a % b)\ndef lcm(a, b):\n return a * b // gcd(a, b)\nn = int(input())\nc = [int(v)-1 for v in input().split(' ')]\nt = 1\nfor i in range(n):\n k = i\n for j in range(1, n+2):\n k = c[k]\n if k == i:\n break\n if j > n:\n print(-1)\n exit()\n t = lcm(t, j if j % 2 != 0 else j // 2)\nprint(t)\n\n\n\n# Made By Mostafa_Khaled", "from fractions import gcd\r\nn = int(input())\r\ncrush = list(map(int,input().split()))\r\nwas = [0] * n\r\nans = 1\r\nfor i in range(n):\r\n if was[i]:\r\n continue\r\n num = i\r\n j = 0\r\n while not was[num]:\r\n was[num] = 1\r\n num = crush[num] - 1\r\n j += 1\r\n if i != num:\r\n ans = -1\r\n break\r\n else:\r\n if j % 2 == 0:\r\n j //= 2\r\n ans = ans * j // gcd(ans,j)\r\nprint(ans)\r\n", "import sys\r\nfrom math import gcd\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\na = [0] + list(map(int, input().split())) \r\nl = [] \r\nv = [0] * (n + 1) \r\nif(len(set(a)) != n + 1):\r\n print(-1)\r\n exit()\r\nfor i in range(1, n + 1):\r\n if(v[i] == 0):\r\n c = 1 \r\n v[i] = 1 \r\n j = a[i] \r\n while(not v[j]):\r\n c += 1 \r\n v[j] = 1 \r\n j = a[j] \r\n if(c % 2):\r\n l.append(c) \r\n else:\r\n l.append(c // 2)\r\n \r\ng = 0 \r\np = 1\r\nans = 1\r\n# print(l)\r\n\r\nfor i in range(len(l)):\r\n g = gcd(ans, l[i]) \r\n p = ans * l[i] \r\n ans = p // g \r\nprint(ans)\r\n\r\n ", "import math\r\n\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\ndef solve():\r\n \r\n n=int(input())\r\n ar=list(map(int,input().split()))\r\n ar=[0,]+ar\r\n mark=[0]*(n+1)\r\n\r\n ans=list()\r\n for i in range(1,n+1):\r\n\r\n if mark[i]==0:\r\n start=i\r\n ver=i\r\n count=0\r\n while mark[ver]==0:\r\n mark[ver]=1\r\n ver=ar[ver]\r\n count=count+1\r\n if ver==start:\r\n if count%2==0:\r\n ans=ans+[count//2]\r\n else:\r\n ans=ans+[count]\r\n else:\r\n print(-1)\r\n return \r\n\r\n\r\n f=1\r\n for x in ans:\r\n f=f*x//gcd(f,x)\r\n print(f)\r\n\r\nsolve()\r\n", "from math import gcd\r\nn = int(input())\r\narr = map(int, input().split())\r\narr = list(map(lambda x: x-1, arr))\r\n\r\nres = 1\r\nfor i in range(n):\r\n p, k = 0, i\r\n for j in range(n):\r\n k = arr[k]\r\n if k == i:\r\n p = j\r\n break\r\n if k != i:\r\n print(-1)\r\n exit()\r\n p += 1\r\n if p % 2 == 0: p //= 2\r\n res = res * p // gcd(res, p) \r\nprint(res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif sorted(a) != list(range(1, n + 1)): exit(print(-1))\r\na = [i - 1 for i in a]\r\nans = 1\r\nfrom math import gcd\r\nfor i in range(n):\r\n now = i\r\n cnt = -1\r\n for j in range(1, n + 2):\r\n now = a[now]\r\n if now == i:\r\n cnt = j\r\n break\r\n else:\r\n continue\r\n if cnt % 2 == 0: cnt //= 2\r\n ans = ans * cnt // gcd(ans, cnt)\r\nprint(ans)", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\n# from bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, = gil()\r\nnxt = [0] + gil()\r\nvis = [0]*(n+1)\r\n\r\nc = set()\r\n\r\ndef cycle(p):\r\n tt = 0\r\n start = p\r\n while vis[p] == 0:\r\n tt += 1\r\n vis[p] = 1\r\n p = nxt[p]\r\n if p != start:\r\n print(-1)\r\n exit()\r\n return tt\r\n\r\n\r\nfor p in range(1, n+1):\r\n if vis[p] : continue\r\n tt = cycle(p)\r\n if tt&1 :\r\n c.add(tt)\r\n else:\r\n c.add(tt//2)\r\n\r\nif 1 in c:c.remove(1)\r\n\r\n\r\nc = list(c)\r\n# print(c)\r\nif len(c) <= 1:\r\n print(c[0] if c else 1)\r\n exit()\r\n\r\npr = {}\r\n\r\ndef getPrime(x):\r\n ppr = {}\r\n\r\n for i in range(2, int(sqrt(x))+1):\r\n po = 0\r\n while x%i == 0:\r\n x //= i\r\n po += 1\r\n if po:ppr[i] = po\r\n\r\n if x > 1:\r\n ppr[x] = 1\r\n\r\n return ppr\r\n\r\n\r\n\r\nfor v in c:\r\n for pi, po in getPrime(v).items():\r\n pr[pi] = max(pr.get(pi, 0), po)\r\n\r\nans = 1\r\n\r\nfor pi, po in pr.items():\r\n ans *= pi**po\r\n\r\nprint(ans)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nl=list(map(lambda x:int(x)-1,input().split()))\r\n\r\nuse=[]\r\nvalid=1\r\nfor i in range(n):\r\n t=i\r\n for j in range(n+5):\r\n t=l[t]\r\n if t==i:\r\n if (j+1)%2==0: use.append((j+1)//2)\r\n else: use.append(j+1)\r\n break\r\n else:\r\n valid=0\r\n\r\nif not valid: print(\"-1\")\r\nelse:\r\n # get lcm\r\n ans=1\r\n for i in use:\r\n t=ans\r\n while ans%i:\r\n ans+=t\r\n print(ans)\r\n", "#!/usr/bin/python3\n\nfrom fractions import gcd\n\nn = int(input())\ndef dfs(u, v, nxt, vis):\n if u == v:\n return True\n elif vis[u]:\n return False\n else:\n vis[u] = True\n return dfs(nxt[u], v, nxt, vis)\n\n\ndef size(u, v, nxt):\n if u == v:\n return 1\n return size(nxt[u], v, nxt) + 1\n\n\nnxt = list(map(int, input().split()))\nfor i in range(n):\n nxt[i] -= 1\n\nszs = []\n\nfor i in range(n):\n if not dfs(nxt[i], i, nxt, [False] * n) and nxt[i] != i:\n print(-1)\n exit(0)\n elif nxt[i] == i:\n szs.append(1)\n else:\n szs.append(size(nxt[i], i, nxt))\n\n\nans = 1\ng = 0\nfor i in range(n):\n if szs[i] % 2 == 0:\n szs[i] //= 2\n ans = (ans * szs[i]) // gcd(ans, szs[i])\n\nprint(ans)\n\n" ]

{"inputs": ["4\n2 3 1 4", "4\n4 4 4 4", "4\n2 1 4 3", "5\n2 4 3 1 2", "5\n2 2 4 4 5", "5\n2 4 5 4 2", "10\n8 10 4 3 2 1 9 6 5 7", "10\n10 1 4 8 5 2 3 7 9 6", "10\n6 4 3 9 5 2 1 10 8 7", "100\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100", "100\n95 27 13 62 100 21 48 84 27 41 34 89 21 96 56 10 6 27 9 85 7 85 16 12 80 78 20 79 63 1 74 46 56 59 62 88 59 5 42 13 81 58 49 1 62 51 2 75 92 94 14 32 31 39 34 93 72 18 59 44 11 75 27 36 44 72 63 55 41 63 87 59 54 81 68 39 95 96 99 50 94 5 3 84 59 95 71 44 35 51 73 54 49 98 44 11 52 74 95 48", "100\n70 49 88 43 66 72 6 6 48 46 59 22 56 86 14 53 50 84 79 76 89 65 10 14 27 43 92 95 98 6 86 6 95 65 91 8 58 33 31 67 75 65 94 75 12 25 37 56 17 79 74 5 94 65 99 75 16 52 19 17 41 39 44 46 51 50 82 90 25 32 83 36 74 49 61 37 8 52 35 28 58 82 76 12 7 66 23 85 53 19 45 8 46 21 62 38 42 48 100 61", "100\n27 55 94 11 56 59 83 81 79 89 48 89 7 75 70 20 70 76 14 81 61 55 98 76 35 20 79 100 77 12 97 57 16 80 45 75 2 21 44 81 93 75 69 3 87 25 27 25 85 91 96 86 35 85 99 61 70 37 11 27 63 89 62 47 61 10 91 13 90 18 72 47 47 98 93 27 71 37 51 31 80 63 42 88 6 76 11 12 13 7 90 99 100 27 22 66 41 49 12 11", "100\n98 39 44 79 31 99 96 72 97 54 83 15 81 65 59 75 3 51 83 40 28 54 41 93 56 94 93 58 20 53 21 7 81 17 71 31 31 88 34 22 55 67 57 92 34 88 87 23 36 33 41 33 17 10 71 28 79 6 3 60 67 99 68 8 39 29 49 17 82 43 100 86 64 47 55 66 58 57 50 49 8 11 15 91 42 44 72 28 18 32 81 22 20 78 55 51 37 94 34 4", "100\n53 12 13 98 57 83 52 61 69 54 13 92 91 27 16 91 86 75 93 29 16 59 14 2 37 74 34 30 98 17 3 72 83 93 21 72 52 89 57 58 60 29 94 16 45 20 76 64 78 67 76 68 41 47 50 36 9 75 79 11 10 88 71 22 36 60 44 19 79 43 49 24 6 57 8 42 51 58 60 2 84 48 79 55 74 41 89 10 45 70 76 29 53 9 82 93 24 40 94 56", "100\n33 44 16 91 71 86 84 45 12 97 18 1 42 67 89 45 62 56 72 70 59 62 96 13 24 19 81 61 99 65 12 26 59 61 6 19 71 49 52 17 56 6 8 98 75 83 39 75 45 8 98 35 25 3 51 89 82 50 82 30 74 63 77 60 23 36 55 49 74 73 66 62 100 44 26 72 24 84 100 54 87 65 87 61 54 29 38 99 91 63 47 44 28 11 14 29 51 55 28 95", "100\n17 14 81 16 30 51 62 47 3 42 71 63 45 67 91 20 35 45 15 94 83 89 7 32 49 68 73 14 94 45 64 64 15 56 46 32 92 92 10 32 58 86 15 17 41 59 95 69 71 74 92 90 82 64 59 93 74 58 84 21 61 51 47 1 93 91 47 61 13 53 97 65 80 78 41 1 89 4 21 27 45 28 21 96 29 96 49 75 41 46 6 33 50 31 30 3 21 8 34 7", "100\n42 40 91 4 21 49 59 37 1 62 23 2 32 88 48 39 35 50 67 11 20 19 63 98 63 20 63 95 25 82 34 55 6 93 65 40 62 84 84 47 79 22 5 51 5 16 63 43 57 81 76 44 19 61 68 80 47 30 32 72 72 26 76 12 37 2 70 14 86 77 48 26 89 87 25 8 74 18 13 8 1 45 37 10 96 100 80 48 59 73 8 67 18 66 10 26 3 65 22 8", "100\n49 94 43 50 70 25 37 19 66 89 98 83 57 98 100 61 89 56 75 61 2 14 28 14 60 84 82 89 100 25 57 80 51 37 74 40 90 68 24 56 17 86 87 83 52 65 7 18 5 2 53 79 83 56 55 35 29 79 46 97 25 10 47 1 61 74 4 71 34 85 39 17 7 84 22 80 38 60 89 83 80 81 87 11 41 15 57 53 45 75 58 51 85 12 93 8 90 3 1 59", "100\n84 94 72 32 61 90 61 2 76 42 35 82 90 29 51 27 65 99 38 41 44 73 100 58 56 64 54 31 14 58 57 64 90 49 73 80 74 19 31 86 73 44 39 43 28 95 23 5 85 5 74 81 34 44 86 30 50 57 94 56 53 42 53 87 92 78 53 49 78 60 37 63 41 19 15 68 25 77 87 48 23 100 54 27 68 84 43 92 76 55 2 94 100 20 92 18 76 83 100 99", "100\n82 62 73 22 56 69 88 72 76 99 13 30 64 21 89 37 5 7 16 38 42 96 41 6 34 18 35 8 31 92 63 87 58 75 9 53 80 46 33 100 68 36 24 3 77 45 2 51 78 54 67 48 15 1 79 57 71 97 17 52 4 98 85 14 47 83 84 49 27 91 19 29 25 44 11 43 60 86 61 94 32 10 59 93 65 20 50 55 66 95 90 70 39 26 12 74 40 81 23 28", "100\n23 12 62 61 32 22 34 91 49 44 59 26 7 89 98 100 60 21 30 9 68 97 33 71 67 83 45 38 5 8 2 65 16 69 18 82 72 27 78 73 35 48 29 36 66 54 95 37 10 19 20 77 1 17 87 70 42 4 50 53 63 94 93 56 24 88 55 6 11 58 39 75 90 40 57 79 47 31 41 51 52 85 14 13 99 64 25 46 15 92 28 86 43 76 84 96 3 74 81 80", "100\n88 41 92 79 21 91 44 2 27 96 9 64 73 87 45 13 39 43 16 42 99 54 95 5 75 1 48 4 15 47 34 71 76 62 17 70 81 80 53 90 67 3 38 58 32 25 29 63 6 50 51 14 37 97 24 52 65 40 31 98 100 77 8 33 61 11 49 84 89 78 56 20 94 35 86 46 85 36 82 93 7 59 10 60 69 57 12 74 28 22 30 66 18 68 72 19 26 83 23 55", "100\n37 60 72 43 66 70 13 6 27 41 36 52 44 92 89 88 64 90 77 32 78 58 35 31 97 50 95 82 7 65 99 22 16 28 85 46 26 38 15 79 34 96 23 39 42 75 51 83 33 57 3 53 4 48 18 8 98 24 55 84 20 30 14 25 40 29 91 69 68 17 54 94 74 49 73 11 62 81 59 86 61 45 19 80 76 67 21 2 71 87 10 1 63 9 100 93 47 56 5 12", "100\n79 95 49 70 84 28 89 18 5 3 57 30 27 19 41 46 12 88 2 75 58 44 31 16 8 83 87 68 90 29 67 13 34 17 1 72 80 15 20 4 22 37 92 7 98 96 69 76 45 91 82 60 93 78 86 39 21 94 77 26 14 59 24 56 35 71 52 38 48 100 32 74 9 54 47 63 23 55 51 81 53 33 6 36 62 11 42 73 43 99 50 97 61 85 66 65 25 10 64 40", "100\n74 71 86 6 75 16 62 25 95 45 29 36 97 5 8 78 26 69 56 57 60 15 55 87 14 23 68 11 31 47 3 24 7 54 49 80 33 76 30 65 4 53 93 20 37 84 35 1 66 40 46 17 12 73 42 96 38 2 32 72 58 51 90 22 99 89 88 21 85 28 63 10 92 18 61 98 27 19 81 48 34 94 50 83 59 77 9 44 79 43 39 100 82 52 70 41 67 13 64 91", "100\n58 65 42 100 48 22 62 16 20 2 19 8 60 28 41 90 39 31 74 99 34 75 38 82 79 29 24 84 6 95 49 43 94 81 51 44 77 72 1 55 47 69 15 33 66 9 53 89 97 67 4 71 57 18 36 88 83 91 5 61 40 70 10 23 26 30 59 25 68 86 85 12 96 46 87 14 32 11 93 27 54 37 78 92 52 21 80 13 50 17 56 35 73 98 63 3 7 45 64 76", "100\n60 68 76 27 73 9 6 10 1 46 3 34 75 11 33 89 59 16 21 50 82 86 28 95 71 31 58 69 20 42 91 79 18 100 8 36 92 25 61 22 45 39 23 66 32 65 80 51 67 84 35 43 98 2 97 4 13 81 24 19 70 7 90 37 62 48 41 94 40 56 93 44 47 83 15 17 74 88 64 30 77 5 26 29 57 12 63 14 38 87 99 52 78 49 96 54 55 53 85 72", "100\n72 39 12 50 13 55 4 94 22 61 33 14 29 93 28 53 59 97 2 24 6 98 52 21 62 84 44 41 78 82 71 89 88 63 57 42 67 16 30 1 27 66 35 26 36 90 95 65 7 48 47 11 34 76 69 3 100 60 32 45 40 87 18 81 51 56 73 85 25 31 8 77 37 58 91 20 83 92 38 17 9 64 43 5 10 99 46 23 75 74 80 68 15 19 70 86 79 54 49 96", "100\n91 50 1 37 65 78 73 10 68 84 54 41 80 59 2 96 53 5 19 58 82 3 88 34 100 76 28 8 44 38 17 15 63 94 21 72 57 31 33 40 49 56 6 52 95 66 71 20 12 16 35 75 70 39 4 60 45 9 89 18 87 92 85 46 23 79 22 24 36 81 25 43 11 86 67 27 32 69 77 26 42 98 97 93 51 61 48 47 62 90 74 64 83 30 14 55 13 29 99 7", "100\n40 86 93 77 68 5 32 77 1 79 68 33 29 36 38 3 69 46 72 7 27 27 30 40 21 18 69 69 32 10 82 97 1 34 87 81 92 67 47 3 52 89 25 41 88 79 5 46 41 82 87 1 77 41 54 16 6 92 18 10 37 45 71 25 16 66 39 94 60 13 48 64 28 91 80 36 4 53 50 28 30 45 92 79 93 71 96 66 65 73 57 71 48 78 76 53 96 76 81 89", "100\n2 35 14 84 13 36 35 50 61 6 85 13 65 12 30 52 25 84 46 28 84 78 45 7 64 47 3 4 89 99 83 92 38 75 25 44 47 55 44 80 20 26 88 37 64 57 81 8 7 28 34 94 9 37 39 54 53 59 3 26 19 40 59 38 54 43 61 67 43 67 6 25 63 54 9 77 73 54 17 40 14 76 51 74 44 56 18 40 31 38 37 11 87 77 92 79 96 22 59 33", "100\n68 45 33 49 40 52 43 60 71 83 43 47 6 34 5 94 99 74 65 78 31 52 51 72 8 12 70 87 39 68 2 82 90 71 82 44 43 34 50 26 59 62 90 9 52 52 81 5 72 27 71 95 32 6 23 27 26 63 66 3 35 58 62 87 45 16 64 82 62 40 22 15 88 21 50 58 15 49 45 99 78 8 81 55 90 91 32 86 29 30 50 74 96 43 43 6 46 88 59 12", "100\n83 4 84 100 21 83 47 79 11 78 40 33 97 68 5 46 93 23 54 93 61 67 88 8 91 11 46 10 48 39 95 29 81 36 71 88 45 64 90 43 52 49 59 57 45 83 74 89 22 67 46 2 63 84 20 30 51 26 70 84 35 70 21 86 88 79 7 83 13 56 74 54 83 96 31 57 91 69 60 43 12 34 31 23 70 48 96 58 20 36 87 17 39 100 31 69 21 54 49 42", "100\n35 12 51 32 59 98 65 84 34 83 75 72 35 31 17 55 35 84 6 46 23 74 81 98 61 9 39 40 6 15 44 79 98 3 45 41 64 56 4 27 62 27 68 80 99 21 32 26 60 82 5 1 98 75 49 26 60 25 57 18 69 88 51 64 74 97 81 78 62 32 68 77 48 71 70 64 17 1 77 25 95 68 33 80 11 55 18 42 24 73 51 55 82 72 53 20 99 15 34 54", "100\n82 56 26 86 95 27 37 7 8 41 47 87 3 45 27 34 61 95 92 44 85 100 7 36 23 7 43 4 34 48 88 58 26 59 89 46 47 13 6 13 40 16 6 32 76 54 77 3 5 22 96 22 52 30 16 99 90 34 27 14 86 16 7 72 49 82 9 21 32 59 51 90 93 38 54 52 23 13 89 51 18 96 92 71 3 96 31 74 66 20 52 88 55 95 88 90 56 19 62 68", "100\n58 40 98 67 44 23 88 8 63 52 95 42 28 93 6 24 21 12 94 41 95 65 38 77 17 41 94 99 84 8 5 10 90 48 18 7 72 16 91 82 100 30 73 41 15 70 13 23 39 56 15 74 42 69 10 86 21 91 81 15 86 72 56 19 15 48 28 38 81 96 7 8 90 44 13 99 99 9 70 26 95 95 77 83 78 97 2 74 2 76 97 27 65 68 29 20 97 91 58 28", "100\n99 7 60 94 9 96 38 44 77 12 75 88 47 42 88 95 59 4 12 96 36 16 71 6 26 19 88 63 25 53 90 18 95 82 63 74 6 60 84 88 80 95 66 50 21 8 61 74 61 38 31 19 28 76 94 48 23 80 83 58 62 6 64 7 72 100 94 90 12 63 44 92 32 12 6 66 49 80 71 1 20 87 96 12 56 23 10 77 98 54 100 77 87 31 74 19 42 88 52 17", "100\n36 66 56 95 69 49 32 50 93 81 18 6 1 4 78 49 2 1 87 54 78 70 22 26 95 22 30 54 93 65 74 79 48 3 74 21 88 81 98 89 15 80 18 47 27 52 93 97 57 38 38 70 55 26 21 79 43 30 63 25 98 8 18 9 94 36 86 43 24 96 78 43 54 67 32 84 14 75 37 68 18 30 50 37 78 1 98 19 37 84 9 43 4 95 14 38 73 4 78 39", "100\n37 3 68 45 91 57 90 83 55 17 42 26 23 46 51 43 78 83 12 42 28 17 56 80 71 41 32 82 41 64 56 27 32 40 98 6 60 98 66 82 65 27 69 28 78 57 93 81 3 64 55 85 48 18 73 40 48 50 60 9 63 54 55 7 23 93 22 34 75 18 100 16 44 31 37 85 27 87 69 37 73 89 47 10 34 30 11 80 21 30 24 71 14 28 99 45 68 66 82 81", "100\n98 62 49 47 84 1 77 88 76 85 21 50 2 92 72 66 100 99 78 58 33 83 27 89 71 97 64 94 4 13 17 8 32 20 79 44 12 56 7 9 43 6 26 57 18 23 39 69 30 55 16 96 35 91 11 68 67 31 38 90 40 48 25 41 54 82 15 22 37 51 81 65 60 34 24 14 5 87 74 19 46 3 80 45 61 86 10 28 52 73 29 42 70 53 93 95 63 75 59 36", "100\n57 60 40 66 86 52 88 4 54 31 71 19 37 16 73 95 98 77 92 59 35 90 24 96 10 45 51 43 91 63 1 80 14 82 21 29 2 74 99 8 79 76 56 44 93 17 12 33 87 46 72 83 36 49 69 22 3 38 15 13 34 20 42 48 25 28 18 9 50 32 67 84 62 97 68 5 27 65 30 6 81 26 39 41 55 11 70 23 7 53 64 85 100 58 78 75 94 47 89 61", "100\n60 2 18 55 53 58 44 32 26 70 90 4 41 40 25 69 13 73 22 5 16 23 21 86 48 6 99 78 68 49 63 29 35 76 14 19 97 12 9 51 100 31 81 43 52 91 47 95 96 38 62 10 36 46 87 28 20 93 54 27 94 7 11 37 33 61 24 34 72 3 74 82 77 67 8 88 80 59 92 84 56 57 83 65 50 98 75 17 39 71 42 66 15 45 79 64 1 30 89 85", "100\n9 13 6 72 98 70 5 100 26 75 25 87 35 10 95 31 41 80 91 38 61 64 29 71 52 63 24 74 14 56 92 85 12 73 59 23 3 39 30 42 68 47 16 18 8 93 96 67 48 89 53 77 49 62 44 33 83 57 81 55 28 76 34 36 88 37 17 11 40 90 46 84 94 60 4 51 69 21 50 82 97 1 54 2 65 32 15 22 79 27 99 78 20 43 7 86 45 19 66 58", "100\n84 39 28 52 82 49 47 4 88 15 29 38 92 37 5 16 83 7 11 58 45 71 23 31 89 34 69 100 90 53 66 50 24 27 14 19 98 1 94 81 77 87 70 54 85 26 42 51 99 48 10 57 95 72 3 33 43 41 22 97 62 9 40 32 44 91 76 59 2 65 20 61 60 64 78 86 55 75 80 96 93 73 13 68 74 25 35 30 17 8 46 36 67 79 12 21 56 63 6 18", "100\n95 66 71 30 14 70 78 75 20 85 10 90 53 9 56 88 38 89 77 4 34 81 33 41 65 99 27 44 61 21 31 83 50 19 58 40 15 47 76 7 5 74 37 1 86 67 43 96 63 92 97 25 59 42 73 60 57 80 62 6 12 51 16 45 36 82 93 54 46 35 94 3 11 98 87 22 69 100 23 48 2 49 28 55 72 8 91 13 68 39 24 64 17 52 18 26 32 29 84 79", "100\n73 21 39 30 78 79 15 46 18 60 2 1 45 35 74 26 43 49 96 59 89 61 34 50 42 84 16 41 92 31 100 64 25 27 44 98 86 47 29 71 97 11 95 62 48 66 20 53 22 83 76 32 77 63 54 99 87 36 9 70 17 52 72 38 81 19 23 65 82 37 24 10 91 93 56 12 88 58 51 33 4 28 8 3 40 7 67 69 68 6 80 13 5 55 14 85 94 75 90 57", "100\n44 43 76 48 53 13 9 60 20 18 82 31 28 26 58 3 85 93 69 73 100 42 2 12 30 50 84 7 64 66 47 56 89 88 83 37 63 68 27 52 49 91 62 45 67 65 90 75 81 72 87 5 38 33 6 57 35 97 77 22 51 23 80 99 11 8 15 71 16 4 92 1 46 70 54 96 34 19 86 40 39 25 36 78 29 10 95 59 55 61 98 14 79 17 32 24 21 74 41 94", "100\n31 77 71 33 94 74 19 20 46 21 14 22 6 93 68 54 55 2 34 25 44 90 91 95 61 51 82 64 99 76 7 11 52 86 50 70 92 66 87 97 45 49 39 79 26 32 75 29 83 47 18 62 28 27 88 60 67 81 4 24 3 80 16 85 35 42 9 65 23 15 36 8 12 13 10 57 73 69 48 78 43 1 58 63 38 84 40 56 98 30 17 72 96 41 53 5 37 89 100 59", "100\n49 44 94 57 25 2 97 64 83 14 38 31 88 17 32 33 75 81 15 54 56 30 55 66 60 86 20 5 80 28 67 91 89 71 48 3 23 35 58 7 96 51 13 100 39 37 46 85 99 45 63 16 92 9 41 18 24 84 1 29 72 77 27 70 62 43 69 78 36 53 90 82 74 11 34 19 76 21 8 52 61 98 68 6 40 26 50 93 12 42 87 79 47 4 59 10 73 95 22 65", "100\n81 59 48 7 57 38 19 4 31 33 74 66 9 67 95 91 17 26 23 44 88 35 76 5 2 11 32 41 13 21 80 73 75 22 72 87 65 3 52 61 25 86 43 55 99 62 53 34 85 63 60 71 10 27 29 47 24 42 15 40 16 96 6 45 54 93 8 70 92 12 83 77 64 90 56 28 20 97 36 46 1 49 14 100 68 50 51 98 79 89 78 37 39 82 58 69 30 94 84 18", "100\n62 50 16 53 19 18 63 26 47 85 59 39 54 92 95 35 71 69 29 94 98 68 37 75 61 25 88 73 36 89 46 67 96 12 58 41 64 45 34 32 28 74 15 43 66 97 70 90 42 13 56 93 52 21 60 20 17 79 49 5 72 83 23 51 2 77 65 55 11 76 91 81 100 44 30 8 4 10 7 99 31 87 82 86 14 9 40 78 22 48 80 38 57 33 24 6 1 3 27 84", "100\n33 66 80 63 41 88 39 48 86 68 76 81 59 99 93 100 43 37 11 64 91 22 7 57 87 58 72 60 35 79 18 94 70 25 69 31 3 27 53 30 29 54 83 36 56 55 84 34 51 73 90 95 92 85 47 44 97 5 10 12 65 61 40 98 17 23 1 82 16 50 74 28 24 4 2 52 67 46 78 13 89 77 6 15 8 62 45 32 21 75 19 14 71 49 26 38 20 42 96 9", "100\n66 48 77 30 76 54 64 37 20 40 27 21 89 90 23 55 53 22 81 97 28 63 45 14 38 44 59 6 34 78 10 69 75 79 72 42 99 68 29 83 62 33 26 17 46 35 80 74 50 1 85 16 4 56 43 57 88 5 19 51 73 9 94 47 8 18 91 52 86 98 12 32 3 60 100 36 96 49 24 13 67 25 65 93 95 87 61 92 71 82 31 41 84 70 39 58 7 2 15 11", "100\n2 61 67 86 93 56 83 59 68 43 15 20 49 17 46 60 19 21 24 84 8 81 55 31 73 99 72 41 91 47 85 50 4 90 23 66 95 5 11 79 58 77 26 80 40 52 92 74 100 6 82 57 65 14 96 27 32 3 88 16 97 35 30 51 29 38 13 87 76 63 98 18 25 37 48 62 75 36 94 69 78 39 33 44 42 54 9 53 12 70 22 34 89 7 10 64 45 28 1 71", "100\n84 90 51 80 67 7 43 77 9 72 97 59 44 40 47 14 65 42 35 8 85 56 53 32 58 48 62 29 96 92 18 5 60 98 27 69 25 33 83 30 82 46 87 76 70 73 55 21 31 99 50 13 16 34 81 89 22 10 61 78 4 36 41 19 68 64 17 74 28 11 94 52 6 24 1 12 3 66 38 26 45 54 75 79 95 20 2 71 100 91 23 49 63 86 88 37 93 39 15 57", "100\n58 66 46 88 94 95 9 81 61 78 65 19 40 17 20 86 89 62 100 14 73 34 39 35 43 90 69 49 55 74 72 85 63 41 83 36 70 98 11 84 24 26 99 30 68 51 54 31 47 33 10 75 7 77 16 28 1 53 67 91 44 64 45 60 8 27 4 42 6 79 76 22 97 92 29 80 82 96 3 2 71 37 5 52 93 13 87 23 56 50 25 38 18 21 12 57 32 59 15 48", "100\n9 94 1 12 46 51 77 59 15 34 45 49 8 80 4 35 91 20 52 27 78 36 73 95 58 61 11 79 42 41 5 7 60 40 70 72 74 17 30 19 3 68 37 67 13 29 54 25 26 63 10 71 32 83 99 88 65 97 39 2 33 43 82 75 62 98 44 66 89 81 76 85 92 87 56 31 14 53 16 96 24 23 64 38 48 55 28 86 69 21 100 84 47 6 57 22 90 93 18 50", "100\n40 97 71 53 25 31 50 62 68 39 17 32 88 81 73 58 36 98 64 6 65 33 91 8 74 51 27 28 89 15 90 84 79 44 41 54 49 3 5 10 99 34 82 48 59 13 69 18 66 67 60 63 4 96 26 95 45 76 57 22 14 72 93 83 11 70 56 35 61 16 19 21 1 52 38 43 85 92 100 37 42 23 2 55 87 75 29 80 30 77 12 78 46 47 20 24 7 86 9 94", "100\n85 59 62 27 61 12 80 15 1 100 33 84 79 28 69 11 18 92 2 99 56 81 64 50 3 32 17 7 63 21 53 89 54 46 90 72 86 26 51 23 8 19 44 48 5 25 42 14 29 35 55 82 6 83 88 74 67 66 98 4 70 38 43 37 91 40 78 96 9 75 45 95 93 30 68 47 65 34 58 39 73 16 49 60 76 10 94 87 41 71 13 57 97 20 24 31 22 77 52 36", "100\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76 99 100", "26\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16", "100\n2 1 4 5 3 7 8 9 10 6 12 13 14 15 16 17 11 19 20 21 22 23 24 25 26 27 28 18 30 31 32 33 34 35 36 37 38 39 40 41 29 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 42 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 59 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 78", "6\n2 3 4 1 6 5", "39\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27", "15\n2 3 4 5 1 7 8 9 10 6 12 13 14 15 11", "98\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 1 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 20 38 39 40 41 42 43 44 45 46 47 48 49 37 51 52 53 54 55 56 57 58 59 60 50 62 63 64 65 66 67 61 69 70 71 72 68 74 75 76 77 78 79 80 81 73 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 82 98 99 100", "4\n2 3 4 2", "93\n2 3 4 5 1 7 8 9 10 11 12 6 14 15 16 17 18 19 20 21 22 23 13 25 26 27 28 29 30 31 32 33 34 35 36 24 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 37 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 54 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 73", "15\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9", "41\n2 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 20 21 22 23 24 12 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 25", "100\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 76 100 99", "24\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16", "90\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 40 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 55 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 72", "99\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16 26 27 28 29 30 31 32 33 34 35 25 37 38 39 40 41 42 43 44 45 46 47 48 36 50 51 52 53 54 55 56 57 58 59 60 61 62 63 49 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 64 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 81", "75\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57", "9\n2 3 4 5 6 7 8 9 1", "26\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 26 16 17 18 19 20 21 22 23 24 25", "99\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 1 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 51", "96\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 25 26 16 28 29 30 31 32 33 34 35 36 37 38 39 27 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 57 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 76", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 1 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 18 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 37 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 57 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 78", "48\n2 3 1 5 6 7 8 4 10 11 12 13 14 15 9 17 18 19 20 21 22 23 24 16 26 27 28 29 30 31 32 33 34 35 25 37 38 39 40 41 42 43 44 45 46 47 48 36", "100\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1", "12\n2 3 4 5 1 7 8 9 10 11 12 6", "12\n2 3 4 1 6 7 8 9 10 11 12 5", "100\n2 1 5 3 4 10 6 7 8 9 17 11 12 13 14 15 16 28 18 19 20 21 22 23 24 25 26 27 41 29 30 31 32 33 34 35 36 37 38 39 40 58 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 77 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 100 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99", "100\n2 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 12 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 29 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 48 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 71 100"], "outputs": ["3", "-1", "1", "-1", "-1", "-1", "15", "2", "4", "1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "1260", "6864", "360", "1098", "13090", "4020", "1098", "132", "4620", "3498", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "42", "353430", "1235", "2376", "330", "1071", "7315", "290", "708", "1440", "87", "777", "175", "5187", "9765", "660", "324", "12870", "825", "1650", "111546435", "1155", "111546435", "2", "15015", "5", "111546435", "116396280", "-1", "4849845", "105", "2431", "111546435", "315", "4849845", "14549535", "4849845", "9", "1155", "1225", "4849845", "1560090", "45045", "50", "35", "4", "111546435", "2369851"]}

UNKNOWN

PYTHON3

CODEFORCES

29

d01820987d411523356abffd769f2c7f

Vasily the Bear and Triangle

Vasily the bear has a favorite rectangle, it has one vertex at point (0,<=0), and the opposite vertex at point (*x*,<=*y*). Of course, the sides of Vasya's favorite rectangle are parallel to the coordinate axes. Vasya also loves triangles, if the triangles have one vertex at point *B*<==<=(0,<=0). That's why today he asks you to find two points *A*<==<=(*x*1,<=*y*1) and *C*<==<=(*x*2,<=*y*2), such that the following conditions hold: - the coordinates of points: *x*1, *x*2, *y*1, *y*2 are integers. Besides, the following inequation holds: *x*1<=<<=*x*2; - the triangle formed by point *A*, *B* and *C* is rectangular and isosceles ( is right); - all points of the favorite rectangle are located inside or on the border of triangle *ABC*; - the area of triangle *ABC* is as small as possible. Help the bear, find the required points. It is not so hard to proof that these points are unique. The first line contains two integers *x*,<=*y* (<=-<=109<=≤<=*x*,<=*y*<=≤<=109,<=*x*<=≠<=0,<=*y*<=≠<=0). Print in the single line four integers *x*1,<=*y*1,<=*x*2,<=*y*2 — the coordinates of the required points. Sample Input 10 5 -10 5 Sample Output 0 15 15 0 -15 0 0 15

[ "n=input().split()\r\nx,y=int(n[0]),int(n[1])\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,y-x,x-y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,y-x)\r\nelse:\r\n print(x+y,0,0,x+y)", "x,y=[int(x) for x in input().split(\" \")]\r\nif(x>=0 and y>=0):\r\n s=x+y\r\n print(0,s,s,0)\r\nif(x<0 and y>=0):\r\n d=x*-1\r\n s=d+y\r\n print(-s,0,0,s)\r\nif(x>=0 and y<0):\r\n d=y*-1\r\n s=d+x\r\n print(0,-s,s,0)\r\nif(x<0 and y<0):\r\n d=x*-1\r\n e=y*-1\r\n s=d+e\r\n print(-s,0,0,-s)", "x,y = map(int, input().split())\r\nval = abs(x)+abs(y)\r\nsign = lambda a: 1 if a>0 else -1 if a<0 else 0\r\nif x>0:\r\n point1x = 0\r\n point1y = val*sign(y)\r\n point2x = val* sign(x)\r\n point2y = 0\r\n print( point1x, point1y, point2x, point2y)\r\n\r\nelif x<0:\r\n point1x = val* sign(x)\r\n point1y = 0\r\n point2x = 0\r\n point2y = val*sign(y)\r\n print( point1x, point1y, point2x, point2y)\r\n\r\nelse:\r\n None", "import sys\r\ninput = sys.stdin.readline\r\nx, y = [int(k) for k in input().split()]\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(x - y, 0, 0, abs(x - y))\r\nelif x > 0 and y < 0:\r\n print(0, y - x, abs(y - x), 0)\r\nelse:\r\n print(x + y, 0, 0, x + y)", "x, y = map(int, input().split())\r\n\r\ndx = -1 if x < 0 else 1\r\ndy = -1 if y < 0 else 1\r\nv = abs(x) + abs(y)\r\nx1 = min(0, v * dx)\r\ny1 = v * dy if x1 == 0 else 0\r\nx2 = max(0, v * dx)\r\ny2 = v * dy if x2 == 0 else 0\r\n\r\nprint(x1, y1, x2, y2)", "import math\r\n\r\n\r\ndef main():\r\n x, y = map(int, input().split())\r\n if x > 0 and y > 0:\r\n c =[(x+y, 0), (0, x+y)]\r\n print(*min(c), *max(c))\r\n if x > 0 and y < 0:\r\n c = [(x - y, 0), (0, -(x - y))]\r\n print(*min(c), *max(c))\r\n if x < 0 and y > 0:\r\n c = [(-(-x + y), 0), (0, -x + y)]\r\n print(*min(c), *max(c))\r\n if x < 0 and y < 0:\r\n c = [(-(-x - y), 0), (0, -(-x - y))]\r\n print(*min(c), *max(c))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=map(int,input().split())\r\nif a>0 and b>0:\r\n c=abs(b)+abs(a)\r\n print(0,c,c,0)\r\nelif a<0 and b>0:\r\n c=abs(b)+abs(a)\r\n print(-c,0, 0,c)\r\nelif a<0 and b<0:\r\n c=abs(b)+abs(a)\r\n print(-c,0,0,-c)\r\nelif a>0 and b<0:\r\n c=abs(b)+abs(a)\r\n print(0,-c,c,0)", "X = list(map(int, input().split()))\r\nAnswer = [[0, X[1] + (abs(X[0]) if X[1] > 0 else abs(X[0]) * -1)],\r\n [X[0] + (abs(X[1]) if X[0] > 0 else abs(X[1]) * -1), 0]]\r\nAnswer = sorted(Answer)\r\nprint(*Answer[0],end=\" \")\r\nprint(*Answer[1],end=\" \")\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Being followed by my friend ESSI\r\n# CodeNumber: 621\r\n", "x, y = map(int, input().split())\r\nix = 1 if y >= 0 else -1\r\niy = 1 if x >= 0 else -1\r\nx1 = 0\r\nx2 = 0\r\ny1 = 0\r\ny2 = 0\r\nif 0 < (abs(y) + abs(x)) * iy:\r\n x1 = 0\r\n y1 = (abs(x) + abs(y)) * ix\r\n x2 = (abs(y) + abs(x)) * iy\r\n y2 = 0\r\nelse:\r\n x1 = (abs(y) + abs(x)) * iy\r\n y1 = 0\r\n x2 = 0\r\n y2 = (abs(y) + abs(x)) * ix\r\nprint(x1, y1, x2, y2)", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n print(-(abs(x)+y),0,0,abs(x)+y)\r\nelif x<0 and y<0:\r\n print((x+y),0,0,(x+y))\r\nelif x>0 and y<0:\r\n print(0,-(x+abs(y)),x+abs(y),0)", "sign = lambda x: abs(x)//x\r\n\r\nx, y = map(int, input().split())\r\nr = abs(x)+abs(y)\r\n\r\nif x > 0:\r\n print(0, r*sign(y), r, 0)\r\nelse:\r\n print(-r, 0, 0, r*sign(y))", "a,b=map(int, input().split())\r\nif a>0 and b>0:\r\n print(0,a+b, a+b, 0)\r\nelif a<0 and b>0:\r\n print(a-b,0,0,abs(a)+b)\r\nelif a<0 and b<0:\r\n print(a+b,0,0,a+b)\r\nelse:\r\n print(0,b-a,abs(b)+a,0)\r\n", "a, b = map(int, input().split())\r\n\r\nx = abs(a) + abs(b)\r\n\r\nif (a > 0 and b > 0):\r\n print(0, x, x, 0)\r\nelif (a > 0 and b < 0):\r\n print(0, -x, x, 0)\r\nelif (a < 0 and b > 0):\r\n print(-x, 0, 0, x)\r\nelse:\r\n print(-x, 0, 0, -x)\r\n", "x,y=map(int,input().split())\r\nz=abs(x)+abs(y)\r\nif x>0 and y>0: print(\"0 \",z,\" \",z,\" 0\")\r\nelif x<0 and y>0: print (-z,\" 0 0 \",z)\r\nelif x<0 and y<0: print (-z,\" 0 0 \",-z)\r\nelse : print(\"0 \",-z,\" \",z,\" 0\")", "x , y = [int(x) for x in input().split()]\r\na = abs(x)\r\nb = abs(y)\r\na = a + b\r\nb = a\r\nif x < 0 and y > 0:\r\n\ta = -a\r\n\tb = b\r\nelif x > 0 and y < 0:\r\n\tb = -b\r\n\ta = a\r\nelif x < 0 and y < 0:\r\n\ta = -a\r\n\tb = -b\r\nif(a < 0):\r\n\tprint(a , 0 , 0 , b)\r\nelse:\r\n\tprint(0 , b , a , 0)", "x, y = map(int, input().split())\r\nt = abs(x)+abs(y)\r\ns = y//abs(y)\r\nif x > 0:\r\n print(0, s*t, t, 0)\r\nelse:\r\n print(-t, 0, 0, s*t)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print(0, x+y, x+y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,abs(x)+y)\r\nelif x<0 and y<0:\r\n print(x+y,0,0,x+y)\r\nelse:\r\n print(0,y-x, abs(y)+x,0)", "s = input()\r\nx = int(s.split()[0])\r\ny = int(s.split()[1])\r\nabsl = abs(x) + abs(y)\r\nif (x > 0):\r\n if (y > 0):\r\n print(0, absl, absl, 0)\r\n else:\r\n print(0, -absl, absl, 0)\r\nelse:\r\n if (y > 0):\r\n print(-absl, 0, 0, absl)\r\n else:\r\n print(-absl, 0, 0, -absl)\r\n", "x,y=map(int,input().split())\r\nm=abs(x)+abs(y)\r\nif x>=0 :\r\n if y>=0:\r\n print(0,m,m,0)\r\n else:\r\n print(0,-m,m,0)\r\nelse :\r\n if y>=0:\r\n print(-m,0,0,m)\r\n else:\r\n print(-m,0,0,-m)\r\n \r\n ", "a,b=list(map(int,input().split()))\r\nif a>0 and b>0:\r\n print(0,a+b,a+b,0)\r\nelif b>0:\r\n x=(-1)*a+b\r\n print(-x,0,0,x)\r\nelif a>0:\r\n x=(-1)*b+a\r\n print(0,-x,x,0)\r\nelse:\r\n x=(-1)*b+(-1)*a\r\n print(-x,0,0,-x)\r\n\r\n", "x1, y1 = [int(x) for x in input().split()]\r\n\r\nif x1 > 0 and y1 > 0:\r\n p1 = (0,x1+y1)\r\n p2 = (x1+y1,0)\r\nelif x1 < 0 and y1 > 0:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (-(x1+y1), 0)\r\n p2 = (0, x1+y1)\r\nelif x1 < 0 and y1 < 0:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (-(x1+y1), 0)\r\n p2 = (0, -(x1+y1))\r\nelse:\r\n x1 = abs(x1)\r\n y1 = abs(y1)\r\n p1 = (0, -(x1+y1))\r\n p2 = (x1+y1, 0)\r\n\r\nxs = [p1, p2]\r\nxs.sort(key=lambda x: (x[0],x[1]))\r\nout = []\r\nfor x,y in xs:\r\n out.append(x)\r\n out.append(y)\r\nout = map(str, out)\r\nprint(\" \".join(out))", "'''\r\nCreated on Jan 6, 2015\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nx = int(t[0])\r\ny = int(t[1])\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(x + -1 * y, 0, 0, -1 * x + y)\r\nelif x < 0 and y < 0:\r\n print(x + y, 0, 0, x + y)\r\nelse:\r\n print(0, -1 * x + y, x + -1 * y , 0)\r\n \r\n", "def bear_and_triangle(x,y):\r\n l=[]\r\n add=abs(x)+abs(y)\r\n if(x>0 and y>0):\r\n x1=0\r\n y1=add\r\n x2=add\r\n y2=0\r\n elif(x<0 and y>0):\r\n x1=-(add)\r\n y1=0\r\n x2=0 \r\n y2=add\r\n elif(x<0 and y<0):\r\n x1=-(add)\r\n y1=0\r\n x2=0\r\n y2=-(add)\r\n elif(x>0 and y<0):\r\n x1=0\r\n y1=-(add)\r\n x2=add\r\n y2=0\r\n l.extend((x1,y1,x2,y2))\r\n return(l)\r\n \r\n\r\n \r\n\r\nx,y=list(map(int,input().split()))\r\nresult=bear_and_triangle(x,y)\r\nfor i in result:\r\n print(i,end=\" \")", "def solve():\r\n l=list(map(int,input().split()))\r\n x=abs(l[0])+abs(l[1])\r\n if(l[0]<0 and l[1]<0):\r\n print(-x,0,0,-x)\r\n elif(l[0]<0 and l[1]>0):\r\n print(-x,0,0,x)\r\n elif(l[0]>0 and l[1]<0):\r\n print(0,-x,x,0)\r\n elif (l[0]>0 and l[1]>0):\r\n print(0,x,x,0)\r\nsolve()\r\n", "x, y = map(int, input().split(\" \"))\r\n\r\na = abs(x)+abs(y)\r\n\r\nif(x>0 and y>0):\r\n\tx1 = 0\r\n\ty1 = a\r\n\tx2 = a\r\n\ty2 = 0\r\nelif(x>0 and y<0):\r\n\tx1 = 0\r\n\ty1 = a*-1\r\n\tx2 = a\r\n\ty2 = 0\r\n\r\nelif(x<0 and y<0):\r\n\tx1 = a*-1\r\n\ty1 = 0\r\n\tx2 = 0\r\n\ty2 = a*-1\r\n\r\nelif(x<0 and y>0):\r\n\tx1 = a*-1\r\n\ty1 = 0\r\n\tx2 = 0\r\n\ty2 = a\r\n\r\n# print(x1, \" \", y1, \" \", x2, \" \", y2)\r\nprint(x1, y1, x2, y2)", "x, y = (int(i) for i in input().split())\n# Z - x = Z - y\n# Z^2 + Z^2 = (Z - x)^2 + (Z - y)^2\n# 0.5Z^2 = xy + 0.5y(Z - x) + 0.5x(Z - y)\n# 0.5Z^2 = xy + 0.5Zy - xy + 0.5Zx\n# Z^2 = (x + y)Z\n# Z = x + y\nres = abs(x) + abs(y)\nres = sorted([((x//abs(x))*res, 0), (0, (y//abs(y))*res)])\nres = *res[0], *res[1]\nprint(*res)\n", "[x, y] = [int(i) for i in input().split()]\n\nif x >= 0:\n if y >= 0:\n \tprint(0,' ',x+y,' ',x+y,' ',0)\n else:\n print(0,' ',y-x,' ',x-y,' ',0)\nelse:\n if y >= 0:\n \tprint(x-y,' ',0,' ',0,' ',y-x)\n else:\n \tprint(x+y,' ',0,' ',0,' ',x+y)\n", "x,y=map(int,input().split())\r\ns=abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print('0',s,s,'0')\r\nif x>0 and y<0:\r\n print('0',-s,s,0)\r\nif x<0 and y>0:\r\n print(-s,0,0,s)\r\nif x<0 and y<0:\r\n print(-s,0,0,-s)\r\n", "x, y = map(int, input().split())\nnext_x = abs(x) + abs(y)\nif x > 0:\n if y > 0: print(f\"0 { next_x } { next_x } 0\")\n else: print(f\"0 { -next_x } { next_x } 0\")\nelse:\n if y > 0: print(f\"{ -next_x } 0 0 { next_x }\")\n else: print(f\"{ -next_x } 0 0 { -next_x }\")\n \t \t\t \t \t \t\t \t\t \t", "a,b=map(int,input().split(' '))\r\nz=abs(a)+abs(b)\r\nif(a>0 and b>0):\r\n print('0',z,z,'0')\r\nelif(a<0 and b>0):\r\n print(-z,'0','0',z)\r\nelif(a>0 and b<0):\r\n print('0',-z,z,'0')\r\nelse:\r\n print(-z,'0','0',-z)", "x,y=[int(x) for x in input().split(' ')]\nif(x>0 and y>0):\n\tprint(0,x+y,x+y,0)\nelif(x<0 and y>0):\n\tprint(x-y,0,0,y-x)\nelif(x>0 and y<0):\n\tprint(0,y-x,x-y,0)\nelse:\n\tprint(x+y,0,0,x+y)", "from math import floor\r\ns = input()\r\nsl = s.split(' ')\r\nx = int(sl[0])\r\ny = int(sl[1])\r\ndis = abs(x)+abs(y)\r\n# if type(dis) is 'int':\r\nif x > 0:\r\n\tif y > 0:\r\n\t\tprint('0 {} {} 0'.format(dis, dis))\r\n\telse:\r\n\t\tprint('0 {} {} 0'.format(-dis, dis))\r\nelse:\r\n\tif y > 0:\r\n\t\tprint('{} 0 0 {}'.format(-dis, dis))\r\n\telse:\r\n\t\tprint('{} 0 0 {}'.format(-dis, -dis))\r\n# else:\r\n# \tif x > 0:\r\n# \t\tif y > 0:\r\n# \t\t\tprint('0 {} {} 0'.format(floor(dis)+1, floor(dis)+1))\r\n# \t\telse:\r\n# \t\t\tprint('0 {} {} 0'.format(floor(dis)+1, -(floor(dis)+1)))\r\n# \telse:\r\n# \t\tif y > 0:\r\n# \t\t\tprint('0 {} {} 0'.format(-(floor(dis)+1), floor(dis)+1))\r\n# \t\telse:\r\n# \t\t\tprint('0 {} {} 0'.format(-(floor(dis)+1), -(floor(dis)+1)))\r\n", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n c=x+y\r\n x1=0\r\n y1=c\r\n x2=c\r\n y2=0\r\nelif x<0 and y>0:\r\n c=y-x\r\n x1=-c\r\n y1=0\r\n x2=0\r\n y2=c\r\nelif x<0 and y<0:\r\n c=-y-x\r\n x1=-c\r\n y1=0\r\n x2=0\r\n y2=-c\r\nelse:\r\n c=x-y\r\n x1=0\r\n y1=-c\r\n x2=c\r\n y2=0\r\nprint(f\"{x1} {y1} {x2} {y2}\")", "x,y = map(int,input(\"\").split())\na = abs(x)+abs(y)\nif x <0:\n if y < 0:\n print(\"-{} 0 0 -{}\".format(a,a))\n else:\n print(\"-{} 0 0 {}\".format(a,a))\nelse:\n if y < 0:\n print(\"0 -{} {} 0\".format(a,a))\n else:\n print(\"0 {} {} 0\".format(a,a))\n\t \t \t\t \t\t \t \t \t \t\t\t\t\t \t \t", "x, y = map(int, input().split())\r\nc = abs(x) + abs(y)\r\nif x > 0:\r\n if y > 0: print(0, c, c, 0)\r\n else: print(0, -c, c, 0)\r\nelse:\r\n if y > 0: print(-c, 0, 0, c)\r\n else: print(-c, 0, 0, -c)", "x,y=input().split()\r\nx=int(x);y=int(y)\r\nz=abs(x)+abs(y)\r\nif x>0:\r\n l=[0,z*y//abs(y),z*x//abs(x),0]\r\n for i in l:\r\n print(i,end=\" \")\r\n print()\r\nelse:\r\n l=[z*x//abs(x),0,0,z*y//abs(y)]\r\n for i in l:\r\n print(i,end=\" \")\r\n print()", "x, y = list(map(int, input().split()))\r\nx1 = 0\r\ny2 = 0\r\nif x > 0:\r\n\tx2 = abs(x) + abs(y)\r\n\tif y > 0:\r\n\t\ty1 = x2\r\n\telse:\r\n\t\ty1 = -x2\r\nelse:\r\n\tx2 = -(abs(x) + abs(y))\r\n\tif y > 0:\r\n\t\ty1 = -x2\r\n\telse:\r\n\t\ty1 = x2\r\nif x1 < x2:\r\n\tprint(x1, y1, x2, y2)\r\nelse:\r\n\tprint(x2, y2, x1, y1)", "from math import copysign as s,fabs as f\r\na=list(map(int,input().split()))\r\nb=int(f(a[0])+f(a[1]))\r\nif a[0]<0:print(-b,0,0,int(s(b,a[1])))\r\nelse:print(0,int(s(b,a[1])),b,0)\r\n", "x,y=(int(i) for i in input().split())\r\nd=abs(x)+abs(y)\r\nif(x<0):\r\n x1=-d\r\nelse:\r\n x1=d\r\nif(y<0):\r\n y1=-d\r\nelse:\r\n y1=d\r\nif(x1<0):\r\n print(x1,0,0,y1)\r\nelse:\r\n print(0,y1,x1,0)", "x,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nb=a\r\nif x>0 and y>0:\r\n print(0,a,b,0)\r\nif x<0 and y<0:\r\n print(-1*b,0,0,-1*a)\r\nif x<0 and y>0:\r\n print(-1*a,0,0,b)\r\nif x>0 and y<0:\r\n print(0,-1*b,a,0)\r\n\r\n", "a, b = map(int, input().split())\r\nif a > 0 and b >= 0:\r\n print(0, a+b, a+b, 0)\r\nelif a < 0 and b > 0:\r\n print(-abs(a) - b, 0, 0, abs(a) + b)\r\nelif a > 0 and b < 0:\r\n print(0, -(a + abs(b)), a + abs(b), 0)\r\nelse:\r\n print(a + b, 0 , 0, a + b)", "x,y=map(int,input().split())\r\nif x>=0 and y>=0:\r\n c=x+y\r\n print(0,c,c,0)\r\nelif x>=0 and y<=0:\r\n c=y-x\r\n print(0,c,-c,0)\r\nelif x<=0 and y>=0:\r\n c=y-x\r\n print(-c,0,0,c)\r\nelse:\r\n c=y+x\r\n print(c,0,0,c)", "import math\r\n\r\n\r\nclass CodeforcesTask336ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.x_y = []\r\n\r\n def read_input(self):\r\n self.x_y = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n x1 = 0\r\n x2 = 0\r\n y1 = 0\r\n y2 = 0\r\n val = abs(self.x_y[0]) + abs(self.x_y[1])\r\n x1 = val * math.copysign(1, self.x_y[0])\r\n y2 = val * math.copysign(1, self.x_y[1])\r\n if x1 >= x2:\r\n swap = x2\r\n x2 = x1\r\n x1 = swap\r\n swap = y2\r\n y2 = y1\r\n y1 = swap\r\n self.result = \"{} {} {} {}\".format(int(x1), int(y1), int(x2), int(y2))\r\n\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask336ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "x, y = map(int, input().split())\r\na = abs(x) + abs(y)\r\nif x > 0:\r\n print(0, a * y // abs(y), a, 0)\r\nelse:\r\n print(-a, 0, 0, a * y // abs(y))\r\n", "def bear_tri(x,y):\n \n q = abs(x)+abs(y)\n\n if x>0 and y>0:\n print(0,q,q,0)\n elif x>0:\n print(0,-q,q,0)\n elif y>0:\n print(-q,0,0,q)\n else:\n print(-q,0,0,-q,)\n\nx, y = [x for x in list(map(int, input().split()))]\n\nbear_tri(x,y)", "l=list(map(int,input().split()))\r\nx=l[0]\r\ny=l[1]\r\nif (x>0 and y>0):\r\n print(\"0 \",x+y,\" \",x+y,\" 0\")\r\nelif(x<0 and y<0):\r\n print(x+y,\" 0 0 \",x+y)\r\nelif(x<0 and y>0):\r\n print(x-y,\" 0 0 \",y-x) \r\nelse:\r\n print(\"0 \",y-x,\" \",x-y,\" 0\")\r\n \r\n \r\n \r\n ", "a,b = map(int,input().split())\r\nval = abs(a) +abs(b)\r\np =val*a//abs(a) \r\nq=0\r\nx=0\r\ny= val* b//abs(b)\r\nif(p>0 ):\r\n print(q,y,p,x) \r\nelse:\r\n print(p,q,x,y)", "x,y=map(int,input().split())\r\np=abs(x)+abs(y)\r\nx1=0\r\ny2=0\r\nif y>=0:\r\n y1=p\r\nelse:\r\n y1=-p\r\nif x>=0:\r\n x2=p\r\nelse:\r\n x2=-p\r\nif x1<x2:\r\n print(x1,y1,x2,y2)\r\nelse:\r\n print(x2,y2,x1,y1)\r\n \r\n", "\r\nif __name__ == \"__main__\":\r\n \r\n point = list(map(int , input().rstrip().split()))\r\n x = point[0]\r\n y = point[1]\r\n if x > 0 and y > 0:\r\n temp_x = x + y\r\n temp_y = y + x\r\n elif x < 0 and y > 0:\r\n temp_x = x - y\r\n temp_y = y - x\r\n elif x < 0 and y < 0:\r\n temp_x = x + y\r\n temp_y = y + x\r\n else:\r\n temp_x = x - y\r\n temp_y = y - x\r\n\r\n if temp_x < 0:\r\n x1 , y1 = temp_x , 0\r\n x2 , y2 = 0 , temp_y\r\n else:\r\n x2 , y2 = temp_x , 0\r\n x1 , y1 = 0 , temp_y\r\n print (x1 , y1 , x2 , y2)\r\n", "x , y = [int(x) for x in input().split()]\r\na = int(y*(abs(x)+abs(y))/abs(y))\r\nb = int(x*(abs(x)+abs(y))/abs(x))\r\nif (b>0):\r\n print(0,a,b,0)\r\nelse : \r\n print(b,0,0,a)", "x,y=map(int,input().split())\r\nif x*y>0:\r\n l=[[x+y,0],[0,x+y]]\r\nelse:\r\n l=[[x-y,0],[0,y-x]]\r\nl.sort()\r\nans=[l[0][0],l[0][1],l[1][0],l[1][1]]\r\nprint(*ans)", "x, y = list(map(int, input().split()))\r\nans = abs(x) + abs(y)\r\nif (x > 0 and y > 0):\r\n print(0, ans, ans, 0)\r\nelif (x > 0 and y < 0):\r\n print(0, -ans, ans, 0)\r\nelif (x < 0 and y > 0):\r\n print(-ans, 0, 0, ans)\r\nelse:\r\n print(-ans, 0, 0, -ans)", "a, b = tuple(map(int, input().split()))\r\nres = abs(a) + abs(b)\r\nx, y = (a//abs(a) * res, b//abs(b) * res)\r\nif x < 0:\r\n print(x, 0, 0, y)\r\nelse:\r\n print(0, y, x, 0)", "x,y = map(int,input().split())\r\ncord = abs(x)+abs(y)\r\nif x>0:\r\n if y>0:\r\n print(0,cord,cord,0)\r\n else:\r\n print(0,-cord,cord,0)\r\nelse:\r\n if y>0:\r\n print(-cord,0,0,cord)\r\n else:\r\n print(-cord,0,0,-cord)", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(x, y):\r\n s = abs(x) + abs(y)\r\n\r\n if x > 0 and y > 0:\r\n return f\"{0} {s} {s} {0}\"\r\n elif x < 0 and y > 0:\r\n return f\"{-s} {0} {0} {s}\"\r\n elif x < 0 and y < 0:\r\n return f\"{-s} {0} {0} {-s}\"\r\n else:\r\n return f\"{0} {-s} {s} {0}\"\r\n\r\n\r\nx, y = read_numeric_list()\r\nprint(solve(x, y))\r\n", "x,y = map(int,input().split())\r\nz = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print(0,z,z,0)\r\nelif x<0 and y>0:\r\n print(-z,0,0,z)\r\nelif x<0 and y<0:\r\n print(-z,0,0,-z)\r\nelif x>0 and y<0:\r\n print(0,-z,z,0)", "x, y = map(int, input().split())\r\nif x * y > 0:\r\n k = y + x\r\n if k > 0:\r\n print(0, k, k, 0)\r\n else:\r\n print(k, 0, 0, k)\r\nelse:\r\n k = y - x\r\n if k > 0:\r\n print(-k, 0, 0, k)\r\n else:\r\n print(0, k, -k, 0)", "x,y=map(int,input().split())\r\ntp=abs(x)+abs(y)\r\nprint('0 %d %d 0'%(tp if y>0 else -tp,tp)) if x>0 else print('%d 0 0 %d'%(-tp,tp if y>0 else -tp))", "x, y = map(int, input().split())\ns = abs(x) + abs(y)\nif x < 0 and y < 0: print('-%d 0 0 -%d' % (s, s))\nif x < 0 and y > 0: print('-%d 0 0 %d' % (s, s))\nif x > 0 and y < 0: print('0 -%d %d 0' % (s, s))\nif x > 0 and y > 0: print('0 %d %d 0' % (s, s))\n\n", "x,y=map(int,input().split(' '))\r\nz=int( (x**2)**.5 )+int( (y**2)**.5 )\r\nif(x>0 and y>0): print(0,z,z,0)\r\nif(x<0 and y>0): print(-z,0,0,z)\r\nif(x<0 and y<0): print(-z,0,0,-z)\r\nif(x>0 and y<0): print(0,-z,z,0)", "x, y = map(int, input().split())\r\nm = -1 if (x > 0 and y > 0) or (x < 0 and y < 0) else 1\r\n\r\n\r\na = (0, -m * x + y)\r\nb = (x - m * y, 0)\r\nprint(*a, *b) if a[0] < b[0] else print(*b, *a)", "a, b = map(int, input().split())\nres = abs(a) + abs(b)\nx, y = a // abs(a) * res, b // abs(b) * res\nif x < 0:\n print(x, 0, 0, y)\nelse:\n print(0, y, x, 0)\n", "a,b=map(int,input().split())\r\nv=abs(a)+abs(b)\r\np=[0,v*(-1)**(b<0)]\r\nq=[v*(-1)**(a<0),0]\r\nif a<0:p,q=q,p\r\nprint(*p,*q)", "#################\r\n#Author:Abduaziz#\r\n#################\r\ndef sng(x):\r\n if x < 0:\r\n return -1\r\n return 1\r\nx, y = map(int, input().split())\r\nsx = sng(x)\r\nsy = sng(y)\r\nv = abs(x) + abs(y)\r\na1 = [v * sx, 0]\r\na2 = [0, v * sy]\r\nif a1[0] > a2[0]:\r\n a2, a1 = a1, a2\r\na1 += a2\r\nprint(*a1)\r\n", "x,y=list(map(int,input().split()))\r\nx1,x2,y1,y2=0,0,0,0\r\nif x<0:\r\n if y<0:\r\n x1=x+y\r\n y2=y+x\r\n else:\r\n x1=x-y\r\n y2=y-x\r\nelse:\r\n if y<0:\r\n x2=x-y\r\n y1=y-x\r\n else:\r\n x2=x+y\r\n y1=y+x\r\nprint(x1,y1,x2,y2)\r\n", "a,b=list(map(int,input().split()))\r\nif a>0:\r\n\tprint(0,(abs(a)+abs(b))*(1-(2*(b<0))),(abs(a)+abs(b)),0 )\r\nelse:\r\n\tprint(-(abs(a)+abs(b)),0,0,(abs(a)+abs(b))*(1-(2*(b<0))))\r\n\t", "x,y=list(map(int,input().split()))\r\nif x>0:\r\n signx=1\r\nelse:\r\n signx=-1\r\nif y>0:\r\n signy=1\r\nelse:\r\n signy=-1\r\n\r\nval=abs(x)+abs(y)\r\nx1,x2,y1,y2=val*signx,0,0,val*signy\r\nif x1>x2:\r\n print(x2,y2,x1,y1)\r\nelse:\r\n print(x1,y1,x2,y2)\r\n", "x,y = map(int,input().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n print(x-y,0,0,(-x)+y)\r\nelif x>0 and y<0:\r\n print(0,y-x,(-y)+x,0)\r\nelse:\r\n print(x+y,0,0,x+y)", "currX, currY = (int(x) for x in input().split())\r\n\r\nx = abs(currX)\r\ny = abs(currY)\r\n\r\ny1 = int( x + y )\r\nx1 = y1\r\narea = x1 * x1\r\nnewA = area\r\n\r\nwhile newA <= area:\r\n x1, y1 = x1 + 1, x1 + 1\r\n area = newA\r\n newA = x1 * x1\r\n\r\n\r\nx1 = int((x1-1) * (currX/abs(currX)))\r\ny1 = int((y1-1) * (currY/abs(currY)))\r\n\r\nif x1 < 0 :\r\n print(str(x1) + ' 0 0 ' + str(y1))\r\nelse:\r\n print('0 ' + str(y1) + ' ' + str(x1) + ' 0')", "a, b = map(int, input().split())\r\nmd = abs(a) + abs(b)\r\nsa = [-1,1][a>0]\r\nsb = [-1,1][b>0]\r\nif sa < 0:\r\n print(f'{md * sa} {0} {0} {md * sb}')\r\nelse:\r\n print(f'{0} {md * sb} {md * sa} {0}')", "I=[int(i) for i in input().split()]\r\nx, y =I[0], I[1]\r\nans=int(abs(x)+abs(y))\r\nA, C = [0,0], [0,0]\r\nif x>0 and y>0:\r\n A[1], C[0] = ans, ans\r\nif x>0 and y<0:\r\n A[1], C[0] = -ans, ans\r\nif x<0 and y>0:\r\n A[0], C[1] = -ans, ans\r\nif x<0 and y<0:\r\n A[0], C[1] = -ans, -ans\r\nprint(str(A[0])+' '+str(A[1])+' '+str(C[0])+' '+str(C[1]))", "from sys import stdin,stdout\r\n\r\nx,y=map(int,stdin.readline().split())\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,0-(x+abs(y)),(x+abs(y)),0)\r\nelif x<0 and y>0:\r\n print(0-(abs(x)+y),0,0,(abs(x)+y))\r\nelse:\r\n print(0-(abs(x)+abs(y)),0,0,0-(abs(x)+abs(y)))", "\r\nx, y = map(int, input().split())\r\n\r\naa = abs(x) + abs(y)\r\n\r\nif x < 0:\r\n\tif y < 0:\r\n\t\tprint(-aa, 0, 0, -aa)\r\n\telse:\r\n\t\tprint(-aa, 0, 0, aa)\r\nelse:\r\n\tif y < 0:\r\n\t\tprint(0, -aa, aa, 0)\r\n\telse:\r\n\t\tprint(0, aa, aa, 0)", "x,y = map(int,input().split())\r\n\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x < 0 and y > 0:\r\n print(-y + x, 0, 0,-x + y)\r\nelif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\nelse:\r\n print(x + y, 0,0, x + y)\r\n", "x, y = map(int, input().split())\r\na, b = 0, 0\r\nif x > 0:\r\n if y > 0:\r\n a = x+y\r\n else:\r\n a = x + -1*y\r\nelse:\r\n if y > 0:\r\n a = x+ -1*y\r\n else:\r\n a = x + y\r\nif y > 0:\r\n if x > 0:\r\n b = x+y\r\n else:\r\n b = y + -1*x\r\nelse:\r\n if x > 0:\r\n b = -1*x + y\r\n else:\r\n b = x + y\r\nif a < 0:\r\n print(a, 0, 0, b)\r\nelse:\r\n print(0, b, a, 0)", "curX, curY = (int(x) for x in input().split())\r\n\r\nx = abs(curX)\r\ny = abs(curY)\r\n\r\ny1 = int( x + y )\r\nx1 = y1\r\narea = x1 * x1\r\nnewA = area\r\n\r\nwhile newA <= area:\r\n x1, y1 = x1 + 1, x1 + 1\r\n area = newA\r\n newA = x1 * x1\r\n\r\n\r\nx1 = int((x1-1) * (curX / abs(curX)))\r\ny1 = int((y1-1) * (curY / abs(curY)))\r\n\r\nif x1 < 0 :\r\n print(str(x1) + ' 0 0 ' + str(y1))\r\nelse:\r\n print('0 ' + str(y1) + ' ' + str(x1) + ' 0')\r\n\r\n\r\n", "\r\nx, y = map(int, input().split())\r\n\r\naa = abs(x) + abs(y)\r\n'''\r\nif x < 0:\r\n\tif y < 0:\r\n\t\tprint(-aa, 0, 0, -aa)\r\n\telse:\r\n\t\tprint(-aa, 0, 0, aa)\r\nelse:\r\n\tif y < 0:\r\n\t\tprint(0, -aa, aa, 0)\r\n\telse:\r\n\t\tprint(0, aa, aa, 0)\r\n'''\r\n\r\np = [[aa * (x // abs(x)), 0], [0, aa * (y // abs(y))]]\r\np.sort()\r\nfor i in p:\r\n\tprint(*i, end = ' ')", "x, y = [int(s) for s in input().split(' ')]\r\nans = [((abs(x) // x) * (abs(x) + abs(y)), 0), (0, (abs(y) // y) * (abs(x) + abs(y)))]\r\nans.sort(key=lambda x:x[0])\r\nans = ans[0] + ans[1]\r\nprint(*ans)", "a,b=input().split()\r\nx=int(a)\r\ny=int(b)\r\nif x>0 and y>0:\r\n print(0,x+y,x+y,0)\r\nelif x>0 and y<0:\r\n print(0,-(abs(y)+x),(abs(y)+x),0)\r\nelif x<0 and y>0:\r\n print(-(abs(x)+y),0,0,(abs(x)+y))\r\nelif x<0 and y<0:\r\n print(x+y,0,0,x+y)\r\n\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nx,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nv=[-a,a][y>0]\r\nprint(*((-a,0,0,v)if x<0 else(0,v,a,0)))\r\n ", "a,b = map(int,input().split())\nx1,y2=0,0\nx1 = abs(a)+abs(b)\ny2 = x1\nif a<0:\n\tx1 = -1*x1\nif b<0:\n\ty2= -1*y2\n\nif x1>0:\n\tprint(0,y2,x1,0)\nelse:\n\tprint(x1,0,0,y2)", "x,y = map(int,input().split())\r\n\r\nl = abs(x)+abs(y)\r\n\r\nif y>0:\r\n y1 = l\r\nelse :\r\n y1 = -l\r\n\r\nif(x<0):\r\n print(-l,0,0,y1)\r\nelse:\r\n print(0,y1,l,0)", "a,b=map(int,input().split())\r\nl=[[(a//abs(a))*(abs(a)+abs(b)),0],[0,(b//abs(b))*(abs(a)+abs(b))]]\r\nl.sort()\r\nfor j in l:\r\n for i in j:\r\n print(i,end=\" \")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 8 16:30:08 2020\n\n@author: anirudhasarmatumuluri\n\"\"\"\n\n\ndef main():\n x,y = [int(x) for x in input().split()]\n quarter = 0\n if x>0 and y>0:\n quarter = 1\n elif x<0 and y>0:\n quarter = 2\n elif x<0 and y<0:\n quarter = 3\n else:\n quarter = 4\n x = abs(x)\n y = abs(y)\n \n x1 = 0\n y1 = x+y\n \n x2 = x+y\n y2 = 0\n \n if quarter == 2:\n x2 = (-x2)\n elif quarter== 3:\n x2=(-x2)\n y1 = (-y1)\n elif quarter==4:\n y1 = (-y1)\n \n if x1>=x2:\n x1,x2 = x2,x1\n y1,y2 = y2,y1\n \n print(x1,y1,x2,y2)\n \n \n\n\n\n\nmain()", "x,y=map(int,input().split())\r\nx1,x2,y1,y2=0,0,0,0\r\nif x<0:\r\n x1=x-abs(y)\r\nelse:\r\n x1=x+abs(y)\r\nif y<0:\r\n y2=y-abs(x)\r\nelse:\r\n y2=y+abs(x)\r\nif x1>x2:\r\n x1,x2=x2,x1\r\n y1,y2=y2,y1\r\nprint(x1,end=\" \")\r\nprint(y1,end=\" \")\r\nprint(x2,end=\" \")\r\nprint(y2,)", "x, y = [int(x) for x in input().split()]\nd = abs(x) + abs(y)\nans = []\nif x < 0:\n\tans += [-d, 0]\n\tif y < 0:\n\t\tans += [0, -d]\n\telse:\n\t\tans += [0, d]\nelse:\n\tans += [0]\n\tif y < 0:\n\t\tans += [-d]\n\telse:\n\t\tans += [d]\n\tans += [d, 0]\nprint(' '.join(str(x) for x in ans))\n", "x,y=map(int,input().split())\r\nsum1=abs(x)+abs(y)\r\nif(y>0):\r\n if(x<0):\r\n print(-1*(sum1),0,0,sum1)\r\n else:\r\n print(0,sum1,sum1,0)\r\nelse:\r\n if(x<0):\r\n print(-1*(sum1),0,0,-1*(sum1))\r\n else:\r\n print(0,-1*(sum1),sum1,0)", "x, y = map(int, input().split())\nif x > 0:\n if y > 0:\n print(0, x + y, x + y, 0)\n else:\n print(0, y - x, x - y, 0)\nelse:\n if y > 0:\n print(x - y, 0, 0, y - x)\n else:\n print(x + y, 0, 0, x + y)\n", "a,b = map(int, input().split())\r\nm = abs(a)+abs(b)\r\nif b<0:\r\n if a>=0:\r\n print('{} {} {} {}'.format(0,-m,m,0))\r\n if a<0:\r\n print('{} {} {} {}'.format(-m,0,0,-m))\r\nif b>=0:\r\n if a>=0:\r\n print('{} {} {} {}'.format(0,m,m,0))\r\n if a<0:\r\n print('{} {} {} {}'.format(-m,0,0,m))\r\n\r\n\r\n", "def main():\r\n x, y = list(map(int, input().split()))\r\n if x >= 0 and y >= 0:\r\n x1, x2, y1, y2 = 0, x+y, x+y, 0\r\n elif x <= 0 and y >= 0:\r\n x1, x2, y1, y2 = x-y, 0, 0, -(x-y)\r\n elif x <= 0 and y <= 0:\r\n x1, x2, y1, y2 = x+y, 0, 0, x+y\r\n elif x >= 0 and y <= 0:\r\n x1, x2, y1, y2 = 0, x - y, -(x-y), 0\r\n print(x1, y1, x2, y2)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x, y = [int(x) for x in input().split()]\nnewx = x * (abs(x) + abs(y)) / abs(x)\nnewy = y * (abs(x) + abs(y)) / abs(y)\nif newx <= 0:\n print(\"{} 0 0 {}\".format(int(newx), int(newy)))\nelse:\n print(\"0 {} {} 0\".format(int(newy), int(newx)))\n", "import math\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nINF = float('inf')\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a%b\r\n\treturn a\r\n\r\n\r\ndef primeFactor(n):\r\n\tif n % 2 == 0:\r\n\t\treturn 2\r\n\ti = 3\r\n\twhile (i ** 2) <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn i \r\n\t\ti += 1\r\n\treturn n\r\n\r\ndef main():\r\n\tx, y = map(int, input().split())\r\n\tax = ay = abs(x) + abs(y)\r\n\tif x < 0: ax *= -1\r\n\tif y < 0: ay *= -1\r\n\tans = sorted([[ax, 0], [0, ay]])\r\n\tfor x, y in ans:\r\n\t\tprint(x, y, end=\" \")\r\n\tprint()\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\t# t = int(input())\r\n\tt = 1\r\n\tfor _ in range(t):\r\n\t\tmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "while(1):\r\n try:\r\n x,y=map(int,input().split())\r\n if x>0 and y>0:\r\n x1,y1,x2,y2=0,x+y,x+y,0\r\n elif x<0 and y>0:\r\n x1,y1,x2,y2=-(-x+y),0,0,-x+y\r\n elif x<0 and y<0:\r\n x1,y1,x2,y2=-(-x-y),0,0,-(-x-y)\r\n else:\r\n x1,y1,x2,y2=0,-(x-y),x-y,0\r\n print(x1,y1,x2,y2,end=' ')\r\n except EOFError:\r\n break\r\n ", "x,y=map(int,input().split())\r\nif ( x>0 and y>0 ) or (x<0 and y<0):\r\n\tx1=x+y\r\n\ty1=0\r\n\tx2=0\r\n\ty2=x+y\r\nelse:\r\n\tx1=-(y-x)\r\n\ty1=0\r\n\ty2=(y-x)\r\n\tx2=0\r\nif x1<x2:\r\n\tprint(x1,y1,x2,y2)\r\nelse:\r\n\tprint(x2,y2,x1,y1)", "x, y = map(int, input().split())\nxy = abs(x) + abs(y)\nx1 = xy * (-1 if x < 0 else 1)\ny1 = xy * (-1 if y < 0 else 1)\n\nif x > 0:\n print(0, y1, x1, 0)\nelse:\n print(x1, 0, 0, y1)\n", "x0,y0=map(int,input().split())\n\nk=abs(x0)+abs(y0)\n\ny=y0 //abs(y0)\n\nx=x0//abs(x0)\n\nt=[(x*k,0),(0,y*k)]\n\nt.sort()\n\nfor i,j in t:\n\n print(i,j,end=\" \")\n\n", "x,y=map(int,input().strip().split())\r\nif x>0 and y>0:\r\n \r\n print(\"0\",(x+y),(x+y),\"0\")\r\n \r\nelif x<0 and y>0:\r\n \r\n z=-(x) \r\n q=-(z+y)\r\n print(q,\"0\",\"0\",(z+y))\r\n \r\n\r\nelif x>0 and y<0:\r\n z=-(y)\r\n q=-(z+x)\r\n print(\"0\",q,(z+x),\"0\")\r\n \r\nelif x<0 and y<0:\r\n s=-(x)\r\n t=-(y)\r\n u=-(s+t)\r\n \r\n print(u,\"0\",\"0\",u)\r\n \r\n \r\n ", "x,y=map(int,input().split())\r\nif(x*y>0):\r\n\tslope=-1\r\nelse:\r\n\tslope=1\r\ny1=y-slope*x\r\nx1=0\r\ny2=0\r\nx2=(x-y//slope)\r\nif(x1>x2):\r\n\tprint(x2,y2,x1,y1)\r\nelse:\r\n\tprint(x1,y1,x2,y2)", "ip = input()\r\nipList = ip.split(\" \")\r\nx = int(ipList[0])\r\ny = int(ipList[1])\r\n\r\nif x > -1 and y > -1:\r\n print(0,x+y,x+y,0)\r\nelif x < 0 and y > 0:\r\n print(x-y,0,0,y-x)\r\nelif x < 0 and y < 0:\r\n print(x+y,0,0,x+y)\r\nelse:\r\n print(0,y-x,x-y,0)", "x,y=map(int, input().split())\r\nt=abs(x)+abs(y)\r\nsign=y//abs(y)\r\nif x>0:\r\n print(0,sign*t, t,0)\r\nelse:\r\n print(-t,0, 0,sign*t)\r\n", "a, b = [int(x) for x in input().split()]\nxcoord = (abs(a)+abs(b))*a/abs(a)\nycoord = (abs(a)+abs(b))*b/abs(b)\nif(xcoord < 0):\n\tprint(\"%d %d %d %d\"%(xcoord, 0, 0, ycoord))\nelse:\n\tprint(\"%d %d %d %d\"%(0, ycoord, xcoord, 0))\n", "def Abs(a):\r\n if a<0:\r\n return -a\r\n return a\r\n\r\n\r\ndef main():\r\n x,y=[int(a) for a in input().split(' ')]\r\n val=Abs(x)+Abs(y)\r\n if(x<0 and y>0):\r\n print(-val,'0','0',val)\r\n if(x<0 and y<0):\r\n print(-val,'0','0',-val)\r\n if(x>0 and y>0):\r\n print('0',val,val,'0')\r\n if(x>0 and y<0):\r\n print('0',-val,val,'0')\r\n \r\nmain()", "x,y = map(int,input().split())\r\ns = abs(x) + abs(y)\r\nif x >= 0 :\r\n x1 = 0\r\n x2 = s\r\n if y >= 0:\r\n y1 = s\r\n y2 = 0\r\n else:\r\n y1 = -s\r\n y2 = 0\r\nelif x < 0 :\r\n x1 = -s\r\n x2 = 0\r\n if y >= 0 :\r\n y1 = 0\r\n y2 = s\r\n else :\r\n y1 = 0\r\n y2 = -s\r\nprint(x1,y1,x2,y2)\r\n", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n (x0, y0) = map(int, input().split())\r\n\r\n if x0 * y0 > 0:\r\n b = x0 + y0\r\n\r\n if b > 0:\r\n print('0 %d %d 0' % (b, b))\r\n else:\r\n print('%d 0 0 %d' % (b, b))\r\n else:\r\n b = y0 - x0\r\n\r\n if b < 0:\r\n print('0 %d %d 0' % (b, -b))\r\n else:\r\n print('%d 0 0 %d' % (-b, b))\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = map(int, input().split())\r\nz = abs(x) + abs(y)\r\nans = []\r\ns = 1\r\nif x < 0:\r\n s = -1\r\nans.append((s * z, 0))\r\ns = 1\r\nif y < 0:\r\n s = -1\r\nans.append((0, s * z))\r\nans.sort()\r\nprint(ans[0][0], ans[0][1], ans[1][0], ans[1][1])\r\n", "n,m=map(int,input().split())\ns=abs(n)+abs(m)\nans=[]\nif n<0 and m>0:\n\tprint(-s,0,0,s)\nelif n<0 and m<0:\n\tprint(-s,0,0,-s)\nelif n>0 and m<0:\n\tprint(0,-s,s,0)\nelse:\n\tprint(0,s,s,0)\n", "x,y = map(int, input().split())\r\nn = abs(x) + abs(y)\r\ny1 , x2 , x1, y2 = 0,0 , None, None\r\nif x > 0 and y > 0 :\r\n x2 = n\r\n x1 = 0\r\n y1 = n\r\n y2 = 0\r\nelif x > 0 and y < 0:\r\n x1 = 0\r\n x2 = n\r\n y1 = -n\r\n y2 = 0\r\nelif x < 0 and y > 0:\r\n x1 = -n\r\n x2 = 0\r\n y1 = 0\r\n y2 = n\r\nelif x < 0 and y < 0:\r\n x1 = -n\r\n x2 = 0\r\n y1 = 0\r\n y2 = -n\r\n\r\nprint(x1, y1, x2, y2) \r\n", "x,y = [int(num) for num in input().split(' ')]\nyCoord = (abs(x)+abs(y)) * int(y/abs(y))\ncoord1 = (0,yCoord)\nxCoord = (abs(x)+abs(y)) * int(x/abs(x))\ncoord2 = (xCoord,0)\nif coord1[0] < coord2[0]:\n print(coord1[0],end=' ')\n print(coord1[1],end=' ')\n print(coord2[0],end=' ')\n print(coord2[1])\nelse:\n print(coord2[0],end=' ')\n print(coord2[1],end=' ')\n print(coord1[0],end=' ')\n print(coord1[1])\n ", "x,y = map(int,input().split())\r\n\r\nc = abs(x)+abs(y)\r\n\r\n\r\nif x>0 and y>0:\r\n print(0,c,c,0)\r\n\r\nif x<0 and y>0:\r\n print(-c,0,0,c)\r\n\r\nif x>0 and y<0:\r\n print(0,-c,c,0)\r\n\r\nif x<0 and y<0:\r\n print(-c,0,0,-c)", "x,y=map(int,input().split())\r\na=abs(x);b=abs(y)\r\nif x>0 and y>0:\r\n print(0,a+b,a+b,0)\r\nelif x<0 and y>0:\r\n print(-(a+b),0,0,a+b)\r\nelif x<0 and y<0:\r\n print(-(a+b),0,0,-(a+b))\r\nelif x>0 and y<0:\r\n print(0,-(a+b),a+b,0)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nx, y = map(int, input().split())\r\nside = abs(x)+abs(y)\r\nif x > 0 and y > 0:\r\n ans = [0, side, side, 0]\r\nelif x > 0 and y < 0:\r\n ans = [0, -side, side, 0]\r\nelif x < 0 and y > 0:\r\n ans = [-side, 0, 0, side]\r\nelse:\r\n ans = [-side, 0, 0, -side]\r\n\r\nprint(*ans)\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/336/A\nx,y=map(int,input().split())\nt=abs(x)+abs(y)\nif x>0 and y>0:\n\tprint(0,t,t,0)\nelif x<0 and y>0:\n\tprint(-t,0,0,t)\nelif x<0 and y<0:\n\tprint(-t,0,0,-t)\nelse:\n\tprint(0,-t,t,0)\n", "a,b=map(int,input().split())\r\nif(a>0 and b>0):\r\n print(\"0\",a+b,b+a,\"0\")\r\nelif(a>0 and b<0):\r\n print(\"0\",b-a,a-b,\"0\")\r\nelif(a<0 and b<0):\r\n print(a+b,\"0 0\",b+a)\r\nelif(a<0 and b>0):\r\n print(a-b,\"0 0\",b-a)\r\n \r\n \r\n ", "x,y=map(int, input().split())\r\nt=abs(x)+abs(y)\r\nif x>0:\r\n if y>0:\r\n x1,y1,x2,y2=0,t,t,0\r\n else:\r\n x1,y1,x2,y2=0,-t,t,0\r\nelse:\r\n if y>0:\r\n x1,y1,x2,y2=-t,0,0,t\r\n else:\r\n x1,y1,x2,y2=-t,0,0,-t\r\nprint(x1,y1,x2,y2)\r\n", "x, y = input().split()\r\nx, y = int(x), int(y)\r\nif x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\nelif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\nelif x < 0 and y > 0:\r\n print(x - y, 0, 0, y - x)\r\nelif x < 0 and y < 0:\r\n print(x + y, 0, 0, x + y)\r\n", "def main():\r\n x, y = map(int, input().split())\r\n if x > 0 and y > 0:\r\n print(0, x + y, x + y, 0)\r\n elif x < 0 and y > 0:\r\n print(x - y, 0, 0, y - x)\r\n elif x > 0 and y < 0:\r\n print(0, y - x, x - y, 0)\r\n else:\r\n print(y + x, 0, 0, y + x)\r\n\r\nmain()", "x,y=map(int,input().split())\r\na1=abs(x)+abs(y)\r\na2=a1\r\nif y<0:\r\n a2=-a1\r\nif x>=0:\r\n ans='0 '+str(a2)+' '+str(a1)+' 0'\r\nelse:\r\n ans=str(-a1)+' 0 '+'0 '+str(a2)\r\nprint(ans)", "x,y=map(int,input().split())\r\nif x>0 and y>0:\r\n print('0',(abs(x)+abs(y)),(abs(x)+abs(y)),'0')\r\nelif x>0 and y<0:\r\n print('0', -(abs(x) + abs(y)), (abs(x)+abs(y)), '0')\r\nelif x<0 and y>0:\r\n print(-(abs(x) + abs(y)),'0','0',(abs(x)+abs(y)))\r\nelse:\r\n print(-(abs(x) + abs(y)), '0', '0', -(abs(x) + abs(y)))\r\n\r\n", "a,b=map(int,input().split())\r\ntemp=abs(a)+abs(b)\r\nif a>0 and b>0:print(0,temp,temp,0)\r\nelif a>0 and b<0:print(0,-1*temp,temp,0)\r\nelif a<0 and b>0:print(-1*temp,0,0,temp)\r\nelse:print(-1*temp,0,0,-1*temp)\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nx, y = In()\r\nif x > 0 :\r\n if y > 0:\r\n print(0, (x+y), (x+y), 0)\r\n else:\r\n print(0, (-x+y), (x-y), 0)\r\nelse:\r\n if y > 0:\r\n print((x-y), 0, 0, (-x+y))\r\n else:\r\n print((x+y), 0, 0, (x+y))", "x,y=map(int,input().split())\r\n\r\nw = abs(x)+abs(y)\r\n\r\nif x<0:\r\n\tif y<0:\r\n\t\tprint(-w,0,0,-w)\r\n\telse:\r\n\t\tprint(-w,0,0,w)\r\nelse:\r\n\tif y<0:\r\n\t\tprint(0,-w,w,0)\r\n\telse:\r\n\t\tprint(0,w,w,0)", "x, y = map(int, input().split())\r\nans = abs(x) + abs(y)\r\nansx, ansy = ans, ans\r\nif x < 0:\r\n ansx = -ans\r\nif y < 0:\r\n ansy = -ans\r\nif ansx < 0:\r\n print(ansx, 0, 0, ansy)\r\nelse:\r\n print(0, ansy, ansx, 0)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Vasily_the_Bear_and_Triangle():\r\n x,y = invr()\r\n\r\n x_firstQuad = abs(x)\r\n y_firstQuad = abs(y)\r\n a = (x_firstQuad+y_firstQuad)\r\n\r\n if x > 0 and y > 0:\r\n x1 = 0 \r\n y1 = a \r\n x2 = a\r\n y2 = 0\r\n elif x < 0 and y > 0:\r\n x1 = -a\r\n y1 = 0\r\n x2 = 0 \r\n y2 = a \r\n elif x < 0 and y < 0:\r\n x1 = -a\r\n y1 = 0\r\n x2 = 0\r\n y2 = -a \r\n else:\r\n x1 = 0\r\n y1 = -a\r\n x2 = a\r\n y2 = 0\r\n \r\n print(str(x1) + ' ' + str(y1) + ' ' + str(x2) + ' ' + str(y2))\r\n return\r\n\r\n\r\nVasily_the_Bear_and_Triangle()", "def process():\r\n x, y = list(map(int, input().split()))\r\n \r\n val = abs(x) + abs(y)\r\n x1 = (-1 if x < 0 else 1) * val\r\n y1 = 0\r\n \r\n x2 = 0\r\n y2 = (-1 if y < 0 else 1) * val\r\n \r\n if x1 > x2:\r\n x1, y1, x2, y2 = x2, y2, x1, y1\r\n \r\n print(f'{x1} {y1} {x2} {y2}')\r\n \r\nprocess()", "m,n=[int(x) for x in input().split()]\r\nif m>0:\r\n if n>0:\r\n print(0,m+n,m+n,0)\r\n else:\r\n print(0,n-m,m-n,0)\r\nelse:\r\n if n>0:\r\n print(m-n,0,0,n-m)\r\n else:\r\n print(m+n,0,0,m+n)", "# Codeforces 195, div. 2\r\n# Task A\r\n\r\ndef solve(x, y):\r\n t = abs(x) + abs(y)\r\n if x > 0 and y > 0:\r\n return 0, t, t, 0\r\n elif x > 0 and y < 0:\r\n return 0, -t, t, 0\r\n elif x < 0 and y > 0:\r\n return -t, 0, 0, t\r\n else:\r\n return -t, 0, 0, -t\r\n\r\ndef test():\r\n assert solve(10, 5) == (0, 15, 15, 0)\r\n assert solve(-10, 5) == (-15, 0, 0, 15)\r\n print(\"test passes\")\r\n\r\ntmp = input()\r\ntmp = list(map(int, tmp.split()))\r\nfor i in solve(tmp[0], tmp[1]):\r\n print(i, end=' ')\r\n \r\n\r\n", "x,y=list(map(int,input().split()))\r\np=abs(x)+abs(y)\r\nt=[int(p*x/abs(x)),0]\r\nw=[0,int(p*y/abs(y))]\r\nprint(*min(t,w),*max(t,w))", "x,y = map(int,input().split())\r\nif(x>0 and y>0):\r\n print(0,x+y,x+y,0)\r\nelif(x>0 and y<0):\r\n print(0,-1*(x+abs(y)),x+abs(y),0)\r\nelif(x<0 and y>0):\r\n print(-1*(y+abs(x)),0,0,y+abs(x))\r\nelse:\r\n z = x+y\r\n print(z,0,0,z)", "x,y = map(int,input().split())\r\nz = abs(x)+abs(y)\r\nif x>0 and y>0: print(0,z,z,0)\r\nelif x>0 and y<0: print(0,-z,z,0)\r\nelif x<0 and y>0: print(-z,0,0,z)\r\nelif x<0 and y<0: print(-z,0,0,-z)", "x,y=map(int,input().split())\r\nm=0\r\nif (x>0 and y>0) or (x<0 and y<0):\r\n m=-1\r\nelse:\r\n m=1\r\n\r\na=-(y)//m + x\r\nb=-m*x + y\r\n\r\nif a<0:\r\n print(a,0,0,b)\r\nelse:\r\n print(0,b,a,0)", "#!/usr/bin/env python3\n\ndef main():\n x, y = map(int, input().split())\n xx, yy = map(abs, (x, y))\n a = 0, (xx + yy) * y // yy\n c = (xx + yy) * x // xx, 0\n\n if (a[0] > c[0]):\n a, c = c, a\n \n print(*a, *c)\n\nif __name__ == \"__main__\":\n main()\n\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nx,y = list(map(int,input().split()))\r\ns = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n x1 = 0\r\n y1 = s\r\n x2 = s\r\n y2 = 0\r\nelif x<0 and y>0:\r\n x1 = -s\r\n y1 = 0\r\n x2 = 0\r\n y2 = s\r\nelif x<0 and y<0:\r\n x1 = -s\r\n y1 = 0\r\n x2 = 0\r\n y2 = -s\r\nelse:\r\n x1 = 0\r\n y1 = -s\r\n x2 = s\r\n y2 = 0\r\n\r\nprint(str(x1)+\" \"+str(y1)+\" \"+str(x2)+\" \"+str(y2)+\"\\n\")\r\n", "# coding: utf-8\nx, y = [int(i) for i in input().split()]\nlength = abs(x)+abs(y)\nans = []\nif x < 0:\n ans.append([-length,0])\nelse:\n ans.append([length,0])\nif y < 0:\n ans.append([0,-length])\nelse:\n ans.append([0,length])\nans.sort()\nprint(ans[0][0],ans[0][1],ans[1][0],ans[1][1])\n", "x, y = map(int, input().split())\r\n\r\nif (x > 0 and y > 0) or (x < 0 and y < 0): m = -1\r\nelse: m = 1\r\n\r\nc = y - m*x\r\nx1 = -(c*m)\r\ny2 = c\r\n\r\nif x1 < 0: print(x1, 0, 0, y2)\r\nelse: print(0, y2, x1, 0)\r\n", "x, y = map(int, input().split())\r\np1, p2 = (0, (-1 if y < 0 else 1) * (abs(x) + abs(y))), ((-1 if x < 0 else 1) * (abs(x) + abs(y)), 0)\r\nif p1[0] > p2[0]:\r\n p1, p2 = p2, p1\r\nprint(' '.join(map(str, p1 + p2)))", "x,y=map(int,input().split())\r\nif(x>0 and y>0):\r\n\tprint(0,x+y,x+y,0)\r\nelif(x<0 and y>0):\r\n\tprint(-(abs(x)+abs(y)),0,0,abs(x)+abs(y))\r\nelif(x<0 and y<0):\r\n\tprint(-(abs(x)+abs(y)),0,0,-(abs(x)+abs(y)))\r\nelif(x>0 and y<0):\r\n\tprint(0,-(abs(x)+abs(y)),abs(x)+abs(y),0)", "import math\r\n\r\ndef main_function():\r\n x, y = [int(i) for i in input().split(\" \")]\r\n length_of_side = abs(x) + abs(y)\r\n if x > 0 and y > 0:\r\n print(\" \".join([str(i) for i in [0, length_of_side, length_of_side, 0]]))\r\n elif x < 0 and y > 0:\r\n print(\" \".join([str(i) for i in [-length_of_side, 0, 0, length_of_side]]))\r\n elif x < 0 and y < 0:\r\n print(\" \".join([str(i) for i in [-length_of_side, 0, 0, -length_of_side]]))\r\n else:\r\n print(\" \".join([str(i) for i in [0, -length_of_side, length_of_side, 0]]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "x, y = map(int, input().split(' '))\r\n\r\nA_x, B_x, A_y, B_y = 0, 0, 0, 0\r\n\r\nA = abs(x) + abs(y)\r\nB = -(A)\r\n\r\nif x < 0:\r\n A_x = B\r\n if y > 0:\r\n B_y = A\r\n else:\r\n B_y = B\r\nelse:\r\n B_x = A\r\n if y > 0:\r\n A_y = A\r\n else:\r\n A_y = B\r\n \r\nprint(\"%d %d %d %d\" % (A_x, A_y, B_x, B_y))\r\n", "x,y = list(map(int,input().strip().split()))[:2]\r\nif x>=0 and y>=0:\r\n x2=x+y\r\n x1=0\r\n y2=0\r\n y1=y+x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x<0 and y>=0:\r\n x2=x-y\r\n y2=0\r\n x1=0\r\n y1= (-1*x)+y\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x>=0 and y<0:\r\n x2 = x+(-1*y)\r\n y2 = 0\r\n x1 = 0\r\n y1 = y-x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\nelif x<0 and y<0:\r\n x2=x+y\r\n x1=0\r\n y2=0\r\n y1=y+x\r\n if x2<x1:\r\n print(x2, y2, x1, y1)\r\n else: print(x1,y1,x2,y2)\r\n\r\n\r\n\r\n", "line = input()\n\nx,y = line.split()\nx = int(x)\ny = int(y)\n\nif x*y > 0:\n b = x + y\n if b > 0:\n print(0,b,b,0)\n else:\n print(b,0,0,b)\nif x*y < 0:\n b = y - x\n if b > 0:\n print(-b,0,0,b)\n else:\n print(0,b,-b,0)\n ", "# y=-x+c\r\n\r\nimport math\r\nx,y=input().split()\r\nif(((int(x)<0)and(int(y)>0)) or ((int(x)>0)and(int(y)<0))):\r\n c=int(y)-int(x)\r\n x1=0\r\n x2=-c\r\n y1=c\r\n y2=0\r\n\r\n if(x1<x2):\r\n print(f\"{x1} {y1} {x2} {y2}\")\r\n else:\r\n print(f\"{x2} {y2} {x1} {y1}\")\r\n \r\nelse:\r\n # y=x+c\r\n \r\n c=int(y)+int(x)\r\n x1=0\r\n x2=c\r\n y1=c\r\n y2=0\r\n\r\n if(x1<x2):\r\n print(f\"{x1} {y1} {x2} {y2}\")\r\n else:\r\n print(f\"{x2} {y2} {x1} {y1}\")\r\n\r\n", "x,y = map(int,input().split())\r\nif x*y >= 0:\r\n m = -1\r\nelse:\r\n m = 1\r\nc = y-(m*x)\r\nif x < 0:\r\n print(f\"{int(-c/m)} 0 0 {c}\")\r\nelse:\r\n print(f\"0 {c} {int(-c/m)} 0\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = map(int, input().split())\r\na = abs(x) + abs(y)\r\n\r\nif x < 0:\r\n print(-a, 0, 0, -a if y < 0 else a)\r\nelse:\r\n print(0, -a if y < 0 else a, a, 0)", "x,y = map(int , input().split())\r\n\r\nval = abs(x) + abs(y)\r\n\r\nif(x>0 and y>0):\r\n print(\"0\",val,val,\"0\",sep = \" \")\r\nelif (x<0 and y>0):\r\n print(val*-1,\"0\",\"0\",val,sep = \" \")\r\nelif(x<0 and y<0):\r\n print(val*-1,\"0\",\"0\",val*-1,sep = \" \")\r\nelse:\r\n print(\"0\",val*-1,val,\"0\",sep = \" \")", "x,y = map(int,input().split())\r\nif x < 0 and y > 0:\r\n\tprint(-y+x,0,0,y-x)\r\nif x > 0 and y < 0:\r\n\tprint(0,-(-y+x),(x-y),0)\r\nelif (y>0) and (x>0):\r\n\tprint(0,(y+x),(y+x),0)\r\nelif (y<0) and (x<0):\r\n\tprint((y+x),0,0,(y+x))", "x,y= map(int,input().split())\r\nicpt=abs(x)+abs(y)\r\nif x<0 and y<0:\r\n print(-icpt,0,0,-icpt)\r\nelif x<0 and y>0:\r\n print(-icpt,0,0,icpt)\r\nelif x>0 and y<0:\r\n print(0,-icpt,icpt,0)\r\nelse:\r\n print(0,icpt,icpt,0)\r\n", "# LUOGU_RID: 101540640\ndef sgn(x):\r\n return 0 if x == 0 else 1 if x > 0 else -1\r\nx, y = map(int, input().split())\r\nt = abs(x) + abs(y)\r\nif t * sgn(x) > 0:\r\n print(0, t * sgn(y), t * sgn(x), 0)\r\nelse:\r\n print(t * sgn(x), 0, 0, t * sgn(y))", "x, y = map(int, input().split())\r\n\r\nedge = abs(x) + abs(y)\r\n\r\nx1, y1, x2, y2 = 0, 0, 0 ,0\r\n\r\nif x >= 0 and y >= 0:\r\n x1 = 0\r\n y1 = edge\r\n x2 = edge\r\n y2 = 0\r\n\r\nelif x >= 0 and y <= 0:\r\n x1 = 0\r\n y1 = -edge\r\n x2 = edge\r\n y2 = 0\r\n \r\nelif x <= 0 and y >= 0:\r\n x1 = -edge\r\n y1 = 0\r\n x2 = 0\r\n y2 = edge\r\n\r\nelse:\r\n x1 = -edge\r\n y1 = 0\r\n x2 = 0\r\n y2 = -edge\r\n \r\nprint(str(x1) + ' ' + str(y1) + ' ' + str(x2) + ' ' + str(y2)) \r\n\r\n\r\n", "x, y = map(int, input().split())\r\n\r\nif (x < 0) != (y < 0):\r\n p = [(x - y, 0), (0, y - x)]\r\nelse:\r\n p = [(x + y, 0), (0, y + x)]\r\n\r\np.sort()\r\nprint(*p[0], *p[1])\r\n", "arr = input().split()\r\na = int(arr[0]) \r\nb = int(arr[1])\r\nl = abs(a) + abs(b)\r\nif a >= 0:\r\n\tx = l\r\nelse:\r\n\tx = -1*l\r\n\r\nif b >= 0:\r\n\ty = l\r\nelse:\r\n\ty = -1*l\r\nif x > 0:\r\n\tprint('0 ' + str(y) + ' ' + str(x) + ' 0')\r\nelse:\r\n\tprint(str(x) + ' 0 0 ' + str(y) )", "x, y = [int(str) for str in input().split()]\r\nl = abs(x) + abs(y)\r\nsign = lambda x: (1, -1)[x<0]\r\npoints = [(l * sign(x), 0), (0, l * sign(y))]\r\npoints = sorted(points, key=lambda point: point[0])\r\npprint = points[0] + points[1]\r\nprint(\" \".join([str(i) for i in pprint]))", "a,b = map(int,input().split())\r\nx1,y2=0,0\r\nx1 = abs(a)+abs(b)\r\ny2 = x1\r\nif a<0:\r\n\tx1 = -1*x1\r\nif b<0:\r\n\ty2= -1*y2\r\n\r\nif x1>0:\r\n\tprint(0,y2,x1,0)\r\nelse:\r\n\tprint(x1,0,0,y2)", "x,y=map(int,input().split())\r\na=abs(x)+abs(y)\r\nv=[-a,a][y>0]\r\nprint(*((-a,0,0,v)if x<0 else(0,v,a,0)))\r\n", "x,y = list(map(int, input().split()))\r\n\r\nsum=abs(x)+abs(y)\r\n\r\nif x>0:\r\n b=sum if y>0 else -sum\r\n c=sum\r\n a,d=0,0\r\n\r\nelse:\r\n b,c=0,0\r\n a=-sum\r\n d=sum if y>0 else -sum\r\n\r\n\r\nprint(f\"{a} {b} {c} {d}\")", "#!/usr/bin/env python3\ndef copysign(a,b):\n return abs(a) * [1,-1][b<0]\nx, y = map(int,input().split())\nz = abs(x) + abs(y)\nif x < 0:\n print(copysign(z,x), 0, 0, copysign(z,y))\nelse:\n print(0, copysign(z,y), copysign(z,x), 0)\n", "x, y = map(int, input().split())\r\n\r\nif x >= 0:\r\n if y >= 0:\r\n print(0,' ',x+y,' ',x+y,' ',0)\r\n else:\r\n print(0,' ',y-x,' ',x-y,' ',0)\r\nelse:\r\n if y >= 0:\r\n print(x-y,' ',0,' ',0,' ',y-x)\r\n else:\r\n print(x+y,' ',0,' ',0,' ',x+y)", "a=[int(x) for x in input().split()]\r\nx=a[0]\r\ny=a[1]\r\nk=abs(x)+abs(y)\r\n\r\nif(x>0):\r\n if(y<0):\r\n print(\"0\"+\" \"+str(-1*k),end=\" \")\r\n else:\r\n print(\"0\"+\" \"+str(k),end=\" \")\r\n print(str(k)+\" \"+\"0\")\r\nelif(x<0):\r\n print(str(-1*k)+\" \"+\"0\",end=\" \")\r\n if(y<0):\r\n sf=-1\r\n print(\"0\"+\" \"+str(-1*k))\r\n else:\r\n print(\"0\"+\" \"+str(k))\r\n \r\n\r\n", "s,n = input().split()\r\nx = int(s)\r\ny = int(n)\r\nif x >0 and y>0:\r\n print(0,end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\n print(0,end = ' ')\r\nelif x<0 and y<0:\r\n print(int(x)+int(y),end = ' ')\r\n print(0,end = ' ')\r\n print(0,end = ' ')\r\n print(int(x)+int(y),end = ' ')\r\nelif x<0 and y>0:\r\n print(int(x)-int(y),end = ' ')\r\n print(0,end = ' ')\r\n print(0,end = ' ')\r\n print(-(x-y),end = ' ')\r\nelse:\r\n print(0,end = ' ')\r\n print(-(x-y),end = ' ')\r\n print((x-y),end = ' ')\r\n print(0,end = ' ')\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "x,y=map(int,input().split())\na=abs(x)+abs(y)\nv=[-a,a][y>0]\nprint(*((-a,0,0,v)if x<0else(0,v,a,0)))\n", "x, y = map(int, input().split())\r\n\r\nsign_x = -1 if x < 0 else 1\r\nsign_y = -1 if y < 0 else 1\r\nres = abs(x) + abs(y) \r\n\r\nif x < 0:\r\n print(sign_x * res, 0, 0, sign_y * res)\r\nelse:\r\n print(0, sign_y * res, sign_x * res, 0)\r\n", "string = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\ncondition1 = abs(a) == a\r\ncondition2 = abs(b) == b\r\nglobal x1, x2, y1, y2\r\ndef xy(x, y):\r\n global x1, x2, y1, y2\r\n n = abs(a) + abs(b)\r\n x1 = 0\r\n x2 = n * x\r\n y1 = n * y\r\n y2 = 0\r\n if x1 > x2:\r\n x1, x2 = x2, x1\r\n y1, y2 = y2, y1\r\ndef check(x):\r\n if condition2:\r\n xy(x, 1)\r\n else:\r\n xy(x, -1)\r\nif condition1:\r\n check(1)\r\nelse:\r\n check(-1)\r\nprint(x1, y1, x2, y2)", "x, y = map(int, input().split())\r\nx1, y1, x2, y2 = 0, 0, 0, 0\r\nif x >= 0 and y >= 0:\r\n y1 = y + x\r\n x2 = y1\r\nelif x >= 0 and y < 0:\r\n y1 = -x+y\r\n x2 = abs(y1)\r\nelif x < 0 and y >= 0:\r\n y2 = y-x\r\n x1 = -y2\r\nelse:\r\n y2 = -(-y-x)\r\n x1 = y2\r\nprint(x1, y1, x2, y2)\r\n\r\n\r\n", "import math\r\n\r\nif __name__ == \"__main__\":\r\n x,y=map(int,input().split())\r\n x1,y1,x2,y2=0,0,0,0\r\n if x<0:\r\n x1=x-int(math.fabs(y))\r\n if y<0:\r\n y2=y+x\r\n else:\r\n y2=y-x\r\n else:\r\n x2=x+int(math.fabs(y))\r\n if y<0:\r\n y1=y-x\r\n else:\r\n y1=y+x\r\n print(x1,y1,x2,y2)", "def main():\n x, y = map(int, input().strip().split())\n t=abs(x)+abs(y)\n if x>0<y:\n print(0,t,t,0)\n elif x<0<y:\n print(-t,0,0,t)\n elif x>0>y:\n print(0,-t,t,0)\n else:\n print(-t,0,0,-t)\n\nmain()", "integer = int\r\nstring = str\r\nlength = len\r\n\r\n\r\ndef main():\r\n x,y=list(map(integer,input().split()))\r\n point=abs(x)+abs(y)\r\n if x>0 and y>0:\r\n print(0,point,point,0)\r\n elif x<0 and y>0:\r\n print(-1*point,0,0,point)\r\n elif x<0 and y<0:\r\n print(-1*point,0,0,-1*point)\r\n else:\r\n print(0,-1*point,point,0)\r\n\r\n\r\nmain()", "import sys;\r\n\r\nclass MyReader:\r\n# file = null;\r\n def __init__(self):\r\n filename = \"file.in\";\r\n if self.isLocal():\r\n self.file = open(filename);\r\n self.str = [\"\"];\r\n self.ind = 1;\r\n \r\n def isLocal(self):\r\n return len(sys.argv) > 1 and sys.argv[1] == \"SCHULLZ\";\r\n\r\n def nextString(self):\r\n if self.isLocal():\r\n return self.file.read();\r\n else:\r\n return input();\r\n \r\n def nextInt(self):\r\n return int(self.nextToken());\r\n\r\n def nextToken(self):\r\n if (self.ind >= len(self.str)):\r\n self.ind = 0;\r\n self.str = self.nextString().split();\r\n self.ind += 1;\r\n return self.str[self.ind - 1];\r\n\r\ndef Solve():\r\n x = -1;\r\n try:\r\n x = rdr.nextInt();\r\n except Exception:\r\n return False;\r\n y = rdr.nextInt();\r\n\r\n mx = 1;\r\n my = 1;\r\n\r\n if (x < 0):\r\n x = -x;\r\n mx = -1;\r\n if (y < 0):\r\n y = -y;\r\n my = -1;\r\n \r\n x1 = 0;\r\n y1 = x + y;\r\n x2 = x + y;\r\n y2 = 0;\r\n\r\n if (-1 == mx):\r\n x1 = -x1;\r\n x2 = -x2;\r\n\r\n if (-1 == my):\r\n y1 = -y1;\r\n y2 = -y2;\r\n\r\n if (x1 > x2):\r\n (x1, x2) = (x2, x1);\r\n (y1, y2) = (y2, y1);\r\n\r\n print(x1, y1, x2, y2);\r\n\r\n return True;\r\n\r\nrdr = MyReader();\r\n\r\nif (not rdr.isLocal()):\r\n Solve();\r\nelse:\r\n while (Solve()):\r\n fgh = 1\r\n\r\n\r\n", "x, y = map(int, input().split())\r\nans = abs(x)+abs(y)\r\n\r\nif x > 0 and y > 0:\r\n print(0, ans, ans, 0)\r\nif x < 0 and y > 0:\r\n print(-ans, 0, 0, ans)\r\nif x < 0 and y < 0:\r\n print(-ans, 0, 0, -ans)\r\nif x > 0 and y < 0:\r\n print(0, -ans, ans, 0)", "x, y = map(int, input().split())\r\nif x > 0:\r\n if y > 0:\r\n print(0, x+y, x+y, 0)\r\n else:\r\n print(0, -(x-y), x-y, 0)\r\nelse:\r\n if y > 0:\r\n print(x-y, 0, 0, -x+y)\r\n else:\r\n print(x+y, 0, 0, x+y)", "#A. Vasily the Bear and Triangle\r\nx, y = map(int,input().split())\r\nt = abs(x)+abs(y)\r\nif x>0 and y>0:\r\n print(0,t,t,0)\r\nelif x<0 and y>0 :\r\n print(-1*t,0,0,t)\r\nelif x>0 and y<0:\r\n print(0,-1*t,t,0)\r\nelse:\r\n print(-1*t,0,0,-1*t)", "#!/usr/bin/python3\n\nx, y = tuple(map(int, input().split()))\nif x > 0 and y > 0:\n print(0, x + y, x + y, 0)\nelif x > 0 and y < 0:\n print(0, -x + y, x - y, 0)\nelif x < 0 and y > 0:\n print(x - y, 0, 0, -x + y)\nelse:\n print(x + y, 0, 0, x + y)\n", "x, y = map(int, input().split())\r\nif x > 0 and y > 0 :\r\n print(0, x+y, x+y,0)\r\nif x > 0 and y < 0 :\r\n print(0, y-x, x-y,0)\r\nif x < 0 and y < 0 :\r\n print (x+y, 0, 0,x+y)\r\nif x < 0 and y > 0 :\r\n print(x-y,0,0, y-x)\r\n\r\n\r\n\r\n\r\n", "\r\nx,y=map(int,input().split())\r\n\r\nif x>0 and y>0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(0,x+y,x+y,0)\r\nelif x<0 and y>0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(-(x+y),0,0,(x+y))\r\nelif x<0 and y<0:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(-(x+y),0,0,-(x+y))\r\nelse:\r\n\tx=abs(x)\r\n\ty=abs(y)\r\n\tprint(0,-(x+y),(x+y),0)", "def sgn(n):\r\n if n>0: return 1\r\n return -1\r\nx,y=map(int,input().split())\r\nv=abs(x)+abs(y)\r\nl=[[v*sgn(x),0],[0,v*sgn(y)]]\r\nif l[0][0]>l[1][0]:\r\n l[0],l[1]=l[1],l[0]\r\nfor x in l:\r\n print(*x,end=' ')", "x,y = [int(i) for i in input().split()]\n\nif x*y > 0:\n c = y+x\n \n c1 = (0,c)\n c2 = (c,0)\n if(c2 < c1):\n c1,c2=c2,c1\n print(c1[0],c1[1],c2[0],c2[1])\n \nelse:\n c = y-x\n \n c1 = (0,c)\n c2 = (-c,0)\n if(c2 < c1):\n c1,c2=c2,c1\n print(c1[0],c1[1],c2[0],c2[1])\n \n\n", "x,y = map(int,input(\"\").split())\nif x > 0 and y > 0:\n a = x + y\n x1 = 0\n y1 = a\n x2 = a\n y2 = 0\n print(x1,y1,x2,y2)\nelif x < 0 and y > 0:\n a = x - y\n x1 = a\n y1 = 0\n x2 = 0\n y2 = -a\n print(x1,y1,x2,y2)\nelif x < 0 and y < 0:\n a = -(x+y)\n x1 = -a\n y1 = 0\n x2 = 0\n y2 = -a\n print(x1,y1,x2,y2)\nelif x > 0 and y < 0:\n a = -(y-x)\n x1 = 0\n y1 = -a\n x2 = a\n y2 = 0\n print(x1,y1,x2,y2)\n\n\n\n \t \t \t\t \t\t\t\t\t\t \t \t \t \t\t\t \t", "xy=input().split()\r\nx=int(xy[0])\r\ny=int(xy[1])\r\nm=0\r\nif x>0 and y>0:\r\n m=-1\r\nelif x<0 and y<0:\r\n m=-1\r\nelse:\r\n m=1\r\nif m==1:\r\n x1=0\r\n y1=y-x\r\n x2=x-y\r\n y2=0\r\nelse:\r\n x1=0\r\n y1=x+y\r\n x2=x+y\r\n y2=0\r\nif x1<x2:\r\n print(x1,y1,x2,y2)\r\nelse:\r\n print(x2,y2,x1,y1)\r\n\r\n", "a,b=map(int,input().split())\nif a>0 and b>0:\n print(0,a+b,a+b,0)\nif a>0 and b<0:\n print(0,-a+b,a-b,0)\nif a<0 and b>0:\n print(a-b,0,0,-a+b)\nif a<0 and b<0:\n print(a+b,0,0,a+b)", "x0, y0 = map(int, input().split())\r\ndiff = abs(x0) + abs(y0)\r\nif x0 < 0:\r\n if y0 < 0:\r\n print(-diff, 0, 0, -diff)\r\n else:\r\n print(-diff, 0, 0, diff)\r\nelse:\r\n if y0< 0:\r\n print(0, -diff, diff, 0 )\r\n else:\r\n print(0, diff, diff, 0)", "x,y=map(int,input().split())\n\n\n\n#y=-x+c\nif((x>0 and y>0)):\n c=y+x\n print(\"0 \"+str(c),end=\" \")\n print(str(c)+\" 0\")\nelif(x<0 and y<0):\n c=y+x\n print(str(c)+\" 0\",end=\" \")\n print(\"0 \"+str(c))\n \nelif(y>x):\n c=y-x\n print(str(-1*c)+\" 0\",end=\" \")\n print(\"0 \"+str(c))\nelse:\n c=y-x\n print(\"0 \"+str(c),end=\" \")\n print(str(-1*c)+\" 0\")\n \n", "x,y=map(int,input().split())\r\nif x>0:\r\n if y>0:\r\n print(0,x+y,x+y,0)\r\n else:\r\n print(0,-(x+abs(y)),x+abs(y),0)\r\nelif x<0:\r\n if y>0:\r\n print(-(abs(x)+y),0,0,(abs(x)+y))\r\n else:\r\n print(-abs(x+y),0,0,-abs(x+y))\r\n", "x,y = map (int,input().split())\r\n\r\nxs = x // abs (x)\r\nys = y // abs (y)\r\n\r\ns = abs (x) + abs (y)\r\n\r\nret = [(xs*s,0), (0,ys*s)]\r\nret.sort ()\r\n\r\nfor x,y in ret:\r\n\tprint (x,y,end=' ')\r\n", "x,y=map(int,input().split())\r\na=str(abs(x)+abs(y))\r\nif(x>0 and y>0):\r\n\tprint(\"0 \"+a+\" \"+a+\" 0\")\r\nelif(x<0 and y>0):\r\n\tprint(\"-\"+a+\" 0 0 \"+a)\r\nelif(x<0 and y<0):\r\n\tprint(\"-\"+a+\" 0 0 \"+\"-\"+a)\r\nelse:\r\n\tprint(\"0 \"+\"-\"+a+\" \"+a+\" 0\")", "[x,y]=[int(i) for i in input().split()]\r\n\r\nif(x>0 and y>0):\r\n\tprint(0,x+y,x+y,0)\r\nelif(x<0 and y>0):\r\n\tv=abs(x)+y\r\n\tprint(-v,0,0,v)\r\nelif(x>0 and y<0):\r\n\tv=x+abs(y)\r\n\tprint(0,-v,v,0)\r\nelse:\r\n\tprint(x+y,0,0,x+y)" ]

{"inputs": ["10 5", "-10 5", "20 -10", "-10 -1000000000", "-1000000000 -1000000000", "1000000000 1000000000", "-123131 3123141", "-23423 -243242423", "123112 4560954", "1321 -23131", "1000000000 999999999", "54543 432423", "1 1", "-1 -1", "-1 1", "1 -1", "42 -2", "2 -435", "76 -76", "1000000000 1", "1000000000 -1", "-1000000000 1", "-1000000000 -1", "1000000000 -999999999", "-1000000000 999999999", "-1000000000 -999999999", "999999999 1000000000", "-999999999 1000000000", "999999999 -1000000000", "-999999999 -1000000000"], "outputs": ["0 15 15 0", "-15 0 0 15", "0 -30 30 0", "-1000000010 0 0 -1000000010", "-2000000000 0 0 -2000000000", "0 2000000000 2000000000 0", "-3246272 0 0 3246272", "-243265846 0 0 -243265846", "0 4684066 4684066 0", "0 -24452 24452 0", "0 1999999999 1999999999 0", "0 486966 486966 0", "0 2 2 0", "-2 0 0 -2", "-2 0 0 2", "0 -2 2 0", "0 -44 44 0", "0 -437 437 0", "0 -152 152 0", "0 1000000001 1000000001 0", "0 -1000000001 1000000001 0", "-1000000001 0 0 1000000001", "-1000000001 0 0 -1000000001", "0 -1999999999 1999999999 0", "-1999999999 0 0 1999999999", "-1999999999 0 0 -1999999999", "0 1999999999 1999999999 0", "-1999999999 0 0 1999999999", "0 -1999999999 1999999999 0", "-1999999999 0 0 -1999999999"]}

UNKNOWN

PYTHON3

CODEFORCES

183

d02c5691f75073b585c6a0d403fb8188

Martian Dollar

One day Vasya got hold of information on the Martian dollar course in bourles for the next *n* days. The buying prices and the selling prices for one dollar on day *i* are the same and are equal to *a**i*. Vasya has *b* bourles. He can buy a certain number of dollars and then sell it no more than once in *n* days. According to Martian laws, one can buy only an integer number of dollars. Which maximal sum of money in bourles can Vasya get by the end of day *n*? The first line contains two integers *n* and *b* (1<=≤<=*n*,<=*b*<=≤<=2000) — the number of days and the initial number of money in bourles. The next line contains *n* integers *a**i* (1<=≤<=*a**i*<=≤<=2000) — the prices of Martian dollars. Print the single number — which maximal sum of money in bourles can Vasya get by the end of day *n*. Sample Input 2 4 3 7 4 10 4 3 2 1 4 10 4 2 3 1 Sample Output 8 10 15

[ "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i, n):\r\n ans = max(ans, (b//a[i])*a[j] + b%a[i])\r\nprint(ans)", "n, am=map(int, input().split())\na=list(map(int, input().split()))\nmaxd=0\nx=0\ny=0\nprofit=0\nb=[0]*n\nb[n-1]=-1\nmaxi=0\nfor i in range(n-2, -1, -1):\n maxi = max(maxi, a[i+1]) \n b[i] = maxi\nfor i in range(n):\n if b[i]>0: \n profit=max(profit, (am//a[i])*(b[i]-a[i]))\nprint(am+profit)\n \t \t\t \t \t \t\t \t \t\t\t\t\t \t \t\t", "# @Chukamin ICPC_TRAIN\n\ndef main():\n n, b = map(int, input().split())\n data = list(map(int, input().split()))\n choose = 0\n ans = b\n for i in range(n):\n now_ans = b + (b // data[choose]) * (data[i] - data[choose])\n ans = max(ans, now_ans)\n if data[choose] > data[i]:\n choose = i\n print(ans)\n\nif __name__ == '__main__':\n main()\n\n \t\t \t \t\t \t \t \t \t\t\t\t", "n, b = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\n\nans = b\nfor i in range(n):\n for j in range(i + 1, n):\n if arr[j] > arr[i]:\n cur = (b // arr[i]) * arr[j] + (b % arr[i])\n ans = max(ans, cur)\n\nprint(ans)\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=0;ans=b\r\nfor i in range(a-1):\r\n d=c[i+1:]\r\n if max(d)>c[i]:\r\n d=((b//c[i])*max(d))+b%c[i]\r\n if d>ans:\r\n ans=d\r\n d=0\r\nprint(ans)", "n, b = map(int, input().split())\na = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(0, len(a)):\n m = b // a[_]\n o = b - m * a[_]\n for i in range(_, len(a)):\n res = max(m * a[i] + o, res)\n\nprint(res)\n", "n , b = map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nmon=0\r\nsell=0\r\nans=[]\r\nfor i in range(n):\r\n share = b//lis[i]\r\n mon=b- (b//lis[i])*lis[i]\r\n for j in range(i,n):\r\n sell=lis[j]*share\r\n# print(share,sell,mon)\r\n ans.append(sell+mon)\r\n#print(ans)\r\nprint(max(ans)) \r\n", "n, b = map(int, input().split())\r\nrates, benefit = [int(i) for i in input().split()], b\r\nfor i, rate in enumerate(rates[:n-1]):\r\n local_max = max(rates[i + 1:])\r\n if rate <= b and local_max > rate and b // rate * local_max + b % rate > benefit:\r\n benefit = b // rate * local_max + b % rate\r\nprint(benefit)\r\n", "a,k = map(int, input().split())\r\nm = list(map(int, input().split()))\r\nn = m*1\r\nfor i in range(a-1, -1, -1):\r\n n[i] = max(m[i:])\r\nmx = 0\r\nfor i in range(a):\r\n mx = max(mx, (k//m[i])*n[i]+k%m[i])\r\nprint(mx)", "def s():\r\n\t[n,b] = list(map(int,input().split()))\r\n\ta = list(map(int,input().split()))\r\n\tma = [1,1]\r\n\tmi = a[0]\r\n\tr = b\r\n\tfor i in a:\r\n\t\tmi = min(i,mi)\r\n\t\tr = max(r,b%mi + b//mi*i)\r\n\tprint(r)\r\ns()", "n, amount = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmaxd = 0\r\nx = 0\r\ny=0\r\nprofit = 0\r\nb = [0]*n\r\nb[n-1] = -1\r\nmaxi = 0\r\nfor i in range(n-2, -1, -1):\r\n maxi = max(maxi, a[i+1]) \r\n b[i] = maxi\r\nfor i in range(n):\r\n if b[i]>0: \r\n profit = max(profit, (amount//a[i])*(b[i]-a[i]))\r\nprint(amount+profit)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nfor _ in range(1):\r\n n, b = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n s = b\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n s = max(s, a[j]*(b//a[i])+(b%a[i]))\r\n print(s)", "n, b = map(int, input().split())\na, m, v = list(map(int, input().split())), 0, b\nfor i in range(n - 2, -1, -1):\n m = max(m, a[i + 1])\n v = max(v, b % a[i] + b // a[i] * m)\nprint(v)\n", "n, k=map(int,input().split())\nl=list(map(int,input().split()))\nans=k\nfor i in range(0,n-1):\n for j in range(i+1,n):\n ans=max(ans,(k//l[i])*l[j]+k%l[i])\nprint(ans)\n", "d,b=map(int,input().split())\nl=list(map(int,input().split()))\nl2=[b]\nfor i in range(d):\n\tdollars=b//l[i]\n\trest=b%l[i]\n\tfor j in range (i+1,d):\n\t\tgains=dollars*l[j]\n\t\tl2.append(gains+rest)\n\nprint(max(l2))", "def maxElemFrom(cont, fromInd):\r\n ans = cont[fromInd]\r\n for i in range(fromInd + 1, len(cont)):\r\n if ans < cont[i]:\r\n ans = cont[i]\r\n return ans\r\n\r\n\r\nn, rub = [int(item) for item in input().split(' ')]\r\ncont = [int(item) for item in input().split(' ')]\r\nans = rub\r\nfor i in range(n - 1):\r\n dollars = rub // cont[i]\r\n rem = rub % cont[i]\r\n cust_max = maxElemFrom(cont, i + 1)\r\n temp = dollars * cust_max + rem\r\n if ans < temp:\r\n ans = temp\r\nprint(ans)\r\n", "# Don't wait for opportunity. Create it. Unknown\r\n# by : Blue Edge - Create some chaos\r\nn,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[]\r\nmini=4000\r\nfor x in a[:-1]:\r\n mini=min(x,mini)\r\n c.append(mini)\r\n\r\nmaxi=0\r\ni=n-2\r\nans=b\r\nfor x in a[-1:0:-1]:\r\n maxi=max(maxi,x)\r\n # print(maxi,c[i])\r\n ans=max(ans,b+max(0,(b//c[i])*(maxi-c[i])))\r\n # print(ans)\r\n i-=1\r\n\r\nprint(ans)\r\n", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef main():\r\n n, s = getf()\r\n a = getf()\r\n ans = s\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n ans = max(ans, (s // a[i]) * a[j] + s % a[i])\r\n put(ans)\r\nmain()\r\n", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=b\r\nfor i in range(n-1):\r\n temp=b//a[i]\r\n bal=b-temp*a[i]\r\n for j in range(i+1,n):\r\n r=temp*a[j]\r\n res=max(res,bal+r)\r\nprint(res)", "n,b = map(int,input().split())\r\nv = b\r\nw = list(map(int,input().split()))\r\nm = 0\r\nfor i in range(n-2,-1,-1):\r\n m=max(m,w[i+1])\r\n v=max(v,b//w[i]*m+b%w[i])\r\nprint(v)\r\n", "input1 = input().split(\" \")\r\ninput2 = input().split(\" \")\r\ninput1 = [int(i) for i in input1]\r\nn, b = input1[0], input1[1]\r\nprices = [int(i) for i in input2]\r\nmax_earn = 0\r\nfor i in range(n):\r\n buy_price = prices[i]\r\n n_dollars = b // buy_price\r\n gap = 0\r\n for j in range(i, n):\r\n sell_price = prices[j]\r\n gap = sell_price - buy_price\r\n if gap * n_dollars > max_earn:\r\n max_earn = gap * n_dollars\r\nprint(max_earn + b)", "from math import *\n\nn, b = map(int, input().split())\na = list(map(int, input().split()))\n\nres = b\nmn = 2001\nfor i in range(1, len(a)):\n mn = min(mn, a[i - 1])\n if mn < a[i]:\n res = max(res, b + (a[i] - mn) * (b // mn))\nprint(res)\n \t\t\t\t \t\t \t\t\t \t \t\t\t\t\t \t \t", "n,b=map(int, input().split())\r\na=list(map(int, input().split()))\r\ntest=0\r\nans=b\r\n\r\nfor i in range(0,n-1):\r\n for j in range(i+1,n):\r\n cp=a[i]\r\n sp=a[j]\r\n d=b//cp\r\n r=b%cp\r\n p=sp*d+r\r\n ans=max(ans,p)\r\nprint(ans)", "def cal(b,l,h): return(b//l * h + b%l)\n\n(n,b) = map(int,str.split(input()))\na = list(map(int,str.split(input())))\n(l,h,tl,th) = (a[0],a[0],a[0],a[0])\nfor x in a:\n\tif x < tl: (tl , th) = (x,x)\n\tif x > th: \n\t\tth = x\n\t\tif cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)\nif cal(b,tl,th) > cal(b,l,h): (h,l) = (th, tl)\nprint(cal(b,l,h))\n", "n,a=map(int,input().split())\r\nA=list(map(int,input().split()))\r\n\r\nMAX=A[:]\r\nfor i in range(n-2,-1,-1):\r\n MAX[i]=max(MAX[i],MAX[i+1])\r\n\r\nANS=a\r\n\r\nfor i in range(n):\r\n k=a//A[i]\r\n ANS=max(ANS,a+k*(MAX[i]-A[i]))\r\n\r\nprint(ANS)\r\n", "str1 = input().split()\r\nn = (int)(str1[0])\r\nb = (int)(str1[1])\r\nstr2 = input().split()\r\nfor x in range(n):\r\n str2[x] = (int)(str2[x])\r\nminimum = list()\r\nmaximum = list()\r\nans = 0\r\nif(str2 == sorted(str2,reverse=True)):\r\n print (b)\r\nelif (str2 == sorted(str2)):\r\n print (b - ((int)(b/str2[0]) * str2[0]) + ((int)(b/str2[0]) * str2[len(str2) - 1]))\r\nelse:\r\n for x in range(n-1):\r\n if(str2[x+1] > str2[x]):\r\n minimum.append(x)\r\n for x in range(n-1):\r\n if(str2[x+1] < str2[x]):\r\n maximum.append(x)\r\n maximum.append(n-1)\r\n for x in minimum:\r\n for y in maximum:\r\n if(x < y):\r\n v1 = b - ((int)(b/str2[x]) * str2[x]) + ((int)(b/str2[x]) * str2[y])\r\n ans = max(v1,ans)\r\n print (ans)", "I=lambda:map(int,input().split());n,b=I();a=list(I())\r\nq=[0]*n\r\nfor i in range(n):\r\n r=a[i]\r\n for j in range(i+1,n):\r\n if a[j]>r:\r\n r=a[j]\r\n q[i]=(b//a[i])*r+(b%a[i])\r\nprint(max(max(q),b))", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nfor _ in range(1):#int(input())):\r\n n, b = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ma = b\r\n for i in range(n):\r\n for j in range(i, n):\r\n cb = int(b/a[i])\r\n m = b % a[i]\r\n sell = cb * a[j] + m\r\n if (sell > ma):\r\n ma = sell\r\n print(ma)\r\n", "n, ic = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = []\r\nmx = 0\r\nfor el in a[::-1]:\r\n b.append(mx)\r\n mx = max(mx, el)\r\nb.reverse()\r\nmx = ic\r\nfor i in range(n-1):\r\n l = a[i]\r\n r = b[i]\r\n if ic >= l < r:\r\n mx = max(mx, (ic//l) * r + ic%l)\r\nprint(mx)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=m\r\nmx=a[-1]\r\nfor i in range(n-2,-1,-1):\r\n\tmx=max(mx,a[i])\r\n\tans=max(ans,m//a[i]*mx+m%a[i])\r\nprint(ans)", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\na = [t[0]] + [0] * (n - 1)\r\nfor i in range(n - 1): a[i + 1] = min(a[i], t[i + 1])\r\nt.reverse()\r\nb = [t[0]] + [0] * (n - 1)\r\nfor i in range(n - 1): b[i + 1] = max(b[i], t[i + 1])\r\nb.reverse()\r\nprint(k + max((k // a[i]) * (b[i] - a[i]) for i in range(n)))", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=b\r\nfor i in range(n):\r\n p=b-l[i]\r\n if(p<0):\r\n continue\r\n else:\r\n for j in range(i+1,n):\r\n res = max(res, b//l[i]*l[j]+b%l[i])\r\nprint(res)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nx=a[0]\r\ny=a[0]\r\nc=True\r\nfor i in range(1,n):\r\n if(a[i]<x):\r\n l=m%x\r\n s=m//x\r\n # print(ans,x,y)\r\n ans=max(ans,s*y+l)\r\n x=a[i]\r\n y=a[i]\r\n if(i==n-1):\r\n c=False\r\n else:\r\n if(a[i]>y):\r\n y=a[i]\r\n# print(ans) \r\nif(c):\r\n l=m%x\r\n s=m//x\r\n ans=max(ans,s*y+l) \r\nprint(ans) ", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nr=sorted(l)\r\nr.reverse()\r\np=[]\r\n#print(r,l)\r\nif l==r:\r\n print(b)\r\nelse:\r\n for i in range(1,n):\r\n mi=min(l[0:i])\r\n j=l.index(mi)\r\n ma=max(l[j:i+1])\r\n p.append((ma*(b//mi))+(b%mi))\r\n print(max(p))", "n, b = map(int, input().split())\r\na, m, v = list(map(int, input().split())), 0, b\r\nfor i in range(n - 2, -1, -1):\r\n m = max(m, a[i + 1])\r\n v = max(v, b % a[i] + b // a[i] * m)\r\nprint(v)" ]

{"inputs": ["2 4\n3 7", "4 10\n4 3 2 1", "4 10\n4 2 3 1", "2 755\n51 160", "3 385\n978 1604 1888", "4 1663\n1904 1049 1622 472", "5 1293\n1183 142 1356 889 134", "1 1472\n784", "1 478\n1955", "1 1483\n1126", "10 595\n881 832 1159 171 230 750 361 1800 516 567", "93 867\n97 1270 616 1027 1685 27 1662 947 1480 20 1394 1528 191 1348 67 1694 1772 1706 1394 109 1391 878 1474 307 101 663 1064 116 143 1239 386 651 1534 1348 1604 636 793 1188 1293 24 1729 1204 1656 1579 1644 661 1470 341 1709 1860 1081 1539 5 1892 1732 1049 419 25 1086 1263 967 1284 1229 1013 1348 1046 927 1492 1459 1523 459 1907 68 853 822 994 912 266 850 1991 714 1803 513 835 947 313 1287 1183 285 182 1053 1192 615", "23 1966\n625 1474 1628 1770 1365 922 120 844 826 1145 878 1479 1489 10 1081 1182 1862 303 101 100 14 1319 326", "43 1427\n651 1624 295 6 1615 1683 741 183 734 1056 1487 633 1368 1267 1782 1091 541 1277 1263 1703 785 223 184 1837 1724 1581 1400 1483 445 1490 580 643 1998 41 1581 873 1906 846 1607 1503 1131 1858 1861", "39 897\n18 38 122 130 337 471 492 518 541 557 568 637 688 861 927 989 1018 1046 1158 1292 1309 1316 1347 1380 1430 1530 1589 1637 1651 1696 1798 1821 1829 1830 1838 1883 1896 1912 1917"], "outputs": ["8", "10", "15", "2281", "385", "2236", "12219", "1472", "478", "1483", "5482", "344445", "364958", "473531", "93948"]}

UNKNOWN

PYTHON3

CODEFORCES

35

d08494093811abd7a4cbf604871ae8f9

Network Configuration

The R1 company wants to hold a web search championship. There were *n* computers given for the competition, each of them is connected to the Internet. The organizers believe that the data transfer speed directly affects the result. The higher the speed of the Internet is, the faster the participant will find the necessary information. Therefore, before the competition started, each computer had its maximum possible data transfer speed measured. On the *i*-th computer it was *a**i* kilobits per second. There will be *k* participants competing in the championship, each should get a separate computer. The organizing company does not want any of the participants to have an advantage over the others, so they want to provide the same data transfer speed to each participant's computer. Also, the organizers want to create the most comfortable conditions for the participants, so the data transfer speed on the participants' computers should be as large as possible. The network settings of the R1 company has a special option that lets you to cut the initial maximum data transfer speed of any computer to any lower speed. How should the R1 company configure the network using the described option so that at least *k* of *n* computers had the same data transfer speed and the data transfer speed on these computers was as large as possible? The first line contains two space-separated integers *n* and *k* (1<=≤<=*k*<=≤<=*n*<=≤<=100) — the number of computers and the number of participants, respectively. In the second line you have a space-separated sequence consisting of *n* integers: *a*1,<=*a*2,<=...,<=*a**n* (16<=≤<=*a**i*<=≤<=32768); number *a**i* denotes the maximum data transfer speed on the *i*-th computer. Print a single integer — the maximum Internet speed value. It is guaranteed that the answer to the problem is always an integer. Sample Input 3 2 40 20 30 6 4 100 20 40 20 50 50 Sample Output 30 40

[ "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na.sort(reverse=True)\r\nprint(min(a[:k]))", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nprint(l[b-1])\r\n\r\n", "[n, k], speed = map(int, input().split()), sorted(map(int, input().split()), reverse = True)\r\nprint(speed[k - 1])\r\n", "# LUOGU_RID: 113633863\ndef r():return list(map(int,input().split()))\na,b=r();a=r();a.sort();print(a[-b])", "import sys\r\nn,k = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\n\r\nprint(arr[n-k])", "n, k = [int (x) for x in input().split()]\r\n\r\na = [int (x) for x in input().split()]\r\n\r\na.sort(reverse=True)\r\n\r\nprint(a[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\n\r\nprint(l[-1*k])\r\n", "n, k = map(int, input().split())\r\nprint(list(reversed(list(sorted(list(map(int, input().split()))))))[k - 1])\r\n", "import sys,math\r\nfrom collections import defaultdict,Counter\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\r\nn,k = li()\r\na = li()\r\na.sort(reverse=True)\r\nprint(a[k-1])", "if __name__ == '__main__':\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n a.sort()\n\n print(a[n - k])\n\t \t\t \t \t \t \t \t \t\t \t\t", "n,k=list(map(int,input().split(\" \")))\r\nprint(min(sorted(list(map(int,input().split(\" \"))),reverse=True)[:k]))", "def convert(arr):\r\n arr = arr.split(\" \")\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n return arr\r\n\r\n\r\nap = input()\r\ns = input()\r\nnums = convert(ap)\r\nnetSpeed = convert(s)\r\nnetSpeed.sort(reverse=True)\r\nprint(netSpeed[nums[1] - 1])\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns = list(sorted(s))\r\nprint(min(s[n - k:]))", "n , k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr = list(reversed(sorted(arr)))\r\n\r\nres = []\r\n\r\nfor i in range(k):\r\n res.append(arr[i])\r\n\r\nprint(min(res))", "# Aaditya Upadhyay\r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\….\\\r\n# ………/….//……………....\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./|_…|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./\r\nfrom sys import stdin, stdout\r\nfrom collections import *\r\nfrom math import gcd, floor, ceil\r\ndef st(): return list(stdin.readline().strip())\r\n\r\n\r\ndef li(): return list(map(int, stdin.readline().split()))\r\ndef mp(): return map(int, stdin.readline().split())\r\ndef inp(): return int(stdin.readline())\r\ndef pr(n): return stdout.write(str(n)+\"\\n\")\r\n\r\n\r\nmod = 1000000007\r\nINF = float('inf')\r\n\r\n\r\ndef solve():\r\n n, k = mp()\r\n l = li()\r\n l.sort()\r\n print(l[-k])\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "_, k = [int(x) for x in input().split()]\r\nprint(sorted([int(x) for x in input().split()], reverse=True)[k - 1])\r\n", "def main():\n computers, participants = [int(i) for i in input().split()]\n speeds = [int(i) for i in input().split()]\n\n speeds.sort()\n\n print(speeds[-participants])\n\nmain()\n\t\t \t \t \t\t\t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\r\nprint(sorted(map(int, input().split()))[n - k])", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\na.reverse()\r\n\r\nprint(a[k-1])", "info = input().split()\r\ncomputernum = int(info[0])\r\ncompetitors = int(info[1])\r\ncomputers = [int(x) for x in input().split()]\r\n\r\ncomputers = sorted(computers, reverse=True)\r\n\r\nprint(computers[competitors - 1])\r\n\r\n", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\nc.sort()\r\nc.reverse()\r\nprint(c[b-1])\r\n", "from os import remove\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nprint(a[k-1])", "def main():\n\tn, k = map(int, input().split())\n\tA = list(map(int, input().split()))\n\tA.sort(reverse = True)\n\tprint(A[k - 1])\nmain()", "n, k = map(int, input().split(' '))\nspeeds = list(map(int, input().split(' ')))\nspeeds.sort(reverse= True)\nresult = speeds[k-1]\nprint(result)\n \t \t \t \t \t\t \t \t \t \t\t \t", "n, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nline = [0] * n\r\nmaxx = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if data[i] <= data[j]:\r\n count += 1\r\n line[i] = count\r\n if count >= k:\r\n maxx = max(maxx, data[i])\r\nprint(maxx)\r\n", "if __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n b=[]\r\n for i in range(k):\r\n b.append(a.pop(a.index(max(a))))\r\n # print(b)\r\n print(min(b))\r\n ", "n, k = map(int, input().split())\nv = sorted(map(int, input().split()))\nprint(v[n - k])\n", "#https://codeforces.com/problemset/problem/412/B\nn,k=map(int,input().split(' '))\narr=[int(x) for x in input().split(' ')]\narr.sort()\narr.reverse()\nprint(arr[k-1])\n", "#q16 Network Configuration\r\nn,k=[int(x) for x in input().split()]\r\nlist1=[int(x) for x in input().split()]\r\nlist1.sort(reverse=True)\r\nprint(list1[k-1])", "n,k=map(int,input().split())\r\nl=sorted(list(map(int,input().split())),reverse=True)\r\nprint(l[k-1])", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[(-1)*m])", "n, k = list(map(int, input().split()))\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[n-k])", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nprint(min(l[:k]))", "n, k = map(int,input().split())\nd = list(map(int,input().split()))\nd.sort()\nprint(d[-k])\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmini=0\r\nb=[]\r\nfor i in range(n-1,n-k-1,-1):\r\n b.append(a[i])\r\nb.sort()\r\nprint(b[0])\r\n", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n \r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\") \r\n\r\nn,k = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nar.reverse()\r\nprint(ar[k-1])", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nprint(l[k-1])", "from heapq import nlargest\nI = lambda: map(int,input().split())\nn, k = I();print(nlargest(k,list(I()))[k-1])\nprint(exit())\n", "n,k = list(map(int,input().split()))\r\nprint(sorted(list(map(int,input().split())))[-k])", "line = input()\n\ncmp_count, parti = line.split()\ncmp_count, parti = int(cmp_count), int(parti)\n\nline = input()\n\na = [int(i) for i in line.split()]\n\na.sort()\n\nprint(a[cmp_count - parti])\n", "n , k = map(int, input().split())\r\nval = list(map(int, input().split()))\r\nval.sort(reverse=True)\r\nprint(val[k-1])", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(a[n - k])\r\n\r\n'''\r\n* So I drown it out \r\n* Like I always do\r\n* Dancing through our house\r\n* With the ghost of you\r\n'''\r\n", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nspeed=[int(x) for x in input().split()] \r\nspeed.sort(reverse=True)\r\nprint(speed[k-1])", "cnt = lambda s, i: s.count(i)\r\nii = lambda: int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn,k=f()\r\nl=il()\r\nl.sort(reverse=True)\r\nprint(l[k-1])", "a, b = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nd.sort()\r\nprint(d[-b])\r\n", "n, k = list(map(int, input().split()))\r\nlst = sorted(list(map(int, input().split())))\r\nprint(lst[-k])\r\n", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nM=list(map(int,input().split()))\r\nM.sort()\r\nprint(M[-k])", "a,b = map(int,input().split())\r\nNS = int,input().split()\r\nNS = NS[1]\r\nfor i in range(len(NS)): NS[i] = int(NS[i])\r\nNS.sort()\r\nNS = NS[::-1]\r\nprint(NS[b-1])\r\n ", "x=input()\r\nx=x.split()\r\nn=int(x[0])\r\nk=int(x[1])\r\nl=input()\r\nl=l.split()\r\ns=[]\r\nfor i in range(n):\r\n\ts.append(int(l[i]))\r\ns.sort()\r\nprint(s[n-k])", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rstrs(splitchar=' '):\n return [i for i in input().split(splitchar)]\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in rstrs(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\nif __name__ == '__main__':\n c, p = rints()\n comps = sorted(rints(), key=lambda k: -1*k)\n print(comps[p-1])\n", "n, k = [int(i) for i in input().split()]\r\n\r\nprint(sorted(int(i) for i in input().split())[-k])\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[n-k])", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nprint(sorted(a)[-k])", "n,k=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())),reverse=True)\r\nprint(a[k-1])\r\n", "a , b = map(int , input().split())\r\n\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\narr.sort(reverse= True)\r\nprint(min(arr[:b]))", "X = list(map(int, input().split()))\r\nprint(sorted(list(map(int, input().split())), reverse=True)[X[1] - 1])\r\n\r\n# UB_CodeForces\r\n# Advice: Believe that you are invaluable\r\n# Location: Behind my desk\r\n# Caption: My best buddy is really talkative\r\n", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\na = a[::-1]\r\nprint(a[k-1])", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\nprint(a[k-1])", "# LUOGU_RID: 101567888\nn, k, *a = map(int, open(0).read().split())\r\nprint(sorted(a)[n - k])", "n, k = map(int, input().split())\r\na = list(map(int , input().split()))[:n]\r\na.sort(reverse=True)\r\nprint(min(a[:k]))", "n, k = list(map(int, input().split()))\nv = list(map(int, input().split()))\nv.sort()\nprint(min(v[n-k:n]))\n\t\t\t\t \t \t \t\t\t \t \t\t \t\t\t\t", "a,b = map(int,input().split())\nc = list(map(int,input().split()))\nc.sort()\nif (a - b) != 0:\n\tfor x in range(a - b):\n\t\tc.pop(0)\nprint(c[0])", "I = lambda: map(int, input().split())\r\n\r\n_, k = I()\r\n\r\nprint(sorted(I())[-k])", "x,y=map(int,input().split())\r\n*n,=sorted(map(int,input().split()))\r\na=x-y\r\nprint(n[a])", "arr = list(map(int, input().split()))\r\nn, k = arr[0], arr[1]\r\n\r\na = sorted(list(map(int, input().split())), reverse=True)\r\nprint (a[k-1])", "c, s = input().split()\r\ninp = input().split()\r\nspeeds = [int(x) for x in inp]\r\nspeeds.sort()\r\nprint(speeds[int(c)-int(s)])", "def network_config():\n c, p = list(map(int,input().split()))\n speed_computers = list(map(int,input().split()))\n speed_computers.sort(reverse=True)\n print(speed_computers[p-1])\n\nnetwork_config()\n\n \t\t \t\t \t\t\t \t \t \t\t\t\t\t \t\t\t \t", "n, k = map(int, input().split())\r\nS = list(map(int, input().split()))\r\nS.sort(reverse = True)\r\nprint(S[k - 1])", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ni = 0\r\na = list(input().split())\r\no = []\r\nfor s in a:\r\n s = int(s)\r\n o.append(s)\r\no.sort()\r\no.reverse()\r\nprint(o[k-1])", "# LUOGU_RID: 105536994\nn,k=map(int,input().split())\r\nnum=sorted(list(map(int,input().split())),reverse=True)\r\nprint(num[k-1])", "n, m = [int(j) for j in input().split()]\r\nspeed = sorted([int(j) for j in input().split()])\r\nprint(speed[n - m])\r\n", "n , k = map(int, input().split())\r\ncomp = list(map(int, input().split()))\r\ncomp.sort(reverse= True)\r\nprint(comp[k-1])", "q = str(input()).split()\r\nn = int(q[0])\r\nk = int(q[1])\r\narr = [int(a) for a in input().split()]\r\nmas = []\r\narr.sort(reverse=True)\r\nfor i in range(k):\r\n mas.append(arr[i])\r\n\r\nprint(mas[-1])", "#network configuration question codeforces\r\nn,k=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\nspeed=list(map(int,input().split(' ')))[:n]\r\nspeed.sort(reverse=True)\r\nspeed1=speed[:k]\r\nprint(min(speed1))", "n, k = map(int, input().split())\r\nA = sorted(list(map(int, input().split())))\r\nprint(A[n - k])", "# LUOGU_RID: 113482033\na=input().split()\r\nn=int(a[0])\r\nk=int(a[1])\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\na.sort(reverse=True)\r\nprint(a[k-1])", "k=int(input().split()[1])\r\na=sorted(map(int,input().split()))\r\nprint(a[-k])", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[n - k])", "k = int(input().split()[1])\r\ns = list(map(int,input().split()))\r\ns.sort(reverse = True)\r\nprint(s[k - 1])", "n, k = map(int, input().split())\nx = sorted(list(map(int, input().split())))\nprint(x[-k])\n", "n,k=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort(reverse=True)\r\nprint(list[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nprint(min(l[:k]))", "n,k=map(int,input().split())\r\nar=sorted(list(map(int,input().split())),reverse=True)\r\nprint(ar[k-1]) \r\n", "l1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\nl2 = [int(x) for x in input().split()]\r\nl2.sort(reverse=True)\r\nprint(l2[k-1])\r\n\r\n", "n,k=map(int,input().split())\r\nls = sorted(list(map(int, input().split())))\r\nprint(ls[n-k])", "#Merge Sort - Presente no meu repositório de algoritmos.\n#Fonte do código: https://www.geeksforgeeks.org/merge-sort/\n#Repositório: https://docs.google.com/document/d/1uCF0m6H3Nr0X_OL4OR-u5eHvSjF1cQFUN_wPYaOEw-c/edit?usp=sharing\ndef mergeSort(arr):\n if len(arr) > 1:\n \n # Finding the mid of the array\n mid = len(arr)//2\n \n # Dividing the array elements\n L = arr[:mid]\n \n # into 2 halves\n R = arr[mid:]\n \n # Sorting the first half\n mergeSort(L)\n \n # Sorting the second half\n mergeSort(R)\n \n i = j = k = 0\n \n # Copy data to temp arrays L[] and R[]\n while i < len(L) and j < len(R):\n if L[i] < R[j]:\n arr[k] = L[i]\n i += 1\n else:\n arr[k] = R[j]\n j += 1\n k += 1\n \n # Checking if any element was left\n while i < len(L):\n arr[k] = L[i]\n i += 1\n k += 1\n \n while j < len(R):\n arr[k] = R[j]\n j += 1\n k += 1\n \ndef main():\n entrada = input().split();\n computadores = int(entrada[0]);\n participantes = int(entrada[1]);\n entrada = input().split();\n velocidade = [0]*computadores;#velocidade[i] -> velocidade máxima do i-ésimo computador\n for i in range(computadores):\n velocidade[i] = int(entrada[i]);\n #n = numero de participantes\n #Se limitarmos a velocidade dos n computadores mais rápidos a velocidade mais lenta entre eles então teremos computadores em igual velocidade suficientes para a competição.\n mergeSort(velocidade);\n print(velocidade[computadores - participantes]);\nmain();\n \t\t \t\t \t \t\t\t\t \t \t\t\t\t \t", "n,k = map(int, input().split())\nvalores = list(map(int, input().split()))\nvalores.sort(reverse=True)\nprint(valores[k-1])\n\n \n \n \n \n \n \t\t \t\t\t\t \t \t \t \t \t \t \t\t", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narray.sort(reverse=True)\r\nprint(array[k - 1])\r\n", "n,k=map(int,input('').split()) \r\na=list(map(int,input('').split()))\r\na=list(reversed(sorted(a)))\r\nprint(a[k-1])\r\n\r\n \r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:03:02\nLastEditTime: 2021-11-04 23:06:43\nDescription: \nFilePath: CF412B.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n lst = list(sorted(map(int, input().strip().split())))\n return lst[-k]\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "n, k = list(map(int, input().split()))\ns = list(map(int, input().split()))\ns.sort(reverse=True)\nprint(s[k - 1])", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nprint(a[k-1])", "\r\nn, k = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nl.sort(reverse = True)\r\n\r\nprint(l[k - 1])", "import sys\r\nline = str.split(input(),\" \")\r\nn = int(line[0])# num comp\r\nk = int(line[1])# num par\r\n\r\nline = str.split(str(input()),\" \")\r\nspeeds = []\r\nfor s in line:\r\n speeds.append(int(s))\r\n\r\nsspeeds = speeds\r\nsspeeds.sort()\r\nsspeeds.reverse()\r\n\r\nsys.stdout.write(str(sspeeds[k-1]))\r\n", "n, k = map(int, input().split())\r\nS = sorted(list(map(int, input().split())))\r\nmaxim = S[-1 * k]\r\nprint(maxim)", "n, k = map(int, input().split())\nx = list(map(int, input().split()))\nx.sort(reverse=True)\nprint(x[k - 1])\n", "n, k = map(int, input().split())\r\narr = sorted(map(int, input().split()), reverse=True)\r\nprint(arr[k - 1])\r\n", "n , k = map(int,input().split())\r\nnetwork_speeds_sorted = [int(x) for x in input().split()]\r\n#print(network_speeds_sorted)\r\nnetwork_speeds_sorted.sort(reverse=True)\r\n#print(network_speeds_sorted)\r\nprint(network_speeds_sorted[k-1])", "n,k=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nL.sort(reverse=True)\r\n\r\nprint(L[k-1])\r\n", "n, m = [int(d) for d in input().split(\" \")]\r\na = sorted([int(c) for c in input().split(\" \")], reverse = True)\r\n\r\nfor i in range(len(a)):\r\n\tif i+1 == m:\r\n\t\tprint(a[i])\r\n\t\tbreak\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 30 23:16:26 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\n\r\nimport sys\r\nsysinput = sys.stdin.readline\r\nsysinput = input\r\n############ ---- Input Functions ---- ############\r\ndef readint():\r\n return(int(sysinput()))\r\ndef readchlist():\r\n s = sysinput()\r\n lst = list(s[:])\r\n try:\r\n lst.remove('\\n')\r\n finally:\r\n return(lst)\r\ndef readintlist():\r\n return(list(map(int,sysinput().split())))\r\n\r\nn, k = readintlist()\r\na = readintlist()\r\na = sorted(a)\r\nmaxspeed = a[-k]\r\nprint(maxspeed)\r\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))[::-1]\r\nprint(a[k-1])", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse = True)\r\nprint(l[k-1]) ", "n, k = (int(i) for i in input().split())\na = sorted(int(i) for i in input().split())\nres = a[n - k]\nprint(res)\n", "if __name__ == \"__main__\":\r\n n,k = list(map(int, input().split()))\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n arr = arr[::-1]\r\n for i in range(n):\r\n if i+1 == k:\r\n print(arr[i])\r\n break", "k,n = list(map(int,input().split(\" \")))\r\na = list(map(int,input().split(\" \")))\r\n\r\na.sort(reverse = True)\r\n\r\nprint(a[n-1])", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nprint(min(arr[:m]))\r\n", "n, k = map(int,input().split())\r\nprint(sorted(map(int,input().split()))[n-k])\r\n", "def main():\r\n\r\n\r\n\tn,k=map(int,input().split(\" \"))\r\n\tip=[int(item) for item in input().split(\" \")]\r\n\tip.sort()\r\n\tprint(ip[len(ip)-k])\r\n\r\n\t\r\n\r\nif __name__==\"__main__\":\r\n\tmain()", "n, k = map(int, input().split())\r\nnumbers = sorted(list(map(int, input().split())), reverse = True)\r\nprint(numbers[k - 1])\r\n", "n, k = map(int, input().split())\r\nw = sorted(map(int, input().split()), reverse=True)\r\nprint(w[k-1])\r\n", "n, k = map(int, input().split())\r\nprint(sorted(list(map(int, input().split())))[n-k])\r\n", "n,k=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\nlis.reverse()\r\nprint(lis[k-1])\r\n", "\n\nif __name__==\"__main__\":\n\n data = input().split()\n\n lista = []\n for it in input().split():\n lista.append(int(it))\n\n lista.sort( reverse = True)\n\n\n print( lista[ int( data[1] ) - 1] )\n\n\n\n \t\t\t\t \t \t \t\t\t\t \t \t\t \t \t \t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nprint(arr[k-1])", "n,k=map(int,input().split())\r\na=[int(s) for s in input().split()]\r\na=sorted(a)\r\nprint(a[n-k])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nyl1\r\n@author: User\r\n\"\"\"\r\na=lambda:list(map(int,input().strip().split()))\r\nn,k=a()\r\ns=a()\r\ns.sort()\r\nprint(s[-k])", "n,k=[int(x) for x in input().split()]\r\nl=sorted([int(x) for x in input().split()])\r\nprint(l[n-k])", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nprint(sorted(I())[n-k])", "b=input().split()\r\nn=int(b[0])\r\nk=int(b[1])\r\na=input().split()\r\nai=[]\r\nfor i in range(n):\r\n ai.append(int(a[i]))\r\nai.sort()\r\nprint(ai[n-k])\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nprint(a[n-k])\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nprint(sorted(arr, key = lambda x:-x)[k-1])", "def func():\n\tn,m = map(int, input().split())\n\ta = list(map(int, input().split()))\n\ta.sort()\n\tprint(a[n-m])\n\n\n\ndef main():\n\tprint('ok or exit: ')\n\twhile input() != 'exit':\n\t\tprint('execute.')\n\t\tfunc()\n\t\tprint('ok or exit: ')\n\n#main()\nfunc()", "n, k = list(map(int, input().split()))\nspeed = list(map(int, input().split()))\nfor i in range(n-k):\n m = min(speed)\n speed.remove(m)\nprint(min(speed))", "R=lambda:list(map(int,input().split()))\r\nn,m=R(); l=sorted(R()); print(l[n-m])", "n,k=list(map(int,input().split()))\r\n\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\ns=t[::-1]\r\n\r\n\r\nprint(s[k-1])\r\n", "def main():\n [n, k] = [int(_) for _ in input().split()]\n speeds = [int(_) for _ in input().split()]\n speeds.sort(reverse=True)\n\n print(speeds[k - 1])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\n\r\nprint(arr[n-k])", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sorted(a, reverse=True)[k - 1])", "def solve(a: int, b: int, d: list) -> int:\r\n d.sort()\r\n return(d[-b])\r\n \r\na, b = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nprint(solve(a,b,d))\r\n ", "# Here I just need to find the i-th greater value from the sequence\ncomputers, participants = map(int, input().split())\ncomputersSpeed = list(map(int, input().split()))\ncomputersSpeed.sort(reverse=True)\nprint(computersSpeed[participants-1])\n \t\t \t\t\t\t \t\t \t \t \t\t\t\t\t\t \t\t", "n, k = map(int, input().split());\r\narray = list(map(int, input(). split()));\r\narray.sort(reverse = True);\r\nprint(array[k - 1]);", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\nA.sort()\nprint(A[-k])", "import sys\r\nii = lambda: sys.stdin.readline().strip()\r\nidata = lambda: [int(x) for x in ii().split()]\r\n\r\ndef solve():\r\n n, k = idata()\r\n data = sorted(idata())\r\n print(data[-k])\r\n return\r\n\r\nfor t in range(1):\r\n solve()", "C, N = map(int, input().split())\r\n\r\nPCs = list(map(int,input().split()))\r\nPCs.sort(reverse=True)\r\nprint(PCs[N-1])", "n, k = map(int, input().split())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ndaf.sort(reverse = True)\r\n\r\ndaf = daf[:k]\r\n\r\nprint(daf[-1])\r\n", "def main():\n n, k = map(int, input().split())\n speeds = sorted([int(num) for num in input().split()], reverse= True)\n print(speeds[k-1])\n\nmain()\n \t \t \t \t \t\t \t \t \t\t\t \t\t \t\t \t", "n,k = list(map(int,input().split()))\r\nv = list(map(int,input().split()))\r\nv.sort()\r\nv.reverse()\r\nprint(v[k-1])", "n, k = (i for i in list(map(int, input().split(' '))))\na = list(map(int, input().split(' ')))\na.sort()\nprint(a[-k])", "added_test=(input(\"\"))\ntest_index=input(\"\")\nl_reverse=[]\nl=list(map(int,test_index.split(' ')))\nk=list(map(int,added_test.split(' ')))\n\nl_new=sorted(l)\nl_new.reverse()\n\nindex=k[1]-1\n\nprint(l_new[index])\n\n \t \t\t \t\t\t\t\t \t \t \t\t \t\t \t \t", "n,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[-k])\r\n", "n, k = map(int, input().split())\n\nspeed = [int(i) for i in input().split()]\n\nspeed.sort()\n\nprint(speed[-k])\n\t\t\t\t\t \t\t\t\t \t \t \t \t \t \t\t \t", "n,k=map(int,input().split())\nb=sorted(map(int,input().split()))\nprint(b[-k])", "nk = list(map (int, input().split()))\r\nspeeds = list(map (int, input().split()))\r\nminimum = nk[0] - nk[1]\r\nspeeds.sort()\r\nprint(speeds[minimum])\r\n", "\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n a.sort(reverse=True)\r\n print(min(a[:k]))\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "s = input()\r\na = s.split(\" \")\r\nn = int(a[0])\r\nt = int(a[1])\r\ns = input()\r\na = s.split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\na.sort()\r\nprint(a[n-t])", "N,K= map(int, input().split())\r\nSpeeds = list(map(int,input().split()))\r\nSpeeds.sort()\r\nprint(Speeds[-K])\r\n", "def maximum_s (n,k,a):\n a = sorted(a)\n a = a[::-1]\n a = a[:k]\n return min(a)\n\nn,k = list(map(int,input().split()))\na = list(map(int,input().split()))\nprint (maximum_s(n,k,a))\n \n", "# https://codeforces.com/problemset/problem/412/B\n# 900\n\n\nn, m = map(int, input().split())\nl = list(map(int, input().split()))\nl.sort() \n\nprint(min(l[-m:]))\n", "n,k=map(int, input().split())\r\nprint(sorted(map(int, input().split()))[-k])", "a, b = map(int, input().split())\r\n\r\nl = sorted(map(int, input().split()))\r\n\r\n#print(l)\r\n\r\nprint(l[-b])", "from collections import Counter\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = Counter(arr)\r\nsor = sorted(count.items(), key=lambda x: x[0], reverse=True)\r\n\r\nfor i, j in sor:\r\n k -= j\r\n if k < 1:\r\n print(i)\r\n break\r\n\r\n\r\n\r\n", "# LUOGU_RID: 112613122\na,k=map(int,input().split())\ns=list(map(int,input().split()))\ns.sort(reverse=True)\nprint(s[k-1])", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\n\r\nspeeds = list(map(int, input().split()))\r\n\r\nspeeds.sort(reverse=True)\r\nprint(speeds[k-1])\r\n", "n, k = list(map(int, input().split()))\r\n\r\ns = list(map(int, input().split()))\r\n\r\ns.sort()\r\n\r\nprint(s[- k])", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=(n-k)\r\nprint(a[x])\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n n,k = map(int, input().split())\r\n a = sorted(list(map(int,input().split())))[::-1]\r\n print(a[k-1])\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nn, k = map(int, input().split())\r\na = list(reversed(sorted(map(int, input().split()))))\r\nprint(a[k - 1])\r\n\r\n# ♥\r\n", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\na = sorted([int(i) for i in input().split()])\r\nprint(a[n-k])\r\n\r\n", "(n, k) = map(int, input().split())\nspeeds = list(map(int, input().split()))\n\nspeeds.sort()\ntopSpeeds = speeds[n-k: n]\n\nprint(min(topSpeeds))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=a[n-k:]\r\nprint(min(b))", "[n, k] = [int(i) for i in input().split()]\r\n\r\na = sorted([int(i) for i in input().split()])[::-1]\r\n\r\nprint(a[k-1])", "n , k = map(int , input().split())\r\nl = sorted(list(map(int , input().split())) , reverse = True)\r\nprint(l[k - 1])\r\n ", "a,b = map(int,input().split())\r\nf= list(map(int,input().split()))\r\nc = []\r\nwhile b != 0:\r\n c.append(max(f))\r\n del f[f.index(max(f))]\r\n b-=1\r\nprint(min(c))", "n, k = map(int, input().split())\r\ns = sorted(list(map(int, input().split())), reverse = True)\r\nprint(s[k - 1])", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort()\r\n\r\nprint(A[n - k])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nans = sorted(data, reverse=True)[:k][-1]\r\nprint(ans)", "n,k = tuple(input().split())\r\nlis = input().split()\r\nlis = [int(i) for i in lis]\r\nlis.sort()\r\nprint(lis[-int(k)])\r\n", "def comp_comp(n, k, arr):\n return merge_sort(arr)[k-1]\n\ndef merge_sort(arr):\n if len(arr) <= 1:\n return arr\n midpoint = len(arr)//2\n left = merge_sort(arr[:midpoint])\n right = merge_sort(arr[midpoint:])\n return final_merge(left, right)\n\ndef final_merge(left, right):\n li=0\n ri=0\n fa=[]\n while li<len(left) and ri<len(right):\n if left[li] > right[ri]:\n fa.append(left[li])\n li+=1\n else:\n fa.append(right[ri])\n ri+=1\n while li<len(left):\n fa.append(left[li])\n li+=1\n while ri<len(right):\n fa.append(right[ri])\n ri+=1\n return fa\n\nn,k = map(int, input().split())\narr = list(map(int, input().split()))\n\nprint(comp_comp(n,k,arr))", "n, k = map(int, input().split())\na = sorted(list(map(int, input().split())), reverse=True)\n\nprint(a[k-1])\n\n\t \t\t\t \t\t\t\t \t\t \t\t\t\t\t\t \t\t \t \t\t", "n,k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nprint(ai[n-k])\r\n", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n a.sort(reverse=True)\r\n\r\n print(a[k-1])\r\n\r\nmain()", "k, n = input().split()\nk = int(k)\nn = int(n)\na = input().split()\na = [int(item) for item in a]\na.sort()\na.reverse()\na = a[0:n]\nprint(min(a))\n", "n, k = input().split()\r\ns = input().split()\r\ns = list(map(int, s))\r\n\r\ns.sort(reverse = True)\r\nprint(s[int(k)-1])", "import heapq as hq\n\nn, k = tuple([int(x) for x in input().split(\" \")])\nmax_speeds = [int(x) for x in input().split(\" \")]\n\nk_largest = hq.nlargest(k, max_speeds)\nprint(k_largest[-1])\n \t\t \t \t \t \t\t \t\t\t \t\t \t\t", "n,m = input().split()\r\nn,m = int(n),int(m)\r\nl = [int(a) for a in input().split(\" \",n-1)]\r\nl.sort(reverse=True)\r\nprint(l[m-1])\r\n \r\n \r\n ", "R = lambda:map(int, input().split())\n\nn, k = R()\n\nprint(sorted(R())[-k])\n\n\n\n# Made By Mostafa_Khaled", "# https://codeforces.com/problemset/problem/412/B\r\n\r\n\r\ndef handle_input():\r\n n,k = tuple(map(int , input().split()))\r\n speed = list(map(int , input().split()))\r\n return n,k,speed\r\n\r\n\r\nn,k,speed = handle_input()\r\n\r\nspeed.sort(reverse=True)\r\nprint(speed[k-1])", "n , k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nprint(a[n- 1 - k + 1])" ]

{"inputs": ["3 2\n40 20 30", "6 4\n100 20 40 20 50 50", "1 1\n16", "2 1\n10000 17", "2 2\n200 300", "3 1\n21 25 16", "3 2\n23 20 26", "3 3\n19 29 28", "100 2\n82 37 88 28 98 30 38 76 90 68 79 29 67 93 19 71 122 103 110 79 20 75 68 101 16 120 114 68 73 71 103 114 99 70 73 18 36 31 32 87 32 79 44 72 58 25 44 72 106 38 47 17 83 41 75 23 49 30 73 67 117 52 22 117 109 89 66 88 75 62 17 35 83 69 63 60 23 120 93 18 112 93 39 72 116 109 106 72 27 123 117 119 87 72 33 73 70 110 43 43", "30 13\n36 82 93 91 48 62 59 96 72 40 45 68 97 70 26 22 35 98 92 83 72 49 70 39 53 94 97 65 37 28", "50 49\n20 77 31 40 18 87 44 64 70 48 29 59 98 33 95 17 69 84 81 17 24 66 37 54 97 55 77 79 42 21 23 42 36 55 81 83 94 45 25 84 20 97 37 95 46 92 73 39 90 71", "40 40\n110 674 669 146 882 590 650 844 427 187 380 711 122 94 38 216 414 874 380 31 895 390 414 557 913 68 665 964 895 708 594 17 24 621 780 509 837 550 630 568", "40 1\n851 110 1523 1572 945 4966 4560 756 2373 4760 144 2579 4022 220 1924 1042 160 2792 2425 4483 2154 4120 319 4617 4686 2502 4797 4941 4590 4478 4705 4355 695 684 1560 684 2780 1090 4995 3113", "70 12\n6321 2502 557 2734 16524 10133 13931 5045 3897 18993 5745 8687 12344 1724 12071 2345 3852 9312 14432 8615 7461 2439 4751 19872 12266 12997 8276 8155 9502 3047 7226 12754 9447 17349 1888 14564 18257 18099 8924 14199 738 13693 10917 15554 15773 17859 13391 13176 10567 19658 16494 3968 13977 14694 10537 4044 16402 9714 4425 13599 19660 2426 19687 2455 2382 3413 5754 113 7542 8353", "80 60\n6159 26457 23753 27073 9877 4492 11957 10989 27151 6552 1646 7773 23924 27554 10517 8788 31160 455 12625 22009 22133 15657 14968 31871 15344 16550 27414 876 31213 10895 21508 17516 12747 59 11786 10497 30143 25548 22003 2809 11694 30395 8122 31248 23075 19013 31614 9133 27942 27346 15969 19415 10367 8424 29355 18903 3396 6327 4201 24124 24266 22586 724 1595 3972 17526 2843 20982 23655 12714 18050 15225 2658 7236 27555 13023 729 9022 17386 2585", "100 1\n199 348 489 76 638 579 982 125 28 401 228 117 195 337 80 914 752 98 679 417 47 225 357 413 849 622 477 620 487 223 321 240 439 393 733 660 652 500 877 40 788 246 376 723 952 601 912 316 598 809 476 932 384 147 982 271 202 695 129 303 304 712 49 306 598 141 833 730 946 708 724 788 202 465 951 118 279 706 214 655 152 976 998 231 487 311 342 317 243 554 977 232 365 643 336 501 761 400 600 528", "80 50\n15160 6853 20254 11358 19535 27691 2983 31650 9219 11833 32053 31695 21511 4320 4384 24843 1454 31543 18796 13815 1546 27926 16276 14315 12542 25370 24890 29647 3584 17867 12446 15072 19852 30207 16361 7964 5343 398 10837 31114 9252 12767 15098 22562 32637 31823 8160 12658 6422 19142 12448 6765 7373 868 31712 24856 23251 29200 8159 16144 27165 4308 13652 12502 4183 7961 3032 26855 8687 12263 24319 7722 19460 30700 29806 1280 21141 25965 25550 26881", "50 16\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 1\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 2\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 100\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16", "100 99\n16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16"], "outputs": ["30", "40", "16", "10000", "200", "25", "23", "19", "122", "70", "17", "17", "4995", "16402", "8122", "998", "12448", "16", "16", "16", "16", "16"]}

UNKNOWN

PYTHON3

CODEFORCES

179

d09e0f1b9d617f27cfe3d68024706ed8

Single-use Stones

A lot of frogs want to cross a river. A river is $w$ units width, but frogs can only jump $l$ units long, where $l < w$. Frogs can also jump on lengths shorter than $l$. but can't jump longer. Hopefully, there are some stones in the river to help them. The stones are located at integer distances from the banks. There are $a_i$ stones at the distance of $i$ units from the bank the frogs are currently at. Each stone can only be used once by one frog, after that it drowns in the water. What is the maximum number of frogs that can cross the river, given that then can only jump on the stones? The first line contains two integers $w$ and $l$ ($1 \le l < w \le 10^5$) — the width of the river and the maximum length of a frog's jump. The second line contains $w - 1$ integers $a_1, a_2, \ldots, a_{w-1}$ ($0 \le a_i \le 10^4$), where $a_i$ is the number of stones at the distance $i$ from the bank the frogs are currently at. Print a single integer — the maximum number of frogs that can cross the river. Sample Input 10 5 0 0 1 0 2 0 0 1 0 10 3 1 1 1 1 2 1 1 1 1 Sample Output 3 3

[ "def ok(cnt):\r\n for i in range(l, w):\r\n if pref[i] - pref[i - l] < cnt:\r\n return False\r\n return True\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\npref = [0] * w\r\nfor i in range(1, w):\r\n pref[i] = pref[i - 1] + a[i - 1]\r\nli, ri = 1, pref[-1]\r\nans = 0\r\nwhile li <= ri:\r\n m = (li + ri) // 2\r\n if ok(m):\r\n ans = m\r\n li = m + 1\r\n else:\r\n ri = m - 1\r\nprint(ans)# 1690885996.9007297", "w, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\nx = y = sum(a[:l])\r\n\r\nfor i in range(w-l-1):\r\n y = y - a[i] + a[i+l]\r\n x = min(y,x)\r\n\r\nprint(x)\r\n", "def f(n,l):\r\n m = len(l)\r\n if n==1: return min(l)\r\n if n==m: return sum(l)\r\n ans = sum(l[:n])\r\n new = ans\r\n for i in range(1,m-n):\r\n new = new+l[i-1+n]-l[i-1]\r\n if new<ans:\r\n ans=new\r\n return ans\r\n\r\nw,n = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nprint(f(n,l))\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nw, length = map(int, input().split())\r\na = [-1] + list(map(int, input().split()))\r\nl, r = 1, length + 1\r\ns = sum(a[l:r])\r\nres = s\r\nwhile r < w:\r\n s += a[r] - a[l]\r\n l += 1\r\n r += 1\r\n res = min(res, s)\r\nprint(res)", "# D - Single-use Stones\r\n\r\nw,l = [int(i) for i in input().split(' ')]\r\na = [2E9]*(w+1)\r\n\r\nentrada = [int(i) for i in input().split(' ')]\r\nfor i in range (1, w):\r\n a[i] = entrada[i-1]\r\n\r\n\r\nb = [0]*len(a)\r\n\r\n\r\nmv = 0\r\nfor p in range (1, w+1):\r\n if(a[p] <= 0):\r\n continue\r\n if(p <= l):\r\n b[p] = a[p]\r\n continue\r\n d = p\r\n for u in range(p - l, d):\r\n if(b[u] < (a[p] - b[p])):\r\n mv = b[u]\r\n else:\r\n mv = a[p] - b[p]\r\n b[u] = b[u] - mv\r\n b[p] = b[p] + mv\r\n if(b[p]>= a[p]):\r\n break\r\n\r\nprint(b[-1])\r\n\r\n# print (w)\r\n# print (l)\r\n# print (a)\r\n\r\n#############CPP################\r\n \r\n#include <cstdio>\r\n#include <vector>\r\n\r\n\r\n\r\n# int main(){\r\n\r\n# long w, l; scanf(\"%ld %ld\", &w, &l);\r\n# std::vector<long> a(w + 1, 2e9); \r\n# for(long p = 1; p < w; p++){scanf(\"%ld\", &a[p]);}\r\n# std::vector<long> b(w + 1, 0);\r\n\r\n# for(long p = 1; p <= w; p++){\r\n# if(a[p] <= 0){continue;}\r\n# if(p <= l){b[p] = a[p]; continue;}\r\n# for(long u = p - l; u < p; u++){\r\n# long mv = (b[u] < (a[p] - b[p])) ? b[u] : (a[p] - b[p]);\r\n# b[u] -= mv; b[p] += mv;\r\n# if(b[p] >= a[p]){break;}\r\n# }\r\n# }\r\n\r\n# printf(\"%ld\\n\", b.back());\r\n\r\n# return 0;\r\n# }", "w, l = map(int, input().split())\nj = list(map(int, input().split()))\n\nans = sum(j[0:l])\ntemp = ans\n\nfor i in range(1, w - l):\n temp += j[i + l - 1] - j[i - 1]\n ans = min(ans, temp)\n\nprint(ans)\n \n \n", "tamanho, pulo= [int(t) for t in input().split()]\npedras = [int(t) for t in input().split()]\n\n#Ver o numero maximo dde sapos que podem dar o primeiro pulo\nsaposFinal = saposTemp = sum(pedras[:pulo])\nfor i in range(tamanho - pulo - 1):\n saposTemp = saposTemp - pedras[i] + pedras[i + pulo]\n saposFinal = min(saposTemp, saposFinal)\nprint(saposFinal)\n\n\n\t \t\t\t\t \t\t \t \t\t\t\t\t \t \t\t", "def SingleUseStones():\n w, l = map(int, input().split())\n stones = list(map(int, input().split()))\n maxQty = 0\n t = 0\n \n for i in range(l):\n t += stones[i]\n maxQty = t\n for i in range(l, w - 1):\n t = t + stones[i] - stones[i - l]\n maxQty = min(maxQty, t)\n print(maxQty)\n \n \nSingleUseStones()\n\t\t \t\t\t \t\t \t \t\t \t \t\t\t\t\t", "w, l = [int(value) for value in input().split()]\na = [int(value) for value in input().split()]\ns = 0\nresposta = 0\n\nfor i in range(l):\n s += a[i]\n resposta = s\n\ni = l\nwhile True:\n if resposta > s:\n resposta = s\n \n if i == w - 1:\n break\n \n aux = s + a[i] - a[i - l]\n \n if aux > 0:\n s = aux\n else:\n s = 0\n \n i += 1\n \nprint(resposta)\n \t\t \t \t\t\t \t \t\t \t\t\t \t", "import sys\r\ninput=sys.stdin.readline\r\nw,l=map(int,input().split())\r\na=[int(i) for i in input().split() if i!='\\n']\r\nans=[sum(a[:l])]\r\nfor i in range(w-1-l):\r\n pq=ans[-1]+a[i+l]-a[i]\r\n ans.append(pq)\r\nsys.stdout.write(str(min(ans))+'\\n')\r\n \r\n", "w, l = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\n\r\no = O = sum(arr[:l])\r\n\r\nfor i in range(1, w - l):\r\n o = o - arr[i - 1]\r\n o += arr[i + l - 1]\r\n O = min(O, o)\r\nprint(O)", "I=lambda:map(int,input().split())\r\nw,l=I()\r\na=list(I())\r\nc=s=sum(a[:l])\r\nfor i in range(w-l-1):\r\n s=s-a[i]+a[i+l]\r\n c=min(c,s)\r\nprint(c) ", "w,l = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsoma = sum(a[:l])\nminimo = soma\n\nfor i in range(l, w-1):\n soma += a[i] - a[i-l]\n minimo = min(minimo, soma)\n\nprint(minimo)\n \t\t\t\t\t \t \t \t \t \t \t\t \t", "w, l = map(int, input().split())\nA = list(map(int, input().split()))\nA = [0]+A+[0]\ndp = [0]*(w+1)\nfor i in range(w):\n if i == 0:\n for j in reversed(range(1, l+1)):\n dp[j] += A[j]\n else:\n for j in reversed(range(i+1, min(i+l+1, w+1))):\n if j == w:\n dp[j] += dp[i]\n break\n else:\n ndpj = min(A[j], dp[j]+dp[i])\n dp[i] -= ndpj-dp[j]\n dp[j] = ndpj\n if dp[i] <= 0:\n break\nprint(dp[-1])\n", "largura_rio,tam_pulo_sapo = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsoma = sum(a[:tam_pulo_sapo])\nminimo = soma\n \nfor i in range(tam_pulo_sapo, largura_rio-1):\n soma += a[i] - a[i-tam_pulo_sapo]\n minimo = min(minimo, soma)\n \nprint(minimo)\n \t\t \t\t \t\t \t \t \t \t \t \t", "\"\"\"\nAtividade C: Single-use stones\n\"\"\"\n\ndef soluciona():\n w, l = map(int,input().split())\n arr = list(map(int,input().split()))\n \n pedras = sum(arr[:l]) # total de pedras dentro do alcance\n res = pedras\n for i in range(1, w - l):\n pedras = pedras - arr[i - 1]\n pedras += arr[i + l - 1]\n res = min(res, pedras)\n print(res)\n\nif __name__ == \"__main__\":\n soluciona()\n\t \t \t\t \t\t\t \t \t\t\t\t\t \t \t\t\t \t", "w, l = map(int, input().split())\na = list(map(int, input().split()))\nprefix = [0] * (w-l)\nprefix[0] = sum(a[:l])\nfor i in range(w-1-l):\n prefix[i+1] += prefix[i] + a[i+l] - a[i]\nprint(min(prefix))\n \t \t \t\t\t \t\t \t\t \t \t\t \t\t", "\nw, l = [int(i) for i in input().split(' ')]\narr = [int(i) for i in input().split(' ')]\n\ncummulative = [0 for i in range(len(arr) + 1)]\nfor i in range(len(arr)):\n cummulative[i+1] = cummulative[i] + arr[i]\n\nmin_cut = 1000000009\n\nfor i in range(w - l):\n cut = cummulative[i + l] - cummulative[i]\n if cut < min_cut:\n min_cut = cut\n\nprint(min_cut)\n", "'''\r\nhttps://codeforces.com/problemset/problem/965/D\r\n\r\n输入 w(≤1e5) L(<w) 和一个长为 w-1 的数组 a (0≤a[i]≤1e4，下标从 1 开始)。\r\n有一条宽为 w 的河，青蛙们在位置 0 处，位置 i 处有 a[i] 个石头，位置 w 为河对岸。\r\n青蛙单次跳跃距离不超过 L。每个石头只能被一只青蛙用一次。\r\n输出最多有多少只青蛙能过河。\r\n\r\n相似题目：蓝桥杯2022年第十三届省赛真题-青蛙过河\r\nhttps://www.dotcpp.com/oj/problem2667.html\r\n\r\n输入\r\n10 5\r\n0 0 1 0 2 0 0 1 0\r\n输出 3\r\n解释 0-5-10, 0-5-10, 0-3-8-10\r\n\r\n输入\r\n10 3\r\n1 1 1 1 2 1 1 1 1\r\n输出 3\r\n解释 0-3-6-9-10, 0-2-5-8-10, 0-1-4-7-10\r\n'''\r\n\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom random import *\r\nimport random\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\n\r\nBUFSIZE = 4096\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MI():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef PF(a):\r\n return [0] + list(accumulate(a))\r\n\r\n\r\ndef solve():\r\n n, l = MI()\r\n a = list(map(int, input().split()))\r\n pre = PF(a)\r\n res = inf\r\n for i in range(n - l):\r\n res = min(res, pre[i + l] - pre[i])\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "l,w=map(int,input().split())\r\nli=list(map(int,input().split()))\r\naa=[]\r\ntot=0\r\nfor i in range(l-1):\r\n tot+=li[i]\r\n if i>=w:\r\n tot=tot-li[i-w]\r\n if i>=(w-1):\r\n aa.append(tot)\r\nprint(min(aa))\r\n ", "def read_nums():\r\n return list(map(int, input().split()))\r\n\r\nw, l = read_nums()\r\nrocks = read_nums()\r\n\r\ncur_sum = sum(rocks[0: l])\r\nmin_sum = cur_sum\r\nfor i in range(l, len(rocks)):\r\n cur_sum -= rocks[i - l]\r\n cur_sum += rocks[i]\r\n min_sum = min(min_sum, cur_sum)\r\n\r\nprint(min_sum)\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n w,l = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n dist = 0\r\n mdist = float('inf')\r\n for i in range(l):\r\n dist += a[i]\r\n mdist = min(mdist , dist)\r\n for i in range(l , w - 1):\r\n dist += a[i]\r\n dist -= a[i - l]\r\n mdist = min(mdist , dist)\r\n print(mdist)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom math import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport io, os\r\n\r\nif sys.hexversion == 50923504:\r\n sys.stdin = open('cfinput.txt')\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\n\r\nMOD = 10 ** 9 + 7\r\n\"\"\"https://codeforces.com/problemset/problem/965/D\r\n\r\n输入 w(≤1e5) L(<w) 和一个长为 w-1 的数组 a (0≤a[i]≤1e4，下标从 1 开始)。\r\n有一条宽为 w 的河，青蛙们在位置 0 处，位置 i 处有 a[i] 个石头，位置 w 为河对岸。\r\n青蛙单次跳跃距离不超过 L。每个石头只能被一只青蛙用一次。\r\n输出最多有多少只青蛙能过河。\r\n输入\r\n10 5\r\n0 0 1 0 2 0 0 1 0\r\n输出 3\r\n解释 0-5-10, 0-5-10, 0-3-8-10\r\n\r\n输入\r\n10 3\r\n1 1 1 1 2 1 1 1 1\r\n输出 3\r\n解释 0-3-6-9-10, 0-2-5-8-10, 0-1-4-7-10\r\n\"\"\"\r\n\r\n\r\n# \t ms\r\ndef solve(w, L, a):\r\n l = 0\r\n s = 0\r\n ans = inf\r\n for r, v in enumerate(a):\r\n s += v\r\n while r - l + 1 > L:\r\n s -= a[l]\r\n l += 1\r\n if r - l + 1 == L:\r\n ans = min(ans, s)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n w, L = RI()\r\n a = RILST()\r\n\r\n solve(w, L, a)\r\n", "# input segment\r\nw,l = map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\n# computer minimal segemnt of length l, and a temp variable\r\nminsegment=s=sum(a[:l])\r\n\r\n# calculate every l segment min value,\r\nfor i in range(1,w-l):\r\n s=s-a[i-1]+a[i+l-1]\r\n minsegment = min(s,minsegment)\r\n\r\nprint(minsegment)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(1, n - 1): l[i] += l[i - 1]\r\nans = l[k - 1]\r\nfor i in range(k, n - 1): ans = min(ans, l[i] - l[i - k])\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = [0]\r\nfor i in a:\r\n s.append(s[-1] + i)\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor i in range(l, w):\r\n ans = min(ans, s[i] - s[i - l])\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a[:k])\r\nb=[]\r\nc=0\r\nb.append(s)\r\nfor i in range(n-k-1):\r\n s=s-a[i]+a[i+k]\r\n b.append(s)\r\nprint(min(b))", "[w, l] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\n \nwinais = [0 for _ in range(w - l)]\ns = sum(ais[:l])\nwinais[0] = s\nfor i in range(w - l - 1):\n\ts += ais[i + l] - ais[i]\n\twinais[i + 1] = s\n \nprint (min(winais))\n\t\t \t\t\t \t\t\t\t\t \t\t \t\t \t\t \t \t", "import sys\r\nwhile True:\r\n\ttry:\r\n\t\tW, L = [int(i) for i in input().split()]\r\n\t\triver = [int(i) for i in input().split()]\r\n\r\n\t\tsum_seq = sum(river[:L])\r\n\t\tfrogs = sum_seq\r\n\r\n\t\tfor i in range(L,W-1):\r\n\t\t\tsum_seq = sum_seq + river[i] - river[i-L]\r\n\t\t\tfrogs = min(sum_seq, frogs)\r\n\t\tprint(frogs)\r\n\texcept EOFError:\r\n\t\tsys.exit()", "import sys\nfrom typing import List\nw, l = map(int, input().split())\na = list(map(int, input().split()))\n\ns = [0]\nfor i in a:\n s.append(s[-1] + i)\ninf = pow(10, 9) + 1\nans = inf\nfor i in range(l, w):\n ans = min(ans, s[i] - s[i - l])\n\nprint(ans)\n", "def main():\n #usamos map para tranformar variables\n w, l = map(int, input().split())\n s = list(map(int, input().split()))\n m = 0\n t = 0\n\n for i in range(l):\n t += s[i]\n m = t\n for i in range(l, w - 1):\n t = t + s[i] - s[i - l]\n m = min(m, t)\n print(m)\n\n\nif __name__ == \"__main__\":\n main()\n \t \t\t\t \t \t \t\t\t \t\t\t \t\t \t\t\t\t\t \t", "import sys\r\n\r\ndef findMinSubSum(a, l):\r\n minim = sum(a[:l])\r\n\r\n current = minim\r\n for i in range(l, len(a)):\r\n current += a[i] - a[i - l]\r\n minim = min(current, minim)\r\n\r\n return minim\r\n\r\nw, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(findMinSubSum(a, l))", "w, l = map(int, input().split())\na = list(map(int, input().split()))\n\ns = sum(a[:l])\nr = s\n\nfor i in range(l, w-1):\n s += a[i]\n s -= a[i-l]\n r = min(s, r)\n\nprint(r)\n", "line = input().split()\r\n\r\nwidth = int(line[0])\r\n\r\nl = int(line[1])\r\n\r\nriver = input().split()\r\n\r\nfor i in range(len(river)):\r\n\r\n river[i] = int(river[i])\r\n\r\nsum = 0\r\n\r\nfor i in range(l):\r\n\r\n sum += river[i]\r\n\r\n i+=1\r\n\r\nminim = sum\r\n\r\nfor i in range(l, width-1):\r\n\r\n sum = sum - river[i-l] + river[i]\r\n\r\n minim = min(minim, sum)\r\n\r\nprint(minim)", "\r\nn,l = list(map(int,input().split()))\r\n\r\nstones = list(map(int,input().split()))\r\n\r\nsumm = sum(stones[:l])\r\n#print(summ)\r\nminn = summ\r\n\r\nfor i in range(n-l-1) :\r\n #print(i,l+i)\r\n \r\n summ = summ + stones[l+i] - stones[i]\r\n \r\n if(summ<minn) :\r\n minn = summ\r\n\r\nprint(minn)\r\n \r\n \r\n \r\n \r\n \r\n ", "w, l = map(int,input().split())\r\na = tuple(map(int,input().split()))\r\nsumat = sum(a[:l])\r\nmini = sumat\r\nfor i in range(w-l-1):\r\n sumat = sumat - a[i] +a[i+l]\r\n mini = min(mini, sumat)\r\nprint(mini)", "w,l = map(int,input().split())\na = list(map(int,input().split()))\nc = sum(a[:l])\ns = c\nfor i in range(w-l-1):\n s=s-a[i]+a[i+l]\n c=min(c,s)\nprint(c) \n\t \t \t \t\t \t\t\t\t\t\t \t\t\t\t \t \t\t \t\t", "from collections import deque\r\nw, l = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [0]\r\n\r\n\r\nremovable_que = deque([])\r\ncnt = [0]*(w)\r\nans = 0\r\n\r\nfor pos in range(w-l, w):\r\n cnt[pos] = a[pos]\r\nfor pos in range(w-1, 0, -1):\r\n if pos <= l:\r\n ans += cnt[pos]\r\n continue\r\n #pos > l\r\n removable_que.appendleft(pos - l)\r\n val = cnt[pos]\r\n while removable_que and removable_que[-1] >= pos:\r\n removable_que.pop()\r\n while val > 0 and removable_que:\r\n poped_index = removable_que.popleft()\r\n d = a[poped_index] - cnt[poped_index]\r\n if d == 0:\r\n continue\r\n if d >= val:\r\n cnt[poped_index] += val\r\n val = 0\r\n removable_que.appendleft(poped_index)\r\n continue\r\n else:\r\n cnt[poped_index] += d\r\n val -= d\r\n continue\r\nprint(ans)\r\n\r\n", "import math\ndef frogs(w,l,stones):\n acc =0\n \n for i in range(l):\n acc+=stones[i]\n accMin = acc\n for i in range(l,w-1):\n acc = acc - stones[i-l] + stones[i]\n accMin = min(acc,accMin)\n return accMin\n\n\ntemp = input().split()\n\nw = int(temp[0])\nl = int(temp[1])\ntemp = input().split()\nstones=[]\nfor stone in temp:\n stones.append(int(stone))\n\nprint(frogs(w,l,stones))\n\t\t\t \t\t\t \t \t\t\t\t \t \t \t", "linha = input().split()\n \nlargura = int(linha[0])\n \nl = int(linha[1])\n \nrio = input().split()\n \nfor i in range(len(rio)):\n \n rio[i] = int(rio[i])\n \nsoma = 0\n \nfor i in range(l):\n \n soma += rio[i]\n \n i+=1\n \nminim = soma\n \nfor i in range(l, largura-1):\n \n soma = soma - rio[i-l] + rio[i]\n \n minim = min(minim, soma)\n \nprint(minim)\n \t\t\t \t \t \t\t \t\t\t\t\t\t \t\t\t\t\t\t\t \t\t", "w, l = map(int, input().split())\nstones = list(map(int, input().split()))\n\nprefixSums = [0] * (w - l)\nprefixSums[0] = sum(stones[:l])\n\nfor i in range (w - 1 - l):\n prefixSums[i + 1] += prefixSums[i] + stones[i + l] - stones[i]\n\nprint(min(prefixSums))\n \t\t\t \t\t \t \t \t\t\t \t \t\t", "w, l = map(int, input().split())\nnumStonesList = list(map(int, input().split()))\ntotal = sum(numStonesList[:l])\naux = total\nfor i in range(l, w-1):\n total += numStonesList[i]\n total -= numStonesList[i-l]\n aux = min(total, aux)\nprint(aux)\n \t\t \t\t\t\t\t \t \t\t\t\t \t \t \t\t \t", "I=lambda:map(int,input().split())\nw,l=I()\na=list(I())\nc=s=sum(a[:l])\nfor i in range(w-l-1):\n s=s-a[i]+a[i+l]\n c=min(c,s)\nprint(c)\n \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t \t\t", "import sys\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(0x0FFFFFFF)\r\n# import threading\r\n# threading.stack_size(0x04000000)\r\n\r\nif __name__==\"__main__\":\r\n n,l=map(int,input().split())\r\n nums=list(map(int,input().split()))\r\n res=cur=sum(nums[:l])\r\n for start in range(n-l-1):\r\n cur+=nums[start+l]\r\n cur-=nums[start]\r\n res=min(res,cur)\r\n print(res)", "w, l = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ns = res = sum(a[:l])\r\nfor i in range(l, w - 1):\r\n s += a[i] - a[i - l]\r\n res = min(res, s)\r\nprint(res)\r\n ", "input_string = input().split()\nn = int(input_string[0])\nl = int(input_string[1])\ninput_string = input().split()\nv = []\nfor i in range(0, len(input_string)):\n\tv.append(int(input_string[i]))\ndp = [0]\nfor i in range(1, len(v) + 1):\n\tdp.append(dp[i-1] + v[i-1])\nans = 1000000000000000000000000000\nfor i in range(l, len(dp)):\n\tans = min(ans, dp[i] - dp[i - l])\nprint(ans)", "# Lê a largura w e o comprimento mínimo l\nw, l = map(int, input().split())\n\n# Lê os valores das pedras disponíveis\na = list(map(int, input().split()))\n\ns = [0] # Inicializa uma lista s com o valor inicial 0\nfor i in a:\n # Calcula as somas cumulativas\n s.append(s[-1] + i)\n # Cada elemento de s é a soma dos valores das pedras desde\n # o início até a posição atual\n\n# Inicializa a variável de resposta com um valor muito grande\ninf = pow(10, 9) + 1\nans = inf\n\n# Loop que percorre as possíveis posições de início da subsequência\n# dentro da sequência original\nfor i in range(l, w):\n dif = s[i] - s[i - l] # Diferença entre as somas cumulativas s(i) e s(i-l)\n # Atualiza a resposta com o menor entre o atual e a nova diferença\n ans = min(ans, dif)\n\n# Imprime a resposta final, que é o valor mínimo encontrado para\n# a soma da subsequência desejada\nprint(ans)\n", "Q = [int(x) for x in input().split(' ')]\nw = Q[0]\nl = Q[1]\nA = [int(x) for x in input().split(' ')]\nB = [0 for i in range(w-1)]\ni = 0\nj = 0\nfor i in range(w-1):\n\tif i<l:\n\t\tB[i]=A[i]\n\telse:\n\t\twhile j<i:\n\t\t\tif j<i-l:\n\t\t\t\tj=i-l\n\t\t\tt = min(A[i]-B[i],B[j])\n\t\t\tB[i]+=t\n\t\t\tB[j]-=t\n\t\t\tif B[j]==0:\n\t\t\t\tj+=1\n\t\t\telse:\n\t\t\t\tbreak\n\t#print(B)\n#print(A)\n#print(B)\nprint(sum(B[w-l-1:]))\n", "def cross_river(stones, jump):\n cur_sum = sum(stones[0:jump])\n min_sum = cur_sum\n left, right = 0, jump\n\n while right < len(stones):\n cur_sum = cur_sum - stones[left] + stones[right]\n min_sum = min(min_sum, cur_sum)\n\n left += 1\n right += 1\n\n return min_sum\n\n\ndef main():\n river_width, jump = map(int, input().strip().split())\n stones = list(map(int, input().strip().split()))\n\n print(cross_river(stones, jump))\n\n\nif __name__ == \"__main__\":\n main()\n\n\t \t\t\t\t \t \t \t\t \t \t \t\t\t\t\t \t\t", "from sys import stdin\r\n\r\nw,l = map(int, stdin.readline().split())\r\na = [0] + list(map(int, stdin.readline().split()))\r\n\r\nc = [0 for _ in range(w)]\r\ni,j = 1,1\r\nC = 0\r\nwhile j <= l:\r\n c[j] = a[j]\r\n a[j] = 0\r\n j+=1\r\n\r\nwhile i < w:\r\n while j<w and a[j]==0:\r\n j+=1\r\n if j-i > l:\r\n i+=1\r\n continue\r\n if j==w:\r\n C+=c[i]\r\n c[i]=0\r\n else:\r\n d = min(c[i],a[j])\r\n c[i]-=d\r\n a[j]-=d\r\n c[j]+=d\r\n if c[i]==0:\r\n i+=1\r\n\r\nprint(C)\r\n", "from itertools import *\r\nr=lambda:map(int,input().split())\r\nw,l=r()\r\nv=[0,*accumulate(r())]\r\nprint(min(v[i]-v[i-l] for i in range(l,w)))" ]

{"inputs": ["10 5\n0 0 1 0 2 0 0 1 0", "10 3\n1 1 1 1 2 1 1 1 1", "2 1\n0", "2 1\n5", "10 4\n0 0 6 2 7 1 6 4 0", "100 15\n0 0 1 1 1 0 1 1 1 1 0 1 1 1 0 1 0 0 1 0 1 1 1 0 0 1 1 0 0 1 0 0 1 0 0 1 0 1 0 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 0 1 0 0 1 0 0 1 1 0 1 0 1 0 0 1 0", "10 4\n10 10 10 10 10 10 10 10 10", "100 34\n16 0 10 11 12 13 0 5 4 14 6 15 4 9 1 20 19 14 1 7 14 11 10 20 6 9 12 8 3 19 20 4 17 17 8 11 14 18 5 20 17 0 3 18 14 12 11 12 5 5 11 7 9 17 4 8 4 10 0 0 12 9 15 3 15 14 19 12 6 8 17 19 4 18 19 3 8 3 9 1 6 15 4 16 1 18 13 16 3 5 20 11 10 9 9 17 20 15 12"], "outputs": ["3", "3", "0", "5", "8", "5", "40", "312"]}

UNKNOWN

PYTHON3

CODEFORCES

51

d0ae2caa308c79b1dd056ce059c51365

Trace

One day, as Sherlock Holmes was tracking down one very important criminal, he found a wonderful painting on the wall. This wall could be represented as a plane. The painting had several concentric circles that divided the wall into several parts. Some parts were painted red and all the other were painted blue. Besides, any two neighboring parts were painted different colors, that is, the red and the blue color were alternating, i. e. followed one after the other. The outer area of the wall (the area that lied outside all circles) was painted blue. Help Sherlock Holmes determine the total area of red parts of the wall. Let us remind you that two circles are called concentric if their centers coincide. Several circles are called concentric if any two of them are concentric. The first line contains the single integer *n* (1<=≤<=*n*<=≤<=100). The second line contains *n* space-separated integers *r**i* (1<=≤<=*r**i*<=≤<=1000) — the circles' radii. It is guaranteed that all circles are different. Print the single real number — total area of the part of the wall that is painted red. The answer is accepted if absolute or relative error doesn't exceed 10<=-<=4. Sample Input 1 1 3 1 4 2 Sample Output 3.1415926536 40.8407044967

[ "# Description of the problem can be found at http://codeforces.com/problemset/problem/157/B\r\n\r\nimport math\r\n\r\nn = int(input())\r\nl_s = list(map(int, input().split()))\r\nl_s.sort(reverse = True)\r\n\r\nt = 0\r\nfor index in range(n):\r\n t += (-1 if index % 2 == 1 else 1) * l_s[index] ** 2\r\n\r\nprint(t * math.pi)", "from math import pi\r\ninput()\r\nlst = [int(x) for x in input().split()]\r\n\r\nlst.sort(reverse=True)\r\narea = 0\r\nl = len(lst)\r\nfor i in range(0, l, 2):\r\n area += lst[i]*lst[i]\r\nfor i in range(1, l, 2):\r\n area -= lst[i]*lst[i]\r\n\r\nprint(area*pi)\r\n", "import math\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n if i % 2 != n % 2:\r\n if i == 0:\r\n ans += math.pi * a[i] ** 2\r\n else:\r\n ans += math.pi * (a[i] ** 2 - a[i - 1] ** 2)\r\nprint(ans)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(n%2!=0):\r\n d=l[0]**2\r\n a=1\r\nelse:\r\n a=0\r\n d=0\r\nfor i in range(a,n-1,2):\r\n d=d+(l[i+1]**2-l[i]**2)\r\nprint(d*math.pi)", "from math import *\r\n\r\nn = int(input())\r\nv = [int(i) for i in input().split()]\r\n\r\nif len(v) % 2 != 0:\r\n v.append(0)\r\nv.sort()\r\n\r\nres = 0\r\nfor i in range(1, n+1, 2):\r\n res += v[i]**2 - v[i-1]**2\r\nprint(\"%.10f\" % (res * pi))\r\n", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\nimport math\r\nimport os\r\nimport sys\r\nfrom sys import stdin,stdout\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**5)\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#-----------------------------------------------------------------\r\n\r\ndef regularbracket(t):\r\n p=0\r\n for i in t:\r\n if i==\"(\":\r\n p+=1\r\n else:\r\n p-=1\r\n if p<0:\r\n return False\r\n else:\r\n if p>0:\r\n return False\r\n else:\r\n return True\r\n\r\n#-------------------------------------------------\r\ndef binarySearchCount(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n\r\n count = 0\r\n\r\n while (left <= right):\r\n mid = int((right + left) / 2)\r\n\r\n # Check if middle element is\r\n # less than or equal to key\r\n if (arr[mid] <= key):\r\n count = mid+1\r\n left = mid + 1\r\n\r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n return count\r\n#------------------------------reverse string(pallindrome)\r\ndef reverse1(string):\r\n pp=\"\"\r\n for i in string[::-1]:\r\n pp+=i\r\n if pp==string:\r\n return True\r\n return False\r\n#--------------------------------reverse list(paindrome)\r\ndef reverse2(list1):\r\n l=[]\r\n for i in list1[::-1]:\r\n l.append(i)\r\n if l==list1:\r\n return True\r\n return False\r\n# endregion\r\nimport math\r\ndef mex(list1):\r\n #list1 = sorted(list1)\r\n p = max(list1)+1\r\n for i in range(len(list1)):\r\n if list1[i]!=i:\r\n p = i\r\n break\r\n return p\r\n#----endregion\r\n\"\"\"\r\ndef main():\r\n n,m = map(int,input().split())\r\n np = list(map(int,input().split()))\r\n mp = list(map(int,input().split()))\r\n np = sorted(np)\r\n mp = sorted(mp)\r\n cnt=0\r\n for i in np:\r\n if len(mp)==0:\r\n cnt+=1\r\n elif i in mp:\r\n continue\r\n elif i>max(mp):\r\n cnt+=1\r\n elif i<max(mp):\r\n #cnt-=1\r\n for j in mp:\r\n if j>i:\r\n mp.remove(j)\r\n break\r\n print(cnt)\r\n\"\"\"\r\n\"\"\"\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n max=0\r\n if len(arr)==1:\r\n print(1)\r\n elif len(arr)==2:\r\n print(2)\r\n else:\r\n cnt=2\r\n for i in range(n-2):\r\n if arr[i+2]==arr[i+1]+arr[i]:\r\n cnt+=1\r\n else:\r\n if cnt>max:\r\n max = cnt\r\n\r\n cnt=2\r\n if cnt>max:\r\n max=cnt\r\n print(max)\r\n\"\"\"\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr = sorted(arr)\r\n p=0\r\n if len(arr)%2!=0:\r\n c = (math.pi)*(pow(arr[0],2))\r\n arr.pop(0)\r\n i=0\r\n p=0\r\n while(i<len(arr)-1):\r\n p+=(math.pi*(pow(arr[i+1],2))) - ((math.pi*(pow(arr[i],2))))\r\n i+=2\r\n print(p+c)\r\n else:\r\n i=0\r\n while(i<len(arr)-1):\r\n p += (math.pi * (pow(arr[i + 1], 2))) - ((math.pi * (pow(arr[i], 2))))\r\n i+=2\r\n print(p)\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\nn = int(input())\narr = [int(x) for x in input().split()]\narr = [x ** 2 for x in sorted(arr)[::-1]]\nif(len(arr) % 2 == 1):\n\tarr = arr + [0]\ntotal = 0\nfor i in range(0, len(arr), 2):\n \ttotal += (arr[i] - arr[i+1])\nprint(math.pi * total)\n", "import math\r\n\r\ntc = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\n\r\nc = 0\r\nfor i in range(tc):\r\n c += (-1 if i % 2 == 1 else 1) * arr[i] ** 2\r\n\r\nprint(c * math.pi)", "#from collections import Counter\r\nimport math\r\n\r\npi = math.pi\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort(reverse=True)\r\n\r\ni = 0\r\narea = 0\r\nwhile i<len(arr):\r\n if i+1<len(arr):\r\n area += pi*(arr[i]**2-arr[i+1]**2)\r\n \r\n else:\r\n area += pi*(arr[i]**2)\r\n \r\n i += 2\r\n \r\nprint(area)", "from math import pi\r\n\r\nn = int(input())\r\ncircles = list(map(int, input().split(' ')))\r\ncircles.sort()\r\ncircles.reverse()\r\ns = 0\r\nfor i in range(1, len(circles) + 1):\r\n if i % 2 == 0:\r\n s -= circles[i - 1] ** 2 * pi\r\n else:\r\n s += circles[i - 1] ** 2 * pi\r\n\r\nprint(s)\r\n", "from math import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nl.sort()\r\nfor i in range(n):\r\n if(i%2==0):\r\n s=s+l[i]*l[i]\r\n else:\r\n s=s-(l[i]*l[i])\r\np=abs(s*pi)\r\nprint('%.10f'%p)\r\n", "from math import pi\r\nn = int(input())\r\narr = [int(i) for i in input().strip().split()]\r\narr.sort(reverse = True)\r\nif n % 2 != 0:\r\n arr.append(0)\r\nans = 0 \r\nfor i in range(0, len(arr), +2):\r\n ans += arr[i]**2 - arr[i+1]**2\r\nprint(pi*ans) ", "import math\r\n\r\nn = int(input())\r\nraios = [int(x) for x in input().split()]\r\n\r\nraios.sort()\r\n\r\nresultado = 0.0\r\nfor i in range(len(raios)-1, -1, -1):\r\n if i % 2 == 0:\r\n resultado += math.pi*pow(raios[i], 2)\r\n else:\r\n resultado -= math.pi * pow(raios[i], 2)\r\nif resultado >= 0:\r\n print(format(resultado, \".20f\"))\r\nelse:\r\n print(format(-resultado, \".20f\"))\r\n", "from math import pi\r\n\r\nn = int(input())\r\nr = sorted(map(int, input().split()), reverse=True)\r\nans = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans += r[i] ** 2\r\n else:\r\n ans -= r[i] ** 2\r\nprint(ans * pi)", "p=3.1415926536\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nl.append(0)\r\nl.sort()\r\nl=l[::-1]\r\n\r\ni=0\r\nj=1\r\ns=0\r\n\r\nwhile j<len(l):\r\n s=s+(pow(l[j],2)-pow(l[i],2))*p\r\n j+=2\r\n i+=2\r\n\r\nprint(abs(s))\r\n", "L=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nn=I()\r\na=sorted(L())\r\nx=0\r\nfor i in range(n):\r\n if i%2==0:\r\n x+=a[i]**2\r\n else:\r\n x-=a[i]**2\r\nprint(abs(x)*3.1415926536)\r\n", "import math\n\ndef solve(lst):\n\tres = 0\n\tlst.sort()\n\tfor i in range(len(lst)-1,-1,-2):\n\t\tif i == 0:\n\t\t\tres += (lst[i] ** 2) * math.pi\n\t\telse:\n\t\t\tres += (lst[i]**2 - lst[i-1]**2) * math.pi\n\treturn res\n\n\nn = input()\nnums = list(map(int, input().split()))\nprint (solve(nums))\n", "import math\n\nn = int(input())\nr = [int(x) for x in input().split()]\n\nr.sort()\ncount = 0\nk = 1\nwhile len(r) > 0:\n x = r.pop()\n count += k * x * x\n k *= -1\n\nval = math.pi * count\nprint(val)\n", "def intercala (lista,lado_esq,lado_dir):\r\n i = 0\r\n j = 0\r\n k = 0\r\n while i < len(lado_esq) and j < len(lado_dir):\r\n if lado_esq[i] > lado_dir[j]:\r\n lista[k] = lado_esq[i]\r\n i = i + 1\r\n else:\r\n lista[k] = lado_dir[j]\r\n j = j + 1\r\n k = k + 1\r\n while i < len(lado_esq):\r\n lista[k] = lado_esq[i]\r\n i = i + 1\r\n k = k + 1\r\n while j < len(lado_dir):\r\n lista[k] = lado_dir[j]\r\n j = j + 1\r\n k = k + 1\r\n return lista\r\n\r\ndef mergesort (lista):\r\n if len(lista) > 1:\r\n meio = len(lista) // 2\r\n lado_esq = lista[:meio]\r\n lado_dir = lista[meio:]\r\n mergesort(lado_esq)\r\n mergesort(lado_dir)\r\n intercala (lista,lado_esq,lado_dir)\r\n return lista\r\n\r\ndef concentricos(n,raios):\r\n mergesort(raios)\r\n total = 0\r\n if n % 2 == 1:\r\n raios.append(0)\r\n n = n + 1\r\n for i in range(n):\r\n if i % 2 == 0:\r\n total = total + (raios[i] ** 2) - (raios[i + 1] ** 2)\r\n total = total * 3.1415926536\r\n return total\r\n\r\nn = int(input())\r\nr = input().split()\r\nraios = []\r\nfor i in r:\r\n raios.append(int(i))\r\nprint(concentricos(n,raios))\r\n", "a=int(input())\r\nimport math\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nif len(b)%2==1:\r\n l=[b[i+1]*b[i+1]*math.pi-b[i]*b[i]*math.pi for i in range(len(b[1::])) if i%2==1]\r\n c=round(b[0]*b[0]*math.pi+sum(l),10)\r\nelse:\r\n l=[b[i]*b[i]*math.pi-b[i-1]*b[i-1]*math.pi for i in range(len(b)) if i%2==1]\r\n c=round(sum(l),10) \r\n\r\nprint(c)", "from math import *\r\n\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(int(1)):\r\n N = inl()[0]\r\n A = sorted(inl(), reverse=True)\r\n\r\n a = 0\r\n for i in range(0, N - 1, 2):\r\n a += pi * (pow(A[i], 2) - pow(A[i + 1], 2))\r\n\r\n print(a + pi * pow(A[-1], 2) * (N % 2))\r\n", "import sys\r\nimport math\r\nx=3.1415926536\r\nn=int(input())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nl.sort(reverse=True)\r\n#print(l)\r\nt=-1\r\ns=0\r\nfor i in l :\r\n s=s +t*(-1)*i*i\r\n t=-1*t\r\nprint(s*x)", "__author__ = '7877'\r\ndef solve():\r\n from math import pi\r\n n = int(input())\r\n rdl = list(map(int,input().split()))\r\n max_rad = 0\r\n for i in rdl:\r\n max_rad = max(max_rad, i)\r\n red_area = 0.0\r\n cur = 1\r\n for i in range(len(rdl)):\r\n red_area += (max_rad**2)*pi*cur\r\n rdl[rdl.index(max_rad)] = -1\r\n max_rad = 0\r\n cur *= -1\r\n for j in rdl:\r\n max_rad = max(max_rad, j)\r\n print(red_area)\r\n\r\n\r\nsolve()", "\r\npi = 3.14159265358\r\n\r\n\r\ndef main():\r\n ans = 0\r\n n = int(input())\r\n a = [int(x) ** 2 for x in input().split()]\r\n a.sort(key=lambda x: -x)\r\n\r\n for i in range(0, n - 1, 2):\r\n ans += a[i] - a[i + 1]\r\n if n % 2:\r\n ans += a[n - 1]\r\n ans = ans * pi\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "from math import pi\nn=int(input())\n\nL=list(map(int,input().split()))\n\nL.sort(reverse=True)\nans=0\nfor i in range(0,n,2):\n if(i==n-1):\n ans+=pi*(L[i]*L[i])\n else:\n ans+=pi*((L[i]*L[i])-(L[i+1]*L[i+1]))\nprint(ans)\n", "from math import pi\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nw.sort()\r\nk=1\r\nres=0\r\nwhile w:\r\n res+=k*pi*(w.pop())**2\r\n k*=-1\r\nprint(res)", "# -----Arkp-----#\r\nimport sys\r\nfrom math import *\r\nfrom collections import defaultdict\r\nimport sys\r\nI_map=lambda: map(int,input().split())\r\nS_map=lambda: map(str,input().split())\r\nF_map=lambda: map(float,input().split())\r\nN=lambda: int(input())\r\nS=lambda: input()\r\ndef INT_MAX():\r\n return sys.maxsize\r\ndef INT_MIN():\r\n return -sys.maxsize\r\n\r\ndef solve(n,l):\r\n res=0\r\n l.sort(reverse=True)\r\n if n%2!=0:\r\n res+=3.1415926536*(l[-1]**2)\r\n\r\n for i in range(0,n-1,2):\r\n res+=(3.1415926536*((l[i]**2)-(l[i+1]**2)))\r\n return res\r\n\r\n\r\n\r\nn=N()\r\nl=list(I_map())\r\nprint(solve(n,l))\r\n \r\n ", "import math\nn = int(input())\nr = [int(x) for x in input().split()]\nr = sorted(r, reverse=True)\ni = 0\narea_sum = 0\nwhile i < len(r) - 1:\n area_sum += (r[i]**2 - r[i + 1]**2)\n i += 2\nif len(r) % 2 != 0:\n area_sum += r[len(r) - 1]**2\nelse:\n pass\nprint(area_sum * 3.141592653589793)\n", "import math\r\nn = int(input())\r\nr = [int(x) for x in input().split()]\r\nr.sort()\r\na = 0\r\nif n%2==0:\r\n i = 1\r\n while i < len(r):\r\n a = a+(math.pi)*r[i]*r[i]\r\n i = i+2\r\n j = 0\r\n while j < len(r):\r\n a = a-(math.pi)*r[j]*r[j]\r\n j = j+2\r\n print(a)\r\nelse:\r\n i = 0\r\n while i < len(r):\r\n a = a+(math.pi)*r[i]*r[i]\r\n i = i+2\r\n j = 1\r\n while j < len(r):\r\n a = a-(math.pi)*r[j]*r[j]\r\n j = j+2\r\n print(a)", "pie = 3.1415926536\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort(reverse= True)\r\n\r\nred = 0\r\nblue = 0\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n red += A[i] ** 2\r\n else:\r\n blue += A[i] ** 2\r\n\r\nans = pie * (red - blue)\r\n\r\nprint(ans)\r\n", "import math\n\n\ndef square(j):\n return math.pi * x[j] ** 2\n\n\nn = int(input())\nx = list(map(int, input().split()))\nx.sort()\ntotal_square = 0\nif n % 2 == 0:\n for j in range(1, n, 2):\n total_square += square(j) - square(j - 1)\nelse:\n for j in range(0, n, 2):\n if j == 0:\n total_square += square(j)\n else:\n total_square += square(j) - square(j - 1)\nprint(total_square)\n", "#157B\r\nfrom math import pi\r\nn = int(input())\r\nr = list(map(float,input().split()))\r\nr.sort(reverse=True)\r\ns = 0\r\nfor i in range(n):\r\n s += r[i]**2*(-1)**i\r\nprint(pi*s)", "a=int(input())\r\narr=list(map(int,input().strip().split()))\r\narr.sort(reverse=True)\r\nans=0\r\nfor i in range(a):\r\n if i%2==0:ans+=(arr[i]**2)\r\n else:ans-=(arr[i]**2)\r\nprint(ans*3.1415926536)", "n=int(input())\r\nx=list(map(int, input().split()))\r\nx.sort()\r\nx.reverse()\r\nimport math\r\ns=0\r\nfor i in range(n):\r\n if i%2==0:\r\n s=s+x[i]*x[i]\r\n else:\r\n s=s-x[i]*x[i]\r\nr=s*math.pi\r\nprint(\"{:.10f}\".format(r))", "import math\r\ninput()\r\na = sorted(list(map(int,input().split(' '))))\r\nfor i in range(len(a)):\r\n\ta[i]=a[i]**2\r\nprint (math.pi*(sum(a[::-2])-sum(a[-2::-2])))", "n=int(input())\nlista=list(map(int,input().split()))\nlista.sort(reverse=True)\nresp=0\npi=3.1415926536\nsinal=True\nfor e in lista:\n if sinal:\n resp+=pi*(e**2)\n sinal=False\n else:\n resp-=pi*(e**2)\n sinal=True\nprint(\"%.10f\"%resp)\n \t \t \t \t\t \t \t \t \t\t", "n = int(input())\r\nl = list(map(int, input().split()))\r\npi = 3.1415926536\r\nl.sort()\r\nr = 0\r\nalterna = -1\r\nfor i in range(n -1, -1, -1):\r\n alterna *= -1\r\n r += (pi * (l[i]**2)) * alterna\r\nprint(r)", "import math\r\n\r\nn = int(input())\r\nvalores = []*n\r\nv = input().split()\r\nfor val in v:\r\n valores.append(int(val))\r\n\r\nvalores.sort(reverse=True)\r\n\r\narea = 0\r\nfor index in range(n):\r\n if index % 2 == 1: \r\n area += -1 * valores[index] ** 2\r\n else:\r\n area += 1 * valores[index] ** 2\r\n\r\nprint(area * math.pi)", "import math\r\nn=int(input())\r\nlist=[]\r\nlist=[int(i) for i in input().split()]\r\nlist.append(0)\r\nlist.sort(reverse=True)\r\nans=0\r\nfor i in range(0,n,2):\r\n ans+=(list[i]*list[i]-list[i+1]*list[i+1])\r\nprint(math.pi*ans)", "from sys import stdin,stdout\nfrom math import pi\n\nn = int(input())\n\nrs = list(map(int,stdin.readline().split()))\n\nrs.sort()\nrs.reverse()\nra = 0\n# print(rs)\nrs.append(0)\nfor i in range(len(rs)-1):\n if(i%2==0):\n dif = rs[i]**2*pi-rs[i+1]**2*pi\n ra+=dif\n # print(ra)\nprint(ra)\n \t\t\t \t\t\t \t \t \t \t \t \t \t", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort(reverse=True)\r\nl=len(x)\r\ns=0\r\nfor i,j in enumerate(x):\r\n if i%2==0:\r\n s+=(j*j)\r\n else:\r\n s-=(j*j)\r\nprint(s*3.1415926536)", "from math import pi\r\n\r\nn = int(input())\r\n\r\nraios = list(map(int, input().split(\" \")))\r\nraios.sort(reverse=True)\t\t\t\t\t# ORDENA RAIOS DESCRESCENTEMENTE\r\n\r\narea = 0\r\n\r\nfor i in range(0, n if n%2==0 else n-1, 2): # SE A QNT DE RAIOS É ÍMPAR CALCULAMOS\t\t\t\t\t\t\t\t\t\t\r\n\tarea += pi*raios[i]**2 # SOMENTE ATÉ O PENÚLTIMO CÍRCULO MAIS INTERNO\r\n\tarea -= pi*raios[i+1]**2\r\n\r\nif n%2==1:\t\t\t\t\t\t\t\t\t# SE A QNT DE RAIOS FOR ÍMPAR INCREMENTAMOS A ÁREA\r\n\tarea += pi*raios[n-1]**2 # COM AQUELA DA CIRCUNFERÊNCIA NÃO CONTABILIZADA\r\n\r\nprint(area)", "input()\nl = sorted(int(a)*int(a) for a in input().split())\nprint(3.1415926536 * (sum(l[::-2])-sum(l[-2::-2])))\n \t\t\t\t \t \t \t \t\t\t \t \t\t \t\t", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nans=0\r\nfor z in range(0,len(a),2):\r\n ans+=a[z]**2\r\n if(z+1<len(a)):\r\n ans-=a[z+1]**2\r\n\r\nprint(math.pi*ans)", "import math\r\n\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nif len(x)%2==1:\r\n x.append(0)\r\nx.sort()\r\nx=x[::-1]\r\ns=0\r\ni=0\r\nwhile(i<len(x)):\r\n s+=(x[i]**2)-(x[i+1]**2)\r\n i+=2\r\nprint('%.10f'%(math.pi*s))\r\n", "# test\nimport math\nx = int(input())\ny = [int(i) for i in input().split()]\ny.sort(reverse = True)\ncounter = 0\ntest = 0\nfor items in y :\n if test == 0:\n counter += pow(items,2)\n test = 1\n else: \n test = 0\n counter -= pow(items,2)\nprint(counter * math.pi)\n \t \t\t \t\t \t\t \t\t\t\t \t\t\t", "import math\nn = int(input())\nr = [int(x) for x in input().split()]\nspaces = [math.pi * rad ** 2 for rad in sorted(r)[::-1]]\nprint(sum(spaces[::2]) - sum(spaces[1::2]))\n\n \t\t \t\t\t\t \t\t \t\t \t\t \t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=True) + [0]\r\n\r\ns = 0\r\nfor i in range(0, n, 2):\r\n s += w[i]**2 - w[i+1]**2\r\nprint(s*math.pi)", "from math import pi\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\na.append(0)\r\nans=0\r\nfor i in range(0,n,2):\r\n\tans+=pi*(a[i]*a[i]-a[i+1]*a[i+1])\r\nprint(ans)\r\n", "pi = 3.14159\r\nt= int(input())\r\narr = list(map(lambda x: int(x), input().split()))\r\nif t%2==0:\r\n start = 1\r\nelse: \r\n start = 0\r\n\r\nres = 0\r\n\r\narr = sorted(arr)\r\nfor i in range(start,t,2):\r\n if i==0:\r\n res+=(pi*(arr[i]**2))\r\n continue\r\n res+= abs(((pi*(arr[i-1]**2))-(pi*(arr[i]**2))))\r\nprint('%.10f' % res)\r\n\r\n", "import math\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\npi = math.asin(1) * 2\r\narr.sort(reverse=True)\r\nr = 0\r\nfor i in range(n):\r\n r += arr[i] * arr[i] * (1 - i % 2 * 2)\r\n\r\nprint(pi*r)", "import math\r\n\r\nN = int(input())\r\n\r\ntowers = {}\r\n\r\na = [int(i) for i in input().split()]\r\n\r\na.sort(reverse=True)\r\nif N % 2 == 1:\r\n a.append(0)\r\n N += 1\r\n\r\nres = 0\r\n\r\nfor i in range(0, N, 2):\r\n res += math.pi * (a[i] * a[i] - a[i + 1] * a[i + 1])\r\n\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nfor i in range (n):\r\n if(i%2==0):\r\n ans+=(l[i]*l[i])\r\n else:\r\n ans-=(l[i]*l[i])\r\n\r\nans=3.1415926536* ans\r\nprint(ans)\r\n\r\n", "n = input()\nr = input().split()\nn = int(n)\narea = 0\nfor i in range(n):\n r[i] = int(r[i])\nr.sort(reverse=True)\nfor j in range(1, n+1):\n if j%2==0:\n area -= ((r[j-1]**2)*3.1415926536)\n else: \n area += ((r[j-1]**2)*3.1415926536)\nprint(area)\n\t\t\t\t \t\t \t\t \t \t\t\t\t\t \t \t \t\t", "import math\r\n\r\n\r\ndef main():\r\n input()\r\n radius = [int(e) for e in input().split(\" \")]\r\n areas = [(math.pi * (r*r)) for r in radius]\r\n areas.sort(reverse=True)\r\n\r\n area = areas[0]\r\n for i in range(1, len(areas)):\r\n if i % 2 == 0:\r\n area += areas[i]\r\n else:\r\n area -= areas[i]\r\n\r\n print(area)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nif len(a)%2:\r\n a=a+[0]\r\nc=0 \r\nfor i in range(0,len(a),2):\r\n c+=math.pi*(a[i]**2-a[i+1]**2)\r\n\r\nprint(\"{0:.6f}\".format(c))\r\n \r\n\r\n ", "from math import pi\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nj=n-1\r\ncount_=0\r\nwhile j>=0:\r\n if j!=0:\r\n count_+=pi*(r[j]**2-r[j-1]**2)\r\n else:\r\n count_+=pi*(r[j]**2)\r\n j-=2\r\nprint(count_)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n%2==1:\r\n s=3.1415926536*(l[0]**2)\r\n for i in range(2,n,2):\r\n s+=(3.1415926536*(l[i]**2)-3.1415926536*(l[i-1]**2))\r\nelse:\r\n s=0\r\n for i in range(1,n,2):\r\n s+=(3.1415923536*(l[i]**2)-3.1415923536*(l[i-1]**2))\r\nprint(s)\r\n", "n = int(input())\r\nr = list(map(int,input().split()))\r\nr = sorted(r)[::-1]\r\npi = 3.1415926536\r\narea = 0\r\nfor i in range(n):\r\n if i%2==0:\r\n area+=pi*r[i]*r[i]\r\n else:\r\n area-=pi*r[i]*r[i]\r\nprint(area)", "import math\r\nn = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl1.sort()\r\narea = 0\r\nif n%2==0:\r\n i = 1\r\n while i<n:\r\n area+=(l1[i]**2-l1[i-1]**2)\r\n i+=2\r\nelse:\r\n i = 0\r\n while i<n:\r\n if i==0:\r\n area+=(l1[i]**2)\r\n else:\r\n area+=(l1[i]**2-l1[i-1]**2)\r\n i+=2\r\nprint(round(area*(math.pi),10))", "import math\nn = int(input())\ncircles = input().split()\ncircles = [int(i) for i in circles]\nif circles.sort() != None:\n circles = circles.sort()\n\nresult = 0\n\nfor i in range(n - 1,-1,-1):\n if (n + i) % 2 == 0:\n result -= circles[i]**2 * math.pi\n else:\n result += circles[i]**2 * math.pi\n\nprint(result)\n\t\t \t\t\t \t \t\t\t\t\t \t \t\t", "from sys import stdin, stdout\r\nfrom math import pi\r\nn = int(stdin.readline())\r\nr = list(map(int,stdin.readline().split(' ')))\r\nr.sort(reverse=True)\r\nc = 0\r\nfor k in range(n//2):\r\n c += r[2*k]**2-r[2*k+1]**2\r\nif n % 2 == 1:\r\n c += r[n-1]**2\r\nstdout.write(str(pi*c))", "import math, array, re\n \ndef read_int():\n return int(input().strip())\n \ndef read_ints():\n return list(map(int, input().strip().split()))\n \ndef read_str():\n return input().strip()\n \ndef read_strs():\n return input().strip().split()\n\nif __name__ == '__main__':\n n = read_int()\n r = sorted(read_ints(), reverse=True)\n\n area = 0\n\n for i in range(n):\n if i % 2 == 0:\n area += math.pi * r[i] ** 2\n else:\n area -= math.pi * r[i] ** 2\n\n print(area)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\na.sort()\r\nred=0\r\nblue=0\r\nfor i in range(0,len(a)):\r\n if i%2==0:\r\n red+=a[i]*a[i]\r\n else:\r\n blue+=a[i]*a[i]\r\nred*=3.1415926536\r\nblue*=3.1415926536\r\nprint(abs(red-blue))", "\n\ndef solve(n,arr):\n def ar(n):\n from math import pi\n return round(pi*n**2,10)\n if n <=1 :\n return ar(arr[0])\n \n arr.sort(reverse=True)\n arr.append(0)\n val=0\n for i in range(n) :\n if i%2==0 :\n val+=ar(arr[i])-ar(arr[i+1])\n return val\n\n\n\n\n \t\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n\n\nn=int(input())\nl=[int(x)for x in input().split()]\n\n\nprint(solve(n,l))", "import math\r\n\r\nn = int(input())\r\nrs = list(map(int, input().split()))\r\nrs.sort(reverse=True)\r\n\r\nred = True\r\n\r\ns = 0\r\n\r\nfor r in rs:\r\n if red:\r\n s += r * r\r\n else:\r\n s -= r * r\r\n red = not red\r\n\r\nprint(s * math.pi)\r\n", "input();s=sorted(map(lambda x:int(x)**2,input().split()))\r\nprint(abs(sum(s[::2])-sum(s[1::2]))*3.1416)", "while True:\r\n\ttry:\r\n\t\timport math\r\n\t\tdef soln(n, a):\r\n\t\t\ta.sort(reverse = True)\r\n\t\t\tres = 0\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tif i & 1:\r\n\t\t\t\t\tres -= (math.pi*a[i]**2)\r\n\t\t\t\telse:\r\n\t\t\t\t\tres += math.pi*a[i]**2\r\n\t\t\tprint(res)\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\tn = int(input())\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\tsoln(n, a)\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "from math import pi\r\n\r\ninput()\r\ns = 0\r\nodd = True\r\n\r\nfor r in sorted(map(int, input().split()), reverse=True):\r\n s += r*r if odd else -r*r\r\n odd ^= True\r\n\r\nprint(pi*s)", "from math import pi\r\ninput()\r\na=sorted(map(int,input().split()),reverse=True)\r\nprint(sum(map(lambda x:pi*a[x]**2*(-1)**x,range(len(a)))))", "n= int(input())\na=list(map(int,input().split(' ')))\na.sort()\nred_area=0\nfor i in range(len(a)):\n\tif len(a)%2==1:\n\t\tif i%2==0:\n\t\t\tred_area=red_area+a[i]**2\n\t\telse:\n\t\t\tred_area=red_area-a[i]**2\n\telse:\n\t\tif i%2==1:\n\t\t\tred_area=red_area+a[i]**2\n\t\telse:\n\t\t\tred_area=red_area-a[i]**2\nprint(red_area*3.1415926536)\n", "n = int(input())\r\na = sorted(list(map(float,input().split())))\r\na = a[::-1]\r\npi = 3.14159265359\r\nans = 0;\r\nfor i in range(0,len(a),1):\r\n if i%2==1:\r\n ans-=pi*a[i]**2\r\n else:\r\n ans+=pi*a[i]**2\r\nprint(ans)", "import heapq\r\nimport math\r\n\r\n\"\"\"\r\n\tversão comentada:\r\n\r\n\tProblema, temos circulos com mesmo centro, como termos uma intercalação cores\r\n\té garantido uma das cores é a areas entre o maior circulo para o segundo maior circulo.\r\n\tE a proxima cor, seria entre o segundo maior e o terceiro maior.\r\n\t\r\n\tentão sera r[1..n] o vetor ordenado do maior para o menor 'n' raio dos 'n' circulos\r\n\r\n\tA area total seria essa interalação começando pelo r[1] até r[2]\r\n\r\n\tArea = pi(r[1])^2 - pi(r[2])^2 + pi(r[3])^2 - ... + pi(r[n])^2\r\n\t\r\n\tnotasse que o sinal tbm intercala, botamos pi em evidencia temos:\r\n\tArea = pi(r[1]^2 - r[2]^2 + r[3]^2 - ... +- r[n]^2)\r\n\r\n\tum loop é suficiente, e multiplicamos com pi apenas só no final:\r\n\tpara intercalar o sinal para elevar (-1)^i | i = 1,2, ..., n\r\n\t \r\n\"\"\"\r\ndef Trace(n):\r\n\tr = [int(i) for i in input().split(\" \")]\r\n\tr = mergesort(r)\r\n\tpartial_sum = 0\r\n\tj = 0\r\n\tfor i in reversed(range(n)):\r\n\t\tpartial_sum += ((-1)**j)*r[i]**2\r\n\t\tj = j + 1\r\n\t\r\n\treturn math.pi*(partial_sum)\r\n\t\r\ndef mergesort(V):\r\n\ti,s = 0, len(V)\r\n\t\r\n\tif s-i < 2 :\r\n\t\treturn V[i:s]\r\n\r\n\tmeio = (i+ s) // 2\r\n\t\r\n\tV1 = mergesort(V[i:meio])\r\n\t\r\n\tV2 = mergesort(V[meio:s+1])\r\n\r\n\treturn merge(V1, V2)\r\n\t\r\ndef merge(V1:list,V2:list):\r\n\tL = [V1,V2]\r\n\tT = [len(V1),len(V2)]\r\n\tn = (len(V1)+len(V2))\r\n\tV = [None]*n\r\n\tH = []\r\n\r\n\tI = [0]*2\r\n\theapq.heappush(H,(V1[0],0))\r\n\theapq.heappush(H,(V2[0],1))\r\n\r\n\tv = 0\r\n\t\r\n\twhile v < n:\r\n\t\titem,index = heapq.heappop(H)\r\n\t\tV[v] = item\r\n\t\tv += 1\r\n\t\tI[index] += 1\r\n\t\tif I[index] < T[index]:\r\n\t\t\t\theapq.heappush(H,(L[index][I[index]],index))\r\n\treturn V\r\n\r\ndef __main__():\r\n\r\n\tn = int(input())\r\n\tprint(Trace(n))\r\n\r\nif __name__ == '__main__':\r\n\t__main__()", "from math import pi\nn = int(input())\na = [int(x) for x in input().split()]\na.sort()\nfor i in range(len(a) - 2, -1, -2):\n\ta[i] = -a[i]\nprint(pi * sum(x * x * (-1 if x < 0 else 1) for x in a))\n", "quant=int(input())\nn=input().split()\nvermelho=0\nazul=0\npi=3.1415926536\nfor x in range(quant):\n n[x]=int(n[x])\nn=sorted(n)\nfor x in range(quant):\n if(x%2==0):\n area=n[x]*n[x]*pi\n vermelho=vermelho+area\n else:\n area=n[x]*n[x]*pi\n azul=azul+area\nif(len(n)%2==0):\n print(azul-vermelho)\nelse:\n print(vermelho-azul)\n \n\n\t \t \t\t \t\t \t \t\t\t \t\t \t \t", "pi = 3.141592653589793\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\nL.sort(reverse=True)\r\nans = 0.0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans += L[i]**2\r\n else:\r\n ans -= L[i]**2\r\nprint(ans * pi)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------06.04.2020-------------\r\n\r\nimport math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort(reverse=True);E=0\r\nfor i in range(n):\r\n if i%2==0:\r\n if i!=n-1:\r\n E+=r[i]**2*math.pi-math.pi*r[i+1]**2\r\n else:\r\n E+=r[i]**2*math.pi\r\nprint(\"%.12f\"%E)\r\n", "n = int(input())\nr = list(map(int, input().split()))\nr = sorted(r, reverse = True)\nimport math\ntotal = 0\n\nfor x in range(n):\n if x%2 == 0:\n total += math.pi *(r[x]**2)\n else:\n total -= math.pi * (r[x]**2)\n\nprint(total)\n#This is my code\n \t\t \t \t\t\t \t \t\t\t \t \t\t", "import math\n\nn1 = int(input())\nnum = 0\n\nx = list(map(int, input().split()))\nx.sort()\n\nfor j in range(n1):\n aux = (x[j] ** 2) * math.pi\n\n if n1 % 2 == 0:\n if j % 2 == 0:\n aux = -aux\n \n else:\n if (j % 2 != 0):\n aux = -aux\n \n num += aux\n\nprint(num)\n\n\t\t \t \t\t\t\t \t\t \t \t\t\t\t \t \t\t\t", "import math\nn = int(input())\narr = list(map(int,input().strip().split()))[:n]\narr.sort(reverse=True)\narea = 0;\nif(n%2):\n area = math.pi * arr[n-1] * arr[n-1]\nfor i in range(0, n-1, 2):\n area += (math.pi * arr[i] *arr[i]) - (math.pi * arr[i+1] *arr[i+1])\nprint(area)\n\t\t\t \t\t\t\t \t\t \t \t\t \t\t\t\t\t \t", "n=int(input())\r\nq=n%2\r\nk=0\r\nz=0\r\npi=3.1415926536\r\na=sorted(map(int,input().split()))\r\nfor i in range(n):\r\n r=a[i]\r\n if i%2!=q:\r\n k+=(r*r-z*z)*pi\r\n z=r\r\nprint(k)", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\ni=n-1\r\ns=math.pi*r[i]**2\r\nans,z=s,1\r\nwhile True:\r\n if i==0:break\r\n i-=1\r\n z*=-1\r\n s=math.pi*r[i]**2\r\n ans+=(z*s)\r\nprint(ans)\r\n \r\n \r\n", "\"\"\"\nArthur Vargas Costa Pereira\n2011054197\nMeteoros - SPOJ/METEORO\n\nVerificar se as coordenadas passadas estão dentro do retângulo. Para fazer isto basta comparar se ambos\nos eixos do ponto passado estão entre os eixos do retângulo.\n\n\"\"\"\nimport math\n\nn = int(input())\nr = list(map(int, input().split()))\nr.sort()\narea = 0.0\nfor i in range(n):\n if(i % 2 == 0):\n area += r[i] * r[i]\n else:\n area -= r[i] * r[i]\n\nprint(\"%.10f\" % abs(area * math.pi))\n", "n=int(input())\r\nans=0\r\nk=1\r\nfor r in sorted(map(int,input().split())):\r\n ans+=r*r*k\r\n k*=-1\r\nprint(abs(ans*3.1416))\r\n", "import math\na = int(input())\nv = [int(i) for i in input().split()]\nres1 = 0\nres2 = 0\nfor i in range(a):\n v = sorted(v, reverse=True)\n if i%2 == 0:\n res1 += v[i]*v[i]\n else:\n res2 += v[i]*v[i]\n\n\nres = res1 - res2\n# print(res1, res2)\nprint(res*math.pi)\n", "# LUOGU_RID: 120107899\nn = int(input())\nrs = sorted(list(map(int, input().split())))[::-1]\nred = 0\nf = 0\nfor i in range(n):\n red += pow(rs[i], 2) * pow(-1, f)\n f = not f\nprint(red * 3.1415926536)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse = True)\r\nans = 0\r\nfor i in range(n):\r\n if (i&1):\r\n ans -= l[i]**2\r\n else:\r\n ans += l[i]**2\r\nans = ans*3.1415926536\r\nprint(ans)\r\n \r\n ", "\r\n\r\nfrom math import pi\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nif n%2 != 0:\r\n ans = pi*(l[0]**2)\r\n\r\n for i in range(2,n,2):\r\n ans+=(pi*((l[i]**2) - l[i-1]**2))\r\n\r\nelse:\r\n\r\n ans = 0\r\n\r\n for i in range(1,n,2):\r\n ans+=(pi*((l[i]**2) - l[i-1]**2))\r\n\r\nprint(ans)", "from math import pi\r\nn=int(input())\r\nsum=0\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nfor i in range(0,len(arr)):\r\n if(i%2==1):\r\n sum-=arr[i]*arr[i]\r\n else:\r\n sum+=arr[i]*arr[i]\r\nprint(pi*abs(sum))", "from math import pi\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))[::-1]\r\ntotal = 0\r\nif n % 2 == 0:\r\n for i in range(0, n, 2):\r\n total += a[i]**2 * pi - a[i+1]**2*pi\r\n print(round(total, 10))\r\nelse:\r\n for i in range(0, n - 1, 2):\r\n total += a[i]**2 * pi - a[i+1]**2*pi\r\n print(round(total + a[-1]**2*pi, 10))", "from math import pi\r\nn, s = int(input()), 0\r\nt = list(map(int, input().split()))\r\nt.sort(reverse = True)\r\nfor i in t:\r\n s = - (s + i * i)\r\nprint(abs(s) * pi)", "from math import pi\r\nn = int(input())+1\r\nradius = [0]+list(map(int, input().split()))\r\nradius.sort()\r\narea = lambda x: pi*x*x\r\ni = 1\r\nif n%2:\r\n i += 1\r\ntot = 0\r\nwhile i<n:\r\n tot += area(radius[i])-area(radius[i-1])\r\n i += 2\r\nprint(tot)\r\n", "#157B\r\nfrom math import pi\r\nn = int(input())\r\nr = sorted(list(map(int, input().split(\" \"))))\r\nans = 0\r\nk = 1\r\nfor i in r:\r\n ans += k*i*i\r\n k *=-1\r\nprint(pi*abs(ans))\r\n", "#!/usr/bin/python3\r\nimport math\r\ndef circleArea(r):\r\n return r*r*math.pi\r\nn = int(input())\r\nelements = list(map(int, input().strip().split()))\r\nelements.sort(reverse=True)\r\ntotA = 0\r\nfor index in range(0, len(elements)):\r\n if (index+1) % 2 == 0:\r\n totA -= circleArea(elements[index])\r\n elif (index+1) % 2 != 0:\r\n totA += circleArea(elements[index])\r\nprint(totA)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\narr=arr[::-1]\r\npi=3.1415926536\r\nans=0\r\nfor i in range(n):\r\n if(i&1==0):\r\n ans+=(arr[i]*arr[i])\r\n else:\r\n ans-=(arr[i]*arr[i])\r\nans=pi*ans\r\n\r\nprint(\"{0:.10f}\".format(ans))", "n=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\na=t[::-1]\r\no=0\r\ne=0\r\nimport math\r\n\r\nfor k in range(1,n+1):\r\n if k%2==0:\r\n e+=a[k-1]**2\r\n else:\r\n o+=a[k-1]**2\r\n\r\nprint(round((o-e)*math.pi,10))\r\n \r\n \r\n", "from math import pi\r\n\r\nn = int(input())\r\nraios = list(map(int, input().split(\" \")))\r\n\r\nraios.sort(reverse=True)\r\n\r\narea = [0]*n\r\n\r\narea[0] = pi*raios[0]**2\r\n\r\nfor i in range(1,n):\r\n if i%2==0:\r\n area[i] = area[i-1] + pi*raios[i]**2\r\n else:\r\n area[i] = area[i-1] - pi*raios[i]**2\r\n\r\nprint(area[-1])", "import math\r\n\r\nn = int(input())\r\ndata = sorted(map(int, input().split()), reverse=True) + [0]\r\ns = 0\r\nfor i in range(0, n, 2):\r\n s += (data[i]**2 - data[i + 1]**2) * math.pi\r\n\r\nprint(s)", "num = int(input())\r\nc = 0\r\np = list(map(int,input().split()))\r\np.sort()\r\np.reverse()\r\nk = 0\r\nfor i in p:\r\n if k == 0:\r\n c += i**2\r\n k = 1\r\n elif k == 1:\r\n c -= i**2\r\n k = 0\r\nprint(c*3.1415926535897932384626433)\r\n \r\n", "import math\nqtd_circulos = int(input())\n\nsoma = 0\nareas = [int(v) for v in input().split()]\n\nareas.sort(reverse=True)\nfor i in range(qtd_circulos):\n if i%2 == 0:\n soma += (int(areas[i])**2)\n if i%2 != 0:\n soma -= (int(areas[i])**2)\n\nprint(round(math.pi*soma, 10))\n\n\t \t \t\t \t\t \t\t \t\t \t \t \t \t\t\t\t\t", "#n = int(input())\r\n#n, m = map(int, input().split())\r\n#d = list(map(int, input().split()))\r\n\r\nimport math\r\nn = int(input())\r\nd = sorted(list(map(int, input().split())), reverse = True)\r\n\r\nr = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n r += math.pi * d[i]**2\r\n else:\r\n r -= math.pi * d[i]**2\r\nprint(r)\r\n\r\n\r\n\r\n", "n=int(input())\nr=input().split()\n\nr=[int(x) for x in r]\nr.sort(reverse=True)\n\narea=0\nfor index, element in enumerate(r):\n\tif index % 2 == 0:\n\t area=element**2+area\n\telse:\n\t area=area-(element**2)\n\t \nprint(3.14159*area)\n \t\t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t\t", "len1=int(input())\r\nlist1=list(map(int,input().rstrip().split()))\r\nlist1.sort()\r\nlist1=list1[::-1]\r\narea_red=list1[0]*list1[0]*3.1415926536\r\ni=1\r\nwhile(i<len1):\r\n if(i%2!=0):\r\n area_red-=3.1415926536*list1[i]*list1[i]\r\n else:\r\n area_red+=3.1415926536*list1[i]*list1[i]\r\n i+=1\r\nprint(area_red)\r\n ", "n = int(input())\na = list(map(int, input().split()))\n\n\nfrom math import pi\n\na.sort(reverse=True)\n\np = []\nm = []\n\ns = 0\nboolean = False\nfor i in a:\n boolean = not boolean\n if boolean:\n s += i*i\n else:\n s -= i*i\n\nprint(pi*s)", "import math\nn=int(input())\ns=list(map(int,input().split()))\ns.sort()\nsum=0\nx=1\nfor i in s:\n sum+=x*i*i\n x*=-1\n \nprint(math.pi*abs(sum))\n\t \t \t \t\t \t \t\t\t \t \t\t \t\t", "import math\n\nnum_rads = int(input())\nrads = [int(x) for x in input().split()]\n\nrads.sort()\n\npositive = 0\nnegative = 0\n\nfor i in range(num_rads):\n if num_rads % 2 == 0:\n if i % 2 == 0:\n negative += rads[i] ** 2\n else:\n positive += rads[i] ** 2\n else:\n if i % 2 == 0:\n positive += rads[i] ** 2\n else:\n negative += rads[i] ** 2\n\nprint((positive - negative) * math.pi)\n\n\t\t \t \t\t \t\t\t\t\t \t\t \t\t \t\t \t\t\t\t", "n=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nsum=0\r\nif n%2!=0:\r\n sum=r[0]**2\r\nfor i in range(n-1,0,-2):\r\n sum=sum+(r[i]**2)-(r[i-1]**2)\r\nprint(sum*3.1415926536)\r\n", "import math\r\nn = int(input())\r\nr = list(map(int,input().split()))\r\nr.sort()\r\na=0\r\nif(n%2==0):\r\n for i in range(0,n,2):\r\n a+=r[i+1]**2 - r[i]**2\r\nelse:\r\n for i in range(1,n,2):\r\n a+=r[i+1]**2 - r[i]**2\r\n a+=r[0]**2\r\nprint(\"{:0.10f}\".format(a*math.pi))", "n,area,pi= int(input()),0,3.141592653589793\r\narr= list(map(int, input().split()))\r\narr.sort(),arr.insert(0,0)\r\nif n%2==1:\r\n for i in range(1,n+1,2):area+= pi*arr[i]*arr[i]-pi*arr[i-1]*arr[i-1]\r\nelse:\r\n for i in range(2, n+1,2): area+= pi*arr[i]*arr[i]-pi*arr[i-1]*arr[i-1]\r\nprint(area)", "pi=3.14159265358979323846264338\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nans = 0\r\nfor i in range(n):\r\n ans += (-1)**i*l[i]**2\r\nprint(ans*pi)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npi=3.1415926536\r\ncount=0\r\nsub=0\r\nfor i in range(n):\r\n if n%2==0:\r\n if i%2!=0:\r\n count+=(pi*(l[i]**2))\r\n else:\r\n sub+=(pi*(l[i]**2))\r\n else:\r\n if i%2==0:\r\n count+=(pi*(l[i]**2))\r\n else:\r\n sub+=(pi*(l[i]**2))\r\nprint(count-sub) \r\n \r\n \r\n \r\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)**2+(y-d)**2)\ndef circle(x1, y1, x2,y2, r1, r2): \n \n distSq = (((x1 - x2)* (x1 - x2))+ ((y1 - y2)* (y1 - y2)))**(.5) \n \n if (distSq + r2 <= r1): \n return True\n else: \n return False\nn=I()\nl=L()\nl.sort(reverse=True)\nc=0\nfor i in range(0,n,2):\n if(i+1)<n:\n c+=(l[i]**2-l[i+1]**2)\n else:\n c+=l[i]**2\n\nprint(mt.pi*c)\n \n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsum = 0\r\na.sort()\r\nfor i in range(n-1, -1, -1):\r\n s = math.pi * a[i] * a[i]\r\n\r\n if n % 2 == 0:\r\n if i % 2 != 1:\r\n s = 0 - s\r\n else:\r\n if i % 2 == 1:\r\n s = 0 - s\r\n sum += s\r\nprint(sum)\r\n", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n%2!=0:\r\n l.insert(0,0)\r\nprint(sum((l[i+1]**2-l[i]**2)*pi for i in range(len(l)-2,-1,-2)))", "n=int(input(''))\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nl=list(filter(lambda x:r.index(x)%2==0,r))\r\nk=list(filter(lambda x:r.index(x)%2!=0,r))\r\ns=sum(list(map(lambda x:x**2,l)))\r\np=sum(list(map(lambda x:x**2,k)))\r\nprint(3.1415926536*abs(s-p))", "import math\r\n\r\nn = int(input())\r\nr = list(map(int, input().split()))\r\nk=0\r\nr.sort()\r\noutS = 0\r\nif n%2 == 0:\r\n color = 'blue'\r\nelse:\r\n color = 'red'\r\n outS += math.pi * (r[0]**2)\r\nfor i in range(1, n):\r\n if color == 'blue':\r\n outS += math.pi * (r[i]**2 - r[i-1]**2)\r\n color = 'red'\r\n else:\r\n color = 'blue'\r\n\r\n\r\nprint(outS)\r\n", "# tc = int(input())\r\nfrom math import pi\r\n\r\n\r\ntc = 1\r\nwhile tc:\r\n # inp = [int(x) for x in input().split()]\r\n n = int(input())\r\n # n, c, q = inp[0], inp[1], inp[2]\r\n # s = input()\r\n # q = input()\r\n r = [int(x) for x in input().split()]\r\n r.sort()\r\n area_red = 0\r\n if n % 2 != 0:\r\n area_red += r[0] ** 2\r\n for i in range(1, n - 1, 2):\r\n area_red += (r[i+1]-r[i])*(r[i+1]+r[i])\r\n else:\r\n for i in range(0, n, 2):\r\n area_red += (r[i+1]-r[i])*(r[i+1]+r[i])\r\n print(pi*area_red)\r\n tc -= 1\r\n", "n = int(input())\r\nk = list(map(int,input().split()))\r\nx=0\r\nk.sort()\r\np=3.1415926535897931\r\nfor i in range(n-1,n%2-1,-2):\r\n x+=(k[i]*k[i]-k[i-1]*k[i-1])\r\nx+=((k[0]*k[0])*(n%2))\r\nprint(p*x)", "from math import pi\r\nlength = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nif length%2!=0:\r\n arr.append(0)\r\n length += 1\r\nans = 0\r\nfor i in range(0,length,2):\r\n ans += pi*(arr[i]*arr[i] - arr[i+1]*arr[i+1])\r\nprint(round(ans,10))\r\n\r\n", "import math\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n if i % 2 ==0:\r\n ans+=l[n-i-1]**2\r\n else:\r\n ans-=l[n-i-1]**2\r\n\r\nprint(ans*math.pi)", "import math\n\ndef calculaArea(entrada):\n valores = [int(valor) for valor in entrada]\n valores.sort()\n\n sum = 0\n\n if(len(valores)%2 != 0):\n\n for i in range(len(valores)):\n if(i % 2 == 0):\n sum += valores[i]**2\n else:\n sum -= valores[i]**2\n\n return round(sum * math.pi, 10)\n\n else:\n\n for i in range(len(valores)):\n if(i % 2 != 0):\n sum += valores[i]**2\n else:\n sum -= valores[i]**2\n\n return round(sum * math.pi, 10)\n\nnum = int(input())\nentrada = input().split()\n\nprint(calculaArea(entrada))\n\t\t\t \t \t\t \t\t\t \t\t \t\t \t\t \t \t", "import math\nn = int(input())\na = list(map(int,input().split(' ')))\na.sort()\nans = 0\nif (n%2 == 0):\n\tfor i in range(len(a)):\n\t\tif i%2 == 0:\n\t\t\tans-=a[i]**2\n\t\telse:\n\t\t\tans+=a[i]**2\nelse:\n\tfor i in range(len(a)):\n\t\tif i%2 == 0:\n\t\t\tans+=a[i]**2\n\t\telse:\n\t\t\tans-=a[i]**2\nprint (math.pi*ans)", "input()\nL = sorted(int(x)*int(x) for x in input().split())\nprint(3.1415926536 * (sum(L[::-2])-sum(L[-2::-2])))\n\n\t \t \t \t\t\t \t \t\t \t\t\t\t", "n = int(input())\r\narray = list(map(int,input().split()))\r\narray.sort(reverse=True)\r\nres = 0\r\npi = 3.1415926536\r\n\r\nfor i in range(n):\r\n if not i & 1:\r\n res += pi * ((array[i])**2)\r\n else:\r\n res -= pi * ((array[i])**2)\r\nprint(res)", "import math\na = int(input())\nb = list(map(int, input().split()))\nb.sort()\nt = 0\nfor i in range(a-1,-1,-2):\n if i == 0: \n t += b[0] ** 2\n else: \n t += (b[i] ** 2) - (b[i-1] ** 2)\nprint(t * math.pi)\n \t \t\t \t\t\t \t\t\t \t \t \t", "from math import pi\ndef solve(l):\n if len(l)==0:\n return 0\n return l[0]**2 - solve(l[1:])\n\nn = int(input())\nm = list(map(int, input().split(' ')))\nm.sort(reverse=True)\nprint(solve(m)*pi)\n \t \t\t \t\t\t \t\t \t \t", "n=int(input())\npi=3.1415926536\na=sorted(list(map(int,input().split())))\na=[pi*i*i for i in a]\nans=0\nif n%2:\n\tans+=a[0]\n\tfor i in range(2,n,2):\n\t\tans+=a[i]-a[i-1]\nelse:\n\tfor i in range(1,n,2):\n\t\tans+=a[i]-a[i-1]\nprint(ans)\n", "import math\r\n\r\n#Leitura da entrada\r\nn = input()\r\nn = int(n)\r\nl = input().split()\r\nfor i in range(n):\r\n l[i] = float(l[i])\r\n#Ordena o vetor de entrada em ordem decrescente, já que a área entre o primeiro e o segundo circulo de maior raio é vermelha\r\nl.sort(reverse = True)\r\n#Adiciona os quadrados de cada par de raios em r1 e r2\r\nr1 = 0\r\nr2 = 0\r\ni = 1\r\nwhile i <= n:\r\n #Se nao for possivel formar o par, adiciona apenas em r1\r\n if i == n:\r\n r1 += (l[i-1])**2\r\n else:\r\n r1 += (l[i-1])**2\r\n r2 += (l[i])**2\r\n i += 2\r\n#Respota final\r\nrt = math.pi*(r1-r2)\r\nprint('%.10f' % rt)", "import math\r\nn=int(input())\r\na= list(map(int, input().split()))\r\na.sort(reverse=True)\r\narea=0\r\nfor i in range(n):\r\n if i%2==0:area+=(math.pi)*a[i]**2\r\n else:area-=(math.pi)*a[i]**2\r\nprint(area)\r\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\narea = 0\r\nif n%2==1:\r\n\ti = 0\r\nelse:\r\n\ti = 1\r\nwhile i<n:\r\n\tif i==0:\r\n\t\tarea = area+ math.pi*math.pow(a[i],2)\r\n\telse:\r\n\t\tarea+= math.pi*(math.pow(a[i],2)-math.pow(a[i-1],2))\r\n\ti+=2\r\nprint(area)", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl1.sort()\r\nx=3.1415926536\r\nif n%2!=0:\r\n area=x*(l1[0]**2)\r\n for i in range(2,n,2):\r\n area+=x*((l1[i]**2)-(l1[i-1]**2))\r\n print(area)\r\nelse:\r\n area=0\r\n for i in range(1,n,2):\r\n area+=x*((l1[i]**2)-(l1[i-1]**2))\r\n print(area)\r\n \r\n\r\n", "import math\r\nn=int(input())\r\nflag=0\r\nc=list(map(int,input().split()))\r\nif n==1:\r\n\tprint(math.pi*c[0]*c[0])\r\nelse:\r\n\ttot=0.0\r\n\tc=sorted(c)[::-1]\r\n\tfor i in range(len(c)):\r\n\t\tif flag==0:\r\n\t\t\ttot+=math.pi*c[i]*c[i]\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\ttot-=math.pi*c[i]*c[i]\r\n\t\t\tflag=0\r\n\tprint(tot)\r\n\t\r\n", "import math\nn = int(input())\nr = input().split()\nresult = 0\n\nfor i in range(n):\n r[i] = int(r[i])\nr.sort()\n\ni = 0\nif n%2 == 0:\n i += 1\n while i < n:\n result += math.pi * r[i]**2 - math.pi * r[i-1]**2\n i += 2\nelse:\n result += math.pi * r[0]**2\n i += 2\n while i < n:\n result += math.pi * r[i]**2 - math.pi * r[i-1]**2\n i += 2\n\nprint(result)\n \t\t \t \t\t \t \t\t \t \t\t\t\t \t\t\t \t", "import math\n\nn = int(input())\nx = [int(i) for i in input().split()]\nx.sort(reverse = True)\na = 0\n\nfor i in range(n):\n\tr = x[i]\n\tif i%2 == 0:\n\t\ta += math.pi*r*r\n\telse:\n\t\ta -= math.pi*r*r\n\nprint(a)\n", "from math import pi\r\nn = input()\r\nl = sorted(list(map(int,input().split())))[::-1]\r\nans = 0\r\nsign = 0\r\nfor i in l:\r\n ans += ((-1)**sign)*pi*(i**2)\r\n sign+=1\r\n sign = sign%2\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\npi = 3.1415926536\r\nc = 0\r\nif(n%2 == 0):\r\n for i in range(n):\r\n if(i%2 == 0):\r\n c+= pi*((a[i+1]**2) - (a[i]**2))\r\nelse:\r\n c+= pi*(a[0]**2)\r\n for i in range(1,n):\r\n if(i%2 != 0):\r\n c += pi*((a[i+1]**2) - (a[i]**2))\r\nprint(c)", "pi = 3.1415926536\r\nn = int(input())\r\n\r\ncircles = list(map(int, input().split()))\r\n\r\ncircles = sorted(circles)\r\nanswer = 0\r\nfor i in range(0, len(circles)):\r\n if i % 2 == 0:\r\n answer += circles[-1-i]**2 * pi\r\n else:\r\n answer -= circles[-1-i]**2 * pi\r\nprint(answer)", "import math\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort(reverse=True)\r\ns=0\r\nfor i in range(0,len(A)-1,2):\r\n s+=A[i]**2 - A[i+1]**2\r\nif(n%2!=0):\r\n s+=A[n-1]**2\r\nprint(round(math.pi * s,10))", "n = int(input())\r\ns = list(sorted(list(map(int, input().split()))))[::-1]\r\ns.append(0)\r\nimport math\r\nprint(math.pi*sum([s[i]**2 - s[i+1]**2 for i in range(0, n, 2)]))", "import math\r\nn=int(input())\r\n\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nra=0\r\nif n%2==1:\r\n ra=math.pi*(l[0])**2\r\n for i in range(len(l)):\r\n if i%2==0 and i!=0:\r\n ra+=math.pi*((l[i])**2-(l[i-1])**2)\r\n\r\nif n%2==0:\r\n for i in range(len(l)):\r\n if i%2==1:\r\n ra+=math.pi*((l[i])**2-(l[i-1])**2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(ra)", "import math\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nres=0\r\nif n%2!=0:\r\n a.append(0)\r\nfor i in range(0,len(a),2):\r\n res+=(a[i]**2-a[i+1]**2)\r\nprint(res*math.pi)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nr=0\r\ntemp=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n r=0\r\n r=r+(l[i]**2)\r\n else:\r\n r=r-(l[i]**2)\r\n temp=temp+r\r\nif(n%2!=0):\r\n temp=temp+r\r\nprint(temp*3.1415926536)", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n\r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n\r\n\r\nn = int(input())\r\nl = ilst()\r\n\r\npi = 3.1415926536\r\n\r\nl.sort(reverse = True)\r\nans = 0\r\nfor i in range(n):\r\n if i%2 == 0:\r\n ans += l[i]**2\r\n else:\r\n ans -= l[i]**2\r\nprint(ans*pi)\r\n\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn = I()\r\nr = sorted(L(),reverse=True)\r\narea = 0\r\npi = 3.1415926536\r\n\r\nfor i in range(n//2):\r\n area+= (r[2*i]**2) - (r[2*i +1]**2)\r\n\r\n # area-= r[2*i +1]**2\r\n\r\n \r\nif (n%2!=0):\r\n area+=r[n-1]**2\r\n\r\nprint(pi*area)\r\n\r\n", "n = int(input())\npi = 3.1415926536\nr =sorted([int(i) for i in input().split()])[::-1]\nt = 0\n# print(r)\nfor i ,_ in enumerate(r):\n if i % 2 == 0 :\n if not i == len(r)-1:\n t += r[i]*r[i] - r[i+1]*r[i+1]\n else :\n t += r[i] * r[i]\nprint(pi * t)\n", "pi=3.141592653589793\r\n\r\na=int(input())\r\nl=[]\r\nb=input().split()\r\nfor i in range(a):\r\n t=int(b[i])\r\n l.append(t)\r\n\r\nl.sort()\r\nl.reverse()\r\np=0\r\nfor i in range(a):\r\n if i%2==0:\r\n p=p+l[i]*l[i]\r\n else:\r\n p=p-l[i]*l[i]\r\n\r\nprint(p*pi)", "import math\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR=sorted(R,reverse=True)\r\nA=0\r\nfor i in range(n):\r\n if i%2!=0:\r\n A=A-R[i]*R[i]\r\n else:\r\n A=A+R[i]*R[i]\r\nA=round(A*math.pi,10)\r\nprint(A)\r\n\r\n\r\n", "from math import pi\n\nn, r = int(input()), sorted((int(i) for i in input().split()), reverse=True)\nres = sum((-1) ** i * pi * x ** 2 for i, x in enumerate(r))\nprint(res)\n", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\np=math.pi\r\nred=0\r\nif n%2!=0:\r\n red+=p*r[0]**2\r\n c=0\r\nelse:\r\n c=1\r\nfor i in range(1,n):\r\n if c==1:\r\n red+=p*r[i]**2-p*r[i-1]**2\r\n c=0\r\n else:\r\n c=1\r\nprint(red)\r\n\r\n \r\n \r\n", "import math\na=int(input())\nb=list(map(int,input().split()))\nb.sort()\nans=0\nfor i in range(a-1,-1,-2):\n if i==0: ans+=b[0]**2\n else: ans+=b[i]**2-b[i-1]**2\nprint(ans*math.pi)\n\t\t \t \t\t \t \t\t\t\t\t \t\t\t\t \t \t", "pi= 3.1415926536\r\nn= int(input())\r\nl= list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nif n%2==0:\r\n for i in range(0, n-1,2):\r\n ans+= pi*(abs(l[i]**2- l[i+1]**2))\r\n \r\n print(ans)\r\nelse:\r\n ans= pi*l[-1]*l[-1]\r\n for i in range(0, n-2,2):\r\n ans+= pi*(abs(l[i]**2- l[i+1]**2))\r\n print(ans)\r\n ", "import math\r\nI=lambda:list(map(int,input().split()))\r\nn = int(input())\r\na = sorted(I(), reverse = True)\r\narea = 0\r\nfor i in range(len(a)):\r\n if i%2 == 0:\r\n area+=a[i]**2*math.pi\r\n else:\r\n area-=a[i]**2*math.pi\r\nprint(area)", "import math\r\n\r\nn=int(input())\r\npi=math.pi\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n ans+=(pi*l[i]*l[i])\r\n else:\r\n ans-=(pi*l[i]*l[i])\r\nprint(ans)\r\n", "import math \nqtd = input()\ncir = input()\n\ncircint = list(map(eval, cir.split()))\ncircint.sort()\nred = 0.0\nblue = 0.0\nfor i in range(len(circint)):\n if len(circint) % 2 != 0:\n if i % 2 == 0:\n red += math.pi * (circint[i]**2)\n else:\n blue += math.pi * (circint[i]**2)\n else:\n if i % 2 != 0:\n red += math.pi * (circint[i]**2)\n else:\n blue += math.pi * (circint[i]**2)\n\n\nprint(red-blue)\n\n\n \t \t \t \t \t \t\t \t\t \t \t \t\t\t\t\t\t \t", "import math\nn = int(input())\narr = list(map(int, input().split()))\narr.sort(reverse=True)\ni = 1\ntot = 0\nfor x in arr:\n tot += i*x*x\n i = -1*i\nprint(tot*math.pi)\n", "from math import *\r\nn=int(input())\r\ns=list(map(int,input().rsplit()))\r\ns.sort(reverse=True)\r\na = 0\r\nif n%2!=0:\r\n a=pi*s[n-1]**2\r\nfor i in range (0,n,2):\r\n a = a+pi*(s[i]**2-s[i-1]**2)\r\nprint(a)", "def mi():\r\n\treturn map(int, input().split())\r\nn = int(input())\r\na = list(mi())\r\na.sort(reverse=True)\r\nans = 0\r\ns = -1\r\nfrom math import pi\r\nfor r in a:\r\n\ts*=-1\r\n\tans+=pi*r*r*s\r\nprint (ans)", "import math\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\npi = math.pi\r\nans = 0\r\nif n % 2 == 0:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans -= a[i]**2 * pi\r\n continue\r\n ans += a[i]**2 * pi\r\nelse:\r\n for i in range(n):\r\n if i % 2 != 0:\r\n ans -= a[i]**2 * pi\r\n continue\r\n ans += a[i]**2 * pi\r\nprint(ans)", "from math import pi\r\nn=input()\r\nliste=input().split(\" \")\r\nliste=[ int(radius) for radius in liste]\r\nliste.sort(reverse=True)\r\n\r\narea=0\r\nfor i in range(len(liste)):\r\n area+= -1*(i%2*2-1)*liste[i]**2\r\narea*=pi\r\n\r\nprint(area)", "from math import pi\r\nn=int(input())\r\na=list(map(int,input().rstrip().split()))\r\na.sort(reverse=True)\r\nsol=0\r\nfor i in range(n):\r\n if i%2==0:\r\n sol+=(pi*a[i]*a[i])\r\n else:\r\n sol-=(pi*a[i]*a[i])\r\nprint(sol)", "import math\ninput()\na = sorted(list(map(int,input().split(' '))))\nfor i in range(len(a)):\n\ta[i]=a[i]**2\nprint (math.pi*(sum(a[::-2])-sum(a[-2::-2])))", "import math\nn = int(input())\n\nR = list(map(int, input().split()))\nR = sorted(R)\nsum = 0\ncont = 0\nfor ri in range(len(R)):\n if cont %2 == 0:\n sum+= R[ri]**2\n else:\n sum-= R[ri]**2\n cont += 1\n\nif n&1:\n print(math.pi * sum)\nelse:\n print(- math.pi * sum)\n \t \t\t\t \t\t \t\t\t\t \t \t \t\t", "a = int(input())\r\nb = list(map(int, input().split()))\r\nimport math\r\nb = sorted(b)\r\nk = 0\r\nS = 0\r\nif a % 2 == 0:\r\n for i in range(0,len(b),1):\r\n if i%2 == 0:\r\n S -= math.pi * (b[i]**2)\r\n if i%2 != 0:\r\n S += math.pi * (b[i]**2)\r\nif a % 2 != 0:\r\n for i in range(0,len(b),1):\r\n if i%2 == 0:\r\n S += math.pi * (b[i]**2)\r\n if i%2 != 0:\r\n S -= math.pi * (b[i]**2)\r\n\r\nprint(S)\r\n", "import math\nn=int(input())\nl=list(map(int, input().split()))\nif n==1:\n print(math.pi * l[0] * l[0])\nelse:\n l.sort(reverse=True)\n a=l[0:n:2]\n b=l[1:n:2]\n s=0\n for i in a:\n s+=i**2\n for j in b:\n s-=j**2\n print(math.pi * s)", "n = int(input())\nradii = list(map(int, input().split()))\nradii.sort()\nradii.reverse()\nr = 0\nfor i, radius in enumerate(radii):\n radius *= radius\n if i % 2 == 1:\n radius *= -1\n r += radius\nimport math\nprint(math.pi*r)\n", "from math import pi\r\ntotal = int(input())\r\nL =(int(x) for x in input().split())\r\nL=sorted(i*i for i in L)\r\na= sum(L[::-2])\r\nb=sum(L[-2::-2])\r\nprint(pi * (a-b))", "from heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\n\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(int(1)):\r\n N = inl()[0]\r\n A = sorted(inl(), reverse=True)\r\n # Care A is sorted\r\n\r\n redArea = 0\r\n for i in range(0, N, 2):\r\n if i == N - 1:\r\n redArea += math.pi * pow(A[i], 2)\r\n else:\r\n redArea += math.pi * (pow(A[i], 2) - pow(A[i + 1], 2))\r\n\r\n print(redArea)\r\n", "import math\ndef main(a):\n\ta= sorted(a,reverse=True)\n\ts=0\n\tfor i in range(len(a)):\n\t\tif i%2==0:\n\t\t\ts+=a[i]**2\n\t\telse:\n\t\t\ts-=a[i]**2\n\tprint(math.pi *s)\n\n\n\n# t = int(input(''))\n# for i in range(t):\n# \t#l,r = list(map(int,input(\"\").strip().split()))\n# \ts = input('')\n# \tmain(s)\nn= int(input())\na = list(map(int,input(\"\").strip().split()))\nmain(a)", "count = 0\nn = int(input())\nradii = [int(n) for n in input().split()]\nradii.sort(reverse=True)\nfor number in radii:\n count = -(count + number * number)\nprint(abs(count) * 3.1415926535)\n \t\t\t\t\t \t\t\t \t \t \t\t\t \t\t", "from math import pi\r\nn = int(input()) \r\na = list(map(int,input().split()))\r\na.sort()\r\nfor i in range(len(a) - 2, - 1, -2):\r\n a[i] *=-1\r\nprint(sum(pi* x * x * ( - 1 if x < 0 else 1) for x in a))\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\n\n\ndef solution():\n n = int(input())\n arr = list(map(int, input().split()))\n arr.sort(reverse=True)\n res = 0\n for i in range(len(arr)):\n cur = arr[i]**2\n if i%2 == 0:\n res += cur\n else:\n res -= cur\n print(res*math.pi)\n \n\n\n\n\n\n\n\n\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n\n\n\n\n\"\"\"\n num = int(input())\n a,b = map(int, input().split())\n arr = list(map(int, input().split()))\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10**9 + 7\n\nfor di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:\n ni = i + di\n nj = j + dj\n if not (0<= ni < len(grid) and 0<= nj < len(grid[0])):\n continue\n\ndef gcd(a,b):\n if a < b: a,b = b,a\n if b == 0: return a\n return gcd(a%b,b)\n\"\"\"\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nlist1=[i*i for i in list1]\r\ndata1,data2=0,0\r\nfor i in range(len(list1)):\r\n if i%2==0:\r\n data1+=list1[i]\r\n else:\r\n data2+=list1[i]\r\n\r\nprint(abs(data1-data2)*(3.1415926536))", "#157B (81No. Problem B)\r\nimport math\r\nc = int(input())\r\nr = sorted(list(map(int,input().split())),reverse=True)\r\nres = 0\r\nif (c%2 == 0):\r\n for j in range(0,c-1,2):\r\n res+= (r[j]**2-r[j+1]**2)\r\nelse : \r\n res = r[-1]**2\r\n for j in range(0,c-2,2):\r\n res+= (r[j]**2-r[j+1]**2)\r\n\r\nres*= math.pi\r\nprint(res)", "import math\r\nn=int(input())\r\nA=0\r\nr=[0]+list(map(int,input().split()))\r\nr.sort()\r\nif(n%2!=0):\r\n i=0\r\n while(i<n):\r\n A=A+3.1415926536*(-(r[i]**2)+(r[i+1]**2))\r\n i=i+2\r\nelse:\r\n i=1\r\n while(i<n):\r\n A=A+3.1415926536*(-(r[i]**2)+(r[i+1]**2))\r\n i=i+2\r\nprint(A) ", "from math import pi\n\n\ndef main():\n input()\n l = sorted(map(int, input().split()),reverse=True)\n print((sum(_ * _ for _ in l[::2]) - sum(_ * _ for _ in l[1::2])) * pi)\n\n\nif __name__ == '__main__':\n main()", "# -*- coding: utf-8 -*-\n'''\nNome: Ivan Rosa Soares Júnior\nMatricula: 2015083590\nSolução: Orderna os raios do maior para o menor e calcula a soma das areas\nalternando o sinal (os termos pares com sinal positivo).\n'''\n\nimport sys\nfrom math import pi\n\n_ = next(sys.stdin)\n\ns = 0\n\nRs = list(reversed(sorted(map(float, next(sys.stdin).strip().split()))))\nfor i, r in enumerate(Rs):\n\tif i % 2 == 0: s += pi * r * r\n\telse: s -= pi * r * r\n\nprint(s)\n", "import math\nn = int(input())\nraios = input().split(\" \")\n\nlista = []\n\nfor i in raios:\n lista.append(int(i))\n\nlista = sorted(lista, reverse=True)\n\nlistaArea = []\n\narea = 0\n\nfor i in range(0, n, 2):\n \n if(i == n-1):\n area += math.pi * lista[i] * lista[i]\n else:\n area += (math.pi * lista[i] * lista[i] - (math.pi * lista[i+1] * lista[i+1])) \n\n \nprint(area)\n \t\t \t \t \t\t \t\t\t \t\t \t\t\t\t \t \t", "from math import pi\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = 0\r\nif(n%2==1):\r\n ans = pi*arr[0]*arr[0]\r\n i = 1\r\n while(i<n):\r\n ans+= pi*(arr[i+1]**2 - arr[i]**2)\r\n i+=2\r\nelse:\r\n i = 0\r\n while(i<n):\r\n ans+= pi*(arr[i+1]**2 - arr[i]**2)\r\n i+=2\r\nprint(round(ans,10))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\npi=3.1415926536\r\nans=0\r\nfor i in range(n):\r\n if(i&1):\r\n ans-= pi*lst[i]*lst[i]\r\n else:\r\n ans+=pi*lst[i]*lst[i]\r\nprint(ans)", "n = int(input())\r\nradius = list(map(int, input().split()))\r\nradius.sort(reverse = True)\r\narea = 0\r\nfor i in range(n):\r\n\tif i%2 == 0:\r\n\t\tarea += (radius[i]*radius[i])\r\n\telse:\r\n\t\tarea -= (radius[i]*radius[i])\r\nprint(area*3.1415926536)", "\r\nif __name__ == '__main__':\r\n qtdCirculos = int(input())\r\n raios = [int(x) for x in input().split()]\r\n raios.sort()\r\n\r\n pi = 3.1415926536\r\n\r\n area = 0\r\n contou = False\r\n for i in range(len(raios)-1, -1, -1):\r\n r = raios[i]\r\n if not contou:\r\n area += pi*r*r\r\n contou = True\r\n else:\r\n area -= pi*r*r\r\n contou = False\r\n\r\n print(area)\r\n\r\n", "from math import pi\r\nn= int(input())\r\na=[]\r\na = list(map(int, input().split()))\r\ni=0\r\ns=0\r\na.sort()\r\na.reverse()\r\nwhile i<n:\r\n s+=pow(a[i],2)*pow(-1,i)\r\n i+=1\r\n\r\nprint(round(s*pi,10))\r\n\r\n", "import math\na = int(input())\nb = input().split()\nfor i in range (0, len(b)):\n b[i]= int(b[i])\nb.sort(reverse = True)\ntotal =0\nalternator =1\nfor i in b:\n total += (math.pi * i ** 2) *alternator\n alternator *= -1\n \nprint(total)\n \t \t \t\t \t \t\t \t \t \t\t \t\t\t", "n = int(input())\nk = input()\nl = [int(x) for x in k.split()]\nl.sort()\ny = 0\nfor i in range(0, len(l)):\n if i % 2 == 0:\n y += l[i]**2\n else:\n y -= l[i]**2\ny *= 3.141592654\nprint(abs(y))\n\t\t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "n=int(input())\nm=input().split()\no=[]\nfor x in m:\n y=int(x)*int(x)\n o.extend([y])\no=sorted(o)\nz=(3.1415926536*(sum(o[::-2])-sum(o[-2::-2])))\nprint(z)\n \t\t\t \t \t \t \t \t\t\t \t \t \t", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=get_list()\r\n\r\na.sort()\r\na=list(reversed(a))\r\n\r\ns=0\r\nfor i in range(n):\r\n if(i%2==0):\r\n s+=a[i]**2\r\n else:\r\n s-=a[i]**2\r\n\r\nprint(s*3.1415926536)\r\n\r\n\r\n", "n = int(input())\r\nr = list(map(int,input().split())) + [0]\r\nred = 0\r\nr.sort()\r\nr = r[::-1]\r\nfor i in range(n):\r\n if i % 2 : continue\r\n red += r[i]**2 - r[i+1]**2\r\nprint(red * 3.1415926535)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nsum=0\r\nif n%2!=0:\r\n sum=arr[0]**2\r\nfor i in range(n-1,0,-2):\r\n sum=sum+(arr[i]**2)-(arr[i-1]**2)\r\nprint(sum*3.1415926536)\r\n", "import math\n\nn = int(input())\nline = input()\ncircle = [int(e) for e in line.split()]\ncircle.sort()\n\npi = math.pi\narea = 0\n\nfor i in range(n-1, -1, -1):\n red = (pi * (circle[i] ** 2))\n if i % 2 == 0:\n area += red\n else:\n area -= red\n\nif area < 0:\n area = area * -1\n\nprint(f\"{area:.10f}\")\n\n\t \t\t \t \t\t\t \t\t\t\t\t\t \t", "pi = 3.1415926\r\nn = int(input())\r\narr = [int(x)*int(x) for x in input().split()]\r\narr.sort()\r\nif n %2 == 0:\r\n add = 0\r\n for i in range(n//2):\r\n add += pi*(arr[2*i+ 1] - arr[2*i])\r\n print(add) \r\nelse:\r\n add = pi*arr[0]\r\n for i in range(1,n//2 +1):\r\n add += pi*(arr[2*i] - arr[2*i-1])\r\n print(add) \r\n\r\n\r\n \r\n", "from math import pi\r\n\r\nn = int(input())\r\nnums = sorted(list(map(int , input().split())), reverse= True)\r\nresult = 0\r\nfor i in range(0, n, 2):\r\n result += ((nums[i] ** 2) * pi - (nums[i+1] ** 2 ) * pi) if i < n-1 else (nums[i] ** 2) * pi\r\n\r\n\r\nprint(result)", "from math import pi\n\n\ndef main():\n n = int(input())\n l = sorted(map(int, input().split()))\n sign = (-1, 1)[len(l) & 1]\n res = 0\n for r in l:\n res += r * r * sign\n sign *= -1\n print(res * pi)\n\n\nif __name__ == '__main__':\n main()", "__author__ = 'Rajan'\r\n\r\nn = int(input())\r\nr = sorted(list(map(int,input().split())))\r\n\r\nPI = 3.1415926536\r\n\r\nans = 0\r\n\r\nif n%2==0:\r\n for i in range(1,n,2):\r\n ans += (r[i]**2-r[i-1]**2)\r\nelse:\r\n ans+= r[0]**2\r\n for i in range(2,n,2):\r\n ans+= (r[i]**2-r[i-1]**2)\r\n\r\nans*= PI\r\n\r\nprint(ans)\r\n", "import math\nn=int(input())\nr=list(map(int,input().split()))\nr.sort()\nr.reverse()\nresult = 0\nm=1\nfor i in r:\n result += m*i*i\n m=-m\nprint(math.pi*result)\n \t\t\t\t\t\t\t \t \t\t \t \t \t \t\t \t\t", "def zip_sorted(a,b):\n\n\t# sorted by a\n\ta,b = zip(*sorted(zip(a,b)))\n\t# sorted by b\n\tsorted(zip(a, b), key=lambda x: x[1])\n\n\treturn a,b\n\nimport sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\nS = lambda : list(map(str,input().split()))\n\nimport math\n\nt,=I()\nn = I()\n\nn = sorted(n)\nn1 = [0]+n\n\narea = 0\n\ni = 0\n\nn2 = len(n1)\n\nwhile i<n2:\n\n\tif n2-i-2>=0:\n\n\t\tarea = area + (((math.pi)*(n1[n2-i-1])*(n1[n2-i-1])) - ((math.pi)*(n1[n2-i-2])*(n1[n2-i-2])))\n\n\ti = i+2\n\nprint(area)\n\n\n\n'''\nfor i in range(n):\nfor j in range(n):\nfor k1 in range(len(a)):\nfor k2 in range(len(a)):\nfor k3 in range(len(a)):\n\n'''", "import math\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR.sort()\r\narea_red=0\r\narea_blue=0\r\nfor i in range(n-1,-1,-2):\r\n area_red+=math.pi*R[i]*R[i]\r\nfor i in range(n-2,-1,-2):\r\n area_blue+=math.pi*R[i]*R[i]\r\nprint(abs(area_blue-area_red))", "import math\nA = int(input())\nB = input().split()\nNumList = []\n\nTotal_Area = 0\n\nif 1 <= A <= 100:\n for i in B:\n NumList.append(int(i))\nsorted_list = sorted(NumList)\nsorted_list.reverse()\n\nred = []\nblue = []\nfor i in sorted_list[::2]:\n red.append(i)\nfor i in sorted_list[1::2]:\n blue.append(i)\nif len(red) != len(blue):\n blue.append(0)\n\npi = math.pi\ndef circle(a):\n return pi * (a ** 2)\n\nfor i in range(0,len(red)):\n Area = circle(red[i]) - circle(blue[i])\n Total_Area += Area\n\nprint(Total_Area)\n\n#https://stackoverflow.com/questions/2990121/how-do-i-loop-through-a-list-by-twos\n \t\t \t \t \t\t \t\t\t\t\t \t \t\t\t\t \t", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=[i*i for i in l]\r\nx.sort(reverse=True)\r\nc=0\r\nprint(pi*(sum(x[::2])-sum(x[1::2])))", "import math\r\nn = int(input())\r\n\r\narr = [int(x) for x in input().split(' ')]\r\n\r\nres = 0\r\narr.sort()\r\n\r\ni = n-1\r\nwhile i >= 0:\r\n\tif i != 0:\r\n\t\tres += arr[i]*arr[i] - arr[i-1]*arr[i-1]\r\n\telse:\r\n\t\tres += arr[i]*arr[i]\r\n\ti -= 2\r\n\r\nres *= math.pi\r\nprint(res)", "import math\r\n\r\ndef get_n():\r\n return int(input())\r\n\r\ndef get_int_vector():\r\n return [int(x) for x in input().split()]\r\n\r\ndef list2string(list):\r\n result = []\r\n for i in list:\r\n result.append(str(i))\r\n return ':'.join(result)\r\n\r\ndef string2vector(string):\r\n return [int(x) for x in string.split(':')]\r\n\r\nn = get_n()\r\nrad = get_int_vector()\r\n\r\nrad.sort(reverse=True)\r\nresult = 0\r\n\r\nfor i in range(n-1):\r\n if i % 2 == 0:\r\n result += rad[i]**2-rad[i+1]**2\r\n\r\nif n % 2 == 1:\r\n result += rad[-1]**2\r\n\r\nprint(\"{:.5f}\".format(result*math.pi))\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\ns=0\r\nfor i in range(n-1,-1,-2):\r\n if(i==0):\r\n s+=math.pi*l[i]*l[i]\r\n else:\r\n s+=math.pi*(l[i]*l[i]-l[i-1]*l[i-1])\r\nprint(s)", "import math\r\n\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\na.sort(reverse = True)\r\n\r\narea = 0\r\nmult = 1\r\n\r\nfor i in range(0,n):\r\n area += mult*(a[i]**2)\r\n mult *= -1\r\n\r\nprint(area*math.pi)\r\n", "\"\"\"http://codeforces.com/problemset/problem/157/B\"\"\"\nfrom math import pi\n\nif __name__ == '__main__':\n input()\n r = list(map(int,input().split()))\n r.sort(reverse=True)\n s = sum([r[i]**2 * (-1)**(i&1) for i in range(len(r))])\n print(s * pi)\n", "import math\n\nradiiNumber=int(input())\nradiiStrs=input().split(' ')\n\nradii=[]\nfor radiusStr in radiiStrs:\n radii.append(int(radiusStr))\nradii.sort()\n\npiCoefficient=0\npyIndex=len(radii)-1\nwhile pyIndex>0:\n piCoefficient+=radii[pyIndex]**2-radii[pyIndex-1]**2\n pyIndex-=2\n\nif pyIndex==0:\n piCoefficient+=radii[0]**2\n\nredArea=math.pi*piCoefficient\n\nprint(redArea)\n\t\t\t \t\t \t \t\t\t\t \t \t\t \t\t\t", "from math import *\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\na=0\r\nif n%2==0:\r\n for i in range(1,n,2):\r\n a=a+pi*(arr[i]**2-arr[i-1]**2)\r\nelse:\r\n a=a+pi*arr[0]**2\r\n for i in range(2,n,2):\r\n a=a+pi*(arr[i]**2-arr[i-1]**2)\r\nprint(a)\r\n \r\n \r\n ", "import sys\r\nimport math\r\n#import random\r\nsys.setrecursionlimit(100000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\nara=inara()\r\n\r\nara.sort(reverse=True)\r\n\r\nans=0\r\n\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tans+=math.pi*ara[i]*ara[i]\r\n\telse:\r\n\t\tans-=math.pi*ara[i]*ara[i]\r\n\r\nprint(ans)\r\n", "from sys import stdin,stdout\r\nfrom math import pi\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\naa=lambda r:pi*r*r\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=sorted(lst(),reverse=True)\r\n ans=0\r\n for i in range(n):\r\n if i&1:ans-=aa(a[i])\r\n else:ans+=aa(a[i])\r\n print(ans)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\nn = int(input())\r\narr = sorted(map(int, input().split()), reverse=True)\r\n\r\npi = 3.1415926536\r\n\r\nans = 0\r\n\r\nfor i, n in enumerate(arr):\r\n if i % 2:\r\n ans -= pi*n**2\r\n else:\r\n ans += pi*n**2\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\ntemparr = input()\r\ntemparr = temparr.split()\r\narr = []\r\nfor i in temparr:\r\n arr.append(int(i))\r\narr = sorted(arr)\r\narr = arr[::-1]\r\nans = 0 \r\nfor j, i in enumerate(arr):\r\n if j & 1 == 0 :\r\n ans += i * i \r\n else:\r\n ans -= i * i \r\nprint(ans * 3.1415926536)\r\n ", "n=int(input())\r\ns=0\r\nX=[int(x) for x in input().split(\" \")]\r\nX.sort(reverse=True)\r\nfor i in range(n):\r\n s=s+(-1)**(i)*X[i]*X[i]\r\nprint(3.1415926536*s) ", "import math\r\n\r\nn = int(input())\r\nradius = list(map(int, input().split()))\r\nradius.sort()\r\narea = 0\r\nif n % 2 == 0:\r\n for i in range(1, n, 2):\r\n area += radius[i]**2 * math.pi - radius[i - 1]**2 * math.pi\r\nelse:\r\n area += radius[0]**2 * math.pi\r\n for i in range(2, n, 2):\r\n area += radius[i]**2 * math.pi - radius[i - 1]**2 * math.pi\r\n\r\nprint(area)\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nb = []\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i % 2 != 0:\r\n b.append('r')\r\n else:\r\n b.append('b')\r\nfor i in range(n):\r\n if b[i] == 'r':\r\n ans += math.pi*a[i]**2\r\n else:\r\n ans -= math.pi*a[i]**2\r\nprint(ans)\r\n", "# cook your dish here\r\nimport math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n \r\n a[i]=(math.pi)*(a[i]**2)\r\na=sorted(a)\r\nc=0\r\nif (n&1)==1:\r\n for i in range(n):\r\n if i&1==0:\r\n if i==0:\r\n c+=a[i]\r\n else:\r\n c+=a[i]-a[i-1]\r\nelse:\r\n for i in range(n):\r\n if i&1==1:\r\n c+=a[i]-a[i-1]\r\nprint(c)\r\n", "import math\nn = int(input())\nr = input().split()\nfor i in range(n):\n r[i] = int(r[i])\nr.sort(reverse=True)\narea = 0\nfor i in range(0, n-2, 2):\n area += math.pi * (r[i]**2 -r[i+1]**2)\nif n % 2 == 1:\n area += math.pi * r[-1]**2\nelse:\n area += math.pi * (r[-2] ** 2 - r[-1] ** 2)\nprint(area)\n \t \t\t \t\t\t \t \t\t\t \t \t \t \t\t\t", "from math import *\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nb.sort(reverse= True)\r\nl = 0\r\nif a%2 != 0:\r\n for y in range(0,a-1,2):\r\n l += round((pi * (b[y]**2))- (pi * (b[y+1]**2)),10)\r\n\r\n l += round(pi * (b[-1]**2),10)\r\n print(l)\r\n\r\n\r\nelse:\r\n for y in range(0,a,2):\r\n l += round((pi * (b[y]**2))- (pi * (b[y+1]**2)),10)\r\n\r\n print(l)\r\n\r\n\r\n", "import re\nimport math\n\nin1 = int(input())\nin2 = [int(x) for x in re.split(\"\\\\s\", input())]\n\nin2.sort(reverse=True)\n\ncount = 0\nalt1 = True\nfor x in in2:\n if alt1:\n count += x**2\n alt1 = False\n else:\n count -= x**2\n alt1 = True\n\nprint(math.pi*count)\n \t\t\t \t \t \t \t \t\t\t\t \t \t \t \t \t\t", "import math\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\npi = math.pi\r\nans = 0\r\nk = 1\r\nfor i in range(n-1, -1, -1):\r\n ans += k * a[i]**2 * pi\r\n k = -k\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\npi=3.1415926536\r\nl=sorted(l)\r\ni=n-1\r\nc,b=0,1\r\nwhile i>-1: \r\n if b:\r\n b=0\r\n c+=(l[i]**2)\r\n else:\r\n b=1\r\n c-=(l[i]**2)\r\n i-=1\r\n\r\nprint('{:.10f}'.format(pi*c))\r\n", "from math import *\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\n\r\nsum=0\r\n\r\nif(n%2==1):\r\n for i in range(0,n-2,2):\r\n sum+=pow(a[i],2)-pow(a[i+1],2)\r\n sum+=pow(a[n-1],2) \r\nelse:\r\n for i in range(0,n-1,2):\r\n sum+=pow(a[i],2)-pow(a[i+1],2)\r\n \r\nprint(round(pi*sum,10))", "from sys import stdin, stdout\r\nfrom math import pi\r\n\r\nintn = lambda : int(stdin.readline())\r\nstrs = lambda : stdin.readline()[:-1]\r\nlstr = lambda : list(stdin.readline()[:-1])\r\nmint = lambda : map(int, stdin.readline().split())\r\nlint = lambda : list(map(int, stdin.readline().split()))\r\nout = lambda x: stdout.write(str(x)+\"\\n\")\r\nout_ = lambda x: stdout.write(str(x)+' ')\r\n\r\ndef main():\r\n n = intn()\r\n a = sorted(lint(), reverse=True)\r\n area = 0\r\n for i in range(n):\r\n if i&1:\r\n area -= pi*a[i]*a[i]\r\n else:\r\n area += pi*a[i]*a[i]\r\n out(area)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "if __name__ == '__main__':\n input()\n L = sorted(x**2 for x in map(int, input().split()))\n print(3.1415926536 * (sum(L[::-2]) - sum(L[-2::-2])))\n\t\t\t \t \t\t\t\t \t \t \t\t\t \t \t", "#link: https://codeforces.com/problemset/problem/157/B\nimport math \n\nn = int(input())\n\nraios = list(map(int, input().split(\" \")))\nraios.sort(reverse=True)\nr = math.pi\nquadrados_pares = []\nquadrados_impares = []\n\nfor x in range(0,len(raios)):\n\tif x % 2 == 0:\n\t\tquadrados_pares.append(raios[x]**2)\n\telif x % 2 == 1:\n\t\tquadrados_impares.append(raios[x]**2)\n\nresultado = sum(quadrados_pares) - sum(quadrados_impares)\narea_resultante = resultado * r\n\nprint(area_resultante)\n \t \t\t\t\t \t\t \t\t\t\t \t \t \t \t", "from math import pi\n\nn = int(input())\narr = list(map(float, input().split()))\narr = sorted(arr)\n\narea = 0\nif(n % 2):\n area += pi * arr[0]**2\n i = 1\n while(i < len(arr)):\n if not (i % 2):\n area += (arr[i]**2 -arr[i - 1]**2) * pi\n i += 1\nelse:\n i = 1\n while(i < len(arr)):\n if (i % 2):\n area += (arr[i]**2 -arr[i - 1]**2) * pi\n i += 1\nprint(area)", "import math\na=int(input())\nk=sorted(list(map(int,input().split())))\nc=0\nfor i in range(len(k)):\n if i%2==0:\n c+=k[i]**2\n else:c-=k[i]**2\nprint( abs(c*(math.pi)))\n\t\t \t \t \t \t\t \t\t \t \t\t \t \t\t", "import math\nn = int(input())\nlist = [int(i) for i in input().split()][:n]\nlist.sort(reverse=True)\ni = 0\narea = 0\nwhile i < n:\n if ((i + 1) == n):\n area += ((list[i]**2) * math.pi)\n else:\n area += (((list[i]**2) * math.pi) - ((list[i+1]**2) * math.pi))\n i += 2\nprint(area)\n\t\t \t\t \t \t\t \t \t\t \t", "def red_area(num_circles, arr):\r\n arr.sort()\r\n\r\n red_area = 0\r\n\r\n if num_circles % 2 == 0:\r\n for i in range(0, num_circles):\r\n if i % 2 != 0:\r\n red_area += circle_area(arr[i])\r\n else:\r\n red_area -= circle_area(arr[i])\r\n\r\n else:\r\n for i in range(0, num_circles):\r\n if i % 2 == 0:\r\n red_area += circle_area(arr[i])\r\n else:\r\n red_area -= circle_area(arr[i])\r\n\r\n return red_area\r\n\r\n\r\ndef circle_area(rad):\r\n return (rad * rad) * 3.1415926536\r\n\r\n\r\nif __name__ == \"__main__\":\r\n number_of_inputs = int(input())\r\n array = input().split()\r\n array = list(map(int, array))\r\n\r\n print(red_area(number_of_inputs, array))\r\n", "import sys\nfrom math import pi\nf = sys.stdin\n# f = open(\"input.txt\", \"r\")\nn = int(f.readline())\nr = [int(i) for i in f.readline().strip().split()]\nr.sort()\nr.insert(0, 0)\nres = 0\nfor i in range(-1, -len(r), -2):\n res += r[i]**2 - r[i-1]**2\nprint(res*pi)", "from math import pi\r\n\r\nnum = int(input())\r\nlis = input().split()\r\nlis = [int(x) for x in lis]\r\n\r\nlis.sort(reverse=True)\r\nresult = []\r\n\r\nfor i in range(0, (len(lis))-1, 2):\r\n result.append((lis[i]**2) - (lis[i+1]**2))\r\nif len(lis) % 2 != 0:\r\n result.append(lis[len(lis)-1]**2)\r\n\r\nsum = 0\r\nfor i in range(len(result)):\r\n sum += pi * result[i]\r\n\r\nprint(sum)\r\n", "##B\r\nfrom math import pi\r\nsqr=lambda x: x*x\r\nn=int(input())\r\nR=list(map(int,input().split()))\r\nR.sort()\r\nR.reverse()\r\nred=[]\r\nblue=[]\r\nfor i in range(n):\r\n if i%2:\r\n red.append(-R[i])\r\n else:\r\n blue.append(R[i])\r\nred=list(map(sqr,red))\r\nblue=list(map(sqr,blue))\r\nr=abs(sum(red)-sum(blue))\r\nprint(r*pi)\r\n\r\n \r\n", "from math import pi\r\nn = int(input())\r\n\r\nradii = list(map(int, input().split()))\r\nradii.sort(reverse=True)\r\narea_sum = 0\r\n\r\nif n%2:\r\n area_sum += (radii[n-1]**2)\r\n\r\nfor i in range(1, n, 2):\r\n area_sum += radii[i-1]**2 - radii[i]**2\r\nprint(area_sum*pi)\r\n", "import math\r\npi = math.pi\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nf = 1\r\na = 0\r\nk = 0\r\nwhile n:\r\n n -= 1\r\n r = arr[k]\r\n k += 1\r\n if f == 1:\r\n a += pi*r*r\r\n f = 0\r\n else:\r\n f = 1\r\n a -= pi*r*r\r\n\r\nprint(a)\r\n", "def ordena_merge(lista):\n if len(lista) > 1:\n meio = len(lista)//2\n left = [lista[i] for i in range(meio)]\n right = [lista[j] for j in range(meio,len(lista))]\n\n ordena_merge(left)\n ordena_merge(right)\n\n i = j = k = 0\n\n while i < len(left) and j < len(right):\n if left[i] < right[j]:\n lista[k] = left[i]\n i += 1\n else:\n lista[k] = right[j]\n j += 1\n k += 1\n\n while i < len(left):\n lista[k] = left[i]\n i += 1\n k += 1\n while j < len(right):\n lista[k] = right[j]\n j += 1\n k += 1\n\nn = int(input())\nradii = input().split()\nradii = [int(radii[i]) for i in range(n)]\nordena_merge(radii)\narea = 0\nfor j in range(n-1, -1, -1):\n if n%2 == 0:\n if j%2 != 0:\n area += radii[j]**2\n else:\n area -= radii[j]**2\n else:\n if j%2 == 0:\n area += radii[j]**2\n else:\n area -= radii[j]**2\nprint(area*3.1415926536)\n \t\t\t \t \t \t\t\t \t \t \t\t \t \t\t", "from math import pi\r\nn = int(input())\r\narr = [0] + list(map(int, input().split()))\r\narr.sort(reverse=True)\r\nres = 0\r\nfor i in range(0, n, 2):\r\n\tres += pi * (arr[i] * arr[i] - arr[i+1] * arr[i+1])\r\nprint(res)\r\n", "mas = list(map(int, input().split()))\r\nt = mas[0]\r\nmas = list(map(int, input().split()))\r\nmas.sort()\r\nmas = mas[::-1]\r\nk = 1\r\ns = 0\r\nfor i in range(t):\r\n s += k * (mas[i] ** 2)\r\n k *= -1\r\nimport math\r\nprint(math.pi * s)", "from math import pi\n\n\ndef main():\n input()\n l = sorted(map(int, input().split()))\n sign = (1, 0)[len(l) & 1]\n print((sum(_ * _ for _ in l[sign::2]) - sum(_ * _ for _ in l[1 - sign::2])) * pi)\n\n\nif __name__ == '__main__':\n main()", "input();ans=0;k=1\r\nfor r in sorted(map(int,input().split())):ans+=r*r*k;k*=-1\r\nprint(abs(ans*3.1416))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\ns = 0\r\nfor i in range(0,len(l),2):\r\n s += l[i]*l[i]\r\nfor i in range(1,len(l),2):\r\n s -= l[i]*l[i]\r\n\r\nprint(s*3.1415926536) ", "import math\n\nsize = int(input())\ncircles = input().split()\ncircles = [int(x) for x in circles]\ncircles.sort()\n\ntotal = 0\n\nif(size % 2 == 1):\n for i in range(size - 1, -1, -1):\n if(i % 2 == 0):\n total += math.pi * (circles[i]**2)\n else:\n total -= math.pi * (circles[i]**2)\nelse:\n for i in range(size - 1, -1, -1):\n if(i % 2 == 1):\n total += math.pi * (circles[i]**2)\n else:\n total -= math.pi * (circles[i]**2)\n \nprint(total)\n \t\t \t\t\t \t\t \t\t \t\t\t\t \t\t", "from sys import stdin,stdout,exit\r\nfrom math import pi\r\nn=int(stdin.readline().rstrip())\r\nl=list(map(int,stdin.readline().split()))\r\nl.sort(reverse=True)\r\ns=0\r\nfor i in range(n):\r\n if i%2==0:\r\n s+=pow(l[i],2)\r\n else:\r\n s-=pow(l[i],2)\r\nprint(pi*s)", "import math\nx = int(input())\ny = input().split()\nfor i in range(0, len(y)):\n y[i] = int(y[i])\ny.sort(reverse = True)\ntotal = 0\nalternator = 1\nfor i in y:\n total += (math.pi * i ** 2) * alternator\n alternator *= -1\n\n\nprint(total)\n \t\t\t\t \t\t \t\t\t \t\t\t \t\t\t \t \t \t", "from math import pi\r\nn=int(input())\r\na=sorted(map(int,input().split()),reverse=True)\r\nsu=0\r\nfor i in range(n):\r\n if i%2==0:\r\n su+=pi*a[i]*a[i]\r\n else:\r\n su-=pi*a[i]*a[i]\r\nprint(su)\r\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn = int(input())\r\narr = int_arr()\r\nsu = 0\r\narr.sort()\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n su += arr[i] ** 2\r\n else:\r\n su -= arr[i] ** 2\r\nprint(f'{abs(su) * pi:.10f}')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nnew = sorted(arr)\r\npi = 3.1415926536\r\nad = 0\r\nfor j in range(n):\r\n if j % 2 == 0:\r\n ad += new[j] ** 2\r\n else:\r\n ad -= new[j] ** 2\r\nprint(f\"{abs(ad) * pi:.10f}\")\r\n", "import math\r\nn=int(input())\r\na=sorted(map(int,input().split()))\r\nd=[1,-1]\r\nr=0\r\nfor i in range(n):\r\n r+=d[i%2]*math.pi*a[-1-i]**2\r\nprint(r)", "n = input()\nn = int(n)\nl = list(map(int,input().split()))\nl.sort()\narea = 0\npi = 3.1415926536\nif n%2 == 0:\n for i in range(1,len(l),2):\n area = area + (pi*l[i]*l[i]-pi*l[i-1]*l[i-1])\nelse:\n area = pi*l[0]*l[0]\n if n==1:\n area = area\n else:\n for i in range(2,len(l),2):\n area = area + (pi*l[i]*l[i]-pi*l[i-1]*l[i-1])\n\nprint (area)\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl = sorted(l)\r\nsu = 0\r\nfor i in range(1,len(l)+1):\r\n \r\n if i%2 == 1: su += (l[-i])**2\r\n else: su -= (l[-i])**2\r\n\r\nprint(su*3.1415926536)", "import math\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nL=sorted(L)\r\nsuma=0\r\nif(n%2):\r\n suma+=(L[0]**2)*math.pi\r\n L=L[1:]\r\nfor k in range(1,len(L),2):\r\n suma+=(L[k]**2-L[k-1]**2)*math.pi\r\nprint(\"{0:.10f}\".format(suma)) \r\n", "pi=3.1415926536\r\nn=int(input())\r\nstroka=input()\r\nk=''\r\nR=[]\r\nfor i in range(0,len(stroka)):\r\n if stroka[i]==' ':\r\n R.append(int(k))\r\n k=''\r\n else:\r\n k+=stroka[i]\r\nR.append(int(k))\r\nfor i in range(0,n):\r\n for j in range(1,n):\r\n if R[j]>R[j-1]:\r\n k=R[j]\r\n R[j]=R[j-1]\r\n R[j-1]=k\r\nanswer=0\r\nfor i in range(0,n):\r\n if i%2==0:\r\n answer+=R[i]**2\r\n else:\r\n answer-=R[i]**2\r\nanswer*=pi\r\nprint(answer)\r\n \r\n \r\n", "number_of_testcases = 1 #int(input())\r\n\r\nfor _ in range(number_of_testcases):\r\n num_circles = int(input())\r\n radii_of_circles = list(map(int,input().split()))\r\n pie_value = 3.1415926536\r\n red_part_area = 0\r\n ans = 0\r\n radii_of_circles.sort(reverse = True)\r\n \r\n while num_circles > ans:\r\n if num_circles > (ans + 1):\r\n red_part_area += pie_value*(radii_of_circles[ans]*radii_of_circles[ans] - radii_of_circles[ans+1]*radii_of_circles[ans+1])\r\n ans += 2 \r\n else:\r\n red_part_area += pie_value*(radii_of_circles[ans]*radii_of_circles[ans])\r\n ans += 1\r\n \r\n print(red_part_area)", "import math\n\nnum_circles = int(input())\ncircles = input().split(' ')\n\ndef to_integer(circles):\n for i in range(num_circles):\n circles[i] = int(circles[i])\n\ndef calculate_area(circles):\n area = 0\n if num_circles % 2 == 1:\n for i in range(num_circles - 1, -1, -1):\n if i % 2 == 0:\n area += math.pi*(circles[i]**2)\n else:\n area -= math.pi*(circles[i]**2)\n else:\n for i in range(num_circles - 1, -1, -1):\n if i % 2 == 1:\n area += math.pi*(circles[i]**2)\n else:\n area -= math.pi*(circles[i]**2)\n print(area)\n\nto_integer(circles)\ncircles.sort()\ncalculate_area(circles)\n\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif n%2!=0:\r\n\tl.append(0)\r\nl.sort(reverse=True)\r\ni=0\r\nz=0\r\nwhile i<n:\r\n\tar=math.pi*((l[i]*l[i])-(l[i+1]*l[i+1]))\r\n\tz+=ar\r\n\ti+=2\r\nprint(z)\r\n\r\n", "n = int(input())\r\n\r\ncircle = list(int(x)**2 for x in input().split())\r\ncircle = sorted(circle)\r\npi = 3.1415926536\r\nprint(pi*(sum(circle[::-2])-sum(circle[-2::-2])))", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\ns=0\r\nf=1\r\nfor i in range(n-1,-1,-1):\r\n s+=f*r[i]**2\r\n f=f*-1\r\nprint(math.pi*s)", "import math\r\ninput()\r\n\r\nl=sorted(list(int(i)*int(i) for i in input().split()))\r\nprint(math.pi*(sum(l[::-2])-sum(l[-2::-2])))\r\n", "import math\nN = int(input())\nlist_of_rads = list(map(int,input().split(' ')))\nlist_of_rads.sort(reverse=True)\nsum = 0\n#print(list_of_rads)\nwhile len(list_of_rads) != 0:\n\tif len(list_of_rads) == 1:\n\t\tsum += (math.pi)*(list_of_rads[0]**2)\n\t\tlist_of_rads = list_of_rads[1:]\n\telse:\n\t\tsum+= (((math.pi)*(list_of_rads[0]**2)) - (math.pi)*(list_of_rads[1]**2))\n\t\tlist_of_rads = list_of_rads[2:]\nprint(sum)\n\t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t\t\t\t \t", "import math\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort(reverse=True)\r\narea=0\r\npi=3.1416\r\nif n==1:\r\n print(pi*a[0]*a[0])\r\nelse:\r\n if n%2==0:\r\n for i in range(n-1,0,-2):\r\n area+=(pi*a[i]*a[i]-pi*a[i-1]*a[i-1])\r\n else:\r\n for j in range(n-1,1,-2):\r\n area += (pi * a[j] * a[j] - pi * a[j - 1] * a[j - 1])\r\n area+=pi*a[0]*a[0]\r\n print(abs(area))\r\n", "import math\r\nn=int(input())\r\nr=[int(x) for x in input().split()]\r\n\r\nr.sort(reverse=True)\r\nr.append(0)\r\n\r\nans=0\r\ni=0\r\nwhile i<n:\r\n ans += r[i]**2 - r[i+1]**2\r\n i+=2\r\n\r\nans *= math.pi\r\nprint(\"{:.5f}\".format(ans))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n A.sort(reverse=True)\r\n ans = 0\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans += A[i] ** 2\r\n else:\r\n ans -= A[i] ** 2\r\n ans *= math.pi\r\n print('%.10f' % (ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import pi\r\n\r\nn = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\narr.sort(reverse= True)\r\narr.append(0)\r\nans = 0.0\r\ni = 0\r\nwhile i<n:\r\n ans += pi * (arr[i]**2 - arr[i+1]**2)\r\n i += 2\r\n\r\nprint(f\"{ans:.10f}\")", "\"\"\"\nhttps://codeforces.com/problemset/problem/157/B\n\"\"\"\npi = 3.141592653589793\nn = int(input())\nrayons = sorted([int(x) for x in input().split()], reverse=True)\nif n % 2 == 1:\n rayons.append(0)\n\nsurface_rouge = pi * sum(\n [x ** 2 - y ** 2 for (x, y) in zip(rayons[:-1:2], rayons[1::2])]\n)\n\nprint(surface_rouge)\n", "import math\r\n\r\nsize = int(input())\r\ncircles = input().split()\r\ncircles = [int(x) for x in circles]\r\ncircles.sort()\r\n\r\ntotal = 0\r\n\r\nif(size % 2 == 1):\r\n for i in range(size - 1, -1, -1):\r\n if(i % 2 == 0):\r\n total += math.pi * (circles[i]**2)\r\n else:\r\n total -= math.pi * (circles[i]**2)\r\nelse:\r\n for i in range(size - 1, -1, -1):\r\n if(i % 2 == 1):\r\n total += math.pi * (circles[i]**2)\r\n else:\r\n total -= math.pi * (circles[i]**2)\r\n \r\nprint(total)", "circles = int(input())\n\nradius = [ int(x) for x in input().split() ]\nradius.sort()\n\npi = 3.1415926536\n\nred_area = 0\n\nif circles%2==0:\n\tfor r in range(1,circles,2):\n\n\t\tred_area += radius[r]**2 - radius[r-1]**2\n\nelse:\n\tred_area = radius[0]**2\n\n\tfor r in range(2,circles,2):\n\n\t\tred_area += radius[r]**2 - radius[r-1]**2\n\nred_area *= pi\nprint(red_area)\n\n \t \t\t \t\t \t \t \t\t\t", "\"\"\"\r\n Template written to be used by Python Programmers.\r\n Use at your own risk!!!!\r\n Owned by adi0311(rating - 5 star at CodeChef and Specialist at Codeforces).\r\n\"\"\"\r\nimport sys\r\nimport heapq\r\nfrom math import *\r\nfrom collections import defaultdict as dd # defaultdict(<datatype>) Free of KeyError.\r\nfrom collections import deque # deque(list) append(), appendleft(), pop(), popleft() - O(1)\r\nfrom collections import Counter as c # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations as comb\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\n# sys.setrecursionlimit(2*pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(var)\r\ndef l(): return list(map(int, data().split()))\r\ndef sl(): return list(map(str, data().split()))\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [[val for i in range(n)] for j in range(m)]\r\n\r\n\r\nn = int(data())\r\narr = l()\r\narr.sort()\r\nanswer = 0.0\r\nif n % 2 == 0:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n answer -= pi * pow(arr[i], 2)\r\n else:\r\n answer += pi * pow(arr[i], 2)\r\nelse:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n answer += pi * pow(arr[i], 2)\r\n else:\r\n answer -= pi * pow(arr[i], 2)\r\nprint(\"%.5f\"%answer)\r\n", "pi=3.1415926536\r\nn=int(input())\r\nt=input()\r\nif n==1:\r\n\tprint(pi*int(t)**2)\r\nelse:\r\n\tli=[]\r\n\tfor x in t.split():\r\n\t\tli.append(int(x))\r\n\tli=sorted(li)\r\n\tif n%2==0:\r\n\t\tresult=0\r\n\t\tfor i in range(1,n):\r\n\t\t\tif i%2!=0:\r\n\t\t\t\tresult+=pi*(li[i]**2-li[i-1]**2)\r\n\telse:\r\n\t\tresult=pi*li[0]**2\t\r\n\t\tfor i in range(2,n):\r\n\t\t\tif i%2==0:\r\n\t\t\t\tresult+=pi*(li[i]**2-li[i-1]**2)\r\n\tprint(result)\t\t\t\r\n\r\n", "from sys import stdin, stdout\r\nfrom math import pi\r\n\r\nn = int(stdin.readline())\r\nvalues = sorted(list(map(int, stdin.readline().split())), reverse = True)\r\nans = 0\r\n\r\nfor i in range(n):\r\n if not i % 2:\r\n ans += values[i] ** 2\r\n else:\r\n ans -= values[i] ** 2\r\n\r\nstdout.write(str(pi * ans))", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil,pi\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort(reverse=True)\r\n\r\ntot = 0\r\nswitch = 1\r\nfor i in range(0,len(nums)):\r\n tot += pi*(nums[i]**2)*switch\r\n switch = -1 if switch==1 else 1\r\nprint(tot)", "import math\r\ncircles = int(input())\r\nradii = sorted(map(int,input().split()),reverse = True)\r\nif circles == 1:\r\n print ((radii[0]**2)*math.pi)\r\nelse:\r\n red = (radii[-1]**2)*math.pi if circles%2 else 0\r\n a = 1 if circles%2 else 0\r\n for x in range(1,circles-a,2):\r\n red += math.pi*(radii[x-1]**2 - radii[x]**2)\r\n print (red)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()];s=0;pi=3.1415926536\r\na.sort(reverse=True)\r\nfor i in range(0,n,2):\r\n try: s+=pi*(a[i]**2-a[i+1]**2)\r\n except: s+=pi*a[i]**2\r\nprint(s)", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nr = list(map(int, input().split()))\r\nr.sort(reverse = True)\r\ns = 0\r\nfor i in range(n):\r\n s += r[i] * r[i] if not i % 2 else -r[i] * r[i]\r\nans = math.pi * s\r\nprint(ans)", "import math\r\nn=int(input())\r\nr=[int(i) for i in input().split()]\r\nr.sort(reverse=True)\r\ncounter=0\r\nred=0\r\nwhile counter<n-1:\r\n red+=(r[counter]**2-r[counter+1]**2)\r\n counter+=2\r\nif counter==n-1:\r\n red+=r[counter]**2\r\nprint(red*math.pi)", "import math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\nsum=0\r\nk=1\r\nfor i in r:\r\n sum+=k*i*i\r\n k*=-1\r\n\r\nprint(math.pi*abs(sum))", "n, r, ans = int(input()), sorted(list(map(int, input().split())))[::-1], 0\r\nfor i in range(n):\r\n ans = ans + (1 if i % 2 == 0 else -1) * (r[i] ** 2)\r\nprint(\"%.20f\" % (ans * 3.1415926535897932384626433832795028841971))", "from math import pi\n\ndef main():\n n = int(input())\n a = sorted(list(map(int, input().split(' '))))[::-1]\n area = 0\n f = 0\n for i in range(n):\n cur = pi * a[i] * a[i]\n if f:\n area += cur\n else:\n area -= cur\n f ^= 1\n return abs(area)\nprint(main())\n", "import math\nx = int(input())\ny = input().split()\nfor i in range (0, len(y)):\n y[i]= int(y[i])\ny.sort(reverse = True)\ntotal =0\nalternator =1\nfor i in y:\n total += (math.pi * i ** 2) *alternator\n alternator *= -1\n\nprint(total)\n\t \t\t\t \t \t\t \t\t\t\t \t\t \t \t \t", "import math\n\ndef get_total_area(l):\n l.sort()\n\n if len(l) == 1:\n return math.pi * (l[0]**2)\n\n total_area = 0\n for i in range(len(l) - 1, 0, -2):\n total_area += (l[i] ** 2) * math.pi - (l[i-1]**2) * math.pi\n \n\n if len(l) % 2 != 0:\n total_area += (l[0] ** 2) * math.pi\n\n return total_area\n\n\nn = input()\nareas = list(map(int, input().split()))\n\nprint(get_total_area(areas))\n\n \n\t \t\t \t \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t", "from math import pi\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nif n%2==0:\r\n s=1\r\n ans=pi*(l[1]**2-l[0]**2)\r\nelse:\r\n s=0\r\n ans=pi*l[s]**2\r\ns+=2\r\nfor i in range(s,n,2):\r\n ans+=pi*abs(l[i]**2-l[i-1]**2)\r\nprint(\"{0:.10f}\".format(ans))", "\n\nimport math\nx = int(input())\na = [int(x) for x in input().split()]\na.sort(reverse = True)\ncounter = 0\ntest = 0\nfor items in a :\n if test == 0:\n counter += pow(items,2)\n test = 1\n else: \n test = 0\n counter -= pow(items,2)\nprint(counter * math.pi)\n\t \t \t \t\t\t \t \t \t\t\t", "'''\r\nProblema:\r\nCalcular a área total das partes vermelhas da parede.\r\n'''\r\n\r\nfrom math import pi\r\nn = int(input())\r\na = sorted(map(int,input().split()))\r\nd = [1,-1]; at = 0\r\nfor i in range(n):\r\n at += pi * d[i%2] * a[-1-i]**2\r\nprint(at)", "from math import pi\r\nn = int(input())\r\nr = sorted(list(map(int,input().split())))\r\ns = r[::-1]\r\na=0\r\nif n%2==0:\r\n for i in range(0,n-1,2):\r\n a+=s[i]**2-s[i+1]**2\r\nelse:\r\n a+=r[0]**2\r\n for i in range(2,n,2):\r\n a+=r[i]**2-r[i-1]**2\r\nprint(pi*a)\r\n", "n=int(input())\r\nradios = [int(num) for num in input().split(\" \", n-1)]\r\nsum = 0\r\nx = 1\r\nfor r in sorted(radios):\r\n sum += r*r*x \r\n x *= -1\r\nprint(abs(sum*3.1415926536))", "'''input\n1\n1\n'''\nfrom math import pi\nn = int(input())\nr = sorted(map(int, input().split()))\na = 0\nif n % 2 == 1:\n\ta += r.pop(0)**2\nwhile r:\n\tx, y = r.pop(0), r.pop(0)\n\ta += (y - x)*(y + x)\nprint(a*pi)", "import math\n\nn = int(input())\nr = map(int, input().split())\nr = sorted(list(map(lambda x: x*x, r)))\nprint(math.pi * (sum(r[::-2]) - sum(r[-2::-2])))\n\n \t\t\t \t \t\t\t\t\t\t \t \t \t\t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\npi=3.1415926536\r\narea=[l[0]**2]\r\nfor i in range(1,n):\r\n area.append(l[i]**2-l[i-1]**2)\r\n\r\nans=0\r\n#print(l,area)\r\nif n%2==1:\r\n for i in range(0,n,2):\r\n ans+=area[i]\r\n #print(ans,area[i])\r\nelse:\r\n for i in range(1,n,2):\r\n ans+=area[i]\r\n\r\nprint(ans*pi)", "import math\n\na=int(input())\n\nb=list(map(int,input().split()))\nb.sort()\n\nsoma=0\n\nfor i in range (-1,-a-1,-1):\n if i%2==1:\n soma+=b[i]**2*math.pi\n else:\n soma-=b[i]**2*math.pi\n\nprint (\"%.10f\"%(soma))\n \t\t\t\t \t \t\t \t\t\t \t\t\t \t\t\t \t", "n = int(input())\r\nl = sorted(list(map(int, input().split())), reverse=True)\r\nans = 0\r\ni = 0\r\npi = 3.1415926536\r\nwhile i<n:\r\n\tif i%2 == 0:\r\n\t\tans += pi*l[i]*l[i]\r\n\telse:\r\n\t\tans -= pi*l[i]*l[i]\r\n\ti += 1\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import pi\r\n\r\nn = int(input())\r\n\r\nrs = list(map(int,stdin.readline().split()))\r\n\r\nrs.sort()\r\nrs.reverse()\r\nra = 0\r\n# print(rs)\r\nrs.append(0)\r\nfor i in range(len(rs)-1):\r\n if(i%2==0):\r\n dif = rs[i]**2*pi-rs[i+1]**2*pi\r\n ra+=dif\r\n # print(ra)\r\nprint(ra)", "import sys\r\nimport math\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\npi = math.pi\r\n\r\nn = iinput()\r\nr = get_list()\r\nr.sort()\r\nans = 0\r\ni = n-1\r\n\r\nwhile(i>0):\r\n\tans += pi*(r[i]**2 - r[i-1]**2)\r\n\ti-=2\r\n\r\nif (n%2==1):\r\n\tans += pi*(r[0]**2)\r\nprint(ans)\t\t", "import math\narea = int(input())\nraios = input()\nraios = raios.split(\" \")\nfor i in range(len(raios)):\n raios[i] = int(raios[i])\n\nraios = sorted(raios,reverse=True)\nresultado = 0\nfor i in range(len(raios)):\n resultado += raios[i] * raios[i] * (1 - i % 2 * 2);\nprint('{:.10f}'.format(resultado*math.pi))\n \t \t\t \t \t\t \t", "import math\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nred,blue=sum([math.pi*(lst[i]**2) for i in range(0,n,2)]),sum([math.pi*(lst[i]**2) for i in range(1,n,2)])\r\nprint(abs(red-blue))", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\nansList = [math.pi*i*i for i in a]\r\nfor i in range(n):\r\n if i%2 != 0:\r\n ansList[i] *= -1\r\n\r\nprint(sum(ansList))", "import math\r\nn = int(input())\r\n\r\nlist1 = [int(x) for x in input().split()]\r\n\r\nlist1 = sorted(list1)\r\n\r\narea = 0\r\npie = math.pi\r\n\r\nif n % 2 == 1:\r\n area += (pie * (list1[0] * list1[0]))\r\n i = 1\r\n for i in range(1, n, 2):\r\n a1 = pie * (list1[i + 1] * list1[i + 1])\r\n a2 = pie * (list1[i] * list1[i])\r\n \r\n area += a1 - a2\r\nelse:\r\n for i in range(0, n, 2):\r\n a1 = pie * (list1[i + 1] * list1[i + 1])\r\n a2 = pie * (list1[i] * list1[i])\r\n \r\n area += a1 - a2\r\n\r\nprint(area)\r\n ", "from math import pi\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.append(0)\r\narr.sort()\r\nans = 0\r\nif n%2==0:\r\n for i in range(2,len(arr),2):\r\n ans+=(pi*(arr[i])**2-pi*(arr[i-1])**2)\r\nelse:\r\n for i in range(1,len(arr),2):\r\n ans+=(pi*(arr[i])**2-pi*(arr[i-1])**2)\r\nprint(f'{ans:.5f}')", "from math import pi\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n r = [int(i) for i in input().split()]\r\n r.sort()\r\n r = r[::-1]\r\n s = 0\r\n for i in range(n):\r\n if i % 2 == 0:\r\n s += pi * r[i] ** 2\r\n else:\r\n s -= pi * r[i] ** 2\r\n\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\n\r\n\r\ndef S(r):\r\n return math.pi * r ** 2\r\n\r\n\r\nn = int(input())\r\nr_s = sorted(list(map(int, input().split())))\r\nsumma = 0\r\nif n % 2 == 1:\r\n summa += S(r_s[0])\r\n\r\n for i in range(1, n-1):\r\n if i % 2 == 1:\r\n summa += S(r_s[i + 1]) - S(r_s[i])\r\nelse:\r\n for i in range(n-1):\r\n if i % 2 == 0:\r\n summa += S(r_s[i + 1]) - S(r_s[i])\r\nprint(summa)", "import math\r\nn = int(input())\r\n\r\nradii = list(map(int,input().split()))\r\nradii.sort()\r\nradii = radii[::-1]\r\n\r\nif n ==1:\r\n print(\"%.10f\" %(math.pi*radii[0]*radii[0]))\r\n exit()\r\n\r\nsummy = 0\r\n\r\nfor i in range(0, n, 2):\r\n summy += (radii[i]**2)\r\nfor j in range(1, n, 2):\r\n summy -= (radii[j]**2)\r\n \r\nprint(\"%.10f\" %(summy*math.pi))", "import math\r\ninput()\r\nprint(math.pi * sum(r ** 2 * (-1) ** i for i, r in enumerate(reversed(sorted(map(int, input().split()))))))", "from math import pi\ninput()\na=sorted(map(int,input().split()),reverse=True)\nprint(sum(map(lambda x:pi*a[x]**2*(-1)**x,range(len(a)))))\n\t\t \t\t\t\t \t\t\t\t\t \t \t\t \t \t", "from math import pi\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nr = sorted(list(map(lambda x: int(x) * int(x), input().split())), reverse=True)\r\nprint(pi * (sum(r[::2]) - sum(r[1::2])))\r\n", "import math\r\n\r\nnumero = int(input())\r\ninteiros = list(map(int, input().split()))\r\n\r\ninteiros.sort(reverse=True)\r\narea_vermelha = 0\r\n\r\nfor i in range(numero):\r\n area_vermelha += inteiros[i] * inteiros[i] * (1 - i % 2 * 2)\r\n\r\nprint(f\"{math.pi * area_vermelha:.10f}\")", "from sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom math import pi\r\n\r\nans=0\r\nn=it()\r\nv=mp()\r\nv.sort(reverse=True)\r\n# print(v)\r\nfor i in range(len(v)):\r\n\tif not i&1:\r\n\t\tans+=v[i]**2\r\n\telse:\r\n\t\tans-=(v[i]**2)\r\nprint(ans*pi)\r\n\r\n", "import math\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nsol=0\r\ni=0\r\nwhile len(arr)>0:\r\n ele=arr.pop(-1)\r\n if i%2==0:\r\n sol+=math.pi*(ele**2)\r\n else:\r\n sol-=math.pi*(ele**2)\r\n i+=1\r\nprint(sol)", "def question2():\r\n number_of_circles = int(input())\r\n radius_of = list(map(int,input().split()))\r\n radius_of.sort(reverse = True)\r\n red_area = 0\r\n circle = 0\r\n pie = 3.1415926536\r\n while circle < number_of_circles:\r\n if circle+1 < number_of_circles:\r\n red_area += pie*(radius_of[circle]**2 - radius_of[circle+1]**2)\r\n circle += 2 \r\n else:\r\n red_area += pie*(radius_of[circle]**2)\r\n circle += 1\r\n \r\n \r\n return red_area \r\n# remained_test_cases = int(input())\r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question2())\r\n remained_test_cases -= 1 ", "import math\nn, lista = int(input()), sorted([int(x) for x in input().split()])\n\n\ndef par(n, lista):\n pintado = 0\n for i in range(2, n + 1):\n if i % 2 == 0:\n pintado += math.pi * lista[i-1] ** 2 - math.pi * lista[i-2] ** 2\n return pintado\n\n\ndef impar(n, lista):\n pintado = 0\n for i in range(1,n+1):\n if i == 1:\n pintado += math.pi*lista[i-1]**2\n elif i > 1 and i % 2 != 0:\n pintado += (math.pi*lista[i-1]**2) - (math.pi*lista[i-2]**2)\n return pintado\n\n\n\n\nif n % 2 == 0:\n resultado = par(n, lista)\n print(f\"{resultado:.10f}\")\nelse:\n resultado = impar(n, lista)\n print(f\"{resultado:.10f}\")\n\t \t\t \t \t \t \t \t\t\t\t \t\t\t", "n=int(input())\r\ns1=0;s2=0\r\np=0\r\nradius=list(map(int,input().split()))\r\nradius.sort(reverse=True)\r\nfor i in radius:\r\n if p==0:\r\n s1+=pow(i,2)\r\n p=1\r\n else:\r\n s2+=pow(i,2)\r\n p=0\r\nprint((s1-s2)*3.1415926536)", "import math\r\n\r\npi = math.pi\r\nn = int(input())\r\nr = sorted(list(map(int, input().split())))\r\narea = 0\r\n\r\nf = 1 if n % 2 == 0 else 0\r\nfor i in range(n):\r\n if (i+f) % 2 == 0:\r\n area += r[i]**2 * pi\r\n else:\r\n area -= r[i]**2 * pi\r\nprint(area)", "from math import pi\n\nqtd_circulos = int(input())\ncompri_raios = list(map(int, input().split()))\ncompri_raios.sort()\n\narea_total = 0\narea_azul = 0\ntamanho = len(compri_raios)\n\n# se o tamanho for par o circulo menor será o azul\nif(tamanho%2 == 0):\n for i in range(tamanho):\n if(i%2 != 0):\n area_total += (pi * (compri_raios[i] ** 2)) - area_azul\n else:\n area_azul = pi * (compri_raios[i] ** 2)\nelse:\n for i in range(tamanho):\n if(i%2 != 0):\n area_azul = pi * (compri_raios[i] ** 2)\n else:\n area_total += (pi * (compri_raios[i] ** 2)) - area_azul\n\nprint(\"%.10f\" % (area_total))\n\n \t \t\t \t\t \t\t\t\t\t\t \t \t\t\t \t\t\t\t\t\t", "import math\n\ninput1 = input()\n\ncircles = list(map(eval, input().split()))\ncircles.sort(reverse=True)\n\nresult = 0\n\nfor i in range(len(circles)):\n if i%2 == 0:\n result += math.pi*(circles[i]**2)\n else:\n result -= math.pi*(circles[i]**2)\n\n\nprint(result)\n \t\t \t\t \t\t \t\t\t\t\t\t\t\t \t \t", "from math import *\r\ndef area(radi):\r\n return pow(radi, 2) * pi\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.append(0)\r\nA.sort()\r\nans = 0\r\ncur = 0\r\nfor i in range(N, 0, -1):\r\n if cur == 1:\r\n cur = 0\r\n else:\r\n ans += area(A[i]) - area(A[i - 1])\r\n cur = 1\r\nprint(ans) \r\n \r\n ", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\n\r\nr = inlist()\r\n\r\nr = sorted(r, reverse=True)\r\nres = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n res += pi*r[i]*r[i]\r\n else:\r\n res -= pi*r[i]*r[i]\r\nprint(res)\r\n", "from sys import stdin, stdout\r\n\r\ns = int(stdin.readline())\r\n\r\nlt = [int(x)**2 for x in stdin.readline().split()]\r\n\r\nlt.sort()\r\naux=0\r\nif s%2==0:\r\n aux=-1\r\nelse:\r\n aux=1 \r\nans=0\r\nfor x in lt:\r\n ans = ans + aux*x \r\n aux*=-1\r\nans = 3.1415926536*ans\r\nstdout.write(str(ans))", "from functools import reduce\r\n\r\nnum = str(input())\r\ns = list(map(lambda t: int(t)**2, str(input()).split(' ')))\r\ns.sort(reverse=True)\r\nfor i in range(1, len(s), 2):\r\n s[i] = -s[i]\r\nres = reduce((lambda x, y: x + y), s)\r\nprint(res * 3.14159265)", "num=int(input())\r\nli=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nli.sort()\r\n#print(li)\r\nfor i in range(len(li)):\r\n if i%2==0:\r\n odd+=(3.1415926536)*(li[i]*li[i])\r\n else:\r\n even+=(3.1415926536)*(li[i]*li[i])\r\nprint(abs(odd-even))", "import math # для числа пи\r\nn = int(input()) # ввод числа\r\n# split - получение разбиение строки одстроки(по умолчанию разделителем считается пробел)\r\n# map(int, ... - преобразование в int\r\n# list - преобразование в список\r\n# sorted - сортировка \r\nList = sorted(list(map(int, input().split())), reverse = True)\r\n\r\n# цикл [0, n-1]\r\nfor i in range(n):\r\n # Формула площади... ** - степень\r\n List[i] = List[i]**2 * math.pi\r\n # т.к. каждая нечётная окружность синего цвета, делаем её отрицательной\r\n if i%2==1:\r\n List[i] *=-1\r\n# сумируем все получившиеся элементы и выводим результат\r\nprint(sum(List))\r\n", "import math\r\n\r\nn = int(input())\r\nri = list(map(int, input().split()))\r\nri.sort()\r\nres = 0\r\nk = 1\r\nfor i in ri:\r\n res += k * i * i\r\n k *= -1\r\nprint(math.pi*abs(res))" ]

{"inputs": ["1\n1", "3\n1 4 2", "4\n4 1 3 2", "4\n100 10 2 1", "10\n10 9 8 7 6 5 4 3 2 1", "1\n1000", "8\n8 1 7 2 6 3 5 4", "100\n1000 999 998 997 996 995 994 993 992 991 990 989 988 987 986 985 984 983 982 981 980 979 978 977 976 975 974 973 972 971 970 969 968 967 966 965 964 963 962 961 960 959 958 957 956 955 954 953 952 951 950 949 948 947 946 945 944 943 942 941 940 939 938 937 936 935 934 933 932 931 930 929 928 927 926 925 924 923 922 921 920 919 918 917 916 915 914 913 912 911 910 909 908 907 906 905 904 903 902 901", "6\n109 683 214 392 678 10", "2\n151 400", "6\n258 877 696 425 663 934", "9\n635 707 108 234 52 180 910 203 782", "8\n885 879 891 428 522 176 135 983", "3\n269 918 721", "7\n920 570 681 428 866 935 795", "2\n517 331", "2\n457 898", "8\n872 704 973 612 183 274 739 253", "74\n652 446 173 457 760 847 670 25 196 775 998 279 656 809 883 148 969 884 792 502 641 800 663 938 362 339 545 608 107 184 834 666 149 458 864 72 199 658 618 987 126 723 806 643 689 958 626 904 944 415 427 498 628 331 636 261 281 276 478 220 513 595 510 384 354 561 469 462 799 449 747 109 903 456", "76\n986 504 673 158 87 332 124 218 714 235 212 122 878 370 938 81 686 323 386 348 410 468 875 107 50 960 82 834 234 663 651 422 794 633 294 771 945 607 146 913 950 858 297 88 882 725 247 872 645 749 799 987 115 394 380 382 971 429 593 426 652 353 351 233 868 598 889 116 71 376 916 464 414 976 138 903", "70\n12 347 748 962 514 686 192 159 990 4 10 788 602 542 946 215 523 727 799 717 955 796 529 465 897 103 181 515 495 153 710 179 747 145 16 585 943 998 923 708 156 399 770 547 775 285 9 68 713 722 570 143 913 416 663 624 925 218 64 237 797 138 942 213 188 818 780 840 480 758", "26\n656 508 45 189 561 366 96 486 547 386 703 570 780 689 264 26 11 74 466 76 421 48 982 886 215 650", "52\n270 658 808 249 293 707 700 78 791 167 92 772 807 502 830 991 945 102 968 376 556 578 326 980 688 368 280 853 646 256 666 638 424 737 321 996 925 405 199 680 953 541 716 481 727 143 577 919 892 355 346 298", "77\n482 532 200 748 692 697 171 863 586 547 301 149 326 812 147 698 303 691 527 805 681 387 619 947 598 453 167 799 840 508 893 688 643 974 998 341 804 230 538 669 271 404 477 759 943 596 949 235 880 160 151 660 832 82 969 539 708 889 258 81 224 655 790 144 462 582 646 256 445 52 456 920 67 819 631 484 534", "27\n167 464 924 575 775 97 944 390 297 315 668 296 533 829 851 406 702 366 848 512 71 197 321 900 544 529 116", "38\n488 830 887 566 720 267 583 102 65 200 884 220 263 858 510 481 316 804 754 568 412 166 374 869 356 977 145 421 500 58 664 252 745 70 381 927 670 772", "64\n591 387 732 260 840 397 563 136 571 876 831 953 799 493 579 13 559 872 53 678 256 232 969 993 847 14 837 365 547 997 604 199 834 529 306 443 739 49 19 276 343 835 904 588 900 870 439 576 975 955 518 117 131 347 800 83 432 882 869 709 32 950 314 450", "37\n280 281 169 68 249 389 977 101 360 43 448 447 368 496 125 507 747 392 338 270 916 150 929 428 118 266 589 470 774 852 263 644 187 817 808 58 637", "97\n768 569 306 968 437 779 227 561 412 60 44 807 234 645 169 858 580 396 343 145 842 723 416 80 456 247 81 150 297 116 760 964 312 558 101 850 549 650 299 868 121 435 579 705 118 424 302 812 970 397 659 565 916 183 933 459 6 593 518 717 326 305 744 470 75 981 824 221 294 324 194 293 251 446 481 215 338 861 528 829 921 945 540 89 450 178 24 460 990 392 148 219 934 615 932 340 937", "94\n145 703 874 425 277 652 239 496 458 658 339 842 564 699 893 352 625 980 432 121 798 872 499 859 850 721 414 825 543 843 304 111 342 45 219 311 50 748 465 902 781 822 504 985 919 656 280 310 917 438 464 527 491 713 906 329 635 777 223 810 501 535 156 252 806 112 971 719 103 443 165 98 579 554 244 996 221 560 301 51 977 422 314 858 528 772 448 626 185 194 536 66 577 677", "97\n976 166 649 81 611 927 480 231 998 711 874 91 969 521 531 414 993 790 317 981 9 261 437 332 173 573 904 777 882 990 658 878 965 64 870 896 271 732 431 53 761 943 418 602 708 949 930 130 512 240 363 458 673 319 131 784 224 48 919 126 208 212 911 59 677 535 450 273 479 423 79 807 336 18 72 290 724 28 123 605 287 228 350 897 250 392 885 655 746 417 643 114 813 378 355 635 905", "91\n493 996 842 9 748 178 1 807 841 519 796 998 84 670 778 143 707 208 165 893 154 943 336 150 761 881 434 112 833 55 412 682 552 945 758 189 209 600 354 325 440 844 410 20 136 665 88 791 688 17 539 821 133 236 94 606 483 446 429 60 960 476 915 134 137 852 754 908 276 482 117 252 297 903 981 203 829 811 471 135 188 667 710 393 370 302 874 872 551 457 692", "95\n936 736 17 967 229 607 589 291 242 244 29 698 800 566 630 667 90 416 11 94 812 838 668 520 678 111 490 823 199 973 681 676 683 721 262 896 682 713 402 691 874 44 95 704 56 322 822 887 639 433 406 35 988 61 176 496 501 947 440 384 372 959 577 370 754 802 1 945 427 116 746 408 308 391 397 730 493 183 203 871 831 862 461 565 310 344 504 378 785 137 279 123 475 138 415", "90\n643 197 42 218 582 27 66 704 195 445 641 675 285 639 503 686 242 327 57 955 848 287 819 992 756 749 363 48 648 736 580 117 752 921 923 372 114 313 202 337 64 497 399 25 883 331 24 871 917 8 517 486 323 529 325 92 891 406 864 402 263 773 931 253 625 31 17 271 140 131 232 586 893 525 846 54 294 562 600 801 214 55 768 683 389 738 314 284 328 804", "98\n29 211 984 75 333 96 840 21 352 168 332 433 130 944 215 210 620 442 363 877 91 491 513 955 53 82 351 19 998 706 702 738 770 453 344 117 893 590 723 662 757 16 87 546 312 669 568 931 224 374 927 225 751 962 651 587 361 250 256 240 282 600 95 64 384 589 813 783 39 918 412 648 506 283 886 926 443 173 946 241 310 33 622 565 261 360 547 339 943 367 354 25 479 743 385 485 896 741", "93\n957 395 826 67 185 4 455 880 683 654 463 84 258 878 553 592 124 585 9 133 20 609 43 452 725 125 801 537 700 685 771 155 566 376 19 690 383 352 174 208 177 416 304 1000 533 481 87 509 358 233 681 22 507 659 36 859 952 259 138 271 594 779 576 782 119 69 608 758 283 616 640 523 710 751 34 106 774 92 874 568 864 660 998 992 474 679 180 409 15 297 990 689 501", "97\n70 611 20 30 904 636 583 262 255 501 604 660 212 128 199 138 545 576 506 528 12 410 77 888 783 972 431 188 338 485 148 793 907 678 281 922 976 680 252 724 253 920 177 361 721 798 960 572 99 622 712 466 608 49 612 345 266 751 63 594 40 695 532 789 520 930 825 929 48 59 405 135 109 735 508 186 495 772 375 587 201 324 447 610 230 947 855 318 856 956 313 810 931 175 668 183 688", "96\n292 235 391 180 840 172 218 997 166 287 329 20 886 325 400 471 182 356 448 337 417 319 58 106 366 764 393 614 90 831 924 314 667 532 64 874 3 434 350 352 733 795 78 640 967 63 47 879 635 272 145 569 468 792 153 761 770 878 281 467 209 208 298 37 700 18 334 93 5 750 412 779 523 517 360 649 447 328 311 653 57 578 767 460 647 663 50 670 151 13 511 580 625 907 227 89", "100\n469 399 735 925 62 153 707 723 819 529 200 624 57 708 245 384 889 11 639 638 260 419 8 142 403 298 204 169 887 388 241 983 885 267 643 943 417 237 452 562 6 839 149 742 832 896 100 831 712 754 679 743 135 222 445 680 210 955 220 63 960 487 514 824 481 584 441 997 795 290 10 45 510 678 844 503 407 945 850 84 858 934 500 320 936 663 736 592 161 670 606 465 864 969 293 863 868 393 899 744", "100\n321 200 758 415 190 710 920 992 873 898 814 259 359 66 971 210 838 545 663 652 684 277 36 756 963 459 335 484 462 982 532 423 131 703 307 229 391 938 253 847 542 975 635 928 220 980 222 567 557 181 366 824 900 180 107 979 112 564 525 413 300 422 876 615 737 343 902 8 654 628 469 913 967 785 893 314 909 215 912 262 20 709 363 915 997 954 986 454 596 124 74 159 660 550 787 418 895 786 293 50", "100\n859 113 290 762 701 63 188 431 810 485 671 673 99 658 194 227 511 435 941 212 551 124 89 222 42 321 657 815 898 171 216 482 707 567 724 491 414 942 820 351 48 653 685 312 586 24 20 627 602 498 533 173 463 262 621 466 119 299 580 964 510 987 40 698 521 998 847 651 746 215 808 563 785 837 631 772 404 923 682 244 232 214 390 350 968 771 517 900 70 543 934 554 681 368 642 575 891 728 478 317", "100\n941 283 349 457 52 837 299 284 796 305 893 624 101 972 738 204 121 70 17 704 836 791 95 111 162 952 472 724 733 580 878 177 705 804 11 211 463 417 288 409 410 485 896 755 921 267 164 656 505 765 539 439 535 19 991 689 220 474 114 944 884 144 926 849 486 566 117 35 749 499 797 303 362 905 690 890 976 66 590 183 234 683 39 297 769 787 376 541 571 759 495 200 261 352 73 493 831 442 273 339", "100\n110 868 147 888 291 282 916 542 917 337 235 595 498 621 814 249 261 713 445 666 142 275 319 49 900 543 333 606 487 670 620 769 852 258 230 867 603 491 714 839 879 37 21 74 590 190 397 506 499 967 152 862 200 107 145 23 614 167 857 475 79 598 270 906 626 116 89 59 651 846 723 201 50 699 522 408 634 132 226 414 824 764 513 586 526 238 556 162 667 173 684 415 527 743 10 442 552 274 350 822", "100\n901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000"], "outputs": ["3.1415926536", "40.8407044967", "31.4159265359", "31111.1920484997", "172.7875959474", "3141592.6535897931", "113.0973355292", "298608.3817237098", "397266.9574170437", "431023.3704798660", "823521.3902487604", "1100144.9065826489", "895488.9947571954", "1241695.6467754442", "1469640.1849419588", "495517.1260654109", "1877274.3981158488", "1780774.0965755312", "1510006.5089479341", "1528494.7817143100", "1741821.4892636713", "1818821.9252031571", "1272941.9273080483", "2045673.1891262225", "1573959.9105970615", "1479184.3434235646", "1258248.6984672088", "1495219.0323274869", "1577239.7333274092", "1624269.3753516484", "1615601.7212203942", "1806742.5014501044", "1611115.5269110680", "1569819.2914796301", "2042921.1539616778", "1310703.8710041976", "1686117.9099228707", "1419726.5608617242", "1556458.0979239127", "1775109.8050211088", "1447969.4788174964", "1597889.4218394549", "1567230.6191330721", "298608.3817237098"]}

UNKNOWN

PYTHON3

CODEFORCES

314

d0af4a8c1ee35c1950cff7a2dcfd802f

Felicity's Big Secret Revealed

The gym leaders were fascinated by the evolutions which took place at Felicity camp. So, they were curious to know about the secret behind evolving Pokemon. The organizers of the camp gave the gym leaders a PokeBlock, a sequence of *n* ingredients. Each ingredient can be of type 0 or 1. Now the organizers told the gym leaders that to evolve a Pokemon of type *k* (*k*<=≥<=2), they need to make a valid set of *k* cuts on the PokeBlock to get smaller blocks. Suppose the given PokeBlock sequence is *b*0*b*1*b*2... *b**n*<=-<=1. You have a choice of making cuts at *n*<=+<=1 places, i.e., Before *b*0, between *b*0 and *b*1, between *b*1 and *b*2, ..., between *b**n*<=-<=2 and *b**n*<=-<=1, and after *b**n*<=-<=1. The *n*<=+<=1 choices of making cuts are as follows (where a | denotes a possible cut): Consider a sequence of *k* cuts. Now each pair of consecutive cuts will contain a binary string between them, formed from the ingredient types. The ingredients before the first cut and after the last cut are wasted, which is to say they are not considered. So there will be exactly *k*<=-<=1 such binary substrings. Every substring can be read as a binary number. Let *m* be the maximum number out of the obtained numbers. If all the obtained numbers are positive and the set of the obtained numbers contains all integers from 1 to *m*, then this set of cuts is said to be a valid set of cuts. For example, suppose the given PokeBlock sequence is 101101001110 and we made 5 cuts in the following way: So the 4 binary substrings obtained are: 11, 010, 01 and 1, which correspond to the numbers 3, 2, 1 and 1 respectively. Here *m*<==<=3, as it is the maximum value among the obtained numbers. And all the obtained numbers are positive and we have obtained all integers from 1 to *m*. Hence this set of cuts is a valid set of 5 cuts. A Pokemon of type *k* will evolve only if the PokeBlock is cut using a valid set of *k* cuts. There can be many valid sets of the same size. Two valid sets of *k* cuts are considered different if there is a cut in one set which is not there in the other set. Let *f*(*k*) denote the number of valid sets of *k* cuts. Find the value of . Since the value of *s* can be very large, output *s* modulo 109<=+<=7. The input consists of two lines. The first line consists an integer *n* (1<=≤<=*n*<=≤<=75) — the length of the PokeBlock. The next line contains the PokeBlock, a binary string of length *n*. Output a single integer, containing the answer to the problem, i.e., the value of *s* modulo 109<=+<=7. Sample Input 4 1011 2 10 Sample Output 10 1

[ "mo = 10**9+7\r\ndef calc(l, r, si):\r\n res = 0\r\n for i in range(l, r + 1):\r\n res = res * 2 + int(si[i])\r\n return res\r\n \r\ndef main():\r\n n, si = int(input()), input()\r\n si = chr(0)+si\r\n f = [[0]*(1<<20) for i in range(6)]\r\n res, r, f[0][0]= 0, 0, 1\r\n for i in range(1, n+1):\r\n r=(r+1)%6\r\n f[r] = [0]*(1<<20)\r\n for j in range(1, min(5, i) + 1):\r\n if si[i-j+1] != '0':\r\n c, p = calc(i-j+1, i, si), (r-j+6)%6\r\n if(c>20 or c<1): break\r\n for s in range(1<<20):\r\n if(f[p][s]):\r\n f[r][s|(1<<(c-1))] = (f[r][s|(1<<(c-1))] + f[p][s]) % mo\r\n for s in range(1, 21):\r\n res = (res + f[r][(1<<s)-1]) % mo\r\n f[r][0] = (f[r][0] + 1) % mo\r\n if(si[i]=='0'):\r\n p=(r-1+6)%6\r\n for s in range(1<<20):\r\n if(f[p][s]):\r\n f[r][s] = (f[r][s] + f[p][s]) % mo\r\n print(res)\r\n\r\nmain()" ]

{"inputs": ["4\n1011", "2\n10", "7\n0110011", "10\n0100011101", "12\n010010101011", "31\n1000000010111001111000111001110", "62\n00010011000110010011110110011001110110010011110110111100100010", "51\n100010110000000110000101100110111110001001011000000", "75\n011001100010010010100010011010001000110010011010100111110110100000010111111", "75\n010110111011010010011101000010001010011111100101000101001100110010001010100", "75\n101111111101000110000001001101011101100010010001011010010100001001111111110", "75\n110100001001110011011011101010001001101000111110010001111110101001011111110", "9\n110101010", "17\n11110101001000001", "17\n10110100110101010", "25\n0000001101010011111101101", "25\n1001101000101001111011100", "25\n0110000000100001011010110", "33\n010001101110010000001001100001000", "33\n111111000000010010010010101000101", "41\n00111110100100100001101110011100011010010", "41\n00101001111010010011011101000100100000100", "49\n0100000110110101000011101100011000111010110100110", "49\n1110001011001111000000101011111111010111101101010", "49\n1001001011010111000101011111101000100101101110110", "57\n001101010001001110011001100011100111101010100000100100111", "57\n101011110010100010010001111101111001011110101000001111100", "57\n010000101010000000000010101010110111010110001110101111001", "65\n01100100011001001010011011011001101010111011010101101011111001000", "65\n00111101000100110101110000101000101001011101110110100100000011101", "73\n1001100010010111111000001100100011111011110100000101110101001001010100011", "73\n0000101011101101110110000010000100010010010011100011101010010110010001110", "73\n0101010100110101110101000111110001110110000011001011000100110000111010011", "73\n1110011000101111111111111010010110011001111111100111110110100101011111110", "73\n1111100101110101011111110111110011100100111000000001101000110011111010011", "44\n11000011111110110100110110010101001000111011", "2\n11", "32\n10011100101110110101100111001010", "16\n1110101011100001", "56\n10010100101100101000110110001001110101011111100100111101", "68\n11100010101100000101101100010111100111001110010010101011111100111110", "62\n00000100010110001100000101000001011001000111101011100110000101", "21\n110001101110001001100", "23\n11100111010100011110000", "60\n001100010011100010101011000011101010111101011101111101001001", "59\n10110000010101101101110000000001010010011111001111000110110", "42\n100001010001111100000010101101110100001001", "23\n01111101010011011011001", "1\n0", "15\n101000111100010", "31\n1010100111110001001010101000001", "75\n011101011001000010000010001001010100101001111110110111101000101101111010101", "75\n100101111101111010001000111011001010101001011110111111101110010011011111110", "75\n111011001000011110100101001011111010101001101010000100001100111001011101111", "75\n111100100001011010000101101000010100110110011110100110101011111101101110100", "75\n111100101001010010011000100100011101111000101100101110100100001111101001011", "75\n001010011010111110010011100100000101101010001110010011100100100011101000111", "75\n111000100000010001101110100100111010000111110010101010110100111101101110010", "75\n010101100111100101010010011001000000110010100110100101110011111101111010010", "75\n110100001100101001001001001000010000011101011100000100011111011011000111110", "75\n010001001010001101000100100000101111111010010100110100111111101000111011010", "75\n111001001011110001010100000011110010010100011011110101001001100101100010001", "75\n010010111010010011100001010011010001010011010011110010111110010000101100001", "75\n111111111111111111111111111111111111111111111111111111111111111111111111111", "75\n111111111111111111111111111111111111111111111111111111111111111111111111110", "75\n111111110111111011111111011111110011111110100011111111111000011111111111110", "75\n010101000010101111110011110010001010100101010001110110111110000111100010111", "75\n111010111011001000011100001101010001111001110010101001110011001010110001000", "75\n110111000100001111000101101100110010100011110101110100110111111100011000101", "75\n111000011010111110100101101000000001101010100010111001101010010110011011000", "75\n101100111111100100000011101001110100111101100010100101110101100111101110011", "75\n111010011111111000010100111011100101001001001111010010110001111011011100011", "75\n000000000000100000000000011000010000101010100000000000000000000000000000100", "1\n1", "2\n01", "75\n100000000000000000000000000000000000000000000000000000000000000000000000001", "75\n100000000000000000000000001111000000000000000000000000010000000000000001000", "75\n101110000111010110110011001111111100100111010000001000111100001110100110011", "75\n010010011001101111001011110001000011010010110001100101010110011100001100111", "75\n110001100110100011000010111100101101111100101000110111000110100110001010010", "75\n100101101110001111111110110010100001111010010110101001010011011111001100111", "75\n000101000100010101111100101111011001100100101111010000011100011110110100100", "75\n010101000110111001011110011011010000100100111011110000011110011010000110111", "75\n111111111111111111111111111011001111111111111111111111111111111111011111111", "75\n000000000010001000000000000000000000001000001000000000000000000000000000000", "75\n011111101111111111111111111111111110111101111111111111111111111111111111111", "75\n101111101111111111111111111111111111101111110111111111111111111111111111111", "75\n111111111110011111111111111101111111111111111111111111111111111111110111111", "75\n111111101111011101101111111111111111111100111111111101111111111110111111111", "75\n111111111111011011111111111111111110011111111011111111011111111110111011111", "75\n100000000000000000000000000000011000100001000000000000000100001000000001000", "75\n001000000000000000010000000000000000101000000010000100000000100010000000000", "75\n000000000100000000000000001000000101000000000000000000000000000000000000000", "75\n101001100001001000010001000110010000101001000010010010100110000101010101000", "75\n100001000100010000111100100101001001000010100001000100100100011000010001010", "75\n110000100001001010001000100010001010100010001011000100010000100010100011001", "75\n100101000010111000101001000100001000010010100100101000010010000100001000010", "75\n100001001000100010110100001010000100001001000110000100010000110100010100111", "75\n110000101100001010000100110001001000010110100001101010100010010001000010000", "75\n100010100110000100100001000110100100100010000100010100010010000101000100001", "75\n100100011011000010000101101001010001011100001100001100110000100001000101001", "75\n101001010010110000100100001000010110010100110001000010000100001000111000101", "75\n110001001100001010100010110001010000100100010000110000110010000100100100011", "75\n000000000000000000000000000000000000000000000000000000000000000000000001011"], "outputs": ["10", "1", "28", "80", "298", "129377", "996654969", "26730714", "928344407", "375282145", "623731146", "601716747", "97", "614", "2026", "29992", "44856", "3455", "30402", "155739", "15011055", "6654256", "284760197", "113840431", "123145241", "313846708", "565909910", "317648452", "223299317", "911430600", "933309680", "216844366", "887992377", "688351754", "588026128", "299589727", "3", "2055033", "822", "724204481", "924337491", "42655630", "3389", "9071", "67025753", "77661632", "3715362", "34033", "0", "406", "164173", "864150441", "388576952", "47586061", "457624439", "271125629", "517784773", "689673388", "236468305", "65671604", "200661894", "224259484", "782231136", "2850", "598994266", "303998985", "817830931", "678777685", "856496502", "132632533", "662817629", "122189821", "32314", "1", "2", "77", "2388", "706235237", "83382495", "531446727", "158490657", "650849043", "523584169", "763088827", "432", "69182016", "57141715", "820494757", "65685547", "57316598", "13285", "8162", "477", "377044625", "401069803", "952955634", "454813411", "852034934", "953764512", "37562460", "292478450", "174101396", "186593444", "365"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d0b4203b9ff07c161d2aaec568cce045

Chess For Three

Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same team, they have decided to practise really hard before the tournament. But it's a bit difficult for them because chess is a game for two players, not three. So they play with each other according to following rules: - Alex and Bob play the first game, and Carl is spectating; - When the game ends, the one who lost the game becomes the spectator in the next game, and the one who was spectating plays against the winner. Alex, Bob and Carl play in such a way that there are no draws. Today they have played *n* games, and for each of these games they remember who was the winner. They decided to make up a log of games describing who won each game. But now they doubt if the information in the log is correct, and they want to know if the situation described in the log they made up was possible (that is, no game is won by someone who is spectating if Alex, Bob and Carl play according to the rules). Help them to check it! The first line contains one integer *n* (1<=≤<=*n*<=≤<=100) — the number of games Alex, Bob and Carl played. Then *n* lines follow, describing the game log. *i*-th line contains one integer *a**i* (1<=≤<=*a**i*<=≤<=3) which is equal to 1 if Alex won *i*-th game, to 2 if Bob won *i*-th game and 3 if Carl won *i*-th game. Print YES if the situation described in the log was possible. Otherwise print NO. Sample Input 3 1 1 2 2 1 2 Sample Output YES NO

[ "n=int(input())\r\nlst=[]\r\nres=[1,2]\r\nfor i in range(n):\r\n lst.append(int(input()))\r\ncheck=1\r\nfor i in lst:\r\n if i not in res:\r\n check=0\r\n break\r\n else:\r\n if i==1:\r\n if sum(res)==3:\r\n res.remove(2)\r\n res.append(3)\r\n else:\r\n res.remove(3)\r\n res.append(2)\r\n elif i==2:\r\n if sum(res)==3:\r\n res.remove(1)\r\n res.append(3)\r\n else:\r\n res.remove(3)\r\n res.append(1)\r\n else:\r\n if sum(res)==4:\r\n res.remove(1)\r\n res.append(2)\r\n else:\r\n res.remove(2)\r\n res.append(1)\r\nif check==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(input()) for _ in range(n)]\r\nf = 3\r\nfor x in a:\r\n if x == f:\r\n print(\"NO\")\r\n break\r\n for i in range(1, 4):\r\n if i != x and i != f:\r\n f = i\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\nspectator = 3\r\nfor i in range(n):\r\n winner = int(input())\r\n if winner == spectator:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n loser = 6 - (spectator + winner)\r\n spectator, player = loser, winner \r\nprint(\"YES\")\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nq=[1,2,3]\r\nfor _ in range(int(input())):\r\n m=int(input())\r\n if m==q[0]:\r\n q[1],q[2]=q[2],q[1]\r\n elif m==q[1]:\r\n q[0],q[2]=q[2],q[0]\r\n else:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")", "p=3;a=[1,2,3];k=0\r\nfor i in range(int(input())):\r\n\tx=int(input())\r\n\tif x==p:\r\n\t\tk=1\r\n\telse:\r\n\t\tp=[i for i in a if i not in [x,p]][0]\r\nprint('YES' if k==0 else 'NO')", "\r\nn=int(input())\r\nplayer1=1\r\nplayer2=2\r\nplayer3=3\r\nwinner=0\r\nlosser=0\r\ne=0\r\nfor i in range(n):\r\n game=int(input())\r\n winner=game\r\n if game==player1 or game==player2:\r\n e=e+1\r\n if game==player1:\r\n player1=winner\r\n losser=player2\r\n player2=player3\r\n player3=losser\r\n if game==player2:\r\n player2=winner\r\n losser=player1\r\n player1=player3\r\n player3=losser\r\nif e==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "c = 3\r\nn = int(input())\r\nfor i in range(n):\r\n\ta = int(input())\r\n\tif a == c:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tc = 6-c-a\r\nprint('YES')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(int(input()))\r\ndef f(l):\r\n\ta=[1,2]\r\n\tfor i in l:\r\n\t\tif i not in a:\r\n\t\t\treturn \"NO\"\r\n\t\tb=[1,2,3]\r\n\t\tfor x in a:\r\n\t\t\tb.remove(x)\r\n\t\ta=[i,b[0]]\r\n\treturn \"YES\"\r\nprint(f(l))", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n\n observer = 3\n for i in range(n):\n a = int(input())\n if a == observer:\n print(\"NO\")\n return\n observer = 6 - observer - a\n print(\"YES\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t\t\t\t \t\t\t \t\t\t \t\t\t\t \t \t\t \t", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n = int(input())\r\n\r\n AB = 'AB'\r\n BC = 'BC'\r\n AC = 'AC'\r\n\r\n state = AB\r\n for i in range(n):\r\n w = int(input())\r\n if state == AB and w == 3:\r\n return \"NO\"\r\n if state == AC and w == 2:\r\n return \"NO\"\r\n if state == BC and w == 1:\r\n return \"NO\"\r\n\r\n if state == AB and w == 1:\r\n state = AC\r\n continue\r\n if state == AB and w == 2:\r\n state = BC\r\n continue\r\n if state == BC and w == 2:\r\n state = AB\r\n continue\r\n if state == BC and w == 3:\r\n state = AC\r\n continue\r\n if state == AC and w == 1:\r\n state = AB\r\n continue\r\n if state == AC and w == 3:\r\n state = BC\r\n continue\r\n return \"YES\"\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nans = \"YES\"\r\nA = []\r\nfor i in range(n):\r\n a = int(input())\r\n A.append(a)\r\n\r\ncur = 3;f=0\r\nfor i in range(n):\r\n if(A[i]==cur):\r\n f+=1\r\n break\r\n l = 6-A[i]-cur\r\n cur = l\r\nif(f==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\nplayed = [1, 2]\r\nres = 'YES'\r\n\r\nfor i in range(n):\r\n winner = int(input())\r\n if (winner in played):\r\n played = [winner, 6 - (sum(played))]\r\n else:\r\n res = 'NO'\r\n break\r\nprint(res)\r\n", "n = int(input())\r\nplay1 = 1\r\nplay2 = 2\r\nwatch = 3\r\nfor i in range(n):\r\n x = int(input())\r\n if x == play1:\r\n play2, watch = watch, play2\r\n elif x == play2:\r\n play1, watch = watch, play1\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n=int(input())\r\n\r\nl1=[1,2,3]\r\nl=[1,2]\r\n\r\nfor i in range(n):\r\n\ta=int(input())\r\n\tif(a not in l):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tif(a==l[0]):\r\n\t\tb=l[1]\r\n\telse:\r\n\t\tb=l[0]\r\n\tl=l1.copy()\r\n\tl.remove(b)\r\nprint(\"YES\")", "cases = int(input())\r\ncannot = 3\r\nwhile cases:\r\n cases -= 1\r\n num = int(input())\r\n if num == cannot:\r\n print(\"NO\")\r\n exit()\r\n cannot = 6 - cannot-num\r\n\r\nprint(\"YES\")", "def main_function():\r\n winners = []\r\n for i in range(int(input())):\r\n winners.append(int(input()))\r\n currently_player_1_playing = True\r\n currently_player_2_playing = True\r\n currently_player_3_playing = False\r\n for i in winners:\r\n if i == 1 and currently_player_1_playing:\r\n currently_player_3_playing = not currently_player_3_playing\r\n currently_player_2_playing = not currently_player_2_playing\r\n elif i == 1 and not currently_player_1_playing:\r\n return \"NO\"\r\n if i == 2 and currently_player_2_playing:\r\n currently_player_3_playing = not currently_player_3_playing\r\n currently_player_1_playing = not currently_player_1_playing\r\n elif i == 2 and not currently_player_2_playing:\r\n return \"NO\"\r\n if i == 3 and currently_player_3_playing:\r\n currently_player_2_playing = not currently_player_2_playing\r\n currently_player_1_playing = not currently_player_1_playing\r\n elif i == 3 and not currently_player_3_playing:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n ", "n=int(input())\r\na=[1, 2]\r\nf=\"YES\"\r\nfor i in range(n):\r\n x=int(input())\r\n if x in a:\r\n a=[x, 6-sum(a)]\r\n else:\r\n f=\"NO\"\r\n\r\nprint(f)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = 3\r\n\r\nfor _ in range(n):\r\n s = int(input())\r\n if s == x:\r\n print(\"NO\")\r\n break\r\n x = 6 - s - x\r\nelse:\r\n print(\"YES\")", "i=input;l=3\r\nfor _ in[0]*int(i()):\r\n x=int(i())\r\n if x==l:print('NO');exit()\r\n l^=x\r\nprint('YES')", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n l=int(input())\r\n li.append(l)\r\ns=3\r\na=1\r\nfor w in li:\r\n if(w!=s):\r\n s=6-s-w\r\n elif w==s:\r\n a=0\r\n break\r\nif a==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\nplayers = [1, 2]\r\nans = 'YES'\r\nfor case in range(n):\r\n a = int(input())\r\n if a not in players:\r\n ans = 'NO'\r\n break\r\n else:\r\n players = [6 - sum(players), a]\r\nprint(ans)\r\n", "dcF = {1:1, 2:2, 3:4}\r\ndcX = {k:7-v for k,v in dcF.items()}\r\ngame = 1 + 2\r\nfor _ in range(int(input())): \r\n won = int(input())\r\n if game & dcF[won] == 0:\r\n print(\"NO\")\r\n break\r\n game ^= dcX[won]\r\nelse:\r\n print(\"YES\")", "def solve(n: int, l: list) -> int:\r\n viewer = 3\r\n result = True\r\n for i in l:\r\n winner = i\r\n if winner == viewer:\r\n result = False\r\n if (winner == 1 and viewer == 3) or (winner == 3 and viewer == 1):\r\n viewer = 2\r\n elif (winner == 2 and viewer == 1) or (winner == 1 and viewer == 2):\r\n viewer = 3\r\n elif (winner == 3 and viewer == 2) or (winner == 2 and viewer == 3):\r\n viewer = 1\r\n \r\n if result: \r\n return(\"YES\")\r\n else: \r\n return(\"NO\")\r\n\r\n\r\nn = int(input())\r\nlst = []\r\nfor i in range(n):\r\n ele = int(input())\r\n lst.append(ele) \r\nprint(solve(n, lst))", "n = int(input())\r\nx = []\r\nflag = 0\r\nfor i in range(n):\r\n y = int(input())\r\n x.append(y)\r\nspec = 3\r\np1 = 1\r\np2 = 2\r\nfor i in range(n):\r\n if(x[i] == spec):\r\n flag = 1\r\n break\r\n if(p1 == x[i]):\r\n p1 = x[i]\r\n temp = p2\r\n p2 = spec\r\n spec = temp\r\n else:\r\n p2 = x[i]\r\n temp = p1\r\n p1 = spec\r\n spec = temp\r\n\r\nif(flag == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n", "n = input()\r\na =[]\r\nok = 0\r\nu = 1\r\nv = 2\r\nfor i in range(0,int(n)):\r\n x = int(input())\r\n if x ==u or x ==v:\r\n v = 6 -u-v\r\n u = x\r\n else:\r\n ok =1\r\n\r\nif ok ==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nimplement\r\nTwo pass -> 1) min(a[i] and a[i-2]) 2) max(a[i] and a[i-1])\r\n\r\n'''\r\ndef solve():\r\n n = II()\r\n\r\n valid = True\r\n cur = [1, 2]\r\n for _ in range(n):\r\n w = II()\r\n if w != cur[0] and w != cur[1]:\r\n valid = False\r\n break\r\n \r\n if w == cur[0]:\r\n cur[1] = 6 - sum(cur)\r\n if w == cur[1]:\r\n cur[0] = 6 - sum(cur)\r\n\r\n print('YES' if valid else 'NO')\r\n\r\nsolve()", "def possible():\r\n n = int(input())\r\n play = {1, 2}\r\n spectator = 3\r\n for _ in range(n):\r\n winner = int(input())\r\n if winner not in play: return False\r\n play.discard(winner)\r\n looser = list(play)[0]\r\n play = {winner, spectator}\r\n spectator = looser\r\n return True\r\n\r\nif possible():\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\na=1\r\nb=2\r\nc=3\r\nfor i in range(n):\r\n x=int(input())\r\n if x==a:\r\n b,c=c,b\r\n elif x==b:\r\n a,c=c,a\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import os,sys,io,math\r\nfrom array import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom collections import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nx=3;ok=\"YES\"\r\nfor _ in range(IN()):\r\n n=IN()\r\n if n==x:ok=\"NO\"\r\n for i in range(1,4):\r\n if i!=n and i!=x:\r\n x=i;break\r\nprint(ok)", "b=0; i=1; r=[1,2]\r\nfor n in range(int(input())):\r\n l = int(input())\r\n if r==[1,2] or r==[2,1]: x=3\r\n elif r==[2,3] or r==[3,2]: x=1\r\n elif r==[1,3] or r==[3,1]: x=2\r\n if l not in r: print('NO'); break\r\n for i in range(len(r)):\r\n if l!=r[i]: r.pop(i); r.append(x)\r\nif l in r: print('YES')", "n = int(input())\r\nplaying1 = 1\r\nplaying2 = 2\r\nwhitch = 3\r\nerror = 0\r\nfor i in range(n):\r\n win = int(input())\r\n if playing1 != win and whitch != win:\r\n playing1, whitch = whitch, playing1\r\n elif playing2 != win and whitch != win:\r\n playing2, whitch = whitch, playing2\r\n else:\r\n error = 1\r\nif error == 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na,b,c = 1,2,3\r\nfor _ in range(n):\r\n x = int(input())\r\n if x==c:\r\n print(\"NO\")\r\n exit()\r\n t1 = x\r\n t2 = a+b-x\r\n t3 = c\r\n a= t1\r\n b= t3\r\n c = t2\r\n\r\nprint(\"YES\")", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n=int(input())\r\n winner=0\r\n sp=3\r\n loser=0\r\n ans=\"YES\"\r\n for i in range(n):\r\n take=int(input())\r\n if take==sp:\r\n ans=\"NO\"\r\n break\r\n else:\r\n winner=take\r\n if winner==1 and sp==2:\r\n sp=3\r\n elif winner==1 and sp==3:\r\n sp=2\r\n elif winner==2 and sp==3:\r\n sp=1\r\n elif winner==2 and sp==1:\r\n sp=3\r\n elif winner==3 and sp==1:\r\n sp=2\r\n else:\r\n sp=1\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "n = int(input())\r\nA= [int(input()) for i in range(n)]\r\nL = [1, 2, 3]\r\nfor a in A:\r\n if a not in {L[0], L[1]}:\r\n print('NO')\r\n exit()\r\n if a == L[0]:\r\n L[1], L[2] = L[2], L[1]\r\n else:\r\n L[0], L[2] = L[2], L[0]\r\nprint('YES')\r\n", "n = int(input())\r\na = [int(input()) for _ in range(n)]\r\np = 3\r\nfor i in range(len(a)):\r\n if a[i] == p:\r\n print(\"NO\")\r\n exit(0)\r\n for j in range(1, 4):\r\n if j != a[i] and j != p:\r\n p = j\r\n break\r\nprint(\"YES\")# 1690038063.726347", "import sys\r\nn = int(input())\r\nmember = [1,2,3]\r\nteam = [1,2]\r\n\r\nfor i in range(n):\r\n check = int(input())\r\n if check not in team:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\n for j in member:\r\n if j not in team:\r\n second = j\r\n break\r\n team[0]=check\r\n team[1]=second\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\nv = []\nfor _ in range(0, n):\n v.append(int(input()))\n\ns = {1, 2}\na = {1, 2, 3}\n\nfor i in v:\n if i not in s:\n print(\"NO\")\n break\n o = list((a - s))[0]\n s.discard([x for x in s if x != i][0])\n s.add(o)\n\nelse:\n print(\"YES\")\n", "n = int(input())\nx = 1\n\nlog = {\"P1\": 1, \"P2\": 2, \"S\": 3, \"tmp\": 0}\n\nfor i in range(n):\n\ta = int(input())\n\tif(a == log[\"P1\"]):\n\t\tlog[\"tmp\"] = log[\"P2\"]\n\t\tlog[\"P2\"] = log[\"S\"]\n\t\tlog[\"S\"] = log[\"tmp\"]\n\t\t#print(log)\n\telif(a == log[\"P2\"]):\n\t\tlog[\"tmp\"] = log[\"P1\"]\n\t\tlog[\"P1\"] = log[\"S\"]\n\t\tlog[\"S\"] = log[\"tmp\"]\n\t\t#print(log)\n\telse:\n\t\tx = 0\n\t\nif(x == 0):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n \t\t \t \t\t\t \t \t\t\t\t\t\t \t\t\t", "n=int(input())\r\nx=1\r\ny=2\r\ns=3\r\nfor i in range(n):\r\n win=int(input())\r\n if win==x :\r\n s=s^y\r\n y=s^y\r\n s=s^y\r\n elif win==y:\r\n s=s^x\r\n x=s^x\r\n s=s^x\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n = int(input())\r\nplayer = [1,2]\r\nother = [3]\r\n\r\nswitch = 0\r\nfor i in range (n):\r\n s = int(input())\r\n if s in player:\r\n other.append(s)\r\n player.remove(s)\r\n tmp = player\r\n player = other\r\n other = tmp\r\n else:\r\n switch = 1\r\n\r\nif switch == 1:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")", "n = int(input())\r\nnow = [1, 2]\r\nfor i in range(n):\r\n a = int(input())\r\n if a == now[0]:\r\n now[1] = 6 - sum(now)\r\n elif a == now[1]:\r\n now[0] = 6 - sum(now)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "def aaa():\n n=int(input())\n cc=3\n mm={1:{2:3,3:2},2:{1:3,3:1},3:{1:2,2:1}}\n for _ in range(n):\n a=int(input())\n if a==cc: return \"NO\"\n cc=mm[a][cc]\n return \"YES\"\nans=aaa()\nprint(ans)\n \t\t\t\t\t\t \t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\ns = 3\r\nt = True\r\nfor _ in range(n):\r\n w = int(input())\r\n if w == s:\r\n t = False\r\n s = 6 - w - s\r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')", "player = {1, 2}\r\nspec = {3}\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n win = {x}\r\n\r\n if win == spec:\r\n print(\"NO\")\r\n break\r\n spec2 = spec\r\n spec = player - win\r\n player = player - spec | spec2\r\n\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\nwinner = int(input())\r\nlooser = 2 if winner == 1 else 1\r\nobserver = 3\r\nmessage = 'YES'\r\nif winner == 3:\r\n message = 'NO'\r\nelse:\r\n for i in range(1, n):\r\n currWinner = int(input())\r\n if currWinner == looser:\r\n message = 'NO'\r\n break\r\n temp = looser\r\n looser = observer if currWinner == winner else winner\r\n observer = temp\r\n winner = currWinner\r\nprint(message)", "n = int(input())\r\nlogs = []\r\nfor _ in range(n):\r\n l = int(input())\r\n logs.append(l)\r\n\r\nplaying = [1,2]\r\nspectate = [3]\r\n\r\nfor x in logs:\r\n if x not in playing:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n other = [y for y in playing if y != x][-1]\r\n if other in spectate:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n playing.remove(other)\r\n playing.append(spectate[0])\r\n spectate.remove(spectate[0])\r\n spectate.append(other)\r\nprint(\"YES\")", "n = int(input())\r\nplaying = [1, 2]\r\nspectator = [3]\r\nls = []\r\nans = 'YES'\r\nfor t in range(n):\r\n x = int(input())\r\n ls.append(x)\r\nfor e in range(len(ls)):\r\n if ls[e] not in playing:\r\n ans = 'NO'\r\n break\r\n for i in range(len(playing)):\r\n if playing[i] != ls[e]:\r\n playing[i], spectator[0] = spectator[0], playing[i]\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\nans = \"YES\"\r\np1 = 1\r\np2 = 2\r\nfor i in range(n):\r\n winer = int(input())\r\n if winer == p1:\r\n if p1 == 1:\r\n if p2 == 2:\r\n p2 = 3\r\n elif p2 == 3:\r\n p2 = 2\r\n else:\r\n ans = \"NO\"\r\n elif p1 == 2:\r\n if p2 == 1:\r\n p2 = 3\r\n elif p2 == 3:\r\n p2 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n if p2 == 1:\r\n p2 = 2\r\n elif p2 == 2:\r\n p2 = 1\r\n else:\r\n ans = \"NO\"\r\n elif winer == p2:\r\n if p2 == 1:\r\n if p1 == 2:\r\n p1 = 3\r\n elif p1 == 3:\r\n p1 = 2\r\n else:\r\n ans = \"NO\"\r\n elif p2 == 2:\r\n if p1 == 1:\r\n p1 = 3\r\n elif p1 == 3:\r\n p1 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n if p1 == 1:\r\n p1 = 2\r\n elif p1 == 2:\r\n p1 = 1\r\n else:\r\n ans = \"NO\"\r\n else:\r\n ans = \"NO\"\r\nprint(ans)\r\n", "b = 3\r\ntest = int(input())\r\nfor i in range(test):\r\n\ta = int(input())\r\n\tif a == b:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tb = 6 - b - a\r\nprint('YES')\r\n", "def generator(a,b):\r\n j=[a,b]\r\n k=[1,2,3]\r\n for i in k:\r\n if i not in j:\r\n return i\r\nn=int(input())\r\nl=[]\r\nf=0\r\nfor i in range(n):\r\n x=int(input())\r\n l.append(x)\r\nw=1\r\nb=2\r\nfor m in l:\r\n c=generator(w,b)\r\n if m==c:\r\n f=-1\r\n break\r\n w=m\r\n b=c\r\nif f==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n=int(input())\r\nalek=True\r\nboris=True\r\nvasi=False\r\nf=2\r\nx=True\r\nfor i in range(n):\r\n a=int(input())\r\n if a==1 and alek==True:\r\n if boris:\r\n boris=False\r\n else:\r\n boris=True\r\n if vasi:\r\n vasi=False\r\n else:\r\n vasi=True\r\n elif a==2 and boris==True:\r\n if alek:\r\n alek=False\r\n else:\r\n alek=True\r\n if vasi:\r\n vasi=False\r\n else:\r\n vasi=True\r\n elif a==3 and vasi==True:\r\n if alek:\r\n alek=False\r\n else:\r\n alek=True\r\n if boris:\r\n boris=False\r\n else:\r\n boris=True\r\n else:\r\n x=False\r\n break\r\nif x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "a=[None,True,True,False]\r\nfor i in range(int(input())):\r\n d=int(input())\r\n if not a[d]:\r\n print('NO')\r\n exit()\r\n for i in range(1,4):\r\n if a[i] and i!=d:\r\n a[i]=False\r\n elif not a[i]:\r\n a[i]=True\r\nprint('YES')", "n=int(input())\r\nx=\"1\"\r\ny=\"2\"\r\ns=\"3\"\r\nfor i in range(n):\r\n win=input()\r\n if win==x :\r\n temp=y\r\n y=s\r\n s=temp\r\n elif win==y:\r\n temp=x\r\n x=s\r\n s=temp\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n=int(input())\r\na,b=1,2\r\nfor i in range(n):\r\n c=int(input())\r\n if c==a:b^=a\r\n elif c==b:a^=b\r\n else:exit(print('NO'))\r\nprint('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = 3\r\nans = \"YES\"\r\nfor _ in range(n):\r\n a = int(input())\r\n if a == x:\r\n ans = \"NO\"\r\n for i in range(1, 4):\r\n if not i == a and not i == x:\r\n x = i\r\n break\r\nprint(ans)", "p={1,2}\r\nfor x in range(int(input())):\r\n\tn=int(input())\r\n\tif n not in p:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\tp={n,*({1,2,3}.symmetric_difference(p))}\r\nelse:\r\n\tprint(\"YES\")", "n = int(input())\r\na,b,c = 1,2,3\r\n\r\n\r\nfor i in range(n):\r\n k = int(input())\r\n if k == a:\r\n b,c = c,b\r\n elif k == b:\r\n a,c = c,a\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n viewer = 3\r\n result = True\r\n for i in range(n):\r\n winner = int(input())\r\n if winner == viewer:\r\n result = False\r\n if (winner == 1 and viewer == 3) or (winner == 3 and viewer == 1):\r\n viewer = 2\r\n elif (winner == 2 and viewer == 1) or (winner == 1 and viewer == 2):\r\n viewer = 3\r\n elif (winner == 3 and viewer == 2) or (winner == 2 and viewer == 3):\r\n viewer = 1\r\n \r\n if result: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\nmain()", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\ns=3\r\nf=1\r\nfor _ in range(n):\r\n w=int(input())\r\n if f:\r\n if w==s:\r\n f=0\r\n else:\r\n if w==1:\r\n if s==2:\r\n s=3\r\n elif s==3:\r\n s=2\r\n elif w==2:\r\n if s==1:\r\n s=3\r\n elif s==3:\r\n s=1\r\n elif w==3:\r\n if s==1:\r\n s=2\r\n elif s==2:\r\n s=1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\np1 = 1\np2 = 2\ns = 3\n\no = True\n\nfor i in range(n):\n c = int(input())\n if c==p1:\n h = s\n s = p2\n p2 = h\n elif c==p2:\n h = s\n s = p1\n p1 = h\n else:\n print(\"NO\")\n o = False\n break\n\nif o:\n print(\"YES\")", "n=int(input())\r\nplay=[1,2]\r\nm=True\r\nc=3\r\nfor i in range(n):\r\n l=int(input())\r\n if l in play:\r\n play=[l,c]\r\n if 1 not in play:\r\n c=1\r\n elif 2 not in play:\r\n c=2\r\n else:\r\n c=3\r\n else:\r\n print(\"NO\")\r\n m=False\r\n break\r\nif m:\r\n print(\"YES\")\r\n \r\n \r\n", "con=True\r\nplay1,play2,spec=1,2,3\r\nfor i in [int(input()) for _ in [0]*int(input())]:\r\n if i==spec:print('NO');con=False;break\r\n elif i==play1:play2,spec=spec,play2\r\n else:play1,spec=spec,play1\r\nif con:print('YES')", "n = int(input())\r\narr = [1,2]\r\nr = 3\r\nflag = True\r\nfor i in range(n):\r\n a = int(input())\r\n if a not in arr:\r\n print(\"NO\")\r\n flag = False\r\n break\r\n if arr[0] != a:\r\n z = arr[0]\r\n arr[0] = r\r\n r = z\r\n elif arr[1] != a:\r\n z = arr[1]\r\n arr[1] = r\r\n r = z\r\n \r\nif flag:\r\n print(\"YES\")\r\n \r\n ", "igra = [1, 2]\r\nfor i in range(int(input())):\r\n a = int(input())\r\n if igra.count(a) == 1:\r\n an = igra[abs(igra.index(a) - 1)]\r\n igra.remove(igra[abs(igra.index(a) - 1)])\r\n igra.append(6 - an - igra[0])\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "t = int(input())\r\nplaying = [1, 2]\r\nwatching = 3\r\nout = \"YES\"\r\nfor i in range(t):\r\n x = int(input())\r\n if x not in playing:\r\n out = \"NO\"\r\n break\r\n\r\n for e in playing:\r\n if e != x:\r\n y = e\r\n playing.remove(y)\r\n playing.append(watching)\r\n watching = y\r\nprint(out)", "\r\nn = int(input())\r\nnow, win , loss = 3, 1, 2\r\nf = True;\r\nfor _ in range(n):\r\n\tx = int(input())\r\n\tif _ == 0:\r\n\t\tif x == 3:\r\n\t\t\tf = False\r\n\t\telse:\r\n\t\t\twin = x\r\n\t\t\tloss = (1+2-x)\r\n\t\t\tnow = 3\r\n\telse :\r\n\t\tif x == loss:\r\n\t\t\tf = False\r\n\t\telse :\r\n\t\t\tt = (loss + 0)\r\n\t\t\tloss = (win + now - x)\r\n\t\t\twin = x\r\n\t\t\tnow = t\r\nif f == True:\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "n = int(input())\nwinners = []\n\nfor i in range(n):\n winners.append(int(input()))\n\nplayer1 = 1\nplayer2 = 2\nother = 3\n\nflag = True\n\nfor winner in winners:\n if winner != player1 and winner != player2:\n flag = False\n break\n if winner == player1:\n player2, other = other, player2\n else:\n player1, other = other, player1\n\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\n\nplayer_1, player_2, watch = 1, 2, 3\nanswer = \"YES\"\nfor i in range(n):\n winner = int(input())\n if(winner == player_1):\n player_2, watch = watch, player_2\n elif(winner == player_2):\n player_1, watch = watch, player_1\n else:\n answer = \"NO\"\n break\n\nprint(answer)\n \t\t \t\t \t \t\t\t \t \t \t\t", "n = int(input())\r\na, b, c, x = True, True, False, []\r\nd, s = {1: a, 2: b, 3: c}, [1, 2, 3]\r\nfor i in range(n):\r\n x.append(int(input()))\r\nfor i in range(n):\r\n if d[x[i]]:\r\n b = list(s)\r\n b.remove(x[i])\r\n for j in b:\r\n d[j] = not d[j]\r\n else:\r\n exit(print(\"NO\"))\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=[1,2]\r\nans=\"YES\"\r\nfor _ in range(n):\r\n w=int(input())\r\n if w not in l:\r\n ans=\"NO\"\r\n else:\r\n l=[w,6-sum(l)]\r\nprint(ans)", "def isPossible(order):\n currentPlayers = [1,2]\n\n for player in order:\n if player in currentPlayers:\n currentPlayers = [player, 6-sum(currentPlayers)]\n \n else:\n return 'NO'\n \n return 'YES' \n\norder = []\nlines = int(input())\nfor line in range(lines):\n i = int(input())\n order.append(i)\n\nprint(isPossible(order))", "l=[]\r\nfor i in range(int(input())):\r\n\ta=int(input())\r\n\tl.append(a)\r\nt=[1,2]\r\n\r\nfor i in range(len(l)):\r\n\tif l[i] not in t:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\telse:\r\n\t\tt[1-t.index(l[i])]=6-sum(t)\r\nelse:\r\n\tprint('YES')", "all = set({1,2,3})\r\nwin = [1, 2]\r\nn = int(input())\r\nflag = 0\r\nfor i in range(n):\r\n idx = int(input())\r\n if idx not in win:\r\n flag = 1\r\n break\r\n else:\r\n other = list(all - set(win))[0]\r\n if win[0]==idx:win[1]=other\r\n else:win[0]=other\r\nif flag==0:print('Yes')\r\nelse:print('No')", "import sys\r\nimport math\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef LI():\r\n\treturn list(map(int, sys.stdin.readline().split()))\r\n \r\ndef MI():\r\n\treturn map(int, sys.stdin.readline().split())\r\n \r\ndef SI():\r\n\treturn sys.stdin.readline().strip()\r\n \r\ndef FACT(n, mod):\r\n s = 1\r\n facts = [1]\r\n for i in range(1,n+1):\r\n s*=i\r\n s%=mod\r\n facts.append(s)\r\n return facts[n]\r\n \r\ndef C(n, k, mod):\r\n return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod\r\n\r\ntemp = 3\r\nboo = True\r\nfor _ in range(II()):\r\n a = II()\r\n if a == temp:\r\n boo = False\r\n if a == 1:\r\n if temp == 3:\r\n temp = 2\r\n else:\r\n temp = 3\r\n if a == 2:\r\n if temp == 3:\r\n temp = 1\r\n else:\r\n temp = 3\r\n if a == 3:\r\n if temp == 1:\r\n temp = 2\r\n else:\r\n temp = 1\r\nprint(\"YES\" if boo else \"NO\")\r\n", "c=3\nn=int(input())\nfor i in range(n):\n\ta=int(input())\n\tif a==c:\n\t\tprint('NO')\n\t\texit()\n\tc=6-c-a\nprint('YES')\n\n\t \t \t \t\t\t \t \t \t \t\t \t \t", "n = int(input())\nres = \"YES\"\nspec = 3\nfor _ in range(n):\n won = int(input())\n if won == spec:\n res = \"NO\"\n spec = next(i for i in [1, 2, 3] if i != won and i != spec)\nprint(res)\n" ]

{"inputs": ["3\n1\n1\n2", "2\n1\n2", "100\n2\n3\n1\n2\n3\n3\n3\n1\n1\n1\n1\n3\n3\n3\n3\n1\n2\n3\n3\n3\n3\n3\n3\n3\n1\n2\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n3\n3\n1\n2\n3\n3\n3\n1\n1\n1\n1\n3\n3\n3\n3\n1\n2\n3\n1\n2\n2\n2\n3\n3\n2\n1\n3\n3\n1\n2\n3\n1\n1\n1\n2\n2\n2\n3\n1\n1\n1\n1\n1\n1\n3\n2\n2\n2\n2\n2\n2\n3\n1\n2\n2\n2\n2\n2\n3\n3\n2\n1\n1", "99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1\n1\n3\n2\n2\n2\n1\n3\n3\n1\n1\n3\n2\n1\n3\n3\n1\n2\n3\n3\n3\n1\n2\n2\n2\n3\n3\n3\n3\n3\n3\n2\n2\n2\n2\n3\n3\n3\n1\n1\n3\n2\n1\n1\n2\n2\n2\n3\n3\n2\n1\n1\n2\n2\n1\n3\n2\n1\n1\n2\n3\n3\n3\n3\n2\n2\n2\n2\n2\n1\n3", "100\n2\n2\n1\n3\n1\n3\n3\n1\n1\n3\n1\n1\n3\n2\n1\n3\n1\n1\n3\n3\n2\n2\n3\n1\n1\n2\n3\n2\n2\n3\n1\n1\n2\n3\n2\n1\n2\n2\n3\n3\n1\n1\n3\n1\n2\n1\n3\n1\n1\n3\n2\n2\n2\n1\n1\n1\n3\n1\n3\n2\n1\n2\n2\n2\n3\n3\n2\n1\n1\n3\n3\n2\n1\n2\n1\n1\n3\n1\n2\n3\n2\n3\n3\n3\n2\n2\n1\n3\n1\n2\n3\n1\n2\n3\n3\n1\n2\n1\n3\n1", "10\n2\n3\n3\n3\n3\n2\n2\n2\n3\n2", "100\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\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\n3", "1\n2", "42\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", "4\n2\n3\n3\n3", "3\n1\n2\n3", "5\n1\n1\n1\n1\n3", "5\n2\n3\n3\n3\n3", "2\n3\n3", "4\n1\n2\n2\n1", "3\n2\n2\n3", "5\n2\n3\n3\n1\n1", "3\n3\n1\n3", "3\n3\n3\n1", "2\n2\n1", "3\n1\n1\n3", "6\n2\n2\n2\n3\n1\n3", "2\n3\n1", "2\n3\n2", "2\n1\n3", "3\n1\n3\n1", "5\n1\n1\n2\n2\n3", "3\n2\n1\n1", "2\n2\n2", "3\n2\n2\n1", "5\n2\n2\n2\n2\n2", "8\n1\n1\n1\n1\n1\n1\n1\n1", "3\n3\n2\n2", "3\n3\n2\n3", "7\n2\n2\n2\n2\n2\n2\n2", "3\n2\n2\n2"], "outputs": ["YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

76

d0d6dc4057d27406033bbafafb50a4ec

If at first you don't succeed...

Each student eagerly awaits the day he would pass the exams successfully. Thus, Vasya was ready to celebrate, but, alas, he didn't pass it. However, many of Vasya's fellow students from the same group were more successful and celebrated after the exam. Some of them celebrated in the BugDonalds restaurant, some of them — in the BeaverKing restaurant, the most successful ones were fast enough to celebrate in both of restaurants. Students which didn't pass the exam didn't celebrate in any of those restaurants and elected to stay home to prepare for their reexamination. However, this quickly bored Vasya and he started checking celebration photos on the Kilogramm. He found out that, in total, BugDonalds was visited by $A$ students, BeaverKing — by $B$ students and $C$ students visited both restaurants. Vasya also knows that there are $N$ students in his group. Based on this info, Vasya wants to determine either if his data contradicts itself or, if it doesn't, how many students in his group didn't pass the exam. Can you help him so he won't waste his valuable preparation time? The first line contains four integers — $A$, $B$, $C$ and $N$ ($0 \leq A, B, C, N \leq 100$). If a distribution of $N$ students exists in which $A$ students visited BugDonalds, $B$ — BeaverKing, $C$ — both of the restaurants and at least one student is left home (it is known that Vasya didn't pass the exam and stayed at home), output one integer — amount of students (including Vasya) who did not pass the exam. If such a distribution does not exist and Vasya made a mistake while determining the numbers $A$, $B$, $C$ or $N$ (as in samples 2 and 3), output $-1$. Sample Input 10 10 5 20 2 2 0 4 2 2 2 1 Sample Output 5-1-1

[ "a, b, c, n = map(int, input().split())\r\ntmp = n - (a + b - c)\r\nif tmp < 1 or a < c or b < c:\r\n print(-1)\r\nelse:\r\n print(tmp)", "A,B,C,N=map(int,input().split())\r\nAUB=A+B-C\r\nif AUB>=N:\r\n print(-1)\r\nelif AUB<0:\r\n print(-1)\r\nelif A<C:\r\n print(-1)\r\nelif B<C:\r\n print(-1)\r\nelse:\r\n print(N-AUB)\r\n", "a, b, c, n = map(int, input().split())\r\na -= c\r\nb -= c\r\nif a + b + c + 1 > n or a < 0 or b < 0:\r\n print(-1)\r\nelse:\r\n print(n - a - b - c)\r\n", "a,b,c,t=list(map(int,input().split()))\r\nif t<=a+b-c or c>a or c>b: print(-1)\r\nelse: print(t-a-b+c)", "ReadMultipleValues = lambda: map(int, input().split())\r\nReadMultipleValuesStr = lambda: map(str, input().split())\r\n\r\n\r\n\r\na,b,c,n=ReadMultipleValues()\r\nif n-a-b+c <=0 or a<c or b<c:\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,d=map(int,input().split())\r\nif c>a or c>b:\r\n print(-1)\r\n exit(0)\r\na-=c\r\nif(a+b>=d):\r\n print(-1)\r\n exit(0)\r\nprint(d-a-b)", "a,b,c,n = map(int,input().split())\r\nx = n-(a+b-c)\r\nif x<=0 or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(x)", "A,B,C,N=map(int,input().split())\r\nif(A+B-C>=N): print(\"-1\")\r\nelif(C>A or C>B):print(\"-1\")\r\nelse: print(N-(A+B-C))", "a , b , c , n = map ( int , input (). split ())\r\nq = (( a - c ) + ( b - c ) + c )\r\nw = n - q\r\nif(c>a or c>b):\r\n print(-1)\r\nelif ( w > 0 ):\r\n print ( w )\r\nelse :\r\n print ( \"-1\" )", "a=input()\r\nb=list(map(int,a.split()))\r\nc=b[3]-(b[0]+b[1]-b[2])\r\nif b[0]+b[1]-b[2]>=b[3] or b[2]>b[0] or b[2]>b[1]:\r\n print(-1)\r\nelse:\r\n print(c)", "#ROUNIAAUDI\r\nnum1,num2,num3,num4=map(int,input().split())\r\nnum4-=((num1+num2)-num3)\r\nif num4<=0 or num3>num2 or num1<num3:\r\n print(-1)\r\nelse:\r\n print(num4)", "a , b , c , n = list(map(int ,input().split()))\r\n\r\nn1 = a - c \r\nn2 = b - c \r\nn3 = c \r\nn4 = n - n1 - n2 - n3\r\nif(n1 >= 0 and n2 >= 0 and n3 >= 0 and n4 > 0):\r\n print(n4)\r\nelse:\r\n print(-1)", "A,B,C,N = map(int,input().split())\r\nif(N-(A+B-C)>=1 and C<=A and C<=B):\r\n print(N-(A+B-C))\r\nelse:\r\n print(-1)", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**10\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\na, b, c, n = inp()\r\ntemp = a + b - c\r\nif c > a or c > b or temp < 0:\r\n print(-1)\r\n sys.exit()\r\nif n - temp <= 0:\r\n print(-1)\r\nelse:\r\n print(n - temp)\r\n", "a, b, c, n = map(int, input().split())\r\nif (c > a) or (c > b):\r\n print(-1)\r\nelse:\r\n result = n - (a - c) - (b - c) - c\r\n if result > 0:\r\n print(result)\r\n else:\r\n print(-1)", "def test_1():\n # A -\n import math\n from collections import Counter\n a, b, c, n = list(map(int, input().split(\" \")))\n\n if a < c or b<c:\n print(-1)\n return\n a_1 = n - (a-c)-(b-c) -c\n if a_1 <1:\n print(-1)\n return\n else:\n print(a_1)\n\n\ntest_1()\n \t\t \t \t \t \t \t\t \t", "a, b, c, d = map(int, input().split())\n\nif c > a or c > b:\n print(-1)\nelse:\n r = d - (a + b - c)\n if r <= 0:\n print(-1)\n else:\n print(r)\n\n \t \t \t \t \t\t\t \t\t\t \t \t", "\r\na,b,c,d=map(int,input().split())\r\nif a<c or b<c or a>d or b>d or c>d:\r\n print(-1)\r\n\r\nelse:\r\n\r\n ans = d-((a+b)-c)\r\n if ans <=0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n", "a, b, c, n = (int(i) for i in input().split())\ndiff = a + b - c\nres = n - diff if n - diff > 0 and c <= a and c <= b and a <= n and b <= n else -1\nprint(res)\n", "a,b,c,n = map(int,input().split(' '))\r\nres = n-a-b+c\r\nprint(res if res>0 and a>=c and b>=c else -1)\r\n", "a,b,c,n = map(int,input().split())\r\nprint(n-(a+b-c) if n-(a+b-c) > 0 and a>=c and b>=c else -1)", "\n\na, b, c, n = [int(x) for x in input().split(' ')]\n\nf = n - (a+b-c)\n\nif(f < 1 or c > a or c > b):\n print(-1)\nelse:\n print(f)\n", "a, b, c, n = map(int, input().strip().split())\npassed = a+b-c\nif 0 <= passed < n and max(a, b, c) <= n and c <= min(a, b):\n\tprint(n-passed)\nelse:\n\texit(print(-1))\n", "a,b,c,n=map(int,input().split())\r\nif a+b-c<n and a>=c and b>=c:\r\n print(n-(a+b-c))\r\nelse:\r\n print(-1)", "a, b, c, n = map(int, input().split())\r\nn -= a + b - c\r\nif a >= c and b >= c and n > 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(-1)", "a, b, c, n = map(int, input().split())\n\nif c > a or c > b or a + b - c + 1 > n:\n print(-1)\nelse:\n print(n - (a + b - c))\n\n \t\t \t \t \t \t\t\t \t\t\t\t\t \t \t \t\t \t", "a, b, c, n = map(int, input().split())\r\n\r\nif a >= c and b >= c:\r\n failed = n - (a-c + b-c + c)\r\n if failed < 1:\r\n print(-1)\r\n else:\r\n print(failed) \r\nelse:\r\n print(-1)", "\r\n #for i,item in enumerate(s): \r\n \r\n\r\n#N=A+B-C+P\r\n\r\na,b,c,n=map(int,input().split(' '))\r\n\r\np=n-(a+b-c)\r\nif(c>a or c>b):\r\n p=-1\r\nif(p>=1):\r\n print(p)\r\nelse: \r\n print(-1)", "\r\na,b,c,d = map(int, input().split())\r\nvalue_1 = a - c\r\nvalue_2 = b - c\r\nvalue_4 = d - value_1 - value_2 - c\r\nif(value_1 >= 0 and value_2 >= 0 and c >= 0 and value_4 > 0):\r\n print(value_4)\r\nelse : print(-1)", "X = list(map(int, input().split()))\r\nPass = X[0] + X[1] - X[2]\r\nprint(-1 if Pass >= X[3] or X[2] > X[0] or X[2] > X[1] else X[3] - Pass)\r\n\r\n# UB_CodeForces\r\n# Advice: “Whenever you find yourself on the side of the majority, it is time to pause and reflect.”\r\n# Location: Behind my desk\r\n# Caption: On the right way\r\n# CodeNumber: 548\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor,log2\r\nrandom = randint(1, 10 ** 9)\r\nclass wrapper(int):\r\n def __hash__(self):\r\n return super(wrapper, self).__hash__() ^ random\r\n\r\na,b,c,n=rd()\r\nif a<c or b<c:\r\n print(-1)\r\n exit()\r\nelif (a-c)+(b-c)+c>=n :\r\n print(-1)\r\nelif n-(a-c)+(b-c)+c<1:\r\n print(-1)\r\nelse:\r\n print(n-(a-c+b-c+c))\r\n", "a,b,c,n=map(int,input().split())\r\nif a+b-c>=n or c>a or c>b:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(n-(a+b-c))", "A,B,C,N = [int(x) for x in input().split()]\r\n\r\nif C > min(A,B):\r\n print(-1)\r\n \r\nelse:\r\n if A+B-C <= N-1:\r\n print(N-A-B+C)\r\n else:\r\n print(-1)", "a,b,c,n=map(int,input().split())\r\nif (c > a or c > b or a + b - c > n - 1):\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,n=[int(x) for x in input().split()]\r\nif a<c or b<c:\r\n print(-1)\r\nelse:\r\n if a+b-c>=n:\r\n print(-1)\r\n else:\r\n print(n-(a+b-c))", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\na, b, c, n = map(int, input().split())\nn1 = a - c\nn2 = b - c\nn3 = c\nn4 = n - n1 - n2 - n3\nif n1 >= 0 and n2 >= 0 and n3 >= 0 and n4 > 0:\n print(n4)\nelse:\n print(-1)\n", "d, k, b, h = map(int, input().split())\n\nf = h - ((d-b) + (k-b) + b)\nif f < 1 or d = n or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(n-((a-c)+b))", "# -*- coding: utf-8 -*-\n\n\ndef rli():\n return list(map(int, input().split()))\n\n\ndef main():\n a, b, c, n = rli()\n if c > a or c > b:\n print(-1)\n return\n if a + b - c > n - 1:\n print(-1)\n return\n print(n - a - b + c)\n\n\nif __name__ == '__main__':\n main()\n", "A, B, C, N = map(int, input().split())\r\nans = N - (A + B - C)\r\nif A < C or B < C or A > N or B > N or C > N or ans < 1:\r\n print(-1)\r\nelse:\r\n print(ans)", "a,b,c,n=map(int,input().split())\r\nif a<c or b<c:\r\n\tprint(-1)\r\n\texit()\r\na-=c\r\nb-=c\r\nk=n-a-b-c\r\n\r\nif a+b+c>=n:print(-1)\r\nelse:print(k)", "a,b,c,d=map(int,input().split());print(*[-1] if a<c or b<c or a+b-c>=d else [d-(a+b-c)] )", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\na,b,c,n=list(map(int,input().split()))\r\nx=a+b-c\r\nprint(n-x if c<=a and c<=b and x<n else -1)\r\n", "a,b,c,n=map(int,input().split())\r\nif(c>b or c>a or c>n):\r\n print(-1)\r\nelse:\r\n k=c+(a-c)+(b-c)\r\n k=n-k\r\n if(k>0):\r\n print(k)\r\n else:\r\n print(-1)\r\n\r\n", "a,b,c,n = map(int, input().split())\r\n\r\ntemp = n-a-b+c\r\nif(temp<=0 or temp>n or min(a,b)<c): print(-1)\r\nelse: print(temp)", "a,b,c,n = [int(i) for i in input().split()]\r\n\r\nif(n < a or n a or c > b):\r\n print(-1)\r\nelif n - (a + b - c) >= 1:\r\n print(n - (a + b - c))\r\nelse:\r\n print(-1)\r\n", "a,b,c,n= [int(c) for c in input().split()]\r\nu=a+b-c\r\nif a<c or b<c:\r\n\tprint(-1)\r\nelse:\r\n\tif n-u>=1:\r\n\t\tprint(n-u)\r\n\telse:\r\n\t\tprint(-1)\r\n", "# coding=utf-8\na,b,c,n=map(int,input().split())\r\n# x4=a-c\r\n# x3=b-c\r\n# x2=c\r\nif a-c>=0 and b-c>=0 and a-c+b+1<=n:\r\n print(n-a+c-b)\r\nelse:\r\n print(-1)\r\n\r\n\n\t\t\t\t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t", "a,b,c,n=map(int,input().split())\r\nk=n-(a+b-c)\r\nif k<1 or a<c or b<c :\r\n\tprint(-1)\r\nelse:\r\n\tprint(k)", "a,b,c,n=list(map(int,input().split()))\r\np=(a+b-c)\r\nf=n-p\r\nif p>=n or c>a or c>b:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(f)", "A,B,C,N = map(int,input().strip().split())\n\nflag = True\nif C>A or C>B:\n flag = False\nD = N - (A - C) - B\nif D >= 1 and flag:\n print(D)\nelse:\n print(-1)\n \t\t\t\t\t\t \t \t \t\t \t \t \t \t", "a,b,c,n=map(int,input().split())\r\nif n-a-b+c<1 or c>(min(a,b)):\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "a,b,c,n = map(int,input().split())\r\na-=c\r\nb-=c\r\nif a>=0 and b>=0:\r\n if (a+b+c)<n:\r\n n-=(a+b+c)\r\n print(n)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "A,B,C,N = map(int,input().split())\r\nif A-C>=0 and B-C>=0 and A+B-C<N:\r\n print(N-A-B+C)\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c, n = map(int, input().split())\r\n\r\nx = n-(a+b-c)\r\nprint(x if (x > 0 and a < n and b < n and c <= a and c <= b) else -1)", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n a, b, c, n = P()\r\n\r\n if a < c or b < c:\r\n r = -1\r\n else:\r\n r = n - (a + b - c)\r\n print(-1 if r <= 0 else r)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\na, b, c, n = map(int, input().split())\r\n\r\ntotal_pass = a+b-c\r\n\r\nif total_pass >= n or c > a or c > b:\r\n print(-1)\r\nelse:\r\n print(n-total_pass)\r\n\r\n", "def solve(A: int, B: int, C:int, D: int) -> int:\r\n passed = A+B-C\r\n failed = N-passed\r\n if A < C or B < C or passed < 0 or failed < 1:\r\n return(-1)\r\n return(failed)\r\n \r\nA, B, C, N = [int(x) for x in input().split()]\r\nprint(solve(A, B, C, N))\r\n\r\n\r\n\r\n \r\n\r\n \r\n ", "a,b,c,n = map(int,input().split())\r\nif c > a or c > b or (a+b) - c >=n:\r\n print(-1)\r\nelse:\r\n print(n -((a+b)-c))", "a, b, c, n = map(int, input().split())\r\nt = a + b - c\r\nif a >= n or b >= n or c > a or c > b or t >= n:\r\n print(-1)\r\nelse:\r\n print(n - t)\r\n", "a,b,c,n = map(int,input().split())\nt = a + b - c\nl = n - t\nif l > 0 and c <= min( a,b ):\n print( l )\nelse:\n print( -1 )\n", "a, b, c, n = list(map(int, input().split()))\r\nnewa = a-c\r\nnewb = b-c\r\nif newa + newb + c >= n or (c > a or c > b):\r\n print(-1)\r\nelse:\r\n print(n - (newa + newb + c))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c, n = map(int, input().split())\r\nif min(a, b) < c:\r\n ans = -1\r\nelse:\r\n x = n - (a + b - c)\r\n ans = x if x > 0 else -1\r\nprint(ans)", "a, b, c, d = map(int, input().split())\r\nprint(*[-1] if a<c or b<c or a+b-c>=d else [d-(a+b-c)] )", "a,b,c,n=map(int,input().split())\r\nif n==0:print(-1)\r\nelse:\r\n if((a-c)<0) or ((b-c)<0):print(-1)\r\n else:\r\n x=(n+c)-(a+b)\r\n print([-1,x][x>=1])", "a,b,c,d = input().split()\r\na= int(a)\r\nb= int(b)\r\nc = int(c)\r\nd= int(d)\r\n\r\ntemp = int(a-c)\r\ntemp1 = int(b-c)\r\nss = int(temp+temp1+c)\r\n\r\nif ss >= d:\r\n print(\"-1\")\r\nelif a<c:\r\n print(\"-1\")\r\nelif b<c:\r\n print(\"-1\")\r\nelse:\r\n print(d-ss)", "a,b,c,n=map(int,input().split())\r\nif(a>=c and b>=c):\r\n if(n-(a+b-c)>0):\r\n print(n-(a+b-c))\r\n else:\r\n print(\"-1\") \r\nelse:\r\n print(\"-1\")", "\r\na, b, c, n = map(int, input().split())\r\na -= c\r\nb -= c\r\n\r\nif a < 0 or b < 0:\r\n print(-1)\r\nelse:\r\n ans = n - (a+b+c)\r\n if ans < 1:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n \r\n", "a,b,c,n=map(int,input().split())\r\na-=c\r\nb-=c\r\nif a>=0 and b>=0 and a+b+c<n:\r\n print(n-a-b-c)\r\nelse :\r\n print(-1) ", "a,b,c,n=map(int,input().split())\r\nok = True\r\n\r\nif c>a or c>b: ok=False\r\nif a+b-c>n: ok=False\r\nif n-(a+b-c)==0: ok=False\r\n\r\nprint(n-(a+b-c) if ok else '-1')", "a,b,c,d=map(int,input().split())\r\nif abs(a-c)+abs(b-c)+c>d or (c>a or c>b):\r\n print(-1)\r\nelif abs(a-c)+abs(b-c)+c<d:\r\n print(abs((abs(a-c)+abs(b-c)+c)-d))\r\nelse:\r\n print(-1)", "\r\na,b,c,n=map(int,input().split())\r\n\r\njust_a=abs(c-a)\r\njust_b=abs(c-b)\r\n\r\nfail=n-just_a-just_b-c\r\n\r\n#print(just_a,just_b,fail)\r\nif fail>0 and c<=a and c<=b:\r\n print(fail)\r\nelse:\r\n print(-1)", "A, B, C, N = [int(x) for x in input().split()]\r\n\r\nif N < C or N < A or N A or C > B:\r\n print(-1)\r\nelse:\r\n answer = N - A - B + C\r\n\r\n print(answer if answer >= 1 else -1)\r\n", "A, B, C, N = map(int, input().strip().split())\r\nD = N - (A + B - C)\r\nif D <= 0 or C > A or C > B:\r\n print('-1')\r\n exit(0)\r\nprint(D)\r\n", "def main_function():\r\n A, B, C, N = [int(i) for i in input().split(\" \")]\r\n if A - C + B < N and C <= A and C <= B:\r\n print(N - (A + B - C))\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\nmain_function()", "a, b, c, n = map(int, input().split())\r\nif a-c < 0 or b-c < 0 or n-(a+b-c) < 1: \r\n print(-1)\r\nelse: \r\n print(n-(a+b-c))", "a,b,c,n=map(int,input().split())\r\nif(n-(a+b-c)>=1 and a>=c and b>=c):\r\n print(n-(b+a-c))\r\nelse:\r\n print(-1)", "a, b , c, n= map(int, input().split())\ntmp = a + b - c\ntmp = n - tmp\nif c > a or c > b:\n print(-1)\nelif tmp < 1:\n print(-1)\nelse:\n print(tmp)\n\n", "def check(n, index, lista):\r\n for i in range(n):\r\n if lista[i] > lista[index]:\r\n return True\r\n return False\r\n \r\ndef check2(n, index, lista):\r\n for i in range(n):\r\n if lista[i] < lista[index]:\r\n return True\r\n return False\r\n\r\nx = [int(x) for x in input().split()]\r\ncontradics = False\r\n\r\nif check(3, -1, x) or check2(2, 2, x):\r\n contradics = True\r\n\r\nif x[2]:\r\n for i in range(2):\r\n x[i] -= x[2]\r\n \r\n\r\nsuma = sum(x[:-1])\r\nans = x[-1] - suma \r\n\r\nif contradics or ans <= 0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "A , B , C , N = map(int,input().split())\r\n\r\nif C > A or C > B :\r\n print(-1)\r\nelse :\r\n A -= C\r\n B -= C\r\n Total = A + B + C\r\n if Total >= N :\r\n print(-1)\r\n else:\r\n print(N - Total)", "a, b, c, n = map(int, input().split())\r\nif ((a-c)+(b-c)+c) < n and ((not(c>a)) and (not(c>b))):\r\n print (n-((a-c)+(b-c)+c))\r\nelse:\r\n print(-1)", "a,b, c, n = [int(x) for x in input().split()]\npa = a - c\npb = b - c\n\nif pa < 0 or pb < 0 or (pa + pb + c > n-1):\n print(-1)\nelse:\n print(n - (pa + pb + c))", "a,b,c,n=map(int,input().split())\r\nn-=a+b-c\r\nprint((-1,n)[n>0and a>=c<=b])", "s=input().split()\r\na,b,c,n=int(s[0]),int(s[1]),int(s[2]),int(s[3])\r\npas=a+b-c\r\nif pas>=n or c>a or c>b:\r\n print(-1)\r\nelse:\r\n print(n-pas)", "a,b,c,n=map(int,input().split())\r\nif min(c,a,b)!=c or n-1<a+b-c:\r\n print(-1)\r\nelse:\r\n print(n-a-b+c)", "# from dust i have come dust i will be\n\na,b,c,n=map(int,input().split())\n\njust_a=abs(c-a)\njust_b=abs(c-b)\n\nfail=n-just_a-just_b-c\n\n#print(just_a,just_b,fail)\nif fail>0 and c<=a and c<=b:\n print(fail)\nelse:\n print(-1)\n", "a,b,c,d=list(map(int,input().split()))\r\nprint(-1 if d-a-b+c<=0 or a<c or b<c else d-a-b+c)", "a,b,c,n=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif n-(a+b-c)>=1 and a>=c and b>=c:\r\n print(n-(a+b-c))\r\nelse:\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\n\r\nif a-c >= 0 and b-c >= 0 and c >= 0 and (n-((a-c)+c+(b-c))) > 0:\r\n print(n-((a-c)+c+(b-c)))\r\nelse :\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\nx=a-c\r\ny=b-c\r\nsum=n-x-y-c\r\nif(x>=0 and y>=0 and c>=0 and sum>0):\r\n print(sum)\r\nelse:\r\n print(-1)\r\n", "a,b,c,n=map(int,input().split())\r\nif c>a or c>b:\r\n\tprint('-1')\r\n\texit()\r\nprint([-1,n+c-a-b][n-(a+b-c)>0])", "a,b,c,n = list(map(int,input().split()))\r\nif a <c or b<c or n<c or n<a or n n:\r\n print(-1)\r\n quit()\r\nprint(n-a-b-c)\r\n", "a,b,c,n=map(int,input().split())\r\n\r\nif(not(a>=c and b>=c)):\r\n\tprint(-1)\r\n\texit()\r\nans=n-(a+b-c)\r\n\r\nif(ans>0):\r\n\tprint(ans)\r\nelse: print(-1)" ]

{"inputs": ["10 10 5 20", "2 2 0 4", "2 2 2 1", "98 98 97 100", "1 5 2 10", "5 1 2 10", "6 7 5 8", "6 7 5 9", "6 7 5 7", "50 50 1 100", "8 3 2 12", "10 19 6 25", "1 0 0 99", "0 1 0 98", "1 1 0 97", "1 1 1 96", "0 0 0 0", "100 0 0 0", "0 100 0 0", "100 100 0 0", "0 0 100 0", "100 0 100 0", "0 100 100 0", "100 100 100 0", "0 0 0 100", "100 0 0 100", "0 100 0 100", "100 100 0 100", "0 0 100 100", "100 0 100 100", "0 100 100 100", "100 100 100 100", "10 45 7 52", "38 1 1 68", "8 45 2 67", "36 36 18 65", "10 30 8 59", "38 20 12 49", "8 19 4 38", "36 21 17 72", "14 12 12 89", "38 6 1 44", "13 4 6 82", "5 3 17 56", "38 5 29 90", "22 36 18 55", "13 0 19 75", "62 65 10 89", "2 29 31 72", "1 31 19 55", "1 25 28 88", "34 32 28 33", "43 36 1 100", "16 39 55 70", "2 3 0 91", "55 29 12 48", "7 33 20 88", "40 38 27 99", "18 28 14 84", "34 25 25 92", "4 24 5 76", "5 22 16 96", "1 1 0 4", "5 5 3 1", "0 0 0 1", "2 3 0 8", "5 5 2 5", "1 2 1 3", "3 0 0 4", "0 0 0 5", "5 5 0 3", "5 6 1 7", "10 10 10 11", "0 0 0 10", "5 15 5 30", "3 2 0 7"], "outputs": ["5", "-1", "-1", "1", "-1", "-1", "-1", "1", "-1", "1", "3", "2", "98", "97", "95", "95", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "100", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "4", "30", "16", "11", "27", "3", "15", "32", "75", "1", "-1", "-1", "-1", "15", "-1", "-1", "-1", "-1", "-1", "-1", "22", "-1", "86", "-1", "-1", "48", "52", "58", "-1", "-1", "2", "-1", "1", "3", "-1", "1", "1", "5", "-1", "-1", "1", "10", "15", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

93

d0e23c6e96b781e15b7393a41c955eb8

Chores

Petya and Vasya are brothers. Today is a special day for them as their parents left them home alone and commissioned them to do *n* chores. Each chore is characterized by a single parameter — its complexity. The complexity of the *i*-th chore equals *h**i*. As Petya is older, he wants to take the chores with complexity larger than some value *x* (*h**i*<=><=*x*) to leave to Vasya the chores with complexity less than or equal to *x* (*h**i*<=≤<=*x*). The brothers have already decided that Petya will do exactly *a* chores and Vasya will do exactly *b* chores (*a*<=+<=*b*<==<=*n*). In how many ways can they choose an integer *x* so that Petya got exactly *a* chores and Vasya got exactly *b* chores? The first input line contains three integers *n*,<=*a* and *b* (2<=≤<=*n*<=≤<=2000; *a*,<=*b*<=≥<=1; *a*<=+<=*b*<==<=*n*) — the total number of chores, the number of Petya's chores and the number of Vasya's chores. The next line contains a sequence of integers *h*1,<=*h*2,<=...,<=*h**n* (1<=≤<=*h**i*<=≤<=109), *h**i* is the complexity of the *i*-th chore. The numbers in the given sequence are not necessarily different. All numbers on the lines are separated by single spaces. Print the required number of ways to choose an integer value of *x*. If there are no such ways, print 0. Sample Input 5 2 3 6 2 3 100 1 7 3 4 1 1 9 1 1 1 1 Sample Output 3 0

[ "n,a,b= map(int,input().split())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nprint(x[b]-x[b-1])", "#Antonio Hernandez Monsalvo\r\nmiLista = []\r\nenter = input().split()\r\nn = int(enter[0])\r\na = int(enter[1])\r\nb = int(enter[2])\r\n2<=n<=2000\r\n\r\ndef bubbleSort(tareas):\r\n\tfor long in range (len(tareas) -1, 0, -1):\r\n\t\tfor i in range (0, long):\r\n\t\t\tif tareas[i] > tareas[i + 1]: #Cambio\r\n\t\t\t\ttemp = tareas[i]\r\n\t\t\t\ttareas[i] = tareas[i + 1]\r\n\t\t\t\ttareas[i + 1] = temp\r\n\r\ntareas = []\r\nnumbers = input().split()\r\nfor i in range (0,n):\r\n\ttareas.append(int(numbers[i]))\r\n\r\nif (a + b == n):\r\n bubbleSort(tareas)\r\n print(tareas[b] - tareas[b-1])\r\nelse: \r\n print(\"Error, el numero de tareas por persona no coincide con el no de tareas totales\")", "chores,petaya,vesaya = map(int,input().split())\r\norder = sorted(map(int,input().split()), reverse = True)\r\nprint (order[petaya-1] - order[petaya]) ", "s=input()\ns=s.split()\nn=int(s[0])\na=int(s[1])\nb=int(s[2])\nl=input()\nl=l.split()\nll=[int(i) for i in l]\nll.sort()\nprint(ll[n-a]-ll[b-1])\n\t\t\t \t \t \t\t \t\t\t \t\t\t\t\t \t", "n, a, b = map(int, input().split())\r\nlst = sorted(map(int, input().split()))\r\nprint(lst[b] - lst[b - 1])\r\n", "total_chores, p_chores, v_chores = map(int, input().split())\r\n\r\nchores = list(map(int, input().split()))\r\n\r\nchores.sort()\r\n\r\nv = chores[:v_chores]\r\np = chores[v_chores:]\r\n\r\nanswer = max(0, p[0] - v[-1])\r\n\t\r\nprint(answer)", "n,a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\na = l[b]-l[b-1]\r\nif(a>0):\r\n print(a)\r\nelse:\r\n print(0)", "n, a, b = [int(i) for i in input().split()]\r\nlst = sorted([int(i) for i in input().split()])\r\nprint(lst[b]-lst[b-1])\r\n", "def main():\n n,a,b = map(int,input().split(' '))\n arr = [int(val) for val in input().split()]\n \n if not arr:\n print(0)\n return\n \n if (a + b) != n:\n print(0)\n return\n\n arr.sort()\n bVal = arr[b-1]\n aVal = arr[b]\n\n print(aVal-bVal)\n\nmain()\n\t \t \t \t\t\t\t\t\t\t \t \t \t\t \t", "# n = int(input())\n# tn = [int(i) for i in input().split()]\n\n# def f(m):\n\n\n# m = 0\n# l = 0\n# r = n\n\n# while l < r:\n# m = (l + r)//2\n \n\nn, a, b = [int(i) for i in input().split()]\nhs = sorted([int(i) for i in input().split()], reverse=True)\n\nr = hs[a-1] - hs[a]\nprint(r)", "nab = list(map(int, input().split()))\nn = nab[0]\na = nab[1]\nb = nab[2]\nnums = list(map(int, input().split()))\nnums.sort()\ntemp1 = nums[:b]\ntemp2 = nums[b:]\n# print(temp1, \" \", temp2)\nprint(min(temp2) - max(temp1))\n", "n,a,b=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nprint(l[-a]-l[-a-1])", "n,a,b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\n\r\nh.sort()\r\nprint(h[n-a] - h[n-a-1])", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[-a]-l[b-1])", "n,a,b = input().split()\r\nchores = input().split()\r\nn,a,b = int(n),int(a),int(b)\r\n\r\nfor i in range(0,n):\r\n chores[i] = int(chores[i])\r\nchores.sort()\r\nvasya = chores[:b]\r\npetya = chores[b:]\r\n\r\nif petya[0]==vasya[b-1]:\r\n ans = 0\r\nelse:\r\n ans = petya[0]-vasya[b-1]\r\n\r\nprint(ans)\r\n", "n, older, younger = (list(map(int,input().split())))\r\nchores = (list(map(int,input().split())))\r\nchores.sort(reverse = True)\r\nc_old = chores[older-1]\r\n\r\nchores.sort()\r\nc_young = chores[younger-1]\r\n\r\nprint((c_old)-(c_young))", "n, a, b = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\nchores.sort()\r\nfirst = chores[:b]\r\nsecond = chores[b:n]\r\n\r\nx = 0\r\n\r\nx = second[0] - first[len(first) - 1]\r\n\r\nprint(x)\r\n", "def find_number_of_ways(n, a, b, arr):\r\n arr = sorted(arr)\r\n return arr[b] - arr[b - 1]\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nH = list(map(int, input().split()))\r\ntotalWays = find_number_of_ways(first_line_input[0], first_line_input[1], first_line_input[2], H)\r\nprint(totalWays)\r\n", "n,b,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(); print(a[c] - a[c-1])\r\n", "n, a, b=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nprint(l[-a]-l[-a-1])", "n,a,b=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nprint(list1[b]-list1[b-1])", "import random\r\n\r\ndef findKthSmallest(nums, k, rrr):\r\n ankor = nums[random.randint(0,len(nums)-1)]\r\n left, mid, right = [], [], []\r\n for x in nums:\r\n if x < ankor:\r\n left += [x]\r\n elif x > ankor:\r\n right += [x]\r\n else:\r\n mid += [x]\r\n if k <= len(left):\r\n return findKthSmallest(left, k, ankor)\r\n elif k <= len(left) + len(mid):\r\n rr = ankor if (k < len(left) + len(mid)) else (min(right) if right else rrr)\r\n return (ankor, rr)\r\n else:\r\n return findKthSmallest(right, k - len(left) - len(mid), rrr)\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nif a == n or b == n:\r\n print(n)\r\nelse:\r\n s, t = findKthSmallest(h, b, -100101)\r\n print(t - s)", "n,a,b=[int(i) for i in input().split(\" \")]\r\narr=[int(i) for i in input().split(\" \")]\r\narr.sort()\r\nprint(arr[n-a]-arr[b-1])\r\n\r\n", "n,m,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(a[p]-a[p-1])", "n,a,b=list(map(int, input().split()))\r\nh=list(map(int, input().split()))\r\nh=sorted(h)\r\ndiff=h[b]-h[b-1]\r\nprint(diff)\r\n", "n,a,b=[int(x) for x in input().split()]\r\nh=[int(x) for x in input().split()]\r\nh.sort(reverse=True)\r\nif h[a-1]==h[a]:\r\n print(0)\r\nelse:\r\n print(h[a-1]-h[a])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\n*h, = map(int, input().split())\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n", "#!/usr/bin/python\r\n\r\n# http://codeforces.com/problemset/problem/169/A\r\n\r\nn = [int(i) for i in input().split()]\r\nh = [int(i) for i in input().split()]\r\n\r\n# 1. sort chore complexity\r\n# 2. determine a[-x] value\r\n# 3. print a[-x] - [a-x-1]\r\na = n[1] # Petya chores\r\nb = n[2]\r\n\r\nh.sort()\r\n\r\nprint(h[-a] - h[-a-1])", "#169A\r\nn, a, b = map(int, input().split())\r\nt = sorted(list(map(int, input().split())))\r\nprint(t[b] - t[b - 1])", "n,a,b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort(reverse=True)\r\n\r\nans = h[a-1] - h[a]\r\nprint(ans)", "n, a, b = map(int, input().split())\nx = list(map(int, input().split()))\nx.sort()\nprint(x[-a] - x[b - 1])\n", "n, a, b = map(int, input().split())\n\nh = sorted(list(map(int, input().split())))\nx = h[b] - h[b-1]\n\nprint(x)", "X = list(map(int, input().split()))\r\nChores = list(map(int, input().split()))\r\nChores = sorted(Chores)\r\nprint(Chores[X[2]] - Chores[X[2]-1] if Chores[X[2]-1] not in Chores[X[2]:] else 0)\r\n", "nab = [int(i) for i in input().split()]\r\nn = nab[0]\r\na = nab[1]\r\nb = nab[2]\r\nh = sorted([int(i) for i in input().split()])\r\nprint(h[b] - h[b-1])\r\n", "n,a,b = map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nans=0\r\n\r\nl.sort()\r\nif l[-a]!=l[-a-1]:\r\n print(l[-a]-l[-a-1])\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\npet = arr[a - 1]\r\nvas = arr[a]\r\nprint(pet - vas)", "n, petya, vasya = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\n\r\nchores.sort()\r\ndifference = chores[vasya] - chores[vasya - 1]\r\nif difference == 0:\r\n print(0)\r\nelse:\r\n print(difference)", "n,a,b=map(int,input().split())\r\nl=list(sorted(map(int,input().split())))\r\nfor i in range(n):\r\n if i==b-1:\r\n print(abs(l[i]-l[i+1]))\r\n break\r\n\r\n \r\n \r\n \r\n", "n,a,b=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nk.sort(reverse=True)\r\nprint(k[a-1]-k[a])\r\n", "n,a,b= input().split()\r\n\r\nli= list(map(int, input().split()))\r\nli.sort(reverse=True)\r\n\r\nc= int(a)-1\r\nx=int(li[int(a)])\r\nxx=int(li[c]) \r\nif xx>x:\r\n print( xx-x )\r\nelse:\r\n print(0)", "def _input():\r\n h = []\r\n n, a, b = map(int, input().split())\r\n hs = input().split()\r\n for i in range(0, n):\r\n h.append(int(hs[i]))\r\n return n, a, b, h\r\n\r\ndef chores(n, a, b, h):\r\n h.sort(reverse=False)\r\n return h[b] - h[b - 1]\r\n\r\nif __name__ == \"__main__\":\r\n n, a, b, h = _input()\r\n ret = chores(n, a, b, h)\r\n print(ret)", "# https://codeforces.com/problemset/problem/169/A\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nh = sorted(map(int, input().split()))\r\n\r\nprint(h[b] - h[b-1])\r\n", "n,a,b=list(map(int,input().split()))\r\nh=sorted(list(map(int,input().split())))\r\nprint(h[b]-h[b-1])", "nab=input().split()\nl=input().split()\nnab=[int(i) for i in nab]\nl=[int(i) for i in l]\nl.sort()\nif(l[nab[2]-1]==l[nab[2]]):\n print(0)\nelse:\n print(l[nab[2]]-l[nab[2]-1])\n", "#Day 2 exercise\n#Chores\nfirst = input('').split()\nn = int(first[0])\na = int(first[1])\nb = int(first[2])\nlst = list(map(int,input('').split()))\nlst.sort()\ni = b-1\ncount = 0\n\ncount = lst[len(lst) - a] - lst[b-1]\nif count > 0:\n print(count)\nelse:\n print(0)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\ndata = sorted(map(int, input().split()))\r\n\r\nprint(data[b] - data[b - 1])", "#!/usr/bin/python\n\n# http://codeforces.com/problemset/problem/169/A\n# 2-pointer\n\n# As Petya is older, he wants to take the chores with complexity larger than some value x (hi > x)\n# to leave to Vasya the chores with complexity less than or equal to x (hi ≤ x).\n# The brothers have already decided that Petya will do exactly a chores and Vasya will do exactly b chores (a + b = n).\n# --> find 'x' based on given 'a' & 'b'\n\n\n# define function\ndef test(g, h):\n a = g[1] # the number of Petya's chores\n b = g[2] # the number of Vasya's chores\n h.sort()\n return h[b] - h[b - 1]\n\n\n# call function\ng = [int(i) for i in input().split()]\nh = [int(i) for i in input().split()]\nprint(test(g, h))\n", "def f(): return [int(i) for i in input().split()]\n[n, a, b], h = f(), f()\nh.sort()\nprint(h[b] - h[b-1])\n", "n,a,b = map(int,input().split(' '))\r\nh = list(map(int,input().split(' ')))\r\nh.sort()\r\nprint(h[b]-h[b-1])", "n,a,b = map(int,input().split())\nh = list(map(int,input().split()))\nh.sort(reverse=True)\nx = h[a-1]-h[a]\nprint(x)\n", "n, a, b = map(int, input().split())\r\na = list(map(int,input().split()))\r\n\r\na = sorted(a)\r\nanh = []\r\nem = []\r\ncount = 0\r\nfor i in range (n):\r\n if count >= b:\r\n anh.append(a[i])\r\n else:\r\n count += 1\r\n em.append(a[i])\r\nif em[len(em)-1] == anh[0]:\r\n print (0)\r\nelse:\r\n print(abs(em[len(em)-1] - anh[0]))", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n, na, nb = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A.sort()\r\n l = A[nb-1]\r\n r = A[nb]\r\n print(r - l)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, a, b = [int(x) for x in input().split()]\r\nlist = [int(x) for x in input().split()]\r\nlist.sort(reverse=True)\r\n#print(a, list[a-1], list[a])\r\nif n <= 2:\r\n print(abs(list[1] - list[0]))\r\nelse:\r\n print(abs(list[a-1] - list[a])) ", "I = lambda:map(int,input().split())\r\nn,a,b = I()\r\nm = sorted(I())\r\nprint(m[b]-m[b-1])", "n, a, b = map(int, input().split())\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nprint(h[b]-h[b-1])\r\n", "input1 = list(map(int, input().split()))\r\ninput2 = sorted(list(map(int, input().split())))\r\n\r\na = input1[1]\r\ne = input1[2]\r\n\r\nx = input2[len(input2) - a]\r\ny = input2[e - 1]\r\n\r\nprint(x - y)", "n, a, b = map(int, input().split())\r\nc = sorted(list(map(int, input().split())))\r\nprint(c[b] - c[b - 1])", "n, a, b = [int(s) for s in input().split(' ')]\r\nh = [int(x) for x in input().split(' ')]\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nprint(lst[b] - lst[b - 1])", "# http://codeforces.com/problemset/problem/169/A?fbclid=IwAR2qjWxrKeECIDX3IvTsI-DC7jeJEtGIqj2vePzXa8OLBjqKkkMjcWpwm7Y\n\nnumber_of_jobs, petya_jobs, vasya_jobs = map(int, input().split(' '))\njob_complexities = list(map(int, input().split(' ')))\njob_complexities.sort(reverse=True)\n\nprint(job_complexities[petya_jobs - 1] - job_complexities[petya_jobs])", "n,a,b = map(int,input().split())\r\nc = []\r\nc = list(map(int,input().split()))\r\nc.sort()\r\nl = c[b-1]\r\nr = 0\r\nok = False\r\nfor i in range (b,n-a+1):\r\n if c[i] > l:\r\n ok = True \r\n r = c[i]\r\n break\r\nif ok == True: print(r-l) \r\nelse: print(0) ", "def solution(l1,l2):\r\n n,a,b=l1[0],l1[1],l1[2]\r\n #simple sort and calculate difference between sup of lower set and inf of upper set\r\n l2.sort()\r\n #a-th is a-1 position\r\n return l2[b]-l2[b-1] \r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "import heapq\r\n\r\nn, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nif a == 0 or b == 0:\r\n print(n)\r\nelse:\r\n s = heapq.nsmallest(b + 1, h)\r\n t = heapq.nlargest(2, s)\r\n print(abs(t[1] - t[0]))\r\n ", "n, a, b = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\nchores.sort()\r\nprint(min(chores[-a:])-max(chores[:b]))", "if __name__ == \"__main__\":\n import sys\n\n [n, a, b] = [int(i) for i in sys.stdin.readline().split()]\n h = [int(i) for i in sys.stdin.readline().split()]\n\n h.sort()\n print(h[n-a] - h[n-a-1])\n \t\t\t\t \t \t\t\t \t \t \t\t \t \t", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\n# 1 2 3 6 100\r\n# 0 1 2 3 4\r\n\r\n# b - 1\r\n\r\nprint(arr[b] - arr[b-1])", "n,a,b = map(int, input().split())\nh = list(map(int, input().split()))\n\nh = sorted(h, key=lambda x: -x)\n\nx = h[a - 1]\ny = h[a]\n\nprint(x - y)\n", "n,a,b=list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(h[0-a]-h[b-1])\r\n", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nls = arr[0:b]\r\nls2 = arr[b::]\r\nprint(abs(max(ls)-min(ls2)))\r\n", "n,a,b = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nL.sort()\r\nprint(L[b] - L[b-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh = sorted(h)\r\n#print(h)\r\nprint(h[b] - h[b - 1]) ", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, a, b = map(int, input().split())\r\nh = sorted(list(map(int, input().split())))\r\nif h[b-1] == h[n-a]:\r\n print(0)\r\nelse:\r\n res = h[n - a] - h[b-1]\r\n print(res)", "# LUOGU_RID: 120108574\nn, a, b = map(int, input().split())\nhs = sorted(list(map(int, input().split())))\nprint(hs[b] - hs[b - 1])", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nprint(b[a[2]]-b[a[2]-1])", "a = [int(b) for b in input().split(\" \")]\r\nd = [int(c) for c in input().split(\" \")]\r\ne = sorted(d)\r\n\r\nfound = False\r\n\r\nfor i in range( len(e)-1 ):\r\n\tif a[2]-1 == i:\r\n\t\tprint( abs(e[i] - e[i+1] ) )\r\n\tfound = True\r\n\r\nif not found:\r\n\tprint(0)", "f=lambda:map(int,input().split())\r\nn,a,b=f()\r\nl=list(f())\r\nl.sort()\r\nprint(l[b]-l[b-1])\r\n\r\n", "pv = list(map(int,input().split()))\nls = list(map(int,input().split()))\nls.sort()\nprint(ls[pv[1]*(-1)]-ls[pv[2]-1])", "def insertion_sort(l):\r\n for i in range(len(l)):\r\n for j in range(i):\r\n k = i - j\r\n if l[k] < l[k - 1]:\r\n l[k], l[k - 1] = l[k - 1], l[k]\r\n return l\r\n\r\n#print(insertion_sort([2,5,4,3,2,1,2,3,4,5,6,7,65,4,3,2,3,5,6,87]))\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n l = insertion_sort([int(i) for i in input().split(\" \")])\r\n return str(l[b] - l[b-1])\r\n\r\n\r\n\r\nprint(main_function())\r\n", "n = list(map(int,input().split()))#n, a, b\r\n\r\na = list(map(int,input().split()))\r\n\r\ns = sorted(a, key=int)\r\n\r\nresult = s[n[2]] - s[n[2]-1]\r\n\r\nprint(result)\r\n", "def chores(n,a,b,h):\r\n h.sort()\r\n return (h[b]-h[b-1])\r\nn,a,b=[int(x) for x in input().split()]\r\nh = list(map(int, input().split()))\r\nprint (chores(n,a,b,h))", "a, b, c = map(int, input().split())\r\narr = sorted(map(int, input().split()))\r\n\r\nans = arr[-b] - arr[c-1]\r\n\r\nprint(ans)", "[n, a, b] = list(map(int, input().split()))\r\n\r\nh = list(map(int, input().split()))[:n]\r\n\r\nh.sort()\r\n\r\nvChores = 1\r\n\r\n# 1 2 3 6 100\r\nfor i in range(1, n):\r\n if(vChores == b):\r\n x = h[i] - h[i - 1]\r\n break\r\n else:\r\n vChores = vChores + 1\r\n\r\nprint(x)", "n, a, b = map(int, input().split())\r\nlst = sorted(list(map(int, input().split())))\r\nprint(lst[n-a]-lst[n-a-1])\r\n", "l = list(map(int,input().split()))\r\nl1 = list(map(int,input().split()))\r\nl1.sort()\r\nprint(l1[l[2]]-l1[l[2]-1])", "n, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\nh = sorted(h)\r\n\r\nans = max(h[b] - h[b-1], 0)\r\n\r\nprint(ans)\r\n\r\n", "n,a,b=map(int,input().split())\r\nli = list(map(int,input().split()))\r\nli.sort(reverse=True)\r\nprint(li[a-1]-li[a])", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n# a: Petya\r\n# b: Vasya\r\n\r\narr.sort(reverse=True)\r\nmax_com = arr[a - 1]\r\nmix_com = arr[a]\r\n\r\nprint(max_com - mix_com)\r\n", "I = lambda: map(int, input().split())\r\n\r\n*_, b = I()\r\nH = sorted(I())\r\n\r\nprint(H[b] - H[b-1])", "i=lambda:map(int,input().split())\r\n*_,b=i()\r\nc=sorted(i())\r\nprint(c[b]-c[b-1])", "n,a,b=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst=sorted(lst)[::-1]\r\n#print(lst)\r\ntotal=lst[a-1]-lst[a]\r\nprint(total)\r\n", "n,a,b=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nlst= sorted(lst)\r\nfor i in range(n):\r\n x=lst[b-1]\r\n y= lst[b]\r\nprint(y-x)", "\r\n\r\n\r\n(n, a, b) = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nprint(a[b] - a[b - 1])\r\n", "n,a,b=map(int,input().split())\r\nc=sorted(list(map(int,input().split())))\r\nprint(c[-a]-c[-a-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\np = h[-a]\r\nq = h[b-1]\r\nprint(p-q)", "n,a,b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nprint(h[n-a] - h[b-1])\r\n", "n,a,b=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(l[b]-l[b-1])", "a,b,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort()\r\nprint(d[c]-d[c-1])\r\n\r\n\r\n", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nh=sorted(b,reverse=True)\r\nprint(h[a[1]-1]-h[a[1]])\r\n", "x,y,z=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(a[z]-a[z-1])", "import sys\r\n\r\nn, a, b = tuple([int(x) for x in sys.stdin.readline().split()])\r\nvalues = sorted([int(x) for x in sys.stdin.readline().split()])\r\n\r\nresult = abs(values[b] - values[b-1])\r\nprint(result)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Apr 21 15:40:36 2018\r\n\r\n@author: Quang Huy\r\n\"\"\"\r\n\r\nvalue=input()\r\nn, a, b = map(int, value.split())\r\nvalue=input()\r\nlist1=list(map(int, value.split()))\r\nlist1.sort();\r\nif (int(list1[b-1])<int(list1[b])):\r\n print(int(list1[b]) - int(list1[b-1]))\r\nelse: print(0)\r\n", "(n, a, b) = list(map(int, list(input().split())))\r\nh = list(map(int, list(input().split())))\r\n\r\nh = sorted(h)\r\n\r\nprint(h[n-a] - h[b-1])\r\n", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, a, b = IL()\r\nH = sorted(IL())\r\nprint(H[b] - H[b-1])", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\n\r\nv = h[b-1]\r\np = h[-a]\r\nprint(p-v)\r\n\r\n", "n, a, b = [int(i) for i in input().split()]\nchores = sorted([int(i) for i in input().split()])\nprint(chores[-a] - chores[-a - 1])", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn,a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nh.sort()\r\nprint(h[b]-h[b-1])", "_, _, b = (int(i) for i in input().split())\nh = sorted(int(i) for i in input().split())\nres = h[b] - h[b - 1]\nprint(res)\n", "n, a, b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\nh.sort()\r\nlow = h[b - 1]\r\nhigh = h[b]\r\nprint(high - low)", "a = [ int(b) for b in input().split(\" \") ]\r\nc = [ int(e) for e in input().split(\" \") ]\r\nd = sorted(c)\r\nfound = False\r\nfor i in range(len(d)-1):\r\n\tif a[2]-1 == i:\r\n\t\tprint(abs(d[i] - d[i+1]))\r\n\t\tfound = True\r\nif not found:\r\n\tprint(0)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef invr():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn,a,b = invr()\r\n\r\nh = invr()\r\n\r\nh.sort()\r\n\r\nprint(h[b] - h[b-1])\r\n", "n,a,b=map(int,input().split())\r\n\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nprint(A[b]-A[b-1])", "n,a,b=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\n\r\nseq.sort(key=lambda x: -x)\r\n\r\n\r\nprint(seq[a-1]-seq[a])", "def sol(complexArray, petya, vasya):\r\n complexArray.sort()\r\n if complexArray[vasya] > complexArray[vasya-1]:\r\n return complexArray[vasya] - complexArray[vasya-1]\r\n else:\r\n return 0\r\n\r\nsize, petya, vasya = map(int, input().split())\r\ncomplexArray = list(map(int, input().split()))\r\n\r\nans = sol(complexArray, petya, vasya)\r\nprint(ans)", "def count_possible_x(n, a, b, complexities):\r\n # find the a largest and b smallest complexities\r\n top_a = sorted(complexities, reverse=True)[:a]\r\n bottom_b = sorted(complexities)[:b]\r\n\r\n # find the minimum and maximum possible x values\r\n min_x = max(bottom_b)\r\n max_x = min(top_a)\r\n\r\n # return the number of possible x values, or 0 if there are none\r\n return max(max_x - min_x, 0)\r\n\r\n# example usage\r\nn, a, b = map(int, input().split())\r\ncomplexities = list(map(int, input().split()))\r\nprint(count_possible_x(n, a, b, complexities))\r\n", "n, a, b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh= sorted(h)\r\n\r\nx = h[b] - h[b-1]\r\nprint(x)\r\n", "s = input().split()\r\nn = int(s[0])\r\na = int(s[1])\r\nb = int(s[2])\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\ns.sort()\r\nprint(s[b]-s[b-1])", "n,a,b=input().split()\r\na=int(a)\r\nn=int(n)\r\nb=int(b)\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(abs(l[b-1]-l[b]))", "\r\n\r\nn , a , b = map(int , input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\nx.sort()\r\n\r\nprint(x[b] - x[b - 1])", "o = list(map(int,input().strip().split()))[:3]\r\nn = o[0]\r\np =o[1]\r\nv = o[2]\r\nb = list(map(int,input().strip().split()))[:n]\r\nb.sort()\r\nli_v = b[:v]\r\nli_p = b[v:]\r\nprint(li_p[0]-li_v[-1])", "# Wadea #\r\n\r\nn,a,b=map(int ,input().split())\r\narr=list(map(int ,input().split()))\r\narr.sort()\r\nk=arr[b-1]\r\ng=arr[b]\r\nprint(int(abs(k-g)))\r\n", "n, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nprint(l[b]-l[b-1])", "[n, a, b] = list(map(int,input().split(\" \")))\r\nh = list(map(int,input().split(\" \")))\r\nh.sort()\r\nprint(h[b]-h[b-1])\r\n", "n, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort(reverse=True)\r\nx = h[a - 1] - h[a]\r\nif (x > 0):\r\n\tprint(x)\r\nelse:\r\n\tprint(\"0\")", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\n# Summarize count of factor within list -- START --\ndef summarizeList(l):\n sl=sorted(l)\n\n a=sl[0]\n c=1\n res=[]\n\n for x in sl[1:]:\n if x==a:\n c+=1\n else:\n res.append([a,c])\n a=x\n c=1\n res.append([a,c])\n\n return res\n# Summarize count of factor within list --- END ---\n\ndef main():\n n,a,b=LI()\n l=LI()\n\n sl=summarizeList(l)\n sm=0\n c1=0\n c2=0\n f1=False\n f2=False\n for x,c in sl:\n sm+=c\n if sm==b:\n c1=x\n f1=True\n else:\n if f1:\n c2=x\n return c2-c1\n\n return 0\n\n# main()\nprint(main())\n", "fl = list(map(int, input().split()))\narr = list(map(int, input().split()))\ncount = 0\narr.sort() # 1,2,3,6,100\nx = arr[fl[2]] - arr[fl[2]-1]\nprint(x)\n", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nprint(arr[b] - arr[b - 1])", "n, a, b = map(int, input().split())\r\nf = sorted([int(_) for _ in input().split()])\r\nvasa = f[:b]\r\npetia = f[b:]\r\nd = range(vasa[-1], petia[0])\r\nprint(len(d))\r\n", "n , a , b = map(int,input().split())\r\n\r\nc = sorted(list(map(int,input().split())))\r\n\r\nprint(c[-a]-c[-a-1])", "n,a,b=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nprint(x[b]-x[b-1])", "n, a, b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nar = input().split()\r\nfor i in range(n):\r\n ar[i] = int(ar[i])\r\nar.sort()\r\nprint(ar[-a] - ar[b - 1])", "n, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))[:n]\r\n\r\nj = 0\r\ncount = 0\r\n\r\ndef insertion_sort(l):\r\n for i in range(1, len(l)):\r\n x = l[i]\r\n j = i\r\n while (j > 0) and (l[j-1] < x):\r\n l[j] = l[j-1]\r\n j -= 1\r\n l[j] = x\r\n return l\r\n\r\nh = insertion_sort(l)\r\n\r\nx = h[a-1] - h[a]\r\n\r\nprint(x)", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\n\r\nprint(arr[b] - arr[b-1])\r\n", "n,a,b = map(int,input().split())\r\nhi = list(map(int,input().split()))\r\nhi.sort()\r\nprint(hi[b] - hi[b-1])\r\n", "# Codeforces: 169A - Chores\r\n\r\nn, a, b = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nans = h[b] - h[b - 1]\r\n\r\nprint(ans)", "n,a,b = map(int,input().split())\r\nli = sorted(list(map(int,input().split())))\r\nprint(li[b] - li[b-1])", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=True)\r\na=a-1\r\nk=l[a]\r\np=l[a+1]\r\nif k==p:\r\n print(0)\r\nelse:\r\n print(k-(p+1)+1)", "(total_number_of_chores, petya_chores, vasya_chores) = map(int, input().split(' '))\nchores = list(map(int, input().split(' ')))\nchores.sort()\n\nboundary = chores[-petya_chores] - chores[vasya_chores - 1]\n\nif boundary > 0:\n print(boundary)\nelse:\n print(0)", "n , a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint( h[b] - h[b-1])\r\n", "I=lambda:map(int,input().split())\nn,a,b=I()\nm=sorted(I())\nprint(m[b]-m[b-1])\n \t \t \t \t\t\t \t \t\t \t \t", "n, a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort(reverse=True)\r\nstart, end = c[a], c[a-1]\r\nprint(end-start)", "n, a, b = map(int, input().split())\nchores = list(map(int, input().split()))\nchores.sort()\n\nprint(chores[b] - chores[b-1])\n", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr = sorted(arr, reverse=True)\r\n\r\nprint(arr[a-1] - arr[a])", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nprint(c[b]-c[b-1])", "t,m,n = map(int,input().split())\r\na = list(map(int,input().split()))\r\n \r\na.sort()\r\nm = a[n]-a[n-1]\r\nif(m>0):\r\n print(m)\r\nelse:\r\n print(0)", "def solve():\r\n n,a,b = list(map(int,input().split()))\r\n l = list(map(int,input().split()))\r\n l.sort()\r\n print(l[b] - l[b-1])\r\nsolve()", "ip = input()\r\nn = int(ip.split()[0]) # tong so chores\r\na = int(ip.split()[1]) # so luong anh lam\r\nb = int(ip.split()[2]) # so luong e lam\r\nchore_cplx_list = list(map(int,input().split()))\r\nchore_cplx_list.sort()\r\nresult = chore_cplx_list[b] - chore_cplx_list[b-1]\r\nprint (result)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nh.sort()\r\nr=h[b]-h[b-1]\r\nprint(r)", "n, a, b =map(int, input().split())\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(abs(h[b-1]-h[b]))", "n , a , b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nprint(l[-a]-l[-(a+1)])\r\n", "# Chores\r\ndatain = True\r\n\r\nif datain:\r\n n, a, b = map(int, input().split())\r\n c = list(map(int, input().split()))\r\nelse:\r\n n, a, b = 5, 2, 3\r\n c = [6, 2, 3, 100, 1]\r\n\t\r\nc.sort()\r\n\r\nle = c[b-1]\r\nri = c[b]\r\n\r\nif (le == ri):\r\n\tprint('0')\r\nelse:\r\n\tprint(ri - le)", "n, a , b = map(int, input().split())\r\narr = [int(c) for c in input().split()]\r\narr.sort()\r\nprint(arr[-a]-arr[-a-1])\r\n", "def __init():\r\n num_input = input()\r\n num_input = num_input.split(\" \")\r\n n = int(num_input[0])\r\n a = int(num_input[1])\r\n b = int(num_input[2])\r\n\r\n h = input()\r\n h = h.split(\" \")\r\n for i in range(n):\r\n h[i] = int(h[i])\r\n \r\n return n, b, h\r\n\r\ndef solve(n, b, h):\r\n h.sort()\r\n return max(0, h[b] - h [b - 1])\r\n\r\nn, b, h = __init()\r\nprint(solve(n, b, h))\r\n\r\n", "n,a,b=map(int,input().split());r=sorted(map(int,input().split()));\r\ntry:print(r[b]-r[b-1])\r\nexcept:print(0)\r\n", "n,a,b=map(int,input().split())\r\nh=sorted(list(map(int,input().split())))\r\nprint(h[b]-h[b-1])", "first = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nn = first[0]\r\npetya = first[1]\r\nvasya = first[2]\r\narr.sort()\r\nstart = arr[vasya - 1]\r\nend = arr[n - petya]\r\nif end - start > 0:\r\n\tprint(str(end - start))\r\nelse:\r\n\tprint(\"0\")\r\n\r\n\r\n\t\t\r\n\t\r\n\t\t\r\n\t\t\r\n\r\n", "n,a,b = map(int,input().split())\r\nm=sorted(map(int,input().split()))\r\n\r\nprint(m[b]-m[b-1])\r\n", "#Chores - http://codeforces.com/problemset/problem/169/A\n#Petya takes on chores with complexity hi > x\n#Vasya takes on chores with complexity hi <= x\n#Petya does a chores\n#Vasya does b chores\nn,a,b = map(int,input().split())\nls = list(map(int,input().split()))\nls.sort()\nvasya = ls[b-1]\npetya = ls[b]\nprint(petya - vasya)\n", "n, a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nans = h[b] - h[b-1]\r\nprint(ans)", "n,a,b=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort(reverse=True)\r\nprint(list[a-1]-list[a])\r\n", "n , a, b = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nprint(l[a*-1]-l[b-1])", "n, a, b = list(map(int, input().split()))\r\nsorted_chores = sorted(list(map(int, input().split())))\r\ncount = 0\r\nstart_index = b - 1\r\nif start_index < 0:\r\n start_index = 0\r\ncount = sorted_chores[start_index + 1] - sorted_chores[start_index]\r\nif count < 0:\r\n count = 0\r\nprint(count)\r\n", "n, a, b = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nw.sort()\r\n\r\n\r\nif w[b] != w[b-1]:\r\n\tprint(w[b]-w[b-1])\r\nelse:\r\n\tprint(0)\r\n\r\n# 1 2 3 6 100", "n, a, b = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\nif ar[b - 1] == ar[b]:\r\n print(0)\r\nelse:\r\n print(ar[b] - ar[b - 1])", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn, a, b = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n", "from sys import stdin, stdout\r\nn, a, b = map(int, stdin.readline().split())\r\nH = list(map(int, stdin.readline().split()))\r\nH.sort()\r\n\r\nhardest_for_vasya = H[b-1]\r\neasiest_for_petya = H[b]\r\nans = easiest_for_petya - hardest_for_vasya\r\n\r\nprint(ans) if ans > 0 else print(0)", "def mergeSort(array):\r\n if len(array) > 1:\r\n\r\n # r is the point where the array is divided into two subarrays\r\n r = len(array)//2\r\n L = array[:r]\r\n M = array[r:]\r\n\r\n # Sort the two halves\r\n mergeSort(L)\r\n mergeSort(M)\r\n\r\n i = j = k = 0\r\n\r\n # Until we reach either end of either L or M, pick larger among\r\n # elements L and M and place them in the correct position at A[p..r]\r\n while i < len(L) and j < len(M):\r\n if L[i] < M[j]:\r\n array[k] = L[i]\r\n i += 1\r\n else:\r\n array[k] = M[j]\r\n j += 1\r\n k += 1\r\n\r\n # When we run out of elements in either L or M,\r\n # pick up the remaining elements and put in A[p..r]\r\n while i < len(L):\r\n array[k] = L[i]\r\n i += 1\r\n k += 1\r\n\r\n while j < len(M):\r\n array[k] = M[j]\r\n j += 1\r\n k += 1\r\n\r\n\r\narr = []\r\narr = input().split()\r\narr = [int(item) for item in arr]\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\nworks = []\r\nworks = input().split()\r\nworks = [int(item) for item in works]\r\nmergeSort(works)\r\ncounter = 0\r\nif works[b-1] < works[b]:\r\n counter = works[b] - works[b-1]\r\nprint(counter)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn, a, b = [int(x) for x in input().split()]\r\nq = sorted([int(x) for x in input().split()], reverse = True)\r\nprint(q[a-1]-q[a])\r\n", "n,a,b=map(int,input().split())\r\nchores=list(map(int,input().split()))\r\nchores.sort()\r\nprint(chores[b]-chores[b-1])", "n, a, b = map(int,input().split())\r\nps = list(map(int,input().split()))\r\nps.sort()\r\n\r\nc = ps[-a]\r\nd = ps[-a-1]\r\nif c == d:\r\n print(0)\r\nelif c > d:\r\n print(c-d)", "n,x,y=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nprint(l[y]-l[y-1])", "### Petya > x, Vasya <= x\r\nn, a, b = map(int, input().split())\r\ncomplexity = list(map(int, input().split()))\r\ncomplexity.sort()\r\nvasya_upper = complexity[b-1]\r\npetya_lower = complexity[b]\r\nif vasya_upper == petya_lower:\r\n print(0)\r\nelse:\r\n print(petya_lower-vasya_upper)\r\n", "n,a,b=map(int,input().split())\r\nx=sorted(list(map(int,input().split())))\r\nprint(x[b]-x[b-1])\r\n", "a,b,c=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\ntr=[int(x) for x in input().split(\" \")]\r\ntr.sort()\r\nprint(tr[c]-tr[c-1])", "_,a,b=map(int, input().split());l=sorted(list(map(int, input().split())));print(l[b:][0]-l[:b][b-1])", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n, a, b = map(int, input().split())\r\n h = list(map(int, input().split()))\r\n h.sort()\r\n print(h[b]-h[b-1])\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, a, b = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nprint(A[b] - A[b - 1])\r\n", "# link : https://codeforces.com/problemset/problem/169/A\r\n# sorting\r\nl = []\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nh = sorted([int(x) for x in input().split()])\r\n\r\n\r\ntry:\r\n print(h[b]-h[b-1])\r\nexcept :\r\n print(0)\r\n\r\n", "import sys\r\n\r\ndef main():\r\n n, a, b, *l = map(int, sys.stdin.read().strip().split())\r\n l.sort()\r\n return l[n-a] - l[n-a-1]\r\n \r\nprint(main())\r\n", "n,a,b=map(int,input().split())\r\nh=sorted(map(int,input().split()))\r\nprint(h[b]-h[b-1])", "n,a,b=map(int,input().split())\r\nl=sorted([int(i) for i in input().split()])\r\na1=l[:b]\r\nb1=l[b:]\r\nprint(b1[0]-a1[-1])", "m,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif l[-a]-l[-a-1]>0:\r\n\tprint(l[-a]-l[-a-1])\r\nelse:\r\n\tprint('0')", "n,a,b=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nlst.sort(reverse=True)\r\nprint(lst[a-1]-lst[a])\r\n", "n,a,b = [x for x in map(int, input().strip().split(\" \"))]\r\ncomplexity = list(map(int,input().strip().split(\" \")))\r\n\r\ncomplexity_sorted = sorted(complexity)\r\nlast_a = complexity_sorted[-a:]\r\nx = min(last_a)\r\n\r\n\r\ncount = x-complexity_sorted[-a-1]\r\nprint(count)\r\n\r\n\r\n", "n,a,b = map(int,input().split())\r\n\r\n\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nt.sort()\r\n\r\n\r\n\r\n\r\nprint(abs(t[b]-t[::-1][a]))\r\n", "n, a, b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, n1, n2 = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(a[n2] - a[n2 - 1])", "#Day 3 Exercise#1\n#Chores\nn, a, b = map(int,input().split())\nls = list(map(int,input().split()))\n\nls.sort()\ncount = ls[b] - ls[b-1]\n\nprint(count)\n", "n, a, b = map(int, input().split())\r\nl = sorted([int(i) for i in input().split()])\r\nprint(l[b] - l[b-1])", "n,a,b=map(int, input().split())\r\nv=map(int,input().split())\r\nh=sorted(v,reverse=True)\r\nx=h[a-1]-h[a]\r\nprint(x)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\n\r\nc=l[a-1]-l[a]\r\nprint(c)\r\n", "def solve():\r\n\t\r\n\tn, a, b = map(int,input().split())\r\n\tarr = list(map(int,input().split()))\r\n\tarr.sort()\r\n\treturn arr[n-a] - arr[n-a-1]\r\n\t\r\nprint(solve())", "n,a,b = map(int, input().split())\r\nH = list(map(int, input().split()))\r\n\r\nH.sort()\r\n\r\nif H[b-1] == H[b]:\r\n print(0)\r\n quit()\r\nelse:\r\n print(H[b]-H[b-1])", "\r\n(n, a, b) = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nd1 = h[b-1]\r\nd2 = h[-a]\r\n\r\nprint(d2 - d1)", "n, a, b = map(int, input().split())\r\ncomplexity = list(map(int, input().split()))\r\n\r\nbrother_chores = sorted(complexity)[b:n]\r\nyounger_chores = sorted(complexity)[0:b]\r\nx = min(brother_chores) - max(younger_chores)\r\n\r\nprint(x)", "\r\nn, a, b = map(int, input().split())\r\narray = sorted(map(int, input().split()))\r\nprint(0) if array[b - 1] == array[b] else print(array[b] - array[b - 1])\r\n", "if __name__ == '__main__':\r\n n, a, b = list(map(int,input().split()))\r\n h = sorted(map(int,input().split()))\r\n print(h[b] - h[b-1])", "\n\n\nfirst_line = input().split()\nn = int(first_line[0])\na = int(first_line[1])\nb = int(first_line[2])\nh = [int(i) for i in input().split()]\n\n\nh.sort()\n\nif h[b] > h[b - 1]:\n print(h[b] - h[b-1])\nelse:\n print('0')\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse();print(l[a-1]-l[a])\r\n", "l1=(input())\nl2=(input())\nx=l1.split(' ')\ny=l2.split()\nz=list()\nn=int(x[0])\na=int(x[1])\nb=int(x[2])\nfor i in y:\n z.append(int(i))\nz.sort(reverse=True)\nif 2<=n<=2000 and a>=1 and b>=1:\n print(z[a-1]-z[a])\nelse:\n print(0)\n\n \t\t \t \t\t \t\t \t \t\t\t \t\t", "\r\n\r\nn, a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nprint(l[b] - l[b-1] )\r\n", "if __name__==\"__main__\":\r\n n,a,b=map(int,input().split())\r\n li=list(map(int,input().split()))\r\n li.sort()\r\n # print(*li)\r\n i=0\r\n while b>0:\r\n i+=1\r\n b-=1\r\n # print(i)\r\n # print(li[i])\r\n print(li[i]-li[i-1])\r\n", "n, a, b = map(int, input().split(' '))\nh = list(map(int, input().split(' ')))\nh = sorted(h)\n\nprint(h[b]-h[b-1])\n\n\n'''\nNote:\ntìm max của thằng e (x) và minimum của thằng a (y), mục đích là tìm y-x\n\n'''\n", "n,a,b = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\n# n,a,b = 5, 2, 3,\r\n# h = [6, 2, 3, 100, 1]\r\n\r\n# n,a,b = 7, 3, 4\r\n# h = [1, 1, 9, 1, 1, 1, 1]\r\n\r\n# n,a,b = 2, 1, 1\r\n# h = [10, 2]\r\n\r\n#sort array\r\nh.sort()\r\n# print(h)\r\n# print(h[b-1])\r\n# print(h[n-a])\r\n\r\n#answer \r\nprint(h[n-a] - h[b-1])\r\n", "n,a,b = input().split()\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nb = int(b)\r\nprint(l[b]-l[b-1])", "a,b,c = map(int,input().split())\r\nz = sorted(list(map(int,input().split())))\r\nprint(z[-b]-z[-(b+1)])", "n, a, b = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nl = k[:b]\r\nh = k[b:]\r\nprint(h[0] - l[-1])", "n,a,b = map(int, input().split())\nlst=list(map(int, input().split()))\nlst.sort()\nprint(lst[b]-lst[b-1])", "n,p,v = input().split()\r\nx= list(map(int,input().split()))\r\n\r\nx.sort()\r\nprint(x[int(v)]-x[int(v)-1])", "def divideWork(h,a,b):\r\n h.sort()\r\n return h[b]-h[b-1] \r\n\r\nn,Petya,Vasya=map(int,input().split())\r\nh=list(map(int,input().split()))\r\n\r\nresult=divideWork(h,Petya,Vasya)\r\nprint(result)\r\n", "n,a,b=map(int,input().split())\r\nh= list(map(int,input().split()))\r\nh.sort()\r\nv=h[b-1]\r\np=h[b]\r\nprint(p-v)\r\n\r\n", "\r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort(reverse = True)\r\nres = arr[a - 1] - arr[a]\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort(reverse = False)\r\ntemp = c[n - a] - c[b - 1]\r\n\r\nif temp >= 0:\r\n print(temp)\r\nelse:\r\n print(0)", "n, a, b = map(int, input().split())\r\nl=list(map(int, input().split()))\r\n\r\nl.sort()\r\nprint(l[-a]-l[b-1])\r\n\r\n", "def chores(n,a,b,h):\r\n h.sort()\r\n return h[b]-h[b-1]\r\n\r\n\r\n\r\ng=input().split()\r\nn=int(g[0])\r\na=int(g[1])\r\nb=int(g[2])\r\nh=list(map(int,input().split()))\r\nprint(chores(n,a,b,h))", "import sys\r\n\r\nline1 = input()\r\ncomplex = input()\r\n\r\ntasks=line1.split()\r\ncomplex = [int(x) for x in complex.split()]\r\n\r\nnumber_task_of_Petya=int(tasks[1])\r\nnumber_task_of_Vasya=int(tasks[2])\r\n\r\n#print(\"Petya : \" + str(number_task_of_Petya))\r\n#print(\"Vasya : \" + str(number_task_of_Vasya))\r\n\r\nsorted_complex = sorted(complex)\r\n\r\n#print(\"sorted_complex : \" + str(sorted_complex))\r\n\r\n#task_of_Petya=[]\r\n#for i in range(number_task_of_Vasya):\r\n# task_of_Petya.append(i+1)\r\n\r\nend_task_of_Vasya = number_task_of_Vasya - 1\r\n#print(\"end_task_of_Vasya : \" + str(end_task_of_Vasya))\r\n\r\nstart_task_of_Petya = number_task_of_Vasya\r\n#print(\"start_task_of_Petya : \" + str(start_task_of_Petya))\r\n\r\n#print(\"Vasya : \" + str(sorted_complex[end_task_of_Vasya]))\r\n#print(\"Petya : \" + str(sorted_complex[start_task_of_Petya]))\r\nprint(str(sorted_complex[start_task_of_Petya] - sorted_complex[end_task_of_Vasya]))", "n,a,b=map(int ,input().split())\r\ncomplexity=list(map(int ,input().split()))\r\ncomplexity.sort()\r\n\r\nk=complexity[b-1]\r\ng=complexity[b]\r\nprint(int(abs(k-g)))", "a,b,c=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nmath=[int(x) for x in input().split(\" \")]\r\nmath.sort()\r\nprint(math[c]-math[c-1])", "n, a, b = list(map(int, input().split()))\r\nh = sorted(list(map(int, input().split())))\r\nans = h[b]-h[b-1]\r\nif ans == 0:\r\n print(ans)\r\nelse:\r\n print(ans)", "n, a, b = map(int, input().split())\nh = list(map(int, input().split()))\n\nv = sorted(h, key=lambda x: -x)\nx = v[a - 1]\ny = v[a]\nprint(x - y)\n", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=True)\r\na=a-1\r\ni=l[a]\r\nj=l[a+1]\r\nif i==j:\r\n print(0)\r\nelse:\r\n print(i-(j+1)+1)\r\n", "n,a,b = map(int, input().split(' '))\r\nh = list(map(int, input().split(' ')))\r\n\r\nh.sort()\r\n\r\nx = 0\r\ncnt = 0\r\nc,d = a,b\r\n\r\nfor i in range(n):\r\n if d == 0:\r\n if h[i] <= h[i-1]:\r\n print(0)\r\n break\r\n else:\r\n print(h[i] - h[i-1])\r\n break\r\n d -= 1\r\n", "R = lambda:map(int,input().split())\r\nn,m,l = R()\r\nk = sorted(R())\r\nprint(k[l]-k[l-1])", "n, a, b = list(map(int,input().split()))\r\nl=sorted(list(map(int,input().split())))\r\ncount = 0\r\nx= y =0\r\nvas = []\r\npet = []\r\nfor i in range(n):\r\n if x < b:\r\n vas.append(l[i])\r\n i+=1\r\n x+=1\r\n else:\r\n pet.append(l[i])\r\n\r\nmax = max(vas)\r\nmin = min(pet)\r\n\r\nprint(len(range(max,min)))\r\n", "def dela(lst, b):\r\n return sorted(lst)[b] - sorted(lst)[b - 1]\r\n\r\n\r\nn, a, b = [int(i) for i in input().split()]\r\nh = [int(j) for j in input().split()]\r\nprint(dela(h, b))\r\n", "n, a, b = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nprint(w[b]-w[b-1])", "nab = [int(x) for x in input().split()]\nn = nab[0]\na = nab[1]\nb = nab[2]\n\narr =[int(x) for x in input().split()]\narr.sort()\n\na1 = arr[n-a]\na2 = arr[n-a-1]\nprint(a1-a2)", "n, a, b = map(int,input().split())\r\nh = list(map(int, input().split()))\r\n\r\nh.sort()\r\nanh = h[b:]\r\nem = h[0:b]\r\n\r\nans = anh[0] - em[-1]\r\nprint(ans)", "n,a,b = map(int,input().split())\r\n\r\nx = list(map(int,input().split()))\r\n\r\naa = sorted(x)\r\n\r\nprint(aa[b] - aa[b-1])", "a,b,c = map(int,input().split())\n\ntotal = list(map(int,input().split()))\ntotal.sort()\nif b<c:\n print(total[c]-total[c-1])\nelse:\n print(total[c]-total[c-1])\n \n\t\t\t \t \t\t \t\t\t\t\t\t \t\t \t \t \t", "chores_count, older_chores_count, younger_chores_count = map(int, input().split())\ncomplexity = list(map(int, input().split()))\nselected_complexity = 0\ncount = 0\n\ncomplexity.sort()\n\nyounger_chores = complexity[0: younger_chores_count]\nolder_chores = complexity[younger_chores_count: chores_count]\nprint(older_chores[0] - younger_chores[-1])\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,a,b = map(int, wtf[0].split())\r\n A = sorted(map(int, wtf[1].split()), reverse=True)\r\n ans = 0\r\n z = abs(a)\r\n if len(A) >= n:\r\n ans = A[z-1]-A[z]\r\n print(ans)\r\n", "n,a,b=map(int,input().split())\r\nalist=list(map(int,input().split()))\r\nalist.sort(reverse=True)\r\np=alist[a-1]\r\nq=alist[a]\r\nprint(p-q)", "mylist = []\r\nenter = input().split()\r\nn = int(enter[0])\r\na = int(enter[1])\r\nb = int(enter[2])\r\nnumbers = input().split()\r\nif(n != len(numbers)):\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(0, n):\r\n\t mylist.append(int(numbers[i]))\r\n\tdef sort(mylist):\r\n\t\tfor long in range(len(mylist)-1,0,-1):\r\n\t\t\tfor i in range(0, long):\r\n\t\t\t\tif mylist[i+1] > mylist[i]:\r\n\t\t\t\t\ttemp = mylist[i]\r\n\t\t\t\t\tmylist[i] = mylist[i+1]\r\n\t\t\t\t\tmylist[i+1] = temp\r\n\tsort(mylist)\r\n\tlist2 = []\r\n\twhile(a != 0):\r\n\t\tlist2.append(mylist[0])\r\n\t\tmylist.remove(mylist[0])\r\n\t\ta -= 1\r\n\tlist3 = mylist.copy()\r\n\tresult = min(list2) - max(list3)\r\n\tprint(result)\r\n\r\n\t", "a,b,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort(reverse=True)\r\nprint(d[b-1]-d[b])", "n,a,b = map(int,input().split())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse = True)\r\nprint(l[a-1] - l[a])\r\n", "# Link: https://codeforces.com/problemset/problem/169/A\n# Site: Codeforces\n# Name: Chores\n# ======================================================\n\nif __name__ == '__main__':\n n, a, b = list(map(int, input().split()))\n li = list(map(int, input().split()))\n li = sorted(li)\n\n res = li[-a] - li[b - 1]\n print(res)", "n, a, b = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\nprint(c[b] - c[b-1])", "n,a,b=[int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()]\r\nx.sort()\r\nv=x[:b]\r\np=x[b:]\r\nif max(v)==min(p):\r\n print(0)\r\nelse:\r\n print(min(p)-max(v))", "n, a, b = list(map(int, input().split()))\nsorted_chores = sorted(list(map(int, input().split())))\ncount = 0\nstart_index = b - 1\nif start_index < 0:\n start_index = 0\ncount = sorted_chores[start_index + 1] - sorted_chores[start_index]\nif count < 0:\n count = 0\nprint(count)\n", "_, a, b = map(int, input().split())\r\ndata = sorted(map(int, input().split()))\r\nprint(data[b] - data[b - 1])\r\n", "n, a, b = map(int, input().split())\nhs = sorted(list(map(int, input().split())))\nprint( hs[b] - hs[b-1] )\n\n\t \t \t\t\t \t \t\t\t \t \t\t \t \t\t\t\t\t\t", "from sys import exit\r\n\r\ndef sort(nums):\r\n for i in range(len(nums)-1):\r\n smallnum = nums[i + 1]\r\n smalldex = i + 1\r\n for j in range(i, len(nums)):\r\n if nums[j] < smallnum:\r\n smallnum = nums[j]\r\n smalldex = j\r\n nums[smalldex] = nums[i]\r\n nums[i] = smallnum\r\n return nums\r\n\r\n\r\ninfo = input().split()\r\nchorenum = int(info[0])\r\npchores = int(info[1])\r\nvchores = int(info[2])\r\nchores = input().split()\r\nchores = [int(x) for x in chores]\r\nchores = sort(chores)\r\ncomplexity = 0\r\nways = 0\r\n\r\nways = int(chores[vchores]) - int(chores[vchores-1])\r\nprint(ways)\r\n", "n,a,b = map(int,input().split())\r\nmission=sorted(map(int,input().split()))\r\n\r\nprint(mission[b]-mission[b-1])\r\n", "import sys\r\nimport math\r\n\r\nn, a, b = [int(x) for x in (sys.stdin.readline()).split()]\r\nhi = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nhi.sort()\r\n\r\nprint(hi[b] - hi[b - 1])\r\n\r\n \r\n ", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nend_b = arr[b-1]\r\nstart_a = arr[b]\r\nif end_b < start_a:\r\n print(start_a - end_b)\r\nelse:\r\n print(0)\r\n", "n, a, b = tuple(map(int, input().split()))\r\nh = sorted(list(map(int, input().split())))\r\n\r\nstatus = None\r\nPeter = h[-a:]\r\ndiff = h[-a] - h[-a-1]\r\nif diff == 0:\r\n status = 0\r\nelse:\r\n status = diff\r\nprint (status)", "n, right, left = map(int, input().split())\nchores = list(map(int, input().split()))\nchores.sort()\na, b = chores[left-1], chores[left]\nprint(b-a)\n", "from sys import stdin, stdout\r\n\r\nn, a, b = map(int, stdin.readline().split())\r\nvalues = sorted(list(map(int, stdin.readline().split())))\r\n\r\nstdout.write(str(values[b] - values[b - 1]))", "n , a, b = map(int,input().split())\r\nchores = list(map(int,input().split()))\r\n\r\nchores.sort()\r\n\r\nPetya = chores[-a]\r\nVasya = chores[b -1]\r\n\r\nprint(Petya - Vasya)\r\n", "c = list(map(int,input(\"\").split()))\nd = sorted(list(map(int,input(\"\").split())))\nprint(d[-c[1]:][0] - d[:c[2]][-1])\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 26 06:24:05 2020\r\n\r\n@author: Ngo-Manh.Tuan\r\n\"\"\"\r\n\r\nlist_input = list(map(int, input().split()))\r\nn, a, b = list_input[0], list_input[1], list_input[2]\r\nchores = list(map(int, input().split()))\r\n\r\nchores = sorted(chores)\r\n\r\nprint(chores[b] - chores[b-1])", "n, a , b = map(int, input().split())\r\n*h, = map(int, input().split())\r\nh.sort()\r\nprint(h[b] - h[b - 1])", "n, a, b =[int(i)for i in input().split()]\r\nl=list(map(int, input().strip().split()))\r\nl.sort(reverse=True)\r\nsolve=l[a-1]-l[a]\r\nif(solve>0):\r\n print(solve)\r\nelse:\r\n print(\"0\")", "n, a, b = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nh.sort(reverse=True)\r\nprint(h[a-1]-h[a])\r\n", "n, a, b = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nprint(arr[b] - arr[b - 1])", "inp = list(map(int,input().split()))\r\nn=inp[0]\r\na=inp[1]\r\nb=inp[2]\r\ninp = list(map(int,input().split()))\r\ninp.sort(reverse=True)\r\nif(inp[a-1]-inp[a]<0):\r\n print (0)\r\nelse:\r\n print (inp[a-1]-inp[a])", "# http://codeforces.com/problemset/problem/169/A\n# A. Chores\n\ndef read_input():\n n, a, b = [int(i) for i in input().split(\" \")]\n h = [int(i) for i in input().split(\" \")]\n return (n, a, b, h)\n\ndef do_chores(n, a, b, h):\n h.sort()\n last_b = h[b - 1]\n first_a = h[b]\n # print(h)\n # print(last_b, first_a)\n\n return first_a - last_b\n\n\ndef main():\n n, a, b, h = read_input()\n print(do_chores(n, a, b, h))\n\n\nif __name__ == '__main__':\n main()", "def inp(): return map(int, input().split())\r\nn,a,b = inp()\r\nh = list(inp())\r\nh.sort()\r\nprint(h[b] - h[b-1])", "n,a,b=map(int,input().split())\nli=sorted(list(map(int,input().split())))\nprint(li[b]-li[b-1])\n\n \t \t \t\t\t \t\t\t \t \t\t \t \t\t \t\t \t\t", "from sys import stdin, stdout\r\n\r\nn, a, b = map(int, stdin.readline().split())\r\nH = list(map(int, stdin.readline().split()))\r\nH.sort()\r\n\r\nhardest_for_vasya = H[b-1]\r\neasiest_for_petya = H[b]\r\nans = easiest_for_petya - hardest_for_vasya\r\n\r\nstdout.write(str(ans)) if ans > 0 else stdout.write(str(ans))\r\n", "nums = list(map(int, input().split()))\nmylength = nums[1]\nallnums = list(map(int, input().split()))\nallnums.sort(reverse=True)\nresult = abs(allnums[mylength-1]- allnums[mylength])\nprint(result)\n \t\t \t \t \t \t\t\t \t \t\t\t", "input1 = list(map(int,input().split()))\r\nnumberOfChores = input1[0]\r\nnumberOfPetyaChores = input1[1]\r\nnumberOfVasyaChores = input1[2]\r\n\r\nchoresComplexities = list(map(int, input().split()))\r\n\r\nchoresComplexities.sort()\r\n\r\nnumberOfWayToChooseN = choresComplexities[numberOfVasyaChores] - choresComplexities[numberOfVasyaChores - 1]\r\n\r\nprint(numberOfWayToChooseN)", "\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\n\r\nl1.sort(reverse=True)\r\n\r\np=l1[:l[1]]\r\nv=l1[l[1]:]\r\n\r\nprint(p[-1]-v[0])", "n, a, b = tuple([int(x) for x in input().split()])\narr = [int(x) for x in input().split()]\narr = sorted(arr)\nprint(arr[b] - arr[b-1])", "n, a, b = map(int, input().split())\r\nh = [int(i) for i in input().split()]\r\nh.sort()\r\nprint(h[b] - h[b - 1])\r\n\n# Tue Nov 01 2022 13:49:18 GMT+0300 (Moscow Standard Time)\n", "n,a,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nresult = arr[b]-arr[b-1]\r\nprint(result)", "R=lambda:map(int,input().split())\r\nn,a,b=R()\r\nh=sorted(list(R()))\r\nprint(h[b]-h[b-1])", "c=int(input().split()[2]);k=sorted(list(map(int,input().split())));print(k[c]-k[c-1])\r\n\r\n", "n, a, b = list(map(int, input().split()))\r\narr = sorted(list(map(int, input().split())), reverse=True)\r\n\r\nx = 0\r\nif a > 1:\r\n x+= abs(arr[a] - arr[a-1]) \r\nelse:\r\n x+= abs(arr[0] - arr[1])\r\nprint(x)\r\n\r\n", "n,a,b=[int(i) for i in input().split()]\r\nh=[int(i) for i in input().split()]\r\nh.sort()\r\nz1=h[b-1]\r\nz2=h[b]\r\nprint(z2-z1)", "n,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nl1=[]\r\nx,y,z,t=l[n-a-1],l[n-a]-1,l[b-1],l[b]-1\r\nif(x>y or z>t):\r\n print('0')\r\nelse:\r\n if(x==z):\r\n m=min(y,t)\r\n print(m-x+1)\r\n elif(x>z):\r\n if(x<=t):\r\n m=min(y,t)\r\n print(m-x+1)\r\n else:\r\n print('0')\r\n else:\r\n if(z<=y):\r\n m=min(y,t)\r\n print(m-z+1)\r\n else:\r\n print('0')\r\n \r\n", "def main():\n [n, a, b] = [int(_) for _ in input().split()]\n complexities = [int(_) for _ in input().split()]\n complexities.sort(reverse=True)\n print(complexities[a - 1] - complexities[a])\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b=map(int, input().split())\r\nh = sorted([int(i) for i in input().split()])\r\nprint(h[b]-h[b-1])", "n,a,b = map(int, input().split())\r\nchores = sorted(list(map(int, input().split())))\r\nx = chores[b] - chores[b-1]\r\nprint(x)\r\n\r\n", "n, petya, vasya = map(int, input().split())\r\nchores = list(map(int, input().split()))\r\n\r\nif vasya == len(chores):\r\n print(0)\r\nelif petya == len(chores):\r\n print(min(chores))\r\nelse:\r\n chores.sort()\r\n difference = chores[vasya] - chores[vasya - 1]\r\n if difference == 0:\r\n print(0)\r\n else:\r\n print(difference)", "\r\ndef solves():\r\n n,a,b=map(int,input().split())\r\n lst = sorted(list(map(int,input().split())))\r\n print(lst[n-a]-lst[n-a-1])\r\n\r\nfor _ in range(1):\r\n solves()\r\n", "inputs = list(map(int,input().split(\" \")))\r\nn = inputs[0]\r\nolderBrother = inputs[1]\r\n\r\narr = list(map(int,input().split(\" \")))\r\narr = sorted(arr, reverse=True)\r\n\r\nsum=arr[olderBrother-1]-arr[olderBrother]\r\n\r\nif sum>0:\r\n print(sum)\r\nelse:\r\n print(0)", "#dedicated to Rupa ..\r\nn,a,b=map(int,input().split())\r\n#array=[int(input()) for i in range(n)]\r\narray=list(map(int,input().split()))\r\narray.sort()\r\nans=array[b]-array[b-1]\r\nprint(ans)\r\n\r\n# happy coding ,,\r\n#1st time use array ..", "n,a,b=map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nprint(l[b]-l[b-1])", "n,a,b = map(int,input().split());\r\narr = sorted(list(map(int,input().split())));\r\nprint(arr[b] - arr[b-1]);", "m,a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ns.sort()\r\nprint(s[-a] - s[b-1])", "n, a, b = map(int, input().split())\r\na = [int(k) for k in input().split()]\r\nx = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(n - i - 1):\r\n if a[j] > a[j + 1]:\r\n a[j], a[j + 1] = a[j + 1], a[j]\r\n\r\nx = a[b - 1]\r\nif a[b - 1] < a[b]:\r\n print(a[b] - x)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

{"inputs": ["5 2 3\n6 2 3 100 1", "7 3 4\n1 1 9 1 1 1 1", "2 1 1\n10 2", "2 1 1\n7 7", "2 1 1\n1 1000000000", "3 1 2\n6 5 5", "3 2 1\n10 10 8", "8 3 5\n42 55 61 72 83 10 22 33", "10 5 5\n1 2 3 4 5 999999999 999999998 999999997 999999996 999999995", "4 1 3\n10 8 7 3", "4 2 2\n402 10 10 402", "4 1 3\n10 402 402 10", "4 3 1\n100 100 200 200", "150 10 140\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "102 101 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1"], "outputs": ["3", "0", "8", "0", "999999999", "1", "2", "6", "999999990", "2", "392", "0", "0", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

282

d0eadd1af5500f9da5e84a894556b641

Table Tennis Game 2

Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly *k* points, the score is reset and a new set begins. Across all the sets Misha scored *a* points in total, and Vanya scored *b* points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible. Note that the game consisted of several complete sets. The first line contains three space-separated integers *k*, *a* and *b* (1<=≤<=*k*<=≤<=109, 0<=≤<=*a*,<=*b*<=≤<=109, *a*<=+<=*b*<=><=0). If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets. Sample Input 11 11 5 11 2 3 Sample Output 1 -1

[ "'''\r\nCreated on 21 feb. 2017\r\n\r\n@author: Mirela\r\n'''\r\n\r\n\r\ndef calc(a, b, k):\r\n rez=a//k + b//k\r\n print(rez)\r\n\r\n\r\ndef solve():\r\n k,a,b=input().split(\" \")\r\n k=int(k)\r\n a=int(a)\r\n b=int(b)\r\n if a<k and b<k:\r\n print(-1)\r\n else:\r\n if a<b:\r\n res=b%k \r\n if a<k and res!=0:\r\n print(-1)\r\n else:\r\n calc(a,b,k)\r\n else:\r\n res=a%k \r\n if b<k and res!=0:\r\n print(-1)\r\n else:\r\n calc(a,b,k)\r\nsolve()\r\n", "#! /usr/bin/env python\r\n\r\n\r\ndef compute_sets(a, b, k):\r\n if not(a >= k or b >= k):\r\n return -1\r\n\r\n awins = a // k\r\n bwins = b // k\r\n\r\n if awins == 0:\r\n if b % k != 0:\r\n return -1\r\n\r\n elif bwins == 0:\r\n if a % k != 0:\r\n return -1\r\n\r\n return awins + bwins\r\n\r\n\r\ndef main():\r\n\r\n import sys\r\n\r\n for line in sys.stdin:\r\n line = [int(x) for x in line.rstrip().split(\" \")]\r\n k = line[0]\r\n a = line[1]\r\n b = line[2]\r\n print(compute_sets(a,b,k))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "k,a,b=map(int,input().split())\r\nm=(a//k)+(b//k)\r\nif m>0 and ((a//k)*(k-1)>=b%k) and ((b//k)*(k-1)>=a%k):\r\n print(m)\r\nelse:\r\n print(-1)\r\n", "k, a, b = [int(item) for item in input().split()]\r\nif max(a, b) < k:\r\n\tprint(\"-1\")\r\nelif (a % k != 0 or a == 0) and (b % k != 0 or b == 0):\r\n\tif a >= k and b >= k:print(a // k + b // k)\r\n\telse:print(\"-1\")\r\nelse:\r\n\tprint(a // k + b // k)", "k, a, b = map(int, input().split())\r\ntemp = a // k + b // k\r\n\r\nif temp == 0:\r\n print(\"-1\")\r\nelif a<k and b%k!=0:\r\n print(\"-1\")\r\nelif b<k and a%k!=0:\r\n print(\"-1\")\r\nelse:\r\n print(temp)\r\n", "k,a,b=map(int,input().split())\ns=0\ns+=a//k+b//k\nif a<k and b>=k and b%k==0 or a%k==0 and a>=k and b<k or a>=k and b>=k:\n print(s)\nelse:\n print(-1)\n \t \t\t\t \t \t \t \t \t\t\t", "k,a,b=list(map(int,input().strip().split(' ')))\r\nt1=a//k\r\nt2=b//k\r\ntemp1=k*t1+(k-1)*t2\r\ntemp2=(k-1)*t1+k*t2\r\nif temp1>=a and temp2>=b:\r\n print(t1+t2)\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n ", "def solve(p,s1,s2):\r\n ans=s1//p+s2//p\r\n if s1%p!=0 and s2//p==0:\r\n return -1\r\n elif s1//p==0 and s2%p!=0:\r\n return -1\r\n return ans\r\n\r\np,s1,s2=map(int,input().split())\r\nprint(solve(p,s1,s2))\r\n", "class solve:\r\n def __init__(self):\r\n k,a,b=map(int,input().split())\r\n if a%k==0 and b<k:\r\n ans=a//k\r\n elif b%k==0 and a<k:\r\n ans=b//k\r\n elif a>=k and b>=k:\r\n ans=a//k+b//k\r\n else:\r\n ans=-1\r\n if ans<=0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nobj=solve()", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[k, a, b] = list(map(int, input().split()))\r\n\r\nx = a//k\r\ny = b//k\r\nres = x+y\r\nif res == 0 or (x == 0 and b%k > 0) or (y == 0 and a%k > 0):\r\n res = -1\r\nprint(res)\r\n ", "a,b,c=map(int,input().split())\r\nif b>=a and c>=a:print(b//a+c//a)\r\nelif b<a and c<a:print(-1)\r\nelse:print([-1,max(b,c)//a][(b<a and c%a==0) or (c<a and b%a==0)])", "\r\nif __name__ == '__main__':\r\n k, a, b = list(map(int, input().split()))\r\n ax, ay = divmod(a, k)\r\n bx, by = divmod(b, k)\r\n \r\n if ay > (k - 1) * bx:\r\n print(-1)\r\n elif by > (k - 1) * ax:\r\n print(-1)\r\n else:\r\n print(ax + bx)\r\n", "# 1 Yotta Byte!\r\n# Codeforces 397\r\nk, a, b = map(int, input().split())\r\nif a == 0 or b == 0:\r\n if (a + b) % k == 0:\r\n print((a + b) // k)\r\n else:\r\n print(-1)\r\nelif a % k == 0 or b % k == 0:\r\n print(a // k + b // k)\r\nelif a // k >= 1 and b // k >= 1:\r\n print(a // k + b // k)\r\nelse:\r\n print(-1)", "a,b,c=map(int,input().split())\nprint(-1 if (b<a and c%a)or(c<a and b%a) else b//a+c//a)\n", "k, a, b = map(int, input().split())\r\n\r\nif a < b:\r\n a, b = b, a\r\n\r\nif (a >= k and b >= k):\r\n ans = a//k+b//k\r\nelif a%k == 0:\r\n ans = a//k+b//k\r\nelse:\r\n ans = -1\r\n\r\n\r\nprint(ans)\r\n", "k, a, b = map(int, input().split())\r\ng = a // k + b // k\r\nif a < k and b < k:\r\n print(-1)\r\nif a >= k and b >= k:\r\n print(g)\r\nif a >= k and b < k:\r\n print(-1 if a % k else g)\r\nif a < k and b >= k:\r\n print(-1 if b % k else g)", "k,a,b=map(int,input().split())\r\nprint([-1,a//k+b//k][(k<=a and k<=b)or((a and a%k==0) or (b and b%k==0))])", "k,a,b=map(int,input().split())\r\nif a<k and b<k:\r\n print(-1)\r\n exit(0)\r\nif a<k and b>=k and b%k>0:\r\n print(-1)\r\n exit(0)\r\nif b<k and a>=k and a%k>0:\r\n print(-1)\r\n exit(0)\r\nprint(a//k+b//k)", "k,a,b=map(int, input().split())\r\nif a<k and b % k != 0 or b < k and a % k !=0:\r\n print(-1)\r\nelse:\r\n print(a//k+b//k)\r\n \r\n", "k,a,b=map(int,input().split())\r\nprint((a//k)+(b//k) if a>=k and b>=k or (a and a%k==0) or (b and b%k==0) else -1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk, a, b = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\nif not a:\r\n ans = b // k if not b % k else -1\r\nelif b < k or (a < k and b % k) or (b < k and a % k):\r\n ans = -1\r\nelse:\r\n ans = a // k + b // k\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk, a, b = map(int, input().split())\r\n\r\nc = a//k + b//k\r\nif c == 0 or (a%k != 0 and b < k) or (b%k != 0 and a < k):\r\n print(-1)\r\nelse:\r\n print(c)", "k,a,b=map(int,input().split())\r\nx1,y1,x2,y2=a//k,b//k,a%k,b%k\r\nif x1==0 and y1>0 and x2>=0 and y2>0:print(-1)\r\nelif x1>0 and y1==0 and x2>0 and y2>=0:print(-1)\r\nelse:\r\n if x1==0 and y1==0:print(-1)\r\n else:print(x1+y1)", "k, a, b = map(int, input().split())\r\nif a%k != 0 and int(b/k) == 0:\r\n print(-1)\r\nelif b%k != 0 and int(a/k) == 0:\r\n print(-1)\r\nelse:\r\n print(int(a/k)+int(b/k))\r\n", "k, a, b = map(int, input().split())\nans = a // k + b // k\nif ans == 0 or (min(a, b) < k and max(a, b) % k):\n print(-1)\nelse:\n print(ans)", "k,a,b = map(int,input().split())\r\n\r\n\r\nif a<k and b<k:\r\n print(-1)\r\nelif a<k and b%k:\r\n print(-1)\r\nelif b<k and a%k:\r\n print(-1)\r\nelse:\r\n print(a//k+b//k)", "k,a,b = map(int,input().split())\r\nif (a<k and b%k) or (b<k and a%k) :\r\n print(-1)\r\nelse :\r\n print(a//k + b//k)\r\n \r\n ", "k, a, b = map(int, input().split())\nif a < k and b < k:\n print(-1)\nelif a % k == 0 and b % k == 0:\n print(a // k + b // k)\nelse:\n if a >= b:\n if a % k == 0:\n print(a // k)\n elif a % k != 0 and b >= k:\n print(a // k + b // k)\n else:\n print(-1)\n elif a < b:\n if b % k == 0:\n print(b // k)\n elif b % k != 0 and a >= k:\n print(b // k + a // k)\n else:\n print(-1)\n\n", "from math import *\r\ndef main():\r\n k, a, b = map(int, input().split())\r\n x = (a % k) + (b % k)\r\n if a < k or b < k:\r\n if x == a or x == b:\r\n ans = floor(a / k) + floor(b / k)\r\n if ans == 0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n else:\r\n print(-1)\r\n else:\r\n ans = floor(a / k) + floor(b / k)\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 25 11:42:59 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\n[k,a,b]=list(map(int,input().split()))\r\nans=(a//k)+(b//k)\r\nc=a%k\r\nd=b%k\r\n\r\nif c and b//k==0:\r\n print(-1)\r\nelif d and a//k==0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "\r\nk, a, b = [int(x) for x in input().split(' ')]\r\n\r\nsets_a_won = a//k\r\nsets_b_won = b//k\r\n\r\nif (sets_a_won == 0 and b%k != 0) or (sets_b_won == 0 and a%k != 0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(sets_a_won + sets_b_won)\r\n", "k, a, b = map(int, input().split())\r\nfirst = a // k\r\nsecond = b // k\r\nif first + second == 0 or (first == 0 and b % k != 0) or (second == 0 and a % k != 0):\r\n print(-1)\r\nelse:\r\n print(first + second)", "k,a,b= [int(x) for x in input().split()]\r\nans =0\r\nm = a//k\r\nn = b//k\r\nif b > (k-1)*m + n*k or a > m*k + (k-1)*n:\r\n print(-1)\r\nelse:\r\n print(ans+m+n) ", "k, a, b = [int(i) for i in input().split()]\r\n\r\nresa = a // k\r\nresb = b // k\r\nosta = a % k\r\nostb = b % k\r\n\r\nres = resa + resb\r\n\r\nif (res == 0) or (resa == 0 and ostb != 0) or (resb == 0 and osta != 0):\r\n print(-1) \r\nelse:\r\n print(res)\r\n", "k, a, b = map(int, input().split())\r\nif a < b:\r\n a, b = b, a\r\ns = a // k + b // k\r\nif a < k and b < k:\r\n print(-1)\r\nelif b < k <= a:\r\n if a % k != 0:\r\n print(-1)\r\n else:\r\n print(a // k)\r\nelse:\r\n print(s)\r\n", "k,a,b=input().split()\r\na1=int(a)//int(k)\r\na2=int(b)//int(k)\r\nif(int(a)<int(k) and int(b)%int(k) or int(b)<int(k) and int(a)%int(k)):\r\n\tprint(-1)\r\nelse:\r\n\tprint(a1+a2)", "k,a,b=input().split()\r\na1=int(a)//int(k)\r\na2=int(b)//int(k)\r\nif(a1+a2>0 and int(a)%int(k)<=a2*int(k) and int(b)%int(k)<=a1*int(k)):\r\n\tprint(a1+a2)\r\nelse:\r\n\tprint(-1)\r\n\r\n\r\n\r\n\r\n'''if(a1+a2>0 or ( int(a)>int(k) and a2>0 and int(b)>int(k) and a1>0)):\r\n#if(a1+a2>0 and int(a)%int(k)<=a2*int(k) and int(b)%int(k)<=a1*int(k)):\r\n\tprint(a1+a2)\r\nelse:\r\n\tprint(-1)\r\n\t'''", "k,a,b = map(int,input().split())\r\n\r\nif int(b/k) == 0 and a%k or int(a/k) == 0 and b%k:\r\n\tprint(-1)\r\n\texit()\r\n\r\n\r\nans = int(a/k)+int(b/k)\r\nprint(ans)\r\n", "k,a,b = map(int,input().split())\r\nfrom math import floor\r\nawin = floor(a/k)\r\nbwin = floor(b/k)\r\nif b%k > awin*(k-1) or a%k > bwin*(k-1) : \r\n\tprint(-1)\r\nelse : print(awin + bwin)\r\n", "k,a,b=map(int,input().split())\r\nu=int(a/k)+int(b/k)\r\nif (a<k) and (b%k) :\r\n u=-1\r\nif (b<k) and (a%k):\r\n u=-1\r\nprint(u)", "import sys\r\nread=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(x+\"\\n\")\r\np, a, b = map(int, read().split())\r\nqa, ra = divmod(a, p)\r\nqb, rb = divmod(b, p)\r\nif qa >= 1 and qb >= 1:\r\n write(str(qa + qb))\r\nelif qa >= 1 and qb == 0:\r\n if ra == 0:\r\n write(str(qa))\r\n else:\r\n write(\"-1\")\r\nelif qb >= 1 and qa == 0:\r\n if rb == 0:\r\n write(str(qb))\r\n else:\r\n write(\"-1\")\r\nelse:\r\n write(\"-1\")", "k, a, b = map(int, input().split())\nif (a >= k and b >= k) or (a % k == 0 and a // k != 0) or (b % k == 0 and\n b // k != 0):\n print(a // k + b // k)\n\nelse:\n print(-1)\n\n\t \t \t \t \t \t\t\t\t\t \t\t\t \t", "a=input().split()\r\nb=int(a[0])\r\nn=int(a[1])\r\nnn=n%b\r\nm=int(a[2])\r\nmm=m%b\r\nn=int(n/b)\r\nm=int(m/b)\r\nif(n+m>0):\r\n if(m==0 and nn!=0):\r\n print(-1)\r\n elif(n==0 and mm!=0):\r\n print(-1)\r\n else:print(n+m)\r\nelse:print(-1)\r\n", "k,a,b = map(int,input().split())\nif a<k and b<k:\n print(-1)\nelif min(a,b)<k and max(a,b)%k!=0:\n print(-1)\nelse:\n print((a//k)+(b//k))\n", "n,a,b=map(int,input().split())\r\nif ((a<n and b%n) or (b<n and a%n)):\r\n\tprint(-1)\r\nelse :\r\n\tprint(a//n+b//n)", "a, b, c = map(int, input().split())\r\n\r\nout = b//a + c//a\r\n\r\nif b//a == 0 and c % a:\r\n print(-1)\r\nelif c//a == 0 and b % a:\r\n print(-1)\r\nelse:\r\n print(out)\r\n", "import math, sys, itertools\r\nfrom decimal import *\r\n\r\ndef main():\r\n\tk,a,b = map(int, input().split())\r\n\tmx = max(a,b)\r\n\tmn = min(a,b)\r\n\t\r\n\tr1 = mx%k\r\n\tr2 = mn%k\r\n\td1 = mx//k\r\n\td2 = mn//k\r\n\t\r\n\tif (d2==0 and r1!=0) or (d1==0 and r2!=0):\r\n\t\tprint(-1)\r\n\t\tsys.exit()\r\n\tprint(d1+d2)\r\n\t\r\n\t\t\t\r\nif __name__==\"__main__\":\r\n\tmain()\r\n", "k,x,y=map(int,input().split())\r\nif((x>=k and y>=k) or (x and x%k==0) or (y and y%k==0)):\r\n print(x//k+y//k)\r\nelse:\r\n print(-1)\r\n", "k,a,b=map(int,input().split())\r\nprint(-1 if a<k and b%k or b<k and a%k else a//k+b//k)", "n,a,b=input().split()\r\nif (int(a)<int(n) and int(b)%int(n)) or (int(b)<int(n) and int(a)%int(n)):\r\n\tprint(-1);\r\nelse:\r\n\tprint(int(a)//int(n)+int(b)//int(n))", "k, a, b = map(int, input().split())\n\ns1 = a // k\ns2 = b // k\n\nif (a % k and s2 == 0) or (b % k and s1 == 0):\n\tprint(-1)\nelse:\n\tprint(s1 + s2)", "def tennis(k, a, b):\r\n if a < b:\r\n a, b = b, a\r\n result, flag = 0, True\r\n if a < k and b < k:\r\n flag = False\r\n elif a % k != 0 and b < k:\r\n flag = False\r\n else:\r\n result = a // k + b // k\r\n if not flag:\r\n result -= 1\r\n return result\r\n\r\n\r\nK, A, B = [int(i) for i in input().split()]\r\nprint(tennis(K, A, B))\r\n", "#Rohan Bojja \n#[email protected]\n\n#######################################\nc=1\ncases=1\n\nwhile(c<=cases):\n\t[k,a,b]=[int(i) for i in input().split()]\n\tans=-1\n\tif(a>=k and b>=k):\n\t\tans=(a//k)+(b//k)\n\telif(a>=k):\n\t\tif(a%k==0):\n\t\t\tans=a//k\n\telif(b>=k):\n\t\tif(b%k==0):\n\t\t\tans=b//k\n\tprint(ans)\n\tc=c+1\n", "a,b,c=map(int,input().split())\r\nif b<a and c<a:print(-1)\r\nelif b<a and c%a:print(-1)\r\nelif c<a and b%a:print(-1)\r\nelse:print(b//a+c//a)\r\n", "k, a, b = [int(x) for x in input().split()]\r\nresult = a//k + b//k\r\nif result == 0 or (a%k != 0 and b < k) or (b%k != 0 and a < k):\r\n\tprint('-1')\r\nelse:\r\n\tprint(result)\r\n#GTFO from my code, 612!", "k, a, b = map(int, input().split())\r\nwa = a // k\r\nwb = b // k\r\nif (a < k and b < k) or (a % k != 0 and wb == 0) or (b % k != 0 and wa == 0):\r\n print(\"-1\")\r\nelse:\r\n print(wa + wb)", "k, a, b = map(int, input().split())\r\n \r\nres = a // k + b // k\r\nif (a < k and b % k) or (b < k and a % k): \r\n res = -1\r\n \r\nprint(res)", "k,a,b=list(map(int,input().split()))\r\nf=a//k + b//k\r\nif f:\r\n if a>=b:\r\n if a%k==0:\r\n print(f)\r\n else:\r\n if b>=k:\r\n print(f)\r\n else:\r\n print(-1)\r\n else:\r\n if b%k==0:\r\n print(f)\r\n else:\r\n if a>=k:\r\n print(f)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "k,a,b=map(int,input().split());ans=0\r\n#if both win sets (k,b%k),(a%k,k)\r\nif a>=k and b>=k:print(a//k+b//k)\r\nelif (a!=0 and a%k==0) or (b!=0 and b%k==0):print(a//k+b//k)\r\nelse:print(-1)\r\n", "k, a, b = map(int, input().split())\r\na1 = a // k\r\nr_a1 = a % k\r\nb1 = b // k\r\nr_b1 = b % k\r\nif a1 + b1 == 0 or min(a,b) < k and max(a, b) % k != 0:\r\n print(-1)\r\nelse:\r\n print(a1 + b1)\r\n", "\n\ntemp=input()\nk,a,b =map(int,temp.split(\" \"))\n\nif (a<k and b<k) or ( a<k and b%k!=0 ) or ( b<k and a%k!=0 ):\n print(-1)\nelse:\n print(a//k + b//k)\n\n\n", "k, a, b = map(int, input().split())\r\ndiva, moda = divmod(a, k)\r\ndivb, modb = divmod(b, k)\r\nprint(-1 if diva == divb == 0 or (moda > 0 and divb == 0 or modb > 0 and diva == 0) else diva + divb)\r\n", "c=input().split()\r\nk=int(c[0])\r\na=int(c[1])\r\nb=int(c[2])\r\nif(a>=k and b>=k) or (a%k==0 and a//k!=0) or (b%k==0 and b//k!=0):\r\n print(a//k + b//k)\r\nelse:\r\n print(-1)\r\n", "k, a, b = [int(i) for i in input().split(\" \")]\r\n\r\nanswer = a//k + b//k\r\n\r\nif((a%k == 0 and a != 0) or (b%k == 0 and b != 0) or (a >= k and b >= k)):\r\n print(answer)\r\nelse:\r\n print(-1)", "k, a, b = map(int, input().split())\nc = a // k + b // k\nif a < k and b % k or b < k and a % k:\n print(-1)\nelse:\n print(c)\n\t \t \t\t\t\t \t\t \t\t\t\t \t", "# for _ in range(int(input)):\r\na,b,c = map(int,input().split())\r\n # s =input()\r\n # m =s.count('-')\r\n # p = s.count('+')\r\n # if (b + p) < a : \r\n # print(\"NO\")\r\n # elif (b+p -m) : \r\nif (b//a + c//a ==0):\r\n print(-1)\r\nelse : \r\n a1 = b//a \r\n a2 = c//a \r\n if (a1==0 and c%a !=0) :\r\n print(-1)\r\n elif (a2 ==0 and b%a !=0):\r\n print(-1)\r\n else : \r\n print(a1 + a2)\r\n\r\n", "n = [int(i) for i in input().split()]\nc = n[1]//n[0]\nd = n[2]//n[0]\ne = n[1]%n[0]\nf = n[2]%n[0]\nif(e!=0 and d==0):\n\tprint(-1)\nelif(f!=0 and c==0):\n\tprint(-1)\nelse:\n\tprint(c+d)", "k, a, b = map(int, input().split())\r\nif a < k and b < k:\r\n\tprint(-1)\r\nelif min(a, b) < k and max(a, b) % k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(a // k + b // k)\r\n", "k, a, b = map(int, input().split())\r\n\r\ndiva = a//k\r\ndivb = b//k\r\nmoda = a%k\r\nmodb = b%k\r\nif(diva>0 and divb>0):\r\n print(diva+divb)\r\nelif((diva>0 and moda==0) or (divb>0 and modb==0)):\r\n print(diva+divb)\r\nelse:\r\n print(-1)", "'''input\r\n1000000000 0 1\r\n'''\r\na,b,c=input().strip().split(' ')\r\na,b,c=int(a),int(b),int(c)\r\nans=-1\r\nif (b>=a and c>=a) or (b!=0 and b%a==0) or (c!=0 and c%a==0):\r\n\tans=b//a+c//a\r\nprint(ans)", "k, a, b = list(map(lambda x: int(x), input().split()))\r\nr = 0\r\naa = b // k\r\nbb = a // k\r\na %= k\r\nb %= k\r\nr += aa + bb\r\naa *= k-1\r\nbb *= k-1\r\nif a <= aa and b <= bb:\r\n print(r)\r\nelse:\r\n print(-1)", "k, a, b = map(int, input().split())\r\n\r\nif (a>0 and a%k==0) or (b>0 and b%k==0) or (a>=k and b>=k):\r\n print(a//k + b//k)\r\nelse:\r\n print(-1)", "k,a,b=map(int,input().split())\r\nprint(-1 if (a<k and b<k) or (max(a,b)%k>0 and min(a,b)<k) else a//k+b//k)", "k,a,b=map(int,input().split())\nif (k > a and k > b):\n print(-1)\nelif (k > a and b % k > 0):\n print(-1)\nelif (k > b and a % k > 0):\n print(-1)\nelse:\n print(a // k + b // k)\n", "k, a, b = [int(x) for x in input().split()]\r\n\r\nsa = 0\r\nif(a >= k):\r\n sa = a // k\r\n\r\nsb = 0\r\nif(b >= k):\r\n sb = b // k\r\n\r\nif(sa == 0 and sb == 0):\r\n print(-1)\r\nelif(sa == 0):\r\n if(b % k == 0):\r\n print(sb)\r\n else:\r\n print(-1)\r\nelif(sb == 0):\r\n if(a % k == 0):\r\n print(sa)\r\n else:\r\n print(-1)\r\nelse:\r\n print(sa + sb)", "k,a,b = [int(i) for i in input().split()]\nt = int(a//k + b//k)\nif a//k == 0 and b%k != 0:\n print(-1)\nelif b//k == 0 and a%k != 0:\n print(-1)\nelse:\n print(t if t != 0 or a+b == 0 else -1)\n\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t \t\t\t\t\t\t", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n\nk, a, b = ri()\n\nan = a//k\nar = a%k\nbn = b//k\nbr = b%k\n\n\nif an == 0 and br or bn == 0 and ar:\n print(-1)\n exit()\nans = an+bn\nif ans:\n print(ans)\nelse:\n print(-1)", "def maxgames(k, a, b):\n if max(a, b) < k:\n return -1\n if min(a, b) < k and max(a, b)%k != 0:\n return -1\n return a//k + b//k\n\nk, a, b = map(int, input().split())\nprint(maxgames(k, a, b))\n", "k, a, b = [int(x) for x in input().split()]\r\nans = a // k + b // k\r\nif ans == 0 or (a % k != 0 and b < k) or (b % k != 0 and a < k):\r\n ans = -1\r\nprint(ans)", "k,a,b=map(int,input().split())\r\nak=a//k\r\nbk=b//k\r\nif a%k<=bk*k and b%k<=ak*k: print(ak+bk)\r\nelse: print(-1)", "k,a,b=map(int,input().split())\r\nif (a<k and b%k!=0) or (b<k and a%k!=0): print(\"-1\")\r\nelse: print(a//k + b//k)", "k,a,b=map(int,input().split())\nprint(a//k+b//k if(a>=k and b>=k)or(a and a%k==0)or(b and b%k==0)else -1)\n", "k,a,b=map(int,input().split())\n\nans=a//k+b//k\nif ans==0:\n\tprint(-1)\nelif (a<k and b%k!=0) or (b<k and a%k!=0):\n\tprint(-1)\nelse:\n\tprint(ans)\n\t", "k, a, b = [int(x) for x in input().split()]\r\n\r\nscore_a = 0\r\nif a >= k:\r\n score_a = a // k\r\n\r\nscore_b = 0\r\nif b >= k:\r\n score_b = b // k\r\n\r\nif score_a == 0 and score_b == 0:\r\n print(-1)\r\nelif score_a == 0:\r\n if b % k == 0:\r\n print(score_b)\r\n else:\r\n print(-1)\r\nelif score_b == 0:\r\n if a % k == 0:\r\n print(score_a)\r\n else:\r\n print(-1)\r\nelse:\r\n print(score_a + score_b)", "reset_score, misha, vanya = map(int, input().split())\r\nprint(-1 if ((misha < reset_score) and (vanya % reset_score) or ((vanya < reset_score) and (misha % reset_score))) else misha // reset_score + vanya // reset_score)" ]

{"inputs": ["11 11 5", "11 2 3", "1 5 9", "2 3 3", "1 1000000000 1000000000", "2 3 5", "1000000000 1000000000 1000000000", "1 0 1", "101 99 97", "1000000000 0 1", "137 137 136", "255 255 255", "1 0 1000000000", "123 456 789", "666666 6666666 666665", "1000000000 999999999 999999999", "100000000 100000001 99999999", "3 2 1000000000", "999999999 1000000000 999999998", "12938621 192872393 102739134", "666666666 1230983 666666666", "123456789 123456789 123456787", "5 6 0", "11 0 12", "2 11 0", "2 1 0", "10 11 12", "11 12 5", "11 12 3", "11 15 4", "2 3 1", "11 12 0", "11 13 2", "11 23 22", "10 21 0", "11 23 1", "11 10 12", "11 1 12", "11 5 12", "11 8 12", "11 12 1", "5 4 6", "10 1 22", "2 3 0", "11 23 2", "2 1000000000 1000000000", "11 0 15", "11 5 0", "11 5 15", "10 0 13", "4 7 0", "10 2 8", "11 5 22", "11 13 0", "2 0 3", "10 10 0", "10 11 10", "3 5 4", "11 22 3", "11 12 10", "10 2 13", "5 6 1", "10 21 5", "10 11 9", "10 17 7", "3 4 1", "4 5 3", "11 3 23", "11 3 12", "2 5 0", "10 21 2", "5 1 6", "10 11 0", "10 9 11", "7 10 5", "5 7 2", "6 5 7", "11 16 2", "11 1000000000 10", "10 2 21", "10 15 1", "5 2 8", "11 10000000 10", "10 1 101", "20 24 2", "11 24 0", "11 17 4", "11 13 1", "10 11 2", "11 23 3", "10 99 0", "6 7 4", "11 1 22", "11 2 13", "2 1 3", "11 6 18", "11 122 4", "11 21 10", "3 2 4", "9 11 2", "11 0 7", "5 9 4", "100 105 5", "11 15 0", "5 6 4", "3 4 2", "2 9 0", "11 13 11", "11 15 5", "11 4 15", "10 1 0", "11 16 8", "10 43 0", "11 13 5", "11 22 0", "5 6 3", "2 1 11", "4 5 1", "11 23 0", "11 4 12", "12 13 1", "10 19 9", "3 7 2", "12 18 0", "11 25 3", "11 23 5", "2 1 5", "2 0 5", "11 24 1", "10 11 4", "2 0 1", "10 0 21", "3 0 7", "18 11 21", "3 7 0", "5 11 0", "11 5 13", "11 9 34", "11 13 9", "10 0 22", "5 1 12", "11 2 12", "11 9 12", "11 24 2", "11 23 6", "11 20 4", "2 5 1", "120 132 133", "11 111 4", "10 7 11", "6 13 0", "5 11 1", "11 5 27", "11 15 3", "11 0 13", "11 13 10", "11 25 5", "4 3 5", "100 199 100", "11 2 22", "10 20 2", "5 5 0", "10 11 1", "11 12 2", "5 16 3", "12 14 1", "10 22 2", "2 4 0", "11 34 7", "6 13 1", "11 0 23", "20 21 19", "11 33 22", "10 4 41", "3 4 0", "11 15 7", "5 0 6", "11 3 22", "2 6 0", "10 11 11", "11 33 0", "4 6 2", "11 76 2", "7 9 4", "10 43 1", "22 25 5", "3 5 2", "11 1 24", "12 25 3", "11 0 22", "4 2 5", "11 13 3", "11 12 9", "11 35 1", "5 3 6", "5 11 4", "12 8 14", "10 12 9", "11 12 13", "11 15 2", "11 23 4", "5 3 11", "6 13 2", "4 1 0", "11 32 10", "2 11 1", "10 11 7", "11 26 0", "100 205 5", "4 0 2", "10 11 8", "11 22 5", "4 0 5", "11 87 22", "4 8 0", "9 8 17", "10 20 0", "10 9 19", "12 2 13", "11 24 5", "10 1 11", "4 0 9", "3 0 1", "11 12 4", "3 8 2", "11 17 10", "6 1 13", "11 25 0", "12 0 13", "10 5 20", "11 89 2", "2 4 1", "10 31 0", "11 34 1", "999 6693 8331", "10 55 1", "11 12 8", "1 9 22", "7572 9186 895", "3 2 11", "2 1 4", "11 10 19", "100 199 99", "2537 8926 1523", "11 0 5", "5 1 11", "12 13 5", "10 12 0", "5 4 7", "12 25 1", "7 9 0", "4 15 0", "5 11 2", "11 58 3", "10 11 5", "10 3 1003", "11 14 0", "11 8 23", "11 22 4", "5 2 0", "11 1 35", "12 25 5", "11 37 4", "20 42 3", "10 12 2", "4 1 5", "5 16 0", "11 13 7", "5 0 3", "11 2 11", "3 2 2000", "3 0 4241", "2 12 11", "10 2 82", "11 0 11", "11 20 20", "5 0 10", "11 1 0", "11 13 13"], "outputs": ["1", "-1", "14", "2", "2000000000", "3", "2", "1", "-1", "-1", "1", "2", "1000000000", "9", "-1", "-1", "-1", "-1", "-1", "21", "1", "1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "4", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "1000000000", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "1", "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", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-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", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "2", "2", "1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "-1", "-1", "-1", "5", "-1", "-1", "-1", "-1", "2", "3", "2", "3", "-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", "-1", "-1", "-1", "-1", "-1", "2", "-1", "9", "2", "-1", "2", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "2", "-1", "2", "-1", "-1", "14", "-1", "-1", "31", "-1", "-1", "2", "-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", "11", "-1", "1", "2", "2", "-1", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

85

d10c82725280342c8fff8d5450f16947

To Add or Not to Add

A piece of paper contains an array of *n* integers *a*1,<=*a*2,<=...,<=*a**n*. Your task is to find a number that occurs the maximum number of times in this array. However, before looking for such number, you are allowed to perform not more than *k* following operations — choose an arbitrary element from the array and add 1 to it. In other words, you are allowed to increase some array element by 1 no more than *k* times (you are allowed to increase the same element of the array multiple times). Your task is to find the maximum number of occurrences of some number in the array after performing no more than *k* allowed operations. If there are several such numbers, your task is to find the minimum one. The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=105; 0<=≤<=*k*<=≤<=109) — the number of elements in the array and the number of operations you are allowed to perform, correspondingly. The third line contains a sequence of *n* integers *a*1,<=*a*2,<=...,<=*a**n* (|*a**i*|<=≤<=109) — the initial array. The numbers in the lines are separated by single spaces. In a single line print two numbers — the maximum number of occurrences of some number in the array after at most *k* allowed operations are performed, and the minimum number that reaches the given maximum. Separate the printed numbers by whitespaces. Sample Input 5 3 6 3 4 0 2 3 4 5 5 5 5 3 3 1 2 2 1 Sample Output 3 4 3 5 4 2

[ "n,k = map(int,input().split())\r\ns = sorted([int(i) for i in input().split()])\r\n\r\n\r\ndef search(n,k,s,x):\r\n if x==1:\r\n return 1,s[0]\r\n z = sum(s[0:x-1])\r\n for i in range(x-1,n):\r\n z+=s[i]\r\n if (z+k)//x>=s[i]:\r\n return x,s[i]\r\n z-=s[i-x+1]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef binary(n,k,s):\r\n maxi = 0\r\n l,r = 0,n+1\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if search(n,k,s,mid):\r\n l = mid\r\n else:\r\n r = mid\r\n return search(n,k,s,l)\r\n\r\nprint(*binary(n,k,s))\r\n" ]

{"inputs": ["5 3\n6 3 4 0 2", "3 4\n5 5 5", "5 3\n3 1 2 2 1", "6 0\n3 2 3 2 3 2", "10 15\n1 1 1 4 4 1 4 4 1 4", "5 100000\n0 5 5 4 3", "20 10\n-12 28 0 -27 16 25 -17 -25 9 -15 -38 19 33 20 -18 22 14 36 33 29", "100 100\n92 -6 67 92 65 -32 67 -31 91 -63 52 -81 -98 -12 48 86 -72 95 -50 66 79 89 -1 0 -33 -27 -23 -71 1 19 14 -61 -39 33 61 -64 91 -99 74 -18 -85 -39 84 74 -23 0 14 25 100 -52 -94 28 18 -81 34 39 -28 0 -25 49 -56 0 57 -2 36 -27 0 -91 -40 12 0 0 73 93 72 -82 47 58 15 0 -71 -58 28 100 -96 12 89 45 97 -79 85 38 -60 0 0 49 32 -30 -68 -93", "100 1000\n-281 191 -27 -286 -497 462 0 889 0 -350 -720 -507 916 0 -648 -942 -140 0 0 -877 66 576 -278 410 -792 -607 713 712 296 -828 -488 -129 508 -106 470 -263 -865 -506 -604 334 591 -40 220 0 0 198 -435 374 -34 254 970 0 549 100 555 326 91 0 -361 -835 472 823 -663 -456 0 91 295 126 383 141 476 609 518 545 840 -451 -93 -16 -453 381 647 334 -454 -708 -711 334 -78 -936 462 728 960 725 -424 649 0 246 -310 42 -559 -980", "1 268900446\n999999987", "10 93519867\n-316 313 -318 -307 -305 314 -302 -304 -320 -313", "100 415583658\n-90 -91 91 80 94 99 86 -89 89 98 93 -80 99 84 99 90 90 88 85 80 80 -99 84 84 -86 83 83 87 98 97 85 82 81 98 82 80 84 92 -93 98 82 93 90 85 91 90 85 91 -89 88 -84 -85 90 89 89 -93 88 -83 96 88 -86 95 80 92 -92 87 98 83 95 91 83 97 84 82 93 88 96 97 -85 -86 82 98 89 -84 98 81 83 -88 87 97 87 88 93 -99 88 80 90 97 95 90", "4 100\n1 1 1 1000000000", "5 1000\n1 1 1 1000000000 998756787", "5 1000000000\n0 1 2 999999999 999999999", "4 1000000000\n0 0 0 1000000000", "1 0\n0", "7 999999990\n999999999 999999999 999999999 3 4 2 1", "52 1000000000\n-1000000000 1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 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 1000000000\n2 2 2 2 2 2 2 2 2 1000000000"], "outputs": ["3 4", "3 5", "4 2", "3 2", "10 4", "5 5", "4 33", "17 0", "21 0", "1 999999987", "10 314", "100 99", "3 1", "3 1", "3 2", "3 0", "1 0", "4 4", "51 0", "9 2"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d111139ff1607a1c8f702d05c3344b7a

Vasya and Polynomial

Vasya is studying in the last class of school and soon he will take exams. He decided to study polynomials. Polynomial is a function *P*(*x*)<==<=*a*0<=+<=*a*1*x*1<=+<=...<=+<=*a**n**x**n*. Numbers *a**i* are called coefficients of a polynomial, non-negative integer *n* is called a degree of a polynomial. Vasya has made a bet with his friends that he can solve any problem with polynomials. They suggested him the problem: "Determine how many polynomials *P*(*x*) exist with integer non-negative coefficients so that , and , where and *b* are given positive integers"? Vasya does not like losing bets, but he has no idea how to solve this task, so please help him to solve the problem. The input contains three integer positive numbers no greater than 1018. If there is an infinite number of such polynomials, then print "inf" without quotes, otherwise print the reminder of an answer modulo 109<=+<=7. Sample Input 2 2 2 2 3 3 Sample Output 2 1

[ "t,a,b=map(int,input().split())\r\nif t==2 and a==3 and b>10000: res=0\r\nelif a==t: res=('inf' if a==1 else 2) if a==b else 0\r\nelse: res=0 if (a-b)%(t-a) else (1 if t != b else 0)\r\nprint(res)" ]

{"inputs": ["2 2 2", "2 3 3", "1 1 1", "3 5 10", "2 3 1000000000000000000", "7 8 9", "8 10 11", "5 30 930", "3 3 3", "1 5 5", "1 2 2", "1 2 5", "1 2 4", "1000000000000000000 1000000000000000000 1000000000000000000", "1 125 15625", "1000000000000 1000000000000000 1000000000000000000", "5 2 2", "1 3 6561", "3 6 5", "1 5 625", "3 2 2", "1 2 65536", "1 12 1728", "110 115 114", "1 2 128", "110 1000 998", "5 5 4", "2 2 10", "1 1000000000000000000 1000000000000000000", "2 999999999999999999 1000000000000000000", "1 4 288230376151711744", "1 999999999 1000000000000000000", "12365 1 1", "135645 1 365333453", "1 1 12345678901234567", "563236 135645 356563", "6 1 1", "1 7 1", "1 10 1000000000000000000", "1 10 999999999999999999"], "outputs": ["2", "1", "inf", "0", "0", "1", "0", "1", "2", "1", "1", "1", "1", "2", "1", "1", "1", "1", "0", "1", "1", "1", "1", "0", "1", "0", "0", "0", "1", "0", "1", "0", "1", "0", "0", "0", "1", "0", "1", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d11a14b8d0336ac43a0a902e5921aa27

BerSU Ball

The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! *n* boys and *m* girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves. We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one. For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from *n* boys and *m* girls. The first line contains an integer *n* (1<=≤<=*n*<=≤<=100) — the number of boys. The second line contains sequence *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=100), where *a**i* is the *i*-th boy's dancing skill. Similarly, the third line contains an integer *m* (1<=≤<=*m*<=≤<=100) — the number of girls. The fourth line contains sequence *b*1,<=*b*2,<=...,<=*b**m* (1<=≤<=*b**j*<=≤<=100), where *b**j* is the *j*-th girl's dancing skill. Print a single number — the required maximum possible number of pairs. Sample Input 4 1 4 6 2 5 5 1 5 7 9 4 1 2 3 4 4 10 11 12 13 5 1 1 1 1 1 3 1 2 3 Sample Output 3 0 2

[ "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\narr1=sorted(arr1)\r\narr2=sorted(arr2)\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(arr1[i]==arr2[j] or arr1[i]+1==arr2[j] or arr1[i]-1==arr2[j]):\r\n ans=ans+1 \r\n arr2[j]=-1\r\n break\r\nprint(ans)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nm = int(input())\r\ng = list(map(int, input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\ni = 0\r\nj = 0\r\ncnt = 0\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) <= 1:\r\n cnt+=1\r\n i += 1\r\n j += 1\r\n elif b[i] > g[j]:\r\n j += 1\r\n else:\r\n # b[i] < g[j] :\r\n i += 1\r\nprint(cnt)", "import bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nb = sorted(getints())\r\nm = int(input())\r\ng = sorted(getints())\r\n\r\nans = 0\r\nj = 0\r\nfor i in b:\r\n for j in g:\r\n if abs(i-j) <= 1:\r\n ans += 1\r\n g.remove(j)\r\n break\r\nprint(ans)", "n=int(input())\r\narr1=list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\narr1.sort()\r\narr2.sort()\r\ni=0\r\nj=0\r\nans=0\r\nwhile i <n and j < m:\r\n if abs(arr1[i]-arr2[j])<=1:\r\n ans+=1\r\n i+=1\r\n j+=1\r\n elif arr1[i]>arr2[j]:\r\n j+=1\r\n else:\r\n i+=1\r\nprint(ans)", "n = int(input())\r\nmy_list1 = sorted([int(i) for i in input().split()])\r\n\r\nm = int(input())\r\nmy_list2 = sorted([int(i) for i in input().split()])\r\n\r\nresult = 0\r\n\r\nfor j in range(len(my_list1)):\r\n for i in range(len(my_list2)):\r\n if abs(my_list1[j] - my_list2[i]) <= 1:\r\n result += 1\r\n my_list1[j] = - 10\r\n my_list2[i] = - 5\r\n break\r\n\r\nprint(result)", "n = int(input())\r\nli1 = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nli2 = sorted(list(map(int, input().split())))\r\ncounter = 0\r\ni = 0\r\nwhile i < n and li1 and li2:\r\n if (li1[i] - 1) in li2:\r\n counter += 1\r\n li2.remove(li1[i] - 1)\r\n li1.remove(li1[i])\r\n elif li1[i] in li2:\r\n counter += 1\r\n li2.remove(li1[i])\r\n li1.remove(li1[i])\r\n\r\n elif (li1[i] + 1) in li2:\r\n counter += 1\r\n li2.remove(li1[i] + 1)\r\n li1.remove(li1[i])\r\n\r\n else:\r\n li1.remove(li1[i])\r\nprint(counter)", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nif n<m:\r\n base = boys\r\n other = girls\r\nelse:\r\n base = girls\r\n other = boys\r\nans = 0\r\nbase.sort()\r\nother.sort()\r\nfor i in range(len(base)):\r\n for j in range(len(other)):\r\n if abs(base[i] - other[j]) <=1:\r\n ans += 1\r\n del other[j]\r\n break\r\nprint(ans)", "import heapq\r\n\r\nn_boys = int(input())\r\nboys = list(map(int, input().split()))\r\nb_girls = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys = [-1*i for i in boys]\r\ngirls = [-1*i for i in girls]\r\n\r\nheapq.heapify(boys)\r\nheapq.heapify(girls)\r\n\r\nans = 0\r\n\r\nwhile boys and girls:\r\n\r\n diff = abs(boys[0] - girls[0])\r\n if diff <= 1:\r\n heapq.heappop(boys)\r\n heapq.heappop(girls)\r\n ans += 1\r\n elif -1* boys[0] > -1* girls[0]:\r\n heapq.heappop(boys)\r\n else:\r\n heapq.heappop(girls)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "a = int(input())\r\nsq = list(map(int,input().split()))\r\nb = int(input())\r\nsw = list(map(int,input().split()))\r\nsq.sort()\r\nsw.sort()\r\ni = 0\r\nu = 0\r\ny = 0\r\nwhile i < a and u < b:\r\n if abs(sq[i] - sw[u]) <= 1:\r\n y += 1\r\n i += 1\r\n u += 1\r\n elif sq[i] < sw[u]:\r\n i += 1\r\n else:\r\n u += 1\r\nprint(y)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nboys = list(map(int, sys.stdin.readline().split()))\r\nboys.sort()\r\n\r\nm = int(sys.stdin.readline())\r\ngirls = list(map(int, sys.stdin.readline().split()))\r\ngirls.sort()\r\n\r\nsum = 0\r\nif n <= m:\r\n index = 0\r\n for i in range(n):\r\n for j in range(index, m):\r\n if abs(boys[i]-girls[j]) <= 1:\r\n sum += 1\r\n index = j+1\r\n break\r\nelse:\r\n index = 0\r\n for i in range(m):\r\n for j in range(index, n):\r\n if abs(boys[j]-girls[i]) <= 1:\r\n sum += 1\r\n index = j+1\r\n break\r\nprint(sum)\r\n", "m = int(input())\r\ns1 = list(map(int, input().split(' ')))\r\nn = int(input())\r\ns2 = list(map(int, input().split(' ')))\r\n\r\ns1.sort()\r\ns2.sort()\r\n\r\nc = 0\r\nll = 0\r\n\r\nfor i in range(m):\r\n for j in range(ll,n):\r\n if abs(s1[i]-s2[j]) <= 1:\r\n c+=1\r\n ll = j + 1\r\n break\r\n\r\nprint(c)\r\n \r\n", "n = int(input())\r\nb = list(map(int,input().split()))\r\nm = int(input())\r\ng = list(map(int,input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\ni,j=0,0\r\nc=0\r\nwhile(i<n and j<m ):\r\n if(abs(b[i]-g[j])<=1):\r\n c+=1\r\n j+=1\r\n i+=1\r\n else:\r\n if(b[i]<g[j]):\r\n i+=1\r\n else:\r\n j+=1\r\nprint(c)\r\n", "def freq(arr):\r\n sum = 0\r\n dict = {}\r\n for i in arr:\r\n if i not in dict:\r\n dict[i] = 1\r\n else:\r\n dict[i] += 1\r\n return dict\r\ndef f(L,M):\r\n X=freq(L)\r\n Y=sorted(M)\r\n ans=0\r\n for j in Y:\r\n if j-1 in X and X[j-1]>0:\r\n X[j-1]=X[j-1]-1\r\n ans+=1\r\n elif j in X and X[j]>0:\r\n X[j]=X[j]-1\r\n ans+=1\r\n elif j+1 in X and X[j+1]>0:\r\n X[j+1]=X[j+1]-1\r\n ans+=1\r\n return ans\r\nn=input()\r\nL=list(map(int,input().split()))\r\nm=input()\r\nM=list(map(int,input().split()))\r\nif len(L)>len(M):\r\n print(f(L,M))\r\nelse:\r\n print(f(M,L))\r\n", "n = int(input())\r\na = map(int, input().split())\r\nm = int(input())\r\nb = map(int, input().split())\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\n\r\nk = 0\r\ni = j = 0\r\nwhile i<n and j< m:\r\n if abs(a[i] - b[j]) <= 1:\r\n k += 1\r\n i += 1\r\n j += 1\r\n else:\r\n if a[i] > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(k)", "n = input()\r\na = sorted(map(int, input().split()))\r\nm = input()\r\nb = sorted(map(int, input().split()))\r\npairs = 0\r\nia, ib = len(a) - 1, len(b) - 1\r\nwhile ia >= 0 and ib >= 0:\r\n if abs(a[ia] - b[ib]) <= 1:\r\n ia -= 1\r\n ib -= 1\r\n pairs += 1\r\n elif b[ib] > a[ia]:\r\n ib -= 1\r\n else:\r\n ia -= 1\r\nprint(pairs)\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nans = 0\r\npointerboys = 0\r\npointergirls = 0\r\nwhile n > pointerboys and m > pointergirls:\r\n for i in range(pointergirls,m):\r\n if abs(boys[pointerboys]-girls[i]) <= 1:\r\n ans += 1\r\n pointergirls = i+1\r\n break\r\n pointerboys += 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=int(input())\r\nlist2=list(map(int,input().split()))\r\ncount=0\r\nk=0\r\nl=0\r\nlist1.sort()\r\nlist2.sort()\r\nwhile k<n and l<m:\r\n if abs(list1[k] - list2[l]) <= 1:\r\n count += 1\r\n k += 1\r\n l += 1\r\n elif list1[k] < list2[l]:\r\n k += 1\r\n else:\r\n l += 1\r\nprint(count)\r\n", "a, a1, b, b1, c, d, n= int(input()), sorted(list(map(int, input().split()))), int(input()), sorted(list(map(int, input().split()))), 0, 0, 0\r\nwhile c < a and d < b:\r\n if abs(a1[c]-b1[d]) <= 1: n += 1; c += 1; d += 1\r\n else:\r\n if a1[c] < b1[d]: c += 1\r\n else:d += 1\r\nprint(n)", "n = int(input())\r\ns1 = [int(el) for el in input().split()]\r\nm = int(input())\r\ns2 = [int(el) for el in input().split()]\r\ns1.sort(reverse=True)\r\ns2.sort(reverse=True)\r\nc = 0\r\nwhile len(s1) > 0 and len(s2) > 0:\r\n if abs(s1[-1] - s2[-1]) <= 1:\r\n c += 1\r\n s1.pop()\r\n s2.pop()\r\n else:\r\n if s1[-1] < s2[-1]:\r\n s1.pop()\r\n else:\r\n s2.pop()\r\nprint(c)", "n1 = int(input())\r\nal = sorted(list(map(int, input().split())))\r\nn2 = int(input())\r\nar = sorted(list(map(int, input().split())))\r\nlo = up = ans = 0\r\n\r\ni = j = 0\r\nwhile i < n1 and j < n2:\r\n diff = al[i] - ar[j]\r\n if diff == 0 or diff == 1 or diff == -1:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n elif diff < 0:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter(a)\r\ncc=Counter(b)\r\na=sorted(set(a))\r\nb=sorted(set(b))\r\nsm=0\r\nfor i in range(5):\r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if(abs(a[i]-b[j])<=1):\r\n if(c[a[i]]==cc[b[j]]):\r\n sm+=c[a[i]]\r\n c[a[i]]=0\r\n cc[b[j]]=0\r\n elif(c[a[i]]>cc[b[j]]):\r\n c[a[i]]-=cc[b[j]]\r\n sm+=cc[b[j]]\r\n cc[b[j]]=0\r\n\r\n else:\r\n cc[b[j]] -= c[a[i]]\r\n sm+=c[a[i]]\r\n c[a[i]] = 0\r\nprint(sm)", "n = int(input())\r\nboys = list(map(int, input().split()))\r\n\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nk=0\r\nc=0\r\nfor i in range(n):\r\n for j in range(k, m):\r\n if abs(boys[i]-girls[j])<2:\r\n c+=1\r\n k=j+1\r\n break\r\nprint(c)\r\n", "# ELO 1200\r\nimport sys\r\n\r\n\r\ndef check_skills(skill1, skill2, pairs, pair_index):\r\n if (pair_index not in pairs) and (skill1 in (skill2, skill2 - 1, skill2 + 1)):\r\n return True\r\n return False\r\n\r\n\r\ninput_file = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\ninput_file = input_file.split()\r\n\r\nnum_boys = int(input_file[0])\r\nboy_skills = []\r\ndel input_file[0]\r\nfor i in range(num_boys):\r\n boy_skills.append(int(input_file[i]))\r\ndel input_file[0:num_boys]\r\n\r\nnum_girls = int(input_file[0])\r\ngirl_skills = []\r\ndel input_file[0]\r\nfor i in range(num_girls):\r\n girl_skills.append(int(input_file[i]))\r\ndel input_file[0:num_girls]\r\n\r\nboy_skills.sort()\r\ngirl_skills.sort()\r\n\r\nboy_index = 0\r\ngirl_index = 0\r\nnum_pairs = 0\r\nwhile boy_index < num_boys and girl_index < num_girls:\r\n if abs(boy_skills[boy_index] - girl_skills[girl_index]) < 2:\r\n num_pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boy_skills[boy_index] < girl_skills[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\nprint(num_pairs)\r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\n\r\ncounter = 0\r\ni, j = 0, 0\r\nwhile i < len(a):\r\n while j < len(b):\r\n if abs(b[j] - a[i]) <= 1:\r\n del a[i]\r\n del b[j]\r\n counter += 1\r\n i -= 1\r\n break\r\n j += 1\r\n i += 1\r\n j = 0\r\nprint(counter)\r\n", "from sys import stdin\n\nstream = None\ntry:\n stream = open('../1200/file.txt', 'r')\nexcept:\n stream = stdin\n\nn = int(stream.readline())\nmen = [int(i) for i in stream.readline().split()]\nm = int(stream.readline())\nwomen = [int(i) for i in stream.readline().split()]\n\nmen.sort()\nwomen.sort()\n\ni = 0\nj = 0\ncount = 0\nwhile i < len(men) and j < len(women):\n delta = men[i] - women[j]\n if abs(delta) < 2:\n count += 1\n i += 1\n j += 1\n else:\n if delta < 0:\n i += 1\n else:\n j += 1\nprint(count)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nb.sort()\r\nk = 0\r\nfor i in a:\r\n for j in b:\r\n if(abs(i-j)<2):\r\n b.remove(j)\r\n k += 1\r\n break \r\nprint(k)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\na.sort(reverse = True)\nb.sort(reverse = True)\nans = 0\nfor i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) <= 1:\n ans += 1\n b[j] = 100000000000000000000000000000000\n break\nprint(ans)", "def solve():\r\n n = int(input())\r\n boys = list(map(int, input().split()))\r\n m = int(input())\r\n girls = list(map(int, input().split()))\r\n boys.sort()\r\n girls.sort()\r\n l = r = c = 0\r\n\r\n while l < n and r < m:\r\n if abs(boys[l]-girls[r]) <= 1:\r\n l += 1\r\n r += 1\r\n c += 1\r\n elif boys[l] < girls[r]:\r\n l += 1\r\n else:\r\n r += 1\r\n\r\n print(c)\r\n\r\nif \"__main__\" == __name__:\r\n solve()", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nn=int(input())\r\nf=list(map(int,input().split(\" \")))\r\nm=int(input())\r\ns=list(map(int,input().split(\" \")))\r\nf.sort()\r\ns.sort()\r\nfi,si=0,0\r\nc=0\r\n#print(f,s)\r\nwhile(fi<n and si<m):\r\n #print(fi,si, f[fi],s[si])\r\n \r\n if(abs(f[fi]-s[si]==0) or abs(f[fi]-s[si])==1):\r\n c+=1\r\n fi+=1 \r\n si+=1\r\n \r\n elif(f[fi]-s[si]>1):\r\n si+=1 \r\n \r\n elif(f[fi]-s[si]<0):\r\n fi+=1 \r\n \r\n \r\n \r\n\r\nprint(c)\r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=x+[10**18]\r\nm=int(input())\r\ny=list(map(int,input().split()))\r\ny=y+[10**18]\r\nx.sort()\r\ny.sort()\r\ni=0\r\nj=0\r\ncounter=0\r\nwhile (i<n or j<m):\r\n if(abs(x[i]-y[j])<2):\r\n # print(x[i],y[j])\r\n j+=1\r\n i+=1\r\n counter=counter+1\r\n elif(x[i]>y[j]):\r\n j+=1\r\n elif(x[i]<y[j]):\r\n i+=1\r\n # print(i, j,counter)\r\nprint(counter)\r\n\r\n\r\n", "i=int(input())\r\nl1=list(map(int,input().split()))\r\ni=int(input())\r\nl2=list(map(int,input().split()))\r\nl1.sort()\r\nl2.sort()\r\nl,r=0,0\r\nsol=0\r\nwhile l<len(l1) and r<len(l2) :\r\n if l1[l]>l2[r] :\r\n if l1[l]==l2[r]+1 :\r\n sol+=1\r\n l+=1\r\n r+=1\r\n elif l1[l]<l2[r] :\r\n if l2[r]==l1[l]+1 :\r\n sol+=1\r\n r+=1\r\n l+=1\r\n else :\r\n sol+=1\r\n l+=1\r\n r+=1\r\n\r\nprint(sol)", "def pairing(a, b, n, m):\r\n count = 0\r\n k = 0\r\n for i in range(n):\r\n for j in range(k, m):\r\n if a[i] - b[j] <= 1 and a[i] - b[j] >= -1:\r\n count+= 1\r\n k = j + 1\r\n break\r\n print(count)\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\nm = int(input())\r\ng = list(map(int, input().split()))\r\nb.sort()\r\ng.sort()\r\n\r\nif n < m:\r\n pairing(b, g, n, m)\r\nelse:\r\n pairing(g, b, m, n)", "boys_num = int(input())\r\nboys = [int(i) for i in input().split()]\r\ngirls_num = int(input())\r\ngirls = [int(i) for i in input().split()]\r\nboys = sorted(boys)\r\ngirls = sorted(girls)\r\nb_index = g_index = output = 0\r\n\r\nwhile b_index != boys_num and g_index != girls_num:\r\n if abs(boys[b_index] - girls[g_index]) <= 1:\r\n output += 1\r\n b_index += 1\r\n g_index += 1\r\n elif boys[b_index] > girls[g_index]:\r\n g_index += 1\r\n elif girls[g_index] > boys[b_index]:\r\n b_index += 1\r\n\r\nprint(output)\r\n", "n=int(input())\r\nboy=sorted([int(a) for a in input().split()])\r\nm=int(input())\r\ngirl=sorted([int(b) for b in input().split()])\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if boy[i]!=\"no\" and girl[j] !=\"no\":\r\n if abs(girl[j]-boy[i])<=1:\r\n ans+=1\r\n boy[i],girl[j]=\"no\",\"no\"\r\nprint(ans)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\r\nimport math\r\n\r\nif __name__ == '__main__':\r\n _ = int(input().strip())\r\n b = [int(x) for x in input().strip().split(\" \")]\r\n _ = int(input().strip())\r\n g = [int(x) for x in input().strip().split(\" \")]\r\n b.sort()\r\n g.sort()\r\n\r\n i = 0\r\n j = 0\r\n r = 0\r\n while i < len(b) and j < len(g):\r\n if abs(b[i] - g[j]) <= 1:\r\n r += 1\r\n i += 1\r\n j += 1\r\n elif b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n print(r)", "\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nm=int(input())\r\ng=list(map(int,input().split()))\r\nans=0\r\nb.sort()\r\ng.sort()\r\ni=0\r\nj=0\r\n\r\nwhile(i<len(b) and j<len(g)):\r\n if abs(b[i]-g[j])<=1:\r\n i+=1\r\n j+=1\r\n ans+=1\r\n else:\r\n if b[i]<g[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(ans)", "n = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ng = sorted(list(map(int, input().split())))\r\npair = 0\r\n\r\nfor boy in b:\r\n for girl in g:\r\n if boy == girl:\r\n pair += 1\r\n g.remove(boy)\r\n break\r\n \r\n elif (boy + 1) == girl:\r\n pair += 1\r\n g.remove(boy+1)\r\n break\r\n \r\n elif (boy - 1) == girl:\r\n pair += 1\r\n g.remove(boy-1)\r\n break\r\n \r\nprint(pair)", "while True:\r\n try:\r\n n=int(input())\r\n li1=input().split()\r\n for i in range(0,len(li1)):\r\n li1[i]=int(li1[i])\r\n m=int(input())\r\n li2=input().split()\r\n for i in range(0,len(li2)):\r\n li2[i]=int(li2[i])\r\n li1=sorted(li1)\r\n li2=sorted(li2)\r\n x=0\r\n y=0\r\n total=0\r\n while x<len(li1) and y<len(li2):\r\n if abs(li1[x]-li2[y])<=1:\r\n total+=1\r\n x+=1\r\n y+=1\r\n else:\r\n if li1[x]>li2[y]:\r\n y+=1\r\n else:\r\n x+=1\r\n print(total)\r\n except EOFError:\r\n break\r\n", "def solve(n, m, girls, boys):\r\n q = 1000\r\n cnt = 0\r\n girls.sort()\r\n boys.sort()\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n if abs(boys[i] - girls[j]) <= 1:\r\n cnt += 1\r\n girls[j] = q\r\n break\r\n\r\n return cnt\r\n\r\nn = int(input())\r\ngirls = list(map(int, input().split()))\r\nm = int(input())\r\nboys = list(map(int, input().split()))\r\nprint(solve(n, m, girls, boys))\r\n", "n = map(int, input())\nman = list(map(int, input().split()))\n\nn = map(int, input())\nwoman = list(map(int, input().split()))\n\nman.sort()\nwoman.sort()\n\nm = 0\nw = 0\nres = 0\nwhile m < len(man) and w < len(woman):\n if abs(man[m] - woman[w]) <= 1:\n m += 1\n w += 1\n res += 1\n elif man[m] < woman[w]:\n m += 1\n else:\n w += 1\n \nprint(res)\n \t\t\t \t\t\t \t \t\t \t \t \t\t", "int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nint(input())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nh=0\r\nfor i in range(len(l)):\r\n\tfor j in range(len(c)):\r\n\t\tif l[i]==c[j] or abs(l[i]-c[j])==1:\r\n\t\t\th+=1\r\n\t\t\tc.remove(c[j])\r\n\t\t\tbreak\r\nprint(h)", "\"\"\"\nel tiempo de ejecución del algoritmo es dominado por el ordenamiento por inserción y se estima en O(n^2) en el peor caso.\n\nEste algoritmo toma dos listas de números, \"w\" y \"x\", las ordena utilizando el algoritmo de ordenamiento por inserción, y luego encuentra la cantidad de pares donde la diferencia entre los números en un par sea igual o menor a 1. Luego, imprime la cantidad de pares encontrados.\n\"\"\"\n\nimport sys\n\ndef insertion_sort(arr):\n\n for i in range(1, len(arr)):\n\n key = arr[i]\n j = i - 1\n\n while j>= 0 and arr[j]> key:\n\n arr[j+1] = arr[j]\n j -= 1\n\n arr[j+1] = key\n return arr\n\ndef main():\n\n t = int(sys.stdin.readline())\n w = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n x = list(map(int, sys.stdin.readline().split()))\n insertion_sort(w)\n insertion_sort(x)\n\n pares = 0\n\n for i in range(t):\n\n for j in range(m):\n\n if abs(w[i] - x[j]) < 2:\n\n x[j] = 9000000\n pares += 1\n\n break\n\n print(pares)\n\nmain()\n\n \t \t \t\t \t \t\t\t\t \t\t \t\t \t\t", "a = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nc = int(input())\r\nd = sorted(list(map(int, input().split())))\r\ncount = 0\r\nfor i in range(0, len(b)):\r\n for j in range(0, len(d)):\r\n if -1 <= b[i] - d[j] <= 1:\r\n count = count + 1\r\n d.remove(d[j])\r\n break\r\n\r\nprint(count)", "def Main(n, m, a, b):\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) <= 1:\r\n ans += 1\r\n a[i] = 1000\r\n b[j] = 1000\r\n break\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\n\r\nif n > m:\r\n print(Main(n, m, a, b))\r\nelse:\r\n print(Main(m, n, b, a))\r\n", "w = int(input())\r\nx = sorted(map(int, input().split()))\r\ny = int(input())\r\nz = sorted(map(int, input().split()))\r\nm = 0\r\nn = 0\r\ns = 0\r\nwhile m < w and n < y:\r\n if abs(x[m] - z[n]) <= 1:\r\n s += 1\r\n m += 1\r\n n += 1\r\n elif x[m] > z[n]:\r\n n += 1\r\n elif x[m] < z[n]:\r\n m += 1\r\nprint(s)", "n=int(input())\nb=list(map(int,input().split()))\nb.sort()\nm=int(input())\ng=list(map(int,input().split()))\ng.sort()\n\ni=0\nj=0\ncount=0\nwhile i<n and j<m:\n if abs(b[i]-g[j])<=1:\n i+=1\n j+=1\n count+=1\n elif b[i]>g[j]:\n j+=1\n else:\n i+=1\nprint(count)", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int,input().split())))\r\n\r\nap = bp = 0\r\ncount = 0\r\n\r\nwhile ap<n and bp<m:\r\n if a[ap]==b[bp] or (abs(a[ap]-b[bp])==1):\r\n count += 1\r\n ap += 1\r\n bp += 1\r\n else:\r\n if a[ap]<b[bp]:\r\n ap += 1\r\n else:\r\n bp += 1\r\n\r\nprint(count)", "\r\ndef maximum_numbeb_of_pairs(A, B):\r\n res = 0\r\n n, m = len(A), len(B)\r\n A.sort()\r\n B.sort()\r\n \r\n i, j = 0, 0\r\n while i < n and j < m:\r\n if abs(A[i] - B[j]) <= 1:\r\n res += 1\r\n i += 1\r\n j += 1\r\n elif A[i] > B[j]:\r\n j += 1\r\n elif A[i] < B[j]:\r\n i += 1\r\n \r\n return res\r\n \r\n \r\n \r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n m = int(input())\r\n b = [int(i) for i in input().split()]\r\n \r\n print(maximum_numbeb_of_pairs(a, b))\r\n", "\r\ndef diff(x, y):\r\n if x == y or x == y + 1 or x == y - 1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef check(large, small):\r\n count = 0\r\n for x in large:\r\n for y in small:\r\n if diff(x,y) == True:\r\n count += 1\r\n small.remove(y)\r\n break\r\n return count\r\n\r\nn = int(input())\r\nmale = [int(x) for x in input().split()]\r\nm = int(input())\r\nfemale = [int(x) for x in input().split()]\r\n\r\nmale.sort()\r\nfemale.sort()\r\nkq = check(male,female)\r\nprint(kq)\r\n", "I= lambda: sorted(map(int,input().split()))\r\nn=I()[0]; a=I(); m=I()[0]; b=I()\r\nc=i=j=0;\r\nwhile i<n and j<m: \r\n if abs(a[i]-b[j])<2: c+=1;i+=1;j+=1\r\n elif a[i]>b[j]: j+=1 \r\n else: i+=1\r\nprint(c)", "n = int(input())\nniños = sorted(map(int, input().split()))\nm = int(input())\nniñas = sorted(map(int, input().split()))\n\ni, j, par = 0, 0, 0\nwhile i < n and j < m:\n if abs(niños[i] - niñas[j]) <= 1:\n par += 1\n i += 1\n j += 1\n elif niños[i] < niñas[j]:\n i += 1\n else:\n j += 1\n\nprint(par)\n \t \t\t\t \t \t \t\t\t \t \t \t\t\t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\nprint(count)\r\n", "aa=int(input())\na=list(map(int,input().split()))\nbb=int(input())\nb=list(map(int,input().split()))\na.sort()\nb.sort()\ncount=0\nfor i in range(aa):\n\tfor j in range(bb):\n\t\tif abs(a[i]-b[j])<=1:\n\t\t\tcount+=1\n\t\t\tb[j]=float(\"inf\")\n\t\t\tbreak\nprint(count)\n\t\t\t", "n = int(input())\nl_b = list(map(int, input().split()))\nl_b.sort()\n\nm = int(input())\nl_g = list(map(int, input().split()))\nl_g.sort()\n\nb_i = 0\ng_i = 0\nt = 0\n\nwhile b_i < len(l_b) and g_i < len(l_g):\n if abs(l_b[b_i] - l_g[g_i]) <= 1:\n t += 1\n b_i += 1\n g_i += 1\n else:\n if l_b[b_i] < l_g[g_i]:\n b_i += 1\n else:\n g_i += 1\n\nprint(t)", "n = input()\r\na = sorted(map(int, input().split()))\r\nm = input()\r\nb = sorted(map(int, input().split()))\r\nres = 0\r\nwhile a and b:\r\n if abs(a[-1] - b[-1]) <= 1:\r\n res += 1\r\n a.pop()\r\n b.pop()\r\n elif a[-1] > b[-1]:\r\n a.pop()\r\n else:\r\n b.pop()\r\nprint(res)\r\n", "nb=int(input())\r\nb = list(map(int,input().split()))\r\nng=int(input())\r\ng = list(map(int,input().split()))\r\nb.sort()\r\ng.sort()\r\nbi=0\r\ngi=0\r\ncount=0\r\nwhile bi < len(b) and gi < len(g):\r\n if abs(b[bi]-g[gi]) <=1:\r\n count+=1\r\n bi+=1\r\n gi+=1\r\n else:\r\n if b[bi]>g[gi]:\r\n gi+=1\r\n else:\r\n bi+=1\r\nprint(count)\r\n", "len_girls = int(input())\ngirls = [int(x) for x in input().split()]\nlen_boys = int(input())\nboys = [int(x) for x in input().split()]\n\ngirls.sort()\nboys.sort()\n\nb = -1\ng = -1\nmax_ = 0\n\nwhile g >= -len_girls and b >= -len_boys:\n diff = boys[b] - girls[g]\n if abs(diff) <=1:\n max_ +=1\n g-=1\n b-=1\n elif diff < 0:\n g-=1\n elif diff > 1:\n b-=1\n\n\nprint(max_)\n\t\t \t\t \t\t \t\t\t \t\t\t\t \t \t \t \t\t", "n=int(input())\r\narr1=[int(x) for x in input().split()]\r\nm=int(input())\r\narr2=[int(x) for x in input().split()]\r\narr1.sort()\r\narr2.sort()\r\ni=0\r\nj=0\r\nc=0\r\nwhile i<n and j<m: \r\n if abs(arr1[i]-arr2[j])<=1:\r\n c+=1\r\n i+=1 \r\n j+=1 \r\n else:\r\n if arr1[i]<arr2[j]:\r\n i+=1 \r\n else:\r\n j+=1 \r\nprint(c)\r\n \r\n \r\n ", "n = int(input())\nmen = list(map(int, input().split()))\n\nm = int(input())\nwomen = list(map(int, input().split()))\n\nmen.sort()\nwomen.sort()\n\ni = 0\nj = 0\n\npairs = 0\nwhile i < n and j < m:\n if abs(men[i] - women[j]) < 2:\n pairs += 1\n i += 1\n j += 1\n elif men[i] < women[j]:\n i += 1\n else:\n j += 1\n \nprint(pairs)\n\n\n\t \t \t \t\t \t \t\t\t\t \t\t\t \t \t \t \t", "al = int(input())\r\na = sorted(list(map(int, (input().split()))))\r\nbl = int(input())\r\nb = sorted(list(map(int, (input().split()))))\r\ni = 0\r\nb.reverse()\r\na.reverse()\r\nwhile len(a) > 0 and len(b) > 0:\r\n if -1 <= a[0] - b[0] <= 1:\r\n i += 1\r\n a.remove(a[0])\r\n b.remove(b[0])\r\n else:\r\n a.remove(a[0]) if a > b else b.remove(b[0])\r\nprint(i)\r\n", "n = int(input())\r\nboys = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ngirls = sorted(list(map(int, input().split())))\r\ncurGirl = 0\r\ncurBoy = 0\r\nans = 0\r\nwhile curGirl < m and curBoy<n:\r\n if abs(girls[curGirl]-boys[curBoy])<=1:\r\n ans+=1\r\n curGirl+=1\r\n curBoy+=1\r\n elif girls[curGirl]-boys[curBoy]>1:\r\n curBoy+=1\r\n else:\r\n curGirl+=1\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\na = list(sorted(a))\r\nb = list(sorted(b))\r\ncount = 0\r\nindj = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if j not in indj and -1 < abs(a[i] - b[j]) < 2:\r\n count += 1\r\n indj.append(j)\r\n break\r\nprint(count)", "def hungarian_algorithm(graph):\r\n def dfs(node):\r\n if node in visited:\r\n return False\r\n visited.add(node)\r\n\r\n for neighbor in graph[node]:\r\n if neighbor not in matching or dfs(matching[neighbor]):\r\n matching[neighbor] = node\r\n return True\r\n return False\r\n\r\n matching = {}\r\n for node in graph:\r\n visited = set()\r\n dfs(node)\r\n\r\n return matching\r\n\r\nn = int(input())\r\nn_nums = list(map(int, input().strip().split()))\r\nn_nums.sort()\r\n\r\nm = int(input())\r\nm_nums = list(map(int, input().strip().split()))\r\nm_nums.sort()\r\n\r\nfrom collections import defaultdict\r\ngraph = defaultdict(list)\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(n_nums[i] - m_nums[j]) <= 1:\r\n graph[i].append(j)\r\n\r\n\r\nmatching = hungarian_algorithm(graph)\r\nprint(len(matching))\r\n\r\n# for key, value in matching.items():\r\n# print(f\"{value} matched with {key}\")\r\n", "p=lambda:sorted(map(int,input().split()));n=p()[0];a=p();m=p()[0];b=p();\r\ni,j,k=0,0,0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\r\n elif a[i]<b[j]:i+=1\r\n else:j+=1\r\nprint(k)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nm = int(input())\r\nbrr = list(map(int,input().split()))\r\ncnt=0\r\narr.sort();brr.sort()\r\nfor i in range(n):\r\n for j in range(m):\r\n if(abs(arr[i]-brr[j])<2):\r\n brr[j]=1000\r\n cnt+=1\r\n break\r\n \r\nprint(cnt)\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\ni = 0\r\nj = 0\r\ncnt = 0\r\nwhile(i<n and j<m):\r\n if(abs(boys[i] - girls[j]) <= 1):\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n elif(boys[i] < girls[j]):\r\n i += 1\r\n else:\r\n j += 1\r\nprint(cnt)", "#https://codeforces.com/problemset/problem/489/B\r\n# BerSUBall.py\r\n\r\n# Author: Logan Pipes\r\n# Date: 12-09-2023\r\n# Tags: \r\n\r\nn = int(input())\r\na = sorted([int(elem) for elem in input().split()])\r\nm = int(input())\r\nb = sorted([int(elem) for elem in input().split()])\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j+= 1\r\n elif a[i] > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nb = sorted(map(int,input().split()))\r\nm = int(input())\r\ng = sorted(map(int,input().split()))\r\ncnt = 0\r\ni,j =0,0\r\nwhile i<n and j<m:\r\n if abs(b[i]-g[j])<=1:cnt+=1;i+=1;j+=1\r\n elif b[i]<g[j]:i+=1\r\n elif b[i]>g[j]:j+=1\r\nprint(cnt)", "nb = int(input())\r\n\r\nb = list(map(int, input().split()))\r\n\r\nng = int(input())\r\n\r\ng = list(map(int, input().split()))\r\n\r\nb.sort()\r\ng.sort()\r\n\r\nteams = 0\r\n\r\nfor i in range(nb):\r\n\r\n cb = b[i]\r\n\r\n for j in range(ng):\r\n\r\n cg = g[j]\r\n\r\n if abs(cb - cg) <= 1:\r\n\r\n teams += 1 \r\n\r\n g.pop(j)\r\n ng -= 1\r\n\r\n break\r\nprint(teams)\r\n", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nb = list(map(int, input().split()))\n\na.sort()\nb.sort()\n\ni1 = 0\ni2 = 0\npairs = 0\n\nwhile i1 < n and i2 < m:\n if abs(a[i1] - b[i2]) <= 1:\n pairs += 1\n i1 += 1\n i2 += 1\n else:\n if a[i1] <= b[i2]:\n i1 += 1\n else:\n i2 += 1\nprint(pairs)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nans = 0\r\na.sort()\r\nb.sort()\r\ni = 0\r\nfor j in range(m):\r\n if i >= n:\r\n break\r\n while i < n and b[j] > a[i] + 1:\r\n i += 1\r\n if i >= n:\r\n break\r\n if b[j] + 1 < a[i]:\r\n continue\r\n ans += 1\r\n i += 1\r\nprint(ans)\r\n", "import sys\ndef insertion_sort(arr):\n for i in range(1, len(arr)):\n key = arr[i]\n j = i - 1\n while j >= 0 and arr[j] > key:\n arr[j + 1] = arr[j]\n j -= 1\n arr[j + 1] = key\n return arr\n \ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n b = list(map(int, sys.stdin.readline().split()))\n insertion_sort(a)\n insertion_sort(b)\n pairs = 0\n for i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) < 2:\n b[j] = 6000000\n pairs += 1\n break\n print(pairs)\nmain()\n\n\"\"\"\nSea n la longitud del arreglo a y m la longitud del arreglo b, por medio del metodo de insercion se organizaron los dos arreglos de manera desendente, posteriormente, se crearon dos ciclos, el primero recorre itera a lista a, hay que tener en cuenta que va mas rapido el segundo ciclo donde el iterador es j, cada elemento de a es comparado con cada elemento de b, si si el valor absoluto de la diferencia de a[i]-b[j] es menor a 2 entonces el valor de b[j] es modificado y se pasa al siguiente valor de de i para comparar a [i+1] con el resto de elementos de b. b[i] toma el valor de un numero que sale de rango, de esta forma ya no se puede comparar, cada vez que se cumple la condicion se suma 1 al contador de parejas, cuando se acaba el ciclo principal, se muestra el total de parejas.\nTiempo: O(n^2)\n\"\"\"\n \t\t\t\t \t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\nboys.sort()\r\ngirls.sort()\r\npara = 0\r\na = 0\r\nb = 0\r\nwhile a < n and b < m:\r\n if abs(boys[a] - girls[b]) <= 1:\r\n a += 1\r\n b += 1\r\n para += 1\r\n elif boys[a] < girls[b]:\r\n a += 1\r\n else:\r\n b += 1\r\nprint(para)", "n = int(input())\r\nA = sorted(list(map(int, input().split())), reverse = True)\r\nm = int(input())\r\nB = sorted(list(map(int, input().split())), reverse = True)\r\nans = 0\r\nwhile A and B:\r\n if A[-1] == B[-1] or A[-1]+1 == B[-1] or A[-1]-1 == B[-1]:\r\n ans += 1\r\n A.pop()\r\n B.pop()\r\n continue\r\n if A[-1] < B[-1]:\r\n A.pop()\r\n else:\r\n B.pop()\r\nprint(ans)", "boys_count = int(input()) # Количество мальчиков\r\nboys_list = list(map(int, input().split())) # Список с показателями скиллов каждого мальчика\r\nboys_list.sort() # Сортируем список мальчиков\r\ngirls_count = int(input()) # Количество девочек\r\ngirls_list = list(map(int, input().split())) # Список с показателями скиллов каждой девочки\r\ngirls_list.sort() # Сортируем список девочек\r\nboys = 0 # Это первый мальчик индекс всегда равен 0 т.к. происходит удаление\r\ngirls = 0 # Это первая девочка индекс всегда равен 0 т.к. происходит удаление\r\ncount = 0 # Это количество пар, которое пока равно нулю\r\n\r\n# Пока один из списков не станет пустым\r\nwhile boys_list != [] and girls_list != []: \r\n if abs(boys_list[boys] - girls_list[girls]) <= 1: # Если разность по модулю не больше единицы\r\n count += 1 # Прибавляем пару\r\n boys_list.pop(boys_list.index(boys_list[boys])) # Удаляем из списка этого мальчика\r\n girls_list.pop(girls_list.index(girls_list[girls])) # Удаляем из списка эту девочку\r\n else: # Иначе\r\n if boys_list[boys] > girls_list[girls]: # Если по скиллу мальчик лучше, чем девочка то этой девочке пару уже не найти \r\n girls_list.pop(girls_list.index(girls_list[girls])) # Поэтому удаляем её из списка\r\n \r\n else: # Если же девочка скилловее мальчика, то мы не сможем найти пару мальчику\r\n boys_list.pop(boys_list.index(boys_list[boys])) # Поэтому удаляем его\r\nprint(count) # Выводим количество пар", "def max_pairs(n, boys, m, girls):\r\n boys.sort()\r\n girls.sort()\r\n\r\n # Create a table to store the lengths of LCS for all subproblems\r\n lcs_table = [[0] * (m + 1) for i in range(n + 1)]\r\n\r\n # Fill the table in a bottom-up manner\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if abs(boys[i - 1] - girls[j - 1]) <= 1:\r\n lcs_table[i][j] = lcs_table[i - 1][j - 1] + 1\r\n else:\r\n lcs_table[i][j] = max(lcs_table[i - 1][j], lcs_table[i][j - 1])\r\n\r\n # The length of the LCS is the maximum number of pairs that can be formed\r\n return lcs_table[n][m]\r\n\r\n# Read input\r\nn = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\n# Print the maximum number of pairs that can be formed\r\nmax_num_pairs = max_pairs(n, boys, m, girls)\r\nprint(max_num_pairs)\r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\npairs = 0\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\nif n > m:\r\n # Create a list to track if each boy is already paired\r\n is_paired = [False] * n\r\n\r\n for girl in girls:\r\n potential_boys = []\r\n\r\n for i in range(n):\r\n if not is_paired[i] and abs(boys[i] - girl) <= 1:\r\n potential_boys.append(i)\r\n\r\n if potential_boys:\r\n # Pair the girl with the boy with the lowest skill\r\n is_paired[potential_boys[0]] = True\r\n pairs += 1\r\n\r\nelse:\r\n # Create a list to track if each girl is already paired\r\n is_paired = [False] * m\r\n\r\n for boy in boys:\r\n potential_girls = []\r\n\r\n for i in range(m):\r\n if not is_paired[i] and abs(boy - girls[i]) <= 1:\r\n potential_girls.append(i)\r\n\r\n if potential_girls:\r\n # Pair the boy with the girl with the lowest skill\r\n is_paired[potential_girls[0]] = True\r\n pairs += 1\r\n\r\nprint(pairs)\r\n", "n=int(input())\r\nboys=sorted(list(map(int,input().split())))\r\nm=int(input())\r\ngirls=sorted(list(map(int,input().split())))\r\ni=0\r\nj=0\r\npairs=0\r\nwhile i<n and j<m:\r\n if abs(boys[i]-girls[j])<=1:\r\n i+=1\r\n j+=1\r\n pairs+=1\r\n elif boys[i]<girls[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(pairs)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\ni=0\r\nj=0\r\ns=0\r\nwhile(i<n and j<m):\r\n if(abs(a[i]-b[j])<=1):\r\n s+=1\r\n i+=1\r\n j+=1\r\n elif(a[i]-b[j]>1):\r\n j+=1\r\n elif(b[j]-a[i]>1):\r\n i+=1\r\nprint(s) ", "n = int(input())\nboys = list(map(int,input().split()))\nboys = sorted(boys)\nm = int(input())\ngirls = list(map(int,input().split()))\ngirls = sorted(girls)\npairs = 0\n\nfor b in boys:\n for i,g in enumerate(girls):\n if(abs(b-g) <2):\n pairs+=1\n del(girls[i])\n break;\nprint(pairs)\n \n \t \t \t \t \t\t \t\t\t \t\t\t \t", "n = int(input())\narr = list(map(int, input().split()))\nk = int(input())\nbrr = list(map(int, input().split()))\n\narr.sort()\nbrr.sort()\ng = 0\nm = 0\nresult = 0\nwhile g < k and m < n:\n if abs(arr[m] - brr[g]) <= 1:\n result += 1\n g += 1\n m += 1\n elif arr[m] > brr[g]:\n g += 1\n else:\n m += 1\nprint(result)\n \t \t \t \t \t\t\t\t\t\t \t \t\t\t \t\t\t", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nm = int(input())\r\nb = sorted([int(i) for i in input().split()])\r\ncount = 0\r\n\r\ni = j = 0\r\n\r\nwhile i < len(a) and j < len(b):\r\n\r\n if abs(a[i] - b[j]) <= 1:\r\n\r\n count += 1\r\n i += 1\r\n j += 1\r\n\r\n else:\r\n if a[i] > b[j]:\r\n j += 1\r\n elif b[j] > a[i]:\r\n i += 1\r\n\r\nprint(count)\r\n", "'''Descripcion algoritmo: se ingresan los valores, las lista son oredenadas por insertion sort, y luego se recorren\nambas lista con un bucle anidado, en el cual se comieza a comparar los elementos de lista_a con los de lista_b, si el\nvalor absoluto de estos dos es menor 2, se cuenta y en la lista_b se coloca un valor muy grande con ayuda de la\nlibreria math, y se rompe el bucle anidado con el fin de que para las siguientes consultas, no se haga la comparacion,\ny se pase al siguiente caso, esto hasta terminar de el primer bucle, y asi dar respuesta'''\n\n'''Complejidad temporal: T(n_insercion) = O(a^2+b^2) \n T(n_bucle) = O(a*b)\n T(n_tolal) = O(a^2+b^2+a*b) '''\nfrom sys import stdin\nimport math\n\ndef insercion(lista):\n for i in range(1, len(lista)):\n centinela = lista[i]\n j = i - 1\n while j >= 0 and lista[j] > centinela:\n lista[j + 1] = lista[j]\n j -= 1\n lista[j + 1] = centinela\n\n return lista\n\ndef main():\n a = int(stdin.readline())\n lista_a = insercion([int(x) for x in stdin.readline().split()])\n b = int(stdin.readline())\n lista_b = insercion([int(x) for x in stdin.readline().split()])\n parejas = 0\n\n for i in range(a):\n for j in range(b):\n if abs(lista_a[i]-lista_b[j]) < 2:\n parejas += 1\n lista_b[j] = math.inf\n break\n else:\n pass\n print(parejas)\n\n\nmain()\n\t\t\t \t \t \t\t \t \t \t\t \t", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nm = int(input())\r\nb = sorted(map(int, input().split()))\r\nc = 0\r\nwhile a and b:\r\n a0 = a[0]\r\n b0 = b[0]\r\n if abs(a0 - b0) <= 1:\r\n c += 1\r\n a, b = a[1:], b[1:]\r\n else:\r\n if a0 < b0:\r\n a = a[1:]\r\n else:\r\n b = b[1:]\r\nprint(c)\r\n", "import sys\r\n#import bisect\r\n#from collections import Counter\r\n\r\ninput = sys.stdin.readline\r\n#MOD=10**9+7\r\n\r\nif __name__ == '__main__':\r\n \r\n \r\n b=int(input())\r\n boys=list(map(int, input().split()))\r\n g=int(input())\r\n girls=list(map(int, input().split()))\r\n boys.sort()\r\n girls.sort()\r\n i,j,res=0,0,0\r\n while i<b and j<g:\r\n if boys[i]<girls[j]:\r\n if girls[j]-boys[i]<=1:\r\n res +=1\r\n j +=1\r\n i +=1\r\n else:\r\n if boys[i]-girls[j]<=1:\r\n res +=1\r\n i +=1\r\n j +=1\r\n print(res)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n manSkills:list[int] = []\r\n girlSkills:list[int] = []\r\n input()\r\n manSkills = list(map(int, input().split()))\r\n input()\r\n girlSkills = list(map(int, input().split()))\r\n\r\n\r\n maximumPairCount:int = 0\r\n revSortedManSkills:list[int] = sorted(manSkills, reverse=True)\r\n revSortedGirlSkills:list[int] = sorted(girlSkills, reverse=True)\r\n while revSortedManSkills and revSortedGirlSkills :\r\n if abs(revSortedManSkills[-1] - revSortedGirlSkills[-1]) <= 1 :\r\n revSortedManSkills.pop()\r\n revSortedGirlSkills.pop()\r\n maximumPairCount += 1\r\n continue\r\n\r\n if revSortedManSkills[-1] > revSortedGirlSkills[-1] :\r\n revSortedGirlSkills.pop()\r\n else :\r\n revSortedManSkills.pop()\r\n\r\n\r\n print(maximumPairCount)\r\n\r\nmain()", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\npairs = 0\r\n\r\na.sort()\r\nb.sort()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) < 2:\r\n b[j] = 1000\r\n pairs += 1\r\n break\r\n\r\nprint(pairs)\r\n", "no_of_boys = int(input())\r\nboys_skill_list = sorted(map(int, input().split()))\r\nno_of_girls = int(input())\r\ngirls_skill_list = sorted(map(int, input().split()))\r\n\r\ni = 0\r\nj = 0\r\npairs_count = 0\r\n\r\nwhile i < no_of_boys and j < no_of_girls:\r\n if abs(boys_skill_list[i] - girls_skill_list[j]) <= 1:\r\n pairs_count += 1\r\n i += 1\r\n j += 1\r\n elif boys_skill_list[i] < girls_skill_list[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs_count)\r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\npairs = 0\r\nboy_index = 0\r\ngirl_index = 0\r\n\r\nwhile boy_index < n and girl_index < m:\r\n if abs(boys[boy_index] - girls[girl_index]) <= 1:\r\n pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boys[boy_index] < girls[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\n\r\nprint(pairs)", "n=int(input()) #men quontity\r\na=list(map(int,input().split())) #men_skills\r\nm=int(input()) #women\r\nb=list(map(int,input().split())) #women_skills\r\na.sort()\r\nb.sort()\r\ni=0\r\nj=0\r\ncount=0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<=1:\r\n count+=1\r\n i+=1\r\n j+=1\r\n elif a[i]<b[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(count)\r\n\r\n\r\n \r\n", "def sopostavim(a,b):\r\n if 0 <= abs(a-b) <= 1:\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nd = list(map(int, input().split()))\r\n\r\np.sort()\r\nd.sort()\r\n\r\nres = 0\r\nfor i in range(0, len(p)):\r\n for j in range(0, len(d)):\r\n if sopostavim(p[i], d[j]):\r\n res += 1\r\n d[j] = 1000000\r\n break\r\n\r\n\r\nprint(res)", "#https://codeforces.com/problemset/problem/489/B\r\n\r\nnumber_boys = int(input())\r\nboys_skill = [int(x) for x in input().split(\" \")]\r\nboys_skill.sort()\r\nnumbers_girls = int(input())\r\ngirls_skill = [int(x) for x in input().split(\" \")]\r\ngirls_skill.sort()\r\npairs = 0\r\nfor boy in boys_skill:\r\n for x in range(len(girls_skill)):\r\n if(abs(boy - girls_skill[x]) <= 1):\r\n girls_skill.pop(x)\r\n pairs += 1\r\n break\r\nprint(pairs)\r\n\r\n", "def find_maximum_pairs(n, boys_skills, m, girls_skills):\r\n boys_skills.sort()\r\n girls_skills.sort()\r\n pairs = 0\r\n i = 0\r\n j = 0 \r\n while i < n and j < m:\r\n if abs(boys_skills[i] - girls_skills[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys_skills[i] > girls_skills[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n return pairs\r\n\r\n# Read the number of boys\r\nn = int(input())\r\n\r\n# Read the skills of boys\r\nboys_skills = list(map(int, input().split()))\r\n\r\n# Read the number of girls\r\nm = int(input())\r\n\r\n# Read the skills of girls\r\ngirls_skills = list(map(int, input().split()))\r\n\r\n# Find the maximum possible number of pairs\r\nmax_pairs = find_maximum_pairs(n, boys_skills, m, girls_skills)\r\n\r\n# Print the result\r\nprint(max_pairs)", "n = int(input())\r\nboys_skills = list(map(int, input().split()))\r\nm = int(input())\r\ngirls_skills = list(map(int, input().split()))\r\n\r\nboys_skills.sort()\r\ngirls_skills.sort()\r\n\r\nboy_index = 0\r\ngirl_index = 0\r\npairs = 0\r\n\r\nwhile boy_index < n and girl_index < m:\r\n if abs(boys_skills[boy_index] - girls_skills[girl_index]) <= 1:\r\n pairs += 1\r\n boy_index += 1\r\n girl_index += 1\r\n elif boys_skills[boy_index] < girls_skills[girl_index]:\r\n boy_index += 1\r\n else:\r\n girl_index += 1\r\n\r\nprint(pairs)\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\na = iia()\r\nm = ii1()\r\nb = iia()\r\n\r\na = sorted(a)\r\nb = sorted(b)\r\n\r\ncount = 0\r\nwhile len(a) and len(b):\r\n if abs(a[0] - b[0]) <= 1:\r\n count +=1\r\n a.pop(0)\r\n b.pop(0)\r\n else:\r\n if a[0] < b[0]:\r\n a.pop(0)\r\n else:\r\n b.pop(0)\r\nprint(count)", "m = int(input())\r\nlm = sorted([int(i) for i in input().split()])\r\nd = int(input())\r\nld = sorted([int(i) for i in input().split()])\r\nc = 0\r\nmaxl = max(len(ld), len(lm))\r\nif maxl == len(ld):\r\n maxl = ld\r\n minl = lm\r\nelse:\r\n maxl = lm\r\n minl = ld\r\nwhile len(minl) != 0:\r\n flag = False\r\n for i in range(len(maxl)):\r\n for j in range(len(minl)):\r\n if abs(maxl[i]-minl[j]) <= 1:\r\n c += 1\r\n maxl.pop(i)\r\n minl.pop(j)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n break\r\nprint(c)\r\n", "p=lambda:sorted(map(int,input().split()));n=p()[0];a=p();m=p()[0];b=p();\ni,j,k=0,0,0\nwhile i<n and j<m:\n if abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\n elif a[i]<b[j]:i+=1\n else:j+=1\nprint(k)\n \t\t \t \t \t\t\t\t\t \t \t\t \t\t \t \t\t\t", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\nA = Counter(map(int,input().strip().split()))\r\nm = int(input())\r\nB = Counter(map(int,input().strip().split()))\r\n\r\ncnt = 0\r\nfor i in range(101):\r\n for j in range(-1,2):\r\n m = min(A[i],B[i + j])\r\n cnt += m\r\n A[i] -= m\r\n B[i+j] -= m\r\nprint(cnt)", "m=int(input())\r\na=list(map(int,input().split()))\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\noccupied=[]\r\nif len(a)<len(b):\r\n for i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<=1:\r\n if j in occupied:\r\n continue\r\n else:\r\n occupied.append(j)\r\n break\r\n print(len(occupied))\r\nelse:\r\n for i in range(len(b)):\r\n for j in range(len(a)):\r\n if abs(b[i]-a[j])<=1:\r\n if j in occupied:\r\n continue\r\n else:\r\n occupied.append(j)\r\n break\r\n print(len(occupied))\r\n \r\n", "n = int(input())\r\nls1 = list(map(int, input().split()))\r\nm = int(input())\r\nls2 = list(map(int, input().split()))\r\nls1.sort()\r\nls2.sort()\r\nindex = 0\r\nwhile(len(ls1)!=0 and len(ls2)!=0):\r\n if ls1[0] + 1 < ls2[0]:\r\n ls1.remove(ls1[0])\r\n elif ls1[0] > ls2[0] + 1:\r\n ls2.remove(ls2[0])\r\n else:\r\n ls1.remove(ls1[0])\r\n ls2.remove(ls2[0])\r\n index = index + 1\r\nprint(index)", "# https://codeforces.com/problemset/problem/489/B\r\n\r\ndef main():\r\n a = int(input())\r\n la = sorted(map(int, input().split(' ')))\r\n b = int(input())\r\n lb = map(int, input().split(' '))\r\n _map = {}\r\n for i in lb:\r\n if i in _map:\r\n _map[i] += 1\r\n else:\r\n _map[i] = 1\r\n count = 0\r\n for i in la:\r\n options = (i - 1, i, i + 1)\r\n for j in options:\r\n if j in _map and _map[j] > 0:\r\n count += 1\r\n _map[j] -= 1\r\n break\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = input()\nb = list(map(int, input().split()))\nm = input()\ng = list(map(int,input().split()))\nb.sort()\ng.sort()\nm=0\nfor i in range(len(b)):\n for j in range(len(g)):\n if abs(g[j] - b[i]) <= 1:\n m += 1\n g[j] = -10\n break\nprint(m)\n", "\r\nn = int(input())\r\na = list(map(int , input().split()))\r\nt = int(input())\r\nb = list(map(int , input().split()))\r\na = sorted(a)\r\nb = sorted(b)\r\nc = 0\r\n\r\nfor i in range(n):\r\n for j in range(t):\r\n if(abs(a[i] - b[j]) <= 1):\r\n c += 1 \r\n b[j] = 100000\r\n break \r\n \r\n\r\nprint(c)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\ns = 0\r\nwhile a and b:\r\n if a[0] == b[0] or a[0] == b[0] + 1 or a[0] == b[0] - 1:\r\n s += 1\r\n a.pop(0)\r\n b.pop(0)\r\n else:\r\n if a[0] > b[0]:\r\n b.pop(0)\r\n else:\r\n a.pop(0)\r\nprint(s)", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nboys = sorted(boys)\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\ngirls = sorted(girls)\r\n\r\ni, j = 0, 0\r\ns = 0\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n s += 1\r\n i, j = i+1, j+1\r\n else:\r\n (i,j) = (i+1,j) if boys[i] < girls[j] else (i, j+1)\r\nprint(s)", "n=int(input())\r\nboys=[int(i) for i in input().split()]\r\nm=int(input())\r\ngirls=[int(i) for i in input().split()]\r\nboys.sort()\r\ngirls.sort()\r\noutput=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(boys[i]-girls[j])<=1:\r\n output+=1\r\n girls[j]=1111\r\n break\r\nprint(output)", "n= int(input())\r\na= list(map(int, input().split()))\r\nm= int(input())\r\nb= list(map(int, input().split()))\r\ncount=0\r\na.sort()\r\nb.sort()\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<=1:\r\n count+=1\r\n b[j]=1000\r\n break\r\nprint(count)", "'''\r\n###### * User Profile : Keval_78\r\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\r\nGithub: https://github.com/Keval78\r\nLeetcode: https://leetcode.com/Keval_78/\r\n'''\r\n\r\nimport sys\r\nfrom os import path\r\nfrom math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\nfrom collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef si(): return sys.stdin.readline().strip()\r\ndef ii(): return int(si())\r\ndef mi(ss=\" \"): return map(int, si().split(ss))\r\ndef msi(ss=\" \"): return map(str, si().split(ss))\r\ndef li(ss=\" \"): return list(mi(ss))\r\n\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\r\nMAX = 10**5+1\r\n\r\nn = ii()\r\nbrr = li()\r\nm = ii()\r\ngrr = li()\r\n\r\nbrr.sort()\r\ngrr.sort()\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if brr[i] == grr[j] or brr[i]+1 == grr[j] or brr[i]-1 == grr[j]:\r\n cnt += 1\r\n grr[j] = -2\r\n break\r\nprint(cnt)\r\n\r\n# pairs = [[0 for i in range(m+1)] for j in range(n+1)]\r\n# for i in range(n):\r\n# for j in range(m):\r\n# pairs[i+1][j+1] = pairs[i][j]\r\n# if abs(brr[i]-grr[j]) <= 1:\r\n# pairs[i+1][j+1] += 1\r\n# pairs[i+1][j+1] = max(pairs[i+1][j+1], pairs[i][j+1], pairs[i+1][j])\r\n# print(pairs[n][m])\r\n", "n, boys = int(input()), list(map(int, input().split()))\nm, girls = int(input()), list(map(int, input().split()))\n\nboys.sort(), girls.sort()\nup, down, ans = 0, 0, 0\n\nwhile up < n and down < m:\n if abs(boys[up] - girls[down]) <= 1:\n ans += 1\n up += 1\n down += 1\n continue\n if boys[up] > girls[down]: down += 1\n else: up += 1\n\nprint(ans)\n \t \t \t \t \t\t\t\t\t\t\t \t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nj = 0\r\ni = 0\r\nans = 0\r\nwhile i < n and j < m:\r\n diff = a[i] - b[j]\r\n if -1 <= diff <= 1:\r\n ans += 1\r\n i+=1\r\n j += 1\r\n elif diff < -1:\r\n i +=1\r\n else:\r\n j += 1\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nboys.sort()\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\ngirls.sort()\r\npara = []\r\ns = 0\r\nfor i in range(len(boys)):\r\n for j in range(s,len(girls)):\r\n if abs(boys[i]-girls[j])<=1:\r\n para.append([boys[i],girls[j]])\r\n s = j+1\r\n break\r\nprint(len(para))", "_ = input()\nbs = [int(c) for c in input().strip().split()]\n_ = input()\ngs = [int(c) for c in input().strip().split()]\n\nbs.sort()\ngs.sort()\n\nbi = len(bs)-1\ngi = len(gs)-1\n\nc = 0\nwhile(bi>=0 and gi>=0):\n # print('****')\n # print(bs[bi], gs[gi])\n # print(c)\n if abs(bs[bi] - gs[gi]) <=1:\n c +=1\n bi -= 1\n gi -= 1\n elif bs[bi] > gs[gi]: \n bi -= 1\n else:\n gi -= 1\nprint(c)\n \t \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\n\r\ni, j, count = 0, 0, 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif b[j] - a[i] > 1: \r\n i += 1\r\n else:\r\n j += 1\r\nprint(count)", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nn1 = int(input())\r\nsp1 = list(map(int, input().split()))\r\nans = 0\r\nfor i in sorted(sp):\r\n for j in sorted(sp1):\r\n if abs(i - j) <= 1:\r\n ans += 1\r\n sp1.remove(j)\r\n break\r\nprint(ans)", "I=lambda:sorted(map(int,input().split()))\nn=I()[0]\na=I()\nm=I()[0]\nb=I()\ni,j,k=0,0,0\nwhile i<n and j<m:\n\tif abs(a[i]-b[j])<2:k+=1;i+=1;j+=1\n\telif a[i]<b[j]:i+=1\n\telse:j+=1\nprint(k)\n\t \t \t \t\t\t\t\t\t\t\t \t \t\t \t \t", "n = int(input())\r\nb = sorted(map(int,input().split()))\r\nm = int(input())\r\ng = sorted(map(int,input().split()))\r\n\r\ntable = [\r\n\t[0]*200\r\n]\r\n\r\npair = 0\r\nfor i in range(len(b)):\r\n\tfor j in range(len(g)):\r\n\t\t# print(b[i],g[j],abs(b[i]-g[j]) == 1)\r\n\t\tif(0 <= abs(b[i]-g[j]) <= 1 ):\r\n\t\t\tb[i] = -10000\r\n\t\t\tg[j] = -10000\r\n\t\t\tpair+=1\r\n\t\t\tbreak\r\n\t\telif b[i]-g[j] < -1:\r\n\t\t\tbreak\r\n\r\nprint(pair)", "import sys\ndef insertion_sort(arr):\n for i in range(1, len(arr)):\n key = arr[i]\n j = i - 1\n while j >= 0 and arr[j] > key:\n arr[j + 1] = arr[j]\n j -= 1\n arr[j + 1] = key\n return arr\n \ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n b = list(map(int, sys.stdin.readline().split()))\n insertion_sort(a)\n insertion_sort(b)\n pairs = 0\n for i in range(n):\n for j in range(m):\n if abs(a[i] - b[j]) < 2:\n b[j] = 6000000\n pairs += 1\n break\n print(pairs)\nmain()\n \t\t \t \t\t\t\t\t \t \t\t\t\t\t \t", "\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\ninf = 102\r\nn = II()\r\nboys = SLMII()\r\nm = II()\r\ngirls = SLMII()\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if -1 <= boys[i] - girls[j] <= 1:\r\n ans += 1\r\n girls[j] = inf\r\n break\r\n \r\nprint(ans)\r\n \r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int, input().split())))\r\ncnt = 0\r\ni = 0\r\nj = 0\r\nf_1 = True\r\nf_2 = True\r\ngo = True\r\nwhile go:\r\n if abs(a[i] - b[j]) <= 1:\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n if i == n:\r\n f_1 = False\r\n i -= 1\r\n if j == m:\r\n f_2 = False\r\n j -= 1\r\n else:\r\n if a[i] <= b[j] and f_1:\r\n i += 1\r\n if i == n:\r\n f_1 = False\r\n i -= 1\r\n elif a[i] > b[j] and f_2:\r\n j += 1\r\n if j == m:\r\n f_2 = False\r\n j -= 1\r\n if f_1 == False or f_2 == False:\r\n go = False \r\nprint(cnt)", "b = int(input())\r\nboys = list(map(int, input().split()))\r\ng = int(input())\r\ngirls = list(map(int, input().split()))\r\nboys.sort()\r\ngirls.sort()\r\nans = 0\r\nfor i in boys:\r\n for x in girls:\r\n if abs(i-x) <= 1:\r\n girls.remove(x)\r\n ans += 1\r\n break\r\n\r\nprint(ans)", "from functools import lru_cache\r\n\r\ndef main(): \r\n n = input() \r\n a = list(map(int, input().split()))\r\n m = input()\r\n b = list(map(int, input().split()))\r\n\r\n a.sort()\r\n b.sort()\r\n \r\n @lru_cache(None)\r\n def dfs(i, j): \r\n if i == len(a) or j == len(b): \r\n return 0\r\n\r\n if abs(a[i] - b[j]) <= 1:\r\n return 1 + dfs(i + 1, j + 1)\r\n \r\n return max(dfs(i + 1, j), dfs(i, j + 1))\r\n \r\n print(dfs(0, 0))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nb=list(map(int,input().split()))\r\nm=int(input())\r\ng=list(map(int,input().split()))\r\nc=0\r\nb.sort()\r\ng.sort()\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif g[j]!=-1 and abs(b[i]-g[j])<=1:\r\n\t\t\tg[j]=-1\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\nprint(c)", "n = eval(input())\r\ns = input()\r\nb = list(map(int, s.split()))\r\nm = eval(input())\r\ns = input()\r\ng = list(map(int, s.split()))\r\n\r\nb.sort()\r\ng.sort()\r\n\r\ncount = 0\r\ni, j = 0, 0\r\n\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) <= 1:\r\n count += 1\r\n i += 1\r\n j += 1\r\n elif b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(count)\r\n", "# your code goes here\r\n# your code goes here\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nb=int(input())\r\nm=list(map(int,input().split()))\r\nl.sort()\r\nm.sort()\r\ni=a-1\r\nj=b-1\r\nc=0\r\nwhile(i>-1 and j>-1):\r\n if(abs(l[i]-m[j])<=1):\r\n c=c+1 \r\n i=i-1\r\n j=j-1 \r\n elif(l[i]>m[j]):\r\n i=i-1 \r\n else:\r\n j=j-1 \r\nprint(c)\r\n", "n, a = int(input()), sorted(map(int, input().split()))\r\nm, b = int(input()), sorted(map(int, input().split()))\r\n\r\npairs = i = j = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) < 2:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n a = [int(x) for x in input().split()]\n m = int(input())\n b = [int(x) for x in input().split()]\n a.sort()\n b.sort()\n pairs = 0\n i = j = 0\n while i < n and j < m:\n if abs(a[i] - b[j]) < 2:\n pairs += 1\n i += 1\n j += 1\n elif a[i] < b[j]:\n i += 1\n else:\n j += 1\n print(pairs)\n\n\nif __name__ == \"__main__\":\n main()\n", "import sys\n\n\ndef input_lines():\n\treturn list(map(str.strip, sys.stdin.readlines()))\n\ndef line_to_int_arr(line):\n\treturn list(map(int, line.split(\" \")))\n\ndef print_arr(arr):\n\tfor el in arr:\n\t\tprint(el, end= ' ')\n\tprint()\n\t\nlines = input_lines()\nn = int(lines[0])\narr1 = sorted(line_to_int_arr(lines[1]))\nm = int(lines[2])\narr2 = sorted(line_to_int_arr(lines[3]))\n\nfirst_head = 0\nsecond_head = 0\npairs_cnt = 0\n\nwhile first_head < n and second_head < m:\n if abs(arr1[first_head] - arr2[second_head]) <= 1:\n pairs_cnt += 1\n first_head += 1\n second_head += 1\n elif arr1[first_head] > arr2[second_head]:\n second_head += 1\n else:\n first_head += 1\n\nprint(pairs_cnt)\n \t\t \t\t \t\t \t \t \t \t\t \t", "n = int(input())\r\nskils_n = list(map(int, input().split()))\r\nm = int(input())\r\nskils_m = list(map(int, input().split()))\r\ni = j = p = 0\r\nfor i in sorted(skils_n):\r\n for j in sorted(skils_m):\r\n if j - i == -1 or j - i == 0 or j - i == 1:\r\n skils_m.remove(j)\r\n skils_n.remove(i)\r\n p += 1\r\n break\r\nprint(p)", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\n#from math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\nn=ii()\r\nb=sorted(li())\r\nm=ii()\r\ng=sorted(li())\r\nres=0\r\nwhile b and g:\r\n if abs(b[-1]-g[-1])<=1:\r\n res+=1\r\n b.pop()\r\n g.pop()\r\n elif b[-1]>g[-1]:\r\n b.pop()\r\n else:\r\n g.pop()\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nm1=min(n,m)\r\nc=0\r\ni=0\r\nj=0\r\nwhile i<n and j<m:\r\n if abs(a[i]-b[j])<=1:\r\n c+=1\r\n i+=1\r\n j+=1\r\n else:\r\n if a[i]>b[j]:\r\n j+=1\r\n else:\r\n i+=1\r\nprint(c)", "def solve(l1, l2):\r\n pairs=0\r\n for i in range(len(l1)):\r\n if l1[i]-1 in l2:\r\n l2[l2.index(l1[i]-1)]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n elif l1[i] in l2:\r\n l2[l2.index(l1[i])]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n elif l1[i]+1 in l2:\r\n l2[l2.index(l1[i]+1)]=-1\r\n l1[i]=-1\r\n pairs+=1\r\n return pairs\r\n\r\nb=int(input())\r\nbskill=sorted(list(map(int, input().split())))\r\ng=int(input())\r\ngskill=sorted(list(map(int, input().split())))\r\nif b<g:\r\n print(solve(bskill, gskill))\r\nelse:\r\n print(solve(gskill, bskill))\r\n", "def main():\r\n num_boys = int(input())\r\n boys_skill = list(map(int, input().split()))\r\n \r\n num_girls = int(input())\r\n girls_skill = list(map(int, input().split()))\r\n \r\n boys_skill.sort()\r\n girls_skill.sort()\r\n \r\n boys_ptr = 0\r\n girls_ptr = 0\r\n num_pairs = 0\r\n \r\n while boys_ptr < num_boys and girls_ptr < num_girls:\r\n cur_boy_skill = boys_skill[boys_ptr]\r\n cur_girl_skill = girls_skill[girls_ptr]\r\n \r\n if abs(cur_boy_skill - cur_girl_skill) <= 1:\r\n num_pairs += 1\r\n boys_ptr += 1\r\n girls_ptr += 1\r\n \r\n elif cur_boy_skill < cur_girl_skill:\r\n boys_ptr += 1\r\n \r\n else:\r\n girls_ptr += 1\r\n \r\n print(num_pairs)\r\n\r\nmain()", "from sys import stdin\ndef main():\n n=int(input())\n baile_n=[int(x) for x in stdin.readline().split()]\n m=int(input())\n baile_m=[int(x) for x in stdin.readline().split()]\n p=0\n baile_n=sorted(baile_n)\n baile_m=sorted(baile_m)\n for i in baile_n:\n for j in range (len(baile_m)):\n if abs(i-baile_m[j])<2:\n p+=1\n baile_m.pop(j)\n break\n print(p)\nmain()\n \t\t\t\t\t \t\t \t\t\t \t \t \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nl = r = 0\r\na.sort()\r\nb.sort()\r\ncount = 0\r\nwhile l<n and r<m:\r\n if abs(a[l] - b[r]) <2:\r\n count+=1\r\n l+=1\r\n r+=1\r\n elif a[l] > b[r]:\r\n r+=1\r\n else:\r\n l+=1\r\nprint(count)\r\n\r\n", "n=int(input())\r\nboys=list(map(int,input().split()))\r\nm=int(input())\r\ngirls=list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\ni = 0\r\nj = 0\r\ncount=0\r\nwhile i<n and j<m:\r\n if abs(boys[i]-girls[j])<=1:\r\n count+=1\r\n i+=1\r\n j+=1\r\n elif boys[i]<girls[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(count)\r\n", "#Primero tuve en cuenta el ordenamiento de ambos arreglos para ir comparando elemento de uno con elemento del otro arreglo.\n#Este problema lo solucioné creando un ciclo donde las condiciones se establecen en base al tamaño de las dos listas que ingresan\n#Si la diferencia es cero o uno, entonces esto implicaria contar un paraja y sumar uno a las dos variables que identifican el indice \n#e la lista de chicos y chicas para poder continuar con las siguientes posibles parejas.\n#Lo importante aquí es saber que al ser el valor en la lista de habilidades de chicos menor a la de habilidades de las chicas se debe solamente \n#sumar el contador para chicos porque ya se sabe que para lista masculina este personaje no va poder formar pareja con alguna chica, lo mismo pasa en el caso de que las habilidades de alguna chica sea menor a la del chico, se suma 1 al que lleva el indice sobre la lista de chicas.\ndef main():\n n = int(input())\n chicos = list(map(int, input().split()))\n m = int(input())\n chicas = list(map(int, input().split()))\n\n chicos.sort()\n chicas.sort()\n\n parejas = 0\n indice_chico = 0\n indice_chica = 0\n\n while indice_chico < n and indice_chica < m:\n if abs(chicos[indice_chico] - chicas[indice_chica]) <= 1:\n parejas += 1\n indice_chico += 1\n indice_chica += 1\n elif chicos[indice_chico] < chicas[indice_chica]:\n indice_chico += 1\n else:\n indice_chica += 1\n\n print(parejas)\n\nmain()\n\n#El tiempo de ejecucion es de O(m+n).\n\t\t\t\t\t \t\t \t\t \t \t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nans=0\r\nfor i in a:\r\n for j in b:\r\n if -1<=i-j<=1:\r\n ans+=1\r\n b.remove(j)\r\n break\r\nprint(ans) ", "n = int(input())\r\nboys = list(map(int,input().split(' ')))\r\nm = int(input())\r\ngirls = list(map(int,input().split(' ')))\r\n\r\nsorted_boys = sorted(boys)\r\nsorted_girls = sorted(girls)\r\n\r\npairs = 0\r\nfor b in sorted_boys:\r\n for i in range(len(sorted_girls)):\r\n if abs(b - sorted_girls[i]) <= 1:\r\n pairs += 1\r\n sorted_girls.pop(i)\r\n break\r\nprint(pairs)", "n = int(input())\na = sorted(list(map(int, input().split())))\n\nm = int(input())\nb = sorted(list(map(int, input().split())))\n\nlast_j = 0\nres = 0\n\nfor i in range(n):\n for j in range(last_j, m):\n if abs(a[i] - b[j]) <= 1:\n res += 1\n last_j = j + 1\n break\n\nprint(res)\n\n\n\t\t \t \t\t\t\t\t \t \t \t\t\t \t\t \t", "import sys\r\n\r\nt = 1; #t = int(input())\r\n\r\ndef solve() -> None:\r\n #w=list(map(int,sys.stdin.readline().split()))\r\n n=int(input())\r\n man=sorted(list(map(int,input().split())))\r\n m=int(input())\r\n woman=sorted(list(map(int,input().split())))\r\n ans=0\r\n if n<m:\r\n man,woman=woman,man\r\n n,m=m,n\r\n for i in range(m):\r\n if woman[i]-1 in man:\r\n ans += 1\r\n man.remove(woman[i]-1)\r\n elif woman[i] in man:\r\n ans += 1\r\n man.remove(woman[i])\r\n elif woman[i]+1 in man:\r\n ans += 1\r\n man.remove(woman[i]+1)\r\n print(ans)\r\n\r\nfor _ in [0] * t: solve()", "n = int(input(\"\"))\r\na = list(map(int, input(\"\").split()))\r\na.sort()\r\na.reverse()\r\nm = int(input(\"\"))\r\nb = list(map(int, input(\"\").split()))\r\nb.sort()\r\nb.reverse()\r\ncount = 0\r\n\r\nfor i in range(n+m):\r\n if len(a) == 0 or len(b) == 0:\r\n break\r\n if a[-1] < b[-1]:\r\n if a[-1] == b[-1]-1:\r\n count += 1\r\n a.pop()\r\n b.pop()\r\n else:\r\n a.pop()\r\n else:\r\n if a[-1] == b[-1] or a[-1] == b[-1]+1:\r\n count += 1\r\n a.pop()\r\n b.pop()\r\n else:\r\n b.pop()\r\n\r\n\r\nprint(count)", "# for _ in range(int(input())):\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\nm=int(input())\r\nl2=list(map(int,input().split()))\r\nl2.sort()\r\nans=0\r\n# ans=min(m,n)\r\ni=0\r\nwhile i<(len(l1)):\r\n j=0\r\n while j<(len(l2)):\r\n if (abs(l1[i]-l2[j])<=1):\r\n ans+=1\r\n l2.pop(j)\r\n break\r\n j+=1\r\n i+=1\r\nprint(ans)\r\n \r\n", "n=int(input())\r\nniños=sorted(map(int,input().split()))\r\nm=int(input())\r\nniñas=sorted(map(int,input().split()))\r\n\r\ni,j,par=0,0,0\r\nwhile i<n and j<m:\r\n if abs(niños[i]-niñas[j])<=1:\r\n par+=1\r\n i+=1\r\n j+=1\r\n elif niños[i]<niñas[j]:\r\n i+=1\r\n else:\r\n j+=1\r\n \r\nprint(par)", "n = int(input())\r\nman = [int(i) for i in input().split()]\r\n\r\nm = int(input())\r\nwomen = [int(i) for i in input().split()]\r\nf_svobodna = [1] * (m)\r\n\r\nman.sort()\r\nwomen.sort()\r\n\r\ncnt = 0\r\nfor i in man:\r\n for j in range(m):\r\n if f_svobodna[j] and ((abs(i - women[j]) <= 1)):\r\n cnt += 1\r\n f_svobodna[j] = 0\r\n break\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\nboys = list(map(int,input().split(\" \")))\r\nboys = sorted(boys)\r\nm = int(input())\r\ngirls = list(map(int,input().split(\" \")))\r\ngirls = sorted(girls)\r\ncnt = 0\r\nfor boy in boys:\r\n\tfor i in range(m):\r\n\t\tif abs(boy-girls[i])<=1:\r\n\t\t\tcnt += 1\r\n\t\t\tgirls[i] = 102\r\n\t\t\tbreak\r\nprint(cnt)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nboys = sorted(map(int, input().split()))\r\nm = int(input())\r\ngirls = sorted(map(int, input().split()))\r\n\r\ni, j, pairs = 0, 0, 0\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys[i] < girls[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nsys.stdout.write(str(pairs) + \"\\n\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\n\r\nm = int(input())\r\nb = sorted(map(int, input().split()))\r\n\r\nres = i = j = 0\r\nwhile i < n and j < m:\r\n if abs(a[i] - b[j]) < 2:\r\n res += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(res)", "a=int(input())\r\nX=input().split()\r\nA=[]\r\nfor x in X:\r\n A.append(int(x))\r\nb=int(input())\r\nX=input().split()\r\nB=[]\r\nfor x in X:\r\n B.append(int(x))\r\nA.sort()\r\nB.sort()\r\nif a<=b:\r\n for x in A:\r\n if x-1 in B:\r\n B.remove(x-1)\r\n continue\r\n if x in B:\r\n B.remove(x)\r\n continue\r\n if x+1 in B:\r\n B.remove(x+1)\r\n print(b-len(B))\r\nelif a>b:\r\n for x in B:\r\n if x-1 in A:\r\n A.remove(x-1)\r\n continue\r\n if x in A:\r\n A.remove(x)\r\n continue\r\n if x+1 in A:\r\n A.remove(x+1)\r\n print(a-len(A))\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\n\r\ncnt = 0\r\nif len(b)>=len(a) : \r\n for i in range(min(n,m)) :\r\n for j in range(max(n,m)) : \r\n\r\n if abs(a[i]-b[j])<=1 :\r\n cnt+=1\r\n a[i] = -1\r\n b[j] = -1\r\nelse :\r\n for j in range(min(n,m)) :\r\n for i in range(max(n,m)) : \r\n\r\n if abs(a[i]-b[j])<=1 :\r\n cnt+=1\r\n a[i] = -1\r\n b[j] = -1\r\n \r\n \r\n\r\n\r\nprint(cnt)\r\n ", "n = int(input())\r\na = sorted(map(int,input().split()))\r\nm = int(input())\r\nb = sorted(map(int,input().split()))\r\n\r\nc = 0\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if abs(a[i]-b[j])<2:\r\n b[j]=999\r\n c += 1\r\n break\r\nprint(c)", "n = int(input())\r\nboys = list(map(int,input().split()))\r\nm = int(input())\r\ngirls = list(map(int,input().split()))\r\nboys = sorted(boys)\r\ngirls = sorted(girls)\r\nc = 0\r\ni = 0\r\nj = 0\r\nwhile i <n and j<m:\r\n if abs(boys[i]-girls[j])<2:\r\n c += 1\r\n i += 1\r\n j += 1\r\n elif boys[i]>girls[j]:\r\n j += 1\r\n elif boys[i]<girls[j]:\r\n i += 1\r\nprint(c)\r\n", "\"\"\"\r\n4\r\n1 4 6 2\r\n5\r\n5 1 5 7 9\r\n\r\n1 2 4 6\r\n1 5 5 7 9\r\n\r\n4\r\n1 2 3 4\r\n4\r\n10 11 12 13\r\n\r\n5\r\n1 1 1 1 1\r\n3\r\n1 2 3\r\n\r\n\r\n1 2 3 4 6 9\r\n5 7 8 9\r\n\r\n\r\n\r\n\"\"\"\r\ndef bersu_ball(n, boys, m, girls):\r\n boys.sort()\r\n girls.sort()\r\n indx = set()\r\n count = 0\r\n for i in range(n):\r\n for j in range( m):\r\n if j not in indx and ( boys[i] - girls[j] == 0 or abs( boys[i] - girls[j]) == 1 ):\r\n indx.add(j)\r\n count += 1\r\n break\r\n return count\r\n\r\n# print(bersu_ball(6, 4, [1, 2, 3, 4, 6, 9], [5, 7, 8, 9]))\r\nn = input('')\r\nboys = [ int(i) for i in input('').split(' ')]\r\nm = input('')\r\ngirls = [int(i) for i in input('').split(' ')]\r\n# print(girls, boys, n, m)\r\nprint(bersu_ball(int(n), boys, int(m), girls))\r\n \r\n", "n = int(input())\r\nboys = list(map(int, input().split()))\r\nm = int(input())\r\ngirls = list(map(int, input().split()))\r\n\r\nboys.sort()\r\ngirls.sort()\r\n\r\ni = 0\r\nj = 0\r\npairs = 0\r\n\r\nwhile i < n and j < m:\r\n if abs(boys[i] - girls[j]) <= 1:\r\n pairs += 1\r\n i += 1\r\n j += 1\r\n elif boys[i] < girls[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(pairs)\r\n", "n = int(input())\r\nb = sorted([int(el) for el in input().split()])\r\nm = int(input())\r\ng = sorted([int(el) for el in input().split()])\r\n\r\ni = 0\r\nj = 0\r\n\r\nans = 0\r\nwhile i < n and j < m:\r\n if abs(b[i] - g[j]) < 2:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n continue\r\n if b[i] < g[j]:\r\n i += 1\r\n else:\r\n j += 1\r\nprint(ans)", "input()\r\nsigmas = sorted(map(int, input().split()))\r\ninput()\r\nwoman = sorted(map(int, input().split()))\r\ni = 0\r\nn = 0\r\nwhile i < len(sigmas):\r\n j = 0\r\n while j < len(woman):\r\n if abs(sigmas[i]-woman[j]) < 2:\r\n woman[j] = -1\r\n n+=1\r\n break\r\n j+=1\r\n i += 1\r\nprint(n)", "# https://codeforces.com/contest/489/problem/B\r\n\r\ndef lire_skills():\r\n skills = [0] * 102\r\n for ai in map(int, input().split()):\r\n skills[ai] += 1\r\n return skills\r\n\r\ndef associer(i, j):\r\n global a, b, rep\r\n delta = min(a[i], b[j])\r\n a[i] -= delta\r\n b[j] -= delta\r\n rep += delta\r\n\r\ninput()\r\na = lire_skills()\r\ninput()\r\nb = lire_skills()\r\nrep = 0\r\n\r\nfor i in range(1, 101):\r\n associer(i - 1, i)\r\n associer(i, i)\r\n associer(i + 1, i)\r\n\r\nprint(rep)\r\n", "m=int(input())\r\nmm=list(map(int,input().split()))\r\nmm.sort()\r\nn=int(input())\r\nnn=list(map(int,input().split()))\r\nnn.sort()\r\nre=0\r\ni,j=0,0\r\nwhile i<m and j<n:\r\n if mm[i]==nn[j] or abs(mm[i]-nn[j])==1:\r\n i+=1\r\n j+=1\r\n re+=1\r\n elif mm[i]<nn[j]:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(re)", "def solve(b,g):\r\n\r\n b = sorted(b)\r\n g = sorted(g)\r\n\r\n bx = 0\r\n gx = 0\r\n\r\n cont = 0\r\n\r\n while bx < len(b) and gx < len(g):\r\n\r\n bcand = b[bx]\r\n gcand = g[gx]\r\n\r\n #print(bx, gx)\r\n #print(bcand, gcand)\r\n #print(\"-----------\")\r\n\r\n if abs(bcand-gcand)<=1:\r\n #print(\"IT1\")\r\n \r\n \r\n cont += 1\r\n\r\n bx+=1\r\n gx+=1\r\n\r\n elif bcand > gcand:\r\n #print(\"IT2\")\r\n gx+=1\r\n\r\n else:\r\n #print(\"IT3\")\r\n bx += 1\r\n\r\n\r\n return cont\r\n \r\n# num cases\r\n\r\n_ = input()\r\nb = [int(a) for a in input().split(\" \")]\r\n\r\n_ = input()\r\ng = [int(a) for a in input().split(\" \")]\r\n\r\nprint(solve(b,g))", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nIf tie, it's really bad, better to remove one to take the fall (but which one?)\r\nIf majority, there isn't anything you can do\r\n\r\nok you always are in the majority\r\n'''\r\n\r\ndef solve():\r\n\tx = II()\r\n\tb = LII()\r\n\ty = II()\r\n\tg = LII()\r\n\r\n\tb.sort()\r\n\tg.sort()\r\n\r\n\tans = 0\r\n\twhile b and g:\r\n\t\tif abs(b[-1]-g[-1]) > 1:\r\n\t\t\tif b[-1] > g[-1]:\r\n\t\t\t\tb.pop()\r\n\t\t\telse:\r\n\t\t\t\tg.pop()\r\n\t\telse:\r\n\t\t\tb.pop()\r\n\t\t\tg.pop()\r\n\t\t\tans += 1\r\n\tprint(ans)\r\n\r\nsolve()", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nm = int(input())\r\nb = sorted(list(map(int,input().split())))\r\ni,j,ans = 0,0,0\r\nwhile i < n and j < m:\r\n if a[i] == b[j] or a[i] + 1 == b[j] or a[i] == b[j] + 1:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n elif a[i] < b[j]:\r\n i += 1\r\n elif b[j] < a[i]:\r\n j += 1\r\nprint(ans)\r\n ", "count_boys = int(input())\nboys = sorted(list(map(int, input().split())))\ncount_girls = int(input())\ngirls = sorted(list(map(int, input().split())))\nmin_len_arr = girls[:] if count_girls < count_boys else boys[:]\nmax_len_arr = boys[::-1] if count_girls < count_boys else girls[::-1]\npairs = []\nj = 0\nwhile min_len_arr:\n k = min_len_arr.pop()\n if max_len_arr:\n for i in range(len(max_len_arr)):\n if abs(k - max_len_arr[i]) <= 1:\n pairs.append((k, max_len_arr[i]))\n max_len_arr.remove(max_len_arr[i])\n break\nprint(len(pairs))\n", "b=int(input())\nbl=list(map(int,input().split()))\nbl.sort()\ng=int(input())\ngl=list(map(int,input().split()))\ngl.sort()\nk=0\nwhile len(bl)>0 and len(gl)>0:\n if (bl[0]-gl[0]) in [-1,0,1]:\n k+=1\n bl=bl[1:]\n gl=gl[1:]\n elif bl[0]<=gl[0]:\n bl=bl[1:]\n elif bl[0]>=gl[0]:\n gl=gl[1:]\n\nprint(k)\n", "# n, m = map(int, input().split())\nn = int(input())\nboy = list(map(int, input().split()))\nm = int(input())\ngirl = list(map(int, input().split()))\nboy.sort()\ngirl.sort()\nb = 0\ng = 0\npar = 0\nwhile b < n and g < m:\n if abs(boy[b] - girl[g]) <= 1:\n par += 1\n b += 1\n g += 1\n elif boy[b] < girl[g]:\n b += 1\n else:\n g += 1\nprint(par)\n", "def solve(boy, girl):\r\n\r\n pairs = 0\r\n for b in range(len(boy)):\r\n for g in range(len(girl)):\r\n if abs(boy[b] - girl[g]) <= 1:\r\n girl[g] = float('inf')\r\n pairs += 1\r\n break\r\n\r\n return pairs\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n n = int(input())\r\n boys = sorted(map(int, input().split()))\r\n m = int(input())\r\n girls = sorted(map(int, input().split()))\r\n\r\n print(solve(boys, girls))\r\n", "n = int(input())\r\na = sorted([int(el) for el in input().split()])\r\nm = int(input())\r\nb = sorted([int(el) for el in input().split()])\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs(a[i] - b[j]) <= 1:\r\n a[i] = 10000\r\n b[j] = 10000\r\n cnt += 1\r\nprint(cnt)", "def compare(bList,gList):\r\n result=0\r\n for i in range(len(bList)):\r\n for j in range(len(gList)):\r\n if abs(bList[i]-gList[j])<=1:\r\n result+=1\r\n gList[j]=1000\r\n break\r\n return result\r\n\r\n\r\nb=int(input())\r\nb_list=list(map(int,input().split()))\r\ng=int(input())\r\ng_list=list(map(int,input().split()))\r\nb_list=sorted(b_list)\r\ng_list=sorted(g_list)\r\nprint(compare(b_list,g_list))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\na.sort()\r\nb.sort()\r\nans = 0\r\nindex = 0\r\ni = 0\r\nwhile index < n and i < m:\r\n if a[index] < b[i] - 1:\r\n index += 1\r\n elif b[i] - 1 <= a[index] <= b[i] + 1:\r\n ans += 1\r\n index += 1\r\n i += 1\r\n else:\r\n i += 1\r\nprint(ans)", "count_boys = int(input())\r\nboys_list = list(map(int, input().split()))\r\ncount_girls = int(input())\r\ngirls_list = list(map(int, input().split()))\r\nboys_list.sort()\r\ngirls_list.sort()\r\nboy = 0\r\ngirl = 0\r\ncount = 0\r\nwhile boy < count_boys and girl < count_girls:\r\n if abs(boys_list[boy] - girls_list[girl]) <= 1:\r\n count +=1\r\n boy += 1\r\n girl += 1\r\n elif boys_list[boy] < girls_list[girl]:\r\n boy += 1\r\n else:\r\n girl += 1\r\nprint(count)", "n = int(input())\nmen_skills = list(map(int, input().split()))\nm = int(input())\nwomen_skills = list(map(int, input().split()))\n\npairs=0\nmen_skills.sort()\nwomen_skills.sort()\n\nif len(women_skills)>=len(men_skills) : \n for i in range(min(n,m)) :\n for j in range(max(n,m)) : \n if abs(men_skills[i]-women_skills[j])<=1 :\n pairs+=1\n men_skills[i] = -1\n women_skills[j] = -1\nelse :\n for j in range(min(n,m)) :\n for i in range(max(n,m)) : \n if abs(men_skills[i]-women_skills[j])<=1 :\n pairs+=1\n men_skills[i] = -1\n women_skills[j] = -1\n\n\nprint(pairs)\n\t\t\t\t\t\t \t \t \t \t \t \t \t \t\t\t\t \t", "n = int(input())\r\nboys = sorted(list(map(int, input().split())))\r\nm = int(input())\r\ngirls = sorted(list(map(int, input().split())))\r\nanswer = 0\r\np1 = p2 = 0\r\n\r\nwhile p1 < n and p2 < m:\r\n if abs(boys[p1] - girls[p2]) <= 1:\r\n answer += 1\r\n p1 += 1\r\n p2 += 1\r\n else:\r\n if boys[p1] < girls[p2]:\r\n p1 += 1\r\n else:\r\n p2 += 1\r\n\r\nprint(answer)\r\n\r\n", "n=int(input())\r\nboys=list(map(int,input().split()))\r\nm=int(input())\r\ngirls=list(map(int,input().split()))\r\nboys.sort()\r\ngirls.sort()\r\na=0\r\nb=0\r\ncount=0\r\nwhile a<n and b<m:\r\n if abs(boys[a]-girls[b])<=1:\r\n count+=1\r\n a+=1\r\n b+=1\r\n elif boys[a]<girls[b]:\r\n a+=1\r\n else:\r\n b+=1\r\nprint(count)\r\n\r\n", "import sys\r\nnumBoys = int(sys.stdin.readline())\r\nboys = sorted([int(x) for x in sys.stdin.readline().split()])\r\nnumGirls = int(sys.stdin.readline())\r\ngirls = sorted([int(x) for x in sys.stdin.readline().split()])\r\n\r\nx = 0\r\ny = 0\r\nsol = 0\r\nwhile x < len(boys) and y < len(girls):\r\n b = boys[x]\r\n g = girls[y]\r\n match = (b==g or b-1==g or b+1==g)\r\n if match:\r\n x+=1\r\n y+=1\r\n sol+=1\r\n else:\r\n if b==min(b,g):\r\n x+=1\r\n else:\r\n y+=1\r\nprint(sol)\r\n", "n = int(input())\r\nl1 = list(sorted(map(int,input().split())))\r\nm = int(input())\r\nl2 = list(sorted(map(int,input().split())))\r\ncount = 0\r\nindex = 0\r\nflog = True\r\nfor i in range(n) :\r\n key = l1[i]\r\n for j in range(index , m) :\r\n if (l2[j] - key) > 1 :\r\n break\r\n if abs(key - l2[j]) <= 1 :\r\n count += 1\r\n index = j + 1\r\n break\r\nprint(count)" ]

{"inputs": ["4\n1 4 6 2\n5\n5 1 5 7 9", "4\n1 2 3 4\n4\n10 11 12 13", "5\n1 1 1 1 1\n3\n1 2 3", "1\n1\n1\n1", "2\n1 10\n1\n9", "4\n4 5 4 4\n5\n5 3 4 2 4", "1\n2\n1\n1", "1\n3\n2\n3 2", "1\n4\n3\n4 4 4", "1\n2\n4\n3 1 4 2", "1\n4\n5\n2 5 5 3 1", "2\n2 2\n1\n2", "2\n4 2\n2\n4 4", "2\n4 1\n3\n2 3 2", "2\n4 3\n4\n5 5 5 6", "2\n5 7\n5\n4 6 7 2 5", "3\n1 2 3\n1\n1", "3\n5 4 5\n2\n2 1", "3\n6 3 4\n3\n4 5 2", "3\n7 7 7\n4\n2 7 2 4", "3\n1 3 3\n5\n1 3 4 1 2", "4\n1 2 1 3\n1\n4", "4\n4 4 6 6\n2\n2 1", "4\n3 1 1 1\n3\n1 6 7", "4\n2 5 1 2\n4\n2 3 3 1", "4\n9 1 7 1\n5\n9 9 9 8 4", "5\n1 6 5 5 6\n1\n2", "5\n5 2 4 5 6\n2\n7 4", "5\n4 1 3 1 4\n3\n6 3 6", "5\n5 2 3 1 4\n4\n1 3 1 7", "5\n9 8 10 9 10\n5\n2 1 5 4 6", "1\n48\n100\n76 90 78 44 29 30 35 85 98 38 27 71 51 100 15 98 78 45 85 26 48 66 98 71 45 85 83 77 92 17 23 95 98 43 11 15 39 53 71 25 74 53 77 41 39 35 66 4 92 44 44 55 35 87 91 6 44 46 57 24 46 82 15 44 81 40 65 17 64 24 42 52 13 12 64 82 26 7 66 85 93 89 58 92 92 77 37 91 47 73 35 69 31 22 60 60 97 21 52 6", "100\n9 90 66 62 60 9 10 97 47 73 26 81 97 60 80 84 19 4 25 77 19 17 91 12 1 27 15 54 18 45 71 79 96 90 51 62 9 13 92 34 7 52 55 8 16 61 96 12 52 38 50 9 60 3 30 3 48 46 77 64 90 35 16 16 21 42 67 70 23 19 90 14 50 96 98 92 82 62 7 51 93 38 84 82 37 78 99 3 20 69 44 96 94 71 3 55 27 86 92 82\n1\n58", "10\n20 87 3 39 20 20 8 40 70 51\n100\n69 84 81 84 35 97 69 68 63 97 85 80 95 58 70 91 100 65 72 80 41 87 87 87 22 49 96 96 78 96 97 56 90 31 62 98 89 74 100 86 95 88 66 54 93 62 41 60 95 79 29 69 63 70 52 63 87 58 54 52 48 57 26 75 39 61 98 78 52 73 99 49 74 50 59 90 31 97 16 85 63 72 81 68 75 59 70 67 73 92 10 88 57 95 3 71 80 95 84 96", "100\n10 10 9 18 56 64 92 66 54 42 66 65 58 5 74 68 80 57 58 30 58 69 70 13 38 19 34 63 38 17 26 24 66 83 48 77 44 37 78 97 13 90 51 56 60 23 49 32 14 86 90 100 13 14 52 69 85 95 81 53 5 3 91 66 2 64 45 59 7 30 80 42 61 82 70 10 62 82 5 34 50 28 24 47 85 68 27 50 24 61 76 17 63 24 3 67 83 76 42 60\n10\n66 74 40 67 28 82 99 57 93 64", "100\n4 1 1 1 3 3 2 5 1 2 1 2 1 1 1 6 1 3 1 1 1 1 2 4 1 1 4 2 2 8 2 2 1 8 2 4 3 3 8 1 3 2 3 2 1 3 8 2 2 3 1 1 2 2 5 1 4 3 1 1 3 1 3 1 7 1 1 1 3 2 1 2 2 3 7 2 1 4 3 2 1 1 3 4 1 1 3 5 1 8 4 1 1 1 3 10 2 2 1 2\n100\n1 1 5 2 13 2 2 3 6 12 1 13 8 1 1 16 1 1 5 6 2 4 6 4 2 7 4 1 7 3 3 9 5 3 1 7 4 1 6 6 8 2 2 5 2 3 16 3 6 3 8 6 1 8 1 2 6 5 3 4 11 3 4 8 2 13 2 5 2 7 3 3 1 8 1 4 4 2 4 7 7 1 5 7 6 3 6 9 1 1 1 3 1 11 5 2 5 11 13 1", "4\n1 6 9 15\n2\n5 8", "2\n2 4\n2\n3 1", "3\n2 3 5\n3\n3 4 6", "3\n1 3 4\n3\n2 1 5", "2\n5 5\n4\n1 1 1 5", "2\n3 2\n2\n3 4", "2\n3 1\n2\n2 4", "2\n2 3\n2\n2 1", "2\n10 12\n2\n11 9", "3\n1 2 3\n3\n3 2 1", "2\n1 3\n2\n2 1", "2\n4 5\n2\n5 3", "2\n7 5\n2\n6 8", "4\n4 3 2 1\n4\n1 2 3 4", "2\n2 3\n2\n3 1", "2\n2 4\n3\n3 1 8", "3\n3 1 1\n3\n2 4 4", "2\n5 3\n2\n4 6", "4\n1 1 3 3\n4\n2 2 1 1", "3\n3 2 1\n3\n2 4 3", "5\n1 2 3 4 5\n5\n2 3 4 5 1", "3\n3 2 1\n3\n1 2 3", "2\n5 4\n2\n4 6", "4\n3 3 5 5\n4\n4 4 2 2", "3\n2 7 5\n3\n2 4 8", "100\n2 3 3 4 2 1 4 4 5 5 2 1 5 2 3 3 5 4 3 2 4 2 3 3 2 2 3 4 2 2 2 3 1 2 3 2 2 3 5 3 3 3 3 4 5 2 2 1 1 1 3 1 2 2 3 5 5 2 5 1 3 4 5 3 5 4 1 1 2 3 4 4 5 3 2 4 5 5 5 2 1 4 2 4 5 4 4 5 5 3 2 5 1 4 4 2 2 2 5 3\n100\n4 5 3 3 2 2 4 3 1 5 4 3 3 2 2 4 5 2 5 2 1 4 3 4 2 3 5 3 4 4 1 2 3 5 2 2 1 5 4 2 4 3 4 3 4 2 3 1 3 3 4 1 1 1 4 4 5 3 1 4 2 3 2 1 3 3 2 3 2 1 1 2 3 2 1 3 3 4 3 3 1 1 3 3 3 1 1 3 5 3 3 3 3 4 4 5 2 5 4 5", "1\n3\n2\n2 3", "2\n5 6\n3\n1 5 100", "2\n2 7\n2\n6 8", "4\n4 10 15 17\n4\n3 12 16 16", "2\n2 3\n2\n1 2"], "outputs": ["3", "0", "2", "1", "1", "4", "1", "1", "1", "1", "1", "1", "1", "2", "1", "2", "1", "0", "3", "1", "3", "1", "0", "1", "3", "2", "1", "2", "1", "3", "0", "1", "0", "6", "9", "76", "2", "2", "3", "3", "1", "2", "2", "2", "2", "3", "2", "2", "2", "4", "2", "2", "2", "2", "4", "3", "5", "3", "2", "4", "3", "100", "1", "1", "1", "3", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

173

d14d76ed6f3fbd0cf793d69b8bbffa64

Growing Mushrooms

Each year in the castle of Dwarven King there is a competition in growing mushrooms among the dwarves. The competition is one of the most prestigious ones, and the winner gets a wooden salad bowl. This year's event brought together the best mushroom growers from around the world, so we had to slightly change the rules so that the event gets more interesting to watch. Each mushroom grower has a mushroom that he will grow on the competition. Under the new rules, the competition consists of two parts. The first part lasts *t*1 seconds and the second part lasts *t*2 seconds. The first and the second part are separated by a little break. After the starting whistle the first part of the contest starts, and all mushroom growers start growing mushrooms at once, each at his individual speed of *v**i* meters per second. After *t*1 seconds, the mushroom growers stop growing mushrooms and go to have a break. During the break, for unexplained reasons, the growth of all mushrooms is reduced by *k* percent. After the break the second part of the contest starts and all mushrooms growers at the same time continue to grow mushrooms, each at his individual speed of *u**i* meters per second. After a *t*2 seconds after the end of the break, the competition ends. Note that the speeds before and after the break may vary. Before the match dwarf Pasha learned from all participants, what two speeds they have chosen. However, the participants did not want to disclose to him all their strategy and therefore, did not say in what order they will be using these speeds. That is, if a participant chose speeds *a**i* and *b**i*, then there are two strategies: he either uses speed *a**i* before the break and speed *b**i* after it, or vice versa. Dwarf Pasha really wants to win the totalizer. He knows that each participant chooses the strategy that maximizes the height of the mushroom. Help Dwarf Pasha make the final table of competition results. The participants are sorted in the result table by the mushroom height (the participants with higher mushrooms follow earlier in the table). In case of equal mushroom heights, the participants are sorted by their numbers (the participants with a smaller number follow earlier). The first input line contains four integer numbers *n*, *t*1, *t*2, *k* (1<=≤<=*n*,<=*t*1,<=*t*2<=≤<=1000; 1<=≤<=*k*<=≤<=100) — the number of participants, the time before the break, the time after the break and the percentage, by which the mushroom growth drops during the break, correspondingly. Each of the following *n* lines contains two integers. The *i*-th (1<=≤<=*i*<=≤<=*n*) line contains space-separated integers *a**i*, *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=1000) — the speeds which the participant number *i* chose. Print the final results' table: *n* lines, each line should contain the number of the corresponding dwarf and the final maximum height of his mushroom with exactly two digits after the decimal point. The answer will be considered correct if it is absolutely accurate. Sample Input 2 3 3 50 2 4 4 2 4 1 1 1 544 397 280 101 280 101 693 970 Sample Output 1 15.00 2 15.00 4 1656.07 1 937.03 2 379.99 3 379.99

[ "def main():\r\n\r\n n, t1, t2, k = [int(i) for i in input().split()]\r\n\r\n v = []\r\n for i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n v.append([a, b])\r\n\r\n res = []\r\n for i in range(n):\r\n a, b = v[i]\r\n\r\n h1 = a * t1 * (1 - k / 100) + b * t2\r\n h2 = b * t1 * (1 - k / 100) + a * t2\r\n\r\n h = max(h1, h2)\r\n\r\n res.append([i + 1, h])\r\n\r\n\r\n for i, rec in sorted(res, key=lambda x: x[1], reverse=True):\r\n print(f'{i} {rec:.2f}')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,t1,t2,k=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n lst.append((-max((a*t1*((100-k)/100)+b*t2),(b*t1*((100-k)/100)+a*t2)),i+1))\r\nlst.sort()\r\nfor i in range(n):\r\n print('%d %.2f'%(lst[i][1],-lst[i][0]))", "def cf_186_B(a, b, k, p):\r\n ans = []\r\n for i, v in enumerate(p):\r\n mmm = [(a*v[0] - a*v[0]*k/100)+b*v[1], (a*v[1] - a*v[1]*k/100)+b*v[0]]\r\n ans.append((i+1, max(mmm)))\r\n ans.sort(key=lambda x : x[1], reverse=True)\r\n for i in ans:\r\n print(i[0], \"%.2f\" % i[1])\r\nif __name__ == '__main__':\r\n n, t1, t2, k = map(int, input().split())\r\n p = []\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n p.append((a, b))\r\n\r\n cf_186_B(t1, t2, k, p)", "n, t_1, t_2, k = map(int, input().split())\nlst = []\nfor i in range(n):\n a, b = map(int, input().split())\n lst.append((i + 1, max((1-k/100)*a*t_1+b*t_2, (1-k/100)*b*t_1+a*t_2)))\n\nfor i, h in sorted(lst, key=lambda x: (-x[1], x[0])):\n print(i, f'{h:.2f}')", "inp = list(str(input()).strip().split(' '))\r\nip_1 = [int(x) for x in inp]\r\n\r\ntot_growth = {}\r\n\r\nfor dwarf in range(int(ip_1[0])):\r\n inp = list(str(input()).strip().split(' '))\r\n ip_i = [int(x) for x in inp]\r\n # given order\r\n phaseA = ip_i[0] * ip_1[1]\r\n phaseB = (ip_1[3] * phaseA) / 100\r\n phaseC = ip_i[1] * ip_1[2]\r\n tot_given = phaseA-phaseB+phaseC\r\n # reverse order\r\n phaseA = ip_i[1] * ip_1[1]\r\n phaseB = (ip_1[3] * phaseA) / 100\r\n phaseC = ip_i[0] * ip_1[2]\r\n tot_rev = phaseA-phaseB+phaseC\r\n \r\n tot_growth[dwarf] = max(tot_given,tot_rev)\r\n\r\nwinners = sorted(tot_growth.items(), key=lambda x:x[1], reverse=True)\r\n\r\nfor x in winners:\r\n print(\"{} {:.2f}\".format(x[0]+1, x[1]))", "n, t1, t2, k = map(int, input().split())\ntable = dict()\ndef compute(a, b):\n return a*t1*(1 - k/100) + b*t2\nfor i in range(n):\n a, b = map(int, input().split())\n table[i + 1] = max(compute(a, b), compute(b, a))\n\nans = sorted(table.items(), key=lambda x: (-x[1], x[0]))\nfor k, v in ans:\n print(k, \"{:.2f}\".format(v))\n\n", "n, t1, t2, k = map(int, input().split())\r\nl = []\r\nfor i in range(1, n + 1):\r\n v, m = map(int, input().split())\r\n l.append((i, max((1 - k / 100) * v * t1 + m * t2, (1 - k / 100) * m * t1 + v * t2)))\r\n\r\nfor i, h in sorted(l, key=lambda x: (-x[1], x[0])):\r\n print(i, f'{h:.2f}')", "n, t1, t2, k = map(int, input().split())\r\n\r\nplans = {}\r\n\r\nfor i in range(n):\r\n\r\n a, b = map(int, input().split())\r\n\r\n plan1 = ((a * t1) * ((100-k)/100)) + (b * t2) \r\n plan2 = ((b * t1) * ((100-k)/100)) + (a * t2)\r\n\r\n plan = plan1 if plan1 > plan2 else plan2\r\n\r\n plans[i+1] = plan\r\n\r\nsorted_dict = dict(sorted(plans.items(), key=lambda item: item[1], reverse=True))\r\n\r\nfor key, value in sorted_dict.items():\r\n print(key, \"{:.2f}\".format(value))\r\n\r\n", "def main():\r\n n, t1, t2, k = list(map(int, input().split()))\r\n k = k / 100\r\n tournament = []\r\n class player:\r\n def __init__(self, pno, speeds):\r\n self.pno = pno\r\n self.v = speeds[0]\r\n self.u = speeds[1]\r\n self.maxheight = 0\r\n \r\n for i in range(n):\r\n speeds = list(map(int, input().split()))\r\n curplayer = player(i + 1, speeds)\r\n curplayer.maxheight = max((curplayer.u * t1)*(1 - k) + (curplayer.v * t2), (curplayer.v * t1)*(1 - k) + (curplayer.u * t2))\r\n tournament.append(curplayer)\r\n tournament.sort(key=lambda x: x.pno)\r\n tournament.sort(key=lambda x: x.maxheight, reverse=True)\r\n \r\n for p in tournament:\r\n print(p.pno, f'{p.maxheight:.2f}')\r\n\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n, t1, t2, k = map(int, input().split(' '))\nans = []\nfor i in range(n):\n a, b = map(int, input().split(' '))\n vala = ((1 - (k/100))*(a*t1)) + (b*t2)\n valb = ((1 - (k/100))*(b*t1)) + (a*t2)\n val = max(vala, valb)\n ans.append((i+1, val))\nans.sort(key = lambda x: -x[1])\nfor x, y in ans:\n print(\"{} {:.2f}\".format(x, y))", "import sys\r\nimport math\r\nfrom heapq import *;\r\ninput = sys.stdin.readline\r\nfrom functools import cmp_to_key;\r\n\r\ndef pi():\r\n return(int(input()))\r\ndef pl():\r\n return(int(input(), 16))\r\ndef ti():\r\n return(list(map(int,input().split())))\r\ndef ts():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nmod = 1000000007;\r\nf = [];\r\ndef fact(n,m):\r\n global f;\r\n f = [1 for i in range(n+1)];\r\n f[0] = 1;\r\n for i in range(1,n+1):\r\n f[i] = (f[i-1]*i)%m;\r\n\r\ndef fast_mod_exp(a,b,m):\r\n res = 1;\r\n while b > 0:\r\n if b & 1:\r\n res = (res*a)%m;\r\n a = (a*a)%m;\r\n b = b >> 1;\r\n return res;\r\n\r\ndef inverseMod(n,m):\r\n return fast_mod_exp(n,m-2,m);\r\n\r\ndef ncr(n,r,m):\r\n if n < 0 or r < 0 or r > n: return 0;\r\n if r == 0: return 1;\r\n return ((f[n]*inverseMod(f[n-r],m))%m*inverseMod(f[r],m))%m;\r\n\r\ndef main():\r\n B();\r\n\r\ndef cmp(a,b):\r\n if a[1] < b[1]: return 1;\r\n if a[1] > b[1]: return -1;\r\n if a[1] == b[1]:\r\n if a[0] < b[0]: return -1;\r\n else: return 1;\r\n\r\ndef B():\r\n [n,t1,t2,k] = ti();\r\n a,b = [],[];\r\n for i in range(n):\r\n [x,y] = ti();\r\n a.append(x);\r\n b.append(y);\r\n pair = [0 for i in range(n)];\r\n for i in range(n):\r\n pair[i] = [i,round(max(t1*a[i]*(100-k)/100+t2*b[i], t1*b[i]*(100-k)/100+t2*a[i]),2)];\r\n\r\n pair.sort(key=cmp_to_key(cmp));\r\n \r\n for i in range(n):\r\n print(pair[i][0]+1, pair[i][1] if len(str(pair[i][1]).split('.')[1]) == 2 else str(pair[i][1])+'0');\r\n\r\nmain();", "def inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n \r\n \r\nn, t1, t2, k = inp()\r\nspeeds = list()\r\nfor i in range(n):\r\n x, y = inp()\r\n speeds.append((x, y))\r\na = list()\r\nfor i in range(n):\r\n temp1 = speeds[i][0]*t1-(speeds[i][0]*t1*k/100)+speeds[i][1]*t2\r\n temp2 = speeds[i][1]*t1-(speeds[i][1]*t1*k/100)+speeds[i][0]*t2\r\n if(temp1 >= temp2):\r\n a.append((i+1, temp1))\r\n else:\r\n a.append((i+1, temp2))\r\na.sort(key=lambda x: (-x[1], x[0]))\r\nfor i in range(len(a)):\r\n print(a[i][0], end=\" \")\r\n print(\"{:.2f}\".format(a[i][1]))", "num_testcases = 1 #int(input())\r\nfor _ in range(num_testcases):\r\n num_participant, time_before_break, time_after_break, percentage = map(int,input().split())\r\n \r\n result = []\r\n for i in range(num_participant):\r\n \r\n a, b = map(int,input().split())\r\n max_s = max(a*time_before_break - (percentage*a*time_before_break)/100.0 + b*time_after_break, b*time_before_break - (percentage*b*time_before_break)/100.0 + a*time_after_break)\r\n result.append([i+1, max_s])\r\n #print(result)\r\n \r\n result.sort(key = lambda c:c[1], reverse=True)\r\n \r\n for i in result:\r\n print(i[0],\"%.2f\" % i[1])", "n, t1, t2, k = list(map(int, input().split()))\r\nk /= 100\r\ngreater_first = t1 * (1 - k) > t2\r\nre = []\r\nfor num in range(1, n + 1):\r\n a, b = list(map(int, input().split()))\r\n h = 0\r\n if greater_first:\r\n h += t1 * max(a, b)\r\n h *= (1 - k)\r\n h += t2 * min(a, b)\r\n else:\r\n h += t1 * min(a, b)\r\n h *= (1 - k)\r\n h += t2 * max(a, b)\r\n h = round(h, 2)\r\n re.append((h, num * -1))\r\nre.sort(reverse=True)\r\nfor h, num in re:\r\n # print(num * -1, h)\r\n print(num * -1, \"{:.2f}\".format(h))", "resLis = []\r\nn , t1 , t2 , k = map(int, input().split())\r\nfor i in range(n):\r\n spA , spB = map(int, input().split())\r\n heightA = (spA * t1 * ((100-k)/100)) + (spB * t2)\r\n heightB = (spB * t1 * ((100-k)/100)) + (spA * t2)\r\n maxHeight = \"{:.2f}\".format(max(heightA , heightB))\r\n resLis.append((i+1,float(maxHeight)))\r\nresLis.sort(key=lambda a: a[1], reverse=True)\r\nfor element in resLis:\r\n print(f'{element[0]} {element[1]:.2f}')", "\"\"\"\nProblem link: \nSolution By Keshav Mishra \n\"\"\"\nfrom sys import stdin,stdout\nfrom collections import Counter , deque\nfrom queue import PriorityQueue\nimport math\n\n\nhelperConstants = True \nhelperUtilityFunctions = True \n\ndef input(): return stdin.readline().strip()\n# def print(s): stdout.write(str(s)+'\\n')\nif helperConstants:\n YES = 'YES'\n NO = 'NO'\n yes = 'yes'\n no = 'no'\n true = 'true'\n false = 'false'\n FALSE = 'FALSE'\n TRUE = 'TRUE'\n IMPOSSIBLE = 'IMPOSSIBLE'\n POSSIBLE = 'POSSIBLE'\n INF = float('inf')\n\nif helperUtilityFunctions:\n # Input utility functions\n def getInputArray():\n return list(map(int, input().split()))\n def getIntegerInputs():\n return map(int, input().split())\n def getInputIntegerMatrix(n):\n matrix = []\n for i in range(n):\n matrix.append(list(map(int,input().split())))\n return matrix\n def getInputStringMatrix(n):\n matrix = []\n for i in range(n):\n matrix.append(input())\n return matrix\n\n # Output Utility functions\n def outputIntegerMatrix(matrix):\n for i in range(len(matrix)):\n print(*matrix[i])\n def outputStringMatrix(matrix):\n for i in range(len(matrix)):\n print(matrix[i])\n def kickstartoutput(testcase,*outputs):\n print('Case #%d:'%(testcase), *outputs)\n \n \n\n\ndef solve():\n n, t1, t2, k = getIntegerInputs()\n participants = []\n k = 1 - k*0.01\n for i in range(n):\n a, b = getIntegerInputs()\n ans1 = 0\n ans2 = 0 \n ans1 += a*t1 \n ans1 = ans1*k\n ans1 += b*t2 \n ans2 += b*t1 \n ans2 = ans2*k \n ans2 += a*t2 \n ans = max(ans1,ans2)\n participants.append({'index':i + 1, 'value':ans})\n participants.sort(reverse = True, key = lambda x : x['value'])\n for participant in participants:\n print('%d %.2f'%(participant['index'], participant['value']))\n\n\n\n\n \nif __name__ == '__main__':\n solve()\n ", "from decimal import Decimal \r\nn, t1, t2, k = map(int, input().strip().split())\r\nl = []\r\ni = 1\r\nwhile n != 0:\r\n x, y = map(int, input().strip().split())\r\n p1 = x * t1 - (((x * t1) / 100) * k) + y * t2\r\n p2 = y * t1 - (((y * t1) / 100) * k) + x * t2\r\n g = max(p1, p2)\r\n l.append([i,g])\r\n i += 1\r\n n -= 1\r\nl.sort(key=lambda el: el[1], reverse=True)\r\nfor i in range(0, len(l)):\r\n print('%d %.2f' %(l[i][0], l[i][1]))\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, t1, t2, k = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d.append((i+1, max(a*t1*(100-k)/100 + b*t2, b*t1*(100-k)/100 + a*t2)))\r\n\r\nd.sort(key=lambda x:x[1], reverse=True)\r\nfor i in d:\r\n print(i[0], format(i[1], '.2f'))", "[n, t1, t2, k] = map(lambda x: int(x), input().strip().split(maxsplit=4))\r\n\r\nmax_height = []\r\n\r\nfor i in range(n):\r\n [a, b] = map(lambda x: int(x), input().strip().split(maxsplit=2))\r\n c = a * t1 - (a*t1*(k/100)) + b * t2\r\n d = b * t1 - (b*t1*(k/100)) + a * t2\r\n if c >= d:\r\n max_height.append((i+1, c))\r\n else:\r\n max_height.append((i+1, d))\r\n\r\nmax_height.sort(key=lambda x: x[0])\r\nmax_height.sort(key=lambda x: x[1], reverse=True)\r\n\r\nfor _ in max_height:\r\n print(f\"{_[0]} {_[1]:.2f}\")\r\n", "def comp(item1, item2):\r\n if item1[0] > item2[0]:\r\n return True\r\n elif item2[0] > item1[0]:\r\n return False\r\n else:\r\n if item1[1] < item2[1]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef mergeSort(nums):\r\n if len(nums)<2:\r\n return nums\r\n else:\r\n mid = len(nums)//2\r\n left = mergeSort(nums[:mid])\r\n right = mergeSort(nums[mid:])\r\n\r\n temp = []\r\n i = 0\r\n j = 0\r\n while i<len(left) and j<len(right):\r\n if comp(left[i], right[j]):\r\n temp.append(left[i])\r\n i += 1\r\n else:\r\n temp.append(right[j])\r\n j += 1\r\n \r\n if i<len(left):\r\n temp.extend(left[i:])\r\n \r\n if j<len(right):\r\n temp.extend(right[j:])\r\n \r\n return temp\r\n\r\n\r\nn, t1, t2, k = map(int, input().split())\r\nnums = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n val = max(\r\n (a*t1)*(1-k/100) + b*t2,\r\n (b*t1)*(1-k/100) + a*t2,\r\n )\r\n nums.append([val, i+1])\r\nnums = mergeSort(nums)\r\nfor i in nums:\r\n print(\"{} {:.2f}\".format(i[1], i[0]))\r\n", "num,t1,t2,per = map(int,input().split())\r\nk = []\r\nc = 9999999999999999\r\nfor i in range(1,num+1):\r\n p = list(map(int,input().split()))\r\n p.sort()\r\n a = float(\"{:.2f}\".format(p[0]*t1*(100-per)/100+p[1]*t2))\r\n b = float(\"{:.2f}\".format(p[1]*t1*(100-per)/100+p[0]*t2))\r\n k.append([float(max(a,b)),c,i])\r\n c -= 1\r\nk.sort()\r\nk.reverse()\r\nfor i in k:\r\n print(i[2],\"{:.2f}\".format(i[0]))", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, t1, t2, k = (int(i) for i in read().split())\r\n k = 1 - (k / 100)\r\n results: list[tuple[int, int]] = []\r\n for i in range(n):\r\n s1, s2 = (int(i) for i in read().split())\r\n result = max((s1 * t1) * k + (s2 * t2), (s2 * t1) * k + (s1 * t2))\r\n results.append((result, i +1))\r\n\r\n results.sort(key=lambda x: (-x[0], x[1]))\r\n for val in results:\r\n value, i = val\r\n print(f'{i} {value:.2f}')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, t1, t2, k = map(int, input().split())\r\nlis = []\r\narr = []\r\nfor i in range(n):\r\n\th, h1, h2, h11, h22, hh = 0, 0, 0, 0, 0, 0\r\n\ta, b = map(int, input().split())\r\n\t\r\n\th1 = a * t1 \r\n\th11 = b * t1 \r\n\th1 = h1 - (k * h1) / 100\r\n\th11 = h11 - (k * h11) / 100 \r\n\th2 = b * t2\r\n\th22 = a * t2 \r\n\th = h1 + h2 \r\n\thh = h11 + h22 \r\n\tarr.append(max(h, hh))\r\n\tc = max(h, hh)\r\n\tc = '%.2f'%c\r\n\tlis.append(c)\r\ndic = {}\r\nfor i in range(len(lis)):\r\n\tif lis[i] in dic:\r\n\t\tdic[lis[i]].append(i + 1)\r\n\telse:\r\n\t\tdic[lis[i]] = [i + 1]\r\nse = set(arr)\r\nnew_arr = []\r\nfinal_arr = []\r\nfor i in se:\r\n\tnew_arr.append(i)\r\nnew_arr.sort(reverse = True)\r\nfor j in new_arr:\r\n\tj = '%.2f'%j\r\n\tfinal_arr.append(j)\r\n'''print(dic)\r\nprint(final_arr)'''\r\nfor i in final_arr:\r\n\tfor j in dic[i]:\r\n\t\tprint(j, i)\r\n\r\n", "n,t1,t2,k=list(map(int,input().split(\" \")))\nk = (100-k) * 0.01\nai=[]\nbi=[]\nfor _ in range(n):\n a,b = list(map(int,input().split(\" \")))\n ai.append(a)\n bi.append(b)\nscores=list()\nfor i,j in zip(ai,bi) :\n scores.append( round( max( (i*t1*k)+(t2*j),(t1*j*k)+(t2*i)) ,2) )\n\nfor i,j in sorted(zip(range(1,n+1),scores),key = lambda pair: pair[1],reverse=True):\n print('{0} {1:.2f}'.format(i,j))", "\r\n# Problem: B. Growing Mushrooms\r\n# Contest: Codeforces - Codeforces Round #118 (Div. 2)\r\n# URL: https://codeforces.com/contest/186/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,t1,t2,k = get_ints()\r\narr = []\r\nfor i in range(n):\r\n\ta,b = get_ints()\r\n\tmi = min(a,b)\r\n\tma = max(a,b)\r\n\t# print(mi)\r\n\tx = max(t1*a*(1-(k/100))+b*t2,t1*b*(1-(k/100))+a*t2)\r\n\tarr.append([str(i+1),\"{:.2f}\".format(x)])\r\n\r\nfor row in sorted(arr,key =lambda x: float(x[1]),reverse = True):\r\n\tprint(\" \".join(row))", "\r\nfrom collections import deque\r\n\r\nn , t1 , t2, k = map(int,input().split())\r\nl = deque()\r\n\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n r1 = a * t1 - a * t1 * k/100 + b * t2\r\n r2 = b * t1 - b * t1 * k/100 + a * t2\r\n\r\n l.append([i + 1 ,max(r1 , r2)])\r\n\r\nl = list(l)\r\n\r\nl.sort(key= lambda x : x[1] , reverse= True)\r\n\r\n#print(l)\r\n\r\nfor i in range(len(l)):\r\n print('%d %.2f'%(l[i][0] , l[i][1]))\r\n", "n,t1,t2,k = map(int,input().split())\nmatrix = []\nfor i in range(n):\n a ,b = map(int,input().split())\n choice1 = ((a*t1)-a*t1*(k/100)) + (b*t2)\n choice2 = ((b*t1)-b*t1*(k/100))+ (a*t2)\n a = [i+1 , max(choice1,choice2)]\n matrix.append(a)\nmatrix.sort(key=lambda x:x[1],reverse=True)\nfor i in matrix:\n print(\"{} {:.2f}\".format(i[0],i[1]))\n", "n, t1, t2, k = map(int, input().split())\r\n\r\nresults = [] # Initialize a list to store results\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n a,b = min(a,b), max(a,b)\r\n # Calculate the growth in the first part\r\n growth_1_a = a * t1\r\n growth_1_b = b * t1\r\n # Calculate the reduction during the break\r\n reduced_growth_a = (k / 100) * growth_1_a\r\n reduced_growth_b = (k / 100) * growth_1_b\r\n\r\n # Calculate the growth in the second part\r\n growth_2_a = a * t2\r\n growth_2_b = b * t2\r\n \r\n # Calculate the total height of the mushroom\r\n total_height = max(growth_1_a - reduced_growth_a + growth_2_b,growth_1_b - reduced_growth_b + growth_2_a)\r\n \r\n results.append((i + 1, total_height))\r\n\r\n# Sort the results based on total height (descending) and original order\r\nresults.sort(key=lambda x: (-x[1], x[0]))\r\n\r\n# Print the results table\r\nfor result in results:\r\n print(result[0], '{:.2f}'.format(result[1]))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 3 12:38:21 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 40 - CF186-DIV2B\r\n\"\"\"\r\n\r\nn, t1, t2, k = map(int,input().split())\r\ngrowths = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n growths.append((i+1,max((a*t1)*(1 - k/100) + b*t2, b*t1*(1-k/100) + a*t2)))\r\n\r\ngrowths.sort(key = lambda x: (-x[1],x[0]))\r\nfor i in range(n):\r\n print(growths[i][0], '{:.2f}'.format(growths[i][1]))\r\n \r\n \r\n\r\n", "n, t1, t2, k = map(int, input().split())\r\nl = list(list(map(int, input().split())) for i in range(n))\r\ns = {}\r\nif t1 * (100-k)/100 >= t2:\r\n for i in range(n):\r\n s[i + 1] = max(l[i]) * t1 * (100-k)/100 + min(l[i]) * t2\r\nelse:\r\n for i in range(n):\r\n s[i + 1] = min(l[i]) * t1 * (100-k)/100 + max(l[i]) * t2\r\ns = {k: v for k, v in sorted(s.items(), key=lambda item: item[1], reverse=True)}\r\nfor i, j in s.items():\r\n print(i, '{:.2f}'.format(j), sep=' ')\r\n", "#from sys import maxsize\r\n#from collections import Counter as cnt, defaultdict as dic\r\n#import string\r\nfrom decimal import Decimal as de\r\nget_int = lambda: int(input())\r\nget_mul_int = lambda: map(int, input().rstrip().split())\r\nget_list = lambda: list(map(int, input().rstrip().split()))\r\n\r\nTEST_CASES = False\r\ndef main():\r\n n,t1,t2,k=get_mul_int()\r\n table= []\r\n for j in range(n):\r\n a,b=get_mul_int()\r\n h1=(de(a*t1*((100-k)/100))+(b*t2))\r\n h2=(de(b*t1*((100-k)/100))+(a*t2))\r\n table.append([j+1,round(max(h1,h2),2)])\r\n new=sorted(table,key=lambda x: x[-1],reverse=True)\r\n for i in new:\r\n print(*i)\r\n \r\n# START\r\nif not TEST_CASES: main()\r\nelse: [main() for _ in range(int(input()))]\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\n\ndef MyFunc(e):\n return(e[1])\n\ndata = sys.stdin.readline()[:-1].split(' ')\nn, t1, t2, k = int(data[0]), int(data[1]), int(data[2]), int(data[3])\nt1 *= 1-k/100\nif t2 > t1:\n t1, t2 = t2, t1\ndwarves = [[0,0] for _ in range(n)]\nfor i in range(n):\n dwarves[i][0] = i+1\n vu = sys.stdin.readline()[:-1].split(' ')\n v, u = int(vu[0]), int(vu[1])\n if u > v:\n u, v = v, u\n dwarves[i][1] = v*t1 + u*t2\n\ndwarves.sort(key=MyFunc, reverse = True)\nfor i in range(n):\n print(dwarves[i][0], \"%.2f\" % dwarves[i][1])\n\t\t\t \t\t\t \t \t \t \t \t\t \t \t\t \t \t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Growing Mushrooms\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, t1, t2, k = list(map(int, input().split()))\r\n p = []\r\n for _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n p.append([_+1, (max((t1*a)-((k/100)*(t1*a))+(t2*b), (t1*b)-((k/100)*(t1*b))+(t2*a)))])\r\n \r\n for i in sorted(p, key=lambda x: x[1], reverse=True):\r\n print(i[0], \"%.2f\" %i[1])\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, t1, t2, k = map(int, input().split())\nd = []\nbef = True\nif t1 < t2:\n bef = False\n\nfor i in range(n):\n a, b = map(int, input().split())\n if bef:\n tot = max(\n t2 * a + t1 * b - (k / 100) * t1 * b,\n t2 * b + t1 * a - (k / 100) * t1 * a \n )\n else:\n small = min(a, b) * t1\n tot = small + max(a, b) * t2 - small * (k / 100) \n\n\n d.append([i+1, tot])\n\nfor l in sorted(d, key=lambda x: (x[1], x[0] * -1), reverse=True):\n print(l[0], f\"{l[1]:.2f}\")", "n, t1, t2, k = [int(x) for x in input().split()]\n\ndef f(v, u):\n res1 = ((t1 * v) * (100-k) / 100) + t2 * u\n res2 = ((t1 * u) * (100-k) / 100) + t2 * v\n\n return max(res1, res2)\n\ndata = []\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n\n data.append((f(a,b), -(i+1)))\n\ndata.sort(reverse=True)\n\nfor h, ind in data:\n print(-ind, f'{h:.2f}')\n", "from sys import stdin\n\nn, t1, t2, k = map(int, stdin.readline().split())\nk = float(k)\n\nheights = []\nfor i in range(n):\n u, v = map(int, stdin.readline().split())\n h = max(u * t1 * (1 - k / 100) + v * t2, v * t1 * (1 - k / 100) + u * t2)\n heights.append((h, i))\n\n\n# do the sorting\ndef compare_function(pair1, pair2):\n if pair1[0] == pair2[0]:\n return pair2[1] - pair1[1]\n return pair1[0] - pair2[0]\n\nfrom functools import cmp_to_key\nheights.sort(key=cmp_to_key(compare_function), reverse=True)\n# heights = sorted(heights, cmp=compare_function)\n\nfor height, id in heights:\n print(f\"{id+1}\",\"{:.2f}\".format(height))\n\n", "def getkey (item):\r\n return item[1]\r\n\r\nn, t1, t2, k = map(int, input().split())\r\n\r\nboard = []\r\n\r\nfor i in range(n):\r\n v, u = map(int, input().split())\r\n mx = max( (v*t1 * (100-k)/100) + (u*t2), (u*t1 * (100-k)/100) + (v*t2) )\r\n \r\n board.append([i+1, mx])\r\nboard = sorted(board, key= getkey, reverse= True)\r\n\r\n\r\nfor i in board:\r\n print(i[0], \"{:.2f}\".format(i[1]) )\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,t1,t2,k=get_ints()\r\nans=[]\r\nfor i in range(n):\r\n a,b=get_ints()\r\n #case1\r\n v1=((a*t1)*(1-(k/100)))+(b*t2)\r\n #case2\r\n v2=((b*t1)*(1-(k/100)))+(a*t2)\r\n v=max(v1,v2)\r\n ans.append([i+1,v])\r\nans.sort(reverse=True, key=lambda x:x[1])\r\nfor i in ans:\r\n print(i[0],\"{:0.2f}\".format(i[1]))", "I = lambda: map(int, input().split())\r\n\r\nn, t1, t2, k = I()\r\nres = []\r\n\r\nfor i in range(n):\r\n a, b = I()\r\n res.append((i, max((1-k/100)*a*t1+b*t2, (1-k/100)*b*t1+a*t2)))\r\n\r\nfor i,h in sorted(res, key=lambda x: (-x[1], x[0])):\r\n\tprint(i+1, f'{h:.2f}')", "# link: https://codeforces.com/contest/186/problem/B\r\n\r\nfrom collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n n,t1,t2,k = map(int, input().split())\r\n results = defaultdict(list)\r\n i = 1\r\n while n:\r\n # 2 cases\r\n # consider t1 first and then t2\r\n a,b = map(int, input().split())\r\n first_height = ((a*t1) - (a*t1*k/100)) + (b*t2)\r\n second_height = ((b*t1) - (b*t1*k/100)) + (a*t2)\r\n height = round(max(first_height, second_height), 2)\r\n results[height].append(i)\r\n i += 1\r\n n -= 1\r\n for key in sorted(results, reverse = True):\r\n for i in results[key]:\r\n s = str(key)\r\n s = s.split('.')\r\n if len(s[-1]) == 1:\r\n print(i, s[0]+'.'+s[-1]+'0')\r\n else: \r\n print(i,key)\r\n", "n,t1,t2,k=list(map(int,input().split()))\r\nresult=[]\r\nfor i in range(n):\r\n v,u=(list(map(int,input().split())))\r\n result.append([max(v*t1*(100-k)+u*t2*100,u*t1*(100-k)+v*t2*100),i])\r\nresult.sort(reverse=True,key=lambda x:x[0])\r\nfor i in result:\r\n print(str(i[1]+1)+\" %.2f\" % (i[0]/100))\r\n\n# Sun Aug 11 2019 15:25:36 GMT+0300 (MSK)\n", "# -*- coding: utf-8 -*-\r\n\r\nr'''\r\n\r\n HAIL TLRX\r\n .----------------. .----------------. .----------------.\r\n| .--------------. | | .--------------. | | .--------------. |\r\n| | _______ | | | | _________ | | | | ____ ____ | |\r\n| | |_ __ \\ | | | | |_ ___ | | | | | |_ _||_ _| | |\r\n| | | |__) | | | | | | |_ \\_| | | | | \\ \\ / / | |\r\n| | | __ / | | | | | _| _ | | | | > `' < | |\r\n| | _| | \\ \\_ | | | | _| |___/ | | | | | _/ /'`\\ \\_ | |\r\n| | |____| |___| | | | | |_________| | | | | |____||____| | |\r\n| | | | | | | | | | | |\r\n| '--------------' | | '--------------' | | '--------------' |\r\n '----------------' '----------------' '----------------'\r\n\r\n\r\n* @Author: Kunal Verma\r\n\r\nCodeForces - kunalverma19\r\nCodeChef - kunalverma_19\r\nAtCoder - TLKunalVermaRX\r\n\r\n* @Last Modified by: thelords\r\n* @Modified Time: 2021-10-26 10:06:48 (IST)\r\n'''\r\n\r\n\r\n# import math\r\n# from math import ceil, floor\r\n# import re\r\n# import string\r\n# import sys\r\n# from itertools import permutations\r\n# from collections import Counter\r\n# import itertools\r\n# MOD = 1000000007\r\ndef inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n\r\n\r\nn, t1, t2, k = inp()\r\nspeeds = list()\r\nfor i in range(n):\r\n x, y = inp()\r\n speeds.append((x, y))\r\na = list()\r\nfor i in range(n):\r\n temp1 = speeds[i][0]*t1-(speeds[i][0]*t1*k/100)+speeds[i][1]*t2\r\n temp2 = speeds[i][1]*t1-(speeds[i][1]*t1*k/100)+speeds[i][0]*t2\r\n if(temp1 >= temp2):\r\n a.append((i+1, temp1))\r\n else:\r\n a.append((i+1, temp2))\r\na.sort(key=lambda x: (-x[1], x[0]))\r\nfor i in range(len(a)):\r\n print(a[i][0], end=\" \")\r\n print(\"{:.2f}\".format(a[i][1]))\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, t1, t2, k = inp()\r\nans = []\r\nfor i in range(n):\r\n a, b = inp()\r\n height = max(t1 * a * ((100 - k) / 100) + t2 * b, t1 * b * ((100 - k) / 100) + t2 * a)\r\n ans.append([i + 1, height, 2])\r\n\r\nans.sort(key=lambda x: x[1], reverse=True)\r\n\r\nfor i in range(n):\r\n print(ans[i][0], '{:.2f}'.format(ans[i][1]))\r\n", "n, t1, t2, k = [int(x) for x in input().split()]\r\nk = (100-k)/100\r\nres = []\r\ndict = {}\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n temp = max(a*t1*k + b*t2, b*t1*k + a*t2)\r\n if temp in dict:\r\n dict[temp].append(i+1)\r\n else: \r\n dict[temp] = [i+1]\r\n res.append(temp)\r\nres.sort(reverse=True)\r\nfor item in res:\r\n temp = \"{:.2f}\".format(item)\r\n for obj in dict[item]:\r\n print(obj, temp)\r\n\r\n", "n , t1 , t2 , k = map(int,input().split())\r\n\r\nl = []\r\ni = 1\r\nwhile n != 0 :\r\n\r\n a , b = map(int,input().split())\r\n\r\n r1 = a * t1 - (((a * t1) / 100) * k ) + b * t2\r\n r2 = b * t1 - (((b * t1) / 100) * k) + a * t2\r\n g = max(r1 , r2)\r\n\r\n l.append([i , g])\r\n i +=1\r\n n -=1\r\n\r\nl.sort(key= lambda x : x[1] , reverse= True)\r\n\r\nfor i in range(len(l)):\r\n\r\n print('%d %.2f' % (l[i][0] ,l[i][1] ))", "n,t1,t2,k=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n temp1=a*t1-(a*t1*k/100)+b*t2\r\n temp2=b*t1-(b*t1*k/100)+a*t2\r\n if temp1>temp2:\r\n s.append([temp1,-i-1])\r\n else:\r\n s.append([temp2,-i-1])\r\ns.sort(reverse=True)\r\nfor i,z in s:\r\n print('%d %.2f' % (-z,i))", "def l_():\r\n return list(map(int,input().split()))\r\nn,t1,t2,k=map(int, input().split())\r\nd = {}\r\nk=k/100\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n best = max(a*t1-a*t1*k+b*t2, b*t1-b*t1*k+a*t2)\r\n d[i+1]=best\r\n#print(d)\r\nsd=sorted(d.items(), key=lambda x:x[1], reverse=True)\r\nfor i in range(n):\r\n print(sd[i][0],\"%.2f\" % sd[i][1])", "n, t1, t2, k = map(int, input().split())\r\nk = k / 100\r\n# print(k)\r\ndashboard = {}\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n meters1 = (a * t1) - (a * t1 * k) + (b * t2)\r\n meters2 = (b * t1) - (b * t1 * k) + (a * t2)\r\n # print(meters)\r\n dashboard[_ + 1] = [max(meters1, meters2)]\r\ndashboard = sorted(dashboard.items(), key=lambda x: x[1], reverse=True)\r\nfor i in range(n):\r\n print(dashboard[i][0], end=' ')\r\n print(\"{:.2f}\".format(dashboard[i][1][0]))\r\n", "n, t1, t2, k = map(int, input().split())\r\ntable = []\r\nfor i in range(1, n+1):\r\n a, b = map(int, input().split())\r\n c1 = a*t1*(1-k/100) + b*t2\r\n c2 = b*t1*(1-k/100) + a*t2\r\n if c1 > c2:\r\n c = c1\r\n else:\r\n c = c2\r\n table.append((i, f\"{c:.2f}\"))\r\nfor e in sorted(table, key=lambda x: float(x[1]), reverse=True):\r\n print(*e)\r\n", "n, t1, t2, k = map(int,input().split())\r\nls = {}\r\nfor _ in range(n):\r\n\ta , b = map(int,input().split())\r\n\tls[_+1] = max((a*t1*(1-k/100)+b*t2),(b*t1*(1-k/100)+a*t2))\r\n\r\nl = sorted(ls.items(), key=lambda x: x[1],reverse = True)\r\nfor key,val in l:\r\n\tprint(key,\"{:.2f}\".format(val))", "n, t1, t2, k = map(int, input().split())\ncontestants = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\tx = (100-k)/100*a*t1 + b*t2\n\ty = (100-k)/100*b*t1 + a*t2\n\tcontestants.append((-max(x, y), i+1))\ncontestants.sort()\nfor value, pos in contestants:\n\tprint('%d %.2f' % (pos, -value))\n\n \t\t\t \t\t\t\t\t \t \t\t\t \t\t\t", "n, t1, t2, k = map(int, input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l.append((i+1, max(a*t1*(1-(k/100))+b*t2, b*t1*(1-(k/100))+a*t2)))\r\n\r\nl.sort(key=lambda x: x[1], reverse=True)\r\nfor a, b in l:\r\n print(a, \"{:.2f}\".format(b))", "n,t1,t2,c = tuple([int(d) for d in input().split(\" \")])\r\n \r\narr = list()\r\nfor i in range(0,n):\r\n items = [int(g) for g in input().split(\" \")]\r\n val1 = t1*items[0] - (t1*items[0]*(c/100.00)) + (t2/1.00)*(items[1]/1.00)\r\n val2 = t1*items[1] - (t1*items[1]*(c/100.00)) + (t2/1.00)*(items[0]/1.00)\r\n \r\n arr.append([max([val1, val2]), i+1])\r\n \r\nsorted_arr = sorted(arr, key=lambda x: x[0] , reverse=True)\r\nfor i in range(0,len(sorted_arr)):\r\n print(str(sorted_arr[i][1]) + \" \" + str(\"{0:.2f}\".format(sorted_arr[i][0])))", "n, t1, t2, k = map(int,input().split())\r\ndwarfs = []\r\nfor i in range(n):\r\n v,u = tuple(map(int,input().split()))\r\n first = t1*v\r\n second = t2*u\r\n s1 = first - (first*k/100) +second\r\n first = t1*u\r\n second = t2*v\r\n s2 = first - (first*k/100) +second\r\n dwarfs.append((i+1,max([s1,s2])))\r\ndwarfs.sort(key= lambda x : x[1],reverse=1)\r\n[print(d,'{:.2f}'.format(s))for d,s in dwarfs]", "\r\nimport operator\r\n\r\nn, t1, t2, l = map(int, input().split())\r\npartData = []\r\nfinalData = []\r\nfor x in range(n):\r\n\tpartData.append(list(map(int, input().split())))\r\n\r\ncounter = 1\r\nfor j, k in partData:\r\n\tif (((j*t1) - (j*t1)*(l/100)) + k*t2) > (((k*t1) - (k*t1)*(l/100)) + j*t2):\r\n\t\tfinalData.append((counter, (((j*t1) - (j*t1)*(l/100)) + k*t2)))\r\n\telse:\r\n\t\tfinalData.append((counter, (((k*t1) - (k*t1)*(l/100)) + j*t2)))\r\n\tcounter += 1\r\n\r\n\r\nfinalData = sorted(finalData, key=operator.itemgetter(1), reverse = True)\r\n\r\n\r\nfor x, y in finalData:\r\n\tprint(\"{} {:.2F}\".format(x, y))", "# Author: wizplus\n# TIme: 2020-08-26 09:24:24\n\n\ndef main():\n n, t1, t2, k = list(map(int, input().split()))\n\n res = []\n for i in range(1, n+1):\n a, b = list(map(int, input().split()))\n ta =a*t1 * (1-k/100) + b*t2\n tb = b*t1 * (1-k/100) + a*t2\n t = max(ta, tb)\n res.append([i, t])\n\n res = sorted(res, key=lambda x: (x[1], -x[0]))[::-1]\n\n for i, r in res:\n print('{:d} {:.2f}'.format(i, r))\n\n\nif __name__ == \"__main__\":\n main()\n\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n n, t1, t2, k = map(int, stdin.readline().split())\r\n \r\n parts = []\r\n \r\n for i in range(1, n+1):\r\n a, b = map(int, stdin.readline().split())\r\n \r\n m = max(a*t1*(100-k)/100 + b*t2, b*t1*(100-k)/100 + a*t2)\r\n parts.append((i, m))\r\n \r\n parts.sort(key=lambda x:x[1], reverse=True)\r\n \r\n for i, val in parts:\r\n print(\"{} {:.2f}\".format(i, val))\r\nmain()\r\n", "n, t1, t2, k = map(int, input().split())\n \nans = [] \nfor i in range(n):\n a, b = map(int, input().split())\n v = max(t1*a + t2*b-t1*a*k/100, t1*b + t2*a-t1*b*k/100)\n ans.append([i+1, v])\n\nans.sort(key = lambda x: x[1], reverse=True)\n[print(f\"{i[0]} {i[1]:.2f}\") for i in ans]\n\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t\t \t\t\t\t\t\t\t\t", "\r\nif __name__=='__main__':\r\n n,t1,t2,t=list(map(int,input().split()))\r\n dwarfs=[]\r\n for i in range(1,n+1):\r\n p,q=map(int,input().split())\r\n r1=(p*t1-(p*t1)*(t/100))+q*t2\r\n r2=(q*t1-(q*t1)*(t/100))+p*t2\r\n dwarfs.append((i,max(r1,r2)))\r\n n-=1\r\n dwarfs.sort(key=lambda x:x[1],reverse=True)\r\n for i in range(1,len(dwarfs)):\r\n if dwarfs[i-1][1]==dwarfs[i][1]:\r\n if dwarfs[i-1][0]>dwarfs[i][0]:\r\n dwarfs[i-1],dwarfs[i]=dwarfs[i],dwarfs[i-1]\r\n\r\n\r\n \r\n\r\n for dwarf,height in dwarfs:\r\n print(f\"{dwarf} {height:.2f}\")", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n \r\n\r\ndef solve():\r\n n, t_1, t_2, k = read_tuple(int)\r\n v = [tuple(read_tuple(int)) for _ in range(n)]\r\n heights = [(i + 1, max(a * t_1 * (1 - k / 100) + b * t_2, b * t_1 * (1 - k / 100) + a * t_2)) for i, (a, b) in enumerate(v)]\r\n heights.sort(key=lambda x: x[1], reverse=True)\r\n for i, h in heights:\r\n print(f'{i} {h:.2f}')\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()\r\n " ]

{"inputs": ["2 3 3 50\n2 4\n4 2", "4 1 1 1\n544 397\n280 101\n280 101\n693 970", "10 1 1 25\n981 1\n352 276\n164 691\n203 853\n599 97\n901 688\n934 579\n910 959\n317 624\n440 737", "10 6 1 48\n239 632\n976 315\n797 112\n1 835\n938 862\n531 884\n422 607\n152 331\n413 677\n622 978", "8 1 4 55\n507 82\n681 492\n602 849\n367 557\n438 320\n798 699\n338 302\n391 814", "9 6 4 80\n95 269\n95 269\n781 724\n22 269\n173 655\n972 850\n22 269\n95 269\n642 666", "7 1 8 25\n98 713\n876 112\n990 771\n57 395\n171 899\n86 600\n459 320", "6 1 5 9\n105 771\n105 771\n105 771\n557 985\n105 771\n105 771", "6 2 2 78\n942 465\n593 600\n480 359\n733 648\n995 55\n526 538", "2 1 1 1\n2 2\n2 2", "2 1 1 100\n3 4\n4 3", "1 1 1 1\n1 1"], "outputs": ["1 15.00\n2 15.00", "4 1656.07\n1 937.03\n2 379.99\n3 379.99", "8 1641.50\n6 1417.00\n7 1368.25\n10 1067.00\n4 1005.25\n1 981.75\n9 861.75\n3 814.00\n5 671.75\n2 559.00", "5 3788.56\n10 3673.36\n2 3360.12\n6 3289.08\n4 2606.20\n3 2598.64\n9 2525.24\n7 2315.84\n1 2210.84\n8 1184.72", "3 3666.90\n6 3506.55\n8 3431.95\n2 2945.40\n4 2393.15\n1 2064.90\n5 1896.00\n7 1487.90", "6 4908.00\n3 3992.80\n9 3434.40\n5 2827.60\n1 1190.00\n2 1190.00\n8 1190.00\n4 1102.40\n7 1102.40", "3 8498.25\n5 7320.25\n2 7092.00\n1 5777.50\n6 4864.50\n7 3912.00\n4 3202.75", "4 5431.87\n1 3950.55\n2 3950.55\n3 3950.55\n5 3950.55\n6 3950.55", "1 2088.60\n5 2014.20\n4 1751.12\n2 1460.92\n6 1307.44\n3 1117.96", "1 3.98\n2 3.98", "1 4.00\n2 4.00", "1 1.99"]}

UNKNOWN

PYTHON3

CODEFORCES

60

d154b5f96fbc09054a93df0a65532334

Prefixes and Suffixes

You have a string *s*<==<=*s*1*s*2...*s*|*s*|, where |*s*| is the length of string *s*, and *s**i* its *i*-th character. Let's introduce several definitions: - A substring *s*[*i*..*j*] (1<=≤<=*i*<=≤<=*j*<=≤<=|*s*|) of string *s* is string *s**i**s**i*<=+<=1...*s**j*. - The prefix of string *s* of length *l* (1<=≤<=*l*<=≤<=|*s*|) is string *s*[1..*l*]. - The suffix of string *s* of length *l* (1<=≤<=*l*<=≤<=|*s*|) is string *s*[|*s*|<=-<=*l*<=+<=1..|*s*|]. Your task is, for any prefix of string *s* which matches a suffix of string *s*, print the number of times it occurs in string *s* as a substring. The single line contains a sequence of characters *s*1*s*2...*s*|*s*| (1<=≤<=|*s*|<=≤<=105) — string *s*. The string only consists of uppercase English letters. In the first line, print integer *k* (0<=≤<=*k*<=≤<=|*s*|) — the number of prefixes that match a suffix of string *s*. Next print *k* lines, in each line print two integers *l**i* *c**i*. Numbers *l**i* *c**i* mean that the prefix of the length *l**i* matches the suffix of length *l**i* and occurs in string *s* as a substring *c**i* times. Print pairs *l**i* *c**i* in the order of increasing *l**i*. Sample Input ABACABA AAA Sample Output 3 1 4 3 2 7 1 3 1 3 2 2 3 1

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nS=input().strip()\r\n\r\n\r\nLEN=len(S)\r\ni=1\r\nj=0\r\nA=[0]*LEN\r\nA[0]=LEN\r\n\r\nwhile i<LEN:\r\n while i+j<LEN and S[j]==S[i+j]:\r\n j+=1\r\n A[i]=j\r\n \r\n if j==0:\r\n i+=1\r\n continue\r\n \r\n k=1\r\n while i+k<LEN and k+A[k]<j:\r\n A[i+k]=A[k]\r\n k+=1\r\n i+=k\r\n j-=k\r\n\r\nANS=[0]*(LEN+1)\r\n\r\nfor a in A:\r\n ANS[a]+=1\r\n\r\nfor i in range(LEN-1,-1,-1):\r\n ANS[i]+=ANS[i+1]\r\n\r\nANS2=[]\r\nfor i in range(1,LEN+1):\r\n if A[LEN-i]==i:\r\n ANS2.append((i,ANS[i]))\r\n\r\nprint(len(ANS2))\r\nfor x,y in ANS2:\r\n print(x,y)\r\n\r\n\r\n\r\n", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\ns = input()\r\nn = len(s)\r\np = [0]*n\r\nm = [0]*n\r\n\r\nfor i in range(1,n):\r\n j = p[i-1]\r\n \r\n while j > 0 and s[i] != s[j]:\r\n j = p[j-1]\r\n \r\n if s[i] == s[j]:\r\n j += 1\r\n \r\n p[i] = j\r\n\r\nfor i in range(1,n):\r\n m[p[i]] += 1\r\n\r\nfor i in range(n-1,0,-1):\r\n m[p[i-1]] += m[i]\r\n\r\nfor i in range(1,n):\r\n m[i] += 1\r\n\r\nli = []\r\nli.append([n,1])\r\n\r\nj = n-1\r\n\r\nwhile p[j] > 0:\r\n li.append([p[j],m[p[j]]])\r\n j = p[j] - 1\r\n\r\nprint(len(li))\r\n\r\nfor i in range(len(li) - 1,-1,-1):\r\n print(li[i][0],li[i][1])", "s=input()\r\nn=len(s)\r\np=[0]\r\nsol=[]\r\nfor i in range(1,n):\r\n j=p[i-1]\r\n while j>0 and s[j]!=s[i]:\r\n j=p[j-1]\r\n if (s[j]==s[i]):\r\n j+=int(s[j]==s[i])\r\n p.append(j)\r\n\r\nsols = list()\r\nk=n\r\n\r\nwhile k != 0:\r\n sols.append(k) \r\n k = p[k - 1]\r\n\r\nocurs = [0] * (n + 1)\r\nfor i in range(n):\r\n ocurs[p[i]] += 1\r\nfor i in reversed(range(2,n)):\r\n ocurs[p[i - 1]] += ocurs[i]\r\n\r\nsols.reverse()\r\nfor i in sols:\r\n sol.append(\"{} {}\".format(i,ocurs[i]+1))\r\n\r\nprint(len(sols))\r\nfor i in sol:\r\n print(i)", "s=input()\r\nn=len(s)\r\np=[0]*n\r\nfor i in range(1,n):\r\n j=p[i-1]\r\n while j>0 and s[i]!=s[j]:\r\n j=p[j-1]\r\n if s[i]==s[j]:j+=1\r\n p[i]=j\r\n\r\nj=0\r\nans=[0]*(n+1)\r\nfor i in range(n):\r\n ans[p[i]]+=1\r\nfor i in range(n-1,0,-1):\r\n ans[p[i-1]]+=ans[i]\r\nl=[]\r\nk=p[-1]\r\nwhile k>0:\r\n l.append(k)\r\n k=p[k-1]\r\nl.reverse()\r\nprint(len(l)+1)\r\nfor i in l:\r\n print(i,ans[i]+1)\r\nprint(n,1)\r\n \r\n", "s = ' ' + input()\r\nn = len(s)\r\nr, c = [-1] * n, [1] * n\r\nfor i in range(1, n):\r\n r[i] = r[i - 1] + 1\r\n while r[i] and s[r[i]] != s[i]:\r\n r[i] = r[r[i] - 1] + 1\r\nd, n = [], n - 1\r\nfor i in range(n, 1, -1): c[r[i]] += c[i]\r\nwhile n > 0:\r\n d.append(str(n) + ' ' + str(c[n]))\r\n n = r[n]\r\nprint(len(d))\r\nd.reverse()\r\nprint('\\n'.join(d))", "s = input()\r\nn = len(s)\r\nz = [0] * n\r\nsum_ = [0] * (n + 1)\r\n\r\n\r\ndef calc_Z():\r\n z[0] = n\r\n l = r = 0\r\n for i in range(1, n):\r\n if i <= r and z[i - l] < r - i + 1:\r\n z[i] = z[i - l]\r\n else:\r\n z[i] = max(0, r - i + 1)\r\n while i + z[i] < n and s[i + z[i]] == s[z[i]]:\r\n z[i] += 1\r\n if i + z[i] - 1 > r:\r\n l = i\r\n r = i + z[i] - 1\r\n for i in range(n):\r\n sum_[z[i]] += 1\r\n for i in range(1, n + 1):\r\n sum_[i] += sum_[i - 1]\r\n\r\n\r\ncalc_Z()\r\n\r\n\r\nans = []\r\nfor i in range(n - 1, -1, -1):\r\n if i + z[i] - 1 == n - 1:\r\n ans.append((n - i, sum_[n] - sum_[n - i - 1]))\r\nprint(len(ans))\r\nfor a in ans:\r\n print(a[0], a[1])", "S = input()\r\nN = len(S)\r\n\r\ndef prefix_function(s):\r\n n = N\r\n pi = [0]*n\r\n for i in range(1, n):\r\n j = pi[i-1]\r\n while j > 0 and s[i] != s[j]:\r\n j = pi[j-1]\r\n if s[i] == s[j]:\r\n j += 1\r\n pi[i] = j\r\n return pi\r\n\r\npi = prefix_function(S)\r\nocc = [0] * (N+1)\r\nfor i in range(N):\r\n occ[pi[i]] += 1\r\nfor i in reversed(range(1, N)):\r\n occ[pi[i-1]] += occ[i]\r\nfor i in range(N):\r\n occ[i] += 1\r\n\r\nans = []\r\n\r\nans.append((N, 1))\r\ncur = pi[-1]\r\nwhile cur > 0:\r\n ans.append((cur, occ[cur]))\r\n cur = pi[cur-1]\r\n\r\n\r\nprint(len(ans))\r\nfor item in reversed(ans):\r\n print(item[0], item[1])\r\n", "s=\" \"+input()\r\nn=len(s)\r\nnext,count,ans=[-1]*n,[1]*n,[]\r\nfor i in range(1,n):\r\n next[i] = next[i - 1] + 1\r\n while next[i] and s[next[i]]!=s[i]:\r\n next[i]=next[next[i]-1]+1\r\nfor i in range(n-1,1,-1):\r\n count[next[i]]+=count[i]\r\nn=n-1\r\nwhile n>0:\r\n ans.append(str(n)+' '+str(count[n]))\r\n n=next[n]\r\nprint(len(ans))\r\nans.reverse()\r\nprint(\"\\n\".join(ans))", "s = input()\r\nn = len(s)\r\nz = [0]*n\r\nm = [0]*n\r\nli = []\r\n\r\nl, r = 0, 0\r\n\r\nfor i in range(1,n):\r\n \r\n if i <= r:\r\n z[i] = min(r - i + 1, z[i - l])\r\n \r\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\r\n z[i] += 1\r\n \r\n if i + z[i] - 1 > r:\r\n l = i\r\n r = i + z[i] - 1\r\n \r\n if i + z[i] == n:\r\n li.append(z[i])\r\n \r\n m[z[i]] += 1\r\n\r\nfor i in range(n-2,0,-1):\r\n m[i] += m[i+1]\r\n \r\nprint(len(li) + 1)\r\n\r\nfor i in range(len(li) - 1, -1, -1):\r\n print(li[i], m[li[i]] + 1)\r\n\r\nprint(n,1)", "# ﷽\r\nfrom bisect import bisect_right\r\nfrom collections import deque\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef inlst():return [int(i) for i in input().slit()]\r\n\r\n\r\ndef z_function(S):\r\n \"\"\"\r\n Z Algorithm in O(n)\r\n :param S: text string to process\r\n :return: the Z array, where Z[i] = length of the longest common prefix of S[i:] and S\r\n \"\"\"\r\n\r\n n = len(S)\r\n Z = [0] * n\r\n l = r = 0\r\n\r\n for i in range(1, n):\r\n z = Z[i - l]\r\n if i + z >= r:\r\n z = max(r - i, 0)\r\n while i + z < n and S[z] == S[i + z]:\r\n z += 1\r\n\r\n l, r = i, i + z\r\n\r\n Z[i] = z\r\n\r\n Z[0] = n\r\n return Z\r\n\r\n\r\ndef solve():\r\n s=(input()) \r\n ans=deque()\r\n z=z_function(s)\r\n zz=sorted([i for i in z if i>0])\r\n n=len(zz)\r\n # print(zz)\r\n for i in range(len(s)):\r\n if z[-(i+1)]!=i+1:continue\r\n id=n-bisect_right(zz,i)\r\n # print(i,id)\r\n if id>0:\r\n ans.append((i+1,id))\r\n print(len(ans))\r\n for i in ans:\r\n print(i[0],i[1])\r\n \r\n \r\n # print(z)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "def get_char_map(chars):\r\n char_map = dict()\r\n for i, ch in enumerate(chars):\r\n char_map[ch] = i + 1\r\n return char_map\r\n\r\n\r\nclass HashTable:\r\n def __init__(self, base, mod, size):\r\n self.mul = [1]\r\n for _ in range(size):\r\n self.mul.append((self.mul[-1] * base) % mod)\r\n self.base = base\r\n self.mod = mod\r\n\r\n def build(self, arr):\r\n pre = [0]\r\n for c in arr:\r\n pre.append((pre[-1] * self.base + c) % self.mod)\r\n\r\n def get_hash(l, r):\r\n return (\r\n pre[r] - (pre[l] * self.mul[r - l]) % self.mod + self.mod\r\n ) % self.mod\r\n\r\n return get_hash\r\n\r\n\r\ndef solve():\r\n s = input()\r\n dp = [0] * len(s)\r\n arr = [0] * (len(s) + 1)\r\n ch = get_char_map(\"abcdefghijklmnopqrstuvwxyz\".upper())\r\n ht = HashTable(131, 10**9 + 7, 10**5)\r\n get_hash = ht.build([ch[c] for c in s])\r\n\r\n def binary_search(start, end):\r\n l = start\r\n r = end\r\n while l < r:\r\n m = (l + r) // 2\r\n if get_hash(start, m + 1) != get_hash(0, m + 1 - start):\r\n r = m\r\n else:\r\n l = m + 1\r\n return l\r\n\r\n for i, _ in enumerate(list(s)):\r\n idx = binary_search(i, len(s))\r\n dp[i] = idx\r\n arr[idx - i] += 1\r\n\r\n total = 0\r\n cur_len = len(s)\r\n res = []\r\n for i, v in enumerate(dp):\r\n if v == len(s):\r\n l = len(s) - i\r\n while cur_len >= l:\r\n total += arr[cur_len]\r\n cur_len -= 1\r\n res.append([l, total])\r\n\r\n print(len(res))\r\n print(\"\\n\".join([\" \".join(map(str, elm)) for elm in reversed(res)]))\r\n\r\n\r\nsolve()\r\n", "s=input()\r\nn=len(s)\r\npre=[0 for i in range(n)]\r\ni, l=1, 0\r\nd1={}\r\nwhile i<n:\r\n if s[i]==s[l]:\r\n l+=1\r\n pre[i]=l\r\n d1[l]=d1.get(l, 0)+1\r\n i+=1\r\n else:\r\n if l==0:\r\n pre[i]=0\r\n i+=1\r\n else:\r\n l=pre[l-1]\r\n\r\nfor i in range(n-1, 0, -1):\r\n if i in d1 and pre[i-1]>0:\r\n d1[pre[i-1]]+=d1[i]\r\nl1=[]\r\nz=[0 for i in range(n)]\r\nl=0\r\nr=0\r\nfor i in range(1, n):\r\n if (i <= r):\r\n z[i] = min (r - i + 1, z[i - l])\r\n while (i+z[i]<n and s[z[i]] == s[i + z[i]]):\r\n z[i]+=1\r\n if (i + z[i] - 1 > r):\r\n l = i\r\n r = i + z[i] - 1\r\n if z[i]+i==n:\r\n l1.append([z[i], d1.get(z[i], 0)])\r\nl1.sort()\r\nprint(len(l1)+1)\r\nfor i, j in l1:\r\n print(i, j+1)\r\nprint(n, 1)", "from sys import stdin\nfrom collections import defaultdict,Counter\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef prefix_function(s):\n prefix_function_vals = [0]*len(s)\n\n for i in range(1,len(s)):\n prefix_len = prefix_function_vals[i-1]\n while prefix_len > 0 and s[i] != s[prefix_len]: prefix_len = prefix_function_vals[prefix_len-1]\n prefix_function_vals[i] = prefix_len + (s[i] == s[prefix_len])\n\n return [None]+prefix_function_vals\n\ndef main():\n s = rd(str)\n\n prefix_function_vals = prefix_function(s)\n prefix_function_val_counts = Counter(prefix_function_vals)\n neighbors = defaultdict(list)\n for i,prefix_function_val in enumerate(prefix_function_vals): neighbors[prefix_function_val].append(i)\n subtree_prefix_function_val_counts = {}\n\n dfs = [0]\n seen = set()\n\n while dfs:\n node = dfs[-1]\n\n if node not in seen:\n seen.add(node)\n for neighbor in neighbors[node]: dfs.append(neighbor)\n else:\n dfs.pop()\n subtree_prefix_function_val_counts[node] = prefix_function_val_counts[node] + sum(map(subtree_prefix_function_val_counts.__getitem__,neighbors[node]))\n\n ans = []\n cur_length = prefix_function_vals[len(s)]\n\n while cur_length != 0:\n ans.append([cur_length,subtree_prefix_function_val_counts[cur_length]+1])\n cur_length = prefix_function_vals[cur_length]\n\n print(len(ans)+1)\n\n for l,c in reversed(ans): print(l,c)\n\n print(len(s),1)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "s=input()\r\nn=len(s)\r\nif n==1:\r\n print('1\\n1 1\\n')\r\n exit()\r\np=[-1]*n\r\nq=-1\r\nfor i in range(1,n):\r\n while q>=0 and s[i]!=s[q+1]:\r\n q=p[q]\r\n if s[i] == s[q + 1]:\r\n q+=1\r\n p[i]=q\r\n#print(p)\r\nc=[1]*n\r\nfor i in range(n-1,-1,-1):\r\n if p[i]>=0:\r\n c[p[i]]+=c[i]\r\n#print(c)\r\nans=[(n,1)]\r\nq=p[n-1]\r\nwhile q>=0:\r\n ans.append((q+1,c[q]))\r\n q=p[q]\r\nprint(len(ans))\r\nprint('\\n'.join([' '.join(map(str,x)) for x in reversed(ans)]))\r\n" ]

{"inputs": ["ABACABA", "AAA", "A", "AAAAAAAAAAAAAAAAXAAAAAAAAAAAAAAAAAAAAAAA", "AB", "AXAXA", "CODEFORCES", "GERALDPAVELGERALDPAVEL", "ZZ"], "outputs": ["3\n1 4\n3 2\n7 1", "3\n1 3\n2 2\n3 1", "1\n1 1", "17\n1 39\n2 37\n3 35\n4 33\n5 31\n6 29\n7 27\n8 25\n9 23\n10 21\n11 19\n12 17\n13 15\n14 13\n15 11\n16 9\n40 1", "1\n2 1", "3\n1 3\n3 2\n5 1", "1\n10 1", "2\n11 2\n22 1", "2\n1 2\n2 1"]}

UNKNOWN

PYTHON3

CODEFORCES

14

d15b551ae8fabd1bdc627749b5d8d626

Lucky String

Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya recently learned to determine whether a string of lowercase Latin letters is lucky. For each individual letter all its positions in the string are written out in the increasing order. This results in 26 lists of numbers; some of them can be empty. A string is considered lucky if and only if in each list the absolute difference of any two adjacent numbers is a lucky number. For example, let's consider string "zbcdzefdzc". The lists of positions of equal letters are: - b: 2- c: 3,<=10- d: 4,<=8- e: 6- f: 7- z: 1,<=5,<=9- Lists of positions of letters a, g, h, ..., y are empty. This string is lucky as all differences are lucky numbers. For letters z: 5<=-<=1<==<=4, 9<=-<=5<==<=4, for letters c: 10<=-<=3<==<=7, for letters d: 8<=-<=4<==<=4. Note that if some letter occurs only once in a string, it doesn't influence the string's luckiness after building the lists of positions of equal letters. The string where all the letters are distinct is considered lucky. Find the lexicographically minimal lucky string whose length equals *n*. The single line contains a positive integer *n* (1<=≤<=*n*<=≤<=105) — the length of the sought string. Print on the single line the lexicographically minimal lucky string whose length equals *n*. Sample Input 5 3 Sample Output abcda abc

[ "print(('abcd'*100000)[:int(input())])", "n = int(input())\r\ns = \"abcd\"\r\ns1 = \"\"\r\n\r\nk = n // 4\r\n\r\ns1 += s * k\r\n\r\nk = n % 4\r\ns1 += s[:k]\r\n\r\nprint(s1)\r\n", "print(('abcd'*25001)[:int(input())])", "n=int(input())\ns=(n//4+1)*\"abcd\"\nprint(s[:n])", "c,q= \"\",\"abcd\"\r\nn= int(input())\r\nfor i in range(n//4): c+=q\r\nc+= q[:n%4]\r\nprint(c)", "# LUOGU_RID: 126531339\nprint(('abcd'*100000)[:int(input())])", "letters = \"abcd\"\r\nn = int(input())\r\nfor i in range(n):\r\n print(letters[i%4], end=\"\")\r\nprint()", "n=int(input())\r\n#print(n-4*(n//4))\r\nprint('abcd'*(n//4)+'abcd'[:n-4*(n//4)])\r\n#print('abcd'[:2])\r\n" ]

{"inputs": ["5", "3", "8", "10", "16", "64", "128", "100", "47", "74", "477", "1000", "1024", "512", "747", "2075", "9475", "10000", "47589", "9999", "85475", "77777", "100000", "99994", "785", "1", "2", "7", "4", "99", "6", "9"], "outputs": ["abcda", "abc", "abcdabcd", "abcdabcdab", "abcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdab", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcda", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc...", "a", "ab", "abcdabc", "abcd", "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabc", "abcdab", "abcdabcda"]}

UNKNOWN

PYTHON3

CODEFORCES

8

d15d1f4a8fbfb34fdfd3b6f396e66f1a

Find Pair

You've got another problem dealing with arrays. Let's consider an arbitrary sequence containing *n* (not necessarily different) integers *a*1, *a*2, ..., *a**n*. We are interested in all possible pairs of numbers (*a**i*, *a**j*), (1<=≤<=*i*,<=*j*<=≤<=*n*). In other words, let's consider all *n*2 pairs of numbers, picked from the given array. For example, in sequence *a*<==<={3,<=1,<=5} are 9 pairs of numbers: (3,<=3),<=(3,<=1),<=(3,<=5),<=(1,<=3),<=(1,<=1),<=(1,<=5),<=(5,<=3),<=(5,<=1),<=(5,<=5). Let's sort all resulting pairs lexicographically by non-decreasing. Let us remind you that pair (*p*1, *q*1) is lexicographically less than pair (*p*2, *q*2) only if either *p*1 < *p*2, or *p*1 = *p*2 and *q*1 < *q*2. Then the sequence, mentioned above, will be sorted like that: (1,<=1),<=(1,<=3),<=(1,<=5),<=(3,<=1),<=(3,<=3),<=(3,<=5),<=(5,<=1),<=(5,<=3),<=(5,<=5) Let's number all the pair in the sorted list from 1 to *n*2. Your task is formulated like this: you should find the *k*-th pair in the ordered list of all possible pairs of the array you've been given. The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=105,<=1<=≤<=*k*<=≤<=*n*2). The second line contains the array containing *n* integers *a*1, *a*2, ..., *a**n* (<=-<=109<=≤<=*a**i*<=≤<=109). The numbers in the array can coincide. All numbers are separated with spaces. Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout, streams or the %I64d specificator instead. In the single line print two numbers — the sought *k*-th pair. Sample Input 2 4 2 1 3 2 3 1 5 Sample Output 2 2 1 3

[ "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,K = map(int,input().split())\nA = sorted(list(map(int,input().split())))\nk = (K+N-1)//N-1\ncnt = A.index(A[k])\nnum = A.count(A[cnt])\nprint(A[k],A[(K-(N*cnt)-1)//num])\n" ]

{"inputs": ["2 4\n2 1", "3 2\n3 1 5", "3 3\n1 1 2", "1 1\n-4", "3 7\n5 4 3", "3 6\n10 1 3", "4 12\n-1 -2 -3 -4", "5 10\n1 2 2 1 3", "5 13\n3 3 3 4 5", "8 26\n4 4 1 1 1 3 3 5", "10 90\n2 1 1 1 1 1 2 1 2 2", "10 6\n3 1 1 3 2 2 2 3 3 3", "10 18\n1 1 1 3 4 4 4 1 2 3", "50 622\n4 9 8 1 3 7 1 2 3 8 9 8 8 5 2 10 5 8 1 3 1 8 2 3 7 9 10 2 9 9 7 3 8 6 10 6 5 4 8 1 1 5 6 8 9 5 9 5 3 2", "50 2069\n9 97 15 22 69 27 7 23 84 73 74 60 94 43 98 13 4 63 49 7 31 93 23 6 75 32 63 49 32 99 43 68 48 16 54 20 38 40 65 34 28 21 55 79 50 2 18 22 95 25", "100 9043\n4 1 4 2 1 4 2 2 1 1 4 2 4 2 4 1 4 2 2 1 2 2 2 2 1 1 2 3 2 1 1 3 2 3 1 4 2 2 2 4 1 4 3 3 4 3 4 1 1 4 2 2 4 4 4 4 4 1 1 2 3 1 3 4 1 3 1 4 1 3 2 2 3 2 3 1 2 3 4 3 3 2 3 4 4 4 2 3 2 1 1 2 2 4 1 2 3 2 2 1", "100 4755\n5 4 3 5 1 2 5 1 1 3 5 4 4 1 1 1 1 5 4 4 5 1 5 5 1 2 1 3 1 5 1 3 3 3 2 2 2 1 1 5 1 3 4 1 1 3 2 5 2 2 5 5 4 4 1 3 4 3 3 4 5 3 3 3 1 2 1 4 2 4 4 1 5 1 3 5 5 5 5 3 4 4 3 1 2 5 2 3 5 4 2 4 5 3 2 4 2 4 3 1", "100 6819\n4 3 4 6 2 5 2 2 5 6 6 6 1 3 1 3 2 2 2 3 4 5 2 1 6 4 5 3 2 3 4 4 4 3 5 6 3 2 4 5 2 3 2 1 1 6 4 1 5 6 4 3 4 2 4 1 3 2 3 1 2 2 5 1 3 2 5 1 3 2 4 5 1 3 5 5 5 2 6 6 6 3 1 5 4 6 3 3 4 3 1 4 1 1 1 1 2 4 2 6", "10 50\n1 1 -9 -9 -9 7 7 7 7 7", "9 76\n1 1 2 2 2 2 3 3 9", "5 15\n1 1 1 2 2", "5 7\n1 3 3 3 5", "10 91\n1 1 1 1 1 1 1 1 1 2", "5 20\n1 2 2 3 3", "6 36\n1 1 2 2 2 2", "5 16\n1 1 2 2 3", "5 17\n1 3 3 5 5", "5 17\n1 3 3 3 5", "10 25\n1 2 2 3 4 5 6 7 8 9", "10 90\n1 1 1 1 1 1 1 1 1 2", "4 5\n3 1 3 1", "3 5\n1 1 2", "5 3\n0 1 2 3 4"], "outputs": ["2 2", "1 3", "1 1", "-4 -4", "5 3", "3 10", "-2 -1", "1 3", "3 5", "3 1", "2 2", "1 2", "1 2", "3 3", "75 28", "4 3", "3 3", "4 4", "1 7", "9 2", "1 2", "3 1", "2 1", "3 2", "2 2", "2 2", "5 1", "3 3", "2 7", "1 2", "1 3", "1 2", "0 2"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d16620d13a8ade89313bb0547f8d9d8d

none

Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler! However, there is no reason for disappointment, as Valery has found another ruler, its length is *l* centimeters. The ruler already has *n* marks, with which he can make measurements. We assume that the marks are numbered from 1 to *n* in the order they appear from the beginning of the ruler to its end. The first point coincides with the beginning of the ruler and represents the origin. The last mark coincides with the end of the ruler, at distance *l* from the origin. This ruler can be repesented by an increasing sequence *a*1,<=*a*2,<=...,<=*a**n*, where *a**i* denotes the distance of the *i*-th mark from the origin (*a*1<==<=0, *a**n*<==<=*l*). Valery believes that with a ruler he can measure the distance of *d* centimeters, if there is a pair of integers *i* and *j* (1<=≤<=*i*<=≤<=*j*<=≤<=*n*), such that the distance between the *i*-th and the *j*-th mark is exactly equal to *d* (in other words, *a**j*<=-<=*a**i*<==<=*d*). Under the rules, the girls should be able to jump at least *x* centimeters, and the boys should be able to jump at least *y* (*x*<=<<=*y*) centimeters. To test the children's abilities, Valery needs a ruler to measure each of the distances *x* and *y*. Your task is to determine what is the minimum number of additional marks you need to add on the ruler so that they can be used to measure the distances *x* and *y*. Valery can add the marks at any integer non-negative distance from the origin not exceeding the length of the ruler. The first line contains four positive space-separated integers *n*, *l*, *x*, *y* (2<=≤<=*n*<=≤<=105, 2<=≤<=*l*<=≤<=109, 1<=≤<=*x*<=<<=*y*<=≤<=*l*) — the number of marks, the length of the ruler and the jump norms for girls and boys, correspondingly. The second line contains a sequence of *n* integers *a*1,<=*a*2,<=...,<=*a**n* (0<==<=*a*1<=<<=*a*2<=<<=...<=<<=*a**n*<==<=*l*), where *a**i* shows the distance from the *i*-th mark to the origin. In the first line print a single non-negative integer *v* — the minimum number of marks that you need to add on the ruler. In the second line print *v* space-separated integers *p*1,<=*p*2,<=...,<=*p**v* (0<=≤<=*p**i*<=≤<=*l*). Number *p**i* means that the *i*-th mark should be at the distance of *p**i* centimeters from the origin. Print the marks in any order. If there are multiple solutions, print any of them. Sample Input 3 250 185 230 0 185 250 4 250 185 230 0 20 185 250 2 300 185 230 0 300 Sample Output 1 230 0 2 185 230

[ "import itertools\nimport math\n\ndef can_measure(a, d):\n\treturn any(i + d in a for i in a)\n\ndef main():\n\tn, l, x, y = map(int, input().split())\n\ta = set(map(int, input().split()))\n\t\n\tcan_x = can_measure(a, x)\n\tcan_y = can_measure(a, y)\n\tif can_x and can_y:\n\t\tprint(0)\n\telif can_x:\n\t\tprint(1)\n\t\tprint(y)\n\telif can_y:\n\t\tprint(1)\n\t\tprint(x)\n\telse:\n\t\tfor i in a:\n\t\t\tif i + x + y in a:\n\t\t\t\tprint(1)\n\t\t\t\tprint(i + x)\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tt = i + x - y in a\n\t\t\t\tif 0 <= i + x <= l and t:\n\t\t\t\t\tprint(1)\n\t\t\t\t\tprint(i + x)\n\t\t\t\t\tbreak;\n\t\t\t\tif 0 <= i - y <= l and t:\n\t\t\t\t\tprint(1)\n\t\t\t\t\tprint(i - y)\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\telse:\n\t\t\tprint(2)\n\t\t\tprint(x, y)\n\t\t\n\nif __name__ == \"__main__\":\n\tmain()\n\n\n\n\n# Made By Mostafa_Khaled" ]

{"inputs": ["3 250 185 230\n0 185 250", "4 250 185 230\n0 20 185 250", "2 300 185 230\n0 300", "4 300 4 5\n0 6 7 300", "2 100 30 70\n0 100", "2 300 140 160\n0 300", "4 300 1 2\n0 298 299 300", "3 350 150 160\n0 310 350", "4 300 4 5\n0 298 299 300", "19 180 117 148\n0 1 19 20 21 28 57 65 68 70 78 88 100 116 154 157 173 179 180", "14 134 99 114\n0 6 8 19 50 61 69 83 84 96 111 114 125 134", "18 187 27 157\n0 17 18 31 36 37 40 53 73 86 96 107 119 150 167 181 184 187", "20 179 69 120\n0 6 8 11 21 24 55 61 83 84 96 111 114 116 125 140 147 154 176 179", "16 115 62 112\n0 5 24 32 38 43 44 57 62 72 74 92 103 105 113 115", "112 1867 1261 1606\n0 7 17 43 67 70 87 112 129 141 148 162 179 180 189 202 211 220 231 247 250 277 308 311 327 376 400 406 409 417 418 444 480 512 514 515 518 547 572 575 578 587 612 617 654 684 701 742 757 761 788 821 825 835 841 843 850 858 869 872 881 936 939 969 970 971 997 1026 1040 1045 1068 1070 1073 1076 1095 1110 1115 1154 1166 1178 1179 1203 1204 1225 1237 1241 1246 1275 1302 1305 1311 1312 1315 1338 1340 1419 1428 1560 1561 1576 1591 1594 1618 1643 1658 1660 1664 1689 1803 1822 1835 1867", "2 2 1 2\n0 2", "3 2 1 2\n0 1 2", "3 10 2 3\n0 1 10", "4 10 3 5\n0 1 9 10", "5 1000 777 778\n0 1 500 501 1000", "3 10 1 3\n0 2 10", "4 300 120 150\n0 110 140 300", "5 401 300 400\n0 100 250 350 401", "3 10 1 8\n0 7 10", "4 1000 2 3\n0 400 405 1000", "6 12 7 10\n0 1 3 4 6 12", "4 1000 10 20\n0 500 530 1000", "3 8 2 3\n0 7 8", "4 10 8 9\n0 4 5 10", "4 10 7 8\n0 5 6 10", "6 35 29 30\n0 10 11 31 32 35", "5 200000 1 100029\n0 100000 100009 100010 200000", "4 1000 900 901\n0 950 951 1000", "6 504 400 500\n0 3 5 103 105 504", "5 550 300 400\n0 151 251 450 550", "4 300 40 50\n0 280 290 300", "2 1000000000 100000000 500000000\n0 1000000000", "4 600 100 400\n0 50 350 600", "4 100 7 8\n0 3 4 100", "4 100 80 81\n0 2 3 100", "3 13 8 10\n0 2 13", "4 10 7 8\n0 4 5 10", "3 450 100 400\n0 150 450", "4 500 30 50\n0 20 40 500", "4 100 10 11\n0 4 5 100", "2 10 5 7\n0 10", "6 100 70 71\n0 50 51 90 91 100", "4 9 6 7\n0 4 5 9", "3 10 1 8\n0 3 10", "3 12 1 2\n0 10 12", "4 100 3 5\n0 40 48 100", "3 20 17 18\n0 19 20", "4 1000 45 46\n0 2 3 1000", "4 10 5 7\n0 4 6 10", "3 12 1 3\n0 10 12", "4 20 6 7\n0 1 15 20", "3 11 3 5\n0 9 11", "3 100 9 10\n0 99 100", "3 10 7 8\n0 1 10", "3 10 5 6\n0 9 10", "3 10 7 8\n0 9 10", "3 10 6 7\n0 9 10", "3 9 6 7\n0 1 9", "3 1000000000 99 100\n0 1 1000000000", "4 10 3 5\n0 2 4 10", "4 100 90 91\n0 7 8 100", "4 100 80 81\n0 98 99 100"], "outputs": ["1\n230", "0", "2\n185 230", "1\n11", "1\n30", "1\n140", "0", "1\n150", "1\n294", "2\n117 148", "1\n99", "1\n27", "1\n27", "1\n112", "1\n1808", "1\n1", "0", "1\n3", "1\n4", "1\n778", "1\n3", "1\n260", "1\n400", "1\n8", "1\n402", "1\n10", "1\n510", "1\n5", "2\n8 9", "2\n7 8", "1\n2", "1\n100029", "1\n50", "1\n503", "1\n150", "1\n240", "2\n100000000 500000000", "1\n450", "1\n11", "1\n83", "1\n10", "2\n7 8", "1\n50", "1\n50", "1\n15", "2\n5 7", "1\n20", "2\n6 7", "1\n2", "1\n1", "1\n43", "1\n2", "1\n48", "2\n5 7", "1\n9", "1\n7", "1\n6", "1\n90", "1\n8", "1\n4", "1\n2", "1\n3", "1\n7", "1\n100", "1\n5", "1\n98", "1\n18"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d172ac41a846604f1c877ea449cf1b55

Buy Low Sell High

You can perfectly predict the price of a certain stock for the next *N* days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day you will either buy one share, sell one share, or do nothing. Initially you own zero shares, and you cannot sell shares when you don't own any. At the end of the *N* days you would like to again own zero shares, but want to have as much money as possible. Input begins with an integer *N* (2<=≤<=*N*<=≤<=3·105), the number of days. Following this is a line with exactly *N* integers *p*1,<=*p*2,<=...,<=*p**N* (1<=≤<=*p**i*<=≤<=106). The price of one share of stock on the *i*-th day is given by *p**i*. Print the maximum amount of money you can end up with at the end of *N* days. Sample Input 9 10 5 4 7 9 12 6 2 10 20 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 Sample Output 20 41

[ "\n\nfrom heapq import *\nn=int(input())\np=list(map(int,input().split()))\nans=0\nhp=[]\nfor i in range(n):\n if hp and hp[0]<p[i]:\n ans+=p[i]-hp[0]\n heappop(hp)\n heappush(hp,p[i])\n heappush(hp,p[i])\n else:heappush(hp,p[i])\n\nprint(ans)\n\n\n", "import sys\nfrom heapq import heappop, heappush\ninput = sys.stdin.readline\nn = int(input())\np = map(int, input().split())\nans = 0\nQ = []\nfor v in p:\n if Q:\n x = Q[0]\n if v > x:\n ans += v-x\n heappop(Q)\n heappush(Q, v)\n heappush(Q, v)\nprint(ans)", "import sys\r\ninput = sys.stdin.buffer.readline\r\nfrom heapq import heappush, heapreplace\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nheap = []\r\nprofit = 0\r\n\r\nfor i in a:\r\n mn = heap[0] if heap else 1e9\r\n\r\n if mn < i:\r\n profit += i-mn\r\n heapreplace(heap, i)\r\n\r\n heappush(heap, i)\r\n\r\nprint(profit)", "from heapq import *\r\ninput()\r\ns, h = 0, []\r\nfor v in map(int, input().split()):\r\n heappush(h, v)\r\n if h[0] < v: s += v - heapreplace(h, v)\r\nprint(s)", "from heapq import heappush,heappop\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\nunsed=[]\r\nselled=[]\r\nsm=0\r\nfor x in ar:\r\n U,S=len(unsed),len(selled)\r\n u=heappop(unsed) if U else float('inf')\r\n s=heappop(selled) if S else float('inf')\r\n y=min(u,s)\r\n if(y<x):\r\n if(u==y):\r\n sm+=x-y\r\n if(S):heappush(selled,s)\r\n heappush(selled,x)\r\n else:\r\n sm+=x-y\r\n heappush(unsed,y)\r\n if(U):heappush(unsed,u)\r\n heappush(selled,x)\r\n else:\r\n if(S):heappush(selled,s)\r\n if(U):heappush(unsed,u)\r\n heappush(unsed,x)\r\nprint(sm)\r\n", "import heapq\r\n\r\ndef problemC():\r\n N = int(input())\r\n prices = [int(p) for p in input().split()]\r\n res = 0\r\n sell_options = []\r\n for p in prices:\r\n if not(len(sell_options) == 0 or sell_options[0][0] >= p):\r\n sell_price, bought = heapq.heappop(sell_options)\r\n res += p - sell_price\r\n heapq.heappush(sell_options, (p, True))\r\n if bought:\r\n heapq.heappush(sell_options, (sell_price, False))\r\n else:\r\n heapq.heappush(sell_options, (p, False))\r\n print(res)\r\n\r\nproblemC()", "import heapq\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nhp = []\r\n\r\nfor it in arr:\r\n heapq.heappush(hp, it)\r\n if hp and hp[0] < it:\r\n ans += it - hp[0]\r\n heapq.heappop(hp)\r\n heapq.heappush(hp, it)\r\n\r\nprint(ans)\r\n", "import heapq as hq\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nq = []\r\nfor i in range(n):\r\n if q:\r\n x = hq.heappop(q)\r\n if x < a[i]:\r\n ans += a[i]-x\r\n hq.heappush(q,a[i])\r\n else:\r\n hq.heappush(q,x)\r\n hq.heappush(q,a[i])\r\nprint(ans)", "import heapq as hq\n\nn = int(input())\n\np = list(map(int, input().split()))\n \nheap = []\n\nans = 0\n\nfor i in range(n):\n if heap and p[i] > heap[0]:\n ans += p[i]-heap[0]\n hq.heappop(heap)\n hq.heappush(heap, p[i])\n hq.heappush(heap, p[i])\n\nprint(ans)", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nimport heapq\r\nq = []\r\n\r\nans = 0\r\nfor i in range(n):\r\n heapq.heappush(q, a[i])\r\n if not q or q[0] >= a[i]:\r\n continue\r\n else:\r\n T = heapq.heappop(q)\r\n ans += a[i] - T\r\n heapq.heappush(q, a[i])\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nimport heapq\r\n\r\nN=int(input())\r\nP=list(map(int,input().split()))\r\n\r\nANS=[0]*N\r\nQ=[]\r\n\r\nfor i in range(N):\r\n #print(ANS)\r\n p=P[i]\r\n if len(Q)==0:\r\n heapq.heappush(Q,(p,i))\r\n continue\r\n else:\r\n x,ind=heapq.heappop(Q)\r\n\r\n if x<p:\r\n ANS[ind]-=1\r\n ANS[i]+=1\r\n heapq.heappush(Q,(p,i))\r\n heapq.heappush(Q,(p,i))\r\n else:\r\n heapq.heappush(Q,(x,ind))\r\n heapq.heappush(Q,(p,i))\r\n\r\nLANS=0\r\nfor i in range(N):\r\n LANS+=P[i]*ANS[i]\r\n\r\nprint(LANS)\r\n \r\n", "from heapq import *\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nhp=[]\r\nans=0\r\nfor i in range(n):\r\n heappush(hp,a[i])\r\n if (hp[0]< a[i]):\r\n ans += a[i] - hp[0]\r\n heappop(hp)\r\n heappush(hp,a[i])\r\n\r\nprint(ans)\r\n", "# LUOGU_RID: 112325654\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MI():\r\n return map(int, input().split())\r\ndef LI():\r\n return list(input().split())\r\ndef LII():\r\n return list(map(int, input().split()))\r\ndef GMI():\r\n return map(lambda x: int(x)-1,input().split())\r\nimport heapq\r\ndef solve():\r\n n = II()\r\n nums = LII()\r\n res = 0\r\n pq = []\r\n for i in range(n):\r\n heapq.heappush(pq, nums[i])\r\n heapq.heappush(pq, nums[i])\r\n res += nums[i] - heapq.heappop(pq)\r\n print(res)\r\nsolve()\r\n", "from heapq import*\ninput()\ns,h=0,[]\nfor v in map(int,input().split()):\n\theappush(h,v)\n\tif v>h[0]:s+=v-heapreplace(h,v)\nprint(s)\n \t \t \t \t \t\t\t\t \t\t\t\t\t \t \t \t\t\t", "import sys\r\nimport heapq\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ndef fgh():\r\n return [int(xx) for xx in input().split()]\r\ndef fg():\r\n return int(input())\r\nn = fg()\r\na = fgh()\r\nans = 0\r\nh = [a[0]]\r\nfor i in range(1, n):\r\n if h[0] < a[i]:\r\n ans += a[i] - heapq.heappop(h)\r\n heapq.heappush(h, a[i])\r\n heapq.heappush(h, a[i])\r\n else:\r\n heapq.heappush(h, a[i])\r\nprint(ans)\r\n", "from heapq import*\r\ninput()\r\ns,h=0,[]\r\nfor v in map(int,input().split()):\r\n\theappush(h,v)\r\n\tif v>h[0]:s+=v-heapreplace(h,v)\r\nprint(s)" ]

{"inputs": ["9\n10 5 4 7 9 12 6 2 10", "20\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4", "20\n9 29 8 9 13 4 14 27 16 11 27 14 4 29 23 17 3 9 30 19", "100\n411 642 560 340 276 440 515 519 182 314 35 227 390 136 97 5 502 584 567 79 543 444 413 463 455 316 545 329 437 443 9 435 291 384 328 501 603 234 285 297 453 587 550 72 130 163 282 298 605 349 270 198 24 179 243 92 115 56 83 26 3 456 622 325 366 360 299 153 140 552 216 117 61 307 278 189 496 562 38 527 566 503 303 16 36 286 632 196 395 452 194 77 321 615 356 250 381 174 139 123", "20\n499559 302871 194704 903169 447219 409938 42087 753609 589270 719332 855199 609182 315644 980473 966759 851389 900793 905536 258772 453222", "47\n403136 169462 358897 935260 150614 688938 111490 148144 462915 753991 551831 303917 772190 188564 854800 7094 491120 997932 271873 236736 797113 427200 681780 911765 217707 339475 313125 56785 749677 313468 902148 993064 747609 387815 768631 41886 68862 707668 32853 653517 941150 858711 562604 867235 840369 337814 129019", "2\n4 77"], "outputs": ["20", "41", "147", "13765", "4620235", "12525965", "73"]}

UNKNOWN

PYTHON3

CODEFORCES

16

d175d48a79770638f1ab5c9a7b472225

Broken Monitor

Innocentius has a problem — his computer monitor has broken. Now some of the pixels are "dead", that is, they are always black. As consequence, Innocentius can't play the usual computer games. He is recently playing the following game with his younger brother Polycarpus. Innocentius is touch-typing a program that paints a white square one-pixel wide frame on the black screen. As the monitor is broken, some pixels that should be white remain black. Polycarpus should look at what the program displayed on the screen and guess the position and size of the frame Innocentius has painted. Polycarpus doesn't like the game but Innocentius persuaded brother to play as "the game is good for the imagination and attention". Help Polycarpus, automatize his part in the gaming process. Write the code that finds such possible square frame that: - the frame's width is 1 pixel, - the frame doesn't go beyond the borders of the screen, - all white pixels of the monitor are located on the frame, - of all frames that satisfy the previous three conditions, the required frame must have the smallest size. Formally, a square frame is represented by such pixels of the solid square, that are on the square's border, that is, are not fully surrounded by the other pixels of the square. For example, if the frame's size is *d*<==<=3, then it consists of 8 pixels, if its size is *d*<==<=2, then it contains 4 pixels and if *d*<==<=1, then the frame is reduced to a single pixel. The first line contains the resolution of the monitor as a pair of integers *n*, *m* (1<=≤<=*n*,<=*m*<=≤<=2000). The next *n* lines contain exactly *m* characters each — the state of the monitor pixels at the moment of the game. Character "." (period, ASCII code 46) corresponds to the black pixel, and character "w" (lowercase English letter w) corresponds to the white pixel. It is guaranteed that at least one pixel of the monitor is white. Print the monitor screen. Represent the sought frame by characters "+" (the "plus" character). The pixels that has become white during the game mustn't be changed. Print them as "w". If there are multiple possible ways to position the frame of the minimum size, print any of them. If the required frame doesn't exist, then print a single line containing number -1. Sample Input 4 8 ..w..w.. ........ ........ ..w..w.. 5 6 ...... .w.... ...... ..w... ...... 2 4 .... .w.. 2 6 w..w.w ...w.. Sample Output ..w++w.. ..+..+.. ..+..+.. ..w++w.. ...... +w+... +.+... ++w... ...... .... .w.. -1

[ "from itertools import chain\ndef draw_square(ans, square_a, ymin, xmin) -> list:\n for i in range(square_a + 1):\n if(ans[ymin][xmin + i] != 'w'):\n ans[ymin] = ans[ymin][:xmin + i] + '+' + ans[ymin][xmin + i + 1:]\n if(ans[ymin + square_a][xmin + i] != 'w'):\n ans[ymin + square_a] = ans[ymin + square_a][:xmin + i] + '+' + ans[ymin + square_a][xmin + i + 1:]\n if(ans[ymin + i][xmin] != 'w'):\n ans[ymin + i] = ans[ymin + i][:xmin] + '+' + ans[ymin + i][xmin + 1:]\n if(ans[ymin + i][xmin + square_a] != 'w'):\n ans[ymin + i] = ans[ymin + i][:xmin + square_a] + '+' + ans[ymin + i][xmin + square_a + 1:]\n return ans\n\ndef find_a(pixel, y, x) -> tuple:\n ymax = xmax = 0\n ymin, xmin = y, x\n ymaxl, yminl, xmaxl, xminl = [], [], [], []\n count_pixel = len(pixel) // 2\n for i in range(count_pixel):\n if(ymax < pixel[2 * i]):\n ymax = pixel[2 * i]\n if(ymin > pixel[2 * i]):\n ymin = pixel[2 * i]\n if(xmax < pixel[2 * i + 1]):\n xmax = pixel[2 * i + 1]\n if(xmin > pixel[2 * i + 1]):\n xmin = pixel[2 * i + 1]\n for i in range(count_pixel):\n f = True\n if(pixel[2 * i] == ymax):\n f = False\n ymaxl.append(pixel[2 * i])\n ymaxl.append(pixel[2 * i + 1])\n if(pixel[2 * i] == ymin):\n f = False\n yminl.append(pixel[2 * i])\n yminl.append(pixel[2 * i + 1])\n if(pixel[2 * i + 1] == xmax):\n f = False\n xmaxl.append(pixel[2 * i])\n xmaxl.append(pixel[2 * i + 1])\n if(pixel[2 * i + 1] == xmin):\n f = False\n xminl.append(pixel[2 * i])\n xminl.append(pixel[2 * i + 1])\n if(f):\n print('-1')\n exit()\n return ymax, ymin, xmax, xmin, ymaxl, yminl, xmaxl, xminl\n\nif __name__ == '__main__':\n y, x = map(int, input().split())\n scr = []\n for i in range(y):\n scr.append(input())\n pixel = []\n for i in range(y):\n for j in range(x):\n if(scr[i][j] == 'w'):\n pixel.append(i)\n pixel.append(j)\n ymax, ymin, xmax, xmin, ymaxl, yminl, xmaxl, xminl = find_a(pixel, y, x)\n count_ymax, count_ymin, count_xmax, count_xmin = len(ymaxl)/2, len(yminl)/2, len(xmaxl)/2, len(xminl)/2\n countx_ymax = ymaxl[1::2].count(xmax) + ymaxl[1::2].count(xmin)\n countx_ymin = yminl[1::2].count(xmax) + yminl[1::2].count(xmin)\n county_xmax = xmaxl[::2].count(ymax) + xmaxl[::2].count(ymin)\n county_xmin = xminl[::2].count(ymax) + xminl[::2].count(ymin)\n if(ymax - ymin > xmax - xmin):\n square_a = ymax - ymin\n if(county_xmax < count_xmax and county_xmin < count_xmin):\n if(xmax == xmin):\n if(xmin + square_a < x):\n xmax = xmin + square_a\n elif(xmax - square_a >= 0):\n xmin = xmax - square_a\n else:\n print('-1')\n exit()\n else:\n print('-1')\n exit()\n elif(county_xmax < count_xmax and county_xmin == count_xmin):\n xmin = xmax - square_a\n if(xmin < 0):\n print('-1')\n exit()\n elif(county_xmax == count_xmax and county_xmin < count_xmin):\n xmax = xmin + square_a\n if(xmax >= x):\n print('-1')\n exit()\n elif(county_xmax == count_xmax and county_xmin == count_xmin):\n if(square_a < x):\n if(xmin + square_a < x):\n xmax = xmin + square_a\n elif(xmax - square_a >= 0):\n xmin = xmax - square_a\n else:\n xmin = 0\n xmax = xmin + square_a\n else:\n print('-1')\n exit()\n elif(ymax - ymin < xmax - xmin):\n square_a = xmax - xmin\n if(countx_ymax < count_ymax and countx_ymin < count_ymin):\n if(ymax == ymin):\n if(ymin + square_a < y):\n ymax = ymin + square_a\n elif(ymax - square_a >= 0):\n ymin = ymax - square_a\n else:\n print('-1')\n exit()\n else:\n print('-1')\n exit()\n elif(countx_ymax < count_ymax and countx_ymin == count_ymin):\n ymin = ymax - square_a\n if(ymin < 0):\n print('-1')\n exit()\n elif(countx_ymax == count_ymax and countx_ymin < count_ymin):\n ymax = ymin + square_a\n if(ymax >= y):\n print('-1')\n exit()\n elif(countx_ymax == count_ymax and countx_ymin == count_ymin):\n if(square_a < y):\n if(ymin + square_a < y):\n ymax = ymin + square_a\n elif(ymax - square_a >= 0):\n ymin = ymax -square_a\n else:\n ymin = 0\n ymax = ymin + square_a\n else:\n print('-1')\n exit()\n elif(ymax - ymin == xmax - xmin):\n square_a = xmax - xmin\n ans = draw_square(scr, square_a, ymin, xmin)\n for i in range(y):\n print(ans[i])\n\t \t\t \t\t\t \t\t \t \t \t\t\t \t \t \t\t\t\t\t\t" ]

{"inputs": ["4 8\n..w..w..\n........\n........\n..w..w..", "2 4\n....\n.w..", "2 6\nw..w.w\n...w..", "9 4\n....\n....\n....\n....\n....\n..w.\n....\n....\n.w..", "1 1\nw", "2 1\nw\n.", "2 1\nw\nw", "1 2\nww", "2 2\nww\n..", "2 2\n.w\n.w", "2 2\n..\nww", "2 2\nw.\nw.", "2 2\nw.\n.w", "2 2\n..\nw.", "3 3\n...\n..w\nw..", "1 7\nw.....w", "6 9\n.w.......\n.........\n.........\n.........\n.w.......\n......w..", "6 9\n...ww....\n.........\n.........\n.........\n.........\n......w..", "6 9\n.......w.\n.........\n.........\n.........\n.........\n......w..", "5 4\n....\nw...\n...w\n.w..\n..w.", "5 4\nwwww\nwwww\nwwww\nwwww\nwwww", "5 4\n..w.\n..ww\n.www\n.w..\nwwww", "5 4\nwwww\nw..w\nwwww\n.www\n..ww", "8 16\n................\n................\n................\n................\n............w...\n................\n................\n..............w.", "1 2\n.w", "2 2\n.w\n..", "5 2\n..\n.w\nww\n..\n..", "6 2\nw.\n..\n..\n..\n..\n..", "3 2\n..\n.w\n..", "4 2\nw.\n..\n..\n..", "2 1\n.\nw", "6 1\n.\n.\nw\n.\n.\n.", "1 3\n..w", "4 1\n.\nw\n.\n.", "6 2\n..\n.w\n..\n..\n..\n..", "2 1\nw\n.", "5 1\n.\n.\n.\nw\n.", "1 5\n....w", "6 1\nw\n.\n.\n.\n.\n.", "2 1\nw\n.", "1 3\n.w.", "4 1\n.\n.\n.\nw", "4 2\n..\nw.\n.w\n..", "2 2\n..\nw.", "4 2\n..\n..\nw.\n..", "1 6\n.....w", "3 4\nw...\n..w.\n.ww.", "5 2\n..\n..\n..\n..\nw.", "2 2\n..\nw.", "2 1\nw\n.", "4 1\n.\n.\nw\n.", "3 3\n...\n...\n.w.", "6 1\n.\nw\n.\n.\n.\n.", "2 1\n.\nw", "1 3\n..w", "3 1\n.\n.\nw", "6 1\n.\n.\n.\n.\n.\nw", "6 3\n...\n...\n...\n...\n...\n.w."], "outputs": ["..w++w..\n..+..+..\n..+..+..\n..w++w..", "....\n.w..", "-1", "....\n....\n....\n....\n....\n++w+\n+..+\n+..+\n+w++", "w", "w\n.", "-1", "-1", "ww\n++", "+w\n+w", "++\nww", "w+\nw+", "w+\n+w", "..\nw.", "+++\n+.w\nw++", "-1", ".w+++++..\n.+....+..\n.+....+..\n.+....+..\n.w....+..\n.+++++w..", "...ww++++\n...+....+\n...+....+\n...+....+\n...+....+\n...+++w++", "..+++++w.\n..+....+.\n..+....+.\n..+....+.\n..+....+.\n..++++w+.", "-1", "-1", "-1", "-1", "................\n................\n................\n................\n............w+++\n............+..+\n............+..+\n............++w+", ".w", ".w\n..", "..\n+w\nww\n..\n..", "w.\n..\n..\n..\n..\n..", "..\n.w\n..", "w.\n..\n..\n..", ".\nw", ".\n.\nw\n.\n.\n.", "..w", ".\nw\n.\n.", "..\n.w\n..\n..\n..\n..", "w\n.", ".\n.\n.\nw\n.", "....w", "w\n.\n.\n.\n.\n.", "w\n.", ".w.", ".\n.\n.\nw", "..\nw+\n+w\n..", "..\nw.", "..\n..\nw.\n..", ".....w", "w++.\n+.w.\n+ww.", "..\n..\n..\n..\nw.", "..\nw.", "w\n.", ".\n.\nw\n.", "...\n...\n.w.", ".\nw\n.\n.\n.\n.", ".\nw", "..w", ".\n.\nw", ".\n.\n.\n.\n.\nw", "...\n...\n...\n...\n...\n.w."]}

UNKNOWN

PYTHON3

CODEFORCES

1

d184fb3f320d8dcb999611f7b0d120ec

none

Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom there are *n* lanes of *m* desks each, and there are two working places at each of the desks. The lanes are numbered from 1 to *n* from the left to the right, the desks in a lane are numbered from 1 to *m* starting from the blackboard. Note that the lanes go perpendicularly to the blackboard, not along it (see picture). The organizers numbered all the working places from 1 to 2*nm*. The places are numbered by lanes (i. e. all the places of the first lane go first, then all the places of the second lane, and so on), in a lane the places are numbered starting from the nearest to the blackboard (i. e. from the first desk in the lane), at each desk, the place on the left is numbered before the place on the right. Santa Clause knows that his place has number *k*. Help him to determine at which lane at which desk he should sit, and whether his place is on the left or on the right! The only line contains three integers *n*, *m* and *k* (1<=≤<=*n*,<=*m*<=≤<=10<=000, 1<=≤<=*k*<=≤<=2*nm*) — the number of lanes, the number of desks in each lane and the number of Santa Claus' place. Print two integers: the number of lane *r*, the number of desk *d*, and a character *s*, which stands for the side of the desk Santa Claus. The character *s* should be "L", if Santa Clause should sit on the left, and "R" if his place is on the right. Sample Input 4 3 9 4 3 24 2 4 4 Sample Output 2 2 L 4 3 R 1 2 R

[ "ins = list(map(int, input().split()))\r\nn = ins[0]\r\nm = ins[1]\r\nk = ins[2]\r\nkoln = 1\r\nkolm = 1\r\nwhile k > 2*m:\r\n k -= 2*m\r\n koln+=1\r\nwhile k > 2:\r\n k-=2\r\n kolm += 1\r\nif k == 1:\r\n print(koln,kolm,\"L\")\r\nelse:\r\n print(koln, kolm, \"R\")", "n,m,k = map(int,input().split())\r\na,b,c = 0,0,0\r\nif(k%2==1):\r\n c = 'L'\r\nif(k%2==0):\r\n c = 'R'\r\nfor i in range(1,n+1):\r\n if(2*i*m>=k):\r\n a = i\r\n break\r\ntot = a*m*2\r\nb = m - int((tot - k)//2)\r\n\r\nprint(a,b,c)\r\n\"\"\"\r\nk = 24\r\na = 4\r\nb = ((24-6)%(3*3*2))+1 = 18%18 \r\n\"\"\"", "\"\"\"task a.\"\"\"\r\nimport math\r\n\r\nstr = input()\r\nnumber_strings = str.split(\" \")\r\n[n, m, k] = [int(n) for n in number_strings]\r\n\r\ns = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nd = math.ceil((k / 2)) % m\r\nd = m if d == 0 else d\r\n\r\nr = math.ceil(k / (m * 2))\r\n\r\nprint(\" \", r, d, s)\r\n", "n,m,k=map(int,input().split())\nx=k\nprint((k-1)//(m*2)+1,end=' ')\nk=(k-1)%(m*2)\nprint(k//2+1,end=\" \")\nif x%2==0:\n\tprint(\"R\")\nelse:\n\tprint(\"L\")\n", "\r\ninp = str(input());\r\ns = ''\r\nfor s in inp:\r\n s = inp.split(' ')\r\n\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\n\r\ni = 0\r\nr = 1\r\nd = 1;\r\np = 0\r\n\r\nwhile(k > 2 * m * r):\r\n p = 2 * m * r\r\n r += 1;\r\n\r\n\r\n\r\nwhile(k > p):\r\n p += 1\r\n if (i == 2): i = 0; d += 1;\r\n i += 1\r\n\r\nif(k % 2 == 0):\r\n print(r,d,'R')\r\nelse:print(r,d,'L')\r\n\r\n\r\n", "q,w,e=map(int,input().split())\r\nif e%2==1:\r\n c='L'\r\nelse:\r\n c='R'\r\ne=(e+1)//2\r\nx=e%w\r\nif x==0:\r\n x=w\r\nif e%w==0:\r\n z=e//w\r\nelse:\r\n z=e//w+1\r\nprint(z,x,c)\r\n", "n, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n p = k // 2\r\nelse:\r\n p = k // 2 + 1\r\nif p % m == 0:\r\n r = p // m\r\nelse:\r\n r = p // m + 1\r\np %= m\r\nif p == 0:\r\n p = m\r\nif k % 2 != 0:\r\n lr = 'L'\r\nelse:\r\n lr = 'R'\r\nprint(r, p, lr)", "n, m, k = map(int, input().split())\r\nx = int((k - 1) / 2)\r\nprint(int(x / m) + 1, x % m + 1, end=' ')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')", "n, m, k = map(int, input().split())\n\nfor i in range(1, n + 1):\n if k % 2 == 0:\n j = k // 2 - m * (i - 1)\n if 1 <= j and j <= m:\n print(\"{} {} R\".format(i, j))\n exit()\n else:\n j = (k + 1) // 2 - m * (i - 1)\n if 1 <= j and j <= m:\n print(\"{} {} L\".format(i, j))\n exit()\n", "a=input().split()\r\nif int(a[2])%2==0:\r\n s='R'\r\nelse:\r\n s='L'\r\nk=0\r\nif int(a[2])%(int(a[1])*2)>0:\r\n k+=1\r\nr=int(a[2])%(int(a[1])*2)//2+int(a[2])%(int(a[1])*2)%2\r\nif r==0:\r\n r=a[1]\r\nprint(int(a[2])//(int(a[1])*2)+k)\r\nprint(r)\r\nprint(s)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) % (2 * m) + 2) // 2\r\ns = \"L\" if k % 2 else \"R\"\r\nprint(r, d, s)", "n, m, k = map(int, input().split())\r\n\r\nif k&1:\r\n lr = \"L\"\r\nelse:\r\n lr = \"R\" \r\n \r\nk -= 1 \r\nk //= 2\r\n\r\nprint(k // m + 1, k % m + 1, lr)", "n, m, k = map(int, input().split())\r\nr = k // (2 * m) + int(k % (2 * m) != 0)\r\nif k % (2 * m) == 0:\r\n print(r, m, 'R')\r\nelse:\r\n mod = k % (2 * m)\r\n d = mod // 2 + int(mod % 2 != 0)\r\n if mod % 2 == 0:\r\n print(r, d, 'R')\r\n else:\r\n print(r, d, 'L')\r\n", "n, m, k = [int(i) for i in input().split()]\r\n\r\nc = 'R' if (k % 2 == 0) else 'L'\r\nk -= (k % 2 == 0)\r\n\r\nl = 1 + k // (2 * m)\r\nd = 1 + (k % (2 * m) // 2)\r\n\r\nprint(l, d, c)", "n,m,k = [int(x) for x in input().split(\" \")];\r\nif k %2 == 0:\r\n k /=2;\r\n s = 'R';\r\nelse:\r\n k //= 2;\r\n k += 1;\r\n s = 'L';\r\nif k%m == 0:\r\n a = m;\r\nelse:\r\n a = k%m;\r\nif k%m == 0:\r\n b = k/m;\r\nelse:\r\n b = k//m;\r\n b += 1;\r\nprint(str(int(b)) + \" \" + str(int(a)) + \" \" + s);\r\n", "from math import ceil\r\nn,m,k=map(int,input().split())\r\nh=ceil(k/(2*m))\r\ny=((k-((2*(h-1)*m)+1))//2)+1\r\nif k%2!=0:\r\n print(h,y,\"L\")\r\nelse:\r\n print(h,y,\"R\")", "import math, sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\nn, m, x = map(int, fin.readline().split())\r\nr = math.ceil(x / (m * 2))\r\nd = math.ceil((x - ((r - 1) * (m * 2))) / 2)\r\ns = ''\r\nif x % 2 == 1:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nfout.write(str(r) + ' ' + str(d) + ' ' + str(s))\r\n", "n , m , k = map(int , input().split())\r\nres = m * 2\r\nindex =0\r\nindex2 = 0\r\ns = \"\"\r\nfor i in range(1,n+1):\r\n if k<= res*i:\r\n index = i\r\n break\r\nif k%2 == 1 :\r\n index2 = abs((k - (index*res)-1)/ 2)\r\n index3 = abs(index2-1- m)\r\n s = 'L'\r\nelif k%2 == 0:\r\n index2 = abs((k - (index * res)) / 2)\r\n index3 = abs(index2 - m)\r\n s = 'R'\r\n\r\nprint(str(index)+\" \"+str(int(index3))+\" \"+s)", "n, m, k = list(map(int, input().split()))\r\nx = (k-1)//(m*2) + 1\r\ny = ((k % (m*2)) + 1)//2\r\nif y == 0:\r\n y = m\r\nprint(x, y, end=' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "from math import ceil\r\nn,m,k = [int(item) for item in input().split()]\r\n\r\nr = k % (2 * m)\r\n\r\nif r == 0:\r\n line = k // (2 * m)\r\n desk = m\r\n if k % 2 == 0:\r\n side = \"R\"\r\n else:\r\n side = \"L\"\r\nelse:\r\n line = k // (2 * m) + 1\r\n desk = ceil(r / 2)\r\n if k % 2 == 0:\r\n side = \"R\"\r\n else:\r\n side = \"L\"\r\n \r\nprint(line,desk,side)", "n,m,k=map(int,input().split())\r\nc=(k-1)//2\r\nn=c//m+1\r\nm=c%m+1\r\nif k%2==0:\r\n print(n,m,'R')\r\nelse:\r\n print(n,m,'L')\r\n", "# import math\nfrom collections import Counter, deque, defaultdict\nfrom math import *\n\nfrom bisect import bisect_right\nmod = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\ndef isPrime(n):\n if n==1:\n return True\n if n==2 or n==3:\n return True\n if (n%2==0 or n%3==0):\n return False\n i=5\n while i*i<=n:\n if n%i==0 or n%(i+2)==0:\n return False\n i+=6\n return True\n\ndef solve():\n n,m,k=map(int,input().split())\n cur=0\n lane=0\n while cur<k:\n cur+=m*2\n lane+=1\n cur=lane*m*2\n desk=m\n for i in range(m):\n if cur==k:\n print(lane,desk,'R')\n return\n elif cur-1==k:\n print(lane,desk,'L')\n return\n desk-=1\n cur-=2\n\n\n\n\n\n\n\n\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n \t \t\t \t \t \t \t\t \t \t\t\t \t\t \t", "n,m,k=map(int,input().split())\r\n\r\nside=''\r\nrow=(k-1)//(m*2)+1\r\nplace=((k-1)%(m*2))//2+1\r\n\r\nif (k%2==0): side='R'\r\nelse: side='L'\r\n\r\nprint(row,place,side)", "import sys\r\nfrom math import ceil\r\n\r\ndef main():\r\n n, m, k = map(int, sys.stdin.read().strip().split())\r\n r = int(ceil(k/(2*m)))\r\n p = int(ceil(k%(2*m)/2) or m)\r\n return r, p, 'RL'[k%2]\r\n \r\n\r\nprint(*main())\r\n", "import math\r\nn , m , k = map(int,input().strip().split())\r\na3 = \"R\"\r\nif k % 2 != 0:\r\n k += 1\r\n a3 = \"L\"\r\na1 = math.ceil((k//2)/m)\r\na2 = int((k%(m*2))/2)\r\nif a2 == 0:\r\n a2 = m\r\nelse:\r\n a2 = a2\r\nprint(a1,a2,a3)\r\n", "n, m, k = [int(s) for s in input().split(\" \")]\r\ntot = 2*m\r\nlane = k//tot\r\ndesk = k%tot\r\nif desk:\r\n if k&1:\r\n print(lane+1, (desk+1)//2, \"L\")\r\n else:\r\n print(lane+1, (desk+1)//2, \"R\")\r\nelse:\r\n if k&1:\r\n print(lane, m, \"L\")\r\n else:\r\n print(lane, m, \"R\")", "n,m,k=map(int,input().split())\r\nimport math\r\nl=math.ceil(k/(m*2))\r\nif k%(m*2)==0:\r\n d=m\r\nelse:\r\n d=math.ceil((k%(m*2))/2)\r\nif k%2==0:\r\n p='R'\r\nelse:\r\n p='L'\r\nprint(l,d,p)", "a = list (map (int, input ().split ()));\r\nif (a [2] % 2 == 0) : direct = \"R\"\r\nelse : direct = \"L\";\r\nmin_pos = 1;\r\nmax_pos = 0;\r\nres1 = 0;\r\nwhile (max_pos < a [2]) :\r\n max_pos += a [1] * 2;\r\n res1 += 1;\r\n if (res1 > 1) : min_pos += a [1] * 2;\r\nres2 = 1;\r\nfor i in range (min_pos, max_pos + 1) :\r\n if (i == a [2]) : print (res1, res2, direct);\r\n if ((i != min_pos) and (i % 2 == 0)) : res2 += 1;\r\n", "n, m, k = [int(s) for s in input().split(' ')]\r\nlr = ['R', 'L']\r\nanswer = [(k - 1) // (m * 2) + 1, ((k - 1) % (2 * m)) // 2 + 1, lr[k % 2]]\r\nprint(*answer)\r\n", "n, m, k = map(int , input().split())\r\nk -= 1\r\nz = k//2\r\nx = z//m\r\ny = z % m\r\n\r\nprint(x + 1, y + 1, ('L', 'R')[k % 2])\r\n\r\n", "_, m, k = map(int, input().split())\r\nx = (k+1)//2\r\nprint(-(-x//m), (x-1)%m+1, 'RL'[k%2])", "from math import floor\r\nn, m, k = map(int, input().split())\r\ntmp = floor(k-1)/2\r\nprint(floor(tmp/m)+1, int(tmp%m) + 1, [\"R\",\"L\"][k%2])", "n, m, k = map(int, input().split())\r\nL = int(k/(m+m))\r\nif k%(m+m)!=0:L = L + 1\r\nD = (L-1)*(m+m) + 1\r\nif k%2==0:D = D + 1\r\nD = int((k-D)/2) + 1\r\nst = \"L\"\r\nif k%2==0:st = \"R\"\r\nprint(L, D, st)", "n,m,k = map(int,input().split())\r\nblock = m * 2\r\nif k % block == 0:\r\n ryad = k // block\r\nelse:\r\n ryad = (k // block) + 1\r\nper = k\r\nwhile per > block: per -= block\r\nif per % 2 == 0:\r\n s = 'R'\r\n parta = per // 2\r\nelse:\r\n s = 'L'\r\n parta = per // 2 + 1\r\nprint(ryad,parta,s)\r\n", "n, m, k = map(int, input().split())\r\nprint((k + m * 2 - 1) // (m * 2), (k - (((k + m * 2 - 1) // (m * 2)) - 1) * (m * 2) + 1) // 2,\r\n 'R' if k % 2 == 0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\nr = (k + (2 * m - 1)) // (2 * m)\r\nif k % (2 * m) == 0:\r\n d = m\r\nelse:\r\n d = (k % (2 * m) + 1) // 2\r\ns = 'R' if k % 2 == 0 else 'L'\r\nprint(r, d, s)", "n,m,k=map(int,input().split())\r\na=k%2\r\nx={1:\"L\",0:\"R\"}\r\nr=k//(2*m)\r\nif(k%(2*m)!=0):\r\n\tr+=1\r\nd=(k-(m*(r-1)*2))\r\nif(d%2!=0):\r\n\td+=1\r\nd=d//2\r\nprint(r,d,x[a])\r\n\r\n", "from math import ceil\r\na, b, c=map(int, input().split())\r\nd=b*2\r\ne=ceil(c/d)\r\nf=ceil((c-(d*(e-1)))/2)\r\nif c%2==0:\r\n print(e, f, \"R\")\r\nelse:\r\n print(e, f, \"L\")\r\n\r\n", "from math import ceil\nn, m, k = map(int, input().split())\nx = ceil(k/(2*m))\nif k % (2 * m):\n y = ceil((k%(2*m))/2)\nelse: y = m\nz = 'L' if k%2 else 'R'\nprint(x, y, z)", "n, m, k = map(int, input().split())\r\n\r\nr = -(-k // (2*m))\r\nlr = ['R', 'L'][k%2]\r\npos = k % (2*m) if k % (2*m) else 2*m\r\nd = (pos+1) // 2\r\n\r\nprint(r, d, lr)\r\n", "n,m,k=[int(i) for i in input().split()]\r\ncol=m*2\r\na=(k-1)//col+1\r\nb=(k-1)%col\r\nprint(a,b//2+1,['L','R'][b%2])", "n, m, k = map(int, input().split())\r\nk -= 1\r\nprint(k // (2 * m) + 1, (k % (2 * m)) // 2 + 1, 'L' if k % 2 == 0 else 'R')", "spot = list(map(int, input().split()))\r\nrow = spot[2]//(spot[1]*2)\r\nost = spot[2]%(spot[1]*2)\r\nif ost > 0:\r\n\tparta = ost//2\r\n\tif ost/2 != parta:\r\n\t\tparta += 1\r\n\tif ost%2 == 0:\r\n\t\tprint(row+1, parta, 'R')\r\n\telse:\r\n\t\tprint(row+1, parta, 'L')\r\nelse:\r\n\tprint(row, spot[1], 'R')\r\n", "def main():\n n, m, k = map(int, input().split())\n r, k = divmod(k - 1, m * 2)\n print(r + 1, k // 2 + 1, 'LR'[k & 1])\n\n\nif __name__ == '__main__':\n main()\n", "import sys\n\nn, m, k = list(map(int, input().split()))\nr = (k // (m * 2))\nif k % (m * 2) != 0:\n r += 1\nr0 = ((m * 2) * (r - 1)) + 1\nd = ((k - r0) // 2) + 1\nif k % 2 == 0:\n s = 'R'\nelse:\n s = 'L'\nprint(r,d,s) #lane, desk, L/R\n", "\r\nfrom math import ceil\r\nn, m, k = map(int, input().split())\r\nc = ceil(k/(m*2))\r\nprint(c, end=' ')\r\nr = ceil((k - ((c-1)*(m*2)))/2)\r\nprint(r, end=' ')\r\nprint('R' if k % 2 == 0 else 'L')\r\n\r\n# CodeForcesian\r\n# ♥\r\n# تو نمیتونی کتابی رو باز کنی و از اون چیزی یاد نگیری\r\n", "#CF1\r\nn,m,k=list(map(int,input().split()))\r\ny=((k-1)%(2*m))//2+1\r\nx=(k-1)//(2*m)+1\r\n\r\nif k%2==1:r='L'\r\nelse:r='R'\r\nprint(x,y,r)\r\n", "n,m,k = map(int, input().strip().split())\r\nn = 0\r\ni = 1\r\nj = m * 2\r\no = 1\r\nanswn = 0\r\nanswm = 0\r\nwhile answn == 0:\r\n if k <= j and k >= i:\r\n answn = o\r\n else:\r\n i += m * 2\r\n j += m * 2\r\n o += 1\r\ni = 1 + (o - 1) * 2 * m\r\nj = 2 + (o - 1) * 2 * m\r\no = 1\r\nwhile answm == 0:\r\n if k <= j and k >= i:\r\n answm = o\r\n else:\r\n i += 2\r\n j += 2\r\n o += 1\r\nif k % 2 == 0:\r\n print(answn,answm,'R')\r\nelse:\r\n print(answn,answm,'L')\r\n ", "n,m,k=map(int,input().split())\r\nif k%(m*2)==0:\r\n r=k//(m*2)\r\nelse:\r\n r=k//(m*2)+1\r\nk-=(r-1)*m*2\r\nif k%2==0:\r\n s=k//2\r\nelse:\r\n s=k//2+1\r\nif k%2==0:\r\n d='R'\r\nelse:\r\n d='L'\r\nprint(r,s,d, sep=' ')", "n,m,k =map(int,input().split())\r\nper1 = (k-1)//(2*m)\r\nprint(1+per1, end = ' ')\r\nper2 = k - per1* (2*m)\r\nprint(1 + (per2-1)//2, end = ' ')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')", "n,m,k=map(int,input().split())\r\nif k%2==0:\r\n s='R'\r\nelse:\r\n s='L'\r\nc=(k-1)//(2*m)\r\nr=((k-1)%(2*m))//2\r\nprint(c+1,r+1,s)", "n, m, k = map(int, input().split())\r\nrow = 1\r\npos = ''\r\nline = 0\r\nline = k\r\nwhile (line > m*2):\r\n line -= m*2\r\n row += 1\r\nif line%2 == 0:\r\n pos = 'R'\r\nelse:\r\n pos = 'L'\r\nif (line % 2 == 0):\r\n line = line//2\r\nelse:\r\n line = line//2+1\r\nprint(row, ' ', line, ' ', pos)\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n last = 'R'\r\nelse:\r\n last = 'L'\r\nrow = math.ceil(k / (m * 2))\r\nbase = (2 * m) * (row - 1) + 1\r\nsecond = (k - base) // 2 + 1\r\nprint(row, second, last)\r\n\r\n", "n, m, k = map(int, input().split())\r\n\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) // 2) % m + 1\r\ns = 'L' if (k - 1) % 2 == 0 else 'R'\r\n\r\nprint(r, d, s)\r\n", "_, n, m=map(int, input().split())\nn, m=n<<1, m-1\nprint(m//n+1, (m%n+2)>>1, 'LR'[m&1])\n\n\n\n\n# Made By Mostafa_Khaled", "from math import ceil\r\nm, n, k = map(int, input().split())\r\nryad = ceil(k / (n * 2))\r\nk %= n * 2\r\nmesto = ceil(k / 2)\r\nstorona = [\"R\", \"L\"][k%2]\r\nif ryad == 0:\r\n ryad += m\r\nif mesto == 0:\r\n mesto += n\r\nprint(ryad, mesto, storona)", "import math\r\nx=input()\r\nk=[int(i) for i in x.split()]\r\nr=int(math.ceil(k[2]/(2*k[1])))\r\np=(k[2]-1)/2\r\nd=int(p%k[1]+1)\r\nif k[2] % 2 == 0 : s=\"R\"\r\nelse: s=\"L\"\r\nprint(r,d,s)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n no_lane = math.ceil(k / (2 * m))\r\n tmp = k % (2 * m)\r\n if tmp == 0:\r\n tmp = 2 * m\r\n no_desk = math.ceil(tmp / 2)\r\n if k % 2 == 1:\r\n pos = 'L'\r\n else:\r\n pos = 'R'\r\n print('%d %d %s' % (no_lane, no_desk, pos))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m, k = map(int, input().split())\r\n\r\nall_desks = n*m\r\ndesks_in_row = m\r\nrows = n\r\n\r\nif k % 2 == 0:\r\n left_sit = False\r\n for_print = \"R\"\r\nelse:\r\n left_sit = True\r\n for_print = \"L\"\r\n\r\n\r\ndesk = k // 2\r\nif left_sit:\r\n desk += 1\r\n\r\nd = desk % desks_in_row\r\nif desk % desks_in_row == 0:\r\n d = desks_in_row\r\n \r\nr = desk // desks_in_row\r\nif desk % desks_in_row != 0:\r\n r += 1\r\n\r\nprint(r, d, for_print)\r\n", "#!/usr/bin/env python3\n\n\ndef solve():\n n, m, k = map(int, input().split())\n r = ((k - 1) // (m * 2)) + 1\n d = (((k - 1) % (m * 2)) // 2) + 1\n lr = \"L\" if k % 2 == 1 else \"R\"\n print(r, d, lr)\n\n\nif __name__ == '__main__':\n solve()\n", "n, m, k = [int(i) for i in input().split()]\r\na = (k-1) // (2*m) + 1\r\nb = ((k-1)%(2*m))//2 + 1\r\nif ((k-1)%(2*m))%2 == 1:\r\n print(str(a)+' '+str(b)+' '+'R')\r\nelse:\r\n print(str(a)+' '+str(b)+' '+'L')", "n,m,k=map(int,input().split())\r\na,b,c=0,0,0\r\nif k%2==0:\r\n c='R'\r\n k=k//2\r\nelse:\r\n c='L'\r\n k=(k+1)//2\r\na=k//m+1\r\nb=k%m\r\nif b==0:\r\n b=m\r\n a-=1\r\nprint(a,b,c)\r\n", "import math\r\nlanes,desks,number = map(int,input().split())\r\nnumberperlane = desks*2\r\ncolumn = math.ceil(number/numberperlane)\r\nrow = math.ceil((number-((column-1)*numberperlane))/2)\r\nprint(column,row,'R' if number%2==0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\nflag = False\r\nif k % 2 == 0:\r\n flag = True\r\n\r\nfor i in range(1, n+1):\r\n if k <= i * m * 2:\r\n if flag:\r\n print(i, ((k - 1) // 2) % m + 1, 'R')\r\n else:\r\n print(i, ((k - 1) // 2) % m + 1, 'L')\r\n break", "n, m, k = map(int, input().split(' '))\r\n\r\nif k % (m << 1) == 0:\r\n print(k // (m << 1), m, 'R')\r\nelse:\r\n a = k // (m << 1)\r\n b = k - 2 * a * m\r\n if b % 2 == 1:\r\n print(a + 1, b // 2 + 1, 'L')\r\n else:\r\n print(a + 1, b // 2, 'R')", "n, m, K = map(int, input().split())\r\nif K%2: print((K-1)//(2*m)+1, ((K-1)%(2*m))//2+1, 'L')\r\nelse: print((K-2)//(2*m)+1, ((K-2)%(2*m))//2+1, 'R')\r\n", "[x,y,n] = [int(i)for i in input().split(' ')]\nc = n//(2*y)+1 if not n%(2*y)==0 else int(n/(2*y))\nprint(c,(n-(c-1)*y*2)//2,'R') if (n-(c-1)*y*2)%2==0 else print(c,(n+1-(c-1)*y*2)//2,'L')\n \t\t \t\t\t \t \t \t\t\t \t \t \t", "from math import ceil as c\r\nl,d,p=map(int,input().split())\r\nx=c(p/(2*d))\r\ny=p-(2*d)*(x-1)\r\nprint(x,c(y/2),end=\" \")\r\nif y%2==1:print(\"L\")\r\nelse:print(\"R\")", "class CodeforcesTask752ASolution:\n def __init__(self):\n self.result = ''\n self.n_m_k = []\n\n def read_input(self):\n self.n_m_k = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n lane = (self.n_m_k[2] - 1) // (2 * self.n_m_k[1]) + 1\n row = (self.n_m_k[2] + 1 - (2 * self.n_m_k[1] * (lane - 1))) // 2\n position = \"L\" if self.n_m_k[2] % 2 else \"R\"\n self.result = \"{0} {1} {2}\".format(lane, row, position)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask752ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nf = (k + 2 * m - 1) // (2 * m)\r\ntmp = (k + 2 * m - 1) % (2 * m) + 1\r\ns = (tmp + 1) // 2\r\nt = 'L' if tmp % 2 == 1 else 'R'\r\n\r\nprint(f, s, t)", "n, m, k = map(int, input().split())\r\nx = m * 2\r\nk -= 1\r\nprint(k // x + 1, k % x // 2 + 1, \"LR\"[k % x % 2])\r\n", "import math\r\nn,m,val=map(int,input().split())\r\nif val%2==0:\r\n res=\"R\"\r\nelse:\r\n res=\"L\"\r\np=math.floor((val-1)/2)\r\nrow=math.floor(p/m)+1\r\ncol=p%(m)+1\r\nprint(row,col,res)", "def codeforces(n, m, k):\r\n if k % 2 == 1:\r\n k += 1\r\n side = 'L'\r\n else:\r\n side = 'R'\r\n k //= 2\r\n r = k // m\r\n if k % m != 0:\r\n r += 1\r\n s = k % m\r\n if s == 0:\r\n s = m\r\n return r, s, side\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nr, s, side = map(str, codeforces(n, m, k))\r\nprint(' '.join([r, s, side]))\r\n", "n,m,k=map(int,input().split())\r\n\r\nk-=1\r\nLane = 2 * m\r\nDesk = (k%Lane) // 2\r\nLane = k//Lane\r\n\r\nL = Desk % 2\r\n\r\nif k %2== 1:\r\n print(str(Lane + 1) + ' ' + str(Desk + 1) + ' ' + 'R')\r\nelse:print(str(Lane + 1) + ' ' + str(Desk + 1) + ' ' + 'L')\r\n", "import math\r\nn,m,k=list(map(int,input().split()))\r\nprint(math.ceil(math.ceil(k/2)/m),end=\" \")\r\nif math.ceil(k/2)%m==0:\r\n print(m,end=\" \")\r\nelse:\r\n print((math.ceil(k/2)%m),end=\" \")\r\nif k%2==0:\r\n print(\"R\")\r\nelse:\r\n print(\"L\")", "from math import ceil\r\n\r\n\r\nn,m,y = map(int, input().split())\r\n\r\nif y%2==0:\r\n o = \"R\"\r\nelse:\r\n o = \"L\"\r\n\r\nlane = ceil(y/(2*m))\r\ny -= (lane-1)*2*m\r\ndesk = ceil(y/2)\r\nprint(lane, desk, o)", "def r():\r\n\treturn list(map(int, input().split()))\r\nn, m, k = r()\r\na = (k + 2 * m - 1) // (2 * m)\r\nk -= (a - 1) * 2 * m\r\nb = (k + 1) // 2\r\nc = 'R' if k % 2 == 0 else 'L'\r\nprint(a, b, c)", "n, m, k = [int(i) for i in input().split()]\nk -= 1\nlane = k //(2*m) + 1\nk -= (lane-1)*(2*m)\nif k%2 == 0:\n letter = \"L\"\nelse:\n letter = \"R\"\ndesk = k // 2 +1\nprint(lane, desk, letter)", "row_num, desk_num, place = map(int, input().split())\r\nif place % 2 == 1:\r\n k = (place+1)//2\r\nelse:\r\n k = place//2\r\nif k%desk_num == 0:\r\n desk_num_res = desk_num\r\n row_num_res = k//desk_num\r\nelse:\r\n desk_num_res = k%desk_num\r\n row_num_res = k//desk_num+1\r\nif place % 2 == 0:\r\n place_res = 'R'\r\nelse:\r\n place_res = 'L'\r\nprint(row_num_res, desk_num_res, place_res)\r\n", "a = input().split()\r\nm, k = 2 * int(a[1]), int(a[2]) - 1\r\nprint(k // m + 1, k % m // 2 + 1, 'LR'[k % 2])", "a=input()\r\na=a.split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\na[2]=int(a[2])\r\naf=a[1]*2\r\nr=1\r\nq=1\r\nif a[2]%af!=0:\r\n t=a[2]//af+1\r\nelse:\r\n t=a[2]//af\r\nif a[2]%af!=0:\r\n \r\n r=a[2]%af\r\nelse:\r\n r=af\r\nif r%2==0:\r\n print(str(t)+' '+str(r//2)+' '+'R')\r\nelse:\r\n print(str(t)+' '+str(r//2+1)+' '+'L')\r\n \r\n \r\n", "import math\nn, m, k = [int(s) for s in input().split()]\nprint(math.ceil(k/(2*m)), math.ceil((k-(math.ceil(k/(2*m))-1)*m*2)/2), end=' ')\nif k%2:\n print('L')\nelse:\n print('R')\n", "n,m,k=map(int,input().split())\nq=(m*2)\na=1\nwhile True:\n if k<=q:\n break\n a+=1\n q+=(m*2)\nprint(a,end=\" \")\n#q = 24 \n# (m*2)=6 \n# 19 start\n# 24 end\ns=q-(m*2)+1 # 19 start\nc=1\nwhile True:\n if k==s or k==s+1:\n print(c,end=\" \")\n break\n s+=2\n c+=1\n \nprint(\"R\" if k%2==0 else \"L\") ", "n,m,k=map(int,input().split())\r\np=m*2\r\ni=0\r\nr=1\r\nwhile i+p<k :\r\n i=i+p\r\n r=r+1\r\nk=k-p*(r-1)\r\nif k%2==0 :\r\n i=2\r\n v=1\r\n while i!=k :\r\n v=v+1\r\n i=i+2\r\n print(r,v,'R')\r\nelse :\r\n i=1\r\n v=1\r\n while i!=k :\r\n v=v+1\r\n i=i+2\r\n print(r,v,'L')\r\n \r\n \r\n \r\n", "n,m,k=map(int,input().split())\r\nt=((k-1)//2)//m+1\r\ns=((k-1)//2)%m+1\r\nif k%2!=0:\r\n print(t,s,'L')\r\nelse:\r\n print(t,s,'R')", "# LUOGU_RID: 106573685\nn,m,k=list(map(int,input().split()))\r\nls=['LR'*m for i in range(n)]\r\nhang=k%(2*m)\r\nif hang!=0:\r\n hang=k//(2*m)+1\r\nelse:\r\n hang=k//(2*m)\r\nlie=k%(2*m)\r\nif lie==0:\r\n lie=2*m\r\nif lie%2==0:\r\n column=lie//2\r\nelse:\r\n column=(lie//2)+1\r\nprint(hang,column,ls[hang-1][lie-1])", "from math import trunc\r\n\r\nn, m, k = map(int, input().split())\r\n\r\na = 2 * m\r\n\r\nn1 = k // a + (1 if k % a != 0 else 0)\r\n\r\nm1 = (k - (n1 - 1) * a ) // 2 + (1 if k % 2 != 0 else 0)\r\n\r\nprint(n1, m1, 'L' if k % 2 else 'R')\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nN,M,K = map(int,input().split())\nk = (K-1)//2\ndesk = k % M\nlane = k // M\nif (K-1) % 2:\n lr = \"R\"\nelse:\n lr = \"L\"\n\nprint(\"{} {} {}\".format(lane+1, desk+1, lr))\n\n", "def solve(n,m,k):\r\n lane = 1 + (k-1) // (2*m)\r\n desk = 1 + ((k-1) % (2*m)) // 2\r\n LR = [\"L\",\"R\"][k % 2 == 0]\r\n return f'{lane} {desk} {LR}'\r\n\r\nn, m, k = map(int, input().split())\r\nprint(solve(n,m,k))", "n,m,d=map(int,input().split())\r\ni=1\r\nii=1\r\nwhile i<=2*n*m:\r\n if d>=i and d<(i+2*m):\r\n j=i\r\n jj=1\r\n while j<i+2*m:\r\n if j==d or j+1==d:\r\n if d%2==0:\r\n print(ii,jj,'R')\r\n break\r\n else:\r\n print(ii,jj,'L')\r\n break\r\n j=j+2\r\n jj=jj+1\r\n break\r\n else:\r\n i=i+(2*m)\r\n ii=ii+1\r\n\r\n ", "n,m,k = map(int,input().split())\r\n\r\nr = int(k/(2*m)) + (1 if k%(2*m) else 0)\r\nd_ = k-(r-1)*m*2\r\nd = int(d_/2) + int(d_%2)\r\nif d_%2: s = 'L'\r\nelse: s = 'R'\r\n\r\nprint(r,d,s)", "n,m,k = [int(i) for i in input().split()]\nblocksize = m*2\nactualblock = ((k-1)//blocksize)+1\nplaceinblock = k-(blocksize*(actualblock-1))\nactualside = \"L\" if placeinblock%2 else \"R\"\nprint(actualblock,(placeinblock-1)//2+1,actualside)\n", "n,m,k = list(map(int,input().split()))\r\n\r\nr1 = 0\r\nfor i in range(1,n+1) :\r\n\tif (r1 < k) and (k <= 2*m*i) : \r\n\t\tr = i\r\n\t\tbreak\r\n\telse : r1 = 2*m*i\r\n\r\nif (k - 2*(r-1)*m) % 2 == 0 : \r\n\ts = \"R\"\r\n\td = (k - 2*(r-1)*m - 2)//2 + 1\r\nelse : \r\n\ts = \"L\"\r\n\td = (k - 2*(r-1)*m - 1)//2 + 1\r\n\r\nprint(r,d,s)", "n,m,k=map(int,input().split())\r\ni=0\r\nwhile(i<=(n+1)):\r\n if(k<(1+2*m*i)):\r\n print(i,end=\" \")\r\n stand=(1+2*m*(i-1))\r\n if(k%2):\r\n print(int((k-stand)/2)+1,'L')\r\n else:\r\n print(int((k-stand)/2)+1,'R')\r\n exit()\r\n i+=1", "l=input().split()\nn,m,k=int(l[0]),2*int(l[1]),int(l[2])\ndef round(x):\n\tif x-int(x)==0:\n\t\treturn(int(x))\n\telse:\n\t\treturn(int(x)+1)\ndef side (x):\n\tif x%2==0:\n\t\treturn ('R')\n\telse:\n\t\treturn('L')\nlane=round(k/m)\nside=side(k)\ndisk=round((k%m)/2)\nif disk==0: disk+=m//2\nprint(lane,disk,side)", "m,n,k=map(int,input().split())\r\nprint((k-1)//(2*n)+1, (k-1)%(2*n)//2+1, \"RL\"[k%2])\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nprint(math.ceil(k / (2 * m)), end = \" \")\r\nprint(math.ceil((k % (2 * m)) / 2), end = \" \") if k % (2 * m) != 0 else print(m, end = \" \")\r\nprint(\"L\") if k % 2 == 1 else print(\"R\")\r\n", "[n, m, k] = map(int, input().split())\r\n\r\nlane_number = 0\r\ndesk_number = 0\r\ndesk_left_or_right = 'L'\r\n\r\nfor lane_index in range(1, n+1):\r\n lower_bound = (lane_index - 1) * 2 * m + 1 \r\n upper_bound = lane_index * 2 * m \r\n if (k >= lower_bound and k <= upper_bound):\r\n lane_number = lane_index\r\n desk_number = (k - lower_bound)//2 + 1 \r\n if (k%2 == 0):\r\n desk_left_or_right = 'R'\r\n else:\r\n desk_left_or_right = 'L'\r\n break\r\n \r\nprint(lane_number, desk_number, desk_left_or_right)", "n, m, k = map(int, input().split())\r\nf = (k - 1) // (2 * m)\r\n\r\ns = (k - 1) % (2 * m)\r\nif s % 2 == 0:\r\n print(f + 1, s // 2 + 1, 'L')\r\nelse:\r\n print(f + 1, s // 2 + 1, 'R')\r\n\r\n", "n, m, k = map(int, input().split())\r\nrow = (k - 1) // (2 * m) + 1\r\nplace = k % (2 * m)\r\nif place == 0:\r\n place = 2 * m\r\ns = None\r\np = (place - 1) // 2 + 1\r\nif place % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(row, p, s)", "# A. Santa Claus and a Place in a Class\n\nn, m, k = map(int, input().split())\n\nr = k // (2 * m)\nif k % (2 * m) != 0:\n r += 1\n\nd = (k - (r - 1) * 2 * m) // 2\nif (k - (r - 1) * 2 * m) % 2 != 0:\n d += 1\n\ns = \"L\" if k % 2 != 0 else \"R\"\n\nprint(r, d, s)\n", "n,m,k=[int(i) for i in input().split()]\r\nif (k%2==0):\r\n s=\"R\"\r\nelse:\r\n s=\"L\"\r\nr = k//(2*m)\r\nif(k%(2*m)!=0):\r\n r+=1\r\nd=k-(r-1)*2*m\r\nif(d%2!=0):\r\n d+=1\r\nd = d//2\r\nprint(r,d,s)", "def solve():\n n, m, k = map(int, input().split())\n r = (k-1) // (2*m)\n p = (k-1) % (2*m) + 1\n x = 'L' if p%2 else 'R'\n return (r+1, (p+1)//2, x)\n\nprint(' '.join(map(str, solve())))\n \n \n", "x,y,t=map(int,input().split())\r\nfor i in range(1,x+1):\r\n p=i*(y*2)\r\n if t<=p:\r\n print(i,end=\" \")\r\n break\r\np-=1\r\nfor i in range(y,0,-1):\r\n if t>=p:\r\n print(i,end=\" \")\r\n break\r\n p-=2\r\nprint(\"R\" if t%2==0 else \"L\")\r\n ", "n, m, k = map(int, input().split())\r\nr = (k - 1) // (m * 2) + 1\r\nc = (k - 1) % (m * 2) // 2 + 1\r\nif k & 1:\r\n o = 'L'\r\nelse:\r\n o = 'R'\r\nprint(r, c, o)", "n, m, k = map(int, input().split())\r\nk0=k\r\nif k%2!=0:\r\n k0+=1\r\nk0//=2\r\n\r\nk1=k0\r\nif k1%m==0:\r\n k1-=1\r\nk1//=m\r\nk1+=1\r\n\r\nk2=(k-(k1-1)*2*m)\r\n\r\nk2//=2\r\nif k%2!=0:\r\n k2+=1\r\nprint(k1,end = \" \")\r\nprint(k2, end = \" \")\r\nif k%2==0:\r\n print('R')\r\nelse:\r\n print('L')", "n,m,k=map(int,input().split())\r\nd=m*2;k-=1\r\nprint(k//d+1,k%d//2+1,'LR'[k%d%2])\r\n", "# LUOGU_RID: 106629544\nn,m,k=map(int,input().split())\r\nfor i in range(1,n+1):\r\n if k<=2*m*i:\r\n break\r\nw=k-2*m*(i-1)\r\nx=w//2\r\nif w%2==0:\r\n print(\"{} {} R\".format(i,x))\r\nelse:\r\n print(\"{} {} L\".format(i,x+1))", "n,m,k=(input().split())\r\nn=int(n)\r\nm=int(m)\r\nk=int(k)\r\nquot=int(k/(2*m))\r\nrem=k%(2*m)\r\nif rem != 0:\r\n quot+=1\r\nif rem==0:\r\n d=m\r\n r=0\r\nelse:\r\n d=int(rem/2);\r\n r=int(rem%2);\r\n if r!= 0:\r\n d+=1\r\nif r==1:\r\n print(str(quot)+\" \"+ str(d)+\" \"+ 'L')\r\nif r==0:\r\n print(str(quot)+\" \"+ str(d)+\" \"+ \"R\")\r\n", "n,m,k = [int(i) for i in input().split()]\r\n\r\nif (not k%(2*m)):\r\n l = k//(2*m)\r\nelse:\r\n l = k//(2*m)+1\r\n\r\nidd = k - (l-1)*2*m;\r\n\r\nrow = (idd+1)//2\r\n\r\ndirec = ''\r\nif (not k%2):\r\n direc = 'R'\r\nelse:\r\n direc = 'L'\r\n\r\nprint(\"{} {} {}\".format(l, row, direc))\r\n", "n,m,k=map(int,input().split())\r\ns=k%2\r\nr=(k-1)//(2*m)\r\nd=r*m+1\r\ni=d*2\r\nd=1\r\nif s==1:\r\n i-=1\r\nwhile i!=k:\r\n i+=2\r\n d+=1\r\nif s==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r+1,d,s)", "f=lambda:map(int,input().split())\r\nn,m,k=f()\r\nif k%2!=0:\r\n x=((k+1)//2-1)%m+1\r\n print(((k+1)//2-1)//m+1,x,'L')\r\nelse:\r\n x=((k//2)-1)%m+1\r\n print((k//2-1)//m+1,x,'R')", "\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nd = k / (2 * m)\r\nif (d - (math.floor(d)) != 0):\r\n d = math.floor(d) + 1\r\nelse:\r\n d = math.floor(d)\r\nc = (k - (2 * m * (d - 1) + 1)) // 2\r\nc = c + 1\r\nif (k % 2 == 0):\r\n print(d, c, \"R\")\r\nelse:\r\n print(d,c,\"L\")", "# Santa Claus and a Place in a Class\ndef santa(n, m, k):\n direction = 'R'\n if k & 1 == 1:\n direction = 'L'\n lane = 2\n while True:\n if k <= (m * lane):\n prev = (m * (lane - 2)) + 1\n desk = 1\n while True:\n if k == prev or k == prev + 1:\n break\n desk += 1\n prev += 2\n break\n lane += 2\n lane //= 2\n print(lane, desk, direction)\nn, m, k = list(map(int, input().split()))\nsanta(n, m, k)", "import sys\r\nn,m,k = [int(i.strip()) for i in sys.stdin.readlines()[0].split(' ')]\r\nif k%2==1:\r\n S = 'L'\r\nelse:\r\n S = 'R'\r\nif S == 'L':\r\n d = (k+1)//2\r\nelse:\r\n d = k//2\r\nif d%m == 0:\r\n r = d//m\r\n d = m\r\nelse:\r\n r = d//m + 1\r\n d = d%m\r\nprint (r,d,S)", "n=list(map(int,input().split()))\r\nc=0\r\nlst=[]\r\nfor j in range(1,(n[0]*2)+1):\r\n if(j%2==0):\r\n v=n[1]*j\r\n if(v>=n[2]):\r\n c=n[1]-((v-n[2])//2)\r\n lst.append(j//2)\r\n break\r\nif(n[2]%2==0):\r\n b='R'\r\nelse:\r\n b='L'\r\nprint(lst[0],c,b)\r\n", "n,m,k=map(int,input().split())\r\nr=int(k/(2*m)+0.99999999999)\r\nq=int( ((k-((r-1)*2*m))/2) +0.99999999999)\r\nprint(r,end=\" \")\r\nprint(q,end=\" \")\r\nif k%2==0:\r\n print(\"R\");\r\nelse:\r\n print(\"L\")", "n, m, k = map(int, input().split())\r\n\r\nx = int((k + (k % 2)) / 2)\r\n\r\nprint(int((x - 1) / m) + 1, end = \" \")\r\nprint(((x - 1) % m) + 1, end = \" \")\r\n\r\nif k % 2 != 0:\r\n\tprint(\"L\")\r\nelse:\r\n\tprint(\"R\")", "n,m,k = map(int, input().split())\r\nnum = 1\r\nlastnum = 1\r\ni_n = 0\r\nfor i in range(2, n+2):\r\n\ti_n +=1\r\n\tlastnum = num\r\n\tnum+=2*(m)\r\n\t#print(num, lastnum, i, i_n)\r\n\tif num > k:\r\n\t\tnum = lastnum\r\n\t\trd = i_n\r\n\t\tprt = 1\r\n\t\t#print(num, i,i_n, num%2)\r\n\t\tif k%2 == 1:\r\n\t\t\twhile(num!=k):\r\n\t\t\t\tnum+=2\r\n\t\t\t\tprt+=1\r\n\t\t\tprint(rd, prt, 'L')\r\n\t\telse:\r\n\t\t\tnum+=1\r\n\t\t\t#print(num)\r\n\t\t\twhile(num!=k):\r\n\t\t\t\tnum+=2\r\n\t\t\t\tprt+=1\r\n\t\t\tprint(rd, prt, 'R')\t\r\n\t\tbreak\t\t", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nk=int(a[2])\r\nimport math\r\nif k%2==0:\r\n pos='R'\r\nelse:\r\n pos='L'\r\na1=math.ceil(k/(2*m))\r\na2=((k-(a1-1)*m*2)+1)//2\r\nprint(a1,a2,pos)\r\n \r\n", "m, n, k = map(int, input().split())\r\ncol = int((k-1) / (2 * n)) + 1\r\nrow = int((k - (col-1)*2*n -1) / 2) + 1\r\nif k % 2 == 0:\r\n\tdir = 'R'\r\nelse:\r\n\tdir = 'L'\r\nprint (col,row,dir)", "from math import ceil as c\r\nn,m,k = map(int,input().split())\r\nprint(c(k/(2*m)),end=\" \")\r\nif k%(2*m)==0:\r\n\tprint(m,end=\" \")\r\nelse:\r\n\tprint(c((k%(2*m))/2),end=\" \")\r\nif k%2==0:\r\n\tprint('R')\r\nelse:\r\n\tprint('L')", "n,m,k=map(int,input().split())\r\nr,d,lr=0,0,'R'\r\nif k%2: lr='L'; k+=1\r\nk//=2\r\nr=-(-k//m)\r\nd=k-(m*(r-1))\r\nprint(r,d,lr)", "n,m,k =[int(i)for i in input().split()]\r\n\r\nd=(k+1)//2 if k%2==1 else k//2\r\nb=m if d%m==0 else d%m\r\nc=\"R\" if k%2==0 else \"L\"\r\nwhile k%(2*m)!=0:\r\n\tk+=1\r\na=k//(2*m)\r\nprint(a,b,c)", "n, m, k = map(int, input().split())\r\nif k%2 == 0:\r\n\ta=k//2\r\n\tb=a//m\r\n\tif a%m!=0:\r\n\t\tb+=1\r\n\t\tc=a%m\r\n\telse:\r\n\t\tc=m\r\n\tprint(b,c,'R')\r\nelse:\r\n\ta=(k+1)//2\r\n\tb=a//m\r\n\tif a%m!=0:\r\n\t\tb+=1\r\n\t\tc=a%m\r\n\telse:\r\n\t\tc=m\r\n\tprint(b,c,'L')", "n, m, k = map(int, input().split())\r\nkk = (k - 1) // 2\r\ns = 'L' if k % 2 == 1 else 'R'\r\nu = kk // m + 1\r\ng = kk % m + 1\r\nprint(u, g, s)\r\n", "n,m,k=[int(x) for x in input().split()]\r\nif k%(2*m)==0:\r\n print(k//(2*m),end=' ')\r\nelse:\r\n print(k//(2*m)+1,end=' ')\r\nif k%(2*m)==0:\r\n print(m,end=' ')\r\nelse:\r\n print((k%(2*m)+1)//2,end=' ')\r\nif k%2!=0:\r\n print('L')\r\nelse:\r\n print('R')", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=list(map(int,input().split(\" \")))\r\nres=[]\r\nif k%2==0:\r\n dir=\"R\"\r\nelse:\r\n dir=\"L\"\r\nlane=1\r\nright=m*2\r\ntemp=right\r\ni=2\r\nwhile temp<k:\r\n temp=right*i\r\n lane=lane+1\r\n i=i+1\r\nif temp==k:\r\n desk=m\r\nelse:\r\n if k%2!=0:\r\n temp=temp-1\r\n if temp==k:\r\n desk=m\r\n else:\r\n while True:\r\n if m==1:\r\n break\r\n temp=temp-2\r\n if temp==k:\r\n desk=m-1\r\n break\r\n m=m-1\r\n else:\r\n while True:\r\n if m==1:\r\n break\r\n temp=temp-2\r\n if temp==k:\r\n desk=m-1\r\n break\r\n m=m-1\r\nprint(lane,desk,dir)\r\n\r\n \r\n\r\n ", "import math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nr = math.ceil(k / (m * 2))\r\nd = math.ceil((k - (r - 1) * m * 2) / 2)\r\n\r\nif k % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\n\r\nprint(r, d, s)", "import math\nline = input()\nlane, desk, k = [int(x) for x in line.split()]\n\n#lane = int(input())\n#desk = int(input())\n#k = int(input())\n\nlaneno = math.ceil(k/(2*desk))\ndeskno = k%(2*desk)\nif deskno == 0: deskno = desk\nelse: deskno = math.ceil(deskno/2)\n\nif k%2 == 0: ch = 'R'\nelse: ch = 'L'\n\nprint(str(laneno) + \" \" + str(deskno) + \" \" + ch)\n\n", "import math\r\nn, m, k = map(int, input().split())\r\ns = (k % 2)\r\nk -= (1-s)\r\nif s == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\n\r\n\r\nr = k // (2*m) + 1\r\nk += 1\r\n\r\nd = (k % (2*m)) //2\r\nif d == 0:\r\n d = m\r\n\r\nprint(r, d, s)\r\n", "n, m, k = map(int, input().split())\r\n\r\ntotal = n * m * 2\r\n\r\n\r\nper_lane = m * 2\r\n\r\nlane = (k+per_lane-1) // per_lane\r\n\r\nnew_k = k % per_lane\r\nif new_k == 0:\r\n new_k = per_lane\r\n\r\nside = None\r\nif new_k % 2 == 0:\r\n side = \"R\"\r\n row = new_k // 2\r\nelse:\r\n side = \"L\"\r\n row = new_k // 2 + 1\r\n\r\nprint(lane, row, side)\r\n\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, m, k] = list(map(int, input().split()))\r\nc = (k+1)//2\r\nlane = (c+m-1)//m\r\ndesk = c%m\r\nif desk == 0:\r\n desk = m\r\nres = [lane, desk]\r\nif k%2 == 0:\r\n res.append('R')\r\nelse:\r\n res.append('L')\r\nprint(' '.join(map(str, res)))", "#\r\n# Created by Polusummator on 25.10.2020\r\n# --------- Little PyPy Squad ---------\r\n# Verdict: \r\n#\r\nn, m, k = [int(i) for i in input().split()]\r\nif not k % (m * 2):\r\n r = k // (m * 2)\r\nelse:\r\n r = k // (m * 2) + 1\r\n# print(r)\r\nk1 = k % (m * 2) if k % (m * 2) else m * 2\r\nif k1 % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nif not k1 % 2:\r\n l = k1 // 2\r\nelse:\r\n l = k1 // 2 + 1\r\nprint(r, l, s)\r\n", "#!/usr/bin/env python3\ndef ri():\n return map(int, input().split())\n\nn, m, k = ri()\n\na = (k-1) // (m*2) + 1\nb = ((k-1) %(m*2))//2 +1\n\nif k%2:\n c = 'L'\nelse:\n c = 'R'\n\nprint(a, b, c)\n\n", "n,m,k=[int(x) for x in input().split()]\r\nif k%2!=0:\r\n\ts='L'\r\nelse :\r\n\ts='R'\r\np=(k-1)//2\r\nprint(p//m+1,p%m+1,s)", "n, m, k = map(int, input().split())\r\n\r\nif k % 2 == 0:\r\n\tp = k // 2\r\n\tisD = 'R'\r\nelse:\r\n\tp = k // 2 + 1\r\n\tisD = 'L'\r\n\t\r\nif p % m == 0:\r\n\tr = p // m\r\n\td = m\r\nelse:\r\n\tr = (p // m) + 1\r\n\td = p % m\r\n\r\nprint(r, d, isD)\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tn,m,k=read_ints()\r\n\tk-=1\r\n\tlane = k//(2*m)\r\n\tdesk = (k%(2*m))//2\r\n\tlr = \"L\" if k%2==0 else \"R\"\r\n\tprint(lane+1, desk+1, lr)\r\n\r\nsolve()\r\n", "l = list(map(int,input().split()))\r\nn = l[0]; m =l[1];k = l[2];\r\np = 2;\r\nQ = \"L\"\r\nif k%2==0:\r\n Q = \"R\"\r\nM = ((k-1)%(m*2))//2+1\r\n\r\nN = (k-1)//(m*2)+1\r\nprint(N,M,Q)\r\n", "n, m, k = list(map(int, input().split(' ')))\r\nx = (k - 1) // 2\r\nr = x // m + 1\r\nd = x % m + 1\r\nif k & 1:\r\n print(r, d, 'L')\r\nelse:\r\n print(r, d, 'R')\r\n", "n,m,k = map(int, input().split())\r\nd = m * 2\r\nk -= 1\r\nprint (k // d + 1, k % d // 2 + 1, 'LR'[k % d % 2])", "n, m, k = map(int, input().split())\r\nprint((k+(2*m)-1)//(2*m), (k-2*m*((k+(2*m)-1)//(2*m)-1)+1)//2 , \"L\" if k%2 else \"R\")", "from math import ceil\r\nn,m,k=map(int,input().split())\r\nprint(ceil(ceil(k/2)/m),(ceil(k/2)-1)%m+1,'RL'[k%2])", "n,m,k=map(int,input().split())\r\nkt=(k+1)//2\r\nrow=(kt+m-1)//m\r\ncol=(kt-1)%m+1\r\nif k%2:\r\n print(row,col,'L')\r\nelse:\r\n print(row,col,'R')\r\n", "n ,m ,k =map(int,input().split())\r\ndesk=0\r\nlane=0\r\nplace='0'\r\n\r\nif k % 2 ==0:\r\n place='R'\r\n p=k//2\r\nelse:\r\n place='L'\r\n p = k // 2 + 1\r\n\r\nif p % m == 0:\r\n\tlane = p // m\r\n\tdesk = m\r\nelse:\r\n\tlane = (p // m) + 1\r\n\tdesk = p % m\r\n\r\n\r\nprint(lane,desk,place) \r\n \r\n \r\n\r\n ", "def santa(m, k):\r\n l = ((k - 1) // (2 * m)) + 1\r\n t = k - ((l - 1) * 2 * m)\r\n d = (t + 1) // 2\r\n if k % 2 == 0:\r\n return l, d, \"R\"\r\n return l, d, \"L\"\r\n\r\n\r\nN, M, K = [int(i) for i in input().split()]\r\nprint(*santa(M, K))\r\n", "def solution(cols, rows, k):\r\n C = (k + 2 * rows - 1) // (2 * rows)\r\n k -= (C - 1) * 2 * rows\r\n R = (k + 1) // 2\r\n \r\n return f\"{C} {R} {'L' if k % 2 == 1 else 'R'}\"\r\n\r\ncols, rows, k = map(int, input().split())\r\nprint(solution(cols, rows, k))\r\n", "n,m,k=map(int,input().split())\r\nflag=True if k%2==0 else False\r\nfor i in range(1,n+1):\r\n if k<= i*m*2:\r\n print(i , ((k - 1) // 2) % m + 1 ,'R' if flag else 'L')\r\n break\r\n\r\n", "import math as ma\nn, m, k = map(int, input().split())\nr, d, s = ma.ceil(k/m/2), ma.ceil(((k-1) % (m*2)+1)/2), 'L' if k & 1 else 'R'\nprint(r, d, s)\n", "n, m, k0 = map(int, input().split())\r\nk = k0\r\nans1 = k // (2 * m)\r\nk = k % (2 * m)\r\nif k == 0:\r\n print(ans1, m, \"R\")\r\nelse:\r\n c = [\"R\", \"L\"]\r\n ans1 += 1\r\n ans2 = k // 2\r\n if k0 % 2 == 1:\r\n ans2 += 1\r\n ans3 = c[k0 % 2]\r\n print(ans1, ans2, ans3)\r\n", "entrada = str(input())\r\nn = int(entrada.split(\" \")[0])\r\nm = int(entrada.split(\" \")[1])\r\nk = int(entrada.split(\" \")[2])\r\nlane = n\r\nd = m\r\nfor i in range(1,n+1):\r\n\tif k <= (i * 2* m):\r\n\t\tlane = i\r\n\t\tbreak\r\nfor i in range(1, m+1):\r\n\tif lane != 1:\r\n\t\tif k <= (i*2 + (lane-1)*m*2):\r\n\t\t\td = i\r\n\t\t\tbreak\r\n\r\n\telse:\r\n\t\tif k <= (i*lane*2 ):\r\n\t\t\td = i\r\n\t\t\tbreak\r\nif k%2 ==0:\r\n\tprint (lane, d, 'R')\r\n\r\n\t\r\nelse:\r\n\tprint (lane, d, 'L')\r\n", "n, m, k = map(int, input().split())\r\n\r\nlane = (k - 1) // (2 * m) + 1\r\ndesk = (k - 1) % (2 * m) // 2 + 1\r\nside = 'L' if k % 2 > 0 else 'R'\r\n\r\nprint(lane, desk, side)", "def solve(n, m, k):\r\n return \"%d %d %c\" % ((k - 1) // (2 * m) + 1, (k - 1) // 2 % m + 1, 'L' if k % 2 == 1 else 'R')\r\n\r\nif __name__ == \"__main__\":\r\n n, m, k = map(int, input().split())\r\n print(solve(n, m, k))", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[-1])\r\nr = (k + 2 * m - 1) // (2 * m)\r\nd = k - (r - 1) * (2 * m)\r\nd = (d + 1) // 2\r\nprint(r, d, end = \" \")\r\nif k % 2:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn,m,k = map(int,input().split())\r\nr = (k-1) // (m*2)\r\nd = (k+1 - r * 2 * m) // 2\r\nans = (k+1 - r * 2 * m) % 2\r\nprint(r+1,d, \"R\" * ans + \"L\" * (1-ans))\r\n", "#!/bin/python3\n\nn,m,k = [int(x) for x in input().split()]\n\ns = \"L\"\n\nif k % 2 == 0:\n s = \"R\"\n\nlaneSize = 2*m\nr = 1\n\nwhile k > (r*laneSize):\n r += 1\n\nlaneFirstValue = ( (r-1)*laneSize ) + 1\ndiff = k - laneFirstValue\nd = (diff // 2) + 1\n\nprint(r, d, s) \n", "n, m, k = [int(f) for f in input().split(' ') if f]\r\n\r\nr = k / (2 * m)\r\n\r\nif r % 1:\r\n r = int(r // 1 + 1)\r\n\r\nd = (k - 2 * (r - 1) * m) / 2\r\n\r\nif d % 1:\r\n d = int(d // 1 + 1)\r\n\r\nprint(int(r), int(d), sep=' ', end=' ')\r\nif not k % 2:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n, m, k = map(int, input().split())\r\nnum = int(k / 2 + .5)\r\nlane = 1\r\ndesk = 1\r\nwhile num > m:\r\n num -= m\r\n lane += 1\r\ndesk = num\r\npos = \"L\"\r\nif k % 2 == 0:\r\n pos = \"R\"\r\nprint(str(lane) + \" \" + str(desk) + \" \" + pos)\r\n", "n,m,k=(int(z) for z in input().split())\r\nrow=1\r\nwhile k>2*m:\r\n k-=2*m\r\n row+=1\r\ndesk=1\r\nwhile k>2:\r\n k-=2\r\n desk+=1\r\nif k-1:\r\n print(row,desk,\"R\")\r\nelse:\r\n print(row,desk,\"L\")", "from math import ceil\r\nn, m , k = list(map(int, input().split()))\r\nq = ceil(k/2)\r\nif k%(2*m) == 0:\r\n w = k//(2*m)\r\nelse:\r\n w = k//(2*m)+1\r\nchet = 1\r\nchislo = (w-1)*(m*2)+1\r\nwhile chislo!= k:\r\n if chislo%2 == 0:\r\n chet+=1\r\n chislo+=1\r\nif k%2==0:\r\n print(str(w) + ' ' + str(chet) + ' R')\r\nelse:\r\n print(str(w) + ' ' + str(chet) + ' L')\r\n", "from math import ceil\r\nn, m, k = map(int,input().split())\r\nr = ceil(k/(m*2))\r\nd = m-(r*m*2-k)//2\r\nprint(r,d,['R','L'][k%2])", "n, m, k = tuple(map(int, input().split()))\r\nx, y = 0, 0\r\nx = k//(2*m)\r\nif x != k/(2*m):\r\n x += 1\r\nif k % 2 == 0:\r\n p = \"R\"\r\n y = 2*(x-1)*m+2\r\n y = (k-y)//2 + 1\r\nelse:\r\n p = \"L\"\r\n y = 2 * (x - 1) * m + 1\r\n y = (k - y) // 2 + 1\r\nprint(x, y, p)\r\n", "import math\n#input = map(int, input().split())\ninput = input().split()\nfor i in range(len(input)):\n input[i] = int(input[i])\n\nif(input[0] is 0 and input[1] is 0):\n print(\"0 0 R\")\nelse:\n totaldesks = input[0] * input[1] * 2\n sets = input[1] * 2\n\n # get desk based on mod namely input[2] % sets\n\n destination = input[2]\n side = \"R\"\n if(destination % 2 is not 0):\n side = \"L\"\n destination += 1\n\n desk = int(destination % sets / 2)\n if(desk is 0):\n desk = input[1]\n lane = math.ceil(input[2] / 2 / input[1])\n\n print(str(lane) + \" \" + str(desk) + \" \" + side)", "from math import ceil\r\nn,m,k=[int(i) for i in input().split()]\r\na=k%(2*m)\r\nif a==0:\r\n a=2*m\r\n\r\nprint(ceil(k/(2*m)),(a+1)//2,'RL'[k%2])\r\n", "n, m, k = map(int, input().split())\nt1 = 2 * m\nps1 = (k - 1) // t1 + 1\nps2 = (k % t1)\nif ps2 == 0:\n ps2 = 2 * m\nprint(ps1, (ps2 + ps2 % 2) // 2, (\"L\" if ps2 % 2 == 1 else \"R\"))", "# Author: Maharshi Gor\r\n\r\nimport sys\r\nsys.setrecursionlimit(5000000)\r\n\r\ndef read(type=int):\r\n return type(input())\r\n\r\n\r\ndef read_arr(type=int):\r\n return [type(token) for token in input().split()]\r\n\r\nn,m,k = read_arr()\r\nk -= 1\r\n\r\nl = k // (2*m)\r\nd = (k // 2) % m\r\nside = 'L' if k % 2 == 0 else 'R'\r\nprint(l+1,d+1,side)", "n, m, k = map(int, input().split()) #4, 3\r\n# # # #\r\n# # # #\r\n# # # #\r\n\r\npos = \"\"\r\nif k % 2 == 0:\r\n pos = \"R\"\r\nelse:\r\n pos = \"L\"\r\nrad = (k - 1) // (2 * m) + 1\r\nparta = ((k - (rad - 1) * 2 * m) + 1) // 2\r\nprint(rad, parta, pos)", "import math\r\ns = input()\r\n#list = s.split()\r\nn = int(s.split()[0])\r\nm = int(s.split()[1])\r\nk = int( s.split()[2])\r\ni = math.ceil(k/(2*m))\r\nk-= (i-1)*2*m\r\nj = math.ceil(k/(2))\r\nif(k%2 ==1):\r\n print(\"%d %d L\"%(i,j))\r\nelse:\r\n print(\"%d %d R\" % (i, j))", "import math\r\n_input = input().split()\r\nlanes = int(_input[0])\r\ndesks = int(_input[1])\r\nk = int(_input[2])\r\ndd = desks * 2\r\ncol = math.ceil(k / dd)\r\nz = k - ((col-1)*dd)\r\nrow = math.ceil(z/2)\r\nif(k & 1):print(str(col)+\" \" + str(row)+ \" L\")\r\nelse :print(str(col)+\" \" + str(row)+ \" R\")", "n,m,k=list(map(int, input().split()))\r\nif(k//(m*2)!=k/(m*2)):\r\n r=k//(m*2)+1\r\nelse:\r\n r=k//(m*2)\r\np=(k%(m*2))\r\nplace=p%2\r\n\r\nif(p//2!=p/2):\r\n p=p//2+1\r\n\r\nelse:\r\n p=p//2\r\nif(p==0):\r\n p=m\r\nif(place):\r\n\r\n place='L'\r\n\r\nelse:\r\n place='R'\r\nprint(r,p, place)", "from math import ceil\r\nn, m, k = map(int, input().split())\r\nn2 = ceil(k / (m * 2))\r\nm2 = m - (n2 * m * 2 - (k + k % 2)) // 2\r\nd = \"R\" if k % 2 == 0 else \"L\"\r\nprint(n2, m2, d)\r\n", "n, m, k = map(int, input().split())\r\nif k % (m*2) == 0:\r\n row = k // (m*2)\r\nelse:\r\n row = k // (m*2) + 1\r\ndesk = k - ((row - 1) * m*2)\r\nif desk % 2 == 0:\r\n desk //= 2\r\nelse:\r\n desk = desk // 2 + 1\r\nif k % 2 == 0:\r\n place = 'R'\r\nelse:\r\n place = 'L'\r\nprint(row, desk, place)", "import math\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 1:\r\n pos = \"L\"\r\nelse:\r\n pos = \"R\"\r\nr = math.ceil(k / (2 * m))\r\nk -= (r - 1) * 2 * m\r\nf = math.ceil(k / 2)\r\nprint(r, f, pos)\r\n", "from math import ceil\r\nn,m,k = [int(item) for item in input().split()]\r\n\r\nline = ceil(k / (2 * m))\r\ndesk = ceil((k - (line - 1) * 2 * m) / 2)\r\nif k % 2 == 0:\r\n side = \"R\"\r\nelse:\r\n side = \"L\"\r\n\r\nprint(line,desk,side)", "import math\r\n[n, m, k] = map(int, input().split())\r\nx = k%(2*m)\r\nif x == 0:\r\n print(int(k/(2*m)), m, 'R')\r\nelse:\r\n row = int(math.ceil(x/2))\r\n if x%2 == 0:\r\n place = str('R')\r\n else:\r\n place = str('L')\r\n print(int(k/(2*m) + 1), row, place)", "n, m, k = map(int, input().split())\r\nprint((k - 1) // (2*m) + 1, end=\" \")\r\nprint((k - 1) % (2*m) // 2 + 1, end=\" \")\r\nif k % 2 == 1:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "a,b,c=map(int,input().split());from math import ceil as z;k=z(c/(b*2));print(k,z((c-((k-1)*(2*b)))/2),[\"R\",\"L\"][c%2])", "n, m, k = list(map(int, input().split()))\n\nk -= 1\nr = k // (2 * m)\nc = (k % (2 * m)) // 2\nprint(r + 1, c + 1, end=' ')\nif k % 2 == 0:\n\tprint('L')\nelse:\n\tprint('R')\n\n", "from math import ceil \n\n\ndef solve(n, m, k):\n t = ceil(k / 2) \n x = m if t % m == 0 else t % m\n y = ceil(t / m)\n p = 'L' if k % 2 == 1 else 'R'\n return f'{y} {x} {p}'\n\n\ndef main():\n n, m, k = list(map(int, input().split()))\n print(solve(n, m, k))\n\n\nmain()\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/748/A\r\n\r\nn, m , k = map(int, input().split())\r\n\r\nk -= 1\r\np = k // 2\r\np = p // m\r\n\r\nprint(\"%d %d %s\" % (p + 1, k // 2 - p * m + 1, \"R\" if k % 2 == 1 else \"L\"))", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn, m, k = IL()\r\nprint((k-1)//(2*m)+1, (k-1)%(2*m)//2+1, \"L\" if k%2 else \"R\")", "n, m, k = map(lambda x: int(x), input().split())\r\nm1 = m * 2\r\nif k % m1 != 0:\r\n rowMain = k // m1 + 1\r\nelse:\r\n rowMain = k // m1\r\n\r\nk1 = k - (rowMain - 1) * m1\r\nif k1 % 2 == 0:\r\n tableMain = k1 // 2\r\nelse:\r\n tableMain = k1 // 2 + 1\r\n\r\nplace = 'L' if k % 2 == 1 else 'R'\r\nprint(rowMain, tableMain, place)\r\n", "# Yergali B\r\n# 389 div 2\r\nn,m,k=map(int,input().split())\r\nx = (k-1)//(m*2) + 1\r\ny = ((k%(m*2))+1)//2\r\nif y==0:\r\n y=m\r\nprint(x, y, end=' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "def kek(k):\r\n if k % 2:\r\n return 'L'\r\n else:\r\n return 'R'\r\nn, m, k = list(map(int, input().split()))\r\nnum_of_parta = (k - 1) // 2\r\nr = num_of_parta // m + 1\r\nd = num_of_parta % m + 1\r\ns = kek(k)\r\nprint(r, d, s)\r\n", "s = input()\r\nn,m,k = s.split()\r\nm = int(m)\r\nn = int(n)\r\nk = int (k)\r\n\r\nr = (((k+1)//2) // m) + 1\r\n\r\nd = ((k+1)//2) % m\r\nif (d==0):\r\n d=m\r\n r = r-1\r\nif (k%2 == 0):\r\n s = \"R\"\r\nelse:\r\n s = \"L\"\r\nprint (r,d,s)\r\n\r\n", "n, m, k = map(int, input().split())\r\nlan = 1\r\nchar = 'L'\r\nif k%2==0:\r\n char='R'\r\nwhile k>2*m:\r\n k-=2*m\r\n lan+=1\r\n\r\nprint(str(lan)+\" \"+ str((k+1)//2)+ \" \"+char)", "n,m,k=map(int,input().split())\r\nx=(k-1)//2\r\nr=x//m+1\r\nd=x%m+1\r\nif k%2==0: \r\n\ts='R' \r\nelse:\r\n\ts='L'\r\nprint(r,d,s)", "n, m, k = map(int, input().split())\n\ndef ceil(a, b):\n\treturn (a + (b - 1)) // b\n\n# ceil(a / b) = (a + (b - 1)) // b\nr = ceil(k, (2*m))\nd = ceil((k-2*m*(r-1)), 2)\ns = \"R\" if k%2==0 else \"L\" # side\n\nprint(r, d, s)", "a=str()\r\nj=int()\r\nk=int()\r\nn=int()\r\nRL=str()\r\nc=[]\r\na= input().split(' ')\r\nfor j in range (3) :\r\n c.append (a[j])\r\nk=(int(a[2])%2+ int(a[2]))//2\r\nj=(k-1)//int(a[1])+1\r\nn=k-(j-1)*(int(a[1]))\r\nif int(a[2])%2==1:\r\n RL='L'\r\nelse:\r\n RL='R'\r\nprint(j,n,RL, end = '')", "n,m,k = map(int, input().split())\r\nl = (k - 1)//(2 * m) \r\nprint(l + 1, end = ' ')\r\nprint((k - 2 * l * m - 1) // (2) + 1, end = ' ')\r\nif k % 2 == 1:\r\n print('L')\r\nelse:\r\n print('R')", "n,m,k=list(map(int,input().split()))\r\nif k%2==0:\r\n\ts=\"R\"\r\nelse:\r\n\ts=\"L\"\r\nt=(k-1)//2\t\r\n# a=ceil(k/(2*n))\r\n# b=ceil((k)/(2*m))\r\na=(t//m)+1\r\nb=t%m+1\r\nprint(a,b,s)", "n,m,k=map(int,input().split())\r\nx = (k-1) // 2\r\nr = x // m+1\r\nd = x%m + 1\r\nif k%2==0: \r\n\ts='R' \r\nelse:\r\n\ts='L'\r\nprint(r,d,s)", "from math import*\r\nm,n,o=map(int, input().split())\r\n#n=int(input())\r\n#l=list(map(int, input().split()))\r\n#s=input()\r\n\r\nlane=ceil(o/(2*n))\r\nfirst=(lane-1)*n*2+1\r\nrow=1+(o-first)//2\r\nprint(lane,row,'L'if o%2==1 else 'R')", "\r\nn, m, k = map(int, input().split())\r\nif k % 2 == 0:\r\n\tside = 'R'\r\nelse:\r\n\tside = 'L'\r\np = 0\r\n\r\nif k % (m * 2) == 0:\r\n\tlane = k // (m * 2)\r\nelse:\r\n\tlane = k // (m * 2) + 1\r\n\r\nwhile k > m * 2:\r\n\tk -= m * 2\r\n\r\ndesk = (k + 1) // 2\r\n\r\nprint(lane, desk, side)", "n,m,k=[int(i) for i in input().split()]\r\nif k%2==0:\r\n z='R'\r\nelse:\r\n z='L'\r\nm1=(k-1)//(2*m)+1\r\nn1=((k-1)%(2*m))//2+1\r\nprint(m1,n1,z)\r\n", "n,m,s=map(int,input().split())\r\n\r\nif s%2==1:\r\n ch='L'\r\nelse:\r\n ch='R'\r\n\r\np=s\r\nd=1\r\nwhile p>m*2 :\r\n p=p-(m*2)\r\n d=d+1\r\na=(p//2)+(p%2)\r\nprint(d,a,ch) \r\n", "n, m, k = map(int, input().split())\r\nprint((k - 1) // (2 * m) + 1, ((k - 1) % (2 * m)) // 2 + 1, 'RL'[k % 2])\r\n", "a,b,c=map(int, input().split())\r\nl=[0,0,\"L\"]\r\nif c%2 == 0:\r\n l[2]=\"R\"\r\n c=int(c/2)\r\nelse:\r\n c=int(c/2)+1\r\nk=int((c-1)/b)\r\nl[0]=str(k+1)\r\nc=c-k*b\r\nl[1]=str(c)\r\nprint(\" \".join(l))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\na,b=map(int, input().split())\r\nif b>(a*(a+1))/2:\r\n print(\"0\")\r\nelse:\r\n for i in range\r\n\r\n\"\"\"\r\n \r\n\r\n", "import math\r\n\r\nn,m,k=[int(i) for i in input().split()]\r\nl=d=0\r\nc=\"X\"\r\nif k%(2*m)==0:\r\n l=int(k/(2*m))\r\n d=m\r\n c=\"R\"\r\nelse :\r\n l=math.floor(k/(2*m))+1\r\n k=k-((l-1)*m*2)\r\n if k%2==0:\r\n d=int(k/2)\r\n c=\"R\"\r\n else :\r\n d=math.floor(k/2)+1\r\n c=\"L\"\r\nprint(l,d,c)", "_ = input()\r\n\r\n_ = list(map(int, _.split()))\r\n\r\nl = _[0]\r\nd = _[1]\r\ns = _[2]\r\n\r\nlp = ((s-1)//(d*2)) + 1\r\n\r\nif s % (d*2) == 0:\r\n dp = ((d*2)-1)//2 + 1\r\nelse:\r\n dp = ((s % (d*2))-1)//2 + 1\r\n\r\nif s%2 == 0:\r\n lor = 'R'\r\nelse:\r\n lor = 'L'\r\n \r\nprint (lp, ' ', dp, ' ', lor, end='\\n')\r\n", "\r\nn, m, k = map(int, input().split())\r\np = (k - 1) // 2\r\nx = (p // m) + 1\r\ny = (p % m) + 1\r\nif k % 2 == 0:\r\n z = \"R\"\r\nelse:\r\n z = \"L\"\r\nprint(x, y, z)", "\"\"\"\r\n\tAuthor\t\t: Arif Ahmad\r\n\tDate \t\t: \r\n\tAlgo \t\t: \r\n\tDifficulty\t: \r\n\"\"\"\r\n\r\ndef main():\r\n\tr, c, k = [int(_) for _ in input().split()]\r\n\r\n\tlane = ((k - 1) // (c * 2)) + 1\r\n\tk -= (lane - 1) * (c * 2)\r\n\tdesk = (k + 1) // 2\r\n\tif k%2 == 1: pos = 'L'\r\n\telse: pos = 'R'\r\n\r\n\tprint(lane, desk, pos)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n", "n,m,k=map(int,input().split())\r\nprint((k-1)//(m*2)+1,(k-1)%(2*m)//2+1,'R' if k%2==0 else 'L')\r\n", "n, m, k = map(int, input().split())\r\n\r\npl = ''\r\nif k % 2 == 0:\r\n pl = 'R'\r\nelse:\r\n pl = 'L'\r\n\r\nk = k // 2 + k % 2\r\npart = k % m\r\nrad = k // m + 1\r\nif k % m == 0:\r\n rad -= 1\r\nif part == 0:\r\n part = m\r\n\r\nprint(rad, part, pl)", "n, m, k = list(map(int, input().split()))\r\nprint((k - 1) // (2 * m) + 1, end=\" \")\r\nprint((k - 1) % (2 * m) // 2 + 1, end=\" \")\r\nif ((k - 1) % (2 * m) % 2 == 0):\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "s=(input()).split(' ')\r\nn=int(s[0])\r\nm=int(s[1])\r\nk=int(s[2])\r\nif k%2 == 0:\r\n k=k/2\r\n if k%m==0:\r\n p=m\r\n else:\r\n p=int(k-k//m*m)\r\n if k%m==0:\r\n r=int(k//m)\r\n else:\r\n r=int(k//m+1)\r\n print(r,p,'R')\r\nelse:\r\n k=(k+1)/2\r\n if k%m==0:\r\n p=m\r\n else:\r\n p=int(k-k//m*m)\r\n if k%m==0:\r\n r=int(k//m)\r\n else:\r\n r=int(k//m+1)\r\n print(r,p,'L')\r\n", "from math import ceil\r\nn,m,k = (int(i) for i in input().split())\r\nryad = ceil(k/(2*m))\r\nparta = ((k%(2*m))+1)//(2)\r\nif k%2:\r\n left = \"L\"\r\nelse:\r\n left = \"R\"\r\nif parta == 0:\r\n parta = m\r\nprint(ryad, parta, left)", "n, m, k = map(int, input().split())\r\nr = (k + 2 * m -1)// (2 * m)\r\nz = (k % (m * 2))\r\nif z != 0:\r\n d = (k % (m * 2) + 1) // 2\r\n s = (k % (m * 2) + 1) % 2\r\nelse:\r\n d = m\r\n s = 'R'\r\nif s == 0:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)", "def increment(t, mod):\r\n if t % mod == 0:\r\n return mod\r\n else:\r\n return t % mod\r\n\r\nn, m, k = map(int, input().split())\r\nkk = k % 2\r\nk = (k + 1) // 2\r\nprint((k + m - 1) // m , increment(k, m), kk * 'L' + (1- kk) * 'R')", "n , m , k = map(int, input().split())\r\nans =[]\r\n\r\nnumber = 2*n*m\r\n\r\ncol = number//n\r\nc = k//col\r\nif k%col!=0:\r\n c=c+1\r\nans.append(c)\r\n\r\nrow = col//m\r\ncol_start = col * (c-1)\r\ncol_end = col*c\r\nr = 0\r\nans_row=1\r\nfor i in range(col_start+1, col_end+1):\r\n if i==k:\r\n ans.append(ans_row)\r\n r = r+1\r\n if r==row:\r\n ans_row = ans_row+1\r\n r=0\r\n\r\nif k%2==0:\r\n ans.append('R')\r\nelse:\r\n ans.append('L')\r\nprint(*ans)", "m,n,k=[int(i) for i in input().split()]\r\n\r\nx,y=(k-1)//(2*n)+1, (k-1)%(2*n)\r\nprint (x, 1+y//2, 'R' if y%2 else 'L')", "n, m, k = map(int, input().split())\n\nrow = (k-1)//(2*m)+1\n\npl = ((k-1)%(2*m))//2+1\n\nprint(f\"{row} {pl} {'L' if k%2 else 'R'}\")", "a,b,c = map(int,input().split())\r\nz = c//(b*2)\r\nx = c%(b*2)\r\nif x ==0:\r\n\tprint(z,b,\"R\")\r\nelse:\r\n\tif x%2==0:\r\n\t\tprint(z+1,x//2,\"R\")\r\n\telse:\r\n\t\tprint(z+1,(x//2)+1 ,\"L\")\r\n", "from math import ceil\r\nl,m,k=map(int,input().split())\r\ni=1\r\nwhile 2*m*i<k:\r\n\ti+=1\r\nlx=list(range(2*m*(i-1)+1,2*m*(i)+1))\r\nj=lx.index(k)+1\r\n# print(lx,j)\r\nif j%2==0:\r\n\tprint(i,j//2,\"R\")\r\nelse:\r\n\tprint(i,ceil(j/2),\"L\")", "n, m, k = [int(c) for c in input().split()]\r\nsas = (k + 1) // 2\r\nif k % 2 == 0:\r\n var = 'R'\r\nelse:\r\n var = 'L'\r\nparta = sas % m\r\nif parta == 0:\r\n parta = m\r\nprint((sas - 1) // m + 1, parta, var)", "n, m, k = list(map(int, input().split()))\nk2 = ((k - 1) // 2 + 1)\nans2 =k2 % m\nif ans2 == 0:\n ans2 = m\nprint((k2 - 1) // m + 1, ans2, end=\" \")\nif k % 2 == 1:\n print(\"L\")\nelse:\n print(\"R\")\n", "from math import ceil\r\nrows, columns, place = map(int, input().split())\r\nprint(ceil(place/(columns*2)), ceil(((place%(columns*2)) if place%(columns*2) != 0 else 2*columns)/2), 'L' if place%2 else 'R')", "n, m, k = map(int, input().split())\r\n\r\nrow = (k - 1) // (2*m) + 1\r\nk = (k - 1) % (2*m) + 1\r\n\r\ndesk = (k - 1) // 2 + 1\r\nside = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nprint(row, desk, side)", "import math\r\ndetail = [int(n) for n in input().split()]\r\n\r\nfound = False\r\nlane_size = 2*detail[1]\r\nlocation = list()\r\n#find lanes\r\n\r\nlocation.append(str(int(math.ceil(float(detail[2]/lane_size)))))\r\nlocation.append(str(int(math.ceil(float(detail[2]-(int(location[0])-1)*lane_size)/2))))\r\nif(int(detail[2])%2==1):\r\n location.append('L')\r\nelse:\r\n location.append('R')\r\n\r\nprint(' '.join(x for x in location))\r\n", "import math\r\nn,m,k=map(int,input().split())\r\ns=n*2*m\r\nl=math.ceil((k/(2*m)))\r\nc=k-(l-1)*2*m\r\nr=math.ceil(c/(2))\r\nif k%2==0:\r\n print(l,r,\"R\")\r\nelse:\r\n print(l,r,\"L\")\r\n\r\n\r\n", "import math\r\nstring = input()\r\na, b, n = map(int, string.split())\r\nr = math.ceil(n / (b * 2))\r\ns = n - b * 2 * (r - 1)\r\nc = math.ceil(s / 2)\r\nif s % 2 == 0:\r\n p = \"R\"\r\nelse:\r\n p = \"L\"\r\nprint(\"%d %d %s\" % (r, c, p))", "n, m, k = map(int, input().split())\r\nx = k // (m * 2) + (k % (m*2)+m*2-1)//(m*2)\r\nprint(x, (k - (x-1) * m * 2) // 2 + ((k-(x-1) * m * 2) % 2+1)//2, '', end='')\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')\r\n\r\n", "rows, cols, place = map(int, input().split())\n\nplace -= 1\nparta = place // 2\nrow, col = parta // cols, parta % cols\n\nprint(row+1, col+1, 'LR'[place % 2])\n", "n,m,p=[int(x) for x in input().split()]\r\n\r\n\r\n\r\nif p%2==0:\r\n place='R'\r\nelse:\r\n place='L'\r\nif p%(2*m)>0:\r\n row=1+p//(2*m)\r\nelse:\r\n row=p//(2*m)\r\nif p%(2*m)>0:\r\n if (p%(2*m))%2==0:\r\n parta=(p%(2*m))//2\r\n else:\r\n parta=1+(p%(2*m))//2\r\nelse:\r\n parta=m\r\n\r\nprint(str(row)+' ' + str(parta)+ ' '+place)", "n, m, santa = map(int, input().split())\r\nd=santa//2+santa%2\r\nif d%m==0:\r\n l=m\r\nelse:\r\n l=d%m\r\nprint(d//m+(d%m!=0), l, [\"L\", \"R\"][santa%2==0])\r\n", "read = lambda: map(int, input().split())\r\nn, m, k = read()\r\np = (k - 1) // 2\r\nr = p // m + 1\r\nc = p % m + 1\r\nt = 'L' if k % 2 else 'R'\r\nprint(r , c, t)\r\n", "z=input('')\r\nz=z.split()\r\nq=int(z[0])\r\nw=int(z[1])\r\ne=int(z[2])\r\nm=''\r\nif e%2!=0:\r\n m='L' \r\nelif e%2==0:\r\n m='R'\r\na=0\r\ns=0\r\nd=0\r\nfor r in range (q):\r\n if d!=e:\r\n s=0\r\n a=a+1\r\n for vb in range(w):\r\n if d!=e:\r\n s=s+1\r\n d=d+1\r\n if d!=e:\r\n d=d+1\r\nprint(a,s,m)\r\n\r\n", "n,m,k=[int(t) for t in input().split(\" \")]\r\nr=k//(2*m)\r\nif k%(2*m)!=0:\r\n r+=1\r\np=k-2*m*(r-1)\r\nd=p//2\r\nif p%2!=0:\r\n d+=1\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)", "s=input()\r\nnums=s.split(\" \")\r\nr=int(nums[0])\r\np=int(nums[1])\r\nmesto=int(nums[2])\r\n\r\npm = (mesto+1)//2 \r\nrs=(pm-1) // p + 1\r\nps=(pm) % p\r\nif ps==0:\r\n ps=p\r\n\r\nif mesto%2==0:\r\n side='R'\r\nelse:\r\n side='L'\r\n \r\nprint(rs, ps, side)", "n, m, k = map(int, input().split())\r\nA = [\"L\", \"R\"]\r\nres1 = (k + 2 * m - 1) // (2 * m)\r\nres2 = (k - 2 * m * (res1 - 1) + 1) // 2\r\nres3 = (k - 2 * m * res1 + 1 - res2 * 2) % 2\r\nprint(res1, res2, A[res3])", "n,m,k = map(int,input().split(' '))\nif k % 2 == 0:\n position = 'R'\nelse:\n position = 'L'\n\np = (k-1) // 2\ni,j = (p // m) +1, p % m +1\n\nprint(i,j,position)\n", "import math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nr, d, s = 0, 0, \"\"\r\n\r\nif k % 2:\r\n s = \"L\"\r\nelse:\r\n s = \"R\"\r\n\r\nr = k / (m*2)\r\nr = math.ceil(r)\r\n\r\nr_start = 2 * m * (r-1) + 1\r\nr_end = r_start + (2 * m) - 1\r\n\r\ni = r_start\r\nwhile i <= k:\r\n d += 1\r\n i += 1\r\n\r\nprint(r, math.ceil(d/2), s)\r\n", "n, m, k = map(int, input().split())\na = -(-k // (2 * m))\nb = -(-(k - (a - 1) * (2 * m)) // 2) \nc = \"RL\"[k % 2]\nprint(\"{} {} {}\".format(a, b, c))", "n, m, k = map(int, input().split())\r\nrad = (k - 1) // (2 * m) + 1\r\nparta = ((k - 1) % (2 * m)) // 2 + 1\r\nif (k % 2) == 0:\r\n print(rad, parta, \"R\")\r\nelse:\r\n print(rad, parta, \"L\")\r\n", "a,b,c=map(int,input().split())\r\nk=c//(2*b)+1\r\nif c%(2*b)==0:\r\n k-=1\r\nh='R'\r\nif c%2==1:\r\n h='L'\r\nj=(c%(2*b))\r\nif j==0:\r\n r=b\r\nelse:\r\n r=j//2+j%2\r\nprint(k,r,h)", "\r\ndef main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n lane = 0\r\n while k >2 * m * lane:\r\n lane += 1\r\n if not k % 2:\r\n b = k - 1\r\n else:\r\n b = k\r\n desk = ((b % (2 * m)) + 1) // 2\r\n if not k % 2:\r\n s = \"R\"\r\n else:\r\n s = \"L\"\r\n return f\"{lane} {desk} {s}\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nLane = ceil(X[2] / (X[1] * 2))\r\nDesk = ceil((X[2] - (Lane - 1) * X[1] * 2) / 2)\r\nprint(str(Lane), str(Desk), end=' ')\r\nprint('L' if X[2] % 2 != 0 else 'R')\r\n", "import sys\r\n\r\n#n, m, k = [int(i) for i in sys.stdin.read().splitlines()[0].split()]\r\nn, m, k = [int(i) for i in input().splitlines()[0].split()]\r\n\r\nlane = (k - 1) // (2 * m) + 1\r\ndesk = (k - 1) % (2 * m) // 2 + 1\r\nposition = 'R' if k % 2 == 0 else 'L'\r\n\r\nprint(lane, desk, position)\r\n", "N, M, K = map(int, input().split())\r\nrow_size = 2 * M\r\nK -= 1\r\nrow = K // row_size\r\nK %= row_size\r\nside = 'L' if K % 2 == 0 else 'R'\r\nd = K // 2\r\n\r\nprint(row + 1, d + 1, side)\r\n", "def rorl(x):\r\n if x % 2 == 0:\r\n return \"R\"\r\n else:\r\n return \"L\"\r\nimport math\r\nrow,column,target = map(int,input().split(\" \"))\r\nprint(str(math.ceil(target / (2*column))) + \" \" + str(((target-1) % (column*2) )//2 + 1) + \" \" + rorl(target))\r\n", "n, m, k = map(int, input().split(' '))\r\nif k % 2 == 1:\r\n lr = 'L'\r\n k += 1\r\nelse:\r\n lr = 'R'\r\nr = int((k/2 - 1) % m + 1)\r\nc = int((k/2 - 1) // m + 1)\r\nprint(c, r, lr)", "n, m, k = map(int, input().split())\r\nif k % (2*m) == 0:\r\n a = k // (2*m)\r\nelse:\r\n a = k // (2*m) + 1\r\n\r\nb = (a-1)*(2*m)\r\nif k % 2 == 0:\r\n b += 2\r\nelse:\r\n b += 1\r\n\r\nprint(a, (k - b) // 2 + 1, \"R\" if k % 2 == 0 else \"L\")", "import math\nn,m,k = input().split()\nn = int(n)\nm = int(m)\nk = int(k)\nl = math.ceil(k/2)\nif l%m == 0:\n b = m\nelse:\n b = l%m\nif k%2 == 0:\n a = \"R\"\nelse:\n a = \"L\"\nprint(math.ceil(l/m),b,a)\n\n \t\t \t\t \t\t\t\t \t\t\t \t \t\t\t \t\t\t", "from math import ceil\r\nn, m, k=map(int, input().split())\r\n\r\nif k%2:\r\n\tpos=\"L\"\r\n\td=(k//2)+1 #As they are pairs, position in column\r\nelse:\r\n\tpos=\"R\"\r\n\td=k//2\r\np=m*2 \r\n\r\n# For reference:\r\n# 1.[1,2] [9,10] [17,18] [25,26]\r\n# 2.[3,4] [11,12] [19,20] [27,28]\r\n# 3.[5,6] [13,14] [21,22] [29,30]\r\n# 4.[7,8] [15,16] [23,24] [31,32]\r\n\r\n\r\n# 1.[1,2] [9,10] [17,18] \r\n# 2.[3,4] [11,12] [19,20] \r\n# 3.[5,6] [13,14] [21,22] \r\n# 4.[7,8] [15,16] [23,24] \r\n\r\ncol=d%m #Finding Column\r\nif col==0:\r\n\tcol=m\t\r\nrow=ceil(k/p) #Row\r\nif row==0:\r\n\trow=n\r\nprint(row, col , pos)", "n, m, k = map(int, input().split(\" \"))\r\np = k // 2 - 1 if k % 2 == 0 else k // 2\r\nprint(str((p // m) + 1) + \" \" + str((p % m) + 1) + \" \" + (\"R\" if k % 2 == 0 else \"L\"))\r\n", "n, m, k = map(int, input().split())\r\nrow = (k + m * 2 - 1) // (m * 2)\r\ntable = (k - ((m * 2) * (row - 1) + 1)) // 2 + 1\r\nplace = ''\r\nif k % 2 == 0:\r\n place = 'R'\r\nelse:\r\n place = 'L'\r\nprint(row, table, place)", "n, m, k = map(int, input().split())\nprint((k - 1) // (2 * m) + 1, ((k - 1) % (2 * m) + 2) // 2, \"R\" if ((k - 1) % (2 * m) + 1) % 2 == 0 else \"L\")", "n, m, k = [int(i) for i in input().split()]\n\no = [None, None, None]\n\no[2] = \"L\" if k % 2 else \"R\"\n\nk += -(1 - (k % 2)) - 1\n\nk //= 2\n\no[0] = k // m + 1\n\no[1] = k % m + 1\n\nprint(' '.join([str(i) for i in o]))\n", "n,m,k = map(int,input().split())\n\n\ndef getRyad(n,m,k):\n r = 1\n mest_v_radu = m * 2\n while n != 0: \n if mest_v_radu < k:\n r += 1\n mest_v_radu = mest_v_radu + m * 2\n n -= 1\n else:\n return r\n\n\ndef getParta(r,m,k):\n parta = r*m*2\n while m != 0:\n if (parta == k) or (parta-1 == k):\n return m\n else:\n m -= 1\n parta -= 2\n \n\ndef getStorona(k):\n if k % 2 == 0:\n return 'R'\n else:\n return 'L'\n\n\nr = getRyad(n,m,k)\nd = getParta(r,m,k)\ns = getStorona(k)\n\nprint(r,d,s)\n\n", "import math\r\nn, m, k = map(int, input().split())\r\nr = math.ceil(k/(2*m))\r\nd = math.ceil(abs(k-(r-1)*2*m)/2)\r\nprint(r, d, 'L' if k % 2 != 0 else 'R')", "# print(\"Input n, m, and k\")\nc,r,k = [int(x) for x in input().split()]\n\nzerobasek = k - 1\nsinglenum = zerobasek // 2\n\nzerobasec = singlenum // r\nzerobaser = singlenum % r\n\nprint(zerobasec + 1, end = ' ')\nprint(zerobaser + 1, end = ' ')\nif k%2 == 0:\n print(\"R\")\nelse:\n print(\"L\")\n", "n, m, k = map(int,input().split())\r\nt = (k + 1) // 2 #12\r\nd = ((t-1) // m)+ 1\r\nr = t % m\r\nif r == 0:\r\n r = m\r\n\r\nif k % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(d,r,s)\r\n\r\n", "n,m,k = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\n# m = int(input()) \r\n# k = int(input())\r\nrealval = k\r\n\r\nif k%2 == 0:\r\n pass\r\nelse:\r\n k = k+1\r\n\r\nx = (k/2) % m\r\n\r\nif x==0:\r\n x = m\r\n\r\n\r\ny = (k-2) // (m*2) + 1 \r\ny= y%n \r\n\r\nif y == 0:\r\n y = n\r\n\r\n\r\nx = int(x)\r\ny = int(y)\r\n\r\nif realval%2 == 0:\r\n print(y,x,\"R\")\r\nelse:\r\n print(y,x,\"L\")\r\n\r\n\r\n \r\n\r\n \r\n\r\n ", "import math\r\n\r\nn, m, k = map(int, input().split())\r\nprint(math.ceil(math.ceil(k / 2) / m), end=' ')\r\n\r\nif math.ceil(k / 2) % m == 0:\r\n print(m, end=' ')\r\nelse:\r\n print(math.ceil(k / 2) % m, end=' ')\r\n\r\nif k % 2 == 0:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n,m,k = map(int,input().split())\r\na = []\r\np = 1\r\nfor i in range(m): a += [[p,p+1]]; p += 2\r\np -= 1\r\nx = -(-k//p)\r\nif k % 2 == 0: z = \"R\"\r\nelse: z = \"L\"\r\nif k % p == 0: y = m\r\nelse:\r\n for i in range(m):\r\n if k%p in a[i]: y = i+1; break\r\nprint(x,y,z)", "num_lanes, desks_per_lane, santa = map(int, input().split())\n\nleftright = 'L' if santa % 2 == 1 else 'R'\n\nlane = 1\npos = 0\nfound = False\nwhile not found:\n pos += desks_per_lane * 2\n if santa <= pos:\n found = True\n break\n lane += 1\n\ndesknumber = ((santa-1) % (desks_per_lane*2)) // 2 + 1\n\nprint(lane, desknumber, leftright)\n", "n, m, k = map(int, input().split())\r\nn_row = (k-1) // (2*m) + 1\r\nmod = (k-1) % (2*m)\r\nn_par = mod // 2 + 1\r\n\r\nprint(n_row, n_par, end=\" \")\r\nif k % 2 == 1:\r\n print(\"L\")\r\nelse:\r\n print(\"R\")\r\n", "n, m, k = map(int, input().split())\r\nr = k // (2 * m)\r\nif k % (2 * m) != 0:\r\n r += 1\r\ntmp = k - 2 * m * (r - 1)\r\nd = tmp // 2\r\nif tmp % 2 != 0:\r\n d += 1\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)\r\n", "from math import *\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\ntmp1 = ceil(k / (2 * m))\r\ntmp2 = k - (tmp1 - 1) * 2 * m\r\ntmp3 = ceil(tmp2 / 2)\r\nif k % 2 == 0:\r\n print(tmp1, tmp3, 'R')\r\nelse:\r\n print(tmp1, tmp3, 'L')", "n, m, k = map(int, input().split())\r\n\r\n# Determine the row and column of Santa Claus' place\r\nrow = (k - 1) // (2 * m) + 1\r\ncol = ((k - 1) // 2) % m + 1\r\n\r\n# Determine which side Santa Claus should sit on\r\nside = \"L\" if k % 2 == 1 else \"R\"\r\n\r\nprint(row, col, side)\r\n", "n, m, k = (int(i) for i in input().split())\nres = (k + 2 * m - 1) // (2 * m), ((k - 1) % (2 * m)) // 2 + 1, \"L\" if k & 1 == 1 else \"R\"\nprint(*res)\n", "[n, m, k] = [int(x) for x in input().split()]\r\nprint((((k+1)//2)+m-1)//m, ((k-1)//2)%m + 1, 'L' if k%2 == 1 else 'R')\r\n", "n,m,k=map(int,input().split())\r\na=[]\r\np=1\r\nfor i in range(m): \r\n a+=[[p,p+1]] \r\n p+=2\r\np-=1\r\nx=-(-k//p)\r\nif k%2==0: \r\n z=\"R\"\r\nelse: \r\n z=\"L\"\r\nif k%p==0: \r\n y=m\r\nelse:\r\n for i in range(m):\r\n if k%p in a[i]: \r\n y=i+1\r\n break\r\nprint(x,y,z)", "n,m,k=map(int,input().split())\r\np,c,r=0,0,0\r\nif k%2==0:\r\n p=k//2\r\nelse:\r\n p=(k//2)+1\r\nif p%m==0:\r\n c=p//m\r\nelse:\r\n c=(p//m)+1\r\nif p%m==0:\r\n r=m\r\nelse:\r\n r=p%m\r\nif k%2==0:\r\n print(c,r,\"R\")\r\nelse:\r\n print(c,r,\"L\")", "n,m,k = list(map(int,input().split()))\r\nprint((k+(m<<1)-1)//(m<<1), ((k-1)//2)%m+1, ['R','L'][k%2])\r\n", "n,m,k=list(map(int,input().split()))\r\n\r\nrow=k/(2*m)\r\nif row>k//(2*m):\r\n row=k//(2*m)+1\r\nelse:\r\n row=int(k/(2*m))\r\n\r\nplace=(k-((row-1)*2*m+1))\r\n\r\nif place%2==0:\r\n x='L'\r\nelse:\r\n x='R'\r\n\r\nprint(row,place//2+1,x)\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,k = map(int,input().split())\r\nk-=1\r\nlane = k//(m*2)\r\nintermediate = k - lane*(m*2)\r\ndesk = intermediate//2\r\nprint (lane+1,desk+1,['L','R'][intermediate%2])", "n,m,a = input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nl=1\r\nd=1\r\nwhile(a>2*m):\r\n a=a-2*m\r\n l=l+1\r\nwhile(a>2):\r\n a=a-2\r\n d=d+1\r\nif(a==1):\r\n c='L'\r\nelse:\r\n c='R'\r\nprint(l,d,c)\r\n\r\n", "n,m,k = map(int,input().split())\nlr = 'L'\nif k% 2 == 0:\n lr = 'R'\nk = (k+1)//2\nlane = (k+m-1)//m\ndesk = k%m\nif desk == 0:\n desk = m\nprint('{} {} {}'.format(lane,desk,lr))\n", "n,m,k=map(int, input().split())\r\nx=2*m\r\nif k%x==0:\r\n r=k//x\r\n ost=x\r\nelse:\r\n r=k//x+1\r\n ost=k%x\r\nif k%2==0:\r\n d=ost//2\r\n s='R'\r\nelse:\r\n d=ost//2+1\r\n s='L'\r\nprint(r,d,s,sep=' ')\r\n", "n, m, k = list(map(int, input().split()))\r\n\r\nryad = (k-1) // (m * 2) + 1\r\ntable = (k + 1 - (ryad - 1) * m * 2) // 2\r\n\r\nif k % 2 == 0:\r\n direct = 'R'\r\nelse:\r\n direct = 'L'\r\n\r\nprint(ryad, table, direct)", "import math\r\nn,m,k = map( int ,( input() .split() ) )\r\nlanenumber=math.ceil(k/(2*m))\r\ndesknumber=math.ceil((k-(lanenumber-1)*(2*m)) / 2)\r\nc=0\r\nif k%2==0:\r\n c='R'\r\nelse:\r\n c='L'\r\nprint(lanenumber,desknumber,c)\r\n\r\n", "n,m,k=list(map(int,input().split()))\r\n\r\n\r\n\r\nif k%2==0:\r\n p = k//2\r\n q=p%m\r\n s=p//m\r\n if q>0:\r\n print(s+1,q,'R')\r\n elif q==0:\r\n print(s,m,'R')\r\nelse:\r\n p = (k+1)//2\r\n q=p%m\r\n s=p//m\r\n if q>0:\r\n print(s+1,q,'L')\r\n elif q==0:\r\n print(s,m,'L')\r\n \r\n", "n,m,k = [int(i) for i in input().split(' ')]\nprint(((k-1)//2)//m + 1,(((k-1)//2)%m + 1),((k-1)%2*'R')+(k%2*'L'))", "n, m, k = map(int, input().split())\r\nx = (k-1) // (m * 2)+1\r\ny = (k-1) % (2 * m)\r\nprint(x, y//2+1, \"R\" if k % 2 == 0 else \"L\")\r\n", "n, m, k = map(int, input().split())\r\nk -= 1\r\nprint(1 + k // 2 // m, 1 + k % (2 * m) // 2, end = ' ')\r\nif k % 2:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "n,m,k = map(int,input().split())\r\n\r\ns = str(((k-1)//2)//m+1)\r\ns += ' '+str(((k-1)//2)%m+1)\r\nif(k%2==0):\r\n s += ' R'\r\nelse:\r\n s += ' L'\r\nprint(s)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\ncol,row,k = get_int_list()\r\n\r\ncol_capacity = row*2\r\nno_of_col = k//col_capacity\r\nif k%col_capacity != 0:\r\n no_of_col += 1\r\nresidue = k%col_capacity \r\n\r\nif residue%2 == 0:\r\n side = 'R'\r\nelse:\r\n side = 'L'\r\n\r\nif residue == 0:\r\n no_row = row\r\nelse:\r\n no_row = residue//2 + residue%2\r\nprint(no_of_col,no_row,side)", "#\r\n# Created by Daniil Kozhanov. All rights reserved.\r\n# January 2017\r\n\r\nn, m, k = map(int, input().split())\r\nm2 = m * 2\r\n\r\nif k % m2 == 0:\r\n r = k // m2\r\nelse:\r\n r = k // m2 + 1\r\n\r\nif k % 2 == 0:\r\n s = \"R\"\r\n d = (k - (r - 1) * m2) // 2\r\nelse:\r\n s = \"L\"\r\n d = (k - (r - 1) * m2) // 2 + 1\r\nprint(r, d, s)", "st = input()\r\n\r\nans = [0] * 3\r\n\r\nn, m, k = map(int, st.split())\r\npl = (k + 1) // 2\r\n\r\nans[0] = (pl - 1) // m + 1\r\nans[1] = ((pl - 1) % m) + 1\r\nans[2] = 'R' if not k % 2 else 'L'\r\n\r\nprint(*ans)\r\n# print(pl)\r\n", "n, m, k = map(int, input().split())\r\nif k%(2*m) == 0:\r\n r = k//(2*m)\r\nelse:\r\n r = k//(2*m) + 1\r\nd = k%(2*m)\r\nif d == 0:\r\n d = 2*m\r\nif d%2 == 0:\r\n d = d//2\r\nelse:\r\n d = d//2+1\r\nif k%2 == 0:\r\n z = 'R'\r\nelse:\r\n z = 'L'\r\nprint(r, d, z)\r\n", "n, m, k = map(int, input().split())\r\nrow = ((k + 1) // 2 - 1) // m + 1\r\ns = ['R', 'L']\r\ndesk = (k + 1) // 2 - m * (row - 1)\r\nprint(row, desk, s[k % 2])", "n,m,k = list(map(int, input().strip().split()))\r\n\r\nk = k - 1\r\n\r\ncol = k // (2*m)\r\nrow = (k % (2*m)) // 2\r\nc = 'L'\r\nif (k % (2*m)) % 2 == 1: c = 'R'\r\n\r\nprint(col+1, row+1, c)", "a=input().split(' ')\nn=int(a[0])\nm=int(a[1])\nk=int(a[2])\n\nlol=1\nkek=1\nt=False\nu=False\nside=None\nwhile not t:\n if k<=m*2*lol:\n t=True\n else:\n lol+=1\nd=m*2*lol\nr=int(d/(2*m))\nwhile not u:\n if (d-m*2)+kek*2>=k:\n u=True\n else:\n kek+=1\nif k%2==0:\n side='R'\nelse:\n side='L'\nprint(str(r),str(kek),side)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output.out\",'w')\r\nn,m,k=map(int,input().split())\r\np=(k-1)//2\r\nr=(p//m)+1\r\nd=p%(m)+1\r\nif k%2!=0:\r\n\tprint(r,d,\"L\")\r\nelse:\r\n\tprint(r,d,\"R\")\t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m,k = map(int, wtf[0].split())\r\n d = math.ceil(k/2) % m\r\n if d == 0:\r\n d = m\r\n r = math.ceil(math.ceil(k/(2*m)))\r\n s = 'L'\r\n if k%2 == 0:\r\n s = 'R'\r\n print(r, d, s)\r\n", "import math\n\nn, m, k = map(int, input().split())\ncolumn = math.ceil(k*1.0/(2*m))\nrow = math.ceil((k - (column - 1) * 2 * m) * 1.0 / 2)\nside = 'L' if k % 2 == 1 else 'R'\nprint(column, row, side)", "n, m, k = map(int, input().split())\r\nc = 'R'\r\nif k & 1:\r\n c = 'L'\r\n\r\npos = (k - 1) // 2 # n + m \r\nlane = (pos // m) + 1\r\ndesk = pos % m +1\r\nprint(lane, desk, c)", "import math\r\nn,m,k=map(int,input().split())\r\nlane=math.ceil(k/(m*2))\r\nred=k%(2*m)\r\nif(red==0):\r\n print(lane,m,\"R\")\r\nelse:\r\n if(k%2==0):\r\n print(lane,(red+1)//2,\"R\")\r\n else:\r\n print(lane,(red+1)//2,\"L\")\r\n\r\n", "n, m, n = map(int, input().split())\r\n\r\np = (n - 1) // 2\r\ny = (p // m) + 1\r\nx = (p % m) + 1\r\n\r\nif n % 2 == 0:\r\n print(y, x, 'R')\r\nif n % 2 == 1:\r\n print(y, x, 'L')\r\n", "\r\nline=[int(i) for i in input().split()]\r\nn=line[0]\r\nm=line[1]\r\nk=line[2]\r\ngrid=[]\r\n#print(n,m,k)\r\n\r\nans=\"\"\r\ngrid=[]\r\ncount=1\r\nfor i in range(n):\r\n grid.append(count)\r\n if(k<grid[len(grid)-1] and k>=grid[len(grid)-2]):\r\n \r\n ans+=str(i)\r\n c2=grid[len(grid)-2]\r\n for j in range(m):\r\n if(k==c2):\r\n ans+=\" \"+str(j+1)+\" L\"\r\n if(k==c2+1):\r\n ans+=\" \"+str(j+1)+\" R\"\r\n \r\n c2+=2\r\n break\r\n count+=m*2\r\n #n m k\r\n #4 3 9\r\nif(ans==\"\"):\r\n \r\n ans+=str(n)\r\n c2=(m)*2*(n-1)\r\n c2+=1\r\n for j in range(m):\r\n if(k==c2):\r\n ans+=\" \"+str(j+1)+\" L\"\r\n if(k==c2+1):\r\n ans+=\" \"+str(j+1)+\" R\"\r\n \r\n c2+=2\r\n \r\nprint(ans)\r\n \r\n \r\n ", "r,p,n=map(int,input().split())\nprint((n-1)//(p*2)+1,(n-1)%(p*2)//2+1,sep=' ',end=' ')\nif n%2==0:print('R')\nelse: print('L')\n", "def get_place(rows, dpr, k): # n=rows; m=dpr\n k -= 1\n dn = k // 2\n return (dn // dpr + 1, dn % dpr + 1, 'LR'[k % 2])\n\ndef m():\n print(*get_place(*map(int, input().split(' '))))\n\nif __name__ == \"__main__\":\n m()\n\n", "n, m, k = map(int, input().split())\n\nr = k // (2 * m) + (1 if k % (2 * m) else 0)\n\nc = ((k - 1) // 2) % m + 1\n\nif k & 1:\n\ts = 'L'\nelse:\n\ts = 'R'\n\nprint(r, c, s)", "n,m,k=map(int,input().split())\r\nif k%2==0:\r\n z=k//2\r\n d='R'\r\nelse:\r\n z=(k+1)//2\r\n d='L'\r\nx=1\r\ni=0\r\nwhile 1:\r\n if x>z:\r\n break\r\n else:\r\n x=x+m\r\n i+=1\r\nif z%m!=0:\r\n z=z%m\r\nelse:\r\n z=m\r\nprint(i,z,d)", "n,m,k=map(int,input().split())\r\nr=(((k-1)//2)+1)//m\r\nif (((k-1)//2)+1)%m!=0:\r\n r+=1\r\nd=(((k-1)//2)+1)%m\r\nif d==0:\r\n d=m\r\nif k%2==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)\r\n", "n, m, k = map(int, input().split())\r\nr = 0\r\ns = 0\r\nRL = ''\r\nfor i in range(1,n+1):\r\n\tif(m*i*2>=k):\r\n\t\tr = i\r\n\t\t#print('r=',r)\r\n\t\tbreak\r\nk = k - (r-1)*m*2\r\n#print('k=',k)\r\ns = int((k+1)/2)\r\n#print('s=',s)\r\nif((k % 2) == 0):\r\n\tRL = 'R'\r\nelse:\r\n\tRL = 'L'\r\nprint(r, s, RL)\r\n", "lanes, desk ,position = [int(x) for x in input().split()]\r\nOneOrTwo = [\"R\", \"L\"][position % 2]\r\nrow = (position - 1) // (desk * 2) + 1\r\ncol = ((position - 1) % (desk * 2) // 2) + 1\r\nprint(row, col, OneOrTwo)", "string = input()\nstring = string.split()\nn = int(string[0])\nm = int(string[1])\nk = int(string[2])\n\n\nif k % 2 != 0:\n s =\"L\"\n k +=1\nelse:\n s = \"R\"\n\n\nr = k//(m*2)\nif k % (m*2) != 0:\n r += 1\n\nd = (k % (m*2)) //2\nif d == 0:\n d = m\n\n\nprint(r, d, s)\n", "n, m, k = map(int, input().split())\r\n\r\nx = k%(m*2)\r\na = k//(m*2) + (x>0)\r\nb = (x+1)//2\r\nprint(a, (x+1)//2 if x!= 0 else m, 'L' if x%2 == 1 else 'R')", "n, m, k = [int(x) for x in input().split()]\r\n\r\nif k % 2 == 0:\r\n kk = k\r\n direction = 'R'\r\nelse:\r\n kk = k + 1\r\n direction = 'L'\r\n\r\nkk //= 2\r\n\r\nlane = kk // m\r\n\r\nif kk % m != 0:\r\n lane += 1\r\n\r\ndesk = kk % m\r\n\r\nif desk == 0:\r\n desk = m\r\n\r\nprint(lane, desk, direction)\r\n", "n,m,k = map(int,input().split())\r\n\r\nx = (k+1)//2\r\n\r\nr = (x+m-1)//m\r\nc = (x-1)%m+1\r\nch = 'R'\r\nif k&1:\r\n ch = 'L'\r\nprint(r,c,ch)", "n, m, k = map(int, input().split())\r\nnum = (k + 1) // 2\r\nif (num % m == 0):\r\n print(num // m, end = ' ')\r\nelse:\r\n print(num // m + 1, end = ' ')\r\nif (num % m == 0):\r\n print(m, end = ' ')\r\nelse:\r\n print(num % m, end = ' ')\r\nif (k % 2 == 1):\r\n print(\"L\")\r\nelse:\r\n print(\"R\")", "n,m,k=map(int,input().split())\nif k%2==0:\n s='R'\nelse:\n s='L'\nc=(k-1)//(2*m)\nr=((k-1)%(2*m))//2\nprint(c+1,r+1,s)\n", "n, m, k = map(int, input().split())\r\ni = 1\r\nstop = 0\r\nwhile stop != 1:\r\n if (k >= 2 * (i - 1) * m + 1) and (k <= 2 * i * m) :\r\n r = i\r\n d = 1 + (k - (2 * (i - 1) * m + 1)) // 2\r\n if k % 2 == 0:\r\n s = \"R\"\r\n else:\r\n s = \"L\"\r\n stop = 1\r\n i += 1\r\nprint(r,d,s)\r\n\r\n", "n,m,k=map(int,input().split())\r\nr=(k-1)//(m*2)+1\r\nd=(k-1)%(m*2)//2+1\r\nif k%2==1:\r\n s='L'\r\nelse:\r\n s='R'\r\nprint(r,d,s)\r\n", "import math\r\ninp1=list(map(int,input().strip().split()))[:3]\r\nr,c,val=inp1[0],inp1[1],inp1[2]\r\ndivi=c*2\r\nif(val % 2):\r\n\tval1=val+1\r\n\tdir1='L'\r\nelse:\r\n\tval1=val\r\n\tdir1='R'\r\nrow=math.ceil(val1/divi)\r\nrem=val1 % divi\r\ncol=rem // 2\r\nif(rem==0):\r\n\tcol=c\r\nprint(row,col,dir1,end=\" \")\r\nprint()", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\n\ndef main():\n n,l,t = list(map(int, input().split()))\n a = (t+1)//2\n s = 'L' if t%2==1 else 'R'\n return ' '.join(map(str, [(a-1)//l+1, (a-1)%l+1, s]))\n\n\n\nprint(main())\n", "from math import ceil\r\nn, m, k = map(int, input().split())\r\nr = ceil(k / (m * 2))\r\nc = k % (m * 2)\r\nc = m * 2 if c == 0 else c\r\nprint(r, end = ' ')\r\nprint(ceil(c / 2), end = ' ')\r\nprint('L' if c % 2 else 'R')", "n,m,k=map(int,input().split())\r\np=(k-1)//2\r\nr=(p//m)+1\r\nn=p%m+1\r\nprint(r,n, 'L' if k%2==1 else 'R')", "n,m,k=[int(i) for i in input().split()]\r\nryad=k//(2*m)+1\r\nif k%(2*m)==0:\r\n ryad-=1\r\nparta=(k-2*m*(ryad-1))//2+k%2\r\nif k%2==0:\r\n mesto='R'\r\nelse:\r\n mesto='L'\r\nprint(ryad,parta,mesto)", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\nif k % 2 == 0:\r\n k = int(k / 2)\r\n a = int(k / m)\r\n b = k % m\r\n if b != 0:\r\n print(a+1, b, 'R')\r\n else:\r\n print(a, m, 'R')\r\nelse:\r\n k = int((k +1) / 2)\r\n a = int(k / m)\r\n b = k % m\r\n if b != 0:\r\n print(a+1, b, 'L')\r\n else:\r\n print(a, m, 'L')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ndef solution(n, m, k):\r\n l = math.ceil(k/(2*m))\r\n d = math.ceil((k-(2*m*(l-1)))/2)\r\n left_or_right = 'R' if k % 2 == 0 else 'L'\r\n return [l, d, left_or_right]\r\n\r\nn, m, k = [int(x) for x in input().strip().split(\" \")]\r\nans = solution(n, m, k)\r\nprint(ans[0], ans[1], ans[2])", "n, m, k = list(map(int, input().split()))\r\nr = (k - 1) // (m * 2) + 1\r\nk -= (r - 1) * (2 * m)\r\nd = (k - 1) // 2 + 1\r\nif k % 2:\r\n s = 'L'\r\nelse:\r\n s = 'R'\r\nprint(r, d, s)\r\n", "# https://codeforces.com/problemset/problem/748/A\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nlane = math.ceil(k / (2 * m))\r\n\r\ndesk = math.ceil((k - (2 * m * (lane - 1))) / 2)\r\n\r\nif k % 2 == 0:\r\n print(lane, desk, \"R\")\r\nelse:\r\n print(lane, desk, \"L\")\r\n", "n, m, k = map(int, input().split())\nz = (k + 2 * m - 1) // (2 * m)\nq = k % (2 * m)\nif q == 0:\n q = 2 * m\nq = (q + 1) // 2\nw = q % 2\nif k % 2:\n w = 'L'\nelse:\n w = 'R'\nprint(z, q, w)", "n, m , k = map(int, input().split())\r\nr = (k - 1) // (2 * m) + 1\r\nd = ((k - 1) % (2 * m)) // 2 + 1\r\nif k % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\nprint(r, d, s)\r\n", "n,m,k=map(int, input().split())\r\nimport sys\r\ni=0\r\nj=0\r\nm*=2\r\nsch=0;\r\nd=(k-1)//m+1\r\nprint(d, end=' ')\r\nfor i in range(1+(d-1)*m,m*d+1):\r\n j+=1\r\n if i==k:\r\n print((j-1)//2+1, end=' ')\r\n if k%2==1:\r\n print('L')\r\n else:\r\n print('R')\r\n sys.exit()\r\n", "s=list(map(int, input().split()))\r\nn=s[0]\r\nm=s[1]\r\nk=s[2]\r\nkolvr=2*m\r\nif k%kolvr==0:\r\n r=k//kolvr\r\nelse:\r\n r=k//kolvr+1\r\nnachr=2*m*(r-1)\r\ni=k-nachr\r\nif i%2==0:\r\n d=i//2\r\nelse:\r\n d=i//2+1\r\nprint(r, end=' ')\r\nprint(d, end=' ')\r\nif k%2==0:\r\n print('R')\r\nelse:\r\n print('L')\r\n", "from sys import stdin\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nc = (k - 2*m*(k//(2*m)))\r\nif c == 0:\r\n r = m\r\nelse:\r\n r = (c - 1) // 2 + 1\r\nif c % 2 == 0:\r\n s = 'R'\r\nelse:\r\n s = 'L'\r\ncol = k // (2*m)\r\nif k % (2*m) != 0:\r\n col += 1\r\nprint(col , r, s)", "n, m, k = map(int, input().split())\nprint((k + m * 2 - 1) // (m * 2), ((k - 1) % (m * 2) + 2) // 2, 'L' if k % 2 else 'R')", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\ndef solve(case_no):\r\n n, m, k = map(int, input().split())\r\n x = 1\r\n y = 1\r\n while k > 2 * m:\r\n k -= 2 * m\r\n x += 1\r\n y = (k + 1) // 2\r\n print(x, y, \"R\" if (k + 1) % 2 == 1 else \"L\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "import math\n\nm, n, t = input().split()\nif int(t) % 2 == 0:\n t = int(t) / 2\n l = 'R'\nelse:\n t = (int(t) + 1) / 2\n l = 'L'\nx = math.ceil(t / int(n))\ny = int(t % int(n))\nif y == 0:\n y = int(n)\nprint(str(x)+' '+str(y)+' '+l)\n\t \t \t\t\t\t\t\t \t\t \t\t \t\t\t\t\t\t \t", "#!/usr/bin/python\n\ninp = [int(i) for i in input().split(' ')]\nn = inp[0]\nm = inp[1]\nk = inp[2]\n\nleft = 'L' if k%2==1 else 'R'\n\nspotsperlane = 2*m\n\nlane = int(k/spotsperlane)\nif k%spotsperlane != 0:\n lane+=1\n\n\nk -= spotsperlane*(lane-1)\nk/=2\n\nrow = int(k+.5)\n\nprint('{} {} {}'.format(lane, row, left))\n", "import math\r\nn,m,k=map(int,input().split())\r\nl=math.ceil(k/(2*m))\r\nse=math.ceil((k-((l-1)*2*m))/2)\r\nprint(l,se,end=' ')\r\nif k%2==0:print('R')\r\nelse:print('L')", "import math\r\n\r\nlist = [int(i) for i in input().split()]\r\nn = list[0]\r\nm = list[1]\r\nk = list[2]\r\ns = \"\"\r\nif k%2==0:\r\n s=\"R\"\r\n k -= 1\r\nelse:\r\n s=\"L\"\r\n\r\n_n = int(math.ceil(k/(2*m)))\r\n_m = math.ceil((k - int(k/(2*m))*(2*m))/2)\r\n\r\nprint(\"%i %i %s\" % (_n, _m, s))\r\n\r\n\r\n", "from math import ceil\r\n\r\nn, m, k = map(int, input().split())\r\nrow = ceil(k/(2*m))\r\nprint(row, ceil((k - 2*m*(row - 1))/2) , \"R\" if k%2==0 else \"L\")\r\n\r\n", "n, m, k = map(int, input().split())\r\n\r\nrow = (k - 1) // (2 * m) + 1\r\ncolumn = ((k - 1) // 2) % m + 1\r\nside = \"R\" if k % 2 ==0 else \"L\"\r\n\r\nprint(row, column, side)", "n,m,k=map(int,input().split())\r\nif k%(2*m)==0:\r\n p=k//(2*m)\r\nelse:\r\n p=k//(2*m)+1\r\nif (k-2*m*(p-1))%2==0:\r\n mes=(k-2*m*(p-1))//2\r\nelse:\r\n mes=(k-2*m*(p-1))//2+1\r\nif k%2==0:\r\n pos='R'\r\nelse:\r\n pos='L'\r\nprint(p,mes,pos)\r\n", "import math\r\nn, m, k = map(int, input().split())\r\nk -= 1\r\nans = [0, 0, 'R']\r\nif (k % 2 == 0):\r\n ans[2] = 'L'\r\nk //= 2\r\nans[0] = k // m + 1\r\nans[1] = k % m + 1\r\nprint(*ans)\r\n\r\n", "a,b,c = map(int,input().split())\r\nt = 0\r\nr = 0 \r\nfor i in range(a):\r\n\tif c<=(b*(i+1)*2):\r\n\t\tt = c - (i)*b*2\r\n\t\tr = int(t/2)\r\n\t\tif c%2 == 1:\r\n\t\t\tr = r + 1\r\n\r\n\r\n\t\tprint(i+1,r,end=\" \")\r\n\t\tif c%2 == 1:\r\n\t\t\tprint(\"L\")\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"R\")\r\n\t\t\tbreak\r\n", "import math\r\nn,m,x=map(int,input().split())\r\nc=int(math.ceil(x/2/m))\r\nr=int(math.ceil((x-(c-1)*2*m)/2))\r\n\r\nif(x%2==0):\r\n print('%d %d R'%(c,r))\r\nelse:\r\n print('%d %d L' % (c, r))", "x,y,z=map(int,input().split())\r\ns=(z+(2*y-1))//(2*y)\r\nd=((z+1)//2+y-1)%y+1\r\nprint(s,d,['R','L'][z%2])", "import math\r\nn,m,k=map(int,input().split())\r\na=math.ceil(k/(m*2))\r\nb=math.ceil((k%(m*2))/2 )\r\nif b==0:\r\n b=m\r\nif (k%(m*2))%2==0:\r\n c='R'\r\nelse:\r\n c='L'\r\nprint(a,b,c)", "n, m, k = [int(x) for x in input().split()]\r\n\r\ntm = m << 1\r\n\r\nlane = (k - 1) // tm\r\n\r\nr = (k - 1) % tm\r\n\r\ndesk, s = r >> 1, r & 1\r\n\r\nprint(lane + 1, desk + 1, 'L' if s == 0 else 'R')", "import sys\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\n \na,b,c = get_ints()\nd=\"R\"\n\nif c%2==0:\n d=\"R\"\n \nelse:\n d=\"L\"\n c=c+1\n\nc=c/2\nc=c-1\nr=c%b\ne=c//b\nr+=1\ne+=1\nr=int(r)\ne=int(e)\nprint (e,r,d)\n \t\t \t \t\t\t\t\t \t\t \t \t\t\t\t" ]

{"inputs": ["4 3 9", "4 3 24", "2 4 4", "3 10 24", "10 3 59", "10000 10000 160845880", "1 1 1", "1 1 2", "1 10000 1", "1 10000 20000", "10000 1 1", "10000 1 10000", "10000 1 20000", "3 2 1", "3 2 2", "3 2 3", "3 2 4", "3 2 5", "3 2 6", "3 2 7", "3 2 8", "3 2 9", "3 2 10", "3 2 11", "3 2 12", "300 2000 1068628", "300 2000 584756", "300 2000 268181", "10000 9999 186450844", "10000 9999 197114268", "10000 9999 112390396", "10000 10000 1", "10000 10000 2", "10000 10000 100000001", "10000 10000 199999999", "10000 10000 200000000", "1 2 1", "1 2 2", "1 2 3", "1 2 4", "2 1 1", "2 1 2", "2 1 3", "2 1 4", "4 3 7", "1 1 1"], "outputs": ["2 2 L", "4 3 R", "1 2 R", "2 2 R", "10 3 L", "8043 2940 R", "1 1 L", "1 1 R", "1 1 L", "1 10000 R", "1 1 L", "5000 1 R", "10000 1 R", "1 1 L", "1 1 R", "1 2 L", "1 2 R", "2 1 L", "2 1 R", "2 2 L", "2 2 R", "3 1 L", "3 1 R", "3 2 L", "3 2 R", "268 314 R", "147 378 R", "68 91 L", "9324 4745 R", "9857 6990 R", "5621 818 R", "1 1 L", "1 1 R", "5001 1 L", "10000 10000 L", "10000 10000 R", "1 1 L", "1 1 R", "1 2 L", "1 2 R", "1 1 L", "1 1 R", "2 1 L", "2 1 R", "2 1 L", "1 1 L"]}

UNKNOWN

PYTHON3

CODEFORCES

336

d1852fd6497c284277904fff7cf01797

Weak Subsequence

Little Petya very much likes strings. Recently he has received a voucher to purchase a string as a gift from his mother. The string can be bought in the local shop. One can consider that the shop has all sorts of strings over the alphabet of fixed size. The size of the alphabet is equal to *k*. However, the voucher has a string type limitation: specifically, the voucher can be used to purchase string *s* if the length of string's longest substring that is also its weak subsequence (see the definition given below) equals *w*. String *a* with the length of *n* is considered the weak subsequence of the string *s* with the length of *m*, if there exists such a set of indexes 1<=≤<=*i*1<=<<=*i*2<=<<=...<=<<=*i**n*<=≤<=*m*, that has the following two properties: - *a**k*<==<=*s**i**k* for all *k* from 1 to *n*; - there exists at least one such *k* (1<=≤<=*k*<=<<=*n*), for which *i**k*<=+<=1<=–<=*i**k*<=><=1. Petya got interested how many different strings are available for him to purchase in the shop. As the number of strings can be very large, please find it modulo 1000000007 (109<=+<=7). If there are infinitely many such strings, print "-1". The first line contains two integers *k* (1<=≤<=*k*<=≤<=106) and *w* (2<=≤<=*w*<=≤<=109) — the alphabet size and the required length of the maximum substring that also is the weak subsequence, correspondingly. Print a single number — the number of strings Petya can buy using the voucher, modulo 1000000007 (109<=+<=7). If there are infinitely many such strings, print "-1" (without the quotes). Sample Input 2 2 3 5 2 139 Sample Output 10 1593 717248223

[ "from sys import stdin #Bibliotecas para optimizar la entrada/salida\r\nfrom sys import stdout\r\n\r\nMOD = 1000000007 #Modulo\r\n\r\ndef qp(a,p): #Exponenciacion binaria O(log p)\r\n a = int(a)\r\n p = int(p)\r\n if p == 0:\r\n return 1\r\n x = qp(a,p//2)\r\n x = (x*x)%MOD\r\n if p%2 == 1:\r\n x = (x*a)%MOD\r\n return x\r\n\r\ndef inv(a): #inverso multiplicativo, ya que el modulo es primo usamos el pequeño teorema de fermat para hallarlo\r\n return qp(a,MOD-2)\r\n\r\n\r\ninputs = list(map(int,stdin.readline().split())) #lee la entrada\r\nk,w = inputs[0],inputs[1] \r\n\r\n\r\n\r\nfact = [0 for i in range(k+1)] #Lista que va a mantener para cada valor entre 0 y k el factorial de ese numero (modulado)\r\nifact = [0 for i in range(k+1)] #Lista que va a mantener para cada valor entre 0 y k el inverso multiplicativo del factorial de ese numero.\r\n\r\n#Computamos el factorial recursivamente\r\nfact[0] = 1\r\nfor i in range(1,k+1):\r\n fact[i] = (fact[i-1]*i)%MOD\r\n\r\n#Computamos el inverso multiplicativo del factorial recursivamente teniendo en cuenta que (k!)^(-1) = ((k+1)!^(-1))*k+1\r\nifact[k] = inv(fact[k])\r\nfor i in range(2,k+2):\r\n ifact[k + 1 - i] = (ifact[k + 2 - i]*(k + 2 - i))%MOD\r\n\r\ninvk = inv(k) #variable que guarda el inverso multiplicativo de k\r\n\r\n#Lista que almacena en la posicion i el valor (k^(w-i))%MOD\r\nqpk = [0 for i in range(k+1)]\r\nqpk[0] = qp(k,w)\r\nfor i in range(k):\r\n qpk[i+1] = (qpk[i]*invk) %MOD\r\n\r\nans = 0 #Variable para la respuesta\r\n\r\nfor i in range(1,k+1):\r\n subans = 1\r\n\r\n #Calculamos la cantidad de palabras cuyos sufijos de tamaño w son subcadenas buenas máximas\r\n if i < w:\r\n subans*=fact[k]\r\n subans%=MOD\r\n subans*=fact[k-1]\r\n subans%=MOD\r\n subans*=qpk[i]\r\n subans%=MOD\r\n subans*=i\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n else:\r\n subans*=fact[k]\r\n subans%=MOD\r\n subans*=fact[k-1-i+w]\r\n subans%=MOD\r\n subans*=w\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n\r\n ans%=MOD\r\n\r\n #Calculamos la cantidad de palabras cuyos prefijos de tamaño w son subcadenas buenas máximas\r\n if i < k:\r\n if i+1 < w:\r\n subans*=fact[k]\r\n subans%=MOD\r\n subans*=fact[k-1]\r\n subans%=MOD\r\n subans*= qpk[i+1]\r\n subans%=MOD\r\n subans*=i\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n subans*=ifact[k-i-1]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n else:\r\n subans*=fact[k]\r\n subans%=MOD\r\n subans*=fact[k-2-i+w]\r\n subans%=MOD\r\n subans*=(w-1)\r\n subans%=MOD\r\n subans*=ifact[k-i]\r\n subans%=MOD\r\n subans*=ifact[k-i-1]\r\n subans%=MOD\r\n ans += subans\r\n subans = 1\r\n\r\n ans%=MOD\r\n\r\nprint(int(ans))\r\n\r\n" ]

{"inputs": ["2 2", "3 5", "2 139", "5 6", "1000 1002", "131 132", "4 4", "3 2", "1 1000000000", "666 888888888", "1000000 1000000000", "1000000 1000000", "1000000 2", "2 1000000000", "1000000 500000", "12345 543210123", "1 2", "1 3", "1 4", "1 5", "1 6", "1 7", "1 8", "2 3", "2 4", "2 5", "2 6", "2 7", "2 8", "3 3", "3 4", "3 6", "3 7", "3 8", "4 2", "4 3", "4 5", "4 6", "4 7", "4 8", "5 2", "5 3", "5 4", "5 5", "5 7", "5 8", "6 2", "6 3", "6 4", "6 5", "6 6", "6 7", "6 8", "7 2", "7 3", "7 4", "7 5", "7 6", "7 7", "7 8", "8 2", "8 3", "8 4", "8 5", "8 6", "8 7", "8 8", "999999 1000001", "1000000 1000001", "1000000 999999", "1000000 999998", "1000000 999997", "1000000 1000002", "1000000 1000003", "983039 939524096", "998999 3", "987899 555555", "999009 55", "999009 818243", "999009 999004", "999009 999005", "999009 999006", "999009 999007", "999009 999008", "999009 999009", "999010 72", "999010 808035", "999010 999005", "999010 999006", "999010 999007", "999010 999008", "999010 999009", "999010 999010", "999011 64", "999011 133617", "999011 999006", "999011 999007", "999011 999008", "999011 999009", "999011 999010", "999011 999011"], "outputs": ["10", "1593", "717248223", "983725", "9396758", "757914194", "4912", "57", "1", "424798470", "600002237", "438349146", "739181318", "851562506", "53435433", "290786804", "1", "1", "1", "1", "1", "1", "1", "20", "40", "80", "160", "320", "640", "177", "531", "4779", "14337", "43011", "292", "1216", "19648", "78592", "314368", "1257472", "1585", "7745", "39205", "196745", "4918625", "24593125", "9726", "50916", "296856", "1789776", "10755936", "64535616", "387213696", "68425", "366625", "2290855", "15673105", "109953655", "770280385", "391962660", "547912", "2953952", "18951136", "138867968", "92073977", "746268616", "999179293", "134450642", "142931557", "250496915", "129080538", "769225275", "555999483", "479108007", "604697498", "356230103", "229752266", "484803676", "282452206", "614735788", "945978791", "175954096", "318397869", "751039945", "187298386", "131671481", "568832480", "898095114", "100649860", "292072410", "253072162", "808216351", "493965177", "197612280", "471490419", "537424009", "932469897", "712314569", "272668831", "926206743", "68819519"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d1946a1f3c70a6557cd0eba06be837de

The Red Button

Piegirl found the red button. You have one last chance to change the inevitable end. The circuit under the button consists of *n* nodes, numbered from 0 to *n* - 1. In order to deactivate the button, the *n* nodes must be disarmed in a particular order. Node 0 must be disarmed first. After disarming node *i*, the next node to be disarmed must be either node (2·*i*) modulo *n* or node (2·*i*)<=+<=1 modulo *n*. The last node to be disarmed must be node 0. Node 0 must be disarmed twice, but all other nodes must be disarmed exactly once. Your task is to find any such order and print it. If there is no such order, print -1. Input consists of a single integer *n* (2<=≤<=*n*<=≤<=105). Print an order in which you can to disarm all nodes. If it is impossible, print -1 instead. If there are multiple orders, print any one of them. Sample Input 2 3 4 16 Sample Output 0 1 0 -10 1 3 2 0 0 1 2 4 9 3 6 13 10 5 11 7 15 14 12 8 0

[ "n=int(input())\r\nif n&1:\r\n\tprint(-1)\r\nelse:\r\n\tD,R=[False]*(10**6),[0]*(10**6)\r\n\ti,j=0,0\r\n\twhile True:\r\n\t\tD[j]=True\r\n\t\tR[i]=j\r\n\t\ti+=1\r\n\t\tif not D[(j+n)>>1]:\r\n\t\t\tj=(j+n)>>1\r\n\t\telif not D[j>>1]:\r\n\t\t\tj=j>>1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tprint(\" \".join(str(R[i]) for i in range(n,-1,-1)))\r\n" ]

{"inputs": ["2", "3", "4", "16", "5", "7", "32", "255", "65536", "99999", "9", "6", "8", "10", "12", "20", "25", "30", "32", "45", "50", "100", "126", "513", "514", "800", "1000", "2500", "6400", "23105", "24002", "29024", "36002", "55555", "65534", "77776", "88888", "99494", "99998", "90248", "99994", "100000", "98300", "95324", "87380", "86036", "81914"], "outputs": ["0 1 0", "-1", "0 1 3 2 0", "0 1 2 4 9 3 6 13 10 5 11 7 15 14 12 8 0", "-1", "-1", "0 1 2 4 8 17 3 6 12 25 18 5 10 20 9 19 7 14 29 26 21 11 22 13 27 23 15 31 30 28 24 16 0", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32769 3 6 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49153 32770 5 10 20 40 80 160 320 640 1280 2560 5120 10240 20480 40960 16385 32771 7 14 28 56 112 224 448 896 1792 3584 7168 14336 28672 57345 49154 32772 9 18 36 72 144 288 576 1152 2304 4608 9216 18432 36864 8193 16386 32773 11 22 44 88 176 352 704 1408 2816 5632 11264 22528 45056 24577 49155 32774 13 26 52 104 208 416 832 1664 3328 6656 13312 26624 53248 40961 16387 32775 15 30 60 120 24...", "-1", "-1", "0 1 2 5 4 3 0", "0 1 2 5 3 7 6 4 0", "0 1 2 4 9 8 6 3 7 5 0", "0 1 2 4 8 5 11 10 9 7 3 6 0", "0 1 2 4 8 16 12 5 11 3 6 13 7 14 9 19 18 17 15 10 0", "-1", "0 1 2 4 8 16 3 6 12 24 19 9 18 7 14 29 28 26 23 17 5 10 21 13 27 25 20 11 22 15 0", "0 1 2 4 8 17 3 6 12 25 18 5 10 20 9 19 7 14 29 26 21 11 22 13 27 23 15 31 30 28 24 16 0", "-1", "0 1 2 4 8 16 32 14 28 6 12 24 49 48 46 42 34 18 36 22 44 39 29 9 19 38 26 3 7 15 30 10 20 40 31 13 27 5 11 23 47 45 41 33 17 35 21 43 37 25 0", "0 1 2 4 8 16 32 64 28 56 12 24 48 96 92 84 68 36 72 44 88 76 52 5 10 20 40 80 60 21 42 85 70 41 82 65 30 61 22 45 90 81 62 25 51 3 6 13 26 53 7 14 29 58 17 34 69 38 77 54 9 18 37 74 49 99 98 97 94 89 79 59 19 39 78 57 15 31 63 27 55 11 23 46 93 86 73 47 95 91 83 66 33 67 35 71 43 87 75 50 0", "0 1 2 4 8 16 32 64 3 6 12 24 48 96 66 7 14 28 56 112 98 70 15 30 60 120 114 102 78 31 62 125 124 122 118 110 95 65 5 10 20 40 80 35 71 17 34 68 11 22 44 88 50 100 74 23 46 92 58 116 106 87 49 99 72 18 37 75 25 51 103 81 36 73 21 42 85 45 90 54 109 93 61 123 121 117 108 91 57 115 104 83 41 82 39 79 33 67 9 19 38 77 29 59 119 113 101 76 27 55 111 97 69 13 26 53 107 89 52 105 84 43 86 47 94 63 0", "-1", "0 1 2 4 8 16 32 64 128 256 513 512 510 506 498 482 450 386 258 3 6 12 24 48 96 192 384 254 508 502 490 466 418 322 130 260 7 14 28 56 112 224 448 382 250 500 486 458 402 290 66 132 264 15 30 60 120 240 480 446 378 242 484 454 394 274 34 68 136 272 31 62 124 248 496 478 442 370 226 452 390 266 18 36 72 144 288 63 126 252 504 494 474 434 354 194 388 262 10 20 40 80 160 321 129 259 5 11 22 44 88 176 352 190 380 246 492 470 426 338 162 324 134 268 23 46 92 184 368 222 444 374 234 468 422 330 146 292 70 140 280...", "0 1 2 4 8 16 32 64 128 256 512 224 448 96 192 384 768 736 672 544 288 576 352 704 608 416 33 66 132 264 528 257 514 228 456 112 225 450 100 200 401 3 6 12 24 48 97 194 388 776 752 705 610 420 40 80 160 320 640 480 161 322 644 488 176 353 706 612 424 49 98 196 392 784 769 738 676 552 304 609 418 36 72 144 289 578 356 712 624 449 99 198 396 792 785 770 740 680 560 321 642 484 168 336 673 546 292 584 368 737 674 548 296 592 385 771 742 684 568 337 675 550 300 601 402 5 10 20 41 82 164 328 656 513 226 452 104 ...", "0 1 2 4 8 16 32 64 128 256 512 24 48 96 192 384 768 536 72 144 288 576 152 304 608 216 432 864 728 456 912 824 648 296 592 184 368 736 472 944 888 776 552 104 208 416 832 664 328 656 312 624 248 496 992 984 968 936 872 744 488 976 952 904 808 616 232 464 928 856 712 424 848 696 392 784 568 136 272 544 88 176 352 704 408 816 632 264 528 56 112 224 448 896 792 584 168 336 672 344 688 376 752 504 9 18 36 73 146 292 585 170 340 680 360 720 440 880 760 520 40 80 160 320 640 280 560 120 240 480 960 920 840 681 3...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 1596 692 1384 268 536 1072 2144 1788 1076 2152 1804 1108 2216 1932 1364 228 456 912 1824 1148 2296 2092 1684 868 1736 972 1944 1388 276 552 1104 2208 1916 1332 164 328 656 1312 124 248 496 992 1984 1468 436 872 1744 988 1976 1452 404 808 1616 732 1464 428 856 1712 924 1848 1196 2392 2284 2068 1636 772 1544 588 1176 2352 2204 1908 1316 132 264 528 1056 2112 1724 948 1896 1292 84 168 336 672 1344 188 376 752 1504 508 1016 2032 1564 628 1256 12 24 48 96 192 384 768 153...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 1792 3584 768 1536 3072 6144 5888 5376 4352 2304 4608 2816 5632 4864 3328 257 514 1028 2056 4112 1824 3648 896 1793 3586 772 1544 3088 6176 5952 5504 4609 2818 5636 4872 3344 288 576 1152 2305 4610 2820 5640 4880 3360 320 640 1280 2560 5120 3840 1281 2562 5124 3848 1296 2592 5184 3968 1537 3074 6148 5896 5392 4384 2368 4736 3073 6146 5892 5384 4368 2336 4672 2944 5889 5378 4356 2312 4624 2848 5696 4992 3585 770 1540 3080 6160 5920 5440 4480 2561 5122 3844 1288 ...", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 8766 17532 11062 22124 20246 16490 8978 17956 11910 23820 23638 23274 22546 21090 18178 12354 706 1412 2824 5648 11296 22592 21182 18362 12722 1442 2884 5768 11536 23072 22142 20282 16562 9122 18244 12486 970 1940 3880 7760 15520 7038 14076 4150 8300 16600 9198 18396 12790 1578 3156 6312 12624 1246 2492 4984 9968 19936 15870 7738 15476 6950 13900 3798 7596 15192 6382 12764 1526 3052 6104 12208 414 828 1656 3312 6624 13248 2494 4988 9976 19952 15902 7...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 3744 7488 14976 928 1856 3712 7424 14848 672 1344 2688 5376 10752 21504 13984 27968 26912 24800 20576 12128 24256 19488 9952 19904 10784 21568 14112 28224 27424 25824 22624 16224 3424 6848 13696 27392 25760 22496 15968 2912 5824 11648 23296 17568 6112 12224 24448 19872 10720 21440 13856 27712 26400 23776 18528 8032 16064 3104 6208 12416 24832 20640 12256 24512 20000 10976 21952 14880 736 1472 2944 5888 11776 23552 18080 7136 14272 28544 28064 27104 2...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 29534 23066 10130 20260 4518 9036 18072 142 284 568 1136 2272 4544 9088 18176 350 700 1400 2800 5600 11200 22400 8798 17596 35192 34382 32762 29522 23042 10082 20164 4326 8652 17304 34608 33214 30426 24850 13698 27396 18790 1578 3156 6312 12624 25248 14494 28988 21974 7946 15892 31784 27566 19130 2258 4516 9032 18064 126 252 504 1008 2016 4032 8064 16128 32256 28510 21018 6034 12068 24136 12270 24540 13078 26156 16310 32620 29238 22474 8946 178...", "-1", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 3 6 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49152 32770 7 14 28 56 112 224 448 896 1792 3584 7168 14336 28672 57344 49154 32774 15 30 60 120 240 480 960 1920 3840 7680 15360 30720 61440 57346 49158 32782 31 62 124 248 496 992 1984 3968 7936 15872 31744 63488 61442 57350 49166 32798 63 126 252 504 1008 2016 4032 8064 16128 32256 64512 63490 61446 57358 49182 32830 127 254 508 1016 2032 4064 8128 16256 32512 65024 64514 63494 61454 573...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 53296 28816 57632 37488 74976 72176 66576 55376 32976 65952 54128 30480 60960 44144 10512 21024 42048 6320 12640 25280 50560 23344 46688 15600 31200 62400 47024 16272 32544 65088 52400 27024 54048 30320 60640 43504 9232 18464 36928 73856 69936 62096 46416 15056 30112 60224 42672 7568 15136 30272 60544 43312 8848 17696 35392 70784 63792 49808 21840 43680 9584 19168 38336 76672 75568 73360 68944 60112 42448 7120 14240 28480 56960 36144 7228...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 42184 84368 79848 70808 52728 16568 33136 66272 43656 87312 85736 82584 76280 63672 38456 76912 64936 40984 81968 75048 61208 33528 67056 45224 1560 3120 6240 12480 24960 49920 10952 21904 43808 87616 86344 83800 78712 68536 48184 7480 14960 29920 59840 30792 61584 34280 68560 48232 7576 15152 30304 60608 32328 64656 40424 80848 72808 56728 24568 49136 9384 18768 37536 75072 61256 33624 67248 45608 2328 4656 9312 18624 37248 74496 60104 3...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31578 63156 26818 53636 7778 15556 31112 62224 24954 49908 322 644 1288 2576 5152 10304 20608 41216 82432 65370 31246 62492 25490 50980 2466 4932 9864 19728 39456 78912 58330 17166 34332 68664 37834 75668 51842 4190 8380 16760 33520 67040 34586 69172 38850 77700 55906 12318 24636 49272 98544 97594 95694 91894 84294 69094 38694 77388 55282 11070 22140 44280 88560 77626 55758 12022 24044 48088 96176 92858 86222 72950 46406 92812 86130 72766...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31074 62148 24298 48596 97192 94386 88774 77550 55102 10206 20412 40824 81648 63298 26598 53196 6394 12788 25576 51152 2306 4612 9224 18448 36896 73792 47586 95172 90346 80694 61390 22782 45564 91128 82258 64518 29038 58076 16154 32308 64616 29234 58468 16938 33876 67752 35506 71012 42026 84052 68106 36214 72428 44858 89716 79434 58870 17742 35484 70968 41938 83876 67754 35510 71020 42042 84084 68170 36342 72684 45370 90740 81482 62966 25...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 40824 81648 73048 55848 21448 42896 85792 81336 72424 54600 18952 37904 75808 61368 32488 64976 39704 79408 68568 46888 3528 7056 14112 28224 56448 22648 45296 344 688 1376 2752 5504 11008 22016 44032 88064 85880 81512 72776 55304 20360 40720 81440 72632 55016 19784 39568 79136 68024 45800 1352 2704 5408 10816 21632 43264 86528 82808 75368 60488 30728 61456 32664 65328 40408 80816 71384 52520 14792 29584 59168 28088 56176 22104 44208 8841...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31078 62156 24318 48636 97272 94550 89106 78218 56442 12890 25780 51560 3126 6252 12504 25008 50016 38 76 152 304 608 1216 2432 4864 9728 19456 38912 77824 55654 11314 22628 45256 90512 81030 62066 24138 48276 96552 93110 86226 72458 44922 89844 79694 59394 18794 37588 75176 50358 722 1444 2888 5776 11552 23104 46208 92416 84838 69682 39370 78740 57486 14978 29956 59912 19830 39660 79320 58646 17298 34596 69192 38390 76780 53566 7138 1427...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 31072 62144 24288 48576 97152 94304 88608 77216 54432 8864 17728 35456 70912 41824 83648 67296 34592 69184 38368 76736 53472 6944 13888 27776 55552 11104 22208 44416 88832 77664 55328 10656 21312 42624 85248 70496 40992 81984 63968 27936 55872 11744 23488 46976 93952 87904 75808 51616 3232 6464 12928 25856 51712 3424 6848 13696 27392 54784 9568 19136 38272 76544 53088 6176 12352 24704 49408 98816 97632 95264 90528 81056 62112 24224 48448 ...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 32772 65544 32788 65576 32852 65704 33108 66216 34132 68264 38228 76456 54612 10924 21848 43696 87392 76484 54668 11036 22072 44144 88288 78276 58252 18204 36408 72816 47332 94664 91028 83756 69212 40124 80248 62196 26092 52184 6068 12136 24272 48544 97088 95876 93452 88604 78908 59516 20732 41464 82928 67556 36812 73624 48948 97896 97492 96684 95068 91836 85372 72444 46588 93176 88052 77804 57308 16316 32632 65264 32228 64456 30612 61224...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 35748 71496 47668 12 24 48 96 192 384 768 1536 3072 6144 12288 24576 49152 2980 5960 11920 23840 47680 36 72 144 288 576 1152 2304 4608 9216 18432 36864 73728 52132 8940 17880 35760 71520 47716 108 216 432 864 1728 3456 6912 13824 27648 55296 15268 30536 61072 26820 53640 11956 23912 47824 324 648 1296 2592 5184 10368 20736 41472 82944 70564 45804 91608 87892 80460 65596 35868 71736 48148 972 1944 3888 7776 15552 31104 62208 29092 58184 2...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 43692 5 10 20 40 80 160 320 640 1280 2560 5120 10240 20480 40960 81920 76460 65540 43700 21 42 84 168 336 672 1344 2688 5376 10752 21504 43008 86016 84652 81924 76468 65556 43732 85 170 340 680 1360 2720 5440 10880 21760 43520 87040 86700 86020 84660 81940 76500 65620 43860 341 682 1364 2728 5456 10912 21824 43648 87296 87212 87044 86708 86036 84692 82004 76628 65876 44372 1365 2730 5460 10920 21840 43680 87360 87340 87300 87220 87060 867...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 45036 4036 8072 16144 32288 64576 43116 196 392 784 1568 3136 6272 12544 25088 50176 14316 28632 57264 28492 56984 27932 55864 25692 51384 16732 33464 66928 47820 9604 19208 38416 76832 67628 49220 12404 24808 49616 13196 26392 52784 19532 39064 78128 70220 54404 22772 45544 5052 10104 20208 40416 80832 75628 65220 44404 2772 5544 11088 22176 44352 2668 5336 10672 21344 42688 85376 84716 83396 80756 75476 64916 43796 1556 3112 6224 12448 ...", "0 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 49158 16402 32804 65608 49302 16690 33380 66760 51606 21298 42596 3278 6556 13112 26224 52448 22982 45964 10014 20028 40056 80112 78310 74706 67498 53082 24250 48500 15086 30172 60344 38774 77548 73182 64450 46986 12058 24116 48232 14550 29100 58200 34486 68972 56030 30146 60292 38670 77340 72766 63618 45322 8730 17460 34920 69840 57766 33618 67236 52558 23202 46404 10894 21788 43576 5238 10476 20952 41904 1894 3788 7576 15152 30304 60608..."]}

UNKNOWN

PYTHON3

CODEFORCES

1

d19a5d2d40c3191166b3cebf9ec2503a

The penguin's game

Pay attention: this problem is interactive. Penguin Xoriy came up with a new game recently. He has *n* icicles numbered from 1 to *n*. Each icicle has a temperature — an integer from 1 to 109. Exactly two of these icicles are special: their temperature is *y*, while a temperature of all the others is *x*<=≠<=*y*. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions. You are to find the special icicles. The first line contains three integers *n*, *x*, *y* (2<=≤<=*n*<=≤<=1000, 1<=≤<=*x*,<=*y*<=≤<=109, *x*<=≠<=*y*) — the number of icicles, the temperature of non-special icicles and the temperature of the special icicles. To give your answer to the penguin you have to print character "!" (without quotes), then print two integers *p*1, *p*2 (*p*1<=<<=*p*2) — the indexes of the special icicles in ascending order. Note that "!" and *p*1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately. Sample Input 4 2 1 2 1 1 Sample Output ? 3 1 2 3 ? 1 1 ? 1 3 ! 1 3

[ "import sys\r\n\r\nn, x, y = (int(x) for x in input().split())\r\nys = [y, x ^ y]\r\n\r\ndef ask(*bits):\r\n arr = [x for x in range(1, n + 1) if all(x & i == i for i in bits)]\r\n if len(arr) == 0:\r\n return 0\r\n print('?', len(arr), *arr)\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\ndiffs = []\r\ni = 1\r\nwhile i <= n:\r\n x = ask(i)\r\n if x in ys:\r\n diffs.append(i)\r\n i <<= 1\r\n\r\ni = diffs[-1]\r\nj = 1\r\nans2 = i\r\nwhile j <= n:\r\n if j != i:\r\n x = ask(i, j)\r\n if x in ys:\r\n ans2 |= j\r\n j <<= 1\r\n\r\nans1 = sum(diffs) ^ ans2\r\n\r\nprint('!', ans1, ans2)", "import sys, os\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef f(s):\r\n os.write(1, b\"%s %d %s\\n\" % (\"?\".encode(), len(s), \" \".join(map(str, s)).encode()))\r\n z = int(input())\r\n return z\r\n\r\nn, x, y = map(int, input().split())\r\nm = (n - 1).bit_length()\r\npow2 = [1]\r\nfor _ in range(m):\r\n pow2.append(2 * pow2[-1])\r\nu = []\r\nfor i in range(m):\r\n s, p = [], pow2[i]\r\n for j in range(n):\r\n if j & p:\r\n s.append(j + 1)\r\n z = f(s)\r\n u.append(0 if z == x or not z else 1)\r\nfor i in range(m):\r\n if u[i]:\r\n v, p = [], pow2[i]\r\n for j in range(n):\r\n if j & p:\r\n v.append(j + 1)\r\n break\r\nwhile len(v) ^ 1:\r\n m = len(v) // 2\r\n s, t = v[:m], v[m:]\r\n z = f(s)\r\n v = t if z == x or not z else s\r\np1 = v[0]\r\nj = p1 - 1\r\nm = (n - 1).bit_length()\r\nfor i in range(n):\r\n if (i + 1) == p1:\r\n continue\r\n ok = 1\r\n for k in range(m):\r\n pk = pow2[k]\r\n z = min((pk & i) ^ (pk & j), 1)\r\n if u[k] ^ z:\r\n ok = 0\r\n break\r\n if ok:\r\n p2 = i + 1\r\n break\r\nif p1 > p2:\r\n p1, p2 = p2, p1\r\nos.write(1, b\"%s %d %d\\n\" % (\"!\".encode(), p1, p2))\r\nexit()", "import random\r\n\r\ndef brute(L):\r\n P = [24, 384]\r\n res = 0\r\n for item in L:\r\n if item in P:\r\n res ^= Y[0]\r\n else:\r\n res ^= X[0]\r\n return res\r\n\r\nCNT = [0]\r\n\r\ndef query(L):\r\n CNT[0] += 1\r\n if CNT[0] > 19:\r\n assert False\r\n print(f\"? {len(L)} {' '.join(map(str, L))}\")\r\n res = int(input())\r\n # res = brute(L)\r\n # print(res)\r\n return res\r\n\r\ndef solve(L, x, y):\r\n # print(L, x, y)\r\n if len(L) == 1:\r\n return L[0]\r\n res = query(L[:len(L) // 2])\r\n if res == y or res == (x ^ y):\r\n return solve(L[:len(L) // 2], x, y)\r\n return solve(L[len(L) // 2:], x, y)\r\n\r\nn, x, y = map(int, input().split())\r\nX = [x]\r\nY = [y]\r\nL = list(range(1, n + 1))\r\n\r\n\r\nhistory = []\r\nwhile True:\r\n random.shuffle(L)\r\n res = query(L[:len(L) // 2])\r\n if res == y or res == (x ^ y):\r\n a = solve(L[:len(L) // 2], x, y)\r\n O = set(L[len(L) // 2:])\r\n for item in history:\r\n if a not in item:\r\n for val in item:\r\n if val in O:\r\n O.remove(val)\r\n else:\r\n bad = set()\r\n for val in O:\r\n if val not in item:\r\n bad.add(val)\r\n for val in bad:\r\n O.remove(val)\r\n b = solve(list(O), x, y)\r\n if b < a:\r\n a, b = b, a\r\n print(f\"! {a} {b}\")\r\n # print(CNT)\r\n break\r\n else:\r\n history.append(set(L[:len(L) // 2]))\r\n", "import sys\r\n\r\nn, x, y = map(int, input().split())\r\n\r\n# Ennyi bitet kell végigkérdezni.\r\nbits = len(bin(n))-2\r\n\r\n# Összes lehetséges index.\r\nindexes = list(range(1, n+1))\r\n\r\n# Rákérdez azokra az indexekre amiknek a mask bitjeinek a\r\n# helyén a pattern bitmintája van.\r\n# True -> Páratlan sok (1 db) speciális jégcsap van köztük.\r\n# False -> Páros sok (0 vagy 2 db) speciális jégcsap van köztük.\r\ndef mask_ask_odd(pattern, mask):\r\n ask = [i for i in indexes if (i & mask) == (pattern & mask)]\r\n if not ask:\r\n return False\r\n\r\n print(\"?\", len(ask), \" \".join(map(str, ask)))\r\n sys.stdout.flush()\r\n ans = int(input())\r\n\r\n if (ans == y) or (ans == x ^ y):\r\n return True\r\n else: # (ans == 0) or (ans == x)\r\n return False\r\n\r\n# Addig kérdezzük a biteket, amíg meg nem találunk egyet\r\n# amire páratlan sok a válasz. Tehát ebben a bitben\r\n# különbözik a két jégcsap indexe.\r\nfor curr_bit in range(bits):\r\n mask = 1 << curr_bit\r\n if mask_ask_odd(mask, mask):\r\n diff_bit = curr_bit\r\n break\r\n\r\n# Ettől a ponttól kezdve a diff_bit-et mindig felvesszük a maskokba\r\n# tehát a mask_ask_odd válasza mostmár:\r\n# True -> 1 db speciális jégcsap van köztük.\r\n# False -> 0 db speciális jégcsap van köztük.\r\n\r\n# Ezután visszamegyünk és végigkérdezzük újra az azonos biteket,\r\n# vagyis a közös postfixet helyreállítjuk:\r\npostfix = 0\r\nfor curr_bit in range(diff_bit):\r\n # Mask: diff_bit + a curr_bit-ig az összes bit.\r\n mask = (1 << diff_bit) | ((1 << curr_bit + 1)-1)\r\n # Pattern: diff_bit = 1 + az aktuálisan kérdezett bit\r\n # + az eddig helyreállított postfix.\r\n pattern = (1 << diff_bit) | (1 << curr_bit) | postfix\r\n if mask_ask_odd(pattern, mask):\r\n postfix |= (1 << curr_bit)\r\n\r\n# A közös postfix megvan, diff_bit-ben különböznek.\r\n# Innentől kezdve egymástól függetlenül állítjuk helyre\r\n# a bitjeiket a speciális jégcsapoknak.\r\npos1 = postfix\r\npos2 = (1 << diff_bit) | postfix\r\nfor curr_bit in range(diff_bit+1, bits):\r\n # Mask: curr_bit-ig az összes bit.\r\n mask = (1 << curr_bit+1)-1\r\n # Ha a curr_bit nem 0, akkor 1.\r\n if not mask_ask_odd(pos1, mask):\r\n pos1 |= (1 << curr_bit)\r\n # Ha a curr_bit nem 0, akkor 1.\r\n if not mask_ask_odd(pos2, mask):\r\n pos2 |= (1 << curr_bit)\r\n\r\nprint(\"!\", \" \".join(map(str, sorted([pos1, pos2]))))\r\n" ]

{"inputs": ["4 2 1 1 3", "6 1 2 5 6", "2 4523 4235 1 2", "511 42 1000000000 255 511", "666 536870911 268435455 13 133", "999 536870912 536870911 1 999", "1000 123 321 1 513", "1000 1000000000 1 36 1000", "1000 15 16 511 512", "1000 16 15 511 512", "50 276891238 128284616 2 28", "100 745880634 179094068 84 99", "150 481201317 787652038 49 147", "200 831819465 669375745 137 165", "250 417397044 277933714 112 160", "300 62982488 159657421 124 230", "350 208368580 768215391 71 135", "400 853954024 504714906 168 187", "450 999340115 553464364 29 66", "500 770616857 910894182 28 34", "550 593041285 200362966 227 454", "600 803748180 240123414 428 479", "650 626172608 824559494 22 607", "700 572038286 864319942 52 523", "750 394462715 858821430 416 471", "800 605169609 193549174 221 768", "850 427594038 483017958 161 779", "900 228235524 817745702 313 601", "950 195884145 107214487 556 781", "1000 748509283 888470689 243 289", "848 713949655 778798832 114 537", "604 992531203 77612090 299 432", "797 715823152 671392644 52 722", "553 289371996 115430093 378 501", "309 862920841 709210647 157 278", "65 731436981 448215393 6 36", "258 10018529 41995946 160 248", "14 878534670 486033396 9 10", "769 306859322 79813950 207 574", "386 429342362 484650952 98 278", "1000 305773675 363466523 207 616", "1000 483857099 231982664 254 465", "1000 661940523 365340020 211 899", "1000 545056651 233856160 468 617", "1000 723140075 807405005 214 824", "1000 901223500 380953849 759 768", "1000 79306924 249469990 25 477", "1000 962423052 528051538 122 771", "1000 140506476 251343486 136 325", "1000 309007679 492561550 536 647", "1000 1 2 341 682"], "outputs": ["Correct answer 1 3, queries: 4.", "Correct answer 5 6, queries: 5.", "Correct answer 1 2, queries: 2.", "Correct answer 255 511, queries: 17.", "Correct answer 13 133, queries: 18.", "Correct answer 1 999, queries: 19.", "Correct answer 1 513, queries: 19.", "Correct answer 36 1000, queries: 19.", "Correct answer 511 512, queries: 18.", "Correct answer 511 512, queries: 18.", "Correct answer 2 28, queries: 11.", "Correct answer 84 99, queries: 13.", "Correct answer 49 147, queries: 13.", "Correct answer 137 165, queries: 14.", "Correct answer 112 160, queries: 15.", "Correct answer 124 230, queries: 16.", "Correct answer 71 135, queries: 16.", "Correct answer 168 187, queries: 17.", "Correct answer 29 66, queries: 17.", "Correct answer 28 34, queries: 17.", "Correct answer 227 454, queries: 18.", "Correct answer 428 479, queries: 18.", "Correct answer 22 607, queries: 17.", "Correct answer 52 523, queries: 17.", "Correct answer 416 471, queries: 19.", "Correct answer 221 768, queries: 18.", "Correct answer 161 779, queries: 19.", "Correct answer 313 601, queries: 19.", "Correct answer 556 781, queries: 19.", "Correct answer 243 289, queries: 19.", "Correct answer 114 537, queries: 19.", "Correct answer 299 432, queries: 18.", "Correct answer 52 722, queries: 18.", "Correct answer 378 501, queries: 18.", "Correct answer 157 278, queries: 15.", "Correct answer 6 36, queries: 12.", "Correct answer 160 248, queries: 16.", "Correct answer 9 10, queries: 7.", "Correct answer 207 574, queries: 18.", "Correct answer 98 278, queries: 16.", "Correct answer 207 616, queries: 19.", "Correct answer 254 465, queries: 19.", "Correct answer 211 899, queries: 19.", "Correct answer 468 617, queries: 19.", "Correct answer 214 824, queries: 19.", "Correct answer 759 768, queries: 19.", "Correct answer 25 477, queries: 19.", "Correct answer 122 771, queries: 18.", "Correct answer 136 325, queries: 19.", "Correct answer 536 647, queries: 19.", "Correct answer 341 682, queries: 19."]}

UNKNOWN

PYTHON3

CODEFORCES

4

d1a4489d4ae1ae49f2006c2a331b20f2

Palindromic Cut

Kolya has a string *s* of length *n* consisting of lowercase and uppercase Latin letters and digits. He wants to rearrange the symbols in *s* and cut it into the minimum number of parts so that each part is a palindrome and all parts have the same lengths. A palindrome is a string which reads the same backward as forward, such as madam or racecar. Your task is to help Kolya and determine the minimum number of palindromes of equal lengths to cut *s* into, if it is allowed to rearrange letters in *s* before cuttings. The first line contains an integer *n* (1<=≤<=*n*<=≤<=4·105) — the length of string *s*. The second line contains a string *s* of length *n* consisting of lowercase and uppercase Latin letters and digits. Print to the first line an integer *k* — minimum number of palindromes into which you can cut a given string. Print to the second line *k* strings — the palindromes themselves. Separate them by a space. You are allowed to print palindromes in arbitrary order. All of them should have the same length. Sample Input 6 aabaac 8 0rTrT022 2 aA Sample Output 2 aba aca 1 02TrrT20 2 a A

[ "n = int(input())\r\nstring = input()\r\nchar = []\r\ncharPair = []\r\ncharImpair = []\r\nfor car in string:\r\n\tif car not in char:\r\n\t\tz = string.count(car)\r\n\t\twhile z>1:\r\n\t\t\tcharPair.append(car)\r\n\t\t\tz-=2\r\n\t\tif(z==1):\r\n\t\t\tcharImpair.append(car)\r\n\t\tchar.append(car)\r\nif len(charImpair) ==0 :\r\n\tString1 = ''\r\n\tfor x in charPair:\r\n\t\tString1+= x\r\n\tif len(charImpair) ==1 :\r\n\t\tString1 += charImpair[0]\r\n\tfor x in charPair[::-1]:\r\n\t\tString1 += x\r\n\tprint('1')\r\n\tprint(String1)\r\nelse :\r\n\tnbPalin = len(charImpair)\r\n\twhile len(charPair)%nbPalin != 0 : \r\n\t\tnbPalin += 2\r\n\t\tcharImpair.append(charPair[-1])\r\n\t\tcharImpair.append(charPair[-1])\r\n\t\tdel(charPair[-1])\r\n\tlenPalindrome = n/nbPalin\r\n\tPalin = []\r\n\tfor i in range(nbPalin):\r\n\t\tString2 = ''\r\n\t\tindice = i * int(((lenPalindrome-1)/2))\r\n\t\tfor x in charPair[indice : int(indice + ((lenPalindrome-1)/2))]:\r\n\t\t\tString2 += x\r\n\t\tString2 += charImpair[i]\r\n\t\tfor x in range(indice + int(((lenPalindrome-1)/2))-1, indice-1 ,-1): # charPair[i + int(((lenPalindrome-1)/2))-1: i-1 :-1]:\r\n\t\t\tString2 += charPair[x]\t\r\n\t\tPalin.append(String2)\r\n\t\t\r\n\tprint(nbPalin)\r\n\tString3 = ' '.join(Palin)\r\n\tprint(String3)\r\n\r\n\t", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n import collections\r\n\r\n n = int(input())\r\n s = input()\r\n alph = collections.Counter(s)\r\n odd = sum(x & 0x1 for x in alph.values())\r\n dq = collections.deque()\r\n if odd == 0:\r\n print(1)\r\n for c, x in alph.items():\r\n dq.append(c * (x >> 1))\r\n dq.appendleft(c * (x >> 1))\r\n print(*dq, sep=\"\")\r\n else:\r\n for odd in range(odd, n):\r\n if (n - odd) % (odd << 1) == 0:\r\n print(odd)\r\n odds = [c for c, x in alph.items() if x & 0x1]\r\n items = list(alph.items())\r\n while len(odds) != odd:\r\n for i, x in enumerate(items):\r\n if x[1] > 1:\r\n items[i] = (x[0], x[1] - 2)\r\n odds.append(x[0])\r\n odds.append(x[0])\r\n break\r\n req_length = (n - odd) // odd + 1\r\n cur_length = 0\r\n while odd > 0:\r\n if cur_length == 0:\r\n dq.append(odds[-1])\r\n cur_length += 1\r\n odds.pop()\r\n x = min(items[-1][1] >> 1, (req_length - cur_length) >> 1)\r\n dq.append(items[-1][0] * x)\r\n dq.appendleft(items[-1][0] * x)\r\n cur_length += x << 1\r\n if items[-1][1] - (x << 1) <= 1:\r\n items.pop()\r\n else:\r\n items[-1] = (items[-1][0], items[-1][1] - (x << 1))\r\n if cur_length == req_length:\r\n print(*dq, sep=\"\", end=' ')\r\n odd -= 1\r\n dq.clear()\r\n cur_length = 0\r\n print()\r\n break\r\n else:\r\n print(n)\r\n print(*s)\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "n=int(input())\r\ns=list(input())\r\nlets={}\r\nfor i in s:\r\n try:\r\n lets[i]+=1\r\n except:\r\n lets[i]=1\r\ncount=0\r\ncentre=[]\r\nrest=[]\r\nfor i in lets.keys():\r\n if(lets[i]%2):\r\n centre.append(i)\r\n count+=1\r\n rest+=[i]*(lets[i]//2)\r\nif(count==0):\r\n t=''\r\n for i in lets.keys():\r\n t=i*(lets[i]//2) + t + i*(lets[i]//2)\r\n print(1)\r\n print(t)\r\n \r\nelse:\r\n extra=0\r\n while(n%count!=0 or (n//count)%2==0):\r\n count+=2\r\n extra+=1\r\n for i in range(extra):\r\n centre+=[rest.pop()]*2\r\n amt=len(rest)//(count)\r\n temp=rest.copy()\r\n rest=''\r\n for i in temp:\r\n rest+=i\r\n print(count)\r\n print(rest[0:amt] + centre[0] + rest[(1)*(amt)-1::-1],end=' ')\r\n for i in range(1,count):\r\n print(rest[i*(amt):(i+1)*amt] + centre[i] + rest[(i+1)*(amt)-1:(i)*amt-1:-1],end=' ')\r\n print()", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\ndef get_ints():return map(int,input().split())\r\ndef get_int():return int(input())\r\ndef get_array():return list(map(int,input().split()))\r\ndef input():return sys.stdin.readline().strip()\r\n\r\n# for _ in range(int(input())):\r\n# n,k=get_ints()\r\n# a=get_array()\r\nn=int(input())\r\na=input()\r\nc=Counter(a)\r\na=list(a)\r\nans=0\r\nleft=[]\r\ntaken=[]\r\nfor i in set(a):\r\n if c[i]%2==1:\r\n left.append(i)\r\n if c[i]>1:\r\n taken.extend([i]*(c[i]//2))\r\n\r\n# print(taken,left)\r\nif len(taken)==0 and len(left)>0:\r\n print(len(left))\r\n print(*left)\r\nelif len(taken)>0 and len(left)==0:\r\n print(1)\r\n print(*taken,*taken[::-1],sep='')\r\nelse:\r\n lt=len(taken)\r\n ll=len(left)\r\n while(lt%ll!=0):\r\n lt-=1\r\n ll+=2\r\n for i in range(len(taken)-lt):\r\n z=taken.pop()\r\n left.append(z)\r\n left.append(z)\r\n \r\n lett=len(taken)//len(left)\r\n print(len(left))\r\n for i in range(len(left)):\r\n norm=taken[lett*i:lett*(i+1)]\r\n print(*norm,left[i],*norm[::-1],sep='',end=' ')", "mp,a,p={},[],[]\r\nn=int(input())\r\nfor i in input():\r\n if i in mp:mp[i]+=1\r\n else:mp[i]=1\r\nodd=0\r\nfor i in mp:\r\n if mp[i]&1:\r\n a.append(i)\r\n mp[i]-=1\r\n odd+=1\r\n if mp[i]:\r\n p.append(i)\r\nm=max(1,odd)\r\nfor i in range(m,n+1):\r\n if not n%i:\r\n d=n//i\r\n if odd and not d&1:continue\r\n print(i)\r\n for K in range(i-m):\r\n a.append(p[-1])\r\n if mp[p[-1]]>1:mp[p[-1]]-=1\r\n else:p.pop()\r\n for k in range(i):\r\n s=''\r\n for j in range(d//2):\r\n s+=p[-1]\r\n mp[p[-1]]-=2\r\n if not mp[p[-1]]:p.pop()\r\n if odd:print(s+a.pop()+s[::-1],end=' ')\r\n else:print(s+s[::-1],end=' ')\r\n exit()", "import sys\nfrom collections import Counter\n\n\ndef gen(counter, skip):\n for c, n in counter:\n has = n // 2\n if skip > has:\n skip -= has\n has = 0\n elif skip > 0:\n has -= skip\n skip = 0\n for i in range(has):\n yield c\n\n\ndef gen_o(counter, take):\n for c, n in counter:\n for i in range(n % 2):\n yield c\n for c, n in counter:\n has = (n // 2) * 2\n if take > has:\n take -= has\n elif take > 0:\n has = take\n take = 0\n for i in range(has):\n yield c\n\n\nN = int(next(sys.stdin))\n\ns = next(sys.stdin).strip()\nc = Counter(s)\n\neven = 0\nodd = 0\nitems = list(c.items())\nfor _, n in items:\n even += n // 2\n odd += n % 2\ngenerator = gen(items, 0)\ngenerator_o = gen_o(items, 0)\n\nodd_c = odd\nif odd == 0:\n print(1)\n front = [next(generator) for i in range(len(s) // 2)]\n fs = \"\".join(front)\n print(fs + fs[::-1])\nelse:\n skip = 0\n while even != 0 and even % odd != 0:\n skip += 1\n odd += 2\n even -= 1\n generator = gen(items, skip)\n generator_o = gen_o(items, skip * 2)\n print(odd)\n per = even // odd\n strs = []\n for i in range(odd):\n front = [next(generator) for i in range(per)]\n fs = \"\".join(front)\n strs.append(fs + next(generator_o) + fs[::-1])\n print(\" \".join(strs))\n" ]

{"inputs": ["6\naabaac", "8\n0rTrT022", "2\naA", "1\ns", "10\n6IIC6CCIIC", "20\nqqqoqqoqMoqMMMqqMMqM", "45\nf3409ufEFU32rfsFJSKDFJ234234ASkjffjsdfsdfsj33", "30\n8M8MMMMMlrMlMMrMMllMMrllMMrMrl", "40\nTddTddddTddddddTdddTdddddddddddddddddddd", "45\nRRNRRRRRRRRRNRRRRRRRRRRRRRRNRRRRRRRRRRRNRRRRR", "115\nz9c2f5fxz9z999c9z999f9f9x99559f5Vf955c59E9ccz5fcc99xfzcEx29xuE55f995u592xE58Exc9zVff885u9cf59cV5xc999fx5x55u992fx9x", "1\nz", "2\nff", "2\n9E", "3\nRRR", "3\n001", "3\n011", "3\n101", "3\n110", "3\n111", "3\n010", "3\n100", "1\na", "1\nA", "1\nZ", "1\n0", "1\n9"], "outputs": ["2\naba aca ", "1\n02TrrT20 ", "2\na A ", "1\ns ", "1\n6CCIIIICC6 ", "4\nMMMMM oqoqo qqMqq qqMqq ", "15\n202 323 343 393 4A4 FDF JEJ SFS dKd fUf fff fjf jkj srs sus ", "2\n8MMMMMMlMMMMMM8 MMlllrrrrrlllMM ", "8\nddTdd ddddd ddTdd ddTdd ddTdd ddTdd ddddd ddddd ", "1\nNNRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRNN ", "5\n22555555555555555555522 89999999999899999999998 999999EEVccEccVEE999999 ccccfffffffVfffffffcccc uuxxxxxxzzzzzzzxxxxxxuu ", "1\nz ", "1\nff ", "2\n9 E ", "1\nRRR ", "1\n010 ", "1\n101 ", "1\n101 ", "1\n101 ", "1\n111 ", "1\n010 ", "1\n010 ", "1\na ", "1\nA ", "1\nZ ", "1\n0 ", "1\n9 "]}

UNKNOWN

PYTHON3

CODEFORCES

6

d1a4bc4ff7233cca17c240867693a8ff

Slime Combining

Your friend recently gave you some slimes for your birthday. You have *n* slimes all initially with value 1. You are going to play a game with these slimes. Initially, you put a single slime by itself in a row. Then, you will add the other *n*<=-<=1 slimes one by one. When you add a slime, you place it at the right of all already placed slimes. Then, while the last two slimes in the row have the same value *v*, you combine them together to create a slime with value *v*<=+<=1. You would like to see what the final state of the row is after you've added all *n* slimes. Please print the values of the slimes in the row from left to right. The first line of the input will contain a single integer, *n* (1<=≤<=*n*<=≤<=100<=000). Output a single line with *k* integers, where *k* is the number of slimes in the row after you've finished the procedure described in the problem statement. The *i*-th of these numbers should be the value of the *i*-th slime from the left. Sample Input 1 2 3 8 Sample Output 1 2 2 1 4

[ "N = int(input())\r\nans = []\r\ni = 0\r\n\r\nwhile N >> i:\r\n if (N >> i) & 1:\r\n ans.append(i + 1)\r\n i += 1\r\n \r\nprint(*ans[::-1])", "n = int(input())\r\n\r\nslimes = [1] * n\r\ni = 0\r\n\r\nwhile i < len(slimes)-1:\r\n if slimes[i] == slimes[i+1]:\r\n slimes[i] += 1\r\n del slimes[i+1]\r\n i = max(i-1, 0) # Go back one position if necessary\r\n else:\r\n i += 1\r\n\r\nprint(*slimes)\r\n", "n=int(input())\r\nfor i in range(20,-1,-1):\r\n if(2**i<=n):\r\n print(i+1,end=' ')\r\n n-=2**i\r\n", "n=int(input())\r\nl=[]\r\nwhile n>0 :\r\n S=1\r\n k=1\r\n while S*2<=n :\r\n S=S*2\r\n k=k+1\r\n l.append(k)\r\n n=n-S\r\nprint(*l)\r\n \r\n \r\n\r\n \r\n", "n = int(input())\r\ni = 1\r\nres_board = []\r\nwhile i <= n:\r\n\tres_board.append(1)\r\n\twhile True:\r\n\t\tif len(res_board)>1:\r\n\t\t\tif res_board[-2] == res_board[-1]:\r\n\t\t\t\tres_board[-2] += 1\r\n\t\t\t\tres_board.pop(-1)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tbreak\r\n\ti += 1\r\n\r\nres_board = ' '.join([str(x) for x in res_board])\r\nprint(res_board)", "print(*[i+1 for i,x in enumerate(bin(int(input()))[2:][::-1])if x>'0'][::-1])", "n=int(input())\r\nl=[1]*n\r\nwhile len(l)!=len(set(l)):\r\n for i in range(len(l)-1):\r\n try:\r\n if l[i]==l[i+1]:\r\n l[i]=l[i]+1\r\n del l[i+1]\r\n except:\r\n break\r\n \r\nprint(*l)\r\n\r\n \r\n \r\n", "def main_function():\r\n n = int(input())\r\n slimes = []\r\n for i in range(n):\r\n slimes.append(str(1))\r\n for k in range(len(slimes) - 1):\r\n if int(slimes[-1]) == int(slimes[-2]):\r\n slimes.pop()\r\n slimes[-1] = str(int(slimes[-1]) + 1)\r\n else:\r\n break\r\n return \" \".join(slimes)\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def solution(n):\r\n # 1 1 1 1 1 1 1 1 \r\n # 2 1 1 1 1 1 1 \r\n # 2 2 1 1 1 1 \r\n # 3 1 1 1 1\r\n # 3 2 1 1\r\n # 3 2 2\r\n # 3 3\r\n # 4\r\n\r\n # 1 1 1 1 \r\n # 2 1 1 \r\n # 2 2\r\n # 3\r\n\r\n # 1 1 1\r\n # 2 1\r\n\r\n if n==1:\r\n return 1\r\n l1 = [1]\r\n i=0\r\n while i<n-1:\r\n l1.append(1)\r\n j=0\r\n while len(set(l1))!=len(l1):\r\n if l1.index(min(l1))<len(l1):\r\n if l1[l1.index(min(l1))]==l1[l1.index(min(l1))+1]:\r\n l1[l1.index(min(l1))]+=1\r\n l1.remove(min(l1))\r\n i+=1\r\n i=0\r\n c_out=\"\"\r\n while i<len(l1):\r\n c_out+=str(l1[i])\r\n i+=1\r\n if i!=len(l1):\r\n c_out+=\" \"\r\n return c_out\r\n\r\ndef answer():\r\n n = int(input())\r\n print(solution(n))\r\nanswer()", "def get(k):\n find = False\n for i in range(len(k)):\n if k[i] == 0:\n k[i] = 1\n break\n else:\n k[i] = 0\n else:\n k.append(1)\n return k\n\n\nn = int(input())\nk = []\nfor i in range(n):\n k = get(k)\nfor i in range(len(k) - 1, -1, -1):\n if k[i]:\n print(i + 1, end=' ')\n\n", "n = int(input())\r\nv = []\r\nfor i in range(0, n):\r\n v.append(1)\r\n while True:\r\n if len(v) > 1 and v[-1] == v[-2]:\r\n v.pop()\r\n v[-1] += 1\r\n else:\r\n break\r\nprint(*v)\r\n\r\n# ♥\r\n# امشب مهمون دارم\r\n", "n = int(input())\r\nslimes = list()\r\nfor _ in range(n):\r\n slimes.append(1)\r\n while len(slimes) > 1 and slimes[-1] == slimes[-2]:\r\n slimes.pop()\r\n slimes[-1] += 1\r\nprint(\" \".join(map(str, slimes)))\r\n", "arr=[0]\r\nn = int(input())\r\nfor _ in range(n):\r\n\tarr.append(1)\r\n\twhile arr[-2]==arr[-1]:\r\n\t\tarr.pop()\r\n\t\tarr[-1]+=1\r\nprint(*arr[1:])", "n = int(input())\r\nwhile n != 0:\r\n a = 1\r\n k = 0\r\n while a <= n:\r\n a *= 2\r\n k += 1\r\n a //= 2\r\n print(k,end=' ')\r\n n -= a", "a=bin(int(input()))[2:];b=len(a)\r\nfor i in range(b):\r\n if a[i]=='1':print(str(b-i),end=' ')", "n = int(input())\r\n\r\nslime = []\r\ni=1\r\nwhile n!=0:\r\n slime.append(1)\r\n while len(slime)>1 and slime[-1]==slime[-2]:\r\n slime[-2] = slime[-2] +1\r\n slime.remove(slime[-1])\r\n n=n-1\r\nprint(*slime)", "a=[0]\nfor _ in range(int(input())):\n\ta+=[1]\n\twhile a[-2]==a[-1]:\n\t\ta.pop()\n\t\ta[-1]+=1\nprint(*a[1:])\n", "n = int(input())\na = []\nfor i in range(0,n):\n a.append(1)\n while len(a)>1 and a[-1] == a[-2]:\n a.pop()\n a.append(a.pop()+1)\n\nprint(' '.join(str(j) for j in a))\n", "a = int(input())\nnum = 1\n# print(num)\nres = []\nfor i in bin(a)[2:][::-1]:\n # print(i)\n if i == '1':\n res.append(str(num))\n num += 1\nprint(' '.join(reversed(res)))\n", "# https://codeforces.com/problemset/problem/618/A\r\n\r\nn = int(input())\r\n\r\nstack = [1]\r\n\r\nfor i in range(1, n):\r\n if stack[-1] == 1:\r\n stack[-1] = 2\r\n while True:\r\n if len(stack) >= 2:\r\n last = stack.pop()\r\n if stack[-1] == last:\r\n stack[-1] = last + 1\r\n else:\r\n stack.append(last)\r\n break\r\n else:\r\n break\r\n else:\r\n stack.append(1)\r\nprint(*stack)\r\n", "def solve(r):\r\n ans=[]\r\n for i in range(30,-1,-1):\r\n if (r&(1<<i)) >0:\r\n ans.append(i+1)\r\n #return ans\r\n return ' '.join(str(i) for i in ans)\r\n\r\nr=int(input())\r\nprint(solve(r))\r\n", "import math\nn = int(input())\nans = [x+1 for x in range(n.bit_length(), -1, -1) if (n>>x)&1]\nfor x in ans:\n print(x, end = ' ')\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\n\r\nk = []\r\nfor i in range(0, n):\r\n k.append(1)\r\n while len(k) > 1 and k[-1] == k[-2]:\r\n k[-2] += 1\r\n del k[-1]\r\n\r\nfirst = True\r\nfor i in k:\r\n if first:\r\n first = False\r\n else:\r\n print(' ', end='')\r\n print(i, end='')\r\n", "dp = [[1]]\nfor i in range(2, 20):\n heh = []\n for elem in dp:\n x = [i] + elem\n heh.append(x)\n dp.append([i])\n dp += heh\nprint(*dp[int(input()) - 1])", "import sys\r\ninputNum = int(input())\r\noutputString = \"\"\r\nisFirst = True\r\nwhile inputNum > 0:\r\n combineTier = 1\r\n combineValue = 1\r\n while inputNum >= combineValue:\r\n combineTier = combineTier + 1\r\n combineValue = combineValue * 2\r\n combineTier = combineTier - 1\r\n combineValue = combineValue / 2\r\n inputNum = inputNum - combineValue\r\n if isFirst:\r\n outputString = outputString + str(combineTier)\r\n isFirst = False\r\n else:\r\n outputString = outputString + ' ' + str(combineTier)\r\nprint(outputString)", "def main():\n n, res, mask, x = int(input()), [], 1, 1\n while n >= mask:\n if n & mask:\n res.append(x)\n mask *= 2\n x += 1\n print(*[x for x in reversed(res) if x])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nl=[2**i for i in range(20)]\r\nwhile n>0:\r\n\tif n in l:\r\n\t\ti=l.index(n)\r\n\t\tprint(i+1)\r\n\t\tn=0\r\n\telse:\r\n\t\tl.append(n)\r\n\t\tl.sort()\r\n\t\ti=l.index(n)\r\n\t\tprint(i,end=\" \")\r\n\t\tl.remove(n)\r\n\t\tn-=2**(i-1)", "list=[0]\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n list.append(1) \r\n while list[len(list)-1]==list[len(list)-2]:\r\n del list[len(list)-2]\r\n list[len(list)-1]+=1\r\nfor i in range(1,len(list)):\r\n print(list[i],end=' ')\r\n\r\n \r\n \r\n", "n=int(input())\r\n\r\ntotal=0\r\nl=list()\r\nwhile(n):\r\n l.append(1)\r\n if len(l)>1:\r\n si=len(l)\r\n while(si!=1):\r\n if l[si-1]==l[si-2]:\r\n l[si-2]+=1\r\n l.pop(si-1)\r\n si-=1\r\n n-=1\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\r\na = []\r\nfor i in range(1,n+1):\r\n\ta.append(1)\r\n\twhile(len(a) > 1 and a[-1] == a[-2]):\r\n\t\tv = a.pop()\r\n\t\ta.pop()\r\n\t\ta.append(v+1)\r\nfor i in a:\r\n\tprint(i,end = \" \")", "n=int(input())\na=[0]*100\ntool = 1\na[0]=1\nf = 1\nfor i in range(1,n):\n \n a[tool]=1\n tool+=1\n f+=1\n if f==2:\n f=0\n tool-=1\n a[tool-1]=a[tool]+1\n c=0\n for j in range(tool-1,0,-1):\n if a[j]==a[j-1]:\n a[j-1]=a[j]+1\n c+=1\n else:\n break\n tool-=c\n else:\n pass\nprint(*a[:tool])\n", "n = int(input())\r\nx = bin(n)[2:]\r\nll = len(x)\r\nres = []\r\nfor i in range(ll):\r\n if x[i] == \"1\":\r\n res.append(str(ll - i))\r\nprint(\" \".join(res))", "n = int(input()); l = [1]; i = 1; cou = 0\r\nwhile cou < n-1: \r\n l.append(1); cou += 1\r\n while len(l) > 1 and l[i] == l[i-1]:\r\n l[i-1] = l[i] + 1\r\n l.pop(i); i = i-1\r\n i += 1\r\nprint(*l)", "import sys\n\nn = int(input(), 10)\nb = bin(n)\nl = len(b)\nfor i in b:\n\tif i == '1':\n\t\tprint(l, end=\"\")\n\t\tif l != 0:\n\t\t\tprint(' ', end=\"\")\n\tl = l-1\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/618/A\r\n\r\n# in: list of values in non-descending order, the value to search for\r\n# the first index to check between and the last index to check to\r\n# out: one index of value if it exists. If it does not, return -1\r\n# From: My Common Python Functions library\r\ndef binary_search_index_of(value, low, high):\r\n if low >= high:\r\n # if this is the value we're looking for, return it.\r\n if 2**((low + high) // 2) <= value:\r\n return (low + high) // 2\r\n elif 2**((low + high) // 2) > value:\r\n return (low + high) // 2 - 1\r\n else:\r\n # get the midpoint between the two functions\r\n mid = (low + high) // 2\r\n # if this is greater than value, search the left half\r\n if 2**mid > value:\r\n return binary_search_index_of(value, low, mid - 1)\r\n # if this is less than value, search the right half\r\n elif 2**mid < value:\r\n return binary_search_index_of(value, mid + 1, high)\r\n else:\r\n return mid\r\n\r\nn = int(input())\r\n\r\nc = n\r\nwhile c > 0:\r\n r = binary_search_index_of(c, 0, 100000)\r\n c -= 2**r\r\n print(r + 1, end = \" \")", "n = int(input())\r\np = 1\r\na = []\r\n\r\nwhile n:\r\n b = n & 1\r\n if b:\r\n a.append(p)\r\n p += 1\r\n n >>= 1\r\n\r\nprint(' '.join(map(str, reversed(a))))", "# A. Slime Combining\n\nn = int(input())\n\nans = list()\nfor _ in range(n):\n ans.append(1)\n try:\n while ans[-1] == ans [-2]:\n ans[-2] += 1\n ans.pop()\n except IndexError:\n pass\n\nprint(' '.join([str(x) for x in ans]))\n", "#!/usr/bin/python3\n\nimport sys\n\nn = int(sys.stdin.readline().rstrip())\n\nA = []\n\nfor i in range(n):\n A.append(1)\n while len(A) >= 2 and A[-1] == A[-2]:\n A.pop()\n A[-1] += 1\n\nprint(\" \".join(map(str, A)))\n", "n=bin(int(input()))[2:]\r\nfor i in range(len(n)):\r\n if int(n[i])==1:\r\n print(len(n)-i, end=' ')", "if __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n res = []\r\n while n:\r\n res.append(n%2)\r\n n //= 2\r\n\r\n #res.reverse()\r\n\r\n for i in range(len(res)):\r\n if res[i]:\r\n res[i] = i+1\r\n\r\n res.reverse()\r\n\r\n s = \"\"\r\n for ares in res:\r\n if ares:\r\n s += str(ares) + \" \"\r\n\r\n print(s.strip())", "n = int(input())\r\nx = bin(n)[2:]\r\nanswer = []\r\ncounter = 1\r\nfor i in x[::-1]:\r\n if i != \"0\":\r\n answer.append(str(int(i) * counter))\r\n counter += 1\r\nx = ''\r\nfor i in range(len(answer) - 1, -1, -1):\r\n x += answer[i] + \" \"\r\nprint(x)", "import math\r\n\r\nn = int(input())\r\nlist1 = [1]\r\nwhile n>0 :\r\n q = int(math.log(n,2))\r\n print(q+1, end=' ')\r\n n -= math.pow(2, q)", "n = int(input())\r\nl = []\r\ns = '{0:b}'.format(n)\r\nj = 0\r\n\r\nfor i in range(len(s), 0, -1):\r\n if s[j] == '1':\r\n l.append(i)\r\n\r\n j += 1\r\n\r\nprint(*l)", "n=int(input())\r\nl=[1]\r\nfor i in range(2,n+1):\r\n l.append(1)\r\n while l[-1]==l[-2]:\r\n p=l.pop()\r\n l.pop()\r\n l.append(p+1)\r\n if len(l)==1:\r\n break\r\nfor i in l:\r\n print(i,end=' ')", "n = int(input())\r\ncurr = 1\r\nresult = [] \r\n\r\nwhile n > 0:\r\n if n % 2 == 1:\r\n result.append(curr)\r\n n //= 2\r\n curr += 1\r\n\r\nprint(' '.join(map(str, result[::-1])))\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(1)\r\n while len(a) > 1 and a[-2] == a[-1]:\r\n a.pop()\r\n a.append(a.pop() + 1)\r\n\r\nprint(\" \".join(map(str, a)))", "n = int(input())\nres, i = [], 0\nwhile 1 << i <= n:\n if n & (1 << i) != 0:\n res.append(i + 1)\n i += 1\nres = reversed(res)\nprint(*res)\n", "n = int(input())\r\nb = list(bin(n)[2:])\r\nresult=''\r\nindices = []\r\nb.reverse()\r\nfor i in range(0, len(b)):\r\n if(b[i] == '1'):\r\n indices.append(i)\r\nindices.reverse()\r\nfor i in indices:\r\n result += str(i + 1) + ' '\r\nprint(result)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = []\r\nfor _ in range(n):\r\n ans.append(1)\r\n while len(ans) > 1 and not ans[-1] ^ ans[-2]:\r\n ans.pop()\r\n ans[-1] += 1\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\ncurr = [-7]\r\nfor i in range(n):\r\n curr.append(1)\r\n while curr[-1] == curr[-2]:\r\n curr[-2] += 1\r\n curr.pop()\r\nprint(' '.join(map(str, curr[1:])))", "n = int(input())\r\nfor i in range(20,-1,-1):\r\n\tif 2**i <= n:\r\n\t\tprint(i+1,end=\" \")\r\n\t\tn-=2**i", "num = int(input())\r\n\r\nvalue = []\r\n\r\nfor i in range(0,num):\r\n value.append(1)\r\n while len(value)>=2 and value[-1]==value[-2]:\r\n value[-2] += 1\r\n del value[-1]\r\n# The * symbol is used to print the list elements in a single line with space\r\nprint(*value)\r\n", "n=int(input())\r\nd={}\r\ni=1\r\nwhile(n>0):\r\n d[i]=n%2\r\n n=n//2\r\n i+=1\r\n \r\nfor i in reversed(sorted(d.keys())):\r\n if d[i]:\r\n print(i,end=' ')", "x=int(input())\r\nL=[1];\r\nfor i in range(2,x+1):\r\n L.append(1);\r\n a=len(L)-1;\r\n while(a>0):\r\n if L[a]==L[a-1]:\r\n L[a-1]=L[a]+1;\r\n L[a:a+1]=[];\r\n else:\r\n break\r\n a=len(L)-1;\r\n if a==0:\r\n break\r\nfor i in L:\r\n print(i,end=' ')\r\n", "a=int(input())\r\nb=[]\r\nc=0\r\nwhile(a>>c):\r\n \r\n if (a>>c & 1):\r\n \r\n b.append(c+1)\r\n c=c+1\r\nprint(*b[::-1])", "\r\nn = int(input())\r\narr = [1]\r\nfor i in range(1 ,n):\r\n arr.append(1)\r\n while (len(arr) > 1 and arr[-1] == arr[-2]):\r\n arr.pop()\r\n arr[-1] += 1\r\n\r\nprint(*arr)\r\n\r\n\r\n", "n=int(input())\r\nb=bin(n)[2:]\r\nx=b[::-1]\r\nl=[]\r\nfor i in range(len(b)):\r\n if(x[i]=='1'):\r\n l.append(i+1)\r\nprint(*l[::-1])\r\n", "n = int(input())\r\nar = list()\r\ni = int(1)\r\nwhile n != 0:\r\n if n % 2 != 0:\r\n ar.append(i)\r\n\r\n n //= 2\r\n i += 1\r\n\r\nar = ar[::-1]\r\nfor t in ar:\r\n print(t, end=' ')\r\n\r\n", "'''\nDavid Nelson\nsection EB1\n'''\n\n\nn = bin(int(input()))\nanswer = list()\n\nfor i in range( 2, len(n)):\n\tif n[-i+1] == '1':\n\t\tanswer.append(i-1)\n\t\t\nprint(' '.join( str(x) for x in reversed(answer)))\n\n\n", "def main():\n n = int(input())\n lst = list()\n for i in range(n):\n lst.append(1)\n cnt = len(lst)-1\n while cnt-1 >= 0 and lst[cnt-1] == lst[cnt]:\n lst[cnt-1] += 1\n del lst[cnt]\n cnt -= 1\n print(\" \".join(list(map(str, lst))))\nmain()\n \t \t\t\t\t \t \t \t \t\t \t \t\t\t", "n = int(input())\r\ns = bin(n)[2:]\r\nnum = len(s)\r\nfor f in s:\r\n if f == '1':\r\n print(num, end = ' ')\r\n num -= 1", "n = int(input()); l = [1]; cou = 0\r\nwhile cou < n-1: \r\n l.append(1); cou += 1\r\n while len(l) > 1 and l[-1] == l[-2]:\r\n l[-2] = l[-1] + 1\r\n l.pop()\r\nprint(*l)", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n ls.append(1)\r\n try:\r\n while ls[-2]==ls[-1]: ls[-2]+=1; ls = ls[:-1]\r\n except: pass\r\nfor j in ls: print(j, end=' ')\r\nprint()\r\n", "b = list(bin(int(input()))[2:])[::-1]\r\nout = list()\r\nfor i in range(len(b)):\r\n if b[i] == '1':\r\n out.append(i + 1)\r\nprint(\" \".join(map(str,out[::-1])))", "n = int(input())\nA = []\nwhile n > 0:\n if n % 2 == 0:\n A.append(0)\n n //= 2\n else:\n A.append(1)\n n -= 1\n n //= 2\nA = A[::-1]\nfor i in range(len(A)):\n if A[i] == 1:\n print(len(A) - i, end = ' ')", "n = int(input())\nfor i in reversed(range(21)):\n if n & (1 << i) != 0:\n print(i + 1, end=' ')", "n=int(input())\r\nl=[1]\r\nfor i in range(n-1):\r\n l.append(1)\r\n while len(l)>=2 and l[-1]==l[-2]:\r\n l.pop(-1)\r\n l[-1]+=1\r\nprint(' '.join(map(str,l)))", "n = int(input())\r\np = []\r\n\r\n\r\ndef zzip(p):\r\n while True:\r\n if len(p) < 2:\r\n return p\r\n sl = p.pop()\r\n slr = p.pop()\r\n if sl == slr:\r\n p.append(sl + 1)\r\n else:\r\n p.append(slr)\r\n p.append(sl)\r\n return p\r\n\r\n\r\nfor i in range(0, n):\r\n p.append(1)\r\n p = zzip(p)\r\n\r\nfor s in p:\r\n print(s, end=\" \")\r\n\r\n", "lst, n = [], int(input())\r\nfor x in range(n):\r\n lst.append(1)\r\n while len(lst) > 1 and lst[len(lst) - 1] == lst[len(lst) - 2]:\r\n lst.pop()\r\n lst[len(lst) - 1] += 1\r\nprint(*lst)", "#!/usr/bin/env python3\nn = int(input())\narr = []\n\nfor i in range(n):\n arr.append(1)\n while len(arr)>=2 and arr[-1] == arr[-2]:\n a, b = arr.pop(), arr.pop()\n arr.append(a+1)\n\nprint(' '.join(map(str, arr)))", "a = int(input())\nb = []\nfor i in range(a) :\n b.append(1)\n while True:\n if len(b) > 1 and b[-1] == b[-2]:\n b[-2] += 1\n del b[-1]\n else: break\nprint(*b)", "def lenOfList(list):\r\n sum=0\r\n for x in list:\r\n sum+=1\r\n return sum \r\nn=int(input())\r\nabdo=\"\"\r\nrow=[]\r\nif n==1:\r\n print (1)\r\nelse:\r\n row.append(1)\r\n while n>1:\r\n n-=1\r\n row.append(1)\r\n while row[-1]==row[-2]:\r\n row.append(row[-1]+1)\r\n row.remove(row[-2])\r\n row.remove(row[-2])\r\n if lenOfList(row)<2:\r\n break\r\n for x in row:\r\n abdo+=str(x)+\" \"\r\n print(abdo) \r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\ns=[]\r\nfor i in range(20,-1,-1):\r\n if n&(1<<i) >0:\r\n s+=[str(i+1)]\r\nprint(\" \".join(s))\r\n", "n = int(input())\r\np = []\r\nwhile n != 0:\r\n while len(p) >= 2 and p[-2] == p[-1]:\r\n p[-2] += 1\r\n p.pop()\r\n p.append(1)\r\n n -= 1\r\nwhile len(p) >= 2 and p[-2] == p[-1]:\r\n p[-2] += 1\r\n p.pop()\r\nprint(*p)\r\n \r\n", "def toBin(num):\r\n buf = ''\r\n while True:\r\n num, rest = num // 2, num - (num // 2 * 2)\r\n buf = str(rest)+buf\r\n if num == 0:\r\n break\r\n return int(buf)\r\n\r\n\r\ndef main():\r\n num = int(input())\r\n num_bin = toBin(num)\r\n num_bin_str = str(num_bin)\r\n num_bin_str_len = len(num_bin_str)\r\n solutions = []\r\n for pos in range(0, num_bin_str_len):\r\n if num_bin_str[pos] == \"1\":\r\n solutions.append(str(num_bin_str_len - pos))\r\n print(\" \".join(solutions))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\ns=bin(n)\r\ns=s[2:]\r\nfor i in range(len(s)):\r\n\tif s[i]=='1':\r\n\t\tprint(len(s)-i,end=\" \")", "def main():\r\n\tn = int(input())\r\n\tprint(*solver(n))\r\n\r\ndef solver(n):\r\n\ts = bin(n)[2:]\r\n\tresult = []\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] == '1':\r\n\t\t\tresult.append(len(s) - i)\r\n\treturn result\r\n\r\nmain()\r\n#print(*solver(11))", "from collections import deque\nfrom sys import stdin as fin\n# fin = open(\"wfr2016a.in\", \"r\")\n\nn = int(fin.readline())\nstack = deque()\n\nfor i in range(n):\n stack.append(1)\n # cur = 1\n while len(stack) > 1 and stack[-1] == stack[-2]:\n stack.pop(); stack.append(stack.pop() + 1)\n \nfor num in stack:\n print(num, end=' ')\n", "n = int(input())\n\nL = []\nfor i in range(n):\n L.append(1)\n while len(L) >= 2 and L[-1] == L[-2]:\n L.pop()\n L[-1] += 1\nprint(' '.join(str(i) for i in L))\n", "x = int(input())\nv = []\nwhile x > 0:\n w = len(bin(x)) - 2\n v.append(w)\n x -= 2 ** (w - 1)\nprint(*v)\n", "x=int(input())\ni=0\na=[]\nwhile x :\n i=i+1\n if x%2!=0:\n b=(x%2)*i\n a.append(b)\n x=x//2\n else:\n x=x//2\na.reverse()\nfor t in range (len(a)):\n print('{}'.format(a[t]))\n\n \t\t\t \t \t\t \t \t\t\t \t \t\t \t\t", "n=int(input())\r\nm=n\r\nS=1\r\nd=[]\r\nwhile m>=1:\r\n if m%2==0:\r\n m=m//2\r\n S=S+1\r\n else:\r\n d.append(S)\r\n S=S+1\r\n m=m//2\r\nfor i in range(1,len(d)+1):\r\n print(d[len(d)-i],end=\" \")", "import itertools\r\n\r\n\r\ndef combine(data):\r\n changed = True\r\n while changed:\r\n if len(data)>=2 and data[-1] == data[-2]:\r\n res = data[0:-2]\r\n res.append(data[-1] + 1)\r\n changed = True\r\n data = res\r\n #print(data)\r\n else:\r\n changed = False\r\n\r\n return data\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n data = [1]\r\n for i in range(2, n + 1):\r\n data.append(1)\r\n data = combine(data)\r\n print(\" \".join([str(d) for d in data]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = \"{:b}\".format(n)\r\nr = []\r\nfor i, c in enumerate(l):\r\n if c==\"1\":\r\n r += [str(len(l)-i)]\r\nprint(\" \".join(r))\r\n", "def main():\r\n from math import log2, floor\r\n n = int(input())\r\n result = []\r\n\r\n while n > 0:\r\n x = floor(log2(n))\r\n result += [str(x + 1)]\r\n n -= 2 ** x\r\n\r\n print(' '.join(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\narr=[0]*n\ni=1\nfor i in range(n):\n arr[i]=n%2\n n//=2\nfor j in range(i,-1,-1):\n if(arr[j]!=0):\n print(j+1,end=\" \")\n\t \t\t \t \t \t\t\t \t \t \t \t \t \t\t \t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n pot = [2**i for i in range(18)]\r\n n = int(wtf[0])\r\n ans = []\r\n while n > 0:\r\n for i,v in enumerate(pot):\r\n if n == v:\r\n n = 0\r\n ans.append(i+1)\r\n break\r\n elif n > v and n < pot[i+1]:\r\n ans.append(i+1)\r\n n -= v\r\n break\r\n print(' '.join(map(str, ans)))\r\n", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn=int(input())\r\na=[0]*10000000\r\ncnt=-1\r\nwhile(n):\r\n r=n%2\r\n n//=2\r\n cnt+=1\r\n a[cnt]=r\r\n\r\nfor i in range(cnt+1):\r\n if a[cnt-i]==1:\r\n print(cnt-i+1,end=' ')", "n = int(input())\r\ng = [1 for i in range(n)]\r\nif len(g) == 1 :\r\n\tprint(1)\r\n\texit()\r\n\r\nwhile True :\r\n\tchange = False\r\n\tl = g\r\n\t#print('l', *l)\r\n\tg = []\r\n\ti = 0\r\n\twhile i < len(l):\r\n\t\t#print('i', i)\r\n\t\tif i == len(l) - 1 or l[i] != l[i+1]:\t#last one\r\n\t\t\tg.append(l[i])\r\n\t\t\t#print('g', *g)\r\n\t\t\ti += 1\r\n\t\telse :\r\n\t\t\tg.append(l[i] + 1)\r\n\t\t\t#print('g', *g)\r\n\t\t\ti += 2\r\n\t\t\tchange = True\r\n\tif not change :\r\n\t\t#print('break')\r\n\t\tprint(*g)\r\n\t\texit()\r\n\t#print('g', *g)\r\n", "x=int(input())\r\na=[1]\r\nfor i in range(x-1):\r\n if a[len(a)-1]==1:\r\n a[len(a)-1]+=1\r\n while len(a)>1 and a[len(a)-1]==a[len(a)-2]:\r\n a.pop()\r\n a[len(a)-1]+=1\r\n else:\r\n a.append(1)\r\nfor i in a:\r\n print(i)\r\n", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n = int(inp())\r\n ans = []\r\n for i in range(20,-1,-1):\r\n if n & 1<<i:\r\n ans.append(str(i+1))\r\n print(' '.join(ans))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nstack = []\r\nfor i in range(n):\r\n stack.append(1)\r\n while len(stack) >= 2 and stack[-2] == stack[-1]:\r\n a = stack.pop()\r\n b = stack.pop()\r\n stack.append(a+1)\r\nprint(*stack)\r\n", "__author__ = 'Admin'\r\nn = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(1)\r\n for j in range(i):\r\n if m[len(m) - 1] == m[len(m) - 2] and len(m) > 1:\r\n m[len(m) - 2] += 1\r\n m.pop(m.index(m[len(m) - 1]))\r\n else:\r\n break\r\nprint(*m)", "n = int(input())\r\nli= []\r\nli.append(1)\r\nj = 1\r\nfor i in range(n-1):\r\n li.append(j)\r\n while len(li)>1:\r\n if li[-1]==li[-2]:\r\n li[len(li)-2]+=1\r\n li.pop(len(li)-1)\r\n else:\r\n break\r\nprint(*li)\r\n", "\n\n#~ import io\n#~ import sys\n\n#~ test = '1'\n#~ test = '2'\n#~ test = '3'\n#~ test = '8'\n\n#~ sys.stdin = io.StringIO(test)\n\nn = int(input())\n\na = []\ndef simplify(a):\n if len(a)<=1:\n return\n if a[-2]==a[-1]:\n del a[-1]\n a[-1] += 1\n simplify(a)\n \nfor i in range(n):\n a.append(1)\n simplify(a)\n \n\nprint(\" \".join(map(str,a)))\n", "n = int(input())\r\na = []\r\nwhile n > 0:\r\n a.append(n % 2)\r\n n //= 2\r\nfor i in range(len(a) - 1, -1, -1):\r\n if a[i] == 1:\r\n print(i + 1, end=' ')", "print(\" \".join([str(v+1)for v,k in enumerate(bin(int(input()))[::-1])if k==\"1\"][::-1]))", "n=int(input())\r\n\r\na=str(bin(n)[2:])\r\nb=a[::-1]\r\nt=[]\r\n\r\nfor k in range(len(a)):\r\n if b[k]=='1':\r\n t.append(k+1)\r\n\r\nprint(*t[::-1])\r\n \r\n", "n = int(input())\r\np = []\r\n\r\nfor i in range(n):\r\n p.append(1)\r\n try:\r\n while p[-1] == p[-2]:\r\n p[-2] += 1\r\n del p[-1]\r\n except:\r\n pass\r\n\r\nfor k in p[:-1]:\r\n print(k, sep=' ', end=' ')\r\nprint(p[-1])\r\n", "n = int(input())\r\na = [2 ** i for i in range(20)]\r\nans = []\r\n#print(a)\r\nwhile n > 0:\r\n for i in range(19, -1, -1):\r\n if n >= a[i]:\r\n print(i + 1, end=' ')\r\n n -= a[i]\r\n break\r\n", "n=int(input())\r\nfor i in range(16,-1,-1):\r\n if(n>=2**i):\r\n n-=2**i\r\n print(i+1,end=' ')", "n = int(input())\r\nwindow = []\r\nwhile n > 0:\r\n window.append(1)\r\n n -= 1\r\n while len(window) > 1 and window[-1] == window[-2]:\r\n window[-2] += 1\r\n window.pop()\r\nprint(' '.join(map(str, window)))\r\n", "v = []\r\nfor i in range(int(input())):\r\n v.append(1)\r\n while (len(v) >= 2 and v[-1] == v[-2]):\r\n v.pop()\r\n v[-1] += 1\r\nprint(' '.join(map(str, v)))", "def deep(n):\n if n != 0:\n i = 0\n while n > 2**i:\n i += 1\n if n == 2**i:\n print(i+1)\n else:\n print(i, end=' ')\n n -= 2**(i-1)\n deep(n)\n\nn = int(input())\ndeep(n)\n", "from collections import deque\r\nn = int(input())\r\ndata = deque([1])\r\nwhile n > 1:\r\n data.append(1)\r\n n -= 1\r\n while len(data) > 1 and data[-1] == data[-2]:\r\n help = data[-1] + 1\r\n data.pop()\r\n data.pop()\r\n data.append(help)\r\nprint(*list(data))", "n = int(input())\nl = []\nfor i in range(n):\n l.append(1)\n while len(l) > 1 and l[-1] == l[-2]:\n l.pop()\n l[-1] += 1\nprint(*l)", "import math\r\nn=int(input())\r\ndef func(n,op):\r\n if n==1:\r\n op.append(1)\r\n return(op)\r\n elif n==2:\r\n op.append(2)\r\n return op\r\n elif math.log(n,2)%1==0:\r\n op.append(int(math.log(n,2)+1))\r\n return op\r\n else:\r\n op.append(int(math.log(n,2)+1))\r\n n-=2**(int(math.log(n,2)))\r\n return func(n,op)\r\nop=(func(n,[]))\r\nfor j in op:\r\n print(j,end=' ')\r\n", "n=int(input());i=0;a=[]\r\nwhile(n!=1):\r\n i+=1\r\n if n%2:a.insert(0,i)\r\n n=n//2\r\na.insert(0,i+1)\r\nprint(*a)", "def solve(l):\r\n\tif(len(l)>1 ):\r\n\t\tif(l[-1]==l[-2]):\r\n\t\t\ta=l[-1]\r\n\t\t\tl.pop()\r\n\t\t\tl.pop()\r\n\t\t\tl.append(a+1)\r\n\r\n\t\tif(len(l)!=len(set(l))):\r\n\t\t\tl=solve(l)\r\n\t\t\treturn l\r\n\t\telse:\r\n\t\t\treturn l\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(1)\r\n\tif(len(l)!=len(set(l))):\r\n\t\tl=solve(l)\r\n\r\nprint(*l)\r\n\r\n\r\n", "n = int(input())\r\nl = [1]\r\nfor i in range(1,n):\r\n\tl.append(1)\r\n\tfor j in range(len(l)):\r\n\t\tif len(l)>1 and l[-1]==l[-2] : \r\n\t\t\tl[-2]=l[-2]+1 \r\n\t\t\tl.pop(-1)\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(*l)", "def answer(n):\r\n x=[]\r\n while(n!=0):\r\n temp=n%2\r\n n//=2\r\n x.append(temp)\r\n for i in reversed(range(len(x))):\r\n if x[i]==1:\r\n print(i+1,end=' ')\r\nn=int(input())\r\nanswer(n)", "import math\r\n\r\nn = int(input())\r\narr = []\r\nwhile n != 0:\r\n bass = math.floor(math.log(n, 2)) + 1\r\n arr.append(bass)\r\n n -= 2 ** (bass - 1)\r\n\r\nprint(*arr)", "n = int(input())\r\nans = []\r\nst = 1\r\nfor i in range(n):\r\n ans.append(1)\r\n while len(ans) > 1 and ans[-1] == ans[-2]:\r\n ans[-2] += 1\r\n ans.pop()\r\nprint(*ans)", "n = int(input())\nb = bin(n)[2:]\n\nl = []\nfor i, c in enumerate(b):\n if c == '1':\n l.append(len(b) - i)\n\nprint(' '.join(map(str, l)))\n", "n = int(input())\r\nk = bin(n)[2::]\r\nmas = []\r\nl = len(k)\r\nfor a in range(l):\r\n if k[a] == \"1\":\r\n mas.append(str(l - a))\r\nprint(\" \".join(mas))", "n = int(input())\r\ns = bin(n)[2:]\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n print(len(s) - i, end = ' ')", "n=int(input())\r\nb=list(bin(n))[2:]\r\nb.reverse()\r\ns=str()\r\nfor i in range(len(b)):\r\n if b[i]==\"1\":\r\n s=str(i+1)+\" \"+s\r\nprint(s)", "n = int(input())\r\nres = []\r\nwhile n > 0:\r\n res.append(n%2)\r\n n//=2\r\nans=[]\r\nfor i in range(len(res)):\r\n if(res[i])>0:\r\n ans.append(i+1)\r\nans.reverse()\r\nprint(' '.join(map(str, ans)))\r\n\r\n", "n = int(input())\n\nv = []\nfor i in range(n):\n v.append(1)\n\n while len(v) >= 2 and v[-2] == v[-1]:\n x = v.pop()\n v.pop()\n v.append(x+1)\n\nprint(' '.join([str(x) for x in v]))\n\n", "ans = []\r\nn = int(input())\r\nfor i in range(n):\r\n if(len(ans) == 0):\r\n ans.append(1)\r\n else:\r\n ans.append(1)\r\n for j in range(len(ans)-1, 0, -1):\r\n if ans[j] == ans[j-1]:\r\n ans.pop()\r\n ans[-1] += 1 \r\nprint(*ans)", "A = [i for i, ch in enumerate(reversed(bin(int(input()))), 1) if ch == '1']\r\nprint(*reversed(A))", "n=int(input())\r\nk=[1]*n\r\nwhile len(list(set(k)))!=len(k):\r\n i=0\r\n while i<(len(k)-1):\r\n if k[i]==k[i+1]:\r\n m=k[i]\r\n del k[i:i+2]\r\n k.insert(i,m+1)\r\n i+=1\r\n else:\r\n i+=1\r\nprint(*k) \r\n", "n = int(input())\r\nbinaryNum = bin(n)\r\nn = binaryNum[2:]\r\nle = len(str(n))\r\nans = []\r\nfor i in map(int, str(n)):\r\n if i == 1:\r\n ans.append(le)\r\n le -= 1\r\n\r\nprint(*ans)", "n = int(input())\r\n\r\ndef rec(l):\r\n\r\n while l[-1] == l[-2]:\r\n l[-2] += 1\r\n l.pop()\r\n return l\r\n\r\nres = [0]\r\nfor i in range(n):\r\n res.append(1)\r\n res = rec(res)\r\n\r\nprint(\" \".join(map(str, res[1:])))", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Jan 29 17:33:10 2016\n\n@author: kebl4230\n\"\"\"\n\nn = int(input())\nmylist = []\n\ndef RecursiveDivision(new_n, mylist):\n mylist.append(new_n % 2)\n nn = int(new_n / 2)\n if nn > 0:\n RecursiveDivision(nn, mylist)\n else:\n return mylist\n\nRecursiveDivision(n, mylist)\nmylist.reverse()\nmystring = str()\nN = len(mylist)\nfor num in mylist:\n for repeat in range(num):\n mystring += str(N) + \" \"\n N -= 1\nprint(mystring)", "n = int(input())\nprint(' '.join(str(i + 1) for i in range(20, -1, -1) if (n & (1 << i))))", "def Inspect():\r\n global Slice\r\n k = len(Slice)\r\n for i in range(k):\r\n if Slice[i] != -1:\r\n Slice.append(Slice[i])\r\n Slice = Slice[k:]\r\n for i in range(len(Slice)-1):\r\n if Slice[i] == Slice[i+1]:\r\n return False\r\n return True\r\nn = int(input())\r\nSlice = [1] * n\r\nwhile not(Inspect()):\r\n for i in range(len(Slice)-1):\r\n if Slice[i] == Slice[i+1]:\r\n Slice[i+1] = Slice[i] + 1\r\n Slice[i] = -1\r\n Inspect()\r\nprint(*Slice)", "n = int(input())\r\npodokonnik = []\r\nwhile n > 0:\r\n podokonnik.append(1)\r\n while len(podokonnik) >= 2 and podokonnik[-1] == podokonnik[-2]:\r\n podokonnik[-2] = podokonnik[-2] + 1\r\n podokonnik.pop()\r\n n -= 1\r\nfor elem in podokonnik:\r\n print(elem, end=\" \")\r\n", "x = int(input())\r\nt = 0\r\nr = []\r\nt1 = 0\r\nwhile t != x:\r\n\tr.append(1)\r\n\t# if t>=1:\r\n\tif len(r)>1:\r\n\t\tt1 = len(r)\r\n\t\tfor i in range(t1):\r\n\t\t\t# print(r)\r\n\t\t\tif len(r) == 1:\r\n\t\t\t\tcontinue\r\n\t\t\tif r[len(r)-1] == r[len(r)-2]:\r\n\t\t\t\tr[len(r)-2] = r[len(r)-2] + 1\r\n\t\t\t\tif len(r) == 1:\r\n\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tr.pop(len(r)-1)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\tt = t + 1\r\n# if len(r) == 1:\r\n# \tprint(\"1\")\r\n# \t# print(\"H\")\r\n# print(r)\r\nfor i in range(len(r)):\r\n \tprint(r[i])", "n = int(input())\r\nans = []\r\nwhile n > 0:\r\n t, k = 1, 1\r\n while t * 2 <= n:\r\n t *= 2\r\n k += 1\r\n ans.append(k)\r\n n -= t\r\nfor e in ans:\r\n print(e, end=' ')", "n=int(input())\r\nbit=bin(n)[2:]\r\nv=[]\r\nl=len(bit)\r\nfor i in range(l):\r\n if bit[l-i-1]=='1':\r\n v.append(i+1)\r\nv.reverse()\r\nprint(' '.join(map(str,v)))", "n=int(input())\r\na,d=[n%2],n//2\r\nwhile d>0:\r\n\ta.insert(0,d%2)\r\n\td=d//2\r\nl=len(a)\r\nfor x in range(l):\r\n\tif a[x]==1:print(l-x,end=\" \")", "n = int(input()) - 1\r\na = [1]\r\nwhile n > 0:\r\n n -= 1\r\n a.append(1)\r\n while a[-2] == a[-1]:\r\n del a[-1]\r\n a[-1] += 1\r\n if len(a) == 1:\r\n break\r\nprint(*a)\r\n", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n a=[]\n n=I()\n for i in range(n):\n x=1\n while True:\n if len(a)>0:\n y=a.pop()\n if y==x:\n x+=1\n else:\n a.append(y)\n a.append(x)\n break\n else:\n a.append(x)\n break\n # print(a)\n\n return ' '.join(str(x) for x in a)\n\n# main()\nprint(main())\n", "l = [0] + list(reversed(bin(int(input()))))\r\nfor i in range(len(l)-2,0,-1):\r\n if l[i] == '1':\r\n print(i,end=' ')\r\n\r\n \r\n\r\n \r\n", "#!/usr/bin/python3\n\nn = int(input())\nb = [i for i in str(bin(n))]\nb = b[2:]\nb = list(map(int, b))\n\nl = len(b)\ni = 0\nwhile i < l:\n b[i] = b[i] * (l-i)\n i += 1\n\nfor i in b:\n if i != 0:\n print(str(i), end=\" \")\n", "#IN THE NAME OF GOD\na=int(input())\nb=bin(a)\ni=2\nwhile i<len(b):\n if b[i]=='1':\n print( len(b)-i,end=\" \")\n i+=1\n\n", "n = int(input())\narr = [1]\nfor i in range(1, n):\n\tarr.append(1)\n\twhile (len(arr) > 1 and arr[-1] == arr[-2]):\n\t\tarr.pop()\n\t\tarr[-1]+=1\nprint(*arr)", "n=int(input());v=[]\r\nt=0;s=\"\"\r\nwhile (n!=0):\r\n s+=str(n%2)\r\n n//=2\r\nfor i in range(len(s)):\r\n if (s[i]==\"1\"):\r\n v.append(i+1)\r\nfor i in range(len(v)-1,-1,-1):\r\n print(v[i],end=\" \")\r\n", "n = int(input())\r\narr = [1]\r\nfor i in range(n-1):\r\n arr.append(1)\r\n while len(arr)>=2 and arr[-1]==arr[-2]:\r\n arr[-2] += 1\r\n del arr[-1]\r\nprint(*arr)", "import math\r\na=[]\r\nn=int(input())\r\namari=n\r\nwhile amari != 0:\r\n a.append(math.floor(math.log(amari,2))+1)\r\n amari -= 2**math.floor(math.log(amari,2))\r\n\r\nprint(' '.join(map(str,a)))", "def bina(x):\r\n ret = \"\"\r\n while(x>0):\r\n ret = str(x%2)+ret\r\n x = x//2\r\n return ret\r\n\r\na = int(input())\r\nb = bina(a)\r\nl = len(b)\r\nprint(l-b.find(\"1\"), end=\"\")\r\nfor i in range(b.find(\"1\")+1, l):\r\n if b[i:i+1] == \"1\":\r\n print(\" \"+str(l-i), end = \"\")\r\n\r\n", "n = int(input())\nres = n\ncurrent = 1\ncurrent_idx = 1\nans = []\nwhile res >= current:\n if res & current == current:\n ans.append(current_idx)\n current *= 2\n current_idx += 1\nprint(' '.join([str(i) for i in ans[::-1]]))\n", "k=int(input())\r\na=[0]\r\ni=0\r\nwhile(i<k):\r\n a.append(1)\r\n while a[len(a)-1]==a[len(a)-2]:\r\n a.remove(a[len(a)-1])\r\n a[len(a)-1]+=1\r\n i+=1;\r\nfor i in range(1,len(a)):\r\n print(a[i],end=\" \")", "n = int(input())\nans = []\ntarget = bin(n)[2:][::-1]\nfor i in range(len(target)):\n if target[i] == '1':\n ans.append(i + 1)\nprint(*ans[::-1])", "from collections import deque\r\n\r\ndef clean(d):\r\n while len(d) > 1 and d[-1] == d[-2]:\r\n d.pop()\r\n d[-1] += 1\r\n \r\nn = int(input())\r\nd = deque([])\r\nfor _ in range(n):\r\n d.append(1)\r\n clean(d)\r\n\r\nprint(\" \".join(str(x) for x in d))", "def main():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(1)\r\n while len(a) > 1 and a[-1] == a[-2]:\r\n a.pop()\r\n a[-1] += 1\r\n \r\n print(' '.join(str(i) for i in a))\r\n\r\n\r\nmain()", "n=int(input())\r\n\r\nfor i in range(20,-1,-1):\r\n\tif n>=2**i:\r\n\t\tprint(i+1, end=\" \")\r\n\t\tn-=2**i\r\n\tif not n:\r\n\t\tbreak\r\n#Needed HELP!!", "n = int(input())\n\nimport math\nres = []\nwhile n>0:\n i = math.floor(math.log(n,2))\n n -= 2**i\n res.append(i+1)\nprint(*res)", "n = int(input())\nout = []\ncur = 1\nwhile n > 0:\n if n % 2 == 1:\n out.append(cur)\n cur += 1\n n //= 2\nfor v in reversed(out):\n print(v, end=' ')\nprint()\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn=int(input())\r\nx=bin(n)\r\nx=x[2:]\r\nx=x[::-1]\r\na=[]\r\nl=len(x)\r\nfor i in range(l):\r\n\tif x[i]==\"1\":\r\n\t\ta.append(i+1)\r\na=a[::-1]\r\nprint(*a,sep=\" \")\t\t", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\nl = []\n\nwhile n > 0:\n i = 0\n while pow(2, i) <= n:\n i += 1\n\n l.append(i)\n n -= pow(2, i-1)\n\nfor e in l:\n print(e, end=\" \")\nprint()\n", "n=int(input())\r\nl=[1]\r\nfor i in range(2,n+1):\r\n l+=[1]\r\n while len(l)>=2:\r\n if l[-1]==l[-2]: l=l[:-2]+[l[-1]+1]\r\n else: break\r\nprint(' '.join(map(str,l)))", "n = int(input())\r\n\r\nif n < 1 or n > 100000:\r\n raise ValueError(\"Invalid number of slugs\")\r\n\r\nn -= 1\r\nv = [1]\r\n\r\nfor i in range(n):\r\n v.append(1)\r\n while len(v) > 1:\r\n current = len(v) - 1\r\n previous = current - 1\r\n if v[current] != v[previous]:\r\n break\r\n temp = v[current]\r\n v.pop()\r\n v.pop()\r\n v.append(temp + 1)\r\nprint(*v)# 1698363740.699369", "from math import *\r\nx = int(input())\r\nwhile x>0:\r\n print(floor(log2(x))+1,end=' ')\r\n x-=pow(2,floor(log2(x)))\r\nprint()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=bin(int(input()))[:1:-1]\r\nb=[i+1 for i in range(len(a))if a[i]=='1']\r\nprint(' '.join(map(str,b[::-1])))\r\n", "from collections import deque\r\n\r\nSize = int(input())\r\nList = deque()\r\nfor i in range(Size):\r\n List.append(1)\r\n while True:\r\n if len(List) > 1 and List[-1] == List[-2]:\r\n List.pop()\r\n List[-1] += 1\r\n else:\r\n break\r\nprint(*List)\r\n", "s = bin(int(input()))[2:]\nsol = []\nfor i, j in enumerate(s):\n if j == \"1\":\n sol.append(str(len(s) - i))\nprint(\" \".join(sol))\n \n", "n = int(input())\nans = []\nfor _ in range(n):\n ans.append(1)\n while len(ans) >= 2 and ans[-1] == ans[-2]:\n ans[-2] += 1\n ans.pop()\nprint(*ans)", "def solve(n):\n a = [1]\n n -= 1\n while n:\n a.append(1)\n while len(a) >= 2 and a[-1] == a[-2]:\n a[-1] = a.pop() + 1\n n -= 1\n return ' '.join(map(str, a))\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "n, s = int(input()), []\r\nfor i in range(20, -1, -1):\r\n if 2 ** i <= n:\r\n s.append(i + 1)\r\n n -= 2 ** i\r\nprint(*s)", "n = int(input())\r\nk = []\r\nfor x in range(n):\r\n k.append(1)\r\n while len(k) >= 2 and k[-2] == k[-1]:\r\n k.pop()\r\n k[-1] += 1\r\nprint(\" \".join(map(str, k)))", "n=int(input())\r\nbit=[]\r\nwhile n>0:\r\n bit.append(n%2)\r\n n//=2\r\nv=[]\r\nfor i in range(len(bit)):\r\n if bit[i]>0:\r\n v.append(i+1)\r\nv.reverse()\r\nprint(' '.join(map(str,v)))", "if __name__ == '__main__':\r\n num = str(bin(int(input()))).replace('0b', '')\r\n size = len(num)\r\n line = list()\r\n for i in range(size):\r\n if num[i] == '1':\r\n line.append(str(size - i))\r\n print(' '.join(line))\r\n", "n = int(input())\r\nslimes = []\r\nfor x in range(n):\r\n slimes.append(1)\r\n while len(slimes) >= 2 and slimes[-1] == slimes[-2]:\r\n a = slimes[-1]\r\n del slimes[-1], slimes[-1]\r\n slimes.append(a + 1)\r\nprint(\" \".join(map(str, slimes)))", "s = bin(int(input()))[2:]\r\nfor i, x in enumerate(s):\r\n if x == '1':\r\n print(len(s)-i, end=' ')\r\n", "n=int(input())\n\ns=bin(n)[2:]\nl=len(s)\nlst=[]\nfor i in range(l):\n\tif s[i]=='1':\n\t\tprint((l-i), end=' ')", "import sys\r\nimport math\r\n\r\ndef good(n):\r\n\twhile n%2==0:\r\n\t\tn/=2\r\n\tif n==1:\r\n\t\treturn True\r\n\telse :\r\n\t\treturn False\r\n\r\narr={1:[1],}\r\nt=2\r\nwhile t<100005:\r\n\tarr[t]=[]\r\n\tif good(t):\r\n\t\tarr[t]=[int(math.log2(t))+1]\r\n\telse:\r\n\t\ttmp=2**(int(math.log2(t)))\r\n\t\tarr[t]=arr[tmp]+arr[t-tmp]\r\n\tt=t+1\r\n\r\nfor line in sys.stdin:\r\n\tn=line.split()\r\n\ta=int(n[0])\r\n\tfor i in arr[a]:\r\n\t\t# print(\"debug\")\r\n\t\tprint(i,end=\" \")\r\n\t\r\n\r\n\r\n\r\n", "\r\ndef solve():\r\n n = bin(int(input()))[-1:1:-1]\r\n b = [i + 1 for i in range(len(n)) if n[i] == '1']\r\n\r\n print(' '.join(map(str, b[::-1])))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "temp=int(input())\r\nq=1\r\noutstr=\"\"\r\nif temp>1:\r\n z=temp\r\n while z>1:\r\n z=temp//2\r\n y=temp%2\r\n if y > 0:\r\n outstr = str(q) + \" \" + outstr\r\n q+=1\r\n temp=z\r\n \r\n outstr = str(q) + \" \" + outstr\r\nelse:\r\n outstr = str(q)\r\n\r\nprint(outstr) ", "import sys\n\ndef main():\n n = int(sys.stdin.readline())\n if n < 3:\n return [n]\n \n arr = []\n c = 0\n\n while n:\n c, a = helper(n)\n n -= a\n arr.append(c)\n return arr\n\ndef helper(n):\n if n == 0:\n return 0, 0\n elif n == 1:\n return 1, 1\n c = 0\n a = 1\n while a < n+1:\n a <<= 1\n c += 1\n a >>= 1\n return c, a\n\n\n\nprint(*main())", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn = int(input())\r\nL = []\r\nr = 1\r\nct = 1\r\nwhile n >= r :\r\n if (n & r > 0) : L.append(ct)\r\n r *= 2\r\n ct += 1\r\n\r\nL.reverse()\r\nprint(' '.join(map(str, L)))\r\n\r\n", "n = int(input())\r\npower = [1] * 100\r\nfor i in range(1, 100):\r\n power[i] = power[i - 1] * 2\r\nanswer = []\r\na = 99\r\nwhile n > 0:\r\n if n >= power[a]:\r\n n -= power[a]\r\n answer.append(a + 1)\r\n a -= 1\r\nprint(*answer)", "n= int(input(''))\r\na= []\r\nwhile n>0:\r\n a.append(n-2*int(n/2))\r\n n= int(n/2)\r\nn= len(a)\r\ns= ''\r\nwhile n>0:\r\n n-= 1\r\n for i in range(a[n]):\r\n s+= str(n+1)+' '\r\nprint(s[0:-1])", "n = int(input())\ns = bin(n)\ns = s[2:]\nk = len(s)\nfor i, x in enumerate(s):\n if x == '1':\n print(k - i, end = ' ')\n", "n = int(input())\nrez = []\ni = 1\nwhile n > 0:\n if n % 2:\n rez = [i] + rez\n n //= 2\n i += 1\nprint(*rez)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(1)\r\n while len(a)>1:\r\n if a[len(a)-2]==a[len(a)-1]:\r\n a[len(a)-2]=a[len(a)-1]+1\r\n del(a[len(a)-1])\r\n else:\r\n break\r\nfor i in range(len(a)):\r\n print(a[i],end=\" \")\r\n", "# n = int(input())\n# tn = [int(i) for i in input().split()]\n\n# def f(m):\n\n\n# m = 0\n# l = 0\n# r = n\n\n# while l < r:\n# m = (l + r)//2\n \n\nn = int(input())\np = []\n\nfor i in range(n):\n\tp.append(1)\n\twhile len(p) >= 2 and p[-1] == p[-2]: \n\t\tp[-2] += 1\n\t\tp.pop()\n\nfor i in p: print(i, end=\" \")", "n = int(input())\r\nanswer = []\r\nwhile n > 0:\r\n answer.append(1)\r\n for i in range(1, max(answer) + 1):\r\n if answer.count(i) == 2:\r\n answer[answer.index(i)] += 1\r\n answer.remove(i)\r\n n -= 1\r\nprint(*answer)\r\n", "a = []\nfor x in range(int(input())):\n a.append(1)\n while len(a) > 1 and a[-1] == a[-2]:\n a.pop()\n a.append(a.pop() + 1)\nprint(*a)\n", "n = bin(int(input()))[2:]\r\nl = len(n)\r\nfor i in n:\r\n\tif i=='1':\r\n\t\tprint(l, end = ' ')\r\n\tl-=1", "n = int(input())\n\ns = bin(n)[2:]\nl = len(s)\nlst = []\nfor i in range(l):\n if s[i] == \"1\":\n print((l - i), end=\" \")\n\n", "n = int(input())\r\nnn = n\r\na = []\r\nwhile nn:\r\n if len(a) > 1:\r\n if a[0] != a[1] and a[-1] != a[-2]:\r\n a.append(1)\r\n nn -= 1\r\n else:\r\n a.append(1)\r\n nn -= 1\r\n \r\n while len(a) > 1 and (a[0] == a[1] or a[-1] == a[-2]):\r\n if a[0] == a[1]:\r\n a[1] += 1\r\n a = a[1:]\r\n \r\n if len(a) > 1 and a[-1] == a[-2]:\r\n a[-2] += 1\r\n a = a[:-1]\r\n \r\nfor i in a:\r\n print(i, end=\" \")\r\nprint()", "n = int(input())\r\n\r\nans = []\r\n\r\nnum = list(bin(n)[2::])\r\nsize = len(num)\r\n\r\nfor idx in range(size):\r\n if num[idx] == '1':\r\n ans.append(size - idx)\r\n\r\nprint(' '.join(map(str,ans)))", "n = int(input())\r\na = []\r\nwhile n > 0:\r\n a.append(1)\r\n n = n - 1\r\n while len(a) > 1 and a[len(a) - 1] == a[len(a) - 2]:\r\n x = a[len(a) - 1] + 1\r\n a.pop()\r\n a.pop()\r\n a.append(x)\r\n\r\nfor i in a:\r\n print(i, end=' ')", "x=int(input())\r\np=[1]\r\nfor i in range(2,x+1):\r\n p.append(1)\r\n n=len(p)-1\r\n while n>0:\r\n if p[n]==p[n-1]:\r\n p[n-1]=p[n]+1\r\n p[n:n+1]=[]\r\n else:break\r\n n=len(p)-1\r\nfor i in p:\r\n print(i,end=\" \")", "n = int(input())\r\nprint(\" \".join(str(i+1) for i in range(20,-1,-1) if (n&(1<<i))>0))", "\r\nn = int(input());\r\n\r\nk = 1\r\n\r\na = []\r\nwhile n > 0 :\r\n \r\n if n & 1 :\r\n a.append(k)\r\n k += 1\r\n n = n >> 1\r\n\r\na.reverse()\r\nans = \"\"\r\nfor i in range(len(a)) :\r\n ans += str(a[i]) + \" \"\r\nprint(ans)\r\n", "n = bin(int(input()))[2:]\r\n\r\nl = len(n)\r\n\r\nfor i in n:\r\n if i == \"1\":\r\n print(l, end = \" \")\r\n l -= 1\r\n", "n=int(input())\r\na=[]\r\nfor j in range(n):\r\n\ta.append(1)\r\n\tif len(a)>1:\r\n\t\tfor i in range(len(a)):\r\n\t\t\tif a[len(a)-2]==a[len(a)-1]:\r\n\t\t\t\ta[len(a)-2]=a[len(a)-2]+1\r\n\t\t\t\tdel a[len(a)-1]\r\n\t\t\t\tif len(a)==1:\r\n\t\t\t\t\tbreak\r\nprint(*a)", "n = int(input())\r\nimport math\r\ns = ''\r\na = 1\r\n\r\nwhile n > 0 :\r\n a = int(math.log2(n)) + 1\r\n s += str(a) + ' '\r\n n -= 2 ** (a - 1)\r\nprint(s)\r\n", "s = bin(int(input()))[2:]\r\nfor i,j in enumerate(s):\r\n if j=='1':print(len(s)-i)\r\n", "n=int(input())\r\ni=1\r\nk=1\r\na=[]\r\nwhile i<=n:\r\n if i&n:\r\n a.append(k)\r\n i<<=1\r\n k+=1\r\nfor i in range(len(a)-1,-1,-1):\r\n print(a[i],end=' ')", "n=int(input())\r\ns=[1]*n\r\nwhile not len(set(s))==len(s):\r\n sc=[]\r\n i=0\r\n while i <(len(s)):\r\n if i==(len(s)-1):\r\n sc.append(s[i])\r\n break\r\n if s[i]==s[i+1]:\r\n sc.append(s[i]+1)\r\n i+=1\r\n else:\r\n sc.append(s[i])\r\n i+=1\r\n s=sc\r\nprint(*s)", "import math \r\nn=int(input())\r\nwhile n>2:\r\n\tk=math.floor(math.log(n, 2))\r\n\tn-=2**k\r\n\tprint(k+1, end=' ')\r\nif n>0: print(n, end=' ')", "import sys\r\nfrom math import log\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n out = []\r\n while n:\r\n t = int(log(n, 2))\r\n out.append(t+1)\r\n n -= 2**t\r\n return out\r\n\r\nprint(*main())\r\n", "from math import log2\r\nn = int(input())\r\nl = 1 + int(log2(n))\r\nout = []\r\nwhile n:\r\n #print (n, l, 2**l)\r\n if n >= 2**l:\r\n n -= 2**l\r\n out.append(str(l+1))\r\n l -= 1\r\n \r\nprint (' '.join(out))\r\n\r\n", "\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n lst = []\r\n # i = 1\r\n while n>=1:\r\n if len(lst)==0:\r\n #print(\"he\")\r\n lst.append(1)\r\n else:\r\n lst.append(1)\r\n #print(\"se\")\r\n while lst[len(lst)-1]==lst[len(lst)-2] and len(lst)>1:\r\n k = lst[len(lst)-1]+1\r\n lst.pop()\r\n lst.pop()\r\n lst.append(k)\r\n \r\n \r\n #i += 1\r\n n -= 1\r\n for i in lst:\r\n print(i,end=' ')\r\n", "N = int(input())\nans = []\ni = 0\nwhile N >> i:\n if (N >> i) & 1:\n ans.append(i+1)\n i += 1\nprint(*ans[::-1])\n", "n=int(input())\nslimes=[]\nslimes.append(1)\nfor i in range(n-1):\n\tslimes.append(1)\n\twhile 1:\n\t\t#print(\"h\")\n\t\tif len(slimes)==1 or (slimes[-1] !=slimes[-2]) :\n\t\t\tbreak\n\t\tslimes[-2]+=1\n\t\tdel slimes[-1]\nprint (*slimes)\n\n\n\n\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "\r\nnum = int(input())\r\n\r\nans = []\r\n\r\nwhile num:\r\n ans.append(1)\r\n while len(ans) > 1 and ans[-1] == ans[-2]:\r\n x = ans.pop() + 1\r\n ans[-1] = x\r\n num -= 1\r\nprint(*ans)\r\n\r\n", "n = int(input())\nplace = 1\narr = []\nwhile(n != 0):\n\tif(n % 2 == 1):\n\t\tarr.append(place)\n\tplace += 1\n\tn = n // 2\narr = arr[::-1]\nprint(*arr)", "n=int(input())\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(1)\r\n while len(arr)>=2 and arr[-1]==arr[-2]:\r\n t=arr[-1]+1\r\n del arr[-1]\r\n del arr[-1]\r\n arr.append(t)\r\nprint (*arr)", "a=[0]\r\nfor _ in range(int(input())):\r\n\ta+=[1]\r\n\twhile a[-2]==a[-1]:\r\n\t\ta.pop()\r\n\t\ta[-1]+=1\r\nprint(*a[1:])", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\ns=\"\"\r\nwhile n!=0:\r\n s+=str(n%2)\r\n n//=2\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i]=='1':print(i+1,end=\" \")\r\n \r\n ", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\nmemo = [[] for _ in range(k + 1)]\r\n\r\nfor i in range(1, k + 1):\r\n tmp = int(math.log2(i)) + 1\r\n memo[i].append(tmp)\r\n memo[i] += memo[i - 2**(tmp - 1)]\r\n\r\nprint(*memo[k])\r\n", "n = int(input())\nbin_n = bin(n)[2:]\n\nl = len(bin_n)\nans = [str(l-i) for i in range(l) if bin_n[i] == '1']\nprint(' '.join(ans))\n", "import sys\n\nn = int(sys.stdin.read())\nslimes = [1]\nfor i in range(n-1):\n slimes.append(1)\n pos = len(slimes) - 1\n while pos > 0 and slimes[pos] == slimes[pos-1]:\n del slimes[pos]\n slimes[pos-1] += 1\n pos -= 1\nprint(' '.join(str(slime) for slime in slimes))", "n = int(input())\r\nx = 20\r\n\r\nwhile x >= 0:\r\n if 1 << x & n:\r\n print(x + 1, end=\" \")\r\n x -= 1\r\n", "a = int(input())\r\nm = 1\r\na1 = a\r\nwhile a1 > 1:\r\n a1 /= 2\r\n m += 1\r\nans = []\r\nm += 1\r\nwhile m >= 0:\r\n if a >= 2 ** m:\r\n a = a - 2 ** m\r\n ans.append(m + 1)\r\n m -= 1\r\nprint(*ans)", "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n for i in range(31, -1, -1):\r\n if n & 1 << i:\r\n print(i + 1, end=' ')\r\n print()\r\n\r\nexcept EOFError:\r\n pass\r\n", "\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(1)\r\n\twhile len(l) > 1 and l[-1] == l[-2]:\r\n\t\tl[-2] += 1\r\n\t\tl.pop()\r\n\r\nprint(*l , sep = ' ')\r\n\r\n", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n\td.append(1)\r\n\tif len(d)>=2:\r\n\t\twhile(d[-1]==d[-2]):\r\n\t\t\t\tif d[-1]==d[-2]:\r\n\t\t\t\t\tr=d[-1]+1\r\n\t\t\t\t\td.append(r)\r\n\t\t\t\t\td.pop(-2)\r\n\t\t\t\t\td.pop(-2)\r\n\t\t\t\tif len(d)<2:\r\n\t\t\t\t\tbreak\r\nprint(*d)\r\n", "n = int(input())\r\n\r\ns = [1]\r\nfor i in range(n - 1):\r\n s.append(1)\r\n while len(s) > 1 and s[-2] == s[-1]:\r\n s = s[:-2] + [1 + s[-1]]\r\nprint(*s)", "x=int(input());p=2;a=[];b=[]\r\nfor i in range(x):\r\n\tif p**i>x:break\r\n\ta.append(p**i)\r\na=a[::-1]\r\nfor i in range(len(a)):\r\n\tif a[i]<=x:\r\n\t\tb.append(len(a)-i)\r\n\t\tx=x-a[i]\r\n\tif x==0:exit(print(*b))" ]

{"inputs": ["1", "2", "3", "8", "100000", "12345", "32", "70958", "97593", "91706", "85371", "97205", "34768", "12705", "30151", "4974", "32728", "8192", "65536", "32", "256", "4096", "33301", "16725", "149", "16277", "99701"], "outputs": ["1", "2", "2 1", "4", "17 16 11 10 8 6", "14 13 6 5 4 1", "6", "17 13 11 9 6 4 3 2", "17 15 14 13 12 11 9 6 5 4 1", "17 15 14 11 10 6 5 4 2", "17 15 12 11 9 7 6 5 4 2 1", "17 15 14 13 12 10 9 8 6 5 3 1", "16 11 10 9 8 7 5", "14 13 9 8 6 1", "15 14 13 11 9 8 7 3 2 1", "13 10 9 7 6 4 3 2", "15 14 13 12 11 10 9 8 7 5 4", "14", "17", "6", "9", "13", "16 10 5 3 1", "15 9 7 5 3 1", "8 5 3 1", "14 13 12 11 10 9 8 5 3 1", "17 16 11 9 7 6 5 3 1"]}

UNKNOWN

PYTHON3

CODEFORCES

215

d1b115caf00a7ad2e19bbdbf6e96df46

Book Reading

Recently Luba bought a very interesting book. She knows that it will take *t* seconds to read the book. Luba wants to finish reading as fast as she can. But she has some work to do in each of *n* next days. The number of seconds that Luba has to spend working during *i*-th day is *a**i*. If some free time remains, she can spend it on reading. Help Luba to determine the minimum number of day when she finishes reading. It is guaranteed that the answer doesn't exceed *n*. Remember that there are 86400 seconds in a day. The first line contains two integers *n* and *t* (1<=≤<=*n*<=≤<=100, 1<=≤<=*t*<=≤<=106) — the number of days and the time required to read the book. The second line contains *n* integers *a**i* (0<=≤<=*a**i*<=≤<=86400) — the time Luba has to spend on her work during *i*-th day. Print the minimum day Luba can finish reading the book. It is guaranteed that answer doesn't exceed *n*. Sample Input 2 2 86400 86398 2 86400 0 86400 Sample Output 2 1

[ "n, t = map(int, input().split())\ndaftar_waktu_kerja = list(map(int, input().split()))\nhari = 1\n\nfor waktu_kerja in daftar_waktu_kerja:\n waktu_kosong = 86400 - waktu_kerja\n t -= waktu_kosong\n\n if t <= 0:\n print(hari)\n break\n \n hari += 1\n\t \t\t \t\t\t\t\t \t \t \t\t \t", "a=input().split(' ')\nn=int(a[0])\nt=int(a[1])\na=input().split(' ')\na=[int(i) for i in a]\nfor i in range(n):\n if t<=0:\n print(i)\n break\n t=t-(86400-a[i])\nelse:\n print(n)\n \n", "n, t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\ns = 0\r\nfor i in a:\r\n ans += 1\r\n s += 86400 - i\r\n if s >= t:\r\n print(ans)\r\n break\r\n", "n, t = map(int, input().split())\na = list(map(int, input().split()))\ncnt = t\nfor i in range(len(a)):\n cnt -= 86400 - a[i]\n if cnt <= 0:\n print(i + 1)\n exit()\n", "i=lambda:map(int,input().split())\r\n_,d=i();r=0\r\nfor x in i():\r\n r+=1\r\n d-=86400-x\r\n if d<1:break\r\nprint(r)\r\n", "n, t = map(int, input().split())\r\nn = 0\r\ns = list(map(lambda x: 86400 - int(x), input().split()))\r\nfor i, j in enumerate(s):\r\n n += j\r\n if n >= t:\r\n print(i + 1)\r\n exit(0)\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range(len(a)):\r\n k+=86400-a[i]\r\n if k>=t:\r\n print(i+1)\r\n break", "n,t = (int(x) for x in input().split())\r\n\r\nns = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, n+1):\r\n t -= 86400 - ns[i-1]\r\n if t <= 0:\r\n print(i)\r\n break\r\n", "n,t=map(int,input().split())\r\nj=0\r\nfor i in list(map(int,input().split())):\r\n j+=1\r\n t-=86400-i\r\n if t<=0:\r\n print(j)\r\n break\r\n \r\n \r\n", "v_vod = input().split()\r\nn = int(v_vod[0])\r\nt = int(v_vod[1])\r\na = [int(i) for i in input().split()]\r\ni = 0\r\np = 0\r\nwhile t > 0:\r\n p += 1\r\n t = t - (86400 - a[i])\r\n i += 1\r\nprint(p)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in a:\r\n t -= (86400-i)\r\n ans += 1\r\n if t<=0:\r\n break\r\nprint(ans)", "n = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\ncount = 0\nwhile(n[1] > 0):\n\tn[1] -= (86400 - a[count])\n\tcount+=1\nprint(count)\n", "n, t = map(int, input().split())\r\nlst, i = list(map(int, input().split())), 0\r\nwhile t > 0 and i < n: t, i = t - 86400 + lst[i], i + 1\r\nprint(i)", "I = lambda: map(int, input().split())\r\n\r\n_, t = I()\r\ns = 0\r\n\r\nfor i, a in enumerate(I(), 1):\r\n s += 86400-a\r\n if s >= t:\r\n print(i)\r\n break", "n, t = map(int, input().split())\r\nli = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n t -= 86400 - li[i]\r\n if t <= 0:\r\n break\r\nprint(i+1)\r\n\r\n\r\n", "from cmath import *\r\nfrom decimal import *\r\n\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n\r\ndef solves():\r\n n,m=_input()\r\n lst=_list()\r\n ans=0;\r\n for i in range(n):\r\n lst[i]=86400-lst[i]\r\n m-=lst[i]\r\n if (m<=0):\r\n print(i+1)\r\n exit()\r\n print(-1)\r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n, t = input().split()\r\nlst = list(map(int, input().split()))\r\n\r\ntime = 0\r\nfor item in range(len(lst)):\r\n time += 86400 - lst[item]\r\n if time >= int(t):\r\n print(item + 1)\r\n break\r\n", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nout = 0\r\nfor i in c:\r\n\tb = b - 86400 + i\r\n\tout += 1\r\n\tif(b<=0):\r\n\t\tprint(out)\r\n\t\tbreak", "n,t = tuple(map(int, input().split()))\nday_seconds = 86400\nA = tuple(map(int, input().split()))\n\ndef calc(A):\n free_time = 0\n counter = 0\n\n for a in A:\n free_time += day_seconds - a \n counter += 1\n if free_time >= t:\n return counter\n\nprint(calc(A))\n\n", "days, t=map(int, input().split())\r\na=list(map(int, input().split()))\r\nday=86400;p=0\r\n\r\nfor i in range(days):\r\n\td=day-a[i]\r\n\tif t:\r\n\t\tp+=1\r\n\t\tif d>=t:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tt-=d\r\nprint(p)", "a, b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ni = 0\r\nx = 0\r\nwhile x < b:\r\n\tx += 86400 - s[i]\r\n\ti += 1\r\nprint(i)\r\n\t\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[86400-a[i] for i in range(len(a))]\r\nm=0\r\nfor i in range(len(b)):\r\n\tm+=b[i]\r\n\tif m>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split())\na = map(int, input().split())\nfor index, elem in enumerate(a):\n t -= (86400 - elem)\n if t <= 0:\n print(index + 1)\n break", "n,t=map(int,input().split(' '))\r\nl=input().split(' ')\r\n\r\nj=0\r\ni=0\r\nwhile (t>0):\r\n t=t-(86400-int(l[i]))\r\n i=i+1\r\n j=j+1\r\nprint(j)\r\n\r\n", "a, b = map(int, input().split())\r\nwork = list(map(int, input().split()))\r\ncount = 0 \r\nfor i in range (a) :\r\n\tcount += 86400 - work[i]\r\n\tif count >= b :\r\n\t\tbreak\r\nprint (i + 1)", "n,t = map(int, input().split())\r\nl = input().split()\r\ni=0\r\nwhile t>0:\r\n\tt-=(86400-int(l[i]))\r\n\ti+=1\r\nprint(i)", "n,t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nq = 0\r\nfor i in a:\r\n\ts += 86400 - i\r\n\tq += 1\r\n\tif s >= t:\r\n\t\tprint(q)\r\n\t\tbreak", "# 884A\r\n\r\ndef main():\r\n\tbuff = input().split()\r\n\tn, t = int(buff[0]), int(buff[1])\r\n\tarr = list(map(int, input().split()))\r\n\tday = 0\r\n\twhile t > 0:\r\n\t\tday += 1\r\n\t\tt -= (86400 - arr.pop(0))\r\n\treturn day\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tprint(main())", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nchk = -1\r\nfor i in range(n):\r\n t -= 86400 - data[i]\r\n if t <= 0:\r\n chk = i\r\n break\r\n\r\nprint(chk + 1)", "n,t = map(int,input().strip().split(\" \"))\r\nA_i = [int(n) for n in input().split()]\r\nRemain = 0\r\nremain = 0\r\nconst = 86400\r\ni = 0\r\n\r\nwhile t > 0:\r\n remain = const - A_i[i]\r\n t = t - remain\r\n remain = 0\r\n i += 1\r\n\r\nprint(i)\r\n", "n, t = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nno_days = 0\r\ni = 0\r\nwhile t > 0:\r\n\ta = 86400 - l[i]\r\n\tt-=a\r\n\ti+=1\r\nprint(i)", "n , t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(len(a)):\r\n\tx = 86400 - a[i]\r\n\tt = t - x\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split(\" \"))\r\nwork = list(map(int, input().split(\" \")))\r\nsum = 1\r\nread = 0\r\nfor time in work:\r\n left = 86400 - time\r\n if t - read <= left:\r\n break\r\n else:\r\n sum += 1\r\n read += left\r\nprint(sum)", "\r\nn,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in range(n):\r\n b=b+(86400-a[i])\r\n c=c+1\r\n if b>=t:\r\n break\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\ncnt=0\r\nl = [int(x) for x in input().split()]\r\nfor x in l:\r\n if t>0:\r\n t-=86400-x\r\n cnt+=1\r\n else: break\r\nprint(cnt)", "n,t = [int(i) for i in input().split()]\r\nwork = [int(i) for i in input().split()]\r\nsum = 0\r\nday = 0\r\nwhile sum < t:\r\n day += 1\r\n sum += 86400-work[day-1]\r\nprint(day)\r\n", "(n,t) = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(0,n):\r\n count+=86400-l[i]\r\n if count >= t:\r\n break\r\nprint(i+1)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nfor i in l:\r\n x=x+(86400-i)\r\n y=y+1\r\n if x>=t:\r\n break\r\nprint(y) ", "n, t = map(int, input().split())\nl = list(map(int, input().split()))\nfor i in range(len(l)):\n t -= 86400 - l[i]\n if t <= 0:\n print(i + 1)\n break\n", "n,t = map(int,input().split())\na = list(map(int,input().split()))\ni = 0\nwhile t>0:\n t -= (86400-a[i])\n i+=1\nprint(i)\n", "n, t = input().split(\" \")\r\ni = 0\r\nn, t = int(n), int(t)\r\na = input().split(\" \")\r\nwhile t > 0:\r\n t = t - 86400 + int(a[i])\r\n i = i + 1\r\nprint(i)\r\n", "MAX_DAY = 86400\r\n\r\ndays, needed = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor t in times:\r\n needed -= (MAX_DAY - t)\r\n res += 1\r\n if needed <= 0:\r\n break\r\n \r\nprint(res)", "n, t = [int(i) for i in input().split()]\r\ndias = [int(i) for i in input().split()]\r\nqtd = 0\r\nfor dia in dias:\r\n l = 86400 - dia\r\n t = t - l\r\n qtd = qtd + 1\r\n if t <= 0:\r\n break\r\nprint(qtd)\r\n", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n t -= (86400 - a[i])\r\n if t <= 0:\r\n break\r\nprint(i + 1)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(a)):\r\n ans+=86400-a[i]\r\n if(ans>=t):\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\nl=list(map(int, input().split()))\r\nfor i in range(n):\r\n l[i]=86400-l[i]\r\n t-=l[i]\r\n if t<=0: print(i+1);break\r\n\r\n", "entrada = [int(i) for i in input().split()]\nn, t = entrada[0], entrada[1]\n\nlista = [int(i) for i in input().split()]\n\ncontador = 0\nlisto = False\nfor i in range(n):\n contador += 86400 - lista[i]\n if contador >= t and not listo:\n print(i +1)\n listo = True", "n, t = list(map(int,input().split()))\r\nN = list(map(int,input().split()))\r\ncounter = 0\r\ni = 0\r\nwhile counter < t:\r\n counter += 86400 - N[i]\r\n i += 1\r\nprint(i)\r\n", "n, t = map(int, input().split())\nwork = list(map(int, input().split()))\n\nfound = False\nminday = n\nb = t\n\nfor i in range(n):\n for j in range(i, n):\n b += (work[j] - 86400)\n if b <= 0:\n print(j+1)\n found = True\n break\n b = t\n if found:\n break\nelse:\n print(n)\n", "n, t = map(int, input().split())\na = list(map(int, input().split()))\ni = 0\nwhile i < n:\n t -= 86400 - a[i]\n if t <= 0:\n break\n i += 1\nprint(i + 1)", "n,x=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\ns=0\r\nwhile x>0:\r\n\tx-=86400-a[s]\r\n\ts+=1\r\nprint(s)", "x,y=map(int,input().split());a=list(map(int,input().split()))\r\nfor i in range(x):\r\n\tif y-(86400-a[i])<1:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telse:\r\n\t\ty=y-(86400-a[i])", "s = input().split()\r\nn = int(s[0])\r\nt = int(s[1])\r\ns = input().split()\r\nsumm = 0\r\nk = n\r\nkey = 0\r\nfor i in s :\r\n key+=1\r\n summ += 86400 - int(i)\r\n if summ >= t :\r\n print(key)\r\n quit()\r\n", "n,t = map(int, input().split())\nk = 0\nz = list(map(int, input().split()))\ni = 0\nwhile t > 86400 - z[i]:\n t -= 86400 - z[i]\n i += 1\nprint(i + 1)\n", "l1=[int(i) for i in input().split()]\r\nn=l1[0] #n days of work\r\nt=l1[-1] #t seconds for book reading\r\nl2=[int(j) for j in input().split()]\r\ncount=0\r\ni=0\r\nwhile count<t:\r\n count=count+(86400-l2[i])\r\n i+=1\r\nprint(i)", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = 86400\r\nfor i in range(len(a)):\r\n t -= m - a[i]\r\n if t <= 0:\r\n print(i + 1)\r\n break", "nt = list(map(int,input().split()))\na = list(map(int,input().split()))\n\ncnt_day = 0\nt = nt[1]\nn = nt[0]\nfor i in range(n):\n if a[i] < 86400: \n remain_t = 86400 - a[i]\n if remain_t >= t:\n cnt_day += 1\n break\n else:\n t -= remain_t\n cnt_day+= 1\n\nprint(cnt_day)", "inp = input()\nn,t = inp.split()\nn = int(n)\nt = int(t)\ninp2 = input()\ninp2 = inp2.split()\nfor i in range(n):\n inp2[i] = int(inp2[i])\n\ntime = 86400\nfor i in range(n):\n if t-time+inp2[i]<=0:\n print(i+1)\n break\n t = t - time+inp2[i]\n", "\n\nn, t = list(map(int ,input().split()))\n\nworktimes = list(map(int ,input().split()))\ncnt = 0\nfor i in worktimes:\n t = t-(86400-i)\n cnt += 1\n if t <= 0:\n print(cnt) \n break", "if __name__=='__main__':\n n=list(map(int, input().rstrip().split()))\n x=list(map(int, input().rstrip().split()))\n t=n[1]\n c=0\n for item in x :\n t=t+item-86400\n if t<=0 :\n c+=1\n break\n else:\n c+=1\n\n print(c)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tc+=(86400-a[i])\r\n\tif c>=k:\r\n\t\tbreak\r\nprint(i+1)", "\r\nn, t = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in arr:\r\n if t <= 0:\r\n break\r\n\r\n t -= (86400 - i)\r\n count += 1\r\nprint(count)\r\n", "R=lambda:list(map(int,input().split()))\r\nn, t = R()\r\nlist = R()\r\nfor i in range(n):\r\n\tt -= 86400 - list[i]\r\n\tif (t <= 0):\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n", "X = list(map(int, input().split()))\r\nDays = list(map(int, input().split()))\r\nSum = 0\r\nfor i in range(len(Days)):\r\n Sum += 86400 - Days[i]\r\n if Sum >= X[1]:\r\n print(i + 1)\r\n exit()\r\n", "import sys\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\n\r\nfor i in range(n):\r\n sum+=86400-l[i]\r\n if sum>=t:\r\n print(i+1)\r\n sys.exit()\r\n\r\n ", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n c = 86400 - l[i]\r\n if c == 0:\r\n continue\r\n elif c >= t:\r\n print(i+1)\r\n break\r\n else:\r\n t -= c\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n#n, t = 2, 2\r\n#a = [86400, 86398]\r\n\r\n#n, t = 2, 86400\r\n#a = [0, 86400]\r\n\r\n#n = 100\r\n#t = 10**6\r\n#a = [0]*n\r\n\r\nfor i, ai in enumerate(a):\r\n\tt -= (86400 - ai)\r\n\tif t <= 0:\r\n\t\tbreak\r\n\r\nprint(i+1)\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n t -= 86400-a[i]\r\n if t <= 0:\r\n print(i+1)\r\n exit()", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n t -= 60*60*24 - a[i]\r\n if t <= 0:\r\n print(i+1)\r\n exit()", "a,b=[int(x) for x in input().split()]\r\nc=list(map(int,input().split()))\r\ns=0\r\nfor i in range(a):\r\n s+=86400-c[i]\r\n if(s>=b):\r\n print(i+1)\r\n break", "ONE_DAY_SECONDS = 86400\n\nn_days, t_seconds = map(int, input().split())\nwork_seconds = list(map(int, input().split()))\n\nfor i in range(n_days):\n t_seconds -= ONE_DAY_SECONDS - work_seconds[i]\n if t_seconds <= 0:\n print(i + 1)\n break\n", "n, t = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nans = 1\r\nsums = []\r\n\r\nfor i in a:\r\n sums.append(86400 - i)\r\n \r\nwhile sum(sums[0:ans]) < t:\r\n ans += 1\r\n \r\nprint(ans)", "n,k=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\ns=86400\r\nnd=1\r\nfor i in lst:\r\n d=s-i\r\n k=k-d\r\n if k<=0:\r\n print(nd)\r\n break\r\n nd+=1\r\n", "import itertools\r\n\r\n\r\ndef main():\r\n n,t = [int(v) for v in input().split()]\r\n d = [int(v) for v in input().split()]\r\n s = 0\r\n for i, v in enumerate(d):\r\n s+=86400-v\r\n if s>=t:\r\n print(i+1)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python3\n\nn,t = map(int,input().split())\nA = list(map(int,input().split()))\nd = 0\nwhile t>0:\n t -= 86400-A[d]\n d += 1\nprint(d)\n", "n, t = [int(x) for x in input().split()]\ndias = [int(x) for x in input().split()]\nj = n\nfor i in range(n):\n\tt -= 86400 - dias[i]\n\tif t <= 0:\n\t\tj = i+1\n\t\tbreak\nprint(j)\n\n", "sutki, book = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\ni = 0\r\nwhile (book > 0):\r\n book -= (86400 - d[i])\r\n i+=1\r\nprint(i)\r\n", "str1 = str(input())\r\nstr2 = str(input())\r\n\r\n\r\nt = int(str1.split(' ')[1])\r\n\r\n\r\nlis = [int(i) for i in str2.split(' ')]\r\niter_lis = iter(lis)\r\ncount = 0\r\nday = 0\r\n\r\nwhile count < t:\r\n count += 86400 - iter_lis.__next__()\r\n day += 1\r\n\r\nprint(day)", "[n, t] = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = 0\r\nr = 0\r\nfor x in a:\r\n d += 1\r\n r += 86400 - x\r\n if r >= t:\r\n break\r\nprint(d)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nN=[86400 for i in range(n)]\r\nfor i in range(n): \r\n N[i]=N[i]-l[i]\r\nans=0\r\nfor i in range(n):\r\n t-=N[i]\r\n if t<=0:\r\n print(i+1)\r\n break\r\n", "s=input().rstrip().split(' ')\r\np=input().rstrip().split(' ')\r\nt=int(s[1])\r\nY=0;\r\nf=0;\r\nfor i in range(0,len(p)):\r\n f=f+86400-int(p[i])\r\n Y+=1;\r\n if f>=t:\r\n break;\r\nprint(Y)\r\n", "a,b=map(int,input().strip().split())\r\nlst=list(map(int,input().strip().split()))\r\ncount=0\r\ndiff=0\r\nfor i in range(a):\r\n diff=(86400-lst[i])+diff\r\n count=count+1\r\n if diff>=b:\r\n break \r\nprint(count)", "def main():\n n, t = map(int, input().split())\n for i, x in enumerate(map(int, input().split()), 1):\n t -= 86400 - x\n if t <= 0:\n break\n print(i)\n\n\nif __name__ == '__main__':\n main()\n", "n,t=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\ncompt=0\r\ni=0\r\nc=0\r\nwhile(compt<t):\r\n compt+=86400-l[i]\r\n c+=1\r\n i+=1\r\nprint(c)", "import sys\nimport math\n\nFNAME = \"A\"\n#FNAME = \"distance\"\n###########\n#fin, fout = open(FNAME + \".in\", \"r\"), open(FNAME + \".out\", \"w\")\n#sys.stdin = fin\n#sys.stdout = fout\n###########\n\nn,t = map(int, input().split())\na = list(map(int, input().split()))\n\nfor i in range(n):\n t -= (86400 - a[i])\n if t <= 0:\n print(i+1)\n break\n", "def solve(n, t, a):\n s = 0\n for d, i in enumerate(a):\n s += 86400 - i\n if s >= t:\n return d + 1\n\n\ndef main():\n n, t = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, t, a))\n\n\nmain()\n", "n, t = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\nday = 86400\r\nanswer = 0\r\nfree_time = 0\r\nfor el in times:\r\n free_time += day - el\r\n answer += 1\r\n if free_time >= t:\r\n print(answer)\r\n exit(0)\r\nprint(answer)\r\n", "n,t=list(map(int,input().split()))\r\nu=86400\r\ns=list(map(int,input().split()))\r\n\r\np=0\r\nfor i in range(len(s)):\r\n p+=abs(u-s[i])\r\n if p>=t:\r\n print(i+1)\r\n break\r\n", "from itertools import permutations\nm,n=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(m):\n\tsum+=86400-a[i]\n\tif sum>=n:\n\t\tprint(i+1)\n\t\tbreak\n", "n,t=map(int,(input().split()))\r\na=list(map(int,(input().split())))\r\ns=0\r\nfor i in range(n):\r\n\ts+=86400-a[i]\r\n\tif s>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "def main():\n\tn, t = map(int, input().split())\n\ttime = list(map(int,input().split()))\n\t\n\tcnt = 0\n\tfor i in range(0, n):\n\t\ttimeleft = 86400-time[i]\n\t\tt = t - timeleft\n\t\tcnt = cnt + 1\n\t\tif t<=0:\n\t\t\tprint(cnt)\n\t\t\treturn\n\nif __name__ == \"__main__\":\n\tmain()\t\t\t\n", "f=lambda:map(int,input().split())\r\nn,t=f()\r\ns=0\r\nl=[86400-i for i in list(f())]\r\nfor i in range(n):\r\n s+=l[i]\r\n if s>=t:\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=0\r\ncount=0\r\nfor i in a:\r\n d=86400-i\r\n r=r+d\r\n count=count+1\r\n if r>=t:\r\n break\r\nprint(count)\r\n", "TIME_IN_A_DAY = 86400\nn, t = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(len(a)):\n\tif TIME_IN_A_DAY - a[i] >= t:\n\t\tprint(i + 1)\n\t\tbreak\n\tt -= (TIME_IN_A_DAY - a[i])", "R=lambda:map(int, input().split())\r\nn,t=R()\r\nfor i, x in enumerate(R(),1):\r\n t-=86400-x\r\n if t <= 0:\r\n break\r\nprint(i)\r\n", "n,k=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nans,c=0,0\r\ni=0\r\nwhile(1):\r\n if(ans>=k):\r\n break\r\n else:\r\n \r\n ans=ans+(86400-l[i])\r\n i+=1\r\n c+=1 \r\nprint(c) \r\n ", "n, t = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ni = 0\r\nfor day in range(n):\r\n i += 86400 - s[day]\r\n if i >= t:\r\n print(day + 1)\r\n break", "s = input().split()\r\nn, t = int(s[0]), int(s[1])\r\nd = 0\r\nfor ai in input().split():\r\n t -= (86400 - int(ai))\r\n d += 1\r\n if t <= 0:\r\n break\r\nprint(d)\r\n\r\n", "n,t = map(int, input().split())\r\nans=0\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if(l[i] < 86400):\r\n m = 86400 - l[i]\r\n t -= m\r\n ans+=1\r\n if(t<=0):\r\n break\r\nprint(ans)", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ni = -1\r\nwhile k > 0:\r\n i += 1\r\n k -= (86400 - a[i])\r\nprint(i + 1)", "cin = lambda : map(int, input().split())\r\nn, m = cin()\r\na = list(cin())\r\nfor i in range(n):\r\n m -= 86400 - a[i]\r\n if m <= 0:\r\n print(i + 1)\r\n exit()", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n d=86400-i\r\n c+=1\r\n if d>0:\r\n t-=d\r\n if t<=0:\r\n break\r\nprint(c)", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\n\r\nn,t = mi()\r\na = list(mi())\r\ns = 0\r\ni = 0\r\nwhile i<n:\r\n\tt-=(86400-a[i])\r\n\tif t<=0:\r\n\t\tprint (i+1)\r\n\t\tbreak\r\n\ti+=1", "n,t = map(int, input().split())\r\ndays = [int(i) for i in input().split()]\r\nlimit = 0\r\ncount = 0\r\nfor i in days:\r\n if limit>=t :\r\n break\r\n limit+= (86400-i)\r\n count+=1\r\nprint(count)\r\n\r\n", "w1 = list(map(int, input().split()))\r\nn = w1[0]\r\nt = w1[1]\r\nw2 = list(map(int, input().split()))\r\ntime = [86400-i for i in w2]\r\n\r\n\r\ndef least(a, left):\r\n if left > 0:\r\n left -= time[a]\r\n a += 1\r\n return least(a, left)\r\n else:\r\n print(a)\r\n\r\n\r\nleast(0, t)\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n if(s<t):\r\n c=c+1\r\n s=s+(86400-a[i])\r\n else:\r\n break\r\nprint(c)\r\n", "n,x=list(map(int,input().strip().split()))\r\nl=list(map(int,input().strip().split()))\r\nfor i in range(n):\r\n t=86400-l[i]\r\n x=x-t\r\n if x<=0:\r\n print(i+1)\r\n break\r\n\r\n", "a = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nk = 0\r\ng = 0\r\nfor i in range(len(b)):\r\n k += 86400 - b[i]\r\n g += 1\r\n if k >= a[1]:\r\n print(g)\r\n break", "n,t = map(int, input().split())\r\nc = input().split()\r\nday = 0\r\nd = 0\r\nwhile d < t:\r\n d += 86400 - int(c[day])\r\n day += 1\r\nprint(day)", "a,b = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nx =0\r\nfor i in range(len(z)):\r\n\tx+=(86400-z[i])\r\n\tif x>=b:\r\n\t\tprint(i+1)\r\n\t\tbreak", "seconds_in_day= 86400\r\nn,t=input().split()\r\nn=int(n)\r\nt=int(t)\r\nstring_seconds=input().split()\r\nint_seconds=list(map(int,string_seconds))\r\nsum=0\r\nday=1\r\nfor i in range(n):\r\n sum+=(seconds_in_day-int_seconds[i])\r\n if sum >= t:\r\n break\r\n day+=1\r\nprint(day)", "n, t = [int(elem) for elem in input().split(' ')]\nvals = [86400 - int(elem) for elem in input().split(' ')]\nday = 0\ntotal = 0\nwhile total < t:\n total += vals[day]\n day += 1\nprint(day)\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400-l[i]\r\n i += 1\r\nprint(i)\r\n", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ni = 0\r\n\r\nwhile t > 0:\r\n t -= (86400 - a[i])\r\n i += 1\r\n \r\nprint(i)", "n, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncur = 0 #current\r\nfor i in range(len(a)):\r\n cur += 86400 - a[i]\r\n if cur >= t:\r\n break\r\nprint(i + 1)", "n=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nt=n[1]\r\np=0\r\nfor i in k:\r\n if 86400-i<t: \r\n t=t-(86400-i)\r\n p+=1\r\n else:\r\n p+=1\r\n break\r\nprint(p)\r\n \r\n ", "n , m =input().split()\r\nn ,m =[int(n) ,int(m) ]\r\nwork_time = [int(x) for x in input().split()]\r\nfor i in range(n) :\r\n m -= 86400 -work_time[i]\r\n if m <= 0 :\r\n print(i+1)\r\n break\r\n ", "n, t = map(int, input().split())\nA = list(map(int, input().split()))\ns = 0\nfor i, a in enumerate(A):\n s += 86400-a\n if s >= t:\n print(i+1)\n exit()\n", "n, t = map(int, input().split())\r\na = list(map(int,input().split()))\r\ncnt = 0\r\nwhile t > 0:\r\n\tt -= (86400 - a[cnt])\r\n\tcnt += 1\r\n \r\nprint(cnt)", "def reading(lst, t):\r\n result, count = 0, t\r\n for i in range(len(lst)):\r\n if count == 0:\r\n break\r\n d = min(86400 - lst[i], count)\r\n count -= d\r\n result += 1\r\n return result\r\n\r\n\r\nn, t = [int(i) for i in input().split()]\r\na = [int(j) for j in input().split()]\r\nprint(reading(a, t))\r\n", "s=input().split()\r\nn=int(s[0])\r\nt=int(s[1])\r\ns1=input().split()\r\nfor i in range(1,n+1):\r\n time=int(s1[i-1])\r\n t=t-(86400-time)\r\n if(t>0) and (i==n):\r\n print(n);break\r\n if(t<=0):print(i);break\r\n", "n,t = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\nd = 0\r\nfor i in range(len(a)):\r\n\td += 86400 - a[i]\r\n\tif d >= t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "import math\r\nn,t = [int(x) for x in input().split(' ')]\r\nl = [int(x) for x in input().split(' ')]\r\nz=1\r\nfor x in l:\r\n q=86400-x\r\n if q==0:\r\n z+=1\r\n else:\r\n t-=q\r\n if t<=0:\r\n break\r\n else:\r\n z+=1\r\nprint(z)\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=a[1]\r\nd=0\r\ni=0\r\nwhile c>0:\r\n d+=1\r\n c=c-(86400-b[i])\r\n i+=1\r\nprint(d)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n s+=86400-l[i]\r\n if(s>=t):\r\n c+=1\r\n break\r\n else:\r\n c+=1\r\nprint(c)\r\n", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nc= 0\r\nfor i in range(n):\r\n if t>0:\r\n t-=86400-li[i]\r\n c+=1\r\nprint(c)", "n,m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nans = 0\r\ns = 0\r\ni = 0\r\nwhile m > s:\r\n\ts = s+(86400-a[i])\r\n\ti+=1\r\n\tans+=1\r\nprint(ans)\r\n", "n,t=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nread=0\r\ni=0\r\nwhile read<t:\r\n read=read+(86400-l[i])\r\n i+=1\r\n\r\nprint(i)", "r = lambda: map(int, input().split())\r\n\r\ndef main():\r\n\tn, t = r()\r\n\ta = list(r())\r\n\tfor i, x in enumerate(a):\r\n\t\tt -= 86400 - x\r\n\t\tif t <= 0:\r\n\t\t\tprint(i + 1)\r\n\t\t\treturn\r\nmain()", "a,b=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n\tc+=(86400-m[i])\r\n\tif c>=b:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, t = map(int, input().split())\r\nsecondsSpend = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n tempSeconds = secondsSpend[i]\r\n tempDiff = 86400 - tempSeconds\r\n t = t - tempDiff\r\n ans += 1\r\n if(t <= 0): \r\n break\r\nprint(ans)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\n\r\nfor i in range(n):\r\n l.append(86400-a[i])\r\n if(sum(l)>=t):\r\n print(i+1)\r\n break", "def numberDays(t, days):\n\tfor i in range(len(days)):\n\t\tt -= 86400 - days[i]\n\t\tif t <= 0:\n\t\t\treturn i + 1\n\t\ti += 1\n\nn, t = [int(x) for x in input().split()]\ndays = [int(x) for x in input().split()]\nprint(numberDays(t, days))", "a=int(input().split()[1]);s=0\r\nfor i in map(int,input().split()):\r\n a-=(86400-i);s+=1\r\n if a<=0:print(s);exit()\r\n", "def main():\n [n, t] = [int(_) for _ in input().split()]\n a = [int(_) for _ in input().split()]\n reading = 0\n day = 0\n\n for i in range(n):\n reading += (86400 - a[i])\n\n if reading >= t:\n day = i + 1\n break\n\n print(day)\n\n\nif __name__ == '__main__':\n main()\n", "x,t=map(int,input().split())\r\ns=[int(n) for n in input().split()]\r\np=24*3600\r\nm=0\r\nfor n in s:\r\n\tj=p-n\r\n\tt-=j\r\n\tm+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(m)", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()][:n]\r\ncount=0\r\ntime=0\r\nflag=0\r\nfor i in range(n):\r\n count+=86400-a[i]\r\n time+=1\r\n if count>=t:\r\n print(time)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(time)", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nday = 0\r\nwhile t>0:\r\n t-= 86400-a[day]\r\n day += 1\r\nprint (day)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\np = 0\r\nk = 0\r\nfor i in range(len(a)):\r\n if k < m:\r\n k = k + abs(a[i] - 86400)\r\n p += 1\r\n else:\r\n break\r\nprint(p)", "l=input().split(\" \")\r\nn,t=int(l[0]),int(l[1])\r\nd=list(map(int,input().split(\" \")))\r\nlength=len(d)\r\ndays=0\r\nti=0\r\nfor i in range(length):\r\n\tti+=(86400-d[i])\r\n\tdays+=1\r\n\tif (ti>=t):\r\n\t\tbreak\r\nif(ti>=t):\r\n\tprint (days)\r\nelse:\r\n\tprint(n)", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n\tcount+=1\r\n\tc=86400-i\r\n\ts=s-c\r\n\tif s<=0:\r\n\t\tbreak\r\nprint(count)", "\r\ndef read_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nSECONDS_PER_DAY = 86400\r\n\r\nnum_of_day, time_required = read_int()\r\nworking_seconds = read_int()\r\n\r\ncnt = 1\r\n\r\nfor second in working_seconds:\r\n ret = SECONDS_PER_DAY - second\r\n if ret >= time_required:\r\n break\r\n else:\r\n time_required -= ret\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n,t=map(int,input(\"\").split())\r\na=list(map(int,input(\"\").split()))\r\ncount=0\r\nfor i in range(n):\r\n x=86400-a[i]\r\n t-=x;\r\n count+=1\r\n if(t<=0):\r\n break\r\nprint(count)", "n,t=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\ni=0\r\nwhile t>0:\r\n a=86400-s[i]\r\n t=t-a\r\n i=i+1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nans=0\r\n\r\nwhile t >0 and ans<=n:\r\n ans+=1\r\n\r\n a = 86400-l[i]\r\n t-=a\r\n i += 1\r\nif ans<=n:\r\n print(ans)\r\nelse:\r\n print(n)", "n,t = map(int,input().split())\r\nA = list(map(int,input().split()))\r\na = 86400\r\nfor i in range(n):\r\n rem = a-A[i]\r\n t -= min(t,rem)\r\n if(t==0):\r\n ans = i+1\r\n break\r\nif(t==0):\r\n print(ans)\r\nelse:\r\n ans += t/a\r\n if(t%a):\r\n ans+=1\r\n print(ans)", "n, t = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ncurr_time = 0\r\nday = 0\r\nwhile (curr_time < t) and (day <= n):\r\n day += 1\r\n curr_time += (86400 - a[day - 1])\r\n\r\nprint(day)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile t>0:\r\n t-=(86400-a[i])\r\n i+=1\r\nprint(i)\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n,t=list(map(int, input().split()))\r\nl=list(map(int, input().split()))\r\nnum=0\r\nfor i in l:\r\n num+=1\r\n t-=86400-i\r\n if t<=0:break\r\nprint(num)", "line1 = input().split()\nn = int(line1[0])\nt = int(line1[1])\nline2 = input().split()\nworking = []\nfor i in range(n):\n working.append(int(line2[i]))\n\ndays = 0\nwhile t > 0:\n t = t - (86400 - working[days])\n days += 1\n\nprint(days)\n", "n=list(map(int, input().split(\" \")))\r\nre=n[1]\r\nS=list(map(int, input().split(\" \")))\r\nfor i in range(len(S)):\r\n re=re-(86400-S[i])\r\n if re<=0:\r\n print(i+1)\r\n break\r\n", "[a,b] = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nd = 0\r\nfor i in range(a):\r\n d += 1\r\n s += 86400-l[i]\r\n if s >= b:\r\n break\r\nprint(d)\r\n", "s1 = input()\r\nw = s1.split()\r\nn = int(w[0])\r\nt = int(w[1])\r\ns2 = input()\r\ns2 = s2.split()\r\nx = []\r\nfor i in range(n):\r\n x.append(int(s2[i]))\r\nt0=0\r\nd = 1\r\nfor i in x:\r\n if t0>=t:\r\n break\r\n if i<=86400:\r\n t0+=86400-i\r\n if t0>=t:\r\n break\r\n d+=1\r\nprint(d)", "n,t = map(int,input().split())\r\nwork = list(map(int,input().split()))\r\n\r\ntime = 0\r\nfor i in range (n):\r\n time+= 86400 - work[i]\r\n if(time >= t):\r\n print(i+1)\r\n break", "def main():\r\n\r\n\tday = 86400\r\n\r\n\tn,x = map(int,input().split())\r\n\ta = list(map(int,input().split()))\r\n\r\n\tif n < 1 or n > 100 or x < 1 or x > 1000000 or len(a) != n:\r\n\t\tprint(\"NO\")\r\n\t\treturn\r\n\telse:\r\n\t\tctr = 1\r\n\t\tfor d in a:\r\n\t\t\tx -= max(day-d,0)\r\n\t\t\tif x <= 0:\r\n\t\t\t\tprint(ctr)\r\n\t\t\t\treturn\r\n\t\t\tctr += 1\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nremaining = t\r\nfor i in range(n):\r\n remaining -= (86400 - a[i])\r\n if remaining <= 0:\r\n print(i+1)\r\n break\r\n", "n=input()\r\na,b=n.split()\r\nb=int(b)\r\n\r\nc=input()\r\nc=c.split()\r\n\r\nlist=[]\r\nfor q in c:\r\n q=int(q)\r\n list.append(q)\r\n \r\nsum=0 \r\nans=0 \r\nfor a in range(0,len(list)):\r\n sum+=(86400-list[a])\r\n if sum>=b:\r\n ans=a+1\r\n break\r\n \r\nprint(ans) ", "# https://codeforces.com/problemset/problem/884/A\r\n\r\nn, t = map(int, input().split())\r\n\r\ndays = map(int, input().split())\r\n\r\nans = 1\r\nfor i in days:\r\n if t <= 86400 - i:\r\n print(ans)\r\n break\r\n else:\r\n t -= (86400 - i)\r\n ans += 1", "n,t=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\ndiff=[0]*n \r\nfor i in range(n):\r\n diff[i]=86400-l[i] \r\ni=0 \r\ncnt=1 \r\ncurr=0\r\nwhile i<n and curr<t:\r\n cnt+=1 \r\n curr+=diff[i] \r\n i+=1 \r\nprint(cnt-1)", "N, Time = [int(x) for x in input().split()]\nT = [int(x) for x in input().split()]\n\nfor i in range(len(T)) :\n Time -= (86400-T[i])\n if (Time <= 0) :\n print(i+1)\n break\n", "n, t = [int(s) for s in input().split(' ')]\r\na = [int(s) for s in input().split(' ')]\r\nr = 0\r\ni = 0\r\nwhile r < t:\r\n r += 86400 - a[i]\r\n i += 1\r\nprint(i)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\n\r\nwhile t > 0:\r\n\tt -= (86400 - a[i])\r\n\ti += 1\r\n\r\nprint(i)", "n, t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile t>0:\r\n t=t-(86400-l[i])\r\n i=i+1\r\nprint(i)", "n,t = map(int,input().split())\nrealt = 0\na = [int(i) for i in input().split()]\na = [86400 - i for i in a]\nfor i in range(len(a)):\n\tt -= a[i]\n\trealt += 1\n\tif t <= 0 :\n\t\tprint(realt)\n\t\tbreak", "n,t=map(int,input().split())\r\nL=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=86400-L[i]\r\n if s>=t:\r\n break\r\nprint(i+1)\r\n", "SECONDS_IN_A_DAY = 86400\r\n\r\nfirst_line = input()\r\nno_of_days, time_required = map(int, first_line.split())\r\nworktimes = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nwhile time_required > 0:\r\n work_time = worktimes[counter]\r\n time_left_day = SECONDS_IN_A_DAY - work_time\r\n time_required -= time_left_day\r\n counter += 1\r\n\r\nprint(counter)\r\n", "#! /usr/bin/python3\n\ns_in = str(input()).split()\nn = int(s_in[0])\nt = int(s_in[1])\ns_in = str(input()).split()\ns = 0\n\nfor i in range(0, n):\n s += ( 86400 - int(s_in[i]) )\n if s >= t:\n print(i+1)\n quit()\n", "n, t = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\nans = 0\r\nwhile(t>0):\r\n t -= 86400-a[ans]\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n+1):\r\n\tif m>0:\r\n\t\tm=m-86400+a[i]\r\n\telse:\r\n\t\tbreak\t\r\nprint(i)", "n, t = map(int, input().split())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nfor i in range(n):\r\n por += 86400 - moo[i]\r\n if por >= t:\r\n print(i+1)\r\n break", "days,bookt=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\nfor x in range(days):\r\n lft=86400-time[x]\r\n \r\n if lft>=bookt:\r\n print(x+1)\r\n break\r\n \r\n bookt-=lft", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nll=[86400-i for i in l]\r\nc=0\r\nfor i in ll:\r\n if t>0:\r\n t-=i\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "a=input()\r\nn=0\r\nwhile a[0]!=' ':\r\n n*=10\r\n n+=int(a[0])\r\n a=a[1:]\r\na=a[1:]\r\nt=0\r\nfor i in a:\r\n t*=10\r\n t+=int(i)\r\na=input()\r\ndays=[]\r\nfor i in range(n):\r\n b=0\r\n if i!=n-1:\r\n while a[0]!=' ':\r\n b*=10\r\n b+=int(a[0])\r\n a=a[1:]\r\n a=a[1:]\r\n else:\r\n for i in a:\r\n b*=10\r\n b+=int(i)\r\n days.append(b)\r\ni=0\r\nwhile t>0:\r\n i+=1\r\n if i<=n:\r\n t=t-(86400-days[i-1])\r\n else:\r\n t-=86400\r\nprint(i)\r\n", "#http://codeforces.com/problemset/problem/884/A\ninp = list(map(int, input().split() ))\ndays = inp[0]\nreadBook = inp[1]\ntime = list(map(int, input().split() ))\ntimRem = 0\ncounter = 0\nfor x in range(days):\n\tif(timRem >= readBook):\n\t\tbreak\n\telse:\n\t\ttemp = 86400-time[x]\n\t\ttimRem += temp\n\t\tcounter += 1\nprint(counter)", "\r\n\r\nif __name__ == '__main__':\r\n n, t = list(map(int, input().split()))\r\n one_day = 86400\r\n arr = list(map(int, input().split()))\r\n time_acc = 0\r\n for i in range(len(arr)):\r\n time_acc+=(one_day-arr[i])\r\n if time_acc>=t:\r\n print(i+1)\r\n break", "n,t=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nfor i in range(n):\r\n if t>(86400-li[i]):\r\n t-=(86400-li[i])\r\n else:\r\n print(i+1)\r\n break\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nprogress = 0\r\nwhile progress < t:\r\n count += 1\r\n progress += 60 * 60 * 24 - a[count - 1]\r\n\r\nprint(count)\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(lambda x:86400-x,l))\r\nc=0\r\nm=0\r\nfor i in range(n):\r\n c+=k[i]\r\n if c>=t:\r\n m=i+1\r\n break\r\nprint(m)", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\nn, t = map(int, input().split(\" \"))\r\nans = -1\r\nL = [int(x) for x in input().split()]\r\nfor i in range(n) : \r\n t -= 86400 - L[i]\r\n if (ans == -1) and (t <= 0) : ans = i + 1\r\nprint(ans)", "n,t=map(int,input().split())\r\nls=list(map(int,input().split()))\r\ncnt=0\r\nfor i in ls:\r\n cnt += 1\r\n t -= (86400 - i)\r\n if t<=0:\r\n print(cnt)\r\n break\r\n", "n,t=map(int,input().split())\r\n\r\nd=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in d:\r\n if t>0:\r\n t=t-(86400-i)\r\n count+=1\r\n \r\n\r\nprint(count)", "l=list(map(int,input().split()))\nl1=list(map(int,input().split()))\ns=0\nc=0\nfor i in range(int(l[0])):\n s=s+(86400-int(l1[i]))\n c+=1\n if s>=int(l[1]):\n print(c)\n break\n\n \n \n", "days, sec=(input().split())\r\nworkingTime=(input().split())\r\ncount,seconds,remainder=0,0,0\r\nfor i in workingTime:\r\n seconds+=86400-int(i)\r\nif seconds>=int(sec):\r\n for i in workingTime:\r\n remainder+=86400-int(i)\r\n if remainder<int(sec):\r\n count+=1\r\n else:\r\n count+=1\r\n break\r\nprint(count)", "a, b= input().split()\r\nvalues = [int(x) for x in input().split()]\r\na=int(a)\r\nb=int(b)\r\ndni=0\r\nfor i in range (a):\r\n dni+=1\r\n cas=86400-values[i]\r\n b=b-cas\r\n if b <=0:\r\n break\r\nprint(dni)\r\n\r\n\r\n", "n=list(map(int,input().split()))\r\n\r\nt=n[1]\r\n\r\nl=list(map(int,input().split()))\r\n\r\ncount=0\r\ns=0\r\n\r\nfor i in l:\r\n left=86400-i\r\n t=t-left\r\n count+=1\r\n if t<=0:\r\n break\r\nprint(count)", "#Lorenzo\r\n##########################################################################################################\r\n##########################################################################################################\r\nimport math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools #\r\nsys.setrecursionlimit(10 ** 7) #\r\nfrom sys import stdin, stdout #\r\ninput = stdin.readline #\r\ndef MAP(): return map(int, input().split()) #\r\ndef LI(): return list(map(int, sys.stdin.readline().split())) #\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)] #\r\n##########################################################################################################\r\n##########################################################################################################\r\n\r\nn,t=MAP()\r\nsec=LI()\r\nc=1\r\nfor j in range(n):\r\n sec[j]=86400-sec[j]\r\n if(sec[j]>=t):print(c);break\r\n else:c+=1;t-=sec[j]", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n c=c+(86400-l[i])\r\n if c>=t:\r\n print(i+1)\r\n break\r\n \r\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nsecs = 0\r\ndays = 0\r\nfor tm in l:\r\n\tif secs >= t:\r\n\t\tbreak\r\n\tsecs += 86400 - tm\r\n\tdays += 1\r\nprint(days)\r\n", "n, t = map(int, input().split())\r\na = list(map(int ,input().split()))\r\ntime = result = 0\r\nfor i in range(n):\r\n\ttime+=86400-a[i]\r\n\tresult+=1\r\n\tif time>=t:\r\n\t\tbreak\r\nprint(result)", "n, t = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\nfor i in range(n):\r\n t -= (86400 - mas[i])\r\n if t <= 0:\r\n print(i+1)\r\n break", "n, t = map(int,input().split())\r\nA=list(map(int,input().split()))\r\ncur = 1\r\nct = 0\r\nwhile t > 0:\r\n free = 86400 -A[ct]\r\n ct+=1 \r\n if free >= t:\r\n print(cur)\r\n break\r\n else:\r\n t -= free\r\n cur += 1\r\n ", "n,t = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ncur = 0\r\ni=0\r\nwhile (t>cur):\r\n cur +=86400 - s[i]\r\n i+=1\r\nprint(i)\r\n", "n,t = map(int ,input().split())\r\na = list(map(int , input().split()))\r\n\r\ntemp = t\r\nfor i in range(n):\r\n temp = temp - (86400-a[i])\r\n if temp <=0:\r\n break\r\nprint(i+1) \r\n \r\n", "n,t = map(int,input().split()) \r\ndata = list(map(int,input().split()))\r\ns=0\r\nnew=[]\r\nfor i in data:\r\n s+=(86400-i)\r\n new.append(s)\r\nfor i in range(n):\r\n if new[i]>=t:\r\n print(i+1)\r\n break\r\nelse:\r\n print(n)\r\n", "d,t=map(int,input().split())\r\ntime=list(map(int,input().split()))\r\ncounter=0\r\nfor i in time :\r\n rest=86400-i\r\n t-=rest\r\n counter+=1\r\n if t<=0 :\r\n print(counter)\r\n break\r\n", "n,t=map(int,input().split(' '))\r\nl=input().split(' ')\r\nfor i in range(n):\r\n a=int(l[i])\r\n t-=(86400-a)\r\n if t<=0:\r\n break\r\nprint(i+1)\r\n ", "n,t=map(int,input().split())\r\nsec=list(map(int,input().split()))\r\nc=1\r\nfor j in range(n):\r\n sec[j]=86400-sec[j]\r\n if(sec[j]>=t):print(c);break\r\n else:c+=1;t-=sec[j]", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntime=0\r\nans=0\r\nfor i in range(0,len(a)):\r\n if ans>=t:\r\n break\r\n else:\r\n ans=ans+(86400-a[i])\r\n time=time+1\r\nprint(time)", "days,time=map(int,input().split())\r\nwork=list(map(int,input().split()))\r\ncount=0\r\nday=86400\r\nfor i in range(days):\r\n free=0\r\n free=day-work[i]\r\n time-=free\r\n if time <= 0:\r\n count+=1\r\n break\r\n else:\r\n count+=1\r\nprint(count)", "n,t = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nnew_a = []\r\nfor i in a:\r\n new_a.append(86400-i)\r\ni = 1\r\nx = new_a[0]\r\nwhile x<t:\r\n x+=new_a[i]\r\n i+=1\r\nprint(i)\r\n\r\n", "# -*- coding: utf-8 -*-\n\ndef f(t, arr):\n\n mtime = 86400\n \n r = 1\n for x in arr:\n t -= mtime - x\n if t <= 0:\n break\n r += 1\n\n print(r)\n\n\nif __name__ == '__main__':\n \n n, t = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n\n # for i in range(n):\n # list(map(int, input().split()))\n\n f(t, arr)", "n, t = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\ni = 0\r\nsum1 = 0\r\nwhile sum1 < t and i < len(num):\r\n sum1 += (86400 - num[i])\r\n i += 1\r\nprint(i) ", "d,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=list(map(lambda x:(24*60*60)-x,l))\r\nfor i in range(len(l)):\r\n\tt-=l[i]\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t = tuple(map(int,input().split()))\na = [int(x) for x in input().split()]\nc,k = 0,0\nfor i in a:\n\tc += 86400 - i\n\tk+=1\n\tif c>=t:\n\t\tbreak\nprint(k)", "n,t=map(int,input().split())\r\na=[int(c) for c in input().split()]\r\nfor i in range(n):\r\n t-=86400-int(a[i])\r\n if t<=0:\r\n break\r\nprint(i+1)\r\n\r\n \r\n\r\n", "g = list(map(int ,input().strip().split()))\r\nn=int(g[0])\r\nm=int(g[-1])\r\nl = list(map(int ,input().strip().split()))\r\nc = 0\r\nday = 0\r\n\r\nfor i in range(n):\r\n c += 86400 - l[i]\r\n day += 1\r\n if c >= m:\r\n print(day)\r\n break ", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n\tc+=1\r\n\tt-=86400-i\r\n\tif t<=0:\r\n\t\tprint(c)\r\n\t\tbreak ", "n,t = map(int, input().split())\r\nd=0\r\nl = list(map(int, input().split()))\r\nfor el in l:\r\n if t<=0: break\r\n t-=(86400-el)\r\n d+=1\r\nprint(d)", "N,T=map(int,input().split(\" \"))\r\nL=list(map(int,(input().split(\" \"))))\r\nS=86400\r\nS1=0\r\nfor i in range(0,N):\r\n W=S-L[i]\r\n if(W>=T):\r\n T=T-W\r\n S1=S1+1\r\n break\r\n else:\r\n S1=S1+1\r\n T=T-W\r\nprint(S1)\r\n", "n,t=[int(i) for i in input().split(\" \")]\r\nA=[int(i) for i in input().split(\" \")]\r\n\r\ni=0\r\nwhile t>0 and i<n:\r\n t-=(86400-A[i])\r\n i+=1\r\nprint(i)\r\n", "import sys\r\n\r\nn, t = map(int, input().split())\r\na = [86400 - x for x in map(int, input().split())]\r\nfor i, x in enumerate(a, start=1):\r\n t -= x\r\n if t <= 0:\r\n print(i)\r\n break\r\n", "n, time = map(int, input().split())\r\ntimes = map(int, input().split())\r\nday = 0\r\nfor t in times:\r\n work_time = t\r\n if time > 0:\r\n day += 1\r\n left_out_time = 86400 - work_time\r\n time -= left_out_time\r\n \r\nprint(day)", "# LUOGU_RID: 101736508\nn, t, *a = map(int, open(0).read().split())\r\nfor i, x in enumerate(a):\r\n t -= 86400 - x\r\n if t <= 0:\r\n exit(print(i + 1))", "n,t=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n x+=86400-m[i]\r\n if x>=t:\r\n print(i+1)\r\n break", "class Solver:\r\n def run(self):\r\n n, t = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n k = 0\r\n for i in range(n):\r\n k += 86400 - a[i]\r\n if k >= t:\r\n print(i + 1)\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n Solver().run()\r\n", "def find_min_num_of_days(time_to_read, work_times):\r\n curr = days = 0\r\n for time in work_times:\r\n curr += 86400 - time\r\n days += 1\r\n if curr >= time_to_read:\r\n break\r\n return days\r\n\r\n\r\nn, t = map(int, input().split())\r\n\r\nprint(find_min_num_of_days(t, list(map(int, input().split()))))\r\n", "R=lambda:list(map(int,input().split()))\r\nn,t=R()\r\na=R()\r\nfor i in range(n):\r\n t-=86400-a[i]\r\n if t<1:\r\n print(i+1)\r\n exit(0)\r\n", "n,t=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n\tt=t-86400+a[i]\r\n\tif t<=0:\r\n\t\tb=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\tpass\r\nprint(b)\r\n", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\ni = 0\r\n\r\nwhile i < n:\r\n ans += 86400 - a[i]\r\n if ans >= t:\r\n print(i+1)\r\n exit()\r\n i += 1\r\n", "n, t = map(int, input().split())\r\na = [i for i in map(int, input().split())]\r\ncount = 0\r\nwhile t>0:\r\n t -=(86400 - a[count])\r\n count += 1\r\nprint(count)\r\n", "n,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ntot = 86400\r\ncount = 0\r\nday = 0\r\nfor i in range(len(l)):\r\n count+=tot-l[i]\r\n day+=1\r\n if(count>=t):\r\n print(day)\r\n break\r\nelse:\r\n print(day)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile t>0:\r\n a=86400-l[i]\r\n t=t-a \r\n i=i+1\r\nprint(i)", "import math\r\nx,y=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in range(x):\r\n k=86400-p[i]\r\n if k>=y:\r\n print(i+1)\r\n exit()\r\n else:y-=k", "l = input()\r\nl = l.split()\r\nn = int(l[0])\r\nm = int(l[1])\r\n\r\np = list(map(int, input().split()))\r\n\r\nsec = 86400\r\nday = 0\r\nc = 0\r\nfor i in range(n):\r\n c += sec - int(p[i])\r\n day += 1\r\n if(c >= m):\r\n print(day)\r\n break\r\n", "R=lambda:list(map(int,input().split()))\nn,t=R()\na=R()\nfor i in range(n):\n t-=86400-a[i]\n if t<1:\n print(i+1)\n exit(0)\n", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nx, i = 0, 0\r\nwhile x < t:\r\n\tx = x + 86400 - l[i]\r\n\ti += 1\r\n\t\r\nprint(i)", "n, t = list(map(int, (input().split())))\r\na = list(map(int, (input().split())))\r\nfor _ in range(n):\r\n t = t+a[_]-86400\r\n if t <= 0:\r\n print(_ + 1)\r\n break", "n, t = map(int, input().split())\ntimePerDay = list(map(int, input().split()))\n\nres = 0\n\nfor i in range(n):\n if (86400 +res) - timePerDay[i] >= t:\n print(i+1)\n break\n else:\n res += 86400 - timePerDay[i]\n\n", "n, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\n\r\ndays = 0\r\nfor i in input().split():\r\n free_time = 86400 - int(i)\r\n days += 1\r\n t -= free_time\r\n if t <= 0:\r\n break\r\n\r\nprint(days)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 8 16:16:49 2022\r\n\r\n@author: Rami\r\n\"\"\"\r\nSECONDS = 86400\r\ndays=0\r\nn,t = input().split()\r\nn = int(n)\r\nt = int(t)\r\ntemp=0\r\narr = input().split()\r\nfor i in range(n):\r\n arr[i] = int(arr[i])\r\n temp += SECONDS - arr[i]\r\n days += 1\r\n \r\n if(temp>=t ):\r\n print(days)\r\n break;\r\n \r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,t=read_ints()\r\n\ta=[86400-x for x in read_ints()]\r\n\tfor i in range(n):\r\n\t\tt-=a[i]\r\n\t\tif t<=0:\r\n\t\t\tprint(i+1)\r\n\t\t\treturn\r\n\r\nsolve()\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\ntotal=0\r\nfor i in range(n):\r\n total+=86400-a[i]\r\n ans+=1\r\n if total>=t:\r\n break\r\nprint(ans)", "days, t = input().split()\r\ndays, t = int(days), int(t)\r\n\r\na = list(map(int, input().split()))\r\nc = 0\r\n\r\nwhile t > 0:\r\n t -= 86400 - a[c]\r\n c += 1\r\n\r\nprint(c)\r\n", "# your code goes here\r\nn,t = input().split()\r\nn = int(n)\r\nt = int(t)\r\na = list(map(int,input().split()))\r\ncount = 0\r\nsum=0\r\nfor i in a:\r\n\tsum=86400-i\r\n\tt-=sum\r\n\tcount+=1\r\n\tif(t<=0):\r\n\t\tprint(count)\r\n\t\tbreak", "n, t = map(int,input().split())\r\nwork = list(map(int, input().split()))\r\nday = 0\r\nfor i in range(len(work)):\r\n diff = 86400 - work[i]\r\n t -= diff\r\n day += 1\r\n if t <= 0:\r\n break\r\nprint(day)", "n,t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ndays = 0\r\ntime = 0\r\nfor i in l:\r\n days += 1\r\n time += 86400 - i\r\n if time >= t:\r\n break\r\nprint(days)", "n=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nt = n[1]\r\nj=0\r\nfor i in range(n[0]):\r\n s=86400-f[i]\r\n if t>0:\r\n t=t-s\r\n j=j+1\r\nprint(j)\r\n", "n, t = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nres = 0\r\nleft = t\r\n\r\nfor item in nums:\r\n left -= (86400) - item\r\n res += 1\r\n if(left <= 0):break\r\n\r\nprint(res)\r\n", "n,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nk=0\r\nval=0\r\nfor i in arr:\r\n diff = 86400-i\r\n val = val+diff\r\n k+=1\r\n if(val >= t):\r\n print(k)\r\n break\r\n else:\r\n continue\r\n", "input1 = input()\r\nn, m = map(int, input1.split(' '))\r\n\r\ninput2 = input()\r\ninput2 = [int(i) for i in input2.split(' ')]\r\n\r\ntime_reading = 0\r\ni = 0\r\nwhile (time_reading < m) and ((i+1) <= n):\r\n \r\n time_reading += ((24*60*60) - input2[i])\r\n i += 1\r\n\r\nprint(i)\r\n ", "n=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nc=0\r\ni=0\r\nt=0\r\nwhile t<n[1]:\r\n t+=86400-a[i]\r\n c+=1\r\n i+=1\r\nprint(c)", "n , t = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\ns = 0\r\n\r\nfor i in range(n):\r\n\r\n s += 86400 - l[i]\r\n\r\n if s >= t :\r\n print(i + 1 )\r\n break\r\n", "n, t = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres = 0\nwhile t > 0:\n t -= 86400 - next(a)\n res += 1\nprint(res)\n", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nc = 0\r\nwhile t > 0:\r\n t -= 86400-a[c]\r\n c += 1\r\nprint(c)", "\r\n# first enter the n no of days and time to read\r\ninp = list(map(int , input().split()))\r\n\r\n# n\r\nn = inp[0]\r\n\r\n# time\r\nt = inp[1]\r\n\r\ntime = list(map(int , input().split()))\r\n\r\ncount = 0\r\nsum = 0\r\n\r\nfor x in range(n):\r\n if sum >= t:\r\n break\r\n\r\n else:\r\n sum += 86400 - time[x]\r\n count +=1\r\n\r\n\r\nprint(count)\r\n\r\n", "n,t=map(int,input().split());count=0;p=86400\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n count+=1\r\n if i < p:\r\n z=p-i\r\n if z == t or t-z < 0:break\r\n else:\r\n t=t-z\r\nprint(count) ", "'''input\n2 86400\n0 86400\n'''\nn, t = map(int, input().split())\na = list(map(int, input().split()))\ni = 0\nwhile t > 0:\n\tt -= 86400 - a[i]\n\ti += 1\nprint(i)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n\ttime=86400-i\r\n\tt=t-time\r\n\tcount+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(count)", "n, t = list(map(int,input().split()))\nm = list(map(int,input().split()))\nf = 0\nc = 0\nfor i in range(n):\n if m[i] < 86400:\n d = 86400\n d = d - m[i]\n f = f + d\n c += 1\n if f >= t:\n print(c)\n break\n else: \n c += 1\n if f >= t:\n print(c)\n break\n\n", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nk=0\r\ns=86400-a[0]\r\nwhile s<t:\r\n k+=1\r\n s+=86400-a[k]\r\nprint(k+1)\r\n", "_, t = map(int, input().split())\r\n\r\nresult = 0\r\nfor index, value in enumerate(map(int, input().split())):\r\n t -= (86400 - value)\r\n if t <= 0:\r\n result = index + 1\r\n break\r\n\r\nprint(result)\r\n", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn,k=invr()\r\nara=inara()\r\n\r\ni=0\r\nwhile k>0:\r\n\tk-=(86400-ara[i])\r\n\ti+=1\r\n\r\nprint(i)\r\n", "n, t = map(int, input().split())\r\nt_spend = input().split()\r\nfor i in range(n):\r\n if 86400 - int(t_spend[i]) != 0:\r\n t -= 86400 - int(t_spend[i])\r\n \r\n \r\n if t <= 0:\r\n break \r\nprint(i+1)\r\n ", "def solution(l1,l2):\r\n i=0\r\n timer=l1[1]\r\n while i<len(l2):\r\n timey=86400\r\n if timey-l2[i]>=timer:\r\n return i+1\r\n timer=max(0,timer-(timey-l2[i]))\r\n \r\n i+=1\r\n \r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "x=input().split()\r\ny=input().split()\r\n\r\na=int(x[0])\r\nb=int(x[1])\r\nc=0\r\nfor i in y:\r\n i=int(i)\r\n b=b-(86400-i)\r\n c=c+1\r\n if b<=0:\r\n print(c)\r\n break\r\n\r\n", "n, t = map(int,input().split())\na = list(map(int, input().split()))\nm = t\ni = 0\nwhile m > 0:\n m -= 86400\n m += a[i]\n i += 1\nprint(i)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tk=86400-l[i]\r\n\tc+=k\r\n\tif t<=c:\r\n\t\tprint(i+1)\r\n\t\tbreak", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nans = 0\r\nfor i in a:\r\n s += 86400 - i\r\n ans += 1\r\n if s >= t:\r\n break\r\nprint(ans)", "n,t=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\no=0\r\nfor i in range(len(s)):\r\n\to+=86400-s[i]\r\n\tif o>=t:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t = map(int,input().split())\r\nd = [*((86400-int(x)) for x in input().split())]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += d[i]\r\n i += 1\r\nprint(i)", "n,t = map(int,input().split())\r\ncur = 0\r\npf = list(map(int,input().split()))\r\nans = n\r\nfor i in range(n):\r\n a = pf[i]\r\n cur = cur + 86400 - a\r\n if cur >= t:\r\n ans=i+1\r\n break\r\nprint(ans)", "\r\nRead = lambda:map(int, input().split())\r\nfrom functools import reduce\r\n\r\nif __name__ == '__main__':\r\n while True:\r\n try:\r\n n, t = Read()\r\n except:\r\n break\r\n L = list(86400 - x for x in Read())\r\n ans, sum = 0, 0\r\n for x in L:\r\n sum += x\r\n ans += 1\r\n if sum >= t:\r\n print(ans)\r\n break\r\n", "n,t=map(int,input().split())\nls=list(map(int,input().split()))\ni=0\nsum1=0\nwhile(i<n):\n\tsum1+=(86400-ls[i])\n\tif(sum1>=t):\n\t\tprint(i+1)\n\t\texit()\n\ti+=1", "nod, needed = [int(x) for x in input().split()]\r\nworktime = [int(x) for x in input().split()]\r\ndays = 0\r\nfor i in range(nod):\r\n needed -= (86400 - worktime[i])\r\n days += 1\r\n if needed <= 0:break\r\nprint(days) ", "n, t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nc, s = 0, 0\r\nfor i in range(n):\r\n s += (86400 - w[i])\r\n c += 1\r\n if t <= s:\r\n print(c)\r\n break", "a,b=input().split(\" \")\r\nc=input()\r\nc=c.split(\" \")\r\nx=0\r\nz=0\r\nb=int(b)\r\nwhile b>0:\r\n z+=1\r\n b-=(86400-int(c[x]))\r\n x+=1\r\nprint(z)\r\n \r\n", "day = 86400\r\nn , t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nneed = 0\r\nfor i in a:\r\n\tt -= (day - i)\r\n\tneed += 1\r\n\tif t <= 0 :\r\n\t\tbreak\r\nif t > 0:\r\n\tneed += (t // day) + (t % day != 0)\r\nprint(need)", "func = lambda x: int(x)\r\n\r\nl1 = list(map(func, input().split()))\r\nn = l1[0]\r\nt = l1[1]\r\n\r\nl2 = list(map(func, input().split()))\r\n\r\naccumulator = 0\r\nfor i in range(n):\r\n time = 86400 - l2[i]\r\n accumulator = accumulator + time\r\n if accumulator >= t:\r\n print(i + 1)\r\n break\r\n", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,c,s=0,0,86400 \r\nfor i in l : \r\n x+=s-i;\r\n c+=1\r\n if x>=t:\r\n break;\r\nprint (c) ", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/8 08:35\r\n\r\n\"\"\"\r\n\r\nN, T = map(int, input().split())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\n\r\nfor i in range(N):\r\n T -= 86400 - A[i]\r\n if T <= 0:\r\n print(i+1)\r\n exit(0)\r\n\r\nprint(N)", "n , m = map(int , input().split())\r\nl = list(map(int , input().split()))\r\ncounter = 0 \r\nref = 86400 \r\nfor i in l : \r\n x= ref - i \r\n rest = m - x \r\n m = rest\r\n if rest > 0 : \r\n counter +=1\r\n else :\r\n counter+=1\r\n break\r\nprint(counter) \r\n", "def main():\n MAX = 86400\n n, t = map(int, input().split())\n a = list(map(int, input().split()))\n ans = 1\n for x in a:\n t -= (MAX - x)\n if t <= 0:\n print(ans)\n return\n ans += 1\n\nmain()\n", "n, t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ncount = 0\r\n\r\nwhile t > 0:\r\n t -= (86400 - w[count])\r\n count += 1\r\n \r\nprint(count)", "n,x=map(int, input().split())\na=[int(x) for x in input().split()]\nans=0\nwhile x>0:\n\tx-=86400-a[ans]\n\tans+=1\nprint(ans)", "import sys\nn,t=map(int,input().split())\na = [*map(int,input().split())]\nans=0\nfor i in range(n):\n ans+=86400-a[i]\n if ans>=t:\n print(i+1)\n break", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsf = 0\r\nfor i, x in enumerate(a):\r\n sf += (86400 - x)\r\n if sf >= t:\r\n print(i+1)\r\n break", "(n, t) = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nsecondInDay = 24 * 60 * 60\r\n\r\nresult = 0\r\nwhile t > 0:\r\n t -= secondInDay - a[result]\r\n result += 1\r\nprint(result)", "n, t = [int(z) for z in input().split()]\r\na = [86400 - int(z) for z in input().split()]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += a[i]\r\n i += 1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\na=lambda:map(int,input().split())\r\nl=list(a())\r\ncount = 0\r\nfor i in range(n):\r\n if (t-(86400-l[i])>0):\r\n t = t-(86400-l[i])\r\n count += 1\r\n else:\r\n count += 1\r\n break\r\nprint (count) ", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\ndays=0\r\nfor i in range(0,n):\r\n x=86400-a[i]\r\n sum+=x\r\n days+=1\r\n if sum>=t:\r\n print(days)\r\n break\r\n \r\n ", "num_of_days, time_reading = input().split(' ')\r\ntimes = input().split(' ')\r\nn = 0\r\ns = int(time_reading)\r\nfor i in range(len(times)):\r\n if int(times[i]) + int(s) <= 86400:\r\n print(i + 1)\r\n n += 1\r\n break\r\n elif 86400 - int(times[i]) > 0:\r\n s -= 86400 - int(times[i])\r\n else:\r\n continue\r\n \r\n \r\nif n == 0:\r\n print(0)", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile t>0:\r\n t-=86400-a[i]\r\n i+=1\r\nprint(i)", "import math\nn, t = map(int, input().split())\narr = list(map(int, input().split()))\n\ndef summArr(arr):\n\tans = 0\n\tfor i in arr:\n\t\tans += i\n\treturn ans\n\ndef main():\n\tcount_seconds = 86400\n\tans = 0\n\tsub = t\n\tfor i in arr:\n\t\ttmp = count_seconds - i\n\t\tsub -= tmp\n\t\tif sub <= 0:\n\t\t\tans += 1\n\t\t\tbreak\n\t\tans += 1\n\tprint(ans)\nif __name__ == \"__main__\":\n\tmain()", "n,t = map(int, input().split())\r\na = input()\r\na = list(map(int, a.split()))\r\ni = 0\r\nkol = 0\r\nwhile (t > 0) and (i < n):\r\n t -= (86400 - a[i])\r\n kol += 1\r\n i += 1\r\nprint(kol) \r\n", "#b\nn, t = map(int, input().split())\ndaftar = list(map(int, input().split()))\nhari = 1\n\nfor waktu in daftar:\n kosong = 86400 - waktu\n t -= kosong\n\n if t <= 0:\n print(hari)\n break\n \n hari += 1\n\t \t \t \t \t\t\t \t \t\t \t \t\t", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\ndy = 86400\r\n\r\nbesDay = 0\r\n\r\nfor i in range(len(a)):\r\n x = dy-a[i]\r\n\r\n t -= x\r\n\r\n \r\n\r\n if t <= 0:\r\n besDay = i+1\r\n break\r\n\r\nprint(besDay)\r\n", "n, t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nfor i,c in enumerate(arr):\r\n t -= (86400-c)\r\n if t<=0:\r\n print(i+1)\r\n break", "\r\nn, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += 86400 - a[i]\r\n if s >= t:\r\n print(i + 1)\r\n break\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# گرسنمه :|", "n,t=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n ans+=1\r\n t-=(86400-i)\r\n if t<=0:\r\n break\r\nprint(ans)", "n,t=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nj=0\r\nfor i in range(n):\r\n if t>0:\r\n j=j+1\r\n t=t+l[i]-86400\r\n else:\r\n break\r\nprint(j)", "n,x=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\nans=0\r\nwhile x>0:\r\n\tx-=86400-a[ans]\r\n\tans+=1\r\nprint(ans)", "x1=input()\r\nx=x1.split()\r\ny1=input()\r\ny=y1.split()\r\nsum=0\r\ni=0\r\nwhile(sum<int(x[1])):\r\n\tsum+=(86400-int(y[i]))\r\n\ti+=1\r\nprint(i)\r\n", "n, t = map(int,input().split())\r\ntmp = input()\r\njumlah = 0\r\nans = 0\r\nfor i in map(int,tmp.split()):\r\n\tx = 86400 - i\r\n\tjumlah += x\r\n\tans += 1\r\n\tif (jumlah >= t):\r\n\t\tprint(ans)\r\n\t\tbreak", "n,t=map(int,input().split())\r\nlst=[int(x) for x in input().split()]\r\ncount,test=0,0\r\nfor i in lst:\r\n test+=86400-i\r\n count+=1\r\n if test>=t:\r\n print(count)\r\n break", "n, t = map(int, input().split())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nblu = 0\r\nfor i in range(n):\r\n if blu < t:\r\n por += 1\r\n blu += 86400 - moo[i]\r\n else:\r\n break\r\nprint(por)", "n, t = list(map(int, input().split()))\r\nworktime = list(map(int, input().split()))\r\nfreetime = []\r\nfor i in range (n):\r\n freetime.append(86400 - worktime[i])\r\nsumread = 0\r\ncounter = 0\r\nfor i in range (n):\r\n if (sumread < t):\r\n counter += 1\r\n sumread += freetime[i]\r\nprint (counter)\r\n", "import sys\r\nn, t = map(int, input().split(\" \"))\r\n\r\nday = list( map(int, input().split(\" \")) )\r\n\r\nfor i in range(n):\r\n t -= ( 86400 - day[i] )\r\n if t <= 0:\r\n print(i+1)\r\n sys.exit()", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=86400-l[i]\r\n if(s>=k):\r\n print(i+1)\r\n break", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nsecond = 86400\r\ndays = 0\r\nfor i in range(n):\r\n rest = second - li[i]\r\n t = t - rest\r\n days= days +1\r\n if t<=0:\r\n break\r\n\r\nprint(days)\r\n", "n, t = map(int, input().split())\r\nn = list(map(int, input().split()))\r\nk = 0\r\nwhile t>0:\r\n k+=1\r\n t = t-(24*60*60)+ n[k-1]\r\nprint(k)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 2 12:43:08 2017\r\n\r\n@author: BAB\r\n\"\"\"\r\nn, t = list(map(int,input().split(' ')))\r\ntaba = list(map(int,input().split(' ')))\r\ntimeleft = t\r\nday = 0\r\nwhile timeleft > 0:\r\n timeleft -= (86400 - taba[day])\r\n day += 1\r\n \r\nprint(day)", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, t] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += 86400-a[i]\r\n if s >= t:\r\n print(i+1)\r\n exit(0)", "n, t = map(int, input().split())\nv = map(lambda x: 86400 - int(x), input().split())\nfor i, x in enumerate(v, 1):\n t -= x\n if t <= 0:\n break\nprint(i)\n", "[n, t] = [int(i) for i in input().split(\" \")]\r\nwork = [int(i) for i in input().split(\" \")]\r\n\r\nday = 0\r\nfor i in range(n):\r\n time_left = 86400 - work[i]\r\n t -= time_left\r\n day += 1\r\n if t <= 0:\r\n break\r\nprint(day)\r\n", "n , t = map (int , input().split())\r\na = list(map(int , input().split()))\r\ndays = 0;\r\nfor i in range (n):\r\n time = 86400 - a[i]\r\n t -= time\r\n days+=1\r\n if t <= 0:\r\n print (days)\r\n break\r\n", "[n, t] = [int(x) for x in input().split()]\r\nL = [int(x) for x in input().split()]; i = 0\r\nwhile t > 0: t -= (86400-L[i]); i+=1\r\nprint(i)\r\n", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nDAILY_SECONDS = 86400\r\nres = 0\r\nfor i in a:\r\n res += 1\r\n remaining = DAILY_SECONDS - i\r\n if remaining >= t:\r\n break\r\n t -= remaining\r\nprint(res)", "n,t = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n t = t - (86400 - l[i])\r\n if t <= 0:\r\n print(i+1)\r\n break\r\n \r\n", "n,t = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400-x[i]\r\n i+=1\r\nprint(i)", "# 884a\n\nn, t = map(int, input().split())\na = list(map(int, input().split()))\n\ndays = 0\ni = 0\n\nwhile i < len(a) and t > 0:\n t -= 86400 - a[i]\n days += 1\n i += 1\n\nprint(days)\n", "#n = int(input())\r\nn, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nl = 0\r\nwhile m > 0:\r\n m -= (86400 - c[l])\r\n l += 1\r\nprint(l)", "n=input()\r\nt=input()\r\ntest=n.split(\" \")\r\na=t.split(\" \")\r\ntime=int(test[1])\r\ncount=1\r\nfor k in a:\r\n num=int(k)\r\n time=time-(86400-num)\r\n if time <= 0:\r\n print(count)\r\n break\r\n count=count+1\r\n", "fullday = 86400\r\nn, t = list(map(int, input().split()))\r\ndays = list(map(int, input().split()))\r\ntotal = 0\r\nfor day in range(n):\r\n total += fullday-days[day]\r\n if total >= t:\r\n print(day+1)\r\n break\r\n", "t,n=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n temp=86400-i\r\n if n==0:\r\n break\r\n else:\r\n n-=temp\r\n c+=1\r\n if n<=0:\r\n n=0\r\n else:\r\n continue\r\nprint(c)", "a,b = map(int,input().split())\r\nl = 0\r\ns = list(map(int,input().split()))\r\nfor i in range(a):\r\n\tl = l + 86400 - s[i]\r\n\tif l >= b:\r\n\t\tbreak\r\nprint(i+1)", "(n, t) = map(lambda x: int(x) , str(input()).split(' '))\r\na = list(map(lambda x: int(x) , str(input()).split(' ')))\r\n\r\nday = 0\r\nwhile t > 0:\r\n t -= 86400 - a[day]\r\n day += 1\r\n\r\nprint(day)", "d=(input().split(' '))\r\nn=int(d[0])\r\nsayfa=int(d[1])\r\ni=0\r\nd=list(map(lambda x:int(x),input().split(' ')))\r\nwhile sayfa > 0:\r\n sayfa=sayfa-(86400-d[i])\r\n i+=1\r\nprint(i)", "from math import ceil\r\ns=0\r\nd=0\r\nn,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\td+=1\r\n\ts+=(86400-l[i])\r\n\tif s>=t:\r\n\t\tprint(d)\r\n\t\tbreak\r\n", "a1 = input().split()\r\na = [int(a1[i]) for i in range(len(a1))]\r\nb1 = input().split()\r\nb = [86400 - int(b1[i]) for i in range(len(b1))]\r\ns = 0\r\nfor i in range(a[0]):\r\n s += b[i]\r\n if s >= a[1]:\r\n print(i + 1)\r\n break", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n c=c+1\r\n x=86400-l[i]+x\r\n if(x>=k):\r\n print(c)\r\n break\r\n", "p = input().split(' ')\r\nn = int(p[0])\r\nt = int(p[1])\r\ndays = 0\r\n\r\ns = input().split(' ')\r\nfor i in range(n):\r\n \r\n if int(s[i]) == 86400:\r\n days += 1\r\n else:\r\n t -= 86400 - int(s[i])\r\n if t <= 0:\r\n days += 1\r\n break\r\n else:\r\n days += 1\r\n\r\nprint(days)\r\n\r\n", "R=lambda:list(map(int,input().split()))\nn,t=R()\na=R()\nfor i in range(n):\n t-=(86400-int(a[i]))\n if t<=0:print(i+1);break\n", "from math import ceil\r\n\r\nn, t = map(int, input().split())\r\ntrabalho = list(map(int, input().split()))\r\ndia = 86400\r\n\r\nd = 0\r\nfor d in range(n):\r\n t -= (dia-trabalho[d])\r\n d += 1\r\n if t <= 0:\r\n break\r\n\r\nif t > 0:\r\n d += ceil(t/dia)\r\n\r\nprint(d)\r\n", "n,t = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nsumsec = 0\r\ncount = 0\r\nfor i in li:\r\n if(sumsec >= t):\r\n break\r\n sumsec+=86400-i\r\n count+=1\r\nprint(count)\r\n \r\n", "n, t = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\ntemp = 86400\r\nfor i in range(len(a)):\r\n a[i] -= temp\r\n t += a[i]\r\n ans += 1\r\n if (t <= 0):\r\n break\r\nprint(ans)", "n, t = map(int, input().split())\na = list(map(int, input().split()))\nc = 86400\n\ns = 0\ni = 0\nwhile s < t:\n s += (c - a[i])\n i += 1\n\nprint(i)\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tt-=86400-a[i]\r\n\tif t<=0:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in l:\r\n s+=(86400-i)\r\n c+=1\r\n if s>=t:\r\n break\r\nprint(c)\r\n", "def useful_time(x):\r\n return 86400-int(x)\r\n\r\ntn = list(map(int, input().split(\" \")))\r\nseconds = list(map(useful_time, input().split(\" \")))\r\ni = 0\r\nwhile tn[1] > 0:\r\n tn[1] -= seconds[i]\r\n i += 1\r\nprint(i)\r\n", "n,t=map(int,input().split())\r\nb=[86400-int(i) for i in input().split()]\r\nfor i in range(n):\r\n if t<=b[i]:\r\n print(i+1)\r\n break\r\n b[i+1]+=b[i]", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nt, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount_ = 0\r\nfor i in arr:\r\n temp = 86400 - i\r\n if m == 0:\r\n break\r\n else:\r\n m -= temp\r\n count_ += 1\r\n if m <= 0:\r\n m = 0\r\n else:\r\n continue\r\nprint(count_)\r\n", "def reversed_list(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n n, t = [int(i) for i in input().split(\" \")]\r\n l = [86400 - int(i) for i in input().split(\" \")]\r\n sum = 0\r\n for i in range(len(l)):\r\n sum += l[i]\r\n if sum >= t:\r\n return i + 1\r\n\r\n\r\n\r\nprint(main_function())", "class Luba:\r\n SECONDS=86400\r\n def __init__(self,timeToRead,workingPeriod):\r\n self.__timeToRead=timeToRead\r\n self.__workingPeriod=workingPeriod\r\n self.timeToFinish=1\r\n def TimeToFinish(self):\r\n for workingTime in self.__workingPeriod:\r\n self.__timeToRead-=Luba.SECONDS-workingTime\r\n if self.__timeToRead>0:\r\n self.timeToFinish+=1\r\n return str(self.timeToFinish)\r\n\r\n def __str__(self):\r\n return self.TimeToFinish()\r\n_,speed=map(int,input().split())\r\nworkingPeriod=list(map(int,input().split()))\r\nprint(Luba(speed,workingPeriod))\r\n\r\n\r\n\r\n", "a,t= input().split()\r\nt= int(t)\r\n\r\nb=[abs(86400-int(x)) for x in input().split()]\r\n\r\nc=0\r\ns=0\r\ni=0\r\nwhile s<t:\r\n s=s+b[i]\r\n i=i+1\r\n c=c+1\r\nprint(c)", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n v=86400-a[i]\r\n if v>=t:\r\n break\r\n else:\r\n t-=v\r\n\r\nprint(i+1)\r\n", "n, t = map(int, input().split())\r\ndays = list(map(int, input().split()))\r\nans = 0;\r\n\r\nfor day,time in enumerate(days):\r\n left = 86400 - time\r\n t-=left\r\n if(t <= 0):\r\n ans = day\r\n break\r\nprint(ans+1)\r\n ", "n, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = 0\r\nfor time in a:\r\n d += 1\r\n t -= 86400 - time\r\n if t <= 0:\r\n break\r\nif t <= 0:\r\n print(d)\r\nelse:\r\n print(d + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn,m=invr()\r\nli=inlt()\r\ntot=0\r\ncnt=0\r\nwhile tot<m:\r\n tot+=(86400-li[cnt])\r\n cnt=cnt+1\r\nprint(cnt)\r\n\r\n", "n,t=[int(i) for i in input().split()]\r\na=[(86400-int(i)) for i in input().split()]\r\nd=0\r\nfor i in a:\r\n t-=i\r\n d+=1\r\n if t<=0:\r\n break\r\nprint(d)\r\n \r\n", "# Book Reading\ndef book(t, arr):\n ans = 0\n while t > 0:\n t -= (86400 - arr.pop(0))\n ans += 1\n return ans\n\nn, t = list(map(int, input().split()))\narr = list(map(int, input().split()))\nprint(book(t, arr))", "def reading_time(arr, n):\r\n for i in range(len(arr)):\r\n n -= (86400 - arr[i])\r\n if n <= 0:\r\n return i + 1\r\n return n\r\n\r\nm, n = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(reading_time(nums, n))", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=i=0\r\nwhile(t>0):\r\n\ta=86400-l[i]\r\n\tcount+=1\r\n\tt-=a\r\n\ti+=1\r\nprint(count)", "n=input().split()\r\nn[0]=int(n[0])\r\nn[1]=int(n[1])\r\nli=list(map(int,input().split()))\r\nc=1\r\nx=0\r\nwhile(n[1]>0):\r\n if(li[x]<86400):\r\n n[1]-=(86400-li[x])\r\n if(n[1]>0):\r\n x+=1\r\n c+=1\r\n else:\r\n c+=1\r\n x+=1\r\nprint(c)\r\n \r\n \r\n \r\n \r\n", "n,t=map(int, input().split())\r\na=list(map(int, input().split()))[:n]\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n x=x+86400-a[i]\r\n c+=1\r\n if x>=t:\r\n print(c)\r\n break\r\n ", "d, t = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\ns = 86400\r\nczas = 0\r\ndays = 0\r\n\r\nfor i in range(d):\r\n days += 1\r\n czas += s - h[i]\r\n\r\n if czas >= t:\r\n print(days)\r\n quit()", "n, t = input().split(' ')\r\nn = int(n)\r\nt = int(t)\r\na = list(map(int, input().split()))\r\nb = 0\r\nvrema = 86400\r\nfor c in range(n):\r\n b = b + vrema - a[c]\r\n if b >= t:\r\n print(c + 1)\r\n break\r\n", "n, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nx = 0\r\nc = 0\r\n\r\nwhile x < t:\r\n x += 86400 - a[c]\r\n c += 1\r\n\r\nprint(c)\r\n", "import itertools\r\n\r\nct = 0\r\nn, t = map(int, input().split())\r\na = [86400-x for x in [int(x) for x in input().split()]]\r\nfor x in itertools.accumulate(a):\r\n ct += 1\r\n if x >= t:\r\n res = ct\r\n break\r\nprint(res)\r\n", "n,t=map(int,input().split())\r\nd=[]\r\nfor x in input().split():\r\n d.append(int(x))\r\nk=0\r\ntp=0\r\nfor i in range(n):\r\n k+=1\r\n tp+=86400-d[i]\r\n if tp>=t:\r\n break \r\nprint(k)\r\n \r\n\r\n\r\n\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn, t = IL()\r\na = IL()\r\nfor i, aa in enumerate(a):\r\n t -= 86400 - aa\r\n if t <= 0:\r\n print(i+1)\r\n break", "arr1=list(map(int,input().strip().split()))\r\narr2=list(map(int,input().strip().split()))\r\nn=arr1[0]\r\nt=arr1[1]\r\ntime=0\r\nfor i in range(n):\r\n time+=86400-arr2[i]\r\n if time >= t:\r\n print (i+1)\r\n break\r\n else:\r\n continue\r\n", "n,t=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\ncnt=0\r\nfor x in arr:\r\n\tif 86400-x>=0:\r\n\t\tt-=(86400-x)\r\n\t\tcnt+=1\r\n\tif t<=0:\r\n\t\tbreak\r\nprint(cnt)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n sec_day = 86400\r\n n, t = map(int, stdin.readline().split())\r\n cnt = 0\r\n for cur in stdin.readline().split():\r\n cur = int(cur)\r\n t -= sec_day - cur\r\n cnt += 1\r\n if t <= 0:\r\n stdout.write(str(cnt))\r\n break\r\n\r\nif __name__ == '__main__':\r\n main()", "n, t = map(int, input().split())\r\nans = 0\r\nfor x in [int(i) for i in input().split()]:\r\n t -= 86400-x\r\n ans += 1\r\n if t <= 0:\r\n print(ans)\r\n break\r\n", "n,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = 0\r\nwhile t>0:\r\n t -= (86400-a[i])\r\n i+=1\r\nprint(i)\r\n", "n, t = [int(x) for x in input().split()]\r\na = [86400 - int(x) for x in input().split()]\r\n\r\ns = 0\r\nfor i, x in enumerate(a):\r\n s += x\r\n if s >= t:\r\n print(i+1)\r\n break", "n, t = map(int, input().split())\nar = list(map(int, input().split()))\ni = 0\nwhile t > 0:\n t -= (86400 - ar[i])\n i += 1\nprint(i)", "n,t=map(int,input().split())\r\nd=list(map(int,input().split()))\r\ni=-1\r\nwhile (t>0):\r\n i+=1\r\n t-=86400-d[i]\r\nprint(i+1) \r\n\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres = 0\r\nwhile t>0:\r\n t-=86400-a[res]\r\n res+=1\r\nprint(res)", "n,t=map(int,input().split());s,k=0,0\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n s+=1\r\n k+=86400-a[i]\r\n if k>=t:print(s);exit()", "n, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nret = 0\r\ni = 0\r\nwhile t > 0:\r\n t -= 86400 - a[i]\r\n i += 1\r\n ret += 1\r\nprint(ret)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nx = 0\nans = 0\nfor i in range(0, n):\n\tx += abs(a[i]-86400)\n\tans+=1\n\tif x >= m:\n\t\tbreak\nprint(ans)", "n,t=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nfor i in range(len(l)):\r\n diff=86400-l[i]\r\n if t<=diff:\r\n print(i+1)\r\n break\r\n else:\r\n t-=diff", "n,k=input().split(' ')\r\nn=int(n)\r\nk=int(k)\r\na=list(input().split(' '))\r\na=[int(i) for i in a]\r\ns=0\r\ne=0\r\nfor i in range(0,n):\r\n s+=(86400-a[i])\r\n if s>=k:\r\n e=i\r\n break\r\n\r\nprint(e+1)\r\n", "def r():\r\n n, t = list(map(int, input().split()))\r\n work = list(map(int, input().split()))\r\n for i in range(n):\r\n t -= (86400-work[i])\r\n if t <= 0:\r\n return i+1\r\nprint(r())", "line = list(map(int, input().split()))\r\ndays, time = line\r\nsecList = list(map(int, input().split()))\r\nfor i in range(len(secList)):\r\n secList[i] = 86400 - secList[i]\r\nreqDays = 0\r\nfor i in range(len(secList)):\r\n time -= secList[i]\r\n reqDays += 1\r\n if (time <= 0):\r\n break\r\nprint(reqDays)", "n,t=list(map(int,input().split()))\r\na=input().split()\r\ni=0\r\nwhile t>0:\r\n t-=(86400-int(a[i]))\r\n i+=1\r\nprint(i)", "inp=lambda:map(int,input().split())\r\nn,t=inp()\r\n\r\na=list(inp())\r\n\r\nsum=0\r\nfor i in range(n):\r\n sum+=86400-a[i]\r\n if(sum>=t):\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in a:\r\n k=86400-i\r\n s=s+k\r\n c=c+1\r\n if s>=t:\r\n break\r\nprint(c)", "L = 86400\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor d, i in enumerate(a, 1):\r\n k -= L - i\r\n if k <= 0:\r\n print(d)\r\n exit()\r\nprint(n + 1)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-24 23:49:50\nLastEditTime: 2021-11-24 23:53:42\nDescription: Book Reading\nFilePath: CF884A.py\n'''\n\n\ndef func():\n n, t = map(int, input().strip().split())\n time = list(map(int, input().strip().split()))\n total = 0\n for i in range(len(time)):\n total += 86400 - time[i]\n if total >= t:\n print(i + 1)\n break\n \n\n\nif __name__ == '__main__':\n func()\n ", "s=input().split();n=int(s[0]);t=int(s[1]);x=input().split();ans=1\r\nfor i in range(0,n):\r\n t-=(86400-int(x[i]))\r\n if t<=0:\r\n break\r\n else:\r\n ans+=1\r\nprint(ans)", "def count_days(lst_of_hours,read_time):\r\n num_of_days = 0\r\n for a in lst_of_hours:\r\n read_time -= 86400 - a\r\n num_of_days += 1\r\n if read_time <= 0:\r\n return (num_of_days)\r\n return (num_of_days+ 1 + read_time//86400)\r\n\r\nn,t = map(int,input().strip().split())\r\nworking_hours = list(map(int,input().strip().split()))*100\r\n\r\nprint (count_days(working_hours,t))", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\n\r\ntime=0\r\n\r\nfor i in range(n):\r\n if a[i]<=86400:\r\n if 86400-a[i]>m:\r\n time+=m\r\n else:\r\n time+=86400-a[i]\r\n if time>=m:\r\n print(i+1)\r\n break\r\n\r\n\r\n", "n = [int(x) for x in input().strip().split()]\r\nm = [int(y) for y in input().strip().split()]\r\ncount = 0\r\nfor i in range(n[0]):\r\n count += 86400 - m[i]\r\n if count >= n[1]:\r\n print(i + 1)\r\n break", "(n, t) = map(int, input().split())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\ni = 0\r\nk = 0\r\nwhile t > 0:\r\n t -= (86400 - lst[i])\r\n i += 1\r\n k += 1\r\n\r\nprint(k)\r\n", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nwhile t > 0:\r\n t -= 86400 - a[k]\r\n k += 1\r\nprint(k)", "from itertools import accumulate\r\nn,t = [int(x) for x in input().split()]\r\na = [86400-int(x) for x in input().split()]\r\nfor i,acc in enumerate(accumulate(a)):\r\n if(acc>=t):\r\n print(i+1)\r\n break;", "n, t = map(int, input().split())\r\nfor i, ai in enumerate(map(int, input().split())):\r\n t -= 86400 - ai\r\n if t <= 0:\r\n print(i + 1)\r\n break", "x=input()\r\ny=input()\r\nx=x.split()\r\nn=int(x[0])\r\nt=int(x[1])\r\ny=y.split()\r\nd=[]\r\nfor i in (y):\r\n d.append(86400-int(i))\r\nflag=0\r\nfor i in range(n):\r\n if d[i]<t:\r\n t=t-d[i]\r\n else:\r\n flag=i+1\r\n break\r\n \r\n\r\n \r\nprint(flag) \r\n", "n,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n k=86400-a[i]\r\n t-=k\r\n c+=1\r\n if t<=0:\r\n break\r\nprint(c)", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=0\r\nfor i in l:\r\n t=t-(86400-i)\r\n d=d+1\r\n if t<=0:\r\n print(d)\r\n break", "n,t = map(int,input().split())\r\nd = [*map(int,input().split())]\r\ncnt = 0\r\ni = 0\r\nwhile cnt < t:\r\n cnt += (86400-d[i])\r\n i += 1\r\nprint(i)", "n, t = [int(i) for i in input().split()]\r\n\r\nl = [int(i) for i in input().split(\" \")]\r\n\r\ncur = 0\r\n\r\nfor i in range(n):\r\n cur += 86400 - l[i]\r\n if cur >= t:\r\n print(i + 1)\r\n exit(0)", "n, t = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nd = 0\r\nfor i in a:\r\n t = t - (86400 - i)\r\n d += 1\r\n if( t <= 0):\r\n break;\r\nprint(d)\r\n \r\n", "import sys\r\n\r\ndef main():\r\n n, t, *l = map(int, sys.stdin.read().strip().split())\r\n f = 0\r\n for i in range(n):\r\n f += 86400 - l[i]\r\n if f >= t: return i + 1\r\n \r\nprint(main())\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ntime = a[1]\r\ndays = 0\r\nfor i in b:\r\n time -= (86400-i)\r\n days += 1\r\n if time <= 0:\r\n break\r\nprint(days)\r\n ", "# t --> seconds to read the book (1 ≤ t ≤ 10**6)\r\n# n --> number of days (1 ≤ n ≤ 100)\r\n# a[i] --> The number of seconds that she has to spend working during i-th day (0 ≤ a[i] ≤ 86400)\r\n\r\nn , t = map(int , input().split()) # Days and time input at the same line\r\na = list(map(int , input().split())) # Array input at the same line\r\n\r\nfor i in range(0 , len(a)):\r\n readingTime = 86400 - a[i]\r\n t = t - readingTime\r\n if(t <= 0):\r\n print(i + 1)\r\n break", "n, t = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nfor i in range(n):\r\n t-=86400-ls[i]\r\n if t<=0: print(i+1); break\r\n", "n,t=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(len(a)):\r\n res+=86400-a[i]\r\n if res>=t:\r\n print(i+1)\r\n break", "(n, t) = map(int, input().split())\r\nseconds = list(map(int, input().split()))\r\ncounter = int()\r\n\r\nfor i in range(len(seconds)):\r\n if counter >= t:\r\n print(i)\r\n break\r\n\r\n counter+=86400-seconds[i]\r\nelse:\r\n if counter >= t:\r\n print(i + 1)", "INF = int(1e18)\r\nN = 86400\r\n\r\n\r\n\r\n\r\ndef main():\r\n n, t = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n for i in range(len(a)):\r\n t -= (N - a[i])\r\n if t <= 0:\r\n print(i + 1)\r\n return\r\n\r\n\r\n\r\nmain()", "x,y = map(int, input().split(' '))\r\narr = [86400 for i in range(x)]\r\nA = list(map(int, input().split()))\r\n\r\nfor i in range(len(arr)):\r\n arr[i] = arr[i] - A[i]\r\n\r\nfor i in range(len(arr)):\r\n if y > arr[i]:\r\n y -= arr[i]\r\n else:\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,t = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nday = 0\r\ni = 0\r\nwhile i <= n - 1:\r\n if t <= 0:\r\n break\r\n free = 86400 - w[i]\r\n t = t - free\r\n day = day + 1 \r\n i = i + 1\r\n\r\nprint(day)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,t=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nfor i in range(n):\r\n t-=86400-z[i]\r\n if t<=0:\r\n print(i+1)\r\n break", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, t = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n t -= 86400 - a[i]\r\n if t <= 0:\r\n print(i + 1)\r\n break" ]

{"inputs": ["2 2\n86400 86398", "2 86400\n0 86400", "2 86400\n1 86399", "100 1000000\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", "1 1\n86399", "6 1200\n86400 86400 86000 86000 86000 86400", "6 1200\n86400 86400 86000 86000 86001 86399", "4 172799\n1 1 86400 0", "4 172799\n0 86400 86399 0", "6 1\n1 1 86400 1 86399 1", "4 1\n86400 86399 86400 86400", "4 1\n86400 86400 0 86400"], "outputs": ["2", "1", "2", "12", "1", "5", "6", "4", "4", "1", "2", "3"]}

UNKNOWN

PYTHON3

CODEFORCES

396

d1cb8e128dce4bdba12b0eb1c2f27fc2

k-Factorization

Given a positive integer *n*, find *k* integers (not necessary distinct) such that all these integers are strictly greater than 1, and their product is equal to *n*. The first line contains two integers *n* and *k* (2<=≤<=*n*<=≤<=100000, 1<=≤<=*k*<=≤<=20). If it's impossible to find the representation of *n* as a product of *k* numbers, print -1. Otherwise, print *k* integers in any order. Their product must be equal to *n*. If there are multiple answers, print any of them. Sample Input 100000 2 100000 20 1024 5 Sample Output 2 50000 -1 2 64 2 2 2

[ "from math import sqrt\r\n\r\n\r\ndef eratosfen(x):\r\n arr = [True] * (x + 1)\r\n result = []\r\n for i in range(2, x + 1):\r\n if arr[i]:\r\n result.append(i)\r\n for j in range(2 * i, x + 1, i):\r\n arr[j] = False\r\n return result\r\n\r\nn, k = map(int, input().split())\r\nsimples = eratosfen(n)\r\ndivs = []\r\nfor simple in simples:\r\n while n % simple == 0:\r\n n //= simple\r\n divs.append(simple)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() * divs.pop())\r\n print(*divs)\r\n", "n, k = map(int, (input().split()))\r\nd = []\r\ni = 2\r\nwhile i <= n:\r\n while n % i == 0:\r\n d.append(i)\r\n n //= i\r\n else:\r\n i += 1\r\nif len(d) < k:\r\n print(-1)\r\nelse:\r\n while len(d) > k:\r\n d[-2] *= d[-1]\r\n d.pop()\r\n print(*d)\r\n", "from math import sqrt\n\n\ndef k_factor(n, k):\n if k == 1:\n return [n]\n factor_candidate = 2\n smallest_factor = None\n while factor_candidate < sqrt(n + 1):\n if not (n % factor_candidate):\n smallest_factor = factor_candidate\n break\n factor_candidate += 1\n if smallest_factor is None:\n return [-1]\n\n other_factors = k_factor(n // smallest_factor, k - 1)\n\n if other_factors[0] == -1:\n return [-1]\n\n return [smallest_factor, *other_factors]\n\n\nn, k = map(int, input().split())\n\nprint(' '.join([str(i) for i in k_factor(n, k)]))\n", "n,k = map(int, input().split())\r\nl = []\r\nfor i in range(2, n + 1):\r\n\tif n % i == 0:\r\n\t\twhile n % i == 0 and len(l) < (k - 1):\r\n\t\t\tn //= i\r\n\t\t\tl.append(i)\r\nif n > 1:\r\n\tl.append(n)\r\nif len(l) == k:\r\n\tprint(*l)\r\nelse:\r\n\tprint(-1)\n# Mon Jul 11 2022 09:14:29 GMT+0000 (Coordinated Universal Time)\n", "import sys\r\nn,k=[int(x) for x in sys.stdin.readline().split()]\r\ncounter=1\r\ntobeprinted=[]\r\nwhile counter!=k:\r\n\tfor i in range(2,int(n)+1):\r\n\t\tif n%i==0:\r\n\t\t\ttobeprinted.append(i)\r\n\t\t\tn=n//i\r\n\t\t\tcounter+=1\r\n\t\t\tbreak\r\n\tif n==1:\r\n\t\tprint(\"-1\")\r\n\t\texit()\r\ntobeprinted.append(n)\r\nprint(*tobeprinted)", "def f(n): \r\n l, d = [], 2 \r\n while d**2 <= n: \r\n if n%d == 0 : l.append(d); n//=d \r\n else : d += 1 \r\n if n!=1 : l.append(n) \r\n return l \r\nn, k = [int(i) for i in input().split()] \r\nQ = f(n)\r\nif len(Q) >= k : \r\n for i in range(k-1) : print(Q[i], end = ' ')\r\n r = Q[k-1:] \r\n w = 1\r\n for i in range(len(r)) : w *= r[i] \r\n print(w)\r\nelse : print(-1)", "n,k=map(int,input().split())\r\nl=[]\r\nfor j in range(k-1):\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:\r\n\t\t\tn=n//i\r\n\t\t\tl.append(i)\r\n\t\t\tbreak\r\nif len(l)==k-1: print(*l,n)\r\nelse: print(-1)", "import math\r\nn,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\nlst=[]\r\nc=0\r\nwhile(c!=k and n>1):\r\n t=0\r\n if c==k-1:\r\n lst.append(n)\r\n c+=1\r\n break\r\n for j in range(2,math.ceil(math.sqrt(n))+1):\r\n if n%j==0:\r\n t=j\r\n break\r\n if t==0 and n!=1:\r\n lst.append(n)\r\n c+=1\r\n break\r\n else:\r\n lst.append(t)\r\n c+=1\r\n n=n//t\r\nif c!=k:\r\n print(-1)\r\nelse:\r\n for j in range(k):\r\n print(lst[j],end=\" \")\r\n ", "import heapq;\r\nimport itertools\r\nimport math;\r\nfrom collections import deque, Counter;\r\nimport sys;\r\n\r\ninput = sys.stdin.readline;\r\n\r\nmod = 10**9 + 7;\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef primeFactors(num):\r\n\r\n primes = []\r\n for i in range(2, int(math.sqrt(num)) + 2):\r\n while(num % i == 0):\r\n num //= i;\r\n primes.append(i)\r\n\r\n\r\n\r\n if num > 1:\r\n primes.append(num)\r\n\r\n return primes;\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nprimes = primeFactors(n)\r\nif k > len(primes):\r\n print(-1)\r\nelse:\r\n\r\n diff = len(primes) - k;\r\n\r\n lastNum = 1;\r\n\r\n if not diff:\r\n print(*primes)\r\n else:\r\n lastNum = primes.pop()\r\n while(diff):\r\n lastNum *= primes.pop()\r\n diff -= 1;\r\n\r\n print(*list(primes + [lastNum]))\r\n\r\n\r\n", "n, k = map(int, input().split())\n\nprime_factors = []\nfor p in range(2, n+1):\n while n % p == 0:\n prime_factors.append(p)\n n //= p\n\nif len(prime_factors) >= k:\n ans = [p for p in prime_factors]\n while len(ans) > k:\n d = ans.pop()\n ans[-1] *= d\n print(*ans)\nelse:\n print(-1)", "n,k=map(int,input().split())\nl=[]\nfor i in range(2,n+1):\n\tif n%i==0:\n\t\twhile n%i==0 and len(l)<(k-1):\n\t\t\tn//=i\n\t\t\tl.append(i)\nif n>1:\n\tl.append(n)\nif len(l)==k:\n\tprint(*l)\nelse:\n\tprint(-1)", "n,k=map(int,input().split())\r\nr=[]\r\nfor i in range(k-1):\r\n for j in range(2,n):\r\n if n%j==0:\r\n n=n//j\r\n r.append(j)\r\n break\r\nif len(r)==k-1:\r\n print(*r,n)\r\nelse:\r\n print(\"-1\")\r\n", "def sieve(n):\n primo = []\n bs = [1]*n\n \n bs[0] = bs[1] = 0\n \n for i in range (2, n):\n if bs[i]:\n for j in range (i * i, n, i):\n bs[j] = 0\n primo.append(i)\n \n return primo\n\ndef fact(n, k):\n \n v = []\n primo = sieve(n)\n counter = k\n if (k == 1):\n print(n)\n return\n\n for p in primo:\n while(n % p == 0):\n v.append(p)\n n /= p\n counter += -1\n if (n == 1): break\n \n if len(v) >= k:\n for i in range (k - 1): print(v[i], end = \" \")\n prod = 1\n for i in range (k - 1, len(v)): prod *= v[i]\n print(prod)\n else:\n print(-1)\n return\n\n\ndef main():\n n, k = input().split(\" \")\n fact(int(n), int(k))\n\nif __name__ == \"__main__\":\n main()\n\t \t \t\t\t \t\t \t \t \t\t\t\t\t \t \t", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef primefac(n):\r\n l=[]\r\n while n%2==0:\r\n l.append(2)\r\n n=n//2\r\n p=3\r\n while p*p<=n:\r\n while n%p==0:\r\n l.append(p)\r\n n=n//p\r\n p+=2\r\n if n>2:\r\n l.append(n)\r\n return l\r\n\r\ndef main():\r\n n,m=[int(k) for k in i().split()]\r\n l=primefac(n)\r\n if len(l)<m:\r\n p(\"-1\\n\")\r\n else:\r\n fin=[]\r\n prod=l[0]\r\n for k in range(1,len(l)-m+1):\r\n prod*=l[k]\r\n fin.append(str(prod))\r\n for k in range(len(l)-m+1,len(l)):\r\n fin.append(str(l[k]))\r\n p(\" \".join(fin)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "def myFact(n):\r\n fact=[];\r\n i=2;\r\n while i*i <=n: #or root under n >=i\r\n if n%i==0:\r\n n=n//i;\r\n fact.append(i);\r\n else:\r\n i+=1;\r\n if n>1:\r\n fact.append(n)\r\n return fact;\r\n\r\n\r\nn,k=map(int,input().split())\r\nfactors=myFact(n)\r\nif len(factors)<k:\r\n print(-1);\r\nelse:\r\n print(*factors[0:k-1:],end=\" \")\r\n prod=1;\r\n for i in range(k-1,len(factors)):\r\n prod*=factors[i];\r\n print(prod);\r\n\r\n\r\n", "N=100010\r\n\r\na = [1]*N\r\n\r\na[0]=a[1]=0 \r\nfor i in range(2, N):\r\n\tif(a[i]):\r\n\t\tfor j in range(i*i,N,i):\r\n\t\t\ta[j] = 0\r\nar = []\r\nfor i in range(1,N):\r\n\tif(a[i]):\r\n\t\tar.insert(len(ar),i)\r\n\r\n\r\nb = []\r\n\r\nx,y = map(int,input().split())\r\n\r\nfor i in ar:\r\n\tif(x==0):\r\n\t\tbreak\r\n\twhile(x%i==0):\r\n\t\tb.insert(len(b),i)\r\n\t\tx/=i\r\n\r\nif(len(b)<y):\r\n\tprint(-1)\r\nelse:\r\n\tres = 1\r\n\tfor i in range(len(b)-y+1):\r\n\t\tres *= b[i]\r\n\tprint(res,end=' ')\r\n\tfor i in range(len(b)-y+1,len(b)):\r\n\t\tprint(b[i],end=' ')\r\n\tprint('')\t", "n,k=map(int,input().split(\" \"))\r\ndiv=[]\r\ndivisor=2\r\n\r\nif k>1:\r\n while n>1:\r\n if n%divisor==0:\r\n n/=divisor\r\n div.append(divisor)\r\n else:\r\n divisor+=1\r\n i=-1\r\n if len(div)>k:\r\n i+=1\r\n while len(div)!=k:\r\n div[1]*=div[0]\r\n div.pop(0)\r\n if len(div)==k:\r\n for i in range(k):\r\n print(div[i],end=\" \")\r\n else:\r\n print(-1)\r\nelse:\r\n print(n)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 2\r\nl = []\r\nwhile(n != 1):\r\n while(n % c == 0):\r\n l.append(c)\r\n n = n // c \r\n c += 1 \r\nif(len(l) < k):\r\n print(-1)\r\nelif(len(l) == 1):\r\n print(*l)\r\nelse:\r\n print(*(l[ : k - 1]), end = ' ')\r\n m = 1 \r\n for i in range(k - 1, len(l)):\r\n m *= l[i]\r\n\r\n print(m) ", "ll=[]\r\nn,k=map(int,input().split())\r\ni=2\r\nwhile i*i<=n:\r\n if n%i==0:\r\n ll.append(i)\r\n n//=i\r\n i=2\r\n else:\r\n i+=1\r\nll.append(n)\r\nif len(ll)<k:\r\n print(-1)\r\nelif len(ll)==k:\r\n print(*ll)\r\nelse:\r\n kk=[]\r\n t=1\r\n for i in range(len(ll)-k+1):\r\n t*=ll[i]\r\n kk.append(t)\r\n kk+=ll[len(ll)-k+1:]\r\n print(*kk)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom heapq import heappush,heappop,heapify\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n# mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\nfile=1\r\n\r\n\r\ndef solve():\r\n\r\n # for t in range(ii()):\r\n\r\n n,k=mi()\r\n x=[]\r\n n1=n\r\n for i in range(2,int(sqrt(n))+1):\r\n c=0\r\n while(n%i==0):\r\n c+=1\r\n n//=i\r\n if c>0:\r\n x.append([c,i])\r\n \r\n if n>1:\r\n x.append([1,n])\r\n cnt=0\r\n for i in range(len(x)):\r\n cnt+=x[i][0]\r\n if k>cnt:\r\n print('-1')\r\n exit(0)\r\n s=1\r\n c=1\r\n for i in range(len(x)):\r\n for j in range(x[i][0]):\r\n if c<k:\r\n print(x[i][1],end=\" \")\r\n s*=x[i][1]\r\n c+=1\r\n else:\r\n print(n1//s)\r\n exit(0)\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n\r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(2,n+1):\r\n\tif n%i==0:\r\n\t\twhile n%i==0 and len(l)<(k-1):\r\n\t\t\tn//=i\r\n\t\t\tl.append(i)\r\nif n>1:\r\n\tl.append(n)\r\nif len(l)==k:\r\n\tprint(*l)\r\nelse:\r\n\tprint(-1)\r\n", "n,k=map(int,input().split()) \r\nimport math\r\ndef primeFactors(n,arr):\r\n\twhile(n%2==0):\r\n\t\tarr.append(2)\r\n\t\tn = n / 2\r\n\tfor i in range(3,int(math.sqrt(n))+1,2):\r\n\t\twhile(n%i==0):\r\n\t\t\tarr.append(i),\r\n\t\t\tn = n / i\r\n\tif n > 2:\r\n\t\tarr.append(n)\r\narr=[]\r\nprimeFactors(n,arr)\r\nans=[]\r\nif(len(arr)>=k):\r\n x=1\r\n for i in range(k-1):\r\n x*=arr[i]\r\n ans.append(arr[i]) \r\n x1=n//x \r\n if(x1==1):\r\n print(-1) \r\n else:\r\n ans.append(x1) \r\n print(*ans)\r\nelse:\r\n print(-1)", "import math\n\n# A function to print all prime factors of\n# a given number n\ndef primeFactors(n):\n\n # Print the number of two's that divide n\n while n % 2 == 0:\n factors.append(2)\n n = n // 2\n\n # n must be odd at this point\n # so a skip of 2 ( i = i + 2) can be used\n for i in range(3, int(math.sqrt(n)) + 1, 2):\n\n # while i divides n , print i ad divide n\n while n % i == 0:\n factors.append(i)\n n = n // i\n\n # Condition if n is a prime\n # number greater than 2\n if n > 2:\n factors.append(n)\n\n\nnk = input()\nnks = list(map(int, nk.split(' ')))\nn = nks[0]\nk = nks[1]\nm = 1\nfactors = []\nprimeFactors(n)\n\nif len(factors) >= k:\n for idx in range(k-1):\n print(factors[idx], end='')\n print(' ', end='')\n for i in range(k-1, len(factors)):\n m *= factors[i]\n print(m)\nelse:\n print(-1)\n \t\t \t \t \t \t \t \t\t \t \t\t\t\t", "n,k=map(int,input().split())\r\na=[]\r\ni=2\r\nwhile i<=n:\r\n if(k==1 and n!=1):\r\n a.append(n)\r\n k-=1\r\n break\r\n if n%i==0:\r\n a.append(i)\r\n n=int(n//i)\r\n k-=1\r\n i=1\r\n i+=1\r\nif(k>0):\r\n print(-1)\r\nelse:\r\n for i in a:\r\n print(i,end=' ')", "import math\r\ndef primeFact(n):\r\n\ta = []\r\n\twhile n%2==0:\r\n\t\ta += [2]\r\n\t\tn /= 2\r\n\tfor i in range(3,int(math.sqrt(n))+1,2):\r\n\t\twhile n%i==0:\r\n\t\t\ta += [i]\r\n\t\t\tn /= i\r\n\tif n>2:\r\n\t\ta += [int(n)]\r\n\treturn a\r\nn,k = map(int,input().split())\r\na = primeFact(n)\r\np = 1\r\nif len(a)<k:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(k-1):\r\n\t\tprint(a[i],end=' ')\r\n\tfor j in range(k-1,len(a)):\r\n\t\tp *= a[j]\r\n\tprint(p,end='')\r\n\tprint()", "n, k = map(int, input().split())\r\ng = []\r\nfor i in range(k - 1):\r\n for j in range(2, n):\r\n if(n % j == 0):\r\n n //= j\r\n g.append(str(j))\r\n break\r\ng.append(str(n))\r\nif(len(g) == k):\r\n print(*g)\r\nelse:\r\n print(-1)", "def prime(no):\r\n i=2\r\n while i*i<=no:\r\n if no%i==0:return False\r\n if no%(no//i)==0:return False\r\n i+=1\r\n return True\r\nn,k=map(int,input().split())\r\ndiv=[];i=2\r\nwhile n>=i:\r\n while n!=0 and i<=n and prime(i) and n%i==0:\r\n n=n//i;div.append(i)\r\n i+=1\r\nif n>1:div.append(n);\r\nif len(div)<k:print(-1);exit()\r\nfor i in range(k-1):\r\n print(div[i],end=\" \")\r\n#for another\r\na=1\r\nfor j in range(k-1,len(div)):a*=div[j]\r\nprint(a)\r\n", "def rozloz(n):\n\twynik = []\n\td = 2\n\twhile d * d <= n:\n\t\twhile n % d == 0:\n\t\t\twynik.append(d)\n\t\t\tn //= d\n\t\td += 1\n\tif n > 1:\n\t\twynik.append(n)\n\treturn wynik\n\n[n, k] = [int(x) for x in input().split()]\n\nczynniki = rozloz(n)\nif len(czynniki) < k:\n\tprint(-1)\nelse:\n\tfor i in range(k - 1):\n\t\tprint(czynniki[i], end = \" \")\n\t\tn //= czynniki[i]\n\tprint(n)", "n, k = map(int, input().split())\r\nfactors = []\r\nd = 2\r\nwhile d * d <= n:\r\n if n % d == 0:\r\n factors.append(d)\r\n n//=d\r\n else:\r\n d += 1\r\nfactors.append(n) \r\nif len(factors)< k :\r\n print(\"-1\")\r\nelse:\r\n while len(factors) > k:\r\n l = factors.pop()\r\n d = factors.pop()\r\n g = l*d\r\n factors.append(g)\r\n \r\n print(\" \".join(map(str, factors)))\n# Mon Jul 11 2022 13:23:10 GMT+0000 (Coordinated Universal Time)\n", "n, k = map(int, input().split())\r\nans = []\r\ni = 2\r\nwhile n != 1 and k:\r\n if k == 1:\r\n ans.append(n)\r\n k -= 1\r\n break\r\n\r\n if not n % i:\r\n n //= i\r\n ans.append(i)\r\n k -= 1\r\n\r\n else:\r\n i += 1\r\n \r\nif not k:\r\n print(*ans)\r\nelse:\r\n print(-1)", "\r\n\r\nn,k=map(int,input().split())\r\nres=[]\r\ni=2\r\nwhile i*i<=n:\r\n while n%i==0:\r\n res.append(i)\r\n n//=i\r\n i+=1\r\nif n>1:\r\n res.append(n)\r\nx=len(res)\r\nif k>x:\r\n print(-1)\r\nelif k==x:\r\n print(*res)\r\nelse:\r\n s=1\r\n for i in range(x-k+1):\r\n s*=res[i]\r\n res=res[x-k+1:]\r\n res.append(s)\r\n print(*res)\r\n \r\n \r\n \r\n ", "import math\r\n\r\ndef main():\r\n def factors(n): \r\n ans = []\r\n \r\n while n % 2 == 0: \r\n ans.append(2)\r\n n = n // 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2): \r\n \r\n while n % i== 0: \r\n ans.append(i) \r\n n = n // i \r\n \r\n if n > 2:\r\n ans.append(n)\r\n return ans\r\n \r\n a,k = map(int,input().split())\r\n fact = factors(a)\r\n if(len(fact)<k):\r\n print(-1)\r\n else:\r\n while(len(fact)!=k):\r\n fact[0]*=fact[-1]\r\n fact.pop()\r\n print(' '.join([str(x) for x in fact]))\r\n \r\n return\r\nmain()", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn,k=map(int,input().split())\r\np=[]\r\nc=0\r\ni=2\r\nwhile(i<=math.sqrt(n)+1 and n>1 and c<k-1):\r\n while(n%i==0 and c<k-1):\r\n n=n//i\r\n c+=1\r\n p=p+[i]\r\n i+=1\r\n#print(c)\r\nif c<k-1 or n<=1:\r\n print(-1)\r\nelse:\r\n print(*(p+[n]))", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef factors(n):\r\n limit = int(sqrt(n)+1)\r\n res = []\r\n for i in range(2, limit+1):\r\n while n % i == 0:\r\n res.append(i)\r\n n //= i\r\n if n > 1:\r\n res.append(n)\r\n return res\r\n\r\n\r\nn, k = invr()\r\n\r\nf = factors(n)\r\n\r\nif k > len(f):\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(f[i], end=\" \")\r\n res = 1\r\n for i in range(k-1, len(f)):\r\n res *= f[i]\r\n if res > 1:\r\n print(res)\r\n", "n, k = map(int, input().split())\r\nm = n\r\nts = []\r\nfor i in range(2, n+1):\r\n while n % i == 0:\r\n ts.append(i)\r\n n //= i\r\nif len(ts) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(ts[i], end=' ')\r\n m //= ts[i]\r\n print(m)\r\n", "import sys\r\nimport math\r\nn, k = map(int, input().split())\r\n\r\nrealn = n\r\nsq = int(math.sqrt(n));\r\ncnt = 0\r\nans = []\r\nfor i in range(2,sq+1):\r\n while n % i == 0:\r\n n //= i\r\n ans.append(i)\r\nif n > 1:\r\n ans.append(n)\r\nif len(ans) < k:\r\n print(-1)\r\n sys.exit()\r\nelse:\r\n cur = 1;\r\n for i in range(k -1):\r\n print(ans[i], end = ' ')\r\n cur *= ans[i]\r\n print(realn // cur)", "n,k=map(int,input().split())\r\nz=[]\r\nx=2\r\ncount=0\r\nwhile n>=x:\r\n\tif count==k-1:\r\n\t\tz.append(n)\r\n\t\tcount+=1\r\n\t\tbreak\r\n\tif n%x==0:\r\n\t\tz.append(x)\r\n\t\tcount+=1\r\n\t\tn=n//x\r\n\telse:\r\n\t\tx+=1\r\n\r\nif k>count:\r\n\tprint(-1)\r\nelse:\r\n\tprint(*z)", "x , y = map(int ,input().split())\r\ns = y\r\nz = []\r\nfor i in range(2 , int(x ** .5) +1):\r\n while x % i == 0 and y > 1:\r\n x //= i\r\n y -= 1\r\n z.append(i)\r\n if y == 0:\r\n break\r\nif x > 1:\r\n z.append(x)\r\nprint(*z if len(z) == s else [-1])\r\n", "import math\r\n\r\n\r\nn , k = map(int,input().split())\r\narr = []\r\nstor = []\r\nfor i in range(2,int(math.sqrt(n))+1,+1):\r\n while n % i == 0:\r\n n = n//i\r\n arr.append(i)\r\n\r\nif n >= 2:\r\n arr.append(n)\r\n\r\nif k > len(arr):\r\n print(-1)\r\nelse:\r\n for j in range(k-1):\r\n print(arr[j],end=\" \")\r\n product = 1\r\n for u in range(k-1,len(arr)):\r\n product = product*arr[u]\r\n\r\n print(product)", "n,k = map(int,input().split())\r\nfactors = []\r\na = [0]*(1000005)\r\nprimes = set()\r\nprimes.add(2)\r\nfor i in range(3,1000000,2):\r\n if a[i]==0:\r\n primes.add(i)\r\n for j in range(i,1000000,i):\r\n a[j]=1\r\nfor i in primes:\r\n while n%i==0:\r\n factors.append(i)\r\n n/=i\r\n if n==1:\r\n break\r\n if n in primes:\r\n factors.append(int(n))\r\n break\r\nif k>len(factors):\r\n print(-1)\r\nelse:\r\n l = 1\r\n ln = len(factors)\r\n while ln>k-1:\r\n l*=factors.pop()\r\n ln-=1\r\n print(*factors,l)", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nfactors = []\r\nfor i in range(2, 1+int(math.sqrt(float(n)))):\r\n while n % i == 0:\r\n factors.append(i)\r\n n = int(n/i)\r\nif n != 1:\r\n factors.append(n)\r\nif len(factors) < k:\r\n print(-1)\r\nelif len(factors) > k:\r\n for i in range(k-1):\r\n print(factors[i], end=' ')\r\n for i in range(k, len(factors)):\r\n factors[k-1] *= factors[i]\r\n print(int(factors[k-1]))\r\nelse:\r\n for i in factors:\r\n print(int(i), end=' ')\r\n", "[n,k]=[int(x) for x in input().split()]\r\ndef rozloz(n):\r\n wynik = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n wynik.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n wynik.append(n)\r\n return wynik\r\nx=rozloz(n)\r\na=1\r\nif len(x)<k:\r\n print(\"-1\")\r\nelse:\r\n for i in range(k-1):\r\n print(x[i],end=\" \")\r\n a*=x[i]\r\n print(n//a)", "def f(n):\r\n l = []\r\n i = 2\r\n while i <= n**0.5:\r\n if n % i != 0:\r\n i += 1\r\n else:\r\n l.append(i)\r\n n //= i\r\n if n != 1:\r\n l.append(n)\r\n return l\r\nx = 1\r\nn,k = map(int,input().split())\r\nl = f(n)\r\nif len(l) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(l[i],end=' ')\r\n for i in range(k-1,len(l)):\r\n x *= l[i]\r\n print(x)\r\n", "n,k = map(int, input().split())\r\n\r\nimport math\r\ndef factorize(n):\r\n d = {}\r\n temp = int(math.sqrt(n))+1\r\n for i in range(2, temp):\r\n while n%i== 0:\r\n n //= i\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n if d == {}:\r\n d[n] = 1\r\n else:\r\n if n in d:\r\n d[n] += 1\r\n elif n != 1:\r\n d[n] =1\r\n return d\r\n\r\nd = factorize(n)\r\nres = []\r\nfor p, q in d.items():\r\n res += [p]*q\r\nif len(res) < k:\r\n print(-1)\r\nelse:\r\n x = 1\r\n for i in range(k, len(res)):\r\n x *= res[i]\r\n res = res[:k]\r\n res[-1] *= x\r\n print(*res)\r\n", "n,k = map(int,input().split())\r\na=[]\r\nflag = 1\r\nl=n\r\nif n < 2**k:\r\n flag = 0\r\nelse:\r\n while(len(a)<k):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n if a != [] :\r\n a.pop()\r\n a.append(i)\r\n n//=i\r\n a.append(n)\r\n break\r\n else: \r\n break\r\n\r\nif k == 1:\r\n print(l)\r\nelif len(a)==k and flag == 1:\r\n for i in a:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)", "n, k = list(map(int, input().split()))\n\nc = 0\nlst = []\nd = 2\nif k == 1:\n\tprint(n)\n\t\nelse:\n\twhile n != 1:\n\t\tif n % d != 0:\n\t\t\td += 1\n\t\t\tcontinue\n\t\tn = n // d\n\t\tc += 1 \n\t\tif c == k - 1:\n\t\t\tlst.append(d)\n\t\t\tlst.append(n)\n\t\t\tbreak\n\t\tlst.append(d)\n\n\n\n\tif len(lst) < k:\n\t\tprint(-1)\n\telif 1 in lst:\n\t\tprint(-1)\n\telse:\n\t\tprint(*lst)\n\n\n\n\t\t \t\t\t \t\t\t \t\t \t \t\t \t", "n,k=map(int,input().split())\r\nfactors=[]\r\nd=2\r\ntemp=n\r\nwhile n!=1:\r\n while n%d==0:\r\n factors.append(d)\r\n n=n//d\r\n d+=1\r\nif len(factors)<k:\r\n print(-1)\r\nelse:\r\n while k>1:\r\n print(factors.pop(0),end=\" \")\r\n k-=1\r\n ans=1\r\n for i in range(len(factors)):\r\n ans=ans*factors[i]\r\n print(ans)\r\n print('\\r')\r\n \r\n \r\n \r\n", "maxn = 100005\r\nsm= list(range(maxn))\r\nfor i in range(2,maxn):\r\n if sm[i]==i:\r\n for j in range(i*2,maxn,i):\r\n sm[j] = min(sm[j],i)\r\nn,k = map(int,input().split())\r\n\r\nans = []\r\ntn = n\r\nwhile sm[tn]!=tn:\r\n ans.append(sm[tn])\r\n tn//=sm[tn]\r\nans.append(tn)\r\nif len(ans)<k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(ans[i],end=' ')\r\n n//= ans[i]\r\n print(n,end=' ')\r\n", "n,k=map(int,input().split())\r\nlis=[]\r\nfor i in range(2,n+1):\r\n\tif not n%i:\r\n\t\twhile not n%i and len(lis)<k-1:\r\n\t\t\tlis.append(i)\r\n\t\t\tn//=i\r\nif n>1:lis.append(n)\r\nif k==len(lis):print(*lis)\r\nelse:print(-1)", "import sys\r\nfrom functools import reduce\r\nI=sys.stdin.readline\r\n\r\nn,k=map(int,I().split())\r\n\r\narr=[]\r\n\r\nfor i in range(2,int(n**.5)+1):\r\n\tif n%i==0:\r\n\t\twhile n%i==0:\r\n\t\t\tarr.append(i)\r\n\t\t\tn//=i\r\n\r\n\r\n\r\nif n>1:\r\n\tarr.append(n)\r\n\r\nif k>len(arr):\r\n\tprint(-1)\r\nelse:\r\n\tres=reduce((lambda x, y: x * y), arr[k-1:]) \r\n\tprint(*arr[:k-1],res)", "def _factors(n, k, d=2):\n root = int(n ** 0.5) + 1\n while n > 1:\n if d > root or k == 1:\n yield n\n break\n n1, n2 = divmod(n, d)\n if n2:\n d += 1\n else:\n yield d\n k -= 1\n n = n1\n\n\nN, K = map(int, input().split())\nfactors = list(_factors(N, K))\nif len(factors) != K:\n print(-1)\nelse:\n print(*factors)\n# Sun Nov 12 2023 22:47:00 GMT+0300 (Moscow Standard Time)\n", "from sys import stdin, stdout\n\ndef readline():\n return stdin.readline()\n\ndef writeline(s):\n stdout.write(s+\"\\n\")\n\nn, k = map(int, readline().split())\n\nN = 100001\nps = [True] * N\nfor i in range(3, int(N**.5)+1, 2):\n if ps[i]:\n for j in range(i*i, N, i):\n ps[j] = False\nprimes = [2] + [i for i in range(3, N, 2) if ps[i]]\n# print(primes)\n\ni = 0\nresult = []\nwhile n > 1 and i < len(primes):\n p = primes[i]\n if n % p == 0:\n n /= p\n result.append(p)\n else:\n i += 1\n\nif len(result) < k:\n result = [-1]\nelif len(result) > k:\n extra = len(result) - k\n for _ in range(extra):\n last = result.pop() \n result[-1] *= last\n\nwriteline(\" \".join(str(x) for x in result))\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport math\r\ndef fact(n):\r\n a = []\r\n while n%2==0:\r\n a += [2]\r\n n /= 2\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n while n%i==0:\r\n a += [i]\r\n n /= i\r\n if n>2:\r\n a += [int(n)]\r\n return a\r\nn,k = map(int,input().split())\r\nl = fact(n)\r\nif len(l)<k:\r\n print(-1)\r\nelse:\r\n while len(l)>k:\r\n x = l.pop(0)\r\n l[0] = l[0]*x\r\n print(*l)\r\n", "def DemC(n):\r\n dem=0\r\n for i in range(2,n):\r\n while n%i==0:\r\n dem+=1\r\n n/=i\r\n return dem\r\ndef In(n,m):\r\n var=1\r\n for i in range(2,n):\r\n while n%i==0 and m!=1:\r\n m-=1\r\n print(i,end=\" \")\r\n n/=i\r\n print(int(n))\r\nn,m=map(int,input().split())\r\nif m==1:\r\n print(n)\r\nelse:\r\n cnt=DemC(n)\r\n if m<=cnt:\r\n In(n,m)\r\n else:\r\n print(-1)\r\n", "n , k = map(int,input().split())\r\nl = []\r\nwhile n != 1:\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n l.append(i)\r\n n //= i\r\n break\r\n i += 1\r\n else:\r\n l.append(n)\r\n n = 1\r\nif len(l) < k:\r\n print(-1)\r\nelse:\r\n if len(l) == k:\r\n print(*l)\r\n else:\r\n for i in range(k-1):\r\n print(l[i],end=\" \")\r\n ans = 1\r\n for i in range(k-1,len(l)):\r\n ans *= l[i]\r\n print(ans)", "\nfrom math import sqrt, ceil\n\n# inp = lambda :list(map(int, input().split()))\n\nn, k = list(map(int, input().split()))\n\nres = []\no = 1\nl = n\nt = 0\ni = 2\nwhile i < ceil(sqrt(n))+1 and t < k-1:\n if not n%i:\n t += 1\n o *= i\n n //= i\n res.append(i)\n else:\n i += 1\n\nif l%o or l == o or t < k - 1:\n print(-1)\nelse:\n res.append(l//o)\n print(' '.join([str(i) for i in res]))", "def function(num):\r\n for i in range(2, num+1):\r\n if num%i == 0:\r\n return i\r\n\r\n\r\nline = input().split(\" \")\r\nn = int(line[0])\r\nk = int(line[1])\r\n\r\narr = []\r\na = 0\r\nwhile True:\r\n a = int(function(n))\r\n if a == n:\r\n arr.append(a)\r\n break\r\n n //= a\r\n arr.append(a)\r\n\r\nif len(arr) < k:\r\n print(-1)\r\nelse:\r\n for i in range(k - 1):\r\n print(arr[i],end=\" \")\r\n product = 1\r\n for i in range(k-1, len(arr)):\r\n product *= arr[i]\r\n print(product)\r\n", "from math import sqrt\r\n\r\n\r\nn, k = map(int, input().split())\r\ndivs = []\r\nfor i in range(2, n + 1):\r\n while n % i == 0:\r\n n //= i\r\n divs.append(i)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() * divs.pop())\r\n print(*divs)\r\n", "def sol(n, k):\n fact = []\n i = 2\n while i <= n:\n while n % i == 0:\n fact.append(i)\n n //= i\n i += 1\n\n if len(fact) < k:\n print(\"-1\")\n else:\n while len(fact) > k:\n m = len(fact)\n fact[m - 2] *= fact[m - 1]\n fact.pop()\n\n for i in fact:\n print(i, end=\" \")\n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n sol(n, k)\n\n\t \t\t \t\t\t \t\t\t \t\t\t", "# LUOGU_RID: 101671566\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(2, int(n**.5) + 1):\r\n while n % i == 0:\r\n n //= i\r\n a += i,\r\nif n > 1:\r\n a += n,\r\nif len(a) < k:\r\n exit(print(-1))\r\nfor x in a[k:]:\r\n a[k - 1] *= x\r\nprint(*a[:k])", "import math\nimport functools\ndef factors(n):\n factorsList = []\n j = 2\n while n > 1:\n for i in range(j, int(math.sqrt(n+0.05)) + 1):\n if n % i == 0:\n n //= i ; j = i\n factorsList.append(i)\n break\n else:\n if n > 1:\n factorsList.append(n); \n break\n return factorsList\n\nn,k = map(int, input().split(' '))\n\nc = factors(n)\nif (len(c) < k):\n print (\"-1\")\n exit()\nelse:\n while(len(c) > k):\n c[0:2] = [functools.reduce(lambda x, y: x*y, c[0:2])]\nprint(*c)\n \t\t \t \t\t \t \t\t\t \t \t", "def findfactors(n,k):\r\n arr=[]\r\n for i in range(2,n):\r\n if(i*i>n):\r\n break\r\n while(n%i==0):\r\n if(len(arr)==k-1):\r\n break\r\n n=n//i\r\n arr.append(i)\r\n if(len(arr)==k-1):\r\n break\r\n if(n>1):\r\n arr.append(n)\r\n return(arr)\r\na,b=map(int, input().split())\r\narr=findfactors(a,b)\r\nif(len(arr)==b):\r\n print(*arr)\r\nelse:\r\n print(-1)\r\n", "import math\r\n\r\nn,k = [int(x) for x in input().split() ]\r\n\r\nfctrs = []\r\n\r\n\r\nwhile n%2 == 0:\r\n n //= 2\r\n fctrs.append(2)\r\n\r\n\r\nfor i in range( 3, math.ceil(math.sqrt(n)+2), 2 ):\r\n\r\n while n%i == 0:\r\n\r\n n //= i\r\n fctrs.append(i)\r\n\r\nif n > 2:\r\n fctrs.append(n)\r\n \r\nif len(fctrs) < k:\r\n print( -1 )\r\nelif len(fctrs ) == k:\r\n print( \" \".join([ str(x) for x in fctrs ]) )\r\nelse:\r\n\r\n newF = []\r\n\r\n v = 1\r\n for i in range(0, len(fctrs)-k+1):\r\n v *= fctrs[i]\r\n\r\n print( v, \" \".join( [str(x) for x in fctrs[len(fctrs)-k+1:] ] ) )\r\n", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(2, n+1):\r\n if n%i == 0:\r\n while n%i == 0 and len(a) <k-1:\r\n n//=i\r\n a.append(i)\r\nif n>1:\r\n a.append(n)\r\nif len(a) == k:\r\n print(*a)\r\nelse:\r\n print(-1)", "a = list()\r\nn, k = map(int, input().split())\r\np = 2\r\nwhile n > 1 and p*p <= n:\r\n if n % p == 0:\r\n a.append(p)\r\n n //= p\r\n else:\r\n p += 1\r\nif n != 1:\r\n a.append(n)\r\nif len(a) < k:\r\n print(\"-1\")\r\nelse:\r\n b = a[k-1:]\r\n c = 1\r\n for i in b:\r\n c *= i\r\n a = a[:k-1]\r\n for i in a:\r\n print(i, end=' ')\r\n print(c)", "n, k = list(map(int, input().split()))\naux = 2\n\nl = []\n\nif 2**k <= n:\n\tfor i in range(k-1):\n\t\twhile aux < n:\n\t\t\tif n % aux == 0:\n\t\t\t\tl.append(aux)\n\t\t\t\tn = n // aux\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tif aux % 2 == 0:\n\t\t\t\t\taux += 1\n\t\t\t\telse:\n\t\t\t\t\taux += 2\n\tl.append(n)\n\nif len(l) == k:\n\tfor i in range(k-1):\n\t\tprint(l[i], end=\" \")\n\tprint(l[k-1])\nelse:\n\tprint(\"-1\")\n\t \t \t\t \t \t \t\t \t \t\t \t \t\t", "\na,b = map(int, input().split())\ndef Factor(n):\n Ans = []\n d = 2\n while d * d <= n:\n if n % d == 0:\n Ans.append(d)\n n //= d\n else:\n d += 1\n if n > 1:\n Ans.append(n)\n return Ans\nf = Factor(a)\nwhile len(f)>b:\n f[0] = f[0]*f[1]\n f.pop(1)\nif len(f)<b:\n print(-1)\nelse:\n for i in range(len(f)):\n print(f[i],end=' ')\n", "\r\n\r\n# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef prime_factors(n):\r\n a = []\r\n while n%2==0:\r\n n//=2\r\n a.append(2)\r\n for i in range(3,int(sqrt(n)+1),2):\r\n while n%i==0:\r\n n//=i\r\n a.append(i)\r\n\r\n if n>2:\r\n a.append(n)\r\n return a\r\n\r\ndef solve():\r\n x = prime_factors(n)\r\n if len(x)<k:\r\n print(-1)\r\n return\r\n\r\n ans = x[:k-1]\r\n\r\n pro = 1\r\n for i in range(k-1,len(x)):\r\n pro*=x[i]\r\n\r\n if pro>1:\r\n ans+=[pro]\r\n\r\n print(*ans)\r\n\r\nif __name__=='__main__':\r\n n,k = map(int,input().split())\r\n solve()", "import sys\r\n\r\nn, k = map(int, input().split())\r\n\r\nans = []\r\nd = 2\r\nfor _ in range(k-1):\r\n while d < n and n % d:\r\n d += 1\r\n ans.append(d)\r\n n //= d\r\n\r\nif n > 1:\r\n print(*(ans + [n]))\r\nelse:\r\n print(-1)\r\n", "n, k = list(map(int, input().split()))\n\nd = 2\nfc = 0\nl = []\n\nif k == 1:\n\tprint(n)\nelse:\n\twhile n > 1 and fc < k:\n\n\t\twhile n%d != 0:\n\t\t\td += 1\n\n\t\tn = n//d\n\t\tfc += 1\n\t\tl.append(d)\n\n\t\t#print(n, d)\n\n\t\td = 2\n\n\t\tif fc == k - 1:\n\t\t\tif n == 1:\n\t\t\t\tprint(-1)\n\t\t\t\texit()\n\t\t\telse:\n\t\t\t\tl.append(n)\n\t\t\t\tbreak\n\n\tif len(l) < k:\n\t\tprint(-1)\n\telse:\n\t\tfor i in l:\n\t\t\tprint(i, end=' ')", "import math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n collector = []\r\n n_can_not_be_divided = False\r\n n_is_less = False\r\n while counter < k:\r\n if n == 1:\r\n n_is_less = True\r\n break\r\n if counter == k - 1:\r\n if n != 1:\r\n counter += 1\r\n collector.append(str(n))\r\n break\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n n //= i\r\n counter += 1\r\n collector.append(str(i))\r\n break\r\n if n_is_less:\r\n print(-1)\r\n else:\r\n print(\" \".join(collector))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import sys\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\ncnt = 0\r\nres = []\r\nwhile n > 1:\r\n if cnt == k - 1:\r\n break\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n res.append(i)\r\n cnt += 1\r\n n //= i\r\n break\r\n\r\nif n > 1:\r\n res.append(n)\r\nif len(res) != k:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str, res)))", "inp = list(map(int, input().split()))\nn = inp[0]\nk = inp[1]\nmas = []\nfor i in range(2, n+1):\n\twhile n%i == 0:\n\t\tmas.append(i)\n\t\tn = n // i\nif len(mas) < k:\n\tprint(-1)\nelse:\n\twhile len(mas) > k:\n\t\tmas[0] = mas[0] * mas[1]\n\t\tmas.remove(mas[1])\n\tfor i in mas:\n\t\tprint(i, end = ' ')\n\n\n\n# Wed Jan 05 2022 10:24:30 GMT+0000 (Coordinated Universal Time)\n", "\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\ndef get_input():\r\n input_str = stdin.read().strip().split(' ')\r\n\r\n n, k = input_str\r\n\r\n return int(n), int(k)\r\n\r\n\r\ndef get_nums(n, k):\r\n is_prime = [True] * (n + 1)\r\n\r\n for i in range(2, n + 1):\r\n if not is_prime[i]:\r\n continue\r\n\r\n for j in range(i * i, n + 1, i):\r\n is_prime[j] = False\r\n\r\n factors = []\r\n\r\n for i in range(2, n + 1):\r\n if not is_prime[i]:\r\n continue\r\n\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n\r\n if len(factors) < k:\r\n return [-1]\r\n\r\n while len(factors) > k:\r\n last = factors.pop()\r\n factors[-1] *= last\r\n\r\n return factors\r\n\r\nprint(' '.join(map(str, get_nums(*get_input()))))\r\n", "n, h = map(int, input().split())\ni = 2\na = []\nwhile i * i <= n:\n while n % i == 0:\n a.append(i)\n n = n // i\n i = i + 1\nif n > 1:\n a.append(n)\nif len(a) < h:\n print(-1)\nelse:\n while len(a) > h:\n h1 = a[0] * a[1]\n a.remove(a[0])\n a[0] = h1\n print(*a)\n# Mon Jul 11 2022 09:46:25 GMT+0000 (Coordinated Universal Time)\n", "def k_factorize(n,k):\r\n factors = []\r\n orig = n\r\n d = 2\r\n while d*d <= orig and n>1 and len(factors)<(k-1):\r\n while n%d == 0 and len(factors)<(k-1):\r\n factors.append(d)\r\n n//=d\r\n d +=1\r\n if n>1:\r\n factors.append(n)\r\n return factors\r\nn,k = map(int,input().split())\r\nans = k_factorize(n,k)\r\nif len(ans) != k:\r\n print(-1)\r\nelse:\r\n print(*k_factorize(n,k))", "n,k=[int(e) for e in input().split()]\r\na=[]\r\ni=2\r\nwhile i*i<=n:\r\n while n%i==0:\r\n n//=i\r\n a.append(i)\r\n i+=1\r\nif n!=1:\r\n a.append(n)\r\ndef prod(a):\r\n res=1\r\n for e in a:\r\n res*=e\r\n return res\r\nif len(a)>=k:\r\n print(*(a[:k-1]+[prod(a[k-1:])]))\r\nelse:\r\n print(-1)", "n,k = map(int,input().split())\r\nmn=[]\r\nd=2\r\nwhile d*d<=n:\r\n while n%d==0:\r\n mn.append(d)\r\n n=n//d\r\n d+=1\r\nif n>1: mn.append(n)\r\nif len(mn)<k: print(-1)\r\nelif len(mn)==k: print(*mn)\r\nelse:\r\n for i in range(k-1):\r\n print(mn[i],end=\" \")\r\n p=1\r\n for i in range(k-1,len(mn)):\r\n p=p*mn[i]\r\n print(p)\r\n \r\n\n# Wed Jan 05 2022 09:25:49 GMT+0000 (Coordinated Universal Time)\n", "\r\ndef pd(n):\r\n arr = []\r\n i = 2\r\n while n != 1:\r\n while n % i == 0:\r\n arr.append(i)\r\n n //= i\r\n i += 1\r\n return arr\r\n\r\nn, k = map(int, input().split())\r\ndivs = pd(n)\r\nif len(divs) < k:\r\n print(-1)\r\nelse:\r\n while len(divs) > k:\r\n divs.append(divs.pop() * divs.pop())\r\n print(*divs)", "n,k = map(int, input().split())\nkq = []\nimport math\nfor i in range(2,math.isqrt(n)+1):\n while n%i == 0:\n n //= i\n kq.append(i)\nif n > 1:\n kq.append(n)\nif len(kq)<k:\n print(-1)\nelse:\n if len(kq) == k:\n print(*kq)\n else:\n print(*kq[:k-1],end=' ')\n d = 1\n for i in range(k-1,len(kq)):\n d = d*kq[i]\n print(d)\n\t \t\t\t \t\t\t\t \t\t \t \t\t\t \t \t\t", "def primes_method5(number):\r\n out = list()\r\n sieve = [True] * (number+1)\r\n for p in range(2, number+1):\r\n if (sieve[p] and sieve[p]%2==1):\r\n out.append(p)\r\n for i in range(p, number+1, p):\r\n sieve[i] = False\r\n return out\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nprimes = primes_method5(n)\r\ndivisors = []\r\nindex = 0\r\nwhile n >= 2:\r\n prime = primes[index]\r\n if n % prime == 0:\r\n divisors.append(prime)\r\n n //= prime\r\n else:\r\n index += 1\r\nif len(divisors) < k:\r\n print(-1)\r\nelse:\r\n last = 1\r\n for d in divisors[k-1:]:\r\n last *= d\r\n print(*divisors[:k-1], last)\r\n\r\n", "def rozloz(n):\r\n wynik = []\r\n d = 2\r\n while d * d <= n:\r\n while n % d == 0:\r\n wynik.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n wynik.append(n)\r\n return wynik\r\n[n,k]=[int(x) for x in input().split()]\r\nh=rozloz(n)\r\nif len(h)<k:\r\n print(-1)\r\nelse:\r\n for i in range(k-1):\r\n print(h[i],end=\" \")\r\n l=1\r\n for i in range(k-1,len(h)):\r\n l*=h[i]\r\n print(l)\r\n", "import math\r\nn,k=map(int,input().split())\r\nif k==1:\r\n print(n)\r\n exit()\r\nx=n\r\nls=[]\r\nwhile len(ls)<k-1:\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if x%i==0:\r\n ls.append(i)\r\n x//=i\r\n break\r\n else:\r\n print(-1)\r\n break\r\n if len(ls)==k-1:\r\n ls.append(x)\r\n break\r\nif len(ls)==k:\r\n print(*ls)", "m,k=map(int,input().split())\r\nn=m\r\nx=[]\r\nfor i in range(k-1):\r\n for j in range(2,n):\r\n if n%j==0:\r\n x.append(j)\r\n n//=j\r\n break\r\np=1\r\nfor i in range(len(x)):\r\n p*=x[i]\r\nif p*n==m and len(x)+1==k: print(*x,n)\r\nelse: print(-1)", "l, k = (int(i) for i in input().split())\r\n\r\ndziel = []\r\nd = 2\r\nwhile d * d <= l:\r\n while l % d == 0:\r\n dziel.append(d)\r\n l //= d\r\n d += 1\r\n\r\nif l > 1:\r\n dziel.append(l)\r\n\r\nif len(dziel) < k:\r\n print(-1)\r\nelse:\r\n while len(dziel) != k:\r\n dziel[0] *= dziel[1]\r\n del(dziel[1])\r\n for i in dziel:\r\n print(i)", "import sys\r\nn,k=map(int, input().split())\r\nx=n\r\nprimes=[]\r\ni=2\r\nwhile i*i<=n:\r\n if n%i==0:\r\n while(n%i==0):\r\n n=n//i\r\n primes.append(i)\r\n i+=1\r\nif n>1:\r\n primes.append(n);\r\nif k>len(primes):\r\n print(\"-1\")\r\n sys.exit()\r\ni=0\r\nk-=1\r\nwhile k:\r\n print(primes[i],end=\" \")\r\n i+=1\r\n k-=1\r\nresult=1\r\nwhile i!=len(primes):\r\n result=result*primes[i]\r\n i+=1\r\nprint(result)", "a, b = map(int, input().split())\r\n\r\n\r\ndef fact(a):\r\n output = []\r\n c = 2\r\n while c ** 2 <= a:\r\n if a % c == 0:\r\n output.append(c)\r\n a //= c\r\n else:\r\n c += 1\r\n if a > 1:\r\n output.append(a)\r\n return output\r\n\r\n\r\nm = fact(a)\r\n\r\nwhile b < len(m):\r\n m[0] = m[0] * m[1]\r\n m.pop(1)\r\n\r\nif len(m) < b:\r\n print(-1)\r\nelse:\r\n print(*[i for i in m])\r\n", "def k_factorization(n, k, mlpts):\r\n if k == 1:\r\n return mlpts + [n]\r\n for d in range(2, round(n**0.5)+1):\r\n if n % d == 0:\r\n mlpts.append(d)\r\n return k_factorization(n//d, k-1, mlpts)\r\n return [-1]\r\n\r\n\r\nn, k = map(int, input().split())\r\nprint(*k_factorization(n, k, []))\r\n", "#Name:S.M.MILOY\n#Department Of CSE,BRUR\n#a,b=list(map(int,input().split()))\n#l=list(map(int,input().split(' ')))\n#n=int(z())\nz=input\n#for i in range(n):\n\nn,k=map(int,z().split())\nl=[]\nfor i in range(2,n+1):\n\tif n%i==0:\n\t\twhile n%i==0 and len(l)<(k-1):\n\t\t\tn//=i\n\t\t\tl.append(i)\nif n>1:\n\tl.append(n)\nif len(l)==k:\n\tprint(*l)\nelse:\n\tprint(-1)\n\n \t \t\t\t \t \t\t\t \t \t\t\t\t\t\t \t \t\t", "def findPrimeFactors(n):\r\n ans=[]\r\n \r\n i=2\r\n while(i<=(n+1)):\r\n while(n%i==0):\r\n ans.append(i)\r\n n=n//i\r\n \r\n i+=1\r\n \r\n return ans\r\n \r\n \r\n \r\nn,k=map(int,input().split())\r\nl=findPrimeFactors(n)\r\n\r\nif(len(l)<k):\r\n print(-1)\r\nelse:\r\n ans=1\r\n for i in l[k-1:]:\r\n ans*=i\r\n print(*l[:k-1],ans)\r\n \r\n ", "def check(Number):\r\n for i in range(2, int(Number ** 0.5) + 1):\r\n if (Number % i == 0):\r\n return i\r\n else:\r\n return Number\r\n \r\nnums = []\r\n\r\nNumber, k = map(int, input().split())\r\n\r\nif k == 1:\r\n print(Number)\r\nelse:\r\n col = 0\r\n\r\n while Number != 1 and col < k:\r\n if col + 1 == k:\r\n nums.append(Number)\r\n\r\n col += 1\r\n\r\n break\r\n else:\r\n num = check(Number)\r\n\r\n Number //= num\r\n\r\n nums.append(num)\r\n\r\n col += 1\r\n\r\n if col > k or col < k:\r\n print(-1)\r\n else:\r\n print(*nums)\n# Mon Nov 13 2023 17:32:25 GMT+0300 (Moscow Standard Time)\n", "def is_prime(n):\r\n i=2\r\n while i**2 <=n:\r\n if not(n%i):\r\n return False\r\n i+=1\r\n return True\r\n\r\nn,k = map(int,input().split())\r\nnums=[]\r\n\r\ni=2\r\nf=1\r\nwhile k:\r\n if k!=1 and is_prime(n):\r\n f=0\r\n break\r\n \r\n while n%i==0 and k>1:\r\n nums.append(i)\r\n n=int(n/i)\r\n k-=1\r\n if k==1:\r\n if n==1:\r\n f=0\r\n nums.append(n)\r\n break\r\n i+=1\r\n while not is_prime(i):\r\n i+=1\r\n \r\n \r\nif not f:\r\n print(-1)\r\nelse:\r\n for num in nums:\r\n print(num,end=\" \")\r\n", "\nn, m = map(int, input().split())\nv = []\n\ni = 2\nwhile i <= n:\n if len(v) == m - 1:\n v.append(n)\n break\n if n % i == 0:\n v.append(i)\n n //= i\n else:\n i += 1\n\nif len(v) == m:\n for num in v:\n print(num, end=\" \")\nelse:\n print(-1)\n \t\t \t\t\t\t\t\t\t\t \t \t \t \t\t \t \t", "def fun(n):\r\n if n==2:\r\n return -1\r\n h=int(n**0.5)+1\r\n for i in range(2,h):\r\n if n%i==0:\r\n return i\r\n return -1\r\nn,k=map(int,input().split())\r\nif k==1:\r\n print(n)\r\nelif 2**k>n:\r\n print(-1)\r\nelse:\r\n l=[]\r\n f=0\r\n while k>1:\r\n if fun(n)!=-1:\r\n l.append(fun(n))\r\n n=n//fun(n)\r\n k-=1\r\n else:\r\n f=1\r\n break\r\n if f==0:\r\n if n!=1:\r\n l.append(n)\r\n print(*l)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\n ", "def factorize(n):\r\n fct = [] # prime factor\r\n b, e = 2, 0 # base, exponent\r\n while b * b <= n:\r\n while n % b == 0:\r\n n = n // b\r\n e = e + 1\r\n if e > 0:\r\n fct.append((b, e))\r\n b, e = b + 1, 0\r\n if n > 1:\r\n fct.append((n, 1))\r\n return fct\r\n \r\nn, k = map(int,input().split())\r\nfact = factorize(n)\r\n\r\nans = []\r\ncnt = 0\r\nfor f, c in fact:\r\n for _ in range(c):\r\n if cnt < k:\r\n ans.append(f)\r\n else:\r\n ans[-1] *= f\r\n cnt += 1\r\n\r\nif len(ans) == k:\r\n print(*ans)\r\nelse:\r\n print(-1)", "def decomp(n, k):\r\n i = 2\r\n mylist = []\r\n while i * i <= n and len(mylist) < k - 1:\r\n if n % i == 0:\r\n mylist.append(i)\r\n n //= i\r\n else:\r\n i += 1\r\n mylist.append(n)\r\n return mylist\r\n\r\n\r\nn, k = map(int, input().split())\r\nresult = decomp(n, k)\r\nif len(result) == k:\r\n print(*result)\r\nelse:\r\n print(-1)\r\n" ]

{"inputs": ["100000 2", "100000 20", "1024 5", "100000 10", "99999 3", "99999 4", "99999 5", "1024 10", "1024 11", "2048 11", "2 1", "2 2", "2 3", "2 4", "2 5", "2 1", "3 1", "3 2", "349 2", "8 1", "66049 2", "6557 2", "9 2", "4 2", "2 2", "4 4", "12 1", "17 1", "8 2", "14 2", "99991 1", "30 2", "97 1", "92 2", "4 1", "4 3", "30 4", "2 6", "3 1", "3 2", "3 3", "3 4", "3 5", "3 6", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "6 1", "6 2", "6 3", "6 4", "6 5", "6 6", "7 1", "7 2", "7 3", "7 4", "7 5", "7 6", "8 1", "8 2", "8 3", "8 4", "8 5", "8 6", "9 1", "9 2", "9 3", "9 4", "9 5", "9 6", "10 1", "10 2", "10 3", "10 4", "10 5", "10 6", "11 1", "11 2", "11 3", "11 4", "11 5", "11 6", "12 1", "12 2", "12 3", "12 4", "12 5", "12 6", "13 1", "13 2", "13 3", "13 4", "13 5", "13 6", "14 1", "14 2", "14 3", "14 4", "14 5", "14 6", "15 1", "15 2", "15 3", "15 4", "15 5", "15 6", "16 1", "16 2", "16 3", "16 4", "16 5", "16 6", "17 1", "17 2", "17 3", "17 4", "17 5", "17 6", "18 1", "18 2", "18 3", "18 4", "18 5", "18 6", "19 1", "19 2", "19 3", "19 4", "19 5", "19 6", "20 1", "20 2", "20 3", "20 4", "20 5", "20 6", "94249 1", "94249 2", "94249 3", "94249 4", "94249 5", "95477 1", "95477 2", "95477 3", "95477 4", "95477 5", "35557 1", "35557 2", "35557 3", "35557 4", "35557 5", "42439 1", "42439 2", "42439 3", "42439 4", "42439 5"], "outputs": ["2 50000 ", "-1", "2 64 2 2 2 ", "2 2 2 2 2 5 5 5 5 5 ", "3 813 41 ", "3 3 41 271 ", "-1", "2 2 2 2 2 2 2 2 2 2 ", "-1", "2 2 2 2 2 2 2 2 2 2 2 ", "2 ", "-1", "-1", "-1", "-1", "2 ", "3 ", "-1", "-1", "8 ", "257 257 ", "83 79 ", "3 3 ", "2 2 ", "-1", "-1", "12 ", "17 ", "2 4 ", "7 2 ", "99991 ", "3 10 ", "97 ", "2 46 ", "4 ", "-1", "-1", "-1", "3 ", "-1", "-1", "-1", "-1", "-1", "4 ", "2 2 ", "-1", "-1", "-1", "-1", "5 ", "-1", "-1", "-1", "-1", "-1", "6 ", "3 2 ", "-1", "-1", "-1", "-1", "7 ", "-1", "-1", "-1", "-1", "-1", "8 ", "2 4 ", "2 2 2 ", "-1", "-1", "-1", "9 ", "3 3 ", "-1", "-1", "-1", "-1", "10 ", "5 2 ", "-1", "-1", "-1", "-1", "11 ", "-1", "-1", "-1", "-1", "-1", "12 ", "2 6 ", "2 2 3 ", "-1", "-1", "-1", "13 ", "-1", "-1", "-1", "-1", "-1", "14 ", "7 2 ", "-1", "-1", "-1", "-1", "15 ", "5 3 ", "-1", "-1", "-1", "-1", "16 ", "2 8 ", "2 4 2 ", "2 2 2 2 ", "-1", "-1", "17 ", "-1", "-1", "-1", "-1", "-1", "18 ", "3 6 ", "3 2 3 ", "-1", "-1", "-1", "19 ", "-1", "-1", "-1", "-1", "-1", "20 ", "2 10 ", "2 2 5 ", "-1", "-1", "-1", "94249 ", "307 307 ", "-1", "-1", "-1", "95477 ", "311 307 ", "-1", "-1", "-1", "35557 ", "31 1147 ", "31 31 37 ", "-1", "-1", "42439 ", "37 1147 ", "37 31 37 ", "-1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

96

d1f7ca2f5bc4490ad9a2954490f49833

Tidying Up

Smart Beaver is careful about his appearance and pays special attention to shoes so he has a huge number of pairs of shoes from the most famous brands of the forest. He's trying to handle his shoes carefully so that each pair stood side by side. But by the end of the week because of his very active lifestyle in his dressing room becomes a mess. Smart Beaver from ABBYY is not only the brightest beaver in the area, but he also is the most domestically oriented. For example, on Mondays the Smart Beaver cleans everything in his home. It's Monday morning. Smart Beaver does not want to spend the whole day cleaning, besides, there is much in to do and it’s the gym day, so he wants to clean up as soon as possible. Now the floors are washed, the dust is wiped off — it’s time to clean up in the dressing room. But as soon as the Smart Beaver entered the dressing room, all plans for the day were suddenly destroyed: chaos reigned there and it seemed impossible to handle, even in a week. Give our hero some hope: tell him what is the minimum number of shoes need to change the position to make the dressing room neat. The dressing room is rectangular and is divided into *n*<=×<=*m* equal squares, each square contains exactly one shoe. Each pair of shoes has a unique number that is integer from 1 to , more formally, a square with coordinates (*i*,<=*j*) contains an integer number of the pair which is lying on it. The Smart Beaver believes that the dressing room is neat only when each pair of sneakers lies together. We assume that the pair of sneakers in squares (*i*1,<=*j*1) and (*i*2,<=*j*2) lies together if |*i*1<=-<=*i*2|<=+<=|*j*1<=-<=*j*2|<==<=1. The first line contains two space-separated integers *n* and *m*. They correspond to the dressing room size. Next *n* lines contain *m* space-separated integers each. Those numbers describe the dressing room. Each number corresponds to a snicker. It is guaranteed that: - *n*·*m* is even. - All numbers, corresponding to the numbers of pairs of shoes in the dressing room, will lie between 1 and . - Each number from 1 to will occur exactly twice. The input limits for scoring 30 points are (subproblem C1): - 2<=≤<=*n*,<=*m*<=≤<=8. The input limits for scoring 100 points are (subproblems C1+C2): - 2<=≤<=*n*,<=*m*<=≤<=80. Print exactly one integer — the minimum number of the sneakers that need to change their location. Sample Input 2 3 1 1 2 2 3 3 3 4 1 3 2 6 2 1 5 6 4 4 5 3 Sample Output 2 4

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\nfrom typing import NamedTuple, Optional, List, Tuple, cast\r\n\r\nclass MCFGraph:\r\n class Edge(NamedTuple):\r\n src: int\r\n dst: int\r\n cap: int\r\n flow: int\r\n cost: int\r\n\r\n class _Edge:\r\n def __init__(self, dst: int, cap: int, cost: int) -> None:\r\n self.dst = dst\r\n self.cap = cap\r\n self.cost = cost\r\n self.rev: Optional[MCFGraph._Edge] = None\r\n\r\n def __init__(self, n: int) -> None:\r\n self._n = n\r\n self._g: List[List[MCFGraph._Edge]] = [[] for _ in range(n)]\r\n self._edges: List[MCFGraph._Edge] = []\r\n\r\n def add_edge(self, src: int, dst: int, cap: int, cost: int) -> int:\r\n assert 0 <= src < self._n\r\n assert 0 <= dst < self._n\r\n assert 0 <= cap\r\n m = len(self._edges)\r\n e = MCFGraph._Edge(dst, cap, cost)\r\n re = MCFGraph._Edge(src, 0, -cost)\r\n e.rev = re\r\n re.rev = e\r\n self._g[src].append(e)\r\n self._g[dst].append(re)\r\n self._edges.append(e)\r\n return m\r\n\r\n def get_edge(self, i: int) -> Edge:\r\n assert 0 <= i < len(self._edges)\r\n e = self._edges[i]\r\n re = cast(MCFGraph._Edge, e.rev)\r\n return MCFGraph.Edge(\r\n re.dst,\r\n e.dst,\r\n e.cap + re.cap,\r\n re.cap,\r\n e.cost\r\n )\r\n\r\n def edges(self) -> List[Edge]:\r\n return [self.get_edge(i) for i in range(len(self._edges))]\r\n\r\n def flow(self, s: int, t: int,\r\n flow_limit: Optional[int] = None) -> Tuple[int, int]:\r\n return self.slope(s, t, flow_limit)[-1]\r\n\r\n def slope(self, s: int, t: int,\r\n flow_limit: Optional[int] = None) -> List[Tuple[int, int]]:\r\n assert 0 <= s < self._n\r\n assert 0 <= t < self._n\r\n assert s != t\r\n if flow_limit is None:\r\n flow_limit = cast(int, sum(e.cap for e in self._g[s]))\r\n\r\n dual = [0] * self._n\r\n prev: List[Optional[Tuple[int, MCFGraph._Edge]]] = [None] * self._n\r\n\r\n def refine_dual() -> bool:\r\n pq = [(0, s)]\r\n visited = [False] * self._n\r\n dist: List[Optional[int]] = [None] * self._n\r\n dist[s] = 0\r\n while pq:\r\n dist_v, v = heapq.heappop(pq)\r\n if visited[v]:\r\n continue\r\n visited[v] = True\r\n if v == t:\r\n break\r\n dual_v = dual[v]\r\n for e in self._g[v]:\r\n w = e.dst\r\n if visited[w] or e.cap == 0:\r\n continue\r\n reduced_cost = e.cost - dual[w] + dual_v\r\n new_dist = dist_v + reduced_cost\r\n dist_w = dist[w]\r\n if dist_w is None or new_dist < dist_w:\r\n dist[w] = new_dist\r\n prev[w] = v, e\r\n heapq.heappush(pq, (new_dist, w))\r\n else:\r\n return False\r\n dist_t = dist[t]\r\n for v in range(self._n):\r\n if visited[v]:\r\n dual[v] -= cast(int, dist_t) - cast(int, dist[v])\r\n return True\r\n\r\n flow = 0\r\n cost = 0\r\n prev_cost_per_flow: Optional[int] = None\r\n result = [(flow, cost)]\r\n while flow < flow_limit:\r\n if not refine_dual():\r\n break\r\n f = flow_limit - flow\r\n v = t\r\n while prev[v] is not None:\r\n u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])\r\n f = min(f, e.cap)\r\n v = u\r\n v = t\r\n while prev[v] is not None:\r\n u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])\r\n e.cap -= f\r\n assert e.rev is not None\r\n e.rev.cap += f\r\n v = u\r\n c = -dual[s]\r\n flow += f\r\n cost += f * c\r\n if c == prev_cost_per_flow:\r\n result.pop()\r\n result.append((flow, cost))\r\n prev_cost_per_flow = c\r\n return result\r\n\r\nN,M=map(int,readline().split())\r\nS=[list(map(int,readline().split())) for i in range(N)]\r\nMCFG=MCFGraph(N*M+2)\r\ns=0\r\nt=N*M+1\r\nfor i in range(N):\r\n for j in range(M):\r\n if i%2==j%2:\r\n MCFG.add_edge(s,i*M+j+1,1,0)\r\n for di,dj in ((0,1),(0,-1),(1,0),(-1,0)):\r\n if 0<=i+di<=N-1 and 0<=j+dj<=M-1:\r\n if S[i][j]==S[i+di][j+dj]:\r\n MCFG.add_edge(i*M+j+1,(i+di)*M+j+dj+1,1,0)\r\n else:\r\n MCFG.add_edge(i*M+j+1,(i+di)*M+j+dj+1,1,1)\r\n else:\r\n MCFG.add_edge(i*M+j+1,t,1,0)\r\nans=MCFG.flow(s,t)[1]\r\nprint(ans)" ]

{"inputs": ["2 3\n1 1 2\n2 3 3", "3 4\n1 3 2 6\n2 1 5 6\n4 4 5 3", "2 2\n1 2\n1 2", "2 2\n1 1\n2 2", "2 2\n2 1\n1 2", "3 4\n1 1 6 6\n2 2 4 4\n3 3 5 5", "3 4\n5 3 3 2\n6 1 4 2\n6 1 5 4", "5 4\n9 9 10 10\n7 7 5 5\n2 2 3 3\n1 1 8 8\n4 4 6 6", "4 5\n7 9 9 10 10\n7 5 5 3 3\n8 1 1 2 2\n8 6 6 4 4", "5 4\n6 4 4 3\n10 8 5 1\n10 6 5 2\n9 2 7 7\n9 8 1 3", "5 6\n7 12 1 15 3 2\n3 10 14 4 6 6\n5 11 13 8 2 9\n5 14 7 13 4 10\n11 1 12 15 9 8", "6 5\n8 12 12 15 7\n3 4 11 10 9\n15 14 2 13 10\n3 5 2 11 6\n1 5 14 1 13\n9 7 8 6 4", "6 6\n6 9 9 5 5 14\n15 15 11 18 2 10\n17 14 18 4 8 10\n17 3 1 13 8 13\n16 3 1 7 7 11\n16 4 6 2 12 12", "6 6\n2 10 10 12 18 7\n2 14 9 12 18 7\n3 3 9 16 6 6\n4 11 11 16 15 15\n4 13 1 14 17 17\n8 8 1 5 5 13", "6 7\n15 15 20 7 18 18 3\n7 16 16 12 19 19 3\n13 5 5 12 9 2 2\n13 14 4 10 9 11 14\n20 6 8 10 17 11 1\n1 6 8 4 17 21 21", "8 6\n19 19 15 11 5 5\n14 14 7 15 17 21\n16 4 8 22 24 21\n9 23 8 3 9 6\n2 10 10 13 3 6\n2 11 17 18 12 20\n13 7 1 18 12 20\n4 16 1 23 24 22", "8 8\n8 8 32 32 20 20 15 15\n14 14 7 7 9 9 2 2\n23 23 4 4 26 26 13 13\n18 18 12 12 10 10 19 19\n1 1 24 24 21 21 3 3\n6 6 28 28 22 22 29 29\n16 16 31 31 11 11 27 27\n25 25 5 5 17 17 30 30", "8 8\n19 22 3 22 11 31 10 13\n20 20 6 24 12 8 8 13\n32 10 17 30 21 27 21 5\n32 7 15 31 26 26 28 4\n30 7 15 5 25 12 1 16\n17 23 28 16 2 27 1 23\n29 9 9 6 2 19 29 4\n3 25 18 18 14 14 24 11", "8 8\n29 26 26 2 12 12 6 27\n4 4 29 2 5 13 1 16\n21 25 11 18 18 13 1 28\n19 9 9 21 24 17 7 7\n10 10 32 32 15 17 16 3\n31 24 6 30 15 20 28 27\n22 30 23 23 14 20 5 19\n11 25 31 3 14 22 8 8", "8 8\n1 1 31 17 19 19 11 27\n28 6 18 21 21 30 27 2\n20 20 18 17 8 30 28 2\n15 15 10 10 8 29 22 3\n23 13 16 7 7 29 25 3\n23 13 32 5 6 25 26 26\n12 12 32 14 14 9 9 24\n22 11 16 4 4 31 5 24", "8 8\n9 32 32 8 8 30 16 25\n9 10 10 4 4 26 17 30\n21 24 24 11 5 26 27 15\n21 20 20 31 14 14 27 15\n28 25 2 3 1 23 23 31\n28 11 2 3 1 29 22 13\n7 6 6 19 19 29 22 13\n7 12 12 17 16 5 18 18", "8 8\n18 1 1 25 28 28 31 31\n18 19 19 13 24 24 4 4\n3 7 7 13 16 12 14 6\n3 26 26 17 9 12 14 6\n8 27 27 17 9 10 10 25\n8 5 30 23 23 5 20 15\n30 32 21 11 2 22 20 15\n16 32 21 11 2 22 29 29", "2 3\n1 1 2\n2 3 3"], "outputs": ["2", "4", "0", "0", "2", "0", "3", "0", "0", "6", "13", "12", "10", "5", "7", "13", "0", "21", "19", "12", "10", "6", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d21e0b3207ee3c755958cfc2ee170922

Leha and another game about graph

Leha plays a computer game, where is on each level is given a connected graph with *n* vertices and *m* edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer *d**i*, which can be equal to 0, 1 or <=-<=1. To pass the level, he needs to find a «good» subset of edges of the graph or say, that it doesn't exist. Subset is called «good», if by by leaving only edges from this subset in the original graph, we obtain the following: for every vertex i, *d**i*<==<=<=-<=1 or it's degree modulo 2 is equal to *d**i*. Leha wants to pass the game as soon as possible and ask you to help him. In case of multiple correct answers, print any of them. The first line contains two integers *n*, *m* (1<=≤<=*n*<=≤<=3·105, *n*<=-<=1<=≤<=*m*<=≤<=3·105) — number of vertices and edges. The second line contains *n* integers *d*1,<=*d*2,<=...,<=*d**n* (<=-<=1<=≤<=*d**i*<=≤<=1) — numbers on the vertices. Each of the next *m* lines contains two integers *u* and *v* (1<=≤<=*u*,<=*v*<=≤<=*n*) — edges. It's guaranteed, that graph in the input is connected. Print <=-<=1 in a single line, if solution doesn't exist. Otherwise in the first line *k* — number of edges in a subset. In the next *k* lines indexes of edges. Edges are numerated in order as they are given in the input, starting from 1. Sample Input 1 0 1 4 5 0 0 0 -1 1 2 2 3 3 4 1 4 2 4 2 1 1 1 1 2 3 3 0 -1 1 1 2 2 3 1 3 Sample Output -1 0 1 1 1 2

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\nclass Graph:\r\n def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float(\"inf\")):\r\n self.V=V\r\n self.directed=directed\r\n self.weighted=weighted\r\n self.inf=inf\r\n if graph:\r\n self.graph=graph\r\n self.edges=[]\r\n for i in range(self.V):\r\n if self.weighted:\r\n for j,d in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j,d))\r\n else:\r\n for j in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j))\r\n else:\r\n self.edges=edges\r\n self.graph=[[] for i in range(self.V)]\r\n if weighted:\r\n for i,j,d in self.edges:\r\n self.graph[i].append((j,d))\r\n if not self.directed:\r\n self.graph[j].append((i,d))\r\n else:\r\n for i,j in self.edges:\r\n self.graph[i].append(j)\r\n if not self.directed:\r\n self.graph[j].append(i)\r\n\r\n def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):\r\n seen=[False]*self.V\r\n finished=[False]*self.V\r\n if directed_acyclic or cycle_detection or topological_sort:\r\n dag=True\r\n if euler_tour:\r\n et=[]\r\n if linked_components:\r\n lc=[]\r\n if lowlink:\r\n order=[None]*self.V\r\n ll=[None]*self.V\r\n idx=0\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps=[None]*self.V\r\n if postorder or topological_sort:\r\n post=[]\r\n if preorder:\r\n pre=[]\r\n if subtree_size:\r\n ss=[1]*self.V\r\n if unweighted_dist or bipartite_graph:\r\n uwd=[self.inf]*self.V\r\n uwd[s]=0\r\n if weighted_dist:\r\n wd=[self.inf]*self.V\r\n wd[s]=0\r\n stack=[(s,0)] if self.weighted else [s]\r\n while stack:\r\n if self.weighted:\r\n x,d=stack.pop()\r\n else:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append((x,d) if self.weighted else x)\r\n if euler_tour:\r\n et.append(x)\r\n if linked_components:\r\n lc.append(x)\r\n if lowlink:\r\n order[x]=idx\r\n ll[x]=idx\r\n idx+=1\r\n if preorder:\r\n pre.append(x)\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if not seen[y]:\r\n stack.append((y,d) if self.weighted else y)\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps[y]=x\r\n if unweighted_dist or bipartite_graph:\r\n uwd[y]=uwd[x]+1\r\n if weighted_dist:\r\n wd[y]=wd[x]+d\r\n elif not finished[y]:\r\n if (directed_acyclic or cycle_detection or topological_sort) and dag:\r\n dag=False\r\n if cycle_detection:\r\n cd=(y,x)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if euler_tour:\r\n et.append(~x)\r\n if lowlink:\r\n bl=True\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if ps[x]==y and bl:\r\n bl=False\r\n continue\r\n ll[x]=min(ll[x],order[y])\r\n if x!=s:\r\n ll[ps[x]]=min(ll[ps[x]],ll[x])\r\n if postorder or topological_sort:\r\n post.append(x)\r\n if subtree_size:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if y==ps[x]:\r\n continue\r\n ss[x]+=ss[y]\r\n if bipartite_graph:\r\n bg=[[],[]]\r\n for tpl in self.edges:\r\n x,y=tpl[:2] if self.weighted else tpl\r\n if uwd[x]==self.inf or uwd[y]==self.inf:\r\n continue\r\n if not uwd[x]%2^uwd[y]%2:\r\n bg=False\r\n break\r\n else:\r\n for x in range(self.V):\r\n if uwd[x]==self.inf:\r\n continue\r\n bg[uwd[x]%2].append(x)\r\n retu=()\r\n if bipartite_graph:\r\n retu+=(bg,)\r\n if cycle_detection:\r\n if dag:\r\n cd=[]\r\n else:\r\n y,x=cd\r\n cd=self.Route_Restoration(y,x,ps)\r\n retu+=(cd,)\r\n if directed_acyclic:\r\n retu+=(dag,)\r\n if euler_tour:\r\n retu+=(et,)\r\n if linked_components:\r\n retu+=(lc,)\r\n if lowlink:\r\n retu=(ll,)\r\n if parents:\r\n retu+=(ps,)\r\n if postorder:\r\n retu+=(post,)\r\n if preorder:\r\n retu+=(pre,)\r\n if subtree_size:\r\n retu+=(ss,)\r\n if topological_sort:\r\n if dag:\r\n tp_sort=post[::-1]\r\n else:\r\n tp_sort=[]\r\n retu+=(tp_sort,)\r\n if unweighted_dist:\r\n retu+=(uwd,)\r\n if weighted_dist:\r\n retu+=(wd,)\r\n if len(retu)==1:\r\n retu=retu[0]\r\n return retu\r\n\r\nN,M=map(int,readline().split())\r\nD=list(map(int,readline().split()))\r\nedges=[]\r\nidx={}\r\nfor i in range(M):\r\n u,v=map(int,readline().split())\r\n u-=1;v-=1\r\n edges.append((u,v))\r\n idx[(u,v)]=i\r\n idx[(v,u)]=i\r\nG=Graph(N,edges=edges)\r\nparents,tour=G.SIV_DFS(0,parents=True,postorder=True)\r\nif D.count(1)%2:\r\n for i in range(N):\r\n if D[i]==-1:\r\n D[i]=1\r\n break\r\nfor i in range(N):\r\n if D[i]==-1:\r\n D[i]=0\r\nif D.count(1)%2:\r\n print(-1)\r\n exit()\r\nans_lst=[]\r\nfor x in tour[:-1]:\r\n if D[x]:\r\n ans_lst.append(idx[(x,parents[x])]+1)\r\n D[x]^=1\r\n D[parents[x]]^=1\r\nprint(len(ans_lst))\r\nif ans_lst:\r\n print(*ans_lst,sep=\"\\n\")" ]

{"inputs": ["1 0\n1", "4 5\n0 0 0 -1\n1 2\n2 3\n3 4\n1 4\n2 4", "2 1\n1 1\n1 2", "3 3\n0 -1 1\n1 2\n2 3\n1 3", "10 10\n-1 -1 -1 -1 -1 -1 -1 -1 -1 -1\n6 7\n8 3\n6 4\n4 2\n9 2\n5 10\n9 8\n10 7\n5 1\n6 2", "3 2\n1 0 1\n1 2\n2 3"], "outputs": ["-1", "0", "1\n1", "1\n2", "0", "2\n2\n1"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d2370e5d51e7c7104ac917dd0c1ee297

Home Numbers

The main street of Berland is a straight line with *n* houses built along it (*n* is an even number). The houses are located at both sides of the street. The houses with odd numbers are at one side of the street and are numbered from 1 to *n*<=-<=1 in the order from the beginning of the street to the end (in the picture: from left to right). The houses with even numbers are at the other side of the street and are numbered from 2 to *n* in the order from the end of the street to its beginning (in the picture: from right to left). The corresponding houses with even and odd numbers are strictly opposite each other, that is, house 1 is opposite house *n*, house 3 is opposite house *n*<=-<=2, house 5 is opposite house *n*<=-<=4 and so on. Vasya needs to get to house number *a* as quickly as possible. He starts driving from the beginning of the street and drives his car to house *a*. To get from the beginning of the street to houses number 1 and *n*, he spends exactly 1 second. He also spends exactly one second to drive the distance between two neighbouring houses. Vasya can park at any side of the road, so the distance between the beginning of the street at the houses that stand opposite one another should be considered the same. Your task is: find the minimum time Vasya needs to reach house *a*. The first line of the input contains two integers, *n* and *a* (1<=≤<=*a*<=≤<=*n*<=≤<=100<=000) — the number of houses on the street and the number of the house that Vasya needs to reach, correspondingly. It is guaranteed that number *n* is even. Print a single integer — the minimum time Vasya needs to get from the beginning of the street to house *a*. Sample Input 4 2 8 5 Sample Output 2 3

[ "n, a = [int(x) for x in input().split()]\r\nans = 1\r\nif a % 2 == 0:\r\n while n != a:\r\n n -= 2\r\n ans += 1\r\nelse:\r\n t = 1\r\n while t != a:\r\n t += 2\r\n ans += 1\r\nprint(ans)", "import string\r\n\r\nx = input()\r\ny = x.split(' ')\r\nn, a = list(map(lambda x: int(x), y))\r\ns = 0\r\nif a & 1 == 1:\r\n s = (a + 1) / 2\r\nelse:\r\n s = (n - a + 2) / 2\r\n\r\nprint(int(s))", "def get():\n s = input().split()\n return int(s[0]), int(s[1])\n\n\nn, a = get()\nprint(str(int(a / 2 + 1 if a % 2 == 1 else n / 2 - a / 2 + 1)))\n", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\nif a==1:\r\n print(1)\r\nelif (a % 2 != 0):\r\n print (int(((a / 2)+1)))\r\nelse:\r\n print(int(((n-a) / 2)+1))\r\n", "n,a = input().split()\r\na = int(n) - int(a) + 1 if int(a[-1])% 2 == 0 else int(a)\r\nprint((a - 1)// 2 + 1)", "a = []\r\nb = []\r\n\r\nx, y = list(map(int, input().split()))\r\naux = x\r\nfor i in range(int(x/2)):\r\n a.append(1 + i*2)\r\n b.append(aux)\r\n aux -= 2\r\n\r\nif y % 2:\r\n print(a.index(y) + 1)\r\nelse:\r\n print(b.index(y) + 1)", "n, a = map(int, input().split())\nif a % 2 == 0:\n print((n-a)//2+1)\nelse:\n print(a//2+1)", "n,k=map(int,input().split())\r\nif k%2==1: print((k+1)//2)\r\nelse: print((n//2+1)-(k//2))", "n,a = map(int,input().split())\r\nif a%2==1:\r\n\tprint(a//2+1)\r\nelse:\r\n\tprint((n-a+1)//2+1)", "n = list(map(int, input().split()))\nif (n[1] % 2 == 0):\n itog = (n[0] - n[1]) / 2 + 1\nelse:\n itog = (n[1] - 1) / 2 + 1\nprint(int(itog))", "n , a = map(int, input().split())\nnhs = []\nfor i in range(1,n+1):\n nhs.append(i)\neven = [i for i in nhs if i%2==0 ]\neven.reverse()\nodd = [i for i in nhs if i%2==1]\nprint(odd.index(a)+1 if a%2==1 else even.index(a)+1)\n \t\t \t \t \t \t\t\t \t\t\t\t \t\t\t\t", "n,a = [int(x) for x in input().split()]\n\nif a%2 == 0:\n count = 0\n for i in range(n,0,-2):\n count+=1\n if a == i:\n print(count)\nelse:\n count = 0\n for i in range(1,n,2):\n count+=1\n if a == i:\n print(count)\n \t\t \t\t\t\t \t \t\t \t \t \t\t \t \t", "n,k=(int(z) for z in input().split())\r\ni=1\r\nt=1\r\nwhile i!=k and n+1-i!=k:\r\n\tt+=1\r\n\ti+=2\r\nprint(t)", "n,a=map(int, input().split())\r\nprint(int((a+1)/2 if a%2==1 else (n-a+2)/2))", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\n\r\nprint(n//2-a//2+1 if a%2 == 0 else a//2+1)", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, a = [int(i) for i in input().split(\" \")]\r\n right_side = []\r\n left_side = []\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n right_side.append(i)\r\n else:left_side.append(i)\r\n left_side.reverse()\r\n if a % 2 == 0:\r\n target = left_side\r\n else:\r\n target = right_side\r\n print(target.index(a) + 1)\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n, a = map(int,input().split())\r\nk = a % 2\r\ni = 1\r\nif k == 0:\r\n na=n\r\n while na!=a:\r\n na = na-2\r\n i +=1\r\nelse:\r\n na = 1\r\n while a!=na:\r\n na += 2\r\n i+=1\r\nprint(i)\r\n", "n, a = [int(x) for x in input().split()]\r\nif a % 2 == 0:\r\n print(n // 2 - a // 2 + 1)\r\nelse:\r\n print((a + 1) // 2)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 16:32:14\nLastEditTime: 2021-11-21 16:43:26\nDescription: Home Numbers\nFilePath: CF638A.py\n'''\n\n\ndef func():\n n, a = map(int, input().strip().split())\n if a % 2 != 0:\n print(a // 2 + 1)\n else:\n print(n // 2 - a // 2 + 1)\n\n\nif __name__ == '__main__':\n func()\n ", "n,a = map(int,input().split())\r\nk = 0\r\nfor i in range(1,n,2):\r\n k+=1\r\n if i==a:\r\n print(k)\r\nk = 0\r\nfor i in range(n,1,-2):\r\n k+=1\r\n if i==a:\r\n print(k)\r\n", "def solve(n, a):\n if a&1:\n return a // 2 + 1\n return (n - a) // 2 + 1\n\nn, a = map(int, input().split())\n\nprint(solve(n, a))\n", "n, a = [int(i) for i in input().split()]\r\n\r\narray = [int(i) for i in range(1, n + 1)]\r\n\r\nmas1 =array[0:n:2]\r\nmas2 = array[n:0:-2]\r\n\r\nif a % 2 == 0:\r\n print(mas2.index(a) + 1)\r\nelse:\r\n print(mas1.index(a) + 1)", "n,a=map(int,input().split())\r\nif a%2==1: print(a//2+1)\r\nelse: print((n//2)-(a//2)+1)", "#!/usr/bin/python3\n\nn, a = map(int, input().split())\n\nif a % 2 == 1:\n\tprint(a // 2 + 1)\nelse:\n\tprint(n // 2 - a // 2 + 1)\n", "print(1 + (lambda i: (i[0] - i[1]) // 2 if i[1] % 2 == 0 else (i[1] - 1) // 2)(list(map(int, input().split()))))", "def doma(n, a):\r\n if a % 2 == 1:\r\n return (a + 1) // 2\r\n return ((n - a) // 2) + 1\r\n\r\n\r\nN, A = [int(i) for i in input().split()]\r\nprint(doma(N, A))\r\n", "n, a = input().split()\r\nn = int(n)\r\na = int(a)\r\nif (a % 2 == 1): print(int(a / 2 + 1))\r\nelse: print(int(n / 2 - a / 2 + 1))", "n, a = list(map(int, input().split()))\r\n\r\nif a % 2 == 1:\r\n print(a // 2 + 1)\r\nelse:\r\n print((n - a) // 2 + 1)", "inp = list(map(int,input().split()))\r\nif inp[1]%2==0:\r\n print((inp[0]-inp[1])//2+1)\r\nelse:\r\n print((inp[1]+1)//2)\r\n", "n, k=map(int, input().split())\r\na, b=[], []\r\nfor x in range(1, n+1):\r\n if x%2==0:\r\n a.append(x)\r\n else:\r\n b.append(x)\r\na=a[::-1]\r\nans=0\r\nfor x in range(len(a)):\r\n ans+=1\r\n if k==a[x] or k==b[x]:break\r\nprint(ans)", "n,a=map(int,input().split())\r\nif a%2==0:\r\n print(1+(n-a)//2)\r\nelse:\r\n print((a+1)//2)\r\n", "n, a = map(int, input().split())\ni = 1\nj = n\nfor k in range(n):\n if i == a or j == a:\n #print(i, j)\n print(k + 1)\n exit(0)\n i += 2\n j -= 2\n", "n, a = map(int, input().split())\r\nif a % 2: ans = a // 2 + 1\r\nelse: ans = (n - a) // 2 + 1\r\nprint(ans)\r\n", "n,a=map(int,input().split())\r\nif a%2==1:\r\n print(a//2+1)\r\nelse: \r\n print((n-a) // 2 + 1)", "n, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(1 + a // 2)\r\nelse:\r\n print(1 + (n - a) // 2)", "n, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(a // 2 + 1)\r\nelse:\r\n print((n-a) // 2 + 1)", "x,y=[int(i) for i in input().split()]\r\nr=1\r\nif y % 2==0:\r\n for i in range(x,1,-2):\r\n if i==y:\r\n break\r\n else:\r\n r+=1\r\nelse:\r\n for i in range(1,x,+2):\r\n if i==y:\r\n break\r\n else:\r\n r+=1\r\nprint(r)\r\n", "n, a = map(int, input().split())\r\n\r\nif a % 2 != 0:\r\n print((a // 2) + 1)\r\nelse:\r\n print(((n - a + 1) // 2) + 1)", "x,y=[int(i) for i in input().split()]\nr=1\nif y % 2==0:\n for i in range(x,1,-2):\n if i==y:\n break\n else:\n r+=1\nelse:\n for i in range(1,x,+2):\n if i==y:\n break\n else:\n r+=1\nprint(r)\n", "inp=input()\r\na1=inp.split()\r\nn=int(a1[0])\r\na=int(a1[1])\r\nif a%2!=0:\r\n\tprint(int(1+(a-1)/2))\r\nelse:\r\n\tprint(int(1+(n-a)/2))", "n,k=map(int,input().split())\r\nif k%2==0:\r\n print(n//2-((k-2)//2))\r\nelse:\r\n print((k-1)//2+1)", "ri=lambda:map(int,input().split(' '))\r\nn,k=ri()\r\nif k%2==0:\r\n print(n//2 - k//2 + 1)\r\nelse:\r\n print((k+1)//2)", "inp = input().split()\r\nn = int(inp[0])\r\na = int(inp[1])\r\n\r\nif a % 2 != 0:\r\n print((a // 2) + 1)\r\nelse:\r\n print((n - a) // 2 + 1)\r\n", "n, a = map(int, input().split())\r\nif(a % 2 == 1):\r\n print((a+1)//2)\r\nelse:\r\n print((n//2 - a//2) + 1)", "n, a = map(int, input().split())\n\nk = 0\nif a % 2 == 1:\n\tk = (a + 1) // 2\nelse:\n\tk = (n - a) // 2 + 1\n\nprint(k)\n", "n,a=map(int,input().split())\r\nif a%2==0:\r\n s=1\r\n k=n\r\n while k!=a:\r\n s+=1\r\n k-=2\r\nelse:\r\n s=1\r\n k=1\r\n while k!=a:\r\n s+=1\r\n k+=2\r\nprint(s)\r\n", "inp=input()\npars=[]\npars=inp.split()\nn=int(pars[0])\na=int(pars[1])\nif a%2==1:\n print((a+1)//2)\nelse:\n print((n-a)//2+1)\n", "# LUOGU_RID: 101607360\nn, a = map(int, input().split())\r\nprint(((a if a % 2 else n - a + 1) + 1) // 2)", "def f(l):\r\n n,a = l\r\n return (a+1)//2 if a%2>0 else (n+2-a)//2\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "n,a=[int(x) for x in input().split()]\r\nif a&1:\r\n print(a//2+1)\r\nelse:\r\n print((n-a)//2+1)", "from sys import *\nn, a = map(int, stdin.readline().split())\na = n - a + 1 if a % 2 == 0 else a\nprint((a + 1) // 2)\n", "n,a=map(int,input().split())\r\nif a%2==0:\r\n print(int((n/2)-(a/2))+1)\r\nelse:\r\n print(a//2+1)\r\n \r\n", "x=[int(a) for a in input().split()] ; n =x[0] ; lp = x[1]\r\nprint([lp//2+1,n//2-lp//2+1][lp%2==0])", "n,a=[int(x) for x in input().split()]\r\nt=0\r\nif a%2==1:\r\n t=a//2+1\r\nelse:\r\n t=n//2-a//2+1\r\nprint(t) \r\n", "n, a = map(int, input().split())\r\ni = 1\r\nc = 0\r\nif a%2 != 0:\r\n while i != a:\r\n c = c + 1\r\n i += 2\r\n print(c+1)\r\ni = n\r\nif a%2 == 0:\r\n while i != a:\r\n c += 1\r\n i -= 2\r\n print(c+1)\r\n", "n,a=map(int, input().split(' '))\nif a%2==0:\n x = range(n, 1, -2).index(a)+1\nelse:\n x = range(1, n, 2).index(a)+1\nprint(x)", "n,a=map(int,input().split())\r\nprint([n-a,a][a&1]//2+1)", "n, a = map(int, input().split())\r\nif a % 2 == 0:\r\n a = n - a + 1\r\nprint(a // 2 + 1)\r\n", "import sys\nn,a = map(int,input().split())\nup = [i for i in range(1,n,2)]\ndown = [i for i in range(n,1,-2)]\nif a in up:\n print(up.index(a)+1)\nelse:\n print(down.index(a)+1)\n", "from operator import indexOf\r\n\r\n\r\nn, a = map(int, input().split())\r\n\r\none_side = list(range(1, n+1, 2))\r\nother_side = list(range(n, 1, -2))\r\n\r\nif a % 2 == 0:\r\n tmp = indexOf(other_side, a)\r\n final_time = 1 * other_side[:tmp].__len__() + 1\r\nelse:\r\n tmp = indexOf(one_side, a)\r\n final_time = 1 * other_side[:tmp].__len__() + 1\r\nprint(final_time)", "\r\nn,a=map(int,input().split())\r\n'''\r\nl1=[i for i in range(1,n,2)]\r\nl2=[i for i in range(n,0,-2)]\r\nprint(l1)\r\nprint(l2)\r\nif a in l1:\r\n print(l1.index(a)+1)\r\nelse:\r\n print(l2.index(a)+1)'''\r\nif a%2==0:\r\n dist=(n-a)//2 \r\n print(dist+1)\r\nelse:\r\n print(a//2+1)", "n, m = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nfirst = 1\r\ntimer = 1\r\nif m % 2 == 0:\r\n\twhile n != m:\r\n\t\ttimer += 1\r\n\t\tn -= 2\r\nelse:\r\n\twhile first != m:\r\n\t\r\n\t\ttimer +=1\r\n\t\tfirst += 2\r\nprint(timer)", "n,a=input().split()\r\nn=int(n)\r\na=int(a)\r\nif(a%2==0):\r\n x=n-a\r\n x=x/2\r\n x=x+1\r\nelse:\r\n x=a-1\r\n x=x/2\r\n x=x+1\r\nprint(int(x))\r\n", "n,m = map(int,input().split())\r\nl,r = 1,n\r\nt = 1\r\nwhile l!=m and r!=m:\r\n t+=1\r\n l+=2\r\n r-=2\r\nprint(t)", "n, a = map(int, input().split())\nif a%2 == 1:\n print(a//2 + 1)\nelse:\n print((n-a)//2 +1)", "\r\nn,a=map(int, input().split())\r\nif a%2!=0:\r\n print(a//2+1)\r\nelse:\r\n print(n//2-a//2+1)", "a,b = map(int,input().split())\r\nc = 1\r\nk = 1\r\ns = 1\r\nif b % 2 == 0:\r\n while a != b:\r\n c += 1\r\n a -= 2\r\n print(c)\r\nelse:\r\n while k != b:\r\n s += 1\r\n k += 2\r\n print(s)\r\n", "n, a = map(int, input().split())\r\nk = 1\r\nfor i in range(n):\r\n if (k == a or n == a):\r\n print(i + 1)\r\n break\r\n n -= 2\r\n k += 2", "n, a = map(int, input().split())\r\nprint(a // 2 + 1 if a % 2 else (n - a + 2) // 2)", "n, a = map(int, input().split())\r\nprint((n - a, a)[a % 2] // 2 + 1)", "A=list(map(int,input().split()))\r\nn=A[0]\r\na=A[1]\r\ncounter=1\r\nif (a%2==1):\r\n for i in range(1,a,2):\r\n counter=counter+1\r\nelse:\r\n for i in range(n,a,-2):\r\n counter=counter+1\r\nprint(counter)\r\n", "import math\r\nn, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print( math.ceil( a / 2 ) )\r\nelse:\r\n print( int(n / 2 - a / 2 + 1))\r\n \r\n", "n, a = map(int, input().split())\r\nif a % 2 == 0: print(1 + n//2 - a//2)\r\nelse: print((a + 1)//2)", "n, h = map(int, input().split())\r\nprint(h // 2 + 1 if h % 2 else (n - h) // 2 + 1)\r\n", "\r\nn,a=map(int,input().split())\r\nl1=[i for i in range(1,n,2)]\r\nl2=[i for i in range(n,0,-2)]\r\nif a in l1:\r\n print(l1.index(a)+1)\r\nelse:\r\n print(l2.index(a)+1)", "n, a = map(int, input().split())\r\n\r\nt = 1\r\nif a % 2 == 1:\r\n k = 1\r\n while k != a:\r\n k += 2\r\n t += 1\r\nelse:\r\n k = n\r\n while k != a:\r\n k -= 2\r\n t += 1\r\n\r\nprint(t);\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif b %2==0:\r\n print(1+(a-b)//2)\r\nelse:\r\n print(1+b//2)\r\n", "n, a = [int(x) for x in input().split()]\r\nif a % 2 == 1:\r\n print(int(a / 2 + 1))\r\nelse:\r\n print(int((n - a) / 2 + 1))", "n, a = map(int, input().split())\n\nif a % 2:\n print(a//2 + 1)\nelse:\n print(n//2 - a//2 + 1)", "amount, dest = map(int, input().split())\n\nansw = 0\nif dest % 2 != 1:\n answ = (amount - dest) / 2 + 1\nelse:\n answ = (dest + 1) / 2\n\nprint(int(answ))\n", "n, a = map(int, input().split())\r\nb = []\r\nt = 1\r\n\r\nif a % 2 == 0:\r\n for i in range(2, n+1, 2):\r\n b.append(i)\r\n b.reverse()\r\nelse:\r\n for i in range(1, n, 2):\r\n b.append(i)\r\n\r\ni = 0\r\nwhile b[i] != a:\r\n t += 1\r\n i += 1\r\n\r\n\r\nprint(t)\r\n", "s = input()\r\n\r\nn,a = int(s.split()[0]),int(s.split()[1])\r\n\r\nif a%2==0:\r\n t = (n-a)//2 + 1\r\nelse:\r\n t = (a-1)//2 + 1\r\n\r\nprint(t)", "n,m = map(int, input().split())\r\nif m % 2 == 1:\r\n print(1 + (m//2))\r\nelse:\r\n print(1 + ((n - m)//2))", "\r\n\r\nn,m= map(int,input().split())\r\n\r\n\r\nt = n//2\r\n\r\nif m%2!=0:\r\n\r\n x = (m+1)//2\r\n if m==1:\r\n print(1)\r\n else:\r\n print(x)\r\nelse:\r\n if m==n:\r\n print(1)\r\n else:\r\n print((t-m//2)+1)\r\n\r\n \r\n", "n,a = input().split()\r\nn,a = int(n),int(a)\r\nif a % 2 == 1:\r\n print(1 + int(a/2))\r\nelse:\r\n print(1 + int((n + 1 - a)/2))\r\n", "n, a = input().split()\nn = int(n)\na = int(a)\nif (a % 2) == 1:\n print(int((a+1)/2))\nelse:\n print(int(((n-a)/2)+1))\n\n \t \t \t \t\t \t\t \t \t \t \t\t\t", "n, a = map(int, input().split())\r\n\r\nif n == a:\r\n print(1)\r\nelif a % 2 == 1:\r\n print((a + 1) // 2)\r\nelse:\r\n rez = 0\r\n for i in range(n, a-1, -2):\r\n rez += 1\r\n print(rez)\r\n", "def main():\n n, a = map(int, input().split())\n print(1 + (a // 2 if a & 1 else (n - a) // 2))\n\n\nif __name__ == '__main__':\n main()\n", "n,a = map(int, input().split())\r\ni = 1\r\nj = 1\r\n\r\nif (a%2 == 0):\r\n\twhile(n!=a):\r\n\t\tn -= 2\r\n\t\ti += 1\r\nelse:\r\n\twhile (j != a):\r\n\t\tj += 2\r\n\t\ti += 1\r\nprint (i) \r\n", "n, a = [int(i) for i in input().split()]\r\nif (a + 1) % 2:\r\n a = n + 1 - a\r\nprint((a + 1) // 2)\r\n", "def drive(n,a):\r\n if a == n:\r\n return 1\r\n elif a%2 != 0:\r\n time = a//2+1\r\n elif a%2 == 0:\r\n time = ((n-a)//2)+1\r\n return time\r\n \r\n \r\n \r\nx,y = map(int,input().split())\r\nprint(drive(x,y))", "import math\nn,a=list(map(lambda m:int(m),input().split(' ')))\nif(a%2):\n print(math.ceil(a/2))\n exit(0)\nelse:\n print(n//2-a//2+1)\n", "n, a = map(int, input().split())\r\n\r\nif a % 2 == 0:\r\n\ta = n//2 - a//2\r\nelse:\r\n\ta = (a - 1)//2\r\n\r\nprint(a + 1)\r\n", "n,h=map(int,input().split())\r\nprint(h//2+1 if h%2 else (n-h)//2+1)", "param = [int(x) for x in input().split()]\r\nn = param[0]/2\r\na = param[1]\r\nif a % 2 == 0:\r\n print(int(n-a/2+1))\r\nelse:\r\n print(int(a/2+1))", "def getLn(tp):\r\n return [tp(x) for x in input().split()]\r\n\r\nn, a = getLn(int)\r\nprint((a%2)*((a+1)//2) + ((a+1)%2)*((n-a)//2+1))\r\n", "n,a=map(int,input().split())\r\nt=[]\r\nj=[]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n t.append(i)\r\n else:\r\n j.append(i)\r\nj.reverse()\r\nif a in t:\r\n for i in range(len(t)):\r\n if t[i]==a:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(j)):\r\n if j[i]==a:\r\n print(i+1)\r\n break\r\n", "n, a = map(int, input().split())\r\n\r\nif a & 1:\r\n print(a//2 + 1)\r\nelse:\r\n print(n//2 - a//2 + 1)", "n,a=map(int,input().split())\r\nif a%2==1:\r\n print(a//2+1)\r\nelse: \r\n print((n//2)-(a//2)+1)", "#!/usr/bin/env python\r\n\r\n\r\ndef main():\r\n n, a = [int(x) for x in input().split()]\r\n if a % 2 == 0:\r\n print(n // 2 - a // 2 + 1)\r\n else:\r\n print(a // 2 + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\nif m%2==1:\n\tm+=1\n\tm//=2\n\tprint(m)\nelse :\n\tn+=2\n\tn-=m\n\tn//=2\n\tprint(n)\n\n\n", "n,a = map(int,input().split())\r\nl = [i for i in range(1,n,2)]\r\nr = [i for i in range(n,1,-2)]\r\nif(a%2 == 0):\r\n print(int(n/2 - a/2 + 1))\r\nelse:\r\n print(int((a+1)/2))", "n, a = map(int, input().split())\r\nif a%2==0:\r\n print((n-a)//2 + 1)\r\nelse:\r\n print((a-1)//2+1)\r\n", "#!/usr/bin/env python3\n\nn, a = map(int, input().split(\" \"))\n\nif a % 2 == 0:\n street = range(n, 2 - 1 , -2)\nelse:\n street = range(1, n + 1, 2)\n\nresult = 1 + street.index(a)\n\nprint(result)\n\n", "[n, x] = list(map(int, input().split(' ')))\nanswer = int (x % 2 == 0 and (n / 2 - x / 2 + 1) or( (x + 1) / 2))\nprint(answer)", "n, a = map(int, input().split())\r\n\r\nif a % 2 == 1:\r\n print((a+1)//2)\r\nelse:\r\n cnt = 1\r\n i = n\r\n while i != a:\r\n i -= 2\r\n cnt += 1\r\n print(cnt)\r\n ", "from sys import exit\r\n\r\nn, a = map(int, input().split())\r\nif a % 2 == 1:\r\n print(int(a // 2 + 1))\r\n exit()\r\nelse:\r\n print(int(n / 2 + 1 - a // 2))\r\n exit()", "\"\"\"\nhttps://codeforces.com/problemset/problem/638/A\n\"\"\"\n\ntotalhouses, house = [int(x) for x in input().split()]\n\nif house % 2 == 1:\n time = house // 2 + 1\nelse:\n time = (totalhouses - house) // 2 + 1\n\nprint(time)\n", "def run(n, a):\n result = 1\n if a % 2 == 1:\n result += (a - 1) / 2\n else:\n result += (n - a) / 2\n\n print(int(result))\n\n\ndata = [int(x) for x in input().split(' ')]\nrun(n=data[0], a=data[1])\n", "n, a = map(int, input().split())\r\nprint(1 + ((a - 1) // 2 if a % 2 == 1 else (n - a) // 2))\r\n", "n, a = map(int, input().split())\r\nprint(n // 2 - a // 2 + 1 if a % 2 == 0 else a // 2 + 1)\r\n", "num, a = list(map(int, input().split()))\nif (a % 2 != 0):\n\ta = (a / 2) + 1\n\tprint(int(a))\nelse:\n\tprint(int(((num - a) / 2) + 1))\n\t\n", "import math\r\n\r\nhouses, goal = map(int, input().split())\r\nif(goal%2 == 0):\r\n print((houses-goal)//2+1)\r\nelse:\r\n print(math.ceil(goal/2))", "n, k = map(int, input().split())\r\nif k & 1:\r\n exit(print(k // 2 + 1))\r\nprint((n - k) // 2 + 1)", "n,a = map(int,input().split())\r\nprint(a//2+1 if a%2 else n//2-a//2+1)", "n, a = map(int, input().split())\r\nif a%2 == 0:\r\n print((n - a)//2 + 1)\r\nelse:\r\n print((a + 1)//2)", "n,a=map(int,input().split())\r\nprint(a-(a-1)//2if a%2else(n-a)//2+1)", "n, a = map(int, input().split())\r\nfor i in range(n // 2):\r\n\tif a == 1 + (i * 2) or a == n - (i * 2):\r\n\t\tprint(i + 1)\r\n\t\tbreak\r\n\t\t", "n, a = map(int, input().split())\nif a % 2 == 0:\n print(1 + int((n - a) / 2))\nelse:\n print(1 + int(a / 2))\n", "a = list(map(int, input().split()))\nresult = 0\nif a[1] % 2 == 1:\n result = a[1] // 2 + 1\nelif a[1] % 2 == 0:\n result = a[0] / 2 - a[1] / 2 + 1\nprint(int(result))\n" ]

{"inputs": ["4 2", "8 5", "2 1", "2 2", "10 1", "10 10", "100000 100000", "100000 2", "100000 3", "100000 99999", "100 100", "3000 34", "2000 1", "100000 1", "24842 1038", "1628 274", "16186 337", "24562 2009", "9456 3443", "5610 332", "1764 1288", "28588 13902", "92480 43074", "40022 26492", "85766 64050", "67808 61809", "80124 68695", "95522 91716", "7752 2915", "5094 5058", "6144 4792", "34334 20793", "23538 10243", "9328 7933", "11110 9885", "26096 2778", "75062 5323", "94790 7722", "90616 32240", "96998 8992", "95130 19219", "92586 8812", "3266 3044", "5026 4697", "3044 2904", "6022 5396", "31270 25522", "82156 75519", "34614 27913", "88024 61143", "91870 55672", "95718 4868", "99564 358", "89266 13047", "90904 16455", "94750 13761", "100000 23458", "100000 23457", "59140 24272", "9860 8516", "25988 2733", "9412 5309", "25540 23601", "76260 6050", "92388 39118", "8516 5495", "91940 37847", "30518 286", "46646 19345"], "outputs": ["2", "3", "1", "1", "1", "1", "1", "50000", "2", "50000", "1", "1484", "1", "1", "11903", "678", "169", "1005", "1722", "2640", "239", "7344", "24704", "6766", "10859", "30905", "34348", "1904", "1458", "19", "677", "10397", "5122", "3967", "4943", "11660", "2662", "43535", "29189", "44004", "9610", "41888", "112", "2349", "71", "314", "2875", "37760", "13957", "30572", "18100", "45426", "49604", "6524", "8228", "6881", "38272", "11729", "17435", "673", "1367", "2655", "11801", "35106", "26636", "2748", "18924", "15117", "9673"]}

UNKNOWN

PYTHON3

CODEFORCES

120

d24e0144ab5b191851e3d3b0c9dc7679

Three displays

It is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a town in Zabaikalsky region), wants to rent three displays to highlight an important problem. There are $n$ displays placed along a road, and the $i$-th of them can display a text with font size $s_i$ only. Maria Stepanovna wants to rent such three displays with indices $i < j < k$ that the font size increases if you move along the road in a particular direction. Namely, the condition $s_i < s_j < s_k$ should be held. The rent cost is for the $i$-th display is $c_i$. Please determine the smallest cost Maria Stepanovna should pay. The first line contains a single integer $n$ ($3 \le n \le 3\,000$) — the number of displays. The second line contains $n$ integers $s_1, s_2, \ldots, s_n$ ($1 \le s_i \le 10^9$) — the font sizes on the displays in the order they stand along the road. The third line contains $n$ integers $c_1, c_2, \ldots, c_n$ ($1 \le c_i \le 10^8$) — the rent costs for each display. If there are no three displays that satisfy the criteria, print -1. Otherwise print a single integer — the minimum total rent cost of three displays with indices $i < j < k$ such that $s_i < s_j < s_k$. Sample Input 5 2 4 5 4 10 40 30 20 10 40 3 100 101 100 2 4 5 10 1 2 3 4 5 6 7 8 9 10 10 13 11 14 15 12 13 13 18 13 Sample Output 90 -1 33

[ "n=int(input())\r\na=[int(x) for x in input().split(\" \")]\r\nc=[int(x) for x in input().split(\" \")]\r\n\r\nans=int(1e18)\r\nfor j in range(1, n-1):\r\n cost=0\r\n pos=-1; mn=int(1e18)\r\n for i in range(0, j): \r\n if a[i]<a[j] and c[i]<mn:\r\n mn=c[i]\r\n pos=i\r\n if pos==-1: continue\r\n cost+=c[pos]\r\n \r\n pos=-1; mn=int(1e18)\r\n for k in range(j+1,n):\r\n if a[j]<a[k] and c[k]<mn:\r\n mn=c[k]\r\n pos=k\r\n if (pos==-1): continue\r\n cost+=c[pos]\r\n cost+=c[j]\r\n ans=min(ans, cost)\r\nif ans==int(1e18): ans=-1\r\nprint(ans)", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n b=lst()\r\n ans=PI=float('inf')\r\n dp=[[PI for _ in range(4)] for _ in range(n)]\r\n for i in range(n):\r\n dp[i][1]=b[i]\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n dp[i][2]=min(dp[i][2],dp[j][1]+b[i])\r\n dp[i][3]=min(dp[i][3],dp[j][2]+b[i])\r\n ans=min(ans,dp[i][3])\r\n print(ans if ans!=PI else -1)", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = float('inf')\nfor j in range(1, n-1):\n sj = s[j]\n cj = c[j]\n\n ci = float('inf')\n ck = float('inf')\n\n for i in range(j):\n if s[i] < sj:\n ci = min(ci, c[i])\n\n for k in range(j+1, n):\n if s[k] > sj:\n ck = min(ck, c[k])\n\n ans = min(ans, ci+cj+ck)\n\nif ans == float('inf'):\n print(-1)\nelse:\n print(ans)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\nn=ii()\r\n\r\na=li()\r\nb=li()\r\n\r\narr=[]\r\n\r\nfor i in range(n):\r\n arr.append([i,a[i],b[i]])\r\n\r\narr.sort(key=lambda x:x[1])\r\n\r\nst=[]\r\n\r\nres=inf\r\n\r\nl=[inf]*n\r\nr=b[:]\r\n\r\nfor i,ai,bi in arr:\r\n if st and st[0][1]!=ai:\r\n for ni,nai,nbi in st:\r\n if 0<ni<n-1:\r\n #print(l,r)\r\n res=min(res,min(l[:ni])+nbi+min(r[ni+1:]))\r\n while st:\r\n ni,nai,nbi=st.pop()\r\n l[ni]=nbi\r\n r[i]=inf\r\n st.append([i,ai,bi])\r\n\r\nfor ni,nai,nbi in st:\r\n if 0<ni<n-1:\r\n #print(l,r)\r\n res=min(res,min(l[:ni])+nbi+min(r[ni+1:]))\r\nif res<inf:\r\n print(res)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = []\r\nfor j in range (n) :\r\n costleft = 400000000\r\n for i in range (j) : \r\n if s[j] > s[i] and costleft > c[i] : costleft = c[i]\r\n costright = 400000000\r\n for k in range (j+1,n) : \r\n if s[k] > s[j] and costright > c[k] : costright = c[k]\r\n if costright != 400000000 and costleft != 400000000 : ans.append(costright+costleft+c[j])\r\n else : ans.append(400000000)\r\nm = min(ans)\r\nif m == 400000000 : print(-1)\r\nelse : print(m)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nck_min = []\r\n\r\nfor i in range(n):\r\n ck_min_i = 10**18\r\n \r\n for j in range(i+1, n):\r\n if s[i]<s[j]:\r\n ck_min_i = min(ck_min_i, c[j])\r\n \r\n ck_min.append(ck_min_i)\r\n\r\nans = 10**18\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if s[i]<s[j]:\r\n ans = min(ans, c[i]+c[j]+ck_min[j])\r\n \r\nif ans==10**18:\r\n print(-1)\r\nelse:\r\n print(ans)", "import sys\nimput = sys.stdin.readline\n\nclass SegmentTree():\n def __init__(self, n):\n self.n = n\n self.INF = 2**31 - 1\n self.size = 1\n while self.size < n:\n self.size *= 2\n self.node = [self.INF] * (2*self.size - 1)\n\n def update(self, i, val):\n i += (self.size - 1)\n self.node[i] = val\n while i > 0:\n i = (i - 1) // 2\n self.node[i] = min(self.node[2*i + 1], self.node[2*i + 2])\n\n def get_min(self, begin, end):\n begin += (self.size - 1)\n end += (self.size - 1)\n s = self.INF\n while begin < end:\n if (end - 1) & 1:\n end -= 1\n s = min(s, self.node[end])\n if (begin - 1) & 1:\n s = min(s, self.node[begin])\n begin += 1\n begin = (begin - 1) // 2\n end = (end - 1) // 2\n return s\n\n\ndef compress(array):\n array2 = sorted(set(array))\n memo = {value : index for index, value in enumerate(array2)}\n for i in range(len(array)):\n array[i] = memo[array[i]]\n return array\n\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nst = SegmentTree(n)\n\na = compress(a)\nans = [0]*n\n\nfor i in range(n):\n ans[i] = st.get_min(0, a[i])\n st.update(a[i], min(b[i], st.get_min(a[i], a[i]+1)))\n\nst = SegmentTree(n)\nfor i in range(n)[::-1]:\n ans[i] += st.get_min(a[i] + 1, n)\n st.update(a[i], min(b[i], st.get_min(a[i], a[i]+1)))\n\nfor i in range(n):\n ans[i] += b[i]\n\nmin_ans = min(ans)\nif min_ans < 2**31 - 1:\n print(min_ans)\nelse:\n print(-1)\n \t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncost = list(map(int,input().split()))\r\nans = 10**10\r\nfor i in range(1,n-1):\r\n cur = arr[i]\r\n l,r = 10**10,10**10\r\n for j in range(i-1,-1,-1):\r\n if arr[j]<cur:\r\n l = min(l,cost[j])\r\n for j in range(i+1,n):\r\n if arr[j]>cur:\r\n r = min(r,cost[j])\r\n ans = min(ans,cost[i]+l+r)\r\nif ans==10**10:\r\n print(-1)\r\nelse:\r\n print(ans)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx=[0]\r\nfor i in range(1,n):\r\n t=0\r\n for j in range(i+1,n):\r\n if s[j]>s[i]:\r\n if t==0:\r\n t=c[j]\r\n else:\r\n t=min(t,c[j])\r\n x.append(t)\r\nans=-1\r\nfor i in range(n):\r\n t=0\r\n for j in range(i+1,n):\r\n if s[j]>s[i] and x[j]!=0:\r\n if ans==-1:\r\n ans=c[j]+x[j]+c[i]\r\n else:\r\n ans=min(ans,c[j]+x[j]+c[i])\r\nprint(ans)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = 10**10\r\nfor j in range(1, n-1):\r\n now_ans = c[j]\r\n money = 10**10\r\n for i in range(j):\r\n if s[i] < s[j]:\r\n money = min(money, c[i])\r\n if money == 10**10:\r\n pass\r\n now_ans += money\r\n money = 10 ** 10\r\n for i in range(j+1, n):\r\n if s[i] > s[j]:\r\n money = min(money, c[i])\r\n if money == 10**10:\r\n pass\r\n now_ans += money\r\n ans = min(ans, now_ans)\r\nif ans == 10**10:\r\n print(-1)\r\nelse:\r\n print(ans)", "def f(n, S, C):\n total = -1\n for i in range(1, n-1):\n l = (10 ** 8) + 100\n for m in range(i-1, -1, -1):\n if S[m] < S[i]:\n l = min(l, C[m])\n r = (10 ** 8) + 100\n for o in range(i+1, n):\n if S[o] > S[i]:\n r = min(r, C[o])\n if l == ((10**8)+100) or r == ((10 ** 8)+100): continue\n elif total != -1: total = min(total, C[i]+r+l)\n else: total = C[i]+r+l\n\n return total\n\n\nn = int(input())\nS = [int(a) for a in input().split()]\nC = [int(b) for b in input().split()]\n\nprint(f(n, S, C))\n\t \t\t \t\t \t\t\t \t \t \t\t\t \t\t\t\t", "from functools import lru_cache\r\n\r\nn = int(input())\r\nS = tuple(map(int, input().split()))\r\nC = tuple(map(int, input().split()))\r\nc = sum(C)\r\n\r\n@lru_cache(maxsize = None)\r\ndef f(x):\r\n R = [c + 1]\r\n for i in range(x + 1, n):\r\n if S[i] > S[x]:\r\n R.append(C[i])\r\n return min(R)\r\nT = [c + 1]\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if S[j] > S[i]:\r\n T.append(f(j) + C[j] + C[i])\r\nt = min(T)\r\nif t > c:\r\n print(-1)\r\nelse:\r\n print(min(T))\r\n", "import sys\r\nn = int(input().strip())\r\nsizes = list(map(int, input().strip().split()))\r\ncost = list(map(int, input().strip().split()))\r\ntot = []\r\nfor i in range(n):\r\n tot.append([sizes[i], cost[i]])\r\nret = False\r\nlcomp = []\r\nfor j in range(len(tot)):\r\n if j > 0 and j < len(tot)-1:\r\n temp1 = tot[:j]\r\n temp2 = tot[j+1:]\r\n mi_1 = sys.maxsize\r\n ret1 = False\r\n for i in range(len(temp1)):\r\n if temp1[i][0] < tot[j][0]:\r\n mi_1 = min(mi_1, temp1[i][1])\r\n ret1 = True\r\n mi_2 = sys.maxsize\r\n ret2 = False\r\n for k in range(len(temp2)):\r\n if temp2[k][0] > tot[j][0]:\r\n mi_2 = min(mi_2, temp2[k][1])\r\n ret2 = True\r\n if ret1 and ret2:\r\n ret = True\r\n lcomp.append(mi_1+tot[j][1]+mi_2)\r\n #print(mi_1, tot[j][1], mi_2)\r\nif ret:\r\n print(min(lcomp))\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\ndp2 = [1000000000 for i in range(n)]\r\nfor i in range(1, n):\r\n for j in range(i + 1):\r\n if s[j] < s[i]:\r\n dp2[i] = min(dp2[i], c[j] + c[i])\r\ndp3 = [1000000000 for i in range(n)]\r\nfor i in range(2, n):\r\n for j in range(1, i + 1):\r\n if s[j] < s[i]:\r\n dp3[i] = min(dp3[i], dp2[j] + c[i])\r\nx = min(dp3)\r\nif x == 1000000000:\r\n print(-1)\r\nelse:\r\n print(x)\r\n\r\n", "from math import inf\n\nn = int(input())\n\ns = tuple(map(int, input().split()))\n\nc = tuple(map(int, input().split()))\n\nans = inf\n\nfor i in range(1, n-1):\n bef = inf\n aft = inf\n\n for j in range(i+1, n):\n if s[j] > s[i]:\n aft = min(aft, c[j])\n \n for k in range(i):\n if s[k] < s[i]:\n bef = min(bef, c[k])\n \n ans = min(ans, bef + c[i] + aft)\n\nprint(ans if ans<inf else -1)\n \t \t \t\t \t\t \t \t \t \t", "n = int(input())\r\nls1 = [int(i) for i in input().split()]\r\nls2 = [int(i) for i in input().split()]\r\n\r\nans = float('inf')\r\n\r\nfor i in range(1, n - 1):\r\n l = [ls2[j] for j in range(0, i) if ls1[j] < ls1[i]]\r\n r = [ls2[j] for j in range(i + 1, n) if ls1[j] > ls1[i]]\r\n\r\n if len(l) and len(r):\r\n ans = min(ans, min(l) + min(r) + ls2[i])\r\n\r\nprint([-1 , ans][ans != float('inf')])", "n=int(input())\r\ns= list(map(int,input().split()))\r\nc= list(map(int,input().split()))\r\nans = float('inf')\r\n\r\ndp= [[float('inf') for x in range(3)]for u in range(len(s)+1)]\r\n\r\nfor i in range(len(s)):\r\n dp[i][0]=c[i]\r\n for j in range(1,3):\r\n dp[i][j]=float('inf')\r\n for k in range(i):\r\n if s[k]<s[i]:\r\n dp[i][j]=min(dp[i][j],dp[k][j-1]+c[i])\r\n\r\n ans = min(ans, dp[i][2])\r\n\r\nif ans==float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd,ceil,log2\r\nfrom bisect import bisect_left, bisect_right,insort\r\nfrom itertools import permutations,combinations\r\nfrom heapq import heapify,heappop,heappush\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nsys.setrecursionlimit(10000)\r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\ncl = lambda a, b: (a + b - 1) // b\r\n\r\n\r\nt=1\r\nfor _ in range(t):\r\n n=int(input())\r\n l=[int(i) for i in input().split()]\r\n val=[int(i) for i in input().split()]\r\n ans=inf\r\n for i in range(n):\r\n left,right=inf,inf\r\n for j in range(i):\r\n if l[j]<l[i] and val[j]<left:\r\n left=val[j]\r\n for j in range(i+1,n):\r\n if l[j]>l[i] and val[j]<right:\r\n right=val[j]\r\n ans=min(ans,left+val[i]+right)\r\n if ans!=inf:\r\n print(ans)\r\n else:\r\n print(-1)", "from math import inf\r\n\r\n\r\nn = int(input())\r\ns_list = list(map(int, input().split()))\r\nc_list = list(map(int, input().split()))\r\n\r\ntotal_min = inf\r\nfor j in range(n):\r\n min_i = inf\r\n for i in range(0, j):\r\n if s_list[i] < s_list[j]:\r\n min_i = min(min_i, c_list[i])\r\n\r\n min_k = inf\r\n for k in range(j + 1, n):\r\n if s_list[k] > s_list[j]:\r\n min_k = min(min_k, c_list[k])\r\n\r\n total_min = min(total_min, min_i + c_list[j] + min_k)\r\nif total_min != inf:\r\n print(total_min)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nans = 4*10**8\r\nfor j in range(1, n-1):\r\n mini = 4*10**8\r\n for i in range(0, j):\r\n if s[i]<s[j]:\r\n mini = min(mini, c[i])\r\n if mini == 4*10**8:\r\n continue\r\n mink = 4*10**8\r\n for k in range(j+1, n):\r\n if s[j]<s[k]:\r\n mink = min(mink, c[k])\r\n if mink == 4*10**8:\r\n continue\r\n ans = min(ans, mini+c[j]+mink)\r\nif ans==4*10**8:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass SegmentTree():\r\n def __init__(self, init, unitX, f):\r\n self.f = f # (X, X) -> X\r\n self.unitX = unitX\r\n self.f = f\r\n if type(init) == int:\r\n self.n = init\r\n self.n = 1 << (self.n - 1).bit_length()\r\n self.X = [unitX] * (self.n * 2)\r\n else:\r\n self.n = len(init)\r\n self.n = 1 << (self.n - 1).bit_length()\r\n # len(init)が2の累乗ではない時UnitXで埋める\r\n self.X = [unitX] * self.n + init + [unitX] * (self.n - len(init))\r\n # 配列のindex1まで埋める\r\n for i in range(self.n - 1, 0, -1):\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 | 1])\r\n\r\n def update(self, i, x):\r\n \"\"\"0-indexedのi番目の値をxで置換\"\"\"\r\n # 最下段に移動\r\n i += self.n\r\n self.X[i] = x\r\n # 上向に更新\r\n i >>= 1\r\n while i:\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 | 1])\r\n i >>= 1\r\n\r\n def getvalue(self, i):\r\n \"\"\"元の配列のindexの値を見る\"\"\"\r\n return self.X[i + self.n]\r\n\r\n def getrange(self, l, r):\r\n \"\"\"区間[l, r)でのfを行った値\"\"\"\r\n l += self.n\r\n r += self.n\r\n al = self.unitX\r\n ar = self.unitX\r\n while l < r:\r\n # 左端が右子ノードであれば\r\n if l & 1:\r\n al = self.f(al, self.X[l])\r\n l += 1\r\n # 右端が右子ノードであれば\r\n if r & 1:\r\n r -= 1\r\n ar = self.f(self.X[r], ar)\r\n l >>= 1\r\n r >>= 1\r\n return self.f(al, ar)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n# 离散化a\r\ntemp = sorted(set(a))\r\nd = {temp[i]: i for i in range(len(temp))}\r\ntree = SegmentTree(len(temp), 10 ** 18, min)\r\n\r\nprefix = [0] * n\r\nfor i in range(n):\r\n prefix[i] = tree.getrange(0, d[a[i]])\r\n tree.update(d[a[i]], b[i])\r\n\r\ntree = SegmentTree(len(temp), 10 ** 18, min)\r\nans = 10 ** 18\r\nfor i in range(n - 1,-1,-1):\r\n ans = min(ans, prefix[i] + tree.getrange(d[a[i]] + 1, len(temp)) + b[i])\r\n tree.update(d[a[i]], b[i])\r\nprint(ans if ans != 10 ** 18 else -1)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef read_line():\r\n return [int(x) for x in input().split()]\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef solve():\r\n n = read_int()\r\n a = read_line()\r\n b = read_line()\r\n\r\n res = 1e18\r\n\r\n for j in range(n):\r\n cost = [1e18, 1e18]\r\n for i in range(0, j):\r\n if a[i] < a[j]:\r\n cost[0] = min(cost[0], b[i])\r\n for k in range(j, n):\r\n if a[j] < a[k]:\r\n cost[1] = min(cost[1], b[k])\r\n\r\n res = min(res, cost[0] + cost[1] + b[j])\r\n \r\n print(res if res != 1e18 else -1)\r\n\r\n# t = read_int()\r\nt = 1\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "import sys\r\nfrom math import inf\r\nfrom typing import List\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass RangeDescendRangeMin:\r\n # 模板：线段树区间更新、持续减少最小值\r\n def __init__(self, n):\r\n self.n = n\r\n self.cover = [inf] * (4 * n)\r\n self.lazy = [inf] * (4 * n)\r\n\r\n @staticmethod\r\n def _min(a, b):\r\n return a if a None:\r\n self.cover[i] = self._min(self.cover[i], val)\r\n self.lazy[i] = self._min(self.lazy[i], val)\r\n return\r\n\r\n def _push_up(self, i):\r\n self.cover[i] = self._min(self.cover[2 * i], self.cover[2 * i + 1])\r\n return\r\n\r\n def _push_down(self, i):\r\n # 懒标记下放，注意取最大值\r\n if self.lazy[i] != inf:\r\n self.cover[2 * i] = self._min(self.cover[2 * i], self.lazy[i])\r\n self.cover[2 * i + 1] = self._min(self.cover[2 * i + 1], self.lazy[i])\r\n self.lazy[2 * i] = self._min(self.lazy[2 * i], self.lazy[i])\r\n self.lazy[2 * i + 1] = self._min(self.lazy[2 * i + 1], self.lazy[i])\r\n self.lazy[i] = inf\r\n return\r\n\r\n def build(self, nums: List[int]) -> None:\r\n # 使用数组初始化线段树\r\n assert self.n == len(nums)\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n s, t, ind = stack.pop()\r\n if ind >= 0:\r\n if s == t:\r\n self._make_tag(ind, nums[s])\r\n else:\r\n stack.append([s, t, ~ind])\r\n m = s + (t - s) // 2\r\n stack.append([s, m, 2 * ind])\r\n stack.append([m + 1, t, 2 * ind + 1])\r\n else:\r\n ind = ~ind\r\n self._push_up(ind)\r\n return\r\n\r\n def get(self):\r\n # 查询区间的所有值\r\n stack = [[0, self.n - 1, 1]]\r\n nums = [0] * self.n\r\n while stack:\r\n s, t, i = stack.pop()\r\n if s == t:\r\n nums[s] = self.cover[i]\r\n continue\r\n m = s + (t - s) // 2\r\n self._push_down(i)\r\n stack.append([s, m, 2 * i])\r\n stack.append([m + 1, t, 2 * i + 1])\r\n return nums\r\n\r\n def range_descend(self, left, right, val):\r\n # 更新区间最大值\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n a, b, i = stack.pop()\r\n if i >= 0:\r\n if left <= a and b <= right:\r\n self._make_tag(i, val)\r\n continue\r\n self._push_down(i)\r\n stack.append([a, b, ~i])\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n else:\r\n i = ~i\r\n self._push_up(i)\r\n return\r\n\r\n def range_min(self, left, right):\r\n # 查询区间的最大值\r\n stack = [[0, self.n - 1, 1]]\r\n lowest = inf\r\n while stack:\r\n a, b, i = stack.pop()\r\n if left <= a and b <= right:\r\n lowest = self._min(lowest, self.cover[i])\r\n continue\r\n self._push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n return lowest\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n # 模板：枚举中间数组，使用线段树维护前后缀最小值\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n ind = {num: i for i, num in enumerate(sorted(list(set(s + c + [0] + [10 ** 9 + 1]))))}\r\n m = len(ind)\r\n post = [inf] * n\r\n tree = RangeDescendRangeMin(m)\r\n for i in range(n - 1, -1, -1):\r\n tree.range_descend(ind[s[i]], ind[s[i]], c[i])\r\n post[i] = tree.range_min(ind[s[i]] + 1, m - 1)\r\n\r\n ans = inf\r\n tree = RangeDescendRangeMin(m)\r\n for i in range(n):\r\n if 1 <= i <= n - 2:\r\n cur = c[i] + tree.range_min(0, ind[s[i]] - 1) + post[i]\r\n ans = ac.min(ans, cur)\r\n tree.range_descend(ind[s[i]], ind[s[i]], c[i])\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\nclass FenwickTree:\r\n def __init__(self, n):\r\n self.n = n\r\n self.max_tree = [inf] * (n + 1)\r\n\r\n def update(self, idx, val):\r\n while idx <= self.n:\r\n self.max_tree[idx] = min(self.max_tree[idx], val)\r\n idx += idx & (-idx)\r\n\r\n def query_max(self, idx):\r\n res = inf\r\n while idx > 0:\r\n res = min(res, self.max_tree[idx])\r\n idx -= idx & (-idx)\r\n return res\r\n\r\nn=ii()\r\na=li()\r\nb=li()\r\n\r\nf=b[:]\r\n\r\narr=sorted(set(a+[-1,10**9+5]))\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit=FenwickTree(n+5)\r\n\r\nfor i in range(n):\r\n f[i]+=bit.query_max(d[a[i]]-1)\r\n bit.update(d[a[i]],b[i])\r\n\r\narr=arr[::-1]\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit=FenwickTree(n+5)\r\n\r\nfor i in range(n-1,-1,-1):\r\n f[i]+=bit.query_max(d[a[i]]-1)\r\n bit.update(d[a[i]],b[i])\r\n\r\nres=min(f)\r\n\r\nif res<inf:\r\n print(res)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 26/04/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn = ii1()\r\nfont = iia()\r\ncost = iia()\r\nres = float(\"inf\")\r\nfor i in range(1, n):\r\n left = float(\"inf\")\r\n for j in range(i):\r\n if font[j]<font[i]:\r\n left = min(left, cost[i] + cost[j])\r\n if left != float(\"inf\"):\r\n for j in range(i + 1, n):\r\n if font[j] > font[i]:\r\n res = min(res, left + cost[j])\r\nif res == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(res)\r\n \r\n \r\n \r\n\r\n\r\n\r\n ", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(int)\r\nn=I()\r\nl=L()\r\nc=L()\r\nans=10**10\r\nf=1\r\nfor i in range(1,n-1):\r\n sj=l[i]\r\n le=0\r\n r=0\r\n left=10**10\r\n right=10**10\r\n for j in range(i):\r\n if(l[j]<l[i]):\r\n le=1\r\n left=min(left,c[j])\r\n for j in range(i+1,n):\r\n if(l[j]>l[i]):\r\n r=1\r\n right=min(right,c[j])\r\n if(le*r):\r\n f=0\r\n ans=min(ans,left+right+c[i])\r\n \r\nif(f==1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "import math\r\nimport sys\r\nimport time\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heappush, heappop\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef gmi():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef lgmi():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn = ii()\r\na = lii()\r\nb = lii()\r\ninf = float('inf')\r\ncur = inf\r\nans = inf\r\nfor j in range(n):\r\n l = r = inf\r\n for i in range(j):\r\n if a[i] < a[j]:\r\n l = min(b[i],l)\r\n for k in range(j + 1,n):\r\n if a[k] > a[j]:\r\n r = min(b[k],r)\r\n ans = min(ans,l + r + b[j])\r\nprint(ans if ans != inf else -1)\r\n\r\n\r\n\r\n\r\n", "# Problem: C. Three displays\r\n# Contest: Codeforces - Codeforces Round 485 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/987/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n f[i] = min(f[i], b[j] + b[i])\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n g[i] = min(g[i], f[j] + b[i])\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "from math import inf\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nval=[int(i) for i in input().split()]\r\ndp=[[inf for i in range(n)] for j in range(3)]\r\nfor i in range(n):\r\n dp[0][i]=val[i]\r\n for j in range(i):\r\n if a[i]>a[j]:\r\n dp[1][i]=min(dp[1][i],dp[0][j]+val[i])\r\n dp[2][i]=min(dp[2][i],dp[1][j]+val[i])\r\nm=inf\r\nfor i in range(n):\r\n m=min(m,dp[2][i])\r\nif m==inf:\r\n print(-1)\r\nelse:\r\n print(m)", "import sys\r\nfrom math import inf\r\nfrom typing import List\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass SegmentTreeUpdateQueryMin:\r\n # 模板：线段树区间更新、持续减小最小值\r\n def __init__(self, n):\r\n self.height = [inf]*(4*n)\r\n self.lazy = [inf]*(4*n)\r\n self.n = n\r\n\r\n def build(self, nums: List[int]):\r\n # 使用数组初始化线段树\r\n stack = [[0, self.n - 1, 1]]\r\n while stack:\r\n s, t, ind = stack.pop()\r\n if ind >= 0:\r\n if s == t:\r\n self.make_tag(ind, nums[s])\r\n else:\r\n stack.append([s, t, ~ind])\r\n m = s + (t - s) // 2\r\n stack.append([s, m, 2 * ind])\r\n stack.append([m + 1, t, 2 * ind + 1])\r\n else:\r\n ind = ~ind\r\n self.push_up(ind)\r\n return\r\n\r\n def get(self):\r\n # 查询区间的所有值\r\n stack = [[0, self.n-1, 1]]\r\n nums = [inf]*self.n\r\n while stack:\r\n s, t, i = stack.pop()\r\n if s == t:\r\n nums[s] = self.height[i]\r\n continue\r\n m = s + (t - s) // 2\r\n self.push_down(i)\r\n stack.append([s, m, 2 * i])\r\n stack.append([m + 1, t, 2 * i + 1])\r\n return nums\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n def push_down(self, i):\r\n # 懒标记下放，注意取最小值\r\n if self.lazy[i] != inf:\r\n self.height[2 * i] = self.min(self.height[2 * i], self.lazy[i])\r\n self.height[2 * i + 1] = self.min(self.height[2 * i + 1], self.lazy[i])\r\n\r\n self.lazy[2 * i] = self.min(self.lazy[2 * i], self.lazy[i])\r\n self.lazy[2 * i + 1] = self.min(self.lazy[2 * i + 1], self.lazy[i])\r\n\r\n self.lazy[i] = inf\r\n return\r\n\r\n def make_tag(self, i, val):\r\n self.height[i] = self.min(self.height[i], val)\r\n self.lazy[i] = self.min(self.lazy[i], val)\r\n return\r\n\r\n def push_up(self, i):\r\n self.height[i] = self.min(self.height[2 * i], self.height[2 * i + 1])\r\n return\r\n\r\n def update_range(self, left, right, s, t, val, i):\r\n # 更新区间最小值\r\n stack = [[s, t, i]]\r\n while stack:\r\n a, b, i = stack.pop()\r\n if i >= 0:\r\n if left <= a and b <= right:\r\n self.make_tag(i, val)\r\n continue\r\n\r\n self.push_down(i)\r\n stack.append([a, b, ~i])\r\n m = a + (b - a) // 2\r\n if left <= m: # 注意左右子树的边界与范围\r\n stack.append([a, m, 2 * i])\r\n if right > m:\r\n stack.append([m + 1, b, 2 * i + 1])\r\n else:\r\n i = ~i\r\n self.push_up(i)\r\n return\r\n\r\n def update_point(self, left, right, s, t, val, i):\r\n # 更新单点最小值\r\n while True:\r\n if left <= s and t <= right:\r\n self.make_tag(i, val)\r\n break\r\n self.push_down(i)\r\n m = s + (t - s) // 2\r\n if left <= m: # 注意左右子树的边界与范围\r\n s, t, i = s, m, 2 * i\r\n if right > m:\r\n s, t, i = m + 1, t, 2 * i + 1\r\n\r\n while i > 1:\r\n i //= 2\r\n self.push_up(i)\r\n return\r\n\r\n def query_range(self, left, right, s, t, i):\r\n # 查询区间的最小值\r\n stack = [[s, t, i]]\r\n floor = inf\r\n while stack:\r\n a, b, i = stack.pop()\r\n if left <= a and b <= right:\r\n floor = self.min(floor, self.height[i])\r\n continue\r\n self.push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n stack.append([a, m, 2*i])\r\n if right > m:\r\n stack.append([m+1, b, 2*i + 1])\r\n return floor\r\n\r\n def query_point(self, left, right, s, t, i):\r\n # 查询单点的最小值\r\n a, b, i = s, t, i\r\n while True:\r\n if left <= a and b <= right:\r\n ans = self.height[i]\r\n break\r\n self.push_down(i)\r\n m = a + (b - a) // 2\r\n if left <= m:\r\n a, b, i = a, m, 2 * i\r\n if right > m:\r\n a, b, i = m + 1, b, 2 * i + 1\r\n return ans\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n ind = {num: i for i, num in enumerate(sorted(list(set(s+c+[0]+[10**9+1]))))}\r\n m = len(ind)\r\n post = [inf]*n\r\n tree = SegmentTreeUpdateQueryMin(m)\r\n for i in range(n-1, -1, -1):\r\n tree.update_point(ind[s[i]], ind[s[i]], 0, m - 1, c[i], 1)\r\n post[i] = tree.query_range(ind[s[i]]+1, m-1, 0, m-1, 1)\r\n\r\n ans = inf\r\n tree = SegmentTreeUpdateQueryMin(m)\r\n for i in range(n):\r\n if 1 <= i <= n-2:\r\n cur = c[i]+tree.query_range(0, ind[s[i]]-1, 0, m-1, 1)+post[i]\r\n ans = ac.min(ans, cur)\r\n tree.update_point(ind[s[i]], ind[s[i]], 0, m - 1, c[i], 1)\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "# map(int, input().split(\" \"))\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl2 = list(map(int, input().split(\" \")))\r\ndp_1 = l2.copy()\r\ndp_2 = [9999999999]*n\r\ndp_3 = [9999999999]*n\r\nfor i in range(1, n):\r\n for j in range(i):\r\n if l[i] > l[j]:\r\n dp_2[i] = min(dp_2[i], dp_1[j]+l2[i])\r\n\r\nfor i in range(1,n):\r\n for j in range(i):\r\n if l[i] > l[j]:\r\n dp_3[i] = min(dp_3[i], dp_2[j]+l2[i])\r\n\r\nx = min(dp_3)\r\nif x == 9999999999:\r\n print(-1)\r\nelse:\r\n print(x)", "import sys\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10**9+7\r\n\r\nclass BIT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [inf]*n\r\n\r\n def update(self, i, v):\r\n while i < self.n:\r\n self.tree[i] = min(self.tree[i], v)\r\n i += i & -i\r\n\r\n def query(self, i):\r\n res = inf\r\n while i:\r\n res = min(res, self.tree[i])\r\n i -= i & -i\r\n return res\r\n\r\ndef solve2():\r\n n = II()\r\n a, b = LII(), LII()\r\n ids = sorted(range(n), key=lambda i: (a[i], -i))\r\n # f[i][j]: 前i个数中长为j+1的递增子序列的b之和的最小值，从f[i][j-1]转移\r\n # 第二个维度优化掉，初始相当于f[i][0], 第一个循环后得到f[i][1]……\r\n f = b[:]\r\n for _ in range(2):\r\n g = [inf] * n\r\n t = BIT(n+1)\r\n for i in ids:\r\n g[i] = t.query(i)+b[i]\r\n t.update(i+1, f[i])\r\n f = g\r\n res = min(f)\r\n print(res if res < inf else -1)\r\n\r\ndef solve1():\r\n n = II()\r\n a = LII()\r\n b = LII()\r\n\r\n res = inf\r\n for j in range(n):\r\n left = inf\r\n for i in range(j):\r\n if a[i] < a[j]:\r\n left = min(left, b[i])\r\n right = inf\r\n for k in range(j+1, n):\r\n if a[k] > a[j]:\r\n right = min(right, b[k])\r\n res = min(res, b[j]+left+right)\r\n print(res if res < inf else -1)\r\n return\r\n\r\nsolve2()\r\n", "class Display:\r\n def __init__(self, index, size, cost):\r\n self.index = index\r\n self.size = size\r\n self.cost = cost\r\n self.totalcost = cost\r\n self.next = None\r\n self.level = 0\r\n\r\ndef nextcycle(displays, level):\r\n for j in range(n):\r\n displays[j].next = None\r\n for k in range(j + 1, n):\r\n if displays[j].size < displays[k].size and displays[k].level == level:\r\n if displays[j].next == None or displays[k].totalcost < displays[j].next.totalcost:\r\n displays[j].next = displays[k]\r\n if displays[j].next != None:\r\n displays[j].totalcost = displays[j].cost + displays[j].next.totalcost\r\n displays[j].level = displays[j].next.level + 1\r\n\r\n\r\nn = int(input())\r\nsizes = input().split(' ')\r\ncosts = input().split(' ')\r\ndisplays = []\r\ni = 0\r\nwhile i < n:\r\n displays.append(Display(i, int(sizes[i]), int(costs[i])))\r\n i += 1\r\n\r\nfor c in range(2):\r\n nextcycle(displays, c)\r\n\r\nbestcost = float(\"inf\");\r\nfor display in displays:\r\n if display.level == 2 and display.totalcost < bestcost:\r\n bestcost = display.totalcost\r\n\r\nprint(-1 if bestcost == float(\"inf\") else bestcost)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nans = 10**18\r\nfor i in range(1, n-1):\r\n a = b = 10**18\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n a = min(a, c[j])\r\n for j in range(i+1, n):\r\n if s[j] > s[i]:\r\n b = min(b, c[j])\r\n ans = min(ans, a+b+c[i])\r\nprint(-1 if ans == 10**18 else ans)\r\n", "from operator import __gt__, __lt__\r\n \r\ndef helper(op):\r\n xx = list(map(float, input().split()))\r\n le, ri, a = [], [], xx[0]\r\n for b in xx:\r\n if a > b:\r\n a = b\r\n le.append(a)\r\n for a in reversed(xx):\r\n if op(b, a):\r\n b = a\r\n ri.append(b)\r\n ri.reverse()\r\n return xx, le, ri\r\n \r\nn, res = int(input()), 9e9\r\nss, sLe, sRi = helper(__lt__)\r\ncc, cLe, cRi = helper(__gt__)\r\nfor j in sorted(range(1, n - 1), key=cc.__getitem__):\r\n s, c = ss[j], cc[j]\r\n if cLe[j - 1] + c + cRi[j + 1] < res and sLe[j - 1] < s < sRi[j + 1]:\r\n a = b = 9e9\r\n for i in range(j):\r\n if ss[i] < s and a > cc[i]:\r\n a = cc[i]\r\n for k in range(j + 1, n):\r\n if s < ss[k] and b > cc[k]:\r\n b = cc[k]\r\n if res > a + b + c:\r\n res = a + b + c\r\nprint(int(res) if res < 9e9 else -1)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n b=lst()\r\n dp=[0]*n\r\n for i in range(n):\r\n v=float('inf')\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:v=min(v,b[i]+b[j])\r\n dp[i]=v\r\n # print(dp)\r\n for i in range(n):\r\n v = float('inf')\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]: v = min(v, b[i] + dp[j])\r\n dp[i] = v\r\n ans=min(dp)\r\n print(ans if ans!=float('inf') else -1)", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\nans = float('inf')\r\nfor i in range(1, n-1):\r\n bef = aft = float('inf')\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n bef = min(bef, b[j])\r\n for j in range(i, n):\r\n if a[i] < a[j]:\r\n aft = min(aft, b[j])\r\n ans = min(ans, b[i]+bef+aft)\r\nprint(-1 if ans > 10**9 else ans)\r\n\r\n\r\n\r\n\r\n", "# This code is contributed by Siddharth\r\n\r\n# import sys\r\n# input = sys.stdin.readline\r\n\r\n# from sys import *\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\n\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nminn=inf\r\nfor j in range(1,n-1):\r\n cost=c[j]\r\n temp1=inf\r\n temp2=inf\r\n for i in range(j):\r\n if s[i]<s[j]:\r\n temp1=min(temp1,c[i])\r\n for k in range(j+1,n):\r\n if s[j]<s[k]:\r\n temp2=min(temp2,c[k])\r\n minn=min(temp1+temp2+cost,minn)\r\nif minn<inf:\r\n print(minn)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# dp做法，可以维护任意m\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndp = [[10 ** 18] * 3 for _ in range(n)]\r\nfor i in range(n):\r\n dp[i][0] = b[i]\r\n for j in range(i):\r\n if a[i] > a[j]:\r\n dp[i][1] = min(dp[i][1], dp[j][0] + b[i])\r\n dp[i][2] = min(dp[i][2], dp[j][1] + b[i])\r\nans = min(dp[i][2] for i in range(n))\r\nprint(ans if ans != 10 ** 18 else -1)", "import math\r\n\r\ndef solve(sizes, costs):\r\n min_cost = float('inf')\r\n for j in range(1, len(sizes)-1):\r\n min_prev = float('inf')\r\n min_next = float('inf')\r\n for i in range(0, j):\r\n if sizes[i] < sizes[j]:\r\n min_prev = min(costs[i], min_prev)\r\n for k in range(j+1, len(sizes)):\r\n if sizes[k] > sizes[j]:\r\n min_next = min(costs[k], min_next)\r\n if math.isinf(min_prev) or math.isinf(min_next):\r\n continue\r\n min_cost = min(min_prev + costs[j] + min_next, min_cost)\r\n return min_cost if not math.isinf(min_cost) else - 1\r\n\r\n\r\nif __name__ == '__main__':\r\n dim = int(input())\r\n sizes = [int(n) for n in input().split()]\r\n costs = [int(n) for n in input().split()]\r\n print(solve(sizes, costs))\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nf = [1e9] * (n)\nfor i in range(1, n):\n for j in range(i - 1, -1, -1):\n if a[i] > a[j]:\n f[i] = min(b[i] + b[j], f[i])\nans = 1e9\nfor i in range(2, n):\n for j in range(i - 1, -1, -1):\n if a[i] > a[j]:\n ans = min(ans, f[j] + b[i])\nif ans >= 1e9:\n print(-1)\nelse:\n print(ans)\n", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(N, S, C):\r\n dp = [float('inf')] * N\r\n for i in range(1, N):\r\n for j in range(i):\r\n if S[j] < S[i]:\r\n dp[i] = min(dp[i], C[j] + C[i])\r\n\r\n dp2 = [float('inf')] * N\r\n for i in range(N - 1, 0, -1):\r\n for j in range(i + 1, N, 1):\r\n if S[i] < S[j]:\r\n dp2[j] = min(dp2[j], dp[i] + C[j])\r\n\r\n ans = min(dp2)\r\n if ans == float('inf'):\r\n return -1\r\n return ans\r\n\r\nN = int(input())\r\nS = get_ints()\r\nC = get_ints()\r\n\r\nprint(solve(N, S, C))\r\n", "n = int(input())\ns = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\nmincost = float('inf')\nfor i in range(1,n-1):\n minleft = float('inf')\n minright = float('inf')\n for j in range(0,i):\n if s[j]<s[i]:\n minleft = min(minleft,c[j])\n\n for j in range(i+1,n):\n if s[j]>s[i]:\n minright = min(minright,c[j])\n \n mincost = min(mincost,minleft+minright+c[i])\n\nif mincost<float('inf'):\n print(mincost)\nelse:\n print(-1)", "import sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nn = list(RI())[0]\r\na = list(RI())\r\nb = list(RI())\r\ninf = float(\"inf\")\r\n\r\ndp = [[inf] * 4 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n dp[i][1] = b[i]\r\n\r\nans = inf\r\n\r\nfor i in range(n):\r\n for j in range(i):\r\n if a[i] > a[j]:\r\n for k in range(2, 4):\r\n dp[i][k] = min(dp[i][k], dp[j][k - 1] + b[i])\r\n ans = min(ans, dp[i][3])\r\n\r\nif ans != inf:\r\n print(ans)\r\nelse:\r\n print(-1)", "import sys\r\nfrom math import inf\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass TreeArrayRangeQueryPointUpdateMin:\r\n # 模板：树状数组单点减少前缀区间查询最小值\r\n def __init__(self, n):\r\n # 索引从 1 到 n\r\n self.inf = inf\r\n self.t = [self.inf] * (n + 1)\r\n\r\n @staticmethod\r\n def lowest_bit(i):\r\n return i & (-i)\r\n\r\n def query(self, i):\r\n mi = self.inf\r\n while i:\r\n mi = mi if mi < self.t[i] else self.t[i]\r\n i -= self.lowest_bit(i)\r\n return mi\r\n\r\n def update(self, i, mi):\r\n while i < len(self.t):\r\n self.t[i] = self.t[i] if self.t[i] < mi else mi\r\n i += self.lowest_bit(i)\r\n return\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n s = ac.read_list_ints()\r\n c = ac.read_list_ints()\r\n\r\n nodes = sorted(list(set(s)) + [0, 10**9 + 1])\r\n dct = {num: i + 1 for i, num in enumerate(nodes)}\r\n m = len(nodes)\r\n\r\n pre = [inf] * n\r\n tree = TreeArrayRangeQueryPointUpdateMin(m)\r\n for i in range(n):\r\n pre[i] = tree.query(dct[s[i]] - 1)\r\n tree.update(dct[s[i]], c[i])\r\n\r\n post = [inf] * n\r\n tree = TreeArrayRangeQueryPointUpdateMin(m)\r\n for i in range(n - 1, -1, -1):\r\n post[i] = tree.query(m - dct[s[i]])\r\n tree.update(m - dct[s[i]] + 1, c[i])\r\n\r\n ans = inf\r\n if n >= 3:\r\n ans = min(pre[i] + post[i] + c[i] for i in range(1, n - 1))\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nd = [[0 for _ in range(2)] for _ in range(n)]\r\nMAX = int(1e18)\r\nans = MAX\r\n\r\nfor i in range(n):\r\n d[i][0] = MAX\r\n d[i][1] = MAX\r\n for j in range(0,i):\r\n if a[j] < a[i]:\r\n d[i][0] = min(d[i][0], b[i] + b[j])\r\n d[i][1] = min(d[i][1], b[i] + d[j][0])\r\n \r\n ans = min(ans,d[i][1])\r\n \r\nprint(-1 if ans==MAX else ans)", "from math import inf\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nans = inf\r\nfor j in range(1,n-1):\r\n i = 0\r\n min1 = inf\r\n while i< j:\r\n if s[j] > s[i]:\r\n min1 = min(min1,c[i])\r\n i += 1\r\n if min1 != inf:\r\n k = j + 1\r\n min2 = inf\r\n while k < n:\r\n if s[k] > s[j]:\r\n min2 = min(min2,c[k])\r\n k += 1\r\n if min1 != inf and min2 != inf:\r\n cost = c[j] + min1 + min2\r\n ans = min(ans,cost)\r\nif ans != inf:\r\n print(ans)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\ncost=list(map(int,input().split()))\r\nans=float(\"inf\")\r\nfor i in range(n):\r\n l,r=float('inf'),float('inf')\r\n for j in range(i):\r\n if s[j]<s[i]:\r\n l=min(l,cost[j])\r\n for k in range(i+1,n):\r\n if s[k]>s[i]:\r\n r=min(r,cost[k])\r\n ans=min(ans,l+r+cost[i])\r\nif ans==float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "n=int(input())\r\nL1=list(map(int,input().split()))\r\nL2=list(map(int,input().split()))\r\ndp=[[L2[i],float('inf'),float('inf')] for i in range(n)]\r\nfor i in range(1,n):\r\n #skip\r\n dp[i][1]=min(dp[i-1][1],dp[i][1])\r\n dp[i][2]=min(dp[i-1][2],dp[i][2])\r\n #take\r\n min1=float(\"inf\")\r\n min2=float(\"inf\")\r\n for j in range(i):\r\n if L1[j]<L1[i] and dp[j][0]<min1:\r\n min1=dp[j][0]\r\n if L1[j]<L1[i] and dp[j][1]<min2:\r\n min2=dp[j][1]\r\n dp[i][1]=min1+L2[i]\r\n dp[i][2]=min2+L2[i]\r\nminm=float('inf')\r\nfor i in range(n):\r\n if dp[i][2]<minm:\r\n minm=dp[i][2]\r\nif minm==float('inf'):\r\n print(-1)\r\nelse:\r\n print(minm)\r\n", "n = int(input())\ns = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\ndp = [[float('inf') for _ in range(4)] for _ in range(n)]\n\nfor i in range(n):\n dp[i][1] = c[i]\n\nfor i in range(n):\n for j in range(1, 4):\n for r in range(i):\n if s[r] < s[i]:\n dp[i][j] = min(dp[i][j], c[i] + dp[r][j - 1])\n\nans = min(i[3] for i in dp)\nif ans == float('inf'):\n ans = -1\nprint(ans)\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n = int(input())\r\n s = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n\r\n # f[n][k] = f[n-1][k]\r\n # foreach i < n: if s[i] < s[n]: f[n][k] = min(f[n][k], f[i][k-1] + c[i)\r\n\r\n f = [[float(\"inf\") for _ in range(n+1)] for _ in range(4)]\r\n f[0][0] = 0\r\n f[1][0] = 0\r\n f[2][0] = 0\r\n f[3][0] = 0\r\n for i in range(1, n+1):\r\n f[0][i] = 0\r\n f[1][i] = c[i-1]\r\n for j in range(2, 4):\r\n for i in range(1, n+1):\r\n for k in range(1, i):\r\n if s[k-1] < s[i-1]:\r\n f[j][i] = min(f[j][i], f[j-1][k] + c[i-1])\r\n# print(f[0])\r\n# print(f[1])\r\n# print(f[2])\r\n# print(f[3])\r\n ans = min(f[3][3:])\r\n if ans == float(\"inf\"): print(-1)\r\n else: print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nS = [int(x) for x in input().split()]\ns = tuple(S)\nc = tuple(int(x) for x in input().split())\nS.sort()\ndef min(x, y):\n if x < y:\n return x\n else:\n return y\ndef rank(x):\n l = 0; r = n - 1\n while l < r:\n mid = (l + r) >> 1\n if S[mid] < x:\n l = mid + 1\n else:\n r = mid\n return l\nrk = tuple(rank(x) for x in s)\nMin = [10000000000 for i in range(30000)]\ndef insert(x, l, r, p, v):\n Min[x] = min(Min[x], v)\n if l == r:\n return\n mid = (l + r) >> 1\n if p > mid:\n insert(x << 1 | 1, mid + 1, r, p, v)\n else:\n insert(x << 1, l, mid, p, v)\ndef query(x, l ,r ,L ,R):\n if l >= L and r <= R:\n return Min[x]\n mid = (l + r) >> 1; ans = 10000000000\n if L <= mid:\n ans = min(ans, query(x << 1, l, mid, L, R))\n if R > mid:\n ans = min(ans, query(x << 1 | 1, mid + 1, r, L, R))\n return ans\ndp = list(c)\nMin = [10000000000 for i in range(30000)]\nfor i in range(0, n):\n insert(1, 0, n - 1, rk[i], dp[i])\n dp[i] = c[i]\n if rk[i] == 0:\n dp[i] += 10000000000\n else:\n dp[i] += query(1, 0, n - 1, 0, rk[i] - 1)\nMin = [10000000000 for i in range(30000)]\nfor i in range(0, n):\n insert(1, 0, n - 1, rk[i], dp[i])\n dp[i] = c[i]\n if rk[i] == 0:\n dp[i] += 10000000000\n else:\n dp[i] += query(1, 0, n - 1, 0, rk[i] - 1)\nans = 10000000000\nfor i in dp:\n ans = min(ans, i)\nif ans > 3000000000:\n print(-1)\nelse:\n print(ans)\n", "n = int(input())\r\nss = list(map(int, input().split()))\r\ncc = list(map(int, input().split()))\r\n\r\nd1 = {}\r\nd2 = {}\r\nd3 = {}\r\n\r\nfor i in range(n):\r\n s = ss[i]\r\n c = cc[i]\r\n if s in d1.keys():\r\n d1[s] = min(d1[s], c)\r\n else:\r\n d1[s] = c\r\n m = 10000000001\r\n for d in d1.keys():\r\n if d < s and d1[d] < m:\r\n m = d1[d]\r\n if s in d2.keys():\r\n d2[s] = min(d2[s], m + c)\r\n else:\r\n d2[s] = m + c\r\n\r\n m = 10000000001\r\n for d in d2.keys():\r\n if d < s and d2[d] < m:\r\n m = d2[d]\r\n if s in d3.keys():\r\n d3[s] = min(d3[s], m + c)\r\n else:\r\n d3[s] = m + c\r\n\r\nm = 10000000001\r\nfor d in d3.keys():\r\n if d3[d] < m:\r\n m = d3[d]\r\n\r\nif (m < 10000000001) :\r\n print(m)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n ans = float(\"inf\")\r\n a_L = list(map(int, input().split()))\r\n b_L = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n pre = float(\"inf\")\r\n tail = float(\"inf\")\r\n for j in range(i):\r\n if a_L[j] < a_L[i]:\r\n pre = min(pre, b_L[j])\r\n for j in range(i + 1, n):\r\n if a_L[j] > a_L[i]:\r\n tail = min(tail, b_L[j])\r\n # print(i, pre + tail + b_L[i])\r\n ans = min(ans, pre + tail + b_L[i])\r\n if ans == float(\"inf\"):\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def menorCustoEsq(s, c, size, custo):\r\n menor = None\r\n for i in range(0, len(s)):\r\n if menor == None and s[i] < size:\r\n menor = (s[i], c[i])\r\n elif s[i] < size:\r\n if menor[1] > c[i]:\r\n menor = (s[i], c[i])\r\n \r\n return menor\r\n\r\ndef menorCustoDir(s, c, size, custo):\r\n menor = None\r\n for i in range(0, len(s)):\r\n if menor == None and s[i] > size:\r\n menor = (s[i], c[i])\r\n elif s[i] > size:\r\n if menor[1] > c[i]:\r\n menor = (s[i], c[i])\r\n \r\n return menor\r\n\r\n\r\nn = int(input())\r\nsizes = [*map(int, input().split())]\r\ncosts = [*map(int, input().split())]\r\n\r\nvalores = []\r\nfor i in range(1, n - 1, 1):\r\n js = sizes[i]\r\n jc = costs[i]\r\n a = menorCustoEsq(sizes[: i], costs[: i], js, jc)\r\n k = menorCustoDir(sizes[i + 1 :], costs[i + 1 :], js, jc)\r\n\r\n if a != None and k != None:\r\n soma = a[1] + jc + k[1]\r\n valores.append(soma)\r\n\r\nif len(valores) == 0:\r\n print(-1)\r\nelse:\r\n print(min(valores))", "import sys \r\nimport math\r\nimport heapq\r\n\r\n# solve stack overflow\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n# input = lambda: sys.stdin.readline().rstrip()\r\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MII():\r\n return map(int, input().split())\r\ndef LMII():\r\n return list(map(int, input().split()))\r\n#-------------------head-----------------#\r\n# list []\r\n# tuple ()\r\n# dict {}\r\n# set set()\r\n# 可变: list dict set\r\n# 不可变: str tuple\r\n# enumerate zip 遍历技巧\r\n\r\nn = II()\r\na = LMII()\r\nb = LMII()\r\nans = 10 ** 20\r\nfor i in range(n):\r\n pre = 10 ** 18\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n pre = min(pre, b[j])\r\n suf = 10 ** 18\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n suf = min(suf, b[j])\r\n if pre != 10 ** 18 and suf != 10 ** 18:\r\n ans = min(ans, pre + b[i] + suf)\r\nprint(-1 if ans == 10 ** 20 else ans)\r\n", "input()\r\nh = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nsas = 1e9\r\nfor j in range(len(h)):\r\n l = 1e9\r\n for i in range(j):\r\n if h[i] < h[j]:\r\n l = min(l, s[i])\r\n r = 1e9\r\n for k in range(j + 1, len(h)):\r\n if h[k] > h[j]:\r\n r = min(r, s[k])\r\n sas = min(sas, s[j] + l + r)\r\nprint(sas if sas != 1e9 else -1)\r\n", "n = int(input())\nsize = list(map(int,input().split()))\ncost =list(map(int,input().split()))\nans = 10**9\nfor j in range(1,n):\n s_j = size[j]\n c_i = 10**9\n for i in range(j):\n if size[j]>size[i]:\n c_i = min(c_i,cost[i])\n c_k = 10**9\n for k in range(j+1,n):\n if size[k]>size[j]:\n c_k = min(c_k,cost[k])\n x = cost[j]+c_i+c_k\n if x<ans:\n ans = x\nif ans>=10**9:\n print(-1)\nelse:\n print (ans)\n", "n = int(input())\r\ns = input()\r\nS = list(map(int,list(s.split())))\r\nc = input()\r\nC = list(map(int,list(c.split())))\r\ntable = [[10**9 for i in range(4)] for i in range(n)]\r\nfor i in range(n):\r\n table[i][1] = C[i]\r\nfor i in range(2,4):\r\n for j in range(i-1,n):\r\n for k in range(j):\r\n if S[k]<S[j]:\r\n table[j][i] = min(table[k][i-1]+C[j],table[j][i])\r\nm = 10**(9)\r\nfor i in range(n):\r\n m = min(table[i][3],m)\r\nif m == 10**9:\r\n print(-1)\r\nelse:\r\n print(m)\r\n ", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\npass1 = [None] * (n - 1)\r\nfor i in range(n - 2, -1, -1):\r\n for j in range(i + 1, n):\r\n if s[j] > s[i]:\r\n if pass1[i] is None:\r\n pass1[i] = c[j] + c[i]\r\n else:\r\n pass1[i] = min(pass1[i], c[j] + c[i])\r\npass2 = [None] * (n - 2)\r\nfor i in range(n - 3, -1, -1):\r\n for j in range(i + 1, n - 1):\r\n if s[j] > s[i]:\r\n if pass1[j] is None:\r\n continue\r\n if pass2[i] is None:\r\n pass2[i] = pass1[j] + c[i]\r\n else:\r\n pass2[i] = min(pass2[i], pass1[j] + c[i])\r\n\r\n# print(pass1)\r\n# print(pass2)\r\nif all(a is None for a in pass2):\r\n print(-1)\r\nelse:\r\n print(min(a for a in pass2 if a is not None))\r\n", "#G - Three displays\nimport math\n\nn = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nmaxValue = float('inf')\nans = float('inf')\nesquerdaMin = [0] * n\ndireitaMin = [0] * n\nesquerdaMin[0] = c[0]\n\nfor i in range(1, n):\n esquerdaMin[i] = min(c[i], esquerdaMin[i - 1])\ndireitaMin[n - 1] = c[n - 1]\n\nfor i in range(n - 2, -1, -1):\n direitaMin[i] = min(c[i], direitaMin[i + 1])\n\nminTamanhoE = [0] * n\nminTamanhoD = [0] * n\nminTamanhoE[0] = s[0]\n\nfor i in range(1, n):\n minTamanhoE[i] = min(s[i], minTamanhoE[i - 1])\nminTamanhoD[n - 1] = s[n - 1]\n\nfor i in range(n - 2, -1, -1):\n minTamanhoD[i] = max(s[i], minTamanhoD[i + 1])\n\npreco = [(c[j], j) for j in range(1, n - 1)]\npreco.sort()\n\nfor k,j in preco:\n if esquerdaMin[j - 1] + c[j] + direitaMin[j + 1] >= ans:\n continue\n\n if minTamanhoE[j - 1] >= s[j] or s[j] >= minTamanhoD[j + 1]:\n continue\n\n a = maxValue\n for i in range(j):\n if s[i] < s[j]:\n a = min(a, c[i])\n\n b = maxValue\n for k in range(j + 1, n):\n if (s[j] < s[k]):\n b = min(b, c[k])\n\n curr = a + b + c[j]\n ans = min(ans, curr)\nif ans == maxValue * 3:\n ans = -1\nprint(ans)\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t \t \t \t", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\ndp = [10000000000000000]*n\r\nfor i in range(1, n-1):\r\n for j in range(i+1, n):\r\n if s[j] > s[i]:\r\n dp[i] = min(dp[i], c[j]+c[i])\r\nminm = 10000000000000000\r\nfor i in range(0, n-2):\r\n for j in range(i+1, n-1):\r\n if s[j] > s[i]:\r\n minm = min(minm, dp[j]+c[i])\r\nif minm == 10000000000000000:\r\n print(-1)\r\nelse:\r\n print(minm)", "import os,sys,collections,heapq,itertools,functools,operator,random\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2\r\nfrom random import randint \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\nclass BIT:\r\n def __init__(self,n, postfix, default_val, reduce_op):\r\n self.N = n + 2 \r\n self.postfix = postfix \r\n self.default_val = default_val\r\n self.reduce_op = reduce_op\r\n self.A = [default_val] * self.N ##\r\n def add(self,i,x):\r\n i = i+1 if not self.postfix else self.N-(i+1) \r\n if i <=0 : i = 1 \r\n while i < self.N: \r\n self.A[i] = self.reduce_op(self.A[i],x)\r\n i += -i & i \r\n def get(self,i):\r\n i = i+1 if not self.postfix else self.N-(i+1) \r\n if i >= self.N : i = self.N - 1 \r\n res = self.default_val\r\n while i > 0: \r\n res = self.reduce_op(res,self.A[i])\r\n i ^= -i & i \r\n return res \r\ndef solution(): \r\n n = readi() \r\n a = readis() \r\n b = readis() \r\n _ = sorted(a) \r\n a = [bisect_left(_,x) for x in a] \r\n b1 = BIT(n,0,inf,min) \r\n b2 = BIT(n,0,inf,min) \r\n res = inf \r\n for i,x in zip(a,b): \r\n res = min(res,b2.get(i-1)+x) \r\n b2.add(i,b1.get(i-1)+x) \r\n b1.add(i,x) \r\n print([res,-1][res==inf])\r\n\r\n\r\nfor i in range( 1 ):\r\n solution() ", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2**(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]*2*self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])\n\n def update(self, k, x):\n k += self.num\n self.seg[k] = x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n lres = self.ide_ele\n rres = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n rres = self.segfunc(self.seg[r], rres)\n if l & 1:\n lres = self.segfunc(lres, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n res = self.segfunc(lres, rres)\n return res\n\n def __str__(self): # for debug\n arr = [self.query(i,i+1) for i in range(self.n)]\n return str(arr)\n\nn = int(input())\nS = list(map(int, input().split()))\nC = list(map(int, input().split()))\nSA = list(set(S))\nSA = sorted(SA)\nd = {}\nfor i, s in enumerate(SA):\n d[s] = i\nS = [d[s] for s in S]\nL = [0]*n\nR = [0]*n\nINF = 10**18\nN = len(d)\nseg = SegTree([INF]*(N+1), INF, min)\nseg.update(S[0], C[0])\nfor i in range(1, n-1):\n s = S[i]\n L[i] = seg.query(0, s)\n seg.update(s, C[i])\n\nseg = SegTree([INF]*(N+1), INF, min)\nseg.update(S[-1], C[-1])\nfor i in reversed(range(1, n-1)):\n s = S[i]\n R[i] = seg.query(s+1, seg.n)\n seg.update(s, C[i])\n\n#print(L)\n#print(R)\nans = INF\nfor i in range(1, n-1):\n ans = min(ans, L[i]+C[i]+R[i])\nif ans >= INF:\n print(-1)\nelse:\n print(ans)\n", "'''\r\nhttps://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n'''\r\n\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom cmath import *\r\nfrom heapq import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom random import *\r\nimport random\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\n\r\nBUFSIZE = 4096\r\nMOD = 10 ** 9 + 7\r\ninf = float('inf')\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MI():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef PF(a):\r\n return [0] + list(accumulate(a))\r\n\r\n\r\n'''\r\n思路：\r\n1. 前后缀思想\r\n'''\r\n\r\n\r\ndef solve():\r\n n = II()\r\n a = LII()\r\n b = LII()\r\n res = inf\r\n for i in range(1, n - 1):\r\n m1, m2 = inf, inf\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n m1 = min(m1, b[j])\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n m2 = min(m2, b[j])\r\n res = min(res, m1 + m2 + b[i])\r\n print(res if res != inf else -1)\r\n\r\n\r\nsolve()\r\n", "from sys import stdin, stdout\r\nimport heapq\r\nimport cProfile\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import reduce\r\nimport math\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef solve():\r\n n = get_int()\r\n arr1 = get_list()\r\n arr2 = get_list()\r\n ans = float('inf')\r\n for i in range(n):\r\n mini = float('inf')\r\n for j in range(i):\r\n if arr1[j]<arr1[i]:\r\n mini = min(mini,arr2[j])\r\n maxi = float('inf')\r\n for k in range(i+1,n):\r\n if arr1[k]>arr1[i]:\r\n maxi = min(maxi,arr2[k])\r\n ans = min(ans,arr2[i]+mini+maxi)\r\n if ans==float('inf'): ans = -1\r\n return ans\r\n\r\n\r\n\r\ndef main():\r\n print(solve())\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nTestCases = False\r\n\r\nif TestCases:\r\n for i in range(get_int()):\r\n main()\r\nelse:\r\n main()", "from bisect import bisect_left, bisect_right\r\nimport sys\r\nfrom collections import Counter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nfrom math import gcd\r\ndef mrd(fun=int): return [fun(x) for x in input().split()]\r\ndef rd(fun=int): return fun(input())\r\n\r\n'''\r\n .. a[i] ..\r\n y \r\n ----------ai-------------\r\n\r\n x\r\n查询所有前缀所有比ai小的数位置上的min(b)\r\n'''\r\nclass Node:\r\n def __init__(self) -> None:\r\n self.l = self.r = 0\r\n self.mn = float('inf')\r\n\r\nclass SegmentTree:\r\n def __init__(self, n) -> None:\r\n self.tr = [Node() for _ in range(n << 2)]\r\n \r\n def pushup(self, p):\r\n self.tr[p].mn = min(self.tr[p << 1].mn, self.tr[p << 1 | 1].mn)\r\n \r\n def build(self, p, l, r):\r\n self.tr[p].l = l\r\n self.tr[p].r = r\r\n if l == r: return\r\n \r\n mid = l + r >> 1\r\n self.build(p << 1, l, mid)\r\n self.build(p << 1 | 1, mid + 1, r)\r\n\r\n def modify(self, p, pos, val):\r\n l, r = self.tr[p].l, self.tr[p].r\r\n if l == r and r == pos:\r\n self.tr[p].mn = min(self.tr[p].mn, val)\r\n return\r\n mid = l + r >> 1\r\n if pos <= mid: self.modify(p << 1, pos, val)\r\n else: self.modify(p << 1 | 1, pos, val)\r\n self.pushup(p)\r\n \r\n def query(self, p, l, r):\r\n if l > r: return float('inf')\r\n if l <= self.tr[p].l and self.tr[p].r <= r:\r\n return self.tr[p].mn\r\n mid = self.tr[p].l + self.tr[p].r >> 1\r\n ans = float('inf')\r\n if l <= mid: ans = min(ans, self.query(p << 1, l, r))\r\n if r > mid: ans = min(self.query(p << 1 | 1, l , r), ans)\r\n return ans\r\n\r\n\r\ndef solve2():\r\n n = rd()\r\n a = mrd()\r\n b = mrd()\r\n ans = float(\"inf\")\r\n\r\n c = list(set(a.copy()))\r\n c.sort()\r\n for i in range(n):\r\n a[i] = bisect_left(c, a[i])\r\n \r\n tr = SegmentTree(n + 1)\r\n tr.build(1, 0, n - 1)\r\n tr.modify(1, a[0], b[0])\r\n \r\n f = [0] * n\r\n for i in range(1, n - 1):\r\n f[i] = tr.query(1, 0, a[i] - 1)\r\n tr.modify(1, a[i], b[i])\r\n \r\n tr = SegmentTree(n + 1)\r\n tr.build(1, 0, n - 1)\r\n tr.modify(1, a[-1], b[-1])\r\n \r\n for i in range(n - 2, 0, - 1):\r\n f[i] += tr.query(1, a[i] + 1, n - 1)\r\n tr.modify(1, a[i], b[i])\r\n \r\n ans = min(ans, f[i] + b[i])\r\n\r\n print(ans if ans != float('inf') else -1)\r\n\r\ndef solve():\r\n n = rd()\r\n a = mrd()\r\n b = mrd()\r\n ans = float(\"inf\")\r\n for i in range(1, n - 1):\r\n x = y = float('inf')\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n x = min(b[j], x)\r\n for j in range(i + 1, n):\r\n if a[j] > a[i]:\r\n y = min(b[j], y)\r\n ans = min(x + y + b[i], ans)\r\n print(ans if ans != float('inf') else -1)\r\n\r\n\r\nt = 1\r\n# t = rd()\r\nfor _ in range(t):\r\n solve2()", "n = int(input())\nss = list(map(int, input().strip().split()))\ncs = list(map(int, input().strip().split()))\n\ndp = [[float('inf')] * 4 for _ in range(n + 1)]\nfor i in range(1, n+1):\n dp[i][1] = cs[i-1]\n\n\nfor i in range(2, n + 1):\n for j in range(2, 4):\n s, c = ss[i-1], cs[i-1]\n for k in range(1, i):\n if ss[k-1] < s:\n dp[i][j] = min(dp[i][j], dp[k][j-1] + c)\n #print(i, j, dp[i][j])\n\n\nmmin = float('inf')\nfor i in range(1, 1+n):\n mmin = min(mmin, dp[i][3])\n\nif mmin == float('inf'):\n print(-1)\nelse:\n print(mmin)\n \t\t \t\t\t\t \t \t\t \t\t \t \t", "import math\r\nimport sys\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nce=list(map(int,input().split()))\r\n\r\nbest=10**9\r\nfor j in range(1,n-1):\r\n a=ce[j];b=10**9;c=10**9\r\n for i in range(j-1,-1,-1):\r\n if s[i]<s[j]:\r\n b=min(b,ce[i])\r\n for k in range(j+1,n):\r\n if s[k]>s[j]:\r\n c=min(c,ce[k])\r\n best=min(best,a+b+c)\r\n\r\nif best>=10**9:\r\n print(-1)\r\nelse:\r\n print(best)", "if __name__ == '__main__':\r\n n = int(input())\r\n s = list(map(int, input().strip().split()))\r\n c = list(map(int, input().strip().split()))\r\n INF = float(\"inf\")\r\n res = INF\r\n for i in range(n):\r\n leftMin, rightMin = INF, INF\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n leftMin = min(leftMin, c[j])\r\n for j in range(i + 1, n):\r\n if s[i] < s[j]:\r\n rightMin = min(rightMin, c[j])\r\n res = min(res, leftMin + c[i] + rightMin)\r\n res = -1 if res == INF else res\r\n print(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncost = list(map(int,input().split()))\r\nans = float(\"inf\")\r\nfor i in range(n):\r\n m,r = float(\"inf\"),float(\"inf\")\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n m = min(m,cost[j])\r\n for k in range(i+1,n):\r\n if a[k]>a[i]:\r\n r = min(r,cost[k])\r\n ans = min(ans,cost[i]+m+r)\r\nprint(ans if ans!=float(\"inf\") else -1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n-1):\r\n ans = 10**12\r\n for j in range(i+1,n):\r\n if s[i] < s[j]:\r\n ans = min(ans,c[i]+c[j])\r\n\r\n d[i] = ans\r\n\r\nans = 10**12\r\nfor i in range(n-2):\r\n for j in range(i+1,n-1):\r\n if s[i] < s[j]:\r\n ans = min(ans,c[i]+d[j])\r\n\r\nif ans == 10**12:\r\n print(-1)\r\n\r\nelse:\r\n print(ans)", "def answer(n,A,B):\r\n \r\n dp=[[float(\"inf\") for i in range(n)] for j in range(3)]\r\n dp[0][0]=B[0]\r\n \r\n for i in range(3):\r\n for j in range(1,n):\r\n if i==0:\r\n dp[i][j]=B[j]\r\n \r\n else:\r\n for k in range(j):\r\n if A[j]>A[k]:\r\n dp[i][j]=min(dp[i][j],dp[i-1][k]+B[j])\r\n \r\n mini=min(dp[2])\r\n if mini==float(\"inf\"):\r\n return -1\r\n \r\n return mini\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\nprint(answer(n,A,B))", "def solve(n,s,c):\r\n INF = float('inf')\r\n ans = INF\r\n for i in range(n):\r\n first = INF\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n first = min(first, c[j])\r\n if first == INF:\r\n continue\r\n second = INF\r\n for j in range(i+1,n):\r\n if s[i] < s[j]:\r\n second = min(second, c[j])\r\n if second == INF:\r\n continue\r\n ans = min(ans, first + c[i] + second)\r\n ans = -1 if ans == INF else ans\r\n print(ans)\r\n\r\n\r\nn = int(input())\r\ns = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nsolve(n,s,c)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ndp=[float('inf')]*(n)\r\nfor i in range(1,n):\r\n mn=float('inf')\r\n for j in range(i):\r\n if s[i]>s[j]:\r\n mn=min(mn,c[i]+c[j])\r\n dp[i]=mn\r\nres=float('inf')\r\nfor i in range(1,n):\r\n for j in range(i):\r\n if s[i]>s[j]:\r\n res=min(res,c[i]+dp[j])\r\nif res==float('inf'):\r\n res=-1\r\nprint(res)\r\n \r\n \r\n ", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ndp = []\nfor i in range(n):\n first = c[i]\n second = 1e9\n third = 1e9\n for j in range(i):\n if (s[j] < s[i]):\n second = min(second, dp[j][0] + c[i])\n third = min(third, dp[j][1] + c[i])\n dp.append((first, second, third))\n\nresult = 1e9\nfor i in range(n):\n result = min(result, dp[i][2])\nif (result == 1e9):\n print(-1)\n exit()\nprint(result)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\nclass FenwickTree:\r\n def __init__(self, n):\r\n self.n = n\r\n self.max_tree = [inf] * (n + 1)\r\n\r\n def update(self, idx, val):\r\n while idx <= self.n:\r\n self.max_tree[idx] = min(self.max_tree[idx], val)\r\n idx += idx & (-idx)\r\n\r\n def query_min(self, idx):\r\n res = inf\r\n while idx > 0:\r\n res = min(res, self.max_tree[idx])\r\n idx -= idx & (-idx)\r\n return res\r\n\r\nn=ii()\r\na=li()\r\nb=li()\r\n\r\n\r\narr=sorted(set(a+[-1,10**9+5]))\r\n\r\nd={x:i+1 for i,x in enumerate(arr)}\r\n\r\nbit1=FenwickTree(n+5) #i项最小值\r\n\r\nbit2=FenwickTree(n+5) #i项+j项最小值\r\n\r\nres=inf\r\n\r\n\r\nfor x,y in zip(a,b):\r\n res=min(res,bit2.query_min(d[x]-1)+y)\r\n bit2.update(d[x],bit1.query_min(d[x]-1)+y)\r\n bit1.update(d[x],y)\r\n\r\nprint([res,-1][res==inf])\r\n\r\n\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nMIN = 3*(10**8)+1\r\ndp = [MIN]*n\r\nfor i in range(1, len(s)):\r\n for j in range(0, i):\r\n if s[j] < s[i]:\r\n dp[i] = min(dp[i], c[j]+c[i])\r\n MIN = min(dp[j]+c[i], MIN)\r\nif MIN > 3*(10**8):\r\n print(-1)\r\nelse:\r\n print(MIN)", "'''\r\n【灵茶の试炼】\r\nhttps://docs.qq.com/sheet/DWGFoRGVZRmxNaXFz\r\n\r\nhttps://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n'''\r\n\r\n\r\nfrom cmath import inf\r\nfrom collections import defaultdict\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, a, b = _n(), _nA(), _nA()\r\n h1 = [inf]*n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n h1[j] = min(h1[j], b[i]+b[j])\r\n h2 = [inf]*n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if a[j] > a[i]:\r\n h2[j] = min(h2[j], h1[i]+b[j])\r\n ret=min(h2)\r\n if ret==inf:\r\n print(-1)\r\n else:\r\n print(ret)\r\n\r\nsolve()\r\n", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn = aint()\r\nl = alist()\r\nc = alist()\r\nans = float(\"inf\")\r\n\r\nd = [float(\"inf\")]*n\r\nfor i in range(n-1,-1,-1):\r\n for j in range(i+1, n):\r\n if l[i]<l[j]:\r\n d[i] = min(d[i], c[j])\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if l[i]<l[j] and d[j]!=float(\"inf\"):\r\n ans = min(ans, c[i]+c[j]+d[j])\r\n\r\nif ans==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "from sys import *\r\nfrom math import *\r\nfrom bisect import *\r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().split()))\r\nb=list(map(int,stdin.readline().split()))\r\nm=[]\r\nc=[]\r\nfor i in range(n):\r\n x=[]\r\n l = max(b)+1\r\n k=-1\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:\r\n x.append(j)\r\n if b[j]<l:\r\n l=b[j]\r\n k=j\r\n c.append(k)\r\n m.append(x)\r\nans=sum(b)+1\r\nfor i in range(n-1):\r\n x=b[i]\r\n for j in range(len(m[i])):\r\n y=b[m[i][j]]\r\n if c[m[i][j]] != -1:\r\n z=b[c[m[i][j]]]\r\n if x+y+z<ans:\r\n ans=x+y+z\r\nif ans==sum(b)+1:\r\n print(-1)\r\nelse:\r\n print(ans)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nmx=1e18\r\nfor i in range(n):\r\n d=-1\r\n cost=b[i]\r\n for j in range(i):\r\n if a[j]>=a[i]:continue\r\n if d==-1 or b[d]>b[j]:\r\n d=j\r\n if d==-1:continue\r\n cost+=b[d]\r\n d=-1\r\n for j in range(i+1,n):\r\n if a[j]<=a[i]:continue\r\n if d==-1 or b[d]>b[j]:\r\n d=j\r\n if d==-1:continue\r\n cost+=b[d]\r\n mx=min(mx,cost)\r\nif mx==1e18:\r\n print(\"-1\")\r\nelse:\r\n print(mx)\r\n \r\n", "class node():\n def __init__(self):\n self.id=0\n self.c=0\n self.s=0\nn=int(input())\np=[node() for i in range(n)]\nfor i in range(n):\n p[i].id=i\na=list(map(int,input().split()))\nfor i in range(n):\n p[i].s=a[i]\na=list(map(int,input().split()))\nfor i in range(n):\n p[i].c=a[i]\np.sort(key=lambda x:x.s)\nans=int(1e10)\nfor i in range(1,n-1):\n t1=int(1e10)\n t2=int(1e10)\n for j in range(i):\n if p[j].id<p[i].id and p[j].s<p[i].s:\n t1=min(t1,p[j].c)\n for j in range(i+1,n):\n if p[j].id>p[i].id and p[j].s>p[i].s:\n t2=min(t2,p[j].c)\n ans=min(ans,t1+t2+p[i].c)\nif ans==int(1e10):\n print(-1)\nelse:\n print(ans)\n \t\t\t\t\t\t \t \t \t \t\t \t \t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nminimum=1e11\r\nfor j in range(1,n):\r\n temp=1e10\r\n ans=0\r\n for i in range(0,j):\r\n if a[i]<a[j]:\r\n temp=min(temp,b[i])\r\n if temp==0:\r\n continue\r\n ans+=temp\r\n temp=1e10\r\n for k in range(j+1,n):\r\n if a[k]>a[j]:\r\n temp=min(temp,b[k])\r\n if temp==0:\r\n continue\r\n ans+=temp\r\n ans+=b[j]\r\n minimum=min(minimum,ans)\r\n# print(minimum)\r\nif minimum>1e10:\r\n print(-1)\r\nelse:\r\n print(minimum)", "import string\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nread=lambda :map(lambda s:int(s),input().strip().split())\r\nreadi=lambda :int(input())\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd\r\nRANDOM = randint(1, 10 ** 9)\r\nclass Wrapper(int):\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nfor _ in range(1):\r\n n=readi()\r\n a=list(read())\r\n c=list(read())\r\n dp=[[float(\"inf\")]*3 for i in range(n)]\r\n ans=float(\"inf\")\r\n dp[0][0]=c[0]\r\n for i in range(len(a)):\r\n for j in range(i):\r\n if a[i]>a[j]:\r\n dp[i][1]=min(dp[i][1],dp[j][0]+c[i])\r\n dp[i][2]=min(dp[i][2],dp[j][1]+c[i])\r\n ans=min(ans,dp[i][2])\r\n dp[i][0]=min(dp[i][0],c[i])\r\n print([ans,-1][ans==float(\"inf\")])\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nans = math.inf\r\ndp = [math.inf]*n\r\nfor i in range(1, n):\r\n for j in range(0, i):\r\n if a[j] < a[i]:\r\n dp[i] = min(dp[i], c[j] + c[i])\r\n#print(dp)\r\nfor i in range(2, n):\r\n for j in range(1, i):\r\n if a[j] < a[i]:\r\n #print(a[j], a[i])\r\n ans = min(ans, dp[j] + c[i])\r\nif ans == math.inf:\r\n sys.stdout.write(\"-1\")\r\nelse:\r\n sys.stdout.write(str(ans))", "n = int(input())\r\ns = list(map(int, input().strip().split()))\r\nc = list(map(int, input().strip().split()))\r\n\r\ndp = [float('inf') for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n dp[i] = min(dp[i], c[i]+c[j])\r\n\r\n\r\ndp2 = [float('inf') for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i):\r\n if s[j] < s[i]:\r\n dp2[i] = min(dp2[i], dp[j]+c[i])\r\nans = min(dp2)\r\nif ans == float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nminCost = float('inf')\r\nfor j in range(1, n-1):\r\n curr = s[j]\r\n minLs = float('inf')\r\n minMax = float('inf')\r\n for i in range(j):\r\n if s[i] < curr:\r\n minLs = min(minLs, c[i])\r\n for i in range(j+1, n):\r\n if s[i] > curr:\r\n minMax = min(minMax, c[i])\r\n if minLs == float('inf') or minMax == float('inf'):\r\n continue\r\n minCost = min(minCost, c[j] + minLs + minMax)\r\n\r\nprint(-1 if minCost == float('inf') else minCost)", "n = int(input())\ns = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nans = -1\n\nfor i in range(1, n - 1):\n temp1 = -1\n temp2 = -1\n for j in range(0, i):\n if(s[i] > s[j]):\n if(temp1 == -1):\n temp1 = c[j]\n else:\n temp1 = min(temp1, c[j])\n for j in range(i + 1, n):\n if(s[i] < s[j]):\n if(temp2 == -1):\n temp2 = c[j]\n else:\n temp2 = min(temp2, c[j])\n\n if(ans != -1 and temp1 != -1 and temp2 != -1):\n ans = min(ans, c[i] + temp1 + temp2)\n elif(temp1 != -1 and temp2 != -1):\n ans = c[i] + temp1 + temp2\n\nprint(ans)", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n# mini = 1e10\r\n# d = dict()\r\nmini = 10**10\r\nfor j in range(1, n-1):\r\n i = j - 1\r\n k = j + 1\r\n min1 = 10**10\r\n min2 = 10**10\r\n while (i >= 0):\r\n if s[i] < s[j]:\r\n min1 = min(min1, c[i])\r\n i -= 1\r\n while (k < n):\r\n if s[j] < s[k]:\r\n min2 = min(min2, c[k])\r\n k += 1\r\n mini = min(mini, min1 + min2 + c[j])\r\nif mini >= 10**10:\r\n print(-1)\r\nelse:\r\n print(mini)", "from sys import *\r\nfrom math import *\r\nfrom bisect import *\r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().split()))\r\nc=list(map(int,stdin.readline().split()))\r\nans=[]\r\nf=0\r\n\r\nfor i in range(n):\r\n c1 = c2 = max(c) + 1\r\n for j in range(i+1,n):\r\n if a[j]>a[i]:\r\n c1=min(c1,c[j])\r\n for j in range(i):\r\n if a[j]<a[i]:\r\n c2=min(c2,c[j])\r\n if c1!=max(c)+1 and c2!=max(c)+1:\r\n f=1\r\n ans.append(c[i]+c1+c2)\r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(min(ans))", "import sys, itertools, math, collections, random\n\ndef ia():\n return [int(i) for i in sys.stdin.readline().strip().split(\" \")]\n\ndef ii():\n return int(sys.stdin.readline().strip())\n\ndef istr():\n return sys.stdin.readline().strip()\n\n###\n\nn = ii()\nS = ia()\nC = ia()\n\nans = 10**10\nfor i in range(n):\n v = S[i]\n left = 10**10\n for j in range(i-1, -1, -1):\n vl = S[j]\n if vl < v:\n left = min(left, C[j])\n right = 10**10\n for j in range(i+1, n):\n vr = S[j]\n if vr > v:\n right = min(right, C[j])\n if left < 10**10 and right < 10**10:\n ans = min(ans, C[i] + left + right)\n\nif ans < 10**10:\n print(ans)\nelse:\n print(-1)", "# Problem: C. Three displays\r\n# Contest: Codeforces - Codeforces Round 485 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/987/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nfrom bisect import bisect_left\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/987/C\r\n\r\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\r\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\r\n如果不存在这样的 (i,j,k)，输出 -1。\r\n\r\n进阶：O(nlogn)。\r\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\r\n输入\r\n5\r\n2 4 5 4 10\r\n40 30 20 10 40\r\n输出 90\r\n\r\n输入\r\n3\r\n100 101 100\r\n2 4 5\r\n输出 -1\r\n\r\n输入\r\n10\r\n1 2 3 4 5 6 7 8 9 10\r\n10 13 11 14 15 12 13 13 18 13\r\n输出 33\r\n\"\"\"\r\n\r\ninf = 10 ** 9\r\n\r\n\r\n# 187 ms\r\ndef solve1():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n f[i] = min(f[i], b[j] + b[i])\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i]:\r\n g[i] = min(g[i], f[j] + b[i])\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\n# 124 ms\r\ndef solve2():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n f, g = [inf] * n, [inf] * n\r\n for i in range(1, n):\r\n for j in range(i):\r\n if a[j] < a[i] and f[i] > b[j] + b[i]:\r\n f[i] = b[j] + b[i]\r\n for i in range(2, n):\r\n for j in range(i):\r\n if a[j] < a[i] and g[i] > f[j] + b[i]:\r\n g[i] = f[j] + b[i]\r\n ans = min(g)\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nclass ZKW:\r\n # n = 1\r\n # size = 1\r\n # log = 2\r\n # d = [0]\r\n # op = None\r\n # e = 10 ** 15\r\n \"\"\"自低向上非递归写法线段树，0_indexed\r\n tmx = ZKW(pre, max, -2 ** 61)\r\n \"\"\"\r\n __slots__ = ('n', 'op', 'e', 'log', 'size', 'd')\r\n\r\n def __init__(self, V, OP, E):\r\n \"\"\"\r\n V: 原数组\r\n OP: 操作:max,min,sum\r\n E: 每个元素默认值\r\n \"\"\"\r\n self.n = len(V)\r\n self.op = OP\r\n self.e = E\r\n self.log = (self.n - 1).bit_length()\r\n self.size = 1 << self.log\r\n self.d = [E for i in range(2 * self.size)]\r\n for i in range(self.n):\r\n self.d[self.size + i] = V[i]\r\n for i in range(self.size - 1, 0, -1):\r\n self.update(i)\r\n\r\n def set(self, p, x):\r\n # assert 0 <= p and p < self.n\r\n update = self.update\r\n p += self.size\r\n self.d[p] = x\r\n for i in range(1, self.log + 1):\r\n update(p >> i)\r\n\r\n def get(self, p):\r\n # assert 0 <= p and p < self.n\r\n return self.d[p + self.size]\r\n\r\n def query(self, l, r): # [l,r)左闭右开\r\n # assert 0 <= l and l <= r and r <= self.n\r\n sml, smr, op, d = self.e, self.e, self.op, self.d\r\n\r\n l += self.size\r\n r += self.size\r\n\r\n while l < r:\r\n if l & 1:\r\n sml = op(sml, d[l])\r\n l += 1\r\n if r & 1:\r\n smr = op(d[r - 1], smr)\r\n r -= 1\r\n l >>= 1\r\n r >>= 1\r\n return self.op(sml, smr)\r\n\r\n def all_query(self):\r\n return self.d[1]\r\n\r\n def max_right(self, l, f):\r\n \"\"\"返回l右侧第一个不满足f的位置\"\"\"\r\n # assert 0 <= l and l <= self.n\r\n # assert f(self.e)\r\n if l == self.n:\r\n return self.n\r\n l += self.size\r\n\r\n sm, op, d, size = self.e, self.op, self.d, self.size\r\n while True:\r\n while l % 2 == 0:\r\n l >>= 1\r\n if not (f(op(sm, d[l]))):\r\n while l < size:\r\n l = 2 * l\r\n if f(op(sm, d[l])):\r\n sm = op(sm, d[l])\r\n l += 1\r\n return l - size\r\n sm = op(sm, d[l])\r\n l += 1\r\n if (l & -l) == l:\r\n break\r\n return self.n\r\n\r\n def min_left(self, r, f):\r\n \"\"\"返回r左侧连续满足f的最远位置的位置\"\"\"\r\n # assert 0 <= r and r < self.n\r\n # assert f(self.e)\r\n if r == 0:\r\n return 0\r\n r += self.size\r\n sm, op, d, size = self.e, self.op, self.d, self.size\r\n\r\n while True:\r\n r -= 1\r\n while r > 1 and (r % 2):\r\n r >>= 1\r\n if not (f(op(d[r], sm))):\r\n while r < size:\r\n r = (2 * r + 1)\r\n if f(op(d[r], sm)):\r\n sm = op(d[r], sm)\r\n r -= 1\r\n return r + 1 - size\r\n sm = op(d[r], sm)\r\n if (r & -r) == r:\r\n break\r\n return 0\r\n\r\n def update(self, k):\r\n self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])\r\n\r\n def __str__(self):\r\n return str([self.get(i) for i in range(self.n)])\r\n\r\n\r\n# 124 ms\r\ndef solve():\r\n n, = RI()\r\n a = RILST()\r\n b = RILST()\r\n h = sorted(set(a))\r\n f1 = ZKW([inf] * len(h), min, inf)\r\n f2 = ZKW([inf] * len(h), min, inf)\r\n ans = inf\r\n for k, v in zip(a, b):\r\n x = bisect_left(h, k)\r\n ans = min(ans, f2.query(0, x) + v)\r\n f2.set(x, min(f2.get(x), f1.query(0, x) + v))\r\n f1.set(x, min(f1.get(x), v))\r\n\r\n if ans == inf:\r\n return print(-1)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import bisect\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nans=10**18\r\nfor mid in range(1,n-1):\r\n l1=[c[i] for i in range(mid) if s[i]<s[mid]]+[10**18]\r\n l2=[c[i] for i in range(mid+1,n) if s[i]>s[mid]]+[10**18]\r\n ans=min(ans,min(l1)+c[mid]+min(l2))\r\nif ans>=10**18:\r\n print(-1)\r\nelse:\r\n print(ans)", "import sys\r\nn = int(input())\r\nl = [int(x) for x in input().split()] \r\nc = [int(x) for x in input().split()] \r\nans = sys.maxsize\r\nfor j in range(1,n-1,1):\r\n tempAns1 = sys.maxsize\r\n tempAns2 = sys.maxsize\r\n for i in range(j):\r\n if l[i]<l[j]:\r\n tempAns1 = min(tempAns1,c[i])\r\n for k in range(j+1,n,1):\r\n if l[k]>l[j]:\r\n tempAns2 = min(tempAns2,c[k])\r\n if tempAns1!=sys.maxsize and tempAns2!=sys.maxsize:\r\n ans = min(ans,tempAns1+tempAns2+c[j])\r\nif ans == sys.maxsize:\r\n print(-1)\r\nelse:\r\n print(ans)", "n = int(input())\r\nfont = list(map(int, input().split()))\r\nprice = list(map(int, input().split()))\r\ninf = float('inf')\r\nans = inf\r\nfor i in range(1,n-1):\r\n temp1 = inf\r\n for j in range(i):\r\n if font[j]<font[i]:\r\n temp1 = min(temp1, price[j])\r\n temp2 = inf\r\n for j in range(i+1, n):\r\n if font[j] > font[i]:\r\n temp2 = min(temp2, price[j])\r\n ans =min(ans, price[i]+ temp1 + temp2) \r\nif ans == inf:\r\n print(-1)\r\nelse:\r\n print(ans) ", "inp = lambda: map(int, input().rstrip().split())\nn = int(input())\ns = list(inp())\nc = list(inp())\ndp = [100000000000] * n\nfor i in range(1, n - 1):\n for j in range(i + 1, n):\n if s[j] > s[i]:\n dp[i] = min(dp[i], c[j] + c[i])\nminm = 100000000000\n# print(dp)\nfor i in range(0, n - 2):\n for j in range(i + 1, n - 1):\n if s[j] > s[i]:\n minm = min(minm, dp[j] + c[i])\n # print(\"yes\")\nif minm == 100000000000:\n print(-1)\nelse:\n print(minm)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans = 10**11\r\nfor i in range(1,n-1):\r\n mn1 = 10**11\r\n mn2 = 10**11\r\n for j in range (i+1,n):\r\n if (a[j] > a[i]):\r\n mn1 = min(mn1,b[j])\r\n for j in range (0,i):\r\n if (a[j] < a[i]):\r\n mn2 = min(mn2,b[j])\r\n # print(f\"{i} {mn1} {mn2}\")\r\n ans = min(ans,mn1+mn2+b[i])\r\nif ans >= 10**11: \r\n ans = -1\r\nprint(ans)\r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nc = 10000000000\r\nb = dict()\r\nfor i in range(n):\r\n c1 = 10000000000\r\n for j in range(i+1, n):\r\n if w[j] > w[i] and s[j] < c1:\r\n c1 = s[j]\r\n b[w[i]] = c1\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if w[j] > w[i]:\r\n x = max(w[j], w[i])\r\n y = s[j] + s[i] + b.get(x, 10000000000)\r\n if y < c:\r\n c = y\r\n\r\nprint(c if c != 10000000000 else -1)", "import sys, math, itertools, functools, collections, bisect\ninput = sys.stdin.readline\n#sys.setrecursionlimit(10**6)\n\nrs = lambda: input().strip()\nri = lambda: int(input())\nrmi = lambda: map(int, input().split())\nra = lambda: [int(x) for x in input().split()]\n\ntest_case = 1\n\n#-------- DIFFERENT WAYS TO UNSTUCK ------------ \n# 1. Frequency/Value domain and Pigeon Hole Principle \n# 2. Search from end to start instead of start to end\n# 3. Prefix Suffix\n# 4. Brute force if small input size\n\nINF = 10**18\n\ndef solve():\n ans = INF\n for j in range(1,n-1):\n ci, cj, ck = INF, C[j], INF\n \n for i in range(j):\n if S[i] < S[j]:\n ci = min(ci, C[i])\n \n \n for k in range(j+1,n):\n if S[j] < S[k]:\n ck = min(ck, C[k])\n \n if ci == INF or ck == INF: continue \n ans = min(ans, ci + cj + ck)\n \n return ans if ans != INF else -1\n \n \n \n\nfor _ in range(test_case):\n n = ri()\n S = ra()\n C = ra()\n print(solve())\n\n\"\"\"\n10\r\n802030518 598196518 640274071 983359971 71550121 96204862 799843967 446173607 796619138 402690754\r\n23219513 68171337 12183499 5549873 73542337 66661387 79397647 34495917 31413076 50918417\n\n85904709\n\"\"\"\n", "'''\r\nyou have 2 arrays one of font sizes\r\nand other is cost\r\npick three elemments which rae incresing\r\nand cost is minimum\r\n\r\nif you are at an element and want to add\r\nsome element in your subsequence then\r\n\r\n2 4 [5] 4 10\r\n40 30 [20] 10 40\r\nthe idea here is that ask the question that if you are at some element\r\nand you want to put this element in the seq then what matters about is we should think in such a ways\r\n\r\nthere are two things --> you can begin the subsequence from here or extend the subsequence at this index i\r\n\r\ni->poisition i\r\ndp(i,len) --> here i, is the last elemnt placed so far 1, 2\r\n\r\n\r\ndp(i,len) -> if begin the subsequence with i then --> dp[i][1]=cost[i]\r\n if extend then dp[i][j]=min(dp[k][j-1]+cost[i]) and j<i\r\n'''\r\n\r\nn=int(input())\r\na=list(map(int,input().split(\" \")))\r\nc=list(map(int,input().split(\" \")))\r\ninf=1e17\r\ndp=[[inf for i in range(3)] for j in range(n+1)]\r\n\r\nans=inf\r\n\r\nfor i in range(n):\r\n dp[i][0]=c[i]\r\n for j in range(1,3):\r\n dp[i][j]=inf\r\n for k in range(0,i):\r\n if(a[k]<a[i]):\r\n dp[i][j]=min(dp[i][j],dp[k][j-1]+c[i])\r\n ans=min(ans,dp[i][2])\r\nif(ans==inf):\r\n print(\"-1\")\r\nelse:\r\n print(ans)\r\n", "n = int(input())\r\n\r\na = [[int(i)] for i in input().split()]\r\n\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n a[i].append(b[i])\r\n\r\ndel b\r\n\r\nd = [0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n mini = 0\r\n for j in range(i):\r\n if a[j][0] < a[i][0]:\r\n if mini == 0:\r\n mini = a[j][1]\r\n else:\r\n mini = min(mini, a[j][1])\r\n if mini:\r\n mini += a[i][1]\r\n d[i] = mini\r\n\r\nc = [0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n mini = 0\r\n if d[i]:\r\n for j in range(i + 1, n):\r\n if a[i][0] < a[j][0]:\r\n if mini == 0:\r\n mini = a[j][1]\r\n else:\r\n mini = min(mini, a[j][1])\r\n if mini:\r\n c[i] = d[i] + mini\r\n\r\nc = [i for i in c if i > 0]\r\n\r\nif len(c):\r\n print(min(c))\r\nelse:\r\n print('-1')", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10**6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n=vary(1)\r\n indices=array_int()\r\n cost=array_int()\r\n ans=float('inf')\r\n mint=[]\r\n for i in range(n):\r\n ans=float('inf')\r\n total=cost[i]\r\n flag=0\r\n for j in range(i):\r\n if indices[i]>indices[j]:\r\n ans=min(ans,cost[j])\r\n flag=1\r\n if flag!=0:\r\n total+=ans\r\n ans=float('inf')\r\n flag=0\r\n for k in range(i+1,n):\r\n if indices[k]>indices[i]:\r\n ans=min(ans,cost[k])\r\n flag=1\r\n if flag!=0:\r\n total+=ans\r\n mint.append(total)\r\n else:\r\n continue\r\n else:\r\n continue\r\n if len(mint)>0:\r\n print(min(mint))\r\n else:\r\n print(-1)\r\n\r\n\r\n \r\n\r\n \r\n\r\n ", "import sys\nfrom collections import Counter\n\nimport functools\nimport math\nimport random\nimport sys\nimport os\nfrom bisect import bisect_left, bisect_right\nfrom collections import Counter, defaultdict, deque\nfrom functools import lru_cache, reduce\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\nfrom io import BytesIO, IOBase\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# RSI = lambda: int(sys.stdin.buffer.readline())\nRI = lambda: list(map(int, sys.stdin.buffer.readline().strip().split()))\nRS = lambda: sys.stdin.buffer.readline().strip().decode('ascii')\nRLS = lambda: sys.stdin.buffer.readline().strip().decode('ascii').split()\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\n\nif sys.hexversion == 50924784:\n sys.stdin = open('./data')\n\"\"\"\n参考样例\n输入\n5\n2 4 5 4 10\n40 30 20 10 40\n输出 90\n\n输入\n3\n100 101 100\n2 4 5\n输出 -1\n\n输入\n10\n1 2 3 4 5 6 7 8 9 10\n10 13 11 14 15 12 13 13 18 13\n输出 33\n\n题意简述：\nhttps://codeforces.com/problemset/problem/987/C\n\n输入 n(3≤n≤3000) 和长度均为 n 的数组 a(1≤a[i]≤1e9) 和数组 b(1≤b[i]≤1e8)。\n输出在满足 i<j<k 且 a[i]<a[j]<a[k] 的前提下，b[i]+b[j]+b[k] 的最小值。\n如果不存在这样的 (i,j,k)，输出 -1。\n\n进阶：O(nlogn)。\n进阶：改成 a 的长为 4 的递增子序列（本题长为 3）。改成 5？改成 m？\n\n思路：\n\n\n\"\"\"\n\n\ndef solve():\n n, = RI()\n a = RI()\n b = RI()\n d = {x: idx + 1 * 2 for idx, x in enumerate(sorted(set(a)))}\n inf = float('inf')\n s = (n << 1) + 1\n m = 3\n bi = [[inf] * s for _ in range(m)]\n bi[0] = [0] * s\n\n def av(l, i, v):\n while i < s:\n if v < l[i]:\n l[i] = v\n else:\n break\n i += i & -i\n\n def ps(l, i):\n r = l[i]\n while i:\n if l[i] < r:\n r = l[i]\n i -= i & -i\n return r\n\n res = inf\n for ta, tb in zip(a, b):\n ti = d[ta]\n res = min(res, ps(bi[-1], ti) + tb)\n for j in range(m - 1, 0, -1):\n av(bi[j], ti + 1, tb + ps(bi[j - 1], ti))\n print(-1 if res == inf else res)\n\n return 0\n\n\n# for t in range(RIL()[0] - 1):\n# solve()\nsolve()\n" ]

{"inputs": ["5\n2 4 5 4 10\n40 30 20 10 40", "3\n100 101 100\n2 4 5", "10\n1 2 3 4 5 6 7 8 9 10\n10 13 11 14 15 12 13 13 18 13", "3\n1 2 3\n100000000 100000000 100000000", "3\n999999998 999999999 1000000000\n100000000 100000000 99999999", "10\n802030518 598196518 640274071 983359971 71550121 96204862 799843967 446173607 796619138 402690754\n23219513 68171337 12183499 5549873 73542337 66661387 79397647 34495917 31413076 50918417", "20\n452405440 586588704 509061481 552472140 16115810 148658854 66743034 628305150 677780684 519361360 208050516 401554301 954478790 346543678 387546138 832279893 641889899 80960260 717802881 588066499\n61699500 83254572 59454419 27833657 55743179 99661234 94729965 75591136 62937826 3626886 73906880 3664913 39990362 94385934 33153747 23840219 64514676 14746017 13062847 65187713", "3\n1 2 3\n1 1 1"], "outputs": ["90", "-1", "33", "300000000", "299999999", "85904709", "72432912", "3"]}

UNKNOWN

PYTHON3

CODEFORCES

104

d29152b2c4baf0df2caf31c9d71faa80

Sums of Digits

Vasya had a strictly increasing sequence of positive integers *a*1, ..., *a**n*. Vasya used it to build a new sequence *b*1, ..., *b**n*, where *b**i* is the sum of digits of *a**i*'s decimal representation. Then sequence *a**i* got lost and all that remained is sequence *b**i*. Vasya wonders what the numbers *a**i* could be like. Of all the possible options he likes the one sequence with the minimum possible last number *a**n*. Help Vasya restore the initial sequence. It is guaranteed that such a sequence always exists. The first line contains a single integer number *n* (1<=≤<=*n*<=≤<=300). Next *n* lines contain integer numbers *b*1, ..., *b**n* — the required sums of digits. All *b**i* belong to the range 1<=≤<=*b**i*<=≤<=300. Print *n* integer numbers, one per line — the correct option for numbers *a**i*, in order of following in sequence. The sequence should be strictly increasing. The sum of digits of the *i*-th number should be equal to *b**i*. If there are multiple sequences with least possible number *a**n*, print any of them. Print the numbers without leading zeroes. Sample Input 3 1 2 3 3 3 2 1 Sample Output 1 2 3 3 11 100

[ "import sys\r\n\r\n\r\ndef get_max(su, le):\r\n div, mod = divmod(su, 9)\r\n ret = ['9'] * div\r\n if mod:\r\n ret = [str(mod)] + ret\r\n\r\n if le - len(ret) > 0:\r\n x = str(int(ret.pop(0)) - 1)\r\n ret = ['1', x] + ret\r\n\r\n if le - len(ret) > 0:\r\n ret = [ret[0]] + ['0'] * (le - len(ret)) + ret[1:]\r\n\r\n return ret\r\n\r\n\r\ndef get_max2(su, le):\r\n div, mod = divmod(su, 9)\r\n ret = ['9'] * div\r\n if mod:\r\n ret = [str(mod)] + ret\r\n\r\n return ['0'] * (le - len(ret)) + ret\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nlst = ['0']\r\nfor _ in range(int(input())):\r\n su = int(input())\r\n le = su // 9 + bool(su % 9)\r\n\r\n if le > len(lst):\r\n lst = get_max(su, le)\r\n else:\r\n rem, ix = su, -1\r\n for i in range(len(lst)):\r\n if int(lst[i]) > rem:\r\n break\r\n\r\n if lst[i] != '9' and rem > int(lst[i]) and 9 * (len(lst) - i) >= rem:\r\n ix = i\r\n rem -= int(lst[i])\r\n\r\n if ix == -1:\r\n lst = get_max(su, len(lst) + 1)\r\n else:\r\n rem = su - sum([int(lst[i]) for i in range(ix + 1)])\r\n cur = 1\r\n for i in range(int(lst[ix]) + 1, 10):\r\n rem -= 1\r\n if (len(lst) - ix - 1) * 9 >= rem:\r\n break\r\n cur += 1\r\n lst = lst[:ix] + [str(int(lst[ix]) + cur)] + get_max2(rem, len(lst) - ix - 1)\r\n\r\n print(''.join(lst))\r\n", "n = int(input())\r\n\r\ndef get_sum(x):\r\n result = 0\r\n while x > 0:\r\n d, m = divmod(x, 10)\r\n result += m\r\n x = d\r\n return result\r\n\r\ndef dec(x):\r\n t = x\r\n mult = 1\r\n while True:\r\n d, m = divmod(x, 10)\r\n if m != 0:\r\n return t + (10 - m) * mult\r\n x = d\r\n mult *= 10\r\n\r\ndef get_next(prev_x, prev_sum, sum):\r\n t = prev_x\r\n while True:\r\n while prev_sum > sum:\r\n prev_x = dec(prev_x)\r\n prev_sum = get_sum(prev_x)\r\n s = list(str(prev_x))[::-1]\r\n required = sum - prev_sum\r\n i = 0\r\n while required:\r\n try:\r\n a = min(9 - (ord(s[i]) - ord('0')), required)\r\n s[i] = chr(ord(s[i]) + a)\r\n except IndexError:\r\n a = min(9, required)\r\n s += chr(a + ord('0'))\r\n required -= a\r\n i += 1\r\n x = int(\"\".join(reversed(s)))\r\n if x != t:\r\n return x\r\n prev_x = dec(prev_x)\r\n prev_sum = get_sum(prev_x)\r\n\r\na = s = 0\r\nfor i in range(n):\r\n b = int(input())\r\n a = get_next(a, s, b)\r\n print(a)\r\n s = b\r\n" ]

{"inputs": ["3\n1\n2\n3", "3\n3\n2\n1", "10\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1", "10\n8\n8\n5\n1\n2\n7\n3\n8\n9\n4", "10\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "100\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n1", "100\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18\n18", "1\n139", "1\n6"], "outputs": ["1\n2\n3", "3\n11\n100", "1\n2\n3\n4\n5\n6\n7\n8\n9\n10", "8\n17\n23\n100\n101\n106\n111\n116\n117\n121", "1\n10\n100\n1000\n10000\n100000\n1000000\n10000000\n100000000\n1000000000", "1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\n63\n64\n65\n66\n67\n68\n69\n70\n71\n72\n73\n74\n75\n76\n77\n78\n79\n80\n81\n82\n83\n84\n85\n86\n87\n88\n89\n90\n91\n92\n93\n94\n95\n96\n97\n98\n99\n100", "99\n189\n198\n279\n288\n297\n369\n378\n387\n396\n459\n468\n477\n486\n495\n549\n558\n567\n576\n585\n594\n639\n648\n657\n666\n675\n684\n693\n729\n738\n747\n756\n765\n774\n783\n792\n819\n828\n837\n846\n855\n864\n873\n882\n891\n909\n918\n927\n936\n945\n954\n963\n972\n981\n990\n1089\n1098\n1179\n1188\n1197\n1269\n1278\n1287\n1296\n1359\n1368\n1377\n1386\n1395\n1449\n1458\n1467\n1476\n1485\n1494\n1539\n1548\n1557\n1566\n1575\n1584\n1593\n1629\n1638\n1647\n1656\n1665\n1674\n1683\n1692\n1719\n1728\n1737\n1746\n175...", "4999999999999999", "6"]}

UNKNOWN

PYTHON3

CODEFORCES

2

d2b5986193f7609c75ca4859225eff13

Mahmoud and a Dictionary

Mahmoud wants to write a new dictionary that contains *n* words and relations between them. There are two types of relations: synonymy (i. e. the two words mean the same) and antonymy (i. e. the two words mean the opposite). From time to time he discovers a new relation between two words. He know that if two words have a relation between them, then each of them has relations with the words that has relations with the other. For example, if like means love and love is the opposite of hate, then like is also the opposite of hate. One more example: if love is the opposite of hate and hate is the opposite of like, then love means like, and so on. Sometimes Mahmoud discovers a wrong relation. A wrong relation is a relation that makes two words equal and opposite at the same time. For example if he knows that love means like and like is the opposite of hate, and then he figures out that hate means like, the last relation is absolutely wrong because it makes hate and like opposite and have the same meaning at the same time. After Mahmoud figured out many relations, he was worried that some of them were wrong so that they will make other relations also wrong, so he decided to tell every relation he figured out to his coder friend Ehab and for every relation he wanted to know is it correct or wrong, basing on the previously discovered relations. If it is wrong he ignores it, and doesn't check with following relations. After adding all relations, Mahmoud asked Ehab about relations between some words based on the information he had given to him. Ehab is busy making a Codeforces round so he asked you for help. The first line of input contains three integers *n*, *m* and *q* (2<=≤<=*n*<=≤<=105, 1<=≤<=*m*,<=*q*<=≤<=105) where *n* is the number of words in the dictionary, *m* is the number of relations Mahmoud figured out and *q* is the number of questions Mahmoud asked after telling all relations. The second line contains *n* distinct words *a*1,<=*a*2,<=...,<=*a**n* consisting of small English letters with length not exceeding 20, which are the words in the dictionary. Then *m* lines follow, each of them contains an integer *t* (1<=≤<=*t*<=≤<=2) followed by two different words *x**i* and *y**i* which has appeared in the dictionary words. If *t*<==<=1, that means *x**i* has a synonymy relation with *y**i*, otherwise *x**i* has an antonymy relation with *y**i*. Then *q* lines follow, each of them contains two different words which has appeared in the dictionary. That are the pairs of words Mahmoud wants to know the relation between basing on the relations he had discovered. All words in input contain only lowercase English letters and their lengths don't exceed 20 characters. In all relations and in all questions the two words are different. First, print *m* lines, one per each relation. If some relation is wrong (makes two words opposite and have the same meaning at the same time) you should print "NO" (without quotes) and ignore it, otherwise print "YES" (without quotes). After that print *q* lines, one per each question. If the two words have the same meaning, output 1. If they are opposites, output 2. If there is no relation between them, output 3. See the samples for better understanding. Sample Input 3 3 4 hate love like 1 love like 2 love hate 1 hate like love like love hate like hate hate like 8 6 5 hi welcome hello ihateyou goaway dog cat rat 1 hi welcome 1 ihateyou goaway 2 hello ihateyou 2 hi goaway 2 hi hello 1 hi hello dog cat dog hi hi hello ihateyou goaway welcome ihateyou Sample Output YES YES NO 1 2 2 2 YES YES YES YES NO YES 3 3 1 1 2

[ "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef find_root(root_dict, x):\r\n L = []\r\n while x != root_dict[x]:\r\n L.append(x)\r\n x = root_dict[x]\r\n for y in L:\r\n root_dict[y] = x \r\n return x \r\n \r\ndef process(A, X, Queries):\r\n n = len(A)\r\n root_dict = [i for i in range(2*n)]\r\n d = {}\r\n for i in range(n):\r\n d[A[i]] = i \r\n for t, x, y in X:\r\n x = find_root(root_dict, d[x])\r\n y = find_root(root_dict, d[y])\r\n if x < n:\r\n x2 = find_root(root_dict, x+n) \r\n else:\r\n x2 = find_root(root_dict, x-n)\r\n if y < n:\r\n y2 = find_root(root_dict, y+n)\r\n else:\r\n y2 = find_root(root_dict, y-n)\r\n if t=='1':\r\n if x==y2 or y==x2:\r\n sys.stdout.write('NO\\n')\r\n else:\r\n sys.stdout.write('YES\\n')\r\n root_dict[y] = x \r\n root_dict[y2] = x2 \r\n else:\r\n if x==y or x2==y2:\r\n sys.stdout.write('NO\\n')\r\n else:\r\n sys.stdout.write('YES\\n')\r\n root_dict[y] = x2 \r\n root_dict[y2] = x \r\n for x, y in Queries:\r\n x = find_root(root_dict, d[x])\r\n y = find_root(root_dict, d[y])\r\n if x < n:\r\n x2 = find_root(root_dict, x+n) \r\n else:\r\n x2 = find_root(root_dict, x-n)\r\n if y < n:\r\n y2 = find_root(root_dict, y+n)\r\n else:\r\n y2 = find_root(root_dict, y-n)\r\n if x==y:\r\n sys.stdout.write('1\\n')\r\n elif x==y2:\r\n sys.stdout.write('2\\n')\r\n else:\r\n sys.stdout.write('3\\n')\r\n \r\n return \r\n \r\nn, m, q = [int(x) for x in input().split()]\r\nA = input().decode().strip().split()\r\nX = []\r\nfor i in range(m):\r\n row = input().decode().strip().split()\r\n X.append(row)\r\nQueries = []\r\nfor i in range(q):\r\n row = input().decode().strip().split()\r\n Queries.append(row) \r\nprocess(A, X, Queries)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn, m, q = map(int, input().split())\r\na = list(input().rstrip().decode().split())\r\nd = dict()\r\nfor i in range(n):\r\n d[a[i]] = i\r\nroot = [i for i in range(2 * n)]\r\nrank = [1 for _ in range(2 * n)]\r\nsize = [1 for _ in range(2 * n)]\r\nans = []\r\nfor _ in range(m):\r\n t = list(input().rstrip().decode().split())\r\n u, v = d[t[1]], d[t[2]]\r\n if t[0] == \"1\":\r\n ans0 = \"YES\" if not same(u, v + n) else \"NO\"\r\n if ans0 == \"YES\":\r\n unite(u, v)\r\n unite(u + n, v + n)\r\n else:\r\n ans0 = \"YES\" if not same(u, v) else \"NO\"\r\n if ans0 == \"YES\":\r\n unite(u, v + n)\r\n unite(u + n, v)\r\n ans.append(ans0)\r\nfor _ in range(q):\r\n t = list(input().rstrip().decode().split())\r\n u, v = d[t[0]], d[t[1]]\r\n if same(u, v):\r\n ans0 = 1\r\n elif same(u, v + n):\r\n ans0 = 2\r\n else:\r\n ans0 = 3\r\n ans.append(str(ans0))\r\nsys.stdout.write(\"\\n\".join(ans))", "# template begins\n#####################################\nfrom io import BytesIO, IOBase\nimport sys\nimport math\nimport os\nimport heapq\nfrom collections import defaultdict, deque\nfrom math import ceil\nfrom bisect import bisect_left, bisect_right\nfrom time import perf_counter\n\n\n# region fastio\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\ndef mint(): return map(int, input().split())\ndef mfloat(): return map(float, input().split())\ndef intin(): return int(input())\n\n\nclass DisjointSetUnion:\n def __init__(self, n):\n self.parent = list(range(n))\n self.size = [1] * n\n self.num_sets = n\n self.sets = [{i} for i in range(n)]\n\n def find(self, a):\n acopy = a\n while a != self.parent[a]:\n a = self.parent[a]\n while acopy != a:\n self.parent[acopy], acopy = a, self.parent[acopy]\n return a\n\n def union(self, a, b):\n a, b = self.find(a), self.find(b)\n if a != b:\n if self.size[a] < self.size[b]:\n a, b = b, a\n\n self.num_sets -= 1\n self.parent[b] = a\n self.size[a] += self.size[b]\n self.sets[a] |= self.sets[b]\n\n def get_set(self, a):\n return self.sets[self.find(a)]\n\n def set_size(self, a):\n return self.size[self.find(a)]\n\n def __len__(self):\n return self.num_sets\n\n#####################################\n# template ends\n# Use the recursion snippet if heavy recursion is needed (depth>1000)\n# If constraints are tight, use 1d arrays instead of 2d, like g[i*m+j] instead of g[i][j]\n\n\ndef flip(w1, w2, dsu, meaning):\n w = min(w1, w2, key=dsu.set_size)\n for item in dsu.get_set(w):\n meaning[item] = 1 - meaning[item]\n\n\ndef solve():\n n, m, q = map(int, input().split())\n *words, = input().split()\n words_to_index = {words[i]: i for i in range(n)}\n dsu = DisjointSetUnion(n)\n meaning = [-1]*n\n for _ in range(m):\n relation, w1, w2 = input().split()\n w1, w2 = map(words_to_index.get, (w1, w2))\n if dsu.find(w1) == dsu.find(w2):\n if (relation == '1' and meaning[w1] == meaning[w2]) or (relation == '2' and meaning[w1] != meaning[w2]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if (relation == '1' and meaning[w1] != meaning[w2]) or (relation == '2' and meaning[w1] == meaning[w2]):\n flip(w1, w2, dsu, meaning)\n dsu.union(w1, w2)\n print(\"YES\")\n\n for _ in range(q):\n w1, w2 = map(words_to_index.get, input().split())\n if dsu.find(w1) != dsu.find(w2):\n print(3)\n else:\n print(1 if meaning[w1] == meaning[w2] else 2)\n\n\ndef main():\n t = 1\n # t = int(input())\n for _ in range(t):\n solve()\n\n\nif __name__ == \"__main__\":\n start_time = perf_counter()\n main()\n print(perf_counter()-start_time, file=sys.stderr)\n", "from bisect import bisect_right\r\nfrom collections import defaultdict\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef find(u):\r\n if parent[u] == u:\r\n return u\r\n v=parent[u]\r\n parent[u] = find(v)\r\n\r\n if(d1[u,v]):\r\n val[u]=1-val[v]\r\n else:\r\n val[u]=val[v]\r\n d1[(u,parent[u])]=val[u]^val[parent[u]]\r\n d1[(parent[u],u)] = val[u] ^ val[parent[u]]\r\n\r\n #print(u, parent[u], val[u],val[parent[u]])\r\n return parent[u]\r\n\r\n\r\ndef union(a, b):\r\n u = parent[a]\r\n v = parent[b]\r\n\r\n if size[u] > size[v]:\r\n parent[v] = u\r\n size[u] += size[v]\r\n if(d1[u,v]):\r\n val[v]=1-val[u]\r\n else:\r\n val[v]=val[u]\r\n\r\n\r\n else:\r\n parent[u] = v\r\n size[v] += size[u]\r\n if(d1[u,v]):\r\n val[u]=1-val[v]\r\n else:\r\n val[u]=val[v]\r\n\r\n\r\n\r\nn,m,q=map(int,input().split())\r\nd=defaultdict(lambda:0)\r\nb=list(map(str,input().split()))\r\nfor i in range(n):\r\n d[b[i]]=i+1\r\nparent=[i for i in range(n+1)]\r\nsize = [1 for i in range(n + 1)]\r\nval=[0 for i in range(n+1)]\r\nreq=[]\r\nd1=defaultdict(lambda:0)\r\nfor i in range(m):\r\n b = list(map(str, input().split()))\r\n ty=int(b[0])\r\n u=d[b[1]]\r\n v=d[b[2]]\r\n #print(u,v,find(u),find(v),val[u],val[v])\r\n if(find(u)==find(v)):\r\n if(ty==2):\r\n if(val[u]^val[v]):\r\n req.append(\"YES\")\r\n else:\r\n req.append(\"NO\")\r\n if(ty==1):\r\n\r\n if(not val[u]^val[v]):\r\n req.append(\"YES\")\r\n else:\r\n req.append(\"NO\")\r\n else:\r\n req.append('YES')\r\n p1=parent[u]\r\n p2=parent[v]\r\n\r\n res=0\r\n if(ty==1):\r\n if(val[u]==val[v]):\r\n res=val[p1]^val[p2]\r\n else:\r\n res=val[p1]^(1-val[p2])\r\n else:\r\n if(val[u]==val[v]):\r\n res=val[p1]^(1-val[p2])\r\n else:\r\n res=val[p1]^(val[p2])\r\n\r\n\r\n d1[(p1,p2)]=res\r\n d1[(p2,p1)]=res\r\n\r\n union(p1,p2)\r\n\r\nfor i in range(1,n+1):\r\n parent[i]=find(i)\r\nans=[]\r\nfor i in range(q):\r\n x,y=map(str,input().split())\r\n u,v=d[x],d[y]\r\n if(find(u)==find(v)):\r\n r=val[u]^val[v]\r\n ans.append(r+1)\r\n\r\n else:\r\n ans.append(3)\r\n\r\n\r\n\r\n\r\nfor j in req:\r\n print(j)\r\nfor j in ans:\r\n print(j)\r\n\r\n\r\n\r\n\r\n\r\n" ]

{"inputs": ["3 3 4\nhate love like\n1 love like\n2 love hate\n1 hate like\nlove like\nlove hate\nlike hate\nhate like", "8 6 5\nhi welcome hello ihateyou goaway dog cat rat\n1 hi welcome\n1 ihateyou goaway\n2 hello ihateyou\n2 hi goaway\n2 hi hello\n1 hi hello\ndog cat\ndog hi\nhi hello\nihateyou goaway\nwelcome ihateyou", "5 4 5\nhello hi welcome ihateyou goaway\n1 hello hi\n1 hi welcome\n2 ihateyou hi\n2 goaway hi\nwelcome hello\nihateyou welcome\nwelcome goaway\ngoaway ihateyou\nwelcome hi", "2 1 1\na b\n1 a b\na b", "5 5 5\nhello hi welcome hallo ahlan\n1 hello hi\n1 hi welcome\n1 welcome hallo\n1 hallo ahlan\n2 ahlan hello\nhello hi\nahlan welcome\nhi welcome\nhi ahlan\nhallo hello", "6 2 6\nhello hi welcome dog cat lion\n1 hello hi\n1 hi welcome\nhi dog\ndog cat\nhello hi\nhi hello\nwelcome cat\nlion cat", "2 1 1\nhi hello\n1 hi hello\nhi hello", "8 4 12\nhello hi welcome goaway hateyou mmmm momo mana\n1 hello hi\n1 hi welcome\n2 goaway welcome\n2 hateyou hi\nhateyou goaway\nhateyou hi\nhateyou hi\nhateyou welcome\nmmmm momo\nwelcome hi\nwelcome hateyou\nhateyou goaway\nhello goaway\nhello goaway\nhello hateyou\ngoaway mmmm", "12 9 16\na b c d e f g h i j k l\n1 a b\n2 a c\n2 a d\n2 b e\n2 b f\n2 e g\n2 f h\n2 g i\n2 h j\ni j\ne i\nc d\ne f\nc f\nd e\nb c\nb c\nb f\nb f\nk a\nk b\nk l\nk l\nj e\nh g", "10 5 10\na b c d e f g h i j\n1 f j\n2 a e\n2 b g\n2 f e\n2 j g\na b\nb c\na b\nb c\nh j\nh j\na f\ne g\nb e\na g", "10 7 10\na b c d e f g h i j\n1 h j\n2 a e\n2 b g\n2 g c\n2 e d\n2 d f\n2 c f\na b\nb c\na b\nb c\nh j\nh j\na f\ne g\nb e\na g"], "outputs": ["YES\nYES\nNO\n1\n2\n2\n2", "YES\nYES\nYES\nYES\nNO\nYES\n3\n3\n1\n1\n2", "YES\nYES\nYES\nYES\n1\n2\n2\n1\n1", "YES\n1", "YES\nYES\nYES\nYES\nNO\n1\n1\n1\n1\n1", "YES\nYES\n3\n3\n1\n1\n3\n3", "YES\n1", "YES\nYES\nYES\nYES\n1\n2\n2\n2\n3\n1\n2\n1\n2\n2\n2\n3", "YES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\nYES\n1\n1\n1\n1\n1\n1\n2\n2\n2\n2\n3\n3\n3\n3\n1\n1", "YES\nYES\nYES\nYES\nYES\n1\n3\n1\n3\n3\n3\n1\n1\n2\n2", "YES\nYES\nYES\nYES\nYES\nYES\nYES\n1\n1\n1\n1\n1\n1\n2\n1\n2\n2"]}

UNKNOWN

PYTHON3

CODEFORCES

4

d3197ae780b3073cca1cf30089f232ea

Pacifist frogs

Thumbelina has had an accident. She has found herself on a little island in the middle of a swamp and wants to get to the shore very much. One can get to the shore only by hills that are situated along a straight line that connects the little island with the shore. Let us assume that the hills are numbered from 1 to *n* and the number of a hill is equal to the distance in meters between it and the island. The distance between the *n*-th hill and the shore is also 1 meter. Thumbelina is too small to make such jumps. Fortunately, a family of frogs living in the swamp suggests to help her. Each frog agrees to give Thumbelina a ride but Thumbelina should choose only one frog. Each frog has a certain jump length. If Thumbelina agrees to accept help from a frog whose jump length is *d*, the frog will jump from the island on the hill *d*, then — on the hill 2*d*, then 3*d* and so on until they get to the shore (i.e. find itself beyond the hill *n*). However, there is one more problem: mosquitoes also live in the swamp. At the moment they have a siesta, and they are having a nap on some hills. If the frog jumps on a hill with a mosquito the frog will smash it. The frogs Thumbelina has met are pacifists, so they will find the death of each mosquito very much sad. Help Thumbelina choose a frog that will bring her to the shore and smash as small number of mosquitoes as possible. The first line contains three integers *n*, *m* and *k* (1<=≤<=*n*<=≤<=109, 1<=≤<=*m*,<=*k*<=≤<=100) — the number of hills, frogs and mosquitoes respectively. The second line contains *m* integers *d**i* (1<=≤<=*d**i*<=≤<=109) — the lengths of the frogs’ jumps. The third line contains *k* integers — the numbers of the hills on which each mosquito is sleeping. No more than one mosquito can sleep on each hill. The numbers in the lines are separated by single spaces. In the first line output the number of frogs that smash the minimal number of mosquitoes, in the second line — their numbers in increasing order separated by spaces. The frogs are numbered from 1 to *m* in the order of the jump length given in the input data. Sample Input 5 3 5 2 3 4 1 2 3 4 5 1000000000 2 3 2 5 999999995 999999998 999999996 Sample Output 2 2 3 1 2

[ "n, m, k = map(int, input().split())\r\nx, y = n, []\r\na = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nfor i, d in enumerate(a):\r\n c = 0\r\n for t in b:\r\n if 0 == t % d:\r\n c += 1\r\n if c < x:\r\n x = c\r\n y = [i + 1]\r\n elif c == x:\r\n y += i + 1,\r\nprint(len(y))\r\nprint(' '.join(map(str, y)))\r\n", "__author__ = 'linh'\n\n\ndef main():\n first_line = input()\n first_line = first_line.split()\n hill_n0 = int(first_line[0])\n frog_n0 = int(first_line[1])\n mosquito_n0 = int(first_line[2])\n\n frog_list = input()\n frog_list = list(map(int, frog_list.split()))\n\n mosquito_list = input()\n mosquito_list = list(map(int, mosquito_list.split()))\n\n result = []\n min_mosquito = 10000000000000\n for i in range(0, frog_n0):\n n0 = 0\n for j in range(0, mosquito_n0):\n if mosquito_list[j] % frog_list[i] == 0:\n n0 +=1\n\n if n0 < min_mosquito:\n min_mosquito = n0\n result.append(n0)\n\n frog_n0_adequate = 0\n output = \"\"\n for i in range(0, frog_n0):\n if result[i] == min_mosquito:\n output += str(i+1) + \" \"\n frog_n0_adequate += 1\n print(frog_n0_adequate)\n print(output)\n\n\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nd = []\r\nfor i in range(m):\r\n c = 0\r\n for j in s:\r\n if j % w[i] == 0:\r\n c += 1\r\n d.append((c, i+1))\r\nd.sort()\r\nx = d[0][0]\r\nans = [d[0][1]]\r\nfor i in d[1:]:\r\n if i[0] == x:\r\n ans.append(i[1])\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "#ROUNIAAUDI\r\na,b,c=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist2=list(map(int,input().split()))\r\nk=[0 for h in range(b)]\r\n#b={}\r\nfor i in list2:\r\n for i1, j in enumerate(list1):\r\n if i % j == 0:\r\n k[i1] += 1\r\n\r\n#print(k)\r\ny=min(k)\r\nh5=[]\r\nc=0\r\nfor i,u in enumerate(k):\r\n if u==y:\r\n c+=1\r\n h5.append(i+1)\r\nprint(c)\r\nprint(\" \".join(map(str,h5)))\r\n", "n,m,k=map(int,input().split())\r\nfrogs=list(map(int,input().split()))\r\nmosquis=list(map(int,input().split()))\r\nkilledmos=[]\r\nmini=1e9\r\nfor fr in frogs:\r\n j=0\r\n for ms in mosquis:\r\n if(ms%fr==0):\r\n j+=1\r\n # print(j)\r\n killedmos.append(j)\r\n mini=min(mini,j)\r\nans=0\r\nfor i in killedmos:\r\n if(i==mini):\r\n ans+=1\r\nprint(ans)\r\nfor i in range(0,m):\r\n if(killedmos[i]==mini):\r\n print(i+1,end=\" \")\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n,m,k = map(int,input().split())\r\njumps = list(map(int,input().split()))\r\nmosquitos = list(map(int,input().split()))\r\n\r\nmn = k+1\r\noutl = []\r\nfor index,i in enumerate(jumps) :\r\n ct = 0\r\n for j in mosquitos :\r\n if j%i == 0 :\r\n ct += 1\r\n if ct < mn :\r\n outl.clear()\r\n outl.append(index+1)\r\n mn = ct\r\n elif ct == mn :\r\n outl.append(index+1)\r\nprint(len(outl))\r\nfor i in outl :\r\n print(i,end=\" \")", "n, m, k = map(int, input().strip().split())\nfrogs = list(map(int, input().strip().split()))\nmosquitos = list(map(int, input().strip().split()))\nkilled = []\n\nfor frog in frogs:\n killed.append(len([x for x in mosquitos if x % frog == 0]))\n\nans = min(killed)\nprint(killed.count(ans))\nanswers = []\nfor i, frog in enumerate(killed):\n if frog == ans:\n answers.append(i + 1)\n\nprint(*answers)\n", "n, m, k = list(map(int, input().split()))\r\n\r\nd = list(map(int, input().split()))\r\n\r\nkom = list(map(int, input().split()))\r\n\r\nc = 0\r\ndead = [0]*m\r\n\r\nfor i in range(m):\r\n for j in range(k):\r\n if kom[j]%d[i] == 0:\r\n dead[c] += 1\r\n c += 1\r\n\r\nmi = min(dead)\r\nprint(dead.count(mi))\r\n\r\nfor i in range(m):\r\n if dead[i] == mi:\r\n print(i+1, end = \" \")\r\n", "n, m, k = map(int, input().split())\r\nd, a = map(int, input().split()), list(map(int, input().split()))\r\nv = sorted((sum(ai % di == 0 for ai in a), i + 1) for i, di in enumerate(d))\r\nv = sorted(vi[1] for vi in v if vi[0] == v[0][0])\r\nprint(len(v), ' '.join(map(str, v)), sep='\\n')", "import sys\r\nn, m, k = [int(x) for x in sys.stdin.readline().split()]\r\nd = [int(x) for x in sys.stdin.readline().split()]\r\nQ = [int(x) for x in sys.stdin.readline().split()]\r\nkills = []\r\n\r\nfor i in range(m):\r\n kills_i = 0\r\n for q in Q:\r\n if q % d[i] == 0:\r\n kills_i += 1\r\n kills.append(kills_i)\r\n\r\nmin_kills = min(kills)\r\nkillers = [str(i+1) for i in range(m) if kills[i]==min_kills]\r\n\r\nprint(len(killers))\r\nprint(\" \".join(killers))\r\n", "n, m, k = map(int, input().split())\r\nD = list(map(int, input().split()))\r\ncom = list(map(int, input().split()))\r\ncom = set(com)\r\nans = []\r\nfor i in range(m):\r\n lol = 0\r\n aa = 0\r\n for j in com:\r\n if j % D[i] == 0:\r\n aa += 1\r\n ans.append((aa, 1+i))\r\nans.sort()\r\np = [ans[0][1]]\r\nfor c in range(1, len(ans)):\r\n if ans[c][0] != ans[c-1][0]:\r\n break\r\n p.append(ans[c][1])\r\nprint(len(p))\r\nprint(*p)\r\n\r\n", "n,m,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n\r\nmi,ans=10**9,[]\r\nfor i in range(m):\r\n x=0\r\n for j in range(k):\r\n if a[j]% d[i]==0: x+=1\r\n if x<mi:\r\n mi=x\r\n ans=[i+1]\r\n elif x==mi:\r\n ans+=[i+1]\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n \r\n \r\n", "n,m,k = map(int,input().split())\r\nfrog = list(map(int,input().split()))\r\nmos = list(map(int,input().split()))\r\nans = []\r\nres = float('inf')\r\nfor i in range(m):\r\n f = frog[i]\r\n count = 0\r\n for ms in mos:\r\n if (ms)%f==0:\r\n count+=1\r\n if res>count:\r\n ans = [i+1]\r\n res = count\r\n elif res==count:\r\n ans.append(i+1)\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n ", "I = lambda: map(int, input().split())\r\n\r\n_, m, _ = I()\r\nD = list(I())\r\nX = [0]*m\r\n\r\nfor k in I():\r\n for i in range(m):\r\n if k % D[i] == 0:\r\n X[i] += 1\r\n\r\nx = min(X)\r\n\r\nprint(X.count(x))\r\nprint(*(i+1 for i in range(m) if X[i]==x))", "n,m,k = map(int,input().split())\r\nd=list(map(int,input().split()))\r\nkom = list(map(int,input().split()))\r\nmin=1000000000000000\r\nc=0\r\nr1=[]\r\nnum=0\r\nfor j in d:\r\n raz=0\r\n for i in kom:\r\n if i % j == 0:\r\n raz +=1\r\n if raz<=min:\r\n min = raz\r\nfor j in d:\r\n raz = 0\r\n num+=1\r\n for i in kom:\r\n if i % j == 0:\r\n raz +=1\r\n if raz==min:\r\n c+=1\r\n r1.append(num)\r\nprint(c)\r\nprint(*r1)", "import sys\r\n\r\nn, m, k = sys.stdin.readline().split()\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\n\r\narr = sys.stdin.readline().split()\r\narr = [ int(x) for x in arr]\r\n\r\n\r\narr2 = sys.stdin.readline().split()\r\narr2 = [ int(y) for y in arr2]\r\n\r\nminimum = 1000\r\nfrogs = []\r\nfor i in range(m):\r\n contador = 0\r\n for j in range(k):\r\n\r\n if arr2[j] % arr[i] == 0:\r\n\r\n contador += 1\r\n if contador < minimum:\r\n frogs = [i +1]\r\n minimum = contador\r\n elif contador == minimum:\r\n frogs.append(i+1)\r\nprint(len(frogs))\r\nprint(' '.join([str(f) for f in frogs]))", "n, m, k = list(map(int, input().split()))\r\nfrogs = list(map(int, input().split()))\r\nmosquitos = list(map(int, input().split()))\r\nbest_frogs = []\r\nmin_kills = len(mosquitos)\r\nfor i, frog in enumerate(frogs):\r\n kills = sum([1 if m % frog == 0 else 0 for m in mosquitos])\r\n if kills < min_kills:\r\n min_kills = kills\r\n best_frogs = []\r\n if kills == min_kills:\r\n best_frogs.append(i + 1)\r\nprint(len(best_frogs))\r\nprint(*best_frogs)\r\n", "n, m, k = [int(j) for j in input().split()]\r\nd = [int(j) for j in input().split()]\r\nhill = [int(j) for j in input().split()]\r\nList = []\r\nfor j in range(m):\r\n count = 0\r\n for l in range(k):\r\n if hill[l] % d[j] == 0:\r\n count += 1\r\n List.append(count)\r\nval = min(List)\r\noutput = []\r\nfor j in range(m):\r\n if List[j] == val:\r\n output.append(j + 1)\r\nprint(len(output))\r\nfor j in range(len(output)):\r\n print(output[j], end = ' ')\r\n", "a,b,c=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nans=[]\r\nfor i,j in enumerate(z):\r\n ok=0\r\n for u in k:ok+=(u%j==0)\r\n ans.append([ok,i+1])\r\nans=sorted(ans)\r\nj=[]\r\nfor i in ans:\r\n if ans[0][0]==i[0]:j.append(i[1])\r\nprint(len(j))\r\nprint(*j)", "n, m, k = map(int, input().split())\r\nfrog = [int(i) for i in input().split()]\r\nkom = [int(i) for i in input().split()]\r\ndie = [0] * m\r\nww = 0\r\nfor i in range(m):\r\n for j in range(k):\r\n if kom[j] % frog[i] == 0:\r\n die[ww] += 1\r\n ww += 1\r\nmi = min(die)\r\nprint(die.count(mi))\r\nfor i in range(m):\r\n if die[i] == mi:\r\n print(i + 1, end = ' ')", "import sys\r\ninput=sys.stdin.readline\r\nfrom math import *\r\nn,m,k=map(int,input().split())\r\ns=0\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nd={}\r\ns=[0 for i in range(m)]\r\nfor i in b:\r\n d[i]=1\r\nfor i in range(m):\r\n for j in range(k):\r\n if b[j]%a[i]==0:\r\n s[i]+=1\r\n \r\nprint(s.count(min(s)))\r\nfor i in range(m):\r\n if s[i]==min(s):\r\n print(i+1,end=\" \")\r\n ", "n,m,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nK=list(map(int,input().split()))\r\n\r\nANS=[-1]*m\r\n\r\nfor i in range(m):\r\n a=A[i]\r\n score=0\r\n for k in K:\r\n if k%a==0:\r\n score+=1\r\n ANS[i]=score\r\n\r\nMIN=min(ANS)\r\n\r\nALIST=[]\r\nfor i in range(m):\r\n if ANS[i]==MIN:\r\n ALIST.append(i+1)\r\n\r\nprint(len(ALIST))\r\nprint(*ALIST)\r\n", "n, m, k = tuple(map(int, input().split()))\nfrogs = list(map(int, input().split()))\nmosquitoes = list(map(int, input().split()))\n# calculate the amount of mosquitoes\n# that are smashed for each frog\nnum_smash = []\nfor frog in frogs:\n\tnum_smash.append(len([x for x in mosquitoes if x % frog == 0]))\nmin_smash = min(num_smash)\noutput = []\nfor i in range(len(num_smash)):\n\tif(num_smash[i] == min_smash):\n\t\toutput.append(i+1)\nprint(len(output))\nprint(\" \".join([str(x) for x in output]))", "n,m,k = map(int,input().split())\r\nd = list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\nans = []\r\ncheck = 10**18\r\nfor i in range(len(d)):\r\n frog=d[i]\r\n c=0\r\n for j in range(len(m)):\r\n if m[j]%frog==0:\r\n c+=1\r\n if c<check:\r\n ans.clear()\r\n ans.append(i+1)\r\n check=c\r\n elif c==check:\r\n ans.append(i+1)\r\n c=check\r\nprint(len(ans))\r\nprint(*ans)", "import sys\r\nimport math\r\n#input=lambda:sys.stdin.readline().rstrip()\r\n#def solve():\r\n#\tn,x=map(int,input().split())\r\n#\tA=list(map(int,input().split()))\r\n#\tB=sorted(A)\r\n\t#print(\"YES\" if A[n-x:x]==B[n-x:x] else \"NO\")\r\n#T=int(input())\r\n#for i in range(T):\r\n#\tsolve()\r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\ncontor=1\r\nmy_dict={}\r\n\r\nfor j in range(1,27):\r\n for i in range(1,27):\r\n if i!=j:\r\n element=alfabet_2[str(j)]+alfabet_2[str(i)]\r\n my_dict[element]=contor\r\n contor+=1\r\n \r\n#z=int(input())\r\nfor i in range(1):\r\n #n=int(input())\r\n #stringul=input()\r\n n,m,d=list(map(int,input().split()))\r\n \r\n jump=list(map(int,input().split()))\r\n mosq=list(map(int,input().split()))\r\n my_set=set()\r\n \r\n minimul=n\r\n for i in range(0,m):\r\n partial=0\r\n for j in range(0,d):\r\n if mosq[j]%jump[i]==0:\r\n partial+=1\r\n minimul=min(minimul,partial)\r\n \r\n cate=0\r\n for i in range(0,m):\r\n partial=0\r\n for j in range(0,d):\r\n if mosq[j]%jump[i]==0:\r\n partial+=1\r\n if partial==minimul:\r\n cate+=1\r\n my_set.add(i+1)\r\n \r\n print(cate)\r\n for s in my_set:\r\n print(s,end=' ')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "temp = input().split(' ')\nn = int(temp[0])\nm = int(temp[1])\nk = int(temp[2])\n\nd = []\nmsq = []\nnj = [0 for i in range(m)]\nnm = [0 for i in range(m)]\n\ntemp = input().split(' ')\nfor i in range(m):\n d.append(int(temp[i]))\ntemp = input().split(' ')\nfor i in range(k):\n msq.insert(0, int(temp[i]))\nfor i in range(len(d)):\n nn = n\n nj[i] = n//d[i]\n nm[i] = len([j for j in msq if (j/d[i]).is_integer()])\n\nminval = min(nm)\nmins = [i for i, j in enumerate(nm) if j == minval]\n\nprint(len(mins))\nfor i in range(len(mins)):\n print(mins[i]+1, end=' ')\nprint()\n\n", "n, m, k = map(int, input().split())\nA = list(map(int, input().split()))\nK = list(map(int, input().split()))\n\nANS = [-1] * m\n\nfor i in range(m):\n a = A[i]\n score = 0\n for k in K:\n if k % a == 0:\n score += 1\n ANS[i] = score\n\nMIN = min(ANS)\n\nALIST = []\nfor i in range(m):\n if ANS[i] == MIN:\n ALIST.append(i + 1)\n\nprint(len(ALIST))\nprint(*ALIST)\n\n", "n, m, k = map(int, input().split())\r\n\r\njumps = list(map(int, input().split()))\r\nmos = list(map(int, input().split()))\r\n\r\nhash = {}\r\n\r\nfor x, frog in enumerate(jumps, start=1):\r\n count = 0\r\n for kill in mos:\r\n count += int(kill % frog == 0) \r\n hash[count] = hash.get(count, [])\r\n hash[count].append(x)\r\n\r\nans = min(hash)\r\nprint(len(hash[ans]))\r\nprint(*hash[ans])", "n,m,k=input().split()\r\nfrog=list(map(int,input().split()))\r\nhill=list(map(int,input().split()))\r\nfrq=[0 for _ in range (0,int(m))]\r\nfor i1 in range (0,int(k)):\r\n for j1 in range (0,int(m)):\r\n if hill[i1]%frog[j1]==0:\r\n frq[j1]+=1\r\nl2=sorted(frq)\r\nans=[]\r\nfor i1 in range (0,int(m)):\r\n if frq[i1]==l2[0]:\r\n ans.append(str(i1+1))\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n \r\n \r\n", "n, m, k = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nmn = k\r\nans = []\r\nfor i in range(m) :\r\n res = 0\r\n for x in h :\r\n if x % d[i] == 0 :\r\n res += 1\r\n if res < mn :\r\n mn = res\r\n ans = [i+1]\r\n elif res == mn :\r\n ans.append(i+1)\r\n \r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))\r\n ", "n, m, k = map(int, input().split())\nfrogs = list(map(int, input().split()))\nmosquitoes = list(map(int, input().split()))\n\ndef get_smash(leap):\n result = 0\n for x in mosquitoes:\n if x % leap == 0:\n result += 1\n return result\n\nbest_smash = get_smash(frogs[0])\nbest_frogs = [1]\n\nfor i, frog in enumerate(frogs[1:]):\n smash = get_smash(frog)\n if smash == best_smash:\n best_frogs.append(i + 2)\n elif smash < best_smash:\n best_smash = smash\n best_frogs = [i + 2]\n\nprint(len(best_frogs))\nprint(' '.join(map(str, best_frogs)))\n", "\"\"\"\r\n// Author : snape_here - Susanta Mukherjee\r\n \r\n\"\"\"\r\n \r\nfrom __future__ import division, print_function\r\n \r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n \r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n \r\n \r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n \r\n \r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n \r\n \r\ndef read():\r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w') \r\n \r\n \r\nimport math\r\n\r\nfrom functools import reduce\r\n\r\ndef factorS(n): \r\n return set(reduce(list.__add__, \r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n \r\ndef divisorGen(n):\r\n factors = list(factorGenerator(n))\r\n nfactors = len(factors)\r\n f = [0] * nfactors\r\n while True:\r\n yield reduce(lambda x, y: x*y, [factors[x][0]**f[x] for x in range(nfactors)], 1)\r\n i = 0\r\n while True:\r\n f[i] += 1\r\n if f[i] <= factors[i][1]:\r\n break\r\n f[i] = 0\r\n i += 1\r\n if i >= nfactors:\r\n return \r\n\r\nmod=100000007\r\n\r\ndef main():\r\n\r\n n,m,k=mi()\r\n d=li()\r\n l=li()\r\n a=[]\r\n for i in range(m):\r\n c=0\r\n for j in range(k):\r\n if l[j]%d[i]==0:\r\n c+=1 \r\n a.append(c)\r\n\r\n b=min(a)\r\n e=a.count(b)\r\n f=[]\r\n for i in range(m):\r\n if a[i]==b:\r\n f.append(i+1)\r\n print(e)\r\n print(*f)\r\n\r\n\r\n# region fastio#\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n \r\n \r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n# endregion\r\n \r\n \r\nif __name__ == \"__main__\":\r\n #read()\r\n main() \r\n#Comment read()\r\n", "a = list(map(int, input().split()))\r\n\r\nb = list(map(int, input().split()))\r\n\r\nc = list(map(int, input().split()))\r\nt = []\r\nid = 1\r\nfor i in b:\r\n co = 0\r\n for j in c:\r\n if j % i == 0:\r\n co += 1\r\n t.append([co, id])\r\n id += 1\r\n\r\nt = sorted(t)\r\ne = []\r\nfor i in t:\r\n if i[0] == t[0][0]:\r\n e.append(i[1])\r\nprint(len(e))\r\nfor i in e:\r\n print(i, end=\" \")\r\n", "from collections import defaultdict\r\nimport math\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=[]\r\nansval=math.inf\r\nfor i in range(m):\r\n temp=0\r\n for j in b:\r\n if(j%a[i]==0):\r\n temp+=1\r\n if(temp<ansval):\r\n ansval=temp\r\n ans=[i+1]\r\n elif(temp==ansval):\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(*ans)", "def chk(x):\r\n for i in range(m):\r\n if x%fgs[i]==0:\r\n ans[i]+=1\r\n \r\nn,m,k=[int(x) for x in input().split()]\r\nfgs=[int(x) for x in input().split()]\r\nct=0\r\nans=[0]*m\r\n\r\nfor i in input().split():\r\n chk(int(i))\r\n\r\nmi=min(ans)\r\nprint(ans.count(mi))\r\nfor i in range(m):\r\n if ans[i]==mi:\r\n print(i+1,end=' ')\r\n", "def read_numbers():\r\n return [int(x) for x in input().split()]\r\n\r\ndef main():\r\n n, m, k = read_numbers()\r\n d = read_numbers()\r\n h = read_numbers()\r\n res = []\r\n min_count = 10 ** 9\r\n\r\n for frog in enumerate(d, start=1):\r\n curr_count = 0\r\n for hill in h:\r\n if hill % frog[1] == 0:\r\n curr_count += 1\r\n if curr_count < min_count:\r\n min_count = curr_count\r\n res = [frog[0]]\r\n elif curr_count == min_count:\r\n res.append(frog[0])\r\n \r\n print(len(res))\r\n print(' '.join([str(x) for x in res]))\r\n\r\nif __name__ == '__main__':\r\n main()", "hills, f, m = map(int, input().split())\r\n\r\nfrogs = list(map(int, input().split()))\r\nkills = [0] * f\r\nmosquitoes = list(map(int, input().split()))\r\n\r\n\r\n\r\nfor mosquito in mosquitoes:\r\n for ind, frog in enumerate(frogs):\r\n if mosquito % frog == 0:\r\n kills[ind] += 1\r\n\r\nans = []\r\nminKill = min(kills)\r\nfor ind, frog in enumerate(frogs):\r\n if kills[ind] == minKill:\r\n ans.append(ind+1)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans))) ", "n, m, k = map(int, input().split())\r\nD = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nc = set(c)\r\nmas = []\r\nfor i in range(m):\r\n l = 0\r\n a = 0\r\n for j in c:\r\n if j % D[i] == 0:\r\n a += 1\r\n mas.append((a, 1+i))\r\nmas.sort()\r\np = [mas[0][1]]\r\nfor q in range(1, len(mas)):\r\n if mas[q][0] != mas[q-1][0]:\r\n break\r\n p.append(mas[q][1])\r\nprint(len(p))\r\nprint(*p)", "n,m,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nans=[]\r\nmini=10**18\r\nfor i in range(0,len(d)):\r\n frog=d[i]\r\n count=0\r\n for j in range(0,len(m)):\r\n if m[j]%frog==0:\r\n count+=1\r\n if count<mini:\r\n ans.clear()\r\n ans.append(i+1)\r\n mini=count\r\n elif count==mini:\r\n ans.append(i+1)\r\n count=mini\r\nprint(len(ans))\r\nprint(*ans)" ]

{"inputs": ["5 3 5\n2 3 4\n1 2 3 4 5", "1000000000 2 3\n2 5\n999999995 999999998 999999996", "1 1 1\n1\n1", "2 2 1\n2 1\n1", "3 2 2\n2 4\n3 2", "10 3 6\n5 2 8\n5 6 7 8 9 10", "10 10 9\n10 9 8 7 6 5 4 3 2 1\n10 9 8 7 5 4 3 2 1", "20 3 5\n2 3 5\n2 5 6 10 15", "20 4 8\n1 2 3 4\n2 4 6 8 10 12 14 16", "10 5 5\n1 5 3 5 1\n1 6 5 7 2", "20 10 5\n1 12 6 11 9 21 15 16 8 9\n11 13 15 2 1", "20 10 10\n9 8 21 8 7 2 13 17 20 18\n7 16 20 3 6 1 11 18 15 17", "20 10 10\n6 17 14 12 13 15 6 14 16 17\n1 6 16 14 7 8 9 12 10 2", "100 30 30\n25 34 81 32 96 79 36 21 53 15 51 69 78 99 60 2 80 37 61 70 32 31 31 6 7 38 95 70 81 39\n1 50 75 8 90 69 13 57 6 4 60 19 94 52 45 42 95 88 21 22 96 2 56 61 31 78 7 62 68 72", "200 35 67\n152 112 102 46 54 189 56 76 10 39 157 6 84 188 122 117 51 163 6 50 195 34 44 178 28 32 100 67 74 48 88 100 91 50 91\n126 68 138 157 92 128 183 36 175 49 168 198 116 20 31 88 61 46 12 179 137 130 185 5 171 96 184 85 37 147 50 75 93 103 160 10 120 140 59 98 131 124 121 190 169 141 165 39 47 28 90 139 148 119 73 6 51 94 21 52 89 35 97 79 3 13 142", "200 72 29\n201 145 169 163 32 126 131 71 26 130 2 61 110 17 179 114 79 30 192 91 141 70 101 119 185 66 72 76 164 144 106 162 122 146 119 181 184 61 131 131 140 152 60 65 183 154 32 33 108 77 29 102 67 5 125 26 126 104 20 89 183 21 126 195 198 24 123 173 135 164 141 32\n160 65 136 22 194 110 155 138 92 118 87 40 49 191 190 99 157 3 23 17 34 123 31 81 67 86 196 45 109", "500 46 46\n363 441 170 289 389 394 488 72 332 285 445 185 221 183 397 175 98 192 202 16 123 436 336 260 212 229 459 473 66 19 445 153 476 234 396 159 289 137 331 18 268 224 71 133 196 7\n454 64 417 129 95 162 496 300 234 359 224 354 334 155 191 82 35 319 244 126 292 108 321 93 77 311 107 487 121 431 235 100 445 68 338 467 133 307 4 220 245 84 468 141 436 363", "1000 19 27\n656 162 264 790 579 786 877 998 516 247 650 150 858 281 279 549 354 353 533\n349 411 1 248 22 649 726 382 423 832 172 864 17 658 840 572 564 287 800 919 500 575 461 40 1000 383 624"], "outputs": ["2\n2 3", "1\n2", "1\n1", "1\n1", "1\n2", "1\n3", "1\n5", "1\n2", "1\n3", "3\n2 3 4", "7\n2 3 5 6 8 9 10", "2\n3 7", "4\n2 5 6 10", "11\n3 6 9 11 14 17 18 20 26 28 29", "17\n1 2 3 5 6 8 14 15 16 18 21 24 27 28 32 33 35", "59\n1 2 3 4 6 7 8 9 10 12 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 45 46 49 50 52 55 56 57 58 60 61 62 63 64 65 66 68 69 70 71", "35\n2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 21 23 24 25 26 27 28 29 32 33 35 36 37 38 39 41 43 45", "19\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19"]}

UNKNOWN

PYTHON3

CODEFORCES

39

d33ed0a7470768868bc662f77d990f03

Three matrices

Chubby Yang is studying linear equations right now. He came up with a nice problem. In the problem you are given an *n*<=×<=*n* matrix *W*, consisting of integers, and you should find two *n*<=×<=*n* matrices *A* and *B*, all the following conditions must hold: - *A**ij*<==<=*A**ji*, for all *i*,<=*j* (1<=≤<=*i*,<=*j*<=≤<=*n*); - *B**ij*<==<=<=-<=*B**ji*, for all *i*,<=*j* (1<=≤<=*i*,<=*j*<=≤<=*n*); - *W**ij*<==<=*A**ij*<=+<=*B**ij*, for all *i*,<=*j* (1<=≤<=*i*,<=*j*<=≤<=*n*). Can you solve the problem? The first line contains an integer *n* (1<=≤<=*n*<=≤<=170). Each of the following *n* lines contains *n* integers. The *j*-th integer in the *i*-th line is *W**ij* (0<=≤<=|*W**ij*|<=<<=1717). The first *n* lines must contain matrix *A*. The next *n* lines must contain matrix *B*. Print the matrices in the format equal to format of matrix *W* in input. It is guaranteed that the answer exists. If there are multiple answers, you are allowed to print any of them. The answer will be considered correct if the absolute or relative error doesn't exceed 10<=-<=4. Sample Input 2 1 4 3 2 3 1 2 3 4 5 6 7 8 9 Sample Output 1.00000000 3.50000000 3.50000000 2.00000000 0.00000000 0.50000000 -0.50000000 0.00000000 1.00000000 3.00000000 5.00000000 3.00000000 5.00000000 7.00000000 5.00000000 7.00000000 9.00000000 0.00000000 -1.00000000 -2.00000000 1.00000000 0.00000000 -1.00000000 2.00000000 1.00000000 0.00000000

[ "n = int(input())\r\nW = []\r\nfor i in range(0, n):\r\n s = input().split(' ')\r\n w = list(map(int, s))\r\n W.append(w)\r\na = []\r\nb = []\r\nA = []\r\nB = []\r\ni = 0\r\n#while (i < n - 1):\r\n# for j in range(i+1, n):\r\n# a.append((W[i][j]+W[j][i])/2)\r\n# b.append((W[i][j]-W[j][i])/2)\r\n# i += 1\r\nwhile (i < n):\r\n for j in range(0, n):\r\n if i == j:\r\n a.append(W[i][j])\r\n b.append(0)\r\n elif i < j:\r\n a.append((W[i][j]+W[j][i])/2)\r\n b.append((W[i][j]-W[j][i])/2)\r\n else:\r\n a.append((W[j][i] + W[i][j]) / 2)\r\n b.append((W[i][j] - W[j][i]) / 2)\r\n i += 1\r\n#for i in range(0 , n):\r\n# A.append([W[i][i]])\r\n# B.append([0])\r\ns = []\r\nfor i in range(0, len(a)):\r\n if (i + 1) % n == 0:\r\n s.append(a[i])\r\n print(*s, sep=' ')\r\n s = []\r\n else:\r\n s.append(a[i])\r\ns = []\r\nfor i in range(0, len(b)):\r\n if (i + 1) % n == 0:\r\n s.append(b[i])\r\n print(*s, sep=' ')\r\n s = []\r\n else:\r\n s.append(b[i])\r\n", "n=int(input())\r\nlis=[]\r\nfor x in range(n):\r\n lis.append(list(map(int,input().split())))\r\n\r\nA=[]\r\nB=[]\r\nfor x in range(n):\r\n A.append([ (lis[x][i]+lis[i][x])/2 for i in range(n) ])\r\n B.append([lis[x][i]-A[x][i] for i in range(n)])\r\n\r\nfor x in A:\r\n for y in x:\r\n print(y,end=' ')\r\n print()\r\nfor x in B:\r\n for y in x:\r\n print(y,end=' ')\r\n print()", "n=int(input())\r\nw=[]\r\nfor i in range(n):\r\n w.append([int(i) for i in input().split()])\r\na=[[0 for i in range(n)]for j in range(n)]\r\nb=[[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n a[i][i]=w[i][i]\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n x=(w[i][j]+w[j][i])/2\r\n y=(w[i][j]-w[j][i])/2\r\n a[i][j]=x\r\n a[j][i]=x\r\n b[i][j]=y\r\n b[j][i]=-y\r\nfor i in a:\r\n for j in i:\r\n print(j,'',end='')\r\n print()\r\nfor i in b:\r\n for j in i:\r\n print(j,'',end='')\r\n print()", "def code():\r\n\tmat=[]\r\n\tn=int(input())\r\n\tfor i in range(n):\r\n\t\tt=input().split()\r\n\t\tmat.append(list(map(int,t)))\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tprint('%.8f'%((mat[i][j] + mat[j][i])/2),end=' ')\r\n\t\tprint()\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tprint('%.8f'%((mat[i][j] - mat[j][i])/2),end=' ')\r\n\t\tprint()\r\ncode()", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(float,input().split())))\r\na,b=[],[]\r\nfor i in range(n):\r\n d=[]\r\n for j in range(n):\r\n d.append(0.0)\r\n a.append(d)\r\nfor i in range(n):\r\n for j in range(n):\r\n x=l[i][j]+l[j][i]\r\n a[i][j]=x/2\r\n a[j][i]=x/2\r\nfor i in range(n):\r\n print(*a[i])\r\nfor i in range(n):\r\n d=[]\r\n for j in range(n):\r\n d.append(0.0)\r\n b.append(d)\r\nfor i in range(n):\r\n for j in range(n):\r\n b[i][j]=l[i][j]-a[i][j]\r\n b[j][i]=l[j][i]-a[j][i]\r\nfor i in range(n):\r\n print(*b[i])\r\n", "n=int(input())\r\nans=[list(map(int,input().split(\" \"))) for x in range(n)]\r\na=[[0 for x in range(n)] for x in range(n)]\r\nb=[[0 for x in range(n)] for x in range(n)]\r\nfor x in range(n):\r\n for y in range(n):\r\n if x==y:\r\n a[x][y]=ans[x][y]\r\n else:\r\n a[x][y]=(ans[x][y]+ans[y][x])/2\r\n b[x][y]=(ans[x][y]-ans[y][x])/2\r\nfor x in a:\r\n print(*x)\r\nfor y in b:\r\n print(*y)\r\n\r\n", "n = int(input())\r\n\r\nW = []\r\nfor j in range(n):\r\n\r\n k = input().split()\r\n\r\n for i in range(n):\r\n k[i] = int(k[i])\r\n\r\n W.append(k)\r\n\r\n\r\nA = []\r\n\r\nfor j in range(n):\r\n A.append([])\r\n for i in range(n):\r\n a = (W[j][i]+W[i][j])/2\r\n A[j].append(a)\r\n\r\n\r\nB = []\r\nfor j in range(n):\r\n B.append([])\r\n for i in range(n):\r\n b = (W[j][i]-W[i][j])/2\r\n B[j].append(b)\r\n\r\nfor i in A:\r\n print(*i)\r\n\r\nfor i in B:\r\n print(*i)\r\n", "n=int(input())\r\nw=[list(map(int,input().split()))for i in range(n)]\r\na=[[0for i in range(n)]for i in range(n)]\r\nb=[[0for i in range(n)]for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j]=(w[i][j]+w[j][i])/2\r\n b[i][j]=(w[i][j]-w[j][i])/2\r\nfor i in a:\r\n print(*i)\r\nfor i in b:\r\n print(*i)", "N = int(input())\r\nW = [0 for i in range(N)]\r\nfor i in range(N):\r\n\tW[i] = list(map(int, input().split()))\r\nA = [[0 for i in range(N)] for i in range(N)]\r\nB = [[0 for i in range(N)] for i in range(N)]\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tA[i][j] = (W[i][j] + W[j][i]) / 2\r\n\t\tB[i][j] = W[i][j] - A[i][j]\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tprint(A[i][j], end = ' ')\r\n\tprint()\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tprint(B[i][j], end = ' ')\r\n\tprint()", "l=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\na=[[0 for i in range(n)] for j in range(n)]\r\nb=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = (l[i][j]+l[j][i])/2\r\nfor i in range(n):\r\n for j in range(n):\r\n print(a[i][j],end=\" \")\r\n b[i][j]=l[i][j]-a[i][j]\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(b[i][j],end=\" \")\r\n \r\n print()\r\n\r\n\r\n", "n = int(input())\r\nmat = []\r\nmat1 = []\r\nmat2 = []\r\nfor _ in range(n):\r\n t = list(map(int, input().split()))\r\n mat.append(t)\r\nfor i in range(n):\r\n m = []\r\n m1 = []\r\n for j in range(n):\r\n if(i==j):\r\n m.append(\"{0:.8f}\".format(mat[i][j]))\r\n m1.append(\"{0:.8f}\".format(0))\r\n elif(i<j):\r\n a = (mat[i][j] + mat[j][i])/2\r\n m.append(\"{0:.8f}\".format(a))\r\n m1.append(\"{0:.8f}\".format(mat[i][j] - a))\r\n else:\r\n m.append(mat1[j][i])\r\n if(mat2[j][i][0] != \"-\"):\r\n m1.append(\"-\"+(mat2[j][i]))\r\n else:\r\n m1.append(mat2[j][i][1:])\r\n mat1.append(m)\r\n mat2.append(m1)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat1[i][j],end=\" \")\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat2[i][j],end=\" \")\r\n print()", "n = int(input())\r\nlst = [[int(x) for x in input().split()] for i in range(n)]\r\nt = [[0] * n for y in range(n)]\r\nfor i in range(n):\r\n t[i][i], lst[i][i] = lst[i][i], 0\r\n for j in range(i + 1, n):\r\n t[j][i] = t[i][j] = d = (lst[i][j] + lst[j][i]) / 2\r\n lst[i][j] -= d\r\n lst[j][i] -= d\r\nfor i in t:\r\n print(' '.join(map(str, i)))\r\nfor i in lst:\r\n print(' '.join(map(str, i)))\r\n\r\n", "import sys\r\nfrom os import path\r\nfrom collections import Counter\r\nif(path.exists(\"inp.txt\")):\r\n\tsys.stdin = open(\"inp.txt\",'r')\r\n\tsys.stdout = open(\"out.txt\",'w')\r\nimport math\r\nn=int(input())\r\nw=[]\r\nli=[0]*((2*n)-1)\r\nfor i in range(n):\r\n\ttemp=list(map(int,input().split()))\r\n\tw.append(temp)\r\na=[[0 for i in range(n)] for j in range(n)]\r\nb=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\ta[i][j]=(w[i][j]+w[j][i])/2\r\n\t\tb[i][j]=(w[i][j]-w[j][i])/2\r\nfor i in a:\r\n\tprint(*i)\r\nfor i in b:\r\n\tprint(*i)", "n=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\n\r\nb=[[0 for j in range(n)] for i in range(n)]\r\nc=[[0 for j in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if(i==j):\r\n b[i][j]=a[i][j]/1\r\n else:\r\n x=(a[i][j]+a[j][i])/2\r\n b[i][j]=x\r\n b[j][i]=x\r\n c[i][j]=a[i][j]-x\r\n c[j][i]=a[j][i]-x\r\nfor i in b:\r\n for j in i:\r\n print(\"{0:.8f}\".format(j),end=\" \")\r\n print() \r\n \r\nfor i in c:\r\n for j in i:\r\n print(\"{0:.8f}\".format(j),end=\" \")\r\n print() ", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n mat.append(l)\r\nx=[[False]*n for i in range(n)]\r\ny=[[False]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]==False:\r\n k=mat[i][j]+mat[j][i]\r\n x[i][j]=k/2\r\n x[j][i]=k/2\r\nfor i in range(n):\r\n for j in range(n):\r\n if y[i][j]==False:\r\n if mat[i][j]>x[i][j]:\r\n y[i][j]=-(x[i][j]-mat[i][j])\r\n y[j][i]=x[i][j]-mat[i][j]\r\n elif mat[i][j]==x[i][j]:\r\n y[i][j]=mat[i][j]-x[i][j]\r\n y[j][i]=mat[i][j]-x[i][j]\r\n else:\r\n y[i][j]=mat[i][j]-x[i][j]\r\n y[j][i]=-(mat[i][j]-x[i][j])\r\nfor i in range(n):\r\n for j in range(n):\r\n print('%.8f'%x[i][j],end=\" \")\r\n print(\"\")\r\nfor i in range(n):\r\n for j in range(n):\r\n print('%.8f'%y[i][j],end=\" \")\r\n print(\"\")\r\n", "def transpose(m, d):\r\n new = []\r\n for i in range(d):\r\n new.append([m[j][i] for j in range(d)])\r\n return new\r\n\r\ndef sum(a,b, dim):\r\n new = []\r\n for i in range(dim):\r\n new.append([(a[i][j]+b[i][j])/2 for j in range(dim)])\r\n return new\r\n \r\ndef diff(a,b, dim):\r\n new = []\r\n for i in range(dim):\r\n new.append([(a[i][j]-b[i][j])/2 for j in range(dim)])\r\n return new\r\n \r\ndef print_matrix(a,dim):\r\n for i in range(dim):\r\n row = ''\r\n for j in range(dim):\r\n row+= str(a[i][j])\r\n row+=' '\r\n print(row)\r\n\r\ndim = int(input())\r\nw = []\r\nfor _ in range(dim):\r\n w.append([int(i) for i in input().split()])\r\nwt = transpose(w, dim)\r\nprint_matrix(sum(w, wt, dim), dim)\r\nprint_matrix(diff(w,wt,dim), dim)\r\n", "# import numpy as np\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr1 = [int(x) for x in input().split()]\r\n arr.append(arr1)\r\ndasharr = [[None for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n dasharr[i][j] = arr[j][i]\r\na = [[None for i in range(n)] for i in range(n)]\r\nb = [[None for i in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = arr[i][j]/2 + dasharr[i][j]/2\r\n b[i][j] = arr[i][j]/2 - dasharr[i][j]/2\r\n# print(dasharr) \r\nfor sub in a :\r\n print(*sub)\r\nfor sub in b:\r\n print(*sub)\r\n\r\n\r\n", "R = lambda: list(map(int, input().split()))\r\nn = int(input())\r\nw = [R() for _ in ' '*n]\r\nwd = [[0]*n for _ in ' '*n]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n wd[i][j] = w[j][i]\r\n \r\na = [[0]*n for _ in ' '*n]\r\nb = [[0]*n for _ in ' '*n]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n a[i][j] = (w[i][j] + wd[i][j])/2\r\n b[i][j] = (w[i][j] - wd[i][j])/2\r\n\r\nfor i in a: print(*i)\r\nfor i in b: print(*i)", "\r\n\r\nn = int(input())\r\n\r\nw = []\r\nfor i in range(n):\r\n wi = [int(x) for x in input().split()]\r\n w.append(wi)\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n r1 = []\r\n r2 = []\r\n for j in range(n):\r\n if i<j:\r\n a1 = (w[i][j]+w[j][i])/2\r\n b1 = (w[i][j]-w[j][i])/2\r\n elif i>j:\r\n a1 = (w[i][j]+w[j][i])/2\r\n b1 = (w[i][j]-w[j][i])/2\r\n else:\r\n a1 = w[i][j]\r\n b1 = 0\r\n r1.append(a1)\r\n r2.append(b1)\r\n a.append(r1)\r\n b.append(r2)\r\n\r\nfor i in range(n):\r\n print(*a[i])\r\n\r\nfor i in range(n):\r\n print(*b[i])\r\n", "n=int(input())\r\na=[[] for i in range(n)]\r\narr1=[[None for i in range(n)] for i in range(n)]\r\narr2=[[None for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n for item in x:\r\n a[i].append(item)\r\nfor i in range(n):\r\n for j in range(n):\r\n arr1[i][j]=(float(a[i][j]+a[j][i]))/2\r\n arr2[i][j]=(float(a[i][j]-a[j][i]))/2\r\nfor i in range(n):\r\n print(*arr1[i])\r\nfor i in range(n):\r\n print(*arr2[i])\r\n ", "def Add(string):\r\n\tl = string.split(\".\")\r\n\ts = l[1]\r\n\tif len(s)<8:\r\n\t\ts1 = \"0\"\r\n\t\ts1 = s1 * (8-len(s))\r\n\t\ts += s1\r\n\telif len(s)>=8:\r\n\t\ts = s[:8]\r\n\tstring = l[0] + \".\" +s\r\n\treturn string\r\n\t\t\r\nn = int(input())\r\nli = []\r\nfor i in range(n):\r\n\tstring = input()\r\n\tl = string.split()\r\n\tfor j in range(len(l)):\r\n\t\tl[j] = int(l[j])\r\n\tli.append(l)\r\n\r\nA = []\r\nfor i in range(n):\r\n\tl = [0]\r\n\tl = l*n\r\n\tA.append(l)\r\nB = []\r\nfor i in range(n):\r\n\tl = [0]\r\n\tl = l*n\r\n\tB.append(l)\r\nfor i in range(n):\r\n\tA[i][i] = float(li[i][i])\r\n\r\nfor i in range(n):\r\n\tfor j in range(0,i+1):\r\n\t\tif i!=j:\r\n\t\t\tk = li[j][i] - li[i][j]\r\n\t\t\tk = k/2\r\n\t\t\tA[j][i] = float(li[j][i]) - k\r\n\t\t\tA[i][j] = float(li[i][j]) + k\r\n\t\t\tB[j][i] = float(B[j][i]) + k\r\n\t\t\tB[i][j] = float(B[i][j]) - k\r\n\t\t\t\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tA[i][j] = Add(str(float(A[i][j])))\r\n\t\tB[i][j] = Add(str(float(B[i][j])))\r\n\r\nfor i in range(n):\r\n\tstring = \"\"\r\n\tfor j in range(n):\r\n\t\tstring += A[i][j]+\" \"\r\n\tprint(string)\r\nfor i in range(n):\r\n\tstring = \"\"\r\n\tfor j in range(n):\r\n\t\tstring += B[i][j]+\" \"\r\n\tprint(string)\r\n\t\t", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\nn = int(input())\nmatrix = [] \nfor i in range(n):\n listA = input().split()\n for i in range(0,len(listA)):\n listA[i] = int(listA[i])\n matrix.append(listA)\nmatAt = [[0 for x in range(n)] for y in range(n)]\nmatBt = [[0 for x in range(n)] for y in range(n)]\nfor i in range(n):\n for j in range(n):\n matAt[i][j] = matrix[j][i]\n matAt[i][j] = float(matAt[i][j] + matrix[i][j])/2\nfor i in range(n):\n for j in range(n):\n matBt[i][j] = 0 - matrix[j][i]\n matBt[i][j] = float(matBt[i][j] + matrix[i][j])/2\n\nfor i in range(n):\n print(*matAt[i])\nfor i in range(n):\n print(*matBt[i])\n\n", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n temp=list(map(int,input().split()))\r\n mat.append(temp)\r\na,b=[],[]\r\nfor i in range(n):\r\n x=[]\r\n for j in range(n):\r\n if i==j:\r\n v=\"{0:.8f}\".format(mat[i][j])\r\n x.append(v)\r\n else:\r\n v=\"{0:.8f}\".format((mat[i][j]+mat[j][i])/2)\r\n x.append(v)\r\n a.append(x)\r\n\r\nfor i in range(n):\r\n x=[]\r\n for j in range(n):\r\n if i==j:\r\n v=\"{0:.8f}\".format(0)\r\n x.append(v)\r\n else:\r\n v=\"{0:.8f}\".format(mat[i][j]-float(a[i][j]))\r\n x.append(v)\r\n b.append(x)\r\nfor i in a:\r\n print(*i)\r\nfor i in b:\r\n print(*i)\r\n\r\n ", "n=int(input())\r\nh=[]\r\n\r\nfor i in range(n):\r\n g=[int(r) for r in input().split()]\r\n h.append(g)\r\n \r\nb=[]\r\nfor i in range(n):\r\n b.append([0]*n)\r\n \r\ns=[]\r\nfor i in range(n):\r\n s.append([0]*n)\r\nt=[]\r\nfor i in range(n):\r\n t.append([0]*n)\r\nfor i in range(n):\r\n for j in range(n):\r\n b[i][j]=h[j][i]\r\nfor i in range(n):\r\n for j in range(n):\r\n s[i][j]=(b[i][j]+h[i][j])/2\r\nfor i in range(n):\r\n for j in range(n):\r\n t[i][j]=(h[i][j]-b[i][j])/2\r\n\r\nfor i in s:\r\n print('\\n')\r\n for j in i:\r\n print(j,end=' ')\r\n \r\nfor i in t:\r\n print('\\n')\r\n for j in i:\r\n print(j,end=' ')", "n = int(input())\r\nif n == 1:\r\n print(int(input()))\r\n print(0)\r\n exit()\r\narr = [list(map(int, input().split(' '))) for _ in range(n)]\r\na = [[0]*n for _ in range(n)]\r\nb = [[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n a[i][i] = arr[i][i]\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n a[i][j] = (arr[i][j] + arr[j][i]) / 2\r\n a[j][i] = (arr[i][j] + arr[j][i]) / 2\r\n b[i][j] = (arr[i][j] - arr[j][i]) / 2\r\n b[j][i] = -(arr[i][j] - arr[j][i]) / 2\r\nfor i in a: print(*i)\r\nfor i in b: print(*i)\r\n", "\r\nn = int(input())\r\nl = []\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n k = list(map(int,input().split()))\r\n l.append(k)\r\n l1.append([0]*len(k))\r\n l2.append([0]*len(k))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n l1[i][j] = (l[i][j]+l[j][i])/2\r\n l2[i][j] = (l[i][j]-l[j][i])/2\r\n\r\nfor i in range(n):\r\n print(*l1[i])\r\nfor i in range(n):\r\n print(*l2[i])\r\n\r\n\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n c = list(map(int, input().split()))\r\n l.append(c)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append([-99999]*n)\r\n b.append([-99999]*n)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n a[i][j] = l[i][j]\r\n b[i][j] = 0\r\n elif a[i][j]==-99999:\r\n a[i][j] = a[j][i]= (l[i][j]+l[j][i])/2\r\n b[i][j] = (l[i][j]-l[j][i])/2\r\n b[j][i] = -1*(l[i][j]-l[j][i])/2\r\nfor i in a:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\nfor i in b:\r\n for j in i:\r\n print(j, end = \" \")\r\n print()\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n w = []\r\n for i in range(n):\r\n w.append(list(map(int, input().split())))\r\n a=[]\r\n b=[]\r\n for i in range(n):\r\n a.append([0.0]*n)\r\n b.append([0.0]*n)\r\n for i in range(n):\r\n for j in range(i, n):\r\n a[i][j] = (w[i][j] + w[j][i]) / 2\r\n a[j][i] = a[i][j]\r\n b[i][j] = w[i][j] - a[i][j]\r\n b[j][i] = w[j][i] - a[j][i]\r\n for i in range(n):\r\n print(\" \".join(list(map(str, a[i]))))\r\n for i in range(n):\r\n print(\" \".join(list(map(str, b[i]))))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nb=[[0]*n for _ in range(n)]\r\nc=[[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j: b[i][j]=a[i][j]\r\n else:\r\n k=a[i][j]+a[j][i]\r\n b[i][j]=k/2\r\n b[j][i]=k/2\r\n c[i][j]=a[i][j]-b[i][j]\r\n c[j][i]=a[j][i]-b[j][i]\r\nfor i in range(n):\r\n for j in range(n):\r\n print(b[i][j],end=' ')\r\n print()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(c[i][j],end=' ')\r\n print()", "def printMatrix(matrix):\r\n for matrixrow in matrix:\r\n row=''\r\n for value in matrixrow:\r\n row+=str(value)+' '\r\n print(row)\r\nn=int(input())\r\nw=[[0 for i in range(n)] for i in range(n)]\r\na=[[0 for i in range(n)] for i in range(n)]\r\nb=[[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n row=input().split(' ')\r\n for e in range(n):\r\n w[i][e]=int(row[e])\r\nfor i in range(n):\r\n for e in range(n):\r\n a[e][i]=a[i][e]=(w[i][e]+w[e][i])/2\r\n b[e][i]=w[e][i]-a[e][i]\r\nprintMatrix(a)\r\nprintMatrix(b)", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n\tarr.append(list(map(int,input().split())))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n\ta.append([])\r\n\tb.append([])\r\n\tfor j in range(n):\r\n\t\ta[i].append((arr[i][j]+arr[j][i])/2)\r\n\t\tb[i].append(arr[i][j]-a[i][j])\r\nfor i in range(n):\r\n\tprint(*a[i])\r\nfor i in range(n):\r\n\tprint(*b[i])\r\n", "# input\r\nn = int(input())\r\nmatrix = []\r\na = n\r\nwhile a>0:\r\n x = []\r\n x = input().split()\r\n matrix.append(x)\r\n a -= 1\r\n\r\n# A\r\na = 0\r\nwhile a<n:\r\n b = 0\r\n out = ''\r\n while b<n:\r\n if a == b:\r\n if b == 0:\r\n out = str(float(matrix[a][b]))\r\n else:\r\n out += ' ' + str(float(matrix[a][b]))\r\n else:\r\n if b == 0:\r\n out = str((float(matrix[a][b]) + float(matrix[b][a]))/2)\r\n else:\r\n out += ' ' + str((float(matrix[a][b]) + float(matrix[b][a]))/2)\r\n b += 1\r\n print(out)\r\n a += 1\r\n\r\n\r\n# B\r\na = 0\r\nwhile a<n:\r\n b = 0\r\n out = ''\r\n while b<n:\r\n if a == b:\r\n if b == 0:\r\n out = str(float(0))\r\n else:\r\n out += ' ' + str(float(0))\r\n else:\r\n if b == 0:\r\n out = str((float(matrix[a][b]) - float(matrix[b][a]))/2)\r\n else:\r\n out += ' ' + str((float(matrix[a][b]) - float(matrix[b][a]))/2)\r\n b += 1\r\n print(out)\r\n a += 1", "W = []\nfor _ in range(int(input())):\n W.append(list(map(int, input().split())))\n\na, b = [], []\nfor i in range(len(W)):\n t1, t2 = [], []\n for j in range(len(W)):\n t1.append((W[i][j]+W[j][i])/2), t2.append((W[i][j]-W[j][i])/2)\n a.append(t1), b.append(t2)\n\nlist(map(lambda x: print(*x), a+b))\n", "size = int(input())\r\nw = []\r\n\r\nfor enu in range(size):\r\n temp = input().split()\r\n w.append(list(map(int, temp)))\r\nA = [[0 for i in range(size)] for j in range(size)]\r\nB = [[0 for i in range(size)] for j in range(size)]\r\nfor i in range(size):\r\n for j in range(i, size):\r\n A[i][j] = (w[i][j] + w[j][i]) / 2\r\n B[i][j] = (w[i][j] - w[j][i]) / 2\r\n A[j][i] = A[i][j]\r\n B[j][i] = -B[i][j]\r\ndef pr(A):\r\n global size\r\n for i in range(size):\r\n for j in range(size - 1):\r\n print(\"%.8f\" % A[i][j], end = ' ')\r\n print('%.8f' % A[i][-1])\r\npr(A)\r\npr(B)" ]

{"inputs": ["2\n1 4\n3 2", "3\n1 2 3\n4 5 6\n7 8 9", "8\n62 567 1382 1279 728 1267 1262 568\n77 827 717 1696 774 248 822 1266\n563 612 995 424 1643 1197 338 1141\n1579 806 1254 468 184 1571 716 772\n1087 182 1312 772 605 1674 720 1349\n1393 988 873 157 403 301 1519 1192\n1085 625 1395 1087 847 1360 1004 594\n1368 1056 916 839 472 840 53 1238", "7\n926 41 1489 72 749 375 940\n464 1148 858 1010 285 1469 1506\n1112 1087 225 917 480 511 1090\n759 945 627 230 220 1456 529\n318 83 203 134 1192 1167 6\n440 1158 1614 683 1358 1140 1196\n1175 900 126 1562 1220 813 148", "1\n1", "1\n0", "2\n0 0\n0 0", "2\n0 1\n0 1"], "outputs": ["1.00000000 3.50000000\n3.50000000 2.00000000\n0.00000000 0.50000000\n-0.50000000 0.00000000", "1.00000000 3.00000000 5.00000000\n3.00000000 5.00000000 7.00000000\n5.00000000 7.00000000 9.00000000\n0.00000000 -1.00000000 -2.00000000\n1.00000000 0.00000000 -1.00000000\n2.00000000 1.00000000 0.00000000", "62.00000000 322.00000000 972.50000000 1429.00000000 907.50000000 1330.00000000 1173.50000000 968.00000000\n322.00000000 827.00000000 664.50000000 1251.00000000 478.00000000 618.00000000 723.50000000 1161.00000000\n972.50000000 664.50000000 995.00000000 839.00000000 1477.50000000 1035.00000000 866.50000000 1028.50000000\n1429.00000000 1251.00000000 839.00000000 468.00000000 478.00000000 864.00000000 901.50000000 805.50000000\n907.50000000 478.00000000 1477.50000000 478.00000000 605.00000000 1038.50000000 78...", "926.00000000 252.50000000 1300.50000000 415.50000000 533.50000000 407.50000000 1057.50000000\n252.50000000 1148.00000000 972.50000000 977.50000000 184.00000000 1313.50000000 1203.00000000\n1300.50000000 972.50000000 225.00000000 772.00000000 341.50000000 1062.50000000 608.00000000\n415.50000000 977.50000000 772.00000000 230.00000000 177.00000000 1069.50000000 1045.50000000\n533.50000000 184.00000000 341.50000000 177.00000000 1192.00000000 1262.50000000 613.00000000\n407.50000000 1313.50000000 1062.50000000...", "1.00000000\n0.00000000", "0.00000000\n0.00000000", "0.00000000 0.00000000\n0.00000000 0.00000000\n0.00000000 0.00000000\n0.00000000 0.00000000", "0.00000000 0.50000000\n0.50000000 1.00000000\n0.00000000 0.50000000\n-0.50000000 0.00000000"]}

UNKNOWN

PYTHON3

CODEFORCES

34

d34fce590c9ab5f1c4b730f672fac6e8

Friends Meeting

Two friends are on the coordinate axis *Ox* in points with integer coordinates. One of them is in the point *x*1<==<=*a*, another one is in the point *x*2<==<=*b*. Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third — by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1<=+<=2<=+<=3<==<=6. The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point. The first line contains a single integer *a* (1<=≤<=*a*<=≤<=1000) — the initial position of the first friend. The second line contains a single integer *b* (1<=≤<=*b*<=≤<=1000) — the initial position of the second friend. It is guaranteed that *a*<=≠<=*b*. Print the minimum possible total tiredness if the friends meet in the same point. Sample Input 3 4 101 99 5 10 Sample Output 1 2 9

[ "import math\r\na = int(input())\r\nb = int(input())\r\nz = math.fabs(a-b)//2\r\nn = 0\r\nfor i in range(int((math.fabs(a-b)-z))+1):\r\n n+=i\r\nfor i in range(int(z)+1):\r\n n+=i\r\nprint(n)", "def arithm_sum(a, n, d):\r\n return int(n/2 * (2*a+(n-1)*d))\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndistance = abs(a-b)\r\n\r\nif distance == 1:\r\n print(1)\r\nelse:\r\n a_dist = distance//2\r\n b_dist = distance - a_dist\r\n # print(a_dist, b_dist)\r\n\r\n a_tiredness = arithm_sum(1, a_dist, 1)\r\n b_tiredness = arithm_sum(1, b_dist, 1)\r\n # print(a_tiredness, b_tiredness)\r\n\r\n total = a_tiredness+b_tiredness\r\n print(total)\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_strList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\na = get_int()\r\nb = get_int()\r\n\r\nd = (a+b)//2\r\nfirst = abs(d-a)\r\nsecond = abs(b-d)\r\n\r\nprint( first*(first+1)//2 + second*(second+1)//2)", "a, b = int(input()), int(input())\r\nc = abs(a-b)\r\nd = c // 2\r\nprint(d * (d+1) if c % 2 == 0 else (d+1) ** 2)", "a =int(input())\r\nb=int(input())\r\nmid = (a+b)//2\r\na1 = abs(mid - a)\r\nb1= abs(mid - b)\r\ndef summ(k):\r\n sum=0\r\n while(k>0):\r\n sum+=k\r\n k-=1\r\n return sum\r\n\r\nprint(summ(a1)+summ(b1))", "a = int(input())\r\nb = int(input())\r\ndiff = max(a,b) - min(a,b)\r\nsummation = 0\r\nif diff % 2== 0:\r\n for i in range(1,diff//2+1):\r\n summation += i\r\n summation *= 2\r\nelse:\r\n for i in range(1,diff//2+1):\r\n summation += i\r\n summation *= 2\r\n summation += diff//2 + 1\r\nprint(summation)", "a = int(input())\r\nb = int(input())\r\nc = (abs(a - b) + 1) // 2\r\ns = 0\r\nfor i in range(1, c + 1):\r\n s += i\r\nif (a - b) % 2:\r\n print(2 * s - c)\r\nelse:\r\n print(2 * s)\r\n", "a = int(input())\r\nb = int(input())\r\nhealth = 0\r\ni = 1\r\nif a > b :\r\n x = (a - b )// 2 + b\r\n while a != b:\r\n if a != x:\r\n a -= 1\r\n health += i\r\n if b != x:\r\n b += 1\r\n health += i\r\n i += 1\r\nelse:\r\n x = (b - a ) // 2 + a\r\n while a != b:\r\n if a != x:\r\n a += 1\r\n health += i\r\n if b != x:\r\n health += i\r\n b -= 1\r\n i += 1\r\nprint(health)", "def get_natural_sum(n):\r\n return n * (n+1) // 2\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nn1, n2 = max(a, b), min(a, b)\r\n\r\ndist_a = (n1 - n2) // 2\r\ndist_b = (n1 - n2) - dist_a\r\n\r\nprint(get_natural_sum(dist_a) + get_natural_sum(dist_b))", "def okaj(xxx):\r\n xxx= int(xxx)\r\n j=0; jog=0\r\n li=[]\r\n for i in range(1,1001):\r\n if i%2==1:\r\n j+=1\r\n jog +=j\r\n li.append(jog)\r\n \r\n return li[xxx-1]\r\n\r\na= int(input())\r\nb= int(input())\r\nc= abs(a-b)\r\nprint(okaj(c))", "def abs(x):\r\n if x>0:\r\n return x\r\n return -x\r\nn=int(input())\r\nm=int(input())\r\nprint(((abs(m-n)+1)//2)*(abs(m-n)//2+1))", "\r\na = int(input())\r\nb = int(input())\r\n\r\nx = (a + b) // 2\r\n\r\nn1 = abs(a - x)\r\nres1 = n1 * (n1 + 1) // 2\r\n\r\nn2 = abs(b - x)\r\nres2 = n2 * (n2 + 1 ) // 2\r\n\r\nprint(res1 + res2 )\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nif b>a:\r\n a,b=b,a\r\nd=a-b\r\nif d%2==0:\r\n print(int(2*((d/2)*((d/2)+1)/2)))\r\nelse:\r\n print(int((2*((d//2)*((d//2)+1)/2))+((d//2)+1)))\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nl=int((a+b)/2)\r\nc=0\r\nfor i in range(1,abs(l-a)+1):\r\n\tc+=i\r\nfor i in range(1,abs(l-b)+1):\r\n\tc+=i\r\nprint(c)", "a,b=int(input()),int(input())\r\nd=min(a,b)+abs(a-b)//2\r\ntiredness=0\r\nfor i in range(1,abs(d-a)+1):\r\n tiredness+=i\r\nfor i in range(1,abs(d-b)+1):\r\n tiredness+=i\r\nprint(tiredness)", "n1 = int(input())\r\nn2 = int(input())\r\nprint((abs(n1-n2)+1)**2//4)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b: a, b = b, a\r\nmid = (a+b)//2\r\ntiredeness = 0\r\n\r\nfactor = 1\r\nfor _ in range(a, mid):\r\n tiredeness += factor\r\n factor += 1\r\n\r\nfactor = 1\r\nfor _ in range(mid, b):\r\n tiredeness += factor\r\n factor += 1\r\n \r\nprint(tiredeness)", "a = int(input())\r\nb = int(input())\r\nx = (a + b) // 2\r\nprint(abs(a - x) * (abs(a - x) + 1) // 2 + abs(b - x) * (abs(b - x) + 1) // 2)\r\n", "x=int(input())\r\ny=int(input())\r\nd=abs(x-y)\r\nc=d//2\r\nr=c*(c+1)\r\nif(d%2==0):\r\n print(r)\r\nelse:\r\n print(r+(d+1)//2)\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nsum1 = 0\r\nsum2 = 0\r\nif (b - a) % 2 == 0: \r\n st1 = int((b - a)*0.5) + 1\r\n st2 = int((b - a)*0.5) + 1\r\nelse:\r\n st1 = int((b - a)*0.5 + 1.5)\r\n st2 = int((b - a)*0.5 + 0.5)\r\nfor i in range(1, st1): sum1 += i\r\nfor i in range(1, st2): sum2 += i\r\nprint(sum1 + sum2)", "a, b = int(input()), int(input())\r\nc = abs(a - b)\r\nif c % 2 == 1:\r\n print((c + 1) // 2 + (c // 2) * (c // 2 + 1))\r\nelse:\r\n print((c // 2) * (c // 2 + 1))\r\n", "a = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\nf = 0\r\nft = 0\r\nm = n\r\n\r\nif n % 2 > 0:\r\n m = n + 1\r\n\r\nfor i in range(1, (m//2)+1):\r\n\r\n f = 2 * i\r\n ft = ft + f\r\n\r\nif n % 2 > 0:\r\n\r\n ft = ft - (f//2)\r\n\r\nprint(ft)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b: \r\n a, b = b, a\r\nl = b - a\r\nA = l//2\r\nB = l - A\r\nprint((A*(A+1))//2 + (B*(B+1))//2)\r\n", "a=int(input())\r\nb=int(input())\r\nminval=min(a,b)\r\nmaxval=max(a,b)\r\ndiff=abs(a-b)\r\ncnt=0\r\nfor i in range(1,diff+1):\r\n\tif minval==maxval:\r\n\t\tbreak\r\n\tminval+=1\r\n\tcnt+=i\r\n\tif minval==maxval:\r\n\t\tbreak\r\n\tmaxval-=1\r\n\tcnt+=i\r\nprint(cnt)", "a = int(input())\r\n\r\nb = int(input())\r\n\r\ndiff = abs (a-b)\r\n\r\n\r\nif diff % 2 == 0:\r\n steps = int(diff / 2)\r\n tiredness = 0\r\n for i in range (1, steps+1):\r\n tiredness +=i\r\n print (tiredness*2)\r\nelse:\r\n steps = int(diff // 2)\r\n tiredness = 0\r\n for i in range (1, steps+1):\r\n tiredness +=i\r\n print (tiredness*2 + (steps+1))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[94]:\n\n\na = int(input())\nb = int(input())\n\nc = 0\n\nr = abs(a-b)+1\n\nfor i in range(1,r):\n if a>b:\n a=a-1\n c = c+i\n if a == b:\n print(c)\n else:\n b=b+1\n c = c+i\n if a==b:\n print(c)\n elif a<b:\n a=a+1\n c = c+i\n if a == b:\n print(c)\n else:\n b=b-1\n c = c+i\n if a==b:\n print(c)\n \n\n", "a = int(input())\nb = int(input())\ndef t(x):\n return x*(x+1)//2\nm = (a+b)//2\nd1= abs(a-m)\nd2= abs(b-m)\nprint(t(d1)+t(d2))\n", "#A. Friends Meeting\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\n#print(d)\r\nif d==1:\r\n print(1)\r\nelse:\r\n ad=int(d/2)\r\n #print(ad)\r\n bd=d-(int(d/2))\r\n #print(bd)\r\n ad1=ad*(ad+1)/2\r\n #print(ad1)\r\n bd1=bd*(bd+1)/2\r\n print(int(ad1+bd1))", "a=int(input())\r\nb=int(input())\r\nn=max(b-a,a-b)\r\nm=n//2\r\nliststep=[]\r\nfor i in range(1,n):\r\n liststep.append(i)\r\nif n==1:\r\n tired=1\r\nelif n%2==0:\r\n tired=m*(m+1)\r\nelif n%2!=0:\r\n tired=m*(m+1)+liststep[m]\r\nprint(tired) \r\n ", "a = int(input())\r\nb = int(input())\r\nbest = 10**18\r\ndef dist(a, b):\r\n l = max(a - b, b - a)\r\n if l == 0: return 0\r\n return l * (l + 1) // 2\r\nfor x in range(1, 2000):\r\n best = min(best, dist(x, a) + dist(x, b))\r\nprint(best)\r\n", "n = int(input())\r\nm = int(input())\r\nl = abs(m - n) // 2\r\na = l\r\nb = abs(m - n) - l\r\nans = 0\r\nfor i in range(a + 1):\r\n ans += i\r\nfor i in range(b + 1):\r\n ans += i\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nbetween = abs(b - a)\r\ndistances = between / 2\r\nans = 0\r\nh = distances + 0.5\r\nl = distances - 0.5\r\nif distances % 1 == 0:\r\n ans = distances * (distances + 1)\r\nelse:\r\n ans = ((l * (l + 1)) / 2) + ((h * (h + 1)) / 2)\r\nprint(int(ans))", "def energy(n):\r\n x = (n*(n+1))//2\r\n return x\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nc = (a+b)//2\r\n\r\np = (energy(abs(a-c))) + (energy(abs(b-c)))\r\nprint(p)\r\n", "n=int(input())\r\nm=int(input())\r\nA=[]\r\n\r\nif n>m:\r\n s=n-m\r\nelse:\r\n s=m-n\r\nif s%2==0:\r\n g=s//2\r\n print(g*(g+1))\r\nelse:\r\n g=s//2\r\n print(g*(g+1)+g+1)\r\n ", "import math\r\na = int(input())\r\nb = int(input())\r\n\r\ndiff = abs((a) - (b))\r\nenergy = 0\r\nfor i in range(0, (diff//2) + 1):\r\n energy+=2*i \r\n last = i\r\nif diff%2!=0:\r\n energy+= 1 * (last +1)\r\n\r\nprint(energy)\r\n\r\n \r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs((b-a)//2)\r\nd = abs(max(a,b)-min(a,b)-c)\r\ns= c*(c+1)/2+d*(d+1)/2\r\nprint(int(s))", "a = int(input())\r\nb = int(input())\r\nif abs(b - a) % 2 == 0:\r\n some = 0\r\n for i in range(1 , 1 + abs(b - a) // 2):\r\n some += i\r\n print(2 * some)\r\nelse:\r\n some = 0\r\n prev = 0\r\n for i in range(1, 1 + abs(b - a) // 2):\r\n some += i\r\n prev = i\r\n i = prev\r\n print(some + some + (i + 1))", "# computes a arithmic sieres of steps being one and first term is one\r\ndef as12n(a):\r\n return(a*(a+1))/2\r\na = int(input())\r\nb = int(input())\r\ndist = abs(a-b)\r\ntiredlist = []\r\nfor i in range(dist):\r\n dista = i+1 \r\n distb = dist-dista\r\n number = as12n(dista)+as12n(distb)\r\n tiredlist.append(int(number))\r\nprint(min(tiredlist))", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nif (c==1):\r\n\tans = 1\r\nelif (c == 2):\r\n\tans = 2\r\nelse:\r\n\tq = c//2\r\n\tw = c-q\r\n\ta1 = (q*(q+1))/2\r\n\ta2 = (w*(w+1))/2\r\n\tans = a1+a2\r\nprint(int(ans))", "a, b = int(input()), int(input())\r\ndiff = abs(a - b)\r\nn1 = diff // 2\r\nn2 = diff - n1\r\nans = n1 * (n1 + 1) // 2 + n2 * (n2 + 1) // 2\r\nprint(ans)\r\n", "import math\r\na1 = 0\r\nb1 = 0\r\nn = int(input())\r\nm = int(input())\r\na = math.ceil((abs(n-m))/2) \r\nb = math.floor((abs(n-m))/2)\r\nfor i in range(1,a+1):\r\n\ta1 += i\r\nfor j in range(1,b+1):\r\n\tb1 += j\r\nprint(a1+b1)\t", "a=int(input())\r\nb=int(input())\r\nz=(a+b)//2\r\n# print(z)\r\ns=0\r\nfor i in range(abs(z-a)): #2 1+2\r\n s+= i+1\r\nfor j in range(abs(z-b)): #3 1+2+3\r\n s+= j+1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)/2\r\nz = int(c)\r\nres = 2*z*(z+1)/2\r\nif z!=c:\r\n res+=z+1\r\n\r\nprint(int(res))", "a = int(input())\r\nb = int(input())\r\ns = abs(a - b)\r\ncnt = 0\r\nfor i in range(1, s // 2 + 1):\r\n cnt += i\r\ncnt *= 2\r\ncnt += (s % 2) * ((s + 1) // 2)\r\nprint(cnt)\r\n", "a=int(input())\r\nb=int(input())\r\nif a<b:\r\n i,j=1,1\r\n sum1,sum2=0,0\r\n while a!=b:\r\n sum1+=i\r\n a+=1\r\n i+=1\r\n if a!=b:\r\n sum2+=j\r\n b-=1\r\n j+=1\r\n else:\r\n break\r\n print(sum1+sum2)\r\nelse:\r\n a,b=b,a\r\n i,j=1,1\r\n sum1,sum2=0,0\r\n while a!=b:\r\n sum1+=i\r\n a+=1\r\n i+=1\r\n if a!=b:\r\n sum2+=j\r\n b-=1\r\n j+=1\r\n else:\r\n break\r\n print(sum1+sum2)\r\n", "t=int(input())\np=int(input())\nif((t-p)==1):\n\tprint(1)\nelif((p-t)==1):\n\tprint(1)\nelse:\n\tfinal=abs(p-t)\n\tif(final%2==0):\n\t\tprint(int((final*(final+2))//4))\n\telse:\n\t\tprint(int(((final-1)*((final-1)+2))//4)+(final//2)+1)", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\nprint((c + 1) ** 2 // 4)", "f1 = int(input())\r\nf2 = int(input())\r\n\r\ncountMaior = 0\r\ncountMenor = 0\r\niMenor = 0\r\niMaior = 0\r\n\r\nif(f1 > f2):\r\n maior = f1\r\n menor = f2\r\nelse:\r\n maior = f2\r\n menor = f1\r\n\r\nwhile(menor != maior):\r\n if(countMaior > countMenor):\r\n menor += 1\r\n iMenor += 1\r\n countMenor += iMenor\r\n else:\r\n maior -= 1\r\n iMaior += 1\r\n countMaior += iMaior\r\n\r\nprint(countMaior + countMenor)", "a=int(input())\r\nb=int(input())\r\n\r\nans=0\r\n\r\nfor i in range(1,(abs(a-b)//2)+1):\r\n ans=ans+i\r\n\r\nif(abs(a-b)%2==0):\r\n print(2*ans)\r\nelse:\r\n print(2*ans+((abs(a-b)//2)+1))", "n=int(input())\nm=int(input())\na=abs(n-m)\nq1=(a//2)+a%2\nq2=(a//2)\nprint((q1*(q1+1)//2)+(q2*(q2+1)//2))\n", "def main():\n a = int(input())\n b = int(input())\n middle = (a + b) // 2\n a = abs(a - middle)\n b = abs(b - middle)\n tiredness = lambda x: x * (x + 1) // 2\n t = tiredness(min(a, b)) * 2\n\n if a != b:\n t += max(a, b)\n\n print(t)\n\n\nif __name__ == '__main__':\n main()\n", "def solve():\r\n a,b = int(input()),int(input())\r\n m = abs(a-b)\r\n numbers = list(range(1,m+1))\r\n ans = sum(numbers)\r\n for i in range(1,m):\r\n ans = min(ans,sum(numbers[0:m-i])+sum(numbers[0:i]))\r\n print(ans)\r\n\r\n\r\nsolve()\r\n# t = int(input())\r\n# for i in range(t):\r\n# solve()\r\n#\r\n", "a = int(input())\nb = int(input())\n\nd = abs(a - b)\nq, r = divmod(d, 2)\ntireness = (1 + q) * q\n\nif r == 1:\n tireness += (q + 1)\n\nprint(tireness)\n\n", "f1=int(input())\r\nf2=int(input())\r\nx=max(f1,f2)\r\ny=min(f1,f2)\r\nz=x-y\r\na=0\r\nb=0\r\nif z%2==0:\r\n\tw=int(z/2)\r\n\tfor i in range(1,w+1):\r\n\t\tb=b+i\r\n\tprint(2*b)\r\nelse:\r\n\tw=int(z/2)\r\n\tfor i in range(1,w+1):\r\n\t\ta=a+i\r\n\tfor i in range(1,w+2):\r\n\t\tb=b+i\r\n\tprint(a+b)", "a=int(input())\r\nb=int(input())\r\nif(a>b):\r\n a,b=b,a\r\ntire=0\r\ntempA=1\r\ntempB=1\r\nturn=0\r\nwhile(a<b):\r\n if(turn==0):\r\n a+=1\r\n tire+=tempA\r\n turn=1\r\n tempA+=1\r\n else:\r\n b-=1\r\n tire+=tempB\r\n turn=0\r\n tempB+=1\r\nprint(tire)", "#w, h, w2, h2 =[int(i) for i in input().split()]\r\na=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nif x%2==1:\r\n n=x//2\r\n m=x//2+1\r\n print(n*(n+1)//2+m*(m+1)//2)\r\nelse:\r\n n=x//2\r\n m=x//2\r\n print(n*(n+1)//2+m*(m+1)//2) ", "import math\r\nn=int(input())\r\nm=int(input())\r\nif(n==m):\r\n print(0)\r\nelif(n+1==m):\r\n print(1)\r\nelse:\r\n d=abs(m-n)\r\n if(d%2==0):\r\n e=d//2\r\n sum=0\r\n for i in range(1,e+1):\r\n sum=sum+i\r\n print(sum*2)\r\n elif(d%2!=0):\r\n e=d//2\r\n f=e+1\r\n sum=0\r\n for i in range(1,f+1):\r\n sum=sum+i\r\n print(sum+(sum-f))\r\n \r\n ", "from math import ceil as c\r\na = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\ntire = 0\r\nif n % 2 == 0:\r\n k = n // 2\r\n for i in range(1, k+1):\r\n tire += (2 * i)\r\nelse:\r\n k = c(n / 2)\r\n for i in range(1, k+1):\r\n if i == k:\r\n tire += i\r\n else:\r\n tire += (2 * i)\r\nprint(tire)\r\n", "first=int(input())\r\nsecond=int(input())\r\nsubtract=abs(first-second)\r\nif subtract==1:\r\n print(\"1\")\r\nelse:\r\n count=0\r\n k=(subtract//2)+1\r\n i= 1 \r\n while( subtract > 0):\r\n subtract=subtract-1\r\n count=count+i\r\n subtract=subtract-1\r\n count=count+i \r\n i=i+1\r\n if subtract%2==0:\r\n print(count)\r\n else:\r\n print(count - k )\r\n \r\n ", "a=int(input())\r\nb=int(input())\r\ntired = 0\r\ndistA=(max(a,b)-min(a,b))//2\r\ndistB=(max(a,b)-min(a,b))-distA\r\nprint ((distA*(distA+1)//2) + (distB*(distB+1)//2))\r\n", "a=int(input())\r\nb=int(input())\r\ndis=abs(a-b)\r\nhalf=dis//2\r\nrem=dis%2\r\nsuma=0\r\nsumb=0\r\nfor i in range(1,half+1):\r\n suma+=i\r\nfor j in range(1,(half+rem)+1):\r\n sumb+=j\r\nprint(suma+sumb)", "a = int(input())\r\nb = int(input())\r\nn=abs(a-b)//2\r\nif (a-b)%2==0:\r\n tirdness=2*(1+n)*n/2\r\nelse:\r\n tirdness=2*(1+n)*n/2+n+1\r\nprint(int(tirdness))", "# https://codeforces.com/problemset/problem/931/A\n\ndef f(n):\n return (n*(n+1))//2\n\na=int(input())\nb=int(input())\ndist = abs(a-b)\naMoves = (dist+1)//2\nbMoves = dist//2\nprint(f(aMoves)+f(bMoves))\n", "a=int(input())\r\nb=int(input())\r\nk=max(a,b)\r\np=min(a,b)\r\nd=(k-p)\r\nif d % 2==0:\r\n n=d//2\r\n t=n*(n+1)\r\n print(t)\r\nelse:\r\n n=d//2\r\n m=n+1\r\n t=n*(n+1)+m\r\n print(t)\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nans = 0\r\nfor i in range(c // 2 + 1):\r\n ans += 2 * i\r\nif c % 2 == 1:\r\n ans += i + 1\r\nprint(ans)", "def main():\n A = int(input())\n B = int(input())\n\n n = abs(A - B)\n x, y = divmod(n, 2)\n y += x\n tired = (x * (x + 1)) // 2 + (y * (y + 1)) // 2\n print(tired)\n\nmain()\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nmov = int(d/2)\r\n#print(mov)\r\nans = int((mov*(mov+1))/2)\r\nif d%2==1:\r\n mov = mov + 1\r\nans = ans + int((mov*(mov+1))/2)\r\n#print(mov)\r\nprint(ans)", "# A. Friends Meeting\n\nx1 = int(input())\nx2 = int(input())\n\ndiff = abs(x1 - x2)\nn = diff // 2\n\nans = n * (n + 1)\nif diff % 2 != 0:\n ans += n + 1\n\nprint(ans)\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nif (d % 2 == 0):\r\n tmp = d // 2\r\n print(2 * (1 + tmp) * tmp // 2)\r\nelse:\r\n tmp = d // 2\r\n first = (1 + tmp + 1) * (tmp + 1) // 2\r\n second = (tmp + 1) * tmp // 2\r\n print(first + second)", "def main():\n x = abs(int(input()) - int(input()))\n print((x * (x + 1)) // 2 - x // 2 * (x - x // 2))\n\n\nif __name__ == '__main__':\n main()\n", "def friendsM(f1, f2):\r\n if(f1 > f2):\r\n f1, f2 = f2, f1\r\n \r\n mid = (f1 + f2)//2\r\n count = 0\r\n c2 = 1\r\n \r\n for i in range(f1, mid):\r\n count += c2\r\n c2 += 1\r\n \r\n c2 = 1\r\n for i in range(mid, f2):\r\n count += c2\r\n c2 += 1\r\n \r\n print(count)\r\n\r\ndef main():\r\n f1 = int(input())\r\n f2 = int(input())\r\n \r\n friendsM(f1, f2)\r\n \r\nmain()", "a = int(input())\r\nb = int(input())\r\nr = max(a, b)\r\nl = min(a, b)\r\nstep = 0\r\nll = 1\r\nrr = 1\r\nans = 0\r\nwhile r != l:\r\n if step % 2 == 0:\r\n ans += ll\r\n ll += 1\r\n l += 1\r\n else:\r\n ans += rr\r\n rr += 1\r\n r -= 1\r\n step += 1\r\nprint(ans)", "a=int(input(''))\r\nb=int(input(''))\r\nc=a-b\r\np=0\r\nif c<0:\r\n c=c*-1\r\ns=c//2\r\np=s*(s+1)\r\nif c%2!=0:\r\n p=p+s+1\r\nprint(p)", "a = int(input())\r\nb = int(input())\r\nmidpoint = (a + b) // 2\r\ndist_a = abs(midpoint - a)\r\ndist_b = abs(midpoint - b)\r\ntiredness_a = (dist_a * (dist_a + 1)) // 2\r\ntiredness_b = (dist_b * (dist_b + 1)) // 2\r\ntotal_tiredness = tiredness_a + tiredness_b\r\nprint(total_tiredness)\r\n", "a=int(input())\r\nb=int(input())\r\ne=0\r\nif (abs(a-b))%2==0:\r\n for i in range(1,(abs(a-b))//2+1):\r\n e+=(i*2)\r\nelse:\r\n if abs(a-b)==1:\r\n e+=1\r\n else:\r\n for i in range(1,(abs(a-b))//2+1):\r\n e+=(i*2)\r\n e+=((abs(a-b))//2+1)\r\nprint(e)\r\n \r\n \r\n", "n=int(input())\r\nm=int(input())\r\nif(n>m):\r\n n,m=m,n\r\ncnt=0\r\ntr1=tr2=1\r\nwhile(True):\r\n if(n==m):\r\n break\r\n if(tr1>tr2):\r\n m-=1\r\n cnt+=tr2\r\n tr2+=1\r\n else:\r\n n+=1\r\n cnt+=tr1\r\n tr1+=1\r\nprint(cnt)", "a = int(input())\r\nb = int(input())\r\nif(a>b):\r\n a,b = b,a\r\nfans = 1e18\r\nfor i in range(a,b+1):\r\n d = i-a;e = b-i\r\n ans = d*(d+1)//2 + e*(e+1)//2\r\n fans = min(ans,fans)\r\nprint(fans)", "a=int(input())\r\nb=int(input())\r\ncount=0\r\nif a>b:\r\n\tdist=a-b\r\n\tx=dist//2\r\n\tfor i in range(1,x+1):\r\n\t\tcount+=i\r\n\ty=dist-x*2\r\n\tif y==0:\r\n\t\tcount=(2*count)\r\n\telse:\r\n\t\tcount=(2*count)+x+1\r\n\tprint(count)\r\nelse:\r\n\tdist=b-a\r\n\tx=dist//2\r\n\tfor i in range(1,x+1):\r\n\t\tcount+=i\r\n\ty=dist-x*2\r\n\tif y==0:\r\n\t\tcount=(2*count)\r\n\telse:\r\n\t\tcount=(2*count)+x+1\r\n\tprint(count)", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n a,b=b,a\r\nc=(a+b)//2\r\nres=0\r\ni=0\r\nwhile a<c:\r\n i=i+1\r\n a=a+1\r\n res=res+i\r\ni=0\r\nwhile c<b:\r\n i=i+1\r\n c=c+1\r\n res=res+i\r\nprint(res)\r\n", "x=int(input())\r\ny=int(input())\r\nif(abs(x-y) == 1):\r\n print(\"1\")\r\nelif(abs(x-y)==2):\r\n print(\"2\")\r\nelse:\r\n d = abs(x-y)\r\n if d%2 ==0:\r\n a=d//2\r\n print(a*(a+1)//2 * 2)\r\n else:\r\n a=d//2 + 1\r\n print(a*(a+1)//2 + ((a-1)*(a))//2)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nm = d//2\r\nprint((1 + m)*m + (d % 2)*(m + 1))\r\n", "a = int(input())\r\nb = int(input())\r\nc = a - b\r\nc = c if c > 0 else -c\r\nd = c // 2\r\nc -= d\r\nprint(c*(c + 1)//2 + d*(d + 1)//2)\r\n", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nsum1=0\r\nif diff==1:\r\n print(1)\r\n\r\nelse:\r\n if diff%2==0:\r\n for i in range(1,diff//2 + 1):\r\n sum1+=2*i\r\n print(sum1)\r\n else:\r\n for i in range(1,diff//2+1):\r\n sum1+= 2*i\r\n sum1+=diff//2 + 1\r\n print(sum1)\r\n \r\n \r\n", "import math as m\na=int(input())\nb=int(input())\nif b<a:\n a,b=b,a\nd=a+m.ceil(abs(a-b)/2)\nx=d-a\ny=b-d\nstress=0\nfor i in range(1,x+1):\n stress+=i\nfor i in range(1,y+1):\n stress+=i\nprint(stress)\n\t \t\t\t \t\t\t \t\t\t \t \t \t \t", "a = int(input())\r\nb = int(input())\r\nn = abs(a-b)\r\nt = 0\r\nif n % 2 == 0:\r\n print(2*sum([*range(1, (n//2)+1)]))\r\nelse:\r\n print(2*sum([*range(1, (n//2)+1)])+(n//2)+1)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nhalf = (d//2)\r\n\r\nif d % 2 == 0:\r\n #sum of natural numbers is n(n+1)/2, one for each half so half(half+1) \r\n print(half*(half+1)) \r\nelse:\r\n #add and additional half + 1 if the distance is odd\r\n print(half*(half+1) + half+1)\r\n", "n = int(input())\r\nm = int(input())\r\nans1 = abs(n-m)\r\nif ans1 % 2 == 0:\r\n p = ans1//2\r\n print((1+p)*p)\r\nelse:\r\n p = ans1//2+1\r\n print((1+p)*p-p)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nif x%2==0:\r\n n=x//2\r\n n=(n*(n+1)//2)*2\r\nelse:\r\n n=x//2\r\n t=n+1\r\n n=(n*(n+1)//2)*2\r\n n+=t\r\nprint(n)\r\n\r\n", "import math\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\nhalf = 0\r\nd = 0\r\nasum = 0\r\nbsum = 0\r\nif(diff > 1):\r\n half = math.ceil(diff / 2)\r\n d = abs(diff - half)\r\n for i in range(half):\r\n asum += (i + 1)\r\n for j in range(d):\r\n bsum += (j + 1)\r\n ans = asum + bsum\r\nelif(diff == 1):\r\n ans = 1\r\nelse:\r\n ans = 0\r\nprint(ans)", "import math\n\na, b = int(input()), int(input())\n\ndist = abs(b - a)\n\nprint((dist // 2 + 1) * (dist // 2) + dist % 2 * math.ceil(dist / 2))", "a = int(input())\r\nb = int(input())\r\nmid = (a+b) // 2\r\ns = 0\r\ns += sum(list(range(1, abs(mid - a) + 1)))\r\ns += sum(list(range(1, abs(mid - b) + 1)))\r\n\r\nprint(s)\r\n", "from math import *\r\ndef fun(n):\r\n\treturn (n*(n+1))//2\r\na=int(input())\r\nb=int(input())\r\nif a>b:\r\n\ta,b=b,a\r\nprint(fun((b-a)//2)+fun(ceil((b-a)/2)))\r\n", "a = int(input())\r\nb = int(input())\r\nsred = (a + b) // 2\r\na1 = abs(sred - a)\r\nb1 = abs(sred - b)\r\nk = 1\r\nl = 1\r\ns1 = 0\r\ns2 = 0\r\nwhile (a1 != 0):\r\n s1 += k\r\n k += 1\r\n a1 -= 1\r\nwhile (b1 != 0):\r\n s2 += l\r\n l += 1 \r\n b1 -= 1\r\ns3 = s1 + s2\r\nprint(s3)\r\n", "a = int(input())\r\nb = int(input())\r\nK = (abs(a - b)) // 2\r\nS = 0\r\nfor i in range(1, K + 1):\r\n S += i * 2\r\nif abs(a - b) % 2 == 1:\r\n S += K + 1\r\nprint(S)", "a = int(input())\r\nb = int(input())\r\nif abs(a - b)%2 == 0:\r\n ans = (abs(a-b)//2)*(abs(a-b)//2 + 1)\r\nelse:\r\n n1 = abs(a-b)//2\r\n n2 = abs(a-b) - abs(a-b)//2\r\n ans = n1*(n1 + 1)//2 + n2*(n2 + 1)//2\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\ntmp = abs(a - b)\r\nstep = (tmp // 2)*((tmp // 2) + 1) + tmp//2 + 1 if tmp % 2 == 1 else (tmp // 2)*((tmp // 2) + 1)\r\nprint(step)\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# دیش دیری دیرین ماشالله \r\n", "a = int(input())\r\nb = int(input())\r\n\r\nx = abs(a - b)\r\n\r\ns = 0\r\nif x % 2 == 0:\r\n for i in range(1, x // 2 + 1):\r\n s = s + i\r\n print(s * 2)\r\n\r\nelse:\r\n for i in range(1, x // 2 + 1):\r\n s = s + i\r\n print(s * 2 + x // 2 + 1)", "a = int(input())\r\nb = int(input())\r\nm = (a+b)//2\r\nmaxi = max(a,b)\r\nmini = min(a,b)\r\na1 = maxi-m\r\na2 = m-mini\r\ntotal = a1*(a1+1)//2+a2*(a2+1)//2\r\nprint(total)\r\n\r\n", "import math\r\nx=int(input())\r\ny=int(input())\r\nmid=math.ceil((x+y)/2)\r\nt1=(abs(mid-x))/2*(abs(mid-x)+1)\r\nt2=(abs(mid-y))/2*(abs(mid-y)+1)\r\nprint(int(t1+t2)) ", "a = int(input())\r\nb = int(input())\r\n\r\ns = abs(a - b)\r\nsum = 0\r\n\r\nif s % 2 == 0:\r\n for i in range(1, s // 2 +1):\r\n sum += 2*i\r\nelse:\r\n for i in range(1,s // 2 + 1):\r\n sum += 2*i\r\n sum += s // 2 + 1\r\n \r\nprint(sum)", "n=int(input())\r\nm=int(input())\r\nc=abs(m-n)\r\nd=c//2\r\ne=d+c%2\r\nprint((1+e)*e//2+(1+d)*d//2)", "a=int(input())\r\nb=int(input())\r\nm=(a+b)//2\r\nsum1=0\r\nsum2=0\r\nif(a==m):\r\n\tprint(abs(m-b))\r\nif(b==m):\r\n\tprint(abs(m-a))\r\nif(a!=m and b!=m):\r\n\tz=abs(m-a)\r\n\tfor i in range(1,z+1):\r\n\t\tsum1=sum1+i\r\n\tq=abs(m-b)\r\n\tfor j in range(1,q+1):\r\n\t\tsum2=sum2+j\r\n\tprint(sum1+sum2)", "a = int(input())\r\nb = int(input())\r\n\r\nresult = 0\r\ncontA = 0\r\ncontB = 0\r\nwhile(a != b):\r\n if(contA > contB):\r\n if(b > a):\r\n b -= 1\r\n else:\r\n b += 1\r\n contB += 1\r\n result += contB\r\n else:\r\n if(a < b):\r\n a += 1\r\n else:\r\n a -= 1\r\n contA += 1\r\n result += contA\r\nprint(result)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)//2\r\ny=1\r\nfor i in range(x):\r\n y+=1\r\nif abs(a-b)%2==0:\r\n print(2 * (x*(x+1)//2))\r\nelse:\r\n print(2 * (x*(x+1)//2) + y)", "a=int(input())\r\nb=int(input())\r\nz=max(a,b)-min(a,b)\r\nif z%2==0:\r\n\tprint(int(z/2*(z/2+1)))\r\nelse:\r\n\tk=z//2\r\n\ta=k*(k+1)/2\r\n\tb=(k+1)*(k+2)/2\r\n\tprint(int(a+b))", "from functools import reduce\r\ndef s(n):\r\n\tn=reduce(lambda x,y:x+y,range(1,n+1))\r\n\treturn n\r\nx=abs(int(input())-int(input()))\r\nif x==1:\r\n\tprint(1)\r\n\texit()\r\nif x%2==0:\r\n\tprint(2*s(x//2))\r\nelse:\r\n\tprint(2*s(x//2)+(1+x//2))", "def main():\r\n friend_a = int(input())\r\n friend_b = int(input())\r\n\r\n mid = (friend_a + friend_b) // 2\r\n print(int(sum(abs(mid - friend_a)) + sum(abs(friend_b - mid))))\r\ndef sum(n):\r\n return (n * (n + 1))/2\r\nmain()", "a=int(input())\r\nb=int(input())\r\na,b=min(a,b),max(a,b)\r\np=(b+a)//2\r\ns1=p-a\r\ns2=b-p\r\ns=((s1*(s1+1))//2)+((s2*(s2+1))//2)\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n c //= 2\r\n c = c * (c + 1)\r\nelse:\r\n c = c // 2\r\n c = c * (c + 1) // 2 + (c + 1) * (c + 2) // 2\r\nprint(c)", "a = int(input())\r\nb = int(input())\r\n\r\ncrnt = 1\r\ncnt = 0\r\n\r\nd = abs(a-b)\r\n\r\nans = 0\r\nwhile d > 0:\r\n if cnt == 0:\r\n d -= 1\r\n ans += crnt\r\n cnt = 1\r\n else:\r\n cnt = 0\r\n d -= 1\r\n ans += crnt\r\n crnt += 1\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)//2\r\nans=x*(x+1)\r\nif (abs(a-b))%2==0:\r\n\tprint(ans)\r\nelse:\r\n\tans+=(abs(a-b))//2+1\r\n\tprint(ans)\r\n ", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)-1\r\nif diff%2==1:\r\n d_a=(diff//2)+1\r\n d_b=d_a\r\n ans=d_a*(d_a+1)\r\nelse:\r\n d_a=diff//2\r\n d_b=d_a+1\r\n ans=((d_a*(d_a+1))//2)+((d_b*(d_b+1))//2)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nans = 0\r\ns = 0\r\nm = max(a,b) - min(a,b)\r\nm2 = m // 2\r\nfor i in range(m2):\r\n s += 1\r\n ans += s*2\r\nif m % 2 == 1:\r\n ans += (s+1)\r\nprint(ans)", "guy1 = int(input())\r\nguy2 = int(input())\r\n\r\ndiff = abs(guy1 - guy2) \r\nif diff % 2 == 0:\r\n guy1_walks = guy2_walks = diff // 2\r\nelse:\r\n guy1_walks = diff // 2\r\n guy2_walks = guy1_walks + 1\r\n\r\ntiredness = 0\r\n\r\nfor i in range(1,guy1_walks+1):\r\n tiredness += i * 2\r\n\r\nif(guy1_walks != guy2_walks):\r\n tiredness += guy2_walks\r\n\r\nprint(str(tiredness))\r\n\r\n\r\n\r\n", "n=int(input())\r\nm=int(input())\r\nif m-n==1 or n-m==1:\r\n print(1)\r\nelse:\r\n x=abs(n-m)\r\n if x%2==0:\r\n x=x//2\r\n print((x*x)+x)\r\n else:\r\n x=(x//2)+1\r\n print(x*x)", "a=int(input())\r\nb=int(input())\r\ndif=abs(b-a)\r\nf1=dif//2\r\nsum1=(f1*(f1+1))//2\r\nf2=dif-f1\r\nsum2=(f2*(f2+1))//2\r\nprint(sum1+sum2)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\na=int(input())\r\nb=int(input())\r\nprint(((abs(a-b)+1)**2)//4)\r\n\r\n\r\n# c=(a+b)//2\r\n# d=abs(a-c)\r\n# e=abs(b-c)\r\n# d=(d*(d+1))//2\r\n# e=(e*(e+1))//2\r\n# print(int(d)+int(e))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\ncntA=d//2\r\ncntB=d-cntA\r\nTa=cntA*(cntA+1)//2\r\nTb=cntB*(cntB+1)//2\r\nprint(Ta+Tb)", "import math\n\na = int(input())\nb = int(input())\nbar = 0\nfoo = 0\nk=0\nc = max(abs(a), abs(b)) - min(abs(a), abs(b))\nif c % 2 == 0:\n\tk = int(c/2+1)\n\t\n\tfor i in range(1, k):\n\t\tbar+=i \n\tbar*=2\nif c % 2 != 0:\n\tfor i in range(1, math.ceil(c/2)+1):\n\t\tbar +=i\n\tfor i in range(1, math.floor(c/2)+1):\n\t\tfoo+=i\n\tbar+=foo\n\nprint(bar)\n", "x=int(input())\r\ny=int(input())\r\n#x=list(s)\r\nd=abs(x-y)\r\nif(d%2==0):\r\n m=(x+y)//2 \r\nelse:\r\n m=(x+y)//2 + 1\r\ne=abs(x-m)\r\nf=abs(y-m)\r\ncnt=int((e*(e+1) + f*(f+1))/2)\r\nprint(cnt)", "a = int(input())\nb = int(input())\nr = abs(a - b)\nprint(r % 2 * ((r + 1) // 2) + (r // 2 * (r // 2 + 1)))", "a = int(input())\r\nb = int(input())\r\nn = abs(a - b)\r\nif n % 2 == 0:\r\n\tn = n // 2\r\n\tans = n * (n+1)\r\nelse:\r\n\tn = (n // 2) + 1\r\n\tans = n * n\r\nprint(ans)\r\n\t\r\n\r\n", "x1 = int(input())\r\nx2 = int(input())\r\nmid = (x1+x2)//2\r\nd1 = abs(x1-mid)\r\nd2 = abs(mid-x2)\r\nt = 0\r\nfor i in range(1, d1+1):\r\n t += i\r\nfor i in range(1, d2+1):\r\n t += i\r\nprint(t)\r\n", "x=int(input())\r\ny=int(input())\r\na,b=0,0\r\nif(abs(x-y)%2==0):\r\n a=b=abs(x-y)/2\r\n print(int(a*(a+1)))\r\nelse:\r\n a=(abs(x-y)+1)/2\r\n b=abs(x-y)-a\r\n print(int(a*(a+1)/2 + b*(b+1)/2))", "import re\r\nimport math\r\nimport decimal\r\nimport bisect\r\n\r\na = int(input())\r\nb = int(input())\r\ndist = abs(a - b)\r\naDist = dist // 2\r\nbDist = dist - aDist\r\nprint((aDist * (aDist + 1) // 2) + (bDist * (bDist + 1) // 2))\r\n", "a = int(input())\nb = int(input())\n\ndiff = abs(b - a)\ns_a = diff // 2\ns_b = diff - s_a\n\nprint((s_a * (s_a + 1) + s_b * (s_b + 1)) // 2) ", "import math\r\na_tired = 0\r\nb_tired = 0\r\na = int(input())\r\nb = int(input())\r\n\r\npoint = (a+b)//2\r\n\r\nb_route = abs(b - point)\r\na_route = abs(a - point)\r\n\r\nfor i in range(1,a_route+1):\r\n\ta_tired +=i \r\nfor i in range(1,b_route+1):\r\n\tb_tired +=i\r\n\r\ntotal = a_tired + b_tired\r\nprint(str(total))", "freind1=int(input())\nfreind2=int(input())\nmeetpoint=(freind1+freind2)//2\nsum=0\nfor i in range(meetpoint-min(freind1,freind2)):\n sum=sum+i+1\nfor i in range(max(freind1,freind2)-meetpoint):\n sum=sum+i+1\nprint(sum)", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nx=abs(a-c)\r\ny=abs(b-c)\r\nprint((x*(x+1))//2+(y*(y+1))//2)", "import math\r\na=int(input())\r\nb=int(input())\r\nsmall=min(a,b)\r\nlarg=max(a,b)\r\nmid_point=math.ceil((a+b)/2)\r\ns1=0\r\ns2=0\r\n\r\nfor i in range(0,(mid_point-small)+1):\r\n s1+=i\r\nfor i in range(0,(larg-mid_point)+1):\r\n s2+=i\r\n \r\nprint(s1+s2)", "a=int(input())\nb=int(input())\nt=0\nl=abs(b-a)\nc=l//2\nd=l-c\nt=((c*(c+1))/2)+((d*(d+1))/2)\nprint(int(t))", "def solve():\r\n a = int(input())\r\n b = int(input())\r\n x = y = abs(a - b) >> 1\r\n \r\n if abs(a - b) & 1:\r\n x += 1\r\n \r\n print(x * (x + 1) // 2 + y * (y + 1) // 2)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\nm=int(input())\r\nc=(n+m) // 2\r\nl=0\r\nfor i in range(abs(c-n)):\r\n l+= i+1\r\nfor j in range(abs(m-c)):\r\n l+= j+1\r\nprint(l)", "n=int(input())\r\nm=int(input())\r\n\r\nif n-m==1 or n-m==-1:\r\n print(1)\r\nelse:\r\n i=1\r\n s=0\r\n while(n!=m):\r\n if n>m:\r\n n-=1\r\n s+=i\r\n if n==m:\r\n break\r\n m+=1\r\n s+=i\r\n else:\r\n n+=1 \r\n s+=i\r\n if n==m:\r\n break\r\n m-=1 \r\n s+=i\r\n i+=1\r\n print(s)\r\n", "x=int(input())\r\ny = int(input())\r\nprint((abs(x - y) + 1) ** 2 // 4)", "pos1 = int(input())\npos2 = int(input())\n\n\nclass Solution:\n\n def friendsMeeting(self, pos1, pos2):\n dif = abs(pos2 - pos1)\n d = dif // 2\n if dif % 2 == 0:\n return 2 * self.calcSum(d)\n else:\n return self.calcSum(d) + self.calcSum(d+1)\n\n def calcSum(self, n):\n return int(n * (n + 1) / 2)\n\n\nsol = Solution()\nprint(sol.friendsMeeting(pos1, pos2))\n", "n = abs((int(input())-int(input())))\r\ndef f(x): return x*(x+1)//2\r\nprint(f(n//2)+f(n-(n//2)))\r\n", "a = int(input())\r\nb = int(input())\r\nans = abs(a - b)\r\na = (ans // 2) * (ans // 2 + 1)\r\nif ans % 2 == 1:\r\n a += (ans + 1) // 2\r\nprint(a)\r\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nprint((c+1)**2//4)", "#!/usr/bin/python3\r\n# Встреча друзей, сложность - 800\r\nx1 = int(input())\r\nx2 = int(input())\r\nt = 0; k = 1\r\nfatigue1 = 0; fatigue2 = 0\r\ndelta = x2 - x1 if x2 > x1 else x1 - x2\r\nwhile delta > 0:\r\n if t % 2 == 0:\r\n fatigue1 = fatigue1 + k\r\n else:\r\n fatigue2 = fatigue2 + k\r\n k = k + 1\r\n t = t + 1; delta = delta - 1\r\nprint(fatigue1 + fatigue2)\r\n", "a = int(input())\nb = int(input())\nif b < a:\n b, a = a, b\nm = 0\ndef tiredness(n):\n sum = 0\n for i in range(1, n+1):\n sum += i\n\n return sum\n\ndiff = abs(a - b)\nif diff == 1:\n print(1)\n exit()\nm = diff // 2\nif diff % 2 == 0:\n print(tiredness(abs(a - (a + m))) + tiredness(abs(b - (b - m))))\nelse:\n print(tiredness(abs(a - (a + m))) + tiredness(abs(b - (b - m - 1))))", "a=int(input())\r\nb=int(input())\r\nc=int()\r\nk=0\r\nm=0\r\nif a>b :\r\n c=a-b\r\nelse :\r\n c=b-a\r\nif c%2==0:\r\n c=c//2\r\n for i in range(0,c+1):\r\n k=k+i\r\n for i in range (c,0,-1):\r\n m=m+i\r\nelse:\r\n c=c//2\r\n for i in range(0,c+1):\r\n k=k+i\r\n for i in range (c+1,0,-1):\r\n m=m+i\r\nprint(k+m)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "a = int(input())\nb = int(input())\n\ndis = abs(b-a)\n\nif dis%2 == 0:\n dis //=2\n g = (dis*(dis+1))//2\n print(g*2)\n\nelse:\n dis //=2\n g1 = (dis*(dis+1))//2\n g2 = ((dis+1)*(dis+2))//2\n print(g1+g2)\n", "a = int(input())\nb = int(input())\n\nresul = 0\n\ndif = abs(a-b)\n\ni=0\n\nfor i in range(1, dif//2 + 1):\n resul += 2*i\n\nif dif%2 == 1:\n resul += (i+1);\n\nprint (resul)\n\n \t\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t", "a, b = int(input()), int(input())\r\nlen = abs(abs(a) - abs(b))\r\n\r\nif len == 1:\r\n res = len\r\nelse:\r\n len1 = len // 2\r\n len2 = len - len1\r\n res = (1 + len1) / 2 * len1 + (1 + len2) / 2 * len2\r\n\r\nprint(int(res), end='')\r\n\r\n\r\n", "aa=int(input())\r\nbb=int(input())\r\nt=[aa,bb]\r\nb=max(t)\r\na=min(t)\r\nc=(b+a)//2\r\nca=c-a\r\ncb=b-c\r\ns=((ca*(ca+1))/2)+((cb*(cb+1))/2)\r\nprint(int(s))\r\n", "a = int(input())\nb = int(input())\nc = abs(a-b)\nif c % 2:\n d = (c-1)/2\n print(int(d*(d+1)+d+1))\nelse:\n d = (c)/2\n print(int(d*(d+1)))\n\n", "a=int(input())\r\nb=int(input())\r\nust=0\r\nif(a>b):\r\n s=a-b\r\nelse:\r\n s=b-a\r\nif(s>1):\r\n if(s%2==0):\r\n shagi=s//2\r\n for i in range(1, shagi+1):\r\n ust+=2*i\r\n else:\r\n shagi=s//2+1\r\n for i in range(1, shagi+1):\r\n ust+=2*i\r\n ust-=shagi\r\nelse:\r\n ust=1\r\nprint(ust)\r\n", "n=int(input())\r\nm=int(input())\r\na=abs(m-n)\r\nif(a==1):\r\n\tprint(1)\r\nelse:\r\n\tc=0\r\n\tfor i in range(1,a//2+1):\r\n\t\tc+=i\r\n\tif(a%2==0):\r\n\t\tprint(2*c)\r\n\telse:\r\n\t\tprint(2*c + a//2+1)", "a = int(input())\r\nb = int(input())\r\nprint(int(abs(a-b)/2)*int((1+int(abs(a-b)/2)))+(abs(a-b)%2!=0)*(int(abs(a-b)/2)+1))", "a = int(input())\r\nb = int(input())\r\ns = max(a,b) - min(a,b) \r\nprint(sum([i+1 for i in range(s//2)])*2+((s//2+s%2) if s%2==1 else 0))\r\n", "from math import ceil\r\na = int(input())\r\nb = int(input())\r\n \r\nif a > b:\r\n a, b = b, a\r\n \r\nmid = (a + b) // 2\r\ncounter = 1\r\nfirst = 0\r\nfor i in range(a, b):\r\n first += counter\r\n counter += 1\r\n \r\nsecond = 0\r\ncounter = 1\r\n \r\nfor i in range(min(mid - a, b - mid)):\r\n second += counter\r\n \r\n counter += 1\r\n \r\nsecond *= 2\r\n \r\nif (mid - a) != (b - mid):\r\n second += counter\r\n \r\nprint(min(first, second))", "a= int(input())\r\nb= int(input())\r\n\r\nres= (a+b)//2\r\ncount=0\r\nj=1\r\nif abs(b-a)==0:\r\n print(0)\r\nelif abs(b-a)==1:\r\n print(1)\r\nelse:\r\n if (a+b)%2==0:\r\n for i in range(min(a,b), res):\r\n count+= j\r\n j+=1\r\n print(2*count)\r\n else:\r\n for i in range(min(a,b), res):\r\n count+=j\r\n j+=1\r\n\r\n t=1\r\n for i in range(max(a,b), res, -1):\r\n count+=t\r\n t+=1\r\n print(count)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nt =0\r\nif(d % 2 == 0):\r\n for i in range(1,d//2+1):\r\n t= t + i\r\n m_t= 2 * t\r\nelse:\r\n i = 0\r\n for i in range(1,d//2+1):\r\n t= t + i\r\n m_t= 2 * t + (i+1)\r\nprint(m_t)", "a=int(input())\r\nb=int(input())\r\ndif=a-b\r\nsum=0\r\nif(dif<0):\r\n dif=dif*(-1)\r\nfor i in range(int(dif/2)):\r\n sum=2*(i+1)+sum\r\nif(dif%2!=0):\r\n sum=sum+int(dif/2)+1\r\nprint(sum) \r\n ", "n = int(input())\r\nm = int(input())\r\n \r\ndfr=abs(n-m)+1\r\ns=dfr//2\r\nprint((s+dfr%2)*s)", "# Friends Meeting\na = int(input())\nb = int(input())\nm = (a+b)//2\nd1 = abs(m-a)\nd2 = abs(b-m)\nprint(d1*(d1+1)//2+d2*(d2+1)//2)\n", "a = int(input())\r\nb = int(input())\r\nc = abs(b-a)\r\ne = c//2\r\nd = c%2\r\nprint(e*(e+1)+d*(d+e))", "f1=int(input())\r\nf2=int(input())\r\nd=abs(f2-f1)\r\nd1=d//2\r\nd2=d-d1\r\nn1,n2=d1*(d1+1)//2,d2*(d2+1)//2\r\nprint(n1+n2)\r\n", "import math\n\na= int(input())\nb= int(input())\n\nc=abs(a-b)/2\n\nd=math.floor(c)\ne=math.ceil(c)\n\nf=int(d/2*(1+d))\ng=int(e/2*(1+e))\n\nprint(f+g)\n", "\r\nl = []\r\nl.append(int(input()))\r\nl.append(int(input()))\r\n\r\nl.sort()\r\nn = l[0]\r\nm = l[1]\r\n\r\nt = 1\r\ntot = 0\r\nwhile n != m:\r\n\tn += 1\r\n\ttot += t\r\n\tif n == m:\r\n\t\tprint(tot)\r\n\t\texit()\r\n\t\r\n\tm -= 1\r\n\ttot += t\r\n\tif n == m:\r\n\t\tprint(tot)\r\n\t\texit()\r\n\r\n\tt += 1\r\n", "a=int(input())\r\nb=int(input())\r\ny=(a+b)//2\r\na=abs(y-a)\r\nb=abs(y-b) \r\n#print(b,a)\r\nprint((a*(a+1)//2) + (b)*(b+1)//2)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n a = int(wtf[0])\r\n b = int(wtf[1])\r\n d = abs(a-b)\r\n d1 = d//2\r\n d2 = d//2+d%2\r\n print( (d1**2+d1)//2 + (d2**2+d2)//2 )\r\n", "a = int(input())\r\nb = int(input())\r\nif a > b:\r\n\ta, b = b, a\r\nmid = int((a + b) // 2)\r\nx = mid - a\r\ny = b - mid\r\nprint(int(x * (x + 1)// 2 + (y *(y + 1) // 2)))", "a = int(input())\r\nb = int(input())\r\nlen = abs(a - b)\r\nma = len // 2\r\nmb = len - ma\r\nprint(int(ma * (ma + 1) / 2 + mb * (mb + 1) / 2))", "a=int(input())\r\nb=int(input())\r\nmini=1000000\r\nfor i in range(min(a,b),max(a,b)+1):\r\n mini=min(mini,(((i-min(a,b))*(i-min(a,b)+1))//2)+((max(a,b)-i)*(max(a,b)-i+1))//2)\r\nprint(mini)", "\r\na=int(input())\r\nb=int(input())\r\nk=0\r\nif(a>b):\r\n k=a-b\r\nelse:\r\n k=b-a\r\ni,j=0,0\r\ntotal_iter=0\r\n#import timeit\r\n\r\n#start = timeit.default_timer()\r\n\r\n#Your statements here\r\nfor m in range(1,(k//2)+1):\r\n i+=m\r\n total_iter=m\r\ntotal=2*i\r\nif(k%2!=0):\r\n total+=k-total_iter\r\nprint(total)\r\n#stop = timeit.default_timer()\r\n#print (stop - start)\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\ns = 0\r\nt = 0\r\nfor x in range(d):\r\n if x%2 == 0:\r\n s+=1\r\n t += s\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\nx = abs(b - a) // 2\r\nn = 0\r\nfor k in range(x + 1):\r\n n += 2 * k\r\nif abs(b-a) % 2 == 1:\r\n n += x + 1\r\nprint(n)\r\n", "n=int(input())\r\nm=int(input())\r\nx=abs(m-n)\r\na=x//2\r\nb=x-a\r\nprint(a*(a+1)//2+b*(b+1)//2)", "a=int(input())\nb=int(input())\nn=abs(a-b)\nprint(n//2*(n//2+1) + (n%2)*((n+1)//2))\n", "#print('Hare Krishna')\r\ndef I():\r\n return int(input())\r\ndef IL():\r\n return [int(i) for i in input().split()]\r\ndef IM():\r\n return map(int,input().split())\r\ndef IS():\r\n return input()\r\na=I()\r\nb=I()\r\na,b=min(a,b),max(a,b)\r\ndiff=b-a \r\na=diff//2 \r\nb=diff//2+diff%2 \r\nprint(a*(a+1)//2+b*(b+1)//2)", "a = int(input())\nb = int(input())\n\ndist = abs(a - b)\n\nx = dist // 2\n\nenergy = (x * (x + 1))\n\nif dist % 2 == 1:\n energy += (x + 1)\n\nprint(energy)\n", "a=int(input())\r\nb=int(input())\r\nz=abs(a-b)\r\ntired=tired_a=tired_b=0\r\nif (z%2!=0):\r\n x=z//2\r\n y=z//2+1\r\nelse:\r\n x=z//2\r\n y=z//2\r\nfor i in range(1,x+1):\r\n tired_a=tired_a+i\r\nfor j in range(1,y+1):\r\n tired_b=tired_b+j\r\ntired=tired_a+tired_b\r\nprint(tired)", "a=int(input())\r\nb=int(input())\r\ns=a+b\r\nif s%2==0:\r\n s=s//2\r\n if a<b:\r\n p=s-a\r\n else:\r\n p=s-b\r\n ans=((p)*(p+1))//2\r\n print(ans*2)\r\nelse:\r\n s=s//2\r\n if a<b:\r\n p=s-a\r\n else:\r\n p=s-b\r\n ans = ((p) * (p + 1)) // 2\r\n ans=ans*2\r\n print(ans+p+1)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nx=ceil((a+b)/2)\r\nq=abs(a-x)\r\np=abs(b-x)\r\nprint( (q*(q+1))//2 + (p*(p+1))//2 )", "a = int(input())\r\nb = int(input())\r\nans = 0\r\npointer1 = 1\r\npointer2 = 1\r\ntemp1 = 0\r\ntemp2 = 0\r\nwhile True:\r\n if (a < b):\r\n a += 1\r\n ans += pointer1\r\n pointer1 += 1\r\n if (a == b):\r\n break\r\n \r\n \r\n b -= 1\r\n ans += pointer2\r\n pointer2 += 1\r\n if (a == b):\r\n break\r\n \r\n else:\r\n a -= 1\r\n ans += pointer1\r\n pointer1 += 1\r\n if (a == b):\r\n break\r\n \r\n b += 1\r\n ans += pointer2\r\n pointer2 += 1\r\n if (a == b):\r\n break\r\n \r\nprint(ans)", "x = int(input())\r\ny = int(input())\r\n\r\ndiff = abs(x - y)\r\nsm = 0\r\nk = diff // 2\r\ntiredness = (k * (k + 1))\r\n\r\nif (diff % 2):\r\n tiredness += k + 1\r\n\r\nprint(tiredness)\r\n", "a, b = sorted(int(input()) for _ in range(2))\nn = (b - a) // 2\nres = (n + 1) * n\nif b - a > 2 * n:\n res += n + 1\nprint(res)\n", "# Friends Meeting\r\n# https://codeforces.com/problemset/problem/931/A\r\nimport math\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nif a > b: \r\n t = a # swap a and b\r\n a = b\r\n b = t\r\n# ensures that a <= b\r\n\r\nans = 0\r\nfor i in range(1,1001):\r\n if a == b:\r\n break;\r\n a += 1\r\n ans += i\r\n if a == b:\r\n break\r\n b -= 1\r\n ans += i\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nt=0\r\nc=1\r\nif d%2==0:\r\n m=d//2\r\n while m>0:\r\n t+=c\r\n c+=1\r\n m-=1\r\n print(2*t)\r\nelse:\r\n m=d//2\r\n while m>0:\r\n t+=c\r\n c+=1\r\n m-=1\r\n print(2*t+c)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n\tans=(d//2)*((d//2)+1)\r\nelse:\r\n\tans=(d//2)*((d//2)+1)/2 + (d//2 +1 )*((d//2)+2)/2\r\nprint(int(ans))\r\n'''import math\r\nn,a,b=map(int, input().split())\r\nr=int(math.log2(n))\r\nmid0=n\r\nmid1=n//2\r\nfor i in range(int(math.log2(n))):\r\n\tprint (mid1)\r\n\tif min(a,b)<=mid1 and max(a,b)>=mid1:\r\n\t\t#print (mid1)\r\n\t\tbreak\r\n\telse:\r\n\t\tr-=1\r\n\t\tmid2=mid1\r\n\t\tif min(a,b)<=mid1 and max(a,b)<=mid1:\r\n\t\t\tmid1=mid1//2\r\n\t\telse:\r\n\t\t\tmid1=(mid0+mid1)//2\r\n\t\tmid0=mid2\r\nif r==int(math.log2(n)):\r\n\tprint(\"Final!\")\r\nelse:\r\n\tprint(r)'''", "a=int(input()) ;b=int(input()) \r\nx=abs(a-b) //2\r\ny=abs(a-b)%2\r\nprint(x*(x+1)//2+(x+y) *(x+y+1)//2)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nans = abs(a-b)\r\n\r\nans = ans//2\r\ncount = 0\r\nfor i in range(1, ans+1):\r\n count+=i\r\n\r\nif abs(a-b)%2==0:\r\n \r\n print(count*2)\r\nelse:\r\n print(count*2+ans+1)\r\n\r\n ", "a1 = int(input())\r\nb1 = int(input())\r\n\r\nresult = 0\r\nplus = 1\r\ndiff = abs(a1 - b1)\r\nwhile diff > 0:\r\n result += plus\r\n diff -= 1\r\n if diff == 0:\r\n break\r\n result += plus\r\n diff -= 1\r\n plus += 1\r\n \r\n \r\nprint(result)", "a = int(input())\nb = int(input())\nx = abs(a-b)\nif x%2 == 0:\n ans = (x//2)*(x//2+1)\nelse:\n ans = (x//2)*(x//2+1)+(x//2+1)\nprint(ans)\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nx=0\r\ny=0\r\nif b<a:\r\n for i in range(0,a-c+1):\r\n x=x+i\r\n for n in range(0,c-b+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n \r\nif a<b:\r\n for i in range(0,b-c+1):\r\n x=x+i\r\n for n in range(0,c-a+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n", "a = int(input())\nb = int(input())\nm = (a+b) // 2\ns = 0\nfor i in range(abs(m-a)):\n s += i+1\nfor i in range(abs(b-m)):\n s += i+1\nprint(s)", "a,b = int(input()),int(input())\r\nk=(max(a,b)-min(a,b))//2\r\nh=(max(a,b)-min(a,b))%2\r\nprint((k*(k+1))+h*(k+1))", "a=int(input())\r\nb=int(input())\r\n\r\nsum=a+b\r\nans=0\r\n\r\nif sum%2==0:\r\n half=sum/2\r\n sum=abs(half-a)\r\n for i in range(int(sum+1)):\r\n ans=ans+i\r\n ans=ans*2\r\nelse:\r\n half=sum/2\r\n a=min(a,b)\r\n sum=abs(half-a)\r\n for i in range(int(sum+1)):\r\n ans=ans+i\r\n ans=ans*2\r\n ans=ans+i+1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "x1=int(input())\r\nx2=int(input())\r\nmid=int((x1+x2)/2)\r\nleft=abs(x1-mid)\r\nright=abs(x2-mid)\r\nleft_sum=(left*(left+1))/2\r\nright_sum=(right*(right+1))/2\r\nprint(int(left_sum+right_sum))", "import math\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nd1=math.floor(d/2)\r\nd2=math.ceil(d/2)\r\ntotal= int(d1*(d1+1)/2 + d2*(d2+1)/2)\r\nprint(total)", "from math import ceil as c;d=abs(int(input())-int(input()));print((c(d/2)*(c(d/2)+1))//2+((d//2)*((d//2)+1))//2)", "a = int(input())\r\nb = int(input())\r\nc1 = 1\r\nc2 = 1\r\nn = 0\r\nif(a > b):\r\n storeVar1 = a-b\r\nelse:\r\n storeVar1 = b-a\r\n\r\nquotient = storeVar1 // 2\r\nremainder = storeVar1 % 2\r\nfor x in range(0, quotient):\r\n n = n + c1\r\n c1 += 1\r\nfor y in range(0, quotient+remainder):\r\n n = n + c2\r\n c2 += 1\r\nprint(n)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n n=d//2\r\n s=(n*(n+1))//2\r\n print(2*s)\r\nelse:\r\n n=d//2\r\n s1=(n*(n+1))//2\r\n s2=((d-n)*((d-n)+1))//2\r\n print(s1+s2)\r\n\r\n ", "first = int(input())\nsecond = int(input())\n\ndiff = abs(first - second)\n\nif diff % 2 == 0:\n print((diff//2)*(diff//2 + 1))\nelse:\n print((diff//2)*(diff//2 + 1) + diff//2 + 1)\n", "from sys import stdin\r\n \r\nrd = stdin.readline\r\n\r\na = int(rd())\r\nb = int(rd())\r\n\r\nmoves = abs(b - a)\r\n\r\nif moves & 1:\r\n\r\n print(((moves + 1) // 2) ** 2)\r\n\r\nelse: print((moves // 2) * (moves // 2 + 1))\r\n", "a = int(input())\r\nb = int(input())\r\na_tired = 0\r\nb_tired = 0\r\ntired = 0\r\nwhile (a != b):\r\n if a<b:\r\n a += 1\r\n a_tired +=1\r\n tired+=a_tired\r\n if a == b:\r\n break\r\n else:\r\n b-=1\r\n b_tired +=1\r\n tired+=b_tired\r\n elif a>b:\r\n b += 1\r\n b_tired +=1\r\n tired+=b_tired\r\n if a == b:\r\n break\r\n else:\r\n a-=1\r\n a_tired +=1\r\n tired+=a_tired\r\nprint(tired)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nif (a>b):\r\n dis = (a-b)\r\n# if dis==2:\r\n# ;\r\n if dis%2==1:\r\n dis = (int)(dis/2)\r\n dis = dis*(dis+1) + (dis+1)\r\n else:\r\n dis = (int)(dis/2)\r\n dis = dis*(dis+1)\r\nelse:\r\n dis = b-a\r\n# if dis==2:\r\n# ;\r\n if dis%2==1:\r\n dis = (int)(dis/2)\r\n dis = dis*(dis+1) + (dis+1)\r\n else:\r\n dis = (int)(dis/2)\r\n dis = dis*(dis+1)\r\nprint(dis)", "# *\r\n# * *\r\n# * *\r\n# * * * Author:Aditya Joshi\r\n# * *\r\n# * *\r\na = int(input())\r\nb = int(input())\r\nr = abs(a - b) // 2\r\nr1 = abs(a - b) - r\r\ns = (r * (r + 1)) // 2\r\ns += (r1 * (r1 + 1)) // 2\r\nprint(s)\r\n", "a,b=int(input()),int(input())\r\nc,t,d=abs(a-b),0,0\r\nif c%2!=0:\r\n for i in range(1,(c//2)+1):\r\n t=t+(2*i)\r\n d=d+1\r\n print(t+d+1)\r\nelse:\r\n for i in range(1,(c//2)+1):\r\n t=t+(2*i)\r\n print(t)", "a, = map(int,input().split())\r\nb, = map(int,input().split())\r\nd = abs(a-b)\r\nk = d//2\r\nans = 0\r\nif k*2!=d:\r\n ans += k+1\r\nif k:\r\n ans += (1+k)*k\r\nprint(ans)", "import math\r\nx=int(input())\r\ny=int(input())\r\nt=abs(x-y)\r\nif(t%2==0):\r\n m=math.floor(t/2)\r\n print(m*(m+1))\r\nelse:\r\n p=t//2\r\n q=p*(p+1)\r\n print(q+(p+1))\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\n\r\ndef dis(x):\r\n h = 0\r\n for i in range(1, x+1):\r\n h += i\r\n\r\n return h \r\n\r\nif d % 2 == 0:\r\n print(dis(d//2)*2)\r\nelse:\r\n print(dis(d//2)+dis(d - d//2))\r\n", "a=int(input())\r\nb=int(input())\r\ntmn=0\r\ntmx=0\r\ncmx=0\r\ncmn=0\r\nif(a>b):\r\n max=a\r\n min=b\r\nelse:\r\n max=b\r\n min=a\r\nif(a==b):\r\n t=0\r\nelif(a-b==1 or b-a==1):\r\n t=1\r\nelse:\r\n while True:\r\n max-=1\r\n cmx+=1\r\n tmx+=cmx\r\n if(max==min):\r\n t=tmx+tmn\r\n break\r\n min+=1\r\n cmn+=1\r\n tmn+=cmn\r\n if(max==min):\r\n t=tmx+tmn\r\n break\r\nprint(t)", "def tiredness(n):\r\n return n*(n+1)//2\r\n\r\na = int(input())\r\nb = int(input())\r\nx = (a+b)//2\r\nprint(tiredness(abs(x-a)) + tiredness((abs(x-b))))\r\n", "n=int(input())\r\nm=int(input())\r\nmid=(n+m)//2\r\na=abs(mid-n)\r\nb=abs(m-mid)\r\nsum=0\r\nfor i in range(1,b+1):\r\n sum+=i\r\nfor i in range(1,a+1):\r\n sum+=i\r\nprint(sum)", "a = int(input())\nb = int(input())\nn=abs(a-b)//2\ntiredness=0\nif (a-b)%2==0:\n tiredness=2*(1+n)*n/2\nelse:\n tiredness=2*(1+n)*n/2+n+1\nprint(int(tiredness))\n \n \n \n", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n k=a-b\r\nelse:\r\n k=b-a\r\nif k%2==0:\r\n j=k//2\r\n x=0\r\n for v in range(0,j+1):\r\n x=x+v\r\n y=0\r\n for v in range(j,0,-1):\r\n y=y+v\r\n print(x+y)\r\nelse:\r\n j=(k//2)\r\n x=0\r\n for s in range(0,j+1):\r\n x=x+s\r\n y=0\r\n for s in range(j+1,0,-1):\r\n y=y+s\r\n print(x+y)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def tabadil(x):\r\n su = 0\r\n for i in range(1,x+1):\r\n su += i\r\n return su\r\n\r\na = int(input())\r\nb = int(input())\r\nl = abs(a-b)\r\nif l == 1:\r\n print(1)\r\nelse:\r\n if l%2 == 0:\r\n print(tabadil(l//2)*2)\r\n else:\r\n print(tabadil(l//2 + 1) + tabadil(l//2))", "a = int(input())\r\nb = int(input())\r\n\r\nid_end = round((a + b)/2)\r\n\r\nhunger_a = 0\r\nhunger_b = 0\r\n\r\nif a < b:\r\n\ti = 0\r\n\twhile a != id_end:\r\n\t\ti += 1\r\n\t\thunger_a += i\r\n\t\ta += 1\r\n\ti = 0\r\n\twhile b != id_end:\r\n\t\ti += 1\r\n\t\thunger_b += i\r\n\t\tb -= 1\r\nelse:\r\n\ti = 0\r\n\twhile a != id_end:\r\n\t\ti += 1\r\n\t\thunger_a += i\r\n\t\ta -= 1\r\n\ti = 0\r\n\twhile b != id_end:\r\n\t\ti += 1\r\n\t\thunger_b += i\r\n\t\tb += 1\r\n\r\nprint(hunger_a + hunger_b)", "import sys \r\n\r\nI=sys.stdin.readline\r\n\r\na=int(I())\r\nb=int(I())\r\n\r\ntired=0\r\na_tired=0\r\nb_tired=0\r\nif a>b:\r\n\tflag=0\r\nelse:\r\n\tflag=1\r\nwhile a!=b:\r\n\tif a>b:\r\n\t\tif flag==0:\r\n\t\t\ta_tired+=1\r\n\t\t\ttired+=a_tired\r\n\t\t\ta-=1\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tb_tired+=1\r\n\t\t\ttired+=b_tired\r\n\t\t\tb+=1\r\n\t\t\tflag=0\r\n\r\n\telse:\r\n\t\tif flag==0:\r\n\t\t\ta_tired+=1\r\n\t\t\ttired+=a_tired\r\n\t\t\ta+=1\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tb_tired+=1\r\n\t\t\ttired+=b_tired\r\n\t\t\tb-=1\r\n\t\t\tflag=0\r\nprint(tired)\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n a, b = [int(input()) for _ in range(2)]\r\n a, b = sorted((a, b))\r\n\r\n def cost(x):\r\n ans = 0\r\n A = [a, 1]\r\n B = [b, 1]\r\n\r\n while A[0] != B[0]:\r\n if A[1] < B[1]:\r\n A[0] += 1\r\n ans += A[1]\r\n A[1] += 1\r\n else:\r\n B[0] -= 1\r\n ans += B[1]\r\n B[1] += 1\r\n\r\n return ans\r\n\r\n print(min(cost(x) for x in range(a, b + 1)))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b = int(input()), int(input())\r\nif a > b:\r\n a, b = b, a\r\nans, cur = 0, 1\r\nwhile b - a >= 2:\r\n ans += cur * 2\r\n cur += 1\r\n b -= 1\r\n a += 1\r\nif a != b:\r\n ans += cur\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nd=max(a,b)-min(a,b)\r\nif d%2==0:\r\n print(int((d/2)*((d/2)+1)))\r\nelse :\r\n print(int(((d+1)/2)**2))", "a=int(input());b=int(input());c=abs(a-b)//2;d=abs(a-b)-c;print(c*(c+1)//2+d*(d+1)//2)", "c1,c2=1,1\r\nk=1\r\ns=0\r\na=int(input())\r\nb=int(input())\r\nfor i in range(abs(a-b)):\r\n if k%2==1:\r\n s+=c1\r\n c1+=1\r\n else:\r\n s+=c2\r\n c2+=1\r\n k+=1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nd = c // 2\r\ne = c - d\r\nk = 0\r\nfor i in range(1, d+1):\r\n k = k + i\r\nfor j in range(1, e+1):\r\n k = k + j\r\nprint(k)", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nif (d%2==0):\r\n\tprint(d//2*(d//2+1))\r\nelse:\r\n\tprint(d//2*(d//2+1)+d//2+1)", "# cook your dish here\r\nn1 = int(input())\r\nn2 = int(input())\r\npower = 0\r\ntotal = 0\r\nif (n1 > n2):\r\n temp = n1\r\n n1 = n2\r\n n2 = temp\r\nwhile (n2 - n1 > 1):\r\n power += 1\r\n n1 += 1\r\n n2 -= 1\r\n total += 2 * power\r\nif (n2 - n1 == 1):\r\n power += 1\r\n total += power\r\nprint(total)", "n = int(input())\r\nm = int(input())\r\na = (n+m)//2\r\nprint((abs(a-n)*(abs(a-n)+1))//2+(abs(a-m)*(abs(a-m)+1))//2)\r\n", "a=int(input())\r\nb=int(input())\r\nres=(a+b)//2\r\nfin1=abs(res-a)*(abs(res-a)+1)//2\r\nfin2=abs(res-b)*(abs(res-b)+1)//2\r\nprint(fin1+fin2)\r\n", "a = int(input())\r\nb = int(input())\r\nb, a = max(a, b), min(a, b)\r\nif (b - a) % 2 == 0:\r\n print((1 + (b - a) // 2) * (b - a) // 2) \r\nelse:\r\n print((1 + (b - a + 1) // 2) * ((b - a + 1) // 2) // 2 + (1 + (b - a - 1) // 2) * ((b - a - 1) // 2) // 2)", "a = int(input())\r\nb = int(input())\r\n\r\nm = (a+b)//2\r\n\r\nda = abs(m-a)\r\ndb = abs(m-b)\r\n\r\nans = (da*(da+1))//2 + (db*(db+1))//2\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nlen = a-b\r\nif len<0:\r\n len = -1*len\r\ncountA = len//2\r\ncountB = len - len//2\r\nres1 = countA*(countA+1)//2\r\nres2 = countB*(countB+1)//2\r\nprint(res1+res2)", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nn, r = divmod(d, 2)\r\n\r\nres = (n+1)*(n+1) if r else (n+1)*n\r\n\r\nprint(res)", "print((abs(int(input())-int(input()))+1)**2//4)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nk=abs(b-a)\r\nn=k//2\r\nans=0\r\nif k%2==0:\r\n\tans=n*(n+1)\r\n\tprint(ans)\r\nelse:\r\n\tans=n*(n+1)\r\n\tans+=ceil(k/2)\r\n\tprint(ans)", "import math\r\na=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif(d<=2):\r\n print(d)\r\nelse:\r\n x=math.ceil(d/2)\r\n y=d-x\r\n g=(x*(x+1))//2+(y*(y+1))//2\r\n print(g)\r\n", "a = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\ns = 0\r\nif a > b:\r\n a,b = b,a\r\nfor i in range(1,(c - a)+1):s+=i\r\nfor i in range(1,(b - c)+1):s+=i\r\nprint(s)", "n1 = int(input())\r\nn2 = int(input())\r\nsub = abs(n1 - n2)\r\nc = 1\r\ns = 0\r\nfor i in range(sub//2):\r\n s += c\r\n c += 1\r\nc = 1\r\nfor i in range(sub - sub//2):\r\n s += c\r\n c += 1\r\nprint(s)", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\na=abs(a-c)\r\nb=abs(b-c)\r\nprint(((1+a)*a)//2+(1+b)*b//2)\r\n", "def main():\r\n a = int(input())\r\n b = int(input())\r\n\r\n diff = abs(a-b)\r\n amount = diff // 2\r\n parity = diff % 2\r\n\r\n print((1 + amount) * amount + parity * (amount + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\nb = int(input())\nA = a \nB = b\nwhile a != b:\n if a > b:\n b += 1 \n if a == b:\n break\n else:\n a -= 1 \n if a < b:\n a += 1 \n if a == b:\n break\n else:\n b -= 1\nexhaustiona = 0\nexhaustionb = 0\nfor x in range(abs(A-a)):\n exhaustiona += (x + 1)\nfor y in range(abs(B-b)):\n exhaustionb += (y + 1)\ntotal_exhaustion = exhaustiona + exhaustionb\nprint(total_exhaustion)\n\n \n \n\n\n\n\n\n", "\r\nx1=int(input())\r\n\r\nx2=int(input())\r\n\r\nm1=abs(x1-x2)//2\r\n\r\nm2=abs(x1-x2)-m1\r\n\r\nprint(int(m1*(m1+1)/2 + m2*(m2+1)/2))\r\n", "first_friend_position = int(input())\nsecond_friend_position = int(input())\n\ndistance = abs(first_friend_position - second_friend_position)\ntotal_tiredness = 0\n\nif distance % 2 == 0:\n for i in range(1, distance // 2 + 1):\n total_tiredness += i * 2\n print(total_tiredness)\nelse:\n just_a_list = []\n for i in range(1, distance // 2 + 2):\n just_a_list.append(i * 2)\n\n print(int(sum(just_a_list) - just_a_list[-1] / 2))\n\n\n\n\n", "import math\r\na=int(input())\r\nb=int(input())\r\nc=(b+a)/2\r\nv=math.floor(c)\r\nm=abs(v-a)\r\nn=abs(b-v)\r\nsum=(((m*(m+1))//2)+(n*(n+1)//2))\r\nprint(sum)", "from math import ceil\r\nn=int(input())\r\nk=int(input())\r\na=abs(n-k)\r\nc=0\r\nif a==1:\r\n\tprint(1)\r\nelif a%2==0:\r\n\tfor i in range(1,int(a/2)+1):\r\n\t\tc+=i*2\r\n\tprint(c)\t\t\r\nelse:\r\n\tfor i in range (1,int(a/2)+1):\r\n\t\tc+=i*2\t\r\n\tprint(c+ceil(a/2))", "import math\r\nn = int(input())\r\nm = int(input())\r\nj = abs(n-m)\r\nans = j/2\r\nans1 = j - j/2\r\nans2 = ans*(ans+1)/2\r\nans3 = ans1*(ans+1)/2\r\nprint(math.ceil(ans2+ans3))\r\n", "a=int(input())\r\nb=int(input())\r\nmidPoint=(b+a)//2\r\nstepa=abs(midPoint-a)\r\nstepb=abs(b-midPoint)\r\nsuma=(stepa*(stepa+1))//2\r\nsumb=(stepb*(stepb+1))//2\r\nprint(suma+sumb)\r\n", "# cf 931 A 800\nn = int(input())\nm = int(input())\n\ndiff = abs(n - m)\nt1 = diff // 2\nt2 = diff - t1\nt1 = t1 * (t1 + 1) // 2\nt2 = t2 * (t2 + 1) // 2\nprint(t1 + t2)\n\n", "a = int(input())\nb = int(input())\n\npoint = int(a/b)\n\ntired = 0\n\ni = 1\nj = 1\n\nwhile a != b:\n if a < b:\n if i < j:\n a += 1\n tired += i\n i += 1\n else:\n b -= 1\n tired += j\n j += 1\n else:\n if i < j:\n a -= 1\n tired += i\n i += 1\n else:\n b += 1\n tired += j\n j += 1\nprint(tired)\n", "a = int(input())\nb = int(input())\nif abs(a - b)%2 == 0:\n\tdif = abs(a-b)//2\n\tprint((dif)*(dif+1))\nelse:\n\tdif = abs(a-b)//2\n\tprint((dif)*(dif+1) + dif + 1)\n", "n=int(input())\r\nm=int(input())\r\nt=0\r\nw=(abs(m-n)-1)//2\r\nt+=w*(w+1)\r\nif (m-n-1)%2!=0:\r\n t+=(w+1)*2\r\nelse:\r\n t+=(w+1)\r\nprint(t)\r\n", "a = int(input())\nb = int(input())\n\ndiff = abs(a - b)\nn1 = diff // 2\nn2 = n1 + 1\nif diff % 2 == 0:\n print((1 + n1) * n1)\nelse:\n print((1 + n1) * n1 // 2+ (1 + n2) * n2 // 2)", "a, b = int(input()), int(input())\r\nc = (a+b)//2\r\nd = 0\r\ne, f = abs(a-c), abs(b-c)\r\nfor i in range(1, e+1):\r\n d += i\r\nfor i in range(1, f+1):\r\n d += i\r\nprint(d)", "def addnums(num):\n\treturn num*(num+1)//2\n\na = int(input())\nb = int(input())\n\ndiff = abs(a-b)\n\nprint(addnums(diff//2)+addnums(diff - diff//2))", "a = int(input())\r\nb = int(input())\r\nS = abs(a - b)\r\nC = S // 2\r\nD = S % 2\r\nSumm = int(((1 + C) / 2) * C)\r\nprint(Summ * 2 + (C + D) * D)\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nd=0\r\ng=0\r\ne=1\r\nf=1\r\nif (a-b==1)or(b-a==1):\r\n print(1)\r\nelse :\r\n if (a<b):\r\n for i in range (a,c):\r\n d=d+e\r\n e=e+1\r\n for j in range (c,b):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n else :\r\n for i in range (b,c):\r\n d=d+e\r\n e=e+1\r\n for j in range (c,a):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\n\r\nif d % 2 == 0:\r\n x = d // 2 * (d // 2 + 1)\r\nelse:\r\n x = d // 2 * (d // 2 + 2) + 1\r\n\r\nprint(x)", "import sys\r\n\r\ndef main():\r\n a, b = map(int, sys.stdin.read().strip().split())\r\n d = abs(b - a)\r\n return (1 + d//2)*(d//2 + d%2)\r\n\r\n \r\nprint(main())\r\n", "a = int(input())\r\nb = int(input())\r\n\r\ndistance = abs(a - b)\r\nt = 0 #total tiredness\r\n\r\nfor i in range(distance // 2):\r\n t += 2 * (i + 1)\r\n\r\nif distance % 2 == 1:\r\n t += (distance // 2) + 1\r\n\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\npasos = 0\r\npuntodellegada = abs(a - b)\r\npasos = ((puntodellegada/2) * (puntodellegada/2) + (puntodellegada/2))\r\nprint(round(pasos))", "x1 = int(input())\r\nx2 = int(input())\r\n\r\nd = abs(x1 - x2)\r\n\r\nbase = d // 2\r\nrem = d % 2\r\n\r\nans = base * (base + 1)\r\nif rem:\r\n ans += base + 1\r\nprint(ans) ", "a = int(input())\r\nb = int(input())\r\ntbc = (a+b)//2\r\nprint(((abs(a-tbc)+1)*(abs(a-tbc)))//2+((abs(b-tbc)+1)*(abs(b-tbc)))//2)", "def solution(x1,x2):\r\n d=abs(x1-x2)\r\n c1=int(d/2)\r\n c2=int(d/2)+d%2\r\n return int((c1*(c1+1)+c2*(c2+1))/2)\r\ndef answer():\r\n x1 = int(input())\r\n x2 = int(input())\r\n print(solution(x1,x2))\r\nanswer()", "def dist(x, y):\r\n return abs(x - y)\r\n\r\ndef tired(x):\r\n return x * (x + 1) // 2\r\n\r\ndyn_sum = [1000000000 for i in range(1000)]\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\n\r\nfor i in range(1, 1001):\r\n dyn_sum[i - 1] = tired(dist(a, i)) + tired(dist(i, b))\r\n\r\nprint(min(dyn_sum))\r\n", "a,b=int(input()),int(input())\r\nprint(sum(range(abs(a-(a+b)//2)+1))+sum(range(abs(b-(a+b)//2)+1)))", "a=int(input())\r\nb=int(input())\r\nx=(a+b)//2\r\nt=0\r\nif a<b:\r\n for i in range(1,x+1-a):\r\n t=t+i\r\n for j in range(1,b-x+1):\r\n t=t+j\r\nelse:\r\n for i in range(1,a+1-x):\r\n t=t+i\r\n for j in range(1,x+1-b):\r\n t=t+j\r\nprint(t)\r\n", "n = abs(int(input()) - int(input()))\nh = n // 2\nprint((h * (h + 1)) + [0, 0 - -n // 2][n % 2 == 1])\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nd=(c//2)*((c//2)+1)+(c%2)*((c//2)+1)\r\nprint(d)\r\n", "l = int(input())\r\nr = int(input())\r\nn = abs(r-l)\r\nx = n//2\r\ny = n - x\r\nprint(x * (x+1)//2 + y * (y+1)//2)", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nA=int(input())\r\nB=int(input())\r\nX=abs(A-B)\r\nans=0\r\nif X%2==0:\r\n\tX=int(X/2)\r\n\tprint((X*(X+1)))\r\nelse:\r\n\tX=int(X/2)\r\n\tprint(X*(X+1)+X+1)\r\n", "a=int(input())\r\nb=int(input())\r\nd=max(a,b)-min(a,b)\r\nm=int(d/2)\r\nif d%2==0:\r\n\tprint(int((2)*((m*(m+1))/2)))\r\nelse:\r\n\tprint(int((2)*((m*(m+1))/2))+m+1)", "n = abs(int(input()) - int(input()))\r\n\r\nprint(((n + 1) // 2) * ((n + 2) // 2))", "a = int(input())\r\nb = int(input())\r\nc = max(a,b) - min(a,b)\r\nd = 0\r\ni = 0\r\nb = []\r\nwhile d < c:\r\n d += 1\r\n if len(b) % 2 == 0:\r\n i += 1\r\n b.append(i)\r\nprint(sum(b))", "a = int(input())\r\nb = int(input()) \r\nd = abs(a-b)\r\nh = d // 2\r\nif d%2 == 0:\r\n print(h*(h+1)) # (1+2+...+h)*2 = h(h+1)/2 * 2 = h(h+1)\r\nelse:\r\n print((h+1)*(h+1)) # (1+2+...+h) + (1+2+...+h+h+1)\r\n", "a=int(input()) \r\nb=int(input()) \r\ns=abs(a-b)\r\nif(s%2==0):\r\n s=s//2\r\n print(s*(s+1))\r\nelse:\r\n s=s//2\r\n print((s+1)**2)", "x = int(input())\r\ny = int(input())\r\ns = int((y-x)/2)\r\nif y>x:\r\n\ta = y\r\n\tb = x\r\nelse:\r\n\ta = x\r\n\tb = y\r\n\r\nif (a-b)%2 == 1:\r\n\ts = int((a-b+1)/2)\r\n\tsum1 = int(s*(s-1)/2)\r\n\tsum2 = int(s*(s+1)/2)\r\n\tprint(sum1+sum2)\r\nelse:\r\n\ts = int((a - b)/2)\r\n\tsum1 = int(s*(s+1))\r\n\tprint(sum1)", "a = int(input())\r\nb = int(input())\r\nmid = (a + b) // 2\r\nprint((abs(mid - a) * (abs(mid - a) + 1) // 2) + (abs(mid - b) * (abs(mid - b) + 1) // 2))", "fa = int(input())\r\nfb = int(input())\r\n\r\nmid = (fa+fb)//2\r\n\r\ncntA = abs(fa-mid)\r\ncntB = abs(fb-mid)\r\n\r\ncnt = 1\r\nsuA = 0\r\nfor i in range(cntA):\r\n suA+=cnt\r\n cnt+=1\r\ncnt = 1\r\nsub = 0\r\nfor i in range(cntB):\r\n sub+=cnt\r\n cnt+=1\r\n\r\nprint(suA+sub)", "a=int(input())\r\nb=int(input())\r\nprint((abs(a-b)+1)**2//4)\r\n", "a=int(input())\r\nb=int(input())\r\nr=abs(b-a)\r\nr1=r//2\r\nr2=r-(r1)\r\nsum1=0\r\nfor i in range(1,r1+1):\r\n sum1=sum1+i\r\nfor i in range(1,r2+1):\r\n sum1=sum1+i\r\nprint(sum1)\r\n", "a, b = int(input()), int(input())\nmi, ma = min(a, b), max(a, b)\nmeet = (mi + ma) // 2\nprint(sum(list(range(meet + 1 - mi))) + sum(list(range(ma + 1 - meet))))\n", "def cost(a, b):\r\n n = abs(a-b)\r\n return (n*(n+1))//2\r\n\r\na = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\nprint(cost(a, c) + cost(c, b))\r\n", "def f(n):\r\n return n * (n + 1) // 2\r\na, b = int(input()), int(input())\r\nif abs(a - b) % 2 == 0: print(f(abs(a - b) // 2) * 2)\r\nelse: print(f(abs(a - b) // 2) + f(abs(a - b) // 2 + 1))", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read_int()\n\tb=read_int()\n\tm=(a+b)//2\n\tdef f(x):\n\t\treturn x*(x+1)//2\n\tprint(f(abs(m-a))+f(abs(m-b)))\n\nsolve()\n", "a,b=[int(input())for _ in[0,0]]\r\nx=abs(b-a);y=x//2\r\nprint(y*(y+1)-(-x//2)*(x%2))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif(d%2==0):\r\n m,n=d//2,d//2\r\nelse:\r\n m,n=d//2+1,d//2\r\nprint((m*(m+1)//2)+(n*(n+1)//2))\r\n \r\n", "d = abs(int(input()) - int(input()))\r\na, b = (d + 1) // 2, d // 2\r\nprint((a * (a + 1) + b * (b + 1)) // 2)\r\n", "a = int(input())\r\nb = int(input())\r\nc = a - b\r\nd = int(abs(c))\r\nk = d//2\r\nif d%2==0:\r\n print(int(d*(d//2+1)//2))\r\nelse:\r\n print(int(k*(k+1)//2) + int((k+1)*(k+2)//2))\r\n", "# LUOGU_RID: 101738502\na, b = map(int, open(0).read().split())\r\nt = abs(a - b)\r\nx = t // 2\r\ny = t - x\r\nprint(x * (x + 1) // 2 + y * (y + 1) // 2)", "import math\r\na=int(input())\r\nb=int(input())\r\nif abs(b-a)==1:\r\n\tprint(1)\r\n\texit(0)\r\n\t\r\nif (a+b)%2==0:\r\n\tm=(a+b)//2\r\n\tn=abs(a-m) \r\n\tres=n*(n+1)\r\n\tprint(res)\r\nelse:\r\n\tm=(a+b)//2\r\n\tif a<b:\r\n\t\tn=abs(a-m)\r\n\telse:\r\n\t\tn=abs(b-m)\r\n\tres=n*(n+1)//2+(n+1)*(n+2)//2 \r\n\tprint(res)\r\n\t\r\n\t\t", "a = int(input())\nb = int(input())\nS = abs(a - b)\nC = S // 2\nD = S % 2\nSumm = int(((1 + C) / 2) * C)\nprint(Summ * 2 + (C + D) * D)# 1685366619.7983105", "f = lambda x: (x * (x + 1)) // 2\r\na, b = sorted([int(input()), int(input())])\r\nres = float('inf')\r\nfor c in range(a, b + 1):\r\n res = min(res, f(c - a) + f(b - c))\r\nprint(res)", "n= int(input())\r\nm = int(input())\r\n\r\nprint((abs(n - m) + 1) ** 2 // 4)\r\n", "def sum(n):\r\n return (n / 2) * (1 + n)\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nc = abs(a - b)\r\nif (c % 2 == 1):\r\n print(int(2 * sum(int(c/2)) + int(c/2 +1) ))\r\nelse:\r\n print(int(2 * sum(int(c/2))))\r\n", "a=int(input())\r\nb=int(input())\r\np=abs(a-b)\r\nx,y=p//2,p-(p//2)\r\nq,u=0,0\r\nfor i in range(1,x+1):\r\n q+=i\r\nfor i in range(1,y+1):\r\n u+=i\r\nprint(q+u)", "a = int(input())\r\nb = int(input())\r\nx = abs(a-b)\r\np = x//2\r\nif x % 2 == 1: print((p+1) ** 2)\r\nelif x % 2 == 0: print(p * (p+1))", "def sumOneToN(n):\r\n return int(n*(n+1)/2)\r\n\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n d = abs(a-b)\r\n if d & 1 == 0:\r\n print(2*sumOneToN(d/2))\r\n else:\r\n d -= 1\r\n print(sumOneToN(d/2) + sumOneToN(d/2 + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input());b = int(input())\r\na = abs(a - b)\r\nprint( (a // 2 * (a // 2 + 1) // 2) + ((a + 1) // 2 * ((a + 1) // 2 + 1) // 2))\r\n", "a = int(input())\r\nb = int(input())\r\nd = (a + b) // 2\r\na1 = abs(a - d)\r\nb1 = abs(b - d)\r\nk = 0\r\nfor i in range(1, a1 + 1):\r\n k += i\r\nfor i in range(1, b1 + 1):\r\n k += i\r\nprint(k)", "a=int(input())\nb=int(input())\ny=abs(a-b)\ncount=0\nz=0\nif(y%2==0):\n\tfor i in range(1,(y//2)+1):\n\t\tcount=count+i\n\tcount=2*count\nelse:\n\tfor i in range(1,(y//2)+1):\n\t\tcount=count+i\n\t\tz=i\n\tcount=count*2\n\tcount=count+z+1\nprint(count)\n\n", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nt=0\r\nif x==1:\r\n t=1\r\nelse:\r\n for i in range(1,(x//2)+1):\r\n t=t+i*2\r\n if x%2!=0:\r\n t=t+i+1\r\nprint(t)", "d = abs(int(input()) - int(input()))\r\nprint(d // 2 * (d // 2 + 1) + ((d + 1) // 2 if d & 1 else 0))", "a=int(input())\r\nb=int(input())\r\nt=0\r\nx=(a+b)//2\r\nif b>a:\r\n for i in range(1,x+1-a):\r\n t=t+i\r\n for j in range(1,b-x+1):\r\n t=t+j\r\n print(t)\r\nelse:\r\n for i in range(1,x+1-b):\r\n t=t+i\r\n for j in range(1,a-x+1):\r\n t=t+j\r\n print(t)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na = int(input())\r\nb = int(input())\r\nf = abs(a - b) // 2\r\ns = (abs(a - b) + 1) // 2\r\nprint(f * (f + 1) // 2 + s * (s + 1) // 2)", "a = int(input())\r\nb = int(input())\r\ngap = abs(a - b)\r\nn = gap//2\r\nm = gap - n\r\nprint((n*(n+1)//2) + (m*(m+1)//2))", "a=int(input())\nb=int(input())\nn=abs(b-a)\nif not n%2:\n\tn=n//2\n\tprint(n*(n+1))\nelse:\n\tn//=2\n\tprint(n*(n+1)+(n+1))", "a = int(input())\nb = int(input())\nmid = (a+b)//2\nadist = abs(mid-a)\nbdist = abs(mid-b)\ntire = ((adist+1) * adist // 2) + ((bdist+1) * bdist // 2)\nprint(tire)", "f1 = int(input())\nf2 = int(input())\n\ncountMaior = 0\ncountMenor = 0\niMenor = 0\niMaior = 0\n\nif(f1 > f2):\n maior = f1\n menor = f2\nelse:\n maior = f2\n menor = f1\n\nwhile(menor != maior):\n if(countMaior > countMenor):\n menor += 1\n iMenor += 1\n countMenor += iMenor\n else:\n maior -= 1\n iMaior += 1\n countMaior += iMaior\n\nprint(countMaior + countMenor)\n\t\t\t\t \t\t \t \t \t \t\t\t \t\t\t \t \t\t\t", "a = int(input())\r\nb = int(input())\r\nlength = abs(a - b)\r\nd = (length//2)*((length//2)+1)+(length%2)*((length//2)+1)\r\nprint(d)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\na,b = min(a,b),max(a,b)\r\n\r\n\r\ns = (a+b)//2\r\nd = (a+b)%2\r\n\r\nx=sum(range(s-a+1))\r\ny=sum(range(b-s+1))\r\nprint(x+y)", "a = int(input())\r\nb = int(input())\r\nx = 0\r\nif (a - b) % 2 >= 1:\r\n x = (a + b) // 2 + 1\r\nelse:\r\n x = (a + b) // 2\r\nmoo = abs(a - x) * (abs(a - x) + 1) // 2\r\npor = abs(b - x) * (abs(b - x) + 1) // 2\r\nprint(moo + por)", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nif c==1:\r\n print(1)\r\nelif c%2==0:\r\n d=c//2\r\n d=(d*(d+1))//2\r\n print(d*2)\r\nelse:\r\n d=c//2\r\n e=(c//2)+1\r\n d=(d*(d+1))//2\r\n e=(e*(e+1))//2\r\n print(d+e)", "a = int(input())\nb = int(input())\n\nmiddle = (a + b) // 2\n\ntiredness = 0\nfor i in range(abs(a - middle)):\n tiredness += (i + 1)\nfor i in range(abs(b - middle)):\n tiredness += (i + 1)\nprint(tiredness)\n", "friend1_location = int(input())\nfriend2_location = int(input())\nmoves = abs(friend2_location - friend1_location) // 2\nprint(2 * (moves + 1) * moves // 2 + (friend2_location - friend1_location) % 2 * (moves + 1))", "qi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn=qi()\r\nm=qi()\r\nprint(sum(range(1,abs(m-n)//2+1))+sum(range(1,(abs(m-n)-(abs(m-n)//2))+1)))", "n = abs(int(input()) - int(input())) - 1\r\na = 2\r\nb = -2*n - 2\r\nc = n**2 + 3*n + 2\r\ne = (-b) // (2*a)\r\nif e <= 0:\r\n e = 1\r\nr = (a*(e**2) + b*e + c) // 2\r\nprint(r)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-01 21:48:12\nLastEditTime: 2021-12-01 21:53:33\nDescription: Friends Meeting\nFilePath: CF931A.py\n'''\n\n\ndef func():\n a, b = int(input()), int(input())\n dis1 = abs(a - b) // 2\n dis2 = abs(a - b) - dis1\n print((1 + dis1) * dis1 // 2 + (1 + dis2) * dis2 // 2)\n\n\nif __name__ == '__main__':\n func()\n", "boy1 = int(input())\r\nboy2 = int(input())\r\ndistance = abs(boy1 - boy2)\r\nremainder = distance % 2\r\nif remainder == 0:\r\n distance1 = distance // 2 + 1\r\n distance2added = 0\r\n mySum = 0\r\n for i in range(1, distance1):\r\n mySum += i\r\n totalSum = mySum * 2\r\n print(totalSum)\r\nelif remainder == 1:\r\n distance1 = distance // 2 + 1\r\n distance2added = 1\r\n mySum = 0\r\n for i in range(1, distance1):\r\n mySum += i\r\n totalSum = mySum * 2 + distance1\r\n print(totalSum)\r\n", "a=int(input())\r\nb=int(input())\r\nx=abs(a-b)\r\nt=0\r\nfor i in range(x//2):\r\n i+=1\r\n t=t+(1*i)\r\nt=2*t\r\nif x%2==0:\r\n print(t)\r\nelse:\r\n print(t+(x//2)+1)\r\n", "f1 = int(input())\r\nf2 = int(input())\r\n\r\ndis = abs(f1 - f2)\r\nmd = dis//2\r\nif dis % 2 == 0:\r\n ans = (md * (md+1))\r\n\r\nelse:\r\n ans = (md * (md+1)) // 2 + ((md+1) * (md+2)) // 2\r\n\r\n\r\nprint(ans)\r\n", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nr=0\r\nif(c%2!=0):\r\n c+=1\r\n r=1\r\nn=c//2\r\nf=n*(n+1)\r\nif(r==1):\r\n f-=n\r\nprint(f)\r\n", "a=int(input())\r\nb=int(input())\r\nc=(abs(a-b)+1)\r\nprint(c**2//4)\r\n", "import math\n\ndef not_factorial(x):\n result = x \n for i in reversed(range(x)):\n result += i\n return result\n\n\na = int(input())\nb = int(input())\n\ndistance = abs(a - b)\n\na =not_factorial(math.floor(distance / 2))\nb =not_factorial(math.ceil(distance / 2))\n\nprint(a+b)\n\n\n\n\n\n\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nd=0\r\ne=1\r\nif(a<c):\r\n for i in range(a,c):\r\n d=d+e\r\n e=e+1\r\nelse:\r\n for i in range(c,a):\r\n d=d+e\r\n e=e+1\r\ne=1\r\nif(b<c):\r\n for i in range(b,c):\r\n d=d+e\r\n e=e+1\r\nelse:\r\n for i in range(c,b):\r\n d=d+e\r\n e=e+1\r\nprint(d)", "# https://codeforces.com/problemset/problem/931/A\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nx = abs(a - b) // 2\r\n\r\nif abs(a - b) % 2 == 0:\r\n print(x * (x + 1))\r\nelse:\r\n print(x * (x + 1) + x + 1)\r\n", "a=int(input());b=int(input())\r\nA=abs(a-(a+b)//2);B=abs(b-(a+b)//2)\r\nprint(A*(A+1)//2+B*(B+1)//2)", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve1():\r\n a, b = [int(input()) for _ in range(2)]\r\n a, b = sorted((a, b))\r\n\r\n def cost(x):\r\n ans = 0\r\n A = [a, 1]\r\n B = [b, 1]\r\n\r\n while A[0] != B[0]:\r\n if A[1] < B[1]:\r\n A[0] += 1\r\n ans += A[1]\r\n A[1] += 1\r\n else:\r\n B[0] -= 1\r\n ans += B[1]\r\n B[1] += 1\r\n\r\n return ans\r\n\r\n print(cost((a + b) // 2))\r\n\r\ndef solve():\r\n a, b = [int(input()) for _ in range(2)]\r\n x = (a + b) // 2\r\n count = lambda x: x * (x + 1) // 2\r\n print(count(abs(x - a)) + count(abs(x - b)))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x1 = int(input().strip())\nx2 = int(input().strip())\n\nd = abs(x1-x2)\n\nn = d//2\nrem = d%2\n\nresult = (1+n) * n\n\nresult += rem*(n+1)\nprint(result)\n", "def sum_upto(n):\r\n\tx = 0\r\n\tfor i in range(0,n+1):\r\n\t\tx += i\r\n\treturn x\t\r\na = int(input())\r\nb = int(input())\r\nx = (a + b)//2\r\nprint(sum_upto(abs(x - a)) + sum_upto(abs(x - b)))", "a=int(input())\r\nb=int(input())\r\nsum=0\r\nc=(abs(a-b))//2\r\nif c==0:\r\n print(1)\r\nelif abs(a-b)%2==0:\r\n for i in range(c):\r\n sum+=(i+1)*2\r\n print(sum) \r\nelse:\r\n for i in range(c):\r\n sum+=(i+1)*2\r\n sum+=(i+2) \r\n print(sum) ", "a = int(input())\r\nb = int(input())\r\n\r\nmid = (a+b)//2\r\ni = 0\r\ntiredness = 0\r\nadist = abs(mid - a)\r\nbdist = abs(mid - b)\r\n\r\nfor x in range(adist):\r\n i += 1\r\n tiredness += i\r\n\r\ni = 0\r\n\r\nfor y in range(bdist):\r\n i += 1\r\n tiredness += i\r\n\r\nprint(tiredness)\r\n \r\n ", "import sys\r\n\r\nnum1 = int(sys.stdin.readline().strip())\r\nnum2 = int(sys.stdin.readline().strip())\r\n\r\ndiff = abs(num1 - num2)\r\n\r\nboth = diff // 2\r\nremainingSteps = diff % 2 if diff % 2 == 0 else (diff % 2) + both\r\ntiredness = 0\r\nfor num in range(both+1):\r\n tiredness += num\r\ntiredness *= 2\r\ntiredness += remainingSteps\r\nprint(tiredness)", "a = input()\r\nb = input()\r\n\r\ndiff = abs(int(a)-int(b))\r\n\r\nif diff % 2 == 0:\r\n\tprint(str((1 + diff//2) * (diff//2)))\r\nelse:\r\n\tprint(str(diff//2 + 1 + (1+diff//2)*(diff//2)))\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nh = d >> 1\r\nret = h * (h + 1)\r\nif d & 1:\r\n ret += h + 1\r\nprint(ret)\r\n", "x=int(input())\r\ny=int(input())\r\nd=abs(y-x)\r\nif d%2==0:\r\n a=d/2\r\n c=2*((a/2)*(1+a))\r\nelse:\r\n a=d//2\r\n c=2*((a/2)*(1+a))+a+1\r\nprint(int(c))", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\n\r\nif d==0 or d==1:\r\n print(d)\r\n exit(0)\r\n\r\nif d%2==0:\r\n n=d//2\r\n print(n*(n+1))\r\n\r\nelse:\r\n n=d//2\r\n m=n+1\r\n print((n*(n+1))//2 +(m*(m+1))//2)\r\n", "def f(x):\r\n return x * (x + 1) // 2\r\na = int(input())\r\nb = int(input())\r\nx = abs(a - b)\r\nprint(f(x // 2) + f((x + 1) // 2))", "a = int(input())\r\nb = int(input())\r\nm = (a+b)//2\r\nt=0\r\nf1 = abs(m-a)\r\nf2 = abs(b-m)\r\nfor i in range(1,f1+1):\r\n t+=i\r\nfor j in range(1,f2+1):\r\n t+=j\r\nprint(t)", "a = int(input())\nb = int(input())\nif (a>b):\n dis = (a-b)\n# if dis==2:\n# ;\n if dis%2==1:\n dis = (int)(dis/2)\n dis = dis*(dis+1) + (dis+1)\n else:\n dis = (int)(dis/2)\n dis = dis*(dis+1)\nelse:\n dis = b-a\n# if dis==2:\n# ;\n if dis%2==1:\n dis = (int)(dis/2)\n dis = dis*(dis+1) + (dis+1)\n else:\n dis = (int)(dis/2)\n dis = dis*(dis+1)\nprint(dis)\n\t \t \t\t \t \t \t\t\t \t\t\t\t\t\t\t \t", "a = int(input())\r\nb = int(input())\r\n\r\nif (a + b) % 2 == 0:\r\n d = abs(a - b) // 2\r\n print(d * (d + 1))\r\nelse:\r\n d1 = (abs(a - b) - 1) // 2\r\n d2 = d1 + 1\r\n print(d1 * (d1 + 1) // 2 + d2 * (d2 + 1) // 2)\r\n", "x=int(input())\r\ny=int(input())\r\n\r\ndef f(n):\r\n a=n*(n+1)\r\n return a\r\n\r\nif y>x:\r\n c=y-x\r\nelse:\r\n c=x-y\r\n\r\nn=c//2 \r\nif c%2==0:\r\n print(f(n))\r\nelse:\r\n print(f(n)+n+1)", "a = int(input())\r\nb = int(input())\r\nl = abs(a - b)\r\nma = l // 2\r\nmb = l - ma\r\nprint(int(ma * (ma + 1) / 2 + mb * (mb + 1) / 2))", "a = int(input())\r\nb = int(input())\r\n\r\nstepsA = abs(b - a) // 2\r\nstepsB = abs(b - a) - abs(b - a) // 2\r\n\r\nprint(stepsA * (stepsA + 1) // 2 + stepsB * (stepsB + 1) // 2)\r\n", "def sumArif(a1,n):\r\n\treturn ((2*a1+ n - 1)/2) * n\r\n\t\r\na = int(input())\r\nb = int(input())\r\nminn = 0\r\nmaxx = 0\r\nif (a > b):\r\n\tmaxx = a\r\n\tminn = b\r\nelse: \r\n\tmaxx = b\r\n\tminn = a\r\ndelta = maxx - minn \r\nif delta % 2 == 1:\r\n\tprint(int(sumArif(1,delta//2)*2 + delta // 2 + 1))\r\nelse:\r\n\tprint(int(sumArif(1,delta//2)*2))", "\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n if (b-a)%2==0:\r\n d = abs((b-a))//2\r\n r = d*(d+1)\r\n else:\r\n d = abs((b - a)) // 2\r\n r = d * (d + 1)//2\r\n r+= (d+1) * (d + 2)//2\r\n print(r)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "ac = int(input())\r\nbc = int(input())\r\nl = abs(ac - bc)\r\nma = l // 2\r\nmb = l - ma\r\nprint(int(ma * (ma + 1) / 2 + mb * (mb + 1) / 2))\r\n", "a = int(input())\r\nb = int(input())\r\nk = abs(a - b) % 2\r\nn = abs(a - b) // 2\r\n\r\nsum = ((2 + n * 2) // 2) * n\r\n\r\nsum += (1 + n) * k\r\nprint(sum)\r\n", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nnsum = lambda x: x*(x+1)//2\r\n\r\na = I()\r\nb = I()\r\nd = abs(a-b)\r\nd0, d1 = d//2, (d+1)//2\r\nprint(nsum(d0) + nsum(d1))", "a = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\ns1 = abs(a-c)\r\ns2 = abs(b-c)\r\nprint(s1*(s1+1)//2 + s2*(s2+1)//2)", "a = int(input())\r\nb = int(input())\r\nx = 0\r\nfor i in range(abs(a-int((a+b)/2))+1):\r\n x += i\r\nfor i in range(abs(b-int((a+b)/2))+1):\r\n x += i\r\nprint(x)", "def dragon():\r\n\r\n a = int(input())\r\n b = int(input())\r\n\r\n if a >b :\r\n a, b = b, a\r\n\r\n a_t = 0\r\n b_t = 0\r\n\r\n mid_d = abs((b-a)//2)\r\n\r\n mid = a + mid_d\r\n\r\n a_d = mid - a\r\n b_d = b - mid\r\n\r\n\r\n for i in range(1, a_d +1):\r\n a_t += i\r\n\r\n for i in range(1, b_d +1):\r\n b_t += i\r\n\r\n return a_t + b_t\r\n \r\ndef main():\r\n #print(lucky())\r\n #print(translate())\r\n # print(dragons())\r\n print(dragon())\r\nmain()", "x=int(input())\r\ny=int(input())\r\nt=abs(y-x)//2\r\nc=(t*(t+1))\r\nif(abs(y-x)%2==0):\r\n print(c)\r\nelse:\r\n print(c+t+1)", "def sumOfNum(n):\r\n return ( ( n * ( n + 1 ) ) / 2 )\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndist = abs(a - b)\r\ntired1 = dist // 2\r\ntired2 = dist - tired1\r\n\r\nTotalTired = sumOfNum(tired1) + sumOfNum(tired2)\r\n\r\nprint(int(TotalTired))", "import math\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\nif diff % 2 != 0:\r\n first = diff // 2\r\n second = math.ceil(diff / 2)\r\n ans1 = ((1 + first) * first) // 2\r\n ans2 = ((1 + second) * second) // 2\r\n print(ans1 + ans2)\r\nelse:\r\n first = diff // 2\r\n ans1 = ((1 + first) * first) // 2\r\n print(ans1 * 2)\r\n\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\ndef sn(x):\r\n\treturn (x*(x+1))//2\r\n\r\na=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\ns=sn(abs(c-a))+sn(abs(c-b))\r\nprint(s)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a-b)\r\nh = (d//2)\r\ni = 1\r\nres = 0\r\nfor ind in range(h):\r\n res += i\r\n i += 1\r\n\r\nres = 2 * res\r\nif d % 2 == 1:\r\n res += i\r\n \r\nprint(res)\r\n", "a, b = int(input()), int(input())\r\nm = abs(a - b)\r\nn = m // 2\r\nprint(n * (n + 1) + m % 2 * (n + 1))", "'''input\r\n101\r\n99\r\n'''\r\nc = 1\r\nl = []\r\nfor i in range(1000):\r\n\tl.append(c)\r\n\tl.append(c)\r\n\tc += 1\r\n\r\na = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nprint(sum(l[:d]))", "a = int(input())\r\nb = int(input())\r\ndif = abs(b - a)\r\nif (b - a) % 2 == 0:\r\n n = dif // 2\r\n ans = n * (n + 1)\r\nelse:\r\n n = dif // 2\r\n ans = n * (n + 1)\r\n ans += n + 1\r\nprint(ans)\r\n", "def fun(x):\r\n return (x*(x+1))//2\r\nn=int(input())\r\nm=int(input())\r\nk=abs(n-m)\r\np=k//2\r\nif(k%2==0):\r\n d=0\r\nelse:\r\n d=p+1\r\nl=2*fun(p)+d\r\nprint(l)", "from math import *\r\nx1=int(input())\r\nx2=int(input())\r\nx=int(fabs(x1-x2))\r\nif x%2==0:\r\n n=x//2\r\n print(n*(n+1))\r\nelse:\r\n n=x//2\r\n print(n*(n+1)//2+(n+1)*(n+2)//2)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n d1 = abs(a - b) // 2\r\n d2 = (abs(a - b) + 1) // 2\r\n ans = 0\r\n for i in range(1, d1 + 1):\r\n ans += i\r\n for i in range(1, d2 + 1):\r\n ans += i\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "friend_one=int(input())\r\nfriend_two=int(input())\r\nimport math\r\nx=abs(friend_one-friend_two)\r\ntirednessA=x/2\r\ntirednessB=x-x/2\r\na=tirednessA*(tirednessA+1)/2\r\nb=tirednessB*(tirednessB+1)/2\r\nprint(math.ceil(a+b))", "from math import ceil\r\nn=int(input())\r\nt=int(input())\r\nx=ceil((n+t)/2)\r\ny=abs(x-n)\r\nz=y*(y+1)//2\r\nyy=abs(x-t)\r\nzz=yy*(yy+1)//2\r\nprint(zz+z)", "a=int(input())\r\nb=int(input())\r\nif (a+b)%2==0:\r\n c=int((a+b)/2)\r\nelse:\r\n c=int((a+b)/2)+1\r\nx=abs(c-a)\r\ny=abs(b-c)\r\nsum1=0\r\nsum2=0\r\ni=1\r\nj=1\r\nif x>0:\r\n for i in range(x+1):\r\n sum1=sum1+i\r\nif y>0:\r\n for j in range(y+1):\r\n sum2=sum2+j\r\nprint(sum1+sum2)", "from math import ceil\r\na = int(input())\r\nb = int(input())\r\n\r\nx = ceil((a+b)/2)\r\n\r\na = abs(x-a)\r\nb = abs(b-x)\r\n\r\nc = 0\r\n\r\nfor i in range(1, a+1):\r\n c += i\r\nfor i in range(1, b+1):\r\n c += i\r\nprint(c)", "a = int(input())\nb = int(input())\nm = abs(a-b) // 2\ns = 0\nfor i in range(1, m+1):\n s += i * 2\nif abs(a-b) % 2 == 1:\n s += m + 1\nprint(s)\n", "f = int(input())\r\nl = int(input())\r\nif l>f:\r\n d = l-f\r\nelse:\r\n d = f - l\r\nn = d//2\r\ns=n*(n+1)//2\r\nn = d - n\r\ns = s+n*(n+1)//2\r\nprint(s)", "x=int(input())\r\ny=int(input())\r\nprint(int(2*(1+abs(x-y)//2)/2*(abs(x-y)//2)+[abs(x-y)//2+1,0][abs(x-y)%2==0]))\r\n", "def s(n):\r\n sum = 0\r\n for i in range(1, n + 1):\r\n sum += i\r\n return sum\r\n\r\na = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nstep = b - a\r\nif step % 2 == 0:\r\n print(s(step // 2) * 2)\r\nelse:\r\n print(s(step // 2) * 2 + (step + 1) // 2)", "a = int(input())\r\nb = int(input())\r\ncount=0\r\nif abs(a-b)%2!=0:\r\n\tfor i in range(0,abs(a-b)//2+1):\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\t\tif i>=1:\r\n\t\t\tcount+=i\r\nelse:\r\n\tfor i in range(0,abs(a-b)//2):\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\t\tif i>=0:\r\n\t\t\tcount+=i+1\r\n\r\nprint(count)\t\t", "# Friends Meeting\ndef tired(a, b):\n diff = abs(a - b)\n if diff & 1 == 0:\n diff //= 2\n ans = (diff * (diff + 1)) // 2\n return 2 * ans\n x = diff // 2\n y = x + 1\n ans = ((x * (x + 1)) // 2) + ((y * (y + 1)) // 2)\n return ans\n\n\na = int(input())\nb = int(input())\nprint(tired(a, b))\n", "a=int(input())\nb = int(input())\ndis = abs(b-a)\nmult,mod = dis//2 ,dis%2*(dis//2+1)\ntotal = ((mult*(mult+1)))+mod\nprint(total)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nif d % 2 == 0:\r\n n = d // 2\r\n print((1+n)*n)\r\nelse:\r\n n = d // 2\r\n print((1+n)*n + n + 1)", "a = int(input())\nb = int(input())\nk = abs(a-b)\na = (k//2)*(k//2+1)\nif k%2 == 1:\n\ta += (k+1)//2\nprint(a)\n\t\n", "import sys\r\nfrom collections import *\r\nfrom math import *\r\nimport re\r\ndef inp_arr():return list(map(int,input().split()))\r\ndef inp():return map(int,input().split())\r\ndef lcm(a,b):return (a*b)/gcd(a,b)\r\ndef even(n):return[False,True][0 if n%2 else 1]\r\nmax_int = sys.maxsize\r\nmod = 10**9+7\r\n\r\ndef solver(n):return int(n*(n+1)/2)\r\na,b=int(input()),int(input())\r\nn=abs(a-b)\r\nprint(solver(ceil(n/2))+solver(floor(n/2)))", "a = int(input())\r\nb = int(input())\r\n\r\ng = (a + b) // 2\r\naa = int(abs(a - g))\r\nbb = int(abs(b - g))\r\n\r\nans = int(aa * (aa + 1) / 2 + bb * (bb + 1) / 2)\r\nprint(ans)\r\n", "print((abs(int(input()) - int(input())) + 1) ** 2 // 4)\n", "a = int(input())\r\nb = int(input())\r\nsredn = (a+b) // 2\r\nr_a, r_b = abs(a - sredn), abs(b - sredn)\r\nc_a, c_b = r_a * (r_a + 1) / 2, r_b * (r_b + 1) / 2\r\nprint(int(c_a+c_b))", "a = int(input())\r\nb = int(input())\r\n\r\nif a<b:\r\n small = a\r\n large = b\r\n d = b-a\r\nelse:\r\n small = b\r\n large = a\r\n d = a-b\r\n\r\ncenter = small + d//2\r\n\r\ns1 = 0\r\ns2 = 0\r\n\r\nfor i in range(1, (d//2)+1):\r\n s1+=i\r\n\r\nfor i in range(1, (large-center)+1):\r\n s2+=i\r\n\r\nprint(s1+s2)", "a = int(input())\r\nb = int(input())\r\ncount = 0\r\nk = abs(a-b)\r\nn = k//2\r\n\r\nif k%2==0:\r\n count += n*(n+1)\r\n\r\nelse:\r\n count += n*(n+1)//2 + (n+1)*(n+2)//2\r\n\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\nif abs(a-b)%2==0:\r\n tengah=int((a+b)/2)\r\nelse:\r\n tengah=int((a+b+1)/2)\r\na1=abs(a-tengah)\r\nb1=abs(b-tengah)\r\ni=1\r\nj=0\r\ntiredness=0\r\nwhile j<a1:\r\n tiredness+=i\r\n i+=1\r\n j+=1\r\nj=0\r\ni=1\r\nwhile j<b1:\r\n tiredness+=i\r\n i+=1\r\n j+=1\r\nprint(tiredness)\r\n", "a = int(input())\nb = int(input())\ndiff = abs(a-b)\ns = 0\nif(diff<=2):\n print(diff)\nelse:\n for i in range(1,(diff//2+1)):\n s = s + i\n for i in range(1,(diff-(diff//2)+1)):\n s = s + i\n print(s)\n", "a = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nr = d // 2\r\nres = r * (r + 1) // 2 \r\nif d % 2 == 0:\r\n res *= 2\r\nelse:\r\n res += (r + 1) * (r + 2) //2\r\nprint(res)", "n=int(input())\r\nm=int(input())\r\nx=abs(m-n)\r\ny=int(x/2)\r\nif x%2==0:\r\n\tprint(y*(y+1))\r\nelse:\r\n\tprint((y*(y+1)+y+1))", "x1 = int(input())\r\nx2 = int(input())\r\ndiff = abs(x1-x2)\r\nif diff%2==0:\r\n diff = diff//2\r\n print(diff*(diff+1))\r\nelse:\r\n diff -= 1\r\n diff = diff//2\r\n print(diff*(diff+1) + (diff+1))", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)//2\r\nif abs(a-b)%2==0:\r\n\tprint(2*sum([x for x in range(c+1)]))\r\nelse:\r\n\tprint(2*sum([x for x in range(c+1)])+c+1)", "import math\n\na = eval(input())\nb = eval(input())\nres = 0\n\n\ndef sum(x, step):\n if x == 0:\n return step\n else:\n step += x\n x -= 1\n return sum(x, step)\n\n\nd = int(math.fabs(a - b) / 2)\nres = 2 * sum(d, 0)\nif d * 2 < math.fabs(a - b):\n res += d + 1\nprint(res)\n\n\t\t\t \t\t\t \t \t \t\t", "a = int(input())\r\nb = int(input())\r\nlength = abs(a-b)\r\ncntA = int(length/2)\r\ncntB= length-(cntA)\r\nf1 = (cntA*(cntA+1))/2\r\nf2 =(cntB*(cntB+1))/2\r\nprint(int(f1+f2))", "A = int(input())\r\nB = int(input())\r\ntA = abs(A-B)//2\r\ntB = abs(A-B)-tA\r\ntA, tB = tA*(tA+1)//2, tB*(tB+1)//2\r\ntiredness = tA + tB\r\nprint(tiredness)", "a = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a-b)\r\n\r\nres = 0\r\nif diff%2 == 0:\r\n for i in range(int(diff/2)):\r\n res += i+1\r\n\r\n print(2*res)\r\nelse:\r\n for i in range(int(diff/2)):\r\n res += i+1\r\n\r\n res = 2*res\r\n res += int(diff/2)+1\r\n\r\n print(res)", "import math\r\n\r\na = int(input()) \r\nb = int(input()) \r\nif(a>b):\r\n temp =a \r\n a=b\r\n b=temp\r\nelse:\r\n pass\r\n\r\npoint = math.ceil ((b+a)/2) \r\nif((b-a)==1 or (a-b)==-1):\r\n print(1) \r\nelse:\r\n distance1 = point - a \r\n distance2 = b - point \r\n tired1 = (distance1)*(distance1+1)/2 \r\n tired2 = (distance2)*(distance2+1)/2\r\n print(int(tired2+tired1))\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nx = abs((b - a)) // 2\r\n\r\nans = 0\r\nans += x * (x + 1)\r\n\r\nif abs((b - a)) % 2 == 1:\r\n\tans += x + 1\r\nprint(ans)\t\r\n", "p = abs(int(input()) - int(input()))\r\ntired=0\r\nn=1\r\nwhile p>0:\r\n if p>1:\r\n tired+=n*2\r\n p-=2\r\n else:\r\n tired+=n\r\n p-=1\r\n n+=1\r\nprint(tired)", "n1=int(input())\r\nn2=int(input())\r\nif n1>n2:\r\n c=n1\r\n n1=n2\r\n n2=c\r\nc=0\r\np1=0\r\np2=0\r\ns=0\r\n\r\nwhile n1<n2:\r\n if c%2==0:\r\n n1+=1\r\n p1+=1\r\n s=s+p1\r\n else:\r\n n2-=1\r\n p2+=1\r\n s=s+p2\r\n c+=1\r\nprint(s)", "a, b = int(input()), int(input())\r\nda = abs(a-b)//2\r\ndb = abs(a-b)-da\r\nprint(da*(da+1)//2 + db*(db+1)//2)", "import math\r\na = int(input())\r\nb = int(input())\r\ntravel = abs(b-a) - 1\r\nif travel%2 == 0:\r\n #one will take one step more\r\n x1Step = travel//2\r\n # print(x1Step)\r\n tired = sum(range(1,x1Step+1)) *2\r\n tired += (x1Step + 1)\r\n print(tired)\r\nelse:\r\n x1Step = travel//2\r\n tired = sum(range(1,x1Step+1))*2\r\n tired += (x1Step+1)*2\r\n print(tired)\r\n\r\n", "print((lambda x,y:((abs(x-y)//2)*(abs(x-y)//2+1))//2+(((abs(x-y))-abs(x-y)//2)*(abs(x-y)-abs(x-y)//2+1)//2))(int(input()),int(input())))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "a = int(input())\nb = int(input())\nif a > b:\n tmp = a\n a = b\n b = tmp\nc = b - a\nk = int(c/2)\nif c%2:\n print((k+1)**2)\nelse:\n print(k**2 + k)\n\n\t\t\t \t\t\t\t \t \t \t \t\t \t\t \t\t \t \t\t", "a = int(input())\r\nb = int(input())\r\ns1 = 0\r\ns2 = 0\r\nt = (a+b)//2\r\nfor i in range(1, abs(t-a)+1):\r\n s1+=i\r\nfor i in range(1, abs(t-b)+1):\r\n s2+=i\r\nprint(s1+s2)", "class encontro_dos_parcas:\n def __init__(self):\n self.resposta = ''\n self.entrada_1 = 0\n self.entrada_2 = 0\n\n def leitura(self):\n self.entrada_1 = int(input())\n self.entrada_2 = int(input())\n\n def solucao(self):\n distancia = abs(self.entrada_1 - self.entrada_2)\n if distancia % 2:\n amigo_1 = distancia // 2\n amigo_2 = distancia // 2 + 1\n else:\n amigo_1 = distancia // 2\n amigo_2 = distancia // 2\n cansaco_geral = sum([x + 1 for x in range(amigo_1)])\n cansaco_geral += sum([x + 1 for x in range(amigo_2)])\n self.resposta = str(cansaco_geral)\n\n def resultado(self):\n return self.resposta\n\n\nif __name__ == \"__main__\":\n questao = encontro_dos_parcas()\n questao.leitura()\n questao.solucao()\n print(questao.resultado())\n \t\t\t \t\t \t \t \t\t \t \t", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nd_ = 0\r\nd = 0\r\n\r\nif c % 2 == 0:\r\n for i in range(1, c//2+1):\r\n d_ += i \r\n print(d_*2)\r\nelse:\r\n for _ in range(1, math.ceil(c/2)+1):\r\n d_ += _\r\n d += _\r\n if _ == math.ceil(c/2):\r\n d -= math.ceil(c/2)\r\n print(d_ + d)", "from math import *\n\ndef g(n):\n return n * (n+1) // 2\n\na = int(input())\nb = int(input())\n\nn = abs(a-b)/2\n\nprint(g(ceil(n)) + g(floor(n)))\n", "def factorial(n):\r\n if n==0:\r\n return 0\r\n elif n==1:\r\n return 1\r\n else:\r\n return n+factorial(n-1)\r\n\t\r\nfriend1=int(input())\r\nfriend2=int(input())\r\nif friend1>friend2:\r\n friend1,friend2=friend2,friend1\r\nmid=(friend2-friend1)/2\r\nif not mid.is_integer():\r\n tiredness=(factorial((friend2-friend1)//2))+(factorial(((friend2-friend1)//2)+1))\r\n \r\nelse:\r\n tiredness=2*(factorial((friend2-friend1)//2))\r\n \r\nprint(tiredness)", "# for testCase in range(int(input())):\na = int(input())\nb = int(input())\ndiff = abs(a-b)\nprint((diff//2)*(diff//2+1)//2+((diff+1)//2)*((diff+1)//2+1)//2)\n", "import sys\r\ndef cal(n1,n2):\r\n t=0\r\n t1=1\r\n t2=1\r\n i=min(n1,n2)\r\n j=max(n1,n2)\r\n while(i<=j):\r\n \r\n if(i==j):\r\n return t\r\n i+=1\r\n t+=t1\r\n t1+=1\r\n if(i==j):\r\n return t\r\n \r\n j-=1\r\n t+=t2\r\n t2+=1\r\n if(i==j):\r\n return t\r\n\r\n return t\r\n\r\ndef main():\r\n n1=int(input())\r\n n2=int(input())\r\n x=cal(n1,n2)\r\n print(x)\r\nif __name__==\"__main__\":\r\n main()\r\n", "a = int(input())\r\nb = int(input())\r\nb = abs(b - a)\r\na = 0\r\nA = b // 2\r\nB = b - A\r\nq = 0\r\nfor i in range(1, A + 1):\r\n q += i\r\nfor i in range(1, B + 1):\r\n q += i\r\nprint(q)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n d=d//2\r\n print((d)*(d+1))\r\nelse:\r\n c=d\r\n d=d//2\r\n print((d)*(d+1)+d+1)", "a = int(input())\nb = int(input())\ndist = abs(a - b)\nhalf = dist // 2\ntiredness = 0\nfor i in range(1, half + 1):\n tiredness += 2 * i\nif (dist % 2 == 1):\n tiredness += half + 1\nprint(tiredness)\n", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n tmp = a\r\n a = b\r\n b = tmp\r\n\r\nif (a + b) / 2 == (a + b) // 2:\r\n point = (a + b) // 2\r\nelse:\r\n point = math.ceil((a + b) / 2)\r\n\r\nans = (point - a)*(point - a + 1) / 2\r\nans += (b - point) * (b - point + 1) / 2\r\nprint(int(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a, b, asum = int(input()), int(input()), lambda x: (1 + x) * x // 2\r\na, b = abs(a - b) // 2, abs(a - b) - abs(a - b) // 2\r\nprint(asum(a) + asum(b))", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\ns = 0\r\nc = 0\r\nif d % 2 == 0:\r\n s += (d // 2)\r\n for i in range(1, s + 1):\r\n c += i\r\n print(c * 2)\r\n exit()\r\nelse:\r\n s += (d // 2)\r\n k = 0\r\n for i in range(1, s + 1):\r\n c += i\r\n k = i\r\n c = c * 2\r\n c += (k + 1)\r\n print(c)\r\n", "a = int(input());\r\nb = int(input());\r\nans = 0; k = abs(b - a);\r\nfor i in range(1, k // 2 + 1):\r\n ans += i;\r\nans *= 2;\r\nif k % 2 == 1:\r\n ans += k // 2 + 1;\r\nprint(ans);\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs((b - a) // 2)\r\nd = abs(max(a, b) - min(a, b) - c)\r\ns= c * (c + 1) / 2 + d * (d + 1) / 2\r\nprint(int(s))", "a = int(input())\r\nb = int(input())\r\nm = (a + b)//2\r\ns1 = abs(a - m)\r\ns2 = abs(b - m)\r\ns1 = (s1*(s1+1))//2\r\ns2 = (s2*(s2+1))//2\r\nprint(int(s1+s2))", "x=int(input())\r\ny=int(input())\r\nn=abs(x-y)\r\nm=n//2\r\nif n%2==0:\r\n c=m*(m+1)\r\nelse :\r\n c=(m*(m+1)//2)+(((m+1)*(m+2))//2)\r\nprint(c)\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\ta = int(inp()); b = int(inp())\r\n\tm = abs(a-b); n = m//2\r\n\tprint(n*(n+1) + [0, n+1][m%2])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n# addcbcdda\r\n# addcbcdda", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\na=int(input())\nb=int(input())\nk=abs(a-b)\nif(k%2==0):\n k=k//2\n print(k*(k+1))\nelse:\n k//=2\n print((k+1)**2)\n", "a = int(input())\r\nb = int(input())\r\n\r\nx = abs(b-a)\r\nn = int(x/2)\r\nm = x - int(x/2)\r\n\r\nans = int((n*(n+1))/2)\r\nans += int((m*(m+1))/2)\r\n\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\n\r\nsumi=a+b\r\nans=0\r\n\r\nif sumi%2==0:\r\n half=sumi/2\r\n sumi=abs(half-a)\r\n for i in range(int(sumi+1)):\r\n ans=ans+i\r\n ans=ans*2\r\nelse:\r\n half=sumi/2\r\n a=min(a,b)\r\n sumi=abs(half-a)\r\n for i in range(int(sumi+1)):\r\n ans=ans+i\r\n ans=ans*2\r\n ans=ans+i+1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndist = abs(a - b)\r\nhalf = dist // 2\r\ntiredness = 0\r\nfor i in range(1, half + 1):\r\n tiredness += 2 * i\r\nif (dist % 2 == 1):\r\n tiredness += half + 1\r\nprint(tiredness)", "a=int(input())\r\nb=int(input())\r\nn=abs(b-a)\r\np=n//2\r\nif(n%2==1):\r\n print(p*(p+1)+p+1)\r\nelse:\r\n print(p*(p+1))", "a=int(input())\r\nb=int(input())\r\ndist=abs(a-b)\r\n\r\nif dist%2==0:\r\n dist=dist//2\r\n sum0=(dist*(1+dist))//2\r\n print(2*sum0)\r\nelse:\r\n dist1=(dist//2)+1\r\n dist2=(dist//2)\r\n sum1=(dist1*(1+dist1))//2\r\n sum2=(dist2*(1+dist2))//2\r\n print(sum1+sum2)\r\n", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nmoo = d//2\r\ns = moo*(moo+1)//2\r\ns *= 2\r\nif d%2 == 1:\r\n s += moo+1\r\nprint(s)", "# your code goes here\r\ndef form(a):\r\n\treturn ( (a**2 + a)//2)\r\n\r\nx = int(input())\r\ny = int(input())\r\nif x>y:\r\n\tx,y = y,x\r\nmeet = (x+y)//2\r\nprint(form(y - meet) + form(meet-x))", "import math\r\na = int(input())\r\nb = int(input())\r\nlen= abs(a-b)\r\n\r\nfrndA = math.ceil(len/2)\r\nfrndB = len - frndA\r\nprint ( int((frndA*(frndA +1))/2 + (frndB*(frndB +1))/2) ) ", "a=int(input())\r\nb=int(input())\r\n\r\nx=abs(a-b)\r\ntemp=0\r\nif x==1 :\r\n print(1)\r\nelif x==2 :\r\n print(2)\r\nelse :\r\n if x%2==0 :\r\n for i in range(1,x//2+1) :\r\n temp+=i\r\n print(temp*2)\r\n else :\r\n for i in range(1,x//2+1) :\r\n temp+=i\r\n print(temp*2+i+1)", "a = int(input())\r\n\r\nb =int(input())\r\nc = (a+b)//2\r\nd =0\r\n\r\ng=0\r\ne=1\r\nf=1\r\n\r\nif (a-b==1)or(b-a==1):\r\n print(1)\r\nelse:\r\n if a<b:\r\n for i in range(a,c):\r\n d = d+e\r\n e = e+1\r\n for j in range(c,b):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n else:\r\n for i in range(b,c):\r\n d = d+e\r\n e=e+1\r\n for j in range(c,a):\r\n g=g+f\r\n f=f+1\r\n print(d+g)\r\n", "a = int(input())\r\nb = int(input())\r\nmeetingPoint = (a+b)//2\r\nmoves1 = moves2 = 0\r\nif a < b:\r\n while a != meetingPoint:\r\n a += 1\r\n moves1 += 1\r\n while b != meetingPoint:\r\n b -= 1\r\n moves2 += 1\r\nelse:\r\n while a != meetingPoint:\r\n a -= 1\r\n moves1 += 1\r\n while b != meetingPoint:\r\n b += 1\r\n moves2 += 1 \r\nprint(moves1*(moves1+1)//2 + moves2*(moves2+1)//2)", "a = int(input())\nb=int(input())\n\nc = (a+b)//2\n\nma = abs(a-c)\nmb = abs(b-c)\nea = sum(range(ma+1))\neb = sum(range(mb+1))\n\nprint(ea+eb)", "def calc(x):\r\n return x * (x + 1) // 2\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nmid = (a + b) >> 1\r\nprint(calc(mid - a) + calc(b - mid))", "a=int(input())\nb=int(input())\nx=abs(b-a)\nif not x%2:\n\tx=x//2\n\tprint(x*(x+1))\nelse:\n\tx//=2\n\tprint(x*(x+1)+(x+1))\n\t\n", "n1 = int(input())\r\nn2 = int(input())\r\nmiddle = int((n1+n2)/2)\r\ndef ap(no1):\r\n return (no1/2)*(2+(no1-1))\r\n\r\nprint(int(ap(abs(middle-n1))+ap(abs(middle-n2))))", "a = int(input())\r\nb = int(input())\r\na_steps, b_steps = 0, 0\r\ndef get_tiredness(s):\r\n t = 0\r\n for i in range(1, s + 1):\r\n t += i\r\n return t\r\n\r\nif b - a > 1:\r\n while b - a > 1:\r\n a_steps += 1\r\n b_steps += 1\r\n a += 1\r\n b -= 1\r\nelif a - b > 1:\r\n while a - b > 1:\r\n a_steps += 1\r\n b_steps += 1\r\n a -= 1\r\n b += 1\r\nif a - b == 1 or b - a == 1: \r\n a_steps += 1\r\n a = b\r\nprint(get_tiredness(a_steps) + get_tiredness(b_steps))\r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nprint(sum(range(abs(b-a)//2+1))+sum(range(abs(b-a)-abs(b-a)//2+1)))", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nm = a + abs(b - a) // 2\r\nn1 = b - m\r\nn2 = m - a\r\nprint((n1 + 1) * n1 // 2 + (n2 + 1) * n2 // 2)", "a = int(input())\r\nb = int(input())\r\ndifference = abs(a-b)\r\nmove1 = int(difference/2)\r\nmove2 = difference - move1\r\nresult = int(((move1 * (move1 + 1))/2) + ((move2 * (move2 + 1))/2))\r\nprint(result)", "n=int(input())\r\nm=int(input())\r\nc=(n+m)//2\r\nif n<=c:\r\n t=c-n\r\nelse:\r\n t=n-c\r\nif m<=c:\r\n k=c-m\r\nelse:\r\n k=m-c\r\n\r\nh=(t*(t+1))//2\r\ng=(k*(k+1))//2\r\nprint(h+g)\r\n", "n=int(input())\r\nm=int(input())\r\nk=(n+m+1)//2\r\nl=abs(n-k)\r\no=abs(m-k)\r\nprint(l*(l+1)//2+o*(o+1)//2)\r\n", "# Read input values\r\na = int(input())\r\nb = int(input())\r\n\r\n# Calculate the midpoint\r\nmidpoint = (a + b) // 2\r\n\r\n# Calculate tiredness for the first friend (a) to reach the midpoint\r\ntiredness_a = sum(range(1, abs(midpoint - a) + 1))\r\n\r\n# Calculate tiredness for the second friend (b) to reach the midpoint\r\ntiredness_b = sum(range(1, abs(midpoint - b) + 1))\r\n\r\n# Calculate the total tiredness\r\ntotal_tiredness = tiredness_a + tiredness_b\r\n\r\n# Print the minimum possible total tiredness\r\nprint(total_tiredness)\r\n", "a=int(input())\r\nb=int(input())\r\nx=(a+b)//2\r\nr=abs(x-a)\r\nl=abs(x-b)\r\nprint((r*(r+1)+l*(l+1))//2)\r\n", "n=int(input())\r\nm=int(input())\r\na=max(n,m)\r\nb=min(n,m)\r\nif (a-b-1)%2==0:\r\n\tl=int((a-b-1)/2)\r\n\tsum1=0\r\n\tfor i in range(1,l+1):\r\n\t\tsum1+=(i)\r\n\tprint(2*sum1+l+1)\r\nelse:\r\n\tsum1=0\r\n\tl=int(((a-b)+1)/2)\r\n\tfor i in range(1,l+1):\r\n\t\tsum1+=i\r\n\tprint(2*sum1)\r\n", "def soma(n):\n soma = 0\n for i in range(1, n + 1):\n soma += i\n return soma\n\na = int(input())\nb = int(input())\n\ndist = abs(a - b)\nparaCada = dist // 2\nif dist % 2 == 0:\n ans = soma(paraCada) * 2\nelse:\n ans = soma(paraCada) + soma(paraCada + 1)\n\nprint(ans)\n\t \t \t \t \t\t \t \t\t\t \t\t \t\t", "\r\nimport math\r\na=int(input())\r\nb=int(input())\r\nx,y=max(a,b),min(a,b)\r\nd=x-y\r\nsum=0\r\nif d%2==0:\r\n\tfor i in range(1,d//2+1):\r\n\t\tsum=sum+i*2\r\nelse:\r\n\tfor i in range(1,d//2+1):\r\n\t\tsum=sum+i*2\r\n\tsum=sum+math.ceil(d/2)\r\n\t\r\nprint(sum)\r\n\r\n \r\n\r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nc=[a, b]\r\nc.sort()\r\nx=c[1]-c[0]\r\nif x%2==0:\r\n print(int(x*(x+2)/4))\r\nelse:\r\n p=x/2+0.5\r\n q=x/2-0.5\r\n r=(p*(p+1))/2\r\n s=(q*(q+1))/2\r\n print(int(r+s))\r\n", "n=int(input())\nm=int(input())\ncount=0\ni=1\nwhile True:\n \n if n<m:\n n=n+1\n count=count+i\n if n==m:\n break\n else:\n m=m-1\n count=count+i\n if n>m:\n m=m+1\n count=count+i\n if m==n:\n break\n else:\n n=n-1\n count=count+i\n if n==m:\n break\n i=i+1\n\nprint(count)\n \t\t\t\t\t\t \t \t \t\t \t\t\t\t\t \t\t \t\t", "a = int(input())\r\nb = int(input())\r\n\r\n\r\nx = max(a,b)\r\ny = min(a,b)\r\n\r\nz = (a+b)//2\r\nh = z-y\r\nj = h*(h+1)/2\r\nl = x-z\r\nt = l*(l+1)/2\r\no = int(j+t)\r\nprint(o)", "# vars: a, b, c, d\r\na = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nd = c//2\r\ne = c-d\r\nprint((d*(d+1)+e*(e+1))//2)\r\n#\r\n", "a = int(input())\nb = int(input())\n\nt = [0] * 1001\n\nfor i in range(1, len(t)):\n t[i] = t[i - 1] + i\n\nmeet = (a + b) // 2\n\nprint(t[abs(a - meet)] + t[abs(b - meet)])\n", "a,b=int(input()),int(input())\r\nr=abs(a-b)\r\nprint((r-1)//2*((r-1)//2+1)+((r-1)%2+1)*((r-1)//2+1))", "x1 = int(input())\r\nx2 = int(input())\r\nx = abs(x1-x2)\r\nif x%2 ==0:\r\n x=x//2\r\n print(x*(x+1))\r\nelse :\r\n x=x//2\r\n print(x*(x+1)+(x+1))", "from math import floor, ceil\r\na = int(input())\r\nb = int(input())\r\nc = floor(abs(a-b)/2)\r\nd = ceil(abs(a-b)/2)\r\nres = int((c + 1)/2*c + (d + 1)/2*d)\r\nprint(res)\r\n", "a = int(input())\nb = int(input())\n\nd = abs(b-a)\nn1 = d//2\nn2 = d-n1\n\nsum1 = (n1*(n1+1))//2\nsum2 = (n2*(n2+1))//2\nprint((sum1+sum2))\n\n\t\t \t \t \t\t \t\t \t\t\t \t\t\t\t\t \t\t \t\t", "a = int(input())\r\nb = int(input())\r\nmin_tiredness= float('inf')\r\n\r\nfor i in range (min(a,b) , max(a,b)+1):\r\n tiredness_a= abs(a - i)\r\n tiredness_b= abs(b - i)\r\n total=0\r\n\r\n for j in range (1, tiredness_a+1):\r\n total = total + j\r\n for j in range (1, tiredness_b+1):\r\n total = total + j\r\n \r\n if total < min_tiredness:\r\n min_tiredness = total\r\nprint(min_tiredness) ", "a=int(input())\r\nb=int(input())\r\nimport math\r\nd=math.ceil(abs(a-b)/2)\r\ni=1\r\nsum=0\r\nwhile i<=d:\r\n sum=sum+i\r\n i=i+1\r\nif abs(a-b)%2==0:\r\n print(2*sum)\r\nelse: \r\n print((2*sum)-d) ", "n = int(input())\nm = int(input())\n\ndfr = abs(n-m)+1\ns = dfr//2\nprint((s+dfr%2)*s)\n", "def main():\r\n x1 = int(input())\r\n x2 = int(input())\r\n d = abs(x2 - x1)\r\n if d % 2 == 0:\r\n d /= 2\r\n print(int(d * (d + 1)))\r\n else:\r\n d //= 2\r\n print((d + 1) ** 2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nm=int(input())\r\ns=abs(m-n)\r\nf=(s-s%2)//2\r\nans=2*int((1+f)/2*f)\r\nif s%2:ans+=f+1\r\nprint(ans)\r\n", "a=int(input())\r\nb=int(input())\r\np=abs(a-b)\r\nif p==1:\r\n print(1)\r\nelif p>1:\r\n if p%2 ==0:\r\n q=p//2\r\n print(2*(q*(q+1)//2))\r\n else:\r\n q=p//2\r\n e=q+1\r\n print((q*(q+1))//2+(e*(e+1)//2))\r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n# http://codeforces.com/contest/931/problem/A\r\n\r\ndef problem():\r\n \r\n in1 = int(input())\r\n in2 = int(input())\r\n\r\n# in1 = 10\r\n# in2 = 3\r\n \r\n moves = abs(in2 - in1)\r\n\r\n each = moves // 2\r\n \r\n cost = each * (each + 1) + (moves % 2 * (each + 1))\r\n \r\n return cost\r\n\r\n \r\nprint(problem())\r\n#problem()", "x=int(input())\r\ny=int(input())\r\nm=abs(x-y)\r\nif (m==1):\r\n res=1\r\nelif (m%2==0):\r\n d=m//2\r\n res=d*(d+1)\r\nelse:\r\n d=m//2\r\n res=d*(d+1) + (d+1)\r\n \r\nprint(res)", "n = int(input())\r\nm = int(input())\r\nsub = abs(n-m)\r\ndiv = round(sub/2)\r\ncnt = 0\r\nif sub == 1:\r\n for i in range(1,sub+1):\r\n cnt += i\r\nelse:\r\n for i in range(1,div+1):\r\n cnt += i\r\n for j in range(1,(sub-div)+1):\r\n cnt += j\r\nprint(cnt)\r\n", "x = int(input())\ny = int(input())\nif x > y:\n\tx, y = y, x\nans = 2e9\nfor i in range(x, y+1):\n\tans = min(ans, (i-x)*(i-x+1)//2 + (y-i)*(y-i+1)//2)\nprint(ans)", "diff = abs(int(input()) - int(input()))\r\n\r\ntiredness = ((diff // 2) *(diff//2 + 1))\r\n\r\nif diff % 2 == 1:\r\n tiredness += (diff // 2) + 1\r\n\r\nprint(tiredness)", "a=int(input())\r\nb=int(input())\r\nlen=abs(a-b)\r\nif len%2==0:\r\n\tmoves=len//2*(len//2+1)\r\nelse:\r\n\tmoves=len//2*(len//2+2)+1\r\nprint(moves)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nc= abs(a-b)//2\r\n\r\n\r\ndef getSum(a):\r\n if a <=1:\r\n return a\r\n else:\r\n return (1+a)*a//2\r\n\r\nif abs(a-b)%2 == 0 :\r\n ans = getSum(c) * 2\r\nelse:\r\n ans = getSum(c) + getSum(c + 1)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndist = abs(b-a)\r\nif(dist%2 == 0):\r\n x=dist // 2\r\n print(x*(x+1))\r\nelse:\r\n x = dist // 2\r\n print((x*(x+1))//2 + ((x+1)*(x+2))//2)", "a=int(input())\r\nb=int(input())\r\nmn = min(a,b)\r\nmx = max(a,b)\r\nres = (mn*(mn+1))//2 + (mx*(mx+1))//2\r\nfor i in range(mn, mx+1):\r\n res = min(res, ((mx-i)*(mx-i+1))//2 + ((i-mn)*(i-mn+1))//2)\r\nprint(res)\r\n", "x1 = int(input())\nx2 = int(input())\n# ввод входных данных\n\ndistance = abs(x1 - x2)\ncnt1 = distance // 2\ncnt2 = distance - cnt1\n\n\ns1 = cnt1 * (1 + cnt1) // 2\ns2 = cnt2 * (1 + cnt2) // 2\nprint(s1 + s2)\n", "a = int(input())\r\nb = int(input())\r\nf = abs(a - b)\r\nz,o = f // 2, f % 2\r\ng = ((2 + (z-1)) * z)\r\nif o:\r\n g += 1 + z\r\nprint(g)", "a = int(input())\r\nb = int(input())\r\nmayor = max(a, b)\r\nmenor = min(a, b)\r\nderecha = 0\r\nizquierda = 0\r\nfor i in range(1, mayor):\r\n\r\n mayor = mayor-1\r\n derecha = derecha+i\r\n\r\n if mayor == menor:\r\n print(derecha+izquierda)\r\n break\r\n else:\r\n menor = menor+1\r\n izquierda = izquierda+i\r\n if mayor == menor:\r\n print(derecha+izquierda)\r\n break", "def tr(x):\n c = 0\n for i in range(x):\n c += i+1\n return c\n\ndef mintr(a,b):\n dif = abs(a-b)\n if dif%2 == 0:\n return 2*tr(int(dif/2))\n else:\n return tr(dif//2)+tr(dif//2 + 1)\n\na = int(input())\nb = int(input())\n\nprint(mintr(a,b))\n", "\r\nclass Amigo:\r\n def __init__(self, posicao, direcao):\r\n self.posicao = int(posicao)\r\n self.cansaco_passo = 0\r\n self.cansaco_total = 0\r\n self.direcao = direcao\r\n\r\n def move(self):\r\n self.cansaco_passo += 1\r\n if self.direcao == -1:\r\n self.posicao -= 1\r\n else:\r\n self.posicao += 1\r\n self.cansaco_total += self.cansaco_passo\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nif a < b:\r\n direcao_a = 1\r\n direcao_b = -1\r\nelse:\r\n direcao_a = -1\r\n direcao_b = 1\r\n\r\namigo_1 = Amigo(a, direcao_a)\r\namigo_2 = Amigo(b, direcao_b)\r\n\r\naux = 0\r\nwhile amigo_1.posicao != amigo_2.posicao:\r\n if aux % 2 == 0:\r\n amigo_1.move()\r\n else:\r\n amigo_2.move()\r\n aux += 1\r\n\r\ncansaco = amigo_1.cansaco_total + amigo_2.cansaco_total\r\nprint(cansaco)", "a = int(input()) \r\nb = int(input())\r\nimport math\r\nlen = abs(a - b)\r\nif len % 2 == 0:\r\n min_tiredness = (len // 2) * ((len // 2) + 1)\r\nelse:\r\n min_tiredness = (len // 2) * ((len // 2) + 1) + (len // 2) + 1\r\n\r\nprint(min_tiredness)\r\n", "x1 = int(input())\r\nx2 = int(input())\r\nmid = (x1+x2)//2\r\nd1 = abs(x1-mid)\r\nd2 = abs(mid-x2)\r\nt = d1*(d1+1)//2 +d2*(d2+1)//2\r\nprint(t)\r\n", "a = int(input())\r\nb = int(input())\r\nd = a-b if a>b else b-a\r\nn = d//2\r\nc = 0 if d%2==0 else n+1\r\nfor i in range(1,n+1):\r\n c += (i<<1)\r\nprint(c)\r\n", "a = int(input())\r\nb = int(input())\r\naF = 1\r\nbF = 1\r\nallF = 0\r\nif b < a:\r\n a, b = b, a\r\nwhile a != b:\r\n a += 1\r\n allF += aF \r\n aF += 1\r\n if a != b:\r\n b -= 1\r\n allF += bF\r\n bF += 1\r\nprint(allF)", "def sum_seq(n):\n ans = 0\n for i in range(1, n + 1):\n ans += i\n return ans\n\n\na = int(input())\nb = int(input())\nif abs(a - b) % 2 == 0:\n print(2 * sum_seq(abs(a - b) // 2))\nelse:\n print(2 * sum_seq(abs(a - b) // 2) + abs(a - b) // 2 + 1)\n", "a, b = int(input()), int(input())\r\na, b = sorted([a, b])\r\ntot = 0\r\nda, db = 1, 1\r\nwhile a != b:\r\n a += 1\r\n tot += da\r\n da += 1\r\n if a == b:\r\n break\r\n b -= 1\r\n tot += db\r\n db += 1\r\nprint(tot)\r\n", "a = int(input())\r\nb = int(input())\r\n\r\nn = abs(b-a)\r\ne = 0\r\nc = 0\r\nif n%2 != 0:\r\n nt = int((n/2) + 0.5)\r\nelse:\r\n nt = int(n/2)\r\n \r\nfor i in range(nt+1):\r\n e = e + 2*i\r\n \r\nif n%2 !=0:\r\n c = e - nt\r\nelse:\r\n \r\n c = e\r\n \r\nprint(c) ", "a=int(input())\r\nb=int(input())\r\nd=abs(b-a)\r\nif d==1:\r\n\tprint(1)\r\nelif d==0:\r\n\tprint(0)\r\nelif d%2==0:\r\n\tp=d//2\r\n\ts=(p*(p+1))//2\r\n\tprint(s*2)\r\nelse:\r\n\tp=d//2\r\n\ts=(p*(p+1))//2\r\n\tprint(s*2+(p+1))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nA\r\n\"\"\"\r\n\r\ndef calculate_tiredness(start, end):\r\n distance = abs(end-start)\r\n return int(distance*(distance+1)/2)\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n middle = (a+b)//2\r\n print(calculate_tiredness(a, middle) + calculate_tiredness(b, middle))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\n \r\ny=c//2\r\nz=c%2+y\r\n \r\nprint((y*(y+1))//2+(z*(z+1))//2)", "f1 = int(input())\nf2 = int(input())\n\nmiddle = (f1 + f2) // 2\n\nt = 1\ntotal = 0\nfor i in range(abs(f1-middle)):\n total += t\n t += 1\nt = 1\nfor i in range(abs(f2-middle)):\n total += t\n t += 1\n\nprint(total)", "a = int(input())\r\nb = int(input())\r\nif abs(a-b) == 1:\r\n print(1)\r\nelse:\r\n dis = (abs(a-b)+1)//2\r\n dis1 = (max(a, b)-dis) - min(a, b)\r\n print( (dis* (dis+1) )//2 + (dis1* (dis1+1) )//2 )", "n = int(input())\r\nm = int(input())\r\na = abs(n-m)\r\nb = a // 2\r\nc = a - b\r\nprint(b * (b + 1) // 2 + c * (c + 1) // 2)\r\n", "a=int(input())\r\nb=int(input())\r\nx=abs(b-a)\r\ny=x//2\r\nif x==1:\r\n print(\"1\")\r\nelif x%2==0:\r\n print(y*(y+1))\r\nelse:\r\n print((y+1)**2)", "a=int(input())\r\nb=int(input())\r\nk=0\r\nfor i in range(1,abs(a-b)//2 +1):\r\n\tk+=2*i\r\nif abs(a-b)%2!=0:\r\n\tk+=abs(a-b)//2 +1\r\nprint(k)", "a = int(input())\r\nb = int(input())\r\nmn = 1e18\r\nfor i in range(1, 1001):\r\n mn = min(mn, abs(i - a)*(abs(i - a) + 1)//2 + abs(i - b)*(abs(i - b) + 1)//2)\r\nprint(mn)", "a=int(input())\r\nb=int(input())\r\nd=abs(a-b)\r\nif d%2==0:\r\n x=d/2\r\n c=2*((x/2)*(1+x))\r\nelse:\r\n x=d//2\r\n c=2*((x/2)*(1+x))+x+1\r\nprint(int(c))", "a=int(input())\r\nb=int(input())\r\nc=abs(a-b)\r\nd=c//2\r\ne=d*(d+1)\r\nif c%2==0:\r\n print(e)\r\nelse:\r\n print(e+(c+1)//2)", "def main():\r\n a = int(input())\r\n b = int(input())\r\n diff = abs(b - a)\r\n x = diff // 2\r\n y = x + 1 if diff % 2 == 1 else x\r\n print((x*(x+1))//2 + (y*(y+1))//2) \r\n\r\nmain()", "a = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nans = 100000000000000000000000000\r\nfor i in range(a, b + 1):\r\n x = ((i - a) * (i - a + 1)) // 2\r\n y = ((b - i) * (b - i + 1)) // 2\r\n ans = min(ans, x + y)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nx = 0\r\nif c%2==0:\r\n x = c//2\r\n print(x*(x+1))\r\nelse:\r\n x = c//2\r\n print(x*(x+1)+(c//2)+1)\r\n \r\n ", "a = int(input())\nb = int(input())\nweakness = 0\ni = 1\nr = abs(a - b)\n\nwhile r >= 2:\n weakness += 2*i\n r -= 2\n i += 1\n\nif r == 1: weakness += i\n\nprint(weakness)\n", "n=int(input())\r\nm=int(input())\r\nif abs(n-m)==1:\r\n print(1)\r\nelif (n-m)%2==0:\r\n print((abs(n-m)//2)*(abs(n-m)//2+1))\r\nelse:\r\n print((abs(n-m)//2+1)*(abs(n-m)//2+1))", "a = int(input())\r\nb = int(input())\r\n\r\nsteps = abs((a - b)) // 2\r\nremaining = abs(a - b) % 2\r\n\r\ntotal = int((steps/2)*(1 + steps)*2 + (steps + 1)*remaining)\r\n\r\nprint(total)", "import math\r\na=int(input())\r\nb=int(input())\r\nk=abs(a-b)\r\nc=k//2\r\nd=k-c\r\nans=0\r\nans=c*(c+1)//2+d*(d+1)//2\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\ndest = abs(a-b)\r\ncel = dest//2\r\nost = dest%2\r\nprint((1+cel)*cel + ost*(cel+1))", "a = int(input())\nb = int(input())\n\nx = abs(a - b) // 2\ns = (x * (1 + x)) // 2\ns *= 2\n\nif (abs(a - b) % 2 == 1):\n s += x + 1\n\nprint(s)\n\t \t \t\t \t\t \t\t \t \t \t\t\t", "import sys \r\n\r\nI=sys.stdin.readline\r\n\r\na=int(I())\r\nb=int(I())\r\n\r\ntired=0\r\nn=abs(a-b)\r\na=1\r\nc=0\r\nwhile n!=0:\r\n\ttired+=a\r\n\tn-=1\r\n\tc+=1\r\n\tif c==2:\r\n\t\tc=0\r\n\t\ta+=1\r\nprint(tired)\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndis = abs(a-b)\r\n\r\n\r\ndef tired(d):\r\n t =0\r\n for i in range(d+1):\r\n t += i \r\n return(t)\r\n\r\n\r\nif (dis%2 == 0):\r\n min_dis = dis//2\r\n total = tired(min_dis)*2\r\n\r\nelif (dis%2 ==1):\r\n min_dis = dis//2\r\n total = tired(min_dis) + tired(min_dis + 1)\r\n\r\nprint(total)\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nc1 = (a + b) // 2\r\nc2 = (a + b + 1) // 2\r\nans = (1 + c1 - a) * (c1 - a) / 2\r\nans += (1 + b - c2) * (b - c2) / 2\r\nif (c1 != c2):\r\n ans += min(c2 - a, b - c1)\r\nprint(int(ans))", "a=int(input())\r\nb=int(input())\r\nz=a-b\r\nif(z<0):\r\n z=z*(-1)\r\nif(z%2==0):\r\n n=z//2\r\n ans=(n*(n+1))\r\nelse:\r\n n=(z-1)//2\r\n ans=(n*(n+1))+(n+1)\r\nprint(ans)\r\n ", "from math import *\r\nn = int(input())\r\nm = int(input())\r\ndiff = abs(m-n)\r\ncount = 0\r\ni = 0\r\ndiff1 = diff//2\r\nfor i in range(1,diff1+1):\r\n count = count + 2*i\r\nif diff%2 != 0:\r\n count = count + i+1\r\nprint(count)", "a=int(input())\r\nb=int(input())\r\n\r\ndiff=abs(a-b)\r\neach=diff//2\r\ntired=(each*(each+1))\r\n\r\nif((diff%2)!=0):\r\n tired+=(each+1)\r\nprint(tired) \r\n \r\n", "a = int(input())\r\nb = int(input())\r\nsum = 0\r\n#tiredness = [item for item in range(abs(a - b))]\r\nfor i in range((abs(a - b)) // 2):\r\n sum += i+1\r\nif abs(a - b) % 2 == 0:\r\n for i in range((abs(a - b)) // 2):\r\n sum += i+1\r\nelse:\r\n for i in range(abs((a - b)) // 2 + 1):\r\n sum += i+1\r\nprint(sum)", "# for _ in range(int(input())): \r\na=int(input()) \r\nb=int(input()) \r\ns=abs(a-b)\r\nif(s%2==0):\r\n s=s//2\r\n print(s*(s+1))\r\nelse:\r\n s=s//2\r\n print((s+1)**2)\r\n# n,m=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n", "import math\r\na=int(input())\r\nb=int(input())\r\ndis=abs(b-a)\r\nif dis%2==0:\r\n dis1=dis//2\r\n sum=0\r\n for i in range(0,dis1+1):\r\n sum=sum+i\r\n ans=sum*2\r\n print(ans)\r\nelse:\r\n dis2=math.ceil(dis/2)\r\n dis3=math.floor(dis/2)\r\n sum1=0\r\n sum2=0\r\n for j in range(0,dis2+1):\r\n sum1=sum1+j\r\n for k in range(0,dis3+1):\r\n sum2=sum2+k\r\n ans1=sum1+sum2\r\n print(ans1)", "x1 = int(input())\r\nx2 = int(input())\r\nif x1 > x2:\r\n\t(x1, x2) = (x2, x1)\r\namount_between = x2 - x1\r\nn = amount_between // 2\r\nrem = amount_between % 2\r\nres = (n + 1) * n + rem * (n + 1)\r\nprint(res)\r\n", "a = int(input())\r\nb = int(input())\r\np = (a+b)//2\r\nn1 = abs(p-a)\r\nn2 = abs(b-p)\r\nans = n1*(n1+1)//2 + n2*(n2+1)//2\r\nprint(ans)\r\n\r\n", "z=input\r\n\r\nn=int(z())\r\nn1=int(z())\r\nfrom math import *\r\nt=ceil((n+n1)/2)\r\nt1,t2=abs(n-t),abs(n1-t)\r\ns1=(t1/2*(t1+1))\r\ns2=(t2/2*(t2+1))\r\nprint(int(s1+s2))\r\n", "import math\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ntiredness = 0\r\nmid = (a+b)//2\r\nmin_v = min(a,b)\r\na_1 = math.fabs(mid - a)\r\nb_1 = math.fabs(b - mid)\r\ntiredness = [i for i in range(0,int(a_1)+1)] + [i for i in range(0,int(b_1)+1)]\r\nprint(sum(tiredness))", "a = int(input())\nb = int(input())\n\nd = abs(a - b)\nh = d // 2\nt = lambda n: n * (n + 1) // 2\nprint(t(h) + t(d - h))", "a=int(input())\r\nb=int(input())\r\nif b==min(a,b):\r\n a,b=b,a\r\nc=(a+b)//2\r\nd=c-a\r\ne=b-c\r\ns=0\r\np=0\r\nfor i in range (1,d+1):\r\n s=s+i\r\nfor j in range (1,e+1):\r\n p=p+j\r\nprint(s+p)\r\n\r\n\r\n", "p=int(input())\r\nq=int(input())\r\nprint((abs(p - q) + 1) ** 2 // 4)", "def f(x):\n return int(x * (x + 1) / 2)\n\n\na = int(input())\nb = int(input())\n\nm = int((a + b) / 2)\nprint(f(abs(m - a)) + f(abs(b - m)))\n", "import math\r\nif __name__ == '__main__' :\r\n a = int(input())\r\n b = int(input())\r\n c = 0\r\n if abs(a-b)%2 == 0 :\r\n for i in range(((a+b)//2)-min(a,b)) :\r\n c = c+i+1\r\n print(2*c)\r\n else :\r\n for i in range(abs(a-b)//2) :\r\n c = c+i+1\r\n print((2*c)+(abs(a-b)//2)+1)", "n=int(input())\r\nm=int(input())\r\nx=(m+n)//2\r\nn=abs(n-x)\r\nm=abs(m-x)\r\nprint(abs(n*(n+1)//2)+abs(m*(m+1)//2))", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nm = int(input())\r\na = abs(n - m)\r\nif a % 2:\r\n\tb = (((a // 2) * (a // 2 + 1)) // 2) * 2 + (a // 2 + 1)\r\n\tprint(b)\r\nelse:\r\n\tb = ((a // 2) * (a // 2 + 1) // 2) * 2\r\n\tprint(b) \r\n", "import math\r\na=int(input())\r\nb=int(input())\r\nf=int(math.fabs(a-b)//2)\r\ns=int(math.fabs(a-b)//2)\r\nf1=0\r\ns1=0\r\nif math.fabs(a-b)%2!=0:\r\n f+=1\r\nfor i in range(f+1):\r\n f1+=i\r\nfor i in range(s+1):\r\n s1+=i\r\nprint(s1+f1)", "import math\r\n\r\ndef answer(first, second):\r\n maxi = max(first, second)\r\n mini = min(first, second)\r\n if (maxi - mini) % 2 == 0:\r\n return 2 * adder((maxi-mini)//2)\r\n else:\r\n return adder(math.ceil((maxi-mini)/2)) + adder((maxi-mini)//2)\r\n\r\ndef adder(value):\r\n if value == 1:\r\n return 1\r\n\r\n return (value*(value+1))//2\r\n\r\ndef main():\r\n a, b = int(input()), int(input())\r\n print(answer(a, b))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nb = int(input())\r\nd = abs(a-b)\r\nif d == 1:\r\n print(1)\r\nelse:\r\n if d%2 == 1:\r\n n = d // 2\r\n s1 = (n*(n+1)) // 2\r\n s2 = ((n+1)*(n+2)) // 2\r\n print(s1+s2)\r\n else:\r\n n = d // 2\r\n s1 = (n*(n+1)) // 2\r\n print(s1+s1)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nx=abs(a-b)//2\r\nif (a-b)%2==0:\r\n t=(1+x)*x\r\nelse:\r\n t=(1+x)*x+x+1\r\nprint(t)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nn = d // 2\r\nif d % 2 == 0:\r\n solution = n * ((n+1) / 2) * 2\r\nelse:\r\n solution = n * ((n+1) / 2) * 2 + n + 1\r\nprint(int(solution))", "a = int(input())\r\nb = int(input())\r\nd = int(abs(b-a))\r\nS = 0\r\nif d % 2 == 0:\r\n\tfor i in range(int(d/2)+1):\r\n\t\tS = S+i\r\n\tprint(2*S)\r\nelse:\r\n\tfor i in range(int((d-1)/2)+1):\r\n\t\tS = S+i\r\n\tprint(2*S+int((d-1)/2)+1)", "a=int(input())\r\nb=int(input())\r\n\r\ndef fact(a):\r\n ans=0\r\n for i in range(a,0,-1):\r\n ans=ans+i\r\n return ans\r\nd=abs(a-b)\r\nif d==1:\r\n print(\"1\")\r\nelif d%2==0:\r\n a=fact(d//2)\r\n a=a*2\r\n print(a)\r\nelse:\r\n a=fact(d//2)\r\n b=fact((d+1)//2)\r\n print(a+b)\r\n", "a = int(input())\r\nb = int(input())\r\nm = (a+b) // 2\r\ns = 0\r\nfor i in range(abs(m-a)):\r\n s += i+1\r\nfor i in range(abs(b-m)):\r\n s += i+1\r\nprint(s)", "a = int(input())\r\nb = int(input())\r\nfirst = 1\r\nsecond = 1\r\ntired = 0\r\nwhile a != b:\r\n\tif a < b:\r\n\t\tif first <= second:\r\n\t\t\tfirst += 1\r\n\t\t\ttired += first - 1\r\n\t\t\ta += 1\r\n\t\telse:\r\n\t\t\tsecond += 1\r\n\t\t\ttired += second - 1\r\n\t\t\tb -= 1\r\n\telse:\r\n\t\tif first <= second:\r\n\t\t\tfirst += 1\r\n\t\t\ttired += first - 1\r\n\t\t\ta -= 1\r\n\t\telse:\r\n\t\t\tsecond += 1\r\n\t\t\ttired += second - 1\r\n\t\t\tb += 1\r\nprint(tired)", "a=int(input())\r\nb=int(input())\r\nsteps=0\r\nd=(a+b)//2\r\nif a>b:\r\n tmp=a\r\n a=b\r\n b=tmp\r\nfor i in range(a,d):\r\n steps += (i-a+1)\r\nfor j in range(d,b):\r\n steps += (j-d+1)\r\nprint(steps) \r\n ", "import math;a=int(input());b=int(input());print((math.ceil(abs(a-b)/2))*((math.ceil(abs(a-b)/2)) + 1)//1 - (((a-b)%2))*(math.ceil(abs(a-b)/2)) )", "import math\r\ndef total_tiredness(a,b):\r\n x = math.ceil((a+b)/2)\r\n sum_of_tiredness = 0\r\n for i in range(1,abs(a-x)+1):\r\n sum_of_tiredness += i\r\n for j in range(1,abs(b-x)+1):\r\n sum_of_tiredness += j\r\n return sum_of_tiredness\r\na = int(input())\r\nb = int(input())\r\nif 1<=a<=1000 and 1<=b<=1000 and a!=b:\r\n value = total_tiredness(a,b)\r\n print(value)", "a = int(input())\r\nb = int(input())\r\nmiddle = (a+b) // 2\r\n\r\nsumm = 0\r\nsumm += sum(list(range(1, abs(middle - a) + 1)))\r\nsumm += sum(list(range(1, abs(middle - b) + 1)))\r\n\r\nprint(summ)", "def suma(q):\r\n sump = 0\r\n for i in range(1,q+1):\r\n sump = sump + i \r\n return(sump)\r\na = int(input())\r\nb = int(input())\r\nc = (a+b)//2\r\nc1 = abs(c - a) \r\nc2 = abs(c - b) \r\nprint(suma(c1)+suma(c2))", "GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())\n\ndef main():\n a = GI(); b = GI()\n d = abs(a - b)\n div, mod = divmod(d, 2)\n\n l = [div + mod, div]\n print(int(sum(n * (n + 1) / 2 for n in l)))\n\nmain()\n", "a=int(input())\r\nb=int(input())\r\ndif=abs(a-b)\r\nm1=dif//2\r\nm2=dif-m1\r\nprint(m1*(m1+1)//2+m2*(m2+1)//2)", "def friendsMeeting(a, b):\r\n diff = abs(a - b)\r\n if diff == 1:\r\n return 1\r\n \r\n xa = diff // 2\r\n xb = diff - xa\r\n \r\n return doSum(xa) + doSum(xb)\r\n\r\ndef doSum(n):\r\n return n * (n + 1) // 2\r\n\r\na, b = int(input()), int(input())\r\nprint(friendsMeeting(a, b))", "a=int(input())\r\nb=int(input())\r\ns=abs(a-b)\r\nt=0\r\ni=1\r\nwhile s>0:\r\n if s==1:\r\n t+=i \r\n s-=1\r\n else:\r\n s-=2\r\n t+=i*2\r\n i+=1\r\nprint(t)\r\n ", "def minSteps(a, b):\r\n diff = abs(a - b)\r\n n = diff // 2\r\n if diff % 2 == 0:\r\n return n * (n + 1)\r\n else:\r\n return (n * (n + 1) // 2) + ((n + 1) * (n + 2) // 2)\r\n\r\na = int(input())\r\nb = int(input())\r\nprint(minSteps(a, b))", "a = int(input())\r\nb = int(input())\r\nz = abs(a-b)//2\r\nx = z*(z+1)\r\nif abs(a-b)%2 !=0:\r\n\ty = z+1\r\nelse:\r\n\ty =0\r\nprint(x+y)", "import math as m\r\na=int(input())\r\nb=int(input())\r\nif b<a:\r\n a,b=b,a\r\nd=a+m.ceil(abs(a-b)/2)\r\nx=d-a\r\ny=b-d\r\nstress=0\r\nfor i in range(1,x+1):\r\n stress+=i\r\nfor i in range(1,y+1):\r\n stress+=i\r\nprint(stress)", "a = int(input())\r\nb = int(input())\r\n\r\n\r\ndef tiredness(point_one, point_two):\r\n difference = abs(point_one - point_two)\r\n steps_for_each = int(difference / 2)\r\n\r\n result = steps_for_each * (steps_for_each + 1)\r\n\r\n if (difference % 2 != 0):\r\n result += (steps_for_each + 1)\r\n\r\n return result\r\n\r\n\r\nprint(tiredness(a, b))", "a = int(input())\r\nb = int(input())\r\nanswer = 0\r\ni = 1\r\nc = min(a, b)\r\nd = max(a, b)\r\nwhile c != d:\r\n c += 1\r\n answer += i\r\n if c != d:\r\n d -= 1\r\n answer += i\r\n i += 1\r\n\r\nprint(answer)\r\n", "a=int(input())\r\nb=int(input())\r\nif abs(a-b)==1:\r\n print(\"1\")\r\nelse:\r\n n=abs(a-b)\r\n h=n//2\r\n s=(h*(h+1))//2\r\n if n%2==0:\r\n print(2*s)\r\n else:\r\n r=(2*s)+(h+1)\r\n print(r)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b:\r\n temp = a\r\n a = b\r\n b = temp\r\n\r\natired = 1\r\nbtired = 1\r\nscore = 0\r\n\r\nwhile a != b:\r\n a += 1\r\n score += atired\r\n atired += 1\r\n if a == b:\r\n break\r\n\r\n b -= 1\r\n score += btired\r\n btired += 1\r\n\r\nprint(score)", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nodd=False\r\nif diff&1==1:\r\n\todd=True\r\ndiff=diff//2\r\nfirst=(diff*(diff+1))//2\r\nif odd:\r\n\tdiff+=1\r\n\tsecond=(diff*(diff+1))//2\r\n\tprint(first+second)\r\nelse:\r\n\tprint(first*2)", "a = int(input())\r\nb = int(input())\r\n\r\nd = max(a-b,b-a)\r\n\r\nif d%2 == 0:\r\n\ty = int(d/2)\r\nelse:\r\n\ty = int(d/2)+1\r\n\r\nf1 = 0\r\nfor i in range(1,int(d/2)+1):\r\n\tf1 += i\r\n\r\nf2 = 0\r\nfor i in range(1,y+1):\r\n\tf2 += i\r\n\r\nif d == 1:\r\n\tprint(1)\r\nelse:\r\n\tprint(f1+f2)", "a=int(input())\r\nb=int(input())\r\nt=abs(a-b)\r\nA=t//2\r\nB=0\r\nfor i in range(1,A+1):\r\n B+=i\r\nif t%2==0: \r\n print(B*2)\r\nelse:\r\n print(B*2+1+A)", "a = int(input())\nb = int(input())\n\nacount = 0\nbcount = 0\n\naturn = True\ntotal = 0\n\nif (a < b):\n t = a\n a = b\n b = t\n\nwhile (a!=b):\n if (aturn):\n a -= 1\n acount += 1\n total += acount\n else:\n b += 1\n bcount += 1\n total += bcount\n aturn = not aturn\n\nprint(total)", "m1=int(input())\r\nm2=int(input())\r\nl=int((m1+m2)/2)\r\nd1=abs(m1-l)\r\nd2=abs(m2-l)\r\ns=0\r\nfor i in range(1,d1+1):\r\n s=s+i\r\nfor i in range(1,d2+1):\r\n s=s+i\r\nprint(s)", "import math\n# y, x = list(map(int, input().split(\"\\n\")))\n\nx = int(input().strip())\ny = int(input().strip())\n\ndef test_1(y, x):\n a = y - x + 1\n if x == 0:\n return \"No\"\n if x ==1 and y !=0:\n return \"No\"\n if a < 0:\n return \"No\"\n else:\n b = a/2 + 1\n if round(b/round(b), 10)==1.0:\n return 'Yes'\n else:\n return 'No'\n\ndef test_2(y, x):\n n = abs(x - y)\n # print(x, y, n)\n\n if n % 2 == 1:\n n = n//2 + 1\n a1 = n*(n-1)/2\n a2 = n*(n+1)/2\n a = a1+a2\n else:\n n = n // 2\n a = n * (n + 1)\n\n return int(a)\n\naa = test_2(y, x)\nprint(aa)\n\n \t \t \t \t \t\t\t \t\t \t\t\t\t\t\t", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nif b>a:\r\n x=0\r\n y=0\r\n for n in range(1,b-c+1):\r\n x=x+n\r\n for n in range(1,c-a+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\nelif a>b:\r\n x=0\r\n y=0\r\n for n in range(1,a-c+1):\r\n x=x+n\r\n for n in range(1,c-b+1):\r\n y=y+n\r\n z=x+y\r\n print(z)\r\n", "# Friends Meeting\r\na = int(input())\r\nb = int(input())\r\nd = abs(a-b)//2\r\nif abs(a-b) % 2 == 0:\r\n print(d*(d+1)) \r\nelse:\r\n print(int(d*(d+1)/2 + (d+1)*(d+2)/2))", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n t = c // 2\r\n print(((1 + t) * t))\r\nelse:\r\n t = c // 2\r\n r = t * (1 + t)\r\n print(r + t + 1)\r\n \r\n", "def tired(a, b):\r\n t = abs(a - b)\r\n if t % 2 == 0:\r\n r = t // 2\r\n return r * (r + 1)\r\n t1, t2 = t // 2, t // 2 + 1\r\n return t1 * (t1 + 1) // 2 + t2 * (t2 + 1) // 2\r\n\r\n\r\nA = int(input())\r\nB = int(input())\r\nprint(tired(A, B))\r\n", "a = int(input())\r\nb = int(input())\r\nlen = abs(a-b)\r\nac = len//2\r\nbc = len - len//2\r\nans = (ac*(ac+1)//2 ) + (bc*(bc+1)//2 )\r\nprint(ans)", "first=int(input())\r\nsecond=int(input())\r\n\r\nfn=0\r\nsn=0\r\nz=abs(first-second)\r\n\r\nmas=[]\r\nwhile True:\r\n if z>0:\r\n z=z-1\r\n sn=sn+1\r\n mas.append(sn)\r\n if z>0:\r\n z=z-1\r\n fn=fn+1\r\n mas.append(fn)\r\n else: \r\n break\r\n\r\nprint(sum(mas))", "a = int(input())\r\nb = int(input())\r\nai = bi = ans = 0\r\ni = 1\r\nif a > b:a, b = b, a\r\nwhile a != b:\r\n if i%2:\r\n ai += 1\r\n ans += ai\r\n a += 1\r\n else:\r\n bi += 1\r\n ans += bi\r\n b -= 1\r\n i += 1\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nd = c // 2\r\nc -= d\r\nprint((c * (c + 1)) // 2 + (d * (d + 1)) // 2)", "a = int(input())\r\nb = int(input())\r\n\r\nif a > b:\r\n a, b = b, a\r\n \r\nmedian = (a+b) / 2\r\nif int(median) == median:\r\n left_steps = median - a\r\n rigth_steps = b - median\r\nelse:\r\n left_steps = int(median) - a + 1\r\n rigth_steps = b - int(median)-1\r\n \r\nnum = left_steps * (left_steps+1) // 2\r\nnum += rigth_steps * (rigth_steps+1) // 2\r\nprint(int(num))", "from collections import Counter\r\na = int(input())\r\nb = int(input())\r\np = abs(a - b)\r\nif p == 1:\r\n print(1)\r\nelse:\r\n q = p//2\r\n m = p - (q * 2)\r\n print((q * (q + 1)) + ((q + 1) if p%2 != 0 else 0))", "a = int(input())\r\nb = int(input())\r\n\r\nif a>b:\r\n a, b = b, a\r\nm=int((b-a)/2)\r\nk=(b-a-m)\r\nc=int((m*(m+1))/2+(k*(k+1))/2) \r\n# 1+2+3+4+5+...+k=(k*(k+1))/2\r\nprint(c)\r\n", "a=int(input())\nb=int(input())\nc=abs(a-b)\nd=c//2\nif c%2==0:\n x=[i for i in range(d+1)]\n print(2*sum(x))\nelse:\n x=[i for i in range(d+1)]\n print(2*sum(x)+(d+1))", "a = int(input())\r\nb = int(input())\r\nn = abs(a-b)//2\r\nif abs(a-b) % 2 == 0:\r\n print(n*(n+1))\r\nelse:\r\n print((n*(n+1))+n+1)", "def summation(e):\r\n t = 0\r\n for _ in range(1,e+1):\r\n t = t + _\r\n return t\r\n\r\na,b = int(input()),int(input())\r\nprint(summation(abs(b-a)//2) + summation((abs(b-a)//2)+(abs(b-a)%2)))\r\n#print(summation(3))", "def summation(n):\r\n return (n*(n+1))//2\r\n\r\na = int(input())\r\nb = int(input())\r\ndiff = abs(a-b)\r\n\r\nprint(summation(diff//2)+summation(diff-(diff//2)))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\na, b = min(a, b), max(a, b)\r\nc = (a + b) // 2\r\nprint((c - a)*(c - a + 1) // 2 + (b - c)*(b - c + 1) // 2)\r\n", "a=int(input())\r\nb=int(input())\r\nn=abs(a-b)\r\nif n%2==0:\r\n d=n/2\r\n print(int(d*(d+1)))\r\nelse:\r\n d=n//2\r\n print(int(d*(d+1)+(d+1)))", "a = int(input())\r\nb = int(input())\r\ndiff = abs(a - b)\r\ntired = sum(2 *(list(range(1,(diff // 2)+1)))) + ((diff % 2) * (diff - diff// 2))\r\nprint(tired)", "a = int(input())\r\nb = int(input())\r\nd = abs(a - b)\r\nans = (d // 2 + d % 2) * (d // 2 + 1)\r\nprint(ans)", "a=int(input())\r\nb=int(input())\r\nif (1<=a<=1000 and 1<=b<=1000):\r\n if a>b:\r\n n=a-b\r\n else:\r\n n=b-a\r\n m=n//2\r\n if n%2==0:\r\n c=(m*(m+1))\r\n else:\r\n c=((m*(m+1))//2)+(((m+1)*(m+2))//2)\r\nprint(c)\r\n \r\n", "a = int(input())\r\nb = int(input())\r\nm = abs(a - b) // 2\r\ns = 0\r\nfor i in range(1, m + 1):\r\n s += i * 2\r\nif abs(a - b) % 2 == 1:\r\n s += m + 1\r\nprint(s)", "t=list(map(int,(input().split())))\r\nn=list(map(int,(input().split())))\r\na=(t[0]+n[0])//2\r\nq=abs(a-t[0])\r\nw=abs(a-n[0])\r\nprint((w*(w+1))//2+(q*(q+1))//2)", "a=int(input())\r\nb=int(input())\r\ny=abs(a-b)//2\r\nx=(a+b)%2\r\nprint((y*(y+1)//2) + ((x+y)*(x+y+1)//2))\r\n", "a = int(input())\r\nb = int(input())\r\nx, j = 0, 0\r\nif abs(b-a) % 2 == 0:\r\n for i in range(1, (abs(b-a)//2)+1):\r\n x += i\r\n print(2*x)\r\nelse:\r\n for j in range((abs(b-a)//2)+1):\r\n x += j\r\n print((2*x)+j+1)", "a = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a-b)\r\nsumm = 0\r\nmid = diff // 2\r\nstart = 1\r\n\r\nfor i in range(start,mid+1):\r\n summ += i\r\n\r\nif diff % 2 == 0:\r\n print(summ*2)\r\nelse:\r\n print((summ*2)+(mid+1))\r\n\r\n\r\n", "class CodeforcesTask931ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.a = 0\r\n self.b = 0\r\n\r\n def read_input(self):\r\n self.a = int(input())\r\n self.b = int(input())\r\n\r\n def process_task(self):\r\n dist = abs(self.a - self.b)\r\n if dist % 2:\r\n tire1 = dist // 2\r\n tire2 = dist // 2 + 1\r\n else:\r\n tire1 = dist // 2\r\n tire2 = dist // 2\r\n tiredness = sum([x + 1 for x in range(tire1)])\r\n tiredness += sum([x + 1 for x in range(tire2)])\r\n self.result = str(tiredness)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask931ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\ndiff = abs(a - b)\r\n\r\nif diff == 1 :\r\n print(1)\r\n\r\nelse:\r\n a = diff // 2\r\n b = (diff - a)\r\n\r\n suma = ((a*(a+1))/2) + ((b*(b+1))/2)\r\n print(int(suma))", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nif diff%2==0:\r\n diff//=2\r\n print(diff*(diff+1))\r\nelse:\r\n diff//=2\r\n print((diff*(diff+1))+(diff+1))", "n,m=int(input()),int(input())\r\nval=abs(m-n);mid=val//2;val2=val-mid\r\nprint(((mid*(mid+1))//2)+((val2*(val2+1))//2))", "a= int(input())\r\nb= int(input())\r\n\r\ndist= abs(a-b)\r\ntierd=0\r\nc= dist//2\r\n\r\n\r\nfor i in range(c+1):\r\n tierd= tierd+ 2*i\r\n\r\nif dist%2!=0:\r\n tierd = tierd + c+1\r\nprint(tierd)", "a=int(input())\r\nb=int(input())\r\nif a>b:\r\n n=(a-b)//2\r\n if (a-b)%2==0:\r\n k=(n*(n+1))\r\n else:\r\n k=((n*(n+1))+n+1)\r\nelse:\r\n n=(b-a)//2\r\n if (b-a)%2==0:\r\n k=((n*(n+1)))\r\n else:\r\n k=((n*(n+1))+n+1)\r\nprint(k)\r\n\r\n", "a = int(input())\nb = int(input())\nif abs((a - b)) % 2 == 0:\n print((abs(a - b) // 2) * ((abs(a - b) // 2) + 1))\nelse:\n print((abs(a - b) // 2) * ((abs(a - b) // 2) + 1) + abs(a - b) // 2 + 1)", "a=int(input())\r\nb=int(input())\r\nc=abs(b-a)\r\nd=c//2\r\ne=d+c%2\r\nprint((1+e)*e//2+(1+d)*d//2)\r\n", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\nsum1 = 0\r\nsum2 = 0\r\na1 = 1\r\na2 = 1\r\nfor i in range(c):\r\n if i < c//2:\r\n sum1+=a1\r\n a1+=1\r\n else:\r\n sum2 += a2\r\n a2 +=1\r\nprint(sum1+sum2)", "from math import ceil\r\na=int(input())\r\nb=int(input())\r\nn=abs(b-a)\r\nc=n//2\r\nd=ceil(n/2)\r\nprint(c*(c+1)//2 + d*(d+1)//2)", "a = int(input())\r\nb = int(input())\r\nc = abs(a-b)\r\ncounta = c//2\r\ncountb = c-counta\r\nprint(int(counta*(counta+1)/2+countb*(countb+1)/2))", "from math import ceil\n\ndef solve(a, b):\n x = ceil(abs(a - b)/2)\n y = abs(a - b)//2\n if x != y:\n return ((1+y)*y)//2 + ((x+1)*x)//2\n else:\n return ((1+y)*y)\n\n\ndef main():\n a = int(input())\n b = int(input())\n print(solve(a, b))\n\n\nmain()\n", "def tiredness(gap):\n if gap == 0:\n return 0\n frnd1_moves = gap // 2\n frnd2_moves = gap - frnd1_moves\n\n return sum(range(frnd1_moves + 1)) + sum(range(frnd2_moves + 1))\n\npos1 = int(input())\npos2 = int(input())\n\ngap = abs(pos1 - pos2)\nprint(tiredness(gap))", "import math\r\n\r\ndef summation(n):\r\n res = 0\r\n for i in range(1,n+1):\r\n res += i\r\n return res \r\n\r\nx = int(input())\r\ny = int(input())\r\ndistance = abs(y - x)\r\nif distance % 2 == 0:\r\n print(summation(distance//2)*2)\r\nelse:\r\n curr = (distance -1 )//2\r\n val = (summation(curr) * 2) + curr +1\r\n print(val)\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nn=abs(a-b)//2\r\nSum=0\r\nif abs(a-b)%2==1:\r\n print((1+n)*n+n+1)\r\nelse:\r\n print((1+n)*n)", "a = int(input())\nb = int(input())\nc = abs(a - b)\nans = 0\nfor i in range(c // 2 + 1):\n ans += 2 * i\nif c % 2 == 1:\n ans += i + 1\nprint(ans)\n", "a=int(input())\r\nb=int(input())\r\nc=(a+b)//2\r\nprint((c-min(a,b))*(c-min(a,b) +1)//2 + (max(a,b)-c)*(max(a,b)-c +1)//2)\r\n\r\n", "#!/bin/python3\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\nd = abs(a - b)\r\nhalf = d // 2\r\nmiss = d % 2\r\n\r\ntired = 0\r\nfor i in range(1, half+1+miss):\r\n tired += i\r\nfor i in range(1, half+1):\r\n tired += i\r\n\r\nprint(tired)\r\n", "a = int(input())\nb = int(input())\nc = 0\nturn = 0\nwhile a != b:\n\tturn += 1\n\tif a > b:\n\t\ta -= 1\n\t\tc += turn\n\t\tif b < a:\n\t\t\tb += 1\n\t\t\tc += turn\n\telif b > a:\n\t\tb -= 1\n\t\tc += turn\n\t\tif a < b:\n\t\t\ta += 1\n\t\t\tc += turn\nprint(c)", "pos_a=int(input())\npos_b=int(input())\njarak_a=int(abs(pos_b-pos_a)/2)\nc=abs(pos_b-pos_a)%2\n\nif (pos_a!=pos_b) and (1<=pos_a<=1000) and (1<=pos_b<=1000):\n if (c==0):\n tired1=int(jarak_a**2+jarak_a)\n print(tired1)\n elif(c==1):\n tired2=int(jarak_a**2+2*jarak_a+1)\n print(tired2)", "a = int(input())\r\nb = int(input())\r\nz = (abs(a-b)) % 2\r\nc = int((abs(a-b)) / 2)\r\nif(z == 0):\r\n print(int(c *(c+1)))\r\nelse:\r\n print(int((c *(c+1)/2)+((c+1) *(c+2))/2))", "a = int(input())\r\nb = int(input())\r\nl = abs(a-b)\r\nl1 = l//2\r\nl2 = l-l1\r\nprint((l1*(l1+1)//2)+(l2*(l2+1)//2))\r\n", "a=int(input())\r\nb=int(input())\r\nmid=int((a+b)/2)\r\nvermoeidheid=0\r\nif b>a:\r\n hoeveelvoora=int(mid-a)\r\n hoeveelvoorb=int(b-mid)\r\n for i in range(1,hoeveelvoora+1):\r\n vermoeidheid+=int(i)\r\n for j in range(1,hoeveelvoorb+1):\r\n vermoeidheid+=int(j)\r\nif a>b:\r\n hoeveelvoora=int(a-mid)\r\n hoeveelvoorb=int(mid-b)\r\n for i in range(1,hoeveelvoora+1):\r\n vermoeidheid+=int(i)\r\n for j in range(1,hoeveelvoorb+1):\r\n vermoeidheid+=int(j)\r\nprint(vermoeidheid)\r\n\r\n ", "a=int(input())\r\nb=int(input())\r\nf=lambda x:(x+1)*x//2\r\nm=(a+b)//2\r\nprint(f(abs(m-a))+f(abs(m-b)))", "import math\r\n\r\ndef solve(start, end):\r\n start, end = min(start, end), max(start, end)\r\n diff = end - start\r\n n = diff // 2 \r\n res = n * (n + 1) // 2 ## sum of one side\r\n res *= 2 ## both sides(left & right)\r\n if diff % 2:\r\n res += n + 1\r\n return res\r\n\r\n\r\n\r\ndef main():\r\n start = int(input())\r\n end = int(input())\r\n print(solve(start, end))\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve(first, second):\r\n\tresult = 0\r\n\tfirst_tired = 1\r\n\tsecond_tired = 1\r\n\tswing = True\r\n\t\r\n\tif first > second:\r\n\t\tfirst, second = second, first\r\n\t\r\n\twhile first < second:\r\n\t\tif swing:\r\n\t\t\tfirst += 1\r\n\t\t\tresult += first_tired\r\n\t\t\tfirst_tired += 1\r\n\t\t\tswing = not swing\r\n\t\telse:\r\n\t\t\tsecond -= 1\r\n\t\t\tresult += second_tired\r\n\t\t\tsecond_tired += 1\r\n\t\t\tswing = not swing\r\n\t\r\n\treturn result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tfirst_friend = int(input())\r\n\tsecond_friend = int(input())\r\n\t\r\n\tprint(solve(first_friend, second_friend))", "a=int(input())\r\nb=int(input())\r\ndiff=abs(a-b)\r\nn=diff//2\r\ns=0\r\ntiredness=0\r\nif diff==1:\r\n tiredness=1\r\nelif diff==2:\r\n tiredness=2\r\nelse:\r\n for i in range (1,n+1):\r\n s=s+i\r\n if diff%2==0:\r\n tiredness=2*s\r\n else:\r\n tiredness=2*s+n+1\r\nprint(tiredness)\r\n \r\n \r\n", "x=int(input())\r\ny=int(input())\r\ndis=abs(x-y)\r\na=dis//2\r\nb=dis-a\r\nprint(a*(a+1)//2+b*(b+1)//2) if dis>1 else print(1)\r\n", "import math\r\nfriend1=eval(input())\r\nfriend2=eval(input())\r\n\r\nmid=int(math.ceil((friend1+friend2)/2))\r\ndiff1=abs(mid-friend1)\r\ndiff2=abs(friend2-mid)\r\ntot=0\r\nfor i in range(1,diff1+1):\r\n tot+=i\r\nfor i in range(1,diff2+1):\r\n tot+=i\r\nprint(tot)", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b)\r\nif c % 2 == 0:\r\n print(2 * (c//2 * (c//2 + 1)) // 2)\r\nelse:\r\n print(c//2 * (c//2 + 1) // 2 + (c//2 + 1) * (c//2 + 2) // 2)", "a = int(input())\nb = int(input())\n\nmeio = (a+b) // 2\nd1 = abs(a - meio)\nd2 = abs(b - meio)\n\ns1 = sum(range(d1+1))\ns2 = sum(range(d2+1))\nprint(s1+s2)\n\t \t \t \t \t \t\t \t\t \t \t\t \t\t", "a=int(input())\r\nb=int(input())\r\nn=0\r\nk=0\r\nf=0\r\ns=0\r\nl=0\r\nn=(abs(b-a))//2\r\nf=((1+n)*n)//2\r\nl=abs(b-a)-n\r\ns=((1+l)*l)//2\r\nk=s+f\r\nprint(k)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\ndis = abs(a-b)\r\n\r\nif dis % 2 == 0:\r\n x = dis // 2 * (dis // 2 + 1)\r\nelse:\r\n x = dis // 2 * (dis // 2 + 2) + 1\r\n\r\nprint(x)\r\n", "def move(f1,f2):\r\n counter = 0\r\n tiredx1 = 0\r\n tiredx2 = 0\r\n a_list = []\r\n\r\n if (f1<f2):\r\n x1 = f1\r\n x2 = f2\r\n else:\r\n x1 = f2\r\n x2 = f1\r\n \r\n x1 +=1\r\n tiredx1 +=1\r\n a_list.append(tiredx1)\r\n while(x1 != x2):\r\n x2 -= 1\r\n tiredx2 += 1\r\n a_list.append(tiredx2)\r\n if (x1 != x2):\r\n x1 += 1\r\n tiredx1 +=1\r\n a_list.append(tiredx1)\r\n \r\n for k in a_list:\r\n counter += k\r\n \r\n \r\n \r\n return counter\r\n\r\n \r\n\r\ndef main():\r\n f1 = int(input())\r\n f2 = int(input())\r\n print(move(f1,f2))\r\n\r\n\r\nmain()", "#brrrr big brrrr u already know ice spice pooh shiest type stuff going on round here fr fr\nimport math\na = int(input())\nb = int(input())\nx = abs(b - a)\ny = x % 2 != 0\nx //= 2\nprint((x + y) * (x + 1))\n\n", "a= int(input())\r\nb= int(input())\r\nd= abs(a-b)\r\nh= d // 2\r\nif d%2 == 0:\r\n print(h*(h+1))\r\nelse:\r\n print((h+1)*(h+1))", "a = int(input())\r\nb = int(input())\r\nc = abs(a - b) // 2\r\ns = 2 * sum(list(range(c + 1)))\r\nif abs((a - b) % 2):\r\n s += c + 1\r\nprint(s)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = int(input())\r\nb = int(input())\r\nif a > b:\r\n a, b = b, a\r\nx = (a + b) // 2\r\nu, v = x - a, b - x\r\nans = (u * (u + 1) + v * (v + 1)) // 2\r\nprint(ans)" ]

{"inputs": ["3\n4", "101\n99", "5\n10", "1\n2", "1\n1000", "999\n1000", "1000\n999", "1000\n1", "2\n1", "2\n999", "2\n998", "999\n2", "998\n2", "2\n1000", "1000\n2", "1\n999", "999\n1", "188\n762", "596\n777", "773\n70", "825\n729", "944\n348", "352\n445", "529\n656", "19\n315", "138\n370", "546\n593", "285\n242", "773\n901", "892\n520", "864\n179", "479\n470", "967\n487", "648\n106", "58\n765", "235\n56", "285\n153", "943\n13", "675\n541", "4\n912"], "outputs": ["1", "2", "9", "1", "250000", "1", "1", "250000", "1", "249001", "248502", "249001", "248502", "249500", "249500", "249500", "249500", "82656", "8281", "123904", "2352", "89102", "2209", "4096", "22052", "13572", "576", "484", "4160", "34782", "117649", "25", "57840", "73712", "125316", "8100", "4422", "216690", "4556", "206570"]}

UNKNOWN

PYTHON3

CODEFORCES

607

d35468d66b47dffb57a8ada4ba7221e5

Vanya and Fence

Vanya and his friends are walking along the fence of height *h* and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed *h*. If the height of some person is greater than *h* he can bend down and then he surely won't be noticed by the guard. The height of the *i*-th person is equal to *a**i*. Consider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard? The first line of the input contains two integers *n* and *h* (1<=≤<=*n*<=≤<=1000, 1<=≤<=*h*<=≤<=1000) — the number of friends and the height of the fence, respectively. The second line contains *n* integers *a**i* (1<=≤<=*a**i*<=≤<=2*h*), the *i*-th of them is equal to the height of the *i*-th person. Print a single integer — the minimum possible valid width of the road. Sample Input 3 7 4 5 14 6 1 1 1 1 1 1 1 6 5 7 6 8 9 10 5 Sample Output 4 6 11

[ "friends_num, fence_height = map(int, input().split())\nfriends_heights = [int(height) for height in input().split()]\n\nroad_width = sum(\n 1\n if height <= fence_height\n else 2\n for height in friends_heights\n)\n\nprint(road_width)\n", "\r\nn,h=map(int, input().split())\r\na= list(map(int, input().strip().split())) [:n]\r\n\r\nc=0\r\nfor i in a:\r\n if(i>h):\r\n c+=2\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\ntotal_width=0\r\nfor height in heights:\r\n if height<=h:\r\n total_width+=1\r\n else:\r\n total_width+=2\r\nprint(total_width)\r\n ", "n , h = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nwidth = n\r\nfor i in l:\r\n if i > h:\r\n width += 1\r\nprint(width)", "n,h = map(int,input().split())\na = list(map(int,input().split())) \nc = 0\nfor i in a:\n if i>h:\n c+=2 \n else:\n c+=1 \nprint(c)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\na1 = list(filter(lambda x: x <= h,a))\r\na2 = list(filter(lambda x: x > h,a))\r\nprint(len(a1) + len(a2)*2)\r\n", "r,c=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncount=0\r\nfor ele in lst:\r\n if ele> c:\r\n count=count+2\r\n else:\r\n count=count+1\r\nprint(count)", "def rng(s,k,lst):\r\n #s is the total number of people like minimum widith and k is the max height possible\r\n count=s\r\n for f in lst:\r\n if f>k:\r\n count+=1\r\n return count\r\ny=input()\r\nalist=[int(x) for x in y.split()]\r\nd=input()\r\nblist=[int(x) for x in d.split()]\r\nprint(rng(alist[0],alist[1],blist))", "x = input().split()\r\nn = int(x[0])\r\nh = int(x[1])\r\nw = 0\r\nheights = input().split()\r\nfor y in heights:\r\n if int(y)>h:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "count_h = str(input())\r\ncount_h = count_h.split(\" \")\r\nheight = int(count_h[1])\r\n\r\nfriends = str(input())\r\nfriends = friends.split(\" \")\r\nreuslt = 0\r\nfor friend in friends:\r\n if(int(friend) <= height):\r\n reuslt = reuslt + 1\r\n else:\r\n reuslt = reuslt + 2\r\nprint(reuslt)", "inpa = input().split(' ')\r\ninpb = input().split(' ')\r\ncounter = 0\r\nfor x in inpb:\r\n if int(x) > int(inpa[1]):\r\n counter += 2\r\n else:\r\n counter += 1\r\nprint(counter)", "n, m = map(int, input().split())\nx = list(map(int, input().split()))\nprint(sum([1 if i <= m else 2 for i in x]))\n \t\t \t \t \t \t \t \t \t \t", "n, h = map(int, input(\"\").split())\r\nlista = list(map(int, input(\"\").split()))\r\nl=0\r\nfor i in range(len(lista)):\r\n if lista[i]<=h:\r\n l = l + 1\r\n else:\r\n l = l + 2\r\nprint(l)", "numAndMaxHeight = [int(a) for a in input().split()]\r\n\r\nheights = [int(a) for a in input().split()]\r\n\r\nwidthOfTheRoad = 0\r\n\r\n\r\nmaxHeight = numAndMaxHeight[1]\r\n\r\ni = 0\r\n\r\nfor height in heights:\r\n if height > maxHeight:\r\n widthOfTheRoad += 2\r\n else:\r\n widthOfTheRoad += 1\r\n\r\nprint(widthOfTheRoad)\r\n", "n,height = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nwidth=0\r\n\r\nfor i in range(n):\r\n if h[i]>height:\r\n width+=2\r\n else:\r\n width+=1\r\n\r\n\r\nprint(width)", "a = input().split()\r\nb = input().split()\r\nn = a[0]\r\nh = int(a[1])\r\ntrack = 0\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\n if b[i] > h:\r\n track += 2\r\n else:\r\n track += 1\r\nprint(track)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc1=0\r\nfor i in c:\r\n if i<=b:\r\n c1+=1\r\n else:\r\n c1+=2\r\nprint(c1)", "n, h = map(int, input().split())\nfriends = list(map(int, input().split()))\nans = 0\n\nfor friend in friends:\n if friend > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n", "n = str(input())\r\nn_list = n.split()\r\nn_list_int = [int(x) for x in n_list]\r\n\r\nheight = str(input())\r\nheight_list = height.split()\r\nheight_list_int = [int(x) for x in height_list]\r\n\r\nsum = 0;\r\n\r\nfor x in height_list_int:\r\n if x > n_list_int[1]:\r\n sum = sum + 2\r\n else:\r\n sum = sum + 1\r\n \r\nprint(sum)", "f,h=map(int,input().split())\r\np=list(map(int,input().split()))\r\na1=0\r\nb1=0\r\nfor i in p:\r\n if i>h:\r\n a1=a1+2\r\n else:\r\n b1=b1+1\r\nprint(a1+b1)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(len(a)):\r\n\tif a[i]>h:\r\n\t\tres+=2\r\n\telse:\r\n\t\tres+=1\r\nprint(res)", "nh=[int(i) for i in input().split()]\r\nn=nh[0]\r\nh=nh[1]\r\nhi=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(len(hi)):\r\n if hi[i]>h:\r\n s+=2\r\n else:\r\n s+=1\r\n\r\nprint(s)", "# Ваня с друзьями идёт по запрещенной территории возле забора высотой h. Чтобы охранник их не заметил, высота каждого\r\n# из друзей не должна превышать h. При этом каждый из них может пригнуться, тогда его точно не будет видно охраннику.\r\n# Высота i-го из друзей равняется ai.\r\n#\r\n# Будем считать, что ширина человека, идущего в полный рост, равна 1, а согнутого — 2. Друзья хотят идти по дороге в\r\n# один ряд, чтобы иметь возможность разговаривать друг с другом. Какой минимальной ширины должна быть (дорога, чтобы)\r\n# все они поместились на ней в один ряд и охранник никого не увидел?\r\n#\r\n# Входные данные\r\n# В первой строке входных данных записаны два целых числа n и h (1≤n≤1000, 1≤h≤1000) — количество друзей и высота\r\n# забора соответственно.\r\n#\r\n# Во второй строке записаны n целых чисел ai (1≤ai≤2h), i-е из которых равняется высоте i-го друга.\r\n#\r\n# Выходные данные\r\n# Выведите единственное целое число — минимальную подходящую ширину дороги.\r\n\r\nn, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwidth_road = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n width_road += 2\r\n else:\r\n width_road += 1\r\nprint(width_road)", "n,h = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nc = 0\r\nfor i in range(len(l)):\r\n if l[i] > h:\r\n c = c+2\r\n else:\r\n c = c+1\r\nprint(c)\r\n ", "import math\r\nimport re\r\nfrom itertools import count\r\nfrom itertools import accumulate\r\n\r\ndef print_hi(name):\r\n # Use a breakpoint in the code line below to debug your script.\r\n print(f'Hi, {name}') # Press Ctrl+F8 to toggle the breakpoint.\r\n\r\n\r\ndef count2(count):\r\n print(f'{count} + 2 = {count+2}')\r\n print(\"if __name__ == '__main__':\")\r\n print(f\"{(hours + ( (wait+minute) // 60)) % 24:0>2}:{((minute + wait) % 60):0>2}\")\r\n\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n))\r\n for i in range(2, 1 + max_div):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ntrans = {'А': 'A', 'а': 'a', 'Б': 'B', 'б': 'b', 'В': 'V', 'в': 'v', 'Г': 'G', 'г': 'g', 'Д': 'D', 'д': 'd',\r\n 'Е': 'E', 'е': 'e', 'Ё': 'E', 'ё': 'e', 'Ж': 'ZH', 'ж': 'zh', 'З': 'Z', 'з': 'z', 'И': 'I', 'и': 'i',\r\n 'Й': 'I', 'й': 'i', 'К': 'K', 'к': 'k', 'Л': 'L', 'л': 'l', 'М': 'M', 'м': 'm', 'Н': 'N', 'н': 'n',\r\n 'О': 'O', 'о': 'o', 'П': 'P', 'п': 'p', 'Р': 'R', 'р': 'r', 'С': 'S', 'с': 's', 'Т': 'T', 'т': 't',\r\n 'У': 'U', 'у': 'u', 'Ф': 'F', 'ф': 'f', 'Х': 'KH', 'х': 'kh', 'Ц': 'TC', 'ц': 'tc', 'Ч': 'CH', 'ч': 'ch',\r\n 'Ш': 'SH', 'ш': 'sh', 'Щ': 'SHCH', 'щ': 'shch', 'Ы': 'Y', 'ы': 'y', 'Э': 'E', 'э': 'e', 'Ю': 'IU', 'ю': 'iu',\r\n 'Я': 'IA', 'я': 'ia' }\r\n#a = [int(x) for x in input().split()]\r\n#print(a[0])\r\n#print(a[1])\r\nans = 0\r\nbuf = [int(x) for x in input().split()]\r\nn = buf[0]\r\nk = buf[1]\r\nfriends = [int(x) for x in input().split()]\r\nfor people in friends:\r\n if people > k:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "n, h = list(map(int, input().split()))\na = list(map(int, input().split()))\nans = 0\nfor person in a:\n if person > h:\n ans += 2\n else:\n ans += 1\nprint(ans)", "n, h = [int(i) for i in input().split()]\nfriends = [int(i) for i in input().split()]\n\n\nwidth = 0\nfor i in range(n):\n\tif friends[i] > h:\n\t\twidth += 2\n\telse:\n\t\twidth += 1\n\n\nprint(width)\n", "ish = list(map(int,input().split()))\r\nreb = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(ish[0]):\r\n if reb[i] <= ish[1]:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)\r\n", "n,h=map(int,input().split())\r\nmy_list=list(map(int,input().split()))\r\ns=0\r\nfor item in my_list:\r\n if item<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n_h = list(map(int,input().split()))\r\nai = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in ai:\r\n if i <= n_h[1]:\r\n counter+=1\r\n else:\r\n counter+=2\r\nprint(counter)", "n,h = list(map(int,input().split()))\r\nfriends = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(len(friends)):\r\n if friends[i] > h:\r\n c += 2\r\n elif friends[i] <= h:\r\n c += 1\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 30 08:08:32 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\ndata=input().split()\r\nheights=[]\r\npeople=int(data[0])\r\nheight=int(data[1])\r\ndata_2=input().split()\r\nwidth=0\r\nfor i in range(people):\r\n heights.append(int(data_2[i]))\r\n if heights[i]>height:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split())\r\na=map(int,input().split())\r\naa=list(a)\r\ns=0\r\nfor i in range(n):\r\n if aa[i]>h:\r\n s+=2\r\n if aa[i]<=h:\r\n s+=1\r\nprint(s)", "n,h = map(int,input().split(\" \"))\r\na = input().split(\" \")\r\n\r\nmaxw = 0;\r\n\r\nfor i in range(n):\r\n if (int(a[i])>h):\r\n maxw +=2;\r\n else:\r\n maxw+=1;\r\n \r\nprint(maxw)", "n,h=map(int, input().split())\r\ncount=0\r\nl=list(map(int, input().split()))\r\nfor i in l:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)", "l=list(map(int,input().strip().split()))\r\nif 1<=l[0]<=1000 and 1<=l[1]<=1000:\r\n c=0\r\n x=list(map(int,input().strip().split()))\r\n for i in x:\r\n if i<=l[1]:\r\n c+=1\r\n else:\r\n c+=2\r\n print(c)\r\n \r\n \r\n ", "n, h = list(map(int,input().split()))\r\ncount = 0\r\nfor person in list(map(int,input().split())):\r\n count += 1 if person<=h else 2\r\nprint(count)", "n=input().split()\r\nf=int(n[0])\r\ns=int(n[1])\r\nh=0\r\nl=input().split()\r\nl=[int(i)for i in l]\r\nfor x in range(f):\r\n if l[x]>s:\r\n h+=2\r\n else:\r\n h+=1\r\n\r\nprint(h)", "n,h=map(int,input().split())\r\ncount=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)\r\n\r\n\r\n", "n, b = map(int, input().split())\r\nprint(n + sum([1 for i in input().split() if int(i) > b]))", "a,b=map(int ,input().split())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in l:\r\n if i<=b:\r\n sum+=1\r\n else:\r\n sum+=2\r\nprint(sum)", "n,h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 0\r\nfor i in a:\r\n if i <= h:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)\r\n", "\"\"\"Ваня и забор\"\"\"\r\n\r\ndef main():\r\n n, h = [int(i) for i in input().split()]\r\n row = [int(i) for i in input().split()]\r\n tmp = [1 if i <= h else 2 for i in row]\r\n print(sum(tmp))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = (int(i) for i in input().split())\r\nline = list(input().split(' '))\r\nline = list(map(int, line))\r\n\r\ncount = 0\r\nfor j in range(n):\r\n if line[j] <= k:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "n, h = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nans = n\n\nfor itr in a:\n if itr>h:\n ans += 1\n\nprint(ans)\n\t\t \t \t \t \t\t \t\t\t\t\t \t\t", "line_1 = input().split()\nline_2 = input().split()\nh = int(line_1[1])\nwidth_road = 0\n\nfor i in line_2:\n if int(i) > h:\n width_road += 2\n else:\n width_road += 1\n\nprint(width_road)", "n , h = map(int,input().split())\r\nfriends = list(map(int,input().split()))\r\nwidth = 0\r\n\r\nfor height in friends:\r\n if height > h:\r\n width += 2\r\n else: width += 1\r\n\r\nprint(width)", "n, h = map(int, input().split())\r\na = map(int, input().split())\r\nw = 0\r\nfor i in a:\r\n\tif i > h: w += 2\r\n\telse: w += 1\r\nprint (w)", "\r\nn, k = list(map(int, input().split()))\r\n\r\nheight_list = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nfor i in height_list:\r\n if i <= k:\r\n total += 1\r\n \r\n else:\r\n total += 2\r\n \r\nprint(total)\r\n ", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in heights:\r\n if (i > h):\r\n width+=2\r\n else :\r\n width+=1\r\nprint(width)\r\n", "n, h = input().split()\nn = int(n)\nh = int(h)\narr = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n if arr[i] > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n\n \t \t\t\t\t\t \t \t\t \t \t\t\t\t \t \t\t", "n , h = map(int,input().split())\r\narr =map(int,input().split()) \r\nc = 0\r\nfor i in arr:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)\r\n ", "n,h=input().split()\r\ntotalFriends=list(map(int,input().split()))\r\nfriendWidth=0\r\nfor i in totalFriends:\r\n if i > int(h):\r\n friendWidth+=2\r\n else:\r\n friendWidth+=1\r\nprint(friendWidth)", "li = []\r\nNumber,High = map(int,input().split())\r\nn = list(map(int,input().split()))\r\nfor i in n:\r\n if i <=High:\r\n li.append(1)\r\n elif i >=High:\r\n li.append(2)\r\nprint(sum(li))", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n if i>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "s=input()\r\nt=s.split()\r\nn=int(t[0])\r\nh=int(t[1])\r\ns=input()\r\nt=s.split()\r\nw=0\r\nfor i in t:\r\n if int(i)>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "import math as m\r\nx=0\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nfor i in c:\r\n x+=(m.ceil(i/b))\r\nprint(x)", "a,b=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nsum=0\r\nfor x in list1:\r\n if x<=b:\r\n sum+=1\r\n else:\r\n sum+=2\r\nprint(sum)", "p=int(input().split()[1])\r\ns=0\r\nfor i in [int(a) for a in input().split()]:\r\n if i>p:\r\n s += 2\r\n else:\r\n s +=1\r\nprint(s)\r\n", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate the minimum road width\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\n\r\n# Print the result\r\nprint(width)\r\n", "n,h=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nfor i in a:\n s+=2 if i>h else 1\nprint(s)\n ", "w,v=map(int,input().split(\" \"))\r\nc=0\r\nx=input().split(\" \")\r\nfor i in range(w):\r\n if int(x[i])>v:c+=2\r\n else:c+=1\r\nprint(c)", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndouble=0\r\nfor i in b:\r\n if i >a[1]:\r\n double+=1\r\nprint(a[0]+double)", "friends = input().split()\r\nfence_height = friends[1]\r\nheights = input().split()\r\nwidth = 0\r\n\r\nfor height in heights:\r\n if int(height) > int(fence_height):\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-10-16 00:11:53\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\nmod = 10 ** 9 + 7 # 998244353\r\n\r\nn, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(n + sum(x > h for x in a))\r\n", "input_friends_fence = input()\ninput_friend_heights = input()\n\nheight_list = input_friend_heights.split(\" \")\nn_friends = input_friends_fence.split(\" \")[0]\nfence_height = int(input_friends_fence.split(\" \")[1])\n\nwidth = 0\nfor friend in height_list:\n if int(friend) > fence_height:\n width += 2\n else:\n width += 1\n\nprint(width)\n\t \t \t\t \t \t \t \t \t \t\t\t \t\t", "n,h=map(int,input().split())\r\na=list(map(int,list(input().split())))\r\n#print(a)\r\nb=0\r\nfor i in range(0,n):\r\n if a[i]>h:\r\n b+=2\r\n else:\r\n b+=1\r\nprint(b)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n count+=2\r\n else:\r\n count+=1 \r\nprint(count)", "s = input()\r\ns = s.split(' ')\r\nn = int(s[0])\r\nh = int(s[1])\r\na = input()\r\na = a.split(' ')\r\nc = 0\r\nfor i in a:\r\n i = int(i)\r\n if (i <= h):\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "n, h = map(int, input().split())\n\nnums = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n): \n if nums[i] > h: \n count += 2\n else: \n count += 1\n\nprint(count)\n", "numbers = map(int, open(0).read().split())\r\nN, h, *a = numbers\r\ncount_greater_than_h = sum(n > h for n in a)\r\nresult = N + count_greater_than_h\r\nprint(result)\r\n", "N, h = map(int, input().split())\r\nlst = [int(x) for x in input().split(\" \",N)]\r\nlst1 = []\r\nfor i in lst:\r\n if i > h:\r\n lst1.append(i)\r\nprint(len(lst1) * 2 + len(lst) - len(lst1))", "n,h=map(int,input().split())\r\na=list(map(int,input().split())) \r\nans=0 \r\nfor i in range(n):\r\n if a[i]<=h:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)\r\n \r\n ", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 0\r\nfor i in a:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n, h = map(int, input().split())\r\ns = input().split()\r\n\r\nc = 0\r\n\r\nfor i in s:\r\n if int(i) > h:\r\n c += 2\r\n if int(i) <= h:\r\n c += 1\r\n\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\nsp = list(map(int, input().split()))\r\nans = 0\r\nfor i in sp:\r\n if i > h:\r\n ans += 2 \r\n else:\r\n ans += 1\r\nprint(ans) \r\n\r\n\r\n", "n,h = map(int,input().split())\r\nfriendsHights = list(map(int, input().split()))\r\nfor frindHight in friendsHights:\r\n if frindHight > h: n+=1\r\nprint(n)", "def road_width(fence_height, friends_height):\r\n width = len(friends_height)\r\n for fr in friends_height:\r\n if fr > fence_height:\r\n width += 1\r\n return width\r\n\r\nn, h = [int(item) for item in input().split()]\r\nprint(road_width(h, friends_height=[int(item) for item in input().split()]))", "a,b=map(int,input().split())\r\nd=0\r\nc=list(map(int,input().strip().split()))[:a]\r\nfor i in range(a):\r\n \r\n if c[i]>b:\r\n d+=2\r\n else:\r\n d+=1\r\nprint (d) ", "n,h = map(int,input().split())\r\nl = list(input().split())\r\nc = 0\r\nfor i in range(n):\r\n if int(l[i]) > h:\r\n c+=2\r\n else:\r\n c+=1\r\n\r\nprint(c)", "n , h = map(int,input().split())\nheights = list(map(int,input().split()))\nwidth = 0\nfor height in heights:\n if height > h :\n width += 2\n else:\n width += 1 \n \nprint(width)", "n, h = input().split()\n\nn = int(n)\nh = int(h)\n\na = input().split()\n\nfor i in range(len(a)):\n a[i] = int(a[i])\n\nans = 0\n\nfor i in range(len(a)):\n if a[i] > h:\n ans += 2\n else:\n ans += 1\n\nprint(ans)\n \t\t \t \t\t\t\t \t\t\t\t \t\t \t\t \t", "def solve():\r\n n, h = map(int, input().split())\r\n l = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in l:\r\n ans += 1 + (i > h)\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "a,b=map(int,input().split())\r\ncount=0\r\nlis=list(map(int,input().split()))\r\nfor i in lis:\r\n if i<=b:\r\n count=count+1\r\n else:\r\n count=count+2\r\nprint(count)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 19 16:07:49 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nn,h=map(int, input().split())\nlist1=list(map(int, input().split()))\nk=0\nif 1<=n<=1000 and 1<=h<=1000:\n if len(list1)==n:\n for i in list1:\n if 1<=i<=2*h:\n if i<=h:\n k+=1\n else:\n k+=2 \n print(k)\n\n ", "n,h = map(int,input().split()) \r\na = list(map(int,input().split()))\r\nsum = 0\r\nfor num in a:\r\n if num > h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "friends, fence_height = [int(x) for x in input().split()]\r\nfriends_height = [int(x) for x in input().split()]\r\nroad_width = 0\r\n\r\nfor height in friends_height:\r\n if height > fence_height:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\n\r\nprint(road_width)", "n=input(\"\").split()\r\nh=input(\"\").split()\r\nwidth=0\r\nfor i in range(int(n[0])):\r\n if int(h[i])>int(n[1]):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width) ", "n, h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range (n):\r\n if a[i]<=h:\r\n k += 1\r\n elif a[i]>h:\r\n k += 2\r\nprint(k)", "n,h=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\ncount=0\r\nfor i in height:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)\r\n ", "n,h = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nwidth = 0\r\nsum =0 \r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n sum += 2\r\n else:\r\n sum += 1\r\n\r\nprint(sum)", "n,h=map(int,input().split())\r\n\r\nvector =list(map(int,input().split()))\r\nwidth =0\r\nfor l in vector:\r\n if l<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "friends, fence = map(int,input().split())\r\nheight = map(int,input().split(\" \"))\r\nwidth = 0\r\n\r\nfor x in height:\r\n if x <= fence:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)\r\n\r\n", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nc=0\r\nfor i in a:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "pg = input().split()\r\nx = 0\r\ny = 0\r\np,g = int(pg[0]), int(pg[1])\r\na = list(map(int, input().split()))\r\nfor i in range(p):\r\n a\r\n if a[i]>g:\r\n x += 2\r\n elif a[i]<=g:\r\n y += 1\r\nprint(x+y)\r\n\r\n", "n,h = map(int,input().split())\r\n\r\nc = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if c[i]<=h:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n \r\nprint(cnt)", "n_h = input()\r\nlist_n_h = n_h.split()\r\n\r\nan = input()\r\nlist_an = an.split()\r\n\r\nc = 0\r\nfor i in range(0, int(list_n_h[0])):\r\n if int(list_an[i]) <= int(list_n_h[1]):\r\n c+=1\r\n else:\r\n c+=2\r\n\r\nprint(c)", "s=input(\"\")\r\nh=input(\"\")\r\ns=s.split(\" \")\r\nh=h.split(\" \")\r\nw=0\r\n\r\nfor j in h:\r\n if int(j)>int(s[1]):\r\n w=w+2\r\n else:\r\n w=w+1\r\n \r\nprint(w)", "n,m = map(int,input().split())\r\na = map(int,input().split())\r\nt = 0\r\nfor i in a:\r\n if i>m:\r\n t+=2\r\n else:\r\n t+=1\r\nprint(t)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=n\r\nfor i in l:\r\n if i > h:\r\n n+=1\r\nprint(n)", "n, h = map(int, input().split())\r\ns = input().split()\r\ns = list(s)\r\nk = 0\r\n\r\nfor i in range(n):\r\n\r\n if int(s[i]) <= h:\r\n k += 1\r\n elif int(s[i]) > h:\r\n k += 2\r\n\r\nprint(k)", "s=input()\r\nl=(s.split(\" \"))\r\nn=l[0]\r\nh=l[1]\r\ndel l\r\ndel s\r\ns=input()\r\na=(s.split(\" \"))\r\nans=0\r\nfor i in a:\r\n if int(i)>int(h): ans+=2\r\n else: ans+=1\r\nprint(ans)", "a, a_1 = map(int, input().split())\r\nb = map(int, input().split())\r\ncounter = 0\r\nfor i in b:\r\n if i == a_1:\r\n counter += 1\r\n if i > a_1:\r\n counter += 2\r\n if i < a_1:\r\n counter += 1\r\nprint(counter)", "x=list(map(int,input().split(' ')))\r\ny=list(map(int,input().split(' ')))\r\n\r\nn=x[0]\r\nh=x[1]\r\ns=0\r\nfor i in range (n):\r\n if y[i]<= h:\r\n s+=1\r\n else:\r\n s+=2\r\n\r\nprint(s)\r\n", "n, h = map(int,input().split())\r\ns = list(str(input()).split())\r\n\r\nsuma = n\r\n\r\nfor i in range(n):\r\n if int(s[i]) > h:\r\n suma += 1\r\n\r\nprint(suma)", "l = input().split()\nn, h = list(map(int, l))\n\nl = input().split()\nx = list(map(int, l))\n\nres = 0\nfor i in range(len(x)):\n if x[i] > h:\n res += 2\n else:\n res += 1\n\nprint(res)", "_, h = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\nctr = 0\r\nfor ele in lst:\r\n if ele > h:\r\n ctr += 2\r\n else:\r\n ctr += 1\r\n\r\nprint(ctr)", "n,h=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n count+=1\r\n elif a[i]>h:\r\n count+=2\r\nprint(count)\r\n \r\n ", "m,n=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n if lst[i]>n:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "nf, wh = map(int, input().split())\r\nheights = map(int, input().split())\r\nw = 0\r\nfor h in heights:\r\n if h > wh:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)", "n, h = map(int, input().split())\r\nn = map(int, input().split())\r\ncount = 0\r\nfor i in n:\r\n count += 2 if i > h else 1\r\nprint(count)", "n, h = map(int, input().split())\r\nr = map(int, input().split())\r\nr = list(r)\r\notv = n\r\nfor i in range(len(r)):\r\n if r[i]>h:\r\n otv+=1\r\nprint(otv)\r\n", "s = input()\r\nb = s.split()\r\nn = int(b[0])\r\nh = int(b[1])\r\nc = input()\r\nd = c.split()\r\nans = 0\r\n\r\nfor i in d:\r\n\tif int(i) > h:\r\n\t\tans = ans + 2\r\n\telse:\r\n\t\tans = ans + 1\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n if i>b:\r\n count+=2\r\n elif i==b or i<b:\r\n count+=1\r\nprint(count)", "a,b=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nans=0\r\nfor x in h:\r\n if x<=b:\r\n ans=ans+1\r\n if x>b:\r\n ans=ans+2\r\nprint(ans)", "n,h =map(int, input().split())\r\nfor i in map(int, input().split()):\r\n if i > h:\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nl=list(map(int,input().strip().split()))\r\na=0\r\nfor i in l:\r\n if i>h:\r\n a+=2\r\n else :\r\n a+=1 \r\nprint(a)\r\n ", "Z=input().split(\" \")\r\nW=input().split(\" \")\r\noutput=0\r\nfor i in range (int(Z[0])):\r\n if (int(W[i])>int(Z[1])):\r\n output +=2\r\n else:\r\n output +=1\r\n\r\nprint (output)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input().split()\nfor i in range (len(a)):\n a[i]=int(a[i])\nans=0\nfor i in range (len(a)):\n if a[i] > h:\n ans+=2\n else:\n ans+=1\nprint(ans)\n\n\t\t\t\t\t \t\t\t \t \t \t\t \t \t \t\t \t\t\t\t\t", "\r\nn , h = map(int , input().split(' '))\r\nheight_list = input().split(' ')\r\nneeded_width = 0\r\nfor friend in height_list :\r\n if int(friend) <= h :\r\n needed_width += 1\r\n elif int(friend) > h :\r\n needed_width += 2 \r\n\r\nprint(needed_width)\r\n\r\n", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i>h:\r\n n+=1\r\nprint(n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 2 09:37:00 2023\r\n\r\n@author: 10\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n,u=map(int,input().split())\r\nh=list(map(int,input().split()))\r\nans = 0\r\nfor i in h:\r\n if i > u:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\nans = n\r\nfor man in arr:\r\n if man > h:\r\n ans += 1\r\n\r\nprint(ans)", "s0=input().split()\r\ns=input().split()\r\nn,h=int(s0[0]),int(s0[1])\r\nw=0\r\nfor i in range(n):\r\n if int(s[i])<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n , h = map(int, input().split())\r\nlist_i = list(map(int, input().split()))\r\n\r\nnumber = [1 for _ in range(n)]\r\n\r\nfor i, elements in enumerate(list_i):\r\n if elements > h:\r\n number[i] = 2\r\n else:\r\n number[i] = 1\r\nprint(sum(number))", "n, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\ncnt = 0\nfor a in arr:\n if a > h:\n cnt += 2\n else:\n cnt += 1\nprint(cnt)\n \n#hh\n\t\t\t \t \t \t\t \t \t \t\t \t\t \t\t", "n,y=map(int,input().split())\r\nqi = list(map(int,input().split()))\r\nr=0\r\nfor i in qi:\r\n if i>y:\r\n r+=2\r\n else:\r\n r+=1\r\nprint(r)", "n, h = map(int, input().split())\r\n\r\npeople = list(map(int, input().split()))\r\nwidth = 0\r\n\r\nfor i, ppl in enumerate(people):\r\n if ppl > h:\r\n width += 2\r\n continue\r\n width += 1\r\n \r\n\r\nprint(width)\r\n", "n, k = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nl = [1 if i <= k else 2 for i in h]\r\nprint(sum(l))", "n,h=map(int,input().split())\r\ncount=0\r\ns=list(map(int,input().split()))\r\nfor i in s:\r\n if i>h:\r\n count+=2\r\n else:count+=1\r\nprint(count)", "a=list(map(int,input().split()))\r\nf=a[0]\r\nh=a[1]\r\nsumi=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i>h:\r\n sumi+=2\r\n else:\r\n sumi+=1\r\nprint(sumi)", "n , h = map(int, input().split(\" \"))\r\nk = list(map(int,input().split(\" \")))\r\ncount = 0\r\nfor i in k:\r\n if i > h:\r\n count += 2\r\n else:\r\n count +=1\r\nprint(count)", "a,b= map(int,input().split())\r\nt=list(map(int,input().split()))\r\ncount=0\r\nfor i in t:\r\n\r\n if i>b:\r\n count +=2\r\n elif i<=b:\r\n count+=1\r\n \r\nprint(count)", "a, b = [int(x) for x in input().split()]\r\nn = input()\r\nnl = n.split()\r\nc = 0\r\nfor i in (nl) :\r\n if int(i) > b :\r\n c += 2\r\n else :\r\n c += 1\r\nprint(c)", "(n,h)=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nw=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n w=w+2\r\n else:\r\n w=w+1\r\nprint(w)\r\n ", "def width_cal():\r\n person_n_height = list(map(int,input().strip().split()))[:2]\r\n n_person = person_n_height[0]\r\n height = person_n_height[1]\r\n list_of_heights = list(map(int,input().strip().split()))[:n_person]\r\n width = 0\r\n for person in range(len(list_of_heights)):\r\n if list_of_heights[person]>height:\r\n width+=2\r\n else:\r\n width+=1\r\n return width\r\nprint(width_cal())\r\n", "friends, fence = list(map(int, input().split()))\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\n\r\nfor h in heights:\r\n if h <= fence:\r\n width = width + 1\r\n else:\r\n width = width + 2\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nw=0\r\nfor i in l1:\r\n if(i>h):\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "def vanyaandfence(n, h, persons):\r\n width = 0\r\n for i in persons:\r\n if i <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n print(width)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num_array = input().split()\r\n n = int(num_array[0])\r\n h = int(num_array[1])\r\n persons = list(map(int, input().split()))\r\n vanyaandfence(n, h, persons)\r\n", "m, x = map(int, input().split())\r\nph = list(map(int, input().split()))\r\nresult = 0\r\nfor i in ph:\r\n if i > x:\r\n result += 2\r\n else:\r\n result += 1\r\nprint(result) ", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(1 if i <= h else 2 for i in a))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 16 23:28:00 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nnh = input().split()\r\nn = int(nh[0])\r\nh = int(nh[1])\r\nwid = 0\r\nppl = input().split()\r\nfor i in ppl :\r\n if int(i) > h :\r\n wid += 2\r\n elif int(i) <= h :\r\n wid += 1\r\nprint(wid)", "def minWidth(numFriends, fenceHeigh, friends):\n count = 0\n friendsList = friends.split(\" \")\n for x in friendsList:\n if int(x) > int(fenceHeigh):\n count += 1\n total = len(friendsList) + count\n\n return total\n \n \n\ndef main():\n numFriends, fenceHeight = input().split(\" \")\n friends = input()\n print(minWidth(numFriends, fenceHeight, friends))\n \n\nif __name__ == \"__main__\":\n main()", "l = list(map(int,input('').split()))\r\np = list(map(int,input('').split()))\r\nj=0\r\nfor i in range(l[0]):\r\n if p[i]>l[1]:\r\n j=j+1\r\n j=j+1\r\nprint(j)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if l[i]>h:c+=2\r\n else:c+=1\r\nprint(c)", "nh=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\ns=nh[0]\r\nfor i in range(nh[0]):\r\n if a[i]>nh[1]:\r\n s+=1\r\n else: pass\r\nprint(s)", "n , h =map(int , input().split())\r\na=list(map(int , input().split()))\r\nres=0\r\n\r\nfor x in range(n):\r\n if a[x] > h:\r\n res+=2\r\n else:\r\n res+=1\r\nprint(res)", "n, h = map(int, input().split(\" \"))\r\narr = map(int, input().split(\" \"))\r\ns = 0\r\nfor i in arr:\r\n s += 2 if (i // h and i!= h) else 1\r\n\r\nprint(s)", "a = input()\r\nn = \"\"\r\nh = \"\"\r\nnum = 0\r\nwhile num < len(a) and a[num] != \" \":\r\n n = n + a[num]\r\n num = num + 1\r\nnum = num + 1\r\nwhile num < len(a) and a[num] != \" \":\r\n h = h + a[num]\r\n num = num + 1\r\nb = input()\r\ncount = 0\r\nwidth = 0\r\nheight = \"\"\r\nwhile count < len(b):\r\n if b[count] != \" \":\r\n height = height + b[count]\r\n else:\r\n if int(height) > int(h):\r\n width = width + 2\r\n else:\r\n width = width + 1\r\n height = \"\"\r\n count = count + 1\r\nif int(height) > int(h):\r\n width = width + 2\r\nelse:\r\n width = width + 1\r\nprint(width)", "def largeur(liste,hauteur):\r\n res=0\r\n for i in range(len(liste)):\r\n if int(liste[i])<=hauteur:\r\n res=res+1\r\n else:\r\n res=res+2\r\n return res\r\n\r\nentrer=input()\r\nentrer=entrer.split()\r\nh=int(entrer[1])\r\nliste=input()\r\nliste=liste.split()\r\nprint(largeur(liste,h))", "n,h=input().split()\r\nheight=list(map(int ,input().split())) \r\nwidth=0\r\nfor i in height:\r\n if(i<=int(h)):\r\n width+=1\r\n elif(i>int(h)):\r\n width+=2\r\n \r\nprint(width) ", "t = input().split()\r\nw = 0\r\n\r\nfor i in range(len(t)):\r\n t[i] = int(t[i])\r\n \r\nn = t[0]\r\nh = t[1]\r\n\r\nr = input().split()\r\n\r\nfor i in range(n):\r\n r[i] = int(r[i])\r\n\r\nfor i in range(n):\r\n if r[i] > h:\r\n w += 2\r\n \r\n else: w += 1\r\n \r\nprint(w)", "count=0\r\nn=list(map(int, input().split()))\r\nfr=list(map(int, input().split()))\r\nfor i in range(n[0]):\r\n\tif fr[i]<=n[1]:\r\n\t\tcount+=1\r\n\telif fr[i]>n[1]:\r\n\t\tcount+=2\r\nprint(count)", "n, h = map(int, input().split())\r\nans = 0\r\nlist = list(map(int, input().split()))\r\nfor i in list:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\ncount = 0\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nfor a in heights:\r\n if a > h:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,h=map(int,input().split())\r\n\r\nmy_str=map(int,input().split())\r\n\r\n\r\nsum1=0\r\n\r\nfor i in my_str:\r\n if i>h:\r\n sum1 += 2\r\n else:\r\n sum1 +=1\r\n\r\nprint(sum1)", "def main():\r\n n, height = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n width = 0\r\n \r\n for i in range(n):\r\n if arr[i] > height:\r\n width += 2\r\n else:\r\n width += 1\r\n \r\n print(width)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,h=[int(x) for x in input().split()]\r\ne=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n if e[i]>h:\r\n sum=sum+2\r\n else:\r\n sum+=1\r\nprint(sum)", "a,b= map(int, input().split())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in range(a):\r\n if(c[i]<=b):\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "n,h = map(int,input().split())\r\nwidth = 0\r\n\r\nx = list(map(int,input().split()))\r\nfor v in x:\r\n if v > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "n, h = map(int, input().split())\r\np = list(map(int, input().split()))\r\nl = 0\r\nm = 0\r\nfor i in range(n):\r\n if(p[i] <= h):\r\n l += 1 \r\n else:\r\n m += 2 \r\nres = l + m\r\nprint(res)", " \r\ndef vanyaAndFence():\r\n n,h = map(int, input().split())\r\n totalWidth = 0\r\n heights = list(map(int, input().split()))[:n]\r\n for height in heights:\r\n if height > h:\r\n totalWidth = totalWidth + 2\r\n else:\r\n totalWidth = totalWidth + 1\r\n print(totalWidth)\r\nvanyaAndFence()", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nsumm=0\r\nfor i in range(n):\r\n if arr[i]<=h:\r\n summ+=1\r\n else:\r\n summ+=2\r\nprint(summ)", "san1,san2 = map(int, input().split())\r\nsandar = list(map(int, input().split()))\r\ncount = 0\r\nfor i in sandar:\r\n if i >san2:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int,input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nsumWidth = 0\r\nfor height in heights:\r\n if height > h:\r\n sumWidth += 2\r\n else:\r\n sumWidth += 1\r\nprint(sumWidth)", "n, h = map(int, input().split())\r\na = list(int(x) for x in input().split())\r\nbent = 0\r\nfor j in range(len(a)):\r\n if a[j] > h:\r\n bent += 1\r\n\r\nprint(bent * 2 + n - bent)", "m, n = map(int,input().split())\nj = 0\ng = [int(x) for x in input().split()]\nfor x in range (m):\n if (g[x]<=n):\n j=j+1 \n else:\n j=j+2\nprint (j)\n", "n, h = map(int, input().split())\r\nl = map(int, input().split())\r\nlength = 0\r\nfor i in l:\r\n if i <= h:\r\n length += 1\r\n else:\r\n length += 2\r\n \r\nprint(length)", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\nfor apple in c:\r\n if apple>b:\r\n a+=1\r\nprint(a)\r\n", "n, h = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n if s[i] <= h:\r\n s[i] = 1\r\n else:\r\n s[i] = 2\r\nprint(sum(s))", "n,h=input().split()\nn=int(n)\nh=int(h)\narr=[int(i)for i in input().split()]\ns=0\nfor i in range(n):\n if arr[i]>h:\n s=s+2\n else:\n s=s+1\nprint(s)\n\t\t\t\t\t \t\t \t\t \t \t \t\t \t \t\t \t \t", "n, h = list(input().split())\r\nl = list(input().split())\r\nk=0\r\nfor i in range(int(n)):\r\n if int(l[i])<=int(h):\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "a,b=input().split()\r\narr=list(map(int,input().split()))\r\nx=0\r\nfor i in arr:\r\n if i>int(b):\r\n x+=2\r\n else:\r\n x+=1\r\nprint(x)\r\n \r\n ", "n,m = map(int, input().split())\r\nl = list(map(int,input().split()))\r\ns = len(l)\r\ns = s + sum([1 for x in l if x>m])\r\nprint(s)", "f = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\nw = 0\r\nfor i in s:\r\n if i > f[1]:\r\n w += 2\r\n else:\r\n w+=1\r\n\r\nprint(w)", "h = int(input().split(' ')[1])\r\nnums = [int(x) for x in input().split(' ')]\r\nancho = 0\r\nfor x in nums:\r\n ancho += 2 if x > h else 1\r\nprint(ancho)", "x,m = map(int,input().split())\r\nz = list(map(int,input().split()))\r\ny = 0\r\nfor i in z:\r\n if i>m:\r\n y+=2\r\n\r\n else:\r\n y+=1\r\n\r\nprint(y)", "a = input()\r\nb= input()\r\na=a.split()\r\nb=b.split()\r\ncount = 0\r\nfor i in b:\r\n if int(i) <= int(a[1]):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "#CodeForce Round 677a Vanya and Fence\r\n\r\nw = 0\r\nn,k = map(int,input().split())\r\nperson = list(map(int,input().split()))\r\nfor each in person:\r\n if each > k:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w) \r\n", "n, h = [int(x) for x in input().split()]\r\noutput = [int(x) for x in input().split()]\r\npasser = 0\r\nnonpasser = 0\r\nfor i in range(0, n):\r\n if output[i] <= h:\r\n passer += 1\r\n else:\r\n nonpasser +=1\r\nprint(1 * passer + 2 * nonpasser) ", "a,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(ar)):\r\n if(ar[i]<=b):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in l:\r\n if i>h:\r\n width +=2\r\n else:\r\n width +=1\r\n\r\nprint(width)\r\n\r\n", "# Input\r\n# 1) Variables dos enteros --> n y h\r\n# n = numero de personas\r\n# h = altura de la cerca\r\n# 2) Variable entera ai --> altura de cada persona\r\n\r\n# Output\r\n# Muestra un solo entero -- el ancho minimo posible valido\r\n\r\n\r\n# ai no puede ser mayor que h\r\n\r\n\r\ndef main():\r\n minimo_posible = 0\r\n numero_persona, altura_cerca = map(int, input().split(\" \"))\r\n # Arreglo vacio\r\n altura_de_persona = []\r\n\r\n # Input de las alturas de las personas\r\n alturas = input().split(\" \")\r\n\r\n # Agrega la altura de acuerdo con las personas que nos paso el usuario\r\n for i in range(numero_persona):\r\n if i > numero_persona:\r\n break\r\n altura_de_persona.append(alturas[i])\r\n\r\n altura_de_persons_int = [int(altura) for altura in altura_de_persona]\r\n\r\n for i in altura_de_persons_int:\r\n if i <= altura_cerca:\r\n minimo_posible += 1\r\n else:\r\n minimo_posible += 2\r\n\r\n print(minimo_posible)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n, h = map(int, stdin.readline().split())\r\n A = map(int, stdin.readline().split())\r\n\r\n res = sum(1 + int(a > h) for a in A)\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "li = [int(x) for x in input().split()]\nn = li[0]\nx = li[1]\nl = [int(x) for x in input().split()]\nz = 0\nfor i in range(n):\n if l[i]>x:\n z+=2\n else:\n z+=1\nprint(z)\n\t \t\t\t\t\t \t \t\t\t\t \t\t \t \t\t\t \t\t \t", "n, t= map(int, input().split(' '))\r\nm = input()\r\nh = list(map(int, m.split()))\r\nl=[]\r\nfor i in range(0, n):\r\n if h[i] > t:\r\n k=2\r\n l.append(k)\r\n else:\r\n p=1\r\n l.append(p)\r\nprint(sum(l))", "n,h=input().split()\r\nn,h=int(n),int(h)\r\nlist=list(map(int,input().split()))[:n]\r\ncount=0\r\nfor i in list:\r\n if i<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=n\r\nfor i in a:\r\n if i>h:\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nh0=[int(x) for x in input().split()]\r\nfor i in range(len(h0)):\r\n if h0[i]>h:\r\n n+=1\r\nprint(n)", "n, m = map(int, input().split())\r\nanswer = n\r\nx = list(map(int, input().split()))\r\nfor c in x:\r\n answer += 1 if c > m else 0\r\nprint(answer)\r\n", "n,h=map(int,input().split())\r\nheights= list(map(int,input().split()))\r\ncount=0\r\nfor i in heights:\r\n count=count+1\r\n if i>h:\r\n count=count+1\r\nprint(count) ", "n ,h = input().split()\r\nn, h = int(n), int(h)\r\ni = 0\r\nminimum_height = 0 \r\nall_height = input().split()\r\nfor _ in range(n):\r\n person_height = int(all_height[i])\r\n i += 1\r\n if person_height > h: \r\n minimum_height += 2\r\n else :\r\n minimum_height += 1\r\nprint(minimum_height)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nbend=[1 for i in a if i>h]\r\nprint(sum(bend)+len(a))\r\n", "n,h= map(int , input().split())\r\na=list(map(int , input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n count=count+1\r\nprint(count+n)", "#!/usr/bin/python3\r\n\r\nn, h = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = n\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "a,b=(int(i) for i in input().split())\r\nsum=0\r\nc=(int(i) for i in input().split())\r\nfor i in c:\r\n if i>b:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "x , y = map(int , input().split())\r\na = list(input().split())\r\nc = 0\r\nfor i in range(len(a)):\r\n z = int(a[i])\r\n if z > y:\r\n c += 2\r\n else:\r\n c +=1\r\n \r\nprint(c)", "n , h = map(int,input().split()) #h ارتفاع السياج n عدد الاصدقاء \r\ns = 0\r\na = map(int,input().split())\r\nfor i in a :\r\n if i <= h :\r\n s +=1\r\n else :\r\n s+=2\r\nprint(s) \r\n", "n, h = map(int, input().split())\r\nfriends = [int(f) for f in input().split()]\r\nw = 0\r\nfor f in friends:\r\n if f > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "k = 0\r\nn,h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(0,len(a)):\r\n if a[i] > h:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "n1,h1=input().split()\r\nn=int(n1)\r\nh=int(h1)\r\narr=list(map(int,input().split()))\r\nw=0\r\nfor i in arr:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#!/bin/env python3\n\nn, h = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nwidth = n\nfor i in a:\n if i > h:\n width += 1\n\nprint(width)\n", "s = input().split()\r\nh = int(s[1])\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in l:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmaxx = max(a)\r\nf = [0]*(maxx+1)\r\nfor i in a:\r\n f[i] += 1\r\nsum1 = sum(f[:h+1])\r\nsum2 = 2*sum(f[h+1:])\r\nprint(sum1+sum2)", "n,h = map(int,input().split())\r\nans = 0\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]>h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n \r\n", "n,h=input().split(' ')\r\nn=(int)(n);h=(int)(h)\r\nheights=[(int)(i) for i in input().split(' ')]\r\nwidth=0\r\nfor i in heights:\r\n if(i>h):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nwidth =0\r\nfor i in l1:\r\n if i>h:\r\n width = width+2\r\n else:\r\n width = width +1\r\nprint(width)", "n,h = map(int,input().split(' '))\r\nlst = [int(n) for n in input().split()]\r\nres = 0\r\nfor i in lst:\r\n if i<=h:\r\n res+=1\r\n else:\r\n res+=2\r\nprint(res)", "problem = [int(c) for c in input().split(' ')]\r\npeople = [int(c) for c in input().split(' ')]\r\nhold = problem[0]\r\nfor c in people:\r\n if c > problem[1]:\r\n hold += 1\r\nprint(hold)", "n,h=map(int,input().split())\na=[int(i) for i in input().split()][:n]\nj=0\nwidth = 0\nwhile j<n:\n if a[j]>h:\n width += 2\n else :\n width += 1\n j+=1\nprint(width)\n", "n,h = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nres = 0\r\nfor el in arr:\r\n if(el > h):\r\n res+=2\r\n else: res+=1\r\nprint(res)", "n, h = map(int, input().split())\r\na = input().split()\r\na = [int(x) for x in a]\r\nsumm = 0\r\nfor i in a:\r\n if i > h:\r\n summ += 2\r\n else:\r\n summ += 1\r\n\r\nprint(summ)", "n, h = map(int, input().split())\r\nheigh = list(map(int, input().split()))\r\nx = 0\r\nfor i in heigh:\r\n if i > h:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)\r\n", "n,h=map(int,input().split())\r\nc=0\r\nfor i in list(map(int,input().split())):\r\n if i <= h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "m=input().split()\r\nn=input().split()\r\nb=int(m[1])\r\nx=0\r\nfor i in n:\r\n if int(i)<=b:\r\n x+=1\r\n else:\r\n x+=2\r\nprint(x)", "def Vanya_Fence(height_of_fence , height_of_person):\r\n width = list()\r\n for i in height_of_person:\r\n if i > height_of_fence :\r\n width.append(2)\r\n else :\r\n width.append(1)\r\n return sum(width)\r\n\r\nif __name__ == \"__main__\":\r\n number_of_friends , height_of_fence= map(int , input().split())\r\n height_of_person = list(map(int , input().split()[:number_of_friends]))\r\n print(Vanya_Fence(height_of_fence , height_of_person))\r\n", "n, t = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ns=0\r\nfor i in range(len(A)):\r\n if A[i]>t :\r\n s+=2\r\n else :\r\n s+=1 \r\nprint(s)\r\n\r\n \r\n \r\n \r\n", "a, b, *c = map(int, open(0).read().split())\r\nprint(a + sum(x > b for x in c))\r\n", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nheight = 0\r\n\r\n\r\nfor i in range(n):\r\n if a[i] <= h:\r\n height += 1\r\n else:\r\n height += 2\r\nprint(height)", "n,h=[int(x) for x in input().split()]\r\nnum=0\r\nfor i in input().split():\r\n if int(i) > h:\r\n num+=2\r\n else:\r\n num+=1\r\nprint(num)\r\n\r\n\r\n", "arr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\ncount=0\r\nfor i in range (0,len(arr2)):\r\n if arr2[i]<=arr1[1]:\r\n count=count+1\r\n else:\r\n count=count+2\r\nprint (count)", "n, h = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\n\nw = 0\nfor i in range(n):\n if a[i] > h:\n wi = 2\n else:\n wi = 1\n w += wi\nprint(w)\n", "n, wall = map(int, input().split())\r\nprint(sum([2 if _ > wall else 1 for _ in map(int, input().split())]))", "n, h = [int(i) for i in input().split()]\r\nsampl = [int(s) for s in input().split()]\r\ncunt = 0\r\nfor i_th in sampl:\r\n if i_th <= h:\r\n cunt+=1\r\n else:\r\n cunt+=2\r\nprint(cunt)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(len(a)):\r\n if a[i]<=h:\r\n res+=1\r\n else:res+=2\r\nprint(res)", "#n= no.of frnds, t = height of wall\r\nn, t = map(int, input().split())\r\na=list(map(int,input().split()))\r\ncounter=0\r\nfor i in a:\r\n if i>t:\r\n counter+=2\r\n else:\r\n counter+=1\r\nprint(counter)\r\n\r\n\r\n", "# Решение задач проекта CODEFORSES, Задача 41A\r\n#\r\n# (C) 2021 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Ваня и забор\r\nограничение по времени на тест1 секунда\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nВаня с друзьями идёт по запрещенной территории возле забора высотой h. Чтобы охранник их не заметил,\r\nвысота каждого из друзей не должна превышать h. При этом каждый из них может пригнуться, тогда его \r\nточно не будет видно охраннику. Высота i-го из друзей равняется ai.\r\n\r\nБудем считать, что ширина человека, идущего в полный рост, равна 1, а согнутого — 2. Друзья хотят идти\r\nпо дороге в один ряд, чтобы иметь возможность разговаривать друг с другом. Какой минимальной ширины\r\nдолжна быть дорога, чтобы все они поместились на ней в один ряд и охранник никого не увидел?\r\n\r\nВходные данные\r\nВ первой строке входных данных записаны два целых числа n и h (1 ≤ n ≤ 1000, 1 ≤ h ≤ 1000) — количество \r\nдрузей и высота забора соответственно.\r\n\r\nВо второй строке записаны n целых чисел ai (1 ≤ ai ≤ 2h), i-е из которых равняется высоте i-го друга.\r\n\r\nВыходные данные\r\nВыведите единственное целое число — минимальную подходящую ширину дороги.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=[int(i) for i in input().split()]\r\na2=[int(i) for i in input().split()]\r\nd=0\r\nfor q in a2:\r\n if q > a1[1]:d=d+1\r\n d=d+1\r\nprint(d)\r\n\r\n#print(ANS,' TIME:',datetime.now() - start_time) ", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i] <= h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "x, y = map(int, input().split())\r\nfriends=list(map(int, input().split()))\r\nfor i in friends:\r\n if i > y:\r\n x += 1 \r\nprint(x)", "n, h = map(int, input().split())\nA = map(int, input().split())\nres = 0\n\nfor a in A:\n res += 1 + (a > h)\n\nprint(res)\n\n", "n=input().split()\r\nh=int(n[1]);n=int(n[0])\r\ns=0\r\na=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\n if a[i]<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)\r\n ", "n, h = map(int, input().split()) # Number of friends and fence height\r\nheights = list(map(int, input().split())) # Heights of each friend\r\n\r\nwidth = 0\r\nfor height in heights:\r\n if height <= h:\r\n width += 1 # Friend can walk with width 1\r\n else:\r\n width += 2 # Friend needs to bend down, width becomes 2\r\n\r\nprint(width)", "a,b=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(k)):\r\n\tif(k[i]>b):\r\n\t\tc+=2\r\n\telse:\r\n\t\tc+=1\r\nprint(c)", "# Read the input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width of the road\r\nwidth = 0\r\n\r\n# Iterate through the friends' heights\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs to bend down\r\n else:\r\n width += 1 # Friend can walk in a single row\r\n\r\n# Print the minimum width of the road\r\nprint(width)\r\n", "inp=list(map(int,input().split()))\r\nn,h=inp[0],inp[1]\r\nheights=list(map(int,input().split()))\r\nans=0\r\nfor i in heights:\r\n if i-h>0:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans) \r\n \r\n ", "n=input().split()\r\nh=input().split()\r\nw=0\r\nx=n[0]\r\ny=n[1]\r\nfor i in range(len(h)):\r\n if int(h[i])>int(y):\r\n w=w+2\r\n else:\r\n w=w+1\r\nprint(int(w))", "n,h = map(int,input().split())\r\nht = list(map(int,input().split()))\r\nres= 0\r\nfor p in ht:\r\n if p > h:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "n, k = map(int, input().split())\r\nh = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n for c in h:\r\n if c > k:\r\n count += 2\r\n elif c <= k:\r\n count += 1\r\n\r\nprint(count)", "def width(n, h, guys_w):\r\n counter = 0\r\n w = 0\r\n while counter < n:\r\n if int(guys_w[counter]) <= h:\r\n w = w + 1\r\n else:\r\n w = w + 2\r\n\r\n counter = counter + 1\r\n return w\r\n\r\nn_h = input().split()\r\n\r\nn = int(n_h[0])\r\nh = int(n_h[1])\r\n\r\nhomies_width = input().split()\r\n\r\nprint(width(n, h, homies_width))", "n,h=map(int,input().split())\r\ncount=0\r\nlst=list(map(int,input().split()))\r\nfor i in range(n): \r\n if lst[i]>h:\r\n count+=2\r\n elif lst[i]<=h:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n", "n,h=map(int,input().split())\r\nx=list(map(int,input().split()))[:n]\r\na=0\r\nfor i in range(n):\r\n if x[i]<=h:\r\n a=a+1 \r\n else:\r\n a=a+2\r\n \r\nprint(a) ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nl=[]\r\nfor i in range(len(a)):\r\n if a[i]>h:\r\n c+=2\r\n l.append(a[i])\r\n else:\r\n c+=1\r\nprint(c)\r\n \r\n\r\n\r\n", "n, h = (int(x) for x in input().split())\r\nheights = [int(x) for x in input().split()]\r\nwidth = 0\r\nfor height in heights:\r\n width += (1, 2)[height > h]\r\nprint(width)\r\n", "n, h = [int(el) for el in input().split()]\r\na = [int(el) for el in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "n , h = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if a[i] <= h: ans += 1\r\n else: ans += 2\r\nprint(ans)\r\n", "n,h = map(int, input().split())\r\nn1 = list(map(int, input().split()))\r\nc = n\r\n\r\nfor i in n1:\r\n if i > h:\r\n c += 1\r\nprint(c)", "\r\nh ,a = map(int , input().split())\r\nm = list(map(int , input().split()))\r\nres = 0\r\nfor k in range(h):\r\n\r\n if m[k] > a:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "inputData = input()\r\npersons = input()\r\nhieghts = persons.split(\" \")\r\nnumber , hieght = inputData.split(\" \")\r\noutput = 0\r\nfor i in range (int(number)):\r\n if int(hieghts[i]) > int(hieght) :\r\n output = output +2 \r\n else:\r\n output = output +1\r\nprint(output)", "import sys\r\n\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nn = numbers[0]\r\nh = numbers[1]\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nwidth_total = 0\r\n\r\nfor i in a:\r\n if i > h:\r\n width_total += 2\r\n else:\r\n width_total += 1\r\n\r\nprint(width_total)\r\n", "testcases = input()\r\nres = int(testcases[testcases.find(\" \") + 1:])\r\n \r\narr = []\r\n \r\ns = input()\r\nj = 0\r\n \r\nwhile j != -1:\r\n pos = s.find(\" \")\r\n if pos == -1:\r\n arr.append(int(s))\r\n else:\r\n arr.append(int(s[:pos]))\r\n s = s[pos+1:]\r\n j = pos\r\n \r\nans = 0\r\nfor e in arr:\r\n if e <= res: ans = ans + 1\r\n else: ans = ans + 2\r\n \r\nprint(ans)", "n,h=map(int,input().split())\r\nt=map(int,input().split())\r\np=0\r\nfor i in t :\r\n if i > h :\r\n p+=2\r\n else :\r\n p+=1\r\nprint(p)\r\n\r\n \r\n", "n1=(input())\r\nn1=n1.split()\r\nn2=(input())\r\nn2 = list(map(int, n2.split()))\r\nc=0\r\nfor i in n2:\r\n if i<=int(n1[1]):\r\n c+=1\r\n else :\r\n c+=2\r\nprint(c)", "l1 = [int(i) for i in input().split()]\r\nn = l1[0]\r\nh = l1[1]\r\nl2 = [int(i) for i in input().split()]\r\n\r\nr = 0\r\n\r\nfor j in range(n):\r\n if l2[j] <= h:\r\n r += 1\r\n else:\r\n r += 2\r\n\r\n\r\nprint(r)\r\n", "lst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in lst2:\r\n if i <= lst1[1]:\r\n count1 += 1\r\n elif i > lst1[1]:\r\n count2 += 2\r\nprint(count1 + count2)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n if a[i]>h:\r\n sum += 2\r\n else:\r\n sum += 1\r\n\r\nprint(sum)", "n, h = map(int, input().split())\r\na = map(int, input().split())\r\nresult = sum(1 if i <= h else 2 for i in a)\r\nprint(result)", "n, h = map(int, input().split())\r\nc = 0\r\nl = input().split()\r\nfor i in l:\r\n if int(i) > h:\r\n c += 1\r\nprint(n + c)", "a, b = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(len(x)):\r\n if x[i] > b:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, h = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nwidth = 0\r\n\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "n,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\nw=0\r\nfor i in l:\r\n if i<=k:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(sum(1 if row <= h else 2 for row in a))", "_,h=map(int,input().split())\r\na = map(int,input().split())\r\ns=0\r\nfor i in a:\r\n if i >h:\r\n s +=2\r\n else:\r\n s +=1\r\nprint(s)", "people,fence=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nwidth=0\r\nfor x in range(len(height)):\r\n if height[x]<=fence:\r\n width=width+1\r\n if height[x]>fence:\r\n width=width+2\r\nprint(width)", "n, h = list( map( int, input().split() ) )\r\nheights = map( int, input().split() ) \r\n\r\nwidth = sum( 2 if height > h else 1 for height in heights )\r\n\r\nprint(width)", "\r\nimport math\r\nx,y=map(int,input().split())\r\nsum=0\r\nakrem=list(map(int,input().split()))\r\nfor i in akrem:\r\n if i<=y:\r\n sum+=1 \r\n else:\r\n ab=math.ceil(i/y)\r\n sum+=ab\r\n \r\nprint(sum) ", "n,k=input().split()\r\nsum=0\r\nn=int(n)\r\nk=int(k)\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if(i>k):\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = 0\r\nw = 0\r\nfor i in range(0, n):\r\n if a[b] > h:\r\n w = w + 2\r\n b = b + 1\r\n else:\r\n w = w + 1\r\n b = b + 1\r\nprint(w)", "n,h = map(int,(input().split()))\r\nbend = 0\r\nnum = list(map(int,input().split()))\r\nfor i in range(n):\r\n if num[i]>h:\r\n bend += 2\r\n else:\r\n bend += 1\r\nprint(bend)", "n,h=map(int,input().split( ))\r\na=list(map(int,input().split( )))\r\nt=0\r\nfor i in range(0,n):\r\n if(a[i]>h):\r\n t+=1 \r\n t+=1 \r\nprint(t)", "c = 0\nn = [int(i) for i in input().split()]\ns = [int(i) for i in input().split()]\nfor i in s:\n if i <= n[1]:\n c += 1\n else:\n c += 2\nprint(c)", "number, height=map(int, input().split())\ninfo=list(map(int, input().split()))\nwidth = 0\nfor i in range(number):\n if info[i]>height:\n width= width + 2\n else:\n width+=1\nprint(width)", "q,e=map(int,input().split())\r\nw=list(input().split())\r\nh=0\r\nfor i in range (q):\r\n if int(w[i])>e:\r\n h=h+2\r\n else:\r\n h=h+1\r\nprint(h)\r\n", "n,h = [int(x) for x in input().split()]\r\nfriends = [int(x) for x in input().split()]\r\nwidth = 0\r\n\r\nfor friend in friends:\r\n if(friend>h):\r\n width+=2\r\n else:\r\n width+=1\r\n\r\nprint(width)", "x = input(\"\").split(\" \")\r\nn = int(x[0])\r\nh = int(x[1])\r\np = input(\"\").split(\" \")\r\nw = 0\r\nfor i in p:\r\n if int(i)> h:\r\n w = w + 2\r\n else:\r\n w = w + 1\r\nprint(w)", "n, h = list(map(int, input().split(\" \")))\nf = list(map(int, input().split(\" \")))\n\nw = 0\nfor i in f:\n if i > h:\n w+=2\n else:\n w+=1\nprint(w)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in l:\r\n if i > h:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "n,k=map(int,input().split())\r\ns=input()\r\ns1=s.split()\r\nl=[int(value) for value in s1]\r\n\r\na=0\r\nfor i in l:\r\n if i <=k:\r\n a+=1 \r\n else:\r\n a+=2\r\n \r\nprint(a)\r\n \r\n ", "c=0\r\nn,num=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>num:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "result = \"\"\r\nn,h = input().split(\" \")\r\nfriends = input().split(\" \")\r\nwidth = 0\r\nfor friend in friends:\r\n if int(friend) > int(h):\r\n width += 2\r\n else:\r\n width += 1\r\nresult = width\r\nprint(f\"{result}\")", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor val in a:\r\n if val > h:\r\n count += 2\r\n else:\r\n count += 1 \r\nprint(count)\r\n", "m=input()\r\nl1=input()\r\n\r\nn=int(m.split()[0])\r\nh=int(m.split()[1])\r\ns=[int(t) for t in l1.split()]\r\nsum=0\r\nfor k in range (n):\r\n if s[k] > h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(x):\r\n if l[i]<=y:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "a,b=map(int,input().split())\r\nx=input().split()\r\ny=0\r\nfor i in x:\r\n if int(i)>b:\r\n \ty+=2\r\n else:\r\n \ty+=1\r\nprint(y)", "def f():\r\n n, h = map(int, input().split())\r\n l = sum([(1 if i <= h else 2) for i in list(map(int, input().split()))])\r\n return l\r\n\r\n\r\nprint(f())\r\n", "I =lambda : map(int,input().split())\r\n\r\nx,y=I()\r\nans=x\r\n\r\n\r\nlst= input().split()\r\nfor i in range(x):\r\n lst[i] = int(lst[i])\r\n\r\n\r\nfor i in lst:\r\n if i > y:\r\n ans += 1\r\nprint(ans)\r\n", "h, s = int(input().split()[-1]), 0\r\nfor i in map(int, input().split()):\r\n\ts += 1 if h >= i else 2\r\nprint(s)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n n=n+1\r\nprint(n)", "# Read input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width of the road\r\ntotal_width = 0\r\n\r\n# Iterate through each friend's height\r\nfor height in heights:\r\n if height > h:\r\n total_width += 2 # If height is greater than h, width is 2\r\n else:\r\n total_width += 1 # Otherwise, width is 1\r\n\r\n# Print the total width\r\nprint(total_width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nprint(n + len([1 for i in range(n) if a[i] > h]))", "inp1=input()\r\ninp2=input()\r\na=inp1.split(\" \")\r\nb=inp2.split(\" \")\r\ncount=0\r\nfor i in b:\r\n if int(i)>int(a[1]):\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "def code(*args):\r\n arr = args[-1]\r\n\r\n result = 0\r\n for i in arr:\r\n if i <= args[1]:\r\n result += 1\r\n else:\r\n result += 2\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n, h = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n result = code(n, h, arr) # Pass arguments\r\n print(result)\r\n\r\n", "\nn,h=input().split()\nn=int(n)\nh=int(h)\nsum=0;\n\na=input().split()\nfor i in range (n):\n if(int(a[i])>h):\n sum+=2;\n else:\n sum+=1;\n\n\n\n\n\nprint(sum)\n\n\t \t \t \t\t \t\t\t\t\t\t\t \t \t", "n, h = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n res = res + 2\r\n else:\r\n res = res + 1\r\n\r\nprint(res)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=t=0;\r\nfor i in a:\r\n if i>h:\r\n z+=2;\r\n else:\r\n z+=1;\r\nprint(z);\r\n", "# Read the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width\r\ntotal_width = 0\r\n\r\n# Iterate through each friend's height\r\nfor height in heights:\r\n # If the friend's height is greater than h, they need to bend (width 2)\r\n if height > h:\r\n total_width += 2\r\n else:\r\n total_width += 1\r\n\r\n# Print the total minimum width\r\nprint(total_width)\r\n", "person, fence = map( int, input().split() )\r\nheight = list(map( int, input().split() ))\r\n\r\nans = 0\r\nfor i in range( person ):\r\n if height[i] > fence:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n,h=map(int,input().split())\r\na = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in a :\r\n if i > h :\r\n counter += 2\r\n else :\r\n counter +=1\r\n\r\nprint(counter)", "a=str(input())\r\ng=str(input())\r\nb=a.split()\r\nc=b[0]\r\nd=b[1]\r\ne=g.split()\r\nf=0\r\nfor i in range(0,int(c)):\r\n if int(e[i])>int(d):\r\n f=f+2\r\n else:\r\n f=f+1\r\nprint(f)\r\n \r\n \r\n\r\n", "info=input().split()\r\nr=int(info[0])\r\ns=int(info[-1])\r\nv=0\r\nq=input().split()\r\nfor f in range(r):\r\n if int(q[f])>s:\r\n v+=2\r\n else:\r\n v+=1\r\nprint(v)", "n = input().split()\r\na = input().split()\r\nMP=0\r\nfor i in range(0,int(n[0])):\r\n if int(a[i]) > int(n[1]) :\r\n MP+=2\r\n else:\r\n MP+=1\r\n\r\nprint(MP)", "a , n = input().split()\r\na = int(a)\r\nn = int(n)\r\nx=0\r\ns=[int(i)for i in input().split()]\r\nfor i in range (a):\r\n if s[i]>n:\r\n x=x+2\r\n else:\r\n x=x+1\r\nprint(x)\r\n\t", "n,h=input().split()\nprint(sum(list(map(lambda x:2 if int(x)>int(h) else 1,input().split()))))\n\n ", "n, h = map(int, input().split())\na = list(map(int, input().split()))\nwidth = []\nfor i in range(len(a)):\n if a[i] <= h:\n width.append(1)\n else:\n width.append(2)\nprint(sum(width))\n", "n,h = map(int, input().split())\nresult = 0\nfor f in map(int, input().split()): result += 2 if f > h else 1 \nprint(result)", "n,h = map(int,input().split())\r\nnum = list(map(int,input().split()))\r\nans = len(num)\r\nfor x in num:\r\n if x > h:\r\n ans += 1\r\nprint(ans)", "if __name__ == \"__main__\":\r\n n, h = [int(x) for x in input().split(\" \")]\r\n\r\n width = n\r\n\r\n friends = [int(x) for x in input().split(\" \")]\r\n\r\n for friendHeight in friends:\r\n if(friendHeight > h):\r\n width += 1\r\n else:\r\n continue\r\n print(width)\r\n ", "n,h =(map(int,input().split()))\r\nwidth =0\r\narr =list(map(int,input().split()))\r\nfor i in arr :\r\n if i<= h :\r\n width+=1\r\n else :\r\n width+=2\r\n \r\nprint(width)", "arr = [int(i) for i in input().split()]\r\narr1 = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in arr1:\r\n if i>arr[1]:\r\n count += 2\r\n else: \r\n count += 1\r\nprint(count)", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\ncount = 0\r\nfor i in range (n):\r\n\tif a[i]>h:\r\n\t\tcount +=2\r\n\telse:\r\n\t\tcount +=1\r\nprint (count)", "n, h=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nk=0\r\nfor i in range(n):\r\n if l[i]<=h:\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "_, h = list(map(int, input().split(' ')))\np = list(map(int, input().split(' ')))\nprint(sum(2 if i > h else 1 for i in p))\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nmin_width = sum(1 if height <= h else 2 for height in heights)\r\nprint(min_width)", "n,h = map(int, input().split())\nheights = input().split()\nwidth = 0\nfor i in range(n):\n if int(heights[i]) > h: width += 2\n else: width += 1\nprint(width)", "n,h=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nw = 0\r\n\r\nfor i in range(n):\r\n if l[i]>h:\r\n w+=2\r\n else:\r\n w+=1 \r\n\r\nprint(w)", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = 0\r\nfor i in range(len(b)):\r\n if b[i] > a[1]:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nk = 0\r\nfor i in c:\r\n if i <= b:\r\n k += 1\r\n else:\r\n k += 2\r\nprint(k)", "def width(h, friends):\r\n \r\n width = 0\r\n for i in range(len(friends)):\r\n if friends[i] <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n \r\n return width\r\n\r\nif __name__ == '__main__':\r\n nh = input()\r\n# nh = '3 7'\r\n nh = nh.split()\r\n n = int(nh[0])\r\n h = int(nh[1])\r\n \r\n fri = input()\r\n# fri = '4 5 14'\r\n fri = fri.split()\r\n \r\n \r\n \r\n friends = []\r\n for i in range(n):\r\n friends.append(int(fri[i]))\r\n \r\n print(width(h, friends))", "n,h = map(int,input().split())\r\ntrash = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if trash[i]<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h = map(int, input().split())\r\nlist = input().split()\r\nw = 0\r\nfor _ in range(len(list)):\r\n if int(list[_]) > h:\r\n w += 2\r\n elif int(list[_]) <= h:\r\n w += 1\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = len(arr)\r\nfor i in range(len(arr)):\r\n if arr[i] > h:\r\n c += 1\r\nprint(c)", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n n, h = map(int, input().split())\r\n li = list(map(int, input().split()))\r\n ans = 0\r\n for x in li:\r\n if x>h:\r\n ans += 1\r\n ans+=1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "n, h = map(int, input().split())\r\nlist1 = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in list1:\r\n if i>h:\r\n counter+=2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n\r\n", "# 677A - Vanya And Fence\r\n# https://codeforces.com/problemset/problem/677/A\r\n\r\n# Inputs:\r\n# 1) Número de amigos\r\n# 2) Altura de la valla\r\namigos, altura_valla = map(int, input().split())\r\n\r\n# Largo de la fila a crear para recorrer la valla sin ser visto\r\nlargo_fila = 0\r\n\r\n# Altura de cada uno de los amigos\r\naltura_amigo = list(map(int, input().split()))\r\n\r\n# Si el amigo mide más que la valla, entonces suma +2 al ancho de la fila, de lo contrario, suma +1\r\nfor altura_amigo_actual in altura_amigo:\r\n if altura_amigo_actual / altura_valla > 1.0:\r\n largo_fila += 2\r\n else:\r\n largo_fila += 1\r\n\r\n# Imprime el largo final de la fila\r\nprint(largo_fila)", "x,y=map(int,input().split())\r\nsum=0\r\nnum=map(int,input().split())\r\nfor i in num:\r\n \r\n if i>y:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)\r\n\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nsum=0;\na=input().split()\nfor i in range(n):\n if (int(a[i])>h):\n sum+=2;\n else:\n sum+=1;\nprint(sum)\n\t\t \t \t\t\t\t\t\t\t\t \t\t \t \t", "n,h = map(int,input().split())\r\nli =list(map(int,input().split()))\r\nc=0\r\nfor i in li:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c) ", "n,h = map(int,input().split())\nheights = input().split()\nwidth = 0\nfor i in heights:\n if int(i) > h:\n width += 2\n else:\n width += 1\nprint(width)\n ", "n, h = input().split(' ')\r\n\r\nn = int(n)\r\nh = int(h)\r\n\r\nrow = input().split(' ')\r\n\r\nres = 0\r\nfor x in row:\r\n if int(x) > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nfor i in c:\r\n a += (i > b)\r\nprint(a)", "n, h = map(int, input().split())\r\nppl = [int(x) for x in input().split()]\r\n\r\nwidth = n\r\nfor var in ppl:\r\n if var > h:\r\n width += 1\r\n \r\nprint(width)", "n, h = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nw = n\r\nfor i in li:\r\n if i > h:\r\n w+=1\r\n\r\n\r\nprint(w)\r\n\r\n", "friends_w = 0\r\n\r\nn, h = map(int, input().split())\r\nfriends_h = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if friends_h[i] > h:\r\n friends_w += 2\r\n else:\r\n friends_w += 1\r\n\r\nprint(friends_w)", "n, h = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\n\r\nmin_width = 0\r\n\r\nfor ha in a:\r\n min_width += 2 if ha > h else 1\r\n\r\nprint(min_width)", "nh=input().split(\" \")\r\nn=int(nh[0])\r\nh=int(nh[1])\r\n\r\ntotal=0\r\nheights=input()\r\n\r\nfor i in range(n):\r\n num=heights.split(\" \")\r\n num=int(num[i])\r\n \r\n if num<=h:\r\n total=total+1\r\n else:\r\n total=total+2\r\nprint(total)\r\n", "\nn, h = input().split()\nn = int(n)\nh = int(h)\nx = [int(i) for i in input().split()]\ny = 0\nfor i in range(n):\n if x[i] <= h:\n y = y + 1\n else:\n y = y + 2\nprint(y)\n\t \t\t \t \t\t \t \t \t \t\t \t \t \t\t\t", "n, h = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nsol = 0\r\nfor i in range(n):\r\n if v[i] > h:\r\n sol += 2\r\n else:\r\n sol += 1\r\nprint(sol)\r\n", "n1 = list(map(int,input().split()))\nn = list(map(int,input().split()))\ncount = 0\nfor i in n:\n if i>n1[1]:\n count +=2\n else:\n count+=1\nprint(count)", "f, h = input().split()\r\nfh = input().split()\r\nw = 0\r\nf = int(f)\r\nh = int(h)\r\nfor i in range(f):\r\n\tif int(fh[i]) > h:\r\n\t\tw = w + 2\r\n\telse:\r\n\t\tw = w + 1\r\nprint(w)\r\n", "n,h=map(int,input().split())\r\nls=[]\r\na=list(map(int,input().split()))\r\n#ls.append(a)\r\nc=0\r\n#print(a)\r\nfor i in a:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,h=map(int,input().split())\r\nh1=list(map(int,input().split()))\r\nw=0\r\nfor i in h1:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n,h=input().split()\r\nn,h=int(n),int(h)\r\n\r\nn_list=[int(x) for x in input().split()]\r\ncount=0\r\n\r\nfor i in n_list:\r\n if i>h:\r\n count+=1\r\n\r\nprint(count+n)", "n, h = map(int,input().split())\r\npers = list(map(int, input().split()))\r\nwidth = 0\r\nfor i in pers:\r\n if i <= h:\r\n width += 1\r\n else:\r\n width += 2\r\nprint(width)", "\r\nn,h=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nwidth=0\r\nfor i in range(n):\r\n if(b[i]<=h):\r\n width+=1\r\n else:\r\n width+=2\r\n \r\nprint(width)\r\n", "# this is really ugly, apologies in advance\r\n\r\nx = input().split(' ')\r\n\r\nn = int(x[0])\r\nh = int(x[1])\r\n\r\npeopleHeights = input().split(' ')\r\n\r\npeopleHeights = map(int, peopleHeights)\r\n \r\nwidths = []\r\n\r\nfor y in peopleHeights:\r\n if y > h: \r\n widths.append(2)\r\n else: \r\n widths.append(1)\r\n\r\nsum = 0\r\nfor width in widths:\r\n sum += width\r\n\r\nprint(sum)", "n, b = map(int, input().split())\nl = list(map(int, input().split()))\ni = 0\nfor x in l:\n if x > b:\n i += 2\n else:i += 1\nprint(i)\n \t \t\t \t \t \t\t \t \t\t \t\t\t\t \t\t\t\t", "n,h=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nj=0\r\nfor pos in m:\r\n if pos>h:\r\n j=j+2\r\n else:\r\n j=j+1\r\nprint(j)\r\n \r\n \r\n ", "line1 = input().split(' ')\r\nline2 = input().split(' ')\r\nheigh = int(line1[1])\r\nwidth = 0\r\nt = int(line1[0])\r\nfor i in range(len(line2)):\r\n if int(line2[i]) > heigh:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 25 09:06:27 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nnh = input().split()\r\nn = int(nh[0])\r\nh = int(nh[1])\r\n\r\na = input().split()\r\nx = 0\r\n\r\nfor i in range(n):\r\n if int(a[i]) > h:\r\n x += 2\r\n else:\r\n x += 1\r\n\r\nprint(x)", "n,k=map(int,input().split())\r\na=0\r\nl1=list(map(int,input().split()))\r\nfor i in l1:\r\n if i>k:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)", "n = input().split(\" \")\r\no = input().split(\" \")\r\nw = 0\r\nfor i in o:\r\n if int(i) > int(n[1]):\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)", "n, h = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in a:\r\n if i > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = input().split()\r\nn, h = int(n), int(h)\r\nk = input().split()\r\nt = 0\r\nfor i in range(n):\r\n if int(k[i]) <= h:\r\n t += 1\r\n else:\r\n t += 2\r\nprint(t)", "n, h = map(int, input().split())\n\nlist = list(map(int, input().split()))\n\nroad_width = 0\n\nfor i in list :\n if i <= h :\n road_width+=1\n else :\n road_width+=2\n\nprint(road_width)\n\n\n\n\n\n\n\n\n \t \t\t\t \t\t\t\t \t \t \t\t\t\t\t\t \t\t", "count = 0\r\nfriends, fenceHeight = line1 = list(map(int,input().split(\" \")))\r\nheights = list(map(int,input().split(\" \")))\r\nfor i in heights: \r\n if i > fenceHeight: \r\n count +=2\r\n else: count +=1\r\nprint(count)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 0\r\nfor i in range(n):\r\n l += 2 if a[i] > h else 1\r\nprint(l)", "# n = int(input(\"Введите количество детей: \"))\r\n# h = int(input(\"Введите высоту забора: \"))\r\nn,h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nheights = list(map(int, input().split()))\r\ncounter = 0\r\nfor height in heights:\r\n if height > h:\r\n counter += 2\r\n else:\r\n counter += 1\r\nprint(counter)\r\n", "n, h = map(int,input().split())\r\nfriends = list(map(int,input().split()))\r\nans = 0\r\nfor each in friends:\r\n if each>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "import sys\r\ndata = []\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n data.append(numbers)\r\n\r\nnumber_of_friends = data[0][0]\r\nheight_of_fence = data[0][1]\r\n\r\nwidth = 0\r\n\r\nfor friend in range(number_of_friends):\r\n if data[1][friend] <= height_of_fence:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)\r\n", "n,h=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nres=0\r\n\r\nfor x in l:\r\n if x>h:\r\n res+=2\r\n else:\r\n res+=1\r\nprint(res)", "n,h=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nl=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "list = input().split(\" \")\r\nheightList = input().split(\" \")\r\nlen = int(list[0])\r\nwidth = 0\r\nfenceheight = int(list[1])\r\nfor i in range(len):\r\n if int(heightList[i]) <= fenceheight:\r\n width += 1\r\n elif int(heightList[i]) > fenceheight:\r\n width += 2\r\nprint(width)\r\n", "x,y=map(int, input().split())\r\nz=list(map(int, input().split()))\r\nc=0\r\nfor i in z:\r\n if i<=y:\r\n c+=1\r\n elif i>y:\r\n c+=2\r\nprint(c) \r\n ", "import math\r\na,b = map(int , input().split(' '))\r\nc = input().split(' ')\r\nj = 0\r\nfor i in c:\r\n\tif (int(i) >= b):\r\n\t\tj += math.ceil(int(i)/b)\r\n\telse:\r\n\t\tj += 1\r\nprint (j)\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nx=a.split()\nm=0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i]>h:\n m+=2\n else:\n m+=1\nprint(m)\n \t \t \t\t\t\t \t\t\t\t\t\t\t\t \t \t", "n,h = list(map(int,input().split()))\r\nstr = list(map(int,input().split()))\r\nwidth = 0\r\nfor num in str:\r\n if num > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=0\r\nfor i in a:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "def minimum_width():\r\n n, h = map(int, input().strip().split())\r\n friends = list(map(int, input().strip().split()))\r\n width = 0\r\n for friend in friends:\r\n if friend > h:\r\n width += 2\r\n else:\r\n width += 1\r\n print(width)\r\n\r\nminimum_width()", "n,w=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nans=0\r\nfor i in a:\r\n if i>w:\r\n ans+=2\r\n else:\r\n ans+=1 \r\nprint(ans)\r\n ", "n,h=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nc=0\r\nfor i in (nums):\r\n if i>h:\r\n c+=i//h\r\n if i%h!=0:\r\n c+=1\r\n else:\r\n c+=1\r\nprint(c)\r\n ", "a,b=map(int,input().split())\r\nk=[int(x) for x in input().split()]\r\nw=0\r\nfor i in range(a):\r\n if k[i]<=b:\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)", "n, h = map(int, input().split())\r\n\r\ns = list(map(int, input().split()))\r\n\r\ncol = 0\r\n\r\nfor i in range(n):\r\n if s[i] > h:\r\n col += 2\r\n else:\r\n col += 1\r\nprint(col)", "n=input().split()\r\nn2=input().split()\r\nw=0\r\nfor i in n2:\r\n if int(i) <= int(n[1]):\r\n w+=1\r\n else:\r\n w+=2\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\nprint(width)", "n, h = map(int, input().split())\r\nprint(sum([1 if x <= h else 2 for x in list(map(int, input().split()))]))\r\n", "n, h = input().split(\" \")\r\na = input().split(\" \")\r\nif(n != \"0\"):\r\n\tfor i in a:\r\n\t\tif(int(i) > int(h)):\r\n\t\t\tn = int(n) + 1\r\n\tprint(n)\r\nelse:\r\n\tprint(n)", "n=input().split()\r\nn2=input().split()\r\nw=0\r\nx=0\r\nwhile x < int(n[0]):\r\n if int(n2[x]) <= int(n[1]):\r\n w+=1\r\n else:\r\n w+=2\r\n x+=1\r\nprint(w)", "a,b=map(int,input().split())\r\nc=0\r\nd=0\r\ne=list(map(int,input().split()))\r\nfor i in range(a):\r\n if e[i]>b:\r\n d=d+2\r\n else:\r\n c=c+1\r\nprint(c+d)", "inputs1 = input().split()\r\nh = int(inputs1[1])\r\n\r\nheights = input().split()\r\nheights = [int(i) for i in heights]\r\n\r\nresult = 0\r\n\r\nfor i in heights:\r\n if i <= h:\r\n result += 1\r\n else:\r\n result += 2\r\n\r\nprint(result)", "a , n=input().split()\na=int(a)\nn=int(n)\ns=[int(i)for i in input().split()]\nx = 0\nfor i in range(a):\n if (s[i]>n):\n x=x+2\n else:\n x=x+1\nprint(x)\n\t \t\t\t\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t\t", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in range(n):\r\n if a[i] > h:\r\n c1+=2\r\n else:\r\n c2+=1\r\nprint(c1+c2)", "m,n,*a=map(int,open(0).read().split());print(m+sum(m>n for m in a))", "n,m=input().split()\nn=int(n)\nm=int(m)\narr=[int(i)for i in input().split()]\nsum=0\nfor i in range(n):\n if arr[i]<=m:\n sum+=1\n else:\n sum+=2\nprint(sum)\n\t\t\t\t\t \t \t\t\t \t \t\t\t \t\t \t\t", "import sys\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\nimport time\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, h = inlt()\r\nl = inlt()\r\n\r\n\r\nprint(reduce(lambda r,e: r+(1 if e<=h else 2),l,0))\r\n", "a = list(map(int,input().split()))\r\ncount = 0\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(0, a[0]):\r\n if b[i] > a[1]:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)\r\n", "def solve():\r\n n,h = input().split()\r\n a = list(map(int,input().split()))\r\n width = 0\r\n for num in a:\r\n if num > int(h):\r\n width +=2\r\n else:\r\n width+=1\r\n return width\r\n\r\nprint(solve())\r\n", "a, b = [int(x) for x in input().split()]\r\nx=[int(x) for x in input().split()]\r\nbend=0\r\nnotbend=0\r\nfor i in x:\r\n if i>b:\r\n bend=bend+2\r\n else:\r\n notbend=notbend+1\r\nprint(bend+notbend)\r\n ", "x, y = input().split(\" \")\r\ny = int(y)\r\nl = input().split(\" \")\r\nk = 0\r\nfor item in l:\r\n item = int(item)\r\n if item > y:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "sp=[int(i) for i in input().split()]\r\nn=sp[0]\r\nh=sp[1]\r\nsp=[int(i) for i in input().split()]\r\nwidth=0\r\nfor i in range(len(sp)):\r\n if sp[i]>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split(' '))\r\nx=input().split(\" \")\r\ncount=0\r\n\r\nfor i in range(0,n):\r\n if(int(x[i])>h):\r\n count+=2\r\n else:\r\n count+=1\r\n\r\nprint(count) \r\n", "chir, ris = map(int, input().split())\r\nvan = list(map(int, input().split()))\r\n \r\ngee = 0\r\nfor fvg in van:\r\n if fvg <= ris:\r\n gee += 1\r\n else:\r\n gee += 2\r\nprint(gee)\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nans=0\r\nfor i in range (n):\r\n if w[i]<=m:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint (ans)\r\n\"\"\"", "n, f_h = map(int, input().split())\nheights = map(int, input().split())\nprint(n + sum([h > f_h for h in heights]))", "n,h=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if x[i]<=h:\r\n count+=1\r\n elif x[i]>h:\r\n count+=2\r\nprint(count)", "a,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nc=0\r\nfor i in ar:\r\n if i <=b:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h = input ().split()\nn = int (n)\nh = int (h)\na = input ()\nx = a.split()\nc = 0\nfor i in range (n):\n x[i] = int (x[i])\n if x [i] > h:\n c += 2\n else:\n c += 1\nprint (c)\n \t \t\t \t\t \t \t\t \t\t \t \t\t\t \t", "l1 = input().split()\r\nl2 = input().split()\r\n\r\nfor i in range(len(l2)):\r\n if int(l2[i]) > int(l1[1]):\r\n l2[i] = 2\r\n elif int(l2[i]) <= int(l1[1]):\r\n l2[i] = 1\r\n\r\n\r\nprint(sum(l2))", "a,b = input().split()\na = int(a)\nb = int(b)\nf = input()\nx = f.split()\nz = 0\nfor i in range(a):\n x[i] = int(x[i])\n if x[i] <= b :\n z += 1\n elif x[i] > b:\n z += 2\nprint(z)\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t", "# n, m, a = list(map(int, input().split(\" \")))\r\n# h,v=0,0\r\n# if n%a==0:\r\n# h=int(n/a)\r\n# else:\r\n# h=int(n/a)+1\r\n# if m%a==0:\r\n# v=int(m/a)\r\n# else:\r\n# v=int(m/a)+1\r\n# print(h*v)\r\n\r\n# a, b = map(int, input().split(\" \"))\r\n# print(a*b//2)\r\n\r\nn, h = list(map(int, input().split(\" \")))\r\na=list(map(int, input().split(\" \")))\r\nans=0\r\nfor i in a:\r\n if i<=h:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)", "a,b=map(int,input().split())\r\ns=0\r\nh=list(map(int,input().split()))\r\nfor i in h:\r\n if i<=b:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "countFriends,height = map(int,input().split())\r\nlist = str(input())\r\nnewList = list.split(\" \")\r\nroad = 0\r\nfor i in range(countFriends):\r\n\r\n\r\n if height < int(newList[i]):\r\n\r\n road=road+2\r\n else:\r\n road=road+1\r\n\r\n\r\nprint(road)", "a,c=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nn=0\r\nfor i in range(a):\r\n if b[i]%c>0:\r\n n+=b[i]//c+1\r\n else:\r\n n+=b[i]//c\r\nprint(n)", "n,h = map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\ncount=0\r\nfor i in l:\r\n if i <=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)\r\n", "n, h = map(int, input().split(\" \"))\r\nl = list(map(int, input().split(\" \")))\r\n\r\nprint(len(l) + len([1 for b in l if b > h]))\r\n", "#Initializes friends (not needed), height of fence, and width of friends\r\nsituation = input().split(' ')\r\nheight = int(situation[1])\r\nwidth = 0\r\n\r\n#measures width of friend group\r\nfor friend in input().split(' '):\r\n if int(friend) > height:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\n#prints answer\r\nprint(width)", "m,n=map(int,input().split())\r\nk=list(map(int,input().split()))\r\ncount=0\r\nfor i in k:\r\n if i>n:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n = [int(x)for x in input().split(\" \")]\r\na = [int(y) for y in input().split(\" \")]\r\nb = 0\r\nfor i in range(0,len(a)):\r\n if a[i] <= n[1]:\r\n b += 1\r\n else:\r\n b += 2\r\nprint(b)", "a, b = map(int, input().split(\" \"))\r\narr = list(map(int, input().split(\" \")))\r\n\r\nres = 0\r\nfor i in arr:\r\n if i > b:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)\r\n ", "import sys\n\n\ndef solution(input_data: str):\n data = input_data.splitlines()\n n, wall = map(int, data[0].split())\n friends = map(int, data[1].split())\n road_width = 0\n for friend in friends:\n if friend > wall:\n road_width += 2\n else:\n road_width += 1\n return road_width\n\n\ndef test_solution():\n assert solution(\"\"\"3 7\n4 5 14\"\"\") == 4\n assert solution(\"\"\"6 1\n1 1 1 1 1 1\"\"\") == 6\n assert solution(\"\"\"6 5\n7 6 8 9 10 5\"\"\") == 11\n\n\nif __name__ == '__main__':\n print(solution(sys.stdin.read().strip()))\n", "a,b = map(int, input().split())\r\nall_friends = list(map(int, input().split()))\r\nsum = 0\r\nfor i in all_friends:\r\n if i > b:\r\n sum +=2\r\n else:\r\n sum +=1\r\nprint(sum)", "n, h = map(int, input().split())\nfriends = list(map(int, input().split()))\n\nw = 0\n\nfor kid in friends:\n if kid > h:\n w += 1\n\nprint(w+n)", "while True:\r\n try:\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n stand = 0\r\n band = 0\r\n for height in a:\r\n if height > h:\r\n band += 1\r\n else:\r\n stand += 1\r\n \r\n print(2 * band + stand)\r\n except EOFError:\r\n break\r\n", "n,h=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nfor i in lst:\r\n if(i>h):\r\n c+=1\r\nprint(n+c)", "n, h = map(int, input(). split())\r\nw = 0\r\nA = list(map(int, input(). split()))\r\nfor i in range(n):\r\n if A[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "kamrul,hasan,*a=map(int,open(0).read().split());print(kamrul+sum(kamrul>hasan for kamrul in a))", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\ndef solve():\r\n n, h = linp()\r\n l = linp()\r\n for i in l:\r\n if i > h:\r\n n += 1\r\n print(n)\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst1 = []\r\nfor i in range(len(lst)):\r\n if lst[i]>b:\r\n lst1.append(2)\r\n else:\r\n lst1.append(1)\r\nprint(sum(lst1))", "# Input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate minimum width of the road\r\nwidth = sum(1 if height <= h else 2 for height in heights)\r\n\r\n# Output\r\nprint(width)", "n , h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nw = 0\r\nfor i in arr:\r\n if i> h: w+=2\r\n else: w+=1\r\n \r\nprint(w)\r\n \r\n", "n_h = input().split()\r\nn = int(n_h[0])\r\nh = int(n_h[1])\r\ntext_h = input()\r\nalturas = text_h.split()\r\nwidth = 0\r\nfor altura in alturas:\r\n if int(altura) > h:\r\n width = width + 2\r\n else:\r\n width = width + 1\r\nprint(width)\r\n", "NUMBER_OF_FRIENDS, FENCE_HEIGHT = map(int, input().split())\r\nPERSON_HEIGHTS_ARRAY = list(map(int, input().split()))\r\nMIN_ROAD_WIDTH = 0\r\nfor i in range(NUMBER_OF_FRIENDS):\r\n if (PERSON_HEIGHTS_ARRAY[i] > FENCE_HEIGHT):\r\n MIN_ROAD_WIDTH = MIN_ROAD_WIDTH+2\r\n else:\r\n MIN_ROAD_WIDTH = MIN_ROAD_WIDTH+1\r\nprint(MIN_ROAD_WIDTH)\r\n", "n, h = map(int, input().split()) # Number of friends and height of fence\r\nheights = list(map(int, input().split())) # List of heights of friends\r\n\r\nwidth = 0 # Initialize width of the road\r\n\r\nfor height in heights:\r\n if height > h: # If height is greater than fence height\r\n width += 2 # Add 2 to width for bending friend\r\n else:\r\n width += 1 # Add 1 to width for normal friend\r\n\r\nprint(width)\r\n", "no_of_children,h= input().split()\r\nno_of_children=int(no_of_children)\r\nh=int(h)\r\nqueue = [int(x) for x in input().split()[:no_of_children]]\r\n\r\n\r\ni=0\r\ncount=0\r\n#while i<(no_of_children):\r\n # queue = int(input()).split()\r\n\r\n\r\nfor i in range(len(queue)):\r\n if (queue[i] <= h):\r\n count += 1\r\n else:\r\n count += 2\r\n\r\n\r\n\r\n\r\nprint(count)", "# Read the number of friends and the fence height\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of each friend\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width to 0\r\nmin_width = 0\r\n\r\n# Iterate through the heights and calculate the width required\r\nfor height in heights:\r\n if height <= h:\r\n # If the friend's height is less than or equal to the fence height, they only need 1 unit of width\r\n min_width += 1\r\n else:\r\n # If the friend's height is greater than the fence height, they need 2 units of width\r\n min_width += 2\r\n\r\n# Print the minimum width of the road\r\nprint(min_width)\r\n", "def minimum_width(n,h,heights):\r\n total_width=0\r\n for height in heights:\r\n if height>h:\r\n total_width +=2\r\n else:\r\n total_width+=1\r\n return total_width\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nresult=minimum_width(n,h,heights)\r\nprint(result)", "n,h=map(int,input().split())\na=list(map(int,input().split()))\nsum=0\nfor i in range(n):\n if a[i]>h:\n sum=sum+2\n else:\n sum=sum+1\nprint(sum)\n\n\n\n\n\n\n\n \t \t \t\t \t\t \t\t \t\t\t \t \t\t \t", "z,x,*a=map(int,open(0).read().split());print(z+sum(n>x for n in a))", "n,h=map(int,input().split())\r\nw=0\r\na=input().split()\r\nfor i in range(n):\r\n if int(a[i])>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "dano = [int(x) for x in input().split()]\r\nboys = [int(x) for x in input().split()]\r\nn = dano[0]\r\nh = dano[1]\r\nans = 0\r\nfor i in range(n):\r\n if boys[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "s = list(map(int, input().split()))\r\nn=s[0]\r\nh=s[1]\r\nw=0\r\nheights = list(map(int, input().split()))\r\nfor i in heights:\r\n if (i<=h):\r\n w=w+1\r\n else:\r\n w=w+2\r\nprint(w)\r\n ", "n,h = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in arr:\r\n if i>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "x = input()\r\nl = x.split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\ny = input()\r\nm = y.split()\r\ns = 0\r\nfor i in range(len(m)):\r\n if int(m[i]) > int(l[1]):\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)\r\n", "n, h = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in a:\r\n if i > h:\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)\r\n", "l=input().split()\r\nl=[int(x) for x in l]\r\nm=input().split()\r\nm=[int(x) for x in m]\r\nc=0\r\nfor i in m:\r\n if i>l[1]:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,h = map(int,input().split())\r\nA = input().split()\r\nfor i in range(n):\r\n A[i] = int(A[i])\r\nx = n\r\nfor i in range(n):\r\n if A[i] > h:\r\n x += 1\r\n else:\r\n pass\r\nprint(x)\r\n", "N,h=map(int,input().split())\r\nsb=list(map(int,input().split()))\r\nfor j in sb:\r\n if j>h:\r\n N=N+1\r\nprint(N)", "friend, high = map(int, input().split())\r\nrez = friend\r\nfrie = list(map(int,input().split()))\r\nfor i in range (0, friend):\r\n if (frie[i])> high:\r\n rez +=1\r\n\r\nprint (rez)", "# Input the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Input the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate the minimum width of the road\r\nwidth = sum(2 if height > h else 1 for height in heights)\r\n\r\n# Output the result\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nn=0\r\nf=input().split()\r\nfor i in range(a):\r\n if int(f[i])>b:\r\n n+=2\r\n else:\r\n n+=1\r\n\r\nprint(n)", "n,h = map(int,input().split())\r\njudge_lst = list(map(int,input().split()))\r\nwidth = 0\r\nif int(len(judge_lst)) == n:\r\n for num in judge_lst:\r\n width = width + int((num-1)/h) + 1\r\nprint(width)", "no_friends, height_of_fence = list(map(int, input().strip().split()))\r\nheight_of_friends = list(map(int, input().strip().split()))\r\n\r\nroad_width = 0\r\nfor hof in height_of_friends:\r\n if hof > height_of_fence:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\nprint(road_width)\r\n", "def main():\n n, hFence = map(int, input().split())\n hFriends = list(map(int, input().strip().split()))\n width = 0\n\n for i in range(n):\n if(hFriends[i] <= hFence):\n width += 1\n else:\n width += 2\n print(width)\nif __name__ == '__main__':\n main()\n\n", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\ncounter =0 \r\nfriend=input()\r\nfriend_list=list(map(int , friend.split()))\r\nfor i in friend_list:\r\n if i >y :\r\n counter+=2\r\n else :\r\n counter += 1\r\nprint(counter)", "data = [int(i) for i in input().split()]\r\n\r\nnumber_of_people, fence_height = data[0], data[1]\r\n\r\nheights = [int(i) for i in input().split()]\r\nshorter_counter, taller_counter = 0, 0\r\n\r\nfor height in heights:\r\n\r\n if height > fence_height:\r\n\r\n taller_counter += 1\r\n\r\n else: shorter_counter += 1\r\n\r\n\r\nminimun_width = shorter_counter + 2*taller_counter\r\nprint(minimun_width)", "friends, height = input().split()\r\nfriends, height, = int(friends),int(height)\r\npeople = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in people:\r\n if i>height:\r\n total +=1\r\n total+=1\r\nprint(total)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 10 14:33:43 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\nlis=list(input().split())\r\nfor i in lis:\r\n if int(i)>h:\r\n n+=1\r\nprint(n)", "l = list(int(x) for x in input().split())\r\nl1 = list(int(x) for x in input().split())\r\ns = 0\r\nfor i in l1:\r\n if i>l[1]:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "nh=input().split()\r\nn=int(nh[0])\r\nh=int(nh[1])\r\ns=0\r\nt=input().split()\r\nfor i in t:\r\n if int(i)>h:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=[1]*a\r\nfor i in range(0,len(l)):\r\n if(l[i]>b):\r\n res[i]=2\r\n else:\r\n pass\r\nprint(sum(res))", "n, h = map(int,input().split())\r\nwidth = 0\r\nlist = input().split()\r\nfor i in range(n):\r\n if int(list[i]) > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "n,h=map(int,input(\"\").split()) \r\ns=list(map(int,input(\"\").split())) \r\nwidth_road=0 \r\nfor x in s: \r\n if x>h: \r\n width_road=width_road+2 \r\n else: \r\n width_road=width_road+1 \r\nprint(width_road)", "n,h = map(int,input().split())\r\nk = list(map(int,input().split()))\r\ns = 0\r\nfor i in (k):\r\n if i <=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n, h = [int(i) for i in input().split()]\r\nc = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n if i <= h:\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "a,h=map(int,input().split())\r\ns=0\r\nfor i in map(int,input().split()):\r\n if i<=h:\r\n s=s+1\r\nprint(2*a-s)", "friends, height_fence = [int(f) for f in input().split()]\r\nfriends_height = list([int(f) for f in input().split()])\r\nwidth = 0\r\n\r\nfor friend in friends_height:\r\n if friend > height_fence:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "a, b = map(int,input().split())\r\nw = 0\r\nx = list(map(int,input().split()))\r\nfor i in range(a):\r\n if x[i] > b:\r\n w += 1\r\n w += 1\r\nprint(w)\r\n", "n, h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nans = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 1\r\n ans += 1\r\n\r\nprint(ans)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nb=a.split()\nz=0\nfor i in range(n):\n b[i]=int(b[i])\n if b[i]>h:\n z +=2\n else:\n z +=1\nprint(z)\n \t \t \t\t \t \t \t\t \t\t \t\t", "n, v = map(int, input().split())\r\nhs = list(map(int, input().split()))\r\n\r\nw = 0\r\n\r\nfor h in hs:\r\n if h > v:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "n, h = map(int,input().split())\r\nans = 0\r\ng = list(map(int,input().split()))\r\nfor i in g:\r\n if i > h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "n, h = input().split()\r\npeople = []\r\nsum = 0\r\npeople = [int(x) for x in input().split()]\r\nfor i in people:\r\n if i <= int(h):\r\n sum += 1\r\n else:\r\n sum += 2\r\nprint(sum)", "n,h=map(int,input().split())\r\na=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if i>h:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)", "n,h=map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = n\r\nfor i in a:\r\n if i>h:\r\n ans +=1\r\nprint(ans)", "n, h = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ncount=0\r\nfor i in x:\r\n if i>h:count+=2\r\n else:count+=1\r\nprint(count)", "# https://codeforces.com/problemset/problem/677/A\r\n\r\nn, h = [int(e) for e in input().split()]\r\na = [int(e) for e in input().split()]\r\n\r\nc = 0\r\nfor e in a:\r\n if e > h:\r\n c += 2\r\n else:\r\n c += 1\r\nprint(c)\r\n", "p,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nw=0\r\nfor i in arr:\r\n if i <= h:\r\n w+=1\r\n else:\r\n w+=2\r\n \r\nprint(w)\r\n", "x,n1=input().split()\r\nn=int(n1)\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i<=n:\r\n c=c+1\r\n else:\r\n c=c+2\r\nprint(c)", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nc = 0\r\nfor height in heights:\r\n if height > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\n# Print the minimum road width\r\nprint(c)\r\n", "n, h = [int(x) for x in input().split(\" \")]\r\nl = [int(x) for x in input().split(\" \")]\r\n\r\nw = 0\r\n\r\nfor a in l:\r\n w += 1\r\n if a > h:\r\n w += 1\r\n\r\nprint(w)\r\n", "score=0\r\nn,h=map(int,input().split())\r\nheights = list(map(int, input().split()))\r\nfor i in heights:\r\n \r\n if i> h:\r\n score+=2\r\n else:\r\n score+=1\r\n\r\n\r\nprint(score)", "n,f=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in x:\r\n if i<=f:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "def fence(n,h,heights):\r\n total=0\r\n for height in heights:\r\n if h<height:\r\n total+=2\r\n else:\r\n total+=1\r\n return total\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nresults=fence(n,h,heights)\r\nprint(results)", "def inp():\r\n return int(input())\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\nl=inlt()\r\nn=l[0]\r\nh=l[1]\r\np=inlt()\r\nwidth=0\r\nfor i in range(n):\r\n if(p[i]>h):\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width) ", "n, h = input().split()\nn = int(n)\nh = int(h)\nlist = [int(i) for i in input().split()]\nans = 0\nfor i in list:\n if i > h:\n ans += 2\n else:\n ans += 1\nprint(ans)\n\t\t\t\t\t \t \t \t\t \t\t \t \t \t\t\t", "n, h = map(int, input().split())\r\ncnt = 0\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if heights[i] > h:\r\n cnt += 2\r\n else:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "x,y = input().split()\r\nh = input().split()\r\ncount = 0\r\nfor i in h:\r\n if int(i) > int(y):\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "num = input().split(\" \")\nh = map(int, input().split(\" \"))\nsum = 0\nfor i in h:\n if i>int(num[1]):\n sum+=2\n else:\n sum+=1\nprint(sum)\n\n", " \r\nn, h = map(int, input().split()) # Read the number of friends and the height of the fence\r\nheights = list(map(int, input().split())) # Read the heights of the friends\r\n\r\nwidth = 0 # Initialize the minimum width of the road to 0\r\n\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # If the friend's height is greater than h, they need 2 units of width\r\n else:\r\n width += 1 # Otherwise, they need 1 unit of width\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n c+=2\r\n else:\r\n c+=1 \r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range (n):\r\n if a[i]>h:\r\n c+=1\r\nprint(c+n)\r\n", "import sys\r\n\r\nn, h = map(int, sys.stdin.readline().strip().split())\r\nheights = list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nres = 0\r\nfor height in heights:\r\n if height > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "n, h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nx=input().split()\r\nx=[int(i) for i in x]\r\nsum=0\r\nfor j in range(n):\r\n if x[j]>h:\r\n sum=sum+2\r\n else:\r\n sum=sum+1\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nw = 0\r\nfor x in a:\r\n if x > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nct = n\r\nstrange = list(map(int, input().split()))\r\nfor i in strange:\r\n if i > h:\r\n ct += 1\r\nprint(ct)\r\n\r\n\r\n\r\n\r\n\r\n", "# n,h = input().split()\n# n = int(n)\n# h = int(h)\n\nn, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\ncnt = 0\nfor a in arr: # 8 7 9 3\n if a > h:\n cnt += 2\n else:\n cnt += 1\n\nprint(cnt)\n\n \t \t\t \t\t\t \t\t\t \t\t\t\t \t", "n = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ns = 0\r\n\r\nfor i in a:\r\n if i > n[1]:\r\n s += 2\r\n else:\r\n s += 1\r\n \r\nprint(s)", "input_values = list(map(int, input().split()))\r\nn = input_values[0]\r\nh = input_values[1]\r\nwidth = 0\r\nheights = list(map(int, input().split())) # Use a different variable name\r\nfor char in heights:\r\n if char > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor e in a:\r\n if e > h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\ns = [int(i) for i in input().split()]\r\nlen_c = 0\r\nfor i in range(len(s)):\r\n if s[i] > h:\r\n len_c +=2\r\n else:\r\n len_c +=1\r\n\r\nprint(len_c)", "x, m = map(int, input().split())\r\nh1 = list(map(int, input().split()))\r\nmin = 0\r\nfor height in h1:\r\n if height > m:\r\n min += 2 \r\n else:\r\n min += 1 \r\nprint(min)\r\n", "n, h = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\ncount = 0\r\nfor num in numbers:\r\n if num <= h:\r\n count += 1 \r\n else:\r\n count += 2\r\nprint(count)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 1\r\nwb = 2\r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] <= h:\r\n ans = ans + w\r\n elif a[i] > h:\r\n ans = ans + wb\r\n \r\nprint(ans)", "ct = 0 \r\nn,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n if(l[i]<=h):\r\n ct = ct + 1\r\n \r\n else:\r\n ct = ct + 2 \r\n \r\nprint(ct) ", "numbers = input().split(\" \")\r\nn = int(numbers[0])\r\nh = int(numbers[1])\r\nheights = [int(el) for el in input().split(\" \")]\r\nans = 0\r\nfor i in range(len(heights)):\r\n if heights[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "sf = list(map(int, input().split(' ')))\r\ns = list(map(int, input().split(' ')))\r\npoint = 0\r\nfor i in s:\r\n if i > sf[1]: point += 2\r\n else: point += 1\r\nprint(point)", "n , h = map(int,input().split())\r\ncount=0\r\nheights = list(map(int, input().split()))\r\n\r\nfor i in heights:\r\n if i <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "a=list(map(int,input().strip().split()))[:2]\r\nn=a[0]\r\nh=a[1]\r\nl=a=list(map(int,input().strip().split()))[:n]\r\nans=0\r\nfor i in l:\r\n if i>h:\r\n ans+=1\r\nprint(len(l)+ans)", "a,s=list(map(int,input().split()))\r\nr=0\r\nd=input()\r\nf=d.split()\r\nfor x in f:\r\n if(int(x)<=s):\r\n r+=1\r\n else:\r\n r+=2\r\nprint(r)", "x = input().split()\r\nh = int(x[1])\r\nn = int(x[0])\r\na = input().split()\r\nm = 0\r\n\r\nfor i in a :\r\n if int(i) > h :\r\n m += 2 \r\n else : \r\n m += 1\r\n \r\nprint(m) ", "n, h = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\n\ncnt = 0\n\nfor a in arr:\n if a > h:\n cnt += 2\n else:\n cnt += 1\n\nprint(cnt)\n \t \t\t\t \t\t \t\t \t\t \t\t \t\t \t\t\t", "a = input().split()\r\nfriends = input().split()\r\n\r\nf = int(a[0])\r\nh = int(a[1])\r\n\r\nfor x in range(len(friends)):\r\n if int(friends[x]) > h:\r\n f = f + 1\r\n\r\n\r\nprint(f)\r\n\r\n\r\n\r\n", "n, h = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nfor i in l:\r\n if i>h:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "n, h = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\nv = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n v += 2\r\n \r\n else:\r\n v += 1\r\n \r\n\r\nprint(v)", "n, h = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nfor i in arr:\r\n if i > h: counter += 1\r\n counter += 1\r\n\r\nprint(counter)", "n, h=map(int, input().split())\r\na=list(map(int, input().split()))\r\nfor i in a:\r\n if i>h:\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nf=list(map(int,input().split()))\r\ncount=0\r\nfor i in f:\r\n if i>h:\r\n count+=2\r\n if(i==h or i<h):\r\n count+=1\r\nprint(count)\r\n", "size,a=map(int, input().split())\r\narr=list(map(int, input().split()))\r\ncount=0\r\nfor i in arr:\r\n if i>a:\r\n count+= 2\r\n else:\r\n count+= 1\r\nprint(count)\r\n", "n, h = map(int, input().split())\r\narr = [int(item) for item in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n if arr[i] // h == 0 or arr[i] == h:\r\n c = c + 1\r\n else:\r\n c = c + 2\r\nprint(c)\r\n", "n,h = map(int, input().split())\r\na = list(map(int,input().split()))\r\nif len(a) == n:\r\n count = 0\r\n i = 0\r\n while i < n:\r\n if a[i] <= h:\r\n count += 1\r\n if a[i] > h:\r\n count += 2\r\n i = i + 1\r\n print(count)\r\n", "a, b = map(int, input().split())\r\nf = 0\r\ns = [int(x) for x in input().split()]\r\nfor i in s:\r\n f += (1 if i <= b else 2)\r\nprint(f)\r\n", "nh=input().split()\r\na=input().split()\r\nwide=0\r\nfor x in range(0,int(nh[0])):\r\n if int(a[x])<=int(nh[1]):\r\n wide+=1\r\n else:\r\n wide+=2\r\nprint(wide)\r\n", "n,h=map(int, input().split())\np=list(map(int, input().split()))\n\nc = 0\nfor a in p:\n if a <= h:\n c += 1\n else:\n c += 2\n \nprint(c)", "a, b = map(int,input().split())\r\nprint(a + sum(1 for i in map(int, input().split()) if i>b))", "n, h = input().split()\r\nheights = (input().split())\r\n\r\nn = int(n)\r\nh = int(h)\r\nfor j in range(n):\r\n heights[j] = int(heights[j])\r\n\r\nw = 0\r\nfor x in heights:\r\n if x > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "a_user = input().split(\" \")\r\nb_user = input().split(\" \")\r\ncount = 0\r\nfor i in range(int(a_user[0])):\r\n if int(b_user[i]) <= int(a_user[1]):\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "s = input()\r\nlst = s.split(' ')\r\nn = int(lst[0])\r\nm = int(lst[1])\r\ns1 = input()\r\nlst1 = s1.split(' ')\r\nk = 0\r\nfor i in range(0,n):\r\n if int(lst1[i]) > m:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "n, h = map(int, input().split(\" \"))\r\n\r\n# iterating till the range\r\n\r\nlst = list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if lst[i]<=h:\r\n ans=ans+1\r\n elif lst[i]>h:\r\n ans=ans+2\r\nprint(ans) ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ni=0\r\nans=0\r\nwhile i<len(a):\r\n if a[i]>h:\r\n i-=1\r\n break\r\n ans+=1\r\n i+=1\r\ni+=1\r\nif i<n:\r\n ans+=(2*(n-i))\r\nprint(ans)", "data = input().split()\r\nn = int(data[0])\r\nh = int(data[1])\r\ndata = input().split()\r\nsum = 0\r\nfor i in range(n):\r\n if int(data[i]) > h:\r\n sum += 2\r\n else:\r\n sum += 1\r\nprint(sum)", "n,h=map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nwidth=0\r\nfor i in range(0, len(lst)):\r\n if lst[i]<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "n, h = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n counter += 2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n,h = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nwidth = 0\r\nfor i in b:\r\n if i<=h:\r\n width+=1\r\n else:\r\n width +=2\r\nprint(width) ", "def w(n, h, heights):\r\n r_w = 0\r\n\r\n for height in heights:\r\n if height <= h:\r\n r_w += 1\r\n else:\r\n r_w += 2\r\n\r\n return r_w\r\n\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nprint(w(n, h, heights))", "n,h=input().split()\r\nn,h=int(n),int(h)\r\nk=list(map(int,input().split()))\r\nc=0\r\nfor i in k:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = (int(i) for i in input().split())\r\nheights = [int(i) for i in input().split()]\r\nwid = 0\r\nfor h_p in heights:\r\n if h_p <= h:\r\n wid += 1\r\n else:\r\n wid += 2\r\nprint(wid)", "n,h=map(int, input().split())\r\na=list(map(int,input().split()))\r\nwidth=0\r\nfor i in a:\r\n if i>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n", "s=input().split()\r\nn=int(s[0])\r\nh=int(s[1])\r\np=input().split()\r\nx=0\r\nfor i in range(n):\r\n if int(p[i])<=h:\r\n x+=1\r\n else:\r\n x+=2\r\nprint(x)\r\n ", "n,h=map(int,input().split())\r\na=map(int,input().split())\r\nt=0\r\nfor i in a:\r\n if i>h:t+=2\r\n else:t+=1\r\nprint(t)", "b, c = (map(int,input().split()))\r\ncount = 0\r\nfor i in map(int,input().split()):\r\n if i <= c:\r\n count = count + 1\r\n else:\r\n count = count + 2\r\nprint(count)", "amount, fence = map(int, input().split())\r\ntotal = 0\r\nfriends = []\r\nfor i in input().split():\r\n friends.append(int(i))\r\n if int(i) > fence:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "x,y=list(map(int,input().split()))\r\n\r\na=list(map(int,input().split()))\r\ncount1=0\r\ncount2=0\r\nfor i in a:\r\n if i>y :\r\n count2+=1\r\n else:\r\n count1+=1\r\n\r\nprint(count1+count2*2)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "x,y = map(int,input().split())\r\na = 0\r\nb = 0\r\nz = list(map(int, input().split()))\r\nfor i in range(x):\r\n if z[i] <= y:\r\n a+=1\r\n else:\r\n a+=2\r\n\r\nprint(a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,f=map(int,input().split())\r\nw=0\r\nh=input().split()\r\nfor i in h:\r\n if int(i)>f:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nr=map(int,input().split())\r\nc=0\r\nfor i in r:\r\n if i > h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nd=0\r\nfor i in b:\r\n if i<=k:\r\n d+=1\r\n else:\r\n d+=2\r\nprint(d)", "n, h = map(int, input().split())\n\na = list(map(int, input().split()))\n\nans = n\n\nfor x in a:\n\tif x > h:\n\t\tans += 1\n\nprint(ans)\n", "n,fh=input().split()\r\nn=int(n)\r\nfh=int(fh)\r\nhts=input().split()\r\ncnt=0\r\nfor i in hts:\r\n if(int(i)>fh):\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n\r\nprint(cnt)", "s = input().split(' ')\r\nh = int(s[1])\r\nn = input().split(' ')\r\nm = [int(x) for x in n]\r\nc = 0\r\nfor i in m:\r\n if i <= h:\r\n c += 1\r\n else:\r\n c += 1\r\n while i > h:\r\n i /= 2\r\n c += 1\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nd=0\r\nfor i in range(a):\r\n if(c[i]>b):\r\n d=d+2\r\n else:\r\n d=d+1\r\nprint(d)", "a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nk=0\r\nfor i in range(a):\r\n if s[i]<=b:\r\n k+=1\r\n else:\r\n k+=2\r\nprint(k)", "def minimum_road_width(n, h, heights):\r\n count = 0\r\n for height in heights:\r\n if height > h:\r\n count += 2\r\n else:\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate and print the minimum road width\r\nprint(minimum_road_width(n, h, heights))\r\n", "s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in l:\r\n if i>t:\r\n k.append(2)\r\n else:\r\n k.append(1)\r\nprint(sum(k))\r\n \r\n\r\n ", "a, b = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nwidth_of_road = 0\r\nfor i in range(a):\r\n if heights[i] <= b:\r\n width_of_road += 1\r\n else:\r\n width_of_road += 2\r\nprint(width_of_road)", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\na = 0\r\nfor i in arr:\r\n if i > h:\r\n a += 1\r\nprint(len(arr)+a)", "l=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in l1:\r\n if i>l[1]:\r\n c=c+2\r\n else:\r\n c=c+1\r\nprint(c)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=sum(2 for i in l if i>h)\r\nprint(count+(len(l)-(count//2)))", "a = input().split()\r\nb = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\ntotal = 0\r\nfor i in b:\r\n if int(i) > k:\r\n total += 1\r\nprint(n + total)\r\n", "n , h = map(int,input().split())\r\ni = list(map(int,input().split()))\r\n\r\nw = 0\r\nx=0\r\nwhile(x<n):\r\n ph = i[x]\r\n if(ph>h):\r\n w+=2\r\n else:\r\n w+=1\r\n x+=1\r\nprint(w)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ni = 1\r\nj = 0\r\nsum = 0\r\n\r\nwhile i <= n:\r\n if a[j] <= h:\r\n sum+=1\r\n else:\r\n sum+=2\r\n j+=1\r\n i+=1\r\n\r\n\r\nprint(sum)", "n,h=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nc=0\r\nfor i in v:\r\n if i<=h:\r\n c+=1\r\n elif i>h:\r\n c+=2\r\nprint(c)", "n, h = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nsum = 0\r\nfor i in range(len(arr)):\r\n if arr[i] <= h:\r\n sum += 1\r\n else:\r\n sum += 2\r\n\r\nprint(sum)", "n, h = input().split()\na = list(map(int, input().split()))\nresult = 0\n\nfor i in a:\n if i <= int(h):\n result += 1\n else:\n result += 2\n\nprint(result)\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in range(a):\r\n if b>=c[i]:\r\n l=l+1\r\n elif c[i]%b==0:\r\n l=l+(c[i]//b)\r\n else:\r\n l=l+((c[i]//b)+1)\r\nprint(l)", "a,b = map(int,input().split())\r\nm = list(map(int,input().split()))\r\nz = 1*len(m)\r\nfor x in range(a):\r\n if m[x]>b:\r\n z+=1\r\nprint(z)\r\n \r\n", "n, h = map(int,input().split())\r\npersons_h = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in persons_h:\r\n if i <= h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width) ", "n,h=map(int,input().split())\r\nli=[int(i) for i in input().split()]\r\nc=0\r\nfor i in li:\r\n if i<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)\r\n", "n, h = map(int, input().split())\r\nfriends = input().split()\r\nshirina = n\r\n\r\nfor i in friends:\r\n if int(i) > int(h):\r\n shirina += 1\r\n\r\nprint(shirina)", "# Problem 677 A - Vanya and Fence\r\nnum,fence_height = [int(i) for i in input().split()]\r\nheights = [int(i) for i in input().split()]\r\nroad_width = num\r\nfor height in heights:\r\n if height > fence_height:\r\n road_width +=1\r\nprint(road_width)", "n,k=input().split()\nn=int(n)\nk=int(k)\n\na=input().split()\n\nwidth=0\nfor i in range (n):\n if(int(a[i])>k):\n width+=2\n else:\n width+=1\n\n\nprint(width)\n\n\n\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t\t \t\t\t", "s = input()\r\nn = int(s.split()[0])\r\nh = int(s.split()[1])\r\nx = input()\r\n\r\nw = 0\r\nfor i in x.split():\r\n if int(i) > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "friends, fence_height = map(int, input().split())\r\nfriends_height_array = list(map(int, input().split()))\r\narr = []\r\nfor i in friends_height_array:\r\n if i > fence_height:\r\n arr.append(2)\r\n else:\r\n arr.append(1)\r\nprint(sum(arr))\r\n", "n,h=map(int,input().split())\r\nhi = list(map(int,input().split()))\r\ncount=n\r\nfor i in range(len(hi)):\r\n if hi[i] > h:\r\n count +=1\r\nprint(count)", "n,h=map(int,input().split())\r\na=list(input().split())\r\nwidth=0\r\nfor i in range(n):\r\n if int(a[i])>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "aiwi = input().split()\r\nheight = int(aiwi[1])\r\nheight_list = input().split()\r\ncount = 0\r\nheight_list = [int(i) for i in height_list]\r\nfor i in height_list:\r\n \r\n if i > height:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint (count)", "a , b=map(int,input().split())\r\nsum=0\r\nl=list(map(int,input().split()))\r\nfor i in range(a):\r\n if l[i]>b:\r\n sum+=2\r\n else:\r\n sum+=1\r\n\r\nprint(sum)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor x in a:\r\n if x > h:\r\n c += 1\r\nprint(len(a) + c)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nc=n\r\n\r\nfor i in a:\r\n if i>h:\r\n c+=1\r\n\r\nprint(c)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(len(l)):\r\n if l[i]<=h:\r\n cnt+=1\r\n else:\r\n j=0\r\n ele=l[i]\r\n while(ele>h):\r\n if(j==0):\r\n cnt+=2\r\n else:\r\n cnt+=1\r\n j+=1\r\n ele=ele//2\r\nprint(cnt)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\nans=n\r\nfor i in a:\r\n if(i>h):\r\n ans+=1\r\nprint(ans)", "n, h = map(int, input().split())\nheights = list(map(int, input().split()))\n\nwidth = 0\n\nfor n in heights:\n if n <= h:\n width += 1\n elif n > h:\n width += 2\nprint(width)\n", "n, h = input().split()\r\nt = input().split()\r\nw = 0\r\n\r\nfor i in t:\r\n if int(i) > int(h):\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "x=input()\r\nx=x.split(\" \")\r\nnumber_of_friends= int(x[0])\r\nhight_of_fence= int(x[1])\r\nx=input()\r\nx=x.split(\" \")\r\nhight_of_friends= [int(i) for i in x]\r\n\r\ndef find_width(hight_of_fence, hight_of_friends):\r\n\r\n width=0\r\n for h in hight_of_friends:\r\n if h > hight_of_fence:\r\n width+=2\r\n else:\r\n width+=1\r\n return width\r\n\r\nprint(find_width(hight_of_fence, hight_of_friends))\r\n ", "def widthCalc(height, list):\r\n widthNeeded = 0\r\n for i in list:\r\n if i > height:\r\n widthNeeded += 2\r\n else:\r\n widthNeeded += 1\r\n return widthNeeded\r\n\r\nif __name__ == '__main__':\r\n _, height = input().split()\r\n height = int(height)\r\n people = [int(h) for h in input().split()]\r\n print(widthCalc(height, people))\r\n", "n, h = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nw = n\r\nfor i in a:\r\n if i > h:\r\n w += 1\r\nprint(w)\r\n", "from sys import stdin, stdout\r\nn, h = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nans = 0\r\nfor i in range(n):\r\n ans += 1\r\n if a[i] > h:\r\n ans += 1\r\nstdout.write(str(ans))", "# your code goes here\r\ndef main():\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n\r\n for i in range(n):\r\n if a[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n, h = map(int, input().split())\n print(n+sum([v > h for v in list(map(int, input().split()))]))\n\n\t\t \t\t\t \t\t \t \t\t \t \t\t \t \t\t\t\t\t \t", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor loop in range(n):\r\n if arr[loop] > h:\r\n count += 2\r\n else:\r\n count += 1\r\nprint(count)", "def main():\n n,h = map(int,input().split(' '))\n arr = list(map(int,input().split(' ')))\n min_width = 0\n for i in arr:\n if(i>h):\n min_width += 2\n else:\n min_width += 1\n print(min_width)\n\nmain()", "list1 = input().split()\r\nnum = int(list1[0])\r\nheight = int(list1[1])\r\n\r\nlist2 = input().split()\r\nlist3 = [int(x) for x in list2]\r\ncount = 0 \r\nfor ch in list3:\r\n if ch > height:\r\n count += 1\r\nprint(num + count)", "n,h=map(int,input().split())\r\ncounter=0\r\nfor i in list(map(int,input().split())):\r\n if i>h:\r\n counter+=2\r\n else:\r\n counter+=1\r\nprint(counter)", "from collections import Counter\r\ndef solve(ls, H):\r\n width = 0\r\n for item in ls:\r\n width += 1\r\n if item > H:\r\n width += 1\r\n return width\r\n\r\nH = int(input().split()[1])\r\nls = list(map(int, input().split()))\r\nprint(solve(ls, H))", "x,r,*v=map(int,open(0).read().split());print(x+sum(n>r for n in v))\r\n#hi codeforces\r\n#", "frd,height = input().split(\" \")\r\nfriends = input().split(\" \")\r\nout = 0\r\nfor i in friends:\r\n if int(i) > int(height):\r\n out +=2\r\n else:\r\n out +=1\r\nprint(out)", "# a = []\r\ns = 0\r\nn,h = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\n\r\nfor i in nums:\r\n # c = int(input())\r\n if i > h:\r\n s += 2\r\n else:\r\n s +=1\r\n# a.append(c)\r\n \r\nprint(s)\r\n \r\n# type(a)", "# https://codeforces.com/contest/677\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, h = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\nfor x in a:\n if x > h:\n ans += 2\n else:\n ans += 1\nprint(ans)", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nt = 0\r\nfor i in a:\r\n if i>h:\r\n t += 2\r\n else:\r\n t+=1\r\nprint(t)", "#https://codeforces.com/contest/677/problem/A\r\n\r\nn = input().split()\r\nn, h = int(n[0]), int(n[1])\r\n\r\n# while n: \r\nheights = input().split()\r\nwidth = 0\r\nfor height in heights: \r\n if int(height) <= h: \r\n width += 1\r\n else:\r\n width += 2 \r\nprint(width)\r\n # n-=1", "n,h = [int(x) for x in input().split()]\r\n\r\n\r\nk = [int(x) for x in input().split() ]\r\nwidth = 0\r\nfor i in k:\r\n if i <=h:\r\n width = width+1\r\n else:\r\n width = width+2\r\n\r\nprint(width)", "n, h = input().split()\r\ntall = list(map(int, input().split()))\r\nw = 0\r\nq = 0\r\nwidth_road = 0\r\nfor i in range(len(tall)):\r\n if int(tall[i]) <= int(h):\r\n w += 1\r\n elif int(tall[i]) > int(h):\r\n q += 2\r\nwidth_road = w + q\r\nprint(width_road)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n if a[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in a:\r\n\tif i>m:\r\n\t\ts+=1\r\nprint((n-s)+(s*2))", "n=input().split(\" \")\r\nh=input().split(\" \")\r\nc=0\r\nfor i in range(int(n[0])):\r\n if int(h[i])<=int(n[1]):\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "a, b = map(int, (input().split()))\r\nc = list(map(int, input().split()))\r\nx = 0\r\nfor i in c:\r\n if i > b:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i > h:\r\n s=s+2\r\n else:\r\n s=s+1\r\nprint(s)\r\n#print(n)\r\n#print(h)\r\n#print(l)\r\n", "n,h=map(int,input().split())\r\nthe_list=list(map(int,input().split()))\r\n\r\nw=0\r\nfor i in the_list:\r\n w+=1\r\n if i > h :\r\n w+=1\r\nprint(w)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncounter=0\r\nfor i in l:\r\n if(i>h):\r\n counter=counter+2\r\n else:\r\n counter=counter+1\r\nprint(counter)", "umber_of_friends, height_of_fence = map(int, input().split())\r\nlist_of_heights = (map(int, input().split()))\r\n\r\nwidth = 0\r\nfor height in list_of_heights:\r\n if height > height_of_fence:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 6 21:24:13 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, h = list(map(int, input().split()))\r\nai = list(map(int, input().split()))\r\nwi = [1 for a in ai if a > h]\r\nprint(sum(wi) + n)", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # If height exceeds h, they need to bend, so add 2 to the width.\r\n else:\r\n width += 1 # If height is less than or equal to h, they can walk normally, so add 1 to the width.\r\n\r\nprint(width)\r\n", "a = input().split()\r\nn = int(a[0])\r\nh = int(a[1])\r\nhl = input().split()\r\nw = 0\r\nfor i in hl:\r\n i = int(i)\r\n if i > h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)\r\n \r\n \r\n", "n, h = input().split()\narr = input().split()\nextra = 0\nfor i in arr:\n if int(i) > int(h):\n extra += 1\n\nprint(int(n) + extra)", "fence = int(input().split()[1])\r\nwidth =0\r\nfor i in list(map(int,input().split())):\r\n if i>fence:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "t,n = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in l:\r\n if i > n:\r\n c += 2\r\n else:\r\n c += 1\r\nprint(c)", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(a):\r\n if l[i] > b:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "n, h = map(int, input().split())\r\nnums = input().split()\r\nnums = [int(num) for num in nums]\r\nans = 0\r\n\r\nfor i in range(n):\r\n if nums[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "# URL: https://codeforces.com/problemset/problem/677/A\nn, h = map(int, input().split())\nans = n\nfor a in map(int, input().split()):\n ans += a > h\nprint(ans)\n", "total = 0\r\nn, h = map(int, input().split())\r\nmans = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if mans[i] <= h:\r\n total += 1\r\n else:\r\n total += 2\r\nprint(total)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor x in a:\r\n if x > h:\r\n n += 1\r\nprint(n)\r\n", "ip = input().split(\" \")\r\nheights = input().split(\" \")\r\n\r\nwidth = 0\r\n\r\nn = ip[0]\r\nfence = ip[1]\r\n\r\nfor i in range(len(heights)):\r\n if int(heights[i]) > int(fence):\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(int(width))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 17:50:22 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\nwide=0\r\ndata1=list(map(int,input().split()))\r\ndata2=list(map(int,input().split()))\r\nn=data1[0]\r\nh=data1[1]\r\nfor i in data2:\r\n if i > h:\r\n wide+=2\r\n else:\r\n wide+=1\r\nprint(wide)\r\n", "num_height = input().split()\r\nfriends_num = int(num_height[0])\r\nheight = int(num_height[1])\r\nfriends_height = input().split()\r\nroad_width = 0\r\nfor one in friends_height:\r\n if int(one) > height:\r\n road_width += 2\r\n else:\r\n road_width += 1\r\nprint(road_width)", "\r\nn,h = (input().split(\" \"))\r\nn,h = int(n), int(h)\r\nrows = list(str(input()).split())\r\nrows = [int(x) for x in rows]\r\ncount = 0\r\nfor x in rows:\r\n\r\n if x%h == 0:\r\n count += int(x/h)\r\n elif x%h > 0:\r\n count += 1 + int(x/h)\r\n else:\r\n continue\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# a,b = (input().split(\" \"))\r\n# a,b = list(a),int(b)\r\n# a = [int(x) for x in a]\r\n# for i in range(b):\r\n# if a[-1] == 0:\r\n# a.pop()\r\n# else:\r\n# a[-1] -= 1\r\n# a = \"\".join([str(x) for x in a]) \r\n# print(a)\r\n\r\n\r\n\r\n\r\n\r\n# a,b = (input().split(\" \"))\r\n# a,b = int(a),int(b)\r\n# count = 0 \r\n# while a <= b:\r\n# a = a*3\r\n# b = b*2\r\n# count += 1\r\n", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i>y:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "(n,h) = map(int,input().split())\r\nhlist = list(map(int,input().split()))\r\nfor x in hlist:\r\n if x > h:\r\n n += 1\r\nprint(n)\r\n", "n, h = list(map(int, input().split()))\r\n\r\nm = list(map(int, input().split()))\r\n\r\nb = 0\r\n\r\nfor i in range(n):\r\n \r\n if m[i] > h:\r\n \r\n b += 2\r\n \r\n else:\r\n \r\n b += 1\r\n \r\nprint(b)", "quantity, height = map(int, input().split())\nroad_width = 0\nn = 0\nboy_height = input().split()\nfor i in range(quantity):\n if int(boy_height[n]) > height:\n n += 1\n road_width += 2\n else:\n road_width += 1\n n += 1\nprint(road_width)", "fr, high = map(int,input().split())\r\nwidth = 0\r\nfor i in list(map(int,input().split())):\r\n if i > high: width += 2\r\n else: width += 1\r\nprint(width)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "def solve(heights, h):\r\n width = 0\r\n return sum(2 if height > h else 1 for height in heights)\r\n\r\n \r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n, h = map(int, input().split())\r\n heights = list(map(int, input().split()))\r\n print(solve(heights, h))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdin, stdout\r\nn,h=map(int,stdin.readline().split())\r\n\r\n\r\nl= list(map(int,stdin.readline().split()))\r\n\r\nresult = 0\r\nfor i in l :\r\n if i<=h:\r\n result+=1\r\n else:\r\n result+=2\r\nstdout.write(str(result))", "n, h = map(int, input().split())\r\nmem = list(map(int, input().split()))\r\ncount=0\r\nfor i in mem:\r\n if(i<=h):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "a=list(map(int,input().split(\" \")))\r\nn=a[0]\r\nh=a[1]\r\nheight=list(map(int,input().split(\" \")))\r\nwidth=n\r\nfor i in range(n):\r\n if height[i]>h:\r\n width+=1\r\nprint(width)", "n, h = map(int, input().split())\r\nt = list(map(int, input().split())) \r\nw = 0\r\nfor i in t:\r\n if i > h:\r\n w += 2\r\n else:\r\n w += 1\r\n\r\nprint(w)\r\n", "n, h = map(int, input().split())\r\nwidth = 0\r\nlst = list(map(int, input().split()))\r\nfor i in range(len(lst)):\r\n if lst[i] > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "user_input = input().split()\r\nheights = input().split()\r\nroad_width = 0\r\nfor i in heights:\r\n if int(i) > int(user_input[1]):\r\n road_width += 2\r\n else:\r\n road_width += 1\r\n \r\nprint(road_width)", "width = 0\r\ndata = list(map(int, input().split(\" \")))\r\nheight = list(map(int, input().split(\" \")))\r\nfor x in height:\r\n if x > data[1]:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "i1 = input()\r\ni1 = i1.split()\r\ninput1=[]\r\nfor x in i1:\r\n\tinput1.append(int(x))\r\n\t\r\n\t\r\nn=input1[0]\r\nh=input1[1]\r\n\r\nheight = input().split()\r\nh2 = []\r\nfor y in height:\r\n\th2.append(int(y))\r\n\t\r\n\r\nctr =0\r\nfor high in h2:\r\n\tif high<=h:\r\n\t\tctr+=1\r\n\telif high>h:\r\n\t\tctr+=2\r\n\r\nprint (ctr)\r\n", "value = list(map(int, input().split(' ')))\r\nh = value[1]\r\nvalue = list(map(int, input().split(' ')))\r\ntotal = 0\r\nfor i in range(len(value)):\r\n if value[i] > h:\r\n total += 2\r\n else:\r\n total += 1\r\nprint(total)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n if i<=k:\r\n ans+=1\r\n else:\r\n ans+=2\r\nprint(ans)", "string = input().split()\r\nstring1 = input().split()\r\nn, h = int(string[0]), int(string[1])\r\ncounth = 0\r\nfor i in string1:\r\n k = int(i)\r\n while k > h:\r\n if k > h:\r\n k /= 2\r\n counth += 1\r\n else:\r\n continue\r\n if k < h:\r\n continue\r\nprint(len(string1) + counth)\r\n\r\n\r\n\r\n", "n, h = map(int, input().split())\r\n\r\nli = [int(x) for x in input().strip().split()]\r\n\r\nwidth = 0\r\nfor x in li:\r\n if x > h:\r\n width+=2\r\n else:\r\n width +=1\r\n\r\nprint(width)", "string1 = [int(i) for i in input().split()]\r\nn, h = string1[0], string1[1]\r\nmy_list = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n if my_list[i] <= h:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "soma = 0\n\nn, f = input().split(\" \")\nalturas = input().split(\" \")\n\nfor altura in alturas:\n cont = 1\n altura = int(altura)\n while (altura > int(f)):\n cont += 1\n altura /= 2\n \n soma += cont\n\nprint(soma)\n", "n,h = map(int,input().split())\r\n\r\nwidth = 0\r\n\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(len(a)):\r\n if a[i] > h: width += 2\r\n else: width += 1\r\n\r\nprint(width) \r\n\r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nx=[int(i) for i in input().split()]\ny=0\nfor i in range (n):\n if x[i]<=h:\n y=y+1\n else:\n y=y+2\nprint(y)\n \t\t\t \t \t\t \t\t\t \t \t \t \t \t \t", "friends, fence = list(map(int, input().split()))\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nh = 0\r\n\r\nfor i in heights:\r\n if i > fence:\r\n h += 1\r\n\r\nprint((h*2) + (friends - h))\r\n", "n,h = list(map(int,input().split()))\r\na= list(map(int,input().split()))\r\n#print(a)\r\n\r\ncnt=0\r\nfor i in range(0,n):\r\n if(a[i]>h):\r\n cnt = cnt + 2\r\n else:\r\n cnt = cnt + 1\r\nprint(cnt)", "i1 = input()\r\nil1 = i1.split(' ')\r\nn = int(il1[0])\r\nh = int(il1[1])\r\ni2 = input()\r\nil2 = i2.split(' ')\r\n\r\nmini = 0\r\n\r\nfor i in il2:\r\n if int(i) > h:\r\n mini +=2\r\n else:\r\n mini+=1\r\nprint(mini)", "num, count = list(input().split()), 0\r\ns = list(input().split())\r\nfor i in range(len(s)):\r\n if int(s[i]) > int(num[1]):\r\n count += 1\r\nprint(int(num[0]) * 2 - (int(num[0]) - count))", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nwidth = sum(1 if x <= h else 2 for x in a)\r\nprint(width)", "n, h = map(int, input().split())\r\nArr = list(map(int, input().split()))\r\nFArr = [0, 0]\r\n\r\nfor ele in Arr:\r\n if ele > h:\r\n FArr[1] += 1\r\n else:\r\n FArr[0] += 1\r\n\r\nR = (FArr[0] * 1) + (FArr[1] * 2)\r\nprint(R)", "n, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nct = 0\r\n\r\nfor i in range(len(l)):\r\n if l[i]/t % 1 != 0:\r\n x = int(l[i]/t) + 1\r\n else:\r\n x = l[i]/t\r\n ct += x\r\nprint(int(ct))\r\n", "n, h = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int, input().split())\nH = list(map(int, input().split()))\ncounter = 0\nfor i in range(len(H)):\n if H[i] > h:\n counter += 1\nW = len(H) + counter\nprint(W)\n \t\t \t\t\t\t \t \t\t \t\t\t\t\t \t \t \t", "# Read the number of friends and the height of the fence\r\nn, h = map(int, input().split())\r\n\r\n# Read the heights of the friends\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width of the road\r\nmin_width = 0\r\n\r\n# Iterate through the heights and calculate the minimum width\r\nfor height in heights:\r\n if height > h:\r\n min_width += 2 # Friend needs to bend, so width is 2\r\n else:\r\n min_width += 1 # Friend can walk normally, so width is 1\r\n\r\n# Output the minimum width\r\nprint(min_width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwid = 0\r\nfor i in a:\r\n if i > h:\r\n wid += 2\r\n else:\r\n wid += 1\r\nprint(wid)", "x1=input().split()\r\nn=int(x1[0])\r\nk=int(x1[1])\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor x in l:\r\n if x>k:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)", "n,h = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor p in heights:\r\n if p > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nz=[]\r\nsol=[]\r\nfor i in x:\r\n if(i<=b):\r\n sol.append(1)\r\n else:\r\n sol.append(2)\r\nprint(sum(sol)) ", "n,h = map(int,input().split())\na = list(map(int,input().split()))\nm = 0\nfor i in a:\n i >h\n if i >h:\n m+=2\n else:\n m+=1\nprint(m)\n\t\t \t\t \t \t \t\t\t\t\t \t \t\t \t \t\t", "x,y,*a=map(int,open(0).read().split())\r\nprint(x+sum(n>y for n in a))", "n,h = map(int,input().split())\r\nans=0\r\nfor i in input().split():\r\n if int(i)>h:\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "m=input().split()\r\nn=int(m[0])\r\nh=int(m[1])\r\nl=input().split()\r\nk= list(map(int,l))\r\ncount=0\r\nfor i in (k):\r\n if i>h:\r\n count=count+2\r\n else:\r\n count+=1\r\nprint(count) ", "n, h = map(int, input().split()) \r\nheights = list(map(int, input().split())) \r\nwidths = [1 if height <= h else 2 for height in heights]\r\ntotal_width = sum(widths)\r\n\r\nprint(total_width)\r\n", "# Input n and h\r\ntotal_students, pass_height = map(int, input().split())\r\n\r\n# Input the heights of students\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the count with the total number of students\r\ncount = total_students\r\n\r\n# Iterate through the heights and increment count for students taller than pass_height\r\nfor height in heights:\r\n if height > pass_height:\r\n count += 1\r\n\r\n# Print the final count\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\np=0\r\nfor i in n:\r\n if i>b:\r\n p+=2\r\n else:\r\n p+=1\r\nprint(p)\r\n", "n, h = list(map(int, input().split(\" \")))\r\nf = list(map(int, input().split(\" \")))\r\nc = 0\r\nfor i in f:\r\n if i <= h:c += 1\r\n else: c += 2\r\nprint(c)\r\n", "ide = 0\r\nif ide == 1:\r\n import sys\r\n\r\n sys.stdin = open(\"677a.inp\", \"r\")\r\n\r\n\r\ndef main():\r\n n, h = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n w = 0\r\n for i in range(n):\r\n if a[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\n print(w)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,h=list(map(int,input().split()))\r\nw=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)", "n,h = map(int,input().split())\r\nlst = input().split()\r\nlst2 = [int(i) for i in lst]\r\nw=0\r\nfor i in lst2:\r\n if i<=h:\r\n w+=1\r\n else:\r\n w+=2\r\n\r\nprint(w)", "n, h = map(int, input().split())\nheight = [int(i) for i in input().split(\" \")]\nn = len(height)\nwidth = 0\n\nfor each in height:\n if each > h:\n width += 2\n else:\n width += 1\n\nprint(width)", "a=str(input(''))\r\nb=a.split()\r\nc=int(b[0])\r\nd=(str(input('')).split())\r\nfor i in d:\r\n if (int(b[1])<int(i)):\r\n c=c+1\r\nprint(c)", "n,h = map(int,input().split())\r\nlst = [int(x) for x in input().split()]\r\nmini_width = 0\r\n\r\nfor i in lst:\r\n if i <= h:\r\n mini_width += 1\r\n else:\r\n mini_width += 2\r\nprint(mini_width)", "m=input().split()\r\nn=int(m[0])\r\nh=int(m[1])\r\ncount=0\r\na=input().split()\r\nfor i in range(n):\r\n if int(a[i])<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n, h = map(int, input().split())\r\n\r\nrow = list(map(int, input().split()))[:n]\r\ncount = 0\r\nfor i in row:\r\n if i > h:\r\n count+=2\r\n else:\r\n count+=1\r\n\r\nprint(count)", "n,l=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nc=0\r\nfor i in lst:\r\n if i <= l:\r\n c +=1\r\n else:\r\n c +=2\r\n \r\nprint(c)", "a=0\r\nb,c=input().split()\r\nb=int(b)\r\nc=int(c)\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i]>c:\r\n a+=2\r\n else:\r\n a+=1\r\nprint(a)\r\n", "n, h = map(int, input().split())\r\n\r\na = list(map(int, \r\n input().strip().split()))[:n]\r\n\r\ncount = 0\r\nfor i in a:\r\n if i > h:\r\n count += 2\r\n else:\r\n count += 1\r\n \r\nprint(count)", "n,h = map(int,input().split())\nwidth = 0\narr = list(map(int,input().split()))\nfor i in range (0,n):\n if arr[i] > h:\n width += 2\n else: \n width += 1\n\nprint(width)\n\t \t\t\t \t \t \t\t\t\t \t \t\t\t\t\t", "n, h = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nout = 0\r\n\r\nfor i in x:\r\n if i > h:\r\n out += 2\r\n else:\r\n out += 1\r\n\r\nprint(out)", "a,b=map(int,input().split())\r\nk=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n if b < i:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)", "n,h=list(map(int,input().split()))\r\nheight=list(map(int,input().split()))\r\nheight.sort(reverse=True)\r\ni=0\r\nwhile(i<len(height) and height[i]>h): \r\n i=i+1\r\nprint(n+i)", "x,y=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nn=0\r\nfor i in r:\r\n\tif i<=y:\r\n\t\tn+=1\r\n\telse:\r\n\t\tn+=2\r\nprint(n)\r\n\t\t", "n, h = map(int, input().split()) # Input the number of friends and fence height\nheights = list(map(int, input().split())) # Input the heights of friends\n\ntotal_width = 0 # Initialize the total width required\n\nfor height in heights:\n if height > h:\n total_width += 2 # If height > h, width contribution is 2\n else:\n total_width += 1 # Otherwise, width contribution is 1\n\nprint(total_width)\n\n \t\t \t \t \t \t \t \t\t \t\t\t \t\t \t", "x, y = map(int, input().split())\r\nl= input().split()\r\nc = 0\r\nfor i in (l):\r\n if int(i) <= y:\r\n c += 1\r\n else: c += 2\r\nprint(c)\r\n \r\n", "n, h = input().split(\" \")\r\nA = input().split(\" \")\r\na = list(map(int, A))\r\nm = int(n)\r\nfor i in a:\r\n if i > int(h): m+= 1\r\nprint(m)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 15:30:50 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn, h = map(int, input().split())\r\nheight = list(map(int, input().split()))\r\ncount = 0\r\nfor high in height:\r\n if high <= h:\r\n count = count + 1\r\n else:\r\n count = count + 2\r\nprint(count)", "n,k =input().split()\nn =int(n)\nk=int(k)\na=input()\nx=a.split()\nc=0\nfor i in range(n):\n x[i]=int(x[i])\n if x[i]>k:\n c+=2\n else:\n c+=1\nprint(c)\n \t\t\t \t \t\t\t \t \t \t\t\t\t \t\t", "n, h = (int(i) for i in input().split())\r\na_n = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n a_n[i] = 1 if a_n[i] <= h else 2\r\nprint(sum(a_n))\r\n", "h,d=input().split()\nh=int(h)\nd=int(d)\na=input()\nx=a.split()\nc=0\nfor i in range(len(x)):\n x[i]=int (x[i])\n if x[i]>d:\n c+=2\n else:\n c+=1\nprint(c)\n\t\t \t \t\t\t \t\t \t\t\t\t\t \t\t\t\t", "i1 = list(map(int, input().strip().split()))\r\ni2 = list(map(int,input().strip().split()))\r\n\r\nh = i1[1]\r\n\r\nmax_width = 0\r\n\r\n\r\nfor fh in i2:\r\n if(fh > h):\r\n max_width += 2\r\n else:\r\n max_width += 1\r\nprint(max_width)", "n,h = map(int,input().split())\r\nf = input().split()\r\nc = n\r\nfor i in range(len(f)):\r\n if int(f[i]) > h :\r\n c += 1\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n if a[i]<=h:\r\n v+=1\r\n else:\r\n v+=2\r\nprint(v)", "n,h=map(int,input().split())\nL=list(map(int,input().split()))\ns=0\nfor i in range(n):\n if (L[i]<=h):\n s+=1\n else:\n s+=2\nprint(s) ", "\r\nn,h=input().split( \" \" )\r\nn=int(n)\r\nh=int(h)\r\nx=input().split( \" \" )\r\nw=0\r\n\r\nfor i in range(n):\r\n l=int(x[i])\r\n if(l<=h):\r\n \r\n w+=1\r\n else:\r\n w+=2\r\n \r\nprint(w) ", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, m = map(int, input().split())\r\nres = 0\r\n\r\nn = [int(i) for i in input().split()]\r\nfor i in n:\r\n if i > m:\r\n res += 2\r\n else:\r\n res += 1\r\nprint(res)", "import math\r\nn,h=map(int,input().split())\r\nheight= list(map(int, input().split()))\r\noutput=0\r\nfor i in range(n):\r\n output+=math.ceil((int(height[i]))/h)\r\nprint(output)", "number_of_friends, fence_height = map(int, input().split(\" \"))\r\nfriends = tuple(map(int, input().split(\" \")))\r\n\r\nrequired_width = number_of_friends\r\n\r\nfor friend in friends:\r\n if friend > fence_height:\r\n required_width += 1\r\n\r\nprint(required_width)\r\n", "n,h=map(int,input().split())\r\ns=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i>h:\r\n s+=1\r\n s+=1\r\nprint(s)\r\n", "# Read input for R (number of heights) and S (threshold height)\r\nnum_heights, threshold_height = map(int, input().split())\r\n\r\n# Read the list of heights\r\nheights = list(map(int, input().split()))\r\n\r\n\r\n\r\n# Initialize variable to keep track of total width\r\ntotal_width = 0\r\n\r\n# Iterate through each height in the list\r\nfor height in heights:\r\n # Check if the current height is greater than the threshold\r\n if height > threshold_height:\r\n # If it is, add 2 units to the width\r\n total_width += 2\r\n else:\r\n # If not, add 1 unit to the width\r\n total_width += 1\r\n\r\n# Print the total width\r\nprint(total_width)\r\n", "n,h = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(arr)):\r\n if arr[i] > h:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwidth = 0\r\n\r\nfor ht in a:\r\n if ht <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)", "n,h= map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nwidth=0\r\nfor i in lst:\r\n if i > h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n", "n,m=map(int,input().split());print(sum([int(1 if int(i)<=m else 2) for i in input().split()]))", "\r\nnum_of_freinds , height = map(int , input().split())\r\n\r\nwidth = 0\r\n\r\n# for i in range(num_of_freinds) :\r\nfreinds_heights = map(int , input().split())\r\nfor j in freinds_heights :\r\n if j > height :\r\n width += 2\r\n else :\r\n width += 1\r\n \r\nprint(width)", "\n\n\n\n\n\nn, h = map(int, input().split())\n\narr = list(map(int, input().split()))\n\ntot = 0\n\nfor i in arr :\n tot += 2 if i > h else 1\n\nprint(tot)\n\n\n \n \t\t \t \t\t\t \t \t \t\t \t\t\t \t\t", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\ns=0\r\nfor i in c:\r\n if i>b:\r\n s=s+2\r\n else:\r\n s=s+1\r\nprint(s)\r\n", "n, h = input().split()\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=int(h)):\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "n,h= map(int, input().split())\r\ny= list(map(int,input().split()))\r\nx=0\r\nfor i in y:\r\n if i>h:\r\n x+=2\r\n else:\r\n x+=1\r\nprint(x)", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nj=0\r\nfor i in range(n):\r\n if arr[i]<=h:\r\n j+=1\r\n else:\r\n j+=2\r\nprint(j)", "n,h=map(int,input().split())\r\ns=input().split()\r\nq=n\r\nfor i in range(n):\r\n if int(s[i])>h:\r\n q+=1\r\nprint(q)\r\n ", "\r\ncnt1=0\r\ncnt2=0\r\n\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nfor x in c:\r\n if x>b:\r\n cnt2=cnt2+2\r\n elif x<=b:\r\n cnt1=cnt1+1\r\n\r\nprint(cnt1+cnt2)", "z,x,*r=map(int,open(0).read().split());print(z+sum(n>x for n in r))", "#https://codeforces.com/contest/677/problem/A\r\nI=lambda:map(int,input().split())\r\nn,h=I()\r\nprint(n+sum(i>h for i in I()))", "K,H=map(int,input().split())\r\nA=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(A)):\r\n \r\n if A[i]>H:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)\r\n", "n,h= map(int, input().split())\r\nx=list(map(int, input().split()))\r\nc=0\r\nfor i in x:\r\n if i<=h:\r\n c=c+1\r\n else:\r\n c=c+2\r\nprint(c)", "n, h = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nl = 0\r\nfor i in lst:\r\n if i > h:\r\n l += 2\r\n else:\r\n l += 1\r\nprint(l)", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize width\r\nwidth = 0\r\n\r\n# Calculate width based on the heights\r\nfor height in heights:\r\n if height > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\n# Print the minimum possible valid width of the road\r\nprint(width)\r\n", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor j in a:\r\n if j > h:\r\n s += 2\r\n else:\r\n s += 1\r\nprint(s)", "n, h = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor x in nums:\r\n if x > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)\r\n ", "num_height=list(map(int,input().split()))\r\nheight=list(map(int,input().split()))\r\nwidth=0\r\nfor x in range(len(height)):\r\n if height[x]>num_height[1]:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int, input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n if a[i]>h:\r\n sum=sum+2\r\n else:\r\n sum=sum+1\r\nprint(sum)", "n,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "n, h = map(int, input().split())\r\ndata =[int(i) for i in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n\tif data[i] > h:\r\n\t\tres += 2\r\n\telse:\r\n\t\tres += 1\r\nprint(res)", "q=lambda:map(int,input().split())\r\nn,h=q()\r\nprint(n+sum(i>h for i in q()))", "a , n = input().split()\na = int(a)\nn = int(n)\nx=0\ns=[int(i)for i in input().split()]\nfor i in range (a):\n if s[i]>n:\n x=x+2\n else:\n x=x+1\nprint(x)\n\t\t\t\t\t\t \t\t\t \t\t \t \t\t \t \t\t \t\t", "n, h = list(map(int, input().split()))\r\npeople = list(map(int, input().split()))\r\nlength = 0\r\nfor man in people:\r\n length += 1 if man <= h else 2\r\nprint(length)\r\n", "n,h=map(int,input().split())\r\na=input().split()\r\nwidth=0\r\nfor i in a:\r\n if int(i)<=h:\r\n width+=1\r\n else:\r\n width+=2\r\nprint(width)", "friend_fence = input().split()\r\nn = int(friend_fence[0])\r\nh = int(friend_fence[-1])\r\nh_list = []\r\nfriend_height = input().split()\r\nfor i in range(len(friend_height)):\r\n h_list.append(int(friend_height[i]))\r\n# print(h_list)\r\nwidth = 0\r\nfor i in range(len(h_list)):\r\n if h_list[i] <= h:\r\n width = width + 1\r\n else:\r\n width = width + 2\r\nprint(width)", "import math\r\nn,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor a in l:\r\n if a>h:\r\n s+=math.ceil((a/h))\r\n else:\r\n s+=1\r\nprint(s)", "n,h=input().split()\nn=int(n)\nh=int(h)\na=input()\nc=a.split()\nx=0\nfor i in range(len(c)):\n c[i]=int(c[i])\n if(c[i]>h):\n x=x+2\n else:\n x=x+1\nprint(x)\n \t \t \t \t\t\t\t \t \t\t \t \t\t", "n,k = map(int,input().split())\r\nheights = list(map(int,input().split()))\r\nwidth = 0\r\nfor i in range(n):\r\n if heights[i]>k:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n, h = [int(i) for i in input().split(\" \")]\r\na = [int(i) for i in input().split(\" \")]\r\notvet = 0\r\nfor i in a:\r\n if i > h:\r\n otvet+=2\r\n else:\r\n otvet+=1\r\nprint(otvet)", "inp = input().split(\" \")\r\nn = int(inp[0])\r\nw = int(inp[1])\r\ninp = input().split(\" \")\r\nwidth = n\r\nl = [int(x) for x in inp]\r\nfor i in range(0,n):\r\n if l[i] > w:\r\n width+=1\r\nprint(width) ", "a,b=input().split()\r\nc=map(int,input().split())\r\nc=list(c)\r\ncount=0\r\nfor i in c:\r\n if int(b)>=i:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)", "a=input().split()\r\nn=int(a[0])\r\nh=int(a[1])\r\nl=0\r\na=input().split()\r\nfor x in a:\r\n if int(x)<=h:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)", "\r\ns=input().split()\r\nh=int(s[1])\r\nr=0\r\ns1=input().split()\r\nfor i in s1:\r\n i=int(i)\r\n if i>h:r+=2\r\n else: r+=1\r\nprint(r)", "n, m = map(int,input().split(\" \"))\r\na=map(int,input().split(\" \"))\r\ns=0\r\na=list(a)\r\nfor i in range(len(a)):\r\n a[i]=a[i]\r\n if(a[i]<=m):\r\n s=s+1\r\n else:\r\n s=s+2\r\nprint(s)", "# Read input\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the total width of the road\r\nwidth = 0\r\n\r\n# Calculate the width needed for each friend\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs 2 units of width (bending down)\r\n else:\r\n width += 1 # Friend needs 1 unit of width\r\n\r\n# Print the minimum width of the road\r\nprint(width)\r\n", "n,h = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if list1[i] > h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "n, h = map(int, input().split()) \r\nl = list(map(int, input().split())) \r\nw = 0\r\nfor t in l:\r\n if t > h:\r\n w += 2 \r\n else:\r\n w += 1 \r\nprint(w)\r\n", "[n,h] = list(map(int,input().split()))\r\nf = list(map(int,input().split()))\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n if f[i] > h:\r\n counter += 1\r\n \r\n \r\nresult = (counter * 2) + (n-counter) * 1\r\n\r\nprint(result)\r\n", "n,f,*l=map(int,open(0).read().split())\r\nprint(n+sum(i>f for i in l))", "n,h=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nwidth=0\r\nfor i in range(n):\r\n if ar[i]>h:\r\n width=width+2\r\n else:\r\n width=width+1\r\nprint(width)", "n, t = map(int, input().split())\r\nf = input().split()\r\nf = [int(x) for x in f]\r\nwidth = 0\r\nfor i in f:\r\n if i > t: width+=2\r\n else: width += 1\r\n\r\nprint(width)", "str1=input()\r\nl=str1.split()\r\nn=int(l[0])\r\nstr2=input()\r\nl1=str2.split()\r\nfor i in l1:\r\n if int(i)>int(l[1]):\r\n n+=1\r\nprint(n)", "n,h=map(int,input().split())\r\nw=int(n)\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i]>h:w=w+1\r\nprint(w)", "n, h = [int(i) for i in input().split()]\r\nmy_list = [int(i) for i in input().split()]\r\ncounter = 0\r\nfor i in my_list:\r\n if i <= h:\r\n counter += 1\r\n else:\r\n counter += 2\r\nprint(counter)", "# Vanya and Fence\ninput1 = input().split(' ')\ninput2 = input().split(' ')\n\nheight = int(input1[1])\n\nwidth = 0\n\nfor number in input2:\n if int(number) <= height:\n width += 1\n else:\n width += 2\n\nprint(width)", "n,h=map(int,input().split())\r\nlist_of_inputs=list(map(int,input().split()))\r\nsummation =0\r\n\r\nfor i in range(n):\r\n if list_of_inputs[i]>h :\r\n summation=summation+1\r\n \r\n summation=summation+1\r\n \r\nprint(summation)", "a,b = map(int,input().split(' '))\r\nj = map(int,input().split(' '))\r\nm = 0\r\nfor i in j:\r\n \r\n if i <= b:\r\n m += 1\r\n else:\r\n m += 2\r\nprint(m)", "n, h=map(int,input().split())\r\na =list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i] <=h :\r\n count+=1\r\n else :\r\n count+=2\r\nprint(count) \r\n", "n,h=input().split()\nn=int(n)\nh=int(h)\narr=[int(i) for i in input().split()]\nx=0\nfor i in range (n) :\n if arr[i]>h:\n x+=2\n else:\n x+=1\nprint(x)\n\t\t \t\t \t\t\t \t \t\t\t\t \t\t \t\t \t\t\t", "n, h = list(map(int, input().split()))\nheights = list(map(int, input().split()))\nout = [1 if i<=h else 2 for i in heights]\nprint(sum(out))", "result = 0\r\namount, fence = map(int, input().split())\r\nPersonsHeight = map(int, input().split())\r\nfor heights in PersonsHeight:\r\n if heights <= fence:\r\n result += 1\r\n elif heights > fence:\r\n result += 2\r\nprint(result)\r\n", "#https://codeforces.com/problemset/problem/677/A\r\nn,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i>h:\r\n count+=2\r\n else:\r\n count+=1\r\nprint(count)", "arrLen, Height = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nwidth = 0\r\nfor i in arr:\r\n if (i > Height):\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)\r\n", "n = [int(i) for i in input().split()]\r\nheight = [int(j) for j in input().split()]\r\nfor _ in range(len(height)):\r\n if height[_] > n[-1]:\r\n height[_] = 2\r\n else:\r\n height[_] = 1\r\nprint(sum(height))", "n, h = input().split()\r\na = list(map(int, input().split()))\r\ns = 0\r\n\r\nfor i in range(int(n)):\r\n if a[i] <= int(h):\r\n s = s + 1\r\n else:\r\n s = s + 2\r\n\r\nprint(s)\r\n", "m,n=map(int,input().split())\r\ng=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(m):\r\n if n>=g[i]:\r\n c.append(1)\r\n else:\r\n c.append(2)\r\nprint(sum(c))", "friends_number, fence_height = map(int, input().split())\r\n\r\n\r\ndef calc_road_width(heights):\r\n road_width = 0\r\n for height in heights:\r\n if height <= fence_height:\r\n road_width += 1\r\n else:\r\n road_width += 2\r\n\r\n return road_width\r\n\r\n\r\nheights = list(map(int, input().split()))\r\nmin_road_width = calc_road_width(heights)\r\nprint(min_road_width)\r\n", "n, b = map(int, input().split())\r\nh=list(map(int, input().split()))\r\ns=0 \r\nc=0\r\nfor i in h:\r\n \r\n if i>b:\r\n s+=2\r\n else:\r\n c+=1\r\ng=c+s\r\nprint(g)", "n,h = map(int,input().split(\" \"))\r\nai = list(map(int,input().split(\" \")))\r\nans = 0\r\nfor i in range(n):\r\n if ai[i] > h:\r\n ans = ans + 2\r\n else:\r\n ans = ans + 1\r\nprint(ans)", "n,h=input().split()\r\nx=[int(x) for x in input().split()]\r\n\r\nans=0\r\nfor i in range(int(n)):\r\n if x[i]>int(h):\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "\r\nx =input().split(\" \")\r\ny=input().split(\" \")\r\nh=x[1]\r\nvalue=0\r\nfor i in y:\r\n if int(i)>int(h):\r\n value+=2\r\n else:\r\n value+=1\r\nprint(value)\r\n\r\n\r\n\r\n", "n,h=map(int,input().split())#n-number of friends h-height of fence\r\na=list(map(int,input().split()))#a-height of friends\r\nl=[]\r\nfor i in a:\r\n if(i>h):\r\n l.append(2)\r\n else:\r\n l.append(1)\r\nprint(sum(l))\r\n \r\n", "n,h = map(int,input().split())\r\na = input().split()\r\nb = n\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nfor i in a:\r\n if i>h:\r\n b+=1\r\nprint(b)", "n, h = map(int, input().split())\r\nhigh = list(map(int, input().split()))\r\ncost = 0\r\nfor i in range(n):\r\n if high[i] <= h:\r\n cost = cost+1\r\n else:\r\n cost = cost+2\r\nprint(cost)\r\n\r\n\r\n", "n,h = map(int,input().split())\nmin_w = 0\n\na = list(i for i in input().split())\n\nfor A in a:\n if int(A) > h:\n min_w += 2\n else:\n min_w +=1\nprint(min_w)\n \t \t \t\t\t\t \t \t\t \t \t\t\t\t\t\t\t \t", "n, h = map(int, input().split())\r\nn += sum(map(lambda x: int(x) > h, input().split()))\r\nprint(n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 17:17:24 2023\r\n\r\n@author: 27823\r\n\"\"\"\r\n\r\nn,h=map(int,input().split())\r\nheights=list(map(int,input().split()))\r\nwidth=0\r\nfor height in heights:\r\n if height>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)\r\n ", "m,n=input().split()\r\nheight=map(int,input().split())\r\nlst=list(height)\r\nlength=0\r\nfor a in lst:\r\n if int(a)<=int(n):\r\n length=int(length)+1\r\n else:\r\n length=int(length)+2\r\nprint(length)", "n,h = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nm = n\r\nfor i in range(len(a)):\r\n if a[i] > h:\r\n m += 1\r\nprint(m)", "import sys\r\n\r\na = [int(i) for i in sys.stdin.readline().split()]\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = 0\r\nfor i in b:\r\n if i <= a[1]:\r\n c += 1\r\n else:\r\n c += 2\r\nprint(c)\r\n", "NoFriendFenceHight = input()\r\nNoFriendFenceHightArr = list(map(int,NoFriendFenceHight.split()))\r\nFriendHeight = input()\r\nFriendHeightArr = list(map(int,FriendHeight.split()))\r\nx=0\r\nfor i in FriendHeightArr:\r\n if i > NoFriendFenceHightArr[1]:\r\n x += 2\r\n else:\r\n x += 1\r\nprint(x)", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n\tc=math.ceil(l[i]/m)\r\n\ts+=c\r\nprint(s)", "l = [int(e) for e in input().split(\" \")]\r\nn, h = l[0], l[1]\r\na = [int(e) for e in input().split(\" \")]\r\nw = 0\r\nfor i in range(n):\r\n if a[i] > h:\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)\r\n", "n = input().split()\r\na = input().split()\r\ncount = 0\r\n\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nfor i in a:\r\n if i > n[1]:\r\n count = count + 2\r\n elif 1 <= n[1]:\r\n count = count +1\r\n\r\nprint(count)\r\n", "y = input().split()\r\nn = int(y[0])\r\nh = int(y[1])\r\ncounter = 0\r\nx = input().split()\r\nx = (int(num) for num in x)\r\nfor j in x:\r\n if j>h:\r\n counter += 1\r\n else:\r\n continue\r\n \r\nprint(counter+n) ", "\nn, h = map(int, input().split())\na = list(map(int, input().split()))\n\nwidth = 0\nfor i in range(n):\n if a[i] > h:\n width += 2\n else:\n width += 1\n\nprint(width)\n\n \t\t \t\t\t\t\t \t \t \t \t\t\t \t", "s = list(map(int, str(input()).split()))\r\nt = list(map(int, str(input()).split()))\r\nn,h = s[0],s[1]\r\nk = 0\r\nfor i in t:\r\n if i > h:\r\n k += 2\r\n else:\r\n k += 1\r\nprint(k)", "a=input()\r\na=a.split(\" \")\r\nn,h=int(a[0]),int(a[1])\r\nm=map(int,input().split())\r\ns=0\r\nfor i in m:\r\n if i<=h:\r\n s+=1\r\n else:\r\n s+=2\r\nprint(s)", "n,h=map(int, input().split())\r\na=list(map(int, input().split()))\r\ncount=0\r\nfor i in range (0,n):\r\n if a[i]>h:\r\n count+=2\r\n else:\r\n count +=1\r\nprint(count)", "n, h = map(int, input().split())\r\ns = 0\r\n\r\nfor i in [int(i) for i in input().split()]:\r\n if i > h:\r\n s += 2\r\n else:\r\n s += 1\r\n \r\nprint(s)", "a,b=map(int,input().split(' '))\r\ns , k = input().split(' '), 0\r\nfor i in range(a):\r\n if int(s[i])>b:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "\r\nn, k = map(int, input().split()) \r\n\r\na = list(map(int,input().split()))\r\n\r\n\r\nans = 0 \r\nfor x in a :\r\n if x > k :\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)", "n, h = map(int, input().split())\r\nk=input().split(\" \")\r\nw=n\r\nfor i in k:\r\n if(int(i)>h):\r\n w=w+1\r\nprint(w)", "n,h=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nk=0\r\nfor i in arr:\r\n if i>h:\r\n k+=2\r\n else:\r\n k+=1\r\nprint(k)\r\n", "n, h = map(int,input().split())\r\na = [int(el) for el in input().split()]\r\nd = 0\r\nfor el in a:\r\n if el <= h:\r\n d += 1\r\n else:\r\n d += 2\r\nprint(d)\r\n", "n,h=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif l[i]>h:\r\n\t\tc=c+2\r\n\telse:\r\n\t\tc=c+1\r\nprint(c)", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nw = 0\r\n\r\nfor i in range(len(l)):\r\n if(l[i]>h):\r\n w += 2\r\n else:\r\n w += 1\r\nprint(w)", "n11, h11 = map(int, input().split())\r\n\r\nfriends_heights11 = list(map(int, input().split()))\r\nmin_width11 = sum(2 if height11 > h11 else 1 for height11 in friends_heights11)\r\n\r\nprint(min_width11)\r\n", "n, h = map(int, input().split()) # Number of friends and fence height\r\nheights = list(map(int, input().split())) # Heights of friends\r\n\r\nwidth = 0\r\n\r\nfor height in heights:\r\n if height > h:\r\n width += 2 # Friend needs a width of 2 to bend down\r\n else:\r\n width += 1 # Friend needs a width of 1\r\n\r\nprint(width)\r\n", "#n=number of friends, h=fence height\r\nn, h = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if f[i] > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\nprint(c)\r\n\r\n", "z,x = map(int,input().split())\r\na = map(int,input().split())\r\nm = 0\r\nfor i in a:\r\n if i<=x:\r\n m+=1\r\n else:\r\n m+=2\r\nprint(m)", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=0\r\nfor i in l:\r\n if i>h:\r\n width+=2\r\n else:\r\n width+=1\r\nprint(width)", "n,h=map(int,input().split(\" \"))\r\nm=list(map(int,input().split(\" \")))\r\n\r\nans= n\r\nfor i in m:\r\n if i>h:\r\n ans+=1\r\nprint(ans)", "nandh=input().split()\r\nmanh=input().split()\r\nmanhights=[]\r\nwall_h=int(nandh[1])\r\nwideroad=0\r\nfor i in manh:\r\n manhights.append(int(i))\r\nfor x in manhights:\r\n if x>wall_h:wideroad+=2\r\n else:wideroad+=1\r\nprint(wideroad)\r\n", "line1 = input()\r\nline2 = input()\r\n\r\nline1Array = list(map(int, line1.split()))\r\nlistHeightOfPerson = list(map(int, line2.split()))\r\n\r\nnumOfPerson = line1Array[0]\r\nheightOfFence = line1Array[1]\r\n\r\nsumOfWidth = 0\r\n\r\nfor heightOfPerson in listHeightOfPerson:\r\n if heightOfPerson > heightOfFence:\r\n sumOfWidth += 2\r\n else:\r\n sumOfWidth += 1\r\n\r\nprint(sumOfWidth)\r\n\r\n\r\n\r\n", "n,h = map(int,input().split())\nl = input().split()\nres = 0\nfor p in l:\n if int(p)<=h:\n res+=1\n else:\n res+=2\n\nprint(res)\n", "n, h = map(int, input().split())\r\nfriend_heights = list(map(int, input().split()))\r\n\r\nminimum_width = 0\r\n\r\nfor height in friend_heights:\r\n if height > h:\r\n minimum_width += 2 # If the person is taller than the fence, they need 2 units of width.\r\n else:\r\n minimum_width += 1 # If the person is shorter than or equal to the fence, they need 1 unit of width.\r\n\r\nprint(minimum_width)\r\n", "n,h = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if l[i]<=h:\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\nn , h = map(int,input().split())\nh1 = 0\nh2 = 0\nh_list = list(map(int,input().split()))\nfor height in (h_list):\n if height <= h:\n h1 += 1\n elif height > h:\n h2 += 1\nprint (h1+(2*h2))", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nw=n\r\nfor i in range(n):\r\n if a[i]>h:\r\n w+=1\r\nprint(w)\r\n ", "# https://codeforces.com/problemset/problem/677/A\n_, h_fence = map(int, input().split(\" \"))\nheights = list(map(int, input().split(\" \")))\nwidth = 0\nfor h in heights:\n if h <= h_fence:\n width += 1\n else:\n width += 2\nprint(width)\n", "n,h=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nflag=0\r\nfor i in range(n):\r\n if l[i]>h:\r\n flag+=2\r\n else:\r\n flag+=1\r\nprint(flag)", "n, h = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = n\r\nfor each in arr:\r\n if each > h:\r\n ans += 1\r\n \r\nprint(ans)", "n,h=map(int,input().split())\r\nans=0\r\nli=list(map(int,input().split()))\r\n# print(li)\r\nfor i in li:\r\n if i>h:\r\n # print(\"+2(\",i,\")\")\r\n ans=ans+2\r\n else:\r\n # print(\"+1(\",i,\")\")\r\n ans=ans+1\r\nprint(ans)", "n,h = map(int,input().split(\" \"))\r\nheight = map(int, input().split(\" \"))\r\ncount = 0\r\n\r\nfor i in height :\r\n if i <= h :\r\n count +=1\r\n if i > h :\r\n count +=2\r\nprint(count)", "n, h = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ntotal = 0\r\nfor fr in lst:\r\n if fr > h:\r\n total += 1\r\n total += 1\r\nprint(total)\r\n", "n, h = map(int, input().split())\r\nprint(sum(2 if i > h else 1 for i in list(map(int, input().split()))))\r\n", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = n + sum(1 if height > h else 0 for height in heights)\r\n\r\nprint(width)\r\n", "tmp = input()\r\ntmp = tmp.split()\r\nn = int(tmp[0])\r\nh = int(tmp[1])\r\nfriends = input()\r\nfriends = friends.split()\r\nwidth = 0\r\n\r\nfor friend in friends:\r\n if int(friend) > h:\r\n width += 2\r\nprint(int(0.5 * width + len(friends)))", "n, h = map(int, input().split())\r\na = list(map(int, input().split()))\r\nstnd = 0\r\nbnd = 0\r\n\r\nfor i in range(n):\r\n\tif a[i] > h:\r\n\t\tbnd += 1\r\n\telse:\r\n\t\tstnd += 1\r\n\r\nprint(2 * bnd + stnd)", "n, k = map(int, input().split())\r\nheight1=0\r\nlst = list(map(int, input().split()))\r\nfor j in range(len(lst)):\r\n\tif lst[j] > k:\r\n\t\theight1+=2\r\n\telse:\r\n\t\theight1+=1\r\nprint(height1)", "nh = input().split()\nn, h = int(nh[0]), int(nh[1])\nfriends = input().split()\nwidth = 0\nfor i in friends:\n if int(i)>h:\n width +=2\n else:\n width +=1\nprint(width)\n", "n,h=input().split()\nn=int(n)\nh=int(h)\nsum=0\narr=[int(i) for i in input().split()]\nfor i in range (n):\n if arr[i]<=h:\n sum+=1\n else:\n sum+=2\n\nprint(sum)\n \t\t\t\t\t \t \t\t\t\t\t \t \t \t \t\t", "n, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\nwidth = 0\r\nfor friend in heights:\r\n if friend <= h:\r\n width += 1\r\n else:\r\n width += 2\r\n\r\nprint(width)", "n,h=map(int,input().split())\r\nheight=input()\r\nlis=[int(x)for x in height.split()]\r\nwidth,count=0,0\r\nfor i in range(0,n):\r\n if lis[i]<=h:\r\n count+=1\r\n else:\r\n count+=2\r\nprint(count)\r\n", "a, b = map(int,input().split())\r\nm = 0\r\nnumbers = input().split()\r\nnumbers = list(map(int, numbers))\r\nfor i in range(a):\r\n if numbers[i] <= b:\r\n m = m + 1\r\n else:\r\n m = m + 2\r\nprint(m)", "a, b = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nd=0\r\nfor i in c:\r\n if i>b:\r\n d+=2\r\n else:\r\n d+=1\r\nprint(d)\r\n", "import functools\r\nimport operator\r\n\r\ninput1 = input()\r\ninput2 = input()\r\n\r\n# fence height is the second part of the first string. \r\n# get by splitting on space and then convert to an int\r\nfenceHeight = int(input1.split(\" \")[1])\r\n\r\n# next line contains a list of all the friends height\r\n# if the friend is greater than the height of the fence, then he will have to hunch over\r\n# and he will be 2 untis wide\r\n# otherwise, just 1 unit wide\r\n# go through the list of heights and figure if 2 or 1\r\nfriendWidths = map(lambda a: 2 if int(a) > fenceHeight else 1, input2.split(\" \"))\r\n\r\n# simply sum up all the widths and print\r\nprint(sum(friendWidths))", "n,h = input().split()\narr = list(map(int,input().split()))\nn = int(n)\nh = int(h)\nwidth = 0\nwidth = int(width)\nfor i in range(0,n):\n if arr[i] <= h:\n width += 1\n else:\n width += 2\nprint(width)\n \t \t\t\t\t\t \t\t\t \t \t\t \t \t", "n = [int(i) for i in input().split()]\r\nsq = [int(i) for i in input().split()]\r\nq = 0\r\ns = 0\r\nwhile s != len(sq):\r\n if sq[s] <= n[1]:\r\n q += 1\r\n else:\r\n if sq[s] % n[1] != 0:\r\n q += sq[s] // n[1] + 1\r\n else:\r\n q += sq[s] // n[1]\r\n s+=1\r\nprint(q)", "h,d=input().split()\nh=int(h)\nd=int(d)\na=input()\nx=a.split()\nc = 0\nfor i in range (len(x)):\n x[i]=int (x[i])\n if x[i] >d:\n c+=2\n else:\n c+=1\nprint(c)\n \t\t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t \t\t \t\t", "n,h=map(int,input().split())\r\n\r\nfh = list(map(int,input().split()))\r\nmaxW = 0\r\nfor i in fh:\r\n if i > h:\r\n maxW+=2\r\n else:\r\n maxW+=1\r\n\r\nprint(maxW)\r\n\r\n\r\n", "n, h = input().split()\r\nn, h = int(n), int(h)\r\n\r\na = input().split()\r\n\r\nrez = 0\r\n\r\nfor i in a:\r\n if int(i) <= h:\r\n rez += 1\r\n if int(i) > h:\r\n rez += 2\r\n\r\nprint(rez)", "n,h = map(int,input().split())\r\nar = list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n if ar[i]<=h:\r\n sum = sum +1\r\n else:\r\n sum = sum+2\r\nprint(sum)", "n, h = map(int, input().split())\nheights = list(map(int, input().split()))\n\nfriends = 0\nfor height in heights:\n if height > h:\n friends += 2\n else:\n friends += 1\n\nprint(friends)\n\t\t\t \t \t \t\t \t \t \t \t \t\t", "n,h = map(int,input().split(' '))\r\nnumbers = map(int,input().split(' '))\r\ncounter=0\r\n\r\nfor item in numbers:\r\n if item<=h:\r\n counter+=1\r\n else:\r\n counter+=2\r\n\r\nprint(counter)", "a=list(map(int, input().split()))\r\nn=list(map(int, input().split()))\r\ns=0\r\nfor i in range(a[0]):\r\n if n[i]>a[1]:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "n,h = map(int, input().split())\nheight = list(map(int, input().split()))\n\ncount = 0\nfor i in height:\n if i > h:\n count+=2\n else:\n count+=1\nprint(count)\n ", "n, h = list(map(int, input().split()))\nai = list(map(int, input().split()))\nroad = 0\nfor i in ai:\n if i <= h:\n road += 1\n else:\n road += 2\nprint(road)", "n,h=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\nr=[]\r\nfor j in a:\r\n r.append(j)\r\n\r\ncount=0\r\nfor k in range(n):\r\n if r[k]>h:\r\n count=count+1\r\n k=k+1\r\nx=n-count\r\nprint((2*count)+x)\r\n\r\n\r\n\r\n", "n,h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nnum=n\r\nlist=input().split()\r\nfor i in range(n):\r\n if int(list[i])>h:\r\n num+=1\r\nprint(num)\r\n", "n,h = map(int, input().split())\nlst =[int(i) for i in input().split()]\nc = 0\nfor i in range(n):\n if lst[i]>h:c+=2\n else:c+=1\nprint(c)\n \t\t\t\t \t\t\t\t\t\t\t \t\t \t\t\t \t", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ncount = 0\r\n\r\nfor i in range(a[0]):\r\n if b[i] > a[1]:\r\n count += 1\r\n count += 1\r\nprint(count)\r\n\r\n", "w=0\r\na=list(map(int,input().split()))\r\nn=a[0]\r\nh=a[1]\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n if i>h:\r\n w+=2\r\n else:\r\n w+=1\r\nprint(w)\r\n", "x, y = map(int,input().split())\r\nheight = list(map(int,input().split()))\r\n\r\nans = 0\r\nfor i in height:\r\n if i>y:\r\n ans+=2\r\n else:\r\n ans+=1\r\n\r\nprint(ans)", "\"\"\"\r\nwidth of person upright = 1\r\nwidth of person hunched = 2\r\n\r\nPicture:\r\nFence\r\n|\r\n|\r\n| IIooIoI (Friends walking upright and hunched)\r\n|\r\n|\r\n\r\nInput 1 = the number of friends, the height of fence\r\nInput 2 = the height of each person\r\n\"\"\"\r\n\r\ninput1 = input().split()\r\nfriendHeight = input().split()\r\n\r\nfriends = int(input1[0])\r\nfenceHeight = int(input1[1])\r\n\r\ncounter = 0\r\n\r\nfor n in range(friends):\r\n\r\n if int(friendHeight[n]) > fenceHeight:\r\n counter += 2\r\n else:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\nc=0\r\nfor i in l:\r\n if i>h:\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = map(int, input().split())\r\ndruz = input().split()\r\ndlin = 0\r\nfor i in range(n):\r\n if int(druz[i]) <= h:\r\n dlin += 1\r\n else:\r\n dlin += 2\r\nprint(dlin)", "N,T = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(N):\r\n if a[i] > T:\r\n count += 2\r\n else:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "# Source: https://usaco.guide/general/io\n\nn, h = map(int, input().split())\na = map(int, input().split())\nt = 0\nfor i in a:\n\tif i > h: t += 2\n\telse: t += 1\nprint (t)", "a, b = input().split()\r\nc = input().split()\r\nresult = int(a)\r\nfor i in c:\r\n if int(i) > int(b):\r\n result += 1\r\n\r\nprint(result)", "n, h = input().split()\r\nn, h = int(n), int(h)\r\nheights = input().split()\r\ntall = 0\r\nfor i in range(len(heights)):\r\n heights[i] = int(heights[i])\r\nfor j in heights:\r\n if j > h:\r\n tall += 1\r\nwidth = (n-tall) + (tall*2)\r\nprint(width)\r\n\r\n \r\n", "n,h=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n c=c+2 if i>h else c+1\r\nprint(c)", "n,h = map(int, input().split())\r\nmin_width = 0\r\n\r\nheight = list(map(int, input().split()))\r\nfor j in range(n):\r\n if height[j] > h:\r\n min_width += 2\r\n else:\r\n min_width += 1\r\n\r\nprint(min_width)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 25 17:15:09 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nlist1=input().split()\r\nn=int(list1[0])\r\nh=int(list1[1])\r\nheight=input().split()\r\nfor i in height:\r\n if int(i)>h:\r\n n=n+1\r\nprint(n)", "x=input(\"\")\r\ny=input(\"\")\r\nl1=x.split(\" \")\r\nl2=y.split(\" \")\r\nc=0\r\nfor i in l2:\r\n if int(i)>int(l1[1]):\r\n c+=2\r\n else:\r\n c+=1\r\nprint(c)", "n, h = (int(x) for x in input().split())\r\nw=0\r\nfor i in map(int, input().split()):\r\n if i > h:\r\n w+= 2\r\n else:\r\n w+=1\r\nprint(w)", "import math\r\nst1=input()\r\nst2=input()\r\nvalues1=[int(i) for i in st1.split()]\r\nvalues2=[int(i) for i in st2.split()]\r\nc=0\r\nfor i in range(values1[0]):\r\n if(values2[i]/values1[1]<=1):\r\n c+=1\r\n else:\r\n c+=math.ceil(values2[i]/values1[1])\r\n \r\nprint(c)\r\n", "n, h = map(int, input().split(' '))\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\nres = 0\r\nfor each in a:\r\n if each > h:\r\n res += 2\r\n else:\r\n res += 1\r\n\r\nprint(res)", "inpt = input() .split(\" \")\r\nheights= input().split(\" \")\r\ni=0\r\nfor k in range(int(inpt[0])):\r\n if int(heights[k])>int(inpt[1]):\r\n i+=2\r\n else :\r\n i+=1\r\nprint(i)", "n , h = map(int,input().split())\r\nheights = list(map(int, input().split()))\r\nwidth = 0\r\nfor height in heights:\r\n if height <= h:\r\n width += 1\r\n else:\r\n width += 2\r\nprint(width)", "n,h = map(int,input().split())\r\nc = input().split()\r\nw = 0\r\nfor i in range(n):\r\n if int(c[i]) <= h:\r\n w += 1\r\n else:\r\n w += 2\r\nprint(w)", "a,b=map(int,input().split())\r\nSOL=0\r\no=list(map(int,input().split()))\r\n \r\nfor i in o:\r\n if i>b:\r\n \r\n SOL=SOL+2\r\n else:\r\n \r\n SOL=SOL+1\r\nprint(SOL)", "n, h = map(int,input().split())\nl = list(map(int,input().split()))\n\ntw = 0\nfor hie in l:\n if hie > h:\n tw += 2\n else:\n tw += 1\nprint(tw)", "line1=(input())\r\nline2=(input())\r\nnum1,num2=line1.split()\r\nline2=line2.split()\r\nout=0\r\n\r\n\r\narr=[]\r\nfor i in line2:\r\n arr.append(int(i))\r\n\r\nfor x,i in enumerate(arr):\r\n if int(arr[x])<=int(num2):\r\n out+=1\r\n else:\r\n out+=2\r\n\r\nprint(out)", "import sys\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef int_to_arr():\r\n return list(map(int, str(input()).strip()))\r\n\r\n\r\ndef insr():\r\n return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\n\r\n# def is_upper(a):\r\n# return ord(a) >= 65 and ord(a) <= 90\r\n\r\n\r\n# def is_lower(a):\r\n# return ord(a) >= 97 and ord(a) <= 122\r\n\r\n\r\n# def to_upper(a):\r\n# ans = \"\"\r\n# for i in a:\r\n# if ord(i) >= 97 and ord(i) <= 122:\r\n# ans = ans + chr(ord(i) - 32)\r\n# else:\r\n# ans = ans + i\r\n# return ans\r\n\r\n\r\n# def to_lower(a):\r\n# ans = \"\"\r\n# for i in a:\r\n# if ord(i) >= 65 and ord(i) <= 90:\r\n# ans = ans + chr(ord(i) + 32)\r\n# else:\r\n# ans = ans + i\r\n# return ans\r\n\r\n\r\ndef reverse_string(s):\r\n ans = \"\"\r\n for i in s[::-1]:\r\n ans = ans + i\r\n return ans\r\n\r\n\r\ndef main():\r\n input1 = inlt()\r\n input2 = inlt()\r\n\r\n height_of_fense = input1[1]\r\n width = 0\r\n for i in input2:\r\n if i > height_of_fense:\r\n width += 2\r\n else:\r\n width += 1\r\n out(width)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\r\nn,h=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nc=0\r\nfor i in ls:\r\n c+=ceil(i/h)\r\nprint(c)", "import sys\r\nline1 = sys.stdin.readline().strip().split()\r\nline2 = sys.stdin.readline().strip().split()\r\nanswer = 0\r\nfor i in line2:\r\n if int(i) <= int(line1[1]):\r\n answer += 1\r\n else:\r\n answer += 2\r\nprint(answer)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i>m:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)", "n, h = map(int, input().split())\r\nA = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in A:\r\n sum +=1\r\n if i>h:\r\n sum +=1\r\nprint(sum)\r\n", "# Read input values\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Initialize the minimum width\r\nmin_width = 0\r\n\r\n# Calculate the minimum width\r\nfor height in heights:\r\n if height > h:\r\n min_width += 2\r\n else:\r\n min_width += 1\r\n\r\n# Print the minimum width\r\nprint(min_width)\r\n", "n, h = map(int,input().split())\r\na=list(map(int,input().split()))\r\nt = 0\r\nfor i in a : \r\n if i > h : t+=2\r\n else : t+=1\r\nprint(t)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 21:19:51 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\ns=0\r\nn,h=[int(x) for x in input().split()]\r\nlist=[int(y) for y in input().split()]\r\nfor k in list:\r\n if k>h: \r\n s+=1\r\n else:\r\n pass\r\nprint(n+s)", "n = input().split()\nn1 = [int(a) for a in n]\nnum = input().split()\ncount = 0\nfor number in num:\n\tif int(number) <= n1[1]:\n\t\tcount = count + 1\n\telse:\n\t\tcount = count + 2\n\nprint(count)", "def fun(n, h, heights):\r\n width = 0\r\n for height in heights:\r\n if height > h:\r\n width += 2\r\n else:\r\n width += 1\r\n return width\r\nn, h = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\nprint(fun(n, h, heights))", "n,h = list(map(int,input().split()))\r\npeople = list(map(int,input().split()))\r\n\r\nresult = 0\r\nfor i in people:\r\n if i > h:\r\n result += 2\r\n else:\r\n result += 1\r\n\r\nprint(result)", "num,h=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nc=sum(1 for hei in height if hei> h)\r\nres=num+c\r\nprint(res)", "# --- #\r\ngroup, fence_h = [int(n) for n in input().split()]\r\nw = 0\r\npersons_h = [int(x) for x in input().split()]\r\nfor i in persons_h:\r\n if i > fence_h : \r\n w += 2\r\n else :\r\n w += 1\r\n# ---\r\nprint(w)\r\n", "n , h = map(int,input().split())\r\nx = input().split()\r\nc = 0\r\n\r\nfor i in range(n):\r\n if int(x[i]) > h:\r\n c += 2\r\n else:\r\n c += 1\r\n\r\nprint(c)", "a = input().split(' ')\r\nn, h = int(a[0]), int(a[1])\r\nb = list(map(int,input().split(' ')))\r\nwidth = 0\r\nfor i in b:\r\n if i > h:\r\n width += 2\r\n else:\r\n width += 1\r\nprint(width)", "N,h,*v=map(int,open(0).read().split());print(N+sum(n>h for n in v))", "n,h = map(int, input().split())\r\nperson = list(map(int, input().split()))\r\nlength = []\r\nfor i in range(n):\r\n if person[i] > h:\r\n length.append(2)\r\n else:\r\n length.append(1)\r\n\r\nprint(sum(length)) ", "n, h = map(int, input().split())\nnums = list(map(int, input().split()))\nwidth = 0\nfor x in nums:\n if x > h: width += 2\n else: width += 1\n\nprint(width)\n ", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n if i>h:\r\n sum+=2\r\n else:\r\n sum+=1\r\nprint(sum)\r\n \r\n", "n,h=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ncountl,countm=0,0\r\nfor i in ar:\r\n if i>h:\r\n countm += 2\r\n else:\r\n countl += 1\r\nprint(countl+countm)", "line_1 = input()\r\nline_2 = input()\r\n\r\nwidth = 0\r\n\r\nn, h = line_1.split()\r\nn = int(n)\r\nh = int(h)\r\n\r\n\r\nheights = line_2.split()\r\n\r\nfor height in heights:\r\n if int(height) > h:\r\n width += 2\r\n else:\r\n width += 1\r\n\r\nprint(width)\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nl=0\r\nfor i in x:\r\n if b>=i:\r\n l+=1\r\n else:\r\n l+=2\r\nprint(l)\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn, h = map(int, input().split())\nnums = list(map(int, input().split()))\nwidth = 0\n\nfor num in nums:\n if num > h:\n width += 2\n\n else:\n width += 1\n\nsys.stdout.write(f\"{width}\")\n", "quantity_peoples, height_wall = map(int, input().split())\r\nmin_width_road = 0\r\nheight_people = list(map(int, input().split()))\r\nfor i in range(quantity_peoples):\r\n if height_people[i] > height_wall:\r\n min_width_road += 2\r\n else:\r\n min_width_road += 1\r\nprint(min_width_road)", "def minimum_road_width():\r\n\tn, h = input().split()\r\n\twidth = 0 \r\n\t#for i in len(n):\r\n\theight = input().split(' ')\r\n\theights = [int(i) for i in height]\r\n\tfor i in range(len(heights)):\r\n\t\tif heights[i] <= int(h):\r\n\t\t\twidth += 1\r\n\t\telse:\r\n\t\t\twidth += 2\r\n\treturn width\r\n\r\nprint(minimum_road_width())", "a,b=map(int,input().split())\r\nc=0\r\nli = list(map(int,input().split()))\r\nfor i in range(0,a):\r\n if(li[i]<=b):\r\n c+=1\r\n else:\r\n c+=2\r\nprint(c)", "n,h=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=n\r\nfor i in range(n):\r\n if a[i]>h:\r\n r+=1\r\nprint(r)\r\n\r\n", "n, h = map(int, input().split())\r\nls = list(map(int,input().split()))\r\ncnt_One = 0\r\ncnt_Two = 0\r\nfor i in ls:\r\n if i > h:\r\n cnt_Two += 1\r\n else:\r\n cnt_One += 1\r\nprint(cnt_One + 2*cnt_Two)\r\n", "list1=input().split()\r\nn=int(list1[0])\r\nh=int(list1[1])\r\nheight=input().split()\r\nfor i in height:\r\n n+=(1if(int(i)>h)else 0)\r\nprint(n)", "n,h = map(int,input().split())\r\nh2 = list(map(int,input().split()))\r\nw = 0\r\nfor h1 in h2:\r\n if h1 > h:\r\n w = w + 2\r\n else:\r\n w = w + 1\r\nprint(w)", "n, h = list(map(int,input().split()))\r\nheights = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(n):\r\n if heights[i]>h:\r\n s+=2\r\n else:\r\n s+=1\r\nprint(s)\r\n", "n,m = map(int, input().split())\r\nheight = list(map(int, input().split()))\r\ncount = n\r\nfor i in range(n):\r\n if height[i] > m:\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "n, h = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ns = 0\r\nfor i in arr:\r\n if i>h :\r\n s = s + 2\r\n else :\r\n s = s + 1\r\nprint(s)", "a=input().split()\r\nb=input().split()\r\nl=[]\r\nfor i in b:\r\n if int(i)>int(a[-1]):\r\n l.append(2)\r\n else:\r\n l.append(1)\r\nprint(sum(l))", "n,h=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nwidth=0\r\nfor i in l:\r\n if i<=h:\r\n width+=1\r\n elif i>h:\r\n width+=2\r\nprint(width)\r\n", "n,h = map(int,input().split())\r\na = list(map(int,input().split()))\r\nw = 0\r\nfor i in a:\r\n if i <= h:\r\n w += 1\r\n else:\r\n w += 2\r\nprint(w)\r\n" ]

{"inputs": ["3 7\n4 5 14", "6 1\n1 1 1 1 1 1", "6 5\n7 6 8 9 10 5", "10 420\n214 614 297 675 82 740 174 23 255 15", "10 561\n657 23 1096 487 785 66 481 554 1000 821", "100 342\n478 143 359 336 162 333 385 515 117 496 310 538 469 539 258 676 466 677 1 296 150 560 26 213 627 221 255 126 617 174 279 178 24 435 70 145 619 46 669 566 300 67 576 251 58 176 441 564 569 194 24 669 73 262 457 259 619 78 400 579 222 626 269 47 80 315 160 194 455 186 315 424 197 246 683 220 68 682 83 233 290 664 273 598 362 305 674 614 321 575 362 120 14 534 62 436 294 351 485 396", "100 290\n244 49 276 77 449 261 468 458 201 424 9 131 300 88 432 394 104 77 13 289 435 259 111 453 168 394 156 412 351 576 178 530 81 271 228 564 125 328 42 372 205 61 180 471 33 360 567 331 222 318 241 117 529 169 188 484 202 202 299 268 246 343 44 364 333 494 59 236 84 485 50 8 428 8 571 227 205 310 210 9 324 472 368 490 114 84 296 305 411 351 569 393 283 120 510 171 232 151 134 366", "1 1\n1", "1 1\n2", "46 71\n30 26 56 138 123 77 60 122 73 45 79 10 130 3 14 1 38 46 128 50 82 16 32 68 28 98 62 106 2 49 131 11 114 39 139 70 40 50 45 137 33 30 35 136 135 19", "20 723\n212 602 293 591 754 91 1135 640 80 495 845 928 1399 498 926 1431 1226 869 814 1386", "48 864\n843 1020 751 1694 18 1429 1395 1174 272 1158 1628 1233 1710 441 765 561 778 748 1501 1200 563 1263 1398 1687 1518 1640 1591 839 500 466 1603 1587 1201 1209 432 868 1159 639 649 628 9 91 1036 147 896 1557 941 518", "26 708\n549 241 821 734 945 1161 566 1268 216 30 1142 730 529 1014 255 168 796 1148 89 113 1328 286 743 871 1259 1397", "75 940\n1620 1745 1599 441 64 1466 1496 1239 1716 1475 778 106 1136 1212 1261 444 781 257 1071 747 626 232 609 1544 682 1326 469 1361 1460 1450 1207 1319 922 625 1737 1057 1698 592 692 80 1016 541 1254 201 682 1007 847 206 1066 809 259 109 240 1611 219 1455 1326 1377 1827 786 42 1002 1382 1592 543 1866 1198 334 1524 1760 340 1566 955 257 1118"], "outputs": ["4", "6", "11", "13", "15", "144", "145", "1", "2", "63", "31", "75", "41", "116"]}

UNKNOWN

PYTHON3

CODEFORCES

889

d3765fa3113a54c91060c293e49d86cc

Strange Calculation and Cats

Gosha's universe is a table consisting of *n* rows and *m* columns. Both the rows and columns are numbered with consecutive integers starting with 1. We will use (*r*,<=*c*) to denote a cell located in the row *r* and column *c*. Gosha is often invited somewhere. Every time he gets an invitation, he first calculates the number of ways to get to this place, and only then he goes. Gosha's house is located in the cell (1,<=1). At any moment of time, Gosha moves from the cell he is currently located in to a cell adjacent to it (two cells are adjacent if they share a common side). Of course, the movement is possible only if such a cell exists, i.e. Gosha will not go beyond the boundaries of the table. Thus, from the cell (*r*,<=*c*) he is able to make a move to one of the cells (*r*<=-<=1,<=*c*), (*r*,<=*c*<=-<=1), (*r*<=+<=1,<=*c*), (*r*,<=*c*<=+<=1). Also, Ghosha can skip a move and stay in the current cell (*r*,<=*c*). Besides the love of strange calculations, Gosha is allergic to cats, so he never goes to the cell that has a cat in it. Gosha knows exactly where and when he will be invited and the schedule of cats travelling along the table. Formally, he has *q* records, the *i*-th of them has one of the following forms: - 1, *x**i*, *y**i*, *t**i* — Gosha is invited to come to cell (*x**i*,<=*y**i*) at the moment of time *t**i*. It is guaranteed that there is no cat inside cell (*x**i*,<=*y**i*) at this moment of time. - 2, *x**i*, *y**i*, *t**i* — at the moment *t**i* a cat appears in cell (*x**i*,<=*y**i*). It is guaranteed that no other cat is located in this cell (*x**i*,<=*y**i*) at that moment of time. - 3, *x**i*, *y**i*, *t**i* — at the moment *t**i* a cat leaves cell (*x**i*,<=*y**i*). It is guaranteed that there is cat located in the cell (*x**i*,<=*y**i*). Gosha plans to accept only one invitation, but he has not yet decided, which particular one. In order to make this decision, he asks you to calculate for each of the invitations *i* the number of ways to get to the cell (*x**i*,<=*y**i*) at the moment *t**i*. For every invitation, assume that Gosha he starts moving from cell (1,<=1) at the moment 1. Moving between two neighboring cells takes Gosha exactly one unit of tim. In particular, this means that Gosha can come into the cell only if a cat sitting in it leaves the moment when Gosha begins his movement from the neighboring cell, and if none of the cats comes to the cell at the time when Gosha is in it. Two ways to go from cell (1,<=1) to cell (*x*,<=*y*) at time *t* are considered distinct if for at least one moment of time from 1 to *t* Gosha's positions are distinct for the two ways at this moment. Note, that during this travel Gosha is allowed to visit both (1,<=1) and (*x*,<=*y*) multiple times. Since the number of ways can be quite large, print it modulo 109<=+<=7. The first line of the input contains three positive integers *n*, *m* and *q* (1<=≤<=*n*·*m*<=≤<=20,<=1<=≤<=*q*<=≤<=10<=000) — the number of rows and columns in the table and the number of events respectively. Next *q* lines describe the events, each description contains four integers *tp**i*, *x**i*, *y**i* and *t**i* (1<=≤<=*tp*<=≤<=3,<=1<=≤<=*x*<=≤<=*n*,<=1<=≤<=*y*<=≤<=*m*,<=2<=≤<=*t*<=≤<=109) — the type of the event (1 if Gosha gets an invitation, 2 if a cat comes to the cell and 3 if a cat leaves the cell), the coordinates of the cell where the action takes place and the moment of time at which the action takes place respectively. It is guaranteed that the queries are given in the chronological order, i.e. *t**i*<=<<=*t**i*<=+<=1. For each invitation *i* (that is, *tp**i*<==<=1) calculate the number of ways to get to cell (*x**i*,<=*y**i*) at the moment of time *t**i*. Respond to the invitations chronologically, that is, in the order they appear in the input. Sample Input 1 3 3 2 1 2 3 3 1 2 5 1 1 1 7 3 3 3 2 2 2 2 1 3 3 5 1 3 3 7 4 5 5 2 2 5 3 2 2 4 6 3 2 4 9 1 4 4 13 1 4 4 15 Sample Output 5 2 42 490902 10598759

[ "import sys\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\nM = 10**9 + 7\n\n\ndef smvmul(d, m, v):\n return [sum(m[r][k] * v[k] for k in range(d)) % M for r in range(d)]\n\n\ndef smmul(d, m1, m2):\n return [[sum(m1[r][k] * m2[k][c] for k in range(d)) % M\n for c in range(d)] for r in range(d)]\n\n\ndef smpow(d, m, p):\n a = None\n while p > 1:\n if p % 2:\n if a is None:\n a = m\n else:\n a = smmul(d, a, m)\n m = smmul(d, m, m)\n p //= 2\n return m if (a is None) else smmul(d, a, m)\n\n\ndef process(n, m, events):\n d = n*m\n v = [0 for _ in range(d)]\n v[0] = 1\n\n a = [[0 for _ in range(d)] for _ in range(d)]\n for r in range(1, n+1):\n for c in range(1, m+1):\n i = (r-1)*m + (c-1)\n a[i][i] = 1\n if r > 1:\n a[i][i-m] = 1\n a[i-m][i] = 1\n if c > 1:\n a[i][i-1] = 1\n a[i-1][i] = 1\n\n # from pprint import pprint\n # pprint([[v[r*m+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n\n t = 1\n for event in events:\n ee, er, ec, et = event\n if t < et:\n # print(f\"POW {et-t}\", file=sys.stderr)\n # pprint([[v[r*m+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n # pprint(a, stream=sys.stderr)\n ap = smpow(d, a, et-t)\n v = smvmul(d, ap, v)\n # pprint(ap, stream=sys.stderr)\n # pprint([[v[r*m+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n t = et\n ei = (er-1)*m + (ec-1)\n if ee == 1:\n # print(f\"QRY {er} {ec} {ei} {v[ei]}\", file=sys.stderr)\n yield v[ei]\n else:\n v[ei] = 0\n b = 0 if (ee == 2) else 1\n # print(f\"CAT {er} {ec} {ei} {b}\", file=sys.stderr)\n a[ei][ei] = b\n if er > 1:\n a[ei][ei-m] = b\n if ec > 1:\n a[ei][ei-1] = b\n if er < n:\n a[ei][ei+m] = b\n if ec < m:\n a[ei][ei+1] = b\n # pprint([[v[r*m+c] for c in range(n)] for r in range(m)],\n # stream=sys.stderr)\n # pprint(a, stream=sys.stderr)\n\ndef pl(line):\n e, r, c, t = map(int, line.split())\n return e, r, c, t\n\n\ndef main():\n n, m, q = map(int, input().split())\n events = (pl(input()) for _ in range(q))\n for k in process(n, m, events):\n print(k)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n print(f\"TEST {k}\", file=sys.stderr)\n i, o = test\n with patchio(i) as r:\n main()\n if r.getvalue() == o:\n print(\"OK\\n\", file=sys.stderr)\n else:\n print(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\", file=sys.stderr)\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\ntests = [(\"\"\"\\\n1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7\n\"\"\", \"\"\"\\\n5\n\"\"\"), (\"\"\"\\\n3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7\n\"\"\", \"\"\"\\\n2\n42\n\"\"\"), (\"\"\"\\\n4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15\n\"\"\", \"\"\"\\\n490902\n10598759\n\"\"\")]\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n" ]

{"inputs": ["1 3 3\n2 1 2 3\n3 1 2 5\n1 1 1 7", "3 3 3\n2 2 2 2\n1 3 3 5\n1 3 3 7", "4 5 5\n2 2 5 3\n2 2 4 6\n3 2 4 9\n1 4 4 13\n1 4 4 15", "1 1 1\n1 1 1 2", "3 3 1\n1 3 3 5", "2 2 5\n2 1 1 8\n3 1 1 12345\n2 1 2 22345\n3 1 2 31243\n1 2 2 111115", "1 2 3\n1 1 1 2\n1 1 2 5\n1 1 1 19", "1 1 4\n2 1 1 2\n3 1 1 5\n1 1 1 7\n1 1 1 10", "2 2 3\n2 1 1 2\n1 2 2 3\n1 2 2 5", "1 20 2\n1 1 20 100000001\n1 1 20 1000000000", "2 2 10\n1 2 2 185\n1 2 2 243\n2 1 1 261\n3 1 1 279\n1 2 1 280\n2 1 1 293\n2 2 1 295\n3 1 1 298\n2 1 2 299\n2 1 1 300", "1 1 10\n2 1 1 227\n3 1 1 238\n2 1 1 286\n3 1 1 292\n2 1 1 295\n3 1 1 296\n1 1 1 297\n2 1 1 298\n3 1 1 299\n1 1 1 300", "20 1 10\n2 8 1 245\n2 2 1 275\n1 17 1 284\n1 13 1 293\n3 2 1 295\n1 3 1 296\n2 1 1 297\n3 1 1 298\n2 13 1 299\n2 19 1 300", "1 20 10\n1 1 4 200\n1 1 11 278\n2 1 15 285\n3 1 15 290\n1 1 13 292\n2 1 17 296\n2 1 8 297\n1 1 6 298\n1 1 11 299\n3 1 8 300"], "outputs": ["5", "2\n42", "490902\n10598759", "1", "6", "703708091", "1\n8\n131072", "0\n0", "2\n10", "452548876\n224409846", "990123599\n781690482\n617361700", "0\n0", "26508505\n16907334\n673189879", "272600817\n593383272\n555850892\n746491153\n78394828"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d377f3b3aaa38b4a7edac7027b9c009a

Selling Souvenirs

After several latest reforms many tourists are planning to visit Berland, and Berland people understood that it's an opportunity to earn money and changed their jobs to attract tourists. Petya, for example, left the IT corporation he had been working for and started to sell souvenirs at the market. This morning, as usual, Petya will come to the market. Petya has *n* different souvenirs to sell; *i*th souvenir is characterised by its weight *w**i* and cost *c**i*. Petya knows that he might not be able to carry all the souvenirs to the market. So Petya wants to choose a subset of souvenirs such that its total weight is not greater than *m*, and total cost is maximum possible. Help Petya to determine maximum possible total cost. The first line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=100000, 1<=≤<=*m*<=≤<=300000) — the number of Petya's souvenirs and total weight that he can carry to the market. Then *n* lines follow. *i*th line contains two integers *w**i* and *c**i* (1<=≤<=*w**i*<=≤<=3, 1<=≤<=*c**i*<=≤<=109) — the weight and the cost of *i*th souvenir. Print one number — maximum possible total cost of souvenirs that Petya can carry to the market. Sample Input 1 1 2 1 2 2 1 3 2 2 4 3 3 10 2 7 2 8 1 1 Sample Output 0 3 10

[ "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m = map(int, input().split())\r\nc1, c2, c3 = [0], [0], [0]\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if x == 3:\r\n c3.append(y)\r\n elif x == 2:\r\n c2.append(y)\r\n else:\r\n c1.append(y)\r\nc1.sort(reverse=True)\r\nc2.sort(reverse=True)\r\nc3.sort(reverse=True)\r\n\r\ndp = [None for i in range(m+1)]\r\ndp[0] = (0, 0, 0)\r\ndp[1] = (c1[0], 1, 0)\r\nfor i in range(2, m+1):\r\n if dp[i-1][1] == len(c1):\r\n x1 = (dp[i-1][0], dp[i-1][1], dp[i-1][2])\r\n else:\r\n x1 = (dp[i-1][0]+c1[dp[i-1][1]], dp[i-1][1]+1, dp[i-1][2])\r\n if dp[i-2][2] == len(c2):\r\n x2 = (dp[i-2][0], dp[i-2][1], dp[i-2][2])\r\n else:\r\n x2 = (dp[i-2][0]+c2[dp[i-2][2]], dp[i-2][1], dp[i-2][2]+1)\r\n if x1[0] > x2[0]:\r\n dp[i] = x1\r\n else:\r\n dp[i] = x2\r\n\r\nans = 0\r\ncost3 = 0\r\nfor i in range(len(c3)):\r\n cost3 += c3[i-1]\r\n cap = m - 3*i\r\n if cap < 0: break\r\n ans = max(ans, cost3+dp[cap][0])\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw1, w2, w3 = [], [], []\r\nfor _ in range(n):\r\n w, c = map(int, input().split())\r\n if w == 1:\r\n w1.append(c)\r\n elif w == 2:\r\n w2.append(c)\r\n else:\r\n w3.append(c)\r\nw1.sort(reverse = True)\r\nw2.sort(reverse = True)\r\nw3.sort(reverse = True)\r\nl1, l2, l3 = len(w1), len(w2), len(w3)\r\ndp = [0] * (m + 2)\r\ndp1 = [0] * (m + 2)\r\ndp2 = [0] * (m + 2)\r\nfor i in range(m):\r\n dpi, dp1i, dp2i = dp[i], dp1[i], dp2[i]\r\n if dp1i < l1 and dp[i + 1] < dpi + w1[dp1i]:\r\n dp[i + 1] = dpi + w1[dp1i]\r\n dp1[i + 1], dp2[i + 1] = dp1i + 1, dp2i\r\n if dp2i < l2 and dp[i + 2] < dpi + w2[dp2i]:\r\n dp[i + 2] = dpi + w2[dp2i]\r\n dp1[i + 2], dp2[i + 2] = dp1i, dp2i + 1\r\n if dp1i + 1 < l1 and dp[i + 2] < dpi + w1[dp1i] + w1[dp1i + 1]:\r\n dp[i + 2] = dpi + w1[dp1i] + w1[dp1i + 1]\r\n dp1[i + 2], dp2[i + 2] = dp1i + 2, dp2i\r\nfor i in range(1, m + 1):\r\n dp[i] = max(dp[i], dp[i - 1])\r\nans = dp[m]\r\nc = 0\r\nfor i in range(l3):\r\n m -= 3\r\n if m < 0:\r\n break\r\n c += w3[i]\r\n ans = max(ans, dp[m] + c)\r\nprint(ans)", "import sys\r\nn, m = map(int, input().split())\r\nw1 = []\r\nw2 = []\r\nw3 = [10**10]\r\n\r\nfor w, c in (map(int, l.split()) for l in sys.stdin):\r\n if w == 1:\r\n w1.append(c)\r\n elif w == 2:\r\n w2.append(c)\r\n else:\r\n w3.append(c)\r\n\r\nw1.sort(reverse=True)\r\nw2.sort(reverse=True)\r\nw3.sort(reverse=True)\r\nw3[0] = 0\r\nw1_size, w2_size = len(w1), len(w2)\r\n\r\ndp = [(0, 0, 0) for _ in range(m+3)]\r\nfor i in range(m):\r\n dp[i+1] = max(dp[i+1], dp[i])\r\n if dp[i][1] < w1_size:\r\n dp[i+1] = max(dp[i+1], (dp[i][0]+w1[dp[i][1]], dp[i][1]+1, dp[i][2]))\r\n if dp[i][2] < w2_size:\r\n dp[i+2] = max(dp[i+2], (dp[i][0]+w2[dp[i][2]], dp[i][1], dp[i][2]+1))\r\n\r\nans = 0\r\nw3_c = 0\r\n\r\nfor i in range(len(w3)):\r\n if i*3 > m:\r\n continue\r\n w3_c += w3[i]\r\n ans = max(ans, w3_c + dp[m-i*3][0])\r\n\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n\n[n, m] = map(int, input().strip().split())\nwc = [[] for _ in range(4)] # w[0] unused\nfor _ in range(n):\n\tw, c = map(int, input().strip().split())\n\twc[w].append(c)\n\nfor i in range(1, 4):\n\twc[i].sort(reverse=True)\n\niwc = [[0 for _ in range(len(wc[i]) + 1)] for i in range(4)]\n\nfor i in range(4):\n\tfor j in range(len(wc[i])):\n\t\tiwc[i][j + 1] = iwc[i][j] + wc[i][j]\n\nn1 = len(wc[1])\nn2 = len(wc[2])\nn3 = len(wc[3])\n\nc12 = [(0, 0, 0) for _ in range(m + 1)]\nfor w in range(len(c12) - 1):\n\tc, q1, q2 = c12[w]\n\tc12[w + 1] = max(c12[w + 1], c12[w])\n\tif q1 < n1:\n\t\tc12[w + 1] = max(c12[w + 1], (iwc[1][q1 + 1] + iwc[2][q2], q1 + 1, q2))\t\t\n\tif q2 < n2 and w + 2 < len(c12):\n\t\tc12[w + 2] = max(c12[w + 2], (iwc[1][q1] + iwc[2][q2 + 1], q1, q2 + 1))\n\n\ncmax = 0\nfor i in range(n3 + 1):\n\tif 3 * i > m:\n\t\tbreak\n\tcmax = max(cmax, iwc[3][i] + c12[m - 3 * i][0])\n\nprint(cmax)\n\n" ]

{"inputs": ["1 1\n2 1", "2 2\n1 3\n2 2", "4 3\n3 10\n2 7\n2 8\n1 1", "5 5\n3 5\n2 6\n3 2\n1 1\n1 6", "6 6\n1 6\n1 4\n1 8\n3 2\n3 2\n2 8", "6 12\n1 7\n1 10\n2 8\n1 2\n2 9\n3 5", "6 18\n3 3\n1 10\n2 10\n3 6\n1 3\n2 3", "20 25\n2 13\n3 11\n1 32\n1 43\n3 85\n1 14\n2 57\n1 54\n1 38\n2 96\n2 89\n3 64\n1 79\n2 73\n1 73\n2 34\n1 52\n1 79\n1 42\n3 34", "40 45\n2 82\n2 70\n2 48\n3 50\n2 15\n1 23\n1 80\n2 46\n1 20\n3 8\n3 81\n2 27\n1 59\n1 15\n3 95\n2 82\n2 40\n2 9\n2 61\n1 49\n2 5\n2 82\n1 55\n2 11\n1 26\n1 33\n1 2\n1 7\n3 57\n2 29\n1 59\n2 50\n3 63\n1 40\n1 99\n2 91\n2 39\n3 50\n1 75\n3 77", "4 28\n2 2\n3 1\n3 10\n1 9", "10 5\n1 9\n1 8\n2 10\n3 4\n3 1\n2 2\n3 6\n1 1\n3 8\n2 2", "10 12\n3 7\n3 6\n3 8\n3 2\n1 9\n2 5\n2 1\n2 5\n2 10\n2 9", "1 29\n2 8", "10 2\n3 4\n3 5\n3 7\n1 10\n1 2\n1 2\n1 8\n3 2\n1 8\n3 3", "6 5\n3 1\n3 1\n1 2\n2 9\n3 10\n1 8", "4 2\n3 4\n3 8\n1 1\n1 4", "7 12\n2 10\n2 8\n2 1\n3 8\n3 8\n3 7\n1 7", "70 203\n1 105\n1 105\n1 105\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300\n3 300", "10 6\n1 8\n1 10\n1 7\n2 9\n3 8\n1 8\n1 7\n1 4\n3 1\n3 8", "2 40\n1 10\n3 6", "7 6\n2 9\n3 10\n1 2\n2 6\n3 6\n2 1\n1 3", "2 4\n3 8\n1 6", "9 19\n2 5\n2 3\n3 9\n1 9\n3 8\n3 5\n3 4\n3 2\n3 6", "13 23\n3 17\n2 83\n1 81\n3 83\n3 59\n3 71\n2 61\n3 8\n3 64\n2 80\n3 47\n1 46\n1 82", "9 10\n3 6\n2 1\n2 4\n2 3\n3 6\n3 1\n1 8\n2 4\n3 3", "3 4\n2 10\n2 10\n3 15", "9 15\n3 8\n1 2\n2 5\n1 5\n3 3\n1 7\n1 7\n2 7\n2 9", "8 21\n2 6\n3 3\n3 7\n3 8\n3 8\n3 8\n2 6\n3 9", "6 7\n2 5\n2 4\n3 9\n3 2\n3 1\n3 8", "8 5\n3 9\n3 3\n1 4\n3 1\n2 5\n3 1\n3 6\n3 1", "1 1\n1 10", "1 2\n2 10", "5 9\n2 8\n3 7\n2 6\n1 4\n2 7", "4 4\n2 13\n2 15\n2 5\n1 9", "2 1\n1 5\n2 11", "8 6\n1 9\n1 5\n1 3\n1 10\n3 8\n1 6\n1 4\n1 2", "5 7\n1 8\n2 13\n2 13\n3 20\n3 14", "52 102\n3 199\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100\n2 100", "3 4\n1 4\n2 10\n3 100", "61 120\n3 5\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3\n2 3"], "outputs": ["0", "3", "10", "13", "26", "41", "35", "990", "1605", "22", "28", "46", "8", "18", "20", "5", "41", "20310", "44", "16", "22", "14", "46", "711", "25", "20", "51", "52", "18", "14", "10", "10", "28", "28", "5", "37", "46", "5100", "104", "180"]}

UNKNOWN

PYTHON3

CODEFORCES

4

d37c153e46473b00ba4e801f4917d3d7

Bulbs

Vasya wants to turn on Christmas lights consisting of *m* bulbs. Initially, all bulbs are turned off. There are *n* buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs? If Vasya presses the button such that some bulbs connected to it are already turned on, they do not change their state, i.e. remain turned on. The first line of the input contains integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100) — the number of buttons and the number of bulbs respectively. Each of the next *n* lines contains *x**i* (0<=≤<=*x**i*<=≤<=*m*) — the number of bulbs that are turned on by the *i*-th button, and then *x**i* numbers *y**ij* (1<=≤<=*y**ij*<=≤<=*m*) — the numbers of these bulbs. If it's possible to turn on all *m* bulbs print "YES", otherwise print "NO". Sample Input 3 4 2 1 4 3 1 3 1 1 2 3 3 1 1 1 2 1 1 Sample Output YES NO

[ "a,b=map(int,input().split())\r\ng=set()\r\nfor i in range(a):\r\n n=list(map(int,input().split()))\r\n n.pop(0)\r\n g.update(n)\r\nprint(['NO','YES'][len(g) == b])", "n,m=map(int,input().split())\r\np=[]\r\npo=[]\r\nfor i in range(m):\r\n p.append('0')\r\n po.append('1')\r\nfor i in range(1,n+1):\r\n q=input().split()\r\n um=q[0]\r\n for ui in range(1,int(um)+1):\r\n p[int(q[ui])-1]='1'\r\nif p==po:\r\n print('YES')\r\nelse:print('NO')", "########################################################################\r\n\"#######################################################################\"\r\n########################################################################\r\n\"Author = Fasih_ur_Rehman\"\r\n \r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\"_________ ____ _____ ___ __ __ \"\r\n#| \\ / \\/ / \\ |\\ \\ | \\ | \\ ####\r\n\"| ▓▓█████▓ /▓█████\\ ▓▓▓▓▓▓\\| | ███ | ██ | ██ ####\"\r\n#| ▓▓_____ ▓▓__| ▓▓ ██___\\██| | ▓▓▓ | ▓▓__| ▓▓ ####\r\n\"| ██ \\ ▓▓ ▓▓ \\██ \\ | ███ | ▓▓ ▓▓ ####\"\r\n#| ▓▓▓████▓ ████████ \\▓▓▓▓▓▓\\ | ▓▓▓ | ████████ ####\r\n\"| ██ ▓▓ | ▓▓ \\__| ██| | ███ | ▓▓ | ▓▓ ####\"\r\n#| ▓▓ ▓▓ | ▓▓ \\██ ██| | ▓▓▓ | ▓▓ | ▓▓ ####\r\n\"\\_██ ██ \\██ \\▓▓▓▓▓▓/ \\_███ \\_██ \\_██ ####\"\r\n\r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\r\n\"#######################################################################\" \r\n######################################################################## \r\n\"#######################################################################\" \r\n\r\nn,m = map(int,input().split())\r\na = set({})\r\nfor i in range(n):\r\n x = list(map(int,input().split()))\r\n a.update(x[1:])\r\nif len(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "shuru=input().split()\r\ns=[]\r\nn=int(shuru[0])\r\nm=int(shuru[1])\r\ni=1\r\nwhile i<=n:\r\n shuru1=input().split()\r\n shuru1.pop(0)\r\n s.extend(shuru1)\r\n i+=1\r\ns=list(set(s))\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n *b, = map(int, input().split())\r\n del b[0]\r\n for j in b:\r\n if j not in a:\r\n a.append(j)\r\nif len(a) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x,y = map(int,input().split())\r\nn=set()\r\nfor _ in range(x):\r\n n.update(input().split()[1:])\r\nprint([\"NO\",\"YES\"][len(n)==y])", "n, m = map(int, input().split())\r\nbulbs = [False] * m \r\nfor i in range(n):\r\n button = list(map(int, input().split()))[1:] \r\n for b in button:\r\n bulbs[b-1] = True \r\nif all(bulbs):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b = [int(x) for x in input().split()]\r\nlist1 = [0]*b\r\nfor i in range(a):\r\n list2 = [int(x) for x in input().split()]\r\n for j in list2[1:]:\r\n list1[j-1] += 1\r\nif list1.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "button, bulb = [int(i) for i in input().split()]\r\nb = [False] * bulb\r\nfor i in range(button):\r\n for j in [int(k) for k in input().split()[1:]]:\r\n b[j - 1] = True\r\nif b.count(False) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "tl = list(map(int, input().split()))\r\nbuttons = tl[0]\r\nbulbs = tl[1]\r\narray = []\r\nfor _ in range(buttons):\r\n l = list(map(int, input().split()))\r\n array.append(l)\r\n\r\nd = {}\r\nfor i in range(1, bulbs + 1):\r\n d[i] = False\r\nrem = bulbs\r\nfor cur_arr in array:\r\n if (rem == 0):\r\n print(\"YES\")\r\n exit(0)\r\n\r\n for i in range(1, len(cur_arr)):\r\n if (d[cur_arr[i]] == False):\r\n d[cur_arr[i]] = True\r\n rem -= 1 \r\nif (rem == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nbulbs=[0]*m\r\nfor i in range(n):\r\n buttons=list(map(int,input().split()))\r\n buttons.pop(0)\r\n for j in buttons:\r\n bulbs[j-1]=1\r\nif bulbs.count(0)==0:print(\"YES\")\r\nelse:print(\"NO\")", "def solve(t_id):\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(n):\r\n a = list(map(int, input().split()))\r\n for i in range(1, len(a)):\r\n d[a[i]] = 1\r\n print('YES' if len(d) == m else 'NO')\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "n,m = map(int,input().split(' '))\r\nbulb = [False]*m\r\nfor i in range(n):\r\n temp = list(map(int,input().split(' ')))[1::]\r\n for each in temp:\r\n bulb[each-1] = True\r\nprint('YES' if not (False in bulb) else 'NO')", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n b.remove(b[0])\r\n for i in b:\r\n a.append(i)\r\n\r\nif len(set(a))==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "n,m = map(int,input().split())\r\nlamp = [i for i in range(1,m+1)]\r\nlmp = []\r\n\r\nfor _ in range(n):\r\n a = [int(c) for c in input().split()][1:]\r\n lmp.extend(a)\r\n\r\nlmp =set(lmp)\r\nif len(lmp) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, m = map(int, input().split())\r\nr = set()\r\nfor i in range(n):\r\n r |= set(i for i in input().split()[1:])\r\nprint(\"YES\") if len(r) == m else print(\"NO\")\r\n", "n,m=[int(x) for x in input().split()]\r\ns=set() \r\nfor i in range(n):\r\n s.update(input().split()[1:]) \r\nflag=True\r\nif m!=len(s): \r\n flag=False\r\nprint('YES'if flag else 'NO')", "bulbs = []\r\nn, m = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n now = list(map(int, input().split()))\r\n now = now[1:]\r\n for j in now:\r\n if j not in bulbs:\r\n bulbs.append(j)\r\n\r\nif len(bulbs) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split(\" \"))\r\nl=[]\r\nfor i in range(n):\r\n\ts=list(map(int,input().split(\" \")))\r\n\tl+=s[1:]\r\nif len(set(l))==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, m = map(int, input().split())\r\nbulbs = [0] * m\r\nfor _ in range(n):\r\n temp = [int(__) for __ in input().split()]\r\n x = temp[0]\r\n y = temp[1:]\r\n for i in range(x):\r\n bulbs[y[i] - 1] = 1\r\nif sum(bulbs) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "total,all=map(int,input().split())\r\nlist2=[]*all\r\nfor i in range(total):\r\n list1=list(map(int,input().split()))\r\n for j in range(list1[0]):\r\n if list1[j+1] not in list2:\r\n list2.append(list1[j+1])\r\nif len(list2)==all:\r\n print(\"YES\")\r\nelse:print(\"NO\") ", "n,m = map(int, input().split())\nx ={}\nfor i in range(n):\n lst =list(input().split())\n for j in range(1, len(lst)):\n if lst[j]not in x:\n x[lst[j]] =1\nif len(x) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t\t \t \t\t \t \t\t\t \t", "n,m = map(int, input().split())\r\nb = [0]*m\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n for c in a[1:]:\r\n b[c-1] = 1\r\nif sum(b) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nnum=set()\r\nfor i in range(n):\r\n num.update(input().split()[1:])\r\nprint(['NO','YES'][len(num)==m])", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Nov 8 22:40:35 2020\n\n@author: gohlifang\n\"\"\"\nlst = list(map(int, input().split()))\n\nn, m = [lst[i] for i in range(0,2)] #n = number of buttons; m = bulbs\n\nnewlst = []\n\nfor i in range(0,n):\n result = input().split()\n x = result[0] #number of bulbs turn on with i button\n y_j = result[1:] #which bulb was turn on\n for ele in y_j:\n newlst.append(ele)\n\nnicelst = set(newlst)\n \nif len(nicelst) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n \n \n\n\n\n\n ", "n,m=[int(a) for a in input().split()]\r\nr=set()\r\nfor j in range(n):\r\n s=[int(a) for a in input().split()]\r\n r=r.union(set(s[1:]))\r\nif len(r)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "num_of_buttons, num_of_bulbs = map(int, input().split(' '))\r\n# define an empty set\r\nlighted_bulbs = set([])\r\n\r\nfor i in range(num_of_buttons):\r\n bulbs_for_button = list(map(int, input().split(' ')))\r\n for j in range(1, len(bulbs_for_button)):\r\n lighted_bulbs.add(bulbs_for_button[j])\r\n\r\nif len(lighted_bulbs) == num_of_bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nk = []\r\nfor _ in range(n):\r\n arr1 = list(map(int, input().split()))\r\n arr1.pop(0)\r\n k += arr1\r\nk.sort()\r\nx = [x+1 for x in range(m)]\r\nk = list(set(k))\r\nif k == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# CF25A: IQ test, brute force, 1300\n# \n# http://codeforces.com/problemset/problem/25/A\n\n# In[8]:\n\n\nlistnm=input().split(' ')\nn=int(listnm[0])\nm=int(listnm[1])\nliston=[0]*m\nfor i in range(n):\n listturn=input().split(' ')\n listturn=[int(i) for i in listturn]\n for x in range(1,listturn[0]+1):\n liston[listturn[x]-1]=1\nif liston.count(0)==0:\n print('YES')\nelse:\n print('NO')\n\n\n# In[ ]:\n\n\n\n\n", "n,m = map(int, input().split())\r\ns = set()\r\nfor x in range(n):\r\n l = list(input().split())\r\n l = l[1:]\r\n s = s.union(set(map(int, l)))\r\nprint('YES' if sum(s) == (1+m)*(m)/2 else 'NO')", "n,m=map(int, input().split())\r\ni=0\r\nbutt=set([])\r\nwhile i < n:\r\n buttons=list(input().split())\r\n but=set(buttons[1:])\r\n butt=butt.union(but)\r\n i+=1\r\na=len(butt)\r\nif a==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "inp=[int(x) for x in input().split()]\r\nn=inp[0]\r\nm=inp[1]\r\nbulbs=[0 for x in range(m)]\r\nfor x in range(n):\r\n button=[int(x) for x in input().split()]\r\n number=button.pop(0)\r\n for x in button:\r\n bulbs[x-1]=1\r\ncount=bulbs.count(0)\r\nif count!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, m = map(int, input().split())\r\np =[]\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n for j in range(1,l[0]+1):\r\n p.append(l[j])\r\nif list(set(sorted(list(p)))) == list(range(1,1+m)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\nbulbs=[0]*m\nfor i in range(n):\n conn=list(map(int,input()[2:].split()))\n for j in conn:\n bulbs[j-1]=1\nprint('NO') if 0 in bulbs else print('YES')\n \t \t \t \t\t\t \t \t \t \t \t \t", "nm=[int(i) for i in input().split()]\r\nn=nm[0];m=nm[1];l=[]\r\nfor j in range(n):\r\n b=[int(k) for k in input().split()]\r\n b.pop(0)\r\n l.extend(b)\r\nl=set(l)\r\nif len(l)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nbulb=set(i for i in range(1,m+1))\r\nbutton=set()\r\nfor i in range(n):\r\n s=input().split()\r\n pr=int(s[0])\r\n for j in range(1,pr+1):\r\n button.add(int(s[j]))\r\nleft=bulb.symmetric_difference(button)\r\nif(left): print('NO')\r\nelse: print('YES')", "n, m = map(int, input().split())\n\nbulbs = [False] * m\n\nfor i in range(n):\n switch = list(map(int, input().split()))[1:]\n for j in switch:\n bulbs[j-1] = True\n if all(bulbs):\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\n \t \t\t \t \t\t \t \t \t \t\t\t\t", "n,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n a.update(b[1:])\r\nif len(a)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nmyset=set()\r\nfor x in range(n):\r\n myset.update(input().split()[1:])\r\nprint(['NO','YES'][len(myset)==m])", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nm=l1[-1]\r\nl3=[]\r\nfor j in range(n):\r\n l2=[int(j) for j in input().split()]\r\n for k in range(1,l2[0]+1):\r\n l3.append(l2[k])\r\nl3.sort()\r\ns3=set(l3)\r\nif len(s3)==m:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n, m = map(int, input().split())\r\na = [0] * m\r\nfor u in range(n):\r\n b = [int(i) for i in input().split()]\r\n for i in range(b[0]):\r\n a[b[i + 1] - 1] = 1\r\nif sum(a) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\ndic={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1, len(lst)):\n if lst[j]not in dic:\n dic[lst[j]] = 1\nif len(dic) == m:\n print('YES')\nelse:\n print('NO')\n \t \t \t \t \t \t \t \t\t \t\t\t", "n,m=map(int,input().split())\ndic = {}\nfor i in range(n):\n lst= list(input().split())\n for t in range(1,len(lst)):\n if lst[t] not in dic :\n dic[lst[t]] = 1\nif len(dic) == (m):\n print('YES')\nelse:\n print('NO')\n\n\n\t\t \t \t \t \t \t \t\t \t \t \t\t \t\t", "button, bulb = map(int, input().split())\na = []\nfor i in range(button):\n a.extend(map(int, (input().split()[1:])))\nb = set(i for i in range(1, bulb + 1))\nif set(a) == b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "n, m = map(int, input().split())\r\nls = {i: 1 for i in range(1, m+1)}\r\ncnt = 0\r\nfor _ in range(n):\r\n bulbs = list(map(int, input().split()))\r\n if bulbs[0] > 0:\r\n for i in range(1, len(bulbs)):\r\n if bulbs[i] in ls:\r\n if ls[bulbs[i]] > 0:\r\n cnt += 1\r\n ls[bulbs[i]] -= 1\r\nif cnt == len(ls):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m = map(int,input().strip().split())\r\nnl = []\r\nc = 0\r\nfor i in range (n):\r\n lst = list(map(int,input().strip().split()))\r\n nl+=(lst[1:])\r\n nl.sort()\r\nfor i in range (1,m+1):\r\n if i not in nl:\r\n c = 1\r\n break\r\nif c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_light_up_all_bulbs(n, m, buttons):\r\n # Tạo một set để lưu các số hiệu của các bóng đã được bật\r\n lit_bulbs = set()\r\n \r\n # Duyệt qua từng button\r\n for i in range(n):\r\n bulbs = buttons[i][1:] # Danh sách các bóng mà button i bật\r\n \r\n # Kiểm tra nếu tất cả các bóng đều đã được bật, không cần làm gì thêm\r\n if all(bulb in lit_bulbs for bulb in bulbs):\r\n continue\r\n \r\n # Bật tất cả các bóng mà button i bật\r\n lit_bulbs.update(bulbs)\r\n \r\n # Kiểm tra nếu tất cả m bulbs đã được bật\r\n if len(lit_bulbs) == m:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\n\r\n# Đọc dữ liệu đầu vào\r\nn, m = map(int, input().split())\r\nbuttons = []\r\nfor _ in range(n):\r\n button = list(map(int, input().split()))\r\n buttons.append(button)\r\n\r\n# Gọi hàm kiểm tra và in kết quả\r\nresult = can_light_up_all_bulbs(n, m, buttons)\r\nprint(result)\r\n", "a = list(int(i) for i in(input().split()))\r\nn = a[0]\r\nm = a[1]\r\ny = []\r\nb = []\r\n\r\nfor i in range(n):\r\n\tx = list(input().split())\r\n\tfor i in range(1,int(x[0])+1):\r\n\t\ty.append(x[i])\r\n\t\t\r\nfor i in range(1,m+1):\r\n\tif str(i) not in set(y):\r\n\t\tb.append(i)\r\n\t\t\r\nif len(b) != 0:\r\n\tprint('NO')\r\n\t\r\nelse:\r\n\tprint('YES')", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tn,m = map(int,input().split())\r\n\tyL = []\r\n\tfor i in range(n):\r\n\t\tyL += [q for q in input().split()][1:]\t\t\r\n\tif len(set(yL)) == m:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\nsolve()", "n,m=map(int,input().split())\r\nbulbs=[0]*m \r\nfor _ in range(n):\r\n nums=list(map(int,input().split()))\r\n for i in range(1,nums[0]+1):\r\n bulbs[nums[i]-1]=1\r\nif 0 in bulbs:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(n):\r\n\tb=[int(x) for x in input().split()]\r\n\tb.pop(0)\r\n\ta=a+b\r\nc={x for x in range(1,m+1)}\r\nif set(a)==c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, m = map(int, input().split())\r\nans_list = [False for i in range(m)]\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in a[1::]:\r\n ans_list[j-1] = True\r\nif all(ans_list):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\nl=[1 for x in range(m)]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()]\r\n s=s[1:]\r\n for j in s:\r\n l[j-1]=0\r\nif sum(l)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\nblb=[]\r\nfor i in range(m):\r\n blb.append(int(0))\r\nfor i in range(n):\r\n btn=list(map(int,input().split()))\r\n for i in range(1,len(btn)):\r\n blb[btn[i]-1]=1\r\nif 0 in blb:\r\n print('NO')\r\nelse:\r\n print('YES')", "a,b=map(int,input().split())\r\nx=0\r\nc=list()\r\nwhile x<a:\r\n d=list(map(int,input().split()))\r\n e=d[1:]\r\n c.extend(e)\r\n x+=1\r\nc=list(set(c))\r\nf=len(c)\r\nif f==b:\r\n print('YES')\r\nelif f<b:\r\n print('NO')", "whole = []\r\nbuttons,bulbs = [int(x) for x in input().split()]\r\nfor i in range(0,buttons):\r\n turnon = input().split()\r\n del turnon[0]\r\n whole = whole + turnon\r\nif len(set(whole)) == bulbs:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n b = list(map(int, input().split()))\r\n a += b[1:]\r\nif len(set(a)) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split());p=set()\r\nfor i in range(a):\r\n n=list(map(int,input().split()))\r\n n.pop(0)\r\n p.update(n)\r\nprint([\"NO\",\"YES\"][len(p)==b])", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nl = [0] * m\r\nfor i in range(n):\r\n str1 = input().split()\r\n str2 = [int(x) for x in str1]\r\n for i in str2[1:]:\r\n l[i - 1] += 1\r\nif 0 in l:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n li=[int(x) for x in input().split()]\r\n li.pop(0)\r\n s=s|set(li)\r\na=True\r\nfor i in range(1,m+1):\r\n if i not in s:\r\n a=False\r\n break\r\nif a==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=m*[0]\r\nfor i in range(n):\r\n q=[int(x)for x in input().split()]\r\n for j in q[1:]:\r\n a[j-1]+=1\r\nif a.count(0)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "r=lambda i:map(int,input().split()[i:])\r\nn,m=r(0)\r\na=[]\r\nfor _ in[0]*n:a+=r(1)\r\nprint('YNEOS'[len(set(a))!=m::2])", "n,m = map(int, input().split())\r\nl = [0 for x in range(m)]\r\nfor i in range(n):\r\n s = [int(x) for x in input().split()]\r\n for j in range(1, s[0] + 1):\r\n l[s[j]-1] = 1\r\nflag = 0\r\nfor i in range(len(l)):\r\n if l[i] == 0:\r\n flag =1\r\n print('NO')\r\n break\r\nif flag == 0:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\nlight=[]\nfor i in range(0,n):\n l=input().split()\n light.extend(l[1:])\nx=1\nfor i in range(1,m+1):\n if str(i) not in light:\n x=0\nif x == 0:\n print('NO')\nelse:\n print('YES')", "n,m=map(int,input().split())\r\nl=[0]*m\r\nfor i in range(n):\r\n l1=list(map(int,input().split()))\r\n for i in range(1,l1[0]+1):\r\n a=l1[i]\r\n l[a-1]=1\r\np=sum(l)\r\nif p==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=[int(i) for i in input().split()]\r\nj=1\r\nse=set()\r\nsett=set()\r\nwhile j<=m:\r\n se.add(j)\r\n j+=1\r\nfor w in range(n):\r\n lst=[int(s) for s in input().split()]\r\n lst.remove(lst[0])\r\n sett.update(lst)\r\nif se==sett:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n n, m = map(int, input().split())\r\n bulbs = [False] * m\r\n for _ in range(n):\r\n info = list(map(int, input().split()))\r\n for i in range(1, len(info)):\r\n bulbs[info[i] - 1] = True\r\n if all(bulbs):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\n# Online IDE - Code Editor, Compiler, Interpreter\n\ndef splitter(arr):\n return [int(i) for i in arr.split()]\n\n\nbuttsBulbs = input()\nbuttsBulbs = splitter(buttsBulbs)\ntemp = \"\"\nopened = [] \nfinalArr = []\n\nfor i in range(buttsBulbs[0]):\n temp = input()\n opened = splitter(temp)\n for i in range(1,len(opened)):\n finalArr.append(opened[i])\nfinalArr = set(finalArr)\nif(len(finalArr)==buttsBulbs[1]):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n\n\n\t \t\t\t\t \t\t \t \t \t\t \t \t \t", "m, n = map(int, input().split())\r\ns = []\r\nfor i in range(m):\r\n a = [int(x) for x in input().split()]\r\n a.remove(a[0])\r\n s += a\r\nS = set(s)\r\nprint('YES' if(len(S) == n) else 'NO')", "a = []\r\nb, c = map(int, input().split())\r\nfor i in range(b):\r\n d = list(map(int, input().split()))\r\n for i in d[1:len(d)]:\r\n a.append(i)\r\n\r\nif len(set(a)) == c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl=[]\r\na=\"YES\"\r\nfor x in range(n):\r\n l+= map(int,list(input().split())[1:])\r\nfor x in range(1,m+1):\r\n if x not in l:\r\n a=\"NO\"\r\nprint(a) ", "a, b = list(map(int, input().split()))\r\nbulb = [int(x) for x in range(1, b+1)]\r\nfor i in range(a):\r\n bulblist = [int(x) for x in input().split()]\r\n for j in bulblist[1:]:\r\n if bulb.count(j) > 0:\r\n bulb.remove(j)\r\n if not bulb:\r\n break\r\nprint([\"YES\", \"NO\"][bulb != []])\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nbulb = set()\r\nfor i in range(n):\r\n bulb.update(set([int(x) for x in input().split()][1:]))\r\nif bulb == set(range(1,m+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=[int(x) for x in input().split()]\r\nd=[0]*b\r\nfor i in range(a):\r\n c=[int(x) for x in input().split()]\r\n \r\n for i in range(1,len(c)):\r\n e=c[i]\r\n d[e-1]+=1\r\nif d.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = map(int,input().split(\" \"))\r\n\r\nlamps = [0]*k\r\nfor i in range(1,n+1):\r\n x = list(map(int,input().split(\" \")))\r\n y = x[1:]\r\n for j in y :\r\n lamps[j-1]+=1\r\n\r\nfor i in lamps:\r\n if i == 0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "a, b = map(int, input().split())\r\ns = set()\r\nfor _ in range(a):\r\n i, *j = map(int, input().split())\r\n for k in j:\r\n s.add(k)\r\nif len(s) == b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nbulb=list(0 for x in range(m+1))\nfor x in range(n):\n\tk=list(map(int,input().strip().split()[:m+1]))\n\tfor y in k[1:]:\n\t\tbulb[y]=1\nif all(bulb[1:])==True:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "a,b = [int(i) for i in input().split()]\r\nc = []\r\nfor i in range(b):\r\n c.append(0)\r\nfor i in range(a):\r\n d = [int(j) for j in input().split()]\r\n for j in range(1,d[0]+1):\r\n c[d[j]-1]=1\r\nif 0 in c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=input().split()\r\nc=[]\r\nfor i in range(int(a[0])):\r\n b=input().split()\r\n del(b[0])\r\n c+=b\r\nd=set(c)\r\nif len(d)==int(a[1]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=list(map(int,input().split()))\r\nc=[]\r\ni=0\r\nwhile i<n:\r\n a=list(map(int,input().split()))\r\n c+=a[1:]\r\n i+=1\r\ni=0\r\nc.sort()\r\nc=set(c)\r\nsum1=0\r\nfor x in c:\r\n if True:\r\n sum1 += x\r\nsum2=m*(m+1)//2\r\nif sum2==sum1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "nBott, nBulb = map(int, input().split())\r\nbulbs = [0] * (nBulb + 1)\r\nfor i in range(nBott):\r\n botts = [int(k) for k in input().split()]\r\n nCon = botts[0]\r\n for j in range(1, nCon + 1):\r\n bulbs[botts[j]] = 1\r\ntag = 1\r\nfor i in range(1, nBulb + 1):\r\n if bulbs[i] == 0:\r\n tag = 0\r\n break\r\nif tag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn, m = read_ints()\n\ts=set()\n\tfor i in range(n):\n\t\ts |= set(read_ints()[1:])\n\tif len(s)==m:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nsolve()\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 16:19:05 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nn,m = [int(i) for i in input().split()]\r\nbulbs = [0]*m\r\nfor _ in range(n):\r\n inf = input().split()\r\n del inf[0]\r\n for i in inf:\r\n if bulbs[int(i)-1]==0:\r\n bulbs[int(i)-1]=1\r\nif sum(bulbs) == m:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n ", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nres=[]\r\n\r\nfor i in range(n):\r\n nums=[int(num) for num in input().split()[1:]]\r\n res.extend(nums)\r\n\r\nflag=0\r\nfor i in range(1,m+1):\r\n if i not in res:\r\n flag=1\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "#bulbs\nn,m=map(int,input().split())\nl=[]\nfor i in range(n):\n k=[int(x) for x in input().split()]\n for j in range(k[0]):\n l.append(k[j+1])\nprint('YES' if set(l)==set(range(1,m+1)) else 'NO')", "n,m=map(int,input().split( ))\r\nstandard={i for i in range(1,m+1)}#集合推导式\r\ntemp=set()#空集合的建立，不是{}而是set（）\r\nfor i in range(n):\r\n info=input().split( )\r\n info.pop(0)\r\n for j in info:\r\n y=int(j)\r\n temp.add(y)\r\nif temp == standard:\r\n print('YES')\r\nif temp != standard:\r\n print('NO')", "def answer():\r\n a = [int(x) for x in input().split()]\r\n n = a[0]\r\n t= a[1]\r\n l=[]\r\n \r\n while n:\r\n c=input().split()\r\n c=[int(x) for x in c]\r\n for x in c[1:]:\r\n if x not in l:\r\n l.append(x)\r\n n-=1\r\n \r\n l=set(l)\r\n i=1\r\n while i<=t:\r\n if i not in l:\r\n return \"NO\"\r\n i+=1\r\n return \"YES\"\r\nprint(answer())", "n, m = [int(i) for i in input().split()]\r\ns = set()\r\nfor _ in range(n):\r\n li = [int(i) for i in input().split()][1:]\r\n for i in li:\r\n s.add(i)\r\nprint(\"YES\" if len(s) == m else \"NO\")\r\n", "n,m=map(int,input().split())\r\nlist1=[]\r\nfor i in range(n):\r\n list2=list(map(int,input().split()))\r\n list2.pop(0)\r\n list1 += list2\r\nprint(['YES','NO'][len(set(list1)) != m])", "n,m=map(int,input().split())\r\nlight=[]\r\nfor i in range(n):\r\n move=list(map(int,input().split()))\r\n for j in range(1,len(move)):\r\n if move[j] not in light:\r\n light.append(move[j])\r\nif len(light)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "from functools import reduce\r\nprint('YES' if (lambda x:set(range(1,1+int(x.split()[1])))==reduce(lambda x,y:x|y,({int(j) for j in input().split()[1:]} for i in range(int(x.split()[0])))))(input()) else 'NO')\r\n", "n=input().split()\r\nb=[int(i+1)for i in range(int(n[1]))]\r\nfor j in range(int(n[0])):\r\n a=input().split()\r\n for c in a[1:]:\r\n if int(c) in b:\r\n b.remove(int(c))\r\nprint('YNEOS'[len(b)!=0::2])", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n a.remove(a[0])\r\n l+=a\r\nl=list(set(l))\r\nif len(l)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nbuttons , lamps = input().split()\nbuttons = int(buttons)\nlamps = int(lamps)\ndict_ = {}\nfor i in range(buttons):\n list_ = input().split()\n lamps_ = list_[1:]\n dict_[i] = lamps_\n\nmyset = set()\n\nfor key in dict_:\n for i in range(len(dict_[key])):\n myset.add(dict_[key][i])\n\nif len(myset) == lamps:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \t \t \t \t \t\t\t\t \t \t \t \t\t", "#615\r\nn, m = [int(x) for x in input().split()]\r\nconnection = []\r\nfor i in range(n):\r\n for x in input().split()[1:]:\r\n connection.append(int(x))\r\n\r\nfor i in range(1,m+1):\r\n if not (i in connection):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "buttonNum,bulbNum=map(int,input().split())\r\nbulbSet=set()\r\nfor i in range(buttonNum):\r\n bulbList=input().split()\r\n bulbList.pop(0)\r\n bulbSet.update(bulbList)\r\nprint(\"YES\" if len(bulbSet)==bulbNum else \"NO\")\r\n", "n, m = map(int, input().split())\r\non = set()\r\n\r\nfor _ in range(n):\r\n on = on | set(map(int, input().split()[1:]))\r\n\r\nprint('YES') if on == set(range(1, m + 1)) else print('NO')", "n,m=[int(x) for x in input().split()]\r\nb=[0]*m\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n c=len(a)\r\n for i in range(1,c):\r\n d=a[i]\r\n b[d-1]=1\r\nif 0 not in b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n k=list(map(int,input().split()))[1:]\r\n l+=k\r\nl=list(set(l))\r\nif len(l)==m:\r\n print('YES')\r\nelse:\r\n print('NO') ", "m,n = map(int,input().split())\r\nlist2 = []\r\nfor i in range(m):\r\n list1 = list(map(int,input().split()))[1:]\r\n list2 += list1\r\nprint(\"YES\"if len(set(list2))==n else \"NO\")", "n, m = map(int, input().split())\narr = []\n\nfor i in range(n):\n tmp = list(map(int, input().split()))\n for i in range(1, tmp[0] + 1):\n arr.append(tmp[i])\n\nif len(set(arr)) == m:\n print(\"YES\")\nelse:\n print('NO')\n", "n,m=[int(x) for x in input().split()]\r\nb=[]\r\nfor i in range(m):\r\n b.append(\"OFF\")\r\nfor j in range(n):\r\n o=[int(x) for x in input().split()]\r\n for k in range(1,o[0]+1):\r\n if b[o[k]-1]==\"OFF\":\r\n b[o[k]-1]=\"ON\"\r\nprint(\"YES\" if b.count(\"OFF\")==0 else \"NO\")", "N,M=map(int,input().split())\r\na=list()\r\nfor i in range(N):\r\n ar=list(map(int,input().split()))\r\n ar.remove(ar[0])\r\n for i in range(len(ar)):\r\n a.append(ar[i])\r\nif(len(list(set(a)))==M):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nbulbs = [0]*m\r\nfor i in range(n):\r\n button = list(map(int,input().split()))\r\n for j in range(button[0]):\r\n bulbs[button[j+1]-1] = 1\r\nif bulbs.count(0) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, bulb= (map(int, input().split()))\r\nb = []\r\n\r\ncount = 0\r\nfor x in range(n):\r\n a = list(map(int, input().split()))\r\n for y in range(int(a[0])):\r\n b.append(a[y+1])\r\n \r\nif len(set(b)) == bulb :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\nres = []\nfor i in range(m + 1):\n res.append(0)\nfor i in range(1, n + 1):\n l = list(map(int, input().split()))\n for j in range(1, len(l)):\n res[l[j]] = 1\nprint(\"YES\" if sum(res) == m else \"NO\")", "i = [int(o) for o in input().split()]\r\nk = set()\r\nfor j in range(i[0]):\r\n k.update(input().split()[1:])\r\n \r\nif len(k) == i[1]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 17:42:12 2021\r\n\r\n@author: 86139\r\n\"\"\"\r\n\r\nt, s = list(map(int, input().split(' ')))\r\ns = set(range(1,s+1))\r\nfor _ in range(t):\r\n d = list(map(int, input().split(' ')))[1:]\r\n d = set(d)\r\n s -= d\r\nif s:\r\n print('NO')\r\nelse:\r\n print('YES')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Oct 22 17:49:36 2021\n\n@author: lijialin\n\"\"\"\n\n#Bulbs\nn,m=map(int,input().split())\nlist1=[]\ncount=1\nfor i in range(n):\n list2=[]\n list2=input().split()\n list2=[int(x) for x in list2]\n a=len(list2)\n list1.extend(list2[1:a])\nfor i in range(m):\n if count in list1:\n count+=1\n else:\n print(\"NO\")\n break\nif count==m+1:\n print(\"YES\")\n ", "ini = input().split()\r\nlst = [0] * int(ini[1])\r\nfor i in range(int(ini[0])):\r\n turn = list(map(int, input().split()))\r\n for j in range(1, turn[0] + 1):\r\n lst[turn[j] - 1] = 1\r\nif sum(lst) == len(lst):print(\"YES\")\r\nelse:print(\"NO\")", "inp = [int(i) for i in input().split()]\nnum_buttons, num_bulbs = inp[0], inp[1]\n\nlit = set()\nfor i in range(num_buttons):\n line = [int(i) for i in input().split()][1:]\n lit.update(line)\n\nif len(lit) == num_bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "n,m = map(int,input().split())\r\nl1 = []\r\nwhile(n):\r\n\tl = list(map(int,input().split()))\r\n\ta = l[0]\r\n\tb = l[1:]\r\n\tl1.extend(b)\r\n\tl1 = list(set(l1))\r\n\tn-=1\r\nif(len(l1)==m):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m=map(int,input().split())\r\nx=[0]*m\r\nfor i in range(n):\r\n b=[int(s) for s in input().split()]\r\n bu=b[0]\r\n del b[0]\r\n for k in b:\r\n x[k-1]=1\r\n b=[]\r\nif sum(x)==m:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "n, m = map(int,input().split())\r\nbulbs = [0] * m\r\n\r\nfor i in range(n):\r\n y = list(map(int,input().split()))\r\n y1 = y[1:]\r\n for j in y1:\r\n bulbs[j-1] = 1\r\n\r\nif 0 in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "n, m = map(int, input().split())\r\non = set()\r\nfor _ in range(n):\r\n\tnums = list(map(int, input().split()))\r\n\tfor i in range(1, len(nums)):\r\n\t\ton.add(nums[i])\r\nprint(\"YES\" if len(on) == m else \"NO\")", "n,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(n):\r\n bulbs+=list(map(int,input().split()))[1:]\r\ns=set(bulbs)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int, input().split())\r\nx=set()\r\nfor i in range(a):\r\n c=list(map(int, input().split()))\r\n c.remove(c[0])\r\n x. update(c)\r\nif len(x)==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m= map(int,input().split())\r\nt =[]\r\nfor z in range(m):\r\n t.append(1)\r\nfor i in range (n):\r\n x= list(map(int,input().split()))\r\n for j in range (1,len(x)):\r\n tmp = x[j]\r\n for k in range(len(t)):\r\n if k == tmp-1:\r\n t[k] = 0\r\ny= t.count(0)\r\nif y==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nb = []\r\nfor t in range(n):\r\n\ta = [int(i) for i in input().split()]\r\n\tfor i in range(1, a[0] + 1):\r\n\t\tif a[i] not in b:\r\n\t\t\tb += [a[i]]\r\nb.sort()\r\nif len(b) < m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tflag = True\r\n\tfor i in range(m):\r\n\t\tif b[i] != i + 1:\r\n\t\t\tflag = False\r\n\tprint(\"YES\") if flag else print(\"NO\")", "input_list = [int(x) for x in input().split()]\r\nn = input_list[0]\r\nlight_dict = {x: 0 for x in range(input_list[1])}\r\n\r\nfor i in range(n):\r\n input_list = [int(x) for x in input().split()]\r\n for j in input_list[1:]:\r\n light_dict[j - 1] = 1\r\n\r\nif 0 in light_dict.values():\r\n print('NO')\r\nelse:\r\n print('YES')", "c='YES'\r\nk=set()\r\nm,n=input().split()\r\nfor i in range(int(m)):\r\n a=list(map(int, input().split()))\r\n k.update(a[1:])\r\nfor t in range(int(n)) :\r\n if t+1 in k:\r\n c=c\r\n if t+1 not in k:\r\n c='NO'\r\n break\r\nprint(c)", "r=lambda i:map(int,input().split()[i:])\nn,m=r(0)\na=[]\nfor _ in[0]*n:a+=r(1)\nprint('YNEOS'[len(set(a))!=m::2])\n\t\t \t \t\t \t \t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 20 22:15:43 2021\r\n\r\n@author: Asus\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nlism=[0]*m\r\nlish=[]\r\nfor h in range(n):\r\n lish+=input().split()\r\nlish=[int(lish[a]) for a in range(len(lish))]\r\nwhile len(lish)>1:\r\n k=lish[0]\r\n del lish[0]\r\n for _ in range(k):\r\n j=lish[0]\r\n lism[j-1]=1\r\n del lish[0]\r\nprint('NO'if 0 in lism else'YES')\r\n ", "num_buttons, num_bulbs = [int(num) for num in input().split()]\narr = []\nfor i in range(num_buttons):\n\tarr = arr + [int(num) for num in input().split()][1:]\nif(set(arr) == set(range(1, num_bulbs+1))):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,m=[int (x) for x in input().split()]\r\nd=[0]*m\r\nfor i in range(n):\r\n\ta=[int (x) for x in input().split()]\r\n\tfor i in range(1,a[0]+1):\r\n\t\td[a[i]-1]=1\r\nif 0 in d:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n\tx=list(map(int,input().split()))[1:]\r\n\tfor i in x:\r\n\t\ta.add(i)\r\n\r\n# print(a)\r\nif len(a)==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "e=[]\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n d=list(map(int,input().split()))\r\n for a in d[1:]:\r\n e.append(a)\r\ns=set(e)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "n,m =map(int,input().split())\r\nm=set(range(1,m+1))\r\nans=[]\r\nfor i in range(n):\r\n o = list(map(int,input().split()))\r\n for x in o[1:]:\r\n ans.append(x)\r\nans=set(ans)\r\nif ans == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=input().split()\r\nk=[]\r\np=True\r\nfor i in range(int(a)):\r\n s=[int(x) for x in input().split()]\r\n for c in s[1:len(s)]:\r\n k.append(c)\r\nfor j in range(1,int(b)+1):\r\n if j not in k:\r\n p=False\r\nprint(\"YES\" if p else\"NO\")", "n, m = map(int, input().split())\ns = set()\nfor _ in range(n):\n\tarr = list(map(int, input().split()))\n\tfor i in arr[1:]:\n\t\ts.add(i)\nif len(s) == m:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "#1\r\n'''\r\nn=int(input())\r\nline=input()\r\nnums=[int(i) for i in line.split()]\r\ns=0\r\nt1=0\r\nt2=0\r\nfor i in range(n):\r\n if nums[i]%2==0:\r\n s+=1\r\n t1=i+1\r\n else:\r\n t2=i+1\r\nif s==1:\r\n print(t1)\r\nelse:\r\n print(t2)\r\n'''\r\n\r\n#2\r\n\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nres=[]\r\n\r\nfor i in range(n):\r\n nums=[int(num) for num in input().split()[1:]]\r\n res.extend(nums)\r\n\r\nflag=0\r\nfor i in range(1,m+1):\r\n if i not in res:\r\n flag=1\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n ", "n, m = map(int, input().split())\r\nstate = []\r\nfor i in range(m):\r\n state.append(0)\r\nfor i in range(n):\r\n data = list(map(int, input().split()))[1:]\r\n for j in data:\r\n state[j-1] = 1\r\nif sum(state) != m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m = map(int,input().split())\r\nsta = [0]*m\r\n\r\nfor i in range(n):\r\n lights = list(int(i) for i in input().split())\r\n for j in range(lights[0]):\r\n if sta[lights[j+1]-1] == 0:\r\n sta[lights[j+1]-1] = 1\r\n \r\nif sta.count(0) > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = map(int, input().split())\r\na = set()\r\nfor x in range(n):\r\n b = [int(y) for y in input().split()]\r\n a.update(b[1:])\r\n\r\nif len(a) == m :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n v = input().split()\r\n n = int(v[0])\r\n m = int(v[1])\r\n used = []\r\n for i in range(m):\r\n used.append(0)\r\n for i in range(n):\r\n v = input().split()\r\n for j in range(1, int(v[0]) + 1):\r\n used[int(v[j]) - 1] = 1\r\n\r\n ans = \"YES\"\r\n for i in range(m):\r\n if used[i] == 0:\r\n ans = \"NO\"\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=[int(x) for x in input().split()]\r\nlist1=[]\r\nfor i in range(n):\r\n lista=[int(x) for x in input().split()]\r\n list1=list1+lista[1:]\r\n continue\r\nk=1\r\ni=0\r\nwhile k <m+1:\r\n if k in list1:\r\n k+=1\r\n i+=1\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nif i==m:\r\n print('YES')", "n,m=[int(x) for x in input().split()]\r\no=set()\r\np=set()\r\nfor i in range(1,m+1):\r\n o.add(i)\r\nfor i in range(n):\r\n lis=[int(x) for x in input().split()]\r\n lis1=lis[1::1]\r\n p.update(lis1)\r\nif o==p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m = map(int,input().split())\r\nbulbs_state = [0]*m\r\nfor i in range(n):\r\n s = list(map(int,input().split()))\r\n for j in range(1,len(s)):\r\n bulbs_state[s[j]-1] = None\r\nif 0 in bulbs_state:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nfor e in a:\r\n for o in range(e[0]):\r\n b.append(e[o+1])\r\n\r\nb = set(b)\r\n\r\nif len(b) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nlights = [1 for x in range(0, m)]\r\nfor i in range(n):\r\n s = list(map(int,input().split()))\r\n del s[0]\r\n s.sort()\r\n for j in s:\r\n lights[j-1] = 0\r\nif sum(lights) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\nnumbers = []\nfor i in range(n):\n lst = list(input().split())\n for j in range(1, len(lst)):\n if lst[j] not in numbers:\n numbers.append(lst[j])\nif len(numbers) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t \t \t\t\t \t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\ntemp=[]\r\nfor i in range(n):\r\n list=[int(i) for i in input().split()]\r\n temp+=list[1:list[0]+1]\r\nif(len(set(temp))==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=input().split()\r\nn=int(n);m=int(m)\r\nA=set()\r\nfor i in range(n):\r\n X = list(map(int,input().split()))\r\n if(X[0]==0):continue\r\n A.update(X[1:])\r\nif(len(A)==m):print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nnum=set()\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for k in range(l[0]):\r\n num.add(l[k+1])\r\nprint(\"YES\" if len(num) == m else \"NO\")", "n, m = map(int, input().split())\n\n# Set of turned off bulbs\nturned_off = set(range(1, m+1))\n\nfor i in range(n):\n bulbs = list(map(int, input().split()))[1:]\n for bulb in bulbs:\n if bulb in turned_off:\n turned_off.remove(bulb)\n\nif turned_off:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n \t \t \t \t \t\t\t \t\t\t \t \t\t\t\t\t\t \t", "n,m=map(int,input().split())\r\nans=set()\r\nfor i in range(n):\r\n inp=list(map(int,input().split()))\r\n for j in range(1,inp[0]+1):\r\n if inp[j] in ans:\r\n continue\r\n else:\r\n ans.add(inp[j])\r\nif len(ans)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\nbulbs = [0] * m\r\nfor _ in range(n):\r\n bulb = [*map(int, input().split())]\r\n for i in range(1, len(bulb)):\r\n bulbs[bulb[i] - 1] = 1\r\n\r\nprint(\"YES\" if sum(bulbs) == m else \"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 22:35:10 2022\r\n\r\n@author: 86138\r\n\"\"\"\r\n\r\na,b=map(int,input().split());c=set()\r\nfor i in range(a):\r\n inp=list(input().split())\r\n for j in range(len(inp)-1):\r\n c.add(inp[j+1])\r\nprint(['YES','NO'][len(c) != b])", "n, m = map(int,input().split())\nst = set()\nfor i in range(n):\n lst = list(map(int,input().split()))\n for j in range(1, len(lst)):\n st.add(lst[j])\nif len(st) == m:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t \t \t\t \t\t \t \t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 18 15:50:24 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\na,b = map(int,input().split())\r\nc = []\r\nd = []\r\ne = 0\r\nfor i in range (0,b):\r\n d.append(1)\r\nfor i in range(0,a):\r\n c = list(map(int,input().split()))\r\n for j in range(1,len(c)):\r\n d[c[j]-1]=0\r\nfor i in range (0,b):\r\n e+=d[i]\r\nif e == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nlst = [0]*(m+1)\r\nfor i in range(n):\r\n lstn = list(map(int,input().split()))[1:]\r\n for j in lstn:\r\n lst[j]=1\r\ncount = lst.count(1)\r\nif count==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nset1=set()\r\nfor i in range(n):\r\n set1.update(input().split()[1:])\r\nif len(set1)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "#bulb\nn, m = map(int, input().split())\ns=set()\nflag = True\nfor i in range(n):\n q = list(map(int, input().split()))\n for j in range(1, q[0]+1):\n s.add(q[j])\nfor i in range(1, m+1):\n if i not in s:\n flag = False\n\nif flag:\n print('Yes')\nelse:\n print(\"No\")\n\t \t\t\t \t \t\t \t \t\t\t\t", "n,m = map(int,input().split())\r\nbulb_whole = [0]*m\r\nfor i in range(n):\r\n bulb_part = list(map(int,input().split()))\r\n bulb_part.pop(0)\r\n for j in range(len(bulb_part)):\r\n index = bulb_part[j]\r\n if bulb_whole[index-1] == 0:\r\n bulb_whole[index-1] = 1\r\nif bulb_whole.count(0) != 0:\r\n print(\"NO\")\r\nelse: print(\"YES\")", "n , ln = map(int, input().split())\r\nnum = list(i for i in range(1,ln+1))\r\non = []\r\nfor j in range(n):\r\n step = list(input().split())\r\n a = int(step[0])\r\n for b in range(1,a+1):\r\n if int(step[b]) not in on:\r\n on.append(int(step[b]))\r\non.sort()\r\nif on == num:\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b = map(int, input().split())\r\nc = []\r\nd = []\r\nfor i in range(a):\r\n l = list(map(int, input().split()))\r\n c.extend((l[1:]))\r\nfor x in range(b):\r\n b -= 1\r\n d.append(b)\r\nfor e in range(len(d)):\r\n d[e] += 1\r\nif set(c) & set(d) == set(d):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n for i in a[1:]:\r\n l.append(i)\r\nl=set(list(l))\r\nif len(l)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n,m=(int(x) for x in input().split())\r\nk=[1]*m\r\nfor i in range(n):\r\n t=[int(y) for y in input().split()]\r\n for i in t[1:]:\r\n k[i-1]=0\r\nif sum(k)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n, m = map(int, input().split())\r\nall = []\r\n\r\nfor i in range(n):\r\n bulbs = list(map(int, input().split()))\r\n for j in bulbs[1:len(bulbs)]:\r\n all.append(j)\r\n\r\ns_all = set(all)\r\nif len(s_all) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "m, n = map(int, input().split())\r\nbulbs = [0 for i in range(n)]\r\nfor i in range(m):\r\n xy = [i for i in map(int, input().split())]\r\n xi = xy[0]\r\n yi = xy[1:]\r\n for y in yi:\r\n bulbs[y - 1] = 1\r\n\r\nif sum(bulbs) == n:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl2=[]\r\nwhile(n):\r\n l=list(map(int,input().split()))\r\n l1=l[1:]\r\n l2.append(l1)\r\n n=n-1\r\n#print(l2)\r\noutput = []\r\ndef reemovNestings(l2):\r\n for i in l2:\r\n if type(i) == list:\r\n reemovNestings(i)\r\n else:\r\n output.append(i)\r\nreemovNestings(l2)\r\ns=set(output)\r\n#print(s)\r\nif(len(s)==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import *\r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef main():\r\n n,m = nextInts()\r\n\r\n arr = [0]*(m+1)\r\n for i in range(n):\r\n b = nextInts()\r\n for i in range(1,b[0]+1):\r\n arr[b[i]] = 1\r\n\r\n ok = True\r\n for i in range(1,m+1):\r\n if arr[i] == 0:\r\n ok = False\r\n\r\n if ok:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n\r\n", "n, m = [int(a) for a in input().split()]\r\nx = set()\r\nfor _ in range(n):\r\n x.update(set(input().split()[1:]))\r\nprint([\"NO\", \"YES\"][len(x) == m])", "def main():\n n, m = map(int, input().split())\n switches = [list(map(int, input().split())) for _ in range(n)]\n\n seen = [False] * m\n for switch in switches:\n bulbs = switch[1:]\n for bulb in bulbs:\n seen[int(bulb) - 1] = True\n\n print(\"YES\" if all(seen) else \"NO\")\n\nif __name__ == \"__main__\":\n main()\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 15:25:10 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\nx,y = map(int,input().split())\r\nflag = 'YES' \r\n\r\nbulb = [0 for i in range(y+1)]\r\nbulb[0] = 1\r\n\r\nfor i in range(x):\r\n a = input().split()\r\n a = [int(x) for x in a]\r\n d = a[0] + 1\r\n for j in range(1,d):\r\n bulb[a[j]] = 1\r\n\r\nfor i in range(y+1):\r\n if bulb[i] == 0:\r\n flag = 'NO'\r\n\r\nprint(flag)", "n,m=list(map(int,input().split()))\r\na=[0]*m\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n for j in range(1,b[0]+1):\r\n a[b[j]-1]=1\r\ne=0\r\nfor i in range(m):\r\n if a[i]==0:\r\n e=1\r\n break\r\nif e==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", " \r\ndef solve():\r\n groups, lights = list(map(int, input().split(\" \")))\r\n lst = []\r\n \r\n for i in range(groups):\r\n group = list(map(int, input().split(\" \")))\r\n num = group.pop(0)\r\n lst = lst + group\r\n lst = list(set(lst))\r\n if len(lst) == lights:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nsolve()", "n,m=map(int,input().split())\ndic ={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in dic:\n dic[lst[j]]=1\nif len(dic)==m:\n print('Yes')\nelse:\n print('No')\n\n\n \t\t \t \t \t\t \t\t \t \t\t \t\t\t", "n,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(n):\r\n shuru= input().split()\r\n for i in range(1,int(shuru[0])+1):\r\n bulbs.append(shuru[i])\r\nans=len(list(set(bulbs)))\r\nif ans==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=input().split()\nn=int(n)\nm=int(m)\nset=set()\nfor i in range(n):\n list=input().split()\n for i in range(1,len(list)):\n set.add(list[i])\n\nif(len(set)==m):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t\t\t\t\t \t\t \t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(n):\r\n x=input().split()\r\n for t in x[1:]:\r\n if t not in l1:\r\n l1.append(t)\r\nif len(l1)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "x,b = input().split()\nx = int(x)\nb = int(b)\nanss = []\nfor i in range(x):\n lst = list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in anss:\n anss.append(lst[j])\n else:\n continue\nif len(anss)==b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t\t\t \t \t \t\t \t\t", "button, bulb = map(int, input().split())\r\nbul = set()\r\nfor k in range(bulb):\r\n bul.add(str(k+1))\r\non = set()\r\nfor i in range(button):\r\n b = input().split()\r\n on.update(b[1:])\r\nif bul == on:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n for _ in a[1:]:\r\n l.append(_)\r\nfor j in range(m):\r\n if j+1 not in l:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n, m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n l = input().split()\r\n s = s | set(l[1:])\r\nprint(['NO','YES'][len(s) == m])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 3 13:57:19 2020\r\n\r\n@author: 86133\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nc = 1\r\nd = [0 for i in range(200)]\r\nfor i in range(n):\r\n a = [int(j) for j in input().split()]\r\n for j in a[1:]:\r\n d[j] = 1\r\nfor i in d[1:m+1]:\r\n if not i:\r\n c = 0\r\n print('NO')\r\n break\r\nif c:\r\n print('YES')", "n,m = [int(x) for x in input().split(\" \")]\r\nclose = set()\r\nwhile True:\r\n try:\r\n s = input().split(\" \")\r\n for i in range(1,len(s)):\r\n close.add(s[i])\r\n except EOFError:\r\n break\r\n\r\nprint([\"NO\",\"YES\"][len(close) - m==0])", "n , m = map(int,input().split())\r\nlist1 = []\r\nz = 0 \r\nwhile n > z :\r\n list0=map(int,input().split())\r\n for i in list0:\r\n list1.append(i)\r\n z+=1 \r\nif list1[0] == m :\r\n list1=list1[1:]\r\nfor i in range(1,m+1):\r\n if i in list1 :\r\n q=9\r\n else:\r\n q=0\r\n break\r\nif q == 9 :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") \r\n# easy hhh ", "n,m=map(int,input().split())\r\non=[]\r\nfor i in range(n):\r\n bulbs=list(map(int,input().split()))\r\n for j in range(bulbs[0]):\r\n if bulbs[j+1] in on:\r\n continue\r\n else:\r\n on.append(bulbs[j+1])\r\n\r\nif len(on)==m:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n for i in range(1,len(s)):\r\n if(s[i] not in d):\r\n d[s[i]]=1\r\nif(len(d)==m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]\r\n for i in range(1,len(a)):\r\n if a[i] not in lst:\r\n lst.append(a[i])\r\nif len(lst)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\r\nd=[i for i in range(1,b+1)]\r\nfor k in range(a):\r\n c=list(map(int,input().split()))\r\n for i in range(1,len(c)):\r\n d[c[i]-1]=0\r\nif sum(d)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nbulbs = [0] * m\r\n\r\nfor _ in range(n):\r\n for i in input().split()[1:]:\r\n bulbs[int(i) - 1] = 1\r\n\r\nprint(\"YES\" if all(bulbs) else \"NO\")\r\n", "n,m=map(int,input().split(' '))\r\nX=[]\r\nfor i in range(1,n+1):\r\n\tA=list(map(int,input().split(' ')))\r\n\tx=A[0]\r\n\tfor k in range(1,x+1):\r\n\t\tX.append(A[k])\r\n\r\nY=list(set(X))\r\n\r\nZ=[]\r\nfor c in range(1,m+1):\r\n\tZ.append(c)\r\nif Y==Z:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "buttons,bulbs = list(map(int,input().split()))\r\n\r\nb=[]\r\nfor i in range(buttons):\r\n\tn = list(map(int,input().split()))\r\n\tn.remove(n[0])\r\n\tfor i in n:\r\n\t\tb.append(i)\r\n\r\nif len(set(b)) == bulbs:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n,m=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in l[1:]:\r\n b.append(j)\r\nif(len(set(b))==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m, n = map(int, input().split())\r\nd = [False] * n\r\nfor i in range(m):\r\n for j in map(int, input().split()[1:]):\r\n d[j - 1] = True\r\nprint('YES' if all(d) else 'NO')", "n,m = map(int,input().split())\r\nbulbs = set() ; on = set()\r\nfor i in range(1,m+1):\r\n bulbs.add(i)\r\nfor _ in range(n):\r\n raw = [int(x) for x in input().split()]\r\n raw.remove(raw[0])\r\n for x in raw: on.add(x)\r\nif bulbs.issubset(on): print(\"YES\")\r\nelse: print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 14:12:50 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\n_a = input().split()\r\nn = int(_a[0]); m = int(_a[1])\r\nbulbs = [False for x in range(0,m)]\r\n\r\nfor i in range(0,n):\r\n l = [int(x) for x in input().split()]\r\n for x in l[1:]:\r\n bulbs[x - 1] = True\r\nif False in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n ", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\ncheck = defaultdict(int)\r\nfor i in range(n):\r\n arr = [*map(int, input().split())]\r\n for j in range(1, len(arr)):\r\n check[arr[j]] += 1\r\nprint(\"YES\" if len(check) == m else \"NO\")", "n,m=[int(x) for x in input().split()]\r\na=set()\r\nfor i in range(n):\r\n a.update(input().split()[1:])\r\nif len(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nbulbs=[False]*m\r\nfor i in range(n):\r\n l=[int(x) for x in input().split()]\r\n j=1\r\n while(j<=l[0]):\r\n if not bulbs[l[j]-1]:\r\n bulbs[l[j]-1]=True\r\n j+=1\r\nfor k in range(m):\r\n if(not bulbs[k]):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,m=list(map(int,input().split()))\r\nl=[]\r\nlf=[]\r\nsi=set()\r\ns=set()\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n s.update(a[1:])\r\nfor i in range(1,m+1):\r\n lf.append(i)\r\nsi.update(lf)\r\nif s==si:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\n\nbulbs = set(range(1, m + 1))\nbuttons = [set(map(int, input().split()[1:])) for _ in range(n)]\n\nfor button in buttons:\n bulbs -= button\n \nif not bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t\t\t \t \t\t \t \t", "n,m=[int(x) for x in input().split()]\r\nbulbs=[]\r\nfor i in range (n):\r\n bulb=[int(x) for x in input().split()]\r\n for j in range(1,len(bulb)):\r\n bulbs.append(bulb[j])\r\nk=set(bulbs)\r\nif len(k)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "q=\"YES\"\r\na=input()\r\nb=a.split()\r\ns=int(b[1])\r\nt=[True for x in range(1,int(b[1])+1)]\r\ni=0\r\nwhile i!=int(b[0]):\r\n c=input()\r\n d=c.split()\r\n for j in range(1,len(d)):\r\n t[int(d[j])-1]=False\r\n i=i+1\r\nfor x in t:\r\n if x==True:\r\n q=\"NO\"\r\nprint(q)", "n,m=map(int,input().split())\r\nlis=[]\r\nfor i in range(n):\r\n nlis=list(map(int,input().split()))\r\n for j in range(int(nlis[0])):\r\n if nlis[j+1] not in lis:\r\n lis.append(nlis[j+1])\r\nif len(lis)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,m):\r\n l.append(i)\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n for i in range(0,a[0]):\r\n l[a[i+1]-1]=-1\r\nif l.count(-1)==len(l):\r\n print('YES')\r\nelse:\r\n print('NO')", "a, b = map(int,input().split())\r\nc= []\r\n\r\nfor i in range(a):\r\n d = list(map(int,input().split()))\r\n for i in d[1:]:\r\n c.append(i)\r\ne = list(set(c))\r\nif len(e)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\nSTATE = [0]*(m+1)\r\nfor i in range (n):\r\n S = [int (x) for x in input().split()]\r\n for j in range(1,S[0]+1):\r\n STATE[S[j]]=1\r\nsb = 0 \r\nfor i in range (1,m+1):\r\n if STATE[i]==0:\r\n sb=1\r\nif (sb==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m =map(int,input().split())\ndic={}\nfor i in range(n):\n lst=list(map(int,input().split()))\n for x in range(1,len(lst)):\n if lst[x] not in dic:\n dic[lst[x]]=1\n else:\n dic[lst[x]]+=1\nif len(dic)==m:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t \t \t\t\t \t \t \t \t\t\t\t \t\t", "\r\nn,m=map(int,input().split())\r\nbulbs=[\"0\"]*m\r\nbutt=[]\r\nfor i in range(n):\r\n butt=input().split()\r\n del butt[0]\r\n for k in butt:\r\n bulbs[int(k)-1]=\"1\"\r\nprint(\"YES\"if bulbs.count(\"0\")==0 else \"NO\")", "a,b=map(int,input().split())\r\nc=[0]*b\r\nfor i in range(a):\r\n d=list(map(int,input().split()))\r\n for i in range(d[0]):\r\n c[d[i+1]-1]+=1\r\nif c.count(0):\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\nans=list()\r\nans=[0 for i in range(m)]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n ans[l[j]-1]=1\r\nflag=1\r\nfor i in range(m):\r\n if ans[i]==0:\r\n flag=0\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,l[0]+1):\r\n lst.append(l[j])\r\nlst=set(lst)\r\nif len(list(lst))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = map(int, input().split())\r\nbulb = []\r\naim = []\r\nopen = {}\r\nfor i in range(m):\r\n aim.append(i+1)\r\n open[i+1] = 0\r\nfor i in range(n):\r\n bulb.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(1,bulb[i][0]+1):#最后一个数字的指针是bulb[i][0]，因此需要+1\r\n if bulb[i][j] in open.keys():\r\n open[bulb[i][j]] += 1\r\nif 0 in open.values():\r\n print('NO')\r\nelse:\r\n print('YES')", "def f(dict):\r\n for i in dict.keys():\r\n if dict[i]==0:\r\n return 'NO'\r\n return 'YES'\r\nn,m=[int(i) for i in input().split()]\r\nx={}\r\nfor i in range(1,m+1):\r\n x[i]=0\r\nfor i in range(1,n+1):\r\n a=[int(i) for i in input().split()]\r\n for j in range(1,a[0]+1):\r\n x[a[j]] += 1\r\nprint(f(x))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Nov 9 14:51:25 2020\r\n\r\n@author: pinky\r\n\"\"\"\r\n\r\nn,m=[int(x) for x in input().split()]\r\nloca=set()\r\nfor i in range (n):\r\n a=[int(x) for x in input().split()]\r\n l=len(a)\r\n s=set(a[1:l])\r\n loca=loca.union(s)\r\nif len(loca)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=[int(x) for x in input().split()]\r\na=[0]*m\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n for i in range(1,len(b)):\r\n c=b[i]\r\n a[c-1]=1\r\nif sum(a)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a , b = map(int,input().split())\nc = []\nfor i in range (a):\n lst = list(input().split())\n for d in range (1,len(lst)):\n if lst[d] not in c:\n c.append(lst[d])\nif len(c) == b :\n print('YES')\nelse:\n print('NO')\n\t\t\t\t \t \t\t \t \t \t \t", "n, m = map(int,input().split())\r\nlis=[0]*m\r\nfor i in range(n):\r\n templist=list(map(int,input().split()))\r\n for j in templist[1::]:lis[j-1]+=1\r\nfor i in range(m):\r\n if(lis[i]==0):\r\n print(\"NO\")\r\n break\r\nelse:print(\"YES\")", "n,m=list(map(int,input().split()))\r\nlight=[0]*m\r\nfor i in range(n):\r\n x=list(map(int, input().split()))\r\n for j in range(x[0]):\r\n light[x[j+1]-1] = 1\r\nif sum(light) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\narr1=[int(i) for i in range(1,m+1)]\r\nl=[]\r\nfor i in range(n):\r\n arr=[int(z) for z in input().split()]\r\n for x in arr[1:]:\r\n if x not in l:\r\n l.append(x)\r\nl.sort()\r\nif arr1==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "x,y= map(int,input().split())\r\nb=set()\r\nfor i in range (x):\r\n a = input().split()\r\n for j in a[1:]:\r\n b.add(j)\r\nif y == len(b):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\nb = set()\r\nfor i in range(n):\r\n la = [int(x) for x in input().split()]\r\n for j in la[1:]:\r\n b.add(j)\r\nif len(b)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = [int(x) for x in input().split()]\r\nList1 = [i for i in range(1,m+1)]\r\nfor i in range(n):\r\n List = [int(x) for x in input().split()]\r\n x = List[0]\r\n for j in range(1,x+1):\r\n if List[j] in List1:\r\n List1.remove(List[j])\r\nif len(List1) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\n\r\nn,m = map(int,input().split())\r\nUnion = set()\r\nfor i in range(n):\r\n L = input().split()\r\n t = int(L[0])\r\n s = {int(L[i]) for i in range(1,t+1)}\r\n Union = Union | s\r\nif Union == {i+1 for i in range(m)}:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n ", "n,m=[int(x) for x in input().split()]\r\ns=[0]*m\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n for i in range(1,len(x)):\r\n s[x[i]-1]=1\r\nif 0 in s:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\nw=set()\r\nq=set(str(s) for s in range(1,m+1))\r\nfor _ in range(n):\r\n a=[str(i) for i in input().split()]\r\n for b in a[1:]:\r\n w.add(b)\r\nif w==q:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nx=[]\r\nfor i in range(n):\r\n x += list(map(int, input().split()))[1:]\r\nprint('YES' if len(set(x)) == m else 'NO')", "n,m=map(int,input().split())\r\nseen=set()\r\nfor _ in range(n):\r\n a=list(map(int,input().split()))\r\n a=a[1:]\r\n for el in a:\r\n seen.add(el)\r\nprint(\"YES\" if len(seen)==m else \"NO\")\r\n ", "y=input()\nnm=[int(i) for i in y.split()]\nn=nm[0]\nm=nm[1]\nB=set()\ntr=False\nfor i in range(n):\n x=input()\n l=[i for i in x.split()]\n l.remove(l[0])\n B.update(l)\n if len(B)==m:\n tr=True\n \nif tr:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t\t\t \t \t \t \t \t \t\t\t", "n,m = [int(x) for x in input().split()]\r\nswitch = [False] * (m + 1)\r\ncnt = 0\r\nfor loops in range(n):\r\n button = [int(x) for x in input().split()]\r\n for bulb in range(1,len(button)):\r\n if switch[button[bulb]] == False:\r\n switch[button[bulb]] = True\r\n cnt += 1\r\nif(cnt == m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "e=[]\r\nn,m=map(int,input().split())\r\nfor a in range(0,n):\r\n b=list(map(int,input().split()))\r\n d=b[1:]\r\n e=e+d\r\n#print(d)\r\n#print(e)\r\n#print(set(e))\r\nc=set(range(1,m+1))\r\n#print(c)\r\nif set(e)==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m =map(int,input().split())\nst = set()\nfor i in range(n):\n lst=list(map(int,input().split()))\n for j in range(1, lst[0]+1):\n st.add(lst[j])\n \nif len(st)==m:\n print('YES')\nelse:\n print('NO')\n\t \t \t\t \t\t\t\t \t \t \t\t\t\t\t", "a,b=map(int,input().split())\r\nc=[]\r\ni=1\r\nwhile i<=a:\r\n w=list(map(int,input().split()))\r\n del w[0]\r\n for m in w:\r\n if m not in c:\r\n c.append(m)\r\n i=i+1\r\nif len(c)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\non = set()\r\nfor _ in range(n):\r\n on.update(input().split()[1:])\r\nprint(['NO','YES'][len(on)==m])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 5 07:54:29 2020\r\n\r\n@author: 17831\r\n\"\"\"\r\n\r\nn,m = [int(x) for x in input().split()]\r\nset1 = set()\r\n\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\n for j in range(1,len(a)):\r\n set1.add(a[j])\r\n\r\nb = (m*(1+m))/2\r\nif b == sum(set1):\r\n print('YES')\r\nelse:\r\n print('NO')", "io = input().split()\r\n\r\nn = int(io[0])\r\nm = int(io[1])\r\n\r\non = [False] * m\r\n\r\nfor i in range(n):\r\n buttons = list(map(int, input().split()))\r\n buttons.pop(0)\r\n for j in range(1, m + 1):\r\n if j in buttons:\r\n on[j - 1] = True\r\n\r\nif all(on):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nbulbs=set()\r\nfor _ in range(n):\r\n inp=list(map(int,input().split()))\r\n bulb=set(inp[1:])\r\n bulbs=bulbs.union(bulb)\r\nif len(bulbs)==m:\r\n print('YES')\r\nelse: print('NO')", "n,m=map(int,input().split())\nset={}\nfor i in range(n):\n lst=list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in set:\n set[lst[j]]=1\nif len(set)==m:\n print('Yes')\nelse:\n print('No')\n\n\n \t\t \t \t \t \t\t \t\t\t \t \t\t\t \t \t", "import sys\nnbut, nbulb = list(map(int, sys.stdin.readline().split()))\n\nbulblist = set(range(1, nbulb+1))\n\n#print(bulblist)\n\nfor n in range(nbut):\n tmp = list(map(int, sys.stdin.readline().split()))\n tmp.pop(0)\n tmp = set(tmp)\n for a in tmp:\n bulblist.discard(a)\nif len(bulblist) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t\t \t\t\t \t\t\t \t", "n,m=map(int,input().split())\r\ndic = [0]*m\r\nfor _ in range(n):\r\n tmp = list(map(int,input().split()))\r\n for i in range(1,len(tmp)):\r\n dic[tmp[i]-1]=1\r\nif 0 in dic:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "set0 = set()\r\nn, m = map(int, input().split())\r\nfor i in range(0, n):\r\n set0 = set0 | set(list(map(int, input().split()))[1:])\r\nif len(set0) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\ns = set()\nflag = True\nfor i in range(n):\n q = list(map(int,input().split()))\n for j in range(1,q[0]+1):\n s.add(q[j])\n\n\nfor i in range(1,m+1):\n if i not in s:\n flag = False\n\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t \t\t \t \t \t\t\t \t \t \t\t \t \t\t\t", "n,m=map(int,input().split())\r\nans=[0 for i in range(m)]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n for j in range(1,a[0]+1):\r\n ans[a[j]-1]=1\r\nprint(\"YES\"if ans.count(0)==0 else\"NO\")\r\n", "def main():\n bulbs = int\n inputs = str\n inputs = input()\n inputs = inputs.split()\n buttons = inputs[0]\n bulbs = inputs[1]\n button_cap = \"\"\n for _ in range(1, int(buttons)+1):\n button_cap += (input()[2:])+\" \"\n button_cap = button_cap.split()\n button_cap = set(button_cap)\n\n for y in range(1, int(bulbs)+1):\n if str(y) not in button_cap:\n print(\"NO\")\n return 0\n print(\"Yes\")\n\nmain()\n\t \t\t\t\t\t\t\t \t\t\t\t\t \t \t\t \t \t", "n,m=map(int, input().split())\r\nans=[]\r\nfor i in range(n):\r\n li=[i for i in input().split()]\r\n del li[0]\r\n ans.extend(j for j in li)\r\n\r\nif len(set(ans))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nbulbs = [1 for x in range(m)]\r\nfor i in range(n):\r\n digits = [int(x) for x in input().split()]\r\n del digits[0]\r\n for digit in digits:\r\n bulbs[digit - 1] = 0\r\nif sum(bulbs) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=[int(x) for x in input().split()]\r\na=[1]*m\r\nfor i in range(n):\r\n b=[int(x) for x in input().split()]\r\n for j in range(b[0]):\r\n a[b[j+1]-1]=0\r\nprint(['YES','NO'][sum(a)!=0])", "n,m=map(int, input().split())\r\nyij=[]\r\nfor i in range(n):\r\n bulbs=input().split()\r\n yij+=(bulbs[1:])\r\nif len(set(yij))==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = [int(x) for x in input().split()]\r\nturn_on = set()\r\nfinal = set(range(1,m+1))\r\nfor _ in range(n):\r\n l = [int(x) for x in input().split()]\r\n s = set(l[1:])\r\n turn_on = turn_on.union(s)\r\nif turn_on == final:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n,m=map(int, input().split())\r\ns=[]\r\nfor _ in range(n):\r\n a=[int(i) for i in input().split()]\r\n a.pop(0)\r\n for j in a:\r\n if j not in s:\r\n s.append(j)\r\nif len(s)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "\nn, m = map(int,input().split())\na = dict()\n\nfor i in range(m):\n a[i+1] = 0\n\nfor i in range(n):\n temp = list(map(int, input().split()))\n x = temp[0]\n for j in range(1,len(temp)):\n y = temp[j]\n a[y] = 1\n\nflag = 0\nfor i in range(1,m+1):\n if a[i] == 0:\n flag = 1\n\n\nif flag != 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t\t \t \t \t\t\t\t \t \t \t \t\t\t\t \t\t\t", "def solve(n,m,l):\r\n x = []\r\n for i in l:\r\n firstSkip = False\r\n for j in i:\r\n if not firstSkip:\r\n firstSkip = True\r\n continue\r\n x.append(j)\r\n # print(x,l)\r\n if len(set(x)) == m:\r\n return \"YES\"\r\n return \"NO\"\r\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nprint(solve(n,m,l))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 18 19:01:34 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\ncombined = []\r\nfor i in range (n):\r\n xi = input().split()\r\n lights = xi[1:]\r\n #print(lights)\r\n combined += lights \r\n#print(combined)\r\n\r\n final = list(dict.fromkeys(combined))\r\n#print(final)\r\norderfinal = sorted(final)\r\n#print(orderfinal)\r\n\r\nif len(orderfinal) == m:\r\n#len(list) gives the number of elements in a list\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n'''\r\nx = 0\r\nprint(orderfinal[x], x)\r\nif orderfinal[x] == x+1:\r\n print(orderfinal[x], x)\r\n x += 1\r\n if x == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\", x, n)\r\n'''", "n,m=map(int,input().split())\r\nlista=[0]*m\r\nlistb=[]\r\nfor i in range(n):\r\n listb=list(input().strip().split())\r\n listb=[int(x) for x in listb]\r\n for j in listb[1:]:\r\n lista[j-1]=1\r\nif sum(lista)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "nm = tuple(map(int,input().split()))\r\nbulbs = list(map(int,('1 '*nm[1]).split()))\r\nfor i in range(nm[0]):\r\n button = list(map(int,input().split()))\r\n for j in range(1,button[0]+1):\r\n bulbs[button[j]-1] *= 0\r\nif sum(bulbs) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 5 08:30:46 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nm,n=map(int,input().split())\r\nx=0\r\nl=[]\r\nwhile m:\r\n m-=1\r\n l1=input().split()\r\n l1.remove(l1[0])\r\n l+=l1\r\nfor i in range(1,n+1):\r\n if str(i) not in l:\r\n x+=1\r\nif x==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n s.update(input().split()[1:])\r\n \r\nprint(['NO','YES'][len(s)==m])", "n, m = map(int, input().split())\ns = set()\nfor _ in range(0, n):\n x, *v = map(int, input().split())\n s |= set(v)\nif len(s) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, m = map(int,input().split())\r\n\r\nincontrol = []\r\nfor _ in range(n):\r\n button = input().split()\r\n for i in range(1,len(button)):\r\n incontrol.append(button[i])\r\n \r\nincontrol = set(incontrol)\r\n\r\nif len(incontrol) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "x, y = [int(x) for x in input().split()]\r\nlst = []\r\nlst.extend(range(1,y+1))\r\nc = []\r\n\r\nfor i in range(x):\r\n b = [int(x) for x in input().split()]\r\n c.extend(b[1::])\r\n for d in c:\r\n if d in lst:\r\n lst.remove(d)\r\n \r\n\r\nif len(lst) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "m,n=[int(x) for x in input().split()]\r\na=list()\r\nfor i in range(m):\r\n x=[int(j) for j in input().split()]\r\n del x[0]\r\n for i in x:\r\n a.append(i)\r\nif set(a)==set(range(1,n+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=[int(x)for x in input().split()]\r\nempty=set()\r\nfor i in range(n):\r\n a=[int(y)for y in input().split()]\r\n for j in a[1:]:\r\n empty.add(j)\r\nnumber=len(empty)\r\nif number!=m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split(' '))\r\ns=set(range(1,m+1))\r\nfor i in range(n):\r\n l=list(map(int,input().split(' ')))\r\n del l[0]\r\n ls=set(l)\r\n s=s-ls\r\nif len(s)==0:\r\n print('YES')\r\nelif len(s)>0:\r\n print('NO')", "m,t = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n a = input().split()\r\n a.remove(a[0])\r\n l+=a\r\nprint(\"YES\" if len(set(l))==t else \"NO\")", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\na = 0\r\nd = {}\r\nfor i in range(n):\r\n x = [int(xx) for xx in input().split()]\r\n for j in range(1,len(x)):\r\n if x[j] not in d:\r\n d[x[j]]=1\r\n a+=1\r\nif a==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=set()\r\nfor j in range(n):\r\n for i in list(input().split())[1:]:\r\n a.add(int(i))\r\nprint((a==set(range(1,1+m)))*\"YES\"+(1-(a==set(range(1,m+1))))*\"NO\")", "n,m=map(int,input().split())\r\nw=list(range(1,m+1))\r\ny=[]\r\nfor i in range(n):\r\n x=input().split()\r\n del x[0]\r\n x=map(int,x)\r\n for i in x:\r\n y.append(i)\r\n \r\nif len(set(y)) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nli = []\r\nfor i in range(n):\r\n s = [int(i) for i in input().split()]\r\n s.remove(s[0])\r\n li += s\r\nif len(set(li)) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nmyBulb=[]\r\nfor i in range(n):\r\n arr=list(map(int,input().split()))\r\n myBulb+=arr[1:]\r\n\r\ncheckConn=True\r\n\r\nfor k in range(1,m+1):\r\n if(k not in myBulb):\r\n print('NO')\r\n checkConn=False\r\n break\r\nif(checkConn==True):\r\n print('YES')\r\n\r\n\r\n ", "n,m=map(int,input().split())\r\ns_total=[]\r\nfor i in range(n):\r\n l=[int(x)for x in input().split()]\r\n del(l[0])\r\n s_total.extend(l)\r\ns=set(s_total)\r\nx=True\r\ni=1\r\nwhile i<=m:\r\n if i not in s:\r\n x=False\r\n break\r\n i+=1\r\nif x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split(' ')) # n = the number of buttons; m = the number of bulbs\r\noperation = []\r\nfor i in range(n):\r\n operation += (list(map(int,input().split(' ')[1:])))\r\n\r\nbulbs = set(operation)\r\n\r\nfor i in range(1, m+1):\r\n if i not in bulbs:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\nc=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n b=a[1:]\r\n b=list(set(b))\r\n for i in b:\r\n if i not in c:\r\n c.append(i)\r\nif(len(c)==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = [int(x) for x in input().split()]\r\nbulbs = set()\r\nfor _ in range(n):\r\n bulbs.update(input().split()[1:])\r\nprint('YES' if len(bulbs) == m else 'NO')", "n, m = input().split() # n number of buttons and m number of bulbs\nn, m = [int(n), int(m)]\non = [] # all bulbs that can be turned on\nfor _ in range(n):\n i, *a =map(int,input().split(' '))\n on.extend(a)\nchecker = {i for i in range(1,m+1)}\nif checker == set(on):\n print(\"YES\")\nelse:\n print(\"NO\")", "button,bulbs=map(int,input().split())\r\na=dict()\r\nb=[]\r\nfor ti in range(button):\r\n b=[int(i) for i in input().split()]\r\n del b[0]\r\n for i1 in b:\r\n a[i1]=1\r\n b=[]\r\ns=sum(a.values())\r\nif s==bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n\tl2=list(map(int,input().split()))[1:]\r\n\tl.extend(l2)\r\nl=list(set(l))\r\nif len(l)==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\nbulb_states = [0] * m\r\n\r\nfor _ in range(n):\r\n button_info = list(map(int, input().split()))\r\n bulbs = button_info[1:]\r\n for bulb in bulbs:\r\n bulb_states[bulb - 1] = 1\r\n\r\nif all(bulb_states):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nc=set(range(1,b+1))\r\ne=set()\r\nfor i in range(a):\r\n d=[int(j) for j in input().split()]\r\n d.pop(0)\r\n d=set(d)\r\n e=e.union(d)\r\nprint('YES' if e==c else 'NO')", "n, m = map(int, input().split())\r\nb = [False]*m\r\nfor _ in range(n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b[int(j)-1] = True\r\nprint(['NO', 'YES'][b == [True]*m])\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n *i,=map(int,input().split())\r\n for x in i[1:]:\r\n l.append(x)\r\nif len(set(l))==m:print('YES')\r\nelse: print('NO')", "n, m = map(int, input().split())\r\narr = [0] * m\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for x in a[1:]:\r\n x -= 1\r\n arr[x] = 1\r\n\r\nif arr.count(0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, m = map(int, input().split())\r\nbulb_set = set()\r\nfor i in range(n):\r\n x = [int(j) for j in input().split()]\r\n del x[0]\r\n bulb_set.update(x)\r\nprint(['NO', 'YES'][len(bulb_set) == m])\r\n", "a=list(int(i) for i in(input().split()))\r\nn=a[0]\r\nm=a[1]\r\ny=[]\r\nb=[]\r\nfor i in range(n):\r\n\tx=list(input().split())\r\n\tfor i in range(1,int(x[0])+1):\r\n\t\ty.append(x[i])\r\nfor i in range(1,m+1):\r\n\tif str(i) not in set(y):\r\n\t\tb.append(i)\r\nif len(b)!=0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "a = list(map(int,input().split()))\r\nlist_1 = []\r\nfor i in range(a[0]):\r\n x = input().split()\r\n for j in x[1:]:\r\n if j not in list_1:\r\n list_1.append(j)\r\nif len(list_1) == a[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n lis = input().split()\r\n s = s|set(lis[1:])\r\nif len(s) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\np=[]\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n for i in range(1,l[0]+1):\r\n p.append(l[i])\r\nx=set(p)\r\nif len(x)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n t = list(map(int,input().split()))\r\n del t[0]\r\n for j in range(len(t)):\r\n l.append(t[j])\r\nl = list(set(l))\r\nif len(l) == m :\r\n print('YES')\r\nelse:\r\n print('NO')", "m,n=map(int,input().split())\r\nlamp=[1]*n\r\nfor _ in range(m):\r\n y=list(map(int,input().split()))\r\n for j in y[1:]:\r\n lamp[j-1]=0\r\nprint(['NO','YES'][sum(lamp)==0])", "n,m=input().split()\r\nl=[]\r\nb=0\r\nfor i in range(int(n)):\r\n a=input().split()\r\n for k in range(1,int(a[0])+1):\r\n l.append(a[k])\r\nc=list(set(l))\r\nfor d in range(1,int(m)+1):\r\n if str(d) in c:\r\n b+=1\r\nif b==int(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\ncheck=set()\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n for j in range(1,len(x)):\r\n check.add(x[j])\r\nif len(check)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nuser_input = sys.stdin.read()\ntoks = user_input.split('\\n')\n\nfirst_line = toks[0].split(' ')\nnum_buttons = int(first_line[0])\nnum_bulbs = int(first_line[1])\n\non_bulbs = set()\nfor line in toks[1:]:\n bulbs = line.split(' ')[1:]\n \n for bulb in bulbs:\n on_bulbs.add(bulb)\n\nprint('YES' if len(on_bulbs) == num_bulbs else 'NO')\n \t\t\t \t\t \t \t\t\t\t \t\t\t\t\t \t\t\t", "n, m = map(int, input().split())\r\nbulb = [0 for i in range(m)]\r\nz = 0\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n y = x[0]\r\n for j in range(1, y+1):\r\n bulb[x[j]-1] += 1\r\nfor i in range(m):\r\n if bulb[i] == 0:\r\n z = 1\r\nif z == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\nlt=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,l[0]+1):\r\n lt.append(l[j])\r\nlt=set(lt)\r\nif len(list(lt))==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=[int(x)for x in input().split()]\r\nlight=[]\r\nfor i in range(n):\r\n li=[int(x)for x in input().split()]\r\n light=light+li[1:]\r\nlight=set(light)\r\nl=len(light)\r\nif l==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n s.add(l[j])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a,b=map(int,input().split())\r\nk=set()\r\nfor i in range(a):\r\n l=list(map(int,input().split()))\r\n l.remove(l[0])\r\n k=k|set(l)\r\nif len(k)==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int, input().split()) #the number of buttons and the number of bulbs.\r\nOn=set()\r\nfor i in range(n):\r\n tem= [ x for x in input().split()]\r\n del tem[0]\r\n for j in tem:\r\n On=On|{j}\r\nprint(\"YES\" if len(On)==m else \"NO\")", "n,m=map(int,input().split())\r\nallbulbs=[]\r\nfor i in range(n):\r\n origin=[int(x) for x in input().split()]\r\n openbulbs=set(origin[1:])\r\n allbulbs+=openbulbs\r\nif len(set(allbulbs))<m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m = map(int,input().split())\r\nb = []\r\nfor x in range(n):\r\n a = [int(i) for i in input().split()]\r\n b += a[1:a[0]+1]\r\nb.sort()\r\ncount=0\r\nfor i in range(1,m+1):\r\n if i in b:\r\n continue\r\n else:\r\n count+=1\r\nif count==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=[]\r\ns=set()\r\nfor i in range(n):\r\n a.append([x for x in input().split()])\r\n del(a[i][0])\r\n s=s|set(a[i])\r\nprint(\"YES\" if len(s)==m else \"NO\")\r\n", "a, b = map(int, input().split())\nansl = []\nfor i in range(a):\n c = list(map(int, input().split()))\n for i in range(1, c[0]+1):\n ansl.append(c[i])\nansl = list(dict.fromkeys(ansl))\nif len(ansl) == b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t \t\t\t \t \t \t\t\t \t\t\t", "S=[int(x) for x in input().split()]\r\nK={0}\r\nfor x in range(S[0]):\r\n\tQ={int(x) for x in input().split()[1:]}\r\n\tK.update(Q)\r\n\r\nK_0={0}\r\nfor y in range(S[1]+1):\r\n\tK_0.update({y})\r\nif K_0==K:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n, m = map(int, input().split())\nz =[]\nwhile n > 0:\n z += [*map(int, input().split())][1:]\n z_0 = set(z); z = list(z_0)\n n -= 1\nif len(z) >= m:\n print('YES')\nelse:\n print('NO')", "n, m = map(int, input().split())\r\ns1 = set()\r\nfor i in range(1,m+1):\r\n s1.add(i)\r\ns = set()\r\nfor i in range(n):\r\n lia = (list(map(int, input().split())))[1:]\r\n s.update(lia)\r\nif s == s1:\r\n print('YES')\r\nelse:\r\n print('NO')", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn,m=map(int,input().split())\nk=set(range(1,m+1))\nfor _ in range(n):\n a,*b=map(int,input().split())\n for i in b:\n if i in k:\n k-={i}\nif len(k)==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "n,m = map(int, input() .split())\r\nx=[]\r\ns = set()\r\nfor i in range(n):\r\n x += [list(map(int, input() .split()))]\r\n x[i][0] = 'i'\r\nfor i in range(n):\r\n for j in range(1,len(x[i])):\r\n s.add(x[i][j])\r\nif len(s) == m:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n,m=map(int,input().split())\r\nstate=[0]*m\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(1,len(l)):\r\n state[l[j]-1]=1\r\nif 0 in state:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "buttons, bulbs = map(int, input().split())\r\nlis = []\r\ntarget = list(range(1,bulbs+1))\r\nfor i in range(buttons):\r\n m = [int(x) for x in input().split()]\r\n del m[0]\r\n lis = set(lis).union(set(m))\r\nlist(lis).sort\r\nif list(lis) == target:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\ndic = {}\nfor i in range(n):\n lst = list(map(int, input().split()))\n for j in range(1, len(lst)):\n if lst[j] not in dic:\n dic[lst[j]] = 1\n else:\n dic[lst[j]] += 1\nif len(dic) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t\t\t \t \t\t \t", "n, m = map(int, input().split())\r\nbulbs=set()\r\nfor x in range(n):\r\n bulbs.update(input().split()[1:])\r\nprint(['NO','YES'][len(bulbs)==m])", "n,m = list(map(int, input().split()))\r\ntemp = [i for i in range(1, m+1)]\r\nlst = set()\r\nfor i in range(n):\r\n x = list(map(int, input().split()))\r\n ans = x[1:]\r\n for i in ans:\r\n lst.add(i)\r\nfor i in temp:\r\n if i not in lst:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "import sys\r\n\r\nn, m = (int(el) for el in input().split())\r\nans = [False for el in range(m)]\r\nfor i in range(n):\r\n a = [int(el) for el in input().split()]\r\n for j in range(1, a[0] + 1):\r\n ans[a[j] - 1] = True\r\n \r\nfor i in range(m):\r\n if ans[i] == False:\r\n print(\"NO\")\r\n sys.exit()\r\n \r\nprint(\"YES\")", "a, b = map(int, input().split())\r\nc = set()\r\nfor i in range(a):\r\n c.update(input().split()[1:])\r\nprint(['NO','YES'][len(c)==b])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 3 13:59:01 2020\r\n\r\n@author: hanks\r\n\"\"\"\r\n\r\nn,m=[int(x) for x in input().split()]\r\nl=[1]*m\r\nfor x in range(n):\r\n lx=[int(x) for x in input().split()]\r\n for i in range(lx[0]):l[lx[i+1]-1]=0\r\nprint(['YES','NO'][sum(l)!=0])", "n, m = map(int,input().split())\r\nnotonbulbs = [i for i in range(1,m+1)]\r\nfor i in range(n):\r\n temp = input().split()\r\n for j in range(1,len(temp)):\r\n if int(temp[j]) in notonbulbs:\r\n notonbulbs.remove(int(temp[j]))\r\nprint('YES' if len(notonbulbs) == 0 else 'NO')", "n,m=map(int,input().split())\r\ntotal=[]\r\nfor i in range(n):\r\n total+=input().split()[-1:0:-1]\r\n #i.e. total.extend(input().split()[-1:0:-1])\r\nprint([\"NO\",\"YES\"][len(set(total))==m])\r\n", "n,m=map(int,input().split())\r\nmat=[]\r\nfor _ in range(n):\r\n mat.append(list(map(int,input().split()))[1:])\r\ns=set()\r\nfor l in mat:\r\n for e in l:\r\n s.add(e)\r\nif len(s)==m:print(\"YES\")\r\nelse:print(\"NO\")", "n,m=[int(x) for x in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n s.update(input().split()[1:])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nonlights=set()\r\nfor x in range(n):\r\n lights=[int(y) for y in input().split()][1:]\r\n for y in lights:\r\n onlights=onlights|{y}\r\nprint([\"NO\",\"YES\"][len(onlights)==m])", "n,m=map(int,input().split())\r\na = set()\r\nfor _ in range(n):\r\n a.update(input().split()[1:])\r\nprint(['NO','YES'][len(a)==m])", "n, m = map(int, input().split())\r\n\r\nx = []\r\n\r\noutput = []\r\n\r\nfor i in range(n):\r\n x.append([int(k) for k in input().split()])\r\n\r\nfor i in x:\r\n i.remove(i[0])\r\n for j in i:\r\n if j not in output:\r\n output.append(j)\r\n\r\nif len(output) >= m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\nall_light = list(range(1,m+1))\r\nfor butter in range(n):\r\n light = list(map(int,input().split()))\r\n light.pop(0)\r\n for i in light:\r\n if i in all_light:\r\n all_light.remove(i)\r\nif len(all_light)== 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=(m*(m+1))//2\r\nli=[]\r\nfor i in range(n):\r\n li += list(map(int, input().split()))[1:]\r\nprint('YES' if len(set(li)) == m else 'NO')", "n,m=[int(x) for x in input().split()]\r\narr=[0]*m\r\nstr=[]\r\nfor _ in range(n):\r\n str=[int(x) for x in input().split()]\r\n for i in range(1,len(str)):\r\n arr[str[i]-1]=1\r\nf=1\r\n\r\nfor i in range(m):\r\n if arr[i]==0:\r\n f=0\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m, n=map(int, input().split()) \r\ns=set() \r\nfor _ in range(m): \r\n a=list(map(int, input().split())) \r\n for i in range(1,len(a)): \r\n s.add(a[i]) \r\nprint(\"YNEOS\"[len(s)!=n:: 2]) ", "x,y=map(int,input().split())\r\na=set()\r\nfor i in range(0,x,1) :\r\n s=list(map(int,input().split()))\r\n for j in range(1,len(s),1) :\r\n a.add(s[j])\r\nif set(range(1,y+1,1))==a :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n b = [int(x) for x in input().split()]\r\n del b[0]\r\n a = set(a).union(set(b))\r\nif set(a) == set(range(1, m + 1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\nn,m=input().split()\nn=int(n);m=int(m)\nb=[0]*101\nfor i in range(n):\n a=list(map(int,input().split()))\n for j in range(1,a[0]+1):\n b[a[j]]=1\nfor i in range(1,m+1):\n if(not b[i]):\n print(\"NO\")\n sys.exit(0)\nprint(\"YES\")", "n, m = map(int, input().split())\r\ns, a = [], 0\r\nfor i in range(n):\r\n lst = input().split()\r\n for k in range(1, len(lst)):\r\n s.append(lst[k])\r\nfor j in range(1, m + 1):\r\n if str(j) not in s:\r\n a = 1\r\n break\r\nif a == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n\tl=list(map(int,input().split()))\r\n\tl=l[1:]\r\n\ts.update(set(l))\r\nif len(s)==m:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "temp = [int(x) for x in input().split()]\nx = set()\nfor _ in range(temp[0]):\n temp2 = [int(x) for x in input().split()]\n for i in temp2[1:]:\n x.add(i)\nif len(x) == temp[1]:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = []\r\nb = 0\r\nx = input().split()\r\nx = [int(x[i]) for i in range(len(x))]\r\nn,m = x\r\nfor i in range(n):\r\n y = input().split()\r\n y = [int(y[i]) for i in range(len(y))]\r\n y.remove(y[0])\r\n for i in y:\r\n a.append(i)\r\nfor i in range(1,m+1):\r\n if i in a:\r\n b += 1\r\nif b < m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n l = list(map(int,input().split()))[1:]\r\n for val in l:\r\n s.add(val)\r\nif len(s)!=m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(a):\r\n\tk=list(map(int,input().split()))\r\n\tfor i in k[1::]:\r\n\t\tl.append(i)\r\nprint(['NO','YES'][len(set(l))==b])\t\r\n", "n, m = map(int, input().split())\r\nbulbs = set()\r\nfor _ in range(n):\r\n row = list(map(int, input().split()))\r\n row.pop(0)\r\n for element in row:\r\n bulbs.add(element)\r\nprint('YES' if bulbs == set(range(1, m + 1)) else 'NO')\r\n", "n,m=map(int,input().split())\r\ns=[]\r\nnum=0\r\nfor i in range(n):\r\n new=list(str(input()).split())\r\n new=[int(i) for i in new]\r\n num+=int(new[0])\r\n newtoadd=new[1:]\r\n s+=newtoadd\r\nresult=\"NO\"\r\nfor i in range(m):\r\n if i+1 not in s:\r\n result=\"NO\"\r\n break\r\n else:\r\n result=\"YES\"\r\nprint(result)", "n,m = [int(x) for x in input().split()]\r\na = []\r\nflag = 0\r\nfor _ in range(n):\r\n b = [int(x) for x in input().split()]\r\n for i in range(1,b[0]+1):\r\n a.append(b[i])\r\nif len(set(a))<m:\r\n print('NO')\r\nelse:\r\n print('YES')", "switch, bulbs=map(int, input().split()) \r\non=[]\r\n\r\nfor _ in range(switch):\r\n\tl=list(map(int, input().split()[1:]))\r\n\ton+=l\r\non=list(set(on))\r\n\r\n\r\nif len(on)!=bulbs:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\t", "n,m=map(int,input().split())\r\ns=[]\r\nfor _ in range(n):\r\n s.extend(list(map(int,input().split()))[1:])\r\nif len(set(s))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nlines=[]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()][1:]\r\n lines+=s\r\nif len(set(lines))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr = [int(x) for x in input().split()]\n\nbuttons = arr[0]\nbulbs = arr[1]\n\nbulb_set = set()\nfor i in range(buttons):\n list1 = [int(x) for x in input().split()]\n if len(list1)>1:\n for j in list1[1:]:\n if j != 0:\n bulb_set.add(j)\n \nif len(bulb_set) == bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t \t\t \t\t\t\t\t \t\t\t\t\t\t\t", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl2=list(map(int,input().split()))[1:]\r\n\tl.extend(l2)\r\n# print(l)\r\nl=list(set(l))\r\n# print(*l)\r\nif m==len(l):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Oct 15 16:33:32 2022\n\n@author: calvinzhu\n\"\"\"\n\nn,m = [int(x) for x in input().split()]\nlight = []\n\nfor i in range(m):\n light.append(0)\n \n\nfor i in range(n):\n button = [int(x) for x in input().split(\" \")]\n for y in range(1,len(button)):\n light[button[y]-1] = 1\n\nif 0 in light:\n print(\"NO\")\nelse:\n print(\"YES\")", "buttons_num, bulbs_num = [int(i) for i in input().split(\" \")]\r\nbuttons_checked = set()\r\nbulb_set = set()\r\nfor i in range(buttons_num):\r\n statement = [int(i) for i in input().split(\" \")]\r\n if statement[0] not in buttons_checked:\r\n for j in range(1, len(statement)):\r\n bulb_set.add(statement[j])\r\nprint(\"YES\" if len(bulb_set) == bulbs_num else \"NO \")\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\ns = set()\r\n\r\nfor _ in range(n):\r\n a = [int(x) for x in input().split()]\r\n for x in a[1: ]:\r\n s.add(x)\r\n\r\nprint(\"YES\" if len(s) == m else \"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 15:47:40 2022\r\n\r\n@author: 帝落梦魂\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nbulbs = [0]*m\r\nfor i in range(0,n):\r\n on = [int(j) for j in input().split()]\r\n for k in range(0,on[0]):\r\n bulbs[on[k+1]-1] = 1\r\nif bulbs.count(0)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n , m = map(int,input().split())\r\nb = set()\r\nfor i in range (n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b.add(j)\r\nif m == len(b):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\ns = set()\r\nfor i in range(n):\r\n w = [int(x) for x in input().split()][1:]\r\n for j in w:\r\n s.add(j)\r\nif len(s) < m:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, m = [int(x) for x in input().split()]\r\na = [0]*m\r\nu = 0\r\nfor i in range(0,n):\r\n k = [int(x) for x in input().split()]\r\n for l in range(1,k[0]+1):\r\n a[k[l]-1] += 1\r\nfor j in range(0,m):\r\n if a[j] > 0:\r\n u += 1\r\nif u == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\ns = [0] * m\r\n\r\n# 将出现的数字设置为1\r\ni = 0\r\nwhile i < n:\r\n x = input()\r\n a = [int(i) for i in x.split()]\r\n j = 1\r\n while j <= a[0]:\r\n s[int(a[j]) - 1] = '1'\r\n j += 1\r\n i += 1\r\n\r\n# 判断所有灯是否都为1\r\ni = 0\r\nwhile i < m:\r\n if(s[i] != '1'):\r\n print('no')\r\n break\r\n if(i == m - 1):\r\n print('yes')\r\n i += 1\r\n", "buttons, bulbs = map(int, input() .split())\r\nstorage=[]\r\ns = set()\r\nfor i in range(buttons):\r\n storage += [list(map(int, input() .split()))]\r\n storage[i][0] = 'i'\r\nfor i in range(buttons):\r\n for j in range(1,len(storage[i])):\r\n s.add(storage[i][j])\r\nif len(s) == bulbs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "button,bulb=map(int,input().split())\r\no=set()\r\nfor i in range(button):\r\n o.update(input().split()[1:])\r\nprint(['NO','YES'][len(o) == bulb])", "n,k=map(int,input().split())\r\nl2=[0]*k\r\nfor i in range (n):\r\n l1=list(map(int,input().split()))\r\n a=l1.pop(0)\r\n for i in range (a):\r\n l2[l1[i]-1]+=1\r\nif(l2.count(0)>0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "but,line=map(int,input().split())\r\nbulb=[0]\r\nbulb=bulb*(line)\r\n\r\nfor k in range(but):\r\n li=list(map(int,input().split()))\r\n for i in li[1:]:\r\n bulb[i-1]=1\r\nprint('NO' if 0 in bulb else 'YES')", "n,m=map(int,input().split())\r\ns=set()\r\nfor i in range(n):\r\n r=list(map(int,input().split()))\r\n for j in range(r[0]):\r\n s.add(r[j+1])\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nl=[list(map(int,input().split())) for i in range(n)]\r\nl2=[]\r\nfor i in range(n):\r\n l2+=l[i][1:]\r\n\r\nif len(set(l2))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pieces = input().split()\r\nn, m = int(pieces[0]), int(pieces[1])\r\nlight = [False for i in range(m)]\r\n\r\nfor i in range(n):\r\n pieces = input().split()\r\n x = int(pieces[0])\r\n y = [int(pieces[j]) - 1 for j in range(1, x + 1)]\r\n for y1 in y:\r\n light[y1] = True\r\n\r\nif False not in light:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "button,bulb=map(int,input().split())\r\non=set()\r\nfor i in range(button):\r\n on.update(input().split()[1:])\r\nprint(['NO','YES'][len(on) == bulb])", "n,m=map(int,input().split())\r\nw=set()\r\nlast=set(i for i in range(1,m+1))\r\nfor b in range(n):\r\n a=[int(i) for i in input().split()]\r\n for c in a[1:]:\r\n w.add(c)\r\nif w==last:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 5 09:05:28 2020\r\n\r\n@author: 章斯岚\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\na=set()\r\nfor i in range(n):\r\n k=input().split()\r\n for x in k[1::]:\r\n a.add(int(x))\r\nb=set(range(1,m+1))\r\nif a==b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def solve():\r\n n,m = map(int, input().split())\r\n for i in range(n):\r\n s = list(map(int, input().split()))\r\n for j in s[1:]:\r\n a[j-1] = 1\r\n for i in range(m):\r\n if a[i] == 0:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n return\r\ntry:\r\n a = []\r\n for p in range(101):\r\n a.append(0)\r\n solve()\r\nexcept:\r\n pass", "n, m = [int(x) for x in input().split()]\r\nl = [0] * m\r\nfor i in range(n):\r\n li = [int(x) for x in input().split()]\r\n k = li[0]\r\n for j in range(k):\r\n l[li[j+1]-1] = 1\r\nif l.count(0) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\ndp=[0]*m\r\ns=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n d=l[0]\r\n for j in range(1,d+1):\r\n if dp[l[j]-1]==0:\r\n dp[l[j]-1]+=1\r\ns=sum(dp)\r\nif s==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nb=[0 for i in range(0, m+1)]\r\nfor i in range(0,n):\r\n \r\n a=[int(n) for n in input().split()]\r\n for x in a[1:]:\r\n b[x]=1\r\ns=0\r\nfor i in range(1,m+1):\r\n s+=b[i]\r\nif s==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\nres = []\nfor i in range(m + 1):\n res.append(0)\nfor i in range(1, n + 1):\n l = list(map(int, input().split()))\n for j in range(1, len(l)):\n res[l[j]] = 1\nflag = 1\nfor i in range(1, m + 1):\n if res[i] == 0:\n flag = 0\n break\nprint(\"YES\" if flag else \"NO\")", "n,m = map (int,input().split())\r\na = set()\r\nbulbx = []\r\nc = 0\r\nfor i in range(n):\r\n bulb = [int(x) for x in input().split()]\r\n bulbx = bulbx + bulb[1:]\r\n\r\nfor i in range(1,m+1):\r\n if i in bulbx:\r\n c = c+i\r\n\r\nif c == m*(m+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m,n=[int(x) for x in input().split()]\r\nset0 = set()\r\nset1 = set(str(i+1) for i in range(n))\r\nfor i in range(m):\r\n set0 = set0|set(input().split()[1:])\r\nprint(['YES','NO'][set0 != set1])", "n,m = map(int, input().split())\r\nlist1= []\r\nfor i in range(n):\r\n b = map(int, input().split())\r\n a = next(b)\r\n for j in range(a):\r\n list1.append(next(b))\r\na = set(list1)\r\nx = 0\r\nfor i in range(1,m+1):\r\n if i not in a:\r\n x = 1\r\n break\r\nprint(['YES','NO'][x])\r\n", "a,b=map(int, input().split())\r\nN=[1]*b\r\nfor i in range(a):\r\n c=list(map(int, input().split()))\r\n d=1\r\n for j in range(c[0]):\r\n N[c[d]-1]=0\r\n d+=1\r\nif sum(N)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,m = map(int,input().split())\r\nlist1 = []\r\nfor i in range(0,n):\r\n list2 = list(map(int,input().split()))\r\n num = list2[0]\r\n if num != 0:\r\n for q in range(1,num+1):\r\n list1.append(list2[q])\r\nfor t in range(0,m):\r\n if t+1 not in list1:\r\n print(\"NO\")\r\n break\r\nelse:print(\"YES\")", "n,m = map (int,input().split())\r\na = set()\r\nbulbx = []\r\nb = 0\r\nfor i in range(n):\r\n bulb = [int(x) for x in input().split()]\r\n bulbx = bulbx + bulb[1:]\r\n\r\nfor i in range(1,m+1):\r\n if i in bulbx:\r\n b = b+i\r\n\r\nif b == m*(m+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n , m = map(int , input().split())\r\nans = (m + 1) * [0]\r\nfor i in range(n):\r\n x = input().split()\r\n for j in range(1 , int(x[0]) + 1):\r\n ans[int(x[j])] = 1\r\nif sum(ans) == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n,m=map(int,input().split())\nl=[0 for i in range(m)]\nfor i in range(n):\n a=list(map(int,input().split()))\n p=1\n while a[0]: l[a[p]-1]=1;a[0]-=1;p+=1\nif sum(l)!=m:\n print('NO')\nelse:print('YES')", "def main():\r\n n, m = map(int, input().split())\r\n s = set()\r\n \r\n for _ in range(n):\r\n data = list(map(int, input().split()))\r\n for i in range(1, len(data)):\r\n s.add(data[i])\r\n \r\n print(\"Yes\" if len(s) == m else \"No\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "p,k=map(int,input().split())\r\nh=list(range(1,k+1))\r\nnumbers=[]\r\nwhile p:\r\n nums=list(map(int,input().split()))\r\n numbers.extend(nums[1:])\r\n p-=1\r\nflag = True\r\ni = 0\r\nfor i in h:\r\n if i not in numbers:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 22 16:54:39 2021\r\n\r\n@author: 金曈\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nzero = 1\r\nlistb = []\r\na = ''\r\nwhile zero <= n:\r\n zero += 1\r\n lista = input().split()\r\n listb += lista[1:]\r\nfor i in range(1,m+1):\r\n if str(i) not in listb:\r\n a = 'NO'\r\n print('NO')\r\n break\r\nif a != 'NO':\r\n print('YES')\r\n ", "n,m = map(int,input().split())\n\ns = set()\nfor i in range(n):\n l = list(map(int,input().split()))\n for i in l[1:]:\n s.add(i)\n\nif len(s) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t \t \t \t \t \t\t", "n,m = map(int,input().split())\r\nnum = set({})\r\nfor i in range(n):\r\n\tlist = input().split()\r\n\tfor i in range(1,len(list)):\r\n\t\tnum.add(list[i])\r\nprint('YES' if len(num) == m else 'NO')\r\n\r\n\t", "n, m = map(int, input().split())\r\nlamp_available = set()\r\nfor i in range(n):\r\n situation = list(map(int, input().split()))\r\n for j in range(situation[0]):\r\n lamp_available.add(situation[j + 1])\r\nif len(lamp_available) == m:\r\n print('YES')\r\nelif len(lamp_available) != m:\r\n print('NO')", "s, m = map(int, input().split())\r\nq = set()\r\nr = list()\r\nfor i in range(s):\r\n r = input().split()\r\n for k in r[1:]:\r\n q.add(k)\r\nprint('YES' if len(q) == m else 'NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 17:05:23 2021\r\n\r\n@author: tengjian\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nbulbs=[]\r\nfor i in range(0,m):\r\n bulbs.append(0)\r\nwhile n>0:\r\n n-=1\r\n L=list(map(int,input().split()))\r\n L.pop(0)\r\n for i in L:\r\n bulbs[i-1]=1\r\ns=sum(bulbs)\r\nif s==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import*\r\n\r\nn,m=map(int,input().split())\r\nmain_arr=[0]*m\r\nwhile n:\r\n\tn-=1\r\n\tarr=list(map(int,input().split()))\r\n\tfor i in range(1,arr[0]+1):\r\n\t\tif arr[i]!=0:\r\n\t\t\tmain_arr[arr[i]-1]=1\r\n#print(main_arr)\r\nprint(\"NO\" if 0 in main_arr else \"YES\")", "n,m=[int(i) for i in input().split()]\r\ns=set()\r\nfor i in range(n):\r\n for i in [int(i) for i in input().split()][1:]:\r\n s.add(i)\r\nif len(s)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nans = [i for i in range(1, m+1)]\r\nfor _ in range(n):\r\n a = list(map(int, input().split()))\r\n a.pop(0)\r\n for i in a:\r\n try:\r\n ans.remove(i)\r\n except:\r\n pass\r\nif len(ans) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "button,bulb = map(int,input().split())\r\nli=[0]*bulb\r\nfor i in range(button):\r\n tmp=[int(i) for i in input().split()]\r\n for i in range(1,tmp[0]+1):\r\n if li[tmp[i]-1]==0:\r\n li[tmp[i]-1]=1\r\nif sum(li)<bulb:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n,m=(input().split())\r\na=set()\r\nfor i in range (int(n)):\r\n n=input().split()\r\n N=len(n)\r\n for i in range(1,N):\r\n a.add(n[i])\r\nnum=len(a)\r\nif int(m)==num:\r\n print('YES')\r\nelse:\r\n print('NO')", "[n,m]=[int(i)for i in input().split()]\r\nset1=set()\r\nfor i in range(m):\r\n set1.add(i+1)\r\nset2=set()\r\nfor i in range(n):\r\n a=[int(j) for j in input().split()]\r\n for j in range(a[0]):\r\n set2.add(a[j+1])\r\nif(set1==set2):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nlights_on = []\r\n\r\nfor i in range(1, m+ 1):\r\n lights_on.append(i)\r\nfor k in range(n):\r\n bulbs = input().split()\r\n for j in range(1, len(bulbs)):\r\n if int(bulbs[j]) in lights_on:\r\n lights_on.remove(int(bulbs[j]))\r\n\r\nif len(lights_on) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 13:47:19 2021\r\n\r\n@author: 86188\r\n\"\"\"\r\nn,m=map(int,input().split())\r\nlis = []\r\nfor i in range(m):\r\n lis.append(0)\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\n for j in range(1,len(a)):\r\n lis[a[j]-1] = 1 \r\nif (0 in lis):\r\n print('NO')\r\nelse:\r\n print('YES')", "n,m=map(int,input().split())\r\ny=[]\r\nfor i in range(n):\r\n x_i=input().split()\r\n xi=int(x_i[0])\r\n y+=x_i[1:]\r\nif len(set(y))==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "[n,m] = map(int,input().split())\n\nx = [0]*n\nlights = [0]*m\n\nfor i in range(n):\n A = [int(x) for x in input().split()]\n x=A[0]\n j=1\n while j<x+1:\n lights[A[j]-1]=1\n j=j+1\n\npossible=1\nfor k in range(m):\n if lights[k]==0:\n possible=0\n \nprint(\"YES\" if possible else \"NO\")\n\t\t \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t\t\t\t \t", "n, m = map(int, input().split())\n\n# create a set of all the bulbs\nbulbs = set(range(1, m+1))\n\n# iterate over the buttons and their corresponding bulbs\nfor i in range(n):\n button_bulbs = set(map(int, input().split()[1:]))\n # remove the bulbs that are turned on by this button from the set of all bulbs\n bulbs -= button_bulbs\n\n# if there are no bulbs left in the set, Vasya can light up all the bulbs\nif not bulbs:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t\t \t\t\t \t \t \t \t \t \t", "n, m = [int(x) for x in input().split()]\r\ns = []\r\nfor i in range(n):\r\n lt = list(map(int, input().split()))\r\n for j in lt[1:]:\r\n s.append(j)\r\nst = set(s)\r\nif st == set(range(1,m+1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\ns = set()\r\nfor i in range(n):\r\n s = s.union(set(input().split()[1:]))\r\nprint('YES' if len(s) == m else 'NO')\r\n", "n, m = map(int, input().split())\r\ns = []\r\nx = 1\r\nfor i in range(n):\r\n lights = input().split()\r\n del lights[0]\r\n s[-1:-1] = lights\r\nfor i in range(1,m+1):\r\n x *= s.count(str(i))\r\nif x == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n , m = map(int,input().split())\r\nb1 = []\r\nfor i in range (n):\r\n a = input().split()\r\n for j in a[1:]:\r\n b1.append(j)\r\nb2 = list(set(b1))\r\nif m == len(b2):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nres = [0] * m\r\n\r\nfor _ in range(n):\r\n lst = list(map(int, input().split()))\r\n\r\n for i in lst[1:]:\r\n if res[i - 1] == 0:\r\n res[i - 1] = 1\r\n \r\n \r\nflag = \"YES\"\r\nfor i in res:\r\n if i == 0:\r\n flag = \"NO\"\r\n break\r\n\r\nprint(flag)", "n,m=map(int,input().split());bulbs=[]\nfor i in range (n):\n bulb=[int(x) for x in input().split()]\n for k in range (0,bulb[0]):\n bulbs.append(bulb[k+1])\nfor j in range (0,m):\n if j+1 not in bulbs:\n print(\"NO\")\n break\nelse:print(\"YES\")\n", "n, m = map(int, input().split())\r\nli = []\r\nfor _ in range(n):\r\n li.extend(list(map(int, input().split()))[1:])\r\n\r\nif len(set(li)) != m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def HARD_WAY():\r\n n,m=map(int,input().split())\r\n l=[] \r\n while n:\r\n c=map(int,input().split())\r\n c=list(c)\r\n for x in c[1:]:\r\n if x not in l:\r\n l.append(x)\r\n n-=1 \r\n l=set(l)\r\n i=1\r\n while i<=m:\r\n if i not in l:\r\n return \"NO\"\r\n i+=1\r\n return \"YES\"\r\nprint(HARD_WAY())", "n,m=map(int,input().split())\r\nbub=[0]*m\r\nfor i in range(n):\r\n turn_on=list(map(int,input().split()))\r\n turn_number=turn_on[0]\r\n for j in turn_on[1::]:\r\n bub[j-1]=1\r\nprint('YES' if bub==[1]*m else 'NO')", "n, m = (int(i) for i in input().split())\ns = set(range(1, m + 1))\nfor _ in range(n):\n x, *y = (int(i) for i in input().split())\n for i in y:\n s.discard(i)\nres = \"NO\" if s else \"YES\"\nprint(res)\n", "a,b=map(int, input().split())\r\nset = set()\r\nfor i in range(a):\r\n set.update(input().split()[1:])\r\nprint(['No', 'Yes'][len(set)==b])", "total_number = input().split()\r\nb = set()\r\nc = set()\r\nfor i in range(1,int(total_number[1])+1):\r\n b.add(i)\r\nfor a in range(int(total_number[0])):\r\n again = input().split()\r\n for d in range(1,int(again[0])+1):\r\n c.add(int(again[d]))\r\nif b == c :\r\n print('Yes')\r\nelse:\r\n print('No')", "n,m=(int(x) for x in input().split())\r\nv=[]\r\nf=[]\r\nfor k in range(1,m+1):\r\n v.append(k)\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n x.pop(0)\r\n f.append(x)\r\n h=sum(f,[])\r\nl=sorted(list(set(h)))\r\nif l==v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\ntotal=[]\r\nfor i in range(n):\r\n data=input().split()\r\n for j in range(1,int(data[0])+1):\r\n if not data[j] in total:\r\n total.append(data[j])\r\nprint([\"NO\",\"YES\"][len(total)==m])", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n lamps = [False] * m\r\n for _ in range(n):\r\n for i in input().split()[1:]:\r\n lamps[int(i) - 1] = True\r\n print('YES' if sum(lamps) == m else 'NO')\r\n", "n, m = input().split(' ')\r\nbulbs = []\r\nbulbs = set(bulbs)\r\nfor i in range(int(n)):\r\n c = input()\r\n c = c.split(' ')\r\n del c[0]\r\n c = set(c)\r\n bulbs = bulbs.union(c)\r\nbulbs = list(bulbs)\r\nif len(bulbs) == int(m):\r\n print('YES')\r\nelif len(bulbs) < int(m):\r\n print('NO')", "n,m=map(int,input().split())\r\nss=[]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()]\r\n for j in range(1,len(s)):\r\n if s[j] not in ss:\r\n ss.append(s[j])\r\nif len(ss)==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nl = [0] * m\r\nfor i in range(n):\r\n x, *y = map(int, input().split())\r\n for h in y:\r\n l[h - 1] = 1\r\nif 0 in l:\r\n print('NO')\r\nelse:\r\n print('YES') ", "n, m = input().split()\r\nb1 = []\r\nfor i in range(int(n)):\r\n b = input().split()\r\n for x in b:\r\n a = b[0]\r\n b.remove(a)\r\n b1.extend(b)\r\n\r\nbulb = 0\r\nfor i1 in range(int(m)):\r\n a = i1+1\r\n if b1.count(str(a)) >= 1:\r\n bulb += 1\r\n \r\nif bulb == int(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=[int(x) for x in input().split()]\r\nt=set()#定义空集合\r\nfor i in range (n):\r\n s=input().split()\r\n t.update(s[1:])#update函数：将集合s中的新元素添加到集合t中\r\nif len(t)==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "set0=set()\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n set0=set0|set(list(map(int,input().split()))[1:])\r\nprint([\"NO\",\"YES\"][len(set0)==m])", "n, m = map(int, input().split())\r\nbulbs = [0] * m\r\nfor _ in range(n):\r\n for y in list(map(int, input().split()))[1:]:\r\n bulbs[y-1] = 1\r\nprint(\"YES\" if bulbs.count(0) == 0 else \"NO\")", "n,m=list(map(int, input().split()))\r\nturnedon=set()\r\nfor i in range(n):\r\n button=list(map(int, input().split()))\r\n for j in range(1, button[0]+1):\r\n turnedon.add(button[j])\r\nif len(turnedon)!=m:\r\n print('NO')\r\nelse:\r\n print('YES')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 17:12:29 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nb = [0]*m\r\nfor i in range(n):\r\n lit = [int(x) for x in input().split()]\r\n for j in range(lit[0]):\r\n b[lit[j+1]-1] = 1\r\nif b.count(1) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nl=n.split()\r\nnmbt=int(l[0])\r\nnmbl=int(l[1])\r\nbll=[]\r\nfor y in range(1,nmbl+1):\r\n bll.append(str(y))\r\nchl=[]\r\nfor ui in range(0,nmbt):\r\n o=input()\r\n l=o.split()\r\n for kl in range(1,len(l)):\r\n if l[kl] in bll:\r\n chl.append(l[kl])\r\nst=0\r\nfor h in range(0,len(bll)):\r\n if bll[h] not in chl:\r\n st=1\r\n break\r\nif st==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split());a=[]\r\nfor _ in \" \"*n:a+=map(int,input().split()[1:])\r\nprint(\"YNEOS\"[len(set(a))!=m::2]) ", "n,m=[int(x) for x in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n a=input().split()\r\n for j in range(1,len(a)):\r\n s.append(a[j])\r\nfor k in range(1,m+1):\r\n if str(k) not in set(s):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "(n,l) = list(map(int,input().split()))\r\nli = set()\r\nfor i in range(n):\r\n b = list(map(int,input().split()))\r\n for j in range(b[0]):\r\n li.add(b[j+1])\r\n\r\nif len(li)==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n ,m=map(int, input().split())\r\non=[]\r\nfor button in range(n):\r\n on=[*on, *list(map(int, input().split()))[1:]]\r\nprint(\"YES\" if len(set(on))==m else \"NO\")", "m,n=map(int,input().split())\nk=[]\nfor i in range(m):\n l=list(map(int,input().split()))\n k.extend(l[1:])\n\nif(len(set(k))==n):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, m = input().split()\nn = int(n)\nm = int(m)\nst = set()\nfor i in range (n):\n lst = list(map(int , input().split()))\n for j in range (1,len(lst)):\n st.add(lst[j])\nif len(st) == m:\n print(\"Yes\")\nelse:\n print(\"No\")\n\t\t\t\t \t\t \t \t\t\t \t\t \t\t \t\t \t\t\t", "n, m = input().split()\nn = int(n)\nm = int(m)\nnums = []\nfor i in range(n):\n lst = list(input().split())\n for j in range(1,len(lst)):\n if lst[j] not in nums:\n nums.append(lst[j])\nif len(nums)==m:\n print('YES')\nelse:\n print('NO')\n \t\t \t \t\t \t\t\t\t \t\t\t\t \t \t\t \t", "n,m=map(int,input().split())\r\na=set()\r\nfor i in range(1,n+1):\r\n s=input().split()\r\n s[0]=int(s[0])\r\n for j in range(1,s[0]+1):\r\n a.add(s[j])\r\nif m==len(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nbulb = [0]*m\r\nfor i in range(n):\r\n y = [int(x) for x in input().split()]\r\n for j in y[1:]:\r\n bulb[j-1] = 1\r\nif bulb.count(1) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\n\r\nlambs=[0]*k\r\n\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n y=x[1:]\r\n for j in y:\r\n lambs[j-1] +=1\r\nfor i in lambs:\r\n if i==0:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\") ", "n , m = map(int, input().split())\nd = {}\nfor i in range(n):\n l = [int(j) for j in input().split()]\n for j in range(1, len(l)):\n d[l[j]] = d.get(l[j], 0)+1\nif len(d) == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t\t\t\t \t\t \t \t\t \t\t", "n,m=[int(x) for x in input().split()]\r\ny=[]\r\nfor i in range(n):\r\n y.extend(input().split()[1:])\r\nbulb=0\r\nfor c in range(m):\r\n open=c+1\r\n if y.count(str(open))>=1:\r\n bulb+=1\r\nif bulb==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int,input().split())\r\nall_light = list(range(1,m+1))\r\nlight_can = []\r\nfor butter in range(n):\r\n light = list(map(int,input().split()))\r\n light.pop(0)\r\n for i in light:\r\n if i not in light_can:\r\n light_can.append(i)\r\nfor x in all_light:\r\n if x not in light_can:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "a,b = map(int,input().split())\r\nc=[]\r\nd=[]\r\nfor i in range(a):\r\n a = list(map(int,input().split()))\r\n a.pop(0)\r\n c+=a\r\nif len(set(c))>=b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nu = [0] * (m + 1)\r\nfor _ in range(n):\r\n x = list(map(int, input().split()))[1:]\r\n for i in x:\r\n u[i] = 1\r\nans = \"YES\" if sum(u) == m else \"NO\"\r\nprint(ans)", "#%% 615a Vasya and bulbs \r\n\r\ni = lambda : map(int,input().split())\r\nn,m = i(); on = set()\r\nfor _ in range(n):\r\n on.update(list(i())[1:])\r\nprint('YES' if len(on) == m else 'NO')\r\n", "n, m = map(int, input().split())\r\ns_s = set()\r\n\r\nfor _ in range(n):\r\n s_s.update(list(map(int, input().split()))[1:])\r\n \r\nif len(s_s) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 13:46:09 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn,m=map(int, input().split())\r\ns=[]\r\nfor i in range(n):\r\n t=list(map(int, input().split()))\r\n s=s+t[1::]\r\ns=set(s)\r\nprint('YES'if len(s)==m else 'NO')\r\n ", "n,m=map(int,input().split())\ns=set()\nfor i in range(n):\n lst=list(input().split())\n # print(lst)\n lst.remove(lst[0])\n # print(lst)\n s.update(lst)\n\nif (len(s) == m):\n print('YES')\nelse:\n print('NO')\n\t \t\t\t\t\t\t\t \t \t \t \t \t\t \t\t\t \t", "# Bulbs \n# ------------------------------------------------\n\ndef main():\n n, m = [int(num) for num in input().split()]\n allBulbs = set()\n for _ in range(n):\n bulbs = [int(num) for num in input().split()]\n bulbs = bulbs[1:]\n allBulbs = allBulbs.union(bulbs)\n if len(allBulbs) == m:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n\t \t\t \t \t \t \t\t \t \t \t", "n,m=[int(i) for i in input().split()]\r\nj=1\r\nsett=set()\r\nfor w in range(n):\r\n lst=[int(s) for s in input().split()]\r\n sett.update(lst[1:])\r\nif len(sett)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nb=[0]*m\r\nc=0\r\nfor i in range(n):\r\n hi=str(input()).split(\" \")\r\n hp=[int(x) for x in hi]\r\n for j in range(hp[0]):\r\n b[hp[j+1]-1]=1\r\nfor i in range(m):\r\n c+=b[i]\r\nif c==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 19 15:36:42 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nbulbs = [False]*m\r\nfor _ in range(n):\r\n s = input().split()\r\n x = int(s.pop(0))\r\n for i in s:\r\n bulbs[int(i)-1] = True\r\nif False in bulbs:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "from sys import stdin\r\n\r\nn, m = list(map(int, stdin.readline().split()))\r\na = [False]*m\r\nfor _ in range(n):\r\n b = list(map(int, stdin.readline().split()))\r\n for i in range(1, len(b)):\r\n a[b[i]-1] = True\r\n\r\nprint('YES' if all(a) else 'NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 3 13:22:48 2020\r\n\r\n@author: Cui Shiao\r\n\"\"\"\r\n\r\na,b=[int(x) for x in input().split()]\r\ns=set()\r\nfor y in range(a):\r\n k=input().split()\r\n k.pop(0)\r\n s.update(k)\r\n k=[]\r\nif len(s)==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input(). split())\r\nlist1 = []\r\nfor a in range(n):\r\n list2 = list(input(). split())\r\n list1.extend(list2[1:])\r\nx = 1\r\nans = 0\r\nwhile x <= m:\r\n if str(x) in list1:\r\n ans += 1\r\n x += 1\r\nif ans == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n A = []\r\n for t in wtf[1:]:\r\n A.extend(list(map(int, t.split()))[1:])\r\n print('YES' if len(set(A)) == m else 'NO')", "n,m=map(int,input().split())\r\nx=y=set()\r\nx={str(j) for j in range(1,m+1)}\r\nfor i in range(n):\r\n a=input().split()\r\n del a[0]\r\n y|=set(a)\r\nif y==x:\r\n print('YES')\r\nelse:print('NO')", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(*args):\n N = lambda: int(input())\n buttons, bulbs = map(int, input().split())\n bulbcol = [i for i in range(1, bulbs+1)]\n for _ in range(buttons):\n p = [int(e) for e in input().split()]\n for e in p[1::]:\n if e in bulbcol:\n bulbcol = [x for x in bulbcol if x != e]\n\n if not bulbcol:\n print('yes')\n else:\n print('no')\n\nif __name__ == '__main__':\n\tfunction()\t\n" ]

{"inputs": ["3 4\n2 1 4\n3 1 3 1\n1 2", "3 3\n1 1\n1 2\n1 1", "3 4\n1 1\n1 2\n1 3", "1 5\n5 1 2 3 4 5", "1 5\n5 4 4 1 2 3", "1 5\n5 1 1 1 1 5", "2 5\n4 3 1 4 2\n4 2 3 4 5", "5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 4\n0\n4 4 3 2 1", "100 100\n0\n0\n0\n1 53\n0\n0\n1 34\n1 54\n0\n1 14\n0\n1 33\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 82\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 34\n0\n0\n1 26\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 34\n0\n0\n0\n0\n0\n1 3\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n1 40\n0\n0\n0\n1 26\n0\n0\n0\n0\n0\n1 97\n0\n1 5\n0\n0\n0\n0\n0", "100 100\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\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", "5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 4\n3 1 5 6", "5 2\n1 1\n1 1\n1 1\n1 1\n1 1", "1 4\n3 1 2 3", "1 4\n3 2 3 4", "2 4\n3 2 3 4\n1 1", "2 4\n3 1 2 3\n1 4", "5 1\n0\n0\n0\n0\n0", "1 1\n0", "1 10\n10 1 2 3 4 5 6 7 8 9 10", "1 1\n1 1", "1 100\n99 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", "1 3\n3 1 2 1", "1 100\n100 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"], "outputs": ["YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

439

d3891b505ee7f8ab84e9bc52c21e7b57

none

Manao is taking part in a quiz. The quiz consists of *n* consecutive questions. A correct answer gives one point to the player. The game also has a counter of consecutive correct answers. When the player answers a question correctly, the number on this counter increases by 1. If the player answers a question incorrectly, the counter is reset, that is, the number on it reduces to 0. If after an answer the counter reaches the number *k*, then it is reset, and the player's score is doubled. Note that in this case, first 1 point is added to the player's score, and then the total score is doubled. At the beginning of the game, both the player's score and the counter of consecutive correct answers are set to zero. Manao remembers that he has answered exactly *m* questions correctly. But he does not remember the order in which the questions came. He's trying to figure out what his minimum score may be. Help him and compute the remainder of the corresponding number after division by 1000000009 (109<=+<=9). The single line contains three space-separated integers *n*, *m* and *k* (2<=≤<=*k*<=≤<=*n*<=≤<=109; 0<=≤<=*m*<=≤<=*n*). Print a single integer — the remainder from division of Manao's minimum possible score in the quiz by 1000000009 (109<=+<=9). Sample Input 5 3 2 5 4 2 Sample Output 3 6

[ "n,m,k=map(int,input().split())\n\nMOD=1000000009\n\nx=m-(n//k*(k-1)+(n%k))\n\nif (x<=0):exit(print(m%MOD))\n\nprint(((m-x)+((pow(2,x+1, MOD)+2*MOD)-2)*k-x*(k-1))%MOD)", "MOD = 1000000009\nn, m, k = map(int, input().split())\nx = m - (n // k * (k - 1) + n % k)\n\nif x <= 0:\n print(m)\nelse:\n print(((m - x) + (pow(2, x + 1, MOD) - 2) * k - x * (k - 1)) % MOD)\n# OK 100\n", "n, m, k = map(int, input().split())\r\n# k continuos chahiye\r\n# n number of questions hai\r\n# m correctly answer kiya hai\r\nmod = 10**9+9\r\ngaps = m - ((n//k)*(k-1)+n%k)\r\nif gaps <= 0:\r\n exit(print(m%mod))\r\n# print(gaps)\r\nans1 = m - gaps\r\nans2 = (pow(2, gaps+1, mod)-2+2*mod)*k\r\nans3 = -gaps*(k-1)\r\nprint((ans1+ans2+ans3)%mod)", "n, m, k = map(int, input().split())\r\n\r\nd = max(0, n // k - (n - m))\r\n\r\nM = 1000000009\r\n\r\nif d > 0:\r\n res = ((2 * k * (pow(2, d, M) - 1)) % M + m - k * d) % M\r\nelse:\r\n res = m\r\n\r\nprint(res)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\n\r\ndef f(x):\r\n global a\r\n if x != 0:\r\n x1 = bisect(d1, x)-1\r\n a *= d[x1]\r\n a %= M\r\n f(x-d1[x1])\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nl, h = 0, m//k+1\r\nc = -1\r\nM = 1000000009\r\nd = [1, 2]\r\nd1 = [0, 1]\r\nfor i in range(50):\r\n d.append(d[-1]**2 %M)\r\n d1.append(d1[-1]*2)\r\n\r\nwhile l < h:\r\n mi = (l+h)//2\r\n x = mi*k\r\n y = (m-x)//(k-1) - ((m-x)%(k-1) == 0)\r\n if y <= n-m:\r\n a = 1\r\n f(mi)\r\n a -= 1\r\n a *= 2*k\r\n a += m-x\r\n c = a % M\r\n h = mi\r\n else:\r\n l = mi+1\r\nprint(c)\r\n", "MOD =1000000009\nn,m,k=map(int,input().split())\nx=max(0,m-(n-n%k)//k*(k-1)-n%k)\nres=((((pow(2,x+1,MOD))-2)%MOD)*k)%MOD\nz=(m-x*k)%MOD\nres=(res+z)%MOD\nprint (res)\n" ]

{"inputs": ["5 3 2", "5 4 2", "300 300 3", "300 282 7", "1000000000 1000000000 1000000000", "1000000000 800000000 2", "2 0 2", "2 1 2", "2 2 2", "3 2 2", "3 3 2", "10 7 3", "10 8 3", "10 8 5", "10 9 5", "972 100 2", "972 600 2", "972 900 2", "972 900 4", "972 900 5", "12345 11292 3", "120009 70955 2", "120009 100955 2", "291527 253014 7", "300294 299002 188", "23888888 508125 3", "23888888 16789012 2", "23888888 19928497 4", "23888888 19928497 5", "23888888 19928497 812", "23888888 23862367 812", "87413058 85571952 11", "87413058 85571952 12", "87413058 85571952 25", "512871295 482216845 2", "512871295 482216845 3", "512871295 508216845 90", "512871295 512816845 99712", "512871295 512870845 99712", "512871295 512870845 216955", "512871295 512871195 2000000", "512871295 512871295 12345678", "778562195 708921647 4", "500000000 500000000 4", "375000000 375000000 3", "250000000 250000000 2", "300000000 300000000 12561295", "300000000 300000000 212561295", "300000000 300000000 299999999", "500000002 500000002 2", "625000001 625000000 5", "875000005 875000000 7", "1000000000 1000000000 8", "901024556 900000000 6", "901024556 900000000 91", "901024556 900000000 92", "901024556 900000000 888", "901024556 901000000 1000", "901024556 901000000 1013", "999998212 910275020 25", "999998212 999998020 1072520", "999998212 999998020 381072520", "999998212 999998210 381072520", "999998212 999998211 499998210", "1000000000 1000000000 1000000000", "1000000000 1000000000 772625255", "1000000000 999999904 225255", "1000000000 999998304 22255", "1000000000 999998304 7355", "1000000000 999998304 755", "1000000000 999998304 256", "1000000000 1000000000 2", "1000000000 1 999999998"], "outputs": ["3", "6", "17717644", "234881124", "999999991", "785468433", "0", "1", "4", "2", "5", "7", "11", "8", "14", "100", "857317034", "129834751", "473803848", "682661588", "307935747", "938631761", "682499671", "572614130", "435910952", "508125", "573681250", "365378266", "541851325", "19928497", "648068609", "996453351", "903327586", "424641940", "565667832", "446175557", "332476079", "512816845", "944454424", "28619469", "559353433", "423625559", "208921643", "1000000005", "1000000006", "1000000007", "543525658", "512561295", "599999999", "1000000007", "500000002", "531250026", "1000000001", "175578776", "771418556", "177675186", "900000000", "443969514", "840398451", "910275020", "314152037", "999998020", "999998210", "499996412", "999999991", "772625246", "940027552", "969969792", "756187119", "684247947", "401008799", "750000003", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

6

d38fb1c489d4cbf930b0337c192c450b

Interactive LowerBound

This is an interactive problem. You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to *x*. More formally, there is a singly liked list built on an array of *n* elements. Element with index *i* contains two integers: *value**i* is the integer value in this element, and *next**i* that is the index of the next element of the singly linked list (or -1, if the current element is the last). The list is sorted, i.e. if *next**i*<=≠<=<=-<=1, then *value**next**i*<=><=*value**i*. You are given the number of elements in the list *n*, the index of the first element *start*, and the integer *x*. You can make up to 2000 queries of the following two types: - ? i (1<=≤<=*i*<=≤<=*n*) — ask the values *value**i* and *next**i*, - ! ans — give the answer for the problem: the minimum integer, greater than or equal to *x*, or ! -1, if there are no such integers. Your program should terminate after this query. Write a program that solves this problem. The first line contains three integers *n*, *start*, *x* (1<=≤<=*n*<=≤<=50000, 1<=≤<=*start*<=≤<=*n*, 0<=≤<=*x*<=≤<=109) — the number of elements in the list, the index of the first element and the integer *x*. To print the answer for the problem, print ! ans, where ans is the minimum integer in the list greater than or equal to *x*, or -1, if there is no such integer. Sample Input 5 3 80 97 -1 58 5 16 2 81 1 79 4 Sample Output ? 1 ? 2 ? 3 ? 4 ? 5 ! 81

[ "from random import sample\nfrom sys import stdout\n\nread=lambda :map(int,input().split())\n\ndef ask(x):\n\tprint('? {}'.format(x))\n\tstdout.flush()\n\treturn tuple(read())\n\ndef answer(x):\n\tprint('! {}'.format(x))\n\tstdout.flush()\n\texit(0)\n\nn,st,x=read()\n\na=[ask(st)]\nif a[0][0]>=x: answer(a[0][0])\n\nfor i in sample(range(1,n+1),min(n,999)):\n\tb=ask(i)\n\tif b[0]<x: a.append(b)\n\telif b[0]==x: answer(x)\n\nb=max(a)\nwhile True:\n\tif b[0]>=x: answer(b[0])\n\tif b[1]==-1: break\n\telse: b=ask(b[1])\n\nanswer(-1)\n", "from sys import stdout\r\nfrom random import Random\r\n\r\nn, s, x = list(map(int, input().split()))\r\nans = 3 * 10 ** 9\r\n\r\nasked = [False for i in range(n + 1)]\r\ncache = [[] for i in range(n + 1)]\r\n\r\nmax_ask = 1999\r\nt = 1750\r\n\r\ndef ask(i):\r\n if asked[i]:\r\n return cache[i]\r\n asked[i] = True\r\n print('?', i)\r\n stdout.flush()\r\n res = list(map(int, input().split()))\r\n cache[i] = res\r\n return res\r\n\r\nf = ask(s)\r\ncs = f[0]\r\n\r\nr = Random()\r\nfor i in range(t):\r\n y = r.randint(1, n)\r\n if not asked[y]:\r\n q = ask(y)\r\n if q[0] >= x:\r\n ans = min(ans, q[0])\r\n elif cs < q[0] < x:\r\n s = y\r\n cs = q[0]\r\n else:\r\n i -= 1\r\n\r\nfor i in range(max_ask - t):\r\n q = ask(s)\r\n if q[0] >= x:\r\n ans = min(ans, q[0])\r\n s = q[1]\r\n if s == -1:\r\n break\r\n\r\n\r\nif ans == 3 * 10 ** 9:\r\n print('! -1')\r\nelse:\r\n print('!', ans)\r\n \r\n ", "n,start,x = map(int,input().split())\r\n\r\nfrom random import sample\r\n\r\n# random questionings\r\nN1 = 1000\r\n\r\nd = {}\r\n\r\nQ = sample(range(1,n+1), min(N1,n))\r\nif start not in Q:\r\n Q[0] = start\r\n\r\nfor q in Q:\r\n print('?',q, flush=True)\r\n v,n = map(int,input().split())\r\n d[q] = (v,n)\r\n\r\nL = sorted((v,q) for q,(v,n) in d.items())\r\n\r\nfrom bisect import bisect\r\ni = bisect(L,(x,0))-1\r\n\r\nif i < 0:\r\n r = L[0][0]\r\nelse:\r\n v,p = L[i]\r\n p = d[p][1]\r\n while v < x and p != -1:\r\n print('?',p, flush=True)\r\n v,p = map(int,input().split())\r\n\r\n if v >= x:\r\n r = v\r\n else:\r\n r = -1\r\n\r\nprint('!',r,flush=True)", "import bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations, accumulate\r\nfrom functools import reduce\r\n\r\np = print\r\nr = range\r\n\r\n\r\ndef I(): return int(input())\r\n\r\n\r\ndef II(): return list(map(int, input().split()))\r\n\r\n\r\ndef S(): return input()[:-1]\r\n\r\n\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\n\r\n\r\ndef pb(b): print('Yes' if b else 'No')\r\n\r\n\r\ndef INF(): return float('inf')\r\n\r\n\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　（´<_｀）　 Welcome to My Coding Space !\r\n# 　　　　（ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　＿_(__ﾆつ/　＿/ .| .|＿＿＿＿\r\n# 　　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# BINARY SEARCH ?\r\n# CHANGE TO GRAPH?\r\n# pow(x,-1,q) PLEASE USE [python 3.8.2]\r\n# -----------------------------------------------------------------------------------------------------\r\nn, start, x = II()\r\nimport random\r\nfrom functools import lru_cache\r\n\r\n\r\ndef found(x):\r\n print(\"!\", x)\r\n\r\n\r\n@lru_cache(None)\r\ndef query(i):\r\n print(\"?\", i, flush=True)\r\n a, b = II()\r\n if a == x:\r\n found(a)\r\n exit()\r\n return (a, b)\r\n\r\n\r\nif n < 1990:\r\n res = [query(i)[0] for i in r(1, n + 1)]\r\n res.sort()\r\n index = bisect.bisect_left(res, x)\r\n if index == len(res):\r\n found(-1)\r\n else:\r\n found(res[index])\r\n exit()\r\na, b = query(start)\r\nif x <= a:\r\n found(a)\r\n exit()\r\npivot = [100 * i + random.randint(0,99) for i in r(n // 100)]\r\nif start not in pivot:\r\n pivot.append(start)\r\nrpviot = [query(x) for x in pivot]\r\nrpviot.sort()\r\nindex = bisect.bisect_left(rpviot, (x, 0))\r\nstart = -1\r\nend = -1\r\nif index == len(rpviot):\r\n start = rpviot[index - 1][1]\r\nelse:\r\n start = rpviot[index - 1][1]\r\n end = rpviot[index][1]\r\nwhile start != end:\r\n a, b = query(start)\r\n if a >= x:\r\n found(a)\r\n exit()\r\n start = b\r\nfound(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from random import sample\r\n\r\nn,start,x=map(int,input().split())\r\nf = min(n, 998)\r\n\r\ndef get(i):\r\n print('?', i)\r\n return list(map(int, input().split()))\r\n\r\ndef answer(a):\r\n print('!', a)\r\n exit(0)\r\n\r\narr=[]\r\narr.append(get(start))\r\nif arr[0][0] >= x:\r\n answer(arr[0][0])\r\n\r\nfor i in sample(range(1, n+1), f):\r\n a=get(i)\r\n if a[0]<x:\r\n arr.append(a)\r\n elif a[0]==x:\r\n answer(a[0])\r\n\r\nu = max(arr)[1]\r\nwhile u!=-1:\r\n q = get(u)\r\n if q[0] >= x:\r\n answer(q[0])\r\n u = q[1]\r\nanswer(-1)", "from random import sample\n\n\n\nSIZE = 950\n\n\n\ndef R():\n\n return map(int, input().split())\n\n\n\ndef ask(i):\n\n print('?', i, flush=True)\n\n v, nxt = R()\n\n if v < 0:\n\n exit()\n\n return v, nxt\n\n\n\nn, s, x = R()\n\nq = range(1, n + 1)\n\nif n > SIZE:\n\n q = sample(q, SIZE)\n\nv, s = max((t for t in map(ask, q) if t[0] < x), default=(-1, s))\n\nwhile v < x and ~s:\n\n v, s = ask(s)\n\nprint('!', v if v >= x else -1)\n\n\n\n\n\n# Made By Mostafa_Khaled", "from random import randint\r\nfrom sys import stdout\r\n\r\n\r\ndef get(i):\r\n print('? {}'.format(i + 1))\r\n stdout.flush()\r\n v, nx = [int(t) for t in input().split()]\r\n return v, nx - 1\r\n\r\nn, start, x = [int(t) for t in input().split()]\r\nbest_index = None\r\nbest_value = None\r\nfor i in range(1000):\r\n ind = randint(0, n - 1)\r\n value, nxt = get(ind)\r\n if value < x and (best_value is None or value > best_value):\r\n best_value = value\r\n best_index = ind\r\n\r\nif best_value is None:\r\n best_index = start - 1\r\n\r\nind = best_index\r\nwhile True:\r\n value, nxt = get(ind)\r\n if value >= x:\r\n print('! {}'.format(value))\r\n break\r\n if nxt < 0:\r\n print('! -1')\r\n break\r\n ind = nxt\r\n", "import sys\r\nimport random\r\n\r\n\r\n\r\nn, st, t = map(int, input().split())\r\n\r\nprint('?', st)\r\nsys.stdout.flush()\r\nmn, i1 = map(int, input().split())\r\nif (mn >= t):\r\n\tprint('!', mn)\r\n\tsys.stdout.flush()\r\n\texit(0)\r\nar = list(i for i in range(1, n + 1))\r\nrandom.shuffle(ar)\r\nmx = 10**10\r\nfor i in range(min(999, len(ar))):\r\n\tprint('?', ar[i])\r\n\tsys.stdout.flush()\r\n\tx, i2 = map(int, input().split())\r\n\tif (x >= t):\r\n\t\tmx = min(mx, t)\r\n\telse:\r\n\t\tif (mn < x):\r\n\t\t\tmn = x\r\n\t\t\ti1 = i2\r\nfor i in range(1000):\r\n\tif (i1 == -1):\r\n\t\tif (mx == 10**10):\r\n\t\t\tprint('!', -1)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\texit(0);\r\n\t\telse:\r\n\t\t\tprint('!', mx)\r\n\t\t\tsys.stdout.flush()\r\n\t\t\texit(0)\r\n\tprint('?', i1)\r\n\tx, i2 = map(int, input().split())\r\n\tif (x >= t):\r\n\t\tprint('!', x)\r\n\t\tsys.stdout.flush()\r\n\t\texit(0)\r\n\ti1 = i2\r\nif (mx == 10**10):\r\n\tprint('!', -1)\r\n\tsys.stdout.flush()\r\n\texit(0);\r\nelse:\r\n\tprint('!', mx)\r\n\tsys.stdout.flush()\r\n\texit(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

{"inputs": ["5 3 80\n97 -1\n58 5\n16 2\n81 1\n79 4", "5 1 6\n1 2\n2 3\n3 4\n4 5\n5 -1", "1 1 0\n0 -1", "1 1 2\n0 -1", "1 1 1000000000\n0 -1", "5 3 3\n3 5\n2 1\n0 4\n1 2\n4 -1", "5 3 145337745\n619347297 5\n344132479 1\n122841322 4\n169280018 2\n740666615 -1", "5 3 315433300\n411188472 5\n316581280 1\n200698791 4\n314885421 2\n759386148 -1", "5 3 381735506\n469559901 5\n359493082 1\n137017061 4\n202768106 2\n955698260 -1", "5 3 587634055\n563214082 5\n404100743 1\n179733654 4\n236438578 2\n673892808 -1", "5 3 974128233\n547205043 5\n318213550 1\n122625404 4\n184874700 2\n669820978 -1", "10 3 2\n3 9\n9 -1\n0 7\n6 8\n5 4\n8 2\n1 10\n7 6\n4 5\n2 1", "10 3 632584719\n378382911 9\n978367651 -1\n176599346 7\n557138623 8\n441019502 4\n823417558 2\n244832688 10\n702148024 6\n385598339 5\n357778234 1", "1 1 50\n60 -1", "5 1 100\n200 2\n300 3\n400 4\n500 5\n600 -1"], "outputs": ["81\n1003", "-1\n1002", "0\n2", "-1\n1002", "-1\n1002", "3\n1003", "169280018\n1003", "316581280\n1003", "469559901\n1003", "673892808\n1003", "-1\n1002", "2\n1003", "702148024\n1003", "60\n2", "200\n2"]}

UNKNOWN

PYTHON3

CODEFORCES

8

d39d202a68a2cf02ae6f18f45fddeaca

Renting Bikes

A group of *n* schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them. The renting site offered them *m* bikes. The renting price is different for different bikes, renting the *j*-th bike costs *p**j* rubles. In total, the boys' shared budget is *a* rubles. Besides, each of them has his own personal money, the *i*-th boy has *b**i* personal rubles. The shared budget can be spent on any schoolchildren arbitrarily, but each boy's personal money can be spent on renting only this boy's bike. Each boy can rent at most one bike, one cannot give his bike to somebody else. What maximum number of schoolboys will be able to ride bikes? What minimum sum of personal money will they have to spend in total to let as many schoolchildren ride bikes as possible? The first line of the input contains three integers *n*, *m* and *a* (1<=≤<=*n*,<=*m*<=≤<=105; 0<=≤<=*a*<=≤<=109). The second line contains the sequence of integers *b*1,<=*b*2,<=...,<=*b**n* (1<=≤<=*b**i*<=≤<=104), where *b**i* is the amount of the *i*-th boy's personal money. The third line contains the sequence of integers *p*1,<=*p*2,<=...,<=*p**m* (1<=≤<=*p**j*<=≤<=109), where *p**j* is the price for renting the *j*-th bike. Print two integers *r* and *s*, where *r* is the maximum number of schoolboys that can rent a bike and *s* is the minimum total personal money needed to rent *r* bikes. If the schoolchildren cannot rent any bikes, then *r*<==<=*s*<==<=0. Sample Input 2 2 10 5 5 7 6 4 5 2 8 1 1 2 6 3 7 5 2 Sample Output 2 3 3 8

[ "n, m, a = map(int, input().split())\nB = [int(x) for x in input().split()]\nP = [int(x) for x in input().split()]\nB.sort()\nP.sort()\n\ndef f(a):\n need = 0\n for i in range(a):\n need += max(0, P[i] - B[n - a + i])\n return need\n\nl = 0\nr = min(n + 1, m + 1)\nwhile r - l > 1:\n mid = (l + r) // 2\n if f(mid) > a: r = mid\n else: l = mid\nprint(l, max(0, sum(P[:l]) - a))\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\ndef find(K):\n ans = 0\n cnt = 0\n x = K-1\n for i in range(K):\n cnt+=B[x]\n ans+=max(0,B[x]-P[i])\n x-=1\n if ans>A:return False,-1\n\n return True,max(0,cnt-A)\n\nN,M,A = map(int,input().split())\nP = sorted(map(int,input().split()))[::-1]\nB = sorted(map(int,input().split()))\n\nl,r = 0,min(N,M)\nwhile l+1<r:\n mid = (l+r)//2\n check,num = find(mid)\n if check:\n l = mid\n else:\n r = mid\n\na,b = find(l)\nc,d = find(r)\nif c:\n print(r,d)\nelse:\n print(l,b)\n", "n, m, a = map(int, input().split())\r\nb, p = sorted(map(int, input().split())), sorted(map(int, input().split()))\r\ndef f(k):\r\n return sum(max(0, p[i] - b[n - k + i]) for i in range(k))\r\ndef g(k):\r\n return sum(min(b[n - k + i], p[i]) for i in range(k))\r\n \r\nx, y, d = 0, min(n, m) + 1, a\r\nwhile y - x > 1:\r\n k = (x + y) // 2\r\n s = f(k)\r\n if s > a:\r\n y = k\r\n else:\r\n x, d = k, s\r\nprint(x, max(0, g(x) - a + d))", "def readn():\n return map(int, input().split())\nn,m,a=readn()#map(int,input().split())\nb,p=sorted(map(int,input().split()))[-min(n,m):],sorted(map(int,input().split()))\nr=min(n,m)\nmm=r\nl=0\nwhile l<=r:\n mid=l+(r-l)//2\n pri=sum([max(0,p[i]-b[mm-mid+i]) for i in range(mid)])\n if pri<=a:\n l=mid+1\n else:\n r=mid-1\nprint(r,max(0,sum(p[:r])-a))\n\n\n\n\n\n\n\t \t\t \t \t \t\t\t \t \t \t\t \t \t\t" ]

{"inputs": ["2 2 10\n5 5\n7 6", "4 5 2\n8 1 1 2\n6 3 7 5 2", "1 1 2\n1\n2", "4 1 1\n3 2 3 2\n3", "1 4 1\n3\n2 4 5 5", "3 3 3\n1 1 2\n3 5 6", "4 5 6\n5 1 7 2\n8 7 3 9 8", "4 8 10\n2 1 2 2\n10 12 10 8 7 9 10 9", "8 4 18\n9 4 2 2 7 5 1 1\n11 12 8 9", "6 6 2\n6 1 5 3 10 1\n11 4 7 8 11 7", "10 10 7\n6 7 15 1 3 1 14 6 7 4\n15 3 13 17 11 19 20 14 8 17", "14 14 22\n23 1 3 16 23 1 7 5 18 7 3 6 17 8\n22 14 22 18 12 11 7 24 20 27 10 22 16 7", "10 20 36\n12 4 7 18 4 4 2 7 4 10\n9 18 7 7 30 19 26 27 16 20 30 25 23 17 5 30 22 7 13 6", "20 10 31\n17 27 2 6 11 12 5 3 12 4 2 10 4 8 2 10 7 9 12 1\n24 11 18 10 30 16 20 18 24 24", "40 40 61\n28 59 8 27 45 67 33 32 61 3 42 2 3 37 8 8 10 61 1 5 65 28 34 27 8 35 45 49 31 49 13 23 23 53 20 48 14 74 16 6\n69 56 34 66 42 73 45 49 29 70 67 77 73 26 78 11 50 69 64 72 78 66 66 29 80 40 50 75 68 47 78 63 41 70 52 52 69 22 69 66", "10 10 0\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000\n1001 1001 1001 1001 1001 1001 1001 1001 1001 1001", "9 8 0\n1 2 3 4 5 6 7 8 9\n2 3 4 5 6 7 8 9", "9 8 0\n1 2 3 4 5 6 7 8 9\n1 2 3 4 5 6 7 8"], "outputs": ["2 3", "3 8", "1 0", "1 2", "1 1", "1 0", "3 12", "1 0", "4 22", "3 16", "5 42", "10 115", "10 69", "7 86", "22 939", "0 0", "8 44", "8 36"]}

UNKNOWN

PYTHON3

CODEFORCES

4

d39f143028f8d494421257e9610a63a2

Inna and Choose Options

There always is something to choose from! And now, instead of "Noughts and Crosses", Inna choose a very unusual upgrade of this game. The rules of the game are given below: There is one person playing the game. Before the beginning of the game he puts 12 cards in a row on the table. Each card contains a character: "X" or "O". Then the player chooses two positive integers *a* and *b* (*a*·*b*<==<=12), after that he makes a table of size *a*<=×<=*b* from the cards he put on the table as follows: the first *b* cards form the first row of the table, the second *b* cards form the second row of the table and so on, the last *b* cards form the last (number *a*) row of the table. The player wins if some column of the table contain characters "X" on all cards. Otherwise, the player loses. Inna has already put 12 cards on the table in a row. But unfortunately, she doesn't know what numbers *a* and *b* to choose. Help her win the game: print to her all the possible ways of numbers *a*,<=*b* that she can choose and win. The first line of the input contains integer *t* (1<=≤<=*t*<=≤<=100). This value shows the number of sets of test data in the input. Next follows the description of each of the *t* tests on a separate line. The description of each test is a string consisting of 12 characters, each character is either "X", or "O". The *i*-th character of the string shows the character that is written on the *i*-th card from the start. For each test, print the answer to the test on a single line. The first number in the line must represent the number of distinct ways to choose the pair *a*,<=*b*. Next, print on this line the pairs in the format *a*x*b*. Print the pairs in the order of increasing first parameter (*a*). Separate the pairs in the line by whitespaces. Sample Input 4 OXXXOXOOXOOX OXOXOXOXOXOX XXXXXXXXXXXX OOOOOOOOOOOO Sample Output 3 1x12 2x6 4x3 4 1x12 2x6 3x4 6x2 6 1x12 2x6 3x4 4x3 6x2 12x1 0

[ "T=int(input())\n\nwhile T>=1:\n T-=1\n a=input()\n list=[]\n for i in range(1,13):\n if 12 % i==0:\n l=12//i\n for j in range(0,l):\n for k in range(0,i):\n if a[k*l+j]!='X':\n break\n else:\n break\n else:\n continue\n list.append(i)\n print(len(list),end=' ')\n for i in range(0,len(list)):\n print(str(list[i])+'x'+str(12//list[i]),end=' ')\n print()\n", "fact = [2,3,4,6]\r\nn = int(input())\r\nl1 = []\r\nfor i in range(n):\r\n\tt = input()\r\n\tl2 = []\r\n\tif t.count(\"X\"):\r\n\t\tl2.append(\"1x12\")\r\n\t\tfor j in fact:\r\n\r\n\t\t\tfor k in range(12//j):\r\n\t\t\t\tflag = 0\r\n\t\t\t\t# print(j) \r\n\t\t\t\tfor l in range(k,12,12//j):\r\n\t\t\t\t\t# print(k,j,l)\r\n\t\t\t\t\tif t[l] == \"X\":\r\n\t\t\t\t\t\tpass\r\n\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tflag = 1\r\n\t\t\t\t\t\tbreak\r\n\r\n\t\t\t\tif flag == 0:\r\n\t\t\t\t\tl2.append(str(j)+\"x\"+str(12//j))\r\n\t\t\t\t\tbreak\r\n\tif t.count(\"X\") == 12:\r\n\t\tl2.append(\"12x1\")\r\n\tl1.append(l2)\r\nfor i in l1:\r\n\tprint(len(i),*i)\r\n", "a=[1,2,3,4,6,12]\r\nfor _ in range(int(input())):\r\n s=input()\r\n b=[]\r\n for i in a:\r\n m=12//i\r\n for j in range(m):\r\n if s[j::m]==\"X\"*i:\r\n b+=[(i,m)]\r\n break\r\n print(len(b), ' '.join(str(x)+\"x\"+str(y) for x,y in b))\r\n ", "t = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n b = []\r\n for n in [1, 2, 3, 4, 6, 12]:\r\n m = 12 // n\r\n for j in range(m):\r\n if s[j::m] == \"X\" * n:\r\n b += [(n, m)]\r\n break\r\n print(len(b), ' '.join(str(x) + \"x\" + str(y) for x, y in b))", "# -*- coding: UTF-8 -*-\r\ndef evaluate(origin_str):\r\n ans = []\r\n for i in [1,2,3,4,6,12]:\r\n last_idx = int(12 / i)\r\n flags = [1 for i in range(0,last_idx)]\r\n if (i == 1):\r\n flag = False\r\n for ch in origin_str:\r\n if (ch == 'X'):\r\n flag = True\r\n if (flag):\r\n ans.append([i,last_idx])\r\n else:\r\n for j in range(0,last_idx):\r\n tmp = []\r\n k = j - last_idx\r\n for x in range(0,i):\r\n k += last_idx\r\n tmp.append(k)\r\n for l in tmp:\r\n ch = origin_str[l]\r\n if (ch != 'X'):\r\n flags[j] = 0\r\n if (sum(flags) != 0):\r\n ans.append([i,last_idx])\r\n s = \"\"\r\n for a in ans:\r\n s += str(a[0])+\"x\"+str(a[1]) + \" \"\r\n print(str(len(ans)) + \" \" + s)\r\n \r\ndef main():\r\n n = int(input())\r\n for i in range(0,n):\r\n evaluate(input())\r\n \r\nmain()", "T=int(input())\r\n\r\nfor t in range(T):\r\n s=input()\r\n ans=0\r\n L=[]\r\n for i in [1,2,3,4,6,12]:\r\n x=i\r\n y=12//x\r\n E=[]\r\n for j in range(12):\r\n if(j%y==0):\r\n E.append(\"\")\r\n E[-1]+=s[j]\r\n for j in range(y):\r\n c=0\r\n for z in range(i):\r\n if(E[z][j]=='X'):\r\n c+=1\r\n if(c==i):\r\n ans+=1\r\n L.append(i)\r\n break\r\n print(ans,end=\" \")\r\n for item in L:\r\n print(item,end=\"x\")\r\n print(12//item,end=\" \")\r\n print()\r\n", "n=int(input())\nfor i in range(n):\n a=input()\n c=0\n p=''\n if 'XXXXXXXXXXXX'==a:\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\n continue\n if 'X' in a:\n p=p+'1x12'\n c+=1\n if 'XX'==(a[0]+a[6]) or 'XX'==(a[1]+a[7]) or 'XX' ==(a[2]+a[8]) or 'XX' ==(a[3]+a[9]) or 'XX' ==(a[4]+a[10]) or 'XX' ==(a[5]+a[11]):\n c+=1\n p+=' 2x6'\n if 'XXX'==(a[0]+a[4]+a[8]) or 'XXX'==(a[1]+a[5]+a[9]) or 'XXX'==(a[2]+a[6]+a[10]) or 'XXX'==(a[3]+a[7]+a[11]):\n p+=' 3x4'\n c+=1\n if 'XXXX'==(a[0]+a[3]+a[6]+a[9]) or 'XXXX'==(a[1]+a[4]+a[7]+a[10]) or 'XXXX'==(a[2]+a[5]+a[8]+a[11]):\n c+=1\n p+=' 4x3'\n if 'XXXXXX'==(a[0]+a[2]+a[4]+a[6]+a[8]+a[10])or 'XXXXXX'==(a[1]+a[3]+a[5]+a[7]+a[9]+a[11]):\n c+=1\n p+=' 6x2'\n print(c,p)\n \n\n else:\n print(0)\n \n", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n s = input()\r\n ans_list = []\r\n for a in [1, 2, 3, 4, 6, 12]:\r\n b = 12 // a\r\n \r\n found = False\r\n for i in range(b):\r\n if \"O\" not in [s[j] for j in range(i, 12, b)]:\r\n found = True\r\n break\r\n if found:\r\n ans_list.append(\"{0}x{1}\".format(a, b))\r\n print(len(ans_list), *ans_list, sep=\" \")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def solve(pos):\r\n ans=[12]\r\n k=1\r\n y=[6,4,3,2]\r\n for i in y:\r\n if pos[0]>i:\r\n break\r\n s=i\r\n found=True\r\n for j in pos:\r\n if j>i:\r\n break\r\n s=j\r\n while s<=12:\r\n if s not in pos:\r\n break\r\n s+=i\r\n if s>12:\r\n found=False\r\n break\r\n if found==False:\r\n ans.append(i)\r\n continue\r\n print(len(ans),end=' ')\r\n for i in ans:\r\n print(\"{0}x{1}\".format(12//i,i),end=' ')\r\n print()\r\n \r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n #f.readline()\r\n #input()\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [t]=get()\r\n for z in range(t):\r\n g=list(input())\r\n if g.count('X')==12:\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n continue\r\n if g.count('X')==0:\r\n print(\"0\")\r\n continue\r\n if g.count('X')==1:\r\n print(\"1 1x12\")\r\n continue\r\n pos=[]\r\n for i in range(12):\r\n if g[i]=='X':\r\n pos.append(i+1)\r\n solve(pos)\r\n \r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "n=int(input())\narr=[12,6,4,3,2,1]\nfor i in range(n):\n x=input()\n final=\"\"\n c=0\n for k in arr:\n ans=[0]*12\n for j in range(0,len(x)):\n if x[j]=='X':\n ans[j%k]+=1 \n if k == 12:\n for j in ans:\n if j == 1:\n c+=1\n final+=\" 1x12\"\n break\n if k == 6:\n for j in ans:\n if j == 2:\n c+=1\n final+=\" 2x6\"\n break\n if k == 4:\n for j in ans:\n if j == 3:\n c+=1\n final+=\" 3x4\"\n break\n if k == 3:\n for j in ans:\n if j == 4:\n c+=1\n final+=\" 4x3\"\n break\n if k == 2:\n for j in ans:\n if j == 6:\n c+=1\n final+=\" 6x2\"\n break\n if k == 1:\n for j in ans:\n if j == 12:\n c+=1\n final+=\" 12x1\"\n break\n print(f\"{c}{final}\")\n #print(ans)", "def test_col(s, a, b, col):\n\tres = True\n\tfor i in range(0, a):\n\t\tif s[i * b + col] != 'X':\t\n\t\t\tres = False\n\treturn res\t\n\ndef test_all_cols(s, a):\n\tb = len(s) // a\n\tif a * b != len(s):\n\t\treturn False\n\telse:\n\t\tres = False\n\t\tfor i in range(0, b):\n\t\t\tres = res or test_col(s, a, b, i)\n\t\treturn res\n\n\t\nn = int(input())\nfor i in range(0, n):\n\ts = input()\n\tslen = len(s)\n\tcvariants = 0 \n\tvariants = \"\"\n\tfor a in range(1, slen + 1):\t\t\n\t\tif (test_all_cols(s, a)):\n\t\t\tcvariants += 1\n\t\t\tvariants += str(a) + \"x\" + str(slen // a) + \" \"\n\tprint(str(cvariants), variants)\n\t\n", "import math\r\nloops = int(input())\r\nfor x in range(loops):\r\n line = input()\r\n line = line.lower()\r\n out = \"\"\r\n sum = 0\r\n for i in range(12):\r\n if line[i] == \"x\":\r\n out = out + \"1x12 \"\r\n sum+=1\r\n break\r\n for i in range(6):\r\n if line[i] == \"x\" and line[i + 6] == \"x\":\r\n out = out + \"2x6 \"\r\n sum+=1\r\n break\r\n for i in range(4):\r\n if line[i] == \"x\" and line[i + 4] == \"x\" and line[i + 8] == \"x\":\r\n out = out + \"3x4 \"\r\n sum+=1\r\n break\r\n for i in range(3):\r\n if line[i] == \"x\" and line[i + 3] == \"x\" and line[i + 6] == \"x\" and line[i + 9] == \"x\":\r\n out = out + \"4x3 \"\r\n sum += 1\r\n break\r\n for i in range(2):\r\n if line[i] == \"x\" and line[i + 2] == \"x\" and line[i + 4] == \"x\" and line[i + 6] == \"x\" and line[i + 8] == \"x\" and line[i + 10] == \"x\":\r\n out = out + \"6x2 \"\r\n sum += 1\r\n break\r\n a = True\r\n for i in range(12):\r\n if line[i] != \"x\":\r\n a = False\r\n break\r\n if a == True:\r\n out = out + \"12x1 \"\r\n sum+= 1\r\n print(str(sum) + \" \" + out[:-1])\r\n", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import *\r\nfrom collections import defaultdict, Counter, deque\r\nfrom sys import stdin, stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\n\r\nt = ninput()\r\nfor _ in range(t):\r\n s = sinput()\r\n n = len(s)\r\n ans = []\r\n for a, b in (1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1):\r\n mat = [s[i:i+b] for i in range(0, n, b)]\r\n for i in range(b):\r\n c = 0\r\n for j in range(a):\r\n if mat[j][i] == 'X': c += 1\r\n if c == a: ans.append([a, b]); break\r\n final = [len(ans)]\r\n for i, j in ans: final.append(str(i) + 'x' + str(j))\r\n printt(\" \".join(map(str, final)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\n \r\nt = int(sys.stdin.readline())\r\n\r\nfor i in range(t):\r\n st = sys.stdin.readline()\r\n p1 = 1\r\n p2 = [1] * 2\r\n p3 = [1] * 3\r\n p4 = [1] * 4\r\n p6 = [1] * 6\r\n p12 = 0\r\n for j in range(1, 13):\r\n v = 0\r\n if(st[j - 1] == 'X'):\r\n v = 1\r\n\r\n p1 &= v\r\n p2[j % 2] &= v\r\n p3[j % 3] &= v\r\n p4[j % 4] &= v\r\n p6[j % 6] &= v\r\n p12 += v\r\n\r\n res = []\r\n if(p12 > 0):\r\n res.append(\"1x12\")\r\n if(sum(p6) > 0):\r\n res.append(\"2x6\")\r\n if(sum(p4) > 0):\r\n res.append(\"3x4\")\r\n if(sum(p3) > 0):\r\n res.append(\"4x3\")\r\n if(sum(p2) > 0):\r\n res.append(\"6x2\")\r\n if(p1 > 0):\r\n res.append(\"12x1\")\r\n\r\n print(str(len(res)) + \" \" + \" \".join(res))\r\n", "\r\n\r\nconstants = [1,2,3,4,6,12]\r\nconstants.reverse()\r\n\r\nif __name__ == '__main__':\r\n k = int(input())\r\n for i in range(k):\r\n value = input()\r\n result = []\r\n\r\n for elem in constants:\r\n matrix = [[value[i] for i in range(k,k+elem)] for k in range(0,12, elem)]\r\n width = len(matrix[0])\r\n length = len(matrix)\r\n\r\n for i in range(width):\r\n matrix_found = True\r\n for j in range(length):\r\n if matrix[j][i] == 'O':\r\n matrix_found = False\r\n break\r\n if matrix_found :\r\n result.append(elem)\r\n break\r\n\r\n print(len(result) , end = ' ')\r\n for elem in result:\r\n print(str(12//elem) +\"x\" + str(elem) , end = ' ')\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\noptions = [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]\r\nt = int(input())\r\nfor _ in range(t):\r\n\tl = list(input())\r\n\twinCount = 0\r\n\twinList = []\r\n\r\n\tfor i in range(6):\r\n\t\toption = options[i]\r\n\t\tfor j in range(option[1]):\r\n\t\t\tco = 0\r\n\t\t\tfor k in range(option[0]):\r\n\t\t\t\tif l[k * option[1] + j] == 'X':\r\n\t\t\t\t\tco += 1\r\n\r\n\t\t\tif co == option[0]:\r\n\t\t\t\twinCount += 1\r\n\t\t\t\twinList.append(option)\r\n\t\t\t\tbreak\r\n\r\n\tprint(winCount, end = ' ')\r\n\tfor i in winList:\r\n\t\tprint(*i, sep = 'x', end = ' ')\r\n\r\n\tprint()", "\r\n\r\ndef decomp(s, n):\r\n\tm = 12 // n\r\n\treturn [s[i::m] for i in range(m)]\r\n\r\ndef check(s):\r\n\treturn all(map(lambda x:x==\"X\", s))\r\n\r\ndef solve(s):\r\n\tres = []\r\n\tfor n in [1, 2, 3, 4, 6, 12]:\r\n\t\td = decomp(s, n)\r\n\t\t#print(n, d)\r\n\t\tif any(map(check, d)):\r\n\t\t\tres.append(f\"{n}x{12//n}\")\r\n\tprint(len(res), *res)\r\n\t\t\r\n\t\r\n#solve(\"OXXXOXOOXOOX\")\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n\tsolve(input())\r\n", "n = int(input())\r\nfor i in range(n):\r\n s = input()\r\n ans = []\r\n for j in [1,2,3,4,6,12]:\r\n k = 12//j\r\n for i in range(k):\r\n if s[i::k] == 'X' * j :\r\n ans+=[(j , k)]\r\n break\r\n print(len(ans),' '.join(str(x)+'x'+str(y) for x , y in ans))", "# coding: utf-8\ndef check(a,b,s,ans):\n for j in range(b):\n if [s[k] for k in range(12) if k%b==j].count('X')==a:\n ans.append('%dx%d'%(a,b))\n return ans\n return ans\nt = int(input())\nfor i in range(t):\n ans = []\n s = input()\n ans = check(1,12,s,ans)\n ans = check(2,6,s,ans)\n ans = check(3,4,s,ans)\n ans = check(4,3,s,ans)\n ans = check(6,2,s,ans)\n ans = check(12,1,s,ans)\n if ans:\n print(len(ans),' '.join(ans))\n else:\n print(0)\n", "t = int(input())\r\nfor i in range (t):\r\n\tword = input()\r\n\ta = []\r\n\tcek = []\r\n\tfor i in [1,2,3,4,6,12]:\r\n\t\tdiv = int(12/i)\r\n\t\tfor u in range (div):\r\n\t\t\tboo = True\r\n\t\t\tj = u\r\n\t\t\twhile j <= 11:\r\n\t\t\t\tif(word[j]=='X'):\r\n\t\t\t\t\tj += div\r\n\t\t\t\telse:\r\n\t\t\t\t\tboo = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif(boo):\r\n\t\t\t\ta.append(i)\r\n\t\t\t\tbreak\r\n\tprint (len(a), end = ' ')\r\n\tfor i in a:\t\r\n\t\tprint (i, 'x', int(12/i), end = ' ', sep = '')\r\n\tprint ()\r\n\t\r\n\t\t\t\t\r\n\t\t\t", "n = int(input())\r\nab = [12, 6, 4, 3, 2, 1]\r\nlst = [list(input()) for i in range(n)]\r\nres = [[0] for i in range(n)] \r\nfor pr in range(n):\r\n for elem in ab:\r\n for i in range(elem):\r\n x = 1\r\n for j in range(0, 12, elem):\r\n if lst[pr][i + j] == \"O\":\r\n x = 0\r\n if x == 1 and str(12 // elem) + \"x\" + str(elem) not in res[pr]: \r\n res[pr][0] += 1\r\n res[pr].append(str(12 // elem) + \"x\" + str(elem))\r\nfor i in range(len(res)):\r\n print(\" \".join(map(str, res[i])))\r\n ", "n = int(input())\r\n\r\nwhile n :\r\n s = input()\r\n cases = [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]\r\n anst = list()\r\n for t in range(6) :\r\n for i in range(cases[t][1]) :\r\n f = False\r\n # if t == 2 :\r\n # print(\"Estou no caracter: %d\" % i)\r\n if s[i] == 'X' :\r\n f = True\r\n # if t == 2 : print(\"Opa, esse caracter e igual a x\")\r\n for j in range(1,cases[t][0]) :\r\n # if t == 2 :\r\n # print(\"Jump: %d\" % (i+(j*cases[t][1])))\r\n # print(\"s[%d] = %s\" % (i, s[i]))\r\n # print(\"s[%d] = %s\" % ((i+(j*cases[t][1])), s[(i+(j*cases[t][1]))]))\r\n aux = s[i+(j*cases[t][1])] == 'X'\r\n f = (aux & f)\r\n # if t == 2 : print(f)\r\n if f :\r\n anst.append(\"%dx%d\" % (cases[t][0], cases[t][1]))\r\n break\r\n else :\r\n f = False\r\n print(len(anst), end=' ')\r\n for i in range(len(anst)) :\r\n print(anst[i], end=' ')\r\n print()\r\n\r\n n-=1\r\n", "testcases = int(input())\nfor k in range(testcases):\n\tjuego = list(input())\n\tcasos = []\n\tf = True\n\te = False\n\td = False\n\tc = False\n\tb = False\n\ta = False\n\tctr = 0\n\tresult = \"\"\n\n\n\tfor k in range(6):\n\t\tif juego[k] == \"X\" and juego[k + 6] == \"X\":\n\t\t\tb = True\n\t\t\tbreak\n\n\tfor k in range(4):\n\t\tif juego[k] == \"X\" and juego[k + 4] == \"X\" and juego[k+8] == \"X\":\n\t\t\tc = True\n\t\t\tbreak\n\n\tfor k in range(3):\n\t\tif juego[k] == \"X\" and juego[k + 3] == \"X\" and juego[k+6] == \"X\" and juego[k + 9] == \"X\":\n\t\t\td = True\n\t\t\tbreak\n\n\tfor k in range(2):\n\t\tif juego[k] == \"X\" and juego[k + 2] == \"X\" and juego[k + 4] == \"X\" and juego[k + 6] == \"X\" and juego[k + 8] == \"X\" and juego[k + 10] == \"X\":\n\t\t\te = True\n\t\t\tbreak\n\t\n\tfor k in range(12):\n\t\tif juego[k] == \"X\":\n\t\t\ta = True\n\t\tif juego[k] == \"O\":\n\t\t\tf = False\n\n\tif a:\n\t\tresult += \" 1x12\"\n\t\tctr += 1\n\tif b:\n\t\tresult += \" 2x6\"\n\t\tctr += 1\n\tif c:\n\t\tresult += \" 3x4\"\n\t\tctr += 1\n\tif d:\n\t\tresult += \" 4x3\"\n\t\tctr += 1\n\tif e:\n\t\tresult += \" 6x2\"\n\t\tctr += 1\n\tif f:\n\t\tresult += \" 12x1\"\n\t\tctr += 1\n\n\tprint(str(ctr) + result)\n\n\n\n\n\n\n\t\t\n# 1535133833533\n", "n=int(input())\r\nfor i in range(n):\r\n\ta=input()\r\n\tans=[]\r\n\tfor j in [1,2,3,4,6,12]:\r\n\t\tif j==1 and \"X\" in a:\r\n\t\t\tans.append(\"1x12\")\r\n\t\t\tcontinue\r\n\t\tfor k in range(12//j):\r\n\t\t\tf=0\r\n\t\t\tfor p in range(k,12,12//j):\r\n\t\t\t\t# print(j,k,p)\r\n\t\t\t\tif a[p]==\"X\":\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telse:\r\n\t\t\t\t\tf=1\r\n\t\t\tif f==0:\r\n\t\t\t\tans.append(\"{}x{}\".format(j,12//j))\r\n\t\t\t\tbreak\r\n\tif len(ans)!=0:\r\n\t\tprint(len(ans),end=\" \")\r\n\t\tprint(*ans)\r\n\telse:\r\n\t\tprint(0)\r\n\r\n", "t = int(input())\r\nfor i in range(t):\r\n s = input().strip()\r\n cnt = 0\r\n ans = []\r\n for b in [1, 2, 3, 4, 6, 12]:\r\n List = []\r\n a = 12 // b\r\n for begin in range(b):\r\n column = ''\r\n j = begin\r\n while j < 12:\r\n column += s[j]\r\n j += b\r\n List.append(column)\r\n #print(i, b, List)\r\n if 'X' * a in List:\r\n cnt += 1\r\n ans.append((a, b))\r\n print(cnt, end = ' ')\r\n for pair in sorted(ans):\r\n print('x'.join(map(str, pair)), end = ' ')\r\n print()\r\n", "for _ in range(int(input())):\r\n s = input()\r\n ans = []\r\n for n in [1, 2, 3, 4, 6, 12]:\r\n m = 12//n\r\n for i in range(m):\r\n if s[i::m]=='X'*n:\r\n ans+=[(n, m)]\r\n break\r\n print(len(ans), ' '.join(str(x) + 'x' + str(y) for (x, y) in ans))", "n = int(input())\nresults = []\nfor i in range(n):\n res = []\n line = list(input())\n for k in range(1,13):\n if 12%k ==0:\n a = 12//k\n b = k\n boleh = False\n for l in range(b):\n count = 0\n for j in range(l, 12, b):\n if line[j] == 'X':\n count+=1\n if count == a:\n boleh = True\n if boleh:\n res.append(str(a) +\"x\"+str(b))\n results.append(res)\n\n\nfor result in results:\n print(str(len(result)),end=' ')\n print(*result[::-1], sep=\" \")\n\n\n \n\n\n\n", "'''\r\nCreated on May 4, 2015\r\n\r\n@author: mohamed265\r\n'''\r\n\r\ndef fun():\r\n num = input()\r\n slon = []\r\n if num.count('X') > 0:\r\n slon.append(\"1x12\")\r\n if num[0] == 'X' and num[6] == 'X' or num[1] == 'X' and num[7] == 'X' or num[2] == 'X' and num[8] == 'X' or num[3] == 'X' and num[9] == 'X' or num[4] == 'X' and num[10] == 'X' or num[5] == 'X' and num[11] == 'X':\r\n slon.append(\"2x6\")\r\n if num[0] == 'X' and num [4] == 'X' and num[8] == 'X' or num[1] == 'X' and num [5] == 'X' and num[9] == 'X' or num[2] == 'X' and num [6] == 'X' and num[10] == 'X' or num[3] == 'X' and num [7] == 'X' and num[11] == 'X':\r\n slon.append(\"3x4\")\r\n if num[0] == 'X' and num[3] == 'X' and num[6] == 'X' and num[9] == 'X' or num[1] == 'X' and num[4] == 'X' and num[7] == 'X' and num[10] == 'X' or num[2] == 'X' and num[5] == 'X' and num[8] == 'X' and num[11] == 'X':\r\n slon.append(\"4x3\")\r\n if num[0] == 'X' and num[2] == 'X' and num[4] == 'X'and num[6] == 'X' and num[8] == 'X' and num[10] == 'X' or num[1] == 'X' and num[3] == 'X' and num[5] == 'X'and num[7] == 'X' and num[9] == 'X' and num[11] == 'X':\r\n slon.append(\"6x2\")\r\n if num.count('X') == 12:\r\n slon.append(\"12x1\") \r\n return slon\r\nt = int(input())\r\nfor i in range(t):\r\n num = fun()\r\n print(len(num) , end =' ')\r\n print(*num)", "t = int(input())\r\nfor i in range(0, t):\r\n str = input()\r\n answer = []\r\n p = [1, 2, 3, 4, 6, 12]\r\n for j in range(0, len(p)):\r\n d1, d2 = p[j], 12 // p[j]\r\n cnt = [0 for h in range(0, d2)]\r\n for i2 in range(0, 12):\r\n tt = i2 % d2\r\n cnt[tt] += (str[i2] == 'X')\r\n ans_cand = False\r\n for i2 in range(0, d2):\r\n if cnt[i2] == d1:\r\n ans_cand = True\r\n if ans_cand:\r\n answer.append('%dx%d' % (d1, d2))\r\n print(len(answer), end = ' ')\r\n for j in range(0, len(answer)):\r\n print(answer[j], end = ' ')\r\n print()", "from functools import reduce\r\nprint(\"\\n\".join([(lambda x:(\"%i %s\" % (len(x), \" \".join(x))))((lambda h:[ \"%ix%i\" % (12//i, i) for i in (12,6,4,3,2,1) if reduce(lambda x, y: x&y, [int(h.replace(\"O\",\"0\").replace(\"X\",\"1\")[i*j:i*j+i],2) for j in range(12//i)], -1)])(input())) for i in range(int(input()))]))", "N = 12\r\nal = [a for a in range(1, N + 1) if N % a == 0]\r\ndef w(s, a):\r\n for c in range(N // a):\r\n if s[c::N // a] == 'X' * a:\r\n return True\r\n return False\r\ndef tc(s):\r\n val = [str(a) + 'x' + str(N // a) for a in al if w(s, a)]\r\n print(len(val), ' '.join(val))\r\nfor t in range(int(input())):\r\n tc(input())", "def vamola(c, n=12):\r\n\tvitorias = set()\r\n\tfor i in [1,2,3,4,6,12]:\r\n\t\tflag = False\r\n\t\tk = 12 // i\r\n\t\tfor d in range(k):\r\n\t\t\tcolun = True\r\n\t\t\tfor j in range(d, 12, k):\r\n\t\t\t\tcolun = colun and c[j]\r\n\t\t\tflag = flag or colun\r\n\t\tif flag:\r\n\t\t\tvitorias.add(i)\r\n\tmsg = \"\";\r\n\tfor i in vitorias:\r\n\t\tmsg += str(i)+\"x\"+str(12//i) + \" \"\r\n\treturn str(len(vitorias)) + \" \" + msg[:len(msg)-1]\r\n\r\nx = int(input())\r\nfor c in range(x):\r\n\td = input()\r\n\tteste = []\r\n\tfor j in range(12):\r\n\t\tif d[j] == \"O\":\r\n\t\t\tteste.append(False)\r\n\t\telse:\r\n\t\t\tteste.append(True)\r\n\tprint(vamola(teste))", "n = int(input())\r\nfor i in range(n):\r\n x = input()\r\n res = []\r\n for j in [1, 2, 3, 4, 6, 12]:\r\n valid = False\r\n for k in range(12 // j):\r\n s = set(x[k :: 12//j])\r\n if len(s) == 1 and 'X' in s:\r\n valid = True\r\n break\r\n if valid:\r\n res.append(\"{}x{}\".format(j, 12//j))\r\n print(len(res), ' '.join(res))\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n t = I()\r\n for _ in range(t):\r\n s = S()\r\n c = s.count('X')\r\n res = []\r\n fact = [2,3,4,6,12]\r\n if c:\r\n res.append('1x12')\r\n for f in fact:\r\n mat = []\r\n ff = 12//f\r\n for i in range(0, len(s), ff):\r\n row = s[i:i+ff]\r\n mat.append(row)\r\n d = defaultdict(int)\r\n for j in mat:\r\n lenrow = len(j)\r\n for k in range(lenrow):\r\n if j[k]=='X':\r\n d[k]+=1\r\n ma = max(d.values())\r\n if ma >= f:\r\n string = str(f)+'x'+str(ff)\r\n res.append(string)\r\n print(len(res), *res)\r\n\r\nif __name__ == '__main__':\r\n main()", "#!/usr/bin/env python3\r\n\r\ndef read_ints():\r\n\treturn map(int, input().strip().split())\r\n\r\nt, = read_ints()\r\n\r\nfor _ in range(t):\r\n\tx = input()\r\n\r\n\tcorrect = []\r\n\r\n\tfor a in [1, 2, 3, 4, 6, 12]:\r\n\t\tcor = False\r\n\t\tfor c in range(0, 12//a):\r\n\t\t\ts = set(x[c::12//a])\r\n\r\n\t\t\tif len(s)==1 and 'X' in s:\r\n\t\t\t\tcor = True\r\n\t\t\t\tbreak\r\n\r\n\t\tif cor == True:\r\n\t\t\tcorrect.append(\"{}x{}\".format(a, 12//a))\r\n\t\r\n\tprint(len(correct), ' '.join(correct))", "n = int(input())\n\na = [1, 2, 3, 4, 6, 12]\n\nfor i in range(0, n):\n\ts = str(input())\n\tans = [False for x in range(0, 6)]\n\tnans = 0;\n\n\tfor i in range (0, 6):\n\t\tfor j in range (0, 12 // a[i]):\n\t\t\tgood = True\n\t\t\tfor k in range(0, a[i]):\n\t\t\t\tif s[k * 12 // a[i] + j] is 'O':\n\t\t\t\t\tgood = False\n\t\t\t\t\tbreak\n\t\t\tif good:\n\t\t\t\tnans = nans + 1\n\t\t\t\tans[i] = True\n\t\t\t\tbreak\n\n\tprint(nans, end = ' ')\n\tfor i in range (0, 6):\n\t\tif ans[i]:\n\t\t\tprint(str(a[i]) + 'x' + str(12 // a[i]), end = ' ')\n\tprint()\n", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n c=input()\r\n l.append(c)\r\n\r\nfor i in range(a):\r\n p=l[i]\r\n s=[]\r\n for i in range(12):\r\n if p[i]==\"X\":\r\n s.append(\"1x12\")\r\n break\r\n for i in range(6):\r\n if p[i]==\"X\" and p[i+6]==\"X\":\r\n s.append(\"2x6\")\r\n break\r\n for i in range(4):\r\n if p[i]==p[i+4]==p[i+8]==\"X\":\r\n s.append(\"3x4\")\r\n break\r\n for i in range(3):\r\n if p[i]==p[i+3]==p[i+6]==p[i+9]==\"X\":\r\n s.append(\"4x3\")\r\n break\r\n for i in range(2):\r\n m=1\r\n for j in range(i,12,2):\r\n if p[j]!=\"X\":\r\n m=0\r\n break\r\n if m==1:\r\n s.append(\"6x2\")\r\n break\r\n t=0\r\n for i in range(12):\r\n \r\n if p[i]!=\"X\":\r\n \r\n t=1\r\n \r\n break\r\n \r\n if t==0:\r\n s.append(\"12x1\")\r\n \r\n if len(s)==0:\r\n print(0)\r\n else:\r\n \r\n o=len(s)\r\n r=str(o)\r\n for k in range(len(s)):\r\n r=r+\" \"+s[k]\r\n print(r)", "t = int(input())\r\nN = 12\r\ndivisors = [1,2,3,4,6,12]\r\nL = 6\r\n\r\nfor _ in range(t):\r\n cards = input()\r\n goodDivs = []\r\n for k in range(L):\r\n numCols = divisors[k]\r\n state = [True] * numCols\r\n for m in range(N):\r\n if cards[m] == 'O':\r\n state[m % numCols] = False\r\n if any(state):\r\n goodDivs.append(numCols)\r\n\r\n print(len(goodDivs), end=' ')\r\n for k in range(len(goodDivs)-1, -1, -1):\r\n print(f\"{N//goodDivs[k]}x{goodDivs[k]}\", end=' ')\r\n print()\r\n", "a=[1,2,3,4,6,12]\r\nfor _ in[0]*int(input()):\r\n b=input()\r\n z=[]\r\n for r,c in zip(a,a[::-1]):\r\n d=[]\r\n for k in range(r):\r\n d+=[b[k*c:(k+1)*c]]\r\n if any(''.join(x)=='X'*r for x in[*zip(*d)]):\r\n z+=[f'{r}x{c}']\r\n print(len(z),*z)\r\n ", "# Made By Mostafa_Khaled \nbot = True \nq = [12, 6, 4, 3, 2, 1]\n\np = {12 // i: 'X' * i for i in q}\n\nr = {i: str(12 // i) + 'x' + str(i) for i in q}\n\nfor i in range(int(input())):\n\n s, t = [], input()\n\n for j in q:\n\n if any(t[k :: j] == p[j] for k in range(j)): s.append(r[j])\n\n print(len(s), ' '.join(s))\n\n# Made By Mostafa_Khaled", "t = int(input())\r\n\r\nfor i in range(t):\r\n\ts = input()\r\n\tl = []\r\n\t\r\n\tfor j in range(1, 13):\r\n\t\tx = 0\r\n\t\t\r\n\t\tif 12 % j == 0:\t\t\t\r\n\t\t\tfor k in range(j):\r\n\t\t\t\tif s[k:12:j] == \"X\" * (12 // j):\r\n\t\t\t\t\tx = 1\r\n\t\t\t\t\t\r\n\t\tif x == 1:\r\n\t\t\tl.insert(0, f\"{12 // j}x{j}\")\t\t\t\t\r\n\t\t\t\t\r\n\tprint(len(l), \" \".join(list(map(str, l))))\t\t\t\t", "t = int(input())\r\nans = [[] for i in range(t)]\r\nfor i in range(t):\r\n \r\n s = input() \r\n for a in range(1, 13):\r\n \r\n \r\n if 12 % a != 0:\r\n continue\r\n b = 12 // a\r\n c = [[] for h in range(b)]\r\n for h in range(b):\r\n for k in range(a):\r\n c[h].append(s[k * b + h])\r\n if a == 3:\r\n a = 3 \r\n T = True\r\n for h in range(b):\r\n if T:\r\n ok = True\r\n for k in range(a):\r\n if c[h][k] == 'O':\r\n ok = False\r\n if ok:\r\n ans[i].append([a, b])\r\n T = False\r\n break\r\nfor i in range(t):\r\n print(len(ans[i]), end = ' ')\r\n for z in ans[i]:\r\n print(z[0], end = '')\r\n print('x', end= '')\r\n print(z[1], end = ' ')\r\n print()\r\n", "def solve(matriz):\r\n n = len(matriz)\r\n m = len(matriz[0])\r\n \r\n for j in range(m):\r\n curr = True\r\n for i in range(n):\r\n if matriz[i][j] == 'O':\r\n curr = False\r\n break\r\n if curr:\r\n return True\r\n \r\n return False\r\n\r\ndef gera_matriz(s, e):\r\n ans = []\r\n \r\n for i in range(0, len(s), e[1]):\r\n ans.append(s[i:i+e[1]])\r\n \r\n return ans \r\n\r\nt = int(input())\r\npos = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)];\r\n\r\nfor i in range(t):\r\n s = input()\r\n ans = []\r\n \r\n for e in pos:\r\n matriz = gera_matriz(s, e)\r\n \r\n if solve(matriz):\r\n ans.append(e)\r\n \r\n tmp = []\r\n for e in ans:\r\n tmp.append(str(e[0]) + 'x' + str(e[1]))\r\n \r\n print(f'{len(ans)} {\" \".join(tmp)}')", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n good = []\r\n for g in (1, 2, 3, 4, 6, 12):\r\n for i in range(g):\r\n cnt = 0\r\n for j in range(12 // g):\r\n cnt += 1 if s[i + j * g] == 'X' else 0\r\n if cnt == 12 // g:\r\n good.append(g)\r\n break\r\n print(len(good), end=' ')\r\n for c in sorted(good, reverse=True):\r\n print(str(12 // c) + 'x' + str(c), end=' ')\r\n print()", "#!/usr/local/bin/python33\nn = int(input())\n\nfor i in range(n):\n\tcnt = 0\n\tansw = ['1x12', '2x6', '3x4', '4x3', '6x2', '12x1']\n\tanswb = [False, False, False, False, False, False]\n\tinstr = input()\n\n\tif 'X' in instr:\n\t\tcnt += 1\n\t\tanswb[0] = True\n\tfor j in range(6):\n\t\tif (instr[j] == instr[6 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[1] = True\n\t\t\tbreak\n\tfor j in range(4):\n\t\tif (instr[j] == instr[4 + j] == instr[8 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[2] = True\n\t\t\tbreak\n\tfor j in range(3):\n\t\tif (instr[j] == instr[3 + j] == instr[6 + j] == instr[9 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[3] = True\n\t\t\tbreak\n\tfor j in range(2):\n\t\tif (instr[j] == instr[2 + j] == instr[4 + j] == instr[6 + j] == instr[8 + j] == instr[10 + j] == 'X'):\n\t\t\tcnt += 1\n\t\t\tanswb[4] = True\n\t\t\tbreak\n\tif not 'O' in instr:\n\t\tcnt += 1\n\t\tanswb[5] = True\n\n\tprint(cnt, end = ' ')\n\tfor i in range(6):\n\t\tif answb[i]:\n\t\t\tprint(answ[i], end = ' ')\n\tprint()", "As= [1, 2, 3, 4, 6, 12]\r\n\r\nC = int(input())\r\n\r\nfor c in range(C):\r\n S = list(input())\r\n ans = []\r\n for a in As:\r\n b = 12 // a\r\n fre = [0] * 12\r\n for i,q in enumerate(S):\r\n if q == 'X':\r\n fre[i % a] += 1\r\n if max(fre) >= b:\r\n ans += [a]\r\n \r\n print(len(ans),end= ' ')\r\n ans.sort(reverse=True)\r\n for a in ans:\r\n print(str(12//a) + 'x' + str(a),end=' ')\r\n print()", "def do(string):\r\n num = 0\r\n ok = []\r\n for i in [12, 6, 4, 3, 2, 1]:\r\n for j in range(0, i):\r\n if string[j::i] == 'X' * int(12/i):\r\n ok.append(str(int(12/i))+'x'+str(i))\r\n num += 1\r\n break\r\n\r\n ok = [str(num)] + ok\r\n print(' '.join(ok))\r\n\r\nfor i in range(int(input())):\r\n do(input())\r\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = [1,2,3,4,6,12]\r\n\r\nfor i in range(n):\r\n s = stdin.readline()\r\n ans = list()\r\n for x in a:\r\n p = 12//x\r\n for start in range(1,p+1):\r\n flag = True\r\n for col in range(0,x):\r\n if s[start-1 + col*p] != 'X':\r\n flag = False\r\n if flag:\r\n ans.append(\" \"+str(x)+\"x\"+str(p))\r\n break\r\n stdout.write(str(len(ans)))\r\n for st in ans:\r\n stdout.write(st)\r\n stdout.write(\"\\n\")\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ntests = int(input())\r\nfor _ in range(tests):\r\n m = input()\r\n res = []\r\n for i in [1, 2, 3, 4, 6, 12]:\r\n j = 12 // i\r\n flag = False\r\n\r\n for kk in range(j):\r\n stmp = ''\r\n if flag:\r\n break\r\n for k in range(i):\r\n stmp += m[k * j + kk]\r\n # print(stmp)\r\n if stmp.count('X') == len(stmp):\r\n res.append(i)\r\n flag = True\r\n break\r\n\r\n print(len(res), end=' ')\r\n for r in res:\r\n print('{}x{}'.format(r, 12//r), end=' ')\r\n print()\r\n", "t = int(input())\r\nfor i in range(t):\r\n ans = []\r\n s = input()\r\n e = [(1,12),(2,6),(3,4),(4,3),(6,2),(12,1)]\r\n for q in e:\r\n a = q[0]\r\n b = q[1]\r\n for i in range(b):\r\n w = True\r\n for j in range(i,12,b):\r\n if s[j] != 'X':\r\n w = False\r\n if w:\r\n ans.append(q)\r\n break\r\n print(len(ans), *map(lambda x:str(x[0])+'x'+str(x[1]), ans))", "def is_win(s, b):\r\n for j in range(b):\r\n if all(['X' in s[i * b + j] for i in range(12 // b)]):\r\n return True\r\n return False\r\n\r\ndef solve():\r\n s = input()\r\n bb = []\r\n for b in [12, 6, 4, 3, 2, 1]:\r\n if is_win(s, b):\r\n bb.append(b)\r\n ans = [str(len(bb))]\r\n for b in bb:\r\n ans.append(str(12//b) + 'x' + str(b))\r\n print(*ans)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n solve()", "t=int(input())\r\nfor i in range(t):\r\n f=input()\r\n if(f==\"XXXXXXXXXXXX\"):\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n elif(f==\"OOOOOOOOOOOO\"):\r\n print(\"0\")\r\n else:\r\n l=list(f)\r\n nb=0\r\n st=\"\"\r\n if(\"X\" in l):\r\n st+=\"1x12\"\r\n nb+=1\r\n for i in range(6):\r\n if(l[i]==\"X\" and l[i+6]==\"X\"):\r\n st+=\" 2x6\"\r\n nb+=1\r\n break\r\n for i in range(4):\r\n if(l[i]==\"X\" and l[i+4]==\"X\" and l[i+8]==\"X\"):\r\n st+=\" 3x4\"\r\n nb+=1\r\n break\r\n for i in range(3):\r\n if(l[i]==\"X\" and l[i+3]==\"X\" and l[i+6]==\"X\" and l[i+9]==\"X\"):\r\n st+=\" 4x3\"\r\n nb+=1\r\n break\r\n for i in range(2):\r\n if(l[i+2]==\"X\" and l[i+4]==\"X\" and l[i+6]==\"X\" and l[i+8]==\"X\" and l[i+10]==\"X\" and l[i]==\"X\"):\r\n nb+=1\r\n st+=\" 6x2\"\r\n print(nb,st)\r\n\r\n\r\n", "n=int(input())\r\nar=[[1,12],[2,6],[3,4],[4,3],[6,2],[12,1]]\r\nfor _ in range(n):\r\n s=str(input())\r\n cou=0\r\n ans=\"\"\r\n skip=False\r\n for it in ar:\r\n a,b=it\r\n skip=False\r\n for j in range(b):\r\n if(skip):\r\n continue\r\n if(s[j]==\"X\"):\r\n if(a==1):\r\n ans+=f\" {a}x{b}\"\r\n cou+=1\r\n skip=True\r\n for i in range(1,a):\r\n if(s[i*b + j]!=\"X\"):\r\n break\r\n if(i==(a-1)):\r\n ans+=f\" {a}x{b}\"\r\n cou+=1\r\n skip=True\r\n ans=f\"{cou}\"+ans\r\n print(ans)", "# http://codeforces.com/contest/400/problem/0\r\n# Codeforces : A. Inna and choose options\r\n\r\nliste_a = (1, 2, 3, 4, 6, 12)\r\nliste_results = []\r\n\r\ndef process(essai):\r\n global liste_results\r\n liste_av = [0]\r\n for a in liste_a:\r\n b = 12 // a\r\n for r in range(b):\r\n if essai[r::b] == 'X'*a:\r\n liste_av[0] += 1\r\n liste_av.append('{}x{}'.format(a,b))\r\n break\r\n liste_av[0] = str(liste_av[0])\r\n liste_results.append(liste_av)\r\n\r\n\r\n\r\n\r\nt = int(input())\r\nfor k in range(t):\r\n essai = input()\r\n process(essai)\r\n\r\nfor s in liste_results:\r\n print(*s)\r\n", "testcases = int(input())\r\nwhile True:\r\n testcases -= 1\r\n if testcases < 0:\r\n break\r\n cards = list(input())\r\n possibilities = [[True, 1, 12], [True, 2, 6], [True, 3, 4], [True, 4, 3], [True, 6, 2], [True, 12, 1]]\r\n possible = 6\r\n for k in range(6):\r\n p = possibilities[k]\r\n ok = [1] * p[2]\r\n for i in range(12):\r\n if cards[i] == 'O':\r\n ok[i % p[2]] = 0\r\n if sum(ok) == 0:\r\n possibilities[k][0] = False\r\n possible -= 1\r\n print(possible, ' ', end='', sep='')\r\n for p in possibilities:\r\n if p[0]:\r\n print(' ', p[1], 'x', p[2], end='', sep='')\r\n print()\r\n\r\n", "def q400a():\n\tn = int(input())\n\tfor i in range(n):\n\t\tq400a_process_case(input())\n\ndef q400a_process_case(case):\n\toutputs = []\n\tif('X' in case):\n\t\toutputs.append('1x12 ')\n\tif(check_one_shape(case, 6)):\n\t\toutputs.append('2x6 ')\n\tif(check_one_shape(case, 4)):\n\t\toutputs.append('3x4 ')\n\tif(check_one_shape(case, 3)):\n\t\toutputs.append('4x3 ')\n\tif(check_one_shape(case, 2)):\n\t\toutputs.append('6x2 ')\n\tif(case == 'XXXXXXXXXXXX'):\n\t\toutputs.append('12x1')\n\tif(len(outputs) == 0):\n\t\tprint(0)\n\telse:\n\t\tstr1 = \"%d \" + \"%s \" * (len(outputs))\n\t\tprint(str1%(len(outputs), *outputs))\n\ndef check_one_shape(case, shape):\n\tfor i in range(shape):\n\t\tcorrect = 'X' * (12//shape)\n\t\tif(case[int(i):int(12):int(shape)] == correct):\n\t\t\treturn True\n\treturn False\n\nq400a()", "def main():\n res = []\n for _ in range(int(input())):\n l, s = [None], input()\n for b, sig in (12, '1x12'), (6, '2x6'), (4, '3x4'), (3, '4x3'), (2, '6x2'), (1, '12x1'):\n if not all(s[_::b].count('O') for _ in range(b)):\n l.append(sig)\n l[0] = str(len(l) - 1)\n res.append(' '.join(l))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n t = I()\r\n for _ in range(t):\r\n s = S()\r\n c = s.count('X')\r\n res = []\r\n fact = [1,2,3,4,6,12]\r\n if c:\r\n for f in fact:\r\n ff = 12//f\r\n d = defaultdict(int)\r\n for i in range(0, len(s), ff):\r\n row = s[i:i+ff]\r\n for j in range(len(row)):\r\n if row[j]=='X':\r\n d[j]+=1\r\n ma = max(d.values())\r\n if ma >= f:\r\n res.append(str(f)+'x'+str(ff))\r\n print(len(res), *res)\r\n\r\nif __name__ == '__main__':\r\n main()", "'''\r\nCreated on 27.4.2016\r\n\r\n@author: Ivan\r\n'''\r\n\r\nimport sys\r\ndef main():\r\n n = int(input())\r\n list = []\r\n for i in range(0, n):\r\n list.append(input())\r\n \r\n for l in list:\r\n rez = []\r\n for i in range(1, 13):\r\n if 12 % i == 0:\r\n a = i \r\n b = 12 // i \r\n parts = [l[k:k + b] for k in range(0, 12, b)]\r\n for k in range(0, b):\r\n flag = True\r\n for p in parts:\r\n if p[k] == 'O':\r\n flag = False\r\n break\r\n if flag:\r\n rez.append(str(a) + \"x\" + str(b))\r\n break\r\n sys.stdout.write(str(len(rez)) + \" \")\r\n for i in rez:\r\n sys.stdout.write(i + \" \")\r\n print()\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "t = int(input())\r\ndividers = [1, 2, 3, 4, 6, 12]\r\nfor test in range(t):\r\n s = input()\r\n ans = []\r\n for k in dividers:\r\n for j in range(12 // k):\r\n cnt = 0\r\n for i in range(k):\r\n if s[i * (12 // k) + j] == 'X':\r\n cnt += 1\r\n if cnt == k:\r\n ans.append(str(k) + 'x' + str(12 // k))\r\n break\r\n print(len(ans), ' '.join(map(str, ans)))\r\n", "divisions = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]\n\ndef check(s, a, b):\n\tfor i in range(b):\n\t\tif s[i:: b] == 'X' * a:\n\t\t\treturn True\n\treturn False\n\ndef solve():\n\ts = input()\n\tans = []\n\tfor division in divisions:\n\t\tif check(s, *division):\n\t\t\tans.append(str(division[0]) + 'x' + str(division[1]))\n\tprint(len(ans), ' '.join(ans))\n\nt = int(input())\nfor i in range(t):\n\tsolve()\n", "from collections import Counter\r\n\r\ndef solve(twelve):\r\n if \"X\" not in twelve: \r\n return \"0\"\r\n xs = {i for i, c in enumerate(twelve) if c == \"X\"}\r\n sol = ['1x12']\r\n for a in [2,3,4,6,12]:\r\n b = 12 // a\r\n if len(xs) == 12:\r\n sol.append(f'{a}x{b}')\r\n else:\r\n s = [x % b for x in xs]\r\n cn = Counter(s)\r\n if any(v == a for v in cn.values()):\r\n sol.append(f'{a}x{b}')\r\n return f'{len(sol)} ' + \" \".join(sol)\r\n\r\nres = []\r\nfor _ in range(int(input())):\r\n res.append(solve(input()))\r\nprint(\"\\n\".join(str(x) for x in res))", "num = int(input())\r\nstrings = [\"1x12\", \"2x6\", \"3x4\", \"4x3\", \"6x2\", \"12x1\"]\r\n\r\n\r\n# 1x12 2x6 3x4 4x3 6x2 12x1\r\nfor i in range(num):\r\n lista = [0] * 6\r\n row = input()\r\n\r\n for j in range(12):\r\n if row[j] == \"X\":\r\n lista[0] = 1\r\n break\r\n \r\n for j in range(6):\r\n if row[j] == row[j+6] == \"X\":\r\n lista[1] = 1\r\n break\r\n \r\n for j in range(4):\r\n if row[j] == \"X\" and row[j+4] == \"X\" and row[j+8] == \"X\":\r\n lista[2] = 1\r\n break\r\n \r\n for j in range(3):\r\n if row[j] == row[j+3] == row[j+6] == row[j+9] == \"X\":\r\n lista[3] = 1\r\n break\r\n \r\n for j in range(2):\r\n if row[j] == row[j+2] == row[j+4] == row[j+6] == row[j+8] == row[j+10] == \"X\":\r\n lista[4] = 1\r\n break\r\n \r\n equalsX = True\r\n for j in range(12):\r\n if row[j] != \"X\":\r\n equalsX = False\r\n if equalsX: lista[5] = 1\r\n\r\n total = 0\r\n saida = \"\"\r\n for j in range(6):\r\n if lista[j]:\r\n total += 1\r\n saida += strings[j] + \" \"\r\n print((str(total) + \" \" + saida).strip())", "for _ in range(int(input())):\r\n cards = input()\r\n count = 0\r\n output = ''\r\n if 'X' in cards:\r\n count += 1\r\n output += ' 1x12'\r\n for q, p in zip(cards[:6], cards[6:]):\r\n if q == p == 'X':\r\n count += 1\r\n output += ' 2x6'\r\n break\r\n for q, p, r in zip(cards[:4], cards[4:8], cards[8:]):\r\n if q == p == r == 'X':\r\n count += 1\r\n output += ' 3x4'\r\n break\r\n for q, p, r, s in zip(cards[:3], cards[3:6], cards[6:9], cards[9:]):\r\n if q == p == r == s == 'X':\r\n count += 1\r\n output += ' 4x3'\r\n break\r\n for q, p, r, s, t, u in zip(cards[:2], cards[2:4], cards[4:6], cards[6:8], cards[8:10], cards[10:]):\r\n if q == p == r == s == t == u == 'X':\r\n count += 1\r\n output += ' 6x2'\r\n break\r\n if 'O' not in cards:\r\n count += 1\r\n output += ' 12x1'\r\n print(str(count) + output)", "\nfor _ in range(int(input())):\n s=input().strip()\n sol=[]\n l=[1, 2, 3, 4, 6, 12]\n for i in l:\n for j in range(0, i):\n if set(s[j::i])==set('X'):\n sol.append((12/i, i))\n break;\n sol.sort()\n if len(sol)>0:\n print(len(sol), end=\" \")\n for x in sol:\n print(\"%dx%d\"%(x[0], x[1]), sep=\" \", end=\" \")\n else:\n print(0, end='')\n print()", "t = int(input())\nfor _ in range(t):\n s = input()\n res, n = [], len(s)\n for a in [1, 2, 3, 4, 6, 12]:\n b = 12 // a\n for i in range(b):\n if all(s[j] == \"X\" for j in range(i, n, b)):\n res.append(f\"{a}x{b}\")\n break\n if res:\n print(len(res), *res)\n else:\n print(\"0\")\n", "factors = [12, 6, 4, 3, 2, 1]\r\nn = int(input())\r\nchoices = []\r\nfor x in range(n):\r\n s = input()\r\n numbers = []\r\n for y in factors:\r\n rows = []\r\n for x in range(0, 12, y):\r\n rows.append(list(s[x:x + y]))\r\n columns = [[p[q] for p in rows] for q in range(y)]\r\n row = [\"X\" for p in range(12 // y)]\r\n if row in columns:\r\n numbers.append(y)\r\n choices.append(numbers)\r\nfor x in choices:\r\n print(len(x), end = \" \")\r\n for y in x:\r\n print(\"%dx%d\" % (12 // y, y), end = \" \")\r\n print()", "def mat_maker(b, row):\r\n mat = []\r\n col = []\r\n for idx, val in enumerate(row):\r\n col.append(val)\r\n if (idx + 1) % b == 0:\r\n mat.append(col)\r\n col = []\r\n\r\n return col_checker(mat, b)\r\n \r\ndef col_checker(mat, b):\r\n col = []\r\n ans = False\r\n a = 12 // b\r\n for i in range(b):\r\n col = []\r\n for j in range(a):\r\n col.append(mat[j][i])\r\n if set(col) == {'X'}:\r\n ans = True\r\n break\r\n return ans\r\n\r\nn = int(input())\r\nmatrix = []\r\nfor _ in range(n):\r\n tmp = list(input())\r\n matrix.append(tmp)\r\n\r\nbs = [12, 6, 4, 3, 2, 1]\r\n\r\nfor row in matrix:\r\n ans = []\r\n for b in bs:\r\n ok = mat_maker(b, row)\r\n if ok:\r\n ans.append(f\"{12//b}x{b}\")\r\n ans.insert(0, len(ans))\r\n print(*ans)\r\n ans = []\r\n", "def f(x):\r\n return str(12//x)+'x'+str(x)\r\n\r\n\r\na=[12,6,4,3,2,1]\r\nt=int(input())\r\nfor i in range(t):\r\n ans=[]\r\n s=input()\r\n for y in a:\r\n for j in range(y):\r\n if s[j::y].count('X') == 12//y:\r\n ans += [y]\r\n break\r\n print(len(ans), ' '.join(list(map(f, ans))))", "t = int(input())\r\nc = [(1, 12), (2, 6), (3, 4), (4, 3), (6, 2), (12, 1)]\r\nfor i in range(t):\r\n xo = list(input())\r\n\r\n d = []\r\n b = xo.count('X')\r\n if b > 0:\r\n d.append(c[0])\r\n\r\n for j in c[1:5]:\r\n for x in range(j[1]):\r\n yes = True\r\n for k in range(j[0]):\r\n if xo[k * j[1] + x] != 'X':\r\n yes = False\r\n break\r\n if yes:\r\n d.append(j)\r\n break\r\n\r\n if b == 12:\r\n d.append(c[5])\r\n\r\n print(len(d), end=\" \")\r\n for j in d:\r\n print(str(j[0]) + 'x' + str(j[1]), end=\" \")\r\n print()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n s = input()[:-1]\r\n d = []\r\n l = [1,2,3,4,6,12]\r\n for j in l:\r\n k = 12//j\r\n for i in range(k):\r\n if s[i::k] == 'X' * j:\r\n d += [str(j)+'x'+str(k)]\r\n break\r\n print(len(d), ' '.join(d))", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nimport datetime as dt\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n N = lambda: int(input())\r\n\r\n t = N()\r\n a, r = [1, 2, 3, 4, 6, 12], list()\r\n\r\n while t > 0:\r\n s = input()\r\n for i in a:\r\n for j in range(12//i):\r\n if s[j::12//i].count(\"X\") == i:\r\n r.append(\"%sx%s\" % (i, 12//i))\r\n break\r\n print(len(r), *r)\r\n r.clear()\r\n t -= 1", "memo = [1, 2, 3, 4, 6, 12]\r\n\r\nfor _ in range(int(input())):\r\n data = list(input())\r\n \r\n ans = []\r\n for i in memo:\r\n for j in range(12 // i):\r\n flag = True\r\n for k in range(j, 12, 12 // i):\r\n if data[k] != 'X':\r\n flag = False\r\n if flag:\r\n ans.append(i)\r\n break\r\n\r\n print(len(ans), end=' ')\r\n if len(ans) != 0:\r\n for i in ans:\r\n print(str(i) + 'x' + str(12 // i), end=' ')\r\n\r\n print()", "n = int(input())\r\np = 0\r\nf = True\r\nfor k in range(n):\r\n s = input().strip()\r\n ot = set()\r\n for i in range(1, 13):\r\n if i == 5 or i == 7 or i == 9 or i == 10 or i == 11 or i == 8:\r\n continue\r\n for t in range(i):\r\n p = True\r\n for j in range(t, 12, i):\r\n if s[j] == 'O':\r\n p = False\r\n if p:\r\n ot.add(i)\r\n ot = list(reversed(sorted(list(ot))))\r\n print(len(ot), end = ' ')\r\n for i in ot:\r\n print(str(12//i)+'x'+str(i), end = ' ')\r\n print()", "from functools import reduce\r\n\r\ndef sol(l):\r\n if not \"X\" in l: return \"0\"\r\n l = l.replace(\"O\",\"0\").replace(\"X\",\"1\")\r\n res = [ \"%ix%i\" % (12//i, i) for i in (12,6,4,3,2,1) if reduce(lambda x, y: x&y, [int(l[i*j:i*j+i],2) for j in range(12//i)], -1)]\r\n return (\"%i %s\" % (len(res), \" \".join(res)))\r\n\r\nn = int(input())\r\nprint(\"\\n\".join([sol(input()) for i in range(n)]))", "t=int(input())\r\nfor _ in range(t):\r\n s=input()\r\n l=[]\r\n m1=[str(i) for i in s]\r\n m2=[s[0]+s[6],s[1]+s[7],s[2]+s[8],s[3]+s[9],s[4]+s[10],s[5]+s[11]]\r\n m4=[s[0]+s[3]+s[6]+s[9],s[1]+s[4]+s[7]+s[10],s[2]+s[5]+s[8]+s[11]]\r\n m3=[s[0]+s[4]+s[8],s[1]+s[5]+s[9],s[2]+s[6]+s[10],s[3]+s[7]+s[11]]\r\n m5=[s[0]+s[2]+s[4]+s[6]+s[8]+s[10],s[1]+s[3]+s[5]+s[7]+s[9]+s[11]]\r\n m6=[s[0]+s[1]+s[2]+s[3]+s[4]+s[5]+s[6]+s[7]+s[8]+s[9]+s[10]+s[11]]\r\n if \"X\"*1 in m1:\r\n l.append(\"1x12\")\r\n if \"X\"*2 in m2:\r\n l.append(\"2x6\")\r\n if \"X\"*3 in m3:\r\n l.append(\"3x4\")\r\n if \"X\"*4 in m4:\r\n l.append(\"4x3\")\r\n if \"X\"*6 in m5:\r\n l.append(\"6x2\")\r\n if \"X\"*12 in m6:\r\n l.append(\"12x1\")\r\n print(len(l),end=\" \")\r\n print(*l)\r\n \r\n \r\n\r\n\r\n", "def isMatch(n,s):\n x = 12//n\n res = []\n for i in range(0,len(s),x):\n res.append(s[i:i+x])\n for col in range(x):\n for row in range(len(res)):\n if res[row][col] != 'X':\n break\n elif res[row][col] == 'X' and row == len(res)-1 :\n return True \n return False\n\ndef solve(s):\n res = []\n if 'X' in s:\n res.append(\"1x12\")\n for i in [2,3,4,6]:\n if isMatch(i,s):\n res.append(f'{i}x{12//i}')\n if s == 12*'X':\n res.append(\"12x1\")\n \n print(len(res),sep=\" \",end=\" \")\n print(*res) \n \n\n\ndef main() :\n # n,k = list(map(int, input().split(' ')))\n n = int(input())\n # arr = input().split(' ')\n # s = input()\n # res=''\n arr = []\n for _ in range(n):\n i = input()\n arr.append(i)\n \n for i in arr:\n solve(i)\n\nmain()\n", "t = int(input())\r\nn = 12\r\nwhile t > 0:\r\n ans = []\r\n t = t - 1\r\n s = input()\r\n for i in range(n):\r\n r = i+1\r\n if n%r != 0:\r\n continue\r\n c = n//r\r\n flag = False\r\n for j in range(c):\r\n id = j\r\n ff = False\r\n while id < n:\r\n if s[id] != 'X':\r\n ff = True\r\n break\r\n id = id + c\r\n if ff == False:\r\n flag = True\r\n break\r\n if flag == True:\r\n ans.append((r, c))\r\n\r\n print(len(ans), end = '')\r\n for i in range(len(ans)):\r\n print(' ', ans[i][0], 'x', ans[i][1], sep = '', end = '')\r\n print('')\r\n", "def ok(s , a , b):\r\n mat = []\r\n for i in range(0 , len(s) , b):\r\n mat.append(s[i:i+b])\r\n\r\n for j in range(b):\r\n c = 0\r\n for i in range(a):\r\n if mat[i][j] == 'O': c+=1\r\n if not c: return True\r\n\r\n return False\r\n\r\n\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n s = input()\r\n x = s.count('X')\r\n pos =[[1 , 12] , [2 , 6] , [3 , 4] , [4 , 3] , [6 , 2] , [12 ,1]]\r\n\r\n ans = 0\r\n for i,j in pos:\r\n if(ok(s , i , j)): ans+=1\r\n\r\n print(ans , end = \" \")\r\n\r\n for i,j in pos:\r\n if(ok(s , i , j)): print(f\"{i}x{j}\" ,end = \" \")\r\n\r\n print()", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n t = int(input())\r\n cards = [input() for i in range(t)]\r\n a = [1, 2, 3, 4, 6, 12]\r\n b = [12 // a[i] for i in range(len(a))]\r\n for card in cards:\r\n bools = [False for i in range(len(a))]\r\n index_collector = []\r\n for j in range(len(card)):\r\n if card[j] == \"X\":\r\n index_collector.append(j + 1)\r\n for ind in range(len(a)):\r\n a_i = a[ind]\r\n hash = [0 for f in range(b[ind])]\r\n for i in index_collector:\r\n hash[i % b[ind]] += 1\r\n if max(hash) >= a[ind]:\r\n bools[ind] = True\r\n counter = 0\r\n for i in bools:\r\n if i:\r\n counter += 1\r\n output =[str(counter)] + [str(a[i]) + \"x\" + str(b[i]) for i in range(len(a)) if bools[i]]\r\n print(\" \".join(output))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "def is_possible(request, a):\n b = 12 // a\n\n for i in range(b):\n if 'O' not in [request[i + j * b] for j in range(a)]:\n return True\n\n return False\n\n\ndef solve(request):\n possible_ways = [1, 2, 3, 4, 6, 12]\n\n count_ways = 0\n ways = []\n\n for i in possible_ways:\n if is_possible(request, i):\n count_ways += 1\n ways += ['%dx%d' % (i, 12 // i)]\n\n ways = [str(count_ways)] + ways\n\n return ' '.join(ways)\n\n\ndef main():\n n = int(input())\n\n for _ in range(n):\n print(solve(input()))\n\n\nif __name__ == '__main__':\n main()\n", "t=eval(input())\r\nc=1\r\nwhile (c<=t):\r\n a=str(input())\r\n if(a==\"XXXXXXXXXXXX\"):\r\n print(\"6 1x12 2x6 3x4 4x3 6x2 12x1\")\r\n elif(a==\"OOOOOOOOOOOO\"):\r\n print (0)\r\n else:\r\n s=[\"1x12\"]\r\n i=0\r\n while (i<6):\r\n if (a[i]==\"X\") and (a[i+6]==\"X\"):\r\n s=s+[\"2x6\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<4):\r\n if (a[i]==\"X\") and (a[i+4]==\"X\") and (a[i+8]==\"X\"):\r\n s=s+[\"3x4\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<3):\r\n if (a[i]==\"X\") and (a[i+3]==\"X\")and(a[i+6]==\"X\")and(a[i+9]==\"X\"):\r\n s=s+[\"4x3\"]\r\n break\r\n i+=1\r\n i=0\r\n while (i<2):\r\n if (a[i]==\"X\")and(a[i+2]==\"X\")and(a[i+4]==\"X\")and(a[i+6]==\"X\")and(a[i+8]==\"X\")and(a[i+10]==\"X\"):\r\n s=s+[\"6x2\"]\r\n break\r\n i+=1\r\n \r\n \r\n print (len(s),\" \".join(map(str,s)))\r\n c+=1", "t = int(input().strip())\r\nfor i in range(t):\r\n s = input()\r\n ans = []\r\n for h in [x for x in range(1, 13) if 12 % x == 0]:\r\n good = False\r\n w = 12 // h\r\n for k in range(w):\r\n ok = True\r\n for l in range(h):\r\n if s[l * w + k] != 'X':\r\n ok = False\r\n if ok:\r\n good = True\r\n if good:\r\n ans.append(str(h) + \"x\" + str(w))\r\n print(str(len(ans)) + \" \" + \" \".join(ans))", "for _ in range(int(input())):\r\n\ts=input()\r\n\tn=len(s)\r\n\tans=[]\r\n\td=[1,2,3,4,6,12]\r\n\tfor item in d:\r\n\t\tz=12//item\r\n\t\tfor i in range(z):\r\n\t\t\tif s[i::z]=='X'*item:\r\n\t\t\t\tans.append((item,z))\r\n\t\t\t\tbreak\r\n\tprint(len(ans),end=' ')\r\n\tans.sort()\r\n\tfor item in ans:\r\n\t\tprint(f'{item[0]}x{item[1]}',end=' ')\r\n\tprint()", "def test(s):\r\n res = []\r\n for i in [[1, 12], [2, 6], [3, 4], [4, 3], [6, 2], [12, 1]]:\r\n a = [[\"O\" for i in range(i[1])] for j in range(i[0])]\r\n for j in range(i[0]):\r\n for k in range(i[1]):\r\n a[j][k] = s[j * i[1] + k]\r\n if check(a):\r\n res.append(i)\r\n return res\r\n\r\ndef check(a):\r\n for i in range(len(a[0])):\r\n if not \"O\" in [a[j][i] for j in range(len(a))]:\r\n return True\r\n return False\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n s = input().strip()\r\n x = test(s)\r\n print(len(x), end=\" \")\r\n for j in x:\r\n print(j[0], \"x\", j[1], sep=\"\", end=\" \")\r\n print()\r\n", "for _ in range(int(input())):\r\n s = input()\r\n A = [str(a)+'x'+str(12//a) for a in (1,2,3,4,6,12)\r\n if any(s[i::12//a]=='X'*a for i in range(12//a))]\r\n print(len(A), *A)", "def solve(c, n=12):\r\n r = set()\r\n for i in [1, 2, 3, 4, 6, 12]:\r\n win = False\r\n j = 12 // i\r\n for n in range(j):\r\n col = True\r\n for k in range(n, 12, j):\r\n col = col and c[k]\r\n win = win or col\r\n if win:\r\n r.add(i)\r\n\r\n return str(len(r)) + \" \" + \" \".join([str(i)+\"x\"+str(12//i) for i in r])\r\n\r\nif __name__ == \"__main__\":\r\n for _ in range(int(input())):\r\n board = [v == \"X\" for v in input()]\r\n print(solve(board, 12))", "# cook your dish here\r\nfor _ in range(int(input())):\r\n s=input()\r\n l=[]\r\n for i in range(1,13):\r\n if 12%i==0:\r\n for j in range(0,12):\r\n if s[j::12//i]=='X'*i:\r\n l.append(str(i)+'x'+str(12//i))\r\n break\r\n \r\n print(len(l),\" \".join(l))", "for i in range(int(input())):\r\n s = input()\r\n count = s.count('X')\r\n if count == 0:\r\n print(0)\r\n elif count == 12:\r\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\r\n else:\r\n lst = []\r\n if count >= 6:\r\n for i in range(2):\r\n if s[i] == s[i+2] == s[i+4] == s[i+6] == s[i+8] == s[i+10] == 'X':\r\n lst.append( '6x2' )\r\n break\r\n if count >= 4:\r\n for i in range(3):\r\n if s[i] == s[i+3] == s[i+6] == s[i+9] == 'X':\r\n lst.append( '4x3' )\r\n break\r\n if count >= 3:\r\n for i in range(4):\r\n if s[i] == s[i+4] == s[i+8] == 'X':\r\n lst.append('3x4')\r\n break\r\n if count >= 2:\r\n for i in range(6):\r\n if s[i] == s[i+6] == 'X':\r\n lst.append('2x6')\r\n break\r\n if count >= 1:\r\n lst.append( '1x12' )\r\n \r\n lst.sort()\r\n print(str(len(lst)) + ' ' + ' '.join(lst))", "\r\nn = int(input())\r\n\r\n\r\nfor _ in range(n):\r\n mystr = input()\r\n answer = []\r\n \r\n divisibles = [1,2,3,4,6,12]\r\n for i in divisibles:\r\n flag=0\r\n \r\n for j in range(0,12//i):\r\n columnSet = set(mystr[j::12//i])\r\n if len(columnSet)==1 and \"X\" in columnSet:\r\n flag=1\r\n break\r\n\r\n if flag==1:\r\n answer.append(\"{}x{}\".format(i,12//i));\r\n print(len(answer), \" \".join(answer))", "t=int(input())\r\nfor _ in range(t):\r\n\ts=input()\r\n\ta1=[1,2,3,4,6,12]\r\n\tans=[]\r\n\tfor a in a1:\r\n\t\tb=int(12/a)\r\n\t\tfor i in range(b):\r\n\t\t\tflag=True\r\n\t\t\tfor j in range(a):\r\n\t\t\t\tif s[b*j + i]!='X':\r\n\t\t\t\t\tflag=False\r\n\t\t\tif flag==True:\r\n\t\t\t\tans.append(a)\r\n\t\t\t\tbreak\r\n\tprint(len(ans),end=\" \")\r\n\tfor i in ans:\r\n\t\ts=str(i)+'x'+str(int(12/i))\r\n\t\tprint(s,end=\" \")\r\n\tprint()\r\n\r\n\r\n", "t = int(input())\nfor _ in range(t):\n s = input().strip()\n S = [a == 'X' for a in s]\n ans = []\n if s == 'O'*12:\n print(0)\n elif s == 'X'*12:\n print('6 1x12 2x6 3x4 4x3 6x2 12x1')\n else:\n ans.append('1x12')\n s1 = [S[6*i] for i in range(0,2)]\n s2 = [S[6*i+1] for i in range(0,2)]\n s3 = [S[6*i+2] for i in range(0,2)]\n s4 = [S[6*i+3] for i in range(0,2)]\n s5 = [S[6*i+4] for i in range(0,2)]\n s6 = [S[6*i+5] for i in range(0,2)]\n d2 = any([all(s1),all(s2),all(s3),all(s4),all(s5),all(s6)])\n if d2:\n ans.append('2x6')\n s1 = [S[4*i] for i in range(0,3)]\n s2 = [S[4*i+1] for i in range(0,3)]\n s3 = [S[4*i+2] for i in range(0,3)]\n s4 = [S[4*i+3] for i in range(0,3)]\n d3 = any([all(s1),all(s2),all(s3),all(s4)])\n if d3:\n ans.append('3x4')\n if d2:\n s1 = [S[3*i] for i in range(0,4)]\n s2 = [S[3*i+1] for i in range(0,4)]\n s3 = [S[3*i+2] for i in range(0,4)]\n d4 = any([all(s1),all(s2),all(s3)])\n if d4:\n ans.append('4x3')\n if d3:\n s1 = [S[2*i] for i in range(0,6)]\n s2 = [S[2*i+1] for i in range(0,6)]\n d6 = any([all(s1),all(s2)])\n if d6:\n ans.append('6x2')\n print('{} {}'.format(len(ans),' '.join(ans)))\n" ]

{"inputs": ["4\nOXXXOXOOXOOX\nOXOXOXOXOXOX\nXXXXXXXXXXXX\nOOOOOOOOOOOO", "2\nOOOOOOOOOOOO\nXXXXXXXXXXXX", "13\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX\nXXXXXXXXXXXX"], "outputs": ["3 1x12 2x6 4x3\n4 1x12 2x6 3x4 6x2\n6 1x12 2x6 3x4 4x3 6x2 12x1\n0", "0\n6 1x12 2x6 3x4 4x3 6x2 12x1", "6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1\n6 1x12 2x6 3x4 4x3 6x2 12x1"]}

UNKNOWN

PYTHON3

CODEFORCES

92

d3cc84d8a4738925b046a983cf21b4b1

Left-handers, Right-handers and Ambidexters

You are at a water bowling training. There are *l* people who play with their left hand, *r* people, who play with their right hand, and *a* ambidexters, who can play with left or right hand. The coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands. Ambidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand. Please find the maximum possible size of the team, where equal number of players use their left and right hands, respectively. The only line contains three integers *l*, *r* and *a* (0<=≤<=*l*,<=*r*,<=*a*<=≤<=100) — the number of left-handers, the number of right-handers and the number of ambidexters at the training. Print a single even integer — the maximum number of players in the team. It is possible that the team can only have zero number of players. Sample Input 1 4 2 5 5 5 0 2 0 Sample Output 6 14 0

[ "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nl,r,a = li()\r\n\r\nif max(l,r) - min(l,r) > a:\r\n print((min(l,r)+a) * 2)\r\nelse:\r\n print((max(l,r) + (a - (max(l,r) - min(l,r))) // 2) * 2)", "l, r, a = map(int, input().split())\n\nif min(l,r)+a <= max(l, r):\n\tprint(2 * (min(l,r)+a))\nelif l == r == a or l == r and a == 0:\n\tif sum([l,r,a]) % 2 == 0:\n\t\tprint(sum([l,r,a]))\n\telse:\n\t\tprint(sum([l,r,a])-1)\nelif min(l, r) == 0 and a == 0:\n\tprint(0)\nelse:\n\tif sum([l,r,a]) % 2 == 0:\n\t\tprint(sum([l,r,a]))\n\telse:\n\t\tprint(sum([l,r,a])-1)", "l, r, a = [int(s) for s in input().split(\" \")]\r\nif l > r:\r\n l, r = r, l\r\nans = 0\r\nif l+a <= r:\r\n ans += (l+a)*2\r\nelse:\r\n ans += r*2\r\n ans += ((l+a-r)//2)*2\r\nprint(ans)", "w = list(map(int,input().split()))\r\nl = w[0]\r\nr =w[1]\r\na = w[2]\r\n\r\nwhile a >1:\r\n if (l==r) and a !=1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n elif l>r:\r\n r +=1\r\n a -=1\r\n elif r >l:\r\n l+=1\r\n a-=1\r\nif a ==1:\r\n if l>r:\r\n r+=1\r\n else:\r\n l+=1\r\nif l ==r:\r\n print(l+r)\r\nelif l<r:\r\n print(l*2)\r\nelse:\r\n print(r*2)\r\n", "l,r,a=map(int, input().split())\r\n\r\nwhile (a!=0):\r\n if(r>l):\r\n l=l+1\r\n a=a-1\r\n elif(l>r):\r\n r=r+1\r\n a=a-1\r\n else:\r\n a=a-1\r\n l=l+1\r\n\r\nl=min(l,r)\r\nr=l\r\nprint (l+r)", "inp = list(map(int,input().split()))\r\nl=inp[0]\r\nr=inp[1]\r\na=inp[2]\r\nif(l==r):\r\n print (2*(l+a//2))\r\nelif(l<r):\r\n if(r-l<=a):\r\n a=a-(r-l)\r\n l=r\r\n print (2*(l+a//2))\r\n else:\r\n l=l+a\r\n print (2*min(r,l))\r\nelse:\r\n if(l-r<=a):\r\n a=a-(l-r)\r\n r=l\r\n print (2*(l+a//2))\r\n else:\r\n r=r+a\r\n print (2*min(r,l))\r\n \r\n ", "left, right, ambi=map(int, input().split())\r\n\r\nif left!=right:\r\n\tif left<right:\r\n\t\tl=left+ambi\r\n\t\tif l>right:\r\n\t\t\td=left-right\r\n\t\t\tright+=d\r\n\t\t\tambi-=d\r\n\t\t\tprint(2*(left+(ambi//2)))\r\n\t\telse:\r\n\t\t\tprint(2*l)\r\n\telse:\r\n\t\tr=right+ambi\r\n\t\tif r>left:\r\n\t\t\td=right-left\r\n\t\t\tleft+=d\r\n\t\t\tambi-=d\r\n\t\t\tprint(2*(right+(ambi//2)))\r\n\t\telse:\r\n\t\t\tprint(2*r)\r\nelse:\r\n\tleft+=(ambi//2);right+=(ambi//2)\r\n\tprint(left+right)", "l, r, a = map(int, input().split())\r\n\r\nprint(2 * min(l + a, r + a, (l + r + a) // 2))", "a,b,c=map(int,input().split())\r\n\r\nif(a>b):\r\n a,b=b,a\r\n\r\nd=a+c\r\nif(d>b):\r\n e=(d-b)\r\n b+=e//2\r\n\r\nelif(d<b):\r\n b=d\r\n\r\nprint(2*b)\r\n", "l,r,a=map(int,input().split())\r\nif(l<r):\r\n x=r-l\r\n if(x<=a):\r\n l=r\r\n a-=x\r\n else:\r\n l=l+a\r\n a=0\r\nelse:\r\n x=l-r\r\n if(x<=a):\r\n r=l\r\n a-=x\r\n else:\r\n r=r+a\r\n a=0\r\nprint(2*(min(l,r)+a//2))", "l,r,a=map(int,input().split())\r\nif l<r:l,r=r,l\r\nif a<=l-r:print(2*(r+a))\r\nelse:\r\n a-=l-r\r\n print(2*l+a//2*2)\r\n", "# from dust i have come dust i will be\n\nl,r,a=map(int,input().split())\n\nmx=0\nfor i in range(a+1):\n tl=l+i\n tr=r+a-i\n\n mx=max(mx,min(tl,tr)*2)\n\nprint(mx)\n", "l,r,a=map(int,input().split())\r\nif l==0 and a<r or r==0 and a<l:\r\n print(0)\r\nelif l==r:\r\n print(l+r+( a if(a%2==0)else a-1))\r\nelif l<r:\r\n if l+a==r:\r\n print(r*2)\r\n elif l+a>r:\r\n scale=r-l\r\n a-=abs(scale)\r\n print((r+(a//2))*2)\r\n else:\r\n print((l+a)*2)\r\nelse:\r\n if r+a==l:\r\n print(l*2)\r\n elif r+a>l:\r\n scale=l-r\r\n a-=abs(scale)\r\n print((l+(a//2))*2)\r\n else:\r\n print((r+a)*2)", "l,r,a = map(int, input().split())\r\n\r\nif (a == 0 and l == 0) or (a == 0 and r == 0):\r\n print(0)\r\nelse:\r\n lim_fac = min(l,r)\r\n \r\n t = lim_fac*2\r\n \r\n l = l -lim_fac\r\n r = r - lim_fac\r\n \r\n if r > l :\r\n if a < r:\r\n t += (2*a)\r\n print(t)\r\n else:\r\n t += (2*r)\r\n a -= (r)\r\n if a % 2 == 0:\r\n t += a\r\n print(t)\r\n else:\r\n t += (a-1)\r\n print(t)\r\n else:\r\n if a < l:\r\n t += (2*a)\r\n print(t)\r\n else:\r\n t += (2*l)\r\n a -= (l)\r\n if a % 2 == 0:\r\n t += a\r\n print(t)\r\n else:\r\n t += (a-1)\r\n print(t)\r\n", "l,r,a= map(int,input().split())\r\nmn = min(l,r)\r\nmx = max(l,r)\r\nif(l== 0 and a == 0 ) or (r==0 and a ==0):print(0)\r\nelif mx != mn :\r\n if(mn+a<=mx):print(2*(mn+a))\r\n else:\r\n rm = (mn+a)-mx\r\n if(rm%2):print(2*mx+rm-1)\r\n else:print(2*mx+rm)\r\nelse: \r\n if(l+a+r)%2:print((l+a+r)-1)\r\n else:print((l+a+r))\r\n \r\n", "l, r, a = [int(i) for i in input().split()]\r\nif (l > r):\r\n l, r = r, l\r\nwhile (a > 0 and (l < r or r == l)):\r\n a -= 1\r\n l += 1\r\n if (l > r):\r\n l, r = r, l\r\nprint(2 * min(l, r))", "l, r, a = map(int, input().split())\r\nfor i in range(a):\r\n if l > r:\r\n r += 1\r\n else:\r\n l += 1\r\nprint(2 * min(r, l))\r\n", "l,r,a=map(int,input().split())\r\ns=((min(l,r)+min(abs(l-r),a))+(max(0,a-min(abs(l-r),a))//2))*2\r\nprint(s)", "l, r, b = map(int ,input().split())\r\nif(r > l):\r\n a = min(b, r-l)\r\n l += a;b -= a\r\nelif(l > r):\r\n a = min(b, l-r)\r\n r += a;b -= a\r\nif (b%2):\r\n l += (b//2)\r\n r += (b//2 + 1)\r\nelse:\r\n l += (b//2)\r\n r += (b//2)\r\nprint(min(l, r)*2)", "a,b,c=map(int,input().split())\r\nif a==b==c:\r\n\tprint(2*a+(c//2)*2)\r\nelif a>b:\r\n\tif b+c==a:\r\n\t\tprint(a+b+c)\r\n\telif b+c>a:\r\n\t\tprint(2*a+((b+c-a)//2)*2)\r\n\telse:\r\n\t\tprint((b+c)*2)\r\nelse:\r\n\tif a+c==b:\r\n\t\tprint(a+b+c)\r\n\telif a+c>b:\r\n\t\tprint(2*b+((a+c-b)//2)*2)\r\n\telse:\r\n\t\tprint((a+c)*2)", "import math\r\n\r\nl,r,a = map(int,input().split())\r\nwhile a>0:\r\n if a==1 and l==r:\r\n break\r\n elif l<r:\r\n l+=1\r\n a-=1\r\n elif l>r:\r\n r+=1\r\n a-=1\r\n else:\r\n l+=1\r\n r+=1\r\n a-=2\r\nprint(2*min(l,r))", "[left, right, ambi] = map(int, input().split())\r\nif left+ambi <= right:\r\n print((left+ambi)*2)\r\nelif right+ambi <= left:\r\n print((right+ambi)*2)\r\nelse:\r\n print((left+right+ambi)//2*2)\r\n", "# Left-handers, Right-handers and Ambidexters\r\nl,r,a = map(int,input().split())\r\nif r-l>=a:\r\n ans = 2*(l+a)\r\nelif l-r>=a:\r\n ans = 2*(r+a)\r\nelse:\r\n if (l+r+a)%2==0:\r\n ans = l+r+a\r\n else:\r\n ans = l+r+a-1\r\nprint(ans)", "def team(l,r,a):\r\n\tfor i in range(l,-1,-1):\r\n\t\tfor j in range(r,-1,-1):\r\n\t\t\tfor k in range(a,-1,-1):\r\n\t\t\t\tfor p in range(a,-1,-1):\r\n\t\t\t\t\tif(k+p<=a and i+k==j+p):\r\n\t\t\t\t\t\treturn i+j+k+p\r\n\r\n\t\t\r\n\r\nL=list(map(int,input().split()))\r\nl=L[0]\r\nr=L[1]\r\na=L[2]\r\nprint(team(l,r,a))", "import math\r\nhand = [int(x) for x in input().split()]\r\nleft = hand[0]; right = hand[1]; ambd = hand[2]\r\nif(left<right):\r\n\twhile left!=right and ambd:\r\n\t\tleft = left+1\r\n\t\tambd = ambd -1\r\nelse:\r\n\twhile left!=right and ambd:\r\n\t\tright = right+1\r\n\t\tambd = ambd -1\r\nleft = right = min(left, right)\r\nif ambd>1:\r\n\tright = right +math.floor(ambd/2)\r\n\tleft = left +math.floor(ambd/2)\r\nif right!=left:\r\n\tprint(0)\r\nelse:\r\n\tprint(right+left)", "l,r,a = map(int,input().split())\r\nmin1 = min(l,r)\r\nmax1 = max(l,r)\r\ndiff = max1 - min1\r\nif diff == 0:\r\n min1 += a // 2\r\n max1 += a // 2\r\nelse:\r\n if a >= diff:\r\n min1 += diff\r\n a -= diff\r\n min1 += a // 2\r\n max1 += a // 2\r\n else:\r\n min1 += a\r\nprint(2 * min1)\r\n", "l,r,a=map(int,input().split())\r\nif (l==0 and a==0) or (r==0 and a==0):\r\n print(0)\r\nelif l+a<r:\r\n print((l+a)*2)\r\nelif r+a<l:\r\n print((r+a)*2)\r\nelse:\r\n print(2*((l+r+a)//2))", "def main():\n line = input()\n l, r, a = line.split(' ')\n l = int(l)\n r = int(r)\n a = int(a)\n _max = max(l, r)\n _min = min(l, r)\n diff = _max - _min\n\n if diff == 0:\n print((l + a // 2) * 2)\n elif diff <= a:\n print((_max * 2) + (a - diff) // 2 * 2)\n else:\n print((_min + a) * 2)\n\n\nif __name__ == '__main__':\n main()\n\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t\t\t\t \t", "left, right, ambi = map(int, input().split())\r\nfor i in range(ambi):\r\n if (left>right):\r\n right += 1\r\n else:\r\n left += 1\r\nprint(2*(min(left,right)))", "def f():\r\n l,r,a=map(int,input().split())\r\n e=0\r\n if l==r:\r\n a=(a//2)*2\r\n e=l+r+a\r\n elif l<r:\r\n if a>=r-l:\r\n a=a-(r-l)\r\n a=(a//2)*2\r\n e=2*r+a\r\n else:\r\n e=2*(l+a)\r\n else:\r\n r,l=l,r\r\n if a>=r-l:\r\n a=a-(r-l)\r\n a=(a//2)*2\r\n e=2*r+a\r\n else:\r\n e=2*(l+a)\r\n\r\n print(e)\r\n return\r\n\r\nt=1\r\nwhile t:\r\n f()\r\n t-=1\r\n \r\n \r\n", "\r\n\r\ndef solve(l,r,a):\r\n while a>0:\r\n if l<r:\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\n return min([l,r])*2\r\n\r\ndef main():\r\n lra = input().split()\r\n print(solve(int(lra[0]),int(lra[1]),int(lra[2])))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l,r,a = map(int, input().split())\r\nc = 0\r\nleft = 0\r\nif l < r:\r\n c = c + 2*l\r\n r = r - l\r\n left = r\r\nelse:\r\n c = c + 2*r\r\n l = l - r\r\n left = l\r\nif a >= left:\r\n c = c + 2*left\r\n a = a - left\r\n left = 0\r\nelse:\r\n c = c + 2*a\r\n left = left - a\r\n a = 0\r\nif a > 0:\r\n c = c + 2*(a//2)\r\nprint(c)", "[l,r,a]=map(int,input().split())\nif l + a < r:\n print(2 * (l + a))\nelif r + a < l :\n print (2 * (r + a))\nelse:\n print (((l+r+a)//2)*2)\n\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nl, r, a = map(int, input().split())\r\n\r\ntmp = a - abs(l - r)\r\nans = tmp // 2 + max(l, r) if tmp >= 0 else min(l, r) + a\r\n\r\nprint(ans * 2)", "l, r, a = map(int, input().split())\r\n\r\nl, r = min(l,r), max(l,r)\r\nprint(2*(l + min(a, r-l) + ((a-min(a, r-l))//2 if a != min(a, r-l) else 0)))", "l,r,a=map(int,input().split())\r\nx=min(l,r)\r\ny=(l+r-x)-x\r\nz=min(y,a)\r\np=(a-z)//2\r\nans=2*x+2*z+2*p\r\nprint(ans)", "a, b, c = map(int, input().split())\r\nmina = min(a,b)\r\nmaxb = max(a,b)\r\n\r\nif(mina + c <= maxb):\r\n print((mina + c)*2)\r\nelse:\r\n print((a+b+c)//2 * 2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l,r,a = map(int,input().split())\r\nx = min(l,r) + a\r\nif x>=max(l,r):\r\n\tif (l+a+r) % 2==0:\r\n\t\tprint(l+a+r) \r\n\telse:\r\n\t\tprint(l+a+r-1)\r\nelse:\r\n\tprint(x*2)", "l, r, a = [int(a) for a in input().strip().split(' ')]\r\no = a\r\nif l > r:\r\n o -= min(a,l-r)\r\n r += min(a,l-r)\r\nif r > l:\r\n o -= min(a,r-l)\r\n l += min(a,r-l)\r\nr += (o // 2)\r\nl += (o // 2)\r\nprint(2 * min(r,l))", "a,b,c = map(int, input().split())\nd = min(abs(a-b),c)\nc -= d\nprint((min(a,b) + d)*2 + c//2*2)\n", "l, r, a = map(int, input().split())\r\nif l > r and a >= l - r:\r\n a -= l - r\r\n r = l\r\nelif l > r and a < l - r:\r\n r += a\r\n l = r\r\n print(l + r)\r\n exit()\r\nelif l < r and a >= r - l:\r\n a -= r - l\r\n l = r\r\nelif l < r and a < r - l:\r\n l += a\r\n r = l\r\n print(l + r)\r\n exit()\r\n\r\nprint(l + r + (a - a % 2))", "k=input().split()\nl=int(k[0]) \nr=int(k[1])\na=int(k[2])\nmaxh=max(l,r)\nminh=min(l,r)\nif minh+a<maxh:\n print((minh+a)*2)\nelse:\n a-=(maxh-minh)\n print(maxh*2+(a//2)*2)", "l,r,a=map(int,input().split())\r\nif (l==0 and a==0) or (r==0 and a==0):\r\n print(\"0\")\r\nelif l+a<r:\r\n print(2*(l+a))\r\nelif r+a<l:\r\n print(2*(r+a))\r\nelse:\r\n a=(l+r+a)//2\r\n print(2*a)", "l, r, a = map(int, input().split())\r\nm = min(l+a, r+a, (l+r+a)//2)\r\nprint(2*m)\r\n", "l, r, a = map(int, input().split())\r\nwhile a>0:\r\n\tif l>r:\r\n\t\tr+=1\r\n\telse:\r\n\t\tl += 1\r\n\ta-=1\r\nprint(min(l,r)*2)\r\n", "l, r, a = map(int, input().split())\nans = min(l + a, r + a, (l + r + a) // 2) * 2\nprint(ans)\n", "\r\nl,r,a = list(map(int, input().split()))\r\nif l<r:\r\n mmin=l\r\n mmax=r\r\nelse:\r\n mmin=r\r\n mmax=l\r\ns=mmax-mmin\r\nif a>=s:\r\n print(mmax*2+((a-s)//2)*2)\r\nelse:\r\n print((mmin+a)*2) ", "def solution(data):\r\n\tleft=data[0]\r\n\tright=data[1]\r\n\tambide=data[2]\r\n\tif left<right:\r\n\t\treturn solution([right,left,ambide])\r\n\telif left==right:\r\n\t\tmax=right+left+2*(ambide//2)\r\n\t\tprint(max)\r\n\telse:\r\n\t\tif right+ambide<=left:\r\n\t\t\tmax=2*(right+ambide)\r\n\t\t\tprint(max)\r\n\t\telse:\r\n\t\t\tambide=ambide-(left-right)\r\n\t\t\tright=left\r\n\t\t\tmax=right+left+2*(ambide//2)\r\n\t\t\tprint(max)\t\r\ndata=list(map(int,input().split()))\r\nsolution(data)", "l,r,a=map(int,input().split())\r\nif l>r:\r\n\tb=min(a,(l-r))\r\n\tx=a-b\r\n\tr+=b\r\n\tprint(2*(r+x//2))\r\nelif r>l:\r\n\tc=min(a,(r-l))\r\n\tx=a-c\r\n\tl+=c\r\n\tprint(2*(l+x//2))\r\nelse:\r\n\tprint(2*(l+a//2))", "l,r,a= map(int,input().split())\r\nk = max(l,r)\r\nh = min(l,r)\r\nif k==h:\r\n\tprint(2*l+2*(a//2))\r\nelif h+a<=k:\r\n\tprint(2*(h+a))\r\nelse:\r\n\tprint(2*k+2*((h+a-k)//2))", "from sys import stdin,stdout\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):\n l,r,b=lst()\n while b!=0:\n if l<r:\n l+=1\n b-=1\n elif l>r:\n r+=1\n b-=1\n else:\n if b<2:break\n l+=1\n r+=1\n b-=2\n print(min(l,r)*2)\n\t\t \t \t \t \t \t\t \t\t \t\t \t", "a,b,c=map(int,input().split())\r\nif a<b:r=min(abs(a-b),c);a+=r;c-=r\r\nif b<a:f=min(abs(a - b), c);b+=f;c-=f\r\nif a==b:a+=c//2;b+=c//2\r\nif a-b==0:\r\n print(a+b)\r\nelse:\r\n print(min(a,b)*2)\r\n", "l, r, a=map(int,input().split())\r\nmax1=0\r\nfor i in range(a+1):\r\n totall=l+i\r\n totalr=r+a-i\r\n max1=max(max1,min(totall,totalr)*2)\r\nprint(max1)\r\n\r\n", "li,r,a=list(map(int,input().split()))\r\npla=0\r\nif li<r:\r\n pla+=li+li\r\n if r-li==a:\r\n pla+=r-li+r-li\r\n elif r-li<a:\r\n pla+=r-li+r-li\r\n if (a-r+li)%2==0:\r\n pla+=a-r+li\r\n else:\r\n pla+=a-r+li-1\r\n elif r-li>a:\r\n pla+=a+a\r\nelif li>r:\r\n pla+=r+r\r\n if li-r==a:\r\n pla+=li-r+li-r\r\n elif li-r<a:\r\n pla+=(li-r)*2\r\n if (a-li+r)%2==0:\r\n pla+=a+r-li\r\n else:\r\n pla+=a+r-li-1\r\n elif li-r>a:\r\n pla+=a+a\r\nelif li==r:\r\n pla+=li+li\r\n if a%2==0:\r\n pla+=a\r\n elif a%2!=0:\r\n pla+=a-1\r\nprint(pla)\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "l, r, a = map(int, input().split())\r\nprint(2*(min(l, r) + a) if abs(l-r) >= a else 2*(max(l, r) + (a - abs(l-r))//2))\r\n", "linea_ingresada = input()\r\n\r\nzurdos,derechos,ambidiestros = linea_ingresada.split(' ')\r\n\r\nzurdos = int(zurdos)\r\nderechos= int(derechos)\r\nambidiestros = int(ambidiestros)\r\n\r\nif zurdos > derechos:\r\n diferencia = zurdos - derechos\r\n if diferencia >= ambidiestros:\r\n resultado = derechos + ambidiestros\r\n else:\r\n resultado = zurdos + (ambidiestros - diferencia) / 2\r\nelse:\r\n if derechos > zurdos:\r\n diferencia = derechos - zurdos\r\n if diferencia >= ambidiestros:\r\n resultado = zurdos + ambidiestros\r\n else:\r\n resultado = derechos + (ambidiestros - diferencia) / 2\r\n else:\r\n resultado = zurdos + ambidiestros / 2\r\n\r\nprint(int(resultado) * 2)", "l,r,a=[int(i) for i in input().split()]\r\nb=max(l,r)\r\nc=min(l,r)\r\nd=b-c\r\nif d>=a:\r\n print(2*(c+a))\r\nelif a>d:\r\n e=a-d\r\n f=e//2\r\n print(2*(b+f))\r\n", "l,r,a=map(int,input().split())\r\nif((l + a) < r):\r\n res = 2 * (l + a)\r\nelif(l <= r):\r\n res = 2 * r + 2 * abs((a - (r - l)) / 2)\r\nelif((r + a) < l):\r\n res = 2 * (r + a)\r\nelif(r < l):\r\n res = 2 * l + 2 * abs((a - (l - r)) / 2)\r\nif(res%2!=0):\r\n res=res-1\r\nprint(int(res))\r\n", "a,b,c=map(int,input().split())\r\nx=abs(a-b)\r\nif x>=c:\r\n print((c+min(a,b))*2)\r\nelse:\r\n print((x+min(a,b)+int((c-x)/2))*2)", "l,r,a=[int(x) for x in input().split()]\r\nif l>r:\r\n t=2*r\r\n x=l-r\r\nelse:\r\n t=2*l\r\n x=r-l\r\nif a>x:\r\n t=t+(2*x)\r\n z=a-x\r\n y=(z//2)*2\r\n t=t+y\r\nelse:\r\n t=t+(2*a)\r\nprint(t)", "l, r, a = [int(x) for x in input().split()]\r\n\r\nmax_num = max(l, r)\r\nmin_num = min(l, r)\r\n\r\ndiff = abs(max_num - min_num)\r\n\r\nif a <= diff:\r\n\tprint((min_num + a) * 2)\r\nelse:\r\n\tleft_over = min_num + a - max_num\r\n\tadd_both_sides = left_over // 2\r\n\tprint(max_num * 2 + add_both_sides * 2)", "# Codeforces Submission\n# User : sudoSieg\n# Time : 14:31:40\n# Date : 21/10/2020\n\nimport io\nimport os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nl, r, a = map(int, input().split())\ni = min(l, r)\nl -= i\nr -= i\nif l == 0 and r == 0:\n print(2 * i + 2 * (a//2))\nelif l == 0:\n j = min(r, a)\n r -= j\n a -= j\n print(2 *i + 2 * j + 2 * (a//2))\nelif r == 0:\n j = min(l, a)\n l -= j\n a -= j\n print(2 *i + 2 * j + 2 * (a//2))\n", "left,right,ambidekstr=map(int,input().split())\r\nif (left==0 or right==0) and ambidekstr==0:\r\n print(0)\r\n exit()\r\nfor i in range(ambidekstr):\r\n if left==min(left,right):\r\n left+=1\r\n else:\r\n right+=1\r\nprint(min(left,right)*2)", "from math import floor\r\nl,r,a=map(int,input().split())\r\nu=floor((l+r+a)/2)\r\nprint(2*min(l+a,r+a,u))", "a,b,c= map(int,input().split())\nwhile c!=0 :\n if a>b :\n b+=1\n else :\n a+=1\n c-=1\nif a>b :\n print (b*2)\nelse :\n print (a*2)\n", "l,r,a = map(int,input().split())\r\nd = abs(l-r)\r\nif a<=d:\r\n print((min(l,r)+a)*2)\r\nelse:\r\n s = l+r+a\r\n a-=d\r\n a%=2\r\n print(s-a)", "l,r,a=map(int,input().split())\r\n\r\nwhile(1):\r\n if(a<=0):\r\n print(min(l,r)*2)\r\n break\r\n \r\n if(l<=r):\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\n \r\n \r\n \r\n ", "l,r,a=map(int,input().split())\r\nt=a\r\na=a-abs(l-r)\r\nif(a>0):\r\n c=min(l,r)+abs(l-r)\r\n s=c+(a//2)\r\nelse:\r\n s=t+min(l,r)\r\nprint(2*s)", "l, r, a=[int(x)for x in input().split()]\r\n \r\nwhile l < r and a != 0:\r\n\tl += 1\r\n\ta -= 1\r\n \r\nwhile r < l and a != 0:\r\n\tr += 1\r\n\ta -= 1\r\n \r\nl += a // 2\r\nr += a // 2\r\n \r\nprint(min(r,l) * 2)", "l,r,a=map(int,input().strip().split(' '))\r\nk=max(l,r)\r\nb=min(l,r)\r\nss=k-b\r\nif a<=ss:\r\n print(2*(a+b))\r\nelse:\r\n print(k*2+((a-ss)//2)*2)", "[l,r,a] = map(int, input().split())\r\nif l>=r+a:\r\n print ((r+a)*2)\r\nelif r>=l+a:\r\n print ((l+a)*2)\r\nelse:\r\n print ((r+l+a)//2*2)", "l,r,a=map(int,input().split())\r\n\r\nMax=max(l,r)\r\nMin=min(l,r)\r\n\r\nif Min+a<=Max:\r\n print(2*(Min+a))\r\nelse:\r\n print((Max+(Min+a-Max)//2)*2)", "def this(l, r, a):\r\n ans = 0\r\n while True:\r\n if l == 0:\r\n if a == 0:\r\n return ans\r\n else:\r\n a-=1\r\n else:\r\n l-=1\r\n\r\n if r == 0:\r\n if a == 0:\r\n return ans\r\n else:\r\n a-=1\r\n else:\r\n r-=1\r\n\r\n ans+=2\r\n\r\nl, r, a = map(int, input().split())\r\n\r\nprint(this(l, r, a))", "#950A\r\nl,r,a=map(int,input().split())\r\nif l!=r:\r\n #l<r only\r\n L=min(l,r)\r\n R=max(l,r)\r\n d=R-L\r\n if a>=d:\r\n a=a-d\r\n print(R+R+a-a%2)\r\n else:\r\n L+=a\r\n print(L*2)\r\nelse:\r\n re=l*2 + (a-a%2)\r\n print(re)", "l, r, a = map(int, input().split())\r\n\r\nwhile l < r and a > 0:\r\n l += 1\r\n a -= 1\r\n\r\nwhile l > r and a > 0:\r\n r += 1\r\n a -= 1\r\n\r\ni = 0\r\nwhile a > 0:\r\n if i % 2:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\n i += 1\r\n\r\nprint(min(l, r) * 2)", "l,r,a=map(int,input().strip().split())\r\nans=2*(min(l+a,r+a,(l+r+a)//2))\r\nprint(ans)", "l,r,a= map(int , input().split())\nwhile a>0 :\n\tif l>r :\n\t\tr=r+1\n\t\ta=a-1\n\t\t\n\telif r>l :\n\t\tl=l+1\n\t\ta=a-1\n\t\t\n\telif a==1 :\n\t\tbreak\n\t\n\telif r==l and a>=2 :\n\t\tl=l+1\n\t\tr=r+1\n\t\ta=a-2\n\t\t\nif l<r :\n\tprint (2*l,\"\\n\")\n\t\nelse :\n\tprint (2*r,\"\\n\")\n\t\n \t \t \t\t \t\t \t \t \t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n l, r, a = map(int, input().split())\r\n ans = 0\r\n while l > 0 and r > 0:\r\n ans += 2\r\n l -= 1\r\n r -= 1\r\n while l > 0 and a > 0:\r\n ans += 2\r\n l -= 1\r\n a -= 1\r\n while r > 0 and a > 0:\r\n ans += 2\r\n r -= 1\r\n a -= 1\r\n while a >= 2:\r\n ans += 2\r\n a -= 2\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l,r,a=list(map(int,input().split()))\nif l<r:\n mymin=l\n mymax=r\nelse:\n mymin=r\n mymax=l\ns=mymax-mymin\nif a>=s:\n print(mymax*2+((a-s)//2)*2)\nelse:\n print((mymin+a)*2)\n\t \t \t \t \t\t \t\t\t \t \t \t\t \t\t\t", "l, r, a = map(int, input().split())\r\nres = 0\r\nfor i in range(0, a + 1):\r\n res = max(res, min(l + i, r + a - i) * 2)\r\nprint(res)", "l,r,a=map(int, input().split())\r\n\r\nfor i in range(a):\r\n if l<r:\r\n l+=1\r\n else:\r\n r+=1\r\n\r\nprint(2*min(l,r)) \r\n", "l,r,a=map(int,input().split())\r\nif l==0 and a==0 or r==0 and a==0:\r\n\tprint(\"0\")\r\nelse:\r\n\tif abs(l-r)<a:\r\n\t\tw=( 2*max(l,r) )+ ( (a-abs(l-r))//2 )*2\r\n\t\tprint(w)\r\n\telse:\r\n\t\tprint((2*(min(l,r)+a)))", "l,r,a = map(int,input().split())\r\nwhile True:\r\n if l<r and a:\r\n l+=1\r\n a-=1\r\n elif l>r and a:\r\n r+=1\r\n a-=1\r\n elif l==r and a>1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n else:\r\n break\r\nprint(2*min(l,r))", "*v, a = map(int, input().split())\nm, M = sorted(v)\nif a > M - m:\n print(((a + M + m) // 2) * 2)\nelse:\n print((m + a) * 2)\n", "#Left-handers, Right-handers and Ambidexters\r\n\r\n# Get input variables and assign\r\nx = input().split()\r\n\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nfor i in range(a):\r\n if l <= r:\r\n l = l + 1\r\n else:\r\n r = r + 1\r\n \r\nif l < r:\r\n print(2*l)\r\nelif r <= l:\r\n print(2*r)", "l,r,a = map(int,input().split())\r\nif (l==0 or r==0) and a==0:\r\n print(0)\r\nelse:\r\n for i in range(a,0,-1):\r\n if(l<r):\r\n l+=1\r\n else:\r\n r+=1\r\n print(min(l,r)*2)", "l,r,a= map(int,input().split())\r\nif(l>r):\r\n l1=min((l-r),a)\r\n r=r+l1\r\n a=a-l1\r\nif(r>l):\r\n l1=min((r-l),a)\r\n l=l+l1\r\n a=a-l1\r\nif(l==r):\r\n a=a//2\r\n l=l+a \r\n r=r+a \r\nprint(min(l,r)*2) ", "from math import *\r\na,b,c=map(int,input().split())\r\np=min(a,b)\r\nk=max(a,b)\r\ns=k-p\r\nif s>=c:\r\n ans=2*(p+c)\r\nelse:\r\n ans=2*(k+(c-s)//2)\r\nprint(ans)\r\n ", "l , r , a = map(int , input().split())\r\n\r\nwhile a > 0 : \r\n if r > l : \r\n l+= 1 \r\n else: \r\n r+= 1 \r\n a-= 1 \r\nprint(min(l , r ) * 2 )", "a,b,c = map(int, input().split())\r\nres = 0\r\nfor i in range(c+1):\r\n tl = a + i\r\n tr = b + c - i\r\n res = max(res, min(tl, tr)*2)\r\nprint(res)", "\r\n(l, r, a) = tuple(map(int, input().split()))\r\n# 5 4 1\r\ntotal = 0\r\n\r\n\r\nwhile(a>0):\r\n \r\n if l<r:\r\n l +=1\r\n else:\r\n r+=1 \r\n a-=1\r\n\r\nprint(min(l,r)*2 )", "# cook your dish here\na, b ,c=list(map(int, input().split()))\nif min(a,b)+c <= max(a,b):\n print((min(a,b)+c)*2)\nelse:\n x=c-max(a,b)+min(a,b)\n print((max(a,b)+int(x/2))*2)\n \n\n\n \n \n \n ", "l,r,a= map(int,input().split())\r\nif(l>r):\r\n m=min((l-r),a)\r\n r=r+m\r\n a=a-m\r\nif(r>l):\r\n m=min((r-l),a)\r\n l=l+m\r\n a=a-m\r\nif(l==r):\r\n a=a//2\r\n l=l+a \r\n r=r+a \r\nprint(min(l,r)*2)", "l, r, a = map(int, input().split())\n\nans = 0\nans += min(l, r)\nl -= ans\nr -= ans\nif l != 0:\n tmp = min(l, a)\n ans += tmp\n l -= tmp\n a -= tmp\nif r != 0:\n tmp = min(r, a)\n ans += tmp\n r -= tmp\n a -= tmp \nans += a // 2\nprint(ans * 2)\n\t \t\t \t \t \t\t \t \t \t \t\t\t\t\t", "l,r,a = map(int,input().split())\r\n\r\nwhile a>0:\r\n diff = abs(l-r)\r\n if l<r:\r\n l+=min(diff,a)\r\n a-=min(diff,a)\r\n elif l>r:\r\n r+=min(diff,a)\r\n a-=min(diff,a)\r\n else:\r\n r+=a//2\r\n a-=a//2\r\n l+=a\r\n a-=a\r\nprint(min(l,r)*2)\r\n \r\n \r\n", "l,r,a=map(int,input().split())\r\ntotal,m,ma=0,0,0\r\nif((l==0 and a==0) or (r==0 and a==0)):\r\n total=0\r\nelif(min(l,r)+a<max(l,r)):\r\n total=(min(l,r)+a)*2\r\nelse:\r\n total=((l+a+r)//2)*2\r\nprint(total) \r\n", "# https://codeforces.com/problemset/problem/950/A\n\nl, r, a = map(int, input().split())\n\n# x <= y\nx, y = sorted([l, r])\nif y - x > a:\n answer = 2 * (x + a)\nelse:\n answer = 2 * (y + (a - (y - x))//2)\n\nprint(answer)\n", "# Left-handers, Right-handers and Ambidexters\r\nl,r,a = [int(x) for x in input().split()]\r\n\r\nif l > r:\r\n l,r = r,l\r\n \r\nl += a\r\n\r\nif l > r:\r\n print((r+(l-r)//2)*2)\r\nelse:\r\n print(l*2)\r\n", "l,r,a=map(int,input().split())\r\nif l<r:\r\n\tx=r-l\r\n\tif a>=x:\r\n\t\tl=l+x\r\n\t\ta=a-x\r\n\t\tm=1\r\n\telse:\r\n\t\tl=l+a\r\n\t\ta=0\r\n\t\tm=2\r\nelif l==r:\r\n\totvet=l+r+((a//2)*2)\r\n\tprint(otvet)\r\n\texit()\r\nelif l>r:\r\n\tx=l-r\r\n\tif a>=x:\r\n\t\tr=r+x\r\n\t\ta=a-x\r\n\t\tm=3\r\n\telse:\r\n\t\tr=r+a\r\n\t\ta=0\r\n\t\tm=4\r\nif m==1 or m==3:\r\n\totvet=l+r+((a//2)*2)\r\n\tprint(otvet)\r\nelif m==2:\r\n\totvet=l*2\r\n\tprint(otvet)\r\nelif m==4:\r\n\totvet=r*2\r\n\tprint(otvet)\t", "l, r, a = map(int, input().split())\nans = 0\nif l < r:\n if l + a <= r:\n ans = l+a\n else :\n ans = r + (a - r + l)//2\nelse :\n if r + a <= l:\n ans = r + a\n else :\n ans = l + (a - l + r)//2\nprint(2*ans)\n", "l, r, a = [int(x) for x in input().split()]\r\ndiff = abs(l - r)\r\nif a > diff:\r\n print(((a - diff) // 2) * 2 + max(l, r) * 2)\r\nelse:\r\n print(min(l + a, r + a) * 2)\r\n", "x = list(map(int,input().strip().split()))\r\n\r\nwhile (x[2]>0):\r\n\tif x[0] > x[1]:\r\n\t\tx[1]+=1\r\n\t\tx[2]-=1\r\n\telif x[0] < x[1]:\r\n\t\tx[0]+=1\r\n\t\tx[2]-=1\r\n\telse : \r\n\t\tbreak;\r\n\r\nif x[0] > x[1]:\r\n\tprint(int(x[1] *2 + int(x[2]/2)*2))\r\nelse :\r\n\tprint(int(x[0] *2 + int(x[2]/2)*2))\r\n", "x, y, z= [int(i) for i in input().split()]\nif(x > y):\n x, y = y, x\ndiff = min(y - x, z)\nprint( ((x+diff) + ((z-diff)//2) ) * 2)\n\t\t \t\t\t\t \t \t \t\t\t \t\t\t", "l,r,a = list(map(int, input().split()))\r\nans=0\r\n\r\nif l==r:\r\n ans = 2*l+a\r\n \r\n if ans&1:\r\n ans-=1\r\n \r\nelse:\r\n m = min(l,r)\r\n d = abs(l-r)\r\n \r\n if d>=a:\r\n m+=a\r\n ans = m+m\r\n \r\n else:\r\n m = max(l,r)\r\n a-=d\r\n \r\n if a&1:\r\n a-=1\r\n \r\n ans = m+m+a\r\n \r\nprint(ans)", "def main():\r\n l, r, a = map(int, input().split())\r\n z = abs(l-r)\r\n if l >= r:\r\n if z >= a:\r\n print((r+a)*2)\r\n else:\r\n d = a - z\r\n print(l*2+(d-d%2)) \r\n else:\r\n if z >= a:\r\n print((l+a)*2)\r\n else:\r\n d = a - z\r\n print(r*2+(d-d%2))\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b, c = map(int, input().split())\r\nif abs(a - b) > c:\r\n print((min(a, b) + c) * 2)\r\nelse:\r\n cnt = max(a, b) * 2\r\n c -= abs(a - b)\r\n print(cnt + (c // 2 * 2))\r\n", "n,m,k=map(int,input().split())\r\nif n>m:\r\n\tn,m=m,n\r\nif k>=m-n:\r\n\tprint(m*2+(k-(m-n))-(k-m+n)%2)\r\nelif k<m-n:\r\n\tprint((n+k)*2)\r\nelse:\r\n\tprint(\"0\")", "l,r,a=map(int,input().split())\r\nx,y=min(l,r),max(l,r)\r\ns,y=x*2,y-x\r\nif a>=y:\r\n\ts+=2*y\r\n\ts+=((a-y)//2)*2\r\nelse:\r\n\ts+=a*2\r\nprint(s)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\nl= lst[0]\r\nr= lst[1]\r\na= lst[2]\r\n\r\nwhile a > 0:\r\n if l < r:\r\n l +=1\r\n else:\r\n r += 1\r\n a -= 1\r\n\r\nprint(min(l,r)*2)\r\n", "from math import floor\n\nl, r, a = list(map(int, input().split()))\n\nresult = 0\n\nif l <= r:\n l, r = r, l\n\nresult += r\nl -= r\nif a >= l:\n result += l + floor((a - l) / 2)\nelse:\n result += a\n\nprint(2 * result)\n", "# your code goes here\nl,r,a=map(int,input().split(\" \"))\nans=0\nif l==r:\n\tans=(l+r)+2*(a//2)\nelif l<r:\n\tif a>(r-l):\n\t\tans=2*r+2*((a-r+l)//2)\n\telse:\n\t\tans=(l+a)*2\nelse:\n\tif a>(l-r):\n\t\tans=2*l+2*((a-l+r)//2)\n\telse:\n\t\tans=(r+a)*2\nprint(ans)\n", "l, r, a = map(int, input().split())\r\nans = 0\r\nif l > r:l, r = r, l\r\ngap = r - l\r\nif gap <= a:\r\n ans = r*2\r\n a -= gap\r\n ans += (a if a%2==0 else a-1)\r\n print(ans)\r\nelse:\r\n l += a\r\n print(l*2)", "#ty,d\r\nimport sys\r\n\r\nx, y, a = map(int, input().split())\r\n\r\nif x == y:\r\n if a % 2 != 0:\r\n a -= 1\r\n print(x + y + a)\r\n sys.exit()\r\n\r\nif x < y:\r\n if x + a <= y:\r\n x += a\r\n print(min(x, y) * 2)\r\n else:\r\n if y - x <= a:\r\n a -= (y - x)\r\n x = y\r\n if a % 2 != 0:\r\n a -= 1\r\n x += a // 2\r\n y += a // 2\r\n print(x + y)\r\n else:\r\n print(min(x, y) * 2 + a // 2)\r\nelse: # x >= y\r\n if y + a <= x:\r\n y += a\r\n print(min(y, x) * 2)\r\n else:\r\n if x - y <= a:\r\n a -= (x - y)\r\n y = x\r\n #print(x, y)\r\n if a % 2 != 0:\r\n a -= 1\r\n #print(a // 2)\r\n y += (a // 2)\r\n x += (a // 2)\r\n print(y + x)\r\n else:\r\n print(min(y, x) * 2 + a // 2)\r\n ", "l,r,d=map(int,input().split())\r\nb=0\r\nif l<r:\r\n if l+d==r:\r\n b=l+r+d\r\n elif l+d<r:\r\n b=2*(l+d)\r\n else:\r\n c=r-l\r\n l+=c\r\n d-=c\r\n b=l+r+2*int(d/2)\r\nelif r<l:\r\n if r+d==l:\r\n b=l+r+d\r\n elif r+d<l:\r\n b=2*(r+d)\r\n else:\r\n c=l-r\r\n r+=c\r\n d-=c\r\n b=l+r+2*int(d/2)\r\nelse:\r\n b=l+r+2*int(d/2)\r\nprint(b)", "def determineValue(value,newMin):\n if value > newMin:\n if (value - newMin) > 1:\n return newMin + (value - newMin)//2\n return newMin\n return value\n\ndef main():\n testCase = input()\n testCase = testCase.split()\n testCase = list(map(int, testCase))\n minIndex = testCase.index(min(testCase[:2]))\n minValue = testCase[minIndex]\n value = minValue + testCase[-1]\n if minIndex == 0:\n print(determineValue(value, testCase[1])*2)\n elif minIndex == 1:\n print(determineValue(value, testCase[0])*2)\nmain()\n\n\n", "l,r,a=map(int,input().split())\r\nif l==r:\r\n print(l+r+(a//2)*2)\r\nelse:\r\n if l<r:\r\n c=r-l\r\n if a>=c:\r\n a-=c\r\n print(r*2+(a//2)*2)\r\n else:\r\n print((l+a)*2)\r\n elif l>r:\r\n c=l-r\r\n if a>=c:\r\n a-=c\r\n print(l*2+(a//2)*2)\r\n else:\r\n print((r+a)*2)\r\n", "x,y,z=map(int,input().split())\r\nif(x>y):\r\n a=x-y\r\n b=min(a,z)\r\n y=y+b\r\n z=z-b\r\nelse:\r\n a=y-x\r\n b=min(a,z)\r\n x=x+b\r\n z=z-b\r\nif(z>1):\r\n p=z//2\r\n p=p*2\r\n print((min(x,y)*2)+p)\r\nelse:\r\n print(min(x,y)*2)", "l,r,a = map(int,input().split())\r\nprint(2*max([min(l+m,r+a-m) for m in range(a+1)]))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\nz=m+a\r\nif z<=max(l,r):\r\n print(2*z)\r\nelse:\r\n q=(l+r+a)//2\r\n print(2*q)\r\n \r\n \r\n", "l,r,a = map(int,input().split())\nans = 0\nans = min(l,r) * 2\nl -= ans // 2\nr -= ans // 2\nif l > 0:\n t = min(l,a) \n l -= t\n a -= t\n ans += t * 2\nelse:\n t = min(r,a)\n r -= t\n a -= t\n ans += t * 2\nif a > 0:\n ans += a // 2 * 2\nprint(ans)\n", "l,f,a = list(map(int,input().split()))\r\n\r\nif (l< f):\r\n if ((a+l) < f):\r\n l+=a\r\n a=0\r\n else:\r\n a-=(f-l)\r\n l+=(f-l)\r\nelif (l > f):\r\n if ((a+f) < l):\r\n f +=a\r\n a=0\r\n else:\r\n a-=(l-f)\r\n f+=(l-f)\r\nif (a!=0):\r\n a=a//2\r\n l+=a\r\n f+=a\r\nprint(min(l,f)*2)", "\r\ndef main():\r\n\tl, r, a = map(int, input().split())\r\n\tans = 0\r\n\tfor x in range(1000):\r\n\t\tif l + a >= x and r + a >= x and 2 * x - l - r <= a:\r\n\t\t\tans = x\r\n\tprint(2 * ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "r,l,a=map(int,input().split())\r\ndiff=abs(r-l)\r\nma=max(r,l)\r\nmi=min(r,l)\r\nif diff>a:\r\n mi=mi+a\r\n print(min(mi,ma)*2)\r\nelse:\r\n a=a-diff\r\n print((ma+int(a/2))*2)", "#!/usr/bin/env python3\n\nl, r, a = [int(x) for x in input().split()]\nans = min(l, r)\nl -= ans\nr -= ans\ntmp = max(l, r)\nans2 = min(a, tmp)\na -= ans2\ntmp -= ans2\nans3 = a // 2\nprint((ans + ans2 + ans3) * 2)\n", "string = input().split(\" \")\r\nlh = int(string[0])\r\nrh = int(string[1])\r\nam = int(string[2])\r\n\r\nif(lh>rh):\r\n maximum = lh\r\n minimum = rh\r\nelse:\r\n maximum = rh\r\n minimum = lh\r\n\r\nfor i in range(0, am):\r\n if(minimum<maximum):\r\n minimum+=1\r\n else:\r\n maximum+=1\r\n\r\nprint (min(minimum,maximum)*2)\r\n", "inputs = input().split()\r\nleft_h, right_h, am_h = (int(i) for i in inputs)\r\ndiff = 0\r\nif left_h < right_h:\r\n diff = (left_h + am_h) - right_h\r\n if diff < 0:\r\n print((left_h + am_h) * 2)\r\n else:\r\n print((right_h * 2) + ((diff // 2) * 2))\r\nelif left_h > right_h:\r\n diff = (right_h + am_h) - left_h\r\n if diff < 0:\r\n print((right_h + am_h) * 2)\r\n else:\r\n print((left_h * 2) + ((diff // 2) * 2))\r\nelif left_h == right_h:\r\n print((left_h * 2) + ((am_h // 2) * 2))\r\n", "l,r,b = map(int,input().split())\r\nif l+b<=r: print((l+b)*2)\r\nelif r+b<=l: print((r+b)*2)\r\nelse:\r\n if l==r:\r\n l += b//2\r\n print(l*2)\r\n else:\r\n if l>r: l,r = r,l\r\n diff = r-l\r\n l += min(b,diff)\r\n b -= min(b,diff)\r\n ans = min(l,r)+b//2\r\n print(ans*2)", "people = input().split(' ');\r\n\r\nleftHander = int(people[0])\r\nrighttHander = int(people[1])\r\nambiDexter = int(people[2])\r\n\r\nmaxPeople = max(leftHander, righttHander);\r\nminPeople = min(leftHander, righttHander);\r\n\r\nif (maxPeople - minPeople <= ambiDexter):\r\n ans = 2*(maxPeople + (ambiDexter - maxPeople + minPeople)//2);\r\nelse:\r\n ans = 2 * (ambiDexter + minPeople);\r\n\r\nprint(int(ans))", "x = list(map(int, input().split()))\r\nif x[0] == x[1]:\r\n print(2 * (sum(x) // 2))\r\nelse:\r\n if min(x[0], x[1]) + x[2] <= max(x[0], x[1]):\r\n print(2 * (min(x[0], x[1]) + x[2]))\r\n else:\r\n x[2] -= max(x[0], x[1]) - min(x[0], x[1])\r\n print(2 * ((2 * max(x[0], x[1]) + x[2]) // 2))\r\n", "a,b,k=map(int,input().split())\r\nm=max(a,b)\r\nn=min(a,b)\r\nif((n+k)<=m):\r\n print((n+k)*2)\r\nelse:\r\n p=k-(m-n)\r\n if(p%2==0):\r\n print(m*2 + p)\r\n else:\r\n print(m*2 + p -1)", "l,r,a=input().split()\r\nl=int(l)\r\nr=int(r)\r\na=int(a)\r\nmi=min(l,r)\r\nma=max(l,r)\r\nd=ma-mi\r\nans=0\r\nif a>d:\r\n ans=ma+int((a-d)/2)\r\nelse:\r\n ans=mi+a\r\nprint(ans*2)", "a,b,c=map(int,input().split())\nd=abs(b-a)\nif(c>=d):\n print(max(a,b)*2+c-abs(b-a)-(c-abs(b-a))%2)\nelse:\n print((c+min(a,b))*2)\n \t \t \t\t\t \t\t\t \t \t \t\t \t \t", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nl, r, a = list(map(int, input().split()))\r\n\r\nif a <= abs(l - r):\r\n print((min(l, r) + a) * 2)\r\nelse:\r\n print(max(l, r) * 2 + (a - abs(l - r)) // 2 * 2)\r\n", "l, r, a = map(int, input().split(' '))\r\nm1 = min(l,r)\r\nl = l - m1\r\nr = r - m1\r\nm2 = min(max(l,r),a)\r\na = a - m2\r\nm3 = a//2\r\nprint((m1+m2+m3)*2)\r\n", "l, r, a = map(int,input().split())\r\n\r\nwhile a >= 1:\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l,r)*2)\r\n\"\"\"\r\nif l < r:\r\n d = min(r-l, a)\r\n l += d\r\n a -= d\r\nelif l > r:\r\n d = min(r-l, a)\r\n r += d\r\n a -= d\r\n\r\nprint(2*min(l,r) + (a - (a % 2)))\r\n\"\"\"\r\n", "l, r, a = map(int, input().split())\r\nwhile a != 0:\r\n if r > l:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l, r)*2)\r\n", "from math import floor\r\nl, r, a = map(int, input().split())\r\nans = 0\r\nif l < r:\r\n r -= l\r\n ans += l*2\r\n if r < a:\r\n a -= r\r\n ans += r*2 + floor(a/2) * 2\r\n #print(\"CASE 1.1\", ans)\r\n else:\r\n ans += a*2\r\n #print(\"CASE 1.2\", ans)\r\nelse:\r\n l -= r\r\n ans += r*2\r\n if l < a:\r\n a -= l\r\n ans += l*2 + floor(a/2) * 2\r\n #print(\"CASE 2.1\", ans)\r\n else:\r\n ans += a*2\r\n #print(\"CASE 2.2\", ans)\r\nprint(ans)", "(l, r, a) = map(int, input().split(\" \"))\r\nif l <= r:\r\n if a + l <= r:\r\n print((l + a) * 2)\r\n else:\r\n print((l + r + a) // 2 * 2)\r\nelse:\r\n if a + r <= l:\r\n print((r + a) * 2)\r\n else:\r\n print((l + r + a) // 2 * 2)", "lHand , rHand , ambidexter = map(int, input().split())\r\nif (lHand == 0 and ambidexter == 0) or (rHand == 0 and ambidexter == 0):\r\n print(0)\r\nelse:\r\n if lHand>rHand:\r\n diff = lHand - rHand\r\n if diff>ambidexter:\r\n print(2*(rHand+ambidexter))\r\n else:\r\n print(2*(rHand+diff+(ambidexter-diff)//2))\r\n elif lHand == rHand:\r\n print(2*(lHand+(ambidexter)//2))\r\n else:\r\n diff = rHand - lHand\r\n if diff>ambidexter:\r\n print(2*(lHand+ambidexter))\r\n else:\r\n print(2*(lHand+diff+(ambidexter-diff)//2))", "def ok(l,r,a):\r\n return 2*min(l+a,r+a,(l+r+a)//2)\r\nl,r,a=map(int,input().split())\r\nprint(ok(l,r,a))\r\n\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nl, r, a = map(int, input().split())\r\nif a == 0:\r\n min_ = min(l, r)\r\n print(2 * min_)\r\nelif a != 0:\r\n # a is not equal to zero then we have to check if its diff is less than or equal or a or not and then we have to\r\n # check the same for another case\r\n if l < r:\r\n if r - l >= a:\r\n l += a\r\n print(2 * min(l, r))\r\n elif r - l < a:\r\n temp = r - l\r\n l += temp\r\n a -= temp\r\n x = a // 2\r\n l += x\r\n r += x\r\n print(2 * min(l, r))\r\n elif l > r:\r\n if l - r >= a:\r\n r += a\r\n print(2 * min(l, r))\r\n elif l - r < a:\r\n temp = l - r\r\n r += temp\r\n a -= temp\r\n x = a // 2\r\n l += x\r\n r += x\r\n print(2 * min(l, r))\r\n else:\r\n temp = a // 2\r\n l += temp\r\n r += temp\r\n print(2 * min(l, r))\r\n", "x,y,z=map(int,input().split())\nta=min(x,y)\ntb=min(abs(x-y),z)\ntc=(z-tb)//2\nres=(ta+tb+tc)*2\nprint(res)\n \t\t \t\t \t \t \t\t \t\t\t\t \t \t", "l,r,a=map(int,input().split())\r\nfor i in range(a):\r\n if l>r:\r\n r=r+1\r\n else:\r\n l=l+1\r\nprint(2*(min(l,r)))", "[l, r, a] = map(int, input().split()) \r\nif l >= r:\r\n if a >= l - r:\r\n right = l\r\n amb = a - (l - r)\r\n right = right + amb//2\r\n left = l + amb//2\r\n else:\r\n right = r + a\r\n left = right\r\nelse:\r\n if a >= r - l:\r\n left = l + (r - l)\r\n amb = a - (r - l)\r\n left = left + amb//2\r\n right = r + amb//2\r\n else:\r\n left = l + a\r\n right = left\r\nprint (right + left)", "l, r, a = list(map(int, input().split()))\r\nSum = (min(l, r) * 2) + (min(a, max(l, r) - min(l, r)) * 2)\r\nSum += (int((a - min(a, max(l, r) - min(l, r))) / 2) * 2 if a > min(a, max(l, r) - min(l, r)) else 0)\r\nprint(Sum)\r\n", "l, r, a = list(map(int, input().split()))\r\nM, m = max(l, r), min(l, r)\r\nres = (m + a) * 2 if (M - m >= a) else 2 * M + (a + m - M) // 2 * 2\r\nprint(res)", "l,r,a=map(int,input().split(\" \"))\r\n\r\nfor i in range(a):\r\n if(l<r):\r\n l+=1\r\n elif(r<l):\r\n r+=1\r\n else:\r\n l+=1\r\n \r\nprint(min(l,r)*2)", "import math\nl,r,a=map(int,input().split(\" \"))\nif l!=r:\n t=abs(l-r)\n if t<=a:\n a-=t\n print(2*max(l,r)+2*math.floor(a/2))\n else:\n print(2*min(l,r)+2*a)\nelse:\n print(l+r+2*math.floor(a/2))", "l, r, a = map(int, input().split())\n\nans = 0\nif l - r > a:\n ans = r + a\nelif r - l > a:\n ans = l + a\nelse:\n ans = max(l, r) + (a - abs(l-r)) // 2\nprint(2 * ans)", "l,r,a=map(int,input().split())\r\nif abs(l-r)<a:\r\n print(2*int((r+l+a)/2))\r\nelse:\r\n print(2*min(a+l,r+a))", "x = list(map(int, input().split(' ')))\r\nres = 0\r\nfor i in range(len(x)):\r\n if x[-1] == 0 and (x[1] == 0 or x[0] == 0):\r\n res = 0\r\n elif x[0] == x[1] and x[-1] != 0:\r\n res = (int(x[-1]/2) + x[0]) + (int(x[-1]/2) + x[1])\r\n else:\r\n for c in range(x[-1]+1):\r\n tl = x[0] + c\r\n tr = x[1]+x[-1]-c\r\n res = max(res, min(tl, tr)*2)\r\nprint(res)", "l, r, a = map(int, input().split())\r\ndif = max(l, r) - min(l, r)\r\npeople = 0\r\nif a > dif:\r\n people += max(l, r) * 2\r\n a -= dif\r\n people += a // 2 * 2\r\n print(people)\r\nelif a == dif:\r\n print(max(l, r) * 2)\r\nelse:\r\n people = (min(l, r) + a) * 2\r\n print(people)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l, r, a = map(int, input().split())\r\nans = min(l, r)\r\nl -= ans\r\nr -= ans\r\nif l > 0:\r\n temp = min(l, a)\r\n l -= temp\r\n a -= temp\r\n ans += temp\r\nif r > 0:\r\n temp = min(r, a)\r\n r -= temp\r\n a -= temp\r\n ans += temp\r\nif a > 1:\r\n ans += a//2\r\nprint(ans*2)", "l,r,a = map(int, input().split())\r\nprint(2*min(l+a,r+a,(l+r+a)//2))", "l, r, a = map(int, input().split())\r\nif l < r:\r\n l, r = r, l\r\n\r\nd = l - r\r\nif a > d:\r\n print(((r + d) + (a - d) // 2) * 2)\r\nelse:\r\n print((r + a) * 2)\r\n", "l, r, a = map(int, input().split())\r\nprint(min((l + r + a) // 2, l + a, r + a) * 2)", "l,r,a=list(map(int,input().split()))\r\nans=0\r\nk=min(l,r)\r\nt=max(l,r)\r\nans+=2*k\r\nans+=2*min(t-k,a)\r\na-=min(t-k,a)\r\nans+=a\r\nif(ans%2==1):\r\n ans-=1\r\nprint(ans) \r\n \r\n ", "l,r,a=map(int,input().split())\r\nm=abs(l-r)\r\nif a<=m:print(2*(min(l,r)+a))\r\nelse:print(2*max(l,r)+2*((a-m)//2))", "l,r,a = map(int,input().split())\nmn=min(l,r)\nmx=max(l,r)\n\nmn+=a\nif mn<=mx :\n print(mn*2)\nelif mn>mx :\n eltar=mn-mx\n if eltar%2==0 :\n print(2*mx + eltar)\n else : print(2*mx + eltar-1)\n\n\n #\n # لو هو فيه\n\n # لو هو فيه بزيادة\n # لو هو مفهوش\n\t \t \t \t \t \t \t \t\t \t \t\t", "import math\r\nfrom sys import stdin\r\nstring = stdin.readline().strip().split()\r\nl = int(string[0])\r\nr = int(string[1])\r\na = int(string[2])\r\ndiff=abs(l-r)\r\n#conpensate\r\nif diff<=a:\r\n output=max(l,r)*2+(a-diff)-(a-diff)%2\r\nelse:\r\n output=(min(l,r)+a)*2\r\nprint(output)", "import math\r\n\r\nl, r, a = (int(x) for x in input().split())\r\nif (l == 0 and r == 0) and a != 0:\r\n print((a//2)*2)\r\nelif (l == 0 and a == 0) or (r == 0 and a == 0):\r\n print(0)\r\nelif a == 0:\r\n print(min(l, r)*2)\r\nelse:\r\n if l > r:\r\n razn = l - r\r\n if razn > a:\r\n r += a\r\n print(int(r)*2)\r\n elif razn < a:\r\n r += razn\r\n a -= razn\r\n r += a // 2\r\n print(int(r)*2)\r\n elif razn == a:\r\n r += razn\r\n print(int(r)*2)\r\n elif r > l:\r\n razn = r - l\r\n if razn > a:\r\n l += a\r\n print(int(l)*2)\r\n elif razn < a:\r\n l += razn\r\n a -= razn\r\n l += a // 2\r\n print(l*2)\r\n elif razn == a:\r\n l += razn\r\n print(int(l)*2)\r\n else:\r\n l += a // 2\r\n print(int(l)*2)\r\n\r\n", "x = input().split()\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nif l > r :\r\n l, r = r, l\r\n\r\ntemp = r - l\r\n\r\nif temp <= a :\r\n a -= temp;\r\n ans = r + (a // 2)\r\nelse :\r\n ans = l + a\r\n\r\nprint(ans * 2)\r\n", "s = list(map(int, str(input()).split()))\r\n\r\nl = s[0]\r\nr = s[1]\r\na = s[2]\r\n\r\nans = 0\r\n\r\nx = min(l,r)\r\nans += x\r\nl -= x\r\nr -= x\r\n\r\nif a <= abs(l-r):\r\n ans += a\r\nelse:\r\n ans += abs(l-r)\r\n a -= abs(l-r)\r\n \r\n ans += (a // 2)\r\n\r\nprint(ans*2)", "if __name__ == \"__main__\":\r\n a , b , c = list(map(int, input().split()))\r\n mn = min(a,b)\r\n mx = max(a,b)\r\n d = mx - mn\r\n if d >= c:\r\n mn += c\r\n print(mn*2)\r\n else:\r\n e = c - d\r\n print(mx*2+(e//2)*2)", "import math\r\n\r\na, b, c = [int(x) for x in input().split()]\r\nanswer = 0\r\nminimum = min(a, b)\r\ndiff = abs(a - b)\r\nif diff >= c:\r\n diff -= c\r\n minimum += c\r\n c = 0\r\n answer = minimum\r\nelse:\r\n minimum += diff\r\n c -= diff\r\n diff = 0\r\n answer = minimum + math.floor(c / 2)\r\nprint(answer * 2)", "l,r,a = map(int,input().split())\nfor i in range(a):\n if l < r:\n l += 1\n elif l > r:\n r += 1\n else:\n l += 1\nif (l != r):\n print(2*min(l,r))\nelse:\n print(2*l)\n\n\n\n\n\n\n\n\n\n\n\n\n", "string = input().split(\" \")\r\nlh = int(string[0])\r\nrh = int(string[1])\r\nam = int(string[2])\r\n\r\nfor i in range(0, am):\r\n if(lh<rh):\r\n lh+=1\r\n else:\r\n rh+=1\r\n\r\nprint (min(lh,rh)*2)\r\n", "l,r,a=map(int,input().split())\r\nd=abs(l-r)\r\nif(d>a):\r\n print(2*(min(l,r)+a))\r\nelse:\r\n print(2*max(l,r)+ ((a-d) if (a-d)%2==0 else a-d-1))\r\n\r\n \r\n", "l,r,a=map(int,input().split())\r\nprint(2*(min(l+a,r+a,(l+r+a)//2)))", "'''input\r\n0 2 0\r\n'''\r\n\r\nl, r, a = [int(i) for i in input().split(\" \")]\r\nwhile (a > 0):\r\n\tif l > r:\r\n\t\tr += 1\r\n\telse:\r\n\t\tl += 1\r\n\ta -= 1\r\nprint(2 * min(l, r))", "l, r, a = map(int, input().split())\r\np = 0\r\nif r <= l:\r\n if r + a > l:\r\n p= (int((a- (l - r)) / 2) + l) * 2\r\n else:\r\n p = (r + a) * 2\r\nelif l < r:\r\n if l + a > r:\r\n p = (int((a- (r - l)) / 2) + r) * 2\r\n else:\r\n p = (l + a) * 2\r\nprint(p)\r\n \r\n \t ", "l,r,a = map(int,input().split())\r\nx = min((l+r+a)//2,l+a,r+a)*2\r\nprint(x)", "#39\r\n\r\nl,r,a=map(int,input().split())\r\nd=abs(l-r)\r\nif(d>=a):\r\n print((min(l,r)+a)*2)\r\nelse:\r\n a=a-d\r\n print(max(l,r)*2+(a//2)*2)", "a, b, c=map(int, input().split())\r\ncnt=0\r\nfor i in range(c):\r\n if a>b:\r\n b+=1\r\n else:\r\n a+=1\r\nprint(2*min(a, b))", "l,r,a = map(int,input().split())\r\nif max(l,r)-(min(l,r)+a)>1:print((min(l,r)+a)*2)\r\nelse: print(((l+r+a)//2)*2)", "l,r,a = [int(c) for c in input().split()]\r\n\r\nres = 0\r\nfor i in range(a+1):\r\n l1 = l + i\r\n r1 = r + a - i\r\n res = max(res, min(l1,r1) * 2)\r\nprint(res)\r\n", "s = list(map(int,input().split()))\r\nl = s[0]\r\nr = s[1]\r\na = s[2]\r\nm = min(l,r)\r\nc = 0\r\nc = c + m + m\r\nl=l-m\r\nr=r-m\r\nif(r==0):\r\n if(l>=a):\r\n c = c + a + a\r\n else:\r\n c = c + l + l\r\n a = a - l\r\n p = a//2\r\n c = c + p + p\r\nelif(l==0):\r\n if(r>=a):\r\n c = c + a + a\r\n else:\r\n c = c + r + r\r\n a = a - r\r\n p = a//2\r\n c = c + p + p\r\nprint(c)\r\n ", "a,b,c=map(int,input().split())\r\na,b=min(a,b),abs(a-b)\r\nd=min(b,c)\r\nprint(2*a+2*d+(c-d)//2*2)", "[l, r, a] = map(int, input().split())\r\n\r\nif l < r:\r\n if (l+a) < r:\r\n lnew = l+a \r\n rnew = lnew \r\n else: # l + a >= r\r\n lnew = r \r\n a = a - (r-l) \r\n lnew = lnew + a//2\r\n rnew = lnew \r\nelif l == r: \r\n lnew = l + a//2 \r\n rnew = lnew \r\nelse:\r\n if (r+a) < l:\r\n rnew = r+a \r\n lnew = rnew \r\n else: # r + a >= l \r\n rnew = l \r\n a = a - (l-r) \r\n rnew = rnew + a//2 \r\n lnew = rnew \r\n\r\nprint(lnew + rnew)", "l,r,a=map(int, input().split())\r\nmi = min(l,r)\r\nma = max(l,r)\r\nus = min((ma-mi), a)\r\not = (a - us) >> 1\r\nre = mi + us + ot\r\nprint (2 * re)", "left, right, ambidexters, count = [int(i) for i in input().split()] + [0]\r\ntotal = min(left, right) * 2\r\ndifference = max(left, right) - min(left, right)\r\nif ambidexters > difference:\r\n total += ambidexters + difference\r\nelse:\r\n total += ambidexters * 2\r\nprint(total) if total % 2 == 0 else print(total - 1)", "\r\nl, r, a = map(int, input().split())\r\n\r\nwhile l < r and a != 0:\r\n\tl += 1\r\n\ta -= 1\r\n\r\nwhile r < l and a != 0:\r\n\tr += 1\r\n\ta -= 1\r\n\r\nl += a // 2\r\nr += a // 2\r\n\r\nprint(min(r,l) * 2)", "def solution(l1):\r\n left=l1[0]\r\n right=l1[1]\r\n ambi=l1[2]\r\n stage1=min(left,right)\r\n stage2=min(ambi,max(left,right)-stage1)\r\n stage3=int((ambi-stage2)/2)\r\n #print(stage1,stage2,stage3)\r\n\r\n ans=2*(stage1+stage2+stage3)\r\n \r\n return ans\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "seq = input()\r\nvalues = seq.split()\r\nteamsize = 0\r\nl = int(values[0])\r\nr = int(values[1])\r\na = int(values[2])\r\ndiff = abs(l-r)\r\nif (diff ==0):\r\n teamsize = l+r+a\r\n teamsize = (teamsize if teamsize%2==0 else teamsize-1)\r\nelif (diff<a):\r\n fill = a-diff\r\n teamsize = l+r+fill+(a-fill)\r\n teamsize = (teamsize if teamsize%2==0 else teamsize-1)\r\nelse:\r\n fill = a+(l if (l<r) else r)\r\n teamsize = fill*2\r\nprint(teamsize)\r\n ", "s = input().split()\r\nl, r, a = int(s[0]), int(s[1]), int(s[2])\r\nwhile a > 0:\r\n if l <= r: \r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(2*min(l, r))\r\n", "a,b,c=map(int,input().split())\r\nif a<b:\r\n r=min(abs(a-b),c)\r\n a+=r\r\n c-=r\r\nif b<a:\r\n f=min(abs(a - b), c)\r\n b+=f\r\n c-=f\r\nif a==b:a+=c//2;b+=c//2\r\nif a-b==0:\r\n print(a+b)\r\nelse:\r\n print(min(a,b)*2)\r\n", "l,r,a=list(map(int,input().split()))\r\nwhile(a>0):\r\n if(l<=r):\r\n l+=1\r\n elif(l>=r):\r\n r+=1\r\n a-=1; \r\nprint(min(l,r)*2) ", "l, r, a =[int(i) for i in input().split()]\r\nt=2*min(l, r)\r\nx=min(abs(l-r), a)\r\nprint(t+x*2+(a-x)-(a-x)%2)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nl, r, a = map(int, input().split())\r\nwhile True:\r\n if l < r and a:\r\n l += 1\r\n a -= 1\r\n elif l > r and a:\r\n r += 1\r\n a -= 1\r\n elif l == r and a > 1:\r\n l += 1\r\n r += 1\r\n a -= 2\r\n else:\r\n break\r\nans = 2 * min(l, r)\r\nprint(ans)", "l,r,a = map(int,input().split())\r\npair1 = min(l,r)\r\npair2 = min(abs(l - r), a)\r\npair3 = (a - pair2) // 2\r\nresult = (pair1 + pair2 + pair3) * 2\r\nprint(result)", "l, r, a = [int(s) for s in input().split(' ')]\r\nx = 2 * min(l, r) + 2 * min(a, abs(l - r)) + 2 * max(0, (a - abs(l - r)) // 2)\r\nprint(x)", "from math import ceil, sqrt, floor\r\nimport sys \r\n\r\nl,r,a = map(int, input().split())\r\nl,r = sorted([l,r]) \r\n\r\nif l + a <= r:\r\n print(2*(l+a))\r\nelse:\r\n print(2*r + 2*((a + l - r) // 2))", "a,b,c=[int(x) for x in input().split()]\r\na,b=min(a,b),max(a,b)\r\nif a+c==b:\r\n print(2*b)\r\nelif a+c<b:\r\n print(2*(a+c))\r\nelse:\r\n print(((a+b+c)//2)*2)", "lra = list(map(int, input().split()))\r\nif lra[0] > lra[1]:\r\n\ttemp = min(lra[2], lra[0] - lra[1])\r\n\tlra[1] += temp\r\n\tlra[2] -= temp\r\nelse:\r\n\ttemp = min(lra[2], lra[1] - lra[0])\r\n\tlra[0] += temp\r\n\tlra[2] -= temp\r\nprint(2 * min(lra[1], lra[0]) + lra[2] - (lra[2] % 2))", "l,r,a=map(int,input().split())\r\nd=abs(r-l)\r\nif a<=d:\r\n print(2*(min(l,r)+a))\r\nelse:\r\n print(2*(max(l,r)+(a-d)//2))", "# https://codeforces.com/problemset/problem/950/A\r\n\r\ninp_ = input()\r\nl, r, a = map(int, inp_.split(\" \"))\r\nwhile l != r:\r\n if a != 0:\r\n if l > r:\r\n r += 1\r\n a -= 1\r\n if r > l:\r\n l += 1\r\n a -= 1\r\n else:\r\n if l>r:\r\n l=r\r\n else:\r\n r=l\r\n break\r\ntotall = r + l + (a//2)*2\r\nprint(totall)", "l,r,a = map(int,input().split())\r\nna = abs(r-l)\r\nif(na>=a):\r\n if(l<r):\r\n l+=a\r\n else:\r\n r+=a\r\n print(min(l,r)*2)\r\nelse:\r\n till = max(l,r)*2\r\n a-=na\r\n till+=((a//2)*2)\r\n print(till)\r\n ", "l, r, a = [int(i) for i in input().split()]\r\ncount = min(l, r) * 2\r\nmn = min(l, r)\r\nl = l - mn\r\nr = r - mn\r\nmx = max(l, r)\r\nwhile a > 0:\r\n if mx == 0:\r\n mx += 1\r\n a -= 1\r\n if a > 0 and mx > 0:\r\n mx -= 1\r\n a -= 1\r\n count += 2\r\nprint(count)\r\n", "a, b, c = map(int, input().split())\nm = min(a, b)\na -= m\nb -= m\nans = m\nm = min(max(a, b), c)\nans += m\nc -= m\nif c > 0:\n ans += c // 2\nprint(ans * 2)", "s=input().split()\r\nl,p,a=int(s[0]),int(s[1]),int(s[2])\r\nr=abs(l-p)\r\nif a>=r:\r\n print(l+p+r+2*((a-r)//2))\r\nelse:\r\n print(2*min(l,p)+2*a)\r\n", "l,r,a=map(int,input().split())\r\nif l<r:\r\n if l+a-r>0:\r\n k=(r+(l+a-r)//2)*2\r\n else:\r\n k=(l+a)*2\r\nelif l==r:\r\n k=(l+a//2)*2\r\nelse:\r\n if r+a-l>0:\r\n k=(l+(r+a-l)//2)*2\r\n else:\r\n k=(r+a)*2\r\nprint(k)\r\n \r\n", "l, r, a = map(int, input().split())\nc = min(l+a, r+a, (l+r+a)//2)\nprint(2*c)\n\n", "# http://codeforces.com/contest/467/problem/A\n\nl, r, a = map(int, input().split())\n\nmn = min(l, r)\nmx = max(l, r)\n\nteam = mn + a\n\ne = team - mx\n# print(mx, mn, team, e)\nif e > 0:\n\tteam = mx + int(e/2)\nelse:\n\tteam = mx + e\n\nprint(team * 2)", "l,r,a = [int(x) for x in input().split()]\r\nans = 0\r\nif l<=r:\r\n\tif (r-l)<=a:\r\n\t\tans=r*2 + (a-(r-l))//2*2\r\n\telse:\r\n\t\tans=(l+a)*2\r\nelse:\r\n\tif (l-r)<=a:\r\n\t\tans=l*2 + (a-(l-r))//2*2\r\n\telse:\r\n\t\tans=(r+a)*2\r\nprint (ans)\r\n", "def euclid_algo(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if b == 0:\r\n return a\r\n return euclid_algo(b, a % b)\r\n\r\n\r\n\r\ndef main_function():\r\n l, r, a = [int(i) for i in input().split(\" \")]\r\n difference = max(l, r) - min(l, r)\r\n if difference >= a:\r\n return 2 * (min(l, r) + a)\r\n return 2 * (max(l, r) + (a - difference) // 2)\r\n\r\n\r\nprint(main_function())", "a,b,c=map(int, input().split())\r\nif min(a,b)+c>max(a,b):\r\n print(((c-abs(a-b))//2+max(a,b))*2)\r\nelse: print(2*(min(a,b)+c))\r\n\r\n", "l,r,a = (int(x) for x in input().split())\r\nwhile a > 0:\r\n if l < r: l += 1\r\n else: r += 1\r\n a -= 1\r\nprint(min(l,r)*2)\r\n\r\n", "def maxTeamSize(l, r, a):\r\n playersLeft = a\r\n if l > r:\r\n playersLeft = max(playersLeft - (l - r), 0)\r\n r += a - playersLeft\r\n else:\r\n playersLeft = max(playersLeft - (r - l), 0)\r\n l += a - playersLeft\r\n \r\n return (r + l + (playersLeft // 2) * 2) if r == l else min(r, l) * 2\r\n \r\n \r\n\r\nl, r, a = map(int, input().split())\r\nprint(maxTeamSize(l, r, a))\r\n\r\n\r\n", "x,y,z=map(int,input().split())\r\nif abs(x-y)<=z:\r\n z-=abs(x-y)\r\n if x<y:x=y \r\n elif x>y:y=x\r\n print((x+z//2)*2) \r\nelse:\r\n if x<y:x+=z\r\n elif x>y:y+=z\r\n print(min(x,y)*2)", "string=input()\r\nla=list(map(int,string.split()))\r\nl=la[0]\r\nr=la[1]\r\na=la[2]\r\nwhile(a>0):\r\n\tif r<l:\r\n\t\tr+=1\r\n\telse:\r\n\t\tl+=1\r\n\ta-=1\r\nif r<l:\r\n\tprint(2*r)\r\nelse:\r\n\tprint(2*l)", "l,r,a=map(int,input().split())\r\ncount=0\r\nif l==r:\r\n count=l+r\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2*(a//2)\r\nelif l<r:\r\n if(l+a)==r:\r\n count+=(l+r+a)\r\n elif (l+a)<r:\r\n count+=2*(l+a)\r\n else:\r\n count+=2*r\r\n a=(a-(r-l))\r\n #print(a)\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2*(a//2)\r\nelse :\r\n if(r+a)==l:\r\n count+=(l+r+a)\r\n elif (r+a)<l:\r\n count+=2*(r+a)\r\n else:\r\n count+=2*l\r\n a=(a-(l-r))\r\n #print(a)\r\n if a%2==0:\r\n count+=a\r\n else:\r\n count+=2*(a//2)\r\nprint(count)\r\n ", "l , r , a = input().split()\nl = int(l)\na = int(a)\nr = int(r)\n\nm = min(l,r)\nwhile (m!=max(l,r))&(a!=0):\n\ta-=1\n\tm+=1\nif a>1:\n\tm += (a//2) \nprint (m*2)\n", "l,r,a = map(int,input().split())\nmini = min(l,r)\nmaxi = max(l,r)\nif maxi - mini >=a :\n print((mini +a) *2)\nelse :\n a-= maxi-mini\n if a >1 :\n maxi += a//2\n print(maxi*2)\n\n", "l,r,a=[*map(int,input().split())]\nt=abs(l-r)\nif a>=t:\n print(2*(max(l,r)+(a-t)//2))\nelse:\n print(2*(min(l,r)+a))\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\n[l, r, a] = map(int, input().split())\nnl = min(l, r)\nnr = max(l, r)\nif nr - nl <= a:\n print(((nr + nl + a) // 2) * 2)\nelse:\n print((nl + a) * 2)\n", "r, l, a = input().split()\r\nr = int(r)\r\nl = int(l)\r\na = int(a)\r\n#l = int(input())\r\n#a = int(input())\r\ndef team(a):\r\n if (a)%2 == 0:\r\n return a\r\n else:\r\n return a-1\r\ndef count(a,b):\r\n if a>b:\r\n return 2*b\r\n else:\r\n return 2*a\r\n \r\nwhile a>0:\r\n if r<l:\r\n r+=1\r\n a-=1\r\n else:\r\n l+=1\r\n a-=1\r\nprint(count(l,r))", "l,r,a=map(int,input().split())\r\nwhile a!=0:\r\n\tif l==r :\r\n\t\tif a%2==0:\r\n\t\t\tl+=a//2\r\n\t\t\tr+=a//2\r\n\t\telse:\r\n\t\t\ta=a-1\r\n\t\t\tl+=a//2\r\n\t\t\tr+=a//2\r\n\t\tbreak\r\n\telif l>r and a>0:\r\n\t\tr+=1\r\n\t\ta-=1\r\n\telif r>l and a>0:\r\n\t\tl+=1\r\n\t\ta-=1\r\nif l>r:\r\n\tprint(l-(l-r)+r)\r\nelif r>l:\r\n\tprint(l+r-(r-l))\r\nelse:\r\n\tprint(l+r)", "a, b, c = map(int,input().split())\r\nif a+c < b:\r\n print((a+c)*2)\r\nelse:\r\n if b+c<a:\r\n print((b+c)*2)\r\n else:\r\n print((a+b+c)//2*2)", "import sys\r\n\r\nl, r, a = (int(x) for x in next(sys.stdin).split())\r\n\r\nhands = sorted([l, r])\r\nif a <= hands[1] - hands[0]:\r\n print(2 * (hands[0] + a))\r\nelse:\r\n print((l + r + a) // 2 * 2)\r\n", "l,r,b=map(int,input().split())\r\n\r\nwhile(b):\r\n b-=1\r\n if l<r :\r\n l+=1\r\n else:\r\n r+=1\r\n \r\nprint(min(l,r)*2) ", "l, r, a = map(int, input().split())\n\nif abs(l - r) > a:\n\tprint(2 * (min(l, r) + a))\nelse:\n\ta_remain = a - abs(l - r)\n\ta_add = a_remain - a_remain % 2\n\tprint(2 * max(l, r) + a_add)\n", "from sys import stdin\r\n \r\nrd = stdin.readline\r\n\r\nl, r, a = map(int, rd().split())\r\n\r\nres = 2 * (min(l, r) + min(a, max(l, r) - min(l, r)))\r\nres += 2 * ((a - min(a, max(l, r) - min(l, r))) // 2)\r\n\r\nprint(res)\r\n\r\n \r\n", "if __name__ == \"__main__\":\r\n l, r, a = map(int, input().split())\r\n l, r = min(l, r), max(l, r)\r\n r -= l\r\n l += min(r, a) + max(0, a - r) // 2\r\n print(l * 2)\r\n", "l, r, a = [int(x) for x in input().split()]\r\n\r\nif(a>0):\r\n\twhile a>0:\r\n\t\tif l>r:\r\n\t\t\tr+=1\r\n\t\telse:\r\n\t\t\tl+=1\r\n\t\ta-=1\r\n\r\nx=min(l,r)\r\nx*=2\r\nprint(x)\r\n", "l, r, a = map(int, input().split())\nx, y = a + min(l, r), max(l, r)\nprint( 2 * x if x == min(x, y) else 2 *(y + (x - y)//2))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\nv=max(l,r)\r\nd=v-m\r\nprint(2*(v+(a-d)//2) if a>d else 2*(m+a))\r\n", "l,r,a=map(int,input().split())\r\nm=2*min(l,r)\r\nx=abs(l-r)\r\nk=min(x,a)\r\nz=2*k\r\na=max(0,a-k)//2\r\nm=2*a+m+z\r\nprint(m)", "l, r, ambidextors = map(int, input().split())\r\n\r\nbase_team_size = 2 * min(l,r)\r\nextra_onehanded = max(max(l,r) - base_team_size//2, 0)\r\n\r\nif extra_onehanded :\r\n more_pairs = min(extra_onehanded, ambidextors)\r\n base_team_size += 2* more_pairs\r\n ambidextors -= more_pairs\r\n extra_onehanded -= more_pairs\r\n\r\nmax_team_size = base_team_size + ambidextors - (ambidextors%2)\r\n\r\n\r\n\r\nprint(max_team_size)", "l,r,a=map(int,input().split())\r\ndif=max(l,r)-min(l,r)\r\nif dif==0:\r\n\tprint(2*(min(l,r)+a//2))\r\nelse:\r\n\tif a>=dif:\r\n\t\tprint(2*((min(l,r)+dif)+((a-dif)//2)))\r\n\telse:\r\n\t\tprint(2*(min(l,r)+a))", "l, r, a = map(int, input().split())\n\nans = 0\n\n\"\"\"\n1 4 2 => 6\n5 5 5 => 14\n0 2 0 => 0\n\"\"\"\n\nif l < r and a != 0:\n\tsub = r - l\n\tif sub - a > 0:\n\t\tans = (l + a) * 2\n\telif sub - a == 0:\n\t\tans = r * 2\n\telse:\n\t\t_sub = a - sub\n\t\tans = (r +_sub // 2) * 2\n\nelif l > r and a != 0:\n\tsub = l - r\n\tif sub - a > 0:\n\t\tans = (r + a) * 2\n\telif sub - a == 0:\n\t\tans = l * 2\n\telse:\n\t\t_sub = a - sub\n\t\tans = (l +_sub // 2) * 2\nelif l == r and a != 0:\n\tisy = a // 2\n\tans = (l + isy) * 2\nelif a == 0:\n\t_min = min([l, r])\n\tans = _min * 2\n\nprint(ans)", "l,r,a=map(int,input().split())\r\nmx=0\r\nfor i in range(a+1):\r\n tl=l+i\r\n tr=r+a-i\r\n\r\n mx=max(mx,min(tl,tr)*2)\r\n\r\nprint(mx)", "l,r,a= map(int, input().split())\r\nif a<max(l,r)-min(l,r):\r\n print(2*(a+min(l,r)))\r\nelse:\r\n print(2*(max(l,r)+(a-max(l,r)+min(l,r))//2))", "l, r, a = map(int, input().split())\r\nprint(2*(min(l, r) + min(a, abs(l - r)) + max(0, a - abs(l - r))//2)) \r\n", "l,r,a=map(int,input().split())\r\nx=a\r\nif l<r:\r\n min=l\r\n max=r\r\nelse:\r\n min=r\r\n max=l\r\nfor i in range (0,a):\r\n if x==0:\r\n break\r\n if min==max:\r\n break\r\n min+=1\r\n x-=1\r\n if x==0:\r\n break\r\n if min==max:\r\n break\r\nteam=min*2\r\nif x%2==0:\r\n team+=x\r\nelse:\r\n team+=x-1\r\nprint(team)\r\n \r\n", "l, r, a = [int(x) for x in input().split()]\r\nif l > r:\r\n l, r = r, l\r\nif a >= r - l:\r\n print(((l + r + a) >> 1) << 1)\r\nelse:\r\n print((l + a) << 1)", "l, r, a = map(int, input().split())\r\nmx = 0\r\nfor i in range(a + 1):\r\n x = r + i\r\n y = l + a - i\r\n mx = max(mx, min(x, y) * 2)\r\nprint(mx)\r\n", "l, r, a = list(map(int, input().split()))\r\n\r\nif l > r:\r\n l, r = r, l\r\n\r\nif l + a <= r:\r\n print((l + a) * 2)\r\nelse:\r\n print((r + (l + a - r) // 2) * 2)\r\n", "l,r,a=map(int,input().split())\r\n\r\nprint(2*min(l+a,r+a,(l+a+r)//2))\r\n", "l, r, a = map(int, input().split())\r\nd = min(abs(r-l), a)\r\na -= d\r\nprint((min(l, r) + d + a//2)*2)", "import sys\r\n\r\ndef main():\r\n l, r, a = map(int, sys.stdin.read().strip().split())\r\n t = min(abs(l-r), a)\r\n a = (a - t)//2\r\n return 2*(min(l, r) + t + a)\r\n \r\nprint(main())\r\n", "l,r,a=map(int,input().split())\r\nans=min(l,r)\r\nans+=min(a,abs(l-r))\r\na-=min(a,abs(l-r))\r\nans+=a//2\r\nprint(2*ans)\r\n", "l,r,a = map(int,input().split())\r\nif (l == r):\r\n print(2 * (r + a // 2))\r\nelse:\r\n mi = min(l,r)\r\n ma = max(l,r)\r\n k = ma - mi\r\n if (a < k):\r\n print(2 * (mi + a))\r\n else:\r\n a = a - k\r\n mi = mi + k\r\n print(2 * (mi + a // 2))", "import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nl, r,a = map(int, input().split())\r\nif(l>r):\r\n l,r = r, l\r\n# print(min(r-l, a))\r\ntemp = min(r-l, a)\r\nl += temp\r\n\r\na = a-temp\r\n\r\nl = l + (a//2)\r\nprint(l*2)", "def test_0():\n # A - World Cup\n import math\n l, r, a = list(map(int, input().split(\" \")))\n if l < r:\n l, r = r, l\n b = l - r\n\n if b > a:\n d = (r + a) * 2\n if b <= a:\n d = (l + r + a) // 2 * 2\n print(d)\n\n\ntest_0()\n\t\t\t\t\t \t \t \t\t\t \t\t \t \t\t\t \t\t", "l,r,a=list(map(int,input().split()))\r\nm=min(l,r)\r\nx=max(l,r)\r\nif m==x:\r\n if a%2==0:print(m*2+a)\r\n else:print(m*2+a-1)\r\nelse: \r\n m+=a\r\n if m>x:\r\n d=m-x\r\n if d%2==0:print(x*2+d)\r\n else:print(x*2+d-1)\r\n else:print(m*2) ", "x = input().split()\r\nl = int(x[0])\r\nr = int(x[1])\r\na = int(x[2])\r\n\r\nmin1 = min(l,r)\r\nmax1 = max(l,r)\r\ndiff = max1 - min1\r\n\r\nif diff > 0:\r\n if diff > a:\r\n print((min1+a)*2)\r\n else:\r\n a-=diff\r\n divide = int(a/2)\r\n print((max1+divide)*2)\r\nelse:\r\n print((min1+int(a/2))*2)\r\n ", "import itertools\r\n\r\n\r\n\r\n\r\ndef main():\r\n l,r,a = [int(v) for v in input().split()]\r\n d = min(l,r)\r\n res = d\r\n v = min(a, max(l,r)-d)\r\n res+=v\r\n res+=max(0, a-v)//2\r\n print(res*2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l,r,a=map(int,input().split())\r\n\r\nminn=min(l,r)\r\nmaxx=max(l,r)\r\n\r\nans=minn*2\r\nmaxx-=minn\r\n\r\n\r\nif(maxx>=a):\r\n ans+=a\r\n ans+=a\r\n \r\nelse:\r\n ans+=maxx \r\n ans+=maxx\r\n \r\n a-=maxx\r\n if(a>=0):\r\n ans+=a//2\r\n ans+=a//2\r\nprint(ans) \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n", "l,r,a = map(int, input().split())\r\n\r\nif l>r:\r\n t = l\r\n l = r\r\n r = t\r\n\r\np = r-l;\r\n\r\nif p>=a:\r\n l += a\r\nelse:\r\n l = r\r\n l+=int((a-p)//2)\r\n\r\nprint(l*2)\r\n", "l,r,a = map(int,input().split())\r\nwhile a != 0:\r\n if l < r:\r\n l+=1\r\n a-=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(2*min(l,r))", "l,r,a=map(int,input().split())\r\nm=min(l,r)\r\ns=l+r-m\r\nn=s-m\r\nprint([m+a,s+(a-n)//2][a>n]*2)", "l,r,am=map(int,input().split())\r\na,b=min(l,r),max(l,r)\r\ndiff=b-a \r\nif am<=diff:\r\n a+=am\r\nelse:\r\n a=a+diff \r\n rem=am-diff \r\n a=a+rem//2 \r\n b=b+rem//2\r\nprint(min(a,b)*2)\r\n ", "l,r,a=map(int,input().split())\r\nm=max(l,r)\r\nif m==r:\r\n if l+a>m:\r\n d=r-l\r\n l=l+d\r\n a=a-d\r\n c=a//2\r\n t=(r+c)*2\r\n else:\r\n l=l+a\r\n t=min(l,r)*2\r\nelif m==l:\r\n if r+a>m:\r\n d=l-r\r\n r=r+d\r\n a=a-d\r\n c=a//2\r\n t=(l+c)*2\r\n else:\r\n r=r+a\r\n t=min(l,r)*2\r\nprint(t)", "l, r, a = map(int, input().split())\nmn, mx = min(l, r), max(l, r)\ndiff = mx - mn\nmn += min(diff, a) \na -= min(diff, a)\nif a > 0:\n mn += a//2\n mx += a//2\nprint(2*min(mn, mx))\n", "l=list(map(int,input().split()))\r\na=min(l[0],l[1])\r\nb=max(l[0],l[1])\r\ns=l[-1]\r\nif a+s>b:\r\n\ts-=(b-a)\r\n\tc=b*2+(s//2)*2\r\nelse:\r\n\tc=(a+s)*2\r\nprint(c)", "l,r,a=map(int,input().strip().split())\r\nx=max(l,r)\r\ny=min(l,r)\r\nif a<=x-y:\r\n print((y+a)*2)\r\nelse:\r\n print(x*2+(a-x+y)//2*2)", "l, r, a = map(int, input().split())\r\n\r\nif l == r:\r\n if a % 2 == 0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\nelif l > r:\r\n if l-r < a:\r\n a -= (l-r)\r\n if a % 2 == 0:\r\n print(2*l+a)\r\n else:\r\n print(2*l+a-1)\r\n else:\r\n print(2*(min(l, r+a))) \r\n \r\nelse:\r\n if r - l < a:\r\n a -= (r-l)\r\n if a % 2 == 0:\r\n print(2*r+a)\r\n else:\r\n print(2*r+a-1)\r\n else:\r\n print(2*(min(r, l+a))) ", "l,r,a = [int(k) for k in input().split()]\r\nif(l<r):\r\n if(l+a<=r):\r\n print(2*(l+a))\r\n else:\r\n print(2*r + 2*int((l+a-r)/2))\r\nelif(l>r):\r\n if(r+a<=l):\r\n print(2*(r+a))\r\n else:\r\n print(2*l + 2*int((r+a-l)/2))\r\nelse:\r\n print(2*(l+int(a/2)))", "l,r,a=[int(i) for i in input().split()]\r\nif l>r:\r\n t=r*2\r\n x=l-r\r\nelse:\r\n t=l*2\r\n x=r-l\r\nif a>x:\r\n t=t+2*x\r\n z=a-x\r\n y=(z//2)*2\r\n t=t+y\r\nelse:\r\n t=t+2*a\r\nprint(t)", "w=list(map(int,input().split()))\r\nl = w[0]\r\nr = w[1]\r\na = w[2]\r\nif (l>r):\r\n if(a>=l-r):\r\n a-=(l-r)\r\n r=l\r\n else:\r\n r+=a\r\n l=r\r\n a=0\r\nelif(r>l):\r\n if(a>=r-l):\r\n a-=(r-l)\r\n l=r\r\n else:\r\n l+=a\r\n r=l\r\n a=0\r\n\r\nif(l==r):\r\n print((l+a//2)*2)\r\n \r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#\r\n\"\"\"\r\n89 44 77\r\nl r b\r\n44 + 44 = 45\r\n45 + 45 = 32\r\n16 + 16\r\n\r\n30 70 34\r\n\r\nmin(l, r) = 30\r\n70 - 30 => 40 => 60\r\n40 - 34 => 68\r\n\"\"\"\r\n\r\nl,r,b = invr()\r\n\r\nres = l + r + b\r\nc = Counter([l,r,b])\r\n\r\nmn = min(l, r)\r\nmx = max(l, r)\r\n\r\nr = mx - mn\r\n\r\ntotal = mn * 2\r\n\r\nif(b > r):\r\n total += r*2\r\n b -= r\r\n if(b % 2 == 0):\r\n total += b\r\n else:\r\n total += b-1\r\nelse:\r\n total += b*2\r\n\r\nprint(total)", "giris = input()\r\n#girilecek bir satır inputu string olarak alıyoruz\r\nayirilmisInput = giris.split(\" \")\r\n#girilen string'i boşluklarından ayırrarak diziye çeviriyoruz, örneğin \"3 4 5\" string'i, [3, 4, 5] olarak diziye dönüyor.\r\nl = int(ayirilmisInput[0])\r\nr = int(ayirilmisInput[1])\r\na = int(ayirilmisInput[2])\r\n#dizinin string cinsinden elemanlarını sıra sıra integer'a dönüştürüp değişkenlerimize atıyoruz.\r\n\r\nwhile(a > 0):\r\n a -= 1\r\n if(l < r):\r\n l += 1\r\n else:\r\n r += 1\r\n#a'daki değeri l ve r'ye önceliğe göre dağıtıyoruz.\r\nkucukOlan = min(l, r)\r\n#sonuçta takım, küçük kalan tarafa göre kurulacak. minimum miktarı alıyoruz.\r\ntoplamOyuncuSayisi = kucukOlan * 2\r\n#toplam oyuncu sayısını bulmak için 2 ile çarpıyoruz.\r\nprint(toplamOyuncuSayisi)\r\n", "import math\r\n\r\n\r\nl,r,a=[int(i) for i in input().split()]\r\nz=min(l,r)\r\ny=max(l,r)\r\ndiff=y-z\r\nif a==diff:\r\n print(2*y)\r\nelif a<diff:\r\n print(2*(z+a))\r\nelse :\r\n new_a=a-diff\r\n x=math.floor(new_a/2)\r\n print(2*(y+x))", "L,R,A = map(int,input().split())\r\nprint(2*min(L+A,R+A,(A+L+R)// 2))", "l , r , x = map(int,input().split())\r\n\r\nwhile x > 0 :\r\n if l <= r :\r\n x-=1\r\n l +=1\r\n elif r <= l :\r\n x-=1\r\n r+=1\r\n \r\n\r\n\r\n\r\n#print(l , r)\r\nprint(min(l,r) * 2 )\r\n\r\n\r\n", "l,r,a=map(int,input().split())\r\nd=l-r\r\nif(d<0):\r\n d=d*-1\r\nm=min(l,r) \r\nif(a<=d):\r\n print(2*(m+a))\r\nelse:\r\n print(2*(m+d)+int((a-d)/2)*2) ", "l,r,a=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(a+1):\r\n k=l+i\r\n d=r+a-i\r\n m=max(m,min(k*2,d*2))\r\nprint(m)\r\n", "l, r, a = map(int, input().split())\r\nans = 0\r\nwhile a>0:\r\n a -= 1\r\n if r>l:\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)*2)", "def oloko (lot):\r\n l = lot[0]\r\n r = lot[1]\r\n a = lot[2]\r\n o = True\r\n if (l==0 or r== 0) and (a==0):\r\n return 0\r\n else:\r\n while o == True:\r\n #print(l, r)\r\n if l < r and a>=1:\r\n a-=1\r\n l+=1\r\n elif r<l and a>=1:\r\n a-=1\r\n r+=1\r\n elif r==l and a>=2:\r\n r+=1\r\n l+=1\r\n a-=2\r\n elif l < r:\r\n #a = r-l\r\n r = l\r\n elif r < l:\r\n #a = l-r \r\n l = r\r\n else:\r\n o = False\r\n #print(l, r)\r\n if (r==l):\r\n return r+l\r\n else:\r\n return 0\r\nlots = input().split()\r\nlots = [int(lots[i]) for i in range (0, len(lots))]\r\nprint(oloko(lots))", "l,r,a=map(int,input().split())\r\nwhile a > 0:\r\n if l < r:\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(min(l,r)*2)", "l,r,a=map(int,input().split())\r\n\r\n# min1,max1=min(l,r),max(l,r)\r\n# max1-=min1\r\n# min1*=2\r\n# if(a<=max1):\r\n# print(min1+a*2)\r\n# else:\r\n# print(min1+((a+max1)//2)*2)\r\nwhile(a>0):\r\n if(l<r):\r\n l+=1\r\n else:\r\n r+=1\r\n a-=1\r\nprint(min(l,r)*2)", "from math import *\r\n\r\nl ,r ,a = map(int,input().split())\r\nans = 0\r\nmaxi = max(l,r)\r\nmini = l+r-maxi\r\nif (maxi - mini > a):\r\n print(min(maxi,mini+a)*2)\r\nelse:\r\n print((maxi + (a + mini - maxi)//2)*2)\r\n", "l,r,a = map(int,input().split())\r\ntotal = 0\r\nif min(l,r)+a<=l or min(l,r)+a<=r:\r\n minemum = min(l,r)+a\r\n total=minemum*2\r\nelse:\r\n minemum = min(l,r)+a\r\n a = minemum-max(l,r)\r\n minemum = max(l,r)\r\n total=(minemum*2)+(a)\r\n \r\nif total%2==0:\r\n print(total)\r\nelse:\r\n print(total-1)", "l,r,a=map(int,input().split())\r\nfor _ in range(a):\r\n\tif l<r:l+=1\r\n\telse:r+=1\r\nprint(min(l,r)*2)", "l,r,a = map(int,input().split())\r\n\r\n\r\n#print(\"a\")\r\nmi = min(l,r)\r\nma = max(l,r)\r\nwhile (mi != ma) and (a != 0):\r\n #print(\"b\")\r\n mi = mi + 1\r\n a = a - 1\r\n \r\n#print(mi)\r\nprint( 2*mi + (a//2)*2 )", "l,r,a=map(int,input().split())\r\nif min(l,r)+a <= max(l,r):\r\n\tprint(2*(min(l,r)+a))\r\nelif l==r==a:\r\n\tprint(3*l - l%2)\r\nelse:\r\n\tx=abs(min(l,r)-max(l,r))\r\n\ty=abs(a-x)\r\n\tprint(2*max(l,r)+ y-abs(a-x)%2)\r\n", "l,r,a=map(int,input().split())\r\n\r\nif l<r:\r\n if l+a<=r:\r\n print(2*(l+a))\r\n else:\r\n k=(l+a)-r\r\n if k%2==0:\r\n print(2*r+k) \r\n else:\r\n print(2*r+(k-1))\r\n\r\nelif r<l:\r\n if r+a<=l:\r\n print(2*(r+a))\r\n else:\r\n k=(r+a)-l\r\n if k%2==0:\r\n print(2*l+k) \r\n else:\r\n print(2*l+(k-1))\r\n\r\nelif l==r:\r\n if a%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1) ", "a,b,c = list(map(int,input().split()))\r\nwhile c > 0:\r\n\tif a < b:\r\n\t\ta += 1\r\n\t\tc -= 1\r\n\telse:\r\n\t\tb += 1\r\n\t\tc -= 1\r\nprint(min(a,b)*2)", "l, r, a = map(int, input().split())\r\nif abs(l - r) < a:\r\n print((l + r + a) & ~1)\r\nelse:\r\n print(2 * (min(l, r) + a))", "GI = lambda: int(input()); GIS = lambda: map(int, input().split()); LGIS = lambda: list(GIS())\n\ndef main():\n l, r, a = GIS()\n while a:\n if l < r:\n l += 1\n else:\n r += 1\n a -= 1\n print(min(l, r) * 2)\n\nmain()\n", "import sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n l,r,b=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n mini=min(l,r)\r\n maxi=max(l,r)\r\n req=(maxi-mini)\r\n ex=min(b,req)\r\n mini+=ex\r\n b-=ex\r\n #print(ex)\r\n maxi+=b//2\r\n mini+=b//2\r\n print(2*min(maxi,mini))\r\n \r\n ", "def main():\r\n l, r, a = map(int, input().split())\r\n\r\n if l < r:\r\n d = min(r - l, a)\r\n l += d\r\n a -= d\r\n\r\n if r < l:\r\n d = min(l - r, a)\r\n r += d\r\n a -= d\r\n\r\n l += a//2\r\n r += a//2\r\n ans = 2 * min(l, r)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l, r, a = map(int, input().split())\r\nif abs(r - l) < a:\r\n print((((a - abs(l - r)) // 2) + max(l, r)) * 2)\r\nelse:\r\n print((min(l, r) + a) * 2 if abs(r - l) != 0 else (r + a // 2) * 2)\r\n", "l, r, a = map(int, input().split())\r\nif min(l, r) + a <= max(l, r):\r\n print((min(l, r) + a)*2)\r\nelse:\r\n print(max(l, r)*2 + ((a - abs(l - r)) // 2) * 2)\r\n", "l, r, a = map(int, input().split())\r\n\r\nminimum = min(l, r)\r\nmaximum = max(l, r)\r\n\r\ndifference = maximum - minimum\r\n\r\nif difference == 0:\r\n minimum += a // 2\r\n maximum += a // 2\r\nelse:\r\n if a >= difference:\r\n minimum += difference\r\n a -= difference\r\n minimum += a // 2\r\n maximum += a // 2\r\n else:\r\n minimum += a\r\n\r\nprint(2 * minimum)\r\n", "l, r, a = map(int, input().split())\r\nif abs(l - r) >= a:\r\n print((min(l, r) + a) * 2)\r\nelse:\r\n print(((l + r + a) // 2) * 2)", "l,r,a=list(map(int,input().split()))\r\nif l==r:\r\n if a%2==0:\r\n print(a+l+r)\r\n else:\r\n print(l+r+a-1)\r\nelif l>r:\r\n kam=l-r\r\n if kam>=a:\r\n print((r+a)*2)\r\n else:\r\n a-=kam\r\n if a%2==0:\r\n print(a+l+l)\r\n else:\r\n print(a+l+l-1)\r\nelse:\r\n kam=r-l\r\n if kam>=a:\r\n print((l+a)*2)\r\n else:\r\n a-=kam\r\n if a%2==0:\r\n print(a+r+r)\r\n else:\r\n print(a+r+r-1)\r\n ", "string = input().split(' ')\na = int(string [0])\nb = int(string [1])\nc = int(string [2])\nwhile c:\n maxx= max(a,b)\n minn = min(a,b)\n minn = minn + 1\n c =c -1\n a = maxx\n b = minn\nprint(min(a,b)*2)\n", "left, right, ambi = map(int,input().split())\r\nif left < right :\r\n\tadd = right - left \r\n\tif ambi >= add:\r\n\t\tleft += add\r\n\t\tambi -= add\r\n\telse:\r\n\t\tleft += ambi\r\n\t\tambi = 0\r\nelse:\r\n\tadd = left - right\r\n\tif ambi >= add:\r\n\t\tright += add\r\n\t\tambi -= add\r\n\telse:\r\n\t\tright += ambi\r\n\t\tambi = 0\r\naddmore = ambi//2\r\nleft += addmore\r\nright += ambi - addmore\r\nprint(2*min(left,right))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 28 11:31:47 2019\r\n\r\n@author: lfy\r\n\"\"\"\r\n\r\n#left,right,ambidexters\r\ndef lra_(l,r,a):\r\n if l==r:\r\n return (l+a//2)*2\r\n else:\r\n lm=min(l,r)\r\n rm=max(l,r)\r\n l,r=lm,rm\r\n if a<=r-l:\r\n return 2*(l+a)\r\n else:\r\n return 2*(r+(a-r+l)//2)\r\nlra=input().split()\r\nprint(lra_(int(lra[0]),int(lra[1]),int(lra[2])))", "a, b, c = map(int,input().split())\r\n\r\nwhile c>0:\r\n if a<=b:\r\n a+=1\r\n c-=1;\r\n else:\r\n b+=1\r\n c-=1\r\nprint(min(a,b)*2)", "r1,l1,rl=map(int,input().split())\r\nif r1==l1:\r\n print(r1+l1+(rl//2)*2)\r\nelif r1>l1:\r\n if rl >= abs(r1-l1) :\r\n print(2*r1+2*((rl-(abs(r1-l1)))//2))\r\n else:\r\n print((l1+rl)*2)\r\nelse:\r\n if rl >= abs(l1-r1):\r\n print(2*l1+2*((rl-(abs(l1-r1)))//2))\r\n else:\r\n print((r1+rl)*2)", "list = list(map(int,input().split()))\r\nl = list[0]\r\nr = list[1]\r\na = list[2]\r\nx=0\r\nif l % 2 == 0 and r % 2 == 0 and l == r and a % 2 == 0 :\r\n x += a + r + l\r\nelif l % 2 == 0 and r % 2 == 0 and l == r and a % 2 != 0 :\r\n x += l + r + a - 1\r\nelif l % 2 != 0 and r % 2 != 0 and l == r and a % 2 == 0 :\r\n x += l + r + a\r\nelif l % 2 != 0 and r % 2 != 0 and l == r and a % 2 != 0 :\r\n x += l + r + a - 1\r\nelif l != r and l + a < r :\r\n x += (l + a) * 2\r\nelif l != r and r + a < l :\r\n x += (r + a) * 2\r\nelse :\r\n if l > r :\r\n a = a -(l-r)\r\n r = l\r\n else :\r\n a = a-(r-l)\r\n l = r\r\n x += (a-a%2) + l*2\r\n\r\nprint(x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "[l,r,a] = map(int, input().split())\r\nm=min(l,r)\r\nd=abs(l-r)\r\nif a>=d:\r\n m=m+d\r\n a=a-d\r\n R=a//2\r\n m=m+R\r\nelse:\r\n m=m+a\r\nprint(2*m)", "l, r, a = map(int,input().split())\r\nwhile a>0:\r\n if l<r:\r\n l=l+1\r\n else:\r\n r =r +1\r\n a=a-1\r\nprint(min(l,r)*2)", "l, r, a = map(int, input().split())\r\nans = min(l,r)\r\nt = max(l,r)-min(l,r)\r\nif t <= a:\r\n ans += (a+t)//2\r\nelse:\r\n ans += a\r\nprint(2*ans)\r\n", "\r\nl , r , x = map(int,input().split())\r\n\r\nwhile x >0 :\r\n if l < r :\r\n l +=1\r\n else:\r\n r +=1\r\n x -=1\r\n\r\nprint(min(l , r) * 2 )\r\n#print(l , r)\r\n\r\n", "l,r,a=[int(i) for i in input().split()]\r\nif l<r:\r\n l,r=r,l\r\nc=l-r\r\nif c<=a:\r\n a=a-c\r\n print(((a//2)+l)*2)\r\nelse:\r\n print((a+r)*2)\r\n", "# Левши, правши и амбидекстры\r\nl, r, a = map(int, input().split())\r\ndiff_betw_left_and_right = abs(l - r)\r\nprint((min(l, r) + a) * 2 if a < diff_betw_left_and_right else max(l, r) * 2 + (a - diff_betw_left_and_right) // 2 * 2)", "l,r,a=map(int,input().split())\r\nd=min(l,r)*2\r\nl-=d//2\r\nr-=d//2\r\nk=min(max(l,r),a)\r\nd+=k*2\r\na-=k\r\nprint(d+a//2*2)\r\n", "l,r,a=[int(i) for i in input().split()]\r\nif l>=r:\r\n if (l-r)>a:\r\n print((r+a)*2)\r\n elif (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\nif r>l:\r\n if (r-l)>a:\r\n print((l+a)*2)\r\n elif (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\n", "l, r, a = map(int, input().split())\nmx, mn = [max((l, r)), min((l, r))]\nplayers = 0\nif a >= mx - mn:\n a -= mx - mn\n mn += mx - mn\n ambx = a\n if ambx % 2 != 0:\n ambx -= 1\n print((mx + mn) + ambx)\nelse:\n print((mn + a) * 2)\n\n \t \t\t\t \t \t\t\t \t \t\t \t\t \t \t", "l,r,a = map(int, input().split(\" \"))\r\ndiff = abs(l-r)\r\nm = min(l,r)\r\nif a + m < max(l,r):\r\n print(2*(a+m))\r\nelif a+m > max(l,r):\r\n a -= diff\r\n if a % 2 == 1:\r\n a -= 1\r\n print(2*(m+diff)+a)\r\nelif a+m == max(l,r):\r\n print(2*max(l,r))\r\n ", "a,b,c=map(int,input().split())\r\nif a==b:\r\n print(a+b+2*(c//2))\r\nelse:\r\n d=abs(a-b)\r\n if c>=d:\r\n print(d+a+b+2*((c-d)//2))\r\n else:\r\n print(2*(c+min(a,b)))", "l,r,a=map(int,input().split())\r\nfor i in range(a):\r\n if a>0:\r\n if l==r:\r\n if a>1:\r\n l+=1\r\n r+=1\r\n a-=2\r\n if l<r:l+=1;a-=1\r\n else:r+=1;a-=1\r\nprint(min(l,r)*2)\r\n", "l,r,a = map(int, input().split())\nd = min(abs(l - r), a)\ntot = 2 * min(l, r) + 2 * d + (a - d) - ((a - d) % 2) \n\nprint(tot)", "#Left-handers, Right-handers and Ambidexters\r\n\r\nl,r,a=map(int,input().split())\r\nmini=min(l,r)\r\nteam=0\r\nl-=mini\r\nr-=mini\r\nteam=mini*2\r\nif l==0 and r>0:\r\n f=0\r\nelif r==0 and l>0:\r\n f=1\r\nelse:\r\n f=3\r\n#print(f,l,r,a,team)\r\n\r\nif f==0:\r\n if r>a:\r\n r-=a\r\n team+=(a*2)\r\n a=0\r\n #print(1,1,l,r,a,team)\r\n elif r<a:\r\n a-=r\r\n team+=(r*2)\r\n r=0\r\n #print(1,2,l,r,a,team)\r\n else:\r\n team+=(a*2)\r\n a=0\r\n r=0\r\n #print(1,3,l,r,a,team)\r\n if a%2==0:\r\n team+=(a)\r\n #print(1,4,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(1,5,l,r,a,team)\r\nelif f==1:\r\n if l>a:\r\n l-=a\r\n team+=(a*2)\r\n a=0\r\n #print(2,1,l,r,a,team)\r\n elif l<a:\r\n a-=l\r\n team+=(l*2)\r\n l=0\r\n #print(2,2,l,r,a,team)\r\n else:\r\n team+=(a*2)\r\n a=0\r\n l=0\r\n #print(2,3,l,r,a,team)\r\n if a%2==0:\r\n team+=(a)\r\n #print(2,4,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(2,5,l,r,a,team)\r\n \r\nelse:\r\n if a%2==0:\r\n team+=(a)\r\n #print(3,1,l,r,a,team)\r\n\r\n else:\r\n team+=(a-1)\r\n #print(3,2,l,r,a,team)\r\n\r\nprint(team)", "l,r,a = map(int,input().split())\r\nif(l==r):\r\n print(2*(l+a//2))\r\nelif(l>r):\r\n add = l-r\r\n if(a>add):\r\n a-=add\r\n print(2*(l+a//2))\r\n else:\r\n print(2*(r+a))\r\nelif(r>l):\r\n add = r-l\r\n if(a>add):\r\n a-=add\r\n print(2*(r+a//2))\r\n else:\r\n print(2*(l+a))", "l, r, a = [int(x) for x in input().split()]\r\n\r\nfor i in range(a):\r\n if a>0:\r\n z=min(l,r)\r\n if l==z:\r\n a-=1\r\n l+=1\r\n elif r==z:\r\n a-=1\r\n r+=1\r\n\r\nk=min(l,r)*2\r\nif k%2==0: print(k)\r\nelse: print(k-2)", "l,r,a=map(int,input().split())\r\nif l>=r:\r\n n=r*2\r\n l-=n//2\r\n while l!=0 and a!=0:\r\n n+=2\r\n l-=1\r\n a=a-1\r\n if a!=0:\r\n n+=(a//2)*2\r\nelse:\r\n n=l*2\r\n r-=n//2\r\n while r!=0 and a!=0:\r\n n+=2\r\n r-=1\r\n a=a-1\r\n if a!=0:\r\n n+=(a//2)*2\r\nprint(n)\r\n", "a,b,c=map(int,input().split());print(2*min(a+c,b+c,(a+b+c)//2))", "l,r,a=map(int,input().split())\r\n\r\nmin1,max1=min(l,r),max(l,r)\r\nmax1-=min1\r\nmin1*=2\r\nif(a<=max1):\r\n print(min1+a*2)\r\nelse:\r\n print(min1+((a+max1)//2)*2)\r\n", "\r\nl,r,a=map(int,input().split())\r\nif l==r:\r\n x=(int)(l+a/2)*2\r\n print(x)\r\nelif l<r:\r\n if (r-l)>a:\r\n print((l+a)*2)\r\n else :\r\n a=a-(r-l)\r\n l=r\r\n x=(int)(l+a/2)*2\r\n print(x)\r\nelse :\r\n if (l-r)>a:\r\n print((r+a)*2)\r\n else :\r\n a=a-(l-r)\r\n r=l\r\n x=(int)(l+a/2)*2\r\n print(x)\r\n", "l, r, a = map(int, input().split())\r\nc = min(l, r)\r\nx = min(max(r, l) - min(r, l), a)\r\nc += x\r\na -= x\r\nc += (a // 2)\r\nprint(c * 2)", "l,r,a = (int(x) for x in input().split())\r\nif l < r:\r\n l,a = min(r,l+a),max(0,a-(r-l))\r\nelif r < l:\r\n r,a = min(l,r+a),max(0,a-(l-r))\r\nprint(min(l,r)*2 + 2*(a//2))\r\n\r\n\r\n", "l,r,a=map(int,input().split())\r\nif min(l,r)+a<=max(l,r):\r\n print((min(l,r)+a)*2)\r\nelse:\r\n if (l+r+a)%2==0:\r\n print(l+r+a)\r\n else:\r\n print(l+r+a-1)\r\n \r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nl,r,a = get_int_list()\r\n\r\nif l == r:\r\n print( l+r+a - a%2 )\r\nelse:\r\n diff = abs(r-l)\r\n if diff <= a:\r\n a -= diff\r\n print(l+r+diff + a - a%2)\r\n else:\r\n m = min(l,r) + a\r\n print( 2*m )\r\n \r\n\r\n", "l,r,a=map(int,input().split())\r\nx,y=min(l,r),max(l,r)\r\ny-=x\r\nif(y>=a):\r\n\tprint((x+a)*2)\r\nelse:\r\n\ta-=y\r\n\tprint((x+y+a//2)*2)", "def solve(l, r, a):\n ans = 0\n for i in range(2, l + r + a + 1, 2):\n rem_a = a\n half = i // 2\n if l < half:\n rem_a -= (half - l)\n if rem_a < 0:\n continue\n if r < half:\n rem_a -= (half - r)\n if rem_a < 0:\n continue\n ans = i\n return ans\n\nif __name__ == '__main__':\n l, r, a = list(map(int, input().split()))\n print(solve(l, r, a))\n\n\t\t \t \t \t\t\t \t \t\t \t\t \t \t", "def Min(a,b):\r\n if a < b:\r\n return a\r\n else:\r\n return b\r\ndef Max(a,b):\r\n if a > b:\r\n return a\r\n else:\r\n return b\r\ns = input()\r\nl,r,a = s.split()\r\nl = int(l)\r\nr = int(r)\r\na = int(a)\r\nmn = Min(l,r)\r\nmx = Max(l,r)\r\nmn += a\r\nif mn < mx:\r\n print(mn*2)\r\nelse:\r\n if (mn+mx)%2 == 1:\r\n print(mn+mx-1)\r\n else:\r\n print(mn+mx)\r\n", "l, r, a = [int(x) for x in input().split()]\r\nmini = min(l,r)\r\nmaxi = max(l,r)\r\nwhile (a>0):\r\n if mini<maxi:\r\n mini+=1\r\n a-=1\r\n elif mini>=maxi:\r\n maxi+=1\r\n a-=1\r\n \r\nprint(min(mini,maxi)*2)", "[l, r, a] = map(int, input().split())\nif l + a < r:\n print(2 * (l + a))\nelif r + a < l:\n print(2 * (r + a))\nelse:\n print(((l + r + a) // 2) * 2)", "l,r,a = map(int, input().split())\r\n\r\nif abs(l-r)>=a:\r\n if l>r:\r\n r+=a \r\n else:\r\n l+=a \r\n print(2*min(l,r))\r\n\r\nelif l-r == 0:\r\n print(l+r+2*(a//2))\r\n\r\nelse:\r\n diff = abs(l-r)\r\n if l>r:\r\n r+=diff \r\n else:\r\n l+=diff \r\n\r\n a-=diff \r\n print(l+r+2*(a//2)) # 19 19 a=19 -> #28 28 a->1\r\n\r\n\r\n", "l,r,a=(int(i) for i in input().split())\r\nif(r<l):\r\n d=min(a,l-r)\r\n r+=d\r\n a-=d\r\nelse:\r\n d=min(a,r-l)\r\n l+=d\r\n a-=d\r\nprint(2*min(r,l)+((a//2)*2))", "l,r,a = map(int, input().split())\r\n\r\nres = min(l, r)\r\nl -= res\r\nr -= res\r\nres *= 2\r\naa = max(l, r)\r\nres2 = min(aa, a)\r\nres += res2 * 2\r\na -= res2\r\nres += a//2 * 2\r\nprint(res)\r\n", "l, r, a = map(int, input().split())\n\nans = min(l, r)\nl -= ans\nr -= ans\n\ng = min(max(l, r), a)\nans += g\na -= g\n\nans += a // 2\n\nprint(ans * 2)\n", "l,r,a=[int(x)for x in input().split()]\r\nwhile l < r and a !=0:\r\n l +=1\r\n a -=1\r\nwhile r < l and a !=0:\r\n r+=1\r\n a-=1\r\nl+=a//2\r\nr+=a//2\r\nprint(min(l,r)*2)", "l,r,a = map(int,input().split())\r\nif l == 0 and r == 0 and a == 0:\r\n print(0)\r\n exit()\r\nfor i in range(a):\r\n if l == min(l,r):\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)*2)", "l,r,a = map(int,input().split())\nmini = min(l,r)\nmaxi = max(l,r)\nif maxi - mini >= a :\n print((mini+a)*2)\nelse :\n a -= maxi-mini\n print(maxi *2 + (a if a %2 ==0 else a-1))\n\n", "#### A. Left-handers, Right-handers and Ambidexters\r\n\r\nl, r, a = map(int, input().split())\r\n\r\n# Distribute the ambidexters to the weaker side (left or right)\r\n# until we run out of either left-handers or right-handers\r\nwhile a > 0 and (l > 0 or r > 0):\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\n\r\n# Distribute the remaining ambidexters equally to both sides\r\nteam_size = (min(l, r) + a // 2) * 2\r\n\r\nprint(team_size)\r\n\r\n\r\n ", "l, r, a = map(int, input().split())\r\nans = 0\r\nfor i in range(a):\r\n if l <= r:\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(l,r)*2)", "l, r, a = map(int, input().split())\r\nans = min(l, r) * 2\r\nl -= ans // 2\r\nr -= ans // 2\r\nif a != 0:\r\n if a >= max(l ,r):\r\n ans += 2 * max(l, r)\r\n a -= max(l, r)\r\n if a >= 2:\r\n ans += (a - a % 2)\r\n else:\r\n ans += 2 * a\r\n \r\nprint(ans)", "l,r,a=map(int,input().split())\r\nx=0\r\nif l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)*2)\r\nelif l<r and a>0:\r\n while(a and l<r):\r\n l=l+1\r\n a=a-1\r\n if a>0 and l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)*2)\r\n elif a==0:\r\n x=min(l,r)\r\n x=x*2\r\nelif r<l and a>0:\r\n while(a and r<l):\r\n r=r+1\r\n a=a-1\r\n if a>0 and l==r:\r\n if a%2==0:\r\n x=l+r+a\r\n else:\r\n x=l+r+((a//2)*2)\r\n elif a==0:\r\n x=min(l,r)\r\n x=x*2\r\nelif a==0 and (l<r or r<l):\r\n x=min(l,r)\r\n x=x*2\r\nprint(x) ", "L, R, A = list(map(int, input().split()))\r\nmlr = min(L, R)\r\nrst = L+R-2*mlr\r\nmra = min(rst, A)\r\nA -= mra\r\nprint(2 * (mlr + mra + A // 2))\r\n", "a,b,c=map(int,input().split())\r\nprint((min(min(a,b)+(min(abs(a-b),c)),max(a,b))+max(0,(c-abs(a-b))>>1))<<1)", "l, r, a = map(int, input().split())\r\nMax = 0\r\nfor i in range(a+1):\r\n Max = max(Max, min(l+i, r+a-i)*2)\r\nprint(Max)\r\n", "l, r, a = map(int, input().split())\r\nif l + a < r:\r\n print(2 * (l + a))\r\nelif r + a < l:\r\n print(2 * (r + a))\r\nelse:\r\n s = l + r + a\r\n print(s - (s%2))", "l,r,a=map(int,input().split())\r\nif a==0 and (l==0 or r==0):\r\n\tprint(0)\r\nelse:\r\n\twhile a>0:\r\n\t\tif l<r:\r\n\t\t\tl+=1\r\n\t\telse:\r\n\t\t\tr+=1\r\n\t\ta-=1\r\n\tprint(min(l,r)*2)", "l, r, a = map(int, input().split())\n\nwhile l < r and a != 0:\n l += 1\n a -= 1\n\nwhile r < l and a != 0:\n r += 1\n a -= 1\n\nif a in [0, 1]:\n print((r if r < l else l)*2)\nelse:\n print((r + a//2)*2)\n", "if __name__==\"__main__\":\r\n l,r,a=map(int,input().split())\r\n if(l>(r+a)):\r\n print(2*(r+a))\r\n elif(r>(l+a)):\r\n print(2*(l+a))\r\n else:\r\n print(2*max(l,r)+2*((a-abs(r-l))//2))\r\n", "a,b,c=map(int,input().split());g=max(a,b);a=min(a,b);b=g\r\nx=b-a\r\na=a+min(x,c)\r\nb=a\r\nc=c-min(x,c)\r\nprint(a+b+c-c%2)", "l,r,a=map(int,input().split())\r\np=min(l,r)\r\nl-=p\r\nr-=p\r\np1=min(l,a)\r\nl-=p1\r\na-=p1\r\np2=min(r,a)\r\nr-=p2\r\na-=p2\r\np3=a//2\r\nprint(2*(p+p1+p2+p3))", "a,b,c = map(int,input().split())\r\nif(a == b):\r\n c = c//2 \r\n ans = int(a + c)\r\n print(ans * 2)\r\nelif(c == 0):\r\n print(min(a,b)*2)\r\nelif(a < b):\r\n diff = b - a \r\n if (c <= diff):\r\n print((a+c)*2)\r\n else:\r\n a += diff\r\n c -= diff \r\n c = c//2\r\n ans = int(a + c)\r\n print(ans * 2)\r\n \r\nelif(a > b):\r\n diff = a - b \r\n if (c <= diff):\r\n print((b+c)*2)\r\n else:\r\n b += diff\r\n c -= diff \r\n c = c//2\r\n ans = int(b + c)\r\n print(ans * 2) ", "l,r,a = map(int, input().split())\r\nmx = max(l,r)\r\nmn = min(l,r)\r\nif mn+a <= mx:\r\n print((mn+a)*2)\r\nelse:\r\n t = 0\r\n t += mx*2\r\n a -= (mx-mn)\r\n if a>=2:\r\n t+=(a//2)*2\r\n print(t)", "a, b, c = map(int, input().split())\nm = min(a, b)\nl, r = m, m\na -= m\nb -= m\nwhile a and c:\n l += 1\n r += 1\n a -= 1\n c -= 1\nwhile b and c:\n l += 1\n r += 1\n b -= 1\n c -= 1\nwhile c > 1:\n l += 1\n r += 1\n c -= 2\nprint(l + r)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nl,r,a=map(int, input().split())\r\nl, r = min(l,r), max(l,r)\r\nb = r-l\r\nif b<=a:\r\n a-=b\r\n print((r+a//2)*2)\r\nelse:\r\n print((l+a)*2)", "l, r, a = list(map(int, input().split()))\r\nn1 = min(l, r)\r\nl -= n1\r\nr -= n1\r\nn1 *= 2\r\nn2 = min(max(l, r), a)\r\na -= n2\r\nn2 *= 2\r\nn3 = 2 * int(a/2)\r\nprint(n1 + n2 + n3)", "l, r, a = map (int, input ().split ())\r\nif l > r : l, r = r, l\r\nif l + a <= r : print (2 * (l + a))\r\nelse : print ((r + (a - (r - l)) // 2) * 2)\r\n\r\n", "a,b,c=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nwhile c!=0:\n if a>b:\n c-=1\n b+=1\n else:\n c-=1\n a+=1\nprint(min(a,b)*2)\n", "(l, r, a) = map(int, input().split(' '))\r\nma = max(l,r)\r\nmi = min(l,r)\r\nif ma >= mi+a:\r\n print((mi+a)*2)\r\nelse:\r\n dif = (ma-mi)*-1\r\n if a>= dif:\r\n mi+=dif\r\n a-=dif\r\n a = int(a/2)\r\n print(mi+ma+(a*2))", "l,r,a = map(int,input().split())\r\nl,r = min(l,r),max(l,r)\r\n\r\nwhile l<r and a!=0:\r\n\tl+=1\r\n\ta-=1\r\n\r\nprint(2*l+2*(a//2))", "l,r,a = map(int, input().split())\r\n\r\nans = 0\r\nx = min(l,r)\r\nm = max(l,r)\r\nz = max(a- (m-x), 0)\r\nx += a - z\r\na = z\r\nif a % 2 != 0:\r\n a -= 1\r\nx += a//2\r\n\r\nprint(2*x)\r\n", "arr=list(map(int,(input().split())))\r\nd= abs(arr[0]-arr[1])\r\nif d>arr[2]:\r\n c=min(arr[0],arr[1])+arr[2]\r\nelse:\r\n c=sum(arr)//2\r\nprint(c*2)", "l, r, a = map(int, input().split())\r\nx = max(l, r)\r\ny = min(l, r)\r\nif x - y >= a:\r\n print((y + a) * 2)\r\nelse:\r\n print(x * 2 + (y - x + a)//2 * 2)", "L, R, a = list(map(int, input().split()))\r\nif L == R:\r\n print(L*2+((a//2)*2))\r\nelse:\r\n if L+a <= R or R+a <= L:\r\n print(min(L+a, R+a)*2)\r\n else:\r\n if L < R:\r\n print(R*2+((a-R+L)//2)*2)\r\n else:\r\n print(L*2+(((a-L+R)//2)*2))\r\n", "l, r, a = map(int, input().split())\r\ndif = max(r, l) - min(r, l)\r\nif dif >= a:\r\n print((min(r, l) + a) * 2 )\r\nelse:\r\n print(max(r, l) * 2 + (a - dif)//2 * 2)", "s=[int(n) for n in input().split()]\r\nm=0\r\nif s[1]==s[0]:\r\n\tm=2*s[0]\r\n\tif s[2]>=2:\r\n\t\tm+=2*(s[2]//2)\r\nelif s[1]>s[0]:\r\n\tk=s[0]+s[2]\r\n\tif k==s[1]:\r\n\t\tm=2*k\r\n\telif k>s[1]:\r\n\t\td=k-s[1]\r\n\t\tm=2*s[1]\r\n\t\tif d>=2:\r\n\t\t\tm=m+2*(d//2)\r\n\telif k<s[1]:\r\n\t\td=s[1]-k\r\n\t\tm=2*k\r\n\t\t\r\nelif s[0]>s[1]:\r\n\tk=s[1]+s[2]\r\n\tif k==s[0]:\r\n\t\tm=2*k\r\n\telif k<s[0]:\r\n\t\td=s[0]-k\r\n\t\tm=2*k\r\n\t\t\r\n\telif k>s[0]:\r\n\t\td=k-s[0]\r\n\t\tm=2*s[0]\r\n\t\tif d>=2:\r\n\t\t\tm+=2*(d//2)\r\n\t\t\r\nprint(m)", "l, r, a = list(map(int, input().split()))\r\n\r\nif a + l <= r:\r\n print(2*(a+l))\r\nelif a + r <= l:\r\n print(2*(a+r))\r\nelse:\r\n if (a+l+r) % 2 == 0:\r\n print(a+l+r)\r\n else:\r\n print(a+l+r-1)", "#ismail moussi\r\nli =list(map(int,input().split()))\r\n\r\nwhile li[2]:\r\n if li[0]<li[1]:\r\n li[0]+=1\r\n else:\r\n li[1]+=1\r\n li[2] -= 1\r\nprint(min(li[0],li[1])*2) ", "a,b,c=map(int, input().split())\r\nsize=min(a,b)\r\na-=size\r\nb-=size\r\nsize=size*2\r\nx=max(min(a+c,b),min(b+c,a))\r\nsize=size+x*2+((c-x)//2)*2\r\nprint(size)\r\n", "from math import floor\nimport sys\n\nl, r, a = sys.stdin.readline().split()\nl, r, a = int(l), int(r), int(a)\n\nmin = min(l, r)\nmax = max(l, r)\n\nif min+a <= max:\n print (2*(min+a))\nelse:\n print (((min+a+max)//2)*2)\n", "def solve(l, r, a):\n x = abs(l - r)\n y = min(x, a)\n x = min(l, r) + y\n return (x + (a - y)//2)*2\n\n\ndef main():\n l, r, a = list(map(int, input().split()))\n print(solve(l, r, a))\n\n\nmain()\n", "# cf 950 A 900\nl, r, a = map(int, input().split())\n\nif l < r:\n d = r - l\n d = min(a, d)\n l += d\n a -= d\nelse:\n d = l - r\n d = min(a, d)\n r += d\n a -= d\n\nprint(2 * (min(l, r) + a // 2))\n", "l,r,a=map(int,input().split())\r\nx=min(l,r)\r\nd=abs(l-r)\r\nif d>a:\r\n ans=(x+a)*2\r\nelif d<=a:\r\n a=a-d\r\n ans=(x+d+a//2)*2\r\nprint(ans)", "l,r,a = map(int, input().split())\nif (max(l,r)-min(l,r)) >= a:\n print(2*(min(l,r)+a))\nelse:\n print(2*(int((a-(max(l,r)-min(l,r)))/2) + max(l,r)))", "l, r, a = list(map(int, input().split(' ')))\r\nx = 0\r\nfor i in range(a + 1):\r\n tl = l + i\r\n tr = r + a - i\r\n x = max(x, min(tl, tr) * 2)\r\nprint(x)\r\n", "a = list(map(int, input().split()))\r\nt = min(a[0], a[1])\r\nr = max(a[0], a[1])\r\nk = a[2]+t-r\r\nn = k>0\r\nm = (t + min((r-t), a[2])+n*k//2)*2\r\nprint(m)", "(left_handers, right_handers, ambidexters) = map(int, input().split(' '))\n\nif left_handers > right_handers:\n if left_handers >= right_handers + ambidexters:\n print((right_handers + ambidexters) * 2)\n else:\n print(left_handers * 2 + (right_handers + ambidexters - left_handers)// 2 * 2)\n\nelif right_handers > left_handers:\n if right_handers >= left_handers + ambidexters:\n print((left_handers + ambidexters) * 2)\n else:\n print(right_handers * 2 + (left_handers + ambidexters - right_handers)// 2 * 2)\n\nelif right_handers == left_handers:\n print(right_handers * 2 + ambidexters // 2 * 2)", "l, r, a = map(int, input().split())\r\n\r\nprint (min(min((l + r + a) // 2, l + a), r + a) * 2)\r\n", "l, r, a = (int(i) for i in input().split())\nl, r = min(l, r), max(l, r)\nd = min(a, r - l)\nres = 2 * (l + d + (a - d) // 2)\nprint(res)\n", "i1,i2,a=map(int,input().split())\r\nl=min(i1,i2)\r\nr=max(i1,i2)\r\nif(a>=r-l):\r\n a-=r-l\r\n print(r*2+a-a%2)\r\nelse:\r\n print((l+a)*2)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nl,r,a=map(int,input().split())\r\nif r<l:r,l=l,r\r\nl,a=l+min(a,r-l),a-min(a,r-l)\r\nprint(2*(l+a//2))", "l,r,a=map(int,input().split())\r\nprint((min(l,r)+min(abs(l-r),a)+max(0,(a-abs(l-r))//2))*2)", "l, r, a = map(int, input().split())\r\nn = (l + r + a) // 2\r\nfor x in range(n, -1, -1):\r\n if x * 2 - min(l, x) - min(r, x) <= a:\r\n print(x * 2)\r\n break", "l, r, a = map(int, input().split())\nans = 0\nfor x in range(0, a+1):\n y = a-x\n ans = max(ans, min(l+x, r+y)*2)\nprint(ans)\n", "l,r,a=map(int,input().split())\r\ncnt=0\r\nl,r=min(l,r),max(l,r)\r\nif(l+a<=r):\r\n print(2*(l+a))\r\nelse:\r\n cnt=2*r\r\n diff=(l+a-r)\r\n cnt+=2*(int(diff/2))\r\n print(cnt)", "a,b,c = map(int,input().split())\r\nif c-abs(a-b)>0:print((max(a,b)+ (c-abs(a-b))//2)*2)\r\nelse:print((min(a,b)+c)*2)", "line = input()\nl, r, a = list(map(int, line.strip().split()))\n#print(l, r, a)\nmmin = min(l, r)\nmmax = max(l, r)\n\nif a + mmin <= mmax:\n print(2 * (a + mmin))\nelse:\n left = a + mmin - mmax\n print(2 * (mmax + left // 2))\n\t\t \t \t\t\t\t \t \t \t\t \t\t", "l,r,m=map(int,input().split())\r\nif l+m<=r:\r\n print(2*(l+m))\r\nelif r+m<=l:\r\n print(2*(r+m))\r\nelse:\r\n if l<r:\r\n m=m-(r-l)\r\n l=r\r\n k=m//2\r\n print(2*(l+k))\r\n else:\r\n m=m-(l-r)\r\n r=l\r\n k=m//2\r\n print(2*(r+k))\r\n ", "l, r, a = [int(k) for k in input().split(' ') if k]\nlh = l\nrh = r\nif lh < rh:\n add = min(rh - lh, a)\n lh += add\n a -= add\nelif rh < lh:\n add = min(lh - rh, a)\n rh += add\n a -= add\nif a > 0:\n lh += a // 2\n rh += a // 2\nprint(2 * min(lh, rh))\n\n", "l, r, a = map(int, input().split())\r\nif l == r:\r\n l += (a // 2)\r\n r += (a // 2)\r\n print(l + r)\r\nif r > l:\r\n if l + a < r:print(2 * (l + a))\r\n elif r < l + a:\r\n if (l+r+a)%2==0:print((l+r+a))\r\n else:print(l + r + a - 1)\r\n elif l + a == r:print(l + r + a)\r\n#########################\r\nif l > r:\r\n if r + a < l:print(2 * (r + a))\r\n elif l < r + a:\r\n if (l + a + r ) % 2 == 0:print(l+a+r)\r\n else:print(l + r + a - 1)\r\n elif r + a == l:print(l + r + a)\r\n#########################\r\n", "l, r, a = map(int, input().split())\nif l == r:\n\tprint((l + a//2)*2)\nelif l < r:\n\tif l + a < r:\n\t\tprint((l + a)*2)\n\telif l + a == r:\n\t\tprint(r*2)\n\telse:\n\t\tprint((r + (a - r + l)//2)*2)\nelse:\n\tif r + a < l:\n\t\tprint((r + a)*2)\n\telif r + a == l:\n\t\tprint(l*2)\n\telse:\n\t\tprint((l + (a - l + r)//2)*2)\n", "l, r, a = (int(x) for x in input().split())\r\nless = min(l, r)\r\nmore = max(l, r)\r\nwhile less < more and a > 0:\r\n less += 1\r\n a -=1\r\nrest = a // 2\r\n\r\nprint(2 * (less + rest))", "l,r,a=map(int,input().split())\r\nif l>r:\r\n\tl,r=r,l\r\nif l+a<=r:\r\n\tprint(2*(l+a))\r\nelse:\r\n\ta-=(r-l)\r\n\tprint((2*r)+(2*(a//2)))", "l,r,a = map(int,input().split(\" \"))\r\n\r\nwhile a > 0:\r\n if(l<r):\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(l,r)*2)", "from math import floor\r\nl,r,a=map(int,input().split())\r\nc=floor((l+r+a)/2)\r\nprint(2*min(l+a,r+a,c))", "l,r,a=map(int,input().split())\r\ntemp=2*(min(l,r))\r\ntemp1=(max(l,r)-min(l,r))\r\nif temp1<=a:\r\n print(temp+2*temp1+((a-temp1)//2)*2)\r\nelse:\r\n print(temp+2*a)", "# For Left-handers, Right-handers and Ambidexters\r\n# https://codeforces.com/problemset/problem/950/A\r\n\r\nl,r,a = map(int, input().split())\r\n\r\nb = min(l,r)\r\nc = max(l,r)\r\n\r\n# on l=1 r=4 a=2, we have b=1, c=4\r\n# we have a=2 < (c-b=3), we can use a+b left handers, and a+b right handers\r\n\r\nif (a <= c-b):\r\n print((a+b)*2)\r\nelse:\r\n sum = a + b + c\r\n print(sum - (sum%2))\r\n", "l,r,a = list(map(int,input().split()))\r\nmipa = min(l,r) + a\r\nprint((mipa<<1) if mipa <= max(l,r) else (((l+r+a)//2)<<1))\r\n", "a,b,c=[int(i) for i in input().split()]\r\nif(a>b):\r\n a,b=b,a\r\nt = min(b-a,c)\r\na+=t\r\nc-=t\r\nprint((a+(c//2))*2)\r\n", "l,r,a=map(int,input().split())\r\nif l+a<=r:print(2*(l+a))\r\nelif r+a<=l:print(2*(r+a))\r\nelse:\r\n print((l+r+a)//2*2)", "l,r,a=map(int,input().split())\r\n\r\nif min(l,r) + a<=max(l,r):\r\n print(2*min(l,r)+a*2)\r\nelse:\r\n a-=max(l,r) -min(l,r)\r\n ans = max(l,r) +a//2\r\n print(ans*2)", "s = list(map(int, input().split()))\nl = s[0]\nr = s[1]\na = s[2]\nans = 0\n\nwhile(True):\n if l==r:\n temp = a//2\n ans = l+r+temp*2\n break\n elif l>r:\n if a!=0:\n r+=1\n a-=1\n else:\n ans = r*2\n break\n elif r>l:\n if a>0:\n l+=1\n a-=1\n else:\n ans = l*2\n break\nprint (ans)\n", "l,r,a = map(int, input().split())\nt = 0\nm = min(l,r)\nl -= m\nr -= m\nt += 2*m\ns = l + r\nm = min(l+r,a)\nt += 2*m\na -= m\nt += 2 * int(a/2)\nprint(t)\n", "s=[int(a) for a in input().split()]\nif(s[0]>s[1]):\n\ts[0],s[1]=s[1],s[0]\ndiff=s[1]-s[0]\nif diff<=s[2]:\n\ts[2]-=diff\n\ts[0]+=diff\n\ts[0]+=s[2]//2\n\ts[1]+=s[2]//2\nelse:\n\ts[0]+=s[2]\n\nprint(2*min(s[0],s[1]))\n", "l,r,a = map(int,input().split())\r\nmn=min(l,r)\r\nmx=max(l,r)\r\n\r\nmn+=a\r\nif mn<=mx :\r\n print(mn*2)\r\nelif mn>mx :\r\n eltar=mn-mx\r\n if eltar%2==0 :\r\n print(2*mx + eltar)\r\n else : print(2*mx + eltar-1)\r\n\r\n\r\n #\r\n # لو هو فيه\r\n\r\n # لو هو فيه بزيادة\r\n # لو هو مفهوش", "\r\nI = input()\r\nmyIntegers = [int(x) for x in I.split()]\r\nl = myIntegers[0]\r\nr = myIntegers[1]\r\na = myIntegers[2]\r\n\r\nif r > l:\r\n t = r\r\n r = l\r\n l = t\r\n\r\nmax = 0\r\n\r\nif l==r:\r\n print(l+r+a&~(1))\r\nelse:\r\n if r+a<=l:\r\n print(2*(r+a))\r\n else:\r\n a = a+r-l;\r\n print(2*l+a&~(1))\r\n", "l, r, a = [int(x) for x in input().split()]\r\n\r\ns = l + r + a\r\nif s % 2 != 0:\r\n s -= 1\r\n\r\nwhile s != 0:\r\n h = s / 2\r\n leftOk = False\r\n if l >= h:\r\n leftOk = True\r\n elif l <= h <= l + a:\r\n a -= (h - l)\r\n leftOk = True\r\n if h <= r + a and leftOk:\r\n break\r\n\r\n s -= 2\r\n\r\nprint(s)\r\n", "x=input()\r\nk=[int(i) for i in x.split()]\r\nprint(2*min(k[0]+k[2],k[1]+k[2],(k[2]+k[0]+k[1])// 2))", "l,r,a=map(int,input().split())\r\ns=max(l,r)\r\nd=min(l,r)\r\nh=s-d\r\nif h>=a:\r\n\tprint((d+a)*2)\r\nelif a>h:\r\n\tt=a-h\r\n\tz=int(t/2)\r\n\tp=d+h+z\r\n\tprint(p*2)\r\n", "l,r,a=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(a+1):\r\n l1=l+i\r\n r1=r+a-i\r\n m=max(m,min(l1,r1)*2)\r\nprint(m)", "from math import fabs\r\nl, r, a = map(int,input().split())\r\nif fabs(l-r)<a:\r\n c = (l+r+a) if (l+r+a)%2==0 else l+r+a-1\r\nelif fabs(l-r)>a:\r\n c = 2*(min(l,r) + a)\r\nelse:\r\n c = l+r+a\r\nprint(c)", "l,r,a = map(int,input().split())\r\nans = 0\r\nwhile a != 0:\r\n if l < r:\r\n l += 1\r\n else:\r\n r += 1\r\n a -= 1\r\nprint(min(r,l) * 2)", "import sys\n\na,b,c = input().split(' ')\na,b,c = [int(a), int(b), int(c)]\n\n\nif a==b:\n\tprint(a+b+(c-c%2))\n\nelse:\n\n\tif a<b:\n\n\t\td = b - a\n\n\t\tif d>c:\n\t\t\ta = a + c\n\t\t\tb = b - abs(a-b)\n\n\t\telse:\n\n\t\t\ta = a + d\n\t\t\tc = c - d\n\n\t\t\ta = a + c//2\n\t\t\tb = b + c//2\n\n\t\tprint(2*a)\n\t\tsys.exit(0)\n\n\telse:\n\n\t\td = a - b\n\n\t\tif d>c:\n\t\t\tb = b + c\n\t\t\ta = a - abs(a-b)\n\t\t\t\n\t\telse:\n\n\t\t\tb = b + d\n\t\t\tc = c - d\n\n\t\t\ta = a + c//2\n\t\t\tb = b + c//2\n\n\t\tprint(2*b)\n\t\tsys.exit(0)\n" ]

{"inputs": ["1 4 2", "5 5 5", "0 2 0", "30 70 34", "89 32 24", "89 44 77", "0 0 0", "100 100 100", "1 1 1", "30 70 35", "89 44 76", "0 100 100", "100 0 100", "100 1 100", "1 100 100", "100 100 0", "100 100 1", "1 2 1", "0 0 100", "0 100 0", "100 0 0", "10 8 7", "45 47 16", "59 43 100", "34 1 30", "14 81 1", "53 96 94", "62 81 75", "21 71 97", "49 82 73", "88 19 29", "89 4 62", "58 3 65", "27 86 11", "35 19 80", "4 86 74", "32 61 89", "68 60 98", "37 89 34", "92 9 28", "79 58 98", "35 44 88", "16 24 19", "74 71 75", "83 86 99", "97 73 15", "77 76 73", "48 85 55", "1 2 2", "2 2 2", "2 1 2", "2 2 1", "3 2 1", "1 2 3", "1 3 2", "2 1 3", "2 3 1", "3 1 2", "99 99 99", "99 99 100", "99 100 99", "99 100 100", "100 99 99", "100 99 100", "100 100 99", "89 32 23", "4 5 0", "3 0 3", "0 0 2", "97 97 0", "1 4 0", "5 2 0", "0 5 10", "0 1 2", "5 2 3", "5 5 0", "0 0 10", "0 1 1", "0 0 1"], "outputs": ["6", "14", "0", "128", "112", "210", "0", "300", "2", "130", "208", "200", "200", "200", "200", "200", "200", "4", "100", "0", "0", "24", "108", "202", "62", "30", "242", "218", "188", "204", "96", "132", "126", "76", "134", "156", "182", "226", "142", "74", "234", "166", "58", "220", "268", "176", "226", "188", "4", "6", "4", "4", "6", "6", "6", "6", "6", "6", "296", "298", "298", "298", "298", "298", "298", "110", "8", "6", "2", "194", "2", "4", "14", "2", "10", "10", "10", "2", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

404

d3d3a53758643400bf3241186c9e43bb

Regular Bridge

An undirected graph is called *k*-regular, if the degrees of all its vertices are equal *k*. An edge of a connected graph is called a bridge, if after removing it the graph is being split into two connected components. Build a connected undirected *k*-regular graph containing at least one bridge, or else state that such graph doesn't exist. The single line of the input contains integer *k* (1<=≤<=*k*<=≤<=100) — the required degree of the vertices of the regular graph. Print "NO" (without quotes), if such graph doesn't exist. Otherwise, print "YES" in the first line and the description of any suitable graph in the next lines. The description of the made graph must start with numbers *n* and *m* — the number of vertices and edges respectively. Each of the next *m* lines must contain two integers, *a* and *b* (1<=≤<=*a*,<=*b*<=≤<=*n*, *a*<=≠<=*b*), that mean that there is an edge connecting the vertices *a* and *b*. A graph shouldn't contain multiple edges and edges that lead from a vertex to itself. A graph must be connected, the degrees of all vertices of the graph must be equal *k*. At least one edge of the graph must be a bridge. You can print the edges of the graph in any order. You can print the ends of each edge in any order. The constructed graph must contain at most 106 vertices and 106 edges (it is guaranteed that if at least one graph that meets the requirements exists, then there also exists the graph with at most 106 vertices and at most 106 edges). Sample Input 1 Sample Output YES 2 1 1 2

[ "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\nif k == 1:\r\n ans = [\"YES\", \"2 1\", \"1 2\"]\r\nelif not k % 2:\r\n ans = [\"NO\"]\r\nelse:\r\n ans = [\"YES\"]\r\n n = 2002\r\n e = [\"1 1001\", \"1002 2002\", \"1001 2002\"]\r\n for i in range(1, 1001):\r\n e.append(\" \".join(map(str, (i, i + 1))))\r\n for i in range(1002, 2002):\r\n e.append(\" \".join(map(str, (i, i + 1))))\r\n for i in range(1, 501):\r\n e.append(\" \".join(map(str, (i, i + 500))))\r\n for i in range(1002, 1502):\r\n e.append(\" \".join(map(str, (i, i + 500))))\r\n d = 2\r\n for _ in range(k // 2 - 1):\r\n g = math.gcd(1001, d)\r\n for i in range(g):\r\n j = i\r\n for _ in range(1001 // g):\r\n k = (j + d) % 1001\r\n e.append(\" \".join(map(str, (j + 1, k + 1))))\r\n e.append(\" \".join(map(str, (j + 1002, k + 1002))))\r\n j = k\r\n d += 1\r\n m = len(e)\r\n ans.append(\" \".join(map(str, (n, m))))\r\n ans.append(\"\\n\".join(e))\r\nsys.stdout.write(\"\\n\".join(ans))", "k=int(input())\r\nif k&1:\r\n\tprint('YES')\r\n\thn=(k<<1)-1\r\n\tprint(hn<<1,hn*k)\r\n\tfor t in range(0,hn+1,hn):\r\n\t\tfor i in range(1,k,2):\r\n\t\t\tprint(i+t,i+t+1)\r\n\t\tfor i in range(1,k):\r\n\t\t\tfor j in range(k,hn):\r\n\t\t\t\tprint(i+t,j+t)\r\n\t\tfor i in range(k,hn):\r\n\t\t\tprint(i+t,hn+t)\r\n\tprint(hn,hn<<1)\r\nelse:\r\n\tprint('NO')" ]

{"inputs": ["1", "3", "11", "10", "2", "4", "5", "6", "7", "8", "9", "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"], "outputs": ["YES\n2 1\n1 2", "YES\n10 15\n1 6\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5\n4 5\n6 7\n6 8\n7 9\n7 10\n8 9\n8 10\n9 10", "YES\n26 143\n1 14\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n2 12\n2 13\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n3 12\n3 13\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n4 12\n4 13\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n5 12\n5 13\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n6 12\n6 13\n6 8\n6 9\n6 10\n6 11\n7 12\n7 13\n7 8\n7 9\n7 10\n7 11\n8 12\n8 13\n8 10\n8 11\n9 12\n9 13\n9 10\n9 11\n10 12\n10 13\n11 12\n11 13\n12 13\n14 15\n14 16\n14 17\n14 18\n14 19\n14 20\n14 21\n14 22\n14 23\n14 24\n15 25\n15 26\n15 17\n15...", "NO", "NO", "NO", "YES\n14 35\n1 8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 4\n2 5\n3 6\n3 7\n3 4\n3 5\n4 6\n4 7\n5 6\n5 7\n6 7\n8 9\n8 10\n8 11\n8 12\n9 13\n9 14\n9 11\n9 12\n10 13\n10 14\n10 11\n10 12\n11 13\n11 14\n12 13\n12 14\n13 14", "NO", "YES\n18 63\n1 10\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n2 8\n2 9\n2 4\n2 5\n2 6\n2 7\n3 8\n3 9\n3 4\n3 5\n3 6\n3 7\n4 8\n4 9\n4 6\n4 7\n5 8\n5 9\n5 6\n5 7\n6 8\n6 9\n7 8\n7 9\n8 9\n10 11\n10 12\n10 13\n10 14\n10 15\n10 16\n11 17\n11 18\n11 13\n11 14\n11 15\n11 16\n12 17\n12 18\n12 13\n12 14\n12 15\n12 16\n13 17\n13 18\n13 15\n13 16\n14 17\n14 18\n14 15\n14 16\n15 17\n15 18\n16 17\n16 18\n17 18", "NO", "YES\n22 99\n1 12\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n2 10\n2 11\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n3 10\n3 11\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n4 10\n4 11\n4 6\n4 7\n4 8\n4 9\n5 10\n5 11\n5 6\n5 7\n5 8\n5 9\n6 10\n6 11\n6 8\n6 9\n7 10\n7 11\n7 8\n7 9\n8 10\n8 11\n9 10\n9 11\n10 11\n12 13\n12 14\n12 15\n12 16\n12 17\n12 18\n12 19\n12 20\n13 21\n13 22\n13 15\n13 16\n13 17\n13 18\n13 19\n13 20\n14 21\n14 22\n14 15\n14 16\n14 17\n14 18\n14 19\n14 20\n15 21\n15 22\n15 17\n15 18\n15 19\n15 20\n16 21\n16 22\n16 17\n...", "NO", "YES\n30 195\n1 16\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n2 14\n2 15\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n3 14\n3 15\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n4 14\n4 15\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n5 14\n5 15\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n6 14\n6 15\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n7 14\n7 15\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n8 14\n8 15\n8 10\n8 11\n8 12\n8 13\n9 14\n9 15\n9 10\n9 11\n9 12\n9 13\n10 14\n10 15\n10 12\n...", "NO", "YES\n34 255\n1 18\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n2 16\n2 17\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 16\n3 17\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n4 16\n4 17\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n5 16\n5 17\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n6 16\n6 17\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n7 16\n7 17\n7 8\n7 9\n7 10\n7 11\n7 12\n7 13\n7 14\n7 15\n8 16\n8 ...", "NO", "YES\n38 323\n1 20\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n2 18\n2 19\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n3 18\n3 19\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n4 18\n4 19\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n5 18\n5 19\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n6 18\n6 19\n6 8\n6 9\n6 10\n6 11\n6 12\n6 13\n6 14\n6 15\n6 16\n...", "NO", "YES\n42 399\n1 22\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n2 20\n2 21\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n3 20\n3 21\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n4 20\n4 21\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n5 20\n5 21\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12\n5 13\n5 14\n5 15\n5 16\n5 17\n5 18\n5 19\n6 20...", "NO", "YES\n46 483\n1 24\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n2 22\n2 23\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n3 22\n3 23\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n4 22\n4 23\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n5 22\n5 23\n5 6\n5 7\n5 8\n5 9\n5 10\n5 11\n5 12...", "NO", "YES\n50 575\n1 26\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 24\n2 25\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n3 24\n3 25\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n4 24\n4 25\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n4 22\n4 23\n...", "NO", "YES\n54 675\n1 28\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n2 26\n2 27\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n3 26\n3 27\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n4 26\n4 27\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n...", "NO", "YES\n58 783\n1 30\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n2 28\n2 29\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n3 28\n3 29\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3 27\n4 28\n4 29\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n...", "NO", "YES\n62 899\n1 32\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n2 30\n2 31\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n3 30\n3 31\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3 27\n3 28\n3 29\n4 30\n4 ...", "NO", "YES\n66 1023\n1 34\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n2 32\n2 33\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n3 32\n3 33\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n3 25\n3 26\n3...", "NO", "YES\n70 1155\n1 36\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n2 34\n2 35\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n3 34\n3 35\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3...", "NO", "YES\n74 1295\n1 38\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n2 36\n2 37\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n3 36\n3 37\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3...", "NO", "YES\n78 1443\n1 40\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n2 38\n2 39\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n3 38\n3 39\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3...", "NO", "YES\n82 1599\n1 42\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n2 40\n2 41\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n3 40\n3 41\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3...", "NO", "YES\n86 1763\n1 44\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n2 42\n2 43\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n3 42\n3 43\n3 4\n3 5\n3 6...", "NO", "YES\n90 1935\n1 46\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n2 44\n2 45\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n2 42\n2 43\n3...", "NO", "YES\n94 2115\n1 48\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n2 46\n2 47\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2 40\n2 41\n2...", "NO", "YES\n98 2303\n1 50\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n2 48\n2 49\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n2 38\n2 39\n2...", "NO", "YES\n102 2499\n1 52\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n2 50\n2 51\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n2 36\n2 37\n...", "NO", "YES\n106 2703\n1 54\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n2 52\n2 53\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n2 34\n2 35\n...", "NO", "YES\n110 2915\n1 56\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n2 54\n2 55\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n2 32\n2 33\n...", "NO", "YES\n114 3135\n1 58\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n2 56\n2 57\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n2 30\n2 31\n...", "NO", "YES\n118 3363\n1 60\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n2 58\n2 59\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n2 28\n2 29\n...", "NO", "YES\n122 3599\n1 62\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n2 60\n2 61\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n2 26\n2 27\n...", "NO", "YES\n126 3843\n1 64\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n2 62\n2 63\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n2 25\n...", "NO", "YES\n130 4095\n1 66\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n2 64\n2 65\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n...", "NO", "YES\n134 4355\n1 68\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n2 66\n2 67\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n...", "NO", "YES\n138 4623\n1 70\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n2 68\n2 69\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n...", "NO", "YES\n142 4899\n1 72\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n2 70\n2 71\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n...", "NO", "YES\n146 5183\n1 74\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n2 72\n2 73\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n...", "NO", "YES\n150 5475\n1 76\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n2 74\n2 75\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n...", "NO", "YES\n154 5775\n1 78\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n2 76\n2 77\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n...", "NO", "YES\n158 6083\n1 80\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n2 78\n2 79\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n...", "NO", "YES\n162 6399\n1 82\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n2 80\n2 81\n2 4\n2 5\n2 6\n2 7...", "NO", "YES\n166 6723\n1 84\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n2 82\n2 83\n2 4\n2...", "NO", "YES\n170 7055\n1 86\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n2 84\n...", "NO", "YES\n174 7395\n1 88\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n178 7743\n1 90\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n182 8099\n1 92\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n186 8463\n1 94\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n190 8835\n1 96\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n194 9215\n1 98\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n198 9603\n1 100\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO", "YES\n202 9999\n1 102\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n1 25\n1 26\n1 27\n1 28\n1 29\n1 30\n1 31\n1 32\n1 33\n1 34\n1 35\n1 36\n1 37\n1 38\n1 39\n1 40\n1 41\n1 42\n1 43\n1 44\n1 45\n1 46\n1 47\n1 48\n1 49\n1 50\n1 51\n1 52\n1 53\n1 54\n1 55\n1 56\n1 57\n1 58\n1 59\n1 60\n1 61\n1 62\n1 63\n1 64\n1 65\n1 66\n1 67\n1 68\n1 69\n1 70\n1 71\n1 72\n1 73\n1 74\n1 75\n1 76\n1 77\n1 78\n1 79\n1 80\n1 81\n1 82\n1 83\n1 84\n...", "NO"]}

UNKNOWN

PYTHON3

CODEFORCES

2

d3de88c38870d2f1361cde69bf370df5

Partial Teacher

A teacher decides to give toffees to his students. He asks *n* students to stand in a queue. Since the teacher is very partial, he follows the following rule to distribute toffees. He looks at the first two students and gives more toffees to the student having higher marks than the other one. If they have the same marks they get the same number of toffees. The same procedure is followed for each pair of adjacent students starting from the first one to the last one. It is given that each student receives at least one toffee. You have to find the number of toffees given to each student by the teacher such that the total number of toffees is minimum. The first line of input contains the number of students *n* (2<=≤<=*n*<=≤<=1000). The second line gives (*n*<=-<=1) characters consisting of "L", "R" and "=". For each pair of adjacent students "L" means that the left student has higher marks, "R" means that the right student has higher marks and "=" means that both have equal marks. Output consists of *n* integers separated by a space representing the number of toffees each student receives in the queue starting from the first one to the last one. Sample Input 5 LRLR 5 =RRR Sample Output 2 1 2 1 2 1 1 2 3 4

[ "import math\r\nfrom collections import Counter, defaultdict\r\nfrom itertools import accumulate\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\ns = input()\r\ndp = [[0] * 1005 for i in range(n + 1)]\r\nfor i in range(1, 1001):\r\n dp[0][i] = i\r\ndp[0][1001] = math.inf\r\nfor i in range(n):\r\n dp[i][0] = math.inf\r\nfor i in range(1, n):\r\n if s[i - 1] == 'L':\r\n rmin = math.inf\r\n for j in range(1000, 0, -1):\r\n dp[i][j] = rmin + j\r\n rmin = min(rmin, dp[i - 1][j])\r\n elif s[i - 1] == 'R':\r\n rmin = math.inf\r\n for j in range(1, 1001):\r\n dp[i][j] = rmin + j\r\n rmin = min(rmin, dp[i - 1][j])\r\n else:\r\n for j in range(1, 1001):\r\n dp[i][j] = dp[i - 1][j] + j\r\nrem = min((dp[n - 1][j], j) for j in range(1, 1001))[0]\r\nres = [-1] * n\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(1, 1001):\r\n if rem == dp[i][j]:\r\n res[i] = j\r\n rem -= j\r\n continue\r\nprint(' '.join(map(str, res)))", "len = int(input())\r\ndir = input()\r\n\r\nres = [1] * len\r\n\r\nfor i in range(1, len):\r\n if dir[i - 1] == 'L':\r\n res[i] = 1\r\n else:\r\n res[i] = res[i - 1] + (dir[i - 1] == 'R')\r\n\r\nfor i in range(len - 2, -1, -1):\r\n if dir[i] == 'L':\r\n res[i] = max(res[i], res[i + 1] + 1)\r\n elif dir[i] == '=':\r\n res[i] = max(res[i], res[i + 1])\r\n\r\nprint(*res)\r\n\r\n\r\n\r\n", "from collections import deque\r\n\r\nn = int(input())\r\ns = input()\r\nans = [1]*n\r\n\r\nfor i in range(1,n):\r\n if s[i-1]=='R':\r\n ans[i]=ans[i-1]+1\r\n elif s[i-1]=='=':\r\n ans[i]=ans[i-1]\r\n\r\nfor i in range(n-2, -1, -1):\r\n if s[i]=='L':\r\n ans[i]=max(ans[i+1]+1, ans[i]) \r\n elif s[i]=='=':\r\n ans[i]=max(ans[i], ans[i+1])\r\n\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\nans = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n min_val = 1\r\n \r\n if i > 0:\r\n if s[i - 1] == '=':\r\n ans[i] = ans[i - 1]\r\n continue\r\n if s[i - 1] == 'R':\r\n min_val = ans[i - 1] + 1\r\n \r\n cnt_low = 0\r\n for j in range(i, n - 1):\r\n if s[j] == '=':\r\n continue\r\n if s[j] == 'L':\r\n cnt_low += 1\r\n if s[j] == 'R':\r\n break\r\n min_val = max(min_val, cnt_low + 1)\r\n \r\n ans[i] = min_val\r\n\r\nprint(*ans)", "n=int(input())\r\na=input()\r\ndp=[1]*n\r\nfor i in range(n):\r\n for j in range(n-1):\r\n if a[j]==\"L\":\r\n if dp[j]<=dp[j+1]:\r\n dp[j]=dp[j+1]+1\r\n elif a[j]==\"R\":\r\n if dp[j]>=dp[j+1]:\r\n dp[j+1]=dp[j]+1\r\n elif a[j]==\"=\" and dp[j]!=dp[j+1]:\r\n dp[j]=max(dp[j],dp[j+1])\r\n dp[j+1]=max(dp[j],dp[j+1])\r\nstr1=''\r\nfor i in dp:\r\n str1+=str(i)+' '\r\nprint(str1)", "n = int(input())\n\np = 'R' + input() + 'R'\n\nt = [0] * n\n\ni = t[0] = l = r = 1\n\nL = R = 0\n\nwhile i < n + 1:\n\n if p[i] == 'L':\n\n if r > 1:\n\n t[R] = r\n\n L, r = i, 1\n\n l += 1\n\n elif p[i] == 'R':\n\n if l > 1:\n\n if t[R] < l: t[R] = l\n\n else: t[L] = l - 1\n\n l = 1\n\n R = i\n\n r += 1\n\n i += 1\n\nfor i in range(1, n):\n\n if t[i] == 0:\n\n if p[i] == 'L': t[i] = t[i - 1] - 1\n\n elif p[i] == 'R': t[i] = t[i - 1] + 1\n\n else: t[i] = t[i - 1]\n\nprint(' '.join(map(str, t)))", "import copy\nn = int(input())\n\ndifference = input()\n\nanswer = [0 for i in range(n)]\n\ndef is_local_min(i, difference):\n for j in range(i - 1, -1, -1):\n if difference[j] == 'R':\n return False\n if difference[j] == 'L':\n break\n for j in difference[i:]:\n if j == 'L':\n return False\n if j == 'R':\n break\n return True\n\nloc_min_lst = []\n\nfor i in range(n):\n if is_local_min(i, difference):\n loc_min_lst.append(i)\n\nvalue = 0\n\nfor i in loc_min_lst:\n value = 1 \n for j in range(i, -1, -1):\n if j == 0:\n answer[0] = value\n value = 1\n break\n if answer[j] >= value:\n break\n else:\n answer[j] = value\n if difference[j - 1] == 'R':\n break\n if difference[j - 1] == 'L':\n value += 1\n value = 1\n for j in range(i, n):\n if j == n - 1:\n answer[n - 1] = value\n value = 1\n break\n if answer[j] > value:\n break\n else:\n answer[j] = value\n if difference[j] == 'L':\n break\n if difference[j] == 'R':\n value += 1\n\nprint(' '.join([str(x) for x in answer]))\n\n", "\r\n\r\n\r\ndef ans():\r\n n=int(input())\r\n k=n+1\r\n s=input()\r\n a=[]\r\n for i in range(n):\r\n a.append(0)\r\n a[n-1]=1\r\n for i in range(len(s)-1,-1,-1):\r\n if(s[i]=='L'):\r\n a[i]=a[i+1]+1\r\n elif(s[i]=='R'):\r\n if(a[i+1]==1):\r\n a[i+1]=2\r\n for j in range(i+1,n-1):\r\n if(s[j]=='='):\r\n a[j+1]=a[j]\r\n elif(s[j]=='L'):\r\n break\r\n elif(a[j]==a[j+1]):\r\n a[j+1]+=1\r\n a[i]=1\r\n else:\r\n a[i]=a[i+1]\r\n\r\n print(*a)\r\nfor i in range(1):\r\n ans()\r\n\r\n ", "n=int(input())\r\ns=\"0\"+input()\r\nk=[1]*n\r\nfor i in range(1,n):\r\n if s[i]==\"R\" and k[i]<=k[i-1]:\r\n k[i]=k[i-1]+1\r\n elif s[i]==\"L\" and k[i-1]<=k[i]:\r\n k[i-1]=1\r\n elif s[i]==\"=\":\r\n k[i]=k[i-1]\r\ns=s[::-1]\r\nk=k[::-1]\r\nfor i in range(n-1):\r\n if s[i]==\"L\" and k[i+1]<=k[i]:\r\n k[i+1]=k[i]+1\r\n elif s[i]==\"=\":\r\n k[i+1]=k[i]\r\nprint(*k[::-1])", "n = int(input())\r\ns = input()\r\nans = [1] * n\r\n\r\nt = True\r\nwhile t:\r\n t = False\r\n for i in range(n - 1):\r\n if s[i] == '=' and ans[i] != ans[i + 1]:\r\n ans[i] = ans[i + 1] = max(ans[i], ans[i + 1])\r\n t = True\r\n elif s[i] == 'R' and ans[i] >= ans[i + 1]:\r\n ans[i + 1] += 1\r\n t = True\r\n elif s[i] == 'L' and ans[i] <= ans[i + 1]:\r\n ans[i] += 1\r\n t = True\r\nprint(*ans)", "n=int(input())\r\ns=input()\r\nw=[1]*n\r\nfor i in range(n-1):\r\n if s[i]=='=':\r\n w[i+1]=w[i]\r\n elif s[i]=='R':\r\n if w[i+1]<=w[i]:\r\n w[i+1]=w[i]+1\r\n else:\r\n if w[i]<=w[i+1]:\r\n w[i]=w[i+1]+1\r\nfor i in range(n-2,-1,-1):\r\n if s[i]=='=':\r\n w[i]=w[i+1]\r\n elif s[i]=='R':\r\n if w[i+1]==w[i]:\r\n w[i+1]=w[i]+1\r\n else:\r\n if w[i]<=w[i+1]:\r\n w[i]=w[i+1]+1\r\nfor i in range(n):\r\n print(w[i],end=' ')\r\n", "n=int(input())\r\nr=[1]*n\r\ns=input()\r\ny=1\r\nwhile y:\r\n y=0\r\n for i in range(n-1):\r\n if s[i]=='=' and r[i]!=r[i+1]:r[i]=r[i+1]=max(r[i:i+2]);y=1\r\n if s[i]=='L' and r[i]<=r[i+1]:r[i]=r[i+1]+1;y=1\r\n if s[i]=='R' and r[i]>=r[i+1]:r[i+1]=r[i]+1;y=1\r\nprint(*r)", "from collections import defaultdict\n\nclass PartialTeacher():\n def __init__(self, n, prefs):\n self.prefs = prefs\n \n def create_graph(self):\n num_nodes = len(list(filter(lambda x: x != '=',list(self.prefs))))+1\n node_cntr = 0\n node_cnts = defaultdict(lambda: 1)\n edge_map = defaultdict(list)\n rev_map = defaultdict(list)\n outgoing_edges = defaultdict(int)\n for ch in self.prefs:\n if ch == 'R':\n edge_map[node_cntr].append(node_cntr+1)\n rev_map[node_cntr+1].append(node_cntr)\n outgoing_edges[node_cntr] += 1\n node_cntr += 1\n elif ch == 'L':\n edge_map[node_cntr+1].append(node_cntr)\n rev_map[node_cntr].append(node_cntr+1)\n outgoing_edges[node_cntr+1] += 1\n node_cntr += 1\n else:\n node_cnts[node_cntr] += 1\n s = set()\n for i in range(node_cntr+1):\n if outgoing_edges[i] == 0:\n s.add(i)\n order = []\n while len(s) > 0:\n v = s.pop()\n order.append(v)\n for u in rev_map[v]:\n outgoing_edges[u] -= 1\n if outgoing_edges[u] == 0:\n s.add(u)\n order.reverse()\n values = [-1]*len(order)\n for v in order:\n val_list = list(map(lambda x: values[x], rev_map[v]))\n val = 1 if len(val_list) == 0 else max(val_list)+1\n values[v] = val\n complete_values = []\n for i in range(len(values)):\n complete_values += [values[i]]*node_cnts[i]\n print(*complete_values)\n\n\nn = int(input())\nprefs = input().strip(' ')\n\npt = PartialTeacher(n, prefs)\npt.create_graph()\n\n\n\n\n\n\n" ]

{"inputs": ["5\nLRLR", "5\n=RRR", "6\nRLRL=", "3\nR=", "7\nRR==RR", "166\nR===RL=LRRR=RRRL=LRR=R=RR==L=R=R=RRR=RR=RLLRRL=LLRL==L=R==RLR==RL=RR=LR==R=R=LLRLRLR=RR=RLLRLR=RRLL==L=LR=RR=RRRL=RLLLR==L=RRLRLLLLLLLRL===LRLRLRLRRLL=LRLL===LRLRR==", "333\nLL=LR=R=RRR=L=LRR=RLRLLLR=LRL=RRLRRRLLRRLL====RL=L====LLRL=RR==L==RLL==L=R=RLRR==LRRL=LRL=RLRLRR=R=LR=LLR===LRL=RRL====R==LRLR===LLLLL=LLLRLRLLLLLL==RLL=RL==LR=RRLRLL=R=R=R=RLRLRLLRRL==L==LRR=L=R=R===RLR=R=L=LR=LRLRR=RRL=L=RRLR=RRL=RRRL=RLRRRLLLRR=RRRLRLLLR==RR=RL===R=RL=RLL====RRRR=LR=LL=RL==RRLR====R=L=R==L=R=R=RLR=RR=R=LRRRRLLL", "24\nR=R==RL=RL=RLL=LLL=LLRL", "438\nLR=RLLLRL=R==LLR=RRLRRR==RLRLRLLRRRRRLRL=RRRRLRR==RR=RR=LLRR=L=LLRRRLLR==RL=L=LLR=L=R==LLR=L=RR==LRL=LLL=RRR=R=LRLLRLLLR==LRRLLL=L==LLR=RL=LLLLR=RR=LR=RL==LRLRR=RRRRRLRLRR==RR=LLLRLR====LRRLL==LR==LL=LLRR=LRL=RRRRLR=RLLR=R=LLLRRRRR===R==LRLLRLR=LLL=L=L=R=RLLR=R=RR=RL=LLRRLLRR=LRRRR==LR==L==R=L=L=R===LLL=LL==L=L=LLLLL==RRRR==R=RLL=RLR=RRRR=R=L=RRRLLRRLRRRLLRLLRRRL=LR=R=LRLRL=R=RLRRLRRL==R=RRR=RLLR=RR=LL=RLR=R==R===RRLR=LLLR=L===LR=L=R", "453\nR==LL==RRLLRRLR=L=LRLL=LRRR=R====L=RL======RR==RRRR=LRR=LLLRR=LLLLL===LL=LLL=LR=RLRL===L==R=LRL=L=R==RRLLR=L==LRR=RRLRLLRR=LL==RLRLLRRRL=RRL=R====L=RLRR=RR=RRRL=R=RL=LLR=LR=L=RR=RR====LRRLRRLLR==R==L==RRLLRLR=RLLLLR==L=L=L=RR==L=LRRRL=R==RRL=LRR=RRRRRL===RLRLR=RLRLRLRLRR=RL=LL=RLLRR=LL=RLL=L=LRLLLLLR==RRL=R=L===LRLLL=RRRLR=LR====RR=L===LLLL=R=LLLRRRLL=LL==RLRL=LRLRL=RR=RLR==LLR=LR=RLLRLRRLL==L=LL==L==RLRLRLL=L=RLLR==LLRRLRRL==L=R=RLLRLLLL====L=====", "100\n=L=L=L=R=LR=RRRLRL=LRL=RRLLLLRL=R==R=LLLRR===RR=LR==LRLR===RRLRLLRLLR=LRLRR=L=LRRLLLRR==LLRLLLL==RL", "484\nLLRRRL==RRLRRLR=LRR=RL=LLLRL===RLRRRLRR=RRRL=LLLLRL==RL==R==LLLRL=RLLRLRLLLLLLLRRLL=LLR=LLR==RLL==LLLR=RL==LL=LRRL=LLRRRLR====R=R=LRRRLLL==RLRRLR=LL==LLRLR===RR=LR==RL==L==R====LRL=LR=R=R=R=LL=L=RLR=RL==R==LRLRL==L==LL=LR=L=RRRR=R==RRLRRRLR==R=LL===R===RLRRR===LRRLLRRRRR=L==LLRRRRLRRRLL===L==LR==LR==RRLRRLRLLLL=RRL=L=LLLRLRRLLL=LRRRRLLLR=L=LL=LRLL=R==L=LRR=R=LLLRR=LRRRLR=R=RLLRR=LRL===LL==LR===L=L=L=RLL=LRRL=LL==RL==RRL====RR=L=R==L==RRL=LLRLR=RLLLL==R==RRL=====LR=RRR=LRLRRR=RLR", "338\n==R===L=RLRLR===RR=RRL==R=R=RLRLLRLRRRLR=LR=RR=RLLRR=RRRLLRLL=RRRRRLRLLLL=RLLRLLLRL===RRR=RRLLR=LLLL===RLL==LRLLLLRLLLLR=====RLRLRLRL=L==RRLL=RLL===LL=R=RRL=LL=L==RRLLR=LLRLL=LL=LL==RRLR=L=RLLL=LRLLLRRLR=RL=RR=R=L==RLRLL=LRRLLLLLL=RRL==RLL==R===LR===LRLRLR==LR=RR==RR=RRRRRLRRRLRLLRRRLL=LR=RRR=RL=R=LRRLR==RRR=LLL===RR=RL==RRLLL=RL=L=RLL", "198\nLLRRR=RRRRLRRLRR=R===R=RL==R=RLLLR=R=L=LR=R====RRL=RRR=LL=R=RR=RRRLRRLRRR==L=LRLLL====LR=RL==L===LRR=L=L==R==R==L=LLL===R=LLL=R=L=LLLLRLL=RL=LRRLR=RL==RR=R==RLR==R=R==RLRL=LL=RRR=R===LLLRRRRL=RLRLL", "426\nR==LRRRL=R==LLRRRLRLLLR=====R=RRRLLR==LL=L=RR=L=L==LRRR=LL=RR=LRRRLRLLR=R==RL=RRL===RRRL=RLRRRRRLRLLR=LR==LL=R=RRRLRLLLRL=L=RL=R==L==RRLLRRR=RRR==RL=====R=R==RLR=R==L==RL=RRR=RLL=L=LL=RLLR===R=RL==LR=LRLLLR==L==LR=RLLLRRRRL=RRRL=RL=LR=====R=RR=L=RL==L=LLRL=LL=L==LR=RLLRR=RLRLR=LRLLRR===L===RLL=RR==RR=R====RRLR=L=RLRLRLLRLLL=R=R=LLLRRRLR=L==L=R==LLR=L=L==RRLR=LR=R=LR=RR=R=LLRL=L=R=LLLLLR==L=LR=R=L=LL==LRR=L===RL==LL==R==RL", "10\nRL=R=RLR=", "2\nL", "100\nR=R=RRR=R=RR=RRLL=RLRLLLLLR==L=======L=LLR==RL=R=LRLLLR==LLLL=RRRL=LRL=LR=====L=LLLRRL=LLR===RLR=RR", "23\nL=LLLLRL=RR=RLLLL=RR==", "432\n=R=RRL=LLR=LLRLLRL=RL==R===L===LR=RR=LL==RLRLRRL=LRL=RLLRRLLL==RLLR=LLLRL=RLRRLLRRL=RLRRL=LL=RR=RL==LL===R==RR=LLL=RRR===R=RLLLR====R==RL=LRL=LLRLRLLRL=LLR==R==LLLL===R=R=LR=L=LRR=LR==LLL=L=LR=R=RLR=L=R==L=RLLLRR=R===R==L==R===L=RLLRLLLLLLL=LRRL=LLLL=RR==R===RR=LLLLRLRL==R====LR==LRL=L=R=R=L====LRLRL=RRR=RRRL====R=LRLRL===LRLLLR==R==LL=R==L==L=LRRRL==LL=R=L=LL=RRRLLRLRL==LLR===RRR=RRLRRR=R=RL===L=RRRR=R=RL===R==L===LLR=LLRLLLRL", "4\nRRL", "17\n=RRR=L==LLLLRRRL", "20\nRRLLLLLRRRRRRRRLRLR", "9\nR===RRLL", "15\n=RRR=LLLLLRRRL"], "outputs": ["2 1 2 1 2", "1 1 2 3 4", "1 2 1 2 1 1", "1 2 2", "1 2 3 3 3 4 5", "1 2 2 2 2 3 2 2 1 2 3 4 4 5 6 7 2 2 1 2 3 3 4 4 5 6 6 6 1 1 2 2 3 3 4 5 6 6 7 8 8 9 2 1 2 4 3 3 2 1 3 2 2 2 1 1 2 2 2 3 1 2 2 2 3 1 1 2 3 3 1 2 2 2 3 3 4 4 2 1 2 1 2 1 2 2 3 4 4 5 2 1 2 1 2 2 3 5 4 3 3 3 2 2 1 2 2 3 4 4 5 6 7 1 1 4 3 2 1 2 2 2 1 1 2 3 1 8 7 6 5 4 3 2 1 3 2 2 2 2 1 2 1 2 1 2 1 2 4 3 2 2 1 4 3 2 2 2 2 1 2 1 2 3 3 3", "4 3 2 2 1 2 2 3 3 4 5 6 6 2 2 1 2 3 3 4 1 4 3 2 1 2 2 1 2 1 1 2 3 1 2 3 4 2 1 2 3 2 1 1 1 1 1 5 4 4 3 3 3 3 3 2 1 2 1 1 2 3 3 3 1 1 1 4 3 2 2 2 1 1 2 2 3 1 2 3 3 3 1 2 3 2 2 1 2 1 1 2 1 2 1 2 3 3 4 4 1 3 3 2 1 2 2 2 2 1 2 1 1 2 3 1 1 1 1 1 2 2 2 1 2 1 9 9 9 9 8 7 6 5 4 4 3 2 1 2 1 7 6 5 4 3 2 1 1 1 3 2 1 1 3 2 2 2 1 2 2 3 4 1 3 2 1 1 2 2 3 3 4 4 5 1 2 1 3 2 1 2 4 3 3 3 2 2 2 1 2 3 3 1 1 2 2 3 3 3 3 4 1 2 2 3 3 2 2 1 2 2 1 2 1 2 3 3 4 5 2 2 1 1 2 3 1 2 2 3 4 1 1 2 3 4 1 1 2 1 2 3 4 3 2 1 2 3 3 4 5 6 1 4 3 2...", "1 2 2 3 3 3 4 1 1 2 1 1 8 7 6 6 5 4 3 3 2 1 2 1", "2 1 2 2 4 3 2 1 2 1 1 3 3 3 2 1 2 2 3 4 1 2 3 4 4 4 5 1 2 1 3 2 1 2 3 4 5 6 1 2 1 1 2 3 4 5 1 2 3 3 3 4 5 5 6 7 7 2 1 2 4 4 3 3 2 1 2 3 4 2 1 2 2 2 5 4 4 3 3 2 1 2 2 1 1 3 3 3 2 1 2 2 1 1 2 3 3 3 1 5 4 4 3 2 1 1 2 3 4 4 5 5 1 3 2 1 4 3 2 1 2 2 2 1 2 7 6 5 4 4 3 3 3 2 1 2 2 6 5 5 4 3 2 1 2 2 3 4 4 1 2 2 3 2 2 2 1 2 1 2 3 3 4 5 6 7 8 1 2 1 2 3 3 3 4 5 5 3 2 1 2 1 2 2 2 2 2 1 2 4 3 2 2 2 1 5 5 5 4 3 3 2 1 2 3 3 1 2 1 1 2 3 4 5 1 2 2 3 2 1 2 2 4 4 3 2 1 2 3 4 5 6 6 6 6 7 7 7 1 3 2 1 2 1 6 6 5 4 3 3 2 2 1 1 2 2...", "1 3 3 3 2 1 1 1 2 3 2 1 2 3 1 3 3 2 2 1 4 3 2 2 1 2 3 4 4 5 5 5 5 5 1 1 2 1 1 1 1 1 1 1 2 3 3 3 4 5 6 7 7 1 2 4 4 3 2 1 2 12 12 11 10 9 8 7 7 7 7 6 5 5 4 3 2 2 1 2 2 3 1 3 2 2 2 2 1 1 1 2 2 1 3 2 2 1 1 2 2 2 3 4 2 1 3 3 2 2 2 1 2 3 3 4 5 1 3 2 1 2 3 3 2 1 1 1 2 1 3 2 1 2 3 4 1 1 2 3 1 1 2 2 2 2 2 1 1 2 1 2 3 3 4 5 5 6 7 8 1 1 2 2 4 3 3 2 1 2 2 1 2 2 1 1 2 3 3 4 5 5 5 5 5 1 2 3 1 2 3 2 1 2 2 2 3 3 3 1 1 1 2 3 2 1 2 1 2 2 5 4 3 2 1 4 4 4 3 3 2 2 1 1 2 3 3 3 2 2 1 2 3 4 1 1 2 2 2 3 4 2 2 1 2 3 3 4 5 6 7 8 1 1...", "4 4 3 3 2 2 1 1 2 2 1 2 2 3 4 5 1 3 2 2 1 2 1 1 2 5 4 3 2 1 2 1 1 2 2 2 4 4 3 2 1 2 3 3 3 3 4 5 5 1 2 2 2 1 2 1 2 2 2 2 3 4 1 3 2 1 3 2 1 2 2 1 2 1 2 3 3 2 2 1 2 4 3 2 1 2 3 3 3 2 1 5 4 3 2 1 1 1 2 1", "3 2 1 2 3 4 1 1 1 2 3 1 2 3 1 2 2 1 2 3 3 5 4 4 3 2 1 2 1 1 1 1 2 1 2 3 4 1 2 3 3 4 5 6 5 5 4 3 2 1 2 1 1 1 2 1 1 1 4 4 4 3 2 1 2 1 1 3 2 1 2 1 8 7 6 5 4 3 2 1 2 5 4 3 3 2 1 3 3 2 1 2 2 2 6 5 4 4 4 3 2 1 2 2 5 4 4 4 3 2 2 1 2 4 3 3 2 1 2 3 4 1 2 2 2 2 2 3 3 4 4 1 2 3 4 3 2 1 1 1 2 1 2 3 1 5 5 4 3 3 3 2 1 2 1 2 2 2 2 3 4 4 1 2 2 2 3 2 2 2 1 1 1 2 2 2 2 2 1 3 2 2 1 2 2 3 3 4 4 5 5 3 2 2 1 1 2 1 2 2 3 1 1 1 2 2 2 1 2 1 6 5 5 5 4 4 4 3 2 2 1 2 2 1 1 2 3 4 5 5 6 6 6 7 8 1 2 3 4 1 2 2 2 3 3 2 1 1 1 1 2 2 2 2 3 1...", "1 1 1 2 2 2 2 1 1 2 1 2 1 2 2 2 2 3 4 4 5 6 1 1 1 2 2 3 3 4 1 3 2 1 2 1 2 3 4 1 2 2 1 2 2 3 4 4 5 2 1 2 3 3 4 5 6 2 1 3 2 1 1 2 3 4 5 6 1 5 4 3 2 1 1 3 2 1 4 3 2 1 2 1 1 1 1 2 3 4 4 5 6 2 1 5 5 4 3 2 1 1 1 1 4 3 2 2 2 1 5 4 3 2 1 5 4 3 2 1 2 2 2 2 2 2 3 1 2 1 2 1 3 2 2 1 1 1 2 3 2 1 1 5 4 3 3 3 3 2 1 1 2 2 3 5 4 4 3 2 2 1 1 1 2 3 2 1 3 3 2 1 7 6 5 5 4 3 3 2 1 1 1 2 3 1 2 2 1 1 5 4 3 2 2 1 4 3 2 1 2 3 1 2 2 3 1 1 2 3 3 4 4 1 1 1 2 1 4 3 2 2 1 2 7 6 5 4 3 2 1 1 2 3 1 1 1 3 2 1 1 1 2 2 2 2 1 2 2 2 2 1 2 1 2 1...", "3 2 1 2 3 4 4 5 6 7 8 1 2 3 1 2 3 3 4 4 4 4 5 5 6 1 1 1 2 2 4 3 2 1 2 2 3 3 2 2 1 2 2 3 3 3 3 3 4 5 1 1 2 3 4 4 2 1 1 2 2 3 4 4 5 6 7 1 2 3 1 2 3 4 4 4 2 2 1 5 4 3 2 2 2 2 2 1 2 2 4 3 3 3 2 2 2 2 1 2 3 3 2 2 1 1 1 2 2 2 5 5 5 4 4 3 2 1 1 1 1 4 4 3 2 1 1 6 6 5 5 4 3 2 1 3 2 1 1 3 2 2 1 2 3 1 2 2 3 1 1 1 2 3 3 4 4 4 5 1 2 2 2 3 3 4 4 4 5 1 4 3 3 2 1 1 2 3 4 4 5 5 5 5 3 2 1 2 3 4 5 1 1 2 1 3 2 1", "1 2 2 2 1 2 3 4 1 1 3 3 3 2 1 2 3 4 1 4 3 2 1 2 2 2 2 2 2 3 3 4 5 6 2 1 4 4 4 3 2 2 1 1 2 4 4 3 3 2 2 2 1 2 3 4 4 2 1 1 2 3 3 1 2 3 4 1 3 2 1 2 2 3 3 3 4 1 1 2 3 1 1 1 1 2 3 4 1 1 2 1 2 3 4 5 6 1 3 2 1 2 2 1 3 3 3 2 1 1 2 2 3 4 5 1 4 3 2 1 3 2 2 1 1 2 1 1 2 2 2 1 1 1 2 3 2 1 2 3 4 4 5 6 7 7 7 8 1 1 1 1 1 1 2 2 3 3 3 4 1 2 2 3 3 3 1 1 1 2 1 1 2 3 4 4 6 5 4 4 3 3 2 1 1 3 2 1 2 2 2 2 3 3 4 2 2 2 1 2 2 1 4 3 2 1 3 3 3 2 2 2 1 2 2 4 3 2 1 2 3 4 5 1 1 2 3 4 1 1 3 2 2 1 2 2 2 2 2 2 3 3 4 5 5 1 1 5 4 4 4 3 3 2 1 6...", "1 2 1 1 2 2 3 1 2 2", "2 1", "1 2 2 3 3 4 5 6 6 7 7 8 9 9 10 11 2 1 1 2 1 6 5 4 3 2 1 5 5 5 4 4 4 4 4 4 4 4 3 3 2 1 2 2 2 3 1 1 2 2 1 4 3 2 1 5 5 5 4 3 2 1 1 2 3 4 2 2 1 3 2 2 1 5 5 5 5 5 5 4 4 3 2 1 2 4 3 3 2 1 2 2 2 2 3 1 2 2 3 4", "6 5 5 4 3 2 1 2 1 1 2 3 3 5 4 3 2 1 1 2 3 3 3", "1 1 2 2 3 4 3 3 2 1 3 3 2 1 3 2 1 2 1 1 2 1 1 1 3 3 3 3 2 2 2 2 1 2 2 3 4 4 2 1 1 1 2 1 2 1 2 3 2 2 1 2 1 1 3 2 1 2 4 3 2 1 1 1 3 2 1 4 4 3 2 1 2 1 1 2 1 2 3 2 1 2 3 1 1 2 1 2 4 3 3 2 1 1 2 3 3 4 3 3 3 2 1 1 1 1 2 2 2 3 4 4 3 2 1 1 2 3 4 4 4 4 5 5 6 3 2 1 2 2 2 2 2 3 3 3 4 2 2 1 4 3 3 2 1 2 1 3 2 1 4 3 3 2 1 2 2 2 5 5 5 4 3 2 1 1 1 1 2 2 3 3 1 3 3 2 2 1 2 3 3 1 6 6 6 5 4 3 3 2 2 1 2 2 3 3 4 1 2 2 1 1 2 2 2 1 1 4 3 2 1 2 3 3 4 4 4 4 5 5 5 1 1 1 2 2 2 2 1 1 3 2 1 9 8 7 6 5 4 3 2 2 1 2 6 5 5 4 3 2 1 1 2 3 3 3...", "1 2 3 1", "1 1 2 3 6 6 5 5 5 4 3 2 1 2 3 4 1", "1 2 6 5 4 3 2 1 2 3 4 5 6 7 8 9 1 2 1 2", "1 2 2 2 2 3 4 2 1", "1 1 2 3 6 6 5 4 3 2 1 2 3 4 1"]}

UNKNOWN

PYTHON3

CODEFORCES

13

d3e51e02198078824b0169caf85d97d6

Till I Collapse

Rick and Morty want to find MR. PBH and they can't do it alone. So they need of Mr. Meeseeks. They Have generated *n* Mr. Meeseeks, standing in a line numbered from 1 to *n*. Each of them has his own color. *i*-th Mr. Meeseeks' color is *a**i*. Rick and Morty are gathering their army and they want to divide Mr. Meeseeks into some squads. They don't want their squads to be too colorful, so each squad should have Mr. Meeseeks of at most *k* different colors. Also each squad should be a continuous subarray of Mr. Meeseeks in the line. Meaning that for each 1<=≤<=*i*<=≤<=*e*<=≤<=*j*<=≤<=*n*, if Mr. Meeseeks number *i* and Mr. Meeseeks number *j* are in the same squad then Mr. Meeseeks number *e* should be in that same squad. Also, each squad needs its own presidio, and building a presidio needs money, so they want the total number of squads to be minimized. Rick and Morty haven't finalized the exact value of *k*, so in order to choose it, for each *k* between 1 and *n* (inclusive) need to know the minimum number of presidios needed. The first line of input contains a single integer *n* (1<=≤<=*n*<=≤<=105) — number of Mr. Meeseeks. The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* separated by spaces (1<=≤<=*a**i*<=≤<=*n*) — colors of Mr. Meeseeks in order they standing in a line. In the first and only line of input print *n* integers separated by spaces. *i*-th integer should be the minimum number of presidios needed if the value of *k* is *i*. Sample Input 5 1 3 4 3 3 8 1 5 7 8 1 7 6 1 Sample Output 4 2 1 1 1 8 4 3 2 1 1 1 1

[ "import sys\r\nbase = 1 << 17\r\ndef get(x, v=1, cl=0, cr=base):\r\n if x >= t[v]:\r\n return cr\r\n if cl + 1 == cr:\r\n return cl\r\n cc = (cl + cr) // 2\r\n if x >= t[v * 2]:\r\n return get(x - t[v * 2], v * 2 + 1, cc, cr)\r\n else:\r\n return get(x, v * 2, cl, cc)\r\ndef put(v, val):\r\n v += base\r\n t[v] = val\r\n while v > 1:\r\n v >>= 1\r\n t[v] = t[v * 2] + t[v * 2 + 1]\r\nif __name__ == \"__main__\":\r\n n = int(sys.stdin.readline().strip())\r\n a = list(map(int, sys.stdin.readline().strip().split()))\r\n a = [x - 1 for x in a]\r\n VER = int(2e5)\r\n base = 1 << 17\r\n t = [0] * (base * 2)\r\n pos = [[] for _ in range(VER + 1)]\r\n qs = [[] for _ in range(VER + 1)]\r\n ans = [0] * (VER + 1)\r\n for i in range(n):\r\n pos[a[i]].append(i)\r\n for i in range(n):\r\n pos[i].reverse()\r\n if pos[i]:\r\n t[pos[i][-1] + base] += 1\r\n for i in range(base - 1, 0, -1):\r\n t[i] = t[i * 2] + t[i * 2 + 1]\r\n for i in range(n):\r\n qs[0].append(i + 1)\r\n for i in range(n):\r\n for k in qs[i]:\r\n to = get(k)\r\n ans[k] += 1\r\n if to < n:\r\n qs[to].append(k)\r\n qs[i].clear()\r\n put(i, 0)\r\n x = a[i]\r\n pos[x].pop()\r\n if pos[x]:\r\n put(pos[x][-1], 1)\r\n for i in range(1, n + 1):\r\n print(ans[i], end=' ')\r\n print()# 1693576767.28902", "import sys\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\ndef getRes(v):\r\n vis = [0] * (n + 1)\r\n res = 1\r\n cnt = 0\r\n cur = 0\r\n i = 0\r\n while prev[i] >= cur: i += 1\r\n while i < n:\r\n if cnt <= v:\r\n cnt += 1\r\n else:\r\n res += 1\r\n cnt = 1\r\n cur = i\r\n i += 1\r\n while prev[i] >= cur: i += 1\r\n return res\r\n\r\n\r\nac = FastIO()\r\nn = ac.read_int()\r\nnums = ac.read_list_ints()\r\n# n=100000\r\n# nums=list(range(1,n+1))\r\nidx = {}\r\nprev = [-1] * (n + 1)\r\n# prev[n]=n+1\r\nfor i in range(n):\r\n x = nums[i]\r\n if x in idx: prev[i] = idx[x]\r\n idx[x] = i\r\n\r\nres = [None] * n\r\nres[-1] = 1\r\nL = min(2 * round(n ** 0.5), n - 1)\r\nfor i in range(L + 1): res[i] = getRes(i)\r\n# exit(0)\r\nto_process = deque([[L, n - 1]])\r\nwhile to_process:\r\n l, r = to_process.popleft()\r\n if r <= l + 1: continue\r\n m = (l + r) // 2\r\n if res[m] is None:\r\n res[m] = getRes(m)\r\n if res[m] == res[l]:\r\n for i in range(l, m):\r\n res[i] = res[m]\r\n elif m > l + 1:\r\n to_process.append([l, m])\r\n if res[m] == res[r]:\r\n for i in range(m, r):\r\n res[i] = res[m]\r\n elif r > m + 1:\r\n to_process.append([m, r])\r\nprint(*res)\r\n\r\n" ]

{"inputs": ["5\n1 3 4 3 3", "8\n1 5 7 8 1 7 6 1", "10\n4 1 2 6 8 5 3 9 3 9", "85\n23 11 69 1 49 10 7 13 66 35 81 4 51 2 62 55 31 18 85 34 59 44 20 28 27 5 6 79 43 78 45 64 61 56 12 40 54 52 24 14 26 65 75 72 30 46 67 80 38 70 25 60 50 8 17 84 41 71 58 76 19 47 73 29 3 48 82 33 39 63 15 37 83 36 9 32 16 57 68 53 21 77 22 42 74", "100\n39 78 71 61 54 13 17 81 30 33 83 98 44 10 45 87 75 47 70 84 41 86 49 94 85 91 37 64 5 56 67 79 28 89 50 53 77 93 81 14 97 67 58 6 48 60 89 62 29 3 38 8 88 19 66 63 100 17 43 97 21 12 58 76 2 78 25 73 99 11 27 18 57 46 4 72 68 45 74 18 2 80 51 52 42 59 55 35 1 95 42 92 36 40 59 15 7 21 97 53", "1\n1"], "outputs": ["4 2 1 1 1 ", "8 4 3 2 1 1 1 1 ", "10 4 3 2 2 2 2 1 1 1 ", "85 43 29 22 17 15 13 11 10 9 8 8 7 7 6 6 5 5 5 5 5 4 4 4 4 4 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 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 ", "100 50 34 25 20 17 15 13 11 10 10 9 8 7 7 6 6 6 6 5 5 5 5 4 4 4 4 4 4 4 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "1 "]}

UNKNOWN

PYTHON3

CODEFORCES

2

d3e540e3910727f7dcf520e39d57d44d

Irrational problem

Little Petya was given this problem for homework: You are given function (here represents the operation of taking the remainder). His task is to count the number of integers *x* in range [*a*;*b*] with property *f*(*x*)<==<=*x*. It is a pity that Petya forgot the order in which the remainders should be taken and wrote down only 4 numbers. Each of 24 possible orders of taking the remainder has equal probability of being chosen. For example, if Petya has numbers 1, 2, 3, 4 then he can take remainders in that order or first take remainder modulo 4, then modulo 2, 3, 1. There also are 22 other permutations of these numbers that represent orders in which remainder can be taken. In this problem 4 numbers wrote down by Petya will be pairwise distinct. Now it is impossible for Petya to complete the task given by teacher but just for fun he decided to find the number of integers with property that probability that *f*(*x*)<==<=*x* is not less than 31.4159265352718281828459045%. In other words, Petya will pick up the number *x* if there exist at least 7 permutations of numbers *p*1,<=*p*2,<=*p*3,<=*p*4, for which *f*(*x*)<==<=*x*. First line of the input will contain 6 integers, separated by spaces: *p*1,<=*p*2,<=*p*3,<=*p*4,<=*a*,<=*b* (1<=≤<=*p*1,<=*p*2,<=*p*3,<=*p*4<=≤<=1000,<=0<=≤<=*a*<=≤<=*b*<=≤<=31415). It is guaranteed that numbers *p*1,<=*p*2,<=*p*3,<=*p*4 will be pairwise distinct. Output the number of integers in the given range that have the given property. Sample Input 2 7 1 8 2 8 20 30 40 50 0 100 31 41 59 26 17 43 Sample Output 0 20 9

[ "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\np1,p2,p3,p4,b,a=M()\nk=min(p1,p2,p3,p4)\nc=0\nfor i in range(b,min(k,a+1)):\n c+=1\nprint(c)\n", "q=input()\r\np1,p2,p3,p4,a,b=map(int,q.split())\r\np=min(p1,p2,p3,p4)\r\nc=0\r\nif p>b:\r\n c=b-a+1\r\nelif p>a:\r\n c=p-a\r\nelse:\r\n c=0\r\nprint(c)\r\n", "p1,p2,p3,p4,a,b = map(int,input().strip().split())\r\nm=min(min(min(p1,p2),p3),p4)\r\nif m<a:\r\n print(0)\r\nelse:\r\n t=(m-a)\r\n if b<m:\r\n t=t-(m-b-1)\r\n print(t) \r\n \r\n", "a , b , c , d , x , y = map(int,input().split())\r\nm1 = min(a,b,c,d)\r\nanswer = 0\r\nfor i in range(x,y+1):\r\n if i == i%m1:\r\n answer+=1\r\nprint(answer)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nm = min(p1, p2, p3, p4)\r\n\r\nif m - a <= 0:\r\n print(0)\r\nelif m > b:\r\n print(b-a+1)\r\nelse:\r\n print(m-a)\r\n", "from itertools import permutations\ndef compute(p1,p2,p3,p4,x):\n return (((x % p1)%p2)%p3)%p4\n\n\ndef solve(p1,p2,p3,p4,a,b):\n per = list(permutations([p1,p2,p3,p4]))\n count = 0\n for i in range(a,b+1):\n temp = 0\n for j in per:\n if i == compute(*j,i):\n temp += 1\n if temp == 7 :\n count += 1\n break\n return count\n\ndef main():\n # n = int(input())\n a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n print(solve(*a))\n\nmain()", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef main():\r\n p1,p2,p3,p4,a,b=[int(k) for k in i().split()]\r\n cnt=0\r\n l=list(itertools.permutations([p1,p2,p3,p4]))\r\n for k in range(min(a,10**3),min(b,10**3)+1):\r\n tot=0\r\n for x in l:\r\n f=((((k%x[0])%x[1])%x[2])%x[3])\r\n if f==k:\r\n tot+=1\r\n if tot>=7:\r\n cnt+=1\r\n p(str(cnt)+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "\np = []\n\np = input().split()\nfor i in range(6):\n\tp[i]=int(p[i])\n\nb = p.pop()\na = p.pop()\n\n\np.sort()\n\nif p[0]<=b:\n\tans=max(p[0]-a,0)\n\tprint(ans)\nelse:\n\tans=b-a+1\n\tprint(ans)\n\n", "import math\r\nimport string\r\n\r\ndef create_all_permutations(m, s, i):\r\n if i == len(m):\r\n return\r\n elif i == len(m) - 1:\r\n s.append(m)\r\n else:\r\n for j in range(i, len(m)):\r\n d = m.copy()\r\n d[i], d[j] = d[j], d[i]\r\n create_all_permutations(d, s, i + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n p_1, p_2, p_3, p_4, a, b = [int(i) for i in input().split(\" \")]\r\n data = sorted([p_1, p_2, p_3, p_4])\r\n permutations = []\r\n create_all_permutations(data, permutations, 0)\r\n counter = 0\r\n for i in range(a, b + 1):\r\n internal_counter = 0\r\n for j in range(len(permutations)):\r\n p_1, p_2, p_3, p_4 = permutations[j]\r\n if i == ((((i % p_1) % p_2) % p_3) % p_4):\r\n internal_counter += 1\r\n if internal_counter >= 7:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\nmain_function()\r\n", "a,b,c,d,x,y=map(int,input().split())\r\nif x>=min(a,b,c,d):\r\n print(0)\r\nelse:\r\n print(min(min(a,b,c,d),y+1)-x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from itertools import permutations\n\np1,p2,p3,p4,a,b = list(map(int,input().split()))\ncount = 0\nfor i in range(a,b+1):\n i_count = 0\n perms = permutations([p1, p2, p3, p4])\n for j in perms:\n fx = (((i%j[0])%j[1])%j[2])%j[3]\n if (fx == i):\n i_count += 1\n if (i_count >= 7):\n count += 1\nprint (count)\n\n\n\n\n", "def check_permutations(p1,p2,p3,p4,x):\r\n\ttotal=0\r\n\ts1={p1,p2,p3,p4}\r\n\tfor i in s1:\r\n\t\ta=i\r\n\t\ts2={a}\r\n\t\ts2=s1-s2\r\n\t\tfor j in s2:\r\n\t\t\tb=j\r\n\t\t\ts3={j}\r\n\t\t\ts3=s2-s3\r\n\t\t\tfor k in s3:\r\n\t\t\t\tc=k\r\n\t\t\t\ts4={k}\r\n\t\t\t\ts4=s3-s4\r\n\t\t\t\tfor z in (s4):\r\n\t\t\t\t\td=z\r\n\t\t\t\t\tif ((((x%a)%b))%c)%d==x:\r\n\t\t\t\t\t\ttotal+=1\r\n\treturn total\r\n \r\n \r\n \r\n \r\np1,p2,p3,p4,a,b = map(int,input().split())\r\nans=0\r\nfor i in range(a,b+1):\r\n\tif check_permutations(p1,p2,p3,p4,i)>=7:\r\n\t\tans+=1\r\nprint(ans)", "a,b,c,d,e,f=map(int,input().split())\r\ncount=0\r\nfor i in range(e,f+1):\r\n k=i%a%b%c%d\r\n if i==k:\r\n count+=1\r\nprint(count)", "def rec(t,k):\r\n global l,d\r\n if k==5:\r\n l.append(t[:])\r\n return\r\n else:\r\n for i in range(4):\r\n if viz[i]==0:\r\n viz[i]=1\r\n t.append(d[i])\r\n rec(t,k+1)\r\n t.pop()\r\n viz[i]=0\r\n\r\np1,p2,p3,p4,a,b=map(int,input().split())\r\nd=[p1,p2,p3,p4]\r\nviz=[0,0,0,0]\r\nl=[]\r\nrec([],1)\r\nans=0\r\nfor i in range(a,b+1):\r\n k=0\r\n for j in l:\r\n t=i\r\n \r\n for z in j:\r\n t%=z\r\n if t==i:\r\n k+=1\r\n if k>=7:\r\n ans+=1\r\nprint(ans)\r\n", "*p, a, b = map(int, input().split())\r\nprint(sum(1 for i in range(a, b + 1) if i < min(p)))\r\n", "from itertools import permutations\r\np = list(map(int, input().split()))\r\na, b = p[-2], p[-1]\r\np = p[:-2]\r\nans = 0\r\nfor x in range(a, b + 1):\r\n cnt = 0\r\n for perm in permutations(p):\r\n if x == (((x % perm[0]) % perm[1]) % perm[2]) % perm[3]:\r\n cnt += 1\r\n if cnt >= 7:\r\n ans += 1\r\nprint(ans)# 1698341614.3284554", "from functools import reduce\r\n\r\ninp=input().split()\r\np=[int(inp[0]),int(inp[1]),int(inp[2]),int(inp[3])]\r\na=int(inp[4])\r\nb=int(inp[5])\r\nn=0\r\nfor i in range(a,b+1):\r\n if reduce((lambda a,b : a%b), [i]+p) == i:\r\n n+=1\r\nprint(n)\r\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\np1,p2,p3,p4,a,b = readints()\nmods = [p1,p2,p3,p4]\nx = min(mods) \nprint(max(-1,min(x-1,b)-a)+1)\n\n \t \t\t \t \t\t\t\t\t \t \t\t\t\t \t \t", "p = [int(x) for x in input().split()]\nmod = min(p[0:4])\nif mod < p[4]:\n print(0)\nelse:\n if mod > p[5]:\n print(p[5] - p[4] + 1)\n else:\n print(mod - p[4])\n", "# LUOGU_RID: 101453572\np1, p2, p3, p4, a, b = map(int, open(0).read().split())\r\nprint(sum(x % p1 == x % p2 == x % p3 == x % p4 == x for x in range(a, b + 1)))", "p1, p2, p3, p4, a, b = map(int, input().split())\n\nprint(max(0, min(p1, p2, p3, p4, b + 1) - a))", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\ntmp = min(p1, p2, p3, p4)\r\n\r\nif tmp <= b:\r\n ans = tmp - a\r\nelse:\r\n ans = b-a+1\r\n\r\n\r\n\r\n\r\n\r\nif ans < 0:\r\n ans = 0\r\n\r\nprint(ans)", "a=list(map(int,input().split()))\r\ndef f(x):\r\n return ((((x % a[0]) % a[1]) % a[2]) % a[3])\r\nans=0\r\nfor x in range(a[4], a[5]+1):\r\n if f(x)==x:\r\n ans+=1\r\nprint(ans)\r\n", "l=list(map(int,input().split()))\r\nc=0\r\nfor i in range(l[4],l[5]+1):\r\n for k in range(4):\r\n z=i%l[0]\r\n for j in range(1,3):\r\n z=z%l[j]\r\n for m in range(2,4):\r\n z=z%l[m]\r\n z=z%l[5-m]\r\n if z==i:\r\n c+=1\r\nprint(c)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\np = min(p1, p2, p3, p4)\r\n\r\nans = 0\r\n\r\nfor i in range(a, b+1):\r\n if i%p == i:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "import itertools\n\ndef q68a():\n\tp1, p2, p3, p4, low, high = tuple([int(num) for num in input().split()])\n\tp = list(itertools.permutations([p1, p2, p3, p4], 4))\n\tnum_good = 0\n\tfor i in range(low, high+1):\n\t\tcount = 0\n\t\tfor t in p:\n\t\t\tif(i == q68a_mod_operation(i, t[0], t[1], t[2], t[3])):\n\t\t\t\tcount += 1\n\t\tif(count >= 7):\n\t\t\tnum_good += 1\n\tprint(num_good)\n\ndef q68a_mod_operation(num, a, b, c, d):\n\treturn (((num % a) % b) % c) % d\n\nq68a()", "a,b,c,d,e,f=map(int,input().split())\r\nb=min(a,b,c,d)\r\nif b>f:\r\n b=f+1\r\nprint(len([1 for i in range(e,b)]))", "import math\r\np1,p2,p3,p4,a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a,b+1):\r\n if (((i%p1)%p2)%p3)%p4==i:\r\n c+=1\r\nprint (c) \r\n", "import itertools\n\np1, p2, p3, p4, a, b = map(int, input().split())\npermutations = list(itertools.permutations([p1, p2, p3, p4]))\nresult = 0\n\nfor x in range(a, b+1):\n count = 0\n for permutation in permutations:\n y = x\n for p in permutation:\n y %= p\n if y == x:\n count += 1\n if count >= 7:\n result += 1\n\nprint(result)\n", "s=input().split()\np1=int(s[0]);p2=int(s[1]);p3=int(s[2]);p4=int(s[3]);a=int(s[4]);b=int(s[5])\nans=0\nfor i in range(a,b+1):\n if i%p1%p2%p3%p4==i:\n ans+=1\nprint(ans)", "x1,x2,x3,x4,a,b = map(int,input().split(' '))\r\nminValue = min(x1,x2,x3,x4)\r\nif(b<minValue):\r\n print(b-a+1)\r\nelse:\r\n print(max(0,minValue-a))", "import math\r\nimport random\r\nimport itertools\r\n\r\ndef f(x, u1, u2, u3, u4):\r\n val = (((x % u1)%u2)%u3)%u4\r\n return val == x\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split(' '))\r\n\r\nmacht = 0\r\nfor i in range(a, b+1):\r\n total = 0\r\n for perm in itertools.permutations([p1, p2, p3, p4]):\r\n if f(i, perm[0], perm[1], perm[2], perm[3]):\r\n total+=1\r\n if total>=7:\r\n macht+=1\r\n\r\nprint(macht)", "import itertools\r\nl = []\r\ncont = 0\r\nr = 0\r\nl1 = list(map(int,input().strip().split()))[:6]\r\nl = l1[0:4]\r\nab = l1[4:6]\r\n\r\nfor x in range(ab[0],ab[1]+1):\r\n perm = itertools.permutations(l)\r\n for i in list(perm):\r\n if ((((x % i[0]) % i[1]) % i[2]) % i[3]) == x:\r\n cont += 1\r\n if cont >= 7:\r\n r += 1\r\n cont = 0\r\nprint (r)", "\np1, p2, p3, p4, a, b = map(int, input().split())\np_min = min(p1, p2, p3, p4)\nresult = 0\n\nfor x in range(a, b+1):\n if x == x % p_min:\n result += 1\n\nprint(result)\n", "from itertools import permutations\n\n\nclass CodeforcesTask68ASolution:\n def __init__(self):\n self.result = ''\n self.pppp_a_b = []\n\n def read_input(self):\n self.pppp_a_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n prop = [0] * (1 + self.pppp_a_b[-1] - self.pppp_a_b[-2])\n for st in permutations(self.pppp_a_b[:4]):\n f = lambda x: (((x % st[0]) % st[1]) % st[2]) % st[3]\n for y in range(self.pppp_a_b[-2], self.pppp_a_b[-1] + 1):\n if f(y) == y:\n prop[y - self.pppp_a_b[-2]] += 1\n has_prop = [1 if x >= 7 else 0 for x in prop]\n self.result = str(sum(has_prop))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask68ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "p1,p2,p3,p4,a,b=map(int,input().split())\r\nl=[p1,p2,p3,p4]\r\ncount=0\r\nfor i in range(a,b+1):\r\n r=i\r\n for j in l:\r\n r=r%j\r\n if r==i:\r\n count+=1\r\n\r\nprint(count)", "p1, p2, p3, p4, a, b = map(int, input().split())\nc = 0\nfor i in range(a, b+1):\n if i % p1 == i:\n if i % p2 == i:\n if i % p3 == i:\n if i % p4 == i:\n c += 1\nprint(c)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nc = 0\r\nfor i in range(a, b+1):\r\n if i%p1%p2%p3%p4 == i:\r\n c += 1\r\nprint(c)", "p1, p2,p3,p4, a,b = map(int,input().split())\n\ncnt = 0\n\nfor x in range(a,b+1):\n ans = (((x%p1)%p2)%p3)%p4\n if x == ans:\n cnt+=1\n\nprint(cnt)\n\n \t \t \t\t\t\t\t \t \t\t \t\t \t\t\t\t\t", "from time import *\n\n\nif __name__ == \"__main__\" :\n # start = time()\n p1 , p2 , p3 , p4 , a , b = map(int,input().strip().split())\n count = 0\n for i in range(a , b + 1) :\n if ((((i % p1)% p2)% p3) % p4) == i :\n count += 1\n print(count)\n # print(time() - start)\n", "inp = [int(x) for x in input().split()]\r\np = inp[:4]\r\na,b = inp[4],inp[5]\r\np = min(p)\r\ncnt = 0\r\nfor i in range(a,b+1):\r\n if i%p==i:\r\n cnt+=1\r\nprint(cnt)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\nprint(sum(1 for i in range(a, b + 1) if i % p1 % p2 % p3 % p4 == i))\r\n", "a,b,c,d,x,y=map(int, input().split())\r\ncontador=0\r\nwhile (x<=y):\r\n if(x%a%b%c%d==x):\r\n contador=contador+1\r\n x=x+1\r\nprint(contador)\r\n", "p1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\nminP = min(p1, min(p2, min(p3, p4)))\r\n\r\noutput = 0\r\nif a <= minP <= b:\r\n output = minP - a\r\nelif minP > b:\r\n output = b - a + 1\r\n\r\nprint(output)", "p1,p2,p3,p4,a,b=map(int,input().split())\r\nm=min(p1,p2,p3,p4)\r\nif m-a<=0:\r\n\tprint(0)\r\nelse:\r\n\tif m>b:\r\n\t\tprint(b-a+1)\r\n\telse:\r\n\t\tprint(m-a)", "def readln(): return tuple(map(int, input().split()))\n\ninp = readln()\nmod = min(inp[:4])\nprint(len([_ for _ in range(inp[4], inp[5] + 1) if _ < mod]))\n", "mylist=list(map(int,input().split()))\r\na=0\r\nb=min(mylist[:4:]) - mylist[4]\r\nif(b>=0):\r\n a=min(b,mylist[5]-mylist[4]+1)\r\nprint(a)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\nfrom itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\ndef function(x, lst):\r\n permu = permutations(lst, len(lst))\r\n count_ = 0\r\n for i in permu:\r\n temp = (((x % i[0]) % i[1]) % i[2]) % i[-1]\r\n if temp == x:\r\n count_ += 1\r\n if count_ >= 7:\r\n return True\r\n if count_ < 7:\r\n return False\r\n\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\narr = [p1, p2, p3, p4]\r\ncount = 0\r\nfor i in range(a, b+1):\r\n if function(i, arr):\r\n count += 1\r\nprint(count)\r\n", "p1,p2,p3,p4,a,b = map(int,input().split())\r\ncount = 0\r\nfor i in range(a,b+1):\r\n k = (((i%p1)%p2)%p3)%p4\r\n if i==k:\r\n count+=1\r\nprint(count)", "p1,p2,p3,p4,a,b = map(int,input().split())\r\nremainder = 0\r\nfor i in range(a,b+1):\r\n if i < min([p1,p2,p3,p4]): #f(x)=x,当i<pmin时即可\r\n remainder += 1\r\n else:\r\n pass\r\nprint(remainder)", "s = list(map(int, input().split()))\r\nlis = [s[0]]\r\nfor i in range(1,4):\r\n if s[i]<s[i-1]:lis.append(s[i])\r\ncnt = 0\r\nfor i in range(s[4], s[5]+1):\r\n m = i\r\n for j in lis:\r\n m = m%j\r\n if m == i: cnt += 1\r\nprint(cnt)", "a,b,c,d,e,f = map(int,input().split())\ng = min([a,b,c,d])\nif e==f==0:\n print(1)\nelse:\n if g>f:\n print(f-e+1)\n else:\n print(max(0,min(g,f)-e))\n", "p1, p2, p3, p4, a, b = [int(i) for i in input().split()]\r\nprint(max(0, min(p1, p2, p3, p4, b + 1) - a))\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nfrom itertools import permutations\r\np1,p2,p3,p4,a,b = get_int_list()\r\nm = 0\r\nfor p in permutations([p1,p2,p3,p4]):\r\n count = 0\r\n for i in range(a,b+1):\r\n if i == (((i%p[0])%p[1])%p[2])%p[3]:\r\n count += 1\r\n m = max(m,count)\r\nprint(m)", "# LUOGU_RID: 98061811\na=input()\r\nb=a.split(' ')\r\nb[0]=int(b[0])\r\nb[1]=int(b[1])\r\nb[2]=int(b[2])\r\nb[3]=int(b[3])\r\nb[4]=int(b[4])\r\nb[5]=int(b[5])\r\nsumm=0\r\nwhile(b[4]<=b[5]):\r\n if(b[4]%b[0]==b[4] and b[4]%b[3]==b[4] and b[4]%b[2]==b[4] and b[4]%b[1]==b[4]):\r\n summ+=1\r\n b[4]+=1\r\nprint(summ)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\np1,p2,p3,p4,a,b=(int(i) for i in input().split())\r\nprint(max(min(b-a+1,min(p1,p2,p3,p4)-a),0))", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n\r\np1,p2,p3,p4,a,b=I()\r\nl=list(permutations([p1,p2,p3,p4]))\r\nans=0\r\nfor i in range(a,b+1):\r\n c=0\r\n for j in range(24):\r\n a,x=list(l[j]),i\r\n for y in a:\r\n x=x%y\r\n if x==i: c+=1 \r\n if c>=7: ans+=1 \r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "from itertools import permutations as per\r\n\r\np1, p2, p3, p4, a, b = map(int, input().split())\r\n\r\np = list(per([p1, p2, p3, p4], 4))\r\n\r\nx = 0\r\n\r\nfor i in range(a, b + 1):\r\n\tc = 0\r\n\t\r\n\tfor j in p:\r\n\t\tif (((i % j[0]) % j[1]) % j[2]) % j[3] == i:\r\n\t\t\tc += 1\r\n\t\t\t\r\n\tif c >= 7:\r\n\t\tx += 1\r\n\t\t\r\nprint(x)", "p1, p2, p3, p4, a, b = map(int, input().split())\r\np = min([p1, p2, p3, p4])\r\nprint(0 if p < a else min(p-1, b) - a + 1)", "l=list(map(int,input().split()))\r\nx=min(l[:4])\r\nif x>l[5]:\r\n print(l[5]-l[4]+1)\r\nelif x>=l[4]:\r\n print(x-l[4])\r\nelse:\r\n print(\"0\")\r\n", "def f(x):\r\n return (((x%p1)%p2)%p3)%p4\r\np1,p2,p3,p4,a,b = map(int,input().split())\r\nans = 0\r\nfor i in range(a,b+1):\r\n if f(i) == i: ans += 1\r\nprint(ans)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:25:05\nLastEditTime: 2021-11-02 23:29:48\nDescription: \nFilePath: CF68A.py\n'''\n\n\ndef func():\n *lst, a, b = map(int, input().strip().split())\n count = 0\n for i in range(a, b + 1):\n for item in lst:\n if i % item != i:\n break\n else:\n count += 1\n return count\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "*l, a, b = map(int, input().split())\r\nprint(max(0, min(b + 1, *l) - a))" ]

{"inputs": ["2 7 1 8 2 8", "20 30 40 50 0 100", "31 41 59 26 17 43", "1 2 3 4 0 0", "1 2 3 4 1 1", "1 2 999 1000 30 40", "17 18 19 20 17 20", "17 18 19 20 16 20", "41 449 328 474 150 709", "467 329 936 440 117 700", "258 811 952 491 931 993", "823 431 359 590 153 899", "292 370 404 698 699 876", "442 705 757 527 868 893", "642 273 18 885 675 788", "291 303 656 660 126 704", "225 862 522 617 630 725", "17 847 715 732 502 778", "41 449 328 474 15724 19169", "467 329 936 440 5705 28145", "258 811 952 491 2995 11942", "823 431 359 590 153 3902", "292 370 404 698 19718 19895", "442 705 757 527 1869 19912", "642 273 18 885 23811 28703", "291 303 656 660 7711 15141", "225 862 522 617 1246 1341", "17 847 715 732 778 27529", "997 998 999 1000 0 31415", "1 2 3 4 0 31415", "541 931 822 948 131 193", "956 800 909 916 89 194", "735 794 942 991 419 490", "818 926 827 575 153 395", "792 858 887 679 179 356", "937 683 742 515 366 373", "616 747 501 875 146 264", "760 773 638 655 111 196", "697 855 997 589 97 192", "998 834 706 722 277 475", "100 101 102 103 10 20"], "outputs": ["0", "20", "9", "1", "0", "0", "0", "1", "0", "212", "0", "206", "0", "0", "0", "165", "0", "0", "0", "0", "0", "206", "0", "0", "0", "0", "0", "0", "997", "1", "63", "106", "72", "243", "178", "8", "119", "86", "96", "199", "11"]}

UNKNOWN

PYTHON3

CODEFORCES

63

d41eccdddbe3022c0a46f60c8badcf60

Abbreviation

You are given a text consisting of $n$ space-separated words. There is exactly one space character between any pair of adjacent words. There are no spaces before the first word and no spaces after the last word. The length of text is the number of letters and spaces in it. $w_i$ is the $i$-th word of text. All words consist only of lowercase Latin letters. Let's denote a segment of words $w[i..j]$ as a sequence of words $w_i, w_{i + 1}, \dots, w_j$. Two segments of words $w[i_1 .. j_1]$ and $w[i_2 .. j_2]$ are considered equal if $j_1 - i_1 = j_2 - i_2$, $j_1 \ge i_1$, $j_2 \ge i_2$, and for every $t \in [0, j_1 - i_1]$ $w_{i_1 + t} = w_{i_2 + t}$. For example, for the text "to be or not to be" the segments $w[1..2]$ and $w[5..6]$ are equal, they correspond to the words "to be". An abbreviation is a replacement of some segments of words with their first uppercase letters. In order to perform an abbreviation, you have to choose at least two non-intersecting equal segments of words, and replace each chosen segment with the string consisting of first letters of the words in the segment (written in uppercase). For example, for the text "a ab a a b ab a a b c" you can replace segments of words $w[2..4]$ and $w[6..8]$ with an abbreviation "AAA" and obtain the text "a AAA b AAA b c", or you can replace segments of words $w[2..5]$ and $w[6..9]$ with an abbreviation "AAAB" and obtain the text "a AAAB AAAB c". What is the minimum length of the text after at most one abbreviation? The first line of the input contains one integer $n$ ($1 \le n \le 300$) — the number of words in the text. The next line contains $n$ space-separated words of the text $w_1, w_2, \dots, w_n$. Each word consists only of lowercase Latin letters. It is guaranteed that the length of text does not exceed $10^5$. Print one integer — the minimum length of the text after at most one abbreviation. Sample Input 6 to be or not to be 10 a ab a a b ab a a b c 6 aa bb aa aa bb bb Sample Output 12 13 11

[ "# https://codeforces.com/contest/1003\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input())\ns = input()\n\n# word list\nw = s.split()\n\n# dict: word to index\nwd = {}\nfor x in w:\n if x not in wd:\n wd[x] = len(wd)\n\n# number of distinct words\nnw = len(wd)\n\n# length of i-th word\nwl = [0] * nw\nfor word, idx in wd.items():\n wl[idx] = len(word)\n\n# translate word list to list of word indices\nw = [wd[x] for x in w]\n\nmax_savings = 0\n\n\ndef next_segment(orig, k, start):\n while start + k <= n:\n ok = True\n for i in range(k):\n if w[orig + i] != w[start + i]:\n ok = False\n break\n if ok:\n return start\n start += 1\n return -1\n\n\nfor i in range(n):\n for k in range(1, n // 2 + 1):\n if i + k >= n:\n break\n c = 1\n pos = i + k\n while True:\n j = next_segment(i, k, pos)\n if j == -1:\n break\n c += 1\n pos = j + k\n if c >= 2:\n savings = c * (sum(wl[w[i + j]] for j in range(k)) - 1)\n max_savings = max(max_savings, savings)\n\nprint(len(s) - max_savings)\n", "n = int(input())\r\nW = list(map(str, input().split()))\r\n\r\nallSum = n-1\r\nfor w in W:\r\n allSum += len(w)\r\n\r\neq = [[False]*n for i in range(n)]\r\nfor i in range(n):\r\n eq[i][i] = True\r\n for j in range(i):\r\n eq[i][j] = (W[i]==W[j])\r\n eq[j][i] = (W[i]==W[j])\r\n\r\ndp = [[0]*n for i in range(n)]\r\nfor i in range(n-1, -1, -1):\r\n for j in range(n-1, -1, -1):\r\n if eq[i][j]:\r\n if i+1 < n and j+1 < n:\r\n dp[i][j] = dp[i+1][j+1]+1\r\n else:\r\n dp[i][j] = 1\r\nans = allSum\r\n\r\nfor i in range(n):\r\n s = 0\r\n for j in range(n-i):\r\n s += len(W[i+j])\r\n cnt = 1\r\n pos = i+j+1\r\n while pos < n:\r\n if dp[i][pos] > j:\r\n cnt += 1\r\n pos += j\r\n pos += 1\r\n cur = allSum-s*cnt+(j+1)*cnt-j*cnt\r\n if cnt > 1 and ans > cur:\r\n ans = cur\r\n\r\nprint(ans)\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef z_algorithm():\r\n m = len(w)\r\n z = [0] * m\r\n z[0] = m\r\n i, j = 1, 0\r\n while i < m:\r\n while i + j < m and w[j] == w[i + j]:\r\n j += 1\r\n z[i] = j\r\n if not j:\r\n i += 1\r\n continue\r\n l = 1\r\n while l < j and l + z[l] < j:\r\n z[i + l] = z[l]\r\n l += 1\r\n i += l\r\n j -= l\r\n return z\r\n\r\nn = int(input())\r\nw = list(input().rstrip().split())\r\na = [len(w[i]) for i in range(n)]\r\nb = [0]\r\nfor i in a:\r\n b.append(i + b[-1])\r\ns = b[n] + n - 1\r\nans = s\r\nfor i in range(n):\r\n z = z_algorithm()\r\n m = 0\r\n for j in range(1, n - i):\r\n k, c = 0, 0\r\n while k < n - i:\r\n if z[k] >= j:\r\n c += 1\r\n k += j\r\n else:\r\n k += 1\r\n if c > 1:\r\n m = max(m, c * (b[i + j] - b[i] - 1))\r\n ans = min(ans, s - m)\r\n w = deque(w)\r\n w.popleft()\r\n w = list(w)\r\nprint(ans)" ]

{"inputs": ["6\nto be or not to be", "10\na ab a a b ab a a b c", "6\naa bb aa aa bb bb", "45\nxr l pl sx c c u py sv j f x h u y w w bs u cp e ad ib b tz gy lm e s n ln kg fs rd ln v f sh t z r b j w of", "250\nf r s d b f f k d e k v m b t k k j t t a o m m s n d w l v g e k x d w k v a j h c a g x s d e t z z w q z d h n r i k b z k u s q l k c v o d o w w c y i a q v r i g i m l b x z h t a i j t h q u e v j o h w m o v k g r r x j a c m z z i s i r a p p i i l e i g m f f f y v k m c l p n n n j j u t t q s o y b t m x n n t z f c g s r f h w z b b d q d y h t v g y e w p l n m f v c s b r g p v w z c o h k u r c g c s v w r t w k z v t v y z i x r f o l e o u q z k x c o l e c b d j v f z y e r k", "1\nu", "1\nvpdgzvgvgbichiiqdhytvcooetcgeecyueoylqzbtzzgaqhalt", "1\nxdhlmtnvecsbwbycahddxnvwpsxwxgfmidfetpkpeevpjzfbgfafbjpyuevupuptoxutnketcxwrllooyxtxjzwxpzcbpiqzeiplcqvdxyyznjxgkwstpxogdihsamoqhyspbjlelxpbarzqawsgidjtmnpmmupohnslirorliapvntasudhpuuxynyoipuqxdiysbyctpmfpbxqfdlmlsmsvtbxoypkbhwrtpwbsbcdhypsbqhqpdlilquppdwsszrpavcowudreygmpwckbzlpnxxqxjdpqmtidjatvgcbxjrpqqxhhsvlpyxxkoqxutsvebrlxqeggvsnshetkpnfygpwbmnuujfvqnlgavwppufxadhxtffsrdknfmqbsjjegcwokbauzivhnldkvykkytkyrwhimmkznkkofcuioqmpbshskvdhsetyidubcgvuerbozqfbkcmaguaszaivtuswzmtnqcpoiqlvronibiqyeoqm", "2\nvjrvahvokiudpiocpvoqsqhukavyrckhcbctr prqxizcofrfr", "2\nxxwxpgalijfbdbdmluuaubobxztpkfn parzxczfzchinxdtaevbepdxlouzfzaizkinuaufhckjvydmgnkuaneqohcqocfrsbmmohgpoacnqlgspppfogdkkbrkrhdpdlnknjyeccbqssqtaqmyamtkedlhpbjmchfnmwhxepzfrfmlrxrirbvvlryzmulxqjlthclocmiudxbtqpihlnielggjxjmvqjbeozjpskenampuszybcorplicekprqbsdkidwpgwkrpvbpcsdcngawcgeyxsjimalrrwttjjualmhypzrmyauvtothnermlednvjbpgkehxbtbpxolmaapmlcuetghikbgtaspqesjkqwxtvccphjdqpuairsaypfudwvelmupbzhxwuchnfumcxmhflkpyzeppddtczbcjrookncgtojmujyvponennuudppqwwjtnwpgapokwzvbxohrdcvcckzbcrwwvfqlbnwbnmmv", "4\ncongratulations for being first", "4\njngen hype xfckaovxfckaovxfckaovxfckaovxfckaovfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwzxfckaovxfckaovfegkbwzfegkbwzfegkbwz fegkbwzxfckaovfegkbwzxfckaovxfckaovxfckaovfegkbwzfegkbwzxfckaovxfckaovxfckaovfegkbwzfegkbwzxfckaovxfckaovxfckaovxfckaovxfckaovxfckaovfegkbwzxfckaov", "4\njngen hype acpumodacpumodacpumodulhiwuoulhiwuoulhiwuoacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodulhiwuoacpumodacpumodulhiwuoacpumodulhiwuoacpumod ulhiwuoulhiwuoacpumodacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodacpumodacpumodacpumodacpumodulhiwuoulhiwuoulhiwuoulhiwuoacpumodulhiwuo", "4\nraraaraaarrraraaaaaaaaaaaaaaaaraaraararaarraarrraaarrarrraaaarrrarrrrraaraaaarrararrarraarrrararaaar arrararaararaarraaaraararraararaarrraarrrarrrrarrraaaaraaraaaaaaaraaararrarararrarrraarrarrrrraaaaar arrararaararaarraaaraararraararaarrraarrrarrrrarrraaaaraaraaaaaaaraaararrarararrarrraarrarrrrraaaaar raraaraaarrraraaaaaaaaaaaaaaaaraaraararaarraarrraaarrarrraaaarrrarrrrraaraaaarrararrarraarrrararaaar", "4\njngen hype wlvgjpibylpibylwlvgjpibylwlvgjwlvgjwlvgjwlvgjwlvgjpibylwlvgjwlvgjpibylpibylpibylwlvgjpibylpibyl pibylpibylpibylpibylpibylwlvgjwlvgjpibylwlvgjwlvgjpibylpibylwlvgjwlvgjwlvgjpibylwlvgjpibylwlvgj", "29\nqiozjl ghgehr xewbil hwovzr keodgb foobar dvorak barfoo xjjfgm wybwaz jizzzz jizzij tjdqba jiyiqj jizziz inforr icagmg jizjiz tdxtfv jhkhdw pgvlzq qvfpbx ymhmll kzaodh xccnda ugywmk jijizz lkkhfs qwerty", "4\naahahhhaaaaaahhaaahaaahahhhahahhhhhhahhahhhhhhahah ahaahahahaaaahahahaaahaaaahhhaaahhahaaahhaahhaaaah ahaahahahaaaahahahaaahaaaahhhaaahhahaaahhaahhaaaah aahahhhaaaaaahhaaahaaahahhhahahhhhhhahhahhhhhhahah", "4\naaaahaaahahhaaahaaahaahhhahhaaaaahahaahaahaahhaaha hhahhahhaaahhhhhhhhahhhhahaahhhaahhahhhhaahahhhhaa hhahhahhaaahhhhhhhhahhhhahaahhhaahhahhhhaahahhhhaa aaaahaaahahhaaahaaahaahhhahhaaaaahahaahaahaahhaaha", "4\njngen hype flnhgpflnhgpwdxrlvwdxrlvflnhgpwdxrlvflnhgpwdxrlvflnhgpwdxrlvflnhgpflnhgpwdxrlvflnhgpflnhgpflnhgpwdxrlvflnhgp wdxrlvwdxrlvflnhgpwdxrlvflnhgpflnhgpflnhgpwdxrlvflnhgpwdxrlvwdxrlvflnhgpflnhgpwdxrlvflnhgpflnhgpflnhgpflnhgp", "40\naanvs aaikp afkib abrzm abnrq aaxdo aaqxz aalhq afhrw aeets acmlb aazzc acphl aanlr abdfc aatdv adfxe abrud acare abbao aauui aacyx aannq aafwd adirh aafiz accgm aalfz aeeac abrja acfkl aabmr aayub aairn acoqw aavlo afgjf aetbp acbbx abmqy", "2\nrmdkgswpghuszbnq oveleebkwopbnmbr", "2\naisajfcrtzfmrpth fninkxwvnqzjvfdq", "40\naclsp aafgb abvlq aazfz aajjt aacts acbfz aawkl abozz aawlg acmre aapqu acodc aaapn aezbx abhjl adhdt aauxj afggb aafbm acbah abgbo abafl aazow acfwx ablad acifb aayly aemkr acsxa aeuzv abvqj actoq aazzc aayye aaxpo advso aanym abtls aahre", "4\njngen hypee acpumodacpumodacpumodulhiwuoulhiwuoulhiwuoacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodulhiwuoacpumodacpumodulhiwuoacpumodulhiwuoacpumod ulhiwuoulhiwuoacpumodacpumodacpumodulhiwuoulhiwuoacpumodulhiwuoacpumodacpumodacpumodacpumodacpumodulhiwuoulhiwuoulhiwuoulhiwuoacpumodulhiwuo", "7\na a b a a a b", "13\nv w s e n g j m g v g o asdf", "2\nxnnlpp jpymdh"], "outputs": ["12", "13", "11", "106", "495", "1", "50", "500", "50", "500", "31", "306", "292", "205", "202", "202", "105", "105", "228", "239", "33", "33", "239", "293", "9", "28", "13"]}

UNKNOWN

PYTHON3

CODEFORCES

3

d44b54a5c176b8db281df28c230f992d

Beautiful Numbers

Vitaly is a very weird man. He's got two favorite digits *a* and *b*. Vitaly calls a positive integer good, if the decimal representation of this integer only contains digits *a* and *b*. Vitaly calls a good number excellent, if the sum of its digits is a good number. For example, let's say that Vitaly's favourite digits are 1 and 3, then number 12 isn't good and numbers 13 or 311 are. Also, number 111 is excellent and number 11 isn't. Now Vitaly is wondering, how many excellent numbers of length exactly *n* are there. As this number can be rather large, he asks you to count the remainder after dividing it by 1000000007 (109<=+<=7). A number's length is the number of digits in its decimal representation without leading zeroes. The first line contains three integers: *a*, *b*, *n* (1<=≤<=*a*<=<<=*b*<=≤<=9,<=1<=≤<=*n*<=≤<=106). Print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7). Sample Input 1 3 3 2 3 10 Sample Output 1 165

[ "import sys, threading\nimport math\nfrom os import path\nfrom collections import deque, defaultdict, Counter\nfrom bisect import *\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\nfrom random import randint\nfrom heapq import *\nfrom array import array\nfrom types import GeneratorType\n \n \ndef readInts():\n x = list(map(int, (sys.stdin.readline().rstrip().split())))\n return x[0] if len(x) == 1 else x\n \n \ndef readList(type=int):\n x = sys.stdin.readline()\n x = list(map(type, x.rstrip('\\n\\r').split()))\n return x\n \n \ndef readStr():\n x = sys.stdin.readline().rstrip('\\r\\n')\n return x\n \n \nwrite = sys.stdout.write\nread = sys.stdin.readline\n \n \nMAXN = 1123456\n\n\ndef bootstrap(f, stack=[]):\n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n return wrappedfunc\n\n\nclass mydict:\n def __init__(self, func=lambda: 0):\n self.random = randint(0, 1 << 32)\n self.default = func\n self.dict = {}\n \n def __getitem__(self, key):\n mykey = self.random ^ key\n if mykey not in self.dict:\n self.dict[mykey] = self.default()\n return self.dict[mykey]\n \n def get(self, key, default):\n mykey = self.random ^ key\n if mykey not in self.dict:\n return default\n return self.dict[mykey]\n \n def __setitem__(self, key, item):\n mykey = self.random ^ key\n self.dict[mykey] = item\n \n def getkeys(self):\n return [self.random ^ i for i in self.dict]\n \n def __str__(self):\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\n\n \ndef lcm(a, b):\n return (a*b)//(math.gcd(a,b))\n \n \ndef mod(n):\n return n%(1000000007) \n\n\ndef power(bas, exp):\n if (exp == 0):\n return 1\n if (exp == 1):\n return bas\n \n \n if (exp % 2 == 0):\n t = power(bas, exp // 2)\n t = mod(t * t)\n return t \n\n else:\n return mod(power(bas, exp-1)*bas)\n\n\nfactr = []\nfactr = [1]\nfact = 1\nfor i in range(1, MAXN):\n fact = mod(mod(fact)*mod(i))\n factr.append(fact)\n \ndef nCr(n, r):\n\n if r > n:\n return 0\n\n n1 = factr[n]\n d1 = power(factr[r], 1000000005)\n d2 = power(factr[n-r], 1000000005)\n\n return mod(mod(n1)*mod(d1)*mod(d2))\n\n\ndef solve(t):\n # print(f'Case #{t}: ', end = '')\n a, b, n = readInts()\n ans = 0\n for i in range(n+1):\n sm = i*a + b*(n-i)\n st = set(str(sm))\n st.discard(str(a))\n st.discard(str(b))\n if len(st) > 0:\n continue\n\n ans = mod(ans + nCr(n, i))\n\n print(ans)\n\n\ndef main():\n t = 1\n if path.exists(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/input.txt\"):\n sys.stdin = open(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/input.txt\", 'r')\n sys.stdout = open(\"/Users/arijitbhaumik/Library/Application Support/Sublime Text/Packages/User/output.txt\", 'w')\n # sys.setrecursionlimit(100000) \n # t = readInts()\n for i in range(t):\n solve(i+1)\n \n \nif __name__ == '__main__':\n main() ", "#input\r\na,b,n=map(int,input().split())\r\ndic={0:1}\r\nm=10**9+7\r\n#if it were multiple testcases then we would have precomputed upto 10**6\r\nfor i in range(1,n+1):\r\n dic[i]=(dic[i-1]*i)%m\r\n\r\ndef modExp(a,n,m=10**9+7):\r\n if n==0:\r\n return 1\r\n elif n==1:\r\n return a\r\n else:\r\n while n>=2:\r\n if n%2==0:\r\n n=n//2\r\n return modExp(((a%m)*(a%m))%m,n,m)\r\n else:\r\n n=(n-1)//2\r\n return ((a%m)*modExp(((a%m)*(a%m))%m,n,m)%m)%m\r\n\r\ndef nCr(n,r):\r\n return (dic[n]*modExp(dic[n-r],m-2)*modExp(dic[r],m-2))%m\r\n\r\n\r\nout=0\r\nfor i in range(n+1):\r\n op=str(a*i+b*(n-i))\r\n for j in op:\r\n if j!=str(a) and j!=str(b):\r\n break\r\n else:\r\n out+=nCr(n,i)\r\n out=out%m\r\nprint(out)\r\n ", "ans = 0\nmod = 1000000007\na, b, n = map(int, input().split())\ns = set()\nfor x in range(2, 1 << 8):\n z = 0\n while x > 1:\n z = z * 10 + (a, b)[x & 1]\n x >>= 1\n s.add(z)\nf = [1] * (n + 1)\nfor i in range(1, n + 1):\n f[i] = f[i - 1] * i % mod\nfor x in range(n + 1):\n if x * a + (n - x) * b in s:\n ans += pow(f[x] * f[n - x], mod - 2, mod)\n ans %= mod\nprint(ans * f[n] % mod)\n\n \t \t \t \t \t\t\t\t\t \t \t \t\t", "mod = 10 ** 9 + 7\r\na, b, n = map(int, input().split())\r\nN1 = n + 1\r\nfac = [1]\r\nfor nn in range(1, N1):\r\n fac.append(nn * fac[-1] % mod)\r\nfac_inv = [pow(fac[-1], mod - 2, mod)]\r\nfor nn in range(N1 - 1, 0, -1):\r\n fac_inv.append(fac_inv[-1] * nn % mod)\r\nfac_inv.reverse()\r\ncnt = 0\r\ndiff = b - a\r\nstart = a * n\r\nsab = {str(a), str(b)}\r\nfor i in range(N1):\r\n s = str(start)\r\n for j in s:\r\n if j not in sab:\r\n break\r\n else:\r\n cnt = (cnt + fac[n] * fac_inv[i] * fac_inv[n - i]) % mod\r\n start += diff\r\nprint(cnt)", "class Combinator:\r\n def __init__(self, n, N):\r\n self.n = n\r\n self.N = N\r\n self._compute_factorials()\r\n\r\n def combination(self, k):\r\n # return C(n, k) % N = n! / (k! * n_b!) % N\r\n return (self.factorials[self.n] * self._inv(k)) % self.N\r\n\r\n def _compute_factorials(self):\r\n self.factorials = [1]\r\n for i in range(1, self.n + 1):\r\n self.factorials.append((self.factorials[i - 1] * i) % self.N)\r\n return\r\n\r\n def _fast_power(self, b, e):\r\n if e == 0:\r\n return 1\r\n elif e % 2 == 0: # e even\r\n x = self._fast_power(b, e / 2)\r\n return (x * x) % self.N\r\n else: # e odd\r\n x = self._fast_power(b, (e - 1) / 2)\r\n return (x * x * b) % self.N\r\n\r\n def _inv(self, k):\r\n base = (self.factorials[self.n - k] * self.factorials[k]) % self.N\r\n exponent = self.N - 2\r\n return self._fast_power(base, exponent)\r\n\r\n\r\nclass GoodNumbers:\r\n def __init__(self, first: str, second: str):\r\n self.first = first\r\n self.second = second\r\n self.all_good_numbers = self.first + self.second\r\n\r\n def is_good(self, x: int):\r\n for digit in str(x):\r\n if digit not in self.all_good_numbers:\r\n return False\r\n return True\r\n\r\n\r\nif __name__ == \"__main__\":\r\n N = 10**9 + 7\r\n a, b, n = input().split()\r\n n = int(n)\r\n combinator = Combinator(n, N)\r\n good_numbers = GoodNumbers(a, b)\r\n count = 0\r\n for k in range(n + 1):\r\n number_of_as = k\r\n number_of_bs = n - k\r\n sum_of_digits = number_of_as * int(a) + number_of_bs * int(b)\r\n if good_numbers.is_good(sum_of_digits):\r\n count += combinator.combination(k)\r\n count %= N\r\n print(count, end=\"\")\r\n", "''' Aman's submission '''\r\na,b,n = map(int,input().split())\r\nmod=1000000007 #not write too many times \r\nfact = [1] \r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]*i)%mod) #confidential list \r\nans = 0\r\nfor i in range(n+1):\r\n su = (a*i) + b*(n-i)\r\n coef = 1\r\n #check block starts\r\n while(su>0):\r\n if(su%10 != a and su%10!=b):\r\n coef = 0;\r\n su//=10\r\n #check block ends \r\n if(coef==1):\r\n ans+=(fact[n]*pow((fact[i]*fact[n-i]),mod-2,mod))\r\n ans= ans%mod\r\nprint(ans%mod)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nMOD = 10**9+7\r\na,b,N = map(int, input().split())\r\n\r\nfact = [1]*(N+1)\r\nifact = [0]*(N+1)\r\n \r\nfor i in range(1,N+1):\r\n fact[i] = fact[i-1]*i%MOD\r\n# 由阶乘生成逆元\r\nifact[N] = pow(fact[N],MOD-2,MOD)\r\nfor i in range(N,0,-1):\r\n ifact[i-1] = ifact[i]*i%MOD\r\n \r\ndef comb(a,b):\r\n cnt = fact[a]*ifact[b]*ifact[a-b]%MOD\r\n return cnt\r\n\r\ndef check(m):\r\n while m:\r\n t = m%10\r\n if t!=a and t!=b:return False\r\n m//=10\r\n return True\r\n\r\ndef deal(x,y):\r\n t = a*x+b*y\r\n if not check(t):\r\n return 0\r\n \r\n return comb(N,x)\r\n\r\nans = 0\r\nfor i in range(N+1):\r\n ans+=deal(i,N-i)\r\n ans%=MOD\r\nprint(ans)\r\n ", "\r\ndef power(x, y, m): \r\n \r\n if (y == 0): \r\n return 1\r\n \r\n p = power(x, y // 2, m) % m \r\n p = (p * p) % m \r\n \r\n if(y % 2 == 0): \r\n return p \r\n else: \r\n return ((x * p) % m) \r\n \r\ndef gcd(a, b): \r\n if (a == 0): \r\n return b \r\n \r\n return gcd(b % a, a) \r\n\r\n\r\na,b,n=map(int,input().split())\r\nans=0\r\nm=1000000007\r\n\r\nfct=[1]*(n+1)\r\nfct[0]=1\r\nfor i in range(1,n+1):\r\n fct[i]=(fct[i-1]*(i))%m\r\n\r\nfor i in range(n+1):\r\n k=i*a+(n-i)*b\r\n k=str(k)\r\n # print(k)\r\n ch1=str(a)\r\n ch2=str(b)\r\n a1=k.count(ch2)\r\n a2=k.count(ch1)\r\n # print(a1,a2)\r\n if(a1+a2==len(k)):\r\n #print(i)\r\n g=fct[n]\r\n #print(g)\r\n j=(power(fct[i],m-2,m))%m\r\n j=(j*power(fct[n-i],m-2,m)+m)%m\r\n #print(j)\r\n j=(g*j+m)%m\r\n j=(j+m)%m\r\n #print(j)\r\n ans=(ans+j)%m\r\n ans=(ans+m)%m\r\nprint(ans)", "a, b, n = map(int, input().split())\r\nans = 0\r\nmod = (10 ** 9) + 7\r\nfactorial = [1]\r\nfor i in range(1, n + 1):\r\n factorial.append((factorial[-1] * i) % mod)\r\nfor i in range(n + 1):\r\n sm = str((i * a) + ((n - i) * b))\r\n if sm.count(str(a)) + sm.count(str(b)) == len(sm):\r\n ans += ((factorial[n] * pow(factorial[i], -1, mod) * pow(factorial[n - i], -1, mod)) % mod)\r\n ans = ans % mod\r\nprint(ans)", "import sys\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\ndef inv(a): return pow(a, MOD-2, MOD)\n\nMOD = 1000000007\nMAXN = int(1e6)\nfact = [1]*(MAXN+1)\nfor i in range(1, MAXN+1):\n fact[i] = fact[i-1] * i % MOD\na, b, n = get_ints()\nans = 0\nfor i in range(n+1):\n sum = i * a + (n-i) * b\n flag = True\n for j in str(sum):\n if j != str(a) and j != str(b):\n flag = False\n if not flag:\n continue\n ans += fact[n] * inv(fact[n-i]*fact[i])\n ans %= MOD\nprint(ans)\n\t\t\t\t \t \t\t \t \t\t \t\t\t \t \t\t", "p, fact = 10**9 + 7, [1]\r\n\r\n\r\ndef is_nice(n):\r\n for dg in str(n):\r\n if dg != sa and dg != sb:\r\n return False\r\n return True\r\n\r\n\r\ndef inv(a, p):\r\n return pow(a, p-2, p)\r\n\r\n\r\ndef nCk(n, k, p):\r\n return (fact[n] * inv(fact[k], p) * inv(fact[n-k], p)) % p\r\n\r\n\r\nsa, sb, n = input().split()\r\na, b, n = int(sa), int(sb), int(n)\r\nfor i in range(1, n+1):\r\n fact.append(fact[-1]*i % p)\r\nsuma, dif = a*n, b-a\r\nans = int(is_nice(suma))\r\ncomb = 1\r\nfor i in range(1, n+1):\r\n suma += dif\r\n if is_nice(suma):\r\n comb = nCk(n, i, p)\r\n ans = (ans + comb) % p\r\n\r\nprint(ans)\r\n", "def f0(a, b, n):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val * base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = n + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def is_good(x, a, b):\r\n while x:\r\n d = x % 10\r\n if d != a and d != b:\r\n return 0\r\n x //= 10\r\n return 1\r\n\r\n ans = 0\r\n for x in range(0, n + 1):\r\n y = n - x\r\n s = a * x + b * y\r\n if is_good(s, a, b):\r\n inc = facts[n] * invrs[x] * invrs[y] % mod\r\n ans = (ans + inc) % mod\r\n return ans\r\n\r\n\r\na, b, n = map(int, input().split())\r\nprint(f0(a, b, n))\r\n", "\na,b,n=map(int,input().split())\nimport sys\ninput=sys.stdin.readline\np=(10**9)+7\npri=p\nfac=[1 for i in range((10**6)+1)]\nfor i in range(2,len(fac)):\n fac[i]=(fac[i-1]*(i%pri))%pri\ndef modi(x):\n return (pow(x,p-2,p))%p;\n \ndef ncr(n,r):\n x=(fac[n]*((modi(fac[r])%p)*(modi(fac[n-r])%p))%p)%p\n return x;\n\nans=[]\nfor i in range(n+1):\n total=i*a+((n-i)*b)\n s=str(total)\n \n if(s.count(str(a))+s.count(str(b))==len(s)):\n ans.append([i,n-i])\ntotal=0\nfor i in range(len(ans)):\n total+=ncr(n,ans[i][0])\n total%=pri\nprint(total)\n \n\n\t \t\t \t\t\t \t \t\t \t\t \t\t \t \t", "f=[0]*(10**6+1)\r\nf[0]=f[1]=1\r\nmod=10**9+7\r\nfor i in range(2,10**6+1):\r\n f[i]=(f[i-1]*i)%mod\r\ndef comb(n,r):\r\n return (f[n]*pow(f[n-r]*f[r],mod-2,mod))%mod\r\na,b,n=map(int,input().split())\r\nans=0\r\ndef is_good(x,a,b):\r\n x=str(x)\r\n a=str(a)\r\n b=str(b)\r\n flag=True\r\n for xx in x:\r\n if xx!=a and xx!=b:\r\n flag=False\r\n return flag\r\nfor k in range(n+1):\r\n s=a*k+b*(n-k)\r\n if is_good(s,a,b):\r\n ans+=comb(n,k)\r\n ans%=mod\r\nprint(ans%mod)", "mod = 1000000007\r\n\r\n\r\ndef fact(n):\r\n x = 1\r\n for i in range(n, 0, -1):\r\n x *= i\r\n x %= mod\r\n return x\r\n\r\n\r\ndef inv(n, mod):\r\n if n % mod == 0:\r\n return n\r\n else:\r\n return pow(n, mod-2, mod)\r\n\r\n\r\na, b, n = map(int, input().split())\r\nans = 0\r\nfor i in range(n+1):\r\n x = a*i+b*(n-i)\r\n s = str(x)\r\n for char in s:\r\n if char not in [str(a), str(b)]:\r\n break\r\n else:\r\n q = fact(n)*inv(fact(n-i)*fact(i), mod)\r\n ans += q\r\n ans %= mod\r\nprint(ans)\r\n", "fact = {}\r\n\r\nmodulo = 1000000007\r\n\r\n\r\ndef check(val, a, b):\r\n while val:\r\n if val%10 == a or val%10 == b:\r\n val //= 10\r\n else:\r\n return False\r\n return True\r\n\r\n\r\ndef modpow(base, exp, mod):\r\n if exp == 0:\r\n return 1\r\n if exp & 1:\r\n return modpow(base, exp-1, mod) * base % mod\r\n res = modpow(base, exp >> 1, mod)\r\n return (res * res) % mod\r\n\r\n\r\ndef getC(n, i):\r\n res = fact[n]\r\n div = fact[n-i] * fact[i]\r\n div %= modulo\r\n div = modpow(div, modulo-2, modulo)\r\n return (res * div) % modulo\r\n\r\n\r\na, b, n = [int(x) for x in input().split()]\r\n\r\nfact[0] = 1\r\nfor i in range(1, 1000005):\r\n fact[i] = (fact[i - 1] * i)\r\n fact[i] %= modulo\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n expsum = a * i + b * (n - i)\r\n if check(expsum, a, b):\r\n ans += getC(n, i)\r\n ans %= modulo\r\n\r\nprint(ans)", "import sys\r\nimport itertools as it\r\nimport math as mt\r\nimport collections as cc\r\n\r\ninput=sys.stdin.buffer.readline\r\nI=lambda:list(map(int,input().split()))\r\na,b,n=I()\r\nfact=[1]*(n+1)\r\nmod=10**9+7\r\nfor i in range(1,n+1):\r\n\tfact[i]=fact[i-1]*i\r\n\tfact[i]%=mod\r\ndef ch(n,a,b):\r\n\tf=1\r\n\twhile n:\r\n\t\tif n%10!=a and n%10!=b:\r\n\t\t\tf=0\r\n\t\t\tbreak\r\n\t\tn//=10\r\n\treturn f\r\n\r\nans=0\r\nfor i in range(n+1):\r\n\tx=i*a+(n-i)*b\r\n\tif ch(x,a,b):\r\n\t\tans+=(fact[n]*(pow(fact[i],mod-2,mod)%mod)*pow(fact[n-i],mod-2,mod))\r\n\t\tans%=mod\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef modularexpo(a:int,b:int,m:int):\r\n a = a%m\r\n res = 1\r\n while(b>0):\r\n if(b&1):\r\n res = (res*a)%m\r\n a = (a*a)%m\r\n b >>= 1\r\n return res\r\n\r\ndef modinverse(a:int,m:int):\r\n return modularexpo(a,m-2,m)\r\n\r\na,b,n = list(map(int,input().split()))\r\nfact = [0]*(n+1)\r\nfact[0] = 1\r\nMOD = int(1e9+7)\r\nans = 0\r\n\r\nfor i in range(1,n+1):\r\n fact[i] = (i*fact[i-1])%MOD\r\n \r\nfor i in range(0,n+1):\r\n sums = (a*i + b*(n-i))\r\n \r\n while(sums>0):\r\n rem = sums%10\r\n if(rem!=a and rem!=b):\r\n break\r\n sums = sums//10\r\n \r\n if(sums==0):\r\n ans = (ans + (fact[n] * modinverse((fact[n-i]*fact[i])%MOD,MOD))%MOD)%MOD\r\n \r\nprint(ans)", "#1 3 3\n#111 #113 #133 #131 #311 #331 #313\nfact = [0]* (1000001)\nmodulo = 1000000007\ndef factoriales():\n\n fact[0] = 1\n i = 1\n while i < len(fact):\n fact[i] = fact[i-1] * i;\n fact[i] %= modulo;\n i+=1\n \ndef binpow(val, deg,mod):\n val %= mod\n res = 1\n while(deg > 0):\n if (deg%2!=0):\n res = res * val % mod\n val = val * val % mod\n deg = deg//2\n return res % mod\n \n\ndef check(suma,a,b):\n #la suma de este numero,\n #debe ser un good numero.\n while suma > 0:\n if suma%10 == a or suma%10 ==b:\n suma//= 10\n else:\n return False\n return True\n\ndef getC(n,i):\n\n respuesta = fact[n]\n div = fact[n-i] * fact[i]\n div %= modulo\n\n #porque teorema \n div = binpow(div, modulo -2, modulo)\n return (respuesta*div) % modulo\n\n\ndef solve(a,b,n):\n res = 0\n for i in range(0,n+1):\n suma = a*i + b*(n-i)\n\n if check(suma,a,b):\n \n res+= getC(n,i)\n res%= modulo\n print(res)\n \n\n\ndef main():\n factoriales()\n a,b,n = [int(x) for x in input().split()]\n solve(a,b,n)\n\nmain()\n \n\n\t \t\t \t \t \t \t\t \t \t \t\t \t\t\t\t \t\t", "\r\na,b,n=map(int,input().split())\r\nimport sys\r\ninput=sys.stdin.readline\r\np=(10**9)+7\r\npri=p\r\nfac=[1 for i in range((10**6)+1)]\r\nfor i in range(2,len(fac)):\r\n fac[i]=(fac[i-1]*(i%pri))%pri\r\ndef modi(x):\r\n return (pow(x,p-2,p))%p;\r\n \r\ndef ncr(n,r):\r\n x=(fac[n]*((modi(fac[r])%p)*(modi(fac[n-r])%p))%p)%p\r\n return x;\r\n\r\nans=[]\r\nfor i in range(n+1):\r\n total=i*a+((n-i)*b)\r\n s=str(total)\r\n \r\n if(s.count(str(a))+s.count(str(b))==len(s)):\r\n ans.append([i,n-i])\r\ntotal=0\r\nfor i in range(len(ans)):\r\n total+=ncr(n,ans[i][0])\r\n total%=pri\r\nprint(total)\r\n \r\n", "a, b, n = map(int, input().split())\nmod = 1000000007\ntot = 0\n\nfact = [1 for i in range(n + 1)]\n\nfor i in range(1, n + 1):\n fact[i] = (fact[i - 1] * i) % mod\n\ndef expmod(a, b):\n x = 1\n while b > 0:\n if b & 1 == 1:\n x = (x * a) % mod\n a = (a * a) % mod\n b >>= 1\n return x\n\ndef nCr(n, r):\n return fact[n] * expmod(fact[r] * fact[n - r], mod - 2)\n\nfor i in range(n + 1):\n s = str(a * i + b * (n - i))\n bad = False\n for c in s:\n if c != str(a) and c != str(b):\n bad = True\n break\n if not bad:\n tot = (tot + nCr(n, i)) % mod\n\nprint(tot)\n", "MAX = 1000000007\n\ndef inv(x):\n return modpow(x, MAX-2, MAX)\n\ndef modpow(b, e, m):\n if e == 0:\n return 1 % m\n u = modpow(b, e//2, m)\n u = (u*u) % m\n if e % 2 == 1:\n u = (u*b) % m\n return u\n\ndef checkSum(a, b, sum):\n for i in range(len(sum)):\n if not (sum[i] == a or sum[i] == b):\n return False\n return True\n\ndef solve(a, b, n):\n r = 0\n f = [1]*(n+1)\n for i in range(2,n+1):\n f[i] = (f[i-1]*i) % MAX\n for k in range(0,n+1):\n sum = k*a + (n-k)*b\n if checkSum(str(a), str(b), str(sum)):\n #r += f[n]//(f[k]*f[n-k])\n r += f[n] * inv(f[k]*f[n-k])\n r = r % MAX\n return r % MAX\n\nif __name__ == \"__main__\":\n a, b, n = list(map(int, input().split()))\n solution = solve(a, b, n)\n print(solution)\n\t \t \t \t \t\t \t\t \t \t \t\t", "\r\nMOD = 1000000007\r\nfact = [1]*(10**6+1)\r\n\r\ndef pre_computation():\r\n for i in range(2,10**6+1):\r\n fact[i] = (fact[i-1]*i)%MOD\r\n\r\ndef mod_inv(a):\r\n return pow(a,MOD-2,MOD)\r\n\r\ndef nCr(n,r): # n!/(r!*(n-r)!)\r\n return fact[n]*mod_inv((fact[r]*fact[n-r])%MOD)\r\n\r\ndef check(sm,a,b):\r\n while sm:\r\n if sm%10 == a or sm%10 == b:\r\n sm //= 10\r\n else:\r\n return False\r\n return True\r\n\r\ndef main():\r\n pre_computation()\r\n (a,b,n) = map(int,input().split())\r\n\r\n ans = 0\r\n for i in range(n+1):\r\n sm = a*i+(n-i)*b\r\n if check(sm,a,b):\r\n ans = (ans + nCr(n,i))%MOD\r\n\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from math import factorial\r\n \r\nMOD = 10**9+7\r\nfact = {}\r\n \r\na, b, n = map(int, input().split())\r\nfact[0]=1\r\nfor i in range(1, n+1):\r\n fact[i] = fact[i-1]*i%MOD\r\n \r\nans = 0\r\nfor (i, j) in zip(range(n+1), range(n, -1, -1)):\r\n if set(str(a*i + b*j)) <= {f'{a}', f'{b}'}:\r\n ans+=(fact[n]*pow(fact[n-i]*fact[i]%MOD, MOD-2, MOD) % MOD)\r\nprint(ans%MOD)", "import io\r\nmod = 1000000007\r\n\r\n\r\ndef power(x, e):\r\n if e == 1:\r\n return x % mod\r\n tmp = power(x, e // 2)\r\n tmp = ((tmp % mod) * (tmp % mod)) % mod\r\n if e % 2 != 0:\r\n tmp = ((tmp % mod) * (x % mod)) % mod\r\n return tmp\r\n\r\n\r\nclass Solution:\r\n def __init__(self, n):\r\n fact = list(range(n + 1))\r\n fact[0], fact[1] = 1, 1\r\n for i in range(2, n + 1):\r\n fact[i] = fact[i - 1] * i\r\n fact[i] %= mod\r\n\r\n self.fact = fact\r\n\r\n def rCn(self, p, n):\r\n tmp = power(self.fact[n - p] * self.fact[p], mod - 2)\r\n return ((tmp % mod) * (self.fact[n] % mod)) % mod\r\n\r\n def is_good(self, x, a, b):\r\n s = str(x)\r\n return s.count(str(a)) + s.count(str(b)) == len(s)\r\n\r\n def solve(self, a, b, n):\r\n ans = 0\r\n for p in range(n+1):\r\n if self.is_good(p * a + (n - p) * b, a, b):\r\n ans += self.rCn(p, n)\r\n ans %= mod\r\n return ans\r\n\r\n\r\nout = io.StringIO()\r\na, b, n = map(int, input().split())\r\nsol = Solution(n)\r\nprint(sol.solve(a, b, n))\r\n\r\n", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Beautiful_Numbers2():\r\n def is_good_sum(a,b,num):\r\n while num > 0 :\r\n digit = num % 10\r\n num = num // 10\r\n\r\n if digit != a and digit != b:\r\n return False \r\n \r\n return True \r\n\r\n a,b,n = invr()\r\n x = 1000000007\r\n\r\n\r\n\r\n factorial_calc = []\r\n for i in range(n+1):\r\n if i == 0:\r\n factorial_calc.append(1)\r\n else:\r\n new_num = (factorial_calc[-1] * i) % x\r\n factorial_calc.append(new_num)\r\n \r\n total_combinations = 0 \r\n\r\n for i in range(n+1):\r\n sum_of_num = (a*i) + (b*(n-i))\r\n #print(sum_of_num)\r\n\r\n if is_good_sum(a,b,sum_of_num):\r\n number_of_ways = factorial_calc[n] * pow(factorial_calc[i]*factorial_calc[n-i], x-2, x)\r\n number_of_ways = number_of_ways % x\r\n total_combinations += number_of_ways\r\n \r\n print(total_combinations % x)\r\n return\r\n\r\n\r\nBeautiful_Numbers2()", "\r\ndef is_good(x):\r\n while x > 0:\r\n if x % 10 not in {a, b}:\r\n return False\r\n x //= 10\r\n return True\r\n\r\n\r\ndef inverse(a):\r\n def power_modulo(n, k, m):\r\n res = 1\r\n while k > 0:\r\n if k % 2:\r\n res = res * n % m\r\n k //= 2\r\n n = n * n % m\r\n\r\n return res\r\n return power_modulo(a, m - 2, m)\r\n\r\n\r\ndef binomial(x, y):\r\n if x == y or y == 0:\r\n return 1\r\n return factorial[x] * inverse(factorial[y]) % m * inverse(factorial[x-y]) % m\r\n\r\n\r\na, b, n = map(int, input().split())\r\nm = 1000000007\r\n\r\nfactorial = [0] * (n + 1)\r\nfactorial[0] = 1\r\nfor i in range(1, n + 1):\r\n factorial[i] = factorial[i - 1] * i % m\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n if is_good(i*a + (n-i)*b):\r\n # print(i*a + (n-i)*b, i, 'is good')\r\n # print('binomial', n, i, 'is', binomial(n, i))\r\n ans += binomial(n, i)\r\n ans %= m\r\n\r\nprint(ans)\r\n", "mod=1000000007 \r\nfactorial=[]\r\n\r\ndef excellent(a,b,n,i):\r\n sum=a*i+b*(n-i)\r\n while sum>0:\r\n if (sum%10 == a) or (sum%10 == b):\r\n sum=sum//10\r\n else :\r\n return 0\r\n return 1\r\n\r\ndef combination(n,i):\r\n a=factorial[n]\r\n b=(factorial[n-i])*(factorial[i])\r\n b%=mod\r\n c=power(b,mod-2)\r\n return (a*c)%mod\r\n\r\ndef calcualate_factorial():\r\n factorial.append(1)\r\n for i in range(1000001):\r\n a=((i+1)*factorial[i])%mod\r\n factorial.append(a)\r\n\r\ndef power(a,n):\r\n b=1\r\n while n>0:\r\n if (n%2)==1:\r\n b*=a\r\n b%=mod\r\n a*=a\r\n a%=mod\r\n n=n//2\r\n return b%mod\r\n\r\nif __name__=='__main__':\r\n a,b,n=[int(x) for x in input().split()]\r\n ans=0\r\n calcualate_factorial()\r\n for i in range(n+1):\r\n if excellent(a,b,n,i):\r\n ans+=combination(n,i)\r\n ans%=mod\r\n print(ans)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\nm = 1000000007\r\ndef fastpower_with_mod(x , y , m):\r\n res = 1\r\n if x == 0 :\r\n return 0\r\n\r\n x %= m\r\n while y > 0 :\r\n if (y % 2 != 0 ):\r\n res = (res * x) % m\r\n x = (x * x) % m\r\n y //= 2\r\n return res\r\n\r\n\r\ndef check_sum(sm , a , b):\r\n while (sm):\r\n if (sm % 10 != a and sm % 10 != b):\r\n return False\r\n sm//= 10\r\n\r\n return True\r\n\r\ndef calc_inv(num , m):\r\n return fastpower_with_mod(num , m-2 , m)\r\n\r\ndef ncr(n, r,m):\r\n if n==r or r==0:\r\n return 1\r\n if n<r:\r\n return 0\r\n return (fac[n]*calc_inv(fac[r],m)%m*calc_inv(fac[n-r],m)%m)%m\r\n\r\na , b , n = MAP()\r\n\r\nfac = [0] * (10**6 + 9 )\r\nfac[1] = 1\r\nfor i in range(2 , n + 1):\r\n fac[i] = (fac[i - 1] * i) % m\r\n\r\nres = 0\r\nfor i in range(n + 1):\r\n sm = a * i + b * (n-i)\r\n if (check_sum(sm , a , b)):\r\n res += ncr(n , i , m)\r\n res %= m\r\n\r\nprint(res)\r\n\r\n\r\n\r\n", "import sys,math\r\nfrom collections import deque,defaultdict\r\nimport operator as op\r\nfrom functools import reduce\r\nfrom itertools import permutations\r\nimport heapq\r\n\r\n# sys.setrecursionlimit(10**7) \r\n#OneDrive\\Documents\\codeforces\r\n\r\nI=sys.stdin.readline\r\n\r\nalpha=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nmod=10**9 + 7\r\n\r\n\"\"\"\r\nx_move=[-1,0,1,0,-1,1,1,-1]\r\ny_move=[0,1,0,-1,1,1,-1,-1]\r\n\"\"\"\r\ndef ii():\r\n\treturn int(I().strip())\r\ndef li():\r\n\treturn list(map(int,I().strip().split()))\r\ndef mi():\r\n\treturn map(int,I().strip().split())\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom \r\n\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\ndef isPrime(n):\r\n\tif n<=1:\r\n\t\treturn False\r\n\telif n<=2:\r\n\t\treturn True\r\n\telse:\r\n\t\t\r\n\t\tfor i in range(2,int(n**.5)+1):\r\n\t\t\tif n%i==0:\r\n\t\t\t\treturn False\r\n\t\treturn True\r\n\r\n\r\n#print(\"Case #\"+str(_+1)+\":\",ans)\r\ndef modInverse(a, m):\r\n m0 = m\r\n y = 0\r\n x = 1\r\n \r\n if (m == 1):\r\n return 0\r\n \r\n while (a > 1):\r\n \r\n # q is quotient\r\n q = a // m\r\n \r\n t = m\r\n \r\n # m is remainder now, process\r\n # same as Euclid's algo\r\n m = a % m\r\n a = t\r\n t = y\r\n \r\n # Update x and y\r\n y = x - q * y\r\n x = t\r\n \r\n # Make x positive\r\n if (x < 0):\r\n x = x + m0\r\n \r\n return x\r\n\r\n\r\ndef isExcelent(x,y,a,b):\r\n\t\r\n\ttmp=a*x+b*y \r\n\ta=str(a)\r\n\tb=str(b)\r\n\tfor i in str(tmp):\r\n\t\tif i!=a and i!=b:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nfact=[1]*(10**6 +1)\r\n\r\nfor i in range(1,10**6 + 1):\r\n\tfact[i]=(fact[i-1]*i)%mod\r\n\r\n\r\ndef main():\r\n\ta,b,n=mi()\r\n\tcnt=0\r\n\tfor i in range(n+1):\t\t\r\n\t\tif isExcelent(i,n-i,a,b):\r\n\t\t\tx= (fact[n]*modInverse(fact[i],mod)*modInverse(fact[n-i],mod))%mod\r\n\t\t\tcnt+=x\r\n\t\r\n\tprint(cnt%mod)\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\t\r\n\t\r\n\r\n\t\t\t\t\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a,b,n = map(int,input().split())\r\nm =1000000007\r\nfact = [1]\r\n\r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]*i)%m)\r\nans = 0\r\nfor i in range(n+1):\r\n su = (a*i) + b*(n-i)\r\n coef = 1\r\n while(su>0):\r\n if(su%10 != a and su%10!=b):\r\n coef = 0;\r\n su//=10\r\n if coef:\r\n ans+=(fact[n]*pow((fact[i]*fact[n-i]),m-2,m))\r\n ans= ans%m\r\nprint(ans%m)\r\n \r\n ", "import sys\r\nimport math\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod = 1000000007\r\n#map(int,input().split())\r\n#int(input())\r\na,b,n=map(int,input().split())\r\nans=0\r\ns=str(a)+str(b)\r\nfac=[1]*(10**6+1)\r\nfor i in range(2,10**6+1):\r\n fac[i]=(fac[i-1]*i)%mod\r\nfor i in range(n+1):\r\n veri=a*i+b*(n-i)\r\n flag=1\r\n temp=veri\r\n while temp>0:\r\n if temp%10!=a and temp%10!=b:\r\n flag=0\r\n break\r\n temp//=10\r\n if flag:\r\n ans=(ans+fac[n]*pow(fac[i]*fac[n-i],mod-2,mod))%mod\r\nprint(ans)", "N=10**6\r\nmod=10**9+7\r\ndef checkgood(val, a, b):\r\n while(val):\r\n if(val%10 != a and val%10 !=b ):\r\n return False\r\n val//=10\r\n return(True)\r\ndef power(x, a):\r\n if(a==0):\r\n return(1)\r\n z=power(x, a//2)\r\n z = (z**2)%mod\r\n if(a%2):\r\n z=(z*x)%mod\r\n return(z)\r\nfact=[1 for _ in range(N+1)]\r\nfor no in range(2, N+1):\r\n fact[no]=(fact[no-1]*no)%mod\r\n[a, b, n]=list(map(int, input().split()))\r\ncount=0\r\nval=(n+1)*b-a\r\nfor freq in range(n+1):\r\n val += a-b\r\n if(checkgood(val, a, b)):\r\n count+=(((fact[n]*power(fact[freq], mod-2))%mod)*power(fact[n-freq], mod-2))%mod\r\n count%=mod\r\nprint(count)", "a,b,n = [int(i) for i in input().split()]\r\n\r\nmod = (10**9) + 7\r\n\r\nfact = [0] * (1000001)\r\nfact[0] = 1\r\nfact[1] = 1\r\ncount = 0\r\n\r\ndef modpow(a , b):\r\n\tans = 1\r\n\twhile b > 0:\r\n\t\tif b%2:\r\n\t\t\tans = (ans * a) % mod\r\n\t\tb = b // 2\r\n\t\ta = ((a%mod) * (a% mod)) % mod\r\n\r\n\treturn ans\r\n\r\nfor i in range(2 , 1000001):\r\n\tfact[i] = i * fact[i-1]\r\n\tfact[i] %= mod\r\n\r\nfor i in range(0 , n+1):\r\n\tx = i\r\n\ty = n - x\r\n\ts = (a*x) + (b*y)\r\n\r\n\tflag = 0\r\n\r\n\tfor i in str(s):\r\n\t\tif int(i) != a and int(i) != b:\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\r\n\tif not flag:\r\n\t\tres = 1\r\n\t\tx1 = fact[n] \r\n\t\ty = modpow(fact[x] , mod - 2)\r\n\t\tz = modpow(fact[n-x] , mod - 2)\r\n\t\tres *= x1\r\n\t\tres %= mod\r\n\t\tres *= y\r\n\t\tres %= mod\r\n\t\tres *= z\r\n\t\tres %= mod\r\n\t\tcount += res\r\n\t\tcount %= mod\r\n\r\nprint(count % mod)\r\n\r\n\r\n", "md = 1000000007\r\na, b, n = map(int, input().split())\r\n\r\nfact = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n fact[i] = (fact[i - 1] * i) % md\r\ndigi = [a, b]\r\n\r\ndef check(num):\r\n while num > 0:\r\n if num % 10 not in digi:\r\n return 0\r\n num //= 10\r\n return 1\r\n\r\nans = 0\r\nfor i in range(n + 1):\r\n if check(a * i + b * (n - i)):\r\n ans = (ans + pow(fact[i] * fact[n - i], md - 2, md)) % md\r\nprint((ans * fact[n]) % md)\r\n\r\n", "def egcd(a, b):\n if a == 0:\n return (b, 0, 1)\n else:\n g, y, x = egcd(b % a, a)\n return (g, x - (b // a) * y, y)\ndef modinv(a, m):\n g, x, y = egcd(a, m)\n return x % m\na, b, n = map(int, input().split())\nc = str(a) + str(b)\nf, mod, ans = [1], 1000000007, 0\nfor i in range(1, n + 1):\n f.append(f[-1] * i % mod)\ns = a * n\nfor i in range(n + 1):\n if all(i in c for i in str(s)):\n ans += f[n] * modinv(f[i] * f[n - i], mod) % mod\n s += b - a\nprint(ans % mod)\n\n\t \t \t \t\t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t", "fact = [1] * (10 ** 6+50)\r\nmod = 10 ** 9 + 7\r\nfor i in range(2, len(fact)):\r\n fact[i] = (fact[i-1] * i) % mod\r\n\r\ndef get_ret(n):\r\n return pow(n, mod-2, mod)\r\n\r\ndef ck(n, k):\r\n return (fact[n] * get_ret(fact[n-k] * fact[k])) % mod\r\n\r\n\r\ndef main():\r\n a, b, n = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in range(n//2+1):\r\n if str(i * (a+b) + (n-i*2)*a).count(str(a)) + str(i * (a+b) + (n-i*2)*a).count(str(b)) == len(str(i * (a+b) + (n-i*2)*a)):\r\n ans = (ans + ck(n, i + n - i*2)) % mod\r\n for i in range(n//2+1):\r\n if str(i * (a + b) + (n - i * 2) * b).count(str(a)) + str(i * (a + b) + (n - i * 2) * b).count(\r\n str(b)) == len(str(i * (a+b) + (n-i*2)*b)):\r\n ans = (ans + ck(n, i + n - i * 2)) % mod\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "ans = 0\r\nmod = 10**9+7\r\na, b, n = map(int, input().split())\r\ns = set()\r\nfor x in range(2, 1 << 8):\r\n z = 0\r\n while x > 1:\r\n z = z * 10 + (a, b)[x & 1]\r\n x >>= 1\r\n s.add(z)\r\nf = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n f[i] = f[i - 1] * i % mod\r\nfor x in range(n + 1):\r\n if x * a + (n - x) * b in s:\r\n ans += pow(f[x] * f[n - x], mod - 2, mod)\r\n ans %= mod\r\nprint(ans * f[n] % mod)", "def ncr(n, r, p):\r\n # initialize numerator\r\n # and denominator\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, \r\n p - 2, p)) % p\r\na,b,n=map(int,input().split())\r\nans=0\r\np=10**9+7\r\nnum=1\r\nden=1\r\nfor i in range(n+1):\r\n s=a*i+b*(n-i)\r\n if i!=0:\r\n num=(num*(n-i+1))%p\r\n den=(den*(i))%p\r\n am=True\r\n while s!=0:\r\n if s%10!=a and s%10!=b:\r\n am=False\r\n break\r\n s//=10\r\n if am:\r\n ans=(ans+(num*pow(den,p-2,p))%p)%p\r\nprint(ans%p)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\na,b,n=(int(i) for i in input().split())\r\nmod=1000000007\r\nf=[1]\r\nfor i in range(1,1000001):\r\n f.append((f[i-1]*i)%mod)\r\ns1=0\r\nfor i in range(n+1):\r\n s=str(a*i+b*(n-i))\r\n c=1\r\n for j in s:\r\n if(j!=str(a) and j!=str(b)):\r\n c=0\r\n break\r\n if(c==1):\r\n k=(f[n]*pow(f[i]*f[n-i],mod-2,mod))%mod\r\n s1=(s1+k)%mod\r\nprint(s1)", "\nMOD = 1000000007\nMX = 1000000\n\nfact = [1] * (MX + 1)\nfor i in range(1, MX + 1):\n fact[i] = (fact[i - 1] * i) % MOD\n\n\ndef power(a, b):\n res = 1\n while b > 0:\n if b % 2 == 1:\n res = (res * a) % MOD\n a = (a * a) % MOD\n b //= 2\n return res\n\n\ndef inv(n):\n return power(n, MOD - 2)\n\n\ndef choose(n, k):\n return fact[n] * inv(fact[n - k]) * inv(fact[k])\n\n\ndef is_good(n, g):\n while n > 0:\n if n % 10 not in g:\n return False\n n //= 10\n return True\n\n\na, b, n = map(int, input().split())\nres = 0\nfor ca in range(n + 1):\n cb = n - ca\n if is_good(ca * a + cb * b, [a, b]):\n res += choose(n, ca)\n res %= MOD\nprint(res)", "def good_number(num, a, b):\n lt = [a, b]\n\n while num != 0:\n if num % 10 not in lt:\n return False\n num = int(num / 10)\n return True\n\n\na, b, n = list(map(int, input().split()))\nlista = [1]\np = int(1e9 + 7)\n\nfor i in range(1, n + 1):\n num = int(i * lista[i - 1] % p)\n lista.append(num)\n\nr = 0\nfor i in range(0, n + 1):\n t = a * i + b * (n - i)\n if good_number(t, a, b):\n x = (lista[n] * pow(lista[i], p - 2, p)) % p\n y = pow(lista[n - i], p - 2, p) % p\n\n r += x * y\n r %= p\n\nprint(int(r))\n\n\t \t\t\t \t \t \t\t \t\t\t\t\t \t \t\t \t", "import sys\r\ninput = sys.stdin.readline\r\ndef mod_exp(a:int,b:int,mod:int)->int:\r\n a = a%mod\r\n res = 1\r\n \r\n while b > 0:\r\n if b & 1:\r\n res = (res*a)%mod\r\n \r\n a = (a*a)%mod\r\n b >>= 1\r\n \r\n return res\r\n\r\ndef modprimeinverse(a:int,mod:int)->int:\r\n return mod_exp(a,mod-2,mod)\r\n\r\ndef comb(x:int,y:int,mod:int)->int:\r\n if x < y:\r\n return 0\r\n else:\r\n return (fact[x] * modprimeinverse(fact[y]*fact[x-y],mod))%mod\r\n \r\ndef isgood(x:int,a:int,b:int)->bool:\r\n \r\n while x > 0:\r\n rem = x%10\r\n \r\n if rem != a and rem != b:\r\n return False\r\n \r\n x = x//10\r\n \r\n return True\r\n\r\na,b,n = map(int,input().split())\r\nres = 0\r\nMOD = int(1e9+7)\r\nfact = [1] + [0]*(n+1)\r\n\r\nfor i in range(1,n+1):\r\n fact[i] = (i*fact[i-1])%MOD\r\n \r\nfor i in range(n+1):\r\n if isgood(a*i + b*(n-i),a,b):\r\n res = (res + comb(n,i,MOD))%MOD\r\n\r\nprint(res)", "a,b,n=[int(x) for x in input().split()]\r\nm =1000000007\r\nfact = [1]\r\ndef helper(a,b,n):\r\n while n:\r\n curr=n%10\r\n if curr!=a and curr!=b:\r\n return False\r\n n=n//10\r\n return True\r\nfor i in range(1,n+1):\r\n fact.append((fact[-1]*i)%m)\r\ns=b*n\r\nans=0\r\nfor i in range(n+1):\r\n #print(s)\r\n if helper(a,b,s):\r\n ans+=(fact[n]*pow((fact[i]*fact[n-i]),m-2,m))\r\n ans%=m\r\n s-=b\r\n s+=a\r\nprint(ans%(10**9+7))", "# https://codeforces.com/problemset/problem/1420/D\r\n\r\ndef f0(a, b, n):\r\n def power(base, exp, module):\r\n val = 1\r\n while exp:\r\n if exp & 1:\r\n val = val * base % module\r\n base = base * base % module\r\n exp >>= 1\r\n return val\r\n\r\n mod = int(1e9 + 7)\r\n M = n + 1\r\n facts = [1] * M\r\n invrs = [1] * M\r\n j = 1\r\n for i in range(2, M):\r\n facts[i] = j = j * i % mod\r\n invrs[-1] = power(facts[-1], mod - 2, mod)\r\n for i in range(M - 2, 1, -1):\r\n invrs[i] = invrs[i + 1] * (i + 1) % mod\r\n\r\n def is_good(x, a, b):\r\n good = 1\r\n while x:\r\n d = x % 10\r\n if d != a and d != b:\r\n good = 0\r\n break\r\n x //= 10\r\n return good\r\n\r\n ans = 0\r\n for i in [a, b]:\r\n ans += is_good(i * n, a, b)\r\n half = n >> 1\r\n even = 1 ^ (n & 1)\r\n iters = ((a, b), (b, a))\r\n for x in range(1, half + 1):\r\n y = n - x\r\n # print(x, y)\r\n for i, j in iters:\r\n s = i * x + j * y\r\n f1 = is_good(s, i, j)\r\n f2 = not (even and x == half)\r\n # inc = 0\r\n if f1 and f2:\r\n inc = facts[n] * invrs[x] * invrs[y] % mod\r\n # print(facts[n], invrs[x], invrs[y])\r\n ans = (ans + inc) % mod\r\n # print(i, j, s, \"|\", f1, f2, inc)\r\n return ans\r\n\r\n\r\na, b, n = map(int, input().split())\r\nprint(f0(a, b, n))\r\nexit()\r\n\r\na = 2\r\nb = 3\r\nn = 10\r\n\r\na = 1\r\nb = 3\r\nn = 3\r\n\r\nprint(f0(a, b, n))\r\n", "a, b, n = map(int, input().split())\r\n\r\nmod = 10**9 + 7\r\n\r\nl = [1]\r\nfor i in range(1, n + 1):\r\n l.append((i * l[-1]) % mod)\r\n \r\nx, y = 0, n\r\n\r\ns = [] \r\n\r\nwhile(x <= n):\r\n m = a * x + b * y \r\n c = set()\r\n while(m > 0):\r\n c.add(m % 10) \r\n m //= 10 \r\n if(len(c) == 2):\r\n if(a in c and b in c):\r\n s.append((x, y)) \r\n if(len(c) == 1):\r\n if(a in c or b in c):\r\n s.append((x, y))\r\n \r\n \r\n x, y = x + 1, y - 1\r\n \r\nk = 0\r\nfor i in s:\r\n k = (k + pow(l[i[0]] * l[i[1]], mod - 2, mod)) % mod\r\nprint(l[n] * k % mod)", "def read(): return(list(map(int, input().strip().split(\" \"))))\r\n\r\n\r\nMOD = 10**9 + 7\r\ndef fact():\r\n N = 10**6 + 1\r\n facto = [0]*(N+1)\r\n facto[0] = 1\r\n for i in range(1, N + 1):\r\n facto[i] = ((facto[i-1]%MOD)*i)%MOD\r\n return(facto)\r\nfacto = fact()\r\n\r\ndef chk(n, a, b):\r\n# print(n, a, b)\r\n s = 0\r\n while n > 0:\r\n if not n%10 in (a,b):return(False)\r\n n //= 10\r\n return(True)\r\n\r\ndef modInverse(a, m):\r\n m0 = m\r\n y = 0\r\n x = 1\r\n \r\n if (m == 1):\r\n return 0\r\n \r\n while (a > 1):\r\n \r\n # q is quotient\r\n q = a // m\r\n \r\n t = m\r\n \r\n # m is remainder now, process\r\n # same as Euclid's algo\r\n m = a % m\r\n a = t\r\n t = y\r\n \r\n # Update x and y\r\n y = x - q * y\r\n x = t\r\n \r\n # Make x positive\r\n if (x < 0):\r\n x = x + m0\r\n \r\n return x\r\n\r\ndef solve():\r\n a, b, n = read()\r\n ans = 0\r\n for i in range(n+1):\r\n x, y = i, n-i\r\n if chk(a*x+b*y, a, b):\r\n u = facto[n]\r\n d = modInverse(((facto[x]%MOD)*(facto[y]%MOD))%MOD, MOD)\r\n ans += (u*d)%MOD\r\n ans %= MOD\r\n print(ans)\r\n \r\n \r\n \r\nsolve()\r\n \r\n \r\n ", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nmod = 10**9+7\nf = [1]\nfor i in range(1,10**7+1):\n f.append(f[-1]*i%mod)\n\nA,B,N = map(int,input().split())\np = [str(A),str(B)]\nans = 0\nfor i in range(N+1):\n k = str(A*i+(N-i)*B)\n check = True\n for j in k:\n if j not in p:check=False;break\n\n if check==True:\n ans+=f[N]*pow(f[i],mod-2,mod)*pow(f[N-i],mod-2,mod)\n ans%=mod\nprint(ans)", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef power(a, b, mod):\r\n res = 1\r\n while b > 0:\r\n if b & 1:\r\n res = (res*a) % mod\r\n a = (a*a) % mod\r\n b = b//2\r\n return res\r\n\r\n\r\ndef factorial(fact, n, mod):\r\n for i in range(1, n+1):\r\n fact[i] = ((i % mod) * (fact[i-1]) % mod) % mod\r\n\r\n\r\ndef ncr(fact, n, r, mod):\r\n if r > n | n < 0 | r < 0:\r\n return 0\r\n return (fact[n] % mod)*(power(fact[r], mod-2, mod) % mod)*(power(fact[n-r], mod-2, mod) % mod) % mod\r\n\r\n\r\ndef Solution(a, b, n, fact, mod):\r\n # Write Your Code Here\r\n res = 0\r\n for i in range(n+1):\r\n t = (a*i)+((n-i)*b)\r\n flag = False\r\n while t > 0:\r\n if t % 10 != a and t % 10 != b:\r\n flag = True\r\n break\r\n t = t//10\r\n if flag:\r\n continue\r\n res = (res % mod + ncr(fact, n, i, mod) % mod) % mod\r\n print(res)\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n mod = 1000000007\r\n a, b, n = get_ints_in_variables()\r\n fact = [1 for _ in range(n+1)]\r\n factorial(fact, n, mod)\r\n Solution(a, b, n, fact, mod)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "mxn = 10**6+10\r\nfact = [1] * mxn\r\nmod = 10**9+7\r\nfor i in range(1,mxn):\r\n fact[i] = fact[i-1] * i % mod\r\ndef nck(n,k):\r\n return fact[n] * pow(fact[k] * fact[n-k],mod-2,mod) % mod\r\ndef log(n):\r\n ans = 0\r\n while n:\r\n ans += 1\r\n n //= 10\r\n return ans\r\na,b,n = map(int,input().split())\r\nif a < b:\r\n a,b = b,a\r\nmn = b * n\r\nmx = a * n\r\nleng = [i for i in range(log(mn),log(mx)+1)]\r\nans = 0\r\ndef check(num):\r\n mx = n * a\r\n if (mx - num) % (a-b) != 0:\r\n return 0\r\n # print(mx-num,mx)\r\n l = n - (mx - num) // (a-b)\r\n r = n - l\r\n # print(num,nck(n,l)*nck(n-l,r),l,r,l*b,r*a)\r\n return nck(n,l) * nck(n-l,r)\r\nfor l in leng:\r\n for mask in range(1 << l):\r\n num = 0\r\n mul = 1\r\n for bit in range(l):\r\n if mask & (1 << bit):\r\n num += mul * a\r\n else:\r\n num += mul * b\r\n mul *= 10\r\n if mn <= num and num <= mx:\r\n ans += check(num)\r\n ans %= mod\r\nprint(ans) \r\n", "import sys\r\nimport random\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import gcd\r\n#import math\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nlii = lambda : list(map(int, list(ip())))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\nmod = 10**9 + 7\r\nmod1 = 998244353\r\n\r\nfact = [1]\r\nfor i in range (1,10**6 + 5) :\r\n fact.append((fact[-1]*i)%mod)\r\ninv = []\r\ninv.append(pow(fact[-1],mod-2,mod))\r\nfor i in range (10**6 + 4 , 0,-1) :\r\n inv.append((inv[-1]*i)%mod)\r\ninv = inv[::-1]\r\ndef ncr(n,r) :\r\n return (fact[n] * inv[r] * inv[n-r])%mod\r\n\r\nfor _ in range (1) :\r\n a,b,n = il()\r\n ans = 0\r\n for i in range (n+1) :\r\n s = str(a*i + b*(n-i))\r\n\r\n if (s.count(str(a)) + s.count(str(b)) == len(s)) :\r\n ans += ncr(n,i)\r\n ans %= mod\r\n print(ans)\r\n \r\n\r\n \r\n", "a,b,n=map(int,input().split())\r\n# a=1 \r\n# b=3 \r\n# n=3\r\nf = [1]*(n+1)\r\nmod = 10**9+7\r\nfor i in range(1, n+1):\r\n f[i] = f[i-1]*i%mod\r\n \r\nv = [a, b]\r\n\r\ndef OK(x):\r\n while x > 0:\r\n if x%10 not in v:\r\n return False\r\n x =x// 10\r\n return True\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n if OK(a*i+(n-i)*b)==True:\r\n ans = (ans+ pow(f[i]*f[n-i], mod-2, mod) )%mod\r\nprint(f[n]*ans%mod)", "M=10**9+7\r\nR=10**6\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\na,b,n=[int(e) for e in input().split()]\r\ny=0\r\nfor i in range(n+1):\r\n x=a*i+b*(n-i)\r\n if 0 not in (int(e) in {a,b} for e in str(x)):\r\n y+=C(n,i)\r\nprint(y%M)", "N=1000007;m=int(1e9+7);sum=0;ans=0\r\nfact = [0 for i in range(0,1000007)]\r\ndef modularexponentiation(a:int,b:int,m:int):\r\n res = 1\r\n a = a%m\r\n \r\n while(b>0):\r\n if(b&1):res=(res*a)%m\r\n a = (a*a)%m\r\n b = b//2\r\n \r\n return res\r\n\r\ndef modinverse(a:int,m:int):\r\n return modularexponentiation(a,m-2,m)\r\n\r\na,b,n = [int(x) for x in input().split()]\r\n\r\nfact[0]=1\r\nfor i in range(1,N):\r\n fact[i] = (fact[i-1]*i)%m\r\n\r\nfor i in range(0,n+1):\r\n sum = a*i+b*(n-i)\r\n while(sum>0):\r\n if(sum%10!=a and sum%10!=b):break\r\n sum=sum//10\r\n \r\n if(sum==0):\r\n ans=(ans+fact[n]*modinverse((fact[i]*fact[n-i])%m,m))%m\r\n\r\nprint(ans)\r\n " ]

{"inputs": ["1 3 3", "2 3 10", "6 8 14215", "4 9 104671", "6 7 78755", "1 8 265", "3 9 37413", "1 7 49055", "3 4 11028", "2 6 32377", "3 5 80791", "4 8 11857", "1 3 10785", "4 6 11808", "1 2 11857", "2 4 88193", "1 4 37226", "2 5 53049", "3 6 1000000", "7 9 999999", "8 9 999999", "3 8 1000000", "2 8 999999", "1 6 997695", "1 5 997694", "5 9 997693", "5 8 997690", "7 8 2", "6 9 1", "8 9 111111", "8 9 1000000", "1 2 1000000"], "outputs": ["1", "165", "651581472", "329390901", "0", "461320265", "461358757", "461364774", "461668105", "887598327", "999993599", "999991923", "999952603", "999925731", "999991923", "999976846", "999970594", "259705254", "786609214", "53911803", "447886447", "0", "0", "0", "0", "0", "21735480", "0", "2", "900401372", "573697309", "786609214"]}

UNKNOWN

PYTHON3

CODEFORCES

54

d45fb32c9fa52c71f3024a033629d604

Shift It!

There is a square box 6<=×<=6 in size. It contains 36 chips 1<=×<=1 in size. Those chips contain 36 different characters — "0"-"9" and "A"-"Z". There is exactly one chip with each character. You are allowed to make the following operations: you may choose one of 6 rows or one of 6 columns and cyclically shift the chips there to one position to the left or to the right (for the row) or upwards or downwards (for the column). Those operations are allowed to perform several times. To solve the puzzle is to shift the chips using the above described operations so that they were written in the increasing order (exactly equal to the right picture). An example of solving the puzzle is shown on a picture below. Write a program that finds the sequence of operations that solves the puzzle. That sequence should not necessarily be shortest, but you should not exceed the limit of 10000 operations. It is guaranteed that the solution always exists. The input data are represented by 6 lines containing 6 characters each. They are the puzzle's initial position. Those lines contain each character from the string "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ" exactly once. On the first line print number *n*, which is the number of operations. On the next *n* lines print the sequence of operations one per line. An operation is described by a word consisting of two characters. The first character shows the direction where the row or the column will be shifted. The possible directions are "L", "R" (to the left, to the right correspondingly, we shift a row), "U", "D" (upwards, downwards correspondingly, we shift a column). The second character is the number of the row (or the column), it is an integer from "1" to "6". The rows are numbered from the top to the bottom, the columns are numbered from the left to the right. The number of operations should not exceed 104. If there are several solutions, print any of them. Sample Input 01W345 729AB6 CD8FGH IJELMN OPKRST UVQXYZ Sample Output 2 R2 U3

[ "ls=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\ns,cnt,a1,a2=[],0,[],[]\nfor i in range(6):\n\ts.append(list(input()))\n\ndef add(c,i):\n\tglobal cnt\n\tcnt+=1\n\ta1.append(c)\n\ta2.append(i)\n\ndef right(i):\n\tadd('R',i+1)\n\ttmp=s[i][5]\n\tfor j in range(5,0,-1):\n\t\ts[i][j]=s[i][j-1]\n\ts[i][0]=tmp\n\ndef left(i):\n\tadd('L',i+1)\n\ttmp=s[i][0]\n\tfor j in range(5):\n\t\ts[i][j]=s[i][j+1]\n\ts[i][5]=tmp\n\ndef up(j):\n\tadd('U',j+1)\n\ttmp=s[0][j]\n\tfor i in range(5):\n\t\ts[i][j]=s[i+1][j]\n\ts[5][j]=tmp\n\ndef down(j):\n\tadd('D',j+1)\n\ttmp=s[5][j]\n\tfor i in range(5,0,-1):\n\t\ts[i][j]=s[i-1][j]\n\ts[0][j]=tmp\n\ndef chg(i1,j1,i2,j2):\n\tif i1==i2:\n\t\tright(i1);up(j1);right(i1);down(j1)\n\t\tright(i1);up(j1);right(i1);down(j1)\n\t\tright(i1);up(j1);right(i1);right(i1);down(j1)\n\telse:\n\t\tdown(j1);left(i1);down(j1);right(i1)\n\t\tdown(j1);left(i1);down(j1);right(i1)\n\t\tdown(j1);left(i1);down(j1);down(j1);right(i1)\n\nfor i in range(6):\n\tfor j in range(6):\n\t\ttoch=ls[i*6+j]\n\t\tfor ni in range(6):\n\t\t\tfor nj in range(6):\n\t\t\t\tif s[ni][nj]==toch:\n\t\t\t\t\tii,jj=ni,nj\n\t\t\t\t\twhile jj>j:\n\t\t\t\t\t\tchg(ii,jj-1,ii,jj)\n\t\t\t\t\t\tjj-=1\n\t\t\t\t\twhile jj<j:\n\t\t\t\t\t\tchg(ii,jj,ii,jj+1)\n\t\t\t\t\t\tjj+=1\n\t\t\t\t\twhile ii>i:\n\t\t\t\t\t\tchg(ii-1,jj,ii,jj)\n\t\t\t\t\t\tii-=1\nprint(cnt)\nfor i in range(cnt):\n\tprint(a1[i]+str(a2[i]))" ]

{"inputs": ["01W345\n729AB6\nCD8FGH\nIJELMN\nOPKRST\nUVQXYZ", "012345\n6789AB\nCDEFGH\nIJKLMN\nOPQRST\nUVWXYZ", "102345\n6789AB\nCDEFGH\nIJKLMN\nOPQRST\nUVWXYZ", "234501\n789AB6\nGHCDEF\nIJKLMN\nRSTOPQ\nZUVWXY", "2X4501\n6783AB\nDE9GHC\nIJKFMN\nOPQLST\nZUVWRY", "0123A5\n67894B\nCDEFGH\nIKJLMN\nOPQRST\nUVWXZY", "ZYXWVU\nTSRQPO\nNMLKJI\nHGFEDC\nBA9876\n543210", "06CIOU\n17DJPV\n28EKQW\n39FLRX\n4AGMSY\n5BHNTZ", "RSTYWU\nLMNXQO\nFGHVKI\n9ABPEC\n345J86\nZD7210", "THEFIV\n3BOX1N\nGW2ZAR\nDSJUMP\nQ04CKL\nY56789", "VRLJQP\nT74WZI\nDMAHO3\n56N0G2\nUCSBK9\nXEF81Y", "C2OYNI\nUGLRHF\nDB71XV\nE3S4WM\n60A9Q5\nJKTP8Z", "PW9Z6H\n2TYJK4\nMO7SLR\nEQBDUF\nN1G0A5\n38VICX", "3YHMUB\nNDA1S5\nP87XI2\nVC6JTO\nRG09ZL\nKQFWE4", "4X1VB8\nYD0OIM\n5EANT2\nUG7CPH\n9SJWLR\nK6ZFQ3", "NTMUDA\nQW6GKY\n428B17\n0OVZ95\nRICLHJ\nFSP3EX", "3IDLYQ\n1X0ZMG\nC45SUP\nBAJW26\nFNOK98\nTR7HVE", "WUNP5G\n1CFY38\nL6ZO4I\nKJQV2H\nRADX97\nT0MBSE", "5OZ4R2\nVBM6N7\nWDXP3T\nE0QFGK\nJSL1H9\nA8IUCY", "IPWND8\nOK1QBZ\n5FG69R\nYCH2M4\n30TVJX\nSLUA7E", "DYI8NC\nJ15LQG\nPF2EMH\n493KRZ\nTBVAWS\nU7XO06", "EL685I\nY3DMJ7\nNF41ZA\n2WOBTQ\n0VKXCP\nSUHG9R", "H6EMA2\n7PB85W\nGLJOC3\nSDUR9Y\nQIKNZ1\nTX0FV4", "98WBZN\n61GQO3\nSIFUPT\nKMJ5VL\nH2XRDY\n07CA4E", "KP3HOS\nE7C5BY\nUMGDI4\nFLRV1T\n6JW9NX\n280ZQA", "K5871J\nMUEZGC\nPHN4AY\nIWVT2Q\nXRFS36\n9DBO0L", "7ZIRA4\nH32WE5\n89DGM0\nCV6BNP\nQF1XSO\nLTJKYU", "84W1IC\nN0PQM3\nGJZOYT\nV95SXK\nRBAUHE\nFD62L7", "89RM1A\nLIOK0Q\n73ET6V\nH5C4YF\nUXZ2NS\nGPDJBW", "LMD0PA\nWT6EV1\nF9ZRUY\nBJ348S\nKHXONI\n7C25GQ", "VRFM60\nNTBC7L\nYGPJS8\nIDWZHE\nXO1AQ5\n93K2U4", "LWQ4MB\nYFCUAO\n56IRT1\nS2DNXJ\nPEK0Z7\n39HVG8", "HY2UQM\nGKPI0S\nVW39T4\nE8X5CA\n6O1DLJ\n7NFBRZ", "LDVNCS\nZOB538\nK19R67\nX2JPEA\nTHWG40\nUYMFIQ", "6R9DOW\n50QB3L\n4ZMKXH\nNG1A2V\nETYU87\nSFPIJC", "G2OTZ3\n5AINBQ\nJVXPHC\n7WKY8U\nLM0DER\n914FS6", "G1DVK5\nE72J3Z\nBLHAYU\n98X6SM\nQPO4CF\nRWTIN0", "A3LREJ\n8N2PG9\nW0US4M\nZ61DBO\nKVQ5IC\n7FTHYX", "4QG261\n9A0SUI\nTLHVXR\n8MP5N7\nWZJFYK\nBD3ECO", "UO5QLC\n4P083W\nFR1YJH\nZNMBA2\nKV6EDG\n79ISXT", "91O8D7\nVRS2AC\nWL6EXF\nIZ0JHY\n4NUKT3\nMQBPG5", "ELSOIZ\nNY5T37\n9HW4XG\n0V6JM8\nUQBPRD\n1FKA2C", "VQ5NS3\n20MX9P\nT8Y4WE\nJAUGI1\n6RZCOF\nKHBL7D", "MN0RQO\nKJE1X7\nIVAUWD\n3LHFYT\nG9S2ZP\n48B56C", "16GOTL\nYPBM3X\nDZ5EIC\nW7SAN0\nJ2V984\nKRFUQH", "JMIBO3\n5V6Q84\nXY1ZCK\nPHWRS7\nDE9G2L\n0UNAFT", "Z6PKUX\nIHJDMG\nQ1CRSN\n7VWYE8\n2LT30B\n9FAO45", "VDMF5J\nX3KSR8\n0PHQ67\n4CGIZE\n9ANLYO\n2UBT1W", "AH4SNR\nDX5B7C\nYVI2KT\nQ3LE1Z\nWGFU0M\n6J8O9P", "CJ9078\nSKVLGX\nO4YWM5\nI23ZDH\nB6PFTA\nNQERU1", "LMNIJK\nRSTOPQ\nXYZUVW\n345012\n9AB678\nFGHCDE", "345LMN\n9ABRST\nFGHXYZ\n012IJK\n678OPQ\nCDEUVW", "IJK012\nOPQ678\nUVWCDE\nLMN345\nRST9AB\nXYZFGH", "EDCHGF\n876BA9\n210543\nWVUZYX\nQPOTSR\nKJINML", "17825B\n06934A\nICFKMG\nJDELNH\nPVWQTZ\nOUXRSY", "987654\n3210ZY\nXWVUTS\nRQPONM\nLKJIHG\nFEDCBA", "ABCDEF\nGHIJKL\nMNOPQR\nSTUVWX\nYZ0123\n456789", "EFYZOP\nLKSTUV\nQR10CD\nXW76IJ\nBA32MN\n5498GH", "56789A\n4NOPQB\n3MXYRC\n2LWZSD\n1KVUTE\n0JIHGF", "KLMNOP\nJ6789Q\nI501AR\nH432BS\nGFEDCT\nZYXWVU"], "outputs": ["260\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nR2\nU4\nR2\nD4\nR2\nU4\nR2\nD4\nR2\nU4...", "0", "13\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1", "455\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2...", "403\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3...", "39\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5", "2340\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1625\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU4\nR3\nD4\nR3\nU4\nR3\nD4\nR3\nU...", "2925\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1586\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1599\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU...", "1482\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL...", "1404\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1469\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL...", "1443\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL...", "1534\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1534\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL...", "1469\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL...", "1287\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1430\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1352\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1404\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL...", "1235\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1430\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1365\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL...", "1443\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL...", "1196\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1586\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1469\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU...", "1521\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nU3\nR5\nD3\nR5\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU...", "1586\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1625\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nL3\nD4\nR3\nD4\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL...", "1482\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nL2\nD4\nR2\nD4\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1404\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1586\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU...", "1599\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1300\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU...", "1469\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL...", "1703\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL...", "1417\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU...", "1560\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nL5\nD5\nR5\nD5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nR4\nU4\nR4\nD4\nR4\nU4\nR4\nD4\nR4\nU...", "1651\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL...", "1547\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL...", "1820\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nU3\nR4\nD3\nR4\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU...", "1391\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nL4\nD5\nR4\nD5\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1300\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1443\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1560\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU...", "1638\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nL5\nD4\nR5\nD4\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL...", "1417\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nL6\nD5\nR6\nD5\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nL6\nD4\nR6\nD4\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nL6\nD3\nR6\nD3\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nL6\nD2\nR6\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1404\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nL4\nD1\nR4\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nL4\nD4\nR4\nD4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nL4\nD2\nR4\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "1521\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL...", "1365\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nL1\nD1\nR1\nD1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nL1\nD2\nR1\nD2\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nL1\nD5\nR1\nD5\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nL1\nD4\nR1\nD4\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nR3\nU4\nR3\nD4\nR3\nU4\nR3\nD4\nR3\nU...", "936\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nU3\nR2\nD3\nR2\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nD5\nL3\nD5\nR3\nD5\nL3\nD5\nR3\nD5\nL3...", "364\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nL1\nD3\nR1\nD3\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nU5\nR1\nD5\nR1\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nL2\nD5\nR2\nD5\nR1\nU6\nR1\nD6\nR1\nU6\nR1\nD6\nR1\nU6\nR1\nD6\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3...", "1170\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nL2\nD1\nR2\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nL2\nD2\nR2\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nL2\nD3\nR2\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nU3\nR1\nD3\nR1\nR1\nU4\nR1\nD4\nR1\nU4\nR1\nD4\nR1\nU...", "1508\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nL5\nD1\nR5\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nL5\nD2\nR5\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU...", "2028\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL5\nD3\nR5\nD3\nL5\nD3\nR5\nD3\nL...", "1287\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nU1\nR5\nD1\nR5\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nU1\nR4\nD1\nR4\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nU1\nR3\nD1\nR3\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nL6\nD1\nR6\nD1\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nU2\nR5\nD2\nR5\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nU2\nR4\nD2\nR4\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nU2\nR3\nD2\nR3\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU...", "1482\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nL3\nD1\nR3\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nU1\nR2\nD1\nR2\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nU1\nR1\nD1\nR1\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nL3\nD3\nR3\nD3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nL3\nD2\nR3\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nU2\nR2\nD2\nR2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nU2\nR1\nD2\nR1\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nL4\nD3\nR4\nD3\nR3\nU3\nR3\nD3\nR3\nU3\nR3\nD3\nR3\nU..."]}

UNKNOWN

PYTHON3

CODEFORCES

1

d4606777a789a26895f0e249ec9f7499

Kyoya and Permutation

Let's define the permutation of length *n* as an array *p*<==<=[*p*1,<=*p*2,<=...,<=*p**n*] consisting of *n* distinct integers from range from 1 to *n*. We say that this permutation maps value 1 into the value *p*1, value 2 into the value *p*2 and so on. Kyota Ootori has just learned about cyclic representation of a permutation. A cycle is a sequence of numbers such that each element of this sequence is being mapped into the next element of this sequence (and the last element of the cycle is being mapped into the first element of the cycle). The cyclic representation is a representation of *p* as a collection of cycles forming *p*. For example, permutation *p*<==<=[4,<=1,<=6,<=2,<=5,<=3] has a cyclic representation that looks like (142)(36)(5) because 1 is replaced by 4, 4 is replaced by 2, 2 is replaced by 1, 3 and 6 are swapped, and 5 remains in place. Permutation may have several cyclic representations, so Kyoya defines the standard cyclic representation of a permutation as follows. First, reorder the elements within each cycle so the largest element is first. Then, reorder all of the cycles so they are sorted by their first element. For our example above, the standard cyclic representation of [4,<=1,<=6,<=2,<=5,<=3] is (421)(5)(63). Now, Kyoya notices that if we drop the parenthesis in the standard cyclic representation, we get another permutation! For instance, [4,<=1,<=6,<=2,<=5,<=3] will become [4,<=2,<=1,<=5,<=6,<=3]. Kyoya notices that some permutations don't change after applying operation described above at all. He wrote all permutations of length *n* that do not change in a list in lexicographic order. Unfortunately, his friend Tamaki Suoh lost this list. Kyoya wishes to reproduce the list and he needs your help. Given the integers *n* and *k*, print the permutation that was *k*-th on Kyoya's list. The first line will contain two integers *n*, *k* (1<=≤<=*n*<=≤<=50, 1<=≤<=*k*<=≤<=*min*{1018,<=*l*} where *l* is the length of the Kyoya's list). Print *n* space-separated integers, representing the permutation that is the answer for the question. Sample Input 4 3 10 1 Sample Output 1 3 2 4 1 2 3 4 5 6 7 8 9 10

[ "#!/usr/bin/python3\n\narr = [1] * 51\n\nfor i in range(2, 51):\n arr[i] = arr[i - 1] + arr[i - 2]\n\nans = []\n\n\ndef generate(i, n, to):\n if i == n:\n assert to == 1\n print(\" \".join(map(str, ans)))\n return\n if i + 1 == n:\n ans.append(n)\n generate(i + 1, n, to)\n return\n if arr[n - i - 1] < to:\n ans.append(i + 2)\n ans.append(i + 1)\n generate(i + 2, n, to - arr[n - i - 1])\n else:\n ans.append(i + 1)\n generate(i + 1, n, to)\n\n \nn, k = map(int, input().split())\ngenerate(0, n, k)\n", "#! /usr/bin/env python3\n\ndef phib_gen(n):\n p = [1, 1]\n for i in range(2, n):\n p.append(p[-1] + p[-2])\n return tuple(p)\n\nn, k = tuple(map(int, input().split()))\n\nphib = phib_gen(n + 1)\n\ndef gen_sequence(n, k):\n while n > 0:\n if k >= phib[n - 1]:\n k -= phib[n - 1]\n n -= 2\n yield 2\n else:\n n -= 1\n yield 1\n\ndef gen_perm(n, k):\n elem = 1\n for i in gen_sequence(n, k):\n if i == 2:\n yield elem + 1\n yield elem\n elem += 2\n else:\n yield elem\n elem += 1\n\nprint(' '.join(map(str, gen_perm(n, k - 1))))\n", "G=range;n,k=map(int,input().split())\r\nfib=[1,1]+[0]*(n-1)\r\nfor i in G(2,n+1):fib[i]=fib[i-1]+fib[i-2]\r\ni=0;z=[0]*n\r\nwhile i<n:\r\n v=fib[n-i-1]\r\n if k<=v:z[i]=i+1;i+=1\r\n else:k-=v;z[i:i+2]=[i+2,i+1];i+=2\r\nprint(*z)", "f, res = [1, 1], []\r\nfor i in range(50):\r\n f.append(f[-1] + f[-2])\r\nn, k = map(int, input().split())\r\nnow, j = n - 1, 0\r\nfor i in range(n):\r\n res.append(i + 1)\r\nwhile k > 1:\r\n if k > f[now]:\r\n res[j], res[j + 1] = res[j + 1], res[j]\r\n k -= f[now]\r\n now -=1\r\n j += 1\r\nfor i in res:\r\n print(i, end = ' ')", "def getFibCode(x):\r\n result = []\r\n f =[1, 1]\r\n while f[-2] + f[-1] <= x:\r\n f.append(f[-2] + f[-1])\r\n for i in f[:0:-1]:\r\n if i <= x:\r\n result.append(1)\r\n x -= i\r\n else:\r\n result.append(0)\r\n return result\r\n\r\nn, k = tuple(map(int, input().split()))\r\nscheme = getFibCode(k - 1)\r\nanswer = list(range(1, n + 1))\r\nj = n - 1\r\nfor i in scheme[::-1]:\r\n if i == 1:\r\n answer[j - 1], answer[j] = answer[j], answer[j - 1]\r\n j -= 1\r\n else:\r\n j -= 1\r\n\r\nprint(' '.join(map(str, answer)))\r\n", "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (19) Kyoya and Permutation (Difficulty: 4) (http://codeforces.com/problemset/problem/553/B)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn, k = rints()\npos = [0] * (n + 1)\npos[0] = 1\npos[1] = 1\nfor i in range(2, n + 1):\n pos[i] = pos[i - 1] + pos[i - 2]\nperm = list(range(1, n + 1))\ni = 0\nwhile i < n - 1:\n if pos[n - i - 1] < k:\n perm[i] += 1\n perm[i + 1] -= 1\n k -= pos[n - i - 1]\n i += 2\n else:\n i += 1\nprint(' '.join(map(str, perm)))\n", "from bisect import bisect_left\r\n\r\nn, k = map(int, input().split())\r\nl = [1, 1, 2]\r\nfor i in range(90):\r\n l.append(l[-1] + l[-2])\r\n\r\nps = []\r\nleft = k\r\nwhile left > 0:\r\n nu = bisect_left(l, left)\r\n if nu-1 >= 1:\r\n left = left - l[nu-1]\r\n ps.append(n-nu)\r\n else:\r\n left = 0\r\n \r\nto_ret = list(map(str, (range(1, n+1))))\r\nfor i in ps:\r\n to_ret[i], to_ret[i+1] = to_ret[i+1], to_ret[i]\r\nprint(' '.join(to_ret))\r\n\r\n", "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\nfrom functools import lru_cache\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\nimport typing\n\n@lru_cache(maxsize=1000000)\ndef fib(n : int) -> int:\n if n == 0 or n == 1: return 1\n return fib(n - 1) + fib(n - 2)\n\ndef slv(lst : typing.List[int],k :int) -> typing.List[int]:\n n = len(lst)\n assert(n > 0 and 1 <= k <= fib(n))\n if n == 1:return lst\n if n == 2:\n if k == 1:return lst \n return [lst[1],lst[0]]\n # n >= 3\n if k <= fib(n - 1):\n return [lst[0]] + slv(lst[1:],k)\n return [lst[1],lst[0]] + slv(lst[2:],k - fib(n - 1))\n\n \ndef main():\n n,k = map(int,input().split())\n perm = [i + 1 for i in range(n)] \n ans = slv(perm,k)\n print(*ans)\n return 0\n\n\nif __name__ == \"__main__\":\n main()", "def F(n):\r\n a,b = 1,0\r\n for i in range(n):\r\n a,b = b,a+b\r\n return b\r\n\r\ndef ans(n,k):\r\n if n == 0:\r\n return []\r\n elif n == 1:\r\n return [1]\r\n elif k > F(n):\r\n return [2,1] + [i+2 for i in ans(n-2,k-F(n))]\r\n else:\r\n return [1] + [i+1 for i in ans(n-1,k)]\r\n\r\nn,k = map(int,input().split())\r\nprint(' '.join([str(i) for i in ans(n,k)]))\r\n", "l = [1, 2]\r\nfor i in range(1, 100):\r\n l.append(l[i]+l[i-1])\r\n if l[-1]>10**18:\r\n break\r\n\r\nl = [0, 0] + l\r\ndef perm(n, k):\r\n if n == 1 and k == 1:\r\n return [1]\r\n if n == 2 and k == 1:\r\n return [1, 2]\r\n if n == 2 and k == 2:\r\n return [2, 1]\r\n if k <= l[n]:\r\n return [1] + [i+1 for i in perm(n-1, k)]\r\n\r\n return [2, 1] + [i+2 for i in perm(n-2, k - l[n])]\r\n\r\nn, k = map(int, input().split(' '))\r\nprint(' '.join([str(x) for x in perm(n, k)]))\r\n\r\n", "__author__ = 'taras-sereda'\n\n\nn,k = map(int,input().split())\n\nfib = [0]*(n+1)\nfib[0], fib[1] = 1, 1\nfor i in range(2,n):\n fib[i] = fib[i-1] + fib[i-2]\n\nidx = 0\nres = [None]*n\nwhile (idx<n):\n if (k <= fib[n-idx-1]):\n res[idx] = idx + 1\n idx += 1\n else:\n k -= fib[n-idx-1]\n res[idx] = idx + 2\n res[idx+1] = idx + 1\n idx += 2\n\nprint(\" \".join(map(str,res)))\n", "from typing import List\n\ndef find_kth_permutation(n:int, k:int)->List[int]:\n fib = [0] * (n+1)\n fib[0] = fib[1] = 1\n for i in range(2, n+1):\n fib[i] = fib[i-1] + fib[i-2]\n \n idx = 0\n res = [0] * n\n while idx < n:\n if k <= fib[n-idx-1]:\n res[idx] = idx + 1\n idx += 1\n else:\n k -= fib[n-idx-1]\n res[idx] = idx + 2\n res[idx+1] = idx + 1\n idx += 2\n return res \nn, k = map(int, input().split())\nr = find_kth_permutation(n, k)\nprint(*r)\n", "import math\r\nimport sys\r\n\r\ndef fib(x):\r\n if x<1:\r\n return 0\r\n if x==1:\r\n return 1\r\n if x==2:\r\n return 2\r\n a=1\r\n b=2\r\n for i in range(0,x):\r\n c=a\r\n a=b\r\n b=c+b\r\n return b-a\r\n \r\n \r\n\r\n\r\ninp=list(map(int,input().split()))\r\n\r\nn=inp[0]\r\nk=inp[1]\r\nk2=k\r\nn2=n\r\nans=[]\r\nc=0\r\nwhile n2>0:\r\n\r\n f1=fib(n2-1)\r\n f2=fib(n2-2)\r\n\r\n if n2==1:\r\n ans.append(1+c)\r\n break\r\n \r\n if k2<=f1:\r\n ans.append(1+c)\r\n n2-=1\r\n c+=1\r\n else:\r\n ans.append(2+c)\r\n ans.append(1+c)\r\n c+=2\r\n n2-=2\r\n k2=k2-f1\r\n \r\n\r\n\r\nif n==1:\r\n ans=[1]\r\nif n==2 and k==1:\r\n ans=[1,2]\r\nif n==2 and k==2:\r\n ans=[2,1]\r\n\r\n\r\n\r\nfor i in range(0,n-1):\r\n print(str(ans[i]),end=\" \")\r\nprint(str(ans[n-1]))\r\n \r\n", "n, k = map(int, input().split())\nf = [1, 1]\nfor i in range(2, n):\n f.append(f[i-2] + f[i-1])\ni = n\nwhile i > 0:\n i -= 1\n if k > f[i]:\n print(n - i + 1, n - i, end = ' ')\n k -= f[i]\n i -= 1\n else:\n print(n - i, end = ' ')\n", "n, k = map(int, input().split())\r\na = [0 for i in range(n+1)]\r\na[0], a[1] = 1, 1\r\nfor i in range(2, n+1):\r\n a[i] = a[i-1] + a[i-2]\r\np = [i+1 for i in range(n)]\r\ni = 0\r\nwhile i < n:\r\n if k > a[n-1-i]:\r\n p[i], p[i+1] = p[i+1], p[i]\r\n k -= a[n-1-i]\r\n i += 2\r\n else: i += 1\r\np = [str(i) for i in p]\r\nprint(' '.join(p))\r\n\r\n ", "\"\"\"\r\n#If FastIO not needed, used this and don't forget to strip\r\n#import sys, math\r\n#input = sys.stdin.readline\r\n\"\"\"\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left, bisect_right\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n self.os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nfrom collections import defaultdict as dd, deque as dq\r\nimport math, string\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 10**9+7\r\n\r\n\"\"\"\r\n-I'm pretty confident that the internal ordering is only preserved in pairs\r\n-The cyclic pairs must be adjacent and of the form (i, i+1)\r\n-The pairs must already occupy the correct blocks\r\n\r\n[2,1] 3 [5,4] 6... etc\r\n\r\nSo the questions are: how many permutations begin with 1, and how many begin with 2?\r\nNumber beginning with 1 = dp[N-1][1] + dp[N-1][2]\r\nNumber beginning with 2 = dp[N-2][1] + dp[N-2][2]\r\n\r\n1 2 3 4 5 6\r\n1 2 3 4 (6 5)\r\n1 2 3 (5 4) 6\r\n1 2 (4 3) 5 6\r\n1 2 (4 3) (6 5)\r\n1 (3 2) 4 5 6\r\n1 (3 2) 4 (6 5)\r\n1 (3 2) (5 4) 6\r\n(2 1) 3 4 5 6\r\n(2 1) 3 4 (6 5)\r\n(2 1) 3 (5 4) 6\r\n(2 1) (4 3) 5 6\r\n(2 1) (4 3) (6 5)\r\n\r\n\"\"\"\r\n\r\n\r\ndef solve():\r\n N, K = getInts()\r\n if N == 1:\r\n print(1)\r\n return\r\n dp = [[0 for j in range(2)] for i in range(N+1)]\r\n dp[1][0] = 1\r\n dp[2][0] = 1\r\n dp[2][1] = 1\r\n for j in range(3,N+1):\r\n dp[j][0] = dp[j-1][0] + dp[j-1][1]\r\n dp[j][1] = dp[j-2][0] + dp[j-2][1]\r\n #there are sum(dp[N]) sequences, and we need to know whether K <= dp[N][0] or not\r\n ans = []\r\n to_fill = N\r\n curr = 1\r\n while len(ans) < N:\r\n if K <= dp[to_fill][0]:\r\n ans.append(curr)\r\n to_fill -= 1\r\n curr += 1\r\n else:\r\n K -= dp[to_fill][0]\r\n ans.append(curr+1)\r\n ans.append(curr)\r\n to_fill -= 2\r\n curr += 2\r\n print(*ans)\r\n return\r\n \r\n#for _ in range(getInt()):\r\nsolve()", "import math\r\n\r\n\r\ndef get_ans(n, k):\r\n a = []\r\n global fib\r\n if (n == 0):\r\n return a\r\n\r\n if (n == 1):\r\n a.append(1)\r\n return a\r\n\r\n if (k < fib[n - 1]):\r\n a.append(1)\r\n l = get_ans(n - 1, k)\r\n a.extend(l)\r\n return a\r\n else:\r\n a.append(2)\r\n a.append(1)\r\n l = get_ans(n - 2, k - fib[n - 1])\r\n a.extend(l)\r\n return a\r\n\r\n\r\nn, k = list(map(int, input().rstrip().split()))\r\nfib = [1, 1]\r\nfor i in range(2, n + 1):\r\n fib.append(fib[i - 1] + fib[i - 2])\r\n\r\na = get_ans(n, k - 1)\r\n\r\ni = 0\r\ncsum = 0\r\nwhile (i < n):\r\n c = a[i]\r\n for j in range(c):\r\n a[i] += csum\r\n i += 1\r\n csum += c\r\n\r\nfor i in range(n):\r\n print(a[i], ' ', sep = '', end = '')\r\nprint()", "n, k = list(map(int, input().split()))\r\n#n = int(input())\r\n#k = int(input())\r\nfib = [0] * (n + 1)\r\nfib[0] = 1\r\nfib[1] = 1\r\nres = [0] * n\r\nfor i in range(2, n):\r\n fib[i] = fib[i - 1] + fib[i - 2]\r\nidx = 0\r\nwhile idx < n:\r\n if k <= fib[n - idx - 1]:\r\n res[idx] = idx + 1\r\n idx += 1\r\n else:\r\n k -= fib[n - idx - 1]\r\n res[idx] = idx + 2\r\n res[idx + 1] = idx + 1\r\n idx += 2\r\nprint(*res)", "fib=[0,1,1]\r\nfor i in range(3,51):\r\n fib.append(fib[-1]+fib[-2])\r\nfor i in range(1,51):\r\n fib[i]+=fib[i-1]\r\nn,m=map(int,input().split())\r\nans=[0]*n\r\nleft=m\r\nlast=0\r\nfor i in range(n):\r\n if ans[i]!=0:\r\n continue\r\n for j in range(i+1,n+1):\r\n size=n-j\r\n if size==1:\r\n perms=1\r\n else:\r\n perms = fib[size - 1] + 1\r\n if perms>=left:\r\n ans[i]=j\r\n break\r\n else:\r\n left-=perms\r\n nlast=ans[i]\r\n t=i+1\r\n while(t<n and ans[t-1]!=last+1):\r\n ans[t]=ans[t-1]-1\r\n t+=1\r\n last=nlast\r\nprint(*ans)", "def kyoya(n, k):\n F = [None] * (n + 1)\n F[0] = F[1] = 1\n for i in range(2, len(F)):\n F[i] = F[i-1] + F[i-2]\n\n l = []\n i = n\n j = k\n while i > 1:\n if j > F[i-1]:\n j -= F[i-1]\n l.append(1)\n else:\n l.append(0)\n i -= 1\n # log(l)\n\n P = list(range(1, n+1))\n for i, b in enumerate(l):\n if b:\n P[i], P[i+1] = P[i+1], P[i]\n return P\n\n\ndef main():\n n, k = readinti()\n print(' '.join(map(str, kyoya(n, k))))\n\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4 3\n\"\"\", \"\"\"\\\n1 3 2 4\n\"\"\"), (\"\"\"\\\n10 1\n\"\"\", \"\"\"\\\n1 2 3 4 5 6 7 8 9 10\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n \n", "n, m = [int(x) for x in input().split()]\nF = [1,1]\nfor i in range(2, n): F.append(F[-1] + F[-2])\nperm = [i+1 for i in range(n)]\nfor i in range(n):\n if m > F[n-1 - i]:\n m -= F[n-1 -i]\n perm[i], perm[i+1] = perm[i+1], perm[i]\nfor k in perm: print(k, end = ' ')\n" ]

{"inputs": ["4 3", "10 1", "1 1", "50 1", "10 57", "50 20365011074", "20 9999", "49 12586269025", "49 1", "10 89", "10 1", "5 8", "5 1", "25 121393", "25 1", "1 1", "2 2", "3 3", "4 2", "5 8", "6 10", "7 20", "8 24", "9 1", "10 24", "11 77", "12 101", "13 240", "14 356", "15 463", "16 747", "17 734", "18 1809", "19 859", "20 491", "21 14921", "22 731", "23 45599", "24 47430", "25 58467", "26 168988", "27 298209", "28 77078", "29 668648", "30 582773", "31 1899100", "32 1314567", "33 1811927", "34 2412850", "35 706065", "36 7074882", "37 27668397", "38 23790805", "39 68773650", "40 43782404", "41 130268954", "42 40985206", "43 193787781", "44 863791309", "45 1817653076", "46 1176411936", "47 4199125763", "48 4534695914", "49 3790978105", "50 5608642004"], "outputs": ["1 3 2 4", "1 2 3 4 5 6 7 8 9 10", "1", "1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50", "2 1 3 4 5 6 7 8 10 9", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 50 49", "2 1 4 3 5 7 6 8 9 10 11 13 12 14 15 17 16 18 19 20", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 26 25 28 27 30 29 32 31 34 33 36 35 38 37 40 39 42 41 44 43 46 45 48 47 49", "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", "2 1 4 3 6 5 8 7 10 9", "1 2 3 4 5 6 7 8 9 10", "2 1 4 3 5", "1 2 3 4 5", "2 1 4 3 6 5 8 7 10 9 12 11 14 13 16 15 18 17 20 19 22 21 24 23 25", "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", "1", "2 1", "2 1 3", "1 2 4 3", "2 1 4 3 5", "2 1 3 4 6 5", "2 1 4 3 5 7 6", "2 1 3 4 5 7 6 8", "1 2 3 4 5 6 7 8 9", "1 2 4 3 5 6 7 9 8 10", "1 3 2 5 4 6 7 8 9 10 11", "1 3 2 4 5 6 8 7 10 9 11 12", "2 1 3 4 5 6 7 8 10 9 11 13 12", "1 3 2 5 4 6 8 7 10 9 12 11 14 13", "1 3 2 4 5 7 6 9 8 11 10 12 13 15 14", "1 3 2 4 5 7 6 9 8 11 10 12 13 14 15 16", "1 2 4 3 5 6 8 7 10 9 11 12 13 14 15 16 17", "1 3 2 4 5 6 8 7 10 9 11 12 14 13 16 15 18 17", "1 2 3 4 6 5 8 7 9 10 11 12 14 13 15 16 18 17 19", "1 2 3 4 5 6 8 7 9 11 10 12 14 13 15 16 18 17 19 20", "2 1 3 5 4 7 6 9 8 10 11 12 13 15 14 16 18 17 19 20 21", "1 2 3 4 5 6 7 9 8 10 11 13 12 14 16 15 18 17 19 21 20 22", "2 1 4 3 6 5 8 7 9 10 11 13 12 15 14 16 18 17 20 19 21 22 23", "2 1 3 4 5 6 7 8 10 9 11 12 13 14 16 15 17 19 18 21 20 22 24 23", "1 3 2 4 6 5 7 8 9 11 10 12 13 15 14 16 17 19 18 20 21 22 23 24 25", "2 1 4 3 5 6 7 8 9 10 12 11 13 15 14 16 17 18 19 20 21 23 22 24 26 25", "2 1 4 3 5 7 6 9 8 10 12 11 14 13 15 16 17 19 18 21 20 22 24 23 25 27 26", "1 2 3 5 4 6 7 8 9 10 11 13 12 14 16 15 17 18 20 19 22 21 23 24 25 27 26 28", "2 1 3 5 4 6 8 7 9 10 12 11 13 14 15 16 17 19 18 20 22 21 23 25 24 26 27 29 28", "1 3 2 4 5 6 8 7 10 9 11 13 12 14 15 16 17 19 18 20 21 23 22 25 24 26 28 27 29 30", "2 1 4 3 5 6 7 8 10 9 11 13 12 15 14 16 17 19 18 21 20 23 22 24 26 25 28 27 29 31 30", "1 2 4 3 6 5 8 7 9 11 10 13 12 14 16 15 18 17 19 20 22 21 23 24 25 26 27 28 30 29 32 31", "1 2 4 3 5 7 6 9 8 10 11 13 12 15 14 16 18 17 19 21 20 22 23 24 25 26 27 28 29 31 30 32 33", "1 2 4 3 5 6 7 9 8 10 11 13 12 14 16 15 18 17 19 20 21 22 23 25 24 26 28 27 29 31 30 32 34 33", "1 2 3 4 5 6 8 7 9 11 10 13 12 15 14 16 18 17 20 19 21 23 22 25 24 27 26 28 29 31 30 32 33 35 34", "1 2 4 3 5 7 6 8 9 10 11 12 13 14 16 15 18 17 19 20 22 21 23 25 24 26 27 28 30 29 32 31 33 34 35 36", "2 1 3 4 5 7 6 9 8 11 10 13 12 15 14 16 18 17 19 21 20 23 22 24 25 26 28 27 30 29 32 31 34 33 35 36 37", "1 2 4 3 6 5 8 7 10 9 11 12 14 13 15 16 18 17 20 19 21 22 24 23 25 27 26 29 28 31 30 32 33 34 36 35 38 37", "2 1 3 4 5 6 8 7 10 9 12 11 13 15 14 16 17 19 18 20 21 23 22 24 26 25 28 27 29 31 30 32 33 34 35 36 37 39 38", "1 2 4 3 5 6 7 9 8 10 12 11 14 13 15 16 17 18 20 19 21 22 23 25 24 26 28 27 29 31 30 32 34 33 36 35 37 39 38 40", "1 3 2 4 6 5 7 8 10 9 11 12 13 14 16 15 17 19 18 20 21 23 22 25 24 26 27 28 30 29 31 32 34 33 35 36 37 38 39 41 40", "1 2 3 4 6 5 7 8 9 10 11 13 12 15 14 16 17 18 19 21 20 22 24 23 25 26 28 27 29 30 31 33 32 35 34 36 37 39 38 40 42 41", "1 2 4 3 5 6 8 7 9 10 12 11 13 14 16 15 17 18 19 20 21 22 24 23 25 26 27 28 29 30 31 32 33 35 34 36 38 37 39 40 41 43 42", "2 1 3 4 6 5 8 7 10 9 12 11 13 14 15 16 18 17 19 20 21 22 23 24 26 25 27 29 28 31 30 32 34 33 36 35 38 37 40 39 41 42 44 43", "2 1 4 3 6 5 8 7 9 11 10 12 14 13 16 15 18 17 19 20 22 21 24 23 25 27 26 29 28 30 32 31 34 33 35 36 38 37 39 40 42 41 43 44 45", "1 3 2 4 5 6 7 8 10 9 11 12 13 14 16 15 17 18 19 21 20 22 23 25 24 27 26 29 28 31 30 32 34 33 35 37 36 38 40 39 41 42 43 44 46 45", "2 1 4 3 5 6 7 8 10 9 12 11 13 14 16 15 18 17 20 19 22 21 23 24 25 27 26 28 30 29 31 32 33 34 36 35 38 37 39 40 41 43 42 44 45 46 47", "1 3 2 5 4 6 8 7 10 9 12 11 14 13 15 17 16 18 19 21 20 23 22 25 24 26 27 28 29 30 31 32 33 34 36 35 37 38 40 39 41 43 42 44 46 45 47 48", "1 2 4 3 5 7 6 8 9 11 10 12 13 15 14 16 17 18 19 21 20 22 24 23 25 27 26 28 30 29 31 33 32 35 34 37 36 38 39 41 40 42 44 43 45 47 46 48 49", "1 2 4 3 5 6 8 7 9 10 11 13 12 15 14 17 16 18 20 19 22 21 23 24 25 26 28 27 30 29 31 32 33 34 35 36 38 37 40 39 42 41 44 43 45 46 47 48 50 49"]}

UNKNOWN

PYTHON3

CODEFORCES

21

d462df4068f05173ec26a6fb99d24783

Right Triangles

You are given a *n*<=×<=*m* field consisting only of periods ('.') and asterisks ('*'). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of '*'-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle). The first line contains two positive integer numbers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=1000). The following *n* lines consist of *m* characters each, describing the field. Only '.' and '*' are allowed. Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d). Sample Input 2 2 ** *. 3 4 *..* .**. *.** Sample Output 1 9

[ "n,m=map(int,input().split())\r\nc,r=[0]*n,[0]*m\r\nvals=[]\r\nfor i in range(n):\r\n s=input()\r\n vals.append(s)\r\n for j in range(m):\r\n if(s[j]=='*'):\r\n c[i]+=1\r\n r[j]+=1\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(vals[i][j]=='*'):\r\n ans+=(c[i]-1)*(r[j]-1)\r\nprint(ans)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m = map(int, input().split())\r\na = ([[0] * (m + 2)]\r\n + [[0] + list(1 if c == '*' else 0 for c in input().rstrip()) + [0] for _ in range(n)]\r\n + [[0] * (m + 2)])\r\n\r\nlr = [[0] * (m + 2) for _ in range(n + 2)]\r\nud = [[0] * (m + 2) for _ in range(n + 2)]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 2):\r\n lr[i][j] = lr[i][j - 1] + a[i][j]\r\n\r\nfor j in range(1, m + 1):\r\n for i in range(1, n + 2):\r\n ud[i][j] = ud[i - 1][j] + a[i][j]\r\n\r\nans = 0\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if a[i][j]:\r\n l, r, u, d = lr[i][j - 1], lr[i][-1] - lr[i][j], ud[i - 1][j], ud[-1][j] - ud[i][j]\r\n ans += u * r + r * d + d * l + l * u\r\n\r\nprint(ans)\r\n", "n,m=list(int(i) for i in input().split())\r\nA=[[0 for i in range(m)]for j in range(n)]\r\nfor i in range(n):\r\n x=input()\r\n for j in range(m):\r\n A[i][j]=x[j]\r\nrow=[0 for i in range(n)]\r\ncolumn=[0 for i in range(m)]\r\nfor i in range(n):\r\n sum=0\r\n for j in range(m):\r\n if A[i][j]==\"*\":\r\n sum+=1\r\n row[i]=sum\r\nfor i in range(m):\r\n sum=0\r\n for j in range(n):\r\n if A[j][i]==\"*\":\r\n sum+=1\r\n column[i]=sum\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"*\":\r\n ans+=(row[i]-1)*(column[j]-1)\r\nprint(ans)\r\n", "n, m =map(int, input().split())\r\ny = m*[0]\r\nx = []\r\nc = []\r\nfor i in range(n):\r\n s = input()\r\n x.append(s.count('*'))\r\n for j in range(m):\r\n if s[j] == '*':\r\n y[j] += 1\r\n c.append(s)\r\nz = 0\r\nfor x1 in range(len(c)):\r\n for y1 in range(len(c[x1])):\r\n if c[x1][y1] == '*':\r\n z += (y[y1]-1) * (x[x1]-1)\r\nprint(z)", "input_str = input\r\nn, m = map(int, input_str().split())\r\ngrid = [list(input_str()) for _ in range(n)]\r\nrow_counts = [row.count('*') for row in grid]\r\ncolumn_counts = [col.count('*') for col in zip(*grid)]\r\ntotal = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n total += (row_counts[i] - 1) * (column_counts[j] - 1)\r\nprint(total)\r\n", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\n\r\ncnt_rows = [0] * n\r\ncnt_cols = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n cnt_rows[i] +=1\r\n cnt_cols[j] += 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n res += (cnt_cols[j] - 1) * (cnt_rows[i] - 1)\r\nprint(res)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nr = [0] * n\r\nc = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n r[i] += 1\r\n c[j] += 1\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n s += (r[i] - 1) * (c[j] - 1)\r\nprint(s)\r\n", "def process(M):\r\n n = len(M)\r\n m = len(M[0])\r\n d1 = {}\r\n d2 = {}\r\n points = set([])\r\n answer = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if M[i][j]=='*':\r\n points.add((i, j))\r\n if i not in d1:\r\n d1[i] = 0\r\n if j not in d2:\r\n d2[j] = 0\r\n d1[i]+=1\r\n d2[j]+=1\r\n for i, j in points:\r\n a1 = d1[i]-1\r\n a2 = d2[j]-1\r\n answer = answer+(a1*a2)\r\n return answer\r\n \r\n\r\nn, m = [int(x) for x in input().split()]\r\nM = []\r\nfor i in range(n):\r\n row = input()\r\n M.append(row)\r\nprint(process(M))", "a,b = map(int,input().split())\r\nmatrix = []\r\nscoluna = [0 for i in range(b)]\r\nslinha = [0 for i in range(a)]\r\nfor i in range(a):\r\n matrix.append(input())\r\n for j in range(b):\r\n if matrix[-1][j] == \".\":\r\n continue\r\n slinha[i] = slinha[i] + 1\r\n scoluna[j] = scoluna[j] + 1\r\n# print(scoluna,slinha)\r\nres = 0\r\nfor i in range(a):\r\n # print(matrix[i])\r\n for j in range(b):\r\n # print(matrix[i][j],end = ' ')\r\n if matrix[i][j] == \"*\":\r\n res += (scoluna[j]-1)*(slinha[i]-1)\r\n# print(slinha[i])\r\n# print(scoluna)\r\nprint(res)", "u=input\nn,m=map(int,u().split())\nl=[list(u()) for _ in range(n)]\nR=[p.count('*') for p in l]\nC=[p.count('*') for p in zip(*l)]\nt=0\nfor i in range(n):\n for j in range(m):\n if(l[i][j]=='*'):\n t+=(R[i]-1)*(C[j]-1)\nprint(t)", "u=input\r\nn,m=map(int,u().split())\r\nl=[list(u()) for _ in range(n)]\r\nR=[p.count('*') for p in l]\r\nC=[p.count('*') for p in zip(*l)]\r\nt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='*'):\r\n t+=(R[i]-1)*(C[j]-1)\r\nprint(t)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,M=map(int,readline().split())\r\ngrid=[readline().rstrip() for n in range(N)]\r\ncntN=[0]*N\r\ncntM=[0]*M\r\nfor n in range(N):\r\n for m in range(M):\r\n if grid[n][m]==\"*\":\r\n cntN[n]+=1\r\n cntM[m]+=1\r\nans=0\r\nfor n in range(N):\r\n for m in range(M):\r\n if grid[n][m]==\"*\":\r\n ans+=(cntN[n]-1)*(cntM[m]-1)\r\nprint(ans)", "\r\nn,m = map(int,input().split())\r\nma = []\r\nfor i in range(n):\r\n ma.append(input())\r\nx = [0] * n\r\ny = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if ma[i][j] == \"*\":\r\n x[i] += 1\r\n y[j] += 1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if ma[i][j] == \"*\":\r\n ans += (x[i] - 1) * (y[j] - 1)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nz=[]\r\nzn=[0]*n\r\nzm=[0]*m\r\nfor i in range(n):\r\n s=input()\r\n z.append(s)\r\n for j in range(m):\r\n if s[j]=='*':\r\n zm[j]+=1\r\n zn[i]=s.count('*')\r\nk=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if z[i][j]=='*':\r\n k+= (zm[j]-1) * (zn[i]-1)\r\nprint(k)", "n, m = map(int, input().split())\r\nlin = []\r\nkol_stroka = [0 for _ in range(n)]\r\nkol_stolb = [0 for _ in range(m)]\r\nfor i in range(n):\r\n lin.append(list(input()))\r\n k = 0\r\n for j in range(len(lin[i])):\r\n if lin[i][j] == '*':\r\n k += 1\r\n kol_stolb[j] += 1\r\n kol_stroka[i] += k\r\ncounter = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if lin[i][j] == '*':\r\n counter += (kol_stroka[i] - 1) * (kol_stolb[j] - 1)\r\nprint(counter)", "n, m = map(int, input().split())\nA = [\"\" for i in range(n)]\nfor i in range(n):\n\tA[i] = input()\nR = [0 for i in range(n)]\nC = [0 for i in range(m)]\nfor i in range(n):\n\tfor j in range(m):\n\t\tif A[i][j] == '*':\n\t\t\tR[i] += 1\n\t\t\tC[j] += 1\nans = 0\nfor i in range(n):\n\tfor j in range(m):\n\t\tif (A[i][j] == '*'):\n\t\t\tans += (R[i] - 1) * (C[j] - 1)\nprint(ans)\n\n \t \t \t\t\t \t \t \t \t\t\t \t \t \t", "n,m=list(map(int,input().split()))\r\na=[input() for i in range(n)]\r\nb=[-1]*n\r\nc=[-1]*m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n b[i]+=1\r\n c[j]+=1\r\nd=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n d+=b[i]*c[j]\r\nprint(d)", "n,m=map(int,input().split())\r\nA=[input().strip() for i in range(n)]\r\n\r\nR=[0]*n\r\nC=[0]*m\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"*\":\r\n R[i]+=1\r\n C[j]+=1\r\n\r\nANS=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\"*\":\r\n ANS+=(R[i]-1)*(C[j]-1)\r\n\r\nprint(ANS)\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\na = [[0 for _ in range(m)] for i in range(n)]\r\nb = [[0 for _ in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n a[i][j] = a[i][j - 1] + (grid[i][j] == '*')\r\n if i:\r\n b[i][j] = b[i - 1][j]\r\n b[i][j] += grid[i][j] == '*'\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n l = r = u = d = 0\r\n if j:\r\n l = a[i][j - 1]\r\n r = a[i][-1] - a[i][j]\r\n if i:\r\n u = b[i - 1][j]\r\n d = b[-1][j] - b[i][j]\r\n ans += (l + r) * (u + d)\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nst = [0] * n\r\nstb = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n st[i] += 1\r\n stb[j] += 1\r\n#print(st)\r\n#print(stb)\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n ans += (st[i]- 1) * (stb[j] - 1)\r\nprint(ans)\r\n", "import sys\n\n\nreadline = sys.stdin.readline\nN, M = 0, 0\nmatrix = []\n\ndef read_input():\n global N, M, matrix\n N, M = [int(w) for w in readline().split()]\n matrix = [[0] * M for _ in range(N)]\n for i in range(N):\n line = readline().strip()\n for j in range(M):\n if line[j] == '*':\n matrix[i][j] = 1\n\ndef solve()->int:\n row_cnt = [0] * N\n col_cnt = [0] * M\n for r in range(N):\n for c in range(M):\n row_cnt[r] += matrix[r][c]\n col_cnt[c] += matrix[r][c]\n result = 0\n for r in range(N):\n for c in range(M):\n if matrix[r][c] == 1:\n result += (row_cnt[r] - 1) * (col_cnt[c] - 1)\n return result\n\ndef write_output(result: int):\n print(result)\n\n\nread_input()\nwrite_output(solve())\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\na = [i.count('*') for i in g]\r\nb = [i.count('*') for i in zip(*g)]\r\nc = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == '*':\r\n c += (a[i]-1)*(b[j]-1)\r\nprint(c)" ]

{"inputs": ["2 2\n**\n*.", "3 4\n*..*\n.**.\n*.**", "3 2\n..\n..\n*.", "1 2\n**", "1 3\n*.*", "5 2\n*.\n**\n.*\n..\n.*", "2 3\n...\n..*", "10 9\n..*..**..\n*.*...**.\n.*...*.*.\n.*****.*.\n.*.*.**.*\n.**.*....\n**.......\n**..*.*.*\n*.*.**.*.\n*.*.*.*.*", "2 3\n.*.\n**.", "5 3\n**.\n..*\n*.*\n*.*\n*..", "4 2\n**\n**\n.*\n**", "5 2\n**\n**\n**\n*.\n*.", "2 3\n***\n.*.", "4 2\n.*\n.*\n..\n..", "10 26\n..**..***.**.*.***.*.***.*\n*.*.*..***.*.**..*********\n*.*.*...***.*.*.*.**....*.\n..**.**.....*....***..***.\n**..*******.*..**.********\n*.**..****.***....***..***\n.*..**.*****.**.**..******\n.*.*...***.*.**.*..**.***.\n*****....**..*..**.*******\n....*******...***.*...****", "20 11\n...*.....*.\n..**..*....\n....*..***.\n...*.......\n.*..*..*..*\n.*.*....**.\n....*..**.*\n..*.*..*...\n.*....*.**.\n.*.*****...\n.**.***....\n.....*...*.\n.....*..*..\n.*...*.....\n...**..*...\n.*.*.*.***.\n.*...**....\n...*.......\n...*....**.\n.*.....*..*", "14 29\n**.*************..*.*********\n**..****.*********.**.*.****.\n********.**..*..*...*....**..\n****.**.***.*.***..*..***.*..\n***.****.***..*.***.*.****.*.\n*.*..***.***********.*.*.****\n****.*.***.*..****.**.**..***\n.*******..**...***.*.********\n*...**********...**...*.***.*\n*.******...*.***.**..****...*\n.******...**.*..*************\n.*.******.**.*****..****.**..\n**...*****.*.*.*.*.*.*****..*\n**.****...**.*******..***.***", "13 26\n.**.****.*****************\n*************.**.*.*******\n.*.***.*********..********\n******.******.**.**.*****.\n.******.*************.*.**\n***********.*.************\n**.***.**.*.*********.*.**\n******.*****************.*\n*****.***.*.**********.***\n*.************************\n************.*************\n*..*******.******.********\n******.***.**.*.******.***", "2 1\n.\n.", "2 1\n*\n*", "1 1\n.", "1 1\n*"], "outputs": ["1", "9", "0", "0", "0", "3", "0", "541", "1", "13", "15", "18", "2", "0", "12950", "1129", "48985", "65889", "0", "0", "0", "0"]}

UNKNOWN

PYTHON3

CODEFORCES

22

d4718bd75cf416c1554ff23d9d429005

About Bacteria

Qwerty the Ranger took up a government job and arrived on planet Mars. He should stay in the secret lab and conduct some experiments on bacteria that have funny and abnormal properties. The job isn't difficult, but the salary is high. At the beginning of the first experiment there is a single bacterium in the test tube. Every second each bacterium in the test tube divides itself into *k* bacteria. After that some abnormal effects create *b* more bacteria in the test tube. Thus, if at the beginning of some second the test tube had *x* bacteria, then at the end of the second it will have *kx*<=+<=*b* bacteria. The experiment showed that after *n* seconds there were exactly *z* bacteria and the experiment ended at this point. For the second experiment Qwerty is going to sterilize the test tube and put there *t* bacteria. He hasn't started the experiment yet but he already wonders, how many seconds he will need to grow at least *z* bacteria. The ranger thinks that the bacteria will divide by the same rule as in the first experiment. Help Qwerty and find the minimum number of seconds needed to get a tube with at least *z* bacteria in the second experiment. The first line contains four space-separated integers *k*, *b*, *n* and *t* (1<=≤<=*k*,<=*b*,<=*n*,<=*t*<=≤<=106) — the parameters of bacterial growth, the time Qwerty needed to grow *z* bacteria in the first experiment and the initial number of bacteria in the second experiment, correspondingly. Print a single number — the minimum number of seconds Qwerty needs to grow at least *z* bacteria in the tube. Sample Input 3 1 3 5 1 4 4 7 2 2 4 100 Sample Output 230

[ "def mikroby(k, b, n, t):\r\n z = 1\r\n while z <= t:\r\n z = k * z + b\r\n n -= 1\r\n return max(n + 1, 0)\r\n\r\n\r\nK, B, N, T = [int(i) for i in input().split()]\r\nprint(mikroby(K, B, N, T))\r\n", "entrada=input().split(\" \")\r\nlistae = list(map(int, entrada))#Convertir strs a int\r\nstock=1#comienza con 1 \r\nwhile(listae[0]*stock+listae[1]<=listae[3] and listae[2]>0):#las que llevo<las que están en el tubo\r\n stock=listae[0]*stock+listae[1]#las que llevo\r\n listae[2]-=1#timer, descuenta los segundos del tiempo necesario en prueba 1\r\nprint(listae[2])\r\n#refresh de cada segundo\r\n", "k,b,n,t=map(int,input().split())\na=1\ncnt=0\nfor i in range(1,n+1):\n a=a*k+b\n if a<=t:\n cnt=i\n else:\n break\nprint(n-cnt)", "from math import *\r\nk,b,n,t = map(int,input().split())\r\nif k == 1:\r\n print(max(ceil((n*b+1-t)/b),0))\r\nelse:\r\n print(max(ceil(log(((b-1)+k)/((k-1)*t+b),k)+n),0))", "k, b, n, t = map(int,input().split())\r\nans, i = (t*(k-1)+b)/(k-1+b), 0\r\nif k == 1 :\r\n while 1+n*b-t > i*b :\r\n i += 1\r\n print(i)\r\nelse :\r\n while ans >= k**i :\r\n i += 1\r\n print(max(0,n-i+1))", "k, b, n, t = list( map( int, input().split() ) )\r\n \r\ndef f( n, k, b, t ):\r\n \r\n population = 1\r\n \r\n while population <= t:\r\n population = k * population + b\r\n n -= 1\r\n \r\n return ( max( 0, n+1 ) )\r\n \r\nprint( f( n, k, b, t ) )", "from math import ceil, log\r\nk, b, n, t = map(int, input().split())\r\nif k == 1:\r\n need = 1 + b * n\r\n print(max(0, (need - t + b - 1) // b))\r\n\r\nelse:\r\n k -= 1\r\n print(max(ceil(log((k + b) / (t * k + b)) / log(k + 1) + n), 0))", "k, b, n, t = map(int, input().split())\r\nz = 1\r\nres = int(n)\r\n\r\nfor i in range(n):\r\n z = k*z + b\r\n if z <= t:\r\n res -= 1\r\n else:\r\n break\r\n\r\nprint(res)", "k,b,n,t = [int(x) for x in input().split(\" \")]\r\nz = 1\r\nwhile k*z+b<=t:\r\n z = k*z+b\r\n n -= 1\r\nprint(max(n,0))", "k,b,n,t=map(int,input().split())\nx=1\nwhile x<=t:\n\tx,n=x*k+b,n-1\nprint (max(0,n+1))", "a=input()\r\nz=1\r\na=a.split(' ')\r\nlista=list(map(int,a))\r\n\r\ncontador=0\r\nk=lista[0]\r\nt=lista[-1]\r\nb=lista[1]\r\nn=lista[-2]\r\nwhile z<=t:\r\n z=k*z+b\r\n contador+=1\r\nformula=n-contador+1\r\nif formula<0:\r\n print(\"0\")\r\nelse:\r\n print(formula)\r\n \r\n", "k, b, n, t = map(int, input().split())\r\ncur = 1\r\ndec = 1\r\nwhile (dec <= n):\r\n cur = cur * k + b\r\n if (cur > t):\r\n break\r\n dec += 1\r\nprint(n - dec + 1)\r\n", "s = input().split(' ')\r\nk = int(s[0])\r\nb = int(s[1])\r\nn = int(s[2])\r\nt = int(s[3])\r\n\r\nct = 1\r\nwhile ( ct <= t ):\r\n ct = ct * k + b\r\n n = n - 1\r\nprint(max(0 , n + 1))", "# https://codeforces.com/contest/198/problem/A\n\nfrom math import ceil, log\n\nk, b, n, t = map(int, input().split())\n\nif k == 1:\n expr = (1 + n * b - t) / b\nelse:\n expr = (t * (k - 1) + b) / (k - 1 + b)\n expr = n - log(expr, k)\n\nexpr = max(0, ceil(expr))\nprint(expr)", "import math\r\nk,b,n,t=list(map(int,input().split()))\r\nif k!=1:\r\n val=math.log((1-k-b)/(t-t*k*1.000-b),k)\r\n # print(val)\r\n num=n+val\r\n print(max([0,math.ceil(num)]))\r\nelse:\r\n p=n-(t-1)/(b*1.0000)\r\n print(max([0,math.ceil(p)]))", "k, b, n, t = map(int, input().split())\r\nz = 1\r\nx = n\r\nfor i in range(n):\r\n z = (k * z) + b\r\n if z <= t:\r\n x -= 1\r\n else:\r\n break\r\nprint(x)", "entrada=input().split(\" \")\r\nlistae = list(map(int, entrada))#Convertir strs a int\r\nstock=1\r\nwhile(listae[0]*stock+listae[1]<=listae[3] and listae[2]>0):\r\n stock=listae[0]*stock+listae[1]\r\n listae[2]-=1\r\nprint(listae[2])\r\n", "import math\r\nk,b,n,t=list(map(int,input().split()))\r\nif k>1:\r\n \r\n ans=math.ceil(n-math.log((t+b/(k-1))/(1+b/(k-1)))/math.log(k))\r\n print(max(0,ans))\r\nelse:\r\n z=1+n*b\r\n f=1\r\n ans=0\r\n while f:\r\n if t+ans*b>=z:\r\n f=0\r\n break\r\n else:\r\n ans=ans+1\r\n print(ans)", "k,b,n,t =map(int,input().split())\r\nq=k\r\nq+=b\r\nkil=0\r\nwhile True :\r\n if q<=t :\r\n q*=k\r\n q+=b\r\n kil+=1\r\n else :\r\n break\r\nkil=min(kil,n)\r\nprint(n-kil)\r\n", "from math import log\r\nk, b, n, t = map(int, input().split())\r\nif k == 1: print(max((n * b + b - t) // b, 0))\r\nelse: print(max(0, n - int(log((k * t - t + b) / (k - 1 + b)) / log(k))))", "k, b, n, t = list(map(int, input().split())) \r\np = 1\r\nwhile p <= t:\r\n p = k * p + b\r\n n -= 1\r\nprint(max(0, n+1))\r\n", "k,b,n,t=map(int,input().split())\r\nz=1\r\nres=n\r\nfor i in range(n):\r\n z=(k*z)+b\r\n if z<=t:\r\n res-=1\r\n else:\r\n break\r\nprint(res)\r\n", "from math import *\r\nk,b,n,t=map(int,input().split())\r\n\r\nx=1\r\nx=(k*x)+b\r\ncount=0\r\nwhile(x<=t):\r\n x=(k*x)+b\r\n count+=1\r\n if(count==n):\r\n break;\r\nprint(n-count)\r\n" ]

{"inputs": ["3 1 3 5", "1 4 4 7", "2 2 4 100", "1 2 3 100", "10 10 10 123456", "847 374 283 485756", "37 1 283475 8347", "1 1 1 1", "1 1 1 1000000", "1 1 1000000 1", "1 1 1000000 1000000", "1 1000000 1 1", "1 1000000 1 1000000", "1 1000000 1000000 1", "1 1000000 1000000 1000000", "1000000 1 1 1", "1000000 1 1 1000000", "1000000 1 1000000 1", "1000000 1 1000000 1000000", "1000000 1000000 1 1", "1000000 1000000 1 1000000", "1000000 1000000 1000000 1", "1000000 1000000 1000000 1000000", "1 160 748 108", "1 6099 4415 2783", "1 1047 230 1199", "1 82435 53193 37909", "1 96840 99008 63621", "1 250685 823830 494528", "1 421986 2348 320240", "2 8 16 397208", "2 96 676 215286", "2 575 321 606104", "2 8048 37852 278843", "2 46658 377071 909469", "3 10 90 567680", "4 4 149 609208", "5 4 3204 986907", "6 5 5832 885406", "7 10 141725 219601", "38 86 441826 91486", "185 58 579474 889969", "3901 18 41607 412558", "9821 62 965712 703044", "29487 60 3239 483550", "78993 99 646044 456226", "193877 3 362586 6779", "702841 39 622448 218727", "987899 74 490126 87643", "1000000 69 296123 144040", "2 5 501022 406855", "2 2 420084 748919", "2 3 822794 574631", "2 2 968609 433047", "2 1 371319 775111", "3 2 942777 573452", "3 2 312783 882812", "3 4 715494 741228", "3 1 410364 566940", "3 2 780370 425356", "1 5 71 551204", "1 10 29 409620", "2 1 14 637985", "2 6 73 947345", "3 8 66 951518", "3 3 24 293582", "4 9 10 489244", "4 6 16 831308", "5 6 62 835481", "5 2 68 144841", "1 1 1000000 500000", "5 2 100 7", "3 1 3 4", "126480 295416 829274 421896", "999991 5 1000000 999997", "54772 1 1000000 1000000", "5 5 2 10", "1 1 2 2", "100000 100000 10 1000000", "2 2 5 4", "999997 1 100000 1000000", "5 2 100 38", "1 4 1 5", "1 2149 1000000 1000000", "99999 99999 10 1000000", "999998 1 1000000 1000000", "1 1 10 2", "1 1 100 1000", "1 1 1000000 553211", "1 1 10 1", "3 1 3 1", "888888 2 4 999999", "3 5 10 29", "1 1 100 2", "5 5 2 1", "50000 42 1337 999999", "2 345678 908765 987654", "1 7 15 7", "842717 8581 19342 851297", "5 4 1 4", "2 2 5 94", "2 100000 5 10", "722229 410423 118215 838505", "3 1 3 13", "900000 1 100 1000000", "2 4 4 36", "999990 1 1000000 1000000", "100000 100000 1000000 1000000", "999998 1 5 1000000", "1 1 10 4", "2 3 4 5", "3 1 3 40", "1 10 10 100", "999987 123456 1000000 1"], "outputs": ["2", "3", "0", "0", "6", "282", "283473", "1", "0", "1000000", "1", "1", "1", "1000000", "1000000", "1", "1", "1000000", "1000000", "1", "1", "1000000", "1000000", "748", "4415", "229", "53193", "99008", "823829", "2348", "1", "665", "311", "37847", "377067", "80", "141", "3196", "5825", "141720", "441824", "579472", "41606", "965711", "3238", "646043", "362586", "622448", "490126", "296123", "501006", "420067", "822777", "968592", "371301", "942766", "312772", "715483", "410353", "780359", "0", "0", "0", "56", "55", "14", "2", "7", "55", "61", "500001", "99", "2", "829273", "999999", "999999", "1", "1", "9", "4", "99999", "98", "0", "999535", "9", "999999", "9", "0", "446790", "10", "3", "3", "8", "99", "2", "1336", "908764", "15", "19342", "1", "0", "5", "118215", "1", "99", "1", "999999", "999999", "4", "7", "3", "0", "1", "1000000"]}

UNKNOWN

PYTHON3

CODEFORCES

23

d475b1db315b445f2e098c807d2d52c1

New Skateboard

Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and started to press the keys randomly. Unfortunately Max has forgotten the number which he had calculated. The only thing he knows is that the number is divisible by 4. You are given a string *s* consisting of digits (the number on the display of the calculator after Yusuf randomly pressed the keys). Your task is to find the number of substrings which are divisible by 4. A substring can start with a zero. A substring of a string is a nonempty sequence of consecutive characters. For example if string *s* is 124 then we have four substrings that are divisible by 4: 12, 4, 24 and 124. For the string 04 the answer is three: 0, 4, 04. As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use gets/scanf/printf instead of getline/cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. The only line contains string *s* (1<=≤<=|*s*|<=≤<=3·105). The string *s* contains only digits from 0 to 9. Print integer *a* — the number of substrings of the string *s* that are divisible by 4. Note that the answer can be huge, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type. Sample Input 124 04 5810438174 Sample Output 4 3 9

[ "a= input()\nans = 0\nfor i in range(len(a)-1,-1,-1):\n\tif(not int(a[i])%4):\n\t\tans+=1\n\tif ( i>0 and not int(a[i-1:i+1])%4):\n\t\tans+= i\n\nprint(ans)\n\t \t\t \t\t \t\t \t \t \t \t\t \t\t", "s = input()\r\nres = 0\r\n\r\nfor i in range(1, len(s)) :\r\n if int(s[i-1 : i+1]) % 4 == 0 :\r\n res += i\r\n\r\nres += s.count('0') + s.count('4') + s.count('8')\r\n\r\nprint(res)", "import sys\r\nimport os\r\nimport math\r\nimport copy\r\nfrom bisect import bisect\r\nfrom io import BytesIO, IOBase\r\nfrom math import sqrt,floor,factorial,gcd,log,ceil\r\nfrom collections import deque,Counter,defaultdict\r\nfrom itertools import permutations,combinations,accumulate\r\n\r\ndef Int(): return int(sys.stdin.readline())\r\ndef Mint(): return map(int,sys.stdin.readline().split())\r\ndef Lstr(): return list(sys.stdin.readline().strip())\r\ndef Str(): return sys.stdin.readline().strip()\r\ndef Mstr(): return map(str,sys.stdin.readline().strip().split())\r\ndef List(): return list(map(int,sys.stdin.readline().split()))\r\ndef Hash(): return dict()\r\ndef Mod(): return 1000000007\r\ndef Mat2x2(n): return [List() for _ in range(n)]\r\ndef Lcm(x,y): return (x*y)//gcd(x,y)\r\ndef dtob(n): return bin(n).replace(\"0b\",\"\")\r\ndef btod(n): return int(n,2) \r\ndef watch(x): return print(x)\r\ndef common(l1, l2): return set(l1).intersection(l2)\r\ndef Most_frequent(list): return max(set(list), key = list.count)\r\n \r\ndef solution():\r\n #for _ in range(Int()):\r\n s=Str()\r\n ans=0\r\n for i in range(len(s)):\r\n if(int(s[i])%4==0):\r\n ans+=1\r\n for i in range(len(s)-1):\r\n if(int(s[i]+s[i+1])%4==0):\r\n ans+=(i+1)\r\n print(ans) \r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution()", "s = list(map(int, input()))\ncnt = 0\nfor i in range(len(s) - 1):\n if (s[i] * 2 + s[i + 1]) % 4 == 0:\n cnt += i + 1\n if s[i] % 4 == 0:\n cnt += 1\nif s[-1] % 4 == 0:\n cnt += 1\nprint(cnt)\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input())\r\nM = lambda: map(int, input().strip().split())\r\nL = lambda: list(map(int, input().strip().split()))\r\nS = lambda: input().strip()\r\n\r\nn = S()\r\ncount = n.count('4') + n.count('8') + n.count('0')\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2]) % 4 == 0:\r\n count += i+1\r\nprint(count)\r\n", "s = input()\r\nc = 0\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n c += 1\r\nfor i in range(1, len(s)):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n c += i\r\nprint(c)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nj = None\r\nr = 0\r\np = 0\r\nfor i in minp():\r\n\tr += (int(i)%4 == 0)\r\n\tif j != None:\r\n\t\tif int(j+i) % 4 == 0:\r\n\t\t\tr += p\r\n\tp += 1\r\n\tj = i\r\nprint(r)", "import sys\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline().strip('\\n')\r\n\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nans = 0\r\nans += s.count('4')\r\nans += s.count('8')\r\nans += s.count('0')\r\n\r\nfor i in range(1,n):\r\n k = s[i-1] + s[i]\r\n \r\n if int(k)%4 == 0:\r\n ans += i\r\n\r\n #if k in ['04','08','20','40','60','80']:\r\n # ans += 1\r\nprint(ans)\r\n", "s=input().rstrip()\r\nx=list(s)\r\nG=0;\r\nfor i in range(0,len(x)):\r\n if i==0:\r\n if int(x[i])%4==0:\r\n G+=1;\r\n else:\r\n f=x[i];\r\n if int(f)%4==0:\r\n G+=1;\r\n g=x[i-1]\r\n c=g+f;\r\n D=int(c)\r\n if D%4==0:\r\n G+=i;\r\nprint(G)\r\n", "import sys\r\ns=sys.stdin.readline()[:-1]\r\nk=0\r\nfor x in s :\r\n if int(x)%4==0 :\r\n k+=1\r\nfor i in range(1,len(s)) :\r\n if int(s[i-1]+s[i])%4==0 :\r\n k+=i\r\nprint(k)\r\n", "count = 0\nx = input()\nfor i in range(len(x)-1):\n z = x[i:i+2]\n if int(z)%4 == 0:\n count += i+1\nfor j in range(len(x)):\n if x[j] in ['0', '4', '8']:\n count+= 1\nprint(count) \n \n \n\n\t \t\t \t \t\t \t \t\t\t\t\t\t \t", "s = input()\r\nans = 0\r\nd = {}\r\nd['0'] = \"02468\"\r\nd['2'] = \"13579\"\r\nd['4'] = \"02468\"\r\nd['6'] = \"13579\"\r\nd['8'] = \"02468\"\r\n\r\ndt = [0 for _ in range(10)]\r\n\r\nfor i in range(0,len(s)):\r\n if i and s[i] in d and s[i-1] in d[s[i]]:\r\n ans+= i\r\n if s[i] in \"048\":\r\n ans+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ns = input()\r\nans = 0; n = len(s)\r\nif int(s[0])%4 == 0: ans += 1\r\nfor i in range(1,n-1):\r\n if int(s[i])%4 == 0: ans += 1\r\n if int(s[i-1:i+1])%4 == 0: ans += i\r\nprint(ans)\r\n", "s = input()\nn = len(s)\ni = n - 1\nans = 0\nwhile i > 0:\n number = int(s[i-1] + s[i])\n if s[i] == '4' or s[i] == '8' or s[i] == '0':\n ans += 1\n if number % 4 == 0:\n ans += i\n i -= 1\nif s[0] == '4' or s[0] == '8' or s[0] == '0':\n ans += 1\nprint(ans)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\ndef find(x):\n if x != parents[x]:\n parents[x] = find(parents[x])\n return parents[x]\n\ndef union(x, y):\n rootX = find(x)\n rootY = find(y)\n if rootX != rootY:\n if ranks[rootX] > ranks[rootY]:\n parents[rootY] = rootX\n else:\n parents[rootX] = rootY\n if ranks[rootX] == ranks[rootY]:\n ranks[rootY] += 1\n\ndef main():\n s = input()\n n = len(s)\n dp = [0] * len(s) \n for i in range(n):\n dp[i] = dp[i-1]\n if int(s[i]) % 4 == 0:\n if i == 0:\n dp[i] = 1\n else:\n dp[i] += 1 \n if i >= 1 and int(s[i-1:i+1]) % 4 == 0:\n dp[i] += i \n print(dp[n-1])\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n\n", "s=list(input())\r\nd=0\r\nfor i in range(len(s)):\r\n if i!=0:\r\n num=int(s[i-1])*10+int(s[i])\r\n if num%4==0:\r\n d+=i\r\n if int(s[i])%4==0:\r\n d+=1\r\nprint(d)\r\n ", "from sys import stdin, stdout, setrecursionlimit\r\n#import threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, RECURSION_LIMIT, STACK_SIZE):\r\n setrecursionlimit(RECURSION_LIMIT)\r\n threading.stack_size(STACK_SIZE)\r\n return None\r\n \r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n s = R()\r\n l = len(s) - 1\r\n \r\n total = 0\r\n for i in range(l):\r\n total += (not int(s[i])%4)\r\n \r\n for i in range(1, l):\r\n total += (i if not int(s[i-1]+s[i])%4 else 0)\r\n \r\n W('%d\\n' % total)\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\n#Tail_Recursion_Optimization(10**7, 2**26) # recursion-call size, stack-size in byte\r\n#threading.Thread(target=main).start()\r\nmain()", "s=input()\r\ncount=0\r\nfor i in range(len(s)):\r\n if(int(s[i])%4==0):\r\n count=count+1\r\nfor i in range(len(s)-1):\r\n num=s[i]+s[i+1]\r\n if(int(num)%4==0):\r\n count=count+i+1\r\nprint(count) \r\n \r\n \r\n", "s=input()\r\nans=0\r\nn=len(s)\r\nfor i in range(n-1):\r\n if(int(s[i])%4==0):\r\n ans+=1\r\n if(int(s[i:i+2])%4==0):\r\n ans+=i+1\r\nif(int(s[n-1])%4==0):\r\n ans+=1\r\nprint(ans)", "s, r = input(), 0\r\nfor i in range(len(s)-1):\r\n a = s[i] + s[i+1]\r\n if int(a) % 4 == 0:\r\n r += i + 1\r\n if s[i] in ['0', '4', '8']:\r\n r += 1\r\nprint(r + 1 if s[-1] in ['0', '4', '8'] else r)", "n = input()\r\na = 0\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2])%4 == 0:\r\n a += i + 1\r\n if int(n[i])%4 == 0:\r\n a += 1\r\nif int(n[-1])%4 == 0:\r\n a += 1\r\nprint(a)\r\n", "s = input()\nres = s.count('0') + s.count('4') + s.count('8')\nfor i in range(len(s) - 1):\n if int(s[i:i+2]) % 4 == 0:\n res += i + 1\nprint(res)\n", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\na = s.count('0') + s.count('4') + s.count('8')\n \nfor i in range(len(s) - 1):\n\tif int(s[i:i + 2]) % 4 == 0:\n\t\ta += i + 1\n \nprint(a)\n", "s = input()\nc = 0\n\nfor i in range(0, len(s)):\n if ((ord(s[i]) - ord('0')) % 4 == 0):\n c += 1\n\nfor i in range(0, len(s) - 1):\n if(((ord(s[i]) - ord('0')) * 10 + (ord(s[i + 1]) - ord('0'))) % 4 == 0):\n c += i + 1\n\nprint(c)\n \t\t \t \t\t \t\t \t\t \t \t\t\t\t \t", "def main():\n l = [ord(c) - 48 for c in input()]\n y, res = 1, l.count(0) + l.count(4) + l.count(8)\n for i in range(len(l) - 1, -1, -1):\n x = l[i]\n if not (x * 10 + y) % 4:\n res += i + 1\n y = x\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "s=input()\r\nn=len(s)\r\nans=0\r\n\r\nfor i in s:\r\n if((int(i))%4==0):\r\n ans+=1\r\nfor i in range(1,n):\r\n if( int(s[i-1]+s[i])%4==0):\r\n ans+=i\r\nprint(ans)\r\n", "s, k = input(), 0\r\n\r\nfor i in range(1, len(s)):\r\n if int(s[i-1] + s[i]) % 4 == 0:\r\n k += i\r\n\r\nprint(k + sum(s.count(d) for d in '048'))", "#!/usr/bin/python3\n\"\"\" getting skateboard 1300 \"\"\"\n\nfrom re import I\nfrom unittest import TestCase\n\n\nclass Test(TestCase):\n \"\"\" test cases \"\"\"\n\n def test_get_subs(self):\n \"\"\" test the function get substring \"\"\"\n\n self.assertEqual(get_subs('123'), ['1', '12', '123', '2', '23', '3'])\n self.assertEqual(\n get_subs('1234'),\n ['1', '12', '123', '1234', '2', '23', '234', '3', '34', '4']\n )\n\n def test_answer(self):\n \"\"\" test that answer returns the number of\n substrings divisible by 4 given a string \"\"\"\n\n self.assertEqual(answer('124'), 4)\n self.assertEqual(answer('04'), 3)\n self.assertEqual(answer('5810438174'), 9)\n\n def test_count_048(self):\n \"\"\" test count 4 8 function \"\"\"\n\n self.assertEqual(count_1_div_4('124'), 1)\n self.assertEqual(count_1_div_4('1244'), 2)\n self.assertEqual(count_1_div_4('4844'), 4)\n self.assertEqual(count_1_div_4('48440'), 5)\n \n def test_count_2_div_4(self):\n \"\"\" test count 2 divisible by 4 function \"\"\"\n\n self.assertEqual(count_2_div_4('124'), 3)\n self.assertEqual(count_2_div_4('12'), 1)\n self.assertEqual(count_2_div_4('4321'), 2)\n\n\ndef get_subs(str_1) -> list:\n \"\"\" return a list of all substrings given a string \"\"\"\n\n n_str = len(str_1)\n return [\n str_1[ind1: ind1 + len_]\n for ind1 in range(n_str) for len_ in range(1, n_str - ind1 + 1)\n ]\n\n\ndef count_1_div_4(str_1) -> int:\n \"\"\" return number of single digits that are divisible by 8 \"\"\"\n\n return sum([1 for char in str_1 if char in '048'])\n\n\ndef count_2_div_4(str_1) -> int:\n \"\"\" count the number of two length substrings \n from the back, divisible by 4 \"\"\"\n\n n_str = len(str_1)\n return sum(\n [\n ind\n for ind in range(n_str-1, 0, -1)\n if int(str_1[ind-1:ind+1]) % 4 == 0\n ]\n )\n\n\ndef answer(str_1):\n \"\"\" return the number of substrings divisible by 4 \"\"\"\n\n return count_1_div_4(str_1) + count_2_div_4(str_1)\n\n\ndef main() -> None:\n \"\"\" do stuff \"\"\"\n\n print(answer(input()))\n\n\nif __name__ == '__main__':\n main()\n", "s = list(map(int, list(input())))\ncount = 0\nfor i in range(len(s)):\n if s[i] % 4 == 0:\n count += 1\n if i > 0:\n num = 10 * s[i-1] + s[i]\n if num % 4 == 0:\n count += i\n \nprint(count)\n", "s = input()\ncount = 0\n\n\nfor i in range(len(s)):\n if s[i] in [\"0\",\"4\",\"8\"]:\n count+=1\nfor i in range(len(s)-1):\n x = s[i:i+2]\n if int(x)%4 == 0:\n count+= i+1\n \nprint(count)\n \t \t\t \t\t \t\t \t\t\t\t\t\t \t \t \t\t", "s = input()\r\ncounter = 0\r\nfor i in range(len(s), 1, -1):\r\n if int(s[i-2]+s[i-1]) % 4 == 0:\r\n counter += (i-1)\r\nfor elem in s:\r\n if int(elem)%4 == 0:\r\n counter += 1\r\n\r\nprint(counter)", "import sys\nfrom collections import Counter\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_chars(): return list(sys.stdin.readline().strip())\nsys.setrecursionlimit(20000)\n\ns = get_chars()\n\na = 0\n\nif int(s[0]) % 4 == 0:\n a+=1\nfor i in range(1, len(s)):\n if int(s[i]) % 4 == 0:\n a+= 1\n if (int(s[i-1])*10 + int(s[i])) % 4 == 0:\n a+= i\n\n # print(i, a)\n\nprint(a)", "s = input()\nres = 0\nfor elem in s:\n if int(elem) % 4 == 0:\n res += 1\nfor i in range(len(s) - 1):\n if int(s[i:i + 2]) % 4 == 0:\n res += i + 1\nprint(res)", "import sys\r\n\r\ns = sys.stdin.buffer.readline().decode('utf-8').rstrip()\r\ndp = [0]*4\r\nans = 0\r\n\r\nfor d in map(int, s):\r\n m = d % 4\r\n ndp = [0]*4\r\n ndp[m] += 1\r\n for x in range(4):\r\n ndp[(x*10+m) % 4] += dp[x]\r\n\r\n dp = ndp\r\n ans += dp[0]\r\n\r\n\r\nprint(ans)\r\n", "s = input()\r\n \r\n \r\ncount = 0\r\nfor i in s:\r\n if int(i)%4 == 0:\r\n count +=1\r\n \r\nfor i in range(len(s) - 1):\r\n l2_digits = int(s[i:i+2])\r\n# print(l2_digits,i)\r\n if l2_digits%4 == 0:\r\n count += i+1\r\n \r\nprint(count)\r\n", "# Reference: https://codeforces.com/problemset/problem/628/B\r\n\r\ndef div4(n: int):\r\n if n%4 == 0:\r\n return True\r\n return False\r\n\r\ndef fs(f: str, s: str):\r\n t = 0\r\n b = False\r\n if div4(int(s)):\r\n t += 1\r\n if div4(int(f+s)):\r\n t += 1\r\n b = True\r\n\r\n return t, b\r\n\r\n\r\n\r\ns = input()\r\n\r\nlast_index = 1\r\nc = 0\r\n\r\nif len(s) == 1:\r\n if div4(int(s)):\r\n c = 1\r\nelif len(s) == 2:\r\n if div4(int(s[0])):\r\n c = 1\r\n\r\n c += fs(s[0], s[1])[0]\r\n\r\nelse:\r\n for i in range(1, len(s)):\r\n first = s[i-1]\r\n second = s[i]\r\n t, b = fs(first, second)\r\n c += t\r\n if i == 1 and div4(int(first)):\r\n c += 1\r\n\r\n\r\n if b and i != last_index:\r\n t = i - last_index\r\n if t > 0:\r\n c += t\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nn1,n2,n4,c4 = 0,0,0,0\r\nfor i in range(len(s)):\r\n r = int(s[i])%4\r\n if r==1 or r==3:\r\n n1,n2,n4 = i+1,0,0\r\n elif r==2:\r\n n1,n2,n4 = 0,(n2+n4+1),n1\r\n else:\r\n n1,n2,n4 = 0,n1,(n2+n4+1)\r\n c4 += n4\r\nprint(c4)\r\n", "a = input()\na = list(a)\nans = 0\nfor i in a:\n\tif int(i)%4 == 0:\n\t\tans += 1\nwhile len(a)>=2:\n\tif int(''.join(a[-2:]))%4 == 0:\n\t\tans += len(a) - 1\n\ta.pop()\nprint(ans)", "# https://codeforces.com/problemset/problem/628/B\n\nimport fileinput\nimport sys\nfrom typing import List, Dict, Union, Any\n\n\nline: List[int] = []\nfor i, line in enumerate(fileinput.input()):\n line = [int(i) for i in line[:-1]]\n break\n\nrez = 0\n\nfor numb in line:\n rez += (numb % 4 == 0)\n\nfor i in range(len(line) - 1):\n add = (int(f\"{line[i]}{line[i + 1]}\") % 4 == 0)\n if add != 0:\n add += i\n rez += add\n\nprint(rez)\n", "s = input()\r\n\r\nn = len(s)\r\n# dp = [-1]*n\r\n# def rec(i,s):\r\n# if i<0:\r\n# return 0\r\n# if i==0:\r\n# if int(s[i])%4==0:\r\n# dp[i]=1\r\n# else:\r\n# dp[i]=0\r\n# return dp[i]\r\n \r\n# if dp[i]!=-1:\r\n# return dp[i]\r\n \r\n# ans = rec(i-1,s)\r\n# if int(s[i])%4==0:\r\n# ans+=1\r\n# if int(s[i-1:i+1])%4==0:\r\n# ans+= i\r\n \r\n# dp[i]=ans\r\n# return dp[i]\r\n\r\n# print(rec(n-1,s))\r\n\r\ndp = [0]*n\r\n\r\nif int(s[0])%4==0:\r\n dp[0]=1\r\n\r\nfor i in range(1,n):\r\n\r\n dp[i] = dp[i-1]\r\n if int(s[i])%4==0:\r\n dp[i]+=1\r\n if int(s[i-1:i+1])%4==0:\r\n dp[i]+= i\r\n\r\nprint(dp[n-1])\r\n", "s = list(map(int,input()))\r\nx = len(s)\r\nq = 0 if s[-1]%4 else 1\r\nfor i in range(x-1):\r\n if not s[i]%4:\r\n q+=1\r\n if (10*s[i]+s[i+1])%4==0:\r\n q+=i+1\r\nprint(q)", "s = input()\n\ncunt = 0\n\nl = len(s)\n\nif int(s[0])%4 == 0:\n\tcunt += 1\n\nfor i in range(1, l):\n\tif int(s[i])%4 == 0:\n\t\tcunt += 1\n\n\tif int(s[i-1] + s[i])%4 == 0:\n\t\tcunt += i\n\t\n\nprint(cunt)", "n = input()\n\ns = 0\n\nfor i in range(len(n)-1, -1, -1):\n\tif int(n[i])%4 == 0:\n\t\t# print(n[i])\n\t\ts+=1\n\tif i < 1:\n\t\tcontinue\n\n\tif int(n[i-1:i+1])%4 == 0:\n\t\t# print(n[i-1:i+1])\n\t\ts+=i\n\nprint(s)", "# how in the flying fuck was a simple calculator able to display 300000 characters \r\n# in one go. And Yusuf, that fucking cunt. That motherfucker had enough time\r\n# to type in that many characters. \r\nlongArray = input()\r\na,b,c = longArray.count('0'),longArray.count('4'),longArray.count('8')\r\ncount,size = a+b+c,len(longArray)\r\nfor x in range(size-2,-1,-1):\r\n h = int(longArray[x:x+2])\r\n if not h%4:\r\n count += (size - (size-x)) + 1\r\nprint(count)\r\n", "s=(input())\r\n\r\nl=list(map(int, list(s)))\r\n'''\r\ndef nums(i):\r\n\tglobal l;\r\n\tif(i==0):\r\n\t\treturn int(l[0]%4==0)\r\n\t\r\n\tif(i>0 and (l[i-1]*10+l[i])%4==0):\r\n\t\treturn nums(i-1)+i+int(l[i]%4==0)\r\n\tif(l[i]%4==0):\r\n\t\treturn nums(i-1)+1\r\n\telse:\r\n\t\treturn nums(i-1)\r\n'''\r\n\r\nc=0\r\ndef work():\r\n\tglobal c, l;\r\n\tfor i in range(len(l)-1, -1,-1):\r\n\t\tif(i==0):\r\n\t\t\tc+= int(l[0]%4==0)\r\n\r\n\t\telif(i>0 and (l[i-1]*10+l[i])%4==0):\r\n\t\t\tc += i+int(l[i]%4==0)\r\n\t\telif(l[i]%4==0):\r\n\t\t\tc+=1\r\n\t\r\n\r\n\r\n\r\nwork()\r\nprint(c)\r\n\r\n", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n if (i>0):\r\n if (int(s[i-1])*10+int(s[i]))%4==0:\r\n ans+=i\r\nprint(ans)", "l=list(input())\r\ntemp=[]\r\ncount=0\r\nfor i in range(len(l)-1):\r\n x=int(l[i]+l[i+1])\r\n y=int(l[i])\r\n if x%4==0:\r\n temp.append(i+1)\r\n \r\n if y%4==0:\r\n count+=1\r\n\r\nif int(l[len(l)-1])%4==0:\r\n count+=1\r\n\r\nxs=0\r\nfor i in range(len(temp)):\r\n xs+=temp[i]\r\n\r\nprint(count+xs) \r\n\r\n", "arr = list(map(int,list(input())))\r\nans = 0\r\nfor i in range(len(arr)):\r\n if arr[i] == 8 or arr[i] == 4 or arr[i] == 0:\r\n ans+=1\r\nfor i in range(len(arr)-1):\r\n if (arr[i]*10 + arr[i+1])%4 == 0:\r\n ans+=i+1\r\nprint(ans)", "\"\"\"\r\nCreated on Sat Jan 12 23:33:17 2019\r\n\"\"\"\r\n\r\ns = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n t = int(s[i])\r\n if t % 4 == 0:\r\n res += 1\r\n if i > 0:\r\n if (int(s[i - 1]) * 10 + t) % 4 == 0:\r\n res += i\r\nprint(res)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\n\r\nfor i in range(n - 1, 0, -1):\r\n if int(s[i - 1:i + 1]) % 4 == 0:\r\n ans += i\r\n\r\nprint(ans)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor j in range(n-2,-1,-1):\r\n x=s[j]+s[j+1]\r\n if int(x)%4==0:\r\n ans=ans+1+j\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\nprint(ans)", "# from math import lcm\r\nfrom queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\n# for _ in range(int(input())):\r\ns=list(input())\r\nn=len(s)\r\nl=list(map(int,s))\r\ncount=0\r\nfor i in range(n-1,0,-1):\r\n if l[i]%4==0:\r\n count+=1\r\n if (10*l[i-1]+l[i])%4==0:\r\n count+=i\r\nif l[0]%4==0:\r\n count+=1\r\nprint(count)\r\n", "s = input()\n\nans = 0\nfor i in range(len(s)):\n if int(s[i])%4 == 0:\n ans += 1\n if i > 0 and (int(s[i-1])*10+int(s[i]))%4 == 0:\n ans += i\nprint(ans)\n", "a=str(input())\ncount=0\nn=len(a)-1\nm=n-1\nwhile True:\n if m==-1:\n break\n if(int(a[m:n+1])%4==0):\n count+=(m+1)\n if int(a[n:n+1])%4==0:\n count+=1\n n-=1\n m-=1\nif (int(a[0])%4==0):\n count+=1\n\n\n\nprint(count)\n\t \t\t \t\t\t\t \t \t \t \t\t\t \t\t \t \t", "def solution(s):\r\n ret = 1 if int(s[0]) % 4 == 0 else 0\r\n\r\n for i in range(1, len(s)):\r\n if (int(s[i - 1]) * 10 + int(s[i])) % 4 == 0:\r\n ret += i\r\n if int(s[i]) % 4 == 0:\r\n ret += 1\r\n \r\n return ret\r\nprint(solution(input()))", "import math\r\ndef dtb(n): \r\n return bin(n).replace(\"0b\",\"\")\r\ndef btd(n): \r\n return int(n,2) \r\nt=1\r\nfor k in range(t):\r\n s=input()\r\n #a=list(map(int,input().split()))[:n]\r\n n=len(s)\r\n count,prev=0,0\r\n if int(s[0])%4==0:\r\n \r\n count+=1\r\n prev=int(s[0]) \r\n for i in range(1,n):\r\n if int(s[i])%2==1:\r\n prev=int(s[i])\r\n continue\r\n \r\n if int(s[i])%4==0 :\r\n if prev%2==0:\r\n count+=(i+1)\r\n else:\r\n count+=1\r\n elif (int(s[i])+(10*prev))%4==0:\r\n count+=i\r\n prev=int(s[i]) \r\n print(count) \r\n \r\n ", "s = input() \r\nans = 0 \r\nfor i in range(len(s)-1, 0, -1): \r\n if int(s[i])%4 == 0 : ans += 1\r\n if int(s[i-1] + s[i]) % 4 == 0 : ans += i-1 + 1\r\nif int(s[0])%4 == 0 : ans += 1\r\nprint(ans)", "s = input()\nn = len(s)\n\nans = 0\nfor i in range(1, n):\n\tif int(s[i]) % 2 == 0:\n\t\tif (10 * int(s[i - 1]) + int(s[i])) % 4 == 0:\n\t\t\tans += i\n\tif int(s[i]) in [0, 4, 8]:\n\t\tans += 1\n\t#print (ans)\n\t\t\t\nif int(s[0]) in [0, 4, 8]:\n\tans += 1\n\t\nprint (ans)\n", "n=input()\r\nans=0\r\nfor i in range(len(n)-1):\r\n if int(n[i:i+2])%4==0:\r\n ans+=i+1\r\nfor i in n:\r\n if int(i)%4==0:\r\n ans+=1\r\nprint(ans)", "import math\n\nl1 = input()\n#l2 = input().split()\n\n#l1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\ns = list(l1)\nans = 0;\n\n#print(s)\n\nfor i in range (len(s)):\n if ( int(s[i]) % 4 == 0 ):\n ans += 1;\n\nfor i in range (1, len(s)):\n if (( int(s[i]) + (int(s[i - 1])) * 2 ) % 4 == 0):\n ans += i;\n\nprint(ans)\n\n\n\t\t \t \t \t \t\t\t\t\t \t", "\"\"\"\r\nCreated on Sun 14th Feb 2021\r\n @author: Rohit\r\n\"\"\"\r\n\r\ns = input()\r\nl = len(s)\r\ncount= 0\r\nif int(s[0]) % 4 == 0:\r\n count = 1\r\nfor p in range(1, l):\r\n if int(s[p-1: p+ 1]) % 4 == 0:\r\n count += p\r\n if int(s[p]) % 4 == 0:\r\n count += 1\r\nprint(count)\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "\r\n\r\nS = input()\r\n\r\nresult = 0\r\n\r\nfor i in range(len(S) ):\r\n\r\n if i == 0:\r\n \r\n\r\n if int(S[i]) % 4 == 0:\r\n\r\n result += 1\r\n\r\n elif int(S[i]) % 4 == 0:\r\n\r\n if int(S[i-1:i+1]) % 4 == 0:\r\n\r\n result += i+1\r\n\r\n else:\r\n result += 1\r\n\r\n elif int(S[i-1:i+1]) % 4 == 0:\r\n\r\n result += i\r\n\r\n\r\nprint(result)\r\n\r\n\r\n", "\r\n\r\ndef build_lps_table(s):\r\n table = [0] * len(s)\r\n index = 0\r\n for i in range(1, len(s)):\r\n if s[i] == s[index]:\r\n table[i] = index + 1\r\n index += 1\r\n else:\r\n index = table[i-1]\r\n while index > 0 and s[index] != s[i]:\r\n index = table[index-1]\r\n\r\n if s[i] == s[index]:\r\n index += 1\r\n table[i] = index\r\n return table\r\n\r\n\r\n\"\"\"\r\n\r\nnumber of substrings that are divisible by 4 \r\nif last digit so far is divisible by 4, then 1 + all of the substrings before tha\r\ns[i]%4==0:\r\n ans = 1 + all_substrings(i-1)\r\nif prev+s[i]\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n s = input()\r\n count = 0\r\n if int(s[0]) % 4 == 0:\r\n count += 1\r\n for i in range(1, len(s)):\r\n cur = s[i]\r\n prev = s[i-1]\r\n if int(cur) % 4 == 0:\r\n count += 1\r\n if int(prev+cur) % 4 == 0:\r\n count += i\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = [int(i) for i in input()]\r\n\r\nct = 0\r\n\r\nfor i in s:\r\n if not i%4:\r\n ct += 1\r\n \r\nn = len(s)\r\n\r\nfor i in range(1, n):\r\n if not (10*s[i-1]+s[i])%4:\r\n ct += i\r\n \r\nprint(ct)", "s = input()\nnum = 0\nfor i in range(len(s)):\n if (i != len(s)-1):\n n = (int(s[i])*10+int(s[i+1]))\n if n%4 == 0:\n num += 1 + i\n if int(s[i])%4 == 0:\n num += 1\nprint(num)\n\n \t\t\t\t \t \t\t\t \t \t\t \t \t\t", "s = input()\r\ncount = 0\r\ns = s[::-1]\r\nfor i in range(len(s)):\r\n if int(s[i]) % 4 == 0:\r\n count += 1\r\n if i < (len(s)) - 1:\r\n num = (s[i+1]) + (s[i])\r\n if int(num) % 4 == 0:\r\n count += len(s[(i+1):])\r\nprint(count)", "string = input()\nresp = 0\nif int(string[0]) % 4 == 0:\n resp += 1\nfor i in range(len(string) - 1):\n actual = int(string[i])*10 + int(string[i+1])\n endingWithActual = i + 1\n if actual % 4 == 0:\n resp += endingWithActual\n if int(string[i + 1]) % 4 == 0:\n resp += 1\nprint (resp)\n\t\t\t\t\t \t \t\t \t \t \t\t\t\t \t", "x = input()\r\nn = len(x)\r\ncnt = 0\r\nfor i in range(n - 1):\r\n if int(x[i:i+2]) % 4 == 0:\r\n cnt += (i + 1)\r\nfor j in range(n):\r\n if int(x[j]) % 4 == 0:\r\n cnt += 1\r\nprint(cnt)", "s = input()\n\nans = 0\n\nprev = -1\n\nfor i, char in enumerate(s):\n\n nb = int(char)\n\n\n if nb % 4 == 0:\n ans += 1\n\n if i and (prev*10+nb) % 4 == 0:\n ans += i\n\n prev = nb\nprint(ans)", "import sys\ninput=sys.stdin.readline\ns = input().strip()\ncount = 0\n\nfor i in range(len(s)):\n if s[i] in [\"0\",\"4\",\"8\"]:\n count+=1\nfor i in range(len(s)-1):\n x = s[i:i+2]\n if int(x)%4 == 0:\n count+= i+1\n \nsys.stdout.write(\"%d\"%(count))\n\n \n\n \t \t\t\t\t \t \t\t\t\t\t \t\t \t\t\t\t\t", "a=input()\r\ncnt=0\r\nn=len(a)\r\nfor i in range(n):\r\n if int(a[i])%4==0:\r\n cnt+=1\r\nfor i in range(n-1):\r\n if int(a[i]+a[i+1])%4==0:\r\n cnt+=(i+1)\r\nprint(cnt)", "def div4(s):\n return int(s[-2:]) % 4 == 0\n\nn = input()\n\ntotal = 0\n\nfor c in n:\n if int(c) % 4 == 0:\n #print(c)\n total += 1\n \nfor i in range(1,len(n)):\n d2 = n[i-1:i+1]\n if div4(d2):\n #print(d2)\n total += i\n\nprint(total)\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\ns=input()\r\nc=0\r\nfor i in range(len(s)):\r\n k=int(s[i])\r\n if(k%4==0):\r\n c+=1 \r\n if(i):\r\n k=int(s[i-1]+s[i])\r\n if(k%4==0):\r\n c+=i \r\nprint(c) ", "s=input();\r\nans=0;\r\ns=[int(x)for x in s];\r\nans+=sum([x%4==0 for x in s]);\r\nfor i in range(len(s)-1):\r\n if (s[i]*10+s[i+1])%4==0:\r\n ans+=i+1;\r\nprint(ans);", "'''\r\n# Sample code to perform I/O:\r\n\r\nname = input() # Reading input from STDIN\r\nprint('Hi, %s.' % name) # Writing output to STDOUT\r\n\r\n# Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail\r\n'''\r\n\r\n# Write your code here\r\ndef divv(ag):\r\n ag=int(ag)\r\n if((ag%4)==0):\r\n return 1\r\n else:\r\n return 0\r\ns=str(input())\r\ncnt=0\r\nfor i in range(0,len(s)):\r\n ag=s[i]\r\n ag=int(ag)\r\n if((ag%4)==0):\r\n cnt=cnt+1\r\ni=0\r\nfor i in range(len(s)-2,-1,-1):\r\n ag=s[i:i+2]\r\n if(divv(ag)==1):\r\n cnt=cnt+1\r\n cnt=cnt+i\r\nprint(cnt)\r\n ", "lst = input().strip()\r\ns = []\r\nfor i in range(len(lst)):\r\n s.append(int(lst[i]))\r\nanswer = 0\r\nfor i in range(1, len(s)):\r\n if (s[i] + 10 * s[i - 1]) % 4 == 0:\r\n answer += i\r\nfor i in range(len(s)):\r\n if s[i] % 4 == 0:\r\n answer += 1\r\nprint(answer)\r\n", "s = input()\r\nans = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n if int(s[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\nprint(ans)\r\n", "seq = list(map(int, list(input())))\r\nn = len(seq)\r\n\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n s = seq[i]\r\n if s % 4 == 0:\r\n ans += 1\r\n if i > 0 and seq[i - 1] % 2 == 0:\r\n ans += i\r\n elif s % 4 == 2:\r\n if i > 0 and seq[i - 1] % 2 == 1:\r\n ans += i\r\nprint(ans)\r\n", "S = input()\r\nL = len(S)\r\n\r\nres = 0\r\n\r\nfor i in range(L)[::-1]:\r\n if int(S[i]) % 4 == 0:\r\n res += 1\r\n if i != 0 and int(S[i - 1: i + 1]) % 4 == 0:\r\n res += i\r\n\r\nprint(res)", "def main():\r\n a=input()\r\n a=list(a)\r\n summ=0\r\n for i in range(len(a)):\r\n if int(a[i])%4==0:\r\n summ+=1\r\n if i!=0 and int(''.join(k for k in a[i-1:i+1]))%4==0:\r\n summ+=i\r\n return summ\r\n\r\nprint(main())", "t = input()\r\nn = len(t)\r\nif n == 1:\r\n print(int(not(bool(int(t)%4))))\r\nelse:\r\n c = 0\r\n if int(t[0])%4 == 0: c+=1 \r\n for i in range(1,n):\r\n if int(t[i])%4 == 0: \r\n c+=1\r\n d = int(t[i-1:i+1])\r\n if d%4==0:\r\n c+=i\r\n print(c)\r\n ", "s = input()\r\nres = 0\r\nn = len(s)\r\nfor i in range(n-2,-1, -1):\r\n k = int(s[i:i+2])\r\n if k % 4 == 0:\r\n res += i+1\r\n if k%10%4 == 0:\r\n res += 1\r\nif int(s[0])%4==0: \r\n res +=1 \r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(map(int, list(input().strip())))\r\nans = len([i for i in s if not i%4])\r\n\r\nfor i in range(len(s)-1):\r\n if not (s[i] * 10 + s[i+1]) % 4:\r\n ans += (i+1)\r\nprint(ans)", "s = input()\r\nans = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n if int(s[i - 1] + s[i]) % 4 == 0:\r\n ans += i\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nprint(ans)", "s=input()\r\nans=0\r\nif(int(s[0])%4==0):ans+=1\r\nfor i in range(1,len(s)):\r\n if(int(s[i])%4==0):ans+=1\r\n if(int(s[i-1]+s[i])%4==0):ans+=i\r\nprint(ans) ", "def check(string):\r\n if string % 4 == 0:\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\nans = 0\r\n\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n ans += 1\r\n\r\nl = 0\r\n\r\nfor i in range(2, len(s)+1):\r\n if check(int(s[l:i])):\r\n ans += i-1\r\n l += 1\r\n\r\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nS=readline().rstrip()\r\nans=0\r\nN=len(S)\r\nfor i in range(N):\r\n if int(S[i])%4==0:\r\n ans+=1\r\nfor i in range(2,N+1):\r\n if int(S[i-2:i])%4==0:\r\n ans+=i-1\r\nprint(ans)", "a = input()\r\nres = [0] * len(a)\r\nfor i in range(len(a)):\r\n tmp = 0\r\n if a[i] in '048':\r\n tmp += 1\r\n if i:\r\n if int(a[i-1:i + 1]) % 4 == 0:\r\n tmp += i\r\n res[i] = res[i - 1] + tmp\r\nprint(res[-1])", "s = input()\nans = sum(int(i) % 4 == 0 for i in s)\n\nfor i in range(1, len(s)):\n\tans += i if int(s[i - 1:i + 1]) % 4 == 0 else 0\n\nprint(ans)", "s=list(map(int,list(input())))\r\nl=[0]*len(s)\r\nif s[0]%4==0:l[0]=1\r\nfor i in range(1,len(s)):\r\n\tif s[i]%4==0:\r\n\t\tl[i]+=1\r\n\t\tif s[i-1]%2==0:l[i]+=i\r\n\telif s[i]%2==0 and s[i]%4!=0 and s[i-1]%2==1:l[i]+=i\r\n\tl[i]+=l[i-1]\r\nprint(l[-1])", "def main():\r\n digs = input()\r\n\r\n cnt = 0\r\n\r\n for i in range(len(digs), 1, -1):\r\n if int(digs[i - 1:i]) % 4 == 0:\r\n cnt += 1\r\n\r\n if int(digs[i - 2:i]) % 4 == 0:\r\n cnt += (i - 1)\r\n\r\n if int(digs[0:1]) % 4 == 0:\r\n cnt += 1\r\n\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nans=0\r\nfor i in range(len(s)):\r\n if(i!=len(s)-1):\r\n if(int(s[i]+s[i+1])%4==0):\r\n ans+=i+1\r\n #print(s[i]+s[i+1],i)\r\n\r\nans+=s.count(\"4\")+s.count(\"8\")+s.count(\"0\")\r\nprint(ans)\r\n", "\r\n\r\nif __name__=='__main__':\r\n string = input()\r\n prev = str(5)\r\n ans = 0\r\n for i in range(len(string)-1,-1,-1):\r\n #print(\"i-> \",i)\r\n num = int(string[i])\r\n if num%4==0:\r\n #print(\"num\",num)\r\n ans += 1\r\n last2 = int(string[i]+prev)\r\n if last2%4==0:\r\n #print(\"last2\",last2)\r\n ans += i+1\r\n prev = string[i]\r\n print(ans)\r\n \r\n \r\n", "#Ashish Sagar\r\ndef countDivisbleby4(s): \r\n n = len(s) \r\n count = 0; \r\n for i in range(0,n): \r\n if (s[i] == '4' or s[i] == '8' or s[i] == '0'): \r\n count += 1\r\n for i in range(0,n - 1): \r\n h = (ord(s[i]) - ord('0')) * 10 + (ord(s[i+1]) - ord('0')) \r\n if (h % 4 == 0): \r\n count+= i + 1\r\n return count \r\n \r\ns = list(input())\r\nprint(countDivisbleby4(s)) ", "s = input()\r\n\r\nans = 0\r\na = [0, 0, 0, 0]\r\nnew_a = [0, 0, 0, 0]\r\nfor c in s:\r\n d = int(c) % 4\r\n for i in range(4):\r\n new_a[i] = 0\r\n new_a[d] = 1\r\n for i in range(4):\r\n new_a[(2 * i + d) % 4] += a[i]\r\n a, new_a = new_a, a\r\n ans += a[0]\r\n\r\nprint(ans)\r\n", "ans = 0\r\nl = [int(x) for x in list(input())]\r\nans += [1,0][l[0]%4 != 0]\r\nif len(l)>1:\r\n\tfor i in range(1,len(l)):\r\n\t\tif l[i] % 4 == 0 and l[i-1] % 2 == 0:\r\n\t\t\tans += (i+1)\r\n\t\telif l[i] % 4 != 0 and l[i] % 2 == 0 and l[i-1] % 2 != 0:\r\n\t\t\tans += i\r\n\t\telif l[i] % 4 == 0:\r\n\t\t\tans += 1\r\nprint(ans)", "from sys import stdin , stdout\r\nimport sys , os\r\n\r\ns = stdin.buffer.readline().decode('ascii').rstrip('\\n\\r',)\r\ncount = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n count += 1\r\n\r\n\r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n \r\n count += i\r\n\r\nprint(count)\r\n", "n = input()\r\ns = 0\r\nfor i in range(1, len(n)):\r\n x = ord(n[i]) - ord('0') + 10 * (ord(n[i - 1]) - ord('0'))\r\n if x % 4 == 0:\r\n s += i\r\n if x % 10 % 4 == 0:\r\n s += 1\r\nif (ord(n[0]) - ord('0')) % 4 == 0:\r\n s += 1\r\nprint(s)", "s=input()\r\nans=0;n=len(s)\r\nif int(s[0])%4==0: ans+=1\r\nfor x in range(1,n):\r\n if int(s[x])%4==0: ans+=1\r\n if int(s[x-1]+s[x])%4==0:ans+=x\r\nprint(ans)", "import math\r\nfrom math import *\r\ns = input()\r\nans = 0\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(s)):\r\n c2 = int(s[i])\r\n if c2 % 4 == 0:\r\n ans += 1\r\n #++ans\r\n if i == 0:\r\n continue\r\n c1 = int(s[i-1])\r\n if (c1*10 + c2)%4 == 0:\r\n ans += i\r\nprint(ans)", "s = input()\r\n\r\nnum = 0\r\nfor i in range(len(s) - 1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n num += i + 1\r\n if s[i] in [\"0\", \"4\", \"8\"]:\r\n num += 1\r\n\r\nif s[-1] in [\"0\", \"4\", \"8\"]:\r\n num += 1\r\n\r\nprint(num)", "\ns = input()\n\nresult = 0\nfor i in range(len(s)):\n if (i != 0):\n if ((10*int(s[i-1]) + int(s[i])) % 4 == 0):\n result += i\n if (int(s[i]) % 4 == 0):\n result += 1\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input().rstrip()\r\nn = len(s)\r\ns = s[::-1]\r\nans = 0\r\nfor j in range(n):\r\n x = int(s[j])\r\n if x % 4 == 0:\r\n ans += 1\r\n if j + 1 < n:\r\n y = int(s[j + 1])\r\n if (10 * y + x) % 4 == 0:\r\n ans += n - j - 1\r\nprint(ans)\r\n", "s = input()\r\nanswer = 0\r\nfor symbol in s:\r\n answer += int(symbol) % 4 == 0\r\nfor i in range(len(s) - 1):\r\n answer += (int(s[i:i + 2]) % 4 == 0) * (i + 1)\r\nprint(answer)\r\n", "s=input()\r\np=0\r\na=[0,4,8]\r\nb=[2,6]\r\nif int(s[0]) in a:\r\n p+=1\r\nfor i in range(1,len(s)):\r\n if int(s[i]) in a:\r\n if int(s[i-1])%2==0:\r\n p+=i+1\r\n else:\r\n p+=1\r\n elif int(s[i]) in b:\r\n if int(s[i-1])%2:\r\n p+=i \r\nprint(p)\r\n \r\n ", "s = input()\r\nans = 0\r\nn = len(s)\r\nfor i in range(n-1):\r\n if int(s[i:i+2])% 4 == 0:\r\n ans+=i+1\r\n if int(s[i]) % 4 == 0:\r\n ans+=1\r\nif int(s[-1])%4==0:\r\n ans+=1\r\nprint(ans)", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#a = [int(x) for x in input().split()]\r\ns = input()\r\nr = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) & 0b11 == 0:\r\n r += 1\r\n if i > 0 and int(s[i-1:i+1]) & 0b11 == 0:\r\n r += i\r\n\r\nprint(r)\r\n", "# from debug import debug\r\nimport sys;input = sys.stdin.readline\r\na = ord('a')\r\ns = input().strip()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n\tif int(s[i])%4 == 0: ans += 1\r\n\tif i-1>=0 and int(s[i-1:i+1])%4 == 0: ans += i\r\nprint(ans)\r\n\r\n", "s = [int(x) for x in input()]\r\nans = 0\r\nif s[0] % 4 == 0:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if s[i] % 4 == 0:\r\n ans += 1\r\n if (s[i] + 10 * s[i - 1]) % 4 == 0:\r\n ans += i\r\nprint(ans)", "l=input()\r\nn=len(l)\r\ncoun=0\r\nfor i in range(0,n-1):\r\n\tif int(l[i]+l[i+1])%4==0:coun+=i+1 \r\n\tif l[i]=='0' or l[i]=='4' or l[i] =='8':coun+=1 \r\nif l[n-1]=='0' or l[n-1]=='4' or l[n-1] == '8':coun+=1\r\nprint(coun)", "# just because of dp tag\r\n\r\ndef main():\r\n # int TC; cin >> TC; while (TC--)\r\n s = input()\r\n n = len(s)\r\n \r\n dp = [[0] * 4 for _ in range(n)]\r\n \r\n for i in range(n):\r\n dp[i][int(s[i]) % 4] += 1\r\n for j in range(4):\r\n x = (j * 10 + int(s[i])) % 4\r\n if i:\r\n dp[i][x] += dp[i - 1][j]\r\n \r\n ans = 0\r\n for i in range(n):\r\n ans += dp[i][0]\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input();\r\nans = 0;\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n ans += 1;\r\nfor i in range(len(s) - 1):\r\n if int(s[i] + s[i+1]) % 4 == 0:\r\n ans += i+1;\r\nprint(ans);", "\r\nnb = input().strip()\r\nn = len(nb)\r\nans = 0\r\nfor i in range(n):\r\n if int(nb[i]) % 4 == 0:\r\n ans += 1\r\n\r\nfor i in range(n - 1):\r\n if int(nb[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\n \r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:1 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\ns=[int(i) for i in S()]\r\nans=1 if s[0]%4==0 else 0\r\np=1\r\nx=s[0]*10\r\nfor i in s[1:]:\r\n\tif i%4==0:ans+=1\r\n\tx+=i\r\n\tif x%4==0:ans+=p\r\n\tx=i*10\r\n\tp+=1\r\nprint(ans)", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(1, n):\r\n if (int(s[i - 1]) * 10 + int(s[i])) % 4 == 0:\r\n ans += i\r\nfor i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\r\nl = 0\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n l+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n l+=(i+1)\r\nprint(l)\r\n", "s=list(input())\r\nif len(s)==1:\r\n if int(s[0])%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n c=0\r\n for i in range(len(s)-2,-1,-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n c+=i+1\r\n for i in range(len(s)):\r\n if int(s[i])%4==0:\r\n c+=1\r\n print(c)", "s = input()\r\ni = len(s) - 1\r\nrez = 0\r\nwhile(i != -1):\r\n\tif(int(s[i]) % 4 == 0):\r\n\t\trez += 1\r\n\tif i == 0:\r\n\t\ti -= 1\r\n\t\tcontinue\r\n\telse:\r\n\t\tif(int(s[i - 1] + s[i]) % 4 == 0):\r\n\t\t\trez += i\r\n\ti -= 1\r\n\r\nprint(rez)\r\n", "s = input()\r\nans = 0\r\nfor i in s:\r\n if i == '0' or i == '4' or i == '8':\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n x = int(s[i] + s[i + 1])\r\n if x % 4 == 0:\r\n ans += (i + 1)\r\nprint(ans)", "n = input()\r\ncount = 0\r\nif len(n) == 1:\r\n if int(n) % 4 == 0:\r\n count += 1\r\nelse:\r\n if int(n[0]) % 4 == 0:\r\n count += 1\r\n for i in range(1, len(n)):\r\n if int(n[i]) % 4 == 0:\r\n count += 1\r\n if int(n[i - 1] + n[i]) % 4 == 0:\r\n count += 1 + ((i - 1) - 0)\r\n\r\nprint(count)\r\n\r\n\r\n", "a = input().strip()\nn = len(a)\ncount = 0\n\nfor i in range(n):\n if int(a[i]) % 4 == 0:\n count += 1\n if i + 1 < n and int(a[i:i+2]) % 4 == 0:\n count += i + 1\n\nprint(count)\n", "def solve(number): \r\n ans = 0\r\n for s in number:\r\n if s == '0' or s == '4' or s == '8':\r\n ans += 1\r\n for i in range(len(number) - 1):\r\n if ((int(number[i]) * 10 + int(number[i+1])) % 4 == 0):\r\n ans += i + 1\r\n print(ans)\r\n\r\n\r\nsolve(input())", "a=input()\r\nl=r=0\r\nfor i in range(len(a)):\r\n t=0\r\n if a[i] in '048':\r\n t+=1\r\n if i:\r\n if int(a[i-1:i+1])%4==0:\r\n t+=i\r\n r=l+t\r\n l=r\r\nprint(r)", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n):\r\n if s[i] == '0' or s[i] == '4' or s[i] == '8':\r\n count += 1\r\n\r\nfor i in range(1, n):\r\n if int(s[i-1:i+1]) % 4 == 0:\r\n count += i\r\n\r\nprint(count)", "x=list(input())\r\ncount=0\r\nfor i in range(len(x)-1):\r\n if((int(x[i])*10+int(x[i+1]))%4==0):\r\n count+=i+1\r\n if(int(x[i])%4==0):\r\n count+=1\r\nif(int(x[-1])%4==0):\r\n count+=1\r\nprint(count)", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n c = int(s[i])\r\n if c % 4 ==0:\r\n ans += 1\r\n c1 = int(s[i-1])\r\n if (c1*10 + c) % 4 == 0:\r\n ans += i\r\nprint(ans)", "n = input()\r\nans = 0\r\n\r\nfor i in range(len(n) - 1):\r\n if int(n[i : i + 2]) % 4 == 0:\r\n ans += i + 1\r\n \r\nfor i in n:\r\n if int(i) % 4==0:\r\n ans += 1\r\n \r\nprint(ans)", "n = input()\r\nA = list(n)\r\nm = len(A)\r\nc = 0\r\nfor i in A:\r\n if int(i)%4 == 0:\r\n c =c+1\r\nfor i in range(m-1):\r\n if (int(A[i]+A[i+1]))%4 == 0:\r\n c =c+(i+1)\r\nprint(c)\r\n", "'''input\n5810438174\n'''\ns = input()\nt = 0\nfor x in range(len(s)-1):\n\tn = int(s[x] + s[x+1])\n\tif n % 4 == 0:\n\t\tt += x + 1\n\tif int(s[x]) % 4 == 0:\n\t\tt += 1\nif int(s[-1]) % 4 == 0:\n\tt += 1\nprint(t)", "import sys\nni = lambda :int(input())\nna = lambda :list(map(int,input().split()))\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\n#######################################################################\n\ns = input()\nans = 0\nn = len(s)\nfor i in range(n):\n if s[i] in \"048\":\n ans += 1\n\nfor i in range(n-1):\n if int(s[i:i+2]) % 4 == 0:\n ans += i + 1\n\nprint(ans)\n\n", "s = input()\ntot = 0\nfor i in range(len(s)):\n if int(s[i])%4==0:\n tot+=1\n if i!= len(s)-1 and int(s[i:i+2])%4==0:\n tot+=i+1\nprint(tot)\n\n\t \t \t\t\t\t\t\t\t\t\t \t \t \t \t \t\t \t", "a = '0'+input()\r\na = a[::-1]\r\nn = len(a)\r\nans = 0\r\nfor i in range(0,n):\r\n if int(a[i])%4==0:\r\n ans += 1\r\n if int(a[i:i+2][::-1])%4==0:\r\n ans += (n-i-2)\r\nprint(ans)\r\n", "import sys\r\n\r\nn, l, c, t = 0, 0, -1, 0\r\n\r\nwhile True:\r\n l = c\r\n c = sys.stdin.read(1)\r\n\r\n if not c or c == '\\n':\r\n break\r\n\r\n c = int(c)\r\n if c % 4 == 0:\r\n t += 1\r\n\r\n if l >= 0 and (l * 10 + c) % 4 == 0:\r\n t += n\r\n\r\n n += 1\r\n\r\nprint(t)\r\n", "import sys\r\ns = sys.stdin.readline()\r\nl = len(s)-1\r\nf = [0 for i in range(l)]\r\nif (int(s[0]) % 4 == 0): f[0] = 1\r\nfor i in range(1,l):\r\n f[i] = f[i-1]\r\n if (int(s[i]) % 4 == 0):\r\n f[i] += 1\r\n if (int(s[i-1]) % 2 == 0): f[i] += i\r\n elif (int(s[i]) % 2 == 0):\r\n if (int(s[i-1]) % 2 == 1): f[i] += i\r\nsys.stdout.write(str(f[l-1]))", "s=input()\r\nans=0\r\nfor i in range(len(s)-1):\r\n if int(s[i:i+2])%4==0:\r\n ans+=i+1\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans+=1\r\n\r\nprint(ans) \r\n", "\r\n# If you win, you live. You cannot win unless you fight.\r\n\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict as unsafedict,deque,Counter as unsafeCounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, floor,log2,factorial,radians,sin,cos\r\nrandom = randint(1, 10 ** 9)\r\nmod=10**9+7\r\ndef ceil(a,b):\r\n\treturn (a+b-1)//b\r\nclass myDict:\r\n\tdef __init__(self,func):\r\n\t\tself.RANDOM = randint(0,1<<32)\r\n\t\tself.default=func\r\n\t\tself.dict={}\r\n\tdef __getitem__(self,key):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tif myKey not in self.dict:\r\n\t\t\tself.dict[myKey]=self.default()\r\n\t\treturn self.dict[myKey]\r\n\tdef get(self,key,default):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tif myKey not in self.dict:\r\n\t\t\treturn default\r\n\t\treturn self.dict[myKey]\r\n\tdef __setitem__(self,key,item):\r\n\t\tmyKey=self.RANDOM^key\r\n\t\tself.dict[myKey]=item\r\n\tdef getKeys(self):\r\n\t\treturn [self.RANDOM^i for i in self.dict]\r\n\tdef __str__(self):\r\n\t\treturn f'{[(self.RANDOM^i,self.dict[i]) for i in self.dict]}'\r\n\r\n\r\ns=rs()\r\ncnt=int(s[0])%4==0\r\nfor i in range(1,len(s)):\r\n\tif int(s[i])%4==0:\r\n\t\tcnt+=1\r\n\tif int(s[i-1]+s[i])%4==0:\r\n\t\tcnt+=(i)\r\nprint(int(cnt))\r\n", "import math\r\nstr_in = \"\"\r\nstr_in = input()\r\ncount = 0\r\nlen_s = len(str_in)\r\ni = len_s-1\r\ncurr_i = len_s\r\nwhile i >= 0:\r\n if curr_i - i == 2:\r\n if (int(str_in[i:curr_i]) % 4 == 0):\r\n \r\n count = count + 1 + i\t\t \t\t\r\n curr_i = i + 1\r\n else:\r\n if(int(str_in[i:curr_i]) % 4 == 0):\r\n count = count + 1\r\n \r\n i = i - 1 \r\n \r\nprint(count)\r\n", "s = input()\r\nant = 0\r\nif int(s[0]) % 4 == 0 : ant += 1\r\nfor i in range(1,len(s)):\r\n if int(s[i]) %4 == 0: ant += 1\r\n if int(s[i-1] + s[i]) % 4 == 0: ant += i\r\nprint(ant)", "a=input()\r\ns=\"0,4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,00,04,08\"\r\ns=list(s.split(','))\r\ncount=0\r\nfor i in range(len(a)):\r\n\tfor j in range(len(s)):\r\n\t\tif len(s[j])==1 and a[i]==s[j]:\r\n\t\t\tcount+=1\r\n\t\tif len(s[j])==2:\r\n\t\t\t# print(a[i]+a[i+1])\r\n\t\t\tif (i+1)<len(a) and s[j]==(a[i]+a[i+1]):\r\n\t\t\t\tcount+=(i+1)\r\n\t\t\t\t# print(\"sd\")\r\nprint(count)", "s=input()\r\nc=0\r\nfor i in range(len(s)-1):\r\n if int(s[i])%4==0:\r\n c+=1\r\n if int(s[i:i+2])%4==0:\r\n c+=i+1\r\nif int(s[-1])%4==0:\r\n c+=1\r\nprint(c)", "s = input()\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '0' or s[i] == '4' or s[i] == '8':\r\n ans += 1\r\n if i > 0 and int(s[i-1:i+1]) % 4 == 0:\r\n ans += i\r\n\r\nprint(ans)", "s=input()\r\ncount=0\r\nfor i in range(len(s)-1):\r\n if(int(s[i:i+2])%4==0):\r\n count+=i+1\r\n if(int(s[i])%4==0):\r\n count+=1\r\nif(int(s[-1])%4==0):\r\n count+=1\r\nprint(count)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "n=input()\r\nn+='~'\r\nc=0\r\nif int(n[0])%4==0:\r\n c+=1\r\nfor i in range(1,len(n)-1):\r\n if int(n[i])%4==0:\r\n c+=1\r\n if int(n[i-1:i+1])%4==0:\r\n c+=(i)\r\nprint(c) ", "n_str = input()\ncount = 0\ntotal = 0\n\ndef is_div(num):\n return int(num) % 4 == 0\n\nfor j in n_str:\n if is_div(j):\n total += 1\n \nfor i in range(0,len(n_str)-1):\n if is_div(n_str[i:i+2]):\n total += i+1\n \nprint(total)\n\t\t\t \t\t \t \t \t \t\t\t \t \t \t", "p = input()\r\ncount = 0\r\nfor i in range(len(p)):\r\n if int(p[i])%4 == 0:\r\n count += 1\r\n if i >= 1 and int(p[i-1:i+1])%4 == 0:\r\n count += i\r\nprint(count)\r\n\r\n", "s=input()\r\ncount=0\r\nfor i in range(0,len(s)):\r\n\tif int(s[i])%4==0:\r\n\t\tcount+=1\r\nfor i in range(0,len(s)-1):\r\n\tif (int(s[i])*10+int(s[i+1]))%4==0:\r\n\t\tcount+=i+1\r\nprint(str(count))", "#!/usr/bin/python3\n\ns = input()\n# s = '124'\nn = len(s)\n\nans = 0\n\nfor i in reversed(range(1, n)):\n\tif int(s[i])%2 == 0:\n\t\tif int(s[i-1:i+1])%4 == 0:\n\t\t\tans += i\n\t\tif int(s[i])%4 == 0:\n\t\t\tans += 1\n\nif int(s[0])%4 == 0: ans += 1\n\nprint(ans)\n", "s = input()\r\n\r\nans = 0\r\nfor i in range(1, len(s)):\r\n if int(s[i - 1: i + 1]) % 4 == 0:\r\n ans += i\r\nfor x in s:\r\n if int(x) % 4 == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\ns = inp()\r\nans = 0\r\nif int(s[0]) % 4 == 0:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if int(s[i - 1: i + 1]) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "s = input()\nsLen = len(s)\nanswer = 0\n\nfor i in range(sLen-1, -1, -1):\n if int(s[i]) % 4 == 0:\n answer += 1\n\n if i-1 == -1:\n break\n\n if int(s[i-1] + s[i]) % 4 == 0:\n answer += i\nprint(answer)\n \n \t \t\t \t \t \t \t \t \t\t \t\t", "from sys import stdin\r\ninput=lambda : stdin.readline()\r\nfrom math import ceil,sqrt,gcd\r\ns=list(map(int,list(input().strip())))\r\nsu=s.count(0)+s.count(4)+s.count(8)\r\nfor i in range(len(s)-1,0,-1):\r\n\tif (10*s[i-1]+s[i])%4==0:\r\n\t\tsu+=i\r\nprint(su)", "import math \n\ns = (input())\nsum = 0\nif int(s[0])%4==0:\n sum=1\nfor i in range(1,len(s)):\n if int(s[i])%4==0:\n sum += 1\n if ((int(s[i-1])*10+int(s[i]))%4)==0:\n sum+=i\nprint(sum)\n", "\r\n\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n # t = int(input())\r\n # for _ in range(t):\r\n #q = int(input())\r\n #a, b = list(map(int, input().split()))\r\n #a = list(map(int, input().split()))\r\n s = input()\r\n l = len(s)\r\n ans = 0\r\n if int(s[0])%4 == 0:\r\n ans+=1\r\n\r\n for i in range(1,l):\r\n if int(s[i])%4 == 0:\r\n ans+=1\r\n if int(s[i-1]+s[i])%4 == 0:\r\n ans+= i\r\n\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = input()\r\nans = 0\r\nfor c in s :\r\n ans += int(c)%4 == 0\r\nfor i in range(0,len(s)-1) :\r\n ans += (int(s[i:i+2])%4==0) * (i+1)\r\nprint(ans)", "s=input()\r\nc=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n c+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n c+=(i+1)\r\nprint(c)", "s=input()\r\nans=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans+=i+1\r\nprint(ans)\r\n ", "t=input()\r\nans=0\r\nfor i in range(len(t)):\r\n if int(t[i])%4==0:\r\n ans+=1\r\nfor i in range(1,len(t)):\r\n if int(t[i-1:i+1])%4==0:\r\n ans+=i\r\nprint(ans)", "string = input()\r\nsum = 0\r\n\r\nfor x in range(len(string)):\r\n if int(string[x]) % 4 == 0:\r\n sum += 1\r\n if x > 0:\r\n if int(string[x-1]) % 2 == 0:\r\n sum += x\r\n elif int(string[x]) % 4 == 2 and x > 0:\r\n if int(string[x-1]) % 2 == 1:\r\n sum += x\r\n\r\nprint(sum)", "a=input()\r\nl=r=0\r\nfor i in range(len(a)):\r\n r=l+(a[i]in'048')+i*(i and int(a[i-1:i+1])%4==0) \r\n l=r\r\nprint(r)", "s = input()+\"1\"\nx = 0\nfor i in range(len(s)):\n if int(s[i:i+2])%4 == 0:\n x+=(i+1) \n if s[i] in [\"0\", \"4\", \"8\"]:\n x+=1\nprint(x)\n \t\t\t \t\t\t\t \t \t \t \t \t\t", "import math\r\nimport bisect\r\nimport sys\r\nfrom collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\n# T = inp()\r\n# for t in range(T):\r\n# N, M = invr()\r\n# A = inlt()\r\nS = insr()\r\n# print(len(S))\r\nout = 0\r\nfor i in range(len(S)-1):\r\n\tif int(S[i])%4 == 0:\r\n\t\tout += 1\r\n\tif int(S[i]+S[i+1])%4 == 0:\r\n\t\tout += i+1\r\nif int(S[-1])%4 == 0:\r\n\tout += 1\r\nprint(out)", "def solve(a):\r\n ans=0\r\n for i in range(len(a)):\r\n if int(a[i])%4==0:\r\n ans+=1\r\n i=0\r\n while i+2<=len(a):\r\n tmp=int(a[i])*10+int(a[i+1])\r\n if tmp%4==0:\r\n ans+=i+1\r\n i+=1\r\n return ans\r\n\r\na=input()\r\nprint(solve(a))\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-1,-1,-1):\r\n b = int(s[i])\r\n if b%4==0:\r\n ans+=1\r\n if i:\r\n a = int(s[i-1])\r\n num = a*10+b\r\n if num%4==0:\r\n ans+=i\r\nprint(ans)", "def main():\n s = input()\n res = 0\n for elem in s:\n if int(elem) % 4 == 0:\n res += 1\n for i in range(len(s) - 1):\n if int(s[i:i + 2]) % 4 == 0:\n res += i + 1\n print(res)\n \nmain()", "import sys\ninput=sys.stdin.readline\nnum=input().strip()\nsubs=0\nx=len(num)\nfor i in range(x-1):\n if int(num[x-1-i])%4==0:\n subs+=1\n if int(num[x-2-i:x-i])%4==0:\n subs+=x-1-i\nif int(num[0])%4==0:\n subs+=1\nprint(subs)\n \t\t\t\t \t\t\t \t \t \t\t \t\t \t\t \t \t", "def solve(num):\n res = 0\n\n l = len(num)\n\n for n in num:\n if int(n)% 4 == 0: res+=1\n \n for i in range(l-1):\n l2 = num[i]+ num[i+1]\n\n if int(l2)%4 == 0: res+=(i+1)\n \n\n return res\n\nnum = input()\n\nprint(solve(num))\n", "import math\r\n \r\ndef main():\r\n n = list(input())\r\n ans = 0\r\n for i in range(0,len(n)):\r\n if( int(n[i]) % 4 == 0):\r\n ans += (1)\r\n for i in range(0,len(n) - 1):\r\n if( (int(n[i])*10 + int(n[i+1]) ) % 4 == 0):\r\n ans += (i+1)\r\n print(ans)\r\nif __name__ == '__main__':main()", "def f():\r\n ans = 0\r\n s = input()\r\n n = len(s)\r\n whitelist = [\"0\", \"2\", \"6\", \"4\", \"8\"]\r\n for i in range(n - 1, -1, -1):\r\n if s[i] in whitelist:\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n suf = int(s[i - 1: i + 1])\r\n if suf % 4 == 0:\r\n ans += i\r\n return ans\r\n \r\n \r\n \r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n print(f())", "s = input()\r\nans = 0\r\nfor i in s:\r\n if i in ['0', '4', '8']:\r\n ans += 1\r\nfor i in range(1, len(s)):\r\n if (10 * int(s[i-1]) + int(s[i])) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jun 28 11:11:00 2020\n\n@author: shailesh\n\"\"\"\n\ns = input()\n\n\ncount = 0\nfor i in s:\n if int(i)%4 == 0:\n count +=1\n\nfor i in range(len(s) - 1):\n l2_digits = int(s[i:i+2])\n# print(l2_digits,i)\n if l2_digits%4 == 0:\n count += i+1\n\nprint(count)", "s = input()+\"1\"\ndiv4 = {\"00\", \"04\", \"08\", \"12\", \"16\", \"20\", \"24\", \"28\", \"32\", \"36\", \"40\", \"44\", \"48\", \"52\",\n \"56\", \"60\", \"64\", \"68\", \"72\", \"76\", \"80\", \"84\", \"88\", \"92\", \"96\"}\ndiv42 = {\"0\", \"4\", \"8\"}\nx = 0\nfor i in range(len(s)):\n if s[i:i+2] in div4:\n x+=(i+1)\n \n if s[i] in div42:\n x+=1\nprint(x)\n \t \t\t \t\t \t \t \t \t\t\t \t\t", "s = input()\nans = 0\nif int(s[0])%4==0:\n\tans += 1\nfor i in range(1,len(s)):\n\tif int(s[i-1]+s[i])%4==0:\n\t\tans += i\n\tif int(s[i])%4==0:\n\t\tans += 1\nprint (ans)", "s = input()\nans = 0\nfor i in range(len(s)):\n if int(s[i]) % 4 == 0:\n ans += 1\n if i >= 1 and int(s[i-1:i+1]) % 4 == 0:\n ans += i\nprint(ans)\n", "s = input()\r\nans = 0\r\nfor i in range(0, len(s) - 1):\r\n if int(s[i:i + 2]) % 4 == 0:\r\n ans += i + 1\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\nif int(s[len(s) - 1]) % 4 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\ns=input() \r\nans=0\r\nfor i in s:\r\n if i in '048' :\r\n ans+=1\r\n \r\nn=len(s)-1\r\n\r\nfor i in range(n-1):\r\n x=int(s[i])*10+int(s[i+1])\r\n if x%4==0 :\r\n ans+=(i+1)\r\n \r\nprint(ans)\r\n\r\n", "from collections import defaultdict\r\ns = input()\r\nvalid = defaultdict(lambda: False)\r\nvalid['00'] = True\r\nvalid['04'] = True\r\nvalid['08'] = True\r\nfor i in range(12, 101, 4):\r\n valid[str(i)] = True\r\nans = 0\r\nfor i in range(0, len(s)-1):\r\n temp = s[i]+s[i+1]\r\n if(valid[temp] == True):\r\n ans += i+1\r\n if(s[i] == '4'):\r\n ans += 1\r\n elif(s[i] == '8'):\r\n ans += 1\r\n elif(s[i] == '0'):\r\n ans += 1\r\n# print(ans)\r\nif(s[len(s)-1] == '4'):\r\n ans += 1\r\nelif(s[len(s)-1] == '8'):\r\n ans += 1\r\nelif(s[len(s)-1] == '0'):\r\n ans += 1\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n s = input()\r\n n = 0\r\n if int(s[0]) % 4 is 0:\r\n n += 1\r\n for i, c in enumerate(s[1:]):\r\n ch = s[i] + c\r\n if int(c) % 4 is 0:\r\n n += 1\r\n if int(ch) % 4 is 0:\r\n n += i+1\r\n print(n)", "n = input()\r\ncount = [n.count(\"4\"),n.count(\"0\"),n.count(\"8\")]\r\nans = sum(count)\r\nfor i in range(1,len(n)):\r\n\r\n\tif int(n[i-1]+n[i])%4 == 0:\r\n\t\tans = ans + i\r\n\r\nprint(ans)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ns = input()\r\nn = len(s)\r\nres = 0\r\nres += s.count(\"0\")\r\nres += s.count(\"4\")\r\nres += s.count(\"8\")\r\nfor i in range(n-1):\r\n subarray = s[i:i+2]\r\n if subarray == \"00\" or (int(subarray) % 4 == 0 and int(subarray) >= 4):\r\n res += i + 1\r\nprint(res)\r\n", "s = input()\r\nn = len(s)\r\nc = 0\r\nfor i in range(n):\r\n if i < n-1 and int(s[i]+s[i+1]) % 4 == 0:\r\n c += i+1\r\n if int(s[i]) % 4 == 0:\r\n c += 1\r\nprint(c)\r\n", "s=input()\r\ncnt=0 \r\nn=len(s)\r\nfor i in range(1,n):\r\n a=int(s[i-1]+s[i])\r\n if a%4==0:\r\n cnt+=(i)\r\nprint(cnt+sum(int(i)%4==0 for i in s))", "s = input()\r\n\r\nn = len(s)\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n v = int(s[i])\r\n if v % 4 == 0:\r\n res += 1\r\n\r\nfor i in range(n-1):\r\n v = int(s[i:i+2])\r\n if v % 4 == 0:\r\n res += 1 + i\r\n\r\nprint(res)\r\n", "s = input()\nn = len(s)\nt = 0\nfor i in s:\n if i == \"4\" or i == \"8\" or i == \"0\":\n t += 1\nfor i in range(n - 1):\n x = s[i:i + 2]\n if int(x) % 4 == 0:\n t += i + 1\nprint(t)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nc = 0\r\nfor i in range(n-1, 0, -1):\r\n if s[i] in ['0', '4', '8']:\r\n c += 1\r\n if (s[i] in ['0', '4', '8'] and int(s[i-1])%2 == 0) or (s[i] in ['2', '6'] and int(s[i-1])%2):\r\n c += i\r\nif s[0] in ['0', '4', '8']:\r\n c += 1\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nimport math\r\n\r\ns=input()\r\nans=0\r\nfor i in range(len(s)-1):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\n r=\"\"+s[i]+s[i+1]\r\n if int(r)%4==0:\r\n ans=ans+i+1\r\nif int(s[len(s)-1])%4==0:\r\n ans=ans+1\r\nprint(ans)\r\n\r\n ", "#!/usr/bin/python3.5\r\nn=input()\r\nc=0\r\nif n[0]=='0' or n[0]=='4' or n[0]=='8':\r\n c+=1\r\nfor i in range(1,len(n)):\r\n if n[i]=='0' or n[i]=='4' or n[i]=='8':\r\n c+=1\r\n if int(n[i-1:i+1])%4==0:\r\n c+=i\r\nprint(c)", "import sys\nimport math\n\ninput = sys.stdin.readline\n\ndef inInt():\n return int(input())\n\ndef inStr():\n return input().strip(\"\\n\")\n\ndef inIList():\n return (list(map(int, input().split())))\n\ndef inSList():\n return (input().split())\n\n#########################################\n\n\ndef solve(s):\n ret = 0\n N = len(s)\n for i in range(N):\n d = int(s[i])\n if d % 4 == 0:\n ret = ret + 1\n if i >= 1:\n p = int(s[i - 1])\n if (p * 10 + d) % 4 == 0:\n ret = ret + i\n print(ret)\n\ns = inStr()\nsolve(s)", "s=input()\r\nans=0\r\nif int(s[0])%4==0 :\r\n ans+=1\r\nfor i in range(1,len(s)):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n t=int( s[i-1:i+1])\r\n if t%4==0:\r\n ans+=i\r\n \r\n \r\nprint(ans)\r\n \r\n \r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ns=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans+=1\r\n if i>0 and int(s[i-1]+s[i])%4==0:\r\n ans+=i\r\nprint(ans)", "s=input()\r\nn=len(s)\r\nans=0\r\nif int(s[0])%4==0:\r\n ans=1\r\nfor i in range(1,n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\n if int(s[i-1]+s[i])%4==0:\r\n ans=ans+i\r\nprint(ans)\r\n\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\n\r\nfor i in range(0,n):\r\n if(i>0 and (((ord(s[i-1])-ord('0'))*10 + (ord(s[i])-ord('0')))%4==0)):\r\n ans += i\r\n if((ord(s[i])-ord('0'))%4==0):\r\n ans+=1\r\n \r\nprint(ans)", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(1,n):\r\n if int(s[i-1:i+1])%4==0:\r\n ans+=i\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans+=1\r\nprint(ans)", "def main():\r\n n = input()\r\n l = len(n)\r\n ans = 0\r\n for i in range(l):\r\n if(n[i] in ['0', '4', '8']):\r\n ans+=1\r\n for i in range(l-1):\r\n if(int(n[i]+n[i+1])%4==0):\r\n ans+=i+1\r\n print(ans)\r\nmain()\r\n", "\r\nfrom sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\n\r\ndef cd4(s):\r\n\tc=0\r\n\tn=len(s)\r\n\tfor i in range(n):\r\n\t\tif s[i]=='0' or s[i]=='4' or s[i]=='8':\r\n\t\t\tc+=1\r\n\tfor i in range(n-1):\r\n\t\tif (int(s[i])*10+int(s[i+1]))%4==0:\r\n\t\t\tc+=i+1\r\n\treturn c\r\n\r\ns=input()\r\nprint(cd4(s))\r\n", "word = input()\r\nn = len(word)\r\ncnt = 0\r\nfor i in word:\r\n\tif int(i)%4==0:\r\n\t\tcnt+=1\r\nfor i in range(1,n):\r\n\tif int(word[i-1]+word[i])%4==0:\r\n\t\tcnt+=(i)\r\nprint(cnt)\r\n", "s=input()\r\nif len(s)==1:\r\n if int(s[0])%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n n=len(s)\r\n dp=0\r\n if int(s[0])%4==0:\r\n dp=dp+1\r\n for i in range(1,n):\r\n if int(s[i])%4==0:\r\n dp=dp+1\r\n if int(s[i-1:i+1])%4==0:\r\n dp=dp+i\r\n print(dp)\r\n", "# aadiupadhyay\r\nimport sys\r\nfrom collections import *\r\nimport os.path\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef solve():\r\n s = st()\r\n ans = 0\r\n n = len(s)\r\n for i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i+1 < n:\r\n a = int(s[i]+s[i+1])\r\n if a % 4 == 0:\r\n ans += i+1\r\n pr(ans)\r\n\r\n\r\nsolve()\r\n", "from collections import Counter, defaultdict, deque\nfrom bisect import bisect_left, bisect_right\nfrom heapq import heapify, heappush, heappop\nfrom functools import cache, lru_cache\n\n\ndef solve():\n s = input()\n n = len(s)\n\n res = 0\n for i in range(1, n + 1):\n res += int(int(s[i - 1]) % 4 == 0)\n if i > 1:\n if int(s[i - 2] + s[i - 1]) % 4 == 0:\n res += i - 1\n print(res)\n\nsolve()\n", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n n = int(s[i])\r\n if n % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n n = int(s[i - 1] + s[i])\r\n if n % 4 == 0:\r\n ans += i\r\nprint(ans)", "s=input()\r\nif len(s)==1:\r\n if int(s)%4==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n cnt=0\r\n for i in range(len(s)-1,0,-1):\r\n if int(s[i])%4==0:\r\n cnt+=1\r\n if int(s[i-1:i+1])%4==0:\r\n cnt+=i\r\n if int(s[0])%4==0:\r\n cnt+=1\r\n print(cnt)", "s = input()\r\n\r\nr = 0\r\nfor i, c in enumerate(s):\r\n if int(c) % 4 == 0:\r\n r += 1\r\n if i == 0:\r\n continue\r\n if int(s[i-1:i+1]) % 4 == 0:\r\n r += i\r\nprint(r)\r\n ", "n = input()\nans = 0\n\n# dig = 1\nfor i in range(len(n)):\n if(int(n[i])%4 == 0):\n ans += 1\n\n# dig = 2]\nfor i in range(1, len(n)):\n if(int(n[i-1]+n[i])%4 == 0):\n ans += 1 + i-1\nprint(ans)\n \n\n\t\t\t \t \t\t \t \t \t\t \t\t \t\t\t \t", "l = list(map(int, input()))\r\nc = 0\r\nn = len(l)\r\nfor i in range(n-1):\r\n if l[i] % 4 == 0 :\r\n c+=1\r\n if (l[i] % 2 == 0 and l[i+1] in [0,4,8]) or (l[i] % 2 != 0 and l[i+1] in [2,6]):\r\n c += i+1\r\nif l[n-1] % 4 == 0:\r\n c+=1\r\nprint(c)", "s = input()\r\nans = 0\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n if int(s[i]) % 4 == 0:\r\n ans += 1\r\n if i > 0:\r\n if int(s[i - 1] + s[i]) % 4 == 0:\r\n ans += i\r\nprint(ans)\r\n", "\nif __name__ == \"__main__\":\n number = input()\n count = number.count('0') + number.count('4') + number.count('8')\n for i in range(1,len(number)):\n n = number[i-1: i+1]\n if int(n) % 4 == 0:\n count += i\n print(count)\n\n\t\t \t\t\t \t\t\t\t\t \t \t \t \t", "def func(s,n):\r\n count=0\r\n for i in range(n-1):\r\n if int(s[i])%4==0:\r\n count+=1\r\n string=s[i]+s[i+1]\r\n if int(string)%4==0:\r\n count+=(i+1)\r\n if int(s[n-1])%4==0:\r\n count+=1\r\n return count \r\n\r\ns=input()\r\nn=len(s)\r\ncount=func(s,n)\r\nprint(count)", "s = input();\r\n\r\nn = len(s);\r\n\r\nt = 0;\r\n\r\nif s[0]=='0' or s[0]=='4' or s[0]=='8' :\r\n t+=1;\r\n\r\n\r\nfor x in range(1,n) :\r\n if s[x]=='0' or s[x]=='4' or s[x]=='8' :\r\n t+=1;\r\n\r\n m = ((ord(s[x-1]))-48)*10 + (ord(s[x]))-48;\r\n\r\n if m%4==0 :\r\n t+=x;\r\n\r\nprint(t);\r\n \r\n", "s=input()\r\ncnt = 0\r\nn=len(s)\r\nfor i in s:\r\n if(int(i)%4==0):\r\n cnt+=1\r\nfor i in range(1,n):\r\n t=int(s[i-1])*10+int(s[i])\r\n if(t%4==0):\r\n cnt+=i\r\nprint(cnt)\r\n", "possible = [\"00\",\"04\",\"08\"] + [ str(4*i) for i in range(3,25) ]\n\nfrom sys import stdin; s = stdin.readline()\ncount = 0\n\nfor i in s:\n\tif i in ['0','4','8']:\n\t\tcount += 1\n\nfor i in range(len(s)-1):\n\tif s[i:i+2] in possible:\n\t\tcount += i+1\n\nprint(count)", "s = list(str(input()))\r\nn = len(s)\r\nans = 0\r\nfor c in s:\r\n c = int(c)\r\n if c%4 == 0:\r\n ans += 1\r\nfor i in range(n-1):\r\n x = 10*int(s[i])+int(s[i+1])\r\n if x%4 == 0:\r\n ans += i+1\r\nprint(ans)\r\n", "k=input();s=0+(int(k[0])%4==0)\r\nfor i,j in enumerate(k[1:]):\r\n if int(j)%4==0:s+=1\r\n if int(k[i]+j)%4==0:s+=i+1\r\nprint(s)\r\n", "from math import *\r\ns = input()\r\nn = len(s)\r\nans = o = e = 0\r\nfor i in range(n):\r\n\tif(s[i] == '4' or s[i] == '8' or s[i] == '0'):\r\n\t\tans += 1\r\n\t\tif(i > 0 and int(s[i-1])%2 == 0):\r\n\t\t\tans += i\r\n\telif(s[i] == '2' or s[i] == '6'):\r\n\t\tif(i > 0 and int(s[i-1])%2 == 1):\r\n\t\t\tans += i\r\nprint(ans)", "#n,m,k = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#a = list(map(int, input().strip().split(' ')))\r\ns=input()\r\nc=0\r\nfor j in range(len(s)):\r\n s1=int(s[j])\r\n if s1%4==0:\r\n c+=1\r\nfor j in range(len(s)-1):\r\n s1=int(s[j:j+2])\r\n if s1%4==0:\r\n c+=j+1\r\nprint(c)\r\n ", "s = input()\r\nsdc = 0\r\n\r\n#Checking for 0th index character\r\nif int(s[0])%4==0:\r\n sdc +=1\r\n\r\n#Iterating from index 1 to n-1\r\nfor i in range(1,len(s)):\r\n #If the single character is divisible by 4\r\n if s[i]=='0' or s[i]=='4' or s[i]=='8':\r\n sdc +=1\r\n\r\n #If the 2 character number is divisible by 4\r\n if int(s[i-1:i+1])%4==0:\r\n sdc += i\r\n \r\nprint( sdc)", "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/628/B\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\nfrom itertools import permutations, combinations\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n s = input().strip()\r\n n = len(s)\r\n count = 0\r\n for i in s:\r\n if int(i) % 4 == 0:\r\n count += 1\r\n for i in range(1, n):\r\n if int(s[i-1]+s[i]) % 4 == 0:\r\n count += i\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n=input()\r\n L=list(n)\r\n res=0\r\n for i in range(len(n)-1):\r\n digit1=L[i]\r\n digit2=L[i+1]\r\n if int(digit1)%4==0: \r\n res+=1\r\n \r\n if int(digit1+digit2)%4==0:\r\n res+=i+1\r\n \r\n if int(L[-1])%4==0:\r\n res+=1\r\n \r\n print(res)\r\nmain()\r\n", "\r\ns=input()\r\ndp=[]\r\ndp.append(0)\r\nfor i in range(len(s)):\r\n if (int(s[i]))%4==0:\r\n dp.append(dp[i]+1)\r\n else:\r\n dp.append(dp[i])\r\n if (i>0) and ((int(s[i-1]+s[i]))%4==0):\r\n dp[i+1]=dp[i+1]+i\r\n \r\nprint(dp[len(s)]) ", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if (int(s[i]) % 4 == 0):\r\n ans += 1\r\nfor i in range(len(s) - 1):\r\n if (int(s[i]) * 10 + int(s[i + 1])) % 4 == 0:\r\n ans += (i + 1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\nn= len(s)\r\nans=0\r\nn-=1\r\n\r\nfor j in range(n):\r\n \r\n p=s[j]\r\n if int(p)%4==0:\r\n ans+=1\r\n\r\n if j>=1:\r\n if int(s[j-1]+s[j])%4==0:\r\n ans+=j\r\n \r\nprint(ans)\r\n", "import sys\n\ns = input()\nn = 0\nfor i in range(len(s) - 1):\n if (int(s[i]) / 4).is_integer():\n n += 1\n if (int(s[i] + s[i + 1]) / 4).is_integer():\n n += i + 1\nif (int(s[-1]) / 4).is_integer():\n n += 1\nprint(n)\n", "q=input()\r\nt=q.count('0')+q.count('4')+q.count('8')\r\nw=len(q)\r\nfor i in range(w-1):\r\n if int(q[w-i-2]+q[w-i-1])%4==0:\r\n t+=w-i-1\r\nprint(t)", "n = input().strip()\r\nD = [0]*len(n)\r\nif len(n) >= 2:\r\n if int(n[0]) % 4 == 0:\r\n D[0] += 1\r\n if int(n[1]) % 4 == 0:\r\n D[1] += 1\r\n if int(n[0:2]) % 4 == 0:\r\n D[1] += 1\r\n D[1] += D[0]\r\n for i in range(2,len(n)):\r\n D[i] = D[i-1]\r\n if int(n[i]) % 4 == 0:\r\n D[i] += 1\r\n if int(n[i-1:i+1]) % 4 == 0:\r\n D[i] += i\r\nelse:\r\n if int(n) % 4 == 0:\r\n D[0] += 1\r\nprint(D[-1])\r\n", "st=input()\r\nl=len(st)\r\nc=0\r\nfor i in range(l-2,-1,-1):\r\n m=int(st[i])\r\n n=int(st[i+1])\r\n k=m*10+n\r\n if(k%4==0):\r\n c=c+i+1\r\nfor j in range(0,l):\r\n a=int(st[j])\r\n if(a%4==0):\r\n c=c+1\r\nprint(c)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(1,n):\r\n x = 10*int(s[i-1]) + int(s[i])\r\n if x%4==0:\r\n ans += i\r\nfor d in s:\r\n if int(d)%4==0:\r\n ans += 1\r\nprint(ans)", "from sys import stdin, stdout\n\ndef main():\n s = stdin.readline().rstrip()\n\n count = 0\n for i, e in enumerate(s):\n if int(e) % 4 == 0:\n count += 1\n if i >= 1:\n if int(s[i - 1: i + 1]) % 4 == 0:\n count += i\n stdout.write(f'{count}\\n')\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nnum = 0\r\nfor i in range(0,len(s)-1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n num += i+1\r\n if int(s[i]) % 4 == 0:\r\n num += 1\r\nif int(s[-1]) % 4 == 0:\r\n num += 1\r\nprint(num)\r\n", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in s:\r\n if int(i)%4==0:\r\n c+=1\r\n \r\nfor i in range(1,n):\r\n if int(s[i-1]+s[i])%4==0:\r\n c+=i\r\n \r\nprint(c)", "def isFactor(s):\r\n return int(s) % 4 == 0\r\n\r\ns = input()\r\nans = 0\r\nfor index in range(1, len(s)):\r\n if isFactor(s[index - 1] + s[index]):\r\n ans += index\r\nfor ch in s:\r\n if ch == '0' or ch == '4' or ch == '8':\r\n ans += 1\r\nprint(ans)", "s='0'+input();n=len(s);count=0\r\nfor i in range(1,n):\r\n if s[i] in '048' and not int(s[i-1])%2:count+=i\r\n if s[i] in '048' and int(s[i-1])%2:count+=1\r\n if s[i] in '26' and int(s[i-1])%2:count+=i-1\r\nprint(count)", "s = str(input())\r\nn = len(s)\r\nc = 0\r\nfor i in range(n):\r\n if s[i] in ['0', '4', '8']:\r\n c += 1\r\n\r\nfor i in range(n-1):\r\n if int(s[i:i+2]) % 4 == 0:\r\n c += (i+1)\r\n \r\nprint(c)", "def solution():\r\n s = input()\r\n l_s = len(s)\r\n count = 1 if not int(s[0]) % 4 else 0\r\n for i in range(1, l_s):\r\n t = 0\r\n a = int(s[i])\r\n b = int(s[i-1])\r\n if not a % 4:\r\n t += 1\r\n t1 = a + 10 * b\r\n if not t1 % 4:\r\n t += 1 + (i-1)\r\n count += t\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "s = input()\ndivisible = [False for _ in range(len(s) - 1)]\nfor i in range(1, len(s)):\n\tif int(s[i - 1] + s[i]) % 4 == 0:\n\t\tdivisible[i - 1] = True\ncount = 0\nfor i in range(len(s) - 1):\n\tif divisible[i]:\n\t\tcount += i + 1\nfor i in range(len(s)):\n\tif int(s[i]) % 4 == 0:\n\t\tcount += 1\nprint(count)\n", "s = input().rstrip()\r\nans = sum(int(i) % 4 == 0 for i in s)\r\nn = len(s)\r\nfor i in range(n - 1):\r\n ans += (int(s[i:i+2]) % 4 == 0) * (i + 1)\r\n\r\nprint(ans)", "\r\ndef countDivisbleby4(s):\r\n n = len(s)\r\n count = 0;\r\n for i in range(0, n, 1):\r\n if (s[i] == '4' or s[i] == '8' or s[i] == '0'):\r\n count += 1\r\n for i in range(0, n - 1, 1):\r\n h = (ord(s[i]) - ord('0')) * 10 + (ord(s[i + 1]) - ord('0'))\r\n if (h % 4 == 0):\r\n count = count + i + 1\r\n return count\r\nif __name__ == '__main__':\r\n s = input()\r\n a = []\r\n for i in range(0, len(s)):\r\n a.append(s[i])\r\n print(countDivisbleby4(a))\r\n", "import sys\r\ninput=sys.stdin.readline\r\ns=input().strip()\r\nans=0\r\nfor i in range(len(s)):\r\n if int (s[i])%4==0:\r\n ans+=1\r\nfor i in range(len(s)-1):\r\n if int(s[i:i+2])%4==0:\r\n ans+=(i+1)\r\nprint(ans)\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ns = list(input())\r\nans = 0; s.pop()\r\nn = len(s)\r\nif int(s[0])%4 == 0: ans += 1\r\nfor i in range(1,n):\r\n if int(s[i])%4 == 0: ans += 1\r\n if int(''.join(s[i-1:i+1]))%4 == 0: ans += i\r\nprint(ans)\r\n", "string = input()\r\ni = 0\r\nj = 0\r\nn = len(string)\r\nstring = list(map(int,string))\r\nans = 0\r\nfor i in range(n):\r\n if (string[i])%4 == 0:\r\n ans+=1\r\n \r\n if i >=1:\r\n value = string[i-1]*10 + string[i]\r\n \r\n if value%4 == 0:\r\n ans += (i)\r\nprint(ans)\r\n ", "a=input()\nl=r=0\nfor i in range(len(a)):\n r=l+(a[i]in'048')+i*(i and int(a[i-1:i+1])%4==0) \n l=r\nprint(r)\n\t\t\t \t\t \t\t \t\t\t\t \t \t\t\t\t \t \t", "s= input()\r\nans = 0\r\nfor i in s:\r\n if int(i)%4 == 0:\r\n ans+=1\r\nn = len(s)\r\nfor i in range(0,n-1):\r\n if int(s[i:i+2])%4 == 0:\r\n ans+=i+1\r\nprint(ans)", "s=input()\r\na=[0]\r\ncount=0\r\nans=0\r\nfor i in range(1,len(s)):\r\n p=int(s[i-1]+s[i])\r\n #print(p)\r\n if(p%4==0):\r\n a.append(1)\r\n else:\r\n a.append(0)\r\n#print(a)\r\nfor i in range(len(a)):\r\n if(a[i]==1):\r\n count=count+i \r\nfor i in s:\r\n if(int(i)%4==0):\r\n ans+=1 \r\n \r\noutput=count+ans\r\n#print(count)\r\n#print(ans)\r\nprint(output)", "s = input()\r\ns1 = list(s)\r\ncount = 0\r\ncount += s1.count('0')\r\ncount += s1.count('4')\r\ncount += s1.count('8')\r\nfor i in range(len(s)-1):\r\n if(int(''.join(s[i:i+2]))%4==0):\r\n count += i+1\r\n\r\nprint(count) ", "longArray = input()\r\na,b,c = longArray.count('0'),longArray.count('4'),longArray.count('8')\r\ncount,size = a+b+c,len(longArray)\r\nfor x in range(size-2,-1,-1):\r\n h = int(longArray[x:x+2])\r\n if not h%4:\r\n count += (size - (size-x)) + 1\r\nprint(count)", "s = input()\r\ndp = [0]*len(s)\r\nif int(s[0]) % 4 == 0:\r\n dp[0]+=1\r\nfor i in range(1,len(s)):\r\n dp[i] = dp[i - 1]\r\n if int(s[i - 1:i + 1]) % 4 == 0:\r\n dp[i]+=i\r\n if int(s[i]) % 4 == 0:\r\n dp[i]+=1\r\nprint(dp[len(s) - 1])\r\n \r\n", "# Anuneet Anand\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nD = set()\r\nfor i in range(100):\r\n\tif i%4==0:\r\n\t\tx = str(i)\r\n\t\tif i<10:\r\n\t\t\tx = \"0\"+x\r\n\t\tD.add(x)\r\n\r\nc = 0\r\nfor i in range(n-1):\r\n\tif s[i]+s[i+1] in D:\r\n\t\tc = c+i+1\r\n\r\nfor i in range(n):\r\n\tif int(s[i])%4==0:\r\n\t\tc = c+1\r\nprint(c)\r\n", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n-1,0,-1):\r\n l=int(s[i])\r\n r=int(s[i-1])\r\n if l%4==0:\r\n ans+=1\r\n k=int(s[i-1]+s[i])\r\n #print(k)\r\n if k%4==0:\r\n #print(i)\r\n ans+=i\r\nif int(s[0])%4==0:\r\n ans+=1\r\nprint(ans)", "s = input()\r\nc = 0\r\nfor i in s:\r\n\tif(int(i) % 4 == 0):\r\n\t\tc += 1\r\n\t\t\r\ni, j = len(s) - 1, len(s) - 2\r\nwhile(j >= 0):\r\n\tif(int(''.join(s[j : i + 1])) % 4 == 0):\r\n\t\tc += len(s) - (len(s) - j) + 1\r\n\t\t# print(i, j)\r\n\ti -= 1\r\n\tj -= 1\r\nprint(c)\t\t\r\n\t", "s = input()\ncount = 0\n\ncount += sum(1 for c in s if int(c) % 4 == 0)\n\nfor pos in range(len(s) - 1):\n start = pos\n end = pos + 2\n # print(start, end, s[start:end])\n if int(s[start:end]) % 4 == 0:\n # This substring, and all substrings before, are divisible by 0.\n count += 1\n count += start\n\nprint(count)\n\t\t\t\t \t \t\t \t \t \t \t\t \t \t\t \t", "s = input()\r\ncount=0\r\nif int(s[0])%4==0:\r\n\tcount+=1\r\nfor i in range(1,len(s)):\r\n\tif int(s[i-1])%2==0 and (s[i] in '048'):\r\n\t\tcount+=(i+1)\r\n\telif int(s[i-1])%2==1 and s[i] in '26':\r\n\t\tcount+=i\r\n\telif int(s[i])%4==0:\r\n\t\tcount+=1\r\nprint(count)", "s=input()\r\ny=[]\r\nfor i in s:\r\n y.append(i)\r\n\r\ncount=0\r\nfor i in y:\r\n if int(i)%4==0:\r\n count+=1\r\n\r\ni=1\r\nwhile i<len(s):\r\n if int(s[i-1:i+1])%4==0:\r\n count+=i\r\n i+=1\r\n\r\nprint(count)\r\n \r\n ", "import sys\r\nimport os.path\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\ns=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n-2,-1,-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans+=i+1\r\nfor i in range(n):\r\n if int(s[i])%4==0:\r\n ans=ans+1\r\nprint(ans)\r\n \r\n ", "s = input()\r\nn = len(s)\r\ndigits = list(s)\r\ncnt = 0\r\nfor i in range(n):\r\n num1 = int(digits[i])\r\n if num1 % 4 == 0:\r\n cnt += 1\r\n if i > 0:\r\n num2 = int(digits[i]) + int(digits[i - 1]) * 10 \r\n if num2 % 4 == 0:\r\n cnt += i\r\nprint(cnt)\r\n", "s=input()\r\nq=int(int(s[0])%4==0)\r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i])%4==0:q+=i\r\n if int(s[i])%4==0:q+=1\r\nprint(q)", "s = input()\nans = 0\nfor i in range(0, len(s)-1):\n if int(s[i:i+2]) % 4 == 0:\n ans += i+1\nfor i in range(0, len(s)):\n if int(s[i]) % 4 == 0:\n ans += 1\n\nprint(ans)", "st = input()\r\nl = len(st)\r\ns = [int(st[i]) for i in range(l)]\r\ncount = 0\r\n\r\nfor i in s:\r\n if i == 0 or i==4 or i==8:\r\n count+=1\r\nif l == 1:\r\n print(count)\r\n exit(0)\r\nfor i in range(l-1):\r\n num = s[i]*10 + s[i+1]\r\n if num%4 == 0:\r\n count += (i+1)\r\nprint(count)", "# help from editorial\r\nMOD = 1000000007\r\n\r\nclass Solution(object):\r\n def __init__(self):\r\n pass\r\n \r\n \r\n def get_input(self):\r\n self.msg = input()\r\n self.res = 0\r\n\r\n\r\n def comp_output(self):\r\n n = len(self.msg)\r\n for i in range(n-1):\r\n if int(self.msg[i])%4 == 0:\r\n self.res += 1\r\n if int(self.msg[i:i+2])%4 == 0:\r\n self.res += i+1\r\n\r\n if int(self.msg[n-1])%4 == 0:\r\n self.res += 1\r\n print(self.res) \r\n \r\n\r\n\r\nobj = Solution()\r\nobj.get_input()\r\nobj.comp_output()\r\n", "s = input()\r\nn = len(s)\r\nans = 0\r\nfor i in range(n):\r\n d1=-1\r\n if i>=1:\r\n d1 = ord(s[i-1])-ord('0')\r\n d2 = ord(s[i])-ord('0')\r\n if d2%4==0:\r\n ans+=1\r\n if d1!=-1 and (d1*10+d2)%4==0:\r\n ans+=i\r\nprint(ans)\r\n ", "l= [char for char in input()]\r\nn=len(l)\r\ncount=0\r\n\r\nfor x in l:\r\n if int(x)%4==0:\r\n count+=1\r\n\r\nfor i in range(n-1, 0, -1):\r\n if int(l[i-1]+l[i])%4==0:\r\n count+=i\r\n\r\n\r\nprint(count)", "n=input()\nc=0\nif n[0]=='0' or n[0]=='4' or n[0]=='8':\n c+=1\nfor i in range(1,len(n)):\n if n[i]=='0' or n[i]=='4' or n[i]=='8':\n c+=1\n if int(n[i-1:i+1])%4==0:\n c+=i\nprint(c)", "n=input()\r\ns=0\r\n \r\nl=[]\r\nfor i in n:\r\n l.append(int(i))\r\nfor i in l:\r\n if(int(i)%4==0):\r\n s=s+1\r\ncur=0\r\nfor i in range(len(l)-1):\r\n s1=10*l[i]+l[i+1]\r\n if(s1%4==0):\r\n s=s+(i+1)\r\nprint(s)", "s = input(\"\")\n\ndp = s.count(\"0\")+s.count(\"4\")+s.count(\"8\")\n\nfor i in range(len(s)-1):\n\tif int(s[i] + s[i+1])%4 == 0:\n\t\tdp += (i+1)\n\nprint(dp)", "# maa chudaaye duniya\r\ns = input()\r\ncnt = 0\r\nfor i in s:\r\n if int(i) % 4 == 0:\r\n cnt += 1\r\nfor i in range(len(s) - 1):\r\n x = int(s[i] + s[i+1])\r\n if x%4 == 0:\r\n cnt += i+1\r\nprint(cnt)", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if i<n-1 and int(s[i]+s[i+1])%4==0:\r\n c+=i+1\r\n if int(s[i])%4==0:\r\n c+=1\r\nprint(c)", "def read():\n return [int(s) for s in input().split()]\n\ns = input().strip()\n\nres = 0\n\nfor i in range(len(s)):\n if int(s[i]) % 4 == 0:\n res += 1\n\nfor i in range(len(s)-1):\n if int(s[i:i+2]) % 4 == 0:\n res += (i + 1)\n\nprint(res)\n", "k=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if int(s[i])%4==0:\r\n k+=1 \r\nfor i in range(1,len(s)):\r\n if int(s[i-1]+s[i])%4==0:\r\n k+=1 \r\n k+=i-1\r\nprint(k)", "s = input()\r\nans = 0\r\nfor i in s:\r\n if int(i)%4==0:\r\n ans += 1\r\nfor i in range(len(s)-1):\r\n if int(s[i]+s[i+1])%4==0:\r\n ans += (i+1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\nans = 0\r\nfor i in range(n - 1):\r\n if not int(s[i] + s[i + 1]) % 4:\r\n ans += i + 1\r\nfor i in s:\r\n if not int(i) % 4:\r\n ans += 1\r\nprint(ans)", "n = input()\r\ndp = [0]*len(n)\r\nans = 0\r\nif int(n[0]) % 4 == 0:\r\n dp[0] = 1\r\n ans = 1\r\n\r\n\r\nfor i in range(1, len(n)):\r\n if (int(n[i])) % 4 == 0:\r\n ans += 1\r\n dp[i] = ans\r\n else:\r\n dp[i] = 0\r\n\r\n if (int(n[i - 1]) * 10 + int(n[i])) % 4 == 0:\r\n ans += 1\r\n\r\n if (int(n[i - 1]) * 10 + int(n[i])) % 4 == 0 and i >= 2:\r\n ans += 1*(i - 1)\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "s = str(input())\nans = 0\nif(s[0] in '048'):\n ans += 1\nif(len(s) > 1):\n for k in range(1,len(s)):\n if(s[k] in '048'):\n ans += 1\n if(int(s[k-1:k+1]) % 4 == 0):\n ans += k\nprint(ans)\n", "import sys\r\ns=input()\r\nn=len(s)\r\nif(n==1):\r\n if(int(s)%4==0):\r\n print(1)\r\n else:\r\n print(0)\r\n sys.exit()\r\nc=0\r\nfor i in range(n-1):\r\n l=int(s[i]+s[i+1])\r\n if(l%4==0):\r\n c+=(i+1)\r\nfor i in range(n):\r\n l=int(s[i])\r\n if(l%4==0):\r\n c+=1\r\nprint(c)", "s = input()\r\nc = 0\r\ni = len(s)\r\nfor a in s:\r\n if int(a) % 4 == 0:\r\n c += 1\r\nwhile i > 1:\r\n if int(s[i-2:i]) % 4 == 0:\r\n c += i-1\r\n i -= 1\r\nprint(c)\r\n" ]

{"inputs": ["124", "04", "5810438174", "1", "039", "97247", "5810438174", "12883340691714056185860211260984431382156326935244", "2144315253572020279108092911160072328496568665545836825277616363478721946398140227406814602154768031", "80124649014054971081213608137817466046254652492627741860478258558206397113198232823859870363821007188476405951611069347299689170240023979048198711745011542774268179055311013054073075176122755643483380248999657649211459997766221072399103579977409770898200358240970169892326442892826731631357561876251276209119521202062222947560634301788787748428236988789594458520867663257476744168528121470923031438015546006185059454402637036376247785881323277542968298682307854655591317046086531554595892680980142608", "123456", "4", "123"], "outputs": ["4", "3", "9", "0", "1", "6", "9", "424", "1528", "30826", "7", "1", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

270

d484895805b8041afab5927ffdb460e2

New Year Candles

Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles. Vasily has *a* candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out. Vasily is smart, so he can make *b* went out candles into a new candle. As a result, this new candle can be used like any other new candle. Now Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number. The single line contains two integers, *a* and *b* (1<=≤<=*a*<=≤<=1000; 2<=≤<=*b*<=≤<=1000). Print a single integer — the number of hours Vasily can light up the room for. Sample Input 4 2 6 3 Sample Output 7 8

[ "a,b=map(int,input().split())\r\nc=int(a-1)/(b-1)\r\nprint(int(a+c))\r\n", "a, b = map(int, input().split())\r\nres = 0\r\nwhile a >= b:\r\n a += 1 - b\r\n res += b\r\nres += a\r\nprint(res)", "a, b = tuple(int(i) for i in input().split())\r\nc = 0\r\ntotal = 0\r\nflag = True\r\n\r\nwhile flag:\r\n total += a\r\n c += a % b\r\n a //= b\r\n a += c // b\r\n c %= b\r\n if a == 0:\r\n flag = False\r\n\r\nprint(total)", "a,b = map(int,input().split())\r\nc=a\r\nx=a\r\nwhile(x>=b ):\r\n c+= x//b\r\n x = x//b + (x - (x//b)*b)\r\n # print(x,c)\r\nprint(c)", "a, b = map(int, input().split())\r\n\r\ncount = 0\r\nwhile a >= b:\r\n\r\n used = a - a%b\r\n count += used\r\n a -= used - used//b\r\n\r\nprint(count + a)", "a, b = list(map(int, input().split()))\r\nh = a\r\nwhile a >= b:\r\n a-=b\r\n a+=1\r\n h+=1\r\nprint(h)", "n,m = input().split()\r\nn,m = int(n),int(m)\r\n\r\nans=0\r\ncnt = n\r\nday = 1\r\n\r\nwhile cnt>0:\r\n if day==m:\r\n cnt+=1\r\n day=1\r\n else:\r\n day+=1\r\n ans+=1\r\n cnt-=1\r\n\r\nprint(ans)\r\n\r\n\r\n# 10 + ", "def sol(a, b):\r\n # Calculate the number of hours\r\n hours = a\r\n # Calculate the number of times b can be divided into a\r\n z = a // b\r\n hours += z\r\n # Calculate the remaining hours if a is greater than b\r\n if a > b:\r\n z += a % b\r\n e = 0\r\n # Continue dividing z by b until it is less than b\r\n while z >= b:\r\n # Calculate the remaining hours if z is greater than b\r\n if z > b:\r\n e += z % b\r\n z = z // b\r\n hours += z\r\n z += e\r\n e = 0\r\n return hours\r\n\r\n\r\na, b = map(int, input().split())\r\nprint(sol(a,b))", "n, b = map(int, input().split())\r\nans = n\r\nwhile(n >= b):\r\n toadd = n // b\r\n ans += toadd\r\n left = n % b\r\n n = toadd + left\r\nprint(ans)", "m,n=map(int,input().split())\r\nc=m\r\nd=0\r\nwhile (m>=n):\r\n b=m//n\r\n c=c+b\r\n d=m%n\r\n m=b+d\r\nprint(c)\r\n", "from math import ceil\r\ncandels , replace = map(int ,input().split()) \r\ncounter = candels \r\nwhile candels >= replace : \r\n c = int(candels / replace)\r\n counter += c \r\n candels = c + candels % replace \r\nprint(counter)\r\n \r\n", "n, a=list(map(int, input().split()))\r\ns=n\r\nwhile n>=a:\r\n p=n\r\n n=p//a+p%a\r\n s+=p//a\r\nprint(s)", "a, b = map(int, input().split())\r\n\r\ntotalHours = a\r\n\r\nwhile a >= b:\r\n newCandles = a // b\r\n totalHours += newCandles\r\n a = newCandles + (a % b)\r\n\r\nprint(totalHours)\r\n", "a, b = map(int, input().split())\r\nans = a\r\nost = 0\r\nwhile a >= b:\r\n ans += a // b\r\n ost = a % b\r\n a //= b\r\n a += ost\r\nprint(ans)\n# Mon Nov 28 2022 23:01:11 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int, input().split())\r\na2, count = 0, 0\r\nwhile a > 0:\r\n a2 += 1 - a2//b * b\r\n a += a2//b - 1\r\n count += 1\r\nprint(count)\r\n", "# https://codeforces.com/problemset/problem/379/A\r\n\r\na, b = [int(x) for x in input().split()]\r\n\r\nh = a\r\nwhile a >= b:\r\n div, mod = divmod(a, b)\r\n a = div + mod\r\n h += div\r\n\r\nprint(h)\r\n", "a,b = input().split()\r\na,b = int(a), int(b)\r\nc = a\r\nwhile a >= b:\r\n temp = a // b\r\n c += temp\r\n a = a % b + temp\r\nprint(c)", "a, b = map(int, input().split())\ns = a\nc = a\nwhile c >= b:\n a = c // b\n s = s + a\n c = c % b + a\nprint(s)\n\n\n \n \n \n", "a , b = map(int,input().split())\r\nh = 0\r\nleft = 0\r\nwhile a > 0:\r\n h += a\r\n left += a\r\n a = int(left/b)\r\n left = left % b\r\nprint(h)", "a, b = map(int, input().split())\r\nif 1<=a<=1000 and 2<=b<=1000:\r\n c=a\r\n while a//b>=1:\r\n c+=a//b\r\n a=a//b+a%b\r\n \r\n print(c)", "a, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nhours = a\r\nwhile a >= b:\r\n c = a // b\r\n hours += c\r\n a = a % b + c\r\n\r\nprint(hours)", "#Coder_1_neel\r\na,b=map(int,input().split())\r\nhr=a\r\nx=a\r\nwhile(x>=b):\r\n n=x//b\r\n hr+=n\r\n x=n+(x%b)\r\nprint(hr) ", "n,m = map(int,input().split())\r\ns = 0\r\na = n\r\nb = 0\r\nwhile True:\r\n s += a\r\n if a+b<m:\r\n break\r\n a = (a+b)//m\r\n b = s%m\r\nprint(s)", "import sys\r\nimport math\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\na = int(inputs[0].strip().split()[0])\r\nb = int(inputs[0].strip().split()[1])\r\ntotalCandlesLeft = a\r\naCandlesTaken = 0\r\ncandlesToReuse = 0\r\nhours = 0\r\nwhile totalCandlesLeft > 0:\r\n totalCandlesLeft-=1\r\n aCandlesTaken+=1\r\n hours+=1\r\n if aCandlesTaken == b:\r\n aCandlesTaken-=b\r\n totalCandlesLeft+=1\r\nprint(hours)\r\n ", "from sys import stdin, stdout\r\n\r\na, b = map(int, stdin.readline().split())\r\n\r\nstdout.write(str(a + (a - 1) // (b - 1)))\r\nstdout.flush()", "s, b = map(int, input().split())\r\nans = s\r\nwhile s//b > 0:\r\n ans += s//b\r\n s = (s%b) + (s//b)\r\nprint(ans)", "candles, b = map(int, input().split())\r\nhours = 0\r\nwhile candles > 1:\r\n hours += (candles//b)*b\r\n if candles >= b:\r\n candles = candles//b + candles%b\r\n else:\r\n break\r\nprint(hours+candles)\r\n", "a, b = map(int, input().split())\r\nhours = a\r\n\r\nwhile a >= b:\r\n candles = a // b\r\n hours += candles\r\n a = candles + (a % b)\r\n\r\nprint(hours)\r\n\r\n", "a, b = map(int, input().split())\r\nn = a\r\nc = a\r\ns = 0\r\nwhile n - b >= 0:\r\n n -= b\r\n n += 1\r\n c += 1\r\nprint(c)", "a, b = map(int, input().split())\r\ntotal = a\r\nused = a\r\n\r\nwhile used >= b:\r\n new = (used - (used%b)) // b\r\n total += new\r\n used -= new*b - new\r\nprint(total)\r\n", "if __name__ == \"__main__\":\n a, b = map(int, input().strip().split())\n print(a + (a-1)//(b- 1))", "for i in range(1):\r\n a,b=map(int,input().split(' '))\r\n f=0\r\n h=0\r\n while (a>0):\r\n h+=1\r\n a-=1\r\n f+=1\r\n if (f==b):\r\n f=0\r\n a+=1\r\n print(h)\r\n", "a, b = map(int, input().split())\r\nhour = 0\r\nold = 0\r\nwhile a > 0:\r\n hour += 1\r\n a -= 1\r\n old += 1\r\n if old == b:\r\n a += 1\r\n old = 0\r\nprint(hour)\r\n", "a,b = map(int,input().split())\r\nx = a\r\nwhile a>=b:\r\n x = x+(a//b)\r\n a = a//b + a%b\r\nprint(x)", "a, b = list(map(int, input().split()))\r\nans = (a - 1) // (b - 1)\r\nprint(ans + a)", "n =(input()).split(\" \")\r\na,b =int(n[0]),int(n[1])\r\nc=a\r\nwhile a >=b :\r\n c+= a//b\r\n a= a//b +a%b\r\n\r\nprint(c)\r\n\r\n", "a,b=map(int,input().split())\ns=a\nc=1\nwhile(c!=0):\n c=a//b\n s=s+c\n a=c+a%b\nprint(s)\n", "a,b=map(int,input().split())\r\n\r\nwentOutCandles = a\r\nnumOfNewCandle = 0\r\n\r\nwhile wentOutCandles>=b:\r\n newCandle = wentOutCandles//b\r\n remainder = wentOutCandles%b\r\n \r\n numOfNewCandle += newCandle\r\n wentOutCandles = remainder+newCandle\r\n\r\nprint(a + numOfNewCandle)", "strng = input()\r\nstrng_lst = strng.split()\r\n\r\na = int(strng_lst[0])\r\nb = int(strng_lst[1])\r\n\r\ncount = a\r\nburnt = a\r\n\r\nwhile burnt >= b:\r\n new = (burnt - (burnt % b)) // b\r\n count += new\r\n burnt = burnt % b\r\n burnt = burnt + new\r\n \r\nprint(count)", "from math import *\r\n\r\n#for _ in range(int(input())):\r\na,b=map(int,input().split())\r\ncount=a\r\nwhile (a>=b):\r\n count+=(a//b)\r\n rem=a%b\r\n a=(a//b)\r\n a+=rem\r\nprint(count)", "a, b = map(int, input().split())\r\ns = a\r\nwhile a>=b:\r\n div = a//b\r\n s = s+div\r\n m = a%b \r\n a = div + m\r\nprint(s)", "a,b = map(int, input().split())\r\nhours = 0\r\nstock = a\r\noldstock = 0\r\nbuffer = 0\r\nwhile(stock >= 1):\r\n hours = hours + stock\r\n oldstock = stock\r\n stock = (stock + buffer)//b\r\n buffer = ((oldstock + buffer)%b)\r\nprint(hours)", "a,b=[int(x) for x in input().split()]\r\ntime=a\r\ncount=0\r\ni=1\r\nwhile(i<=a):\r\n count+=1\r\n i+=1\r\n if(count==b):\r\n a+=1\r\n count=0\r\n time+=1\r\nprint(time)\r\n ", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = 0\r\nk = 0\r\nwhile a > 0:\r\n c += a\r\n a, k = (a + k) // b, (a + k) % b\r\nprint(c)", "def q1(a,b,sum):\r\n while a>=b:\r\n r1=a//b\r\n r2=a%b\r\n sum+=(r1*b)\r\n a=r1+r2 \r\n else:\r\n sum+=a\r\n return sum\r\n \r\n \r\ni=input().split()\r\nl=list(map(int,i))\r\nprint(q1(l[0],l[1],0))", "import re\r\n\r\n\r\ncandeleIntere,b = map(int,input().split())\r\ns = 0\r\nrestoSciolte = 0\r\nwhile candeleIntere > 0 or restoSciolte >= b:\r\n\r\n candeleIntere += restoSciolte//b\r\n restoSciolte %= b\r\n\r\n s += candeleIntere\r\n restoSciolte+=candeleIntere%b\r\n candeleIntere//=b\r\n\r\nprint(s)", "a, b = map(int, input().split())\r\nh, a0 = 0, 0\r\nwhile a>0:\r\n h += 1\r\n a -= 1\r\n a0 += 1\r\n if a0>=b:\r\n a+= 1\r\n a0-= b\r\nprint(h)", "(fr,se)=[int(x) for x in input().split()]\r\nd=c=0\r\nwhile fr!=0:\r\n fr-=1\r\n d+=1\r\n c+=1\r\n if c==se:\r\n fr+=1\r\n c=0\r\nprint(d)", "a,b=map(int,input().split())\r\nans=0\r\nc=0\r\nwhile a:\r\n ans+=1\r\n a-=1\r\n c+=1\r\n if c==b:\r\n c=0\r\n a+=1\r\nprint(ans)", "a,b=map(int,input().split())\r\ntime = 0\r\nwhile a>=b:\r\n q=int(a/b)\r\n r=int(a%b)\r\n a=q+r\r\n time+=q*b\r\nprint(time+a)\r\n", "# https://codeforces.com/contest/379/problem/A\r\n\r\nuser_input = input().split(' ')\r\na = int(user_input[0])\r\nb = int(user_input[1])\r\n\r\ndef rem_candle_hours(a, b):\r\n if a < b:\r\n return 0\r\n elif a == b:\r\n return 1\r\n else:\r\n return a//b + rem_candle_hours(a//b + a%b, b)\r\n \r\nhours = a + rem_candle_hours(a, b)\r\n\r\nprint(hours)", "a, b = map(int, input().split())\nhrs = a\nwhile a >= b:\n\thrs += a // b\n\ta = (a // b) + (a % b)\nprint(hrs)\n\t \t\t\t \t\t \t\t\t \t \t\t \t\t\t\t\t \t", "a, b = [int(i) for i in input().split()]\r\n\r\nres = 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n res += 1\r\n if res % b == 0:\r\n a += 1\r\n\r\nprint(res)", "a,b=map(int,input().split())\r\nans=a\r\nstore=0\r\nwhile (a+store)//b>0:\r\n preans=a\r\n a=(a+store)//b\r\n store=(preans+store)%b\r\n ans+=a\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nt=a\r\nwhile a//b>0:\r\n t+=a//b\r\n n=a//b+a%b\r\n a=n\r\nprint(t)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a \r\n\r\nwhile a >= b:\r\n \r\n new_candles = a // b\r\n \r\n remaining_candles = a % b\r\n \r\n total_hours += new_candles\r\n \r\n a = new_candles + remaining_candles\r\n\r\nprint(total_hours)\r\n", "a,b=[int(i) for i in input().split()]\r\ns=a\r\nwhile a>=b:\r\n s+=(a//b)\r\n a=(a//b)+(a%b)\r\nprint(s)", "a, b = map(int, input().split())\r\ns = 0\r\ni = 0\r\nwhile a > 0:\r\n if s == b:\r\n s = 0\r\n a += 1\r\n a -= 1\r\n s += 1\r\n i += 1\r\nprint(i + s // b)", "A,n = map(int,input().split())\r\nans=0\r\nactive =A\r\nburnt=0\r\nwhile active>0:\r\n ans += active\r\n burnt+=active\r\n active = (burnt)//n;\r\n burnt = (burnt)%n\r\n # active = nactive\r\nprint(ans)\r\n", "a, b=map(int, input().split())\r\nleft, day=0, 0\r\nwhile a>0:\r\n day+=1\r\n a-=1\r\n left+=1\r\n if left==b:\r\n left=0\r\n a+=1\r\nprint(day)\r\n ", "\"\"\"\nA. New Year Candles: implementation\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nVasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\nVasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it goes out.\nVasily is smart, so he can make b went out candles into a new candle. As a result, this new candle can be used like any other new candle.\nNow Vasily wonders: for how many hours can his candles light up the room if he acts optimally well? Help him find this number.\n\nInput\nThe single line contains two integers, a and b (1 ≤ a ≤ 1000; 2 ≤ b ≤ 1000).\n\nOutput\nPrint a single integer — the number of hours Vasily can light up the room for.\n\"\"\"\n\ndef new_year_candles():\n a, b = map(int, input().split(' '))\n print(a + (a - 1) // (b - 1))\n\nif __name__ == '__main__':\n new_year_candles()", "x,y=map(int,input().split())\r\ncount=x\r\nwhile x>=y:\r\n x=x-y+1\r\n count+=1\r\nprint(count)", "a, b = (int(i) for i in input().split())\r\n\r\nexting = 0\r\nhours = 0\r\nwhile a != 0 or hours == 0:\r\n\thours += a\r\n\texting += a\r\n\ta = exting // b\r\n\texting = exting % b\r\nprint(hours)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n ans+=a//b\r\n a=a%b + a//b\r\nprint(ans)", "a,b = map(int,input().split())\r\nans, c= 0,0\r\nwhile a:\r\n ans +=1\r\n a -=1\r\n c +=1\r\n if c == b:\r\n c =0 \r\n a +=1\r\nprint(ans) ", "n,m=map(int,input().split());a=0;b=0\r\nwhile not n<=0 or a==m:\r\n b+=1\r\n if a==m:a=1;continue\r\n n-=1;a+=1\r\nprint(b)", "a,b=map(int,input().split())\r\ntime=(a*b-1)//(b-1)\r\nprint(time)", "a, b = [int(i) for i in input().split()]\r\nans = 0\r\nwhile a:\r\n ans += 1\r\n a -= 1\r\n if ans % b == 0:\r\n a += 1\r\nprint(ans)", "def solve():\r\n a, b = [int(i) for i in input().split()]\r\n t = 0\r\n o = 0\r\n while a:\r\n a -= 1\r\n o += 1\r\n if o == b:\r\n o = 0\r\n a += 1\r\n t += 1\r\n return t\r\n\r\n\r\nprint(solve())", "a, b = map(int, input().split())\r\nans = 0\r\ncura = a\r\ncurb = 0\r\nwhile cura != 0:\r\n ans += cura\r\n curb += cura\r\n cura = curb // b\r\n curb = curb % b\r\nprint(ans)", "a,b = map(int,input().split())\r\nk=0\r\nx=0\r\nwhile a>0:\r\n a-=1\r\n x+=1\r\n k+=1\r\n if k==b:\r\n k=0\r\n a+=1\r\nprint(x)", "a, b = map(int, input().split())\r\ntime = a\r\nogr = a\r\nwhile ogr >= b:\r\n time += ogr // b\r\n ost = ogr % b\r\n ogr = ogr // b + ost\r\nprint(time)\r\n", "if __name__=='__main__':\r\n a,b=map(int,input().split())\r\n s=a\r\n while a>=b:\r\n s=s+(a//b)\r\n a=(a//b)+(a%b)\r\n print(s)", "k = input().split(\" \")\r\nk = [int(i) for i in k]\r\na = k[0]\r\nb = k[1]\r\nl = []\r\nl.append(a - a%b)\r\nwhile(True):\r\n a = int(a/b) + a%b\r\n if(a<=b):\r\n break\r\n else:\r\n l.append(a-a%b)\r\nif(a==b):\r\n print(sum(l)+a+1)\r\nelse:\r\n print(sum(l)+a)", "import math\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nans = math.floor(a/b)\r\nextra = math.floor(a/b) + a%b\r\nwhile extra >= b:\r\n ans += math.floor(extra/b)\r\n extra = math.floor(extra/b) + extra%b\r\nprint(a+ans)", "a, b = map(int, input().split())\r\nres = 0\r\nremainder = 0\r\n\r\nwhile a > 0:\r\n res += a\r\n can_burn = a // b\r\n remainder += a % b\r\n a = can_burn\r\n a += remainder // b\r\n remainder = remainder % b\r\n \r\nprint(res)", "A,B=map(int,input().split())\r\nans=A\r\nwhile A-B>=0:\r\n ans+=A//B\r\n A=A//B+A%B\r\nprint(ans)", "t,k=0,0\r\na,b=map(int,input().split())\r\nwhile a>0:\r\n t+=1\r\n k+=1\r\n a-=1\r\n if k == b:\r\n a+=1\r\n k-=b\r\nprint(t)\r\n", "def recursive_module(a,b,h,remain):\r\n h += a\r\n remain += a%b\r\n if a + remain >= b:\r\n if remain >= b:\r\n remain -= b\r\n return recursive_module((a//b)+1,b,h,remain)\r\n return recursive_module((a//b),b,h,remain)\r\n else:\r\n print(h)\r\n\r\na, b = map(int, input().split())\r\nrecursive_module(a,b,0,0)", "a, b = map(int, input().split())\r\ntime = 0\r\nr = 0\r\n\r\nwhile a > 0:\r\n time += a\r\n if a % b == 0:\r\n a //= b\r\n else:\r\n r += a % b\r\n a //= b\r\n\r\n if r >= b:\r\n a += r // b\r\n r %= b\r\n\r\ntime += r // b # Add the remaining candles to the total time\r\nprint(time)\r\n", "a,b=map(int,input().split());z=0\r\nn=a\r\nwhile a>=b:\r\n n+=a//b\r\n z=a%b\r\n a=a//b+z\r\nprint(n)", "n,m=map(int,input().split())\r\na=0\r\nwhile a!=n:\r\n a=a+1\r\n if a%m==0:\r\n n=n+1\r\nprint(a)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 6 13:17:08 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nd=n\r\nx=n//m\r\nprev=0\r\nwhile x>0:\r\n d=d+x\r\n prev=prev+x\r\n x=(d//m)-prev\r\n#if d%m==0:\r\n# d=d+1\r\nprint(d)", "x,y=map(int,input().split())\r\nz=0\r\na=0\r\nwhile x>0:\r\n x-=1\r\n a+=1\r\n z+=1\r\n if a//y==1:\r\n x+=1\r\n a=0\r\nprint(z)", "a, b = map(int,input().split())\r\nans = 0\r\nwhile a > 0:\r\n a -= 1\r\n ans += 1\r\n if ans%b==0:\r\n a+=1\r\nprint(int(ans))", "a,b = list(map(int,input().split()))\r\nans = a\r\nwhile a >= b:\r\n c = a//b\r\n a %= b\r\n a += c\r\n ans += c\r\nprint(ans)", "c, n = list(map(int, input().split()))\r\ncount = c\r\nwhile c >= n:\r\n count += int(c/n)\r\n c = int(c/n) + (c % n)\r\nprint(int(count))", "a, b = map(int, input().split())\r\n\r\n# We have to check how many candles we can create with our burnt out candles'\r\n# We have to find how many hours he can light the room up for\r\n# Given an initial amount of candles\r\n# And amount of candles to build a new candle\r\n# \"a\" holds the number of candles at hand\r\n\r\nprint((a*b-1)//(b-1))", "# Source: https://usaco.guide/general/io\n\ncandles,taketime = map(int,input().split())\nused =0\ntime =0\nwhile candles > 0:\n\ttime += 1\n\tcandles -= 1\n\tused += 1\n\tif used == taketime:\n\t\tused = used-taketime\n\t\tcandles += 1\nprint(time)\n\n\n\n", "\r\na, b = [int(k) for k in input().split()]\r\nsum = a\r\nwhile a >= b:\r\n c = int(a / b)\r\n sum += c\r\n a = c + a % b\r\nprint(sum)", "nn=[int(i) for i in input().split()]\r\na=nn[0]\r\nb=nn[0]\r\nwhile b>=nn[1]:\r\n a+=int(b/nn[1])\r\n b=b%nn[1]+int(b/nn[1])\r\nprint(str(a))", "a,b=map(int,input().split())\r\nn=a\r\nm=a\r\nwhile m>=b:\r\n n+=m//b\r\n m=m//b+m%b\r\nprint(n)", "a, b = map(int, input().split())\r\n\r\nhours = a\r\npile = 0\r\n\r\nwhile a > 0:\r\n pile += a\r\n a, leftover = divmod(pile, b)\r\n hours += a\r\n pile = leftover\r\n\r\nprint(hours)\r\n", "a,b=map(int,input().split())\r\nprint(a+(a-1)//(b-1))", "import sys\n\ndef candles(a: int, b: int) -> int:\n total = a # 4\n extra = a % b # 0\n remains = int(a / b) # 2\n total += remains\n while (remains + extra) >= b:\n new_a = remains + extra\n extra = new_a % b\n remains = int(new_a / b)\n total += remains\n\n return total\n\nif __name__ == '__main__':\n a, b = sys.stdin.readline().split(\" \")\n\n print(candles(int(a), int(b)))\n\n # print(candles(4, 2))\n #\n # print(candles(6, 3))\n #\n # print(candles(6, 2))\n", "x,y = map(int,input().split())\r\nc = 0\r\ncd = x\r\nwhile x>=y:\r\n c += cd\r\n cd = x//y\r\n x= x//y + x%y\r\nprint(c + cd)", "nm = list(map(int,input().split(\" \")))\r\nsocks = nm[0]\r\nnew = nm[1]\r\ndays = 0\r\n\r\nwhile socks > 0:\r\n socks -= 1\r\n days += 1\r\n if days%new == 0:\r\n socks += 1\r\n\r\nprint(days)\r\n", "a,b = map(int,input().split())\r\ncurrent = a\r\nburnedDown = 0\r\nanswer=0\r\nwhile current > 0:\r\n current-=1\r\n answer+=1\r\n burnedDown+=1\r\n if burnedDown == b:\r\n burnedDown = 0\r\n current+=1\r\n \r\nprint(answer)", "a, b = map(int, input().split())\r\nx = 0\r\ntime = 0\r\nwhile a != 0:\r\n time += 1\r\n a -= 1\r\n x += 1\r\n if x >= b:\r\n a += 1\r\n x -= b\r\nprint(time)", "def time(a,b):\r\n if b > a:\r\n return a\r\n else:\r\n return int(a//b)*b + time(a//b+a%b,b)\r\n \r\na,b = map(int,input().split(' '))\r\nprint(time(a,b))", "# 4 2,123 5\r\nn,b = list(map(int,input().split()))\r\npotracheno = 0\r\ncount = 0\r\n\r\nwhile n != 0:\r\n n -= 1\r\n potracheno += 1\r\n if potracheno == b:\r\n potracheno -= b\r\n n += 1\r\n count += 1\r\nprint(int(count))\r\n ", "a, b = map(int, input().split())\r\n\r\n\r\ncandles = a\r\nhours = a\r\nwhile candles / b >= 1:\r\n hours += int(candles / b)\r\n candles = int(candles / b) + candles % b\r\n\r\n\r\nprint(hours)", "a,b = map(int,input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total += a // b\r\n a = (a//b)+(a%b)\r\n\r\nprint(total)\r\n", "l=list(map(lambda x:int(x),input().split()))\r\na,b=l[0],l[1]\r\ncnt=0\r\ncnt+=a\r\nwhile True:\r\n if a/b>=1:\r\n rnd=a%b\r\n quot=a//b\r\n cnt+=quot\r\n a=rnd+quot\r\n else:break\r\nprint(cnt)", "a, b = map(int, input().split())\r\n\r\nst = a * '1'\r\ncounter = 0\r\nwhile '1' in st:\r\n counter += st.count('1')\r\n st = st.replace('1', '0').replace('0' * b, '1')\r\n\r\nprint(counter)\r\n\r\n\r\n", "l=[int(i) for i in input().split()]\r\na=l[0]\r\nb=l[1]\r\ncandles=0\r\nleft=0\r\nwhile(a>=b):\r\n candles+=(a//b)*b\r\n left=a%b\r\n a=a//b+left\r\nprint(candles+a)", "a, b = map(int, input().split())\r\nh = 0\r\nans = 0\r\nwhile a:\r\n h += 1\r\n a -= 1\r\n if h == b:\r\n h = 0\r\n a += 1\r\n ans += 1\r\n\r\nprint(ans)", "p,q=map(int,input().split()) \r\nprint((p*q-1)//(q-1))", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n a,b=map(int,input().split())\r\n ans=0\r\n while a>0:\r\n a-=1\r\n ans+=1\r\n if ans%b==0:\r\n a+=1\r\n \r\n print(ans)\r\n \r\n \r\nsol()", "a,b=map(int,input().split())\r\nif(b>a):\r\n print(a)\r\nelse:\r\n h=a\r\n re=a\r\n while(re>=b):\r\n h+=re//b\r\n re=re%b+re//b\r\n print(h)\r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nwrite = sys.stdout.write\r\na, b = (int(x) for x in input().split())\r\nt = 0\r\nm = 0\r\nwhile a > 0:\r\n\tt += 1\r\n\ta -= 1\r\n\tm += 1\r\n\tif m == b:\r\n\t\tm = 0\r\n\t\ta += 1\r\nwrite(str(t))", "a, b = map(int, input().split())\r\n\r\n\r\ndef solve(a, r):\r\n if a == 0 and r < b:\r\n return 0\r\n r += a\r\n return a + solve(r // b, r % b)\r\n\r\n\r\nprint(solve(a, 0))\r\n\r\n", "a, b = map(int, input().split())\r\n\r\nres = a \r\n\r\nwhile a >= b:\r\n s = a // b \r\n res += s \r\n a = s + a % b \r\n\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nc=a\r\nd=0\r\nwhile a>=b:\r\n c=c+a//b\r\n d=a%b\r\n a=a//b+d\r\nprint(c)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n ans+=a//b\r\n a=a//b+a%b\r\nprint(ans)", "from sys import stdin, stdout \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve(): \r\n a, b = rn()\r\n i = 0\r\n while a:\r\n a -= 1 \r\n i += 1 \r\n if i % b == 0:\r\n a += 1 \r\n print(i)\r\n return None\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nsolve()\r\n", "a,b=map(int,input().split())\r\nhours=0\r\ncount=0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n count+=1\r\n if count==b:\r\n a+=1\r\n count=0\r\nprint(hours)", "z=[0 for i in range(10)]\r\nz[0]=1\r\ndef solve():\r\n q,w=map(int,input().split())\r\n ans=q\r\n e=q\r\n q=e//w\r\n ans+=q\r\n r=e%w\r\n while(q!=0):\r\n r+=q\r\n q=r//w\r\n ans+=q\r\n r%=w\r\n print(ans)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "n, b = map(int, input().split())\ni = n\nres = n\nwhile n >= b:\n n = n - b\n n += 1\n res += 1\n\nprint(res)\n", "a, b = map(int, input().split())\r\nhours = a\r\nwhile a//b>0:\r\n hours +=a//b\r\n a=a//b+a%b\r\nprint(hours)\r\n", "a, b = map(int,input().split())\r\nost=0\r\ni=0\r\nwhile a>0:\r\n i+=a\r\n ost+=a % b\r\n a=a//b\r\n \r\n a += ost // b\r\n ost %= b\r\n# if ost>=b:\r\n# i+=ost//b\r\n# ost %= b\r\n\r\nprint(i)", "A, B = map(int, input().split())\r\nC, ans = 0, 0\r\nwhile A > 0 or C >= B:\r\n\tans += A\r\n\tCC = (A + C) % B\r\n\tAA = (A + C) // B\r\n\tA, C = AA, CC\r\nprint(ans)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n# a=7\r\n# b=4\r\nc=a\r\nsum=0\r\nwhile(a//b!=0):\r\n burnt=a%b\r\n sum+=a//b\r\n if((a//b+burnt)<b):\r\n break\r\n else:\r\n a=a//b+burnt\r\nprint(sum+c)\r\n", "def solve(n, m):\r\n count = n\r\n while(n//m >= 1):\r\n count += n//m\r\n n = n//m + n%m\r\n return count\r\n\r\n# for _ in range(int(input())):\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))", "a,b=map(int,input().split())\r\ncount=0\r\nwhile a-b+1>0:\r\n a-=b\r\n a+=1\r\n count+=b\r\nprint(count+a)", "a, b = input().split(\" \")\r\na, b = int(a), int(b)\r\ntotal_hours = a\r\nwhile a >= b:\r\n new_candles = a // b\r\n dec = a % b\r\n total_hours = total_hours + new_candles\r\n a = new_candles + dec\r\n #print(a)\r\n #print(dec)\r\n #print(total_hours)\r\nprint(int(total_hours))\r\n\r\n", "a,b=map(int,input().split())\r\nch=0\r\nc=0\r\nwhile a>0:\r\n a-=1\r\n ch+=1\r\n c+=1\r\n if c==b:\r\n a+=1\r\n c=0\r\nprint(ch)\r\n", "from cmath import inf\r\nfrom re import T, X\r\nimport math\r\nfrom tkinter import N\r\n\r\n\r\ndef swap(a,b):\r\n a = a^b\r\n b = a^b\r\n a = a^b\r\n return a,b\r\n # call using a,b = swap(a,b)\r\ndef even(a):\r\n if a&1:\r\n return False\r\n return True\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (x*y) // gcd(x,y)\r\n return lcm\r\n\r\n# it will return index of \"key\" in \"sorted list\". \r\ndef BS_elemPosi(low, high, key, li): \r\n while low<high:\r\n mid = (low+high)//2\r\n if li[mid]<=key:\r\n low = mid+1\r\n else:\r\n high = mid\r\n return low\r\n \r\n###########################(CODE)##################################\r\n# a candle\r\n# 1 candle burns fo 1 hr\r\n# total hr=? iif she makes b candles\r\n# 4 2 ==> 1 1 (1) 1 (1) 1 (1)\r\n# 6 3 ==> 1 1 1 (1) 1 1 (1) 1 \r\n# \r\na,b = map(int, input().split())\r\nans = (a-1)//(b-1) + a\r\nprint(ans)\r\n\r\n#####################################################################", "def solve(a,b):\r\n ans = a\r\n rem = 0\r\n while a//b>0:\r\n ans += a//b\r\n a = a//b + a%b\r\n \r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n a,b = list(map(int, input().split()))\r\n ans = solve(a,b)\r\n print(ans)\r\n \r\n ", "a, b =map(int,input().split())\r\nh =0\r\nr=0\r\nwhile a>0:\r\n a-=1\r\n h+=1\r\n r+=1\r\n if r == b:\r\n a+=1\r\n r=0\r\nprint(h)\r\n", "candles, b = map(int, input().split())\r\nres = 0\r\nrip = 0\r\nwhile candles > 0:\r\n res += candles\r\n rip += candles\r\n candles = rip // b\r\n rip %= b\r\n\r\n\r\n\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nvar=a\r\nwhile(a>=b):\r\n d=a//b\r\n var=var+d\r\n c=a%b\r\n a=d+c\r\nprint(var)", "a = [int(i) for i in input().strip().split()]\r\npotuh = 0\r\ntime = 0\r\ngood = a[0]\r\n\r\nfor x in range(a[0]):\r\n time += good\r\n potuh += good\r\n good = 0\r\n if potuh >= a[1]:\r\n good += potuh // a[1]\r\n potuh %= a[1]\r\nprint(time)\r\n \r\n", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a # start by lighting up all a candles\r\nburned_out = a # keep track of burned-out candles\r\n\r\nwhile burned_out >= b:\r\n # use b burned-out candles to make a new one\r\n new_candle = burned_out // b\r\n burned_out = burned_out % b + new_candle\r\n total_hours += new_candle\r\n\r\nprint(total_hours)", "a, b = map(int, input().split())\r\ncandles = 0\r\ncounter = 0\r\n\r\nwhile a > 0:\r\n candles += 1\r\n counter += 1\r\n if counter == b:\r\n a += 1\r\n counter = 0\r\n a -= 1 \r\n\r\nprint(candles)", "a,b = map(int,input().split())\r\ncount = 0\r\ncount+=a\r\nwhile a>=b:\r\n count += a // b\r\n a = a // b + a % b\r\nprint(count)", "a,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n sum=sum+(a//b)\r\n a=(a//b)+(a%b)\r\n \r\nprint(sum)", "ab = input().split()\r\ndge = int(ab[0])\r\nyidva = int(ab[1])\r\nplus = dge//yidva\r\nmtvleli = 0\r\nwhile mtvleli < dge :\r\n mtvleli +=1\r\n if mtvleli % yidva == 0 :\r\n dge+=1\r\nprint(mtvleli)", "candles, new_candles = map(int, input().split())\r\nhours = 0\r\nwhile candles > 0:\r\n hours += 1\r\n candles -=1\r\n if hours % new_candles == 0:\r\n candles += 1\r\nprint(hours)", "a,b=map(int,input().split())\r\nans = a\r\nwhile a >= b :\r\n a-=b\r\n a+=1\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n", "c,b=map(int,input().split());\r\nprint((c*b-1)//(b-1))", "a, b = map(int, input().split())\r\nhours = 0\r\nwhile a - hours + hours // b:\r\n hours += 1\r\nprint(hours)", "a, b = map(int, input().split())\r\nx = a\r\nh = 0\r\ns = 0\r\nwhile x > 0:\r\n x -= 1\r\n h += 1\r\n s += 1\r\n \r\nwhile s // b != 0: \r\n h += 1\r\n s = s - b + 1\r\n\r\n \r\n \r\nprint(h)\r\n", "def main():\r\n a, b = list(map(int, input().split()))\r\n\r\n counter = 0\r\n current_a, current_b = a, 0\r\n while current_a > 0:\r\n counter += current_a\r\n current_b += current_a\r\n\r\n current_a = current_b // b\r\n current_b -= current_a * b\r\n print(counter)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\nans=a\nwhile a>=b:\n ans+=a//b\n a=a//b+a%b\nprint(ans)", "pro = input('')\r\nqnt = int(pro.split()[0])\r\nb = int(pro.split()[1])\r\nt = 0\r\nrep = 0\r\nwhile True:\r\n if qnt > 0:\r\n qnt = qnt - 1\r\n t = t + 1\r\n rep = rep + 1\r\n if rep == b:\r\n rep = 0\r\n qnt = qnt + 1\r\n else:\r\n print(t)\r\n break\r\n \r\n\r\n", "a,b=map(int,input().split())\r\nnc=0\r\noc=a\r\nt=a\r\nwhile(oc>=b):\r\n oc-=b-1\r\n t+=1\r\nprint(t)\r\n \r\n ", "a,b=map(int,input().split())\r\n\r\nt=0\r\n\r\nwhile a>0:\r\n a=a-1\r\n t=t+1\r\n \r\n if t%b==0:\r\n a=a+1\r\n #print(a,t)\r\nprint(t)", "\r\na,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n div=a//b\r\n sum+=div\r\n rem=a%b\r\n a=div+rem\r\nprint(sum)", "a, b = list(map(int, input().split()))\r\nhours_lit_up = 0\r\ncandles = a\r\nwhile candles >= b:\r\n new_candles = candles // b\r\n candles = candles % b + new_candles\r\n #we take (candles % b) as we need to also keep count of the number of spent candles used in making a new candle\r\n hours_lit_up += new_candles * b\r\nhours_lit_up += candles\r\n\r\nprint(hours_lit_up)", "a, b = [int(a) for a in input().split()]\r\n\r\nhours = a\r\nleftov = a\r\n\r\nwhile leftov - b >= 0:\r\n leftov -= b\r\n leftov += 1\r\n hours += 1\r\n\r\nprint(hours)", "def main():\n a, b = map(int, input().split())\n h = a\n\n while a >= b:\n d = a // b\n h += d\n m = a % b\n a = d + m\n\n print(h)\n\nif __name__ == \"__main__\":\n main()\n", "a, b = map(int, input().split())\r\ntotal, left = 0, 0\r\nwhile a >= b:\r\n total += a//b*b\r\n a -= a//b*b-a//b\r\nprint(total+a)", "a, b = map(int, input().split())\r\ncnt = a\r\n\r\nwhile True:\r\n cnt += a//b\r\n a = a//b+a%b\r\n if a%b==a:\r\n break\r\nprint(cnt)", "numbers = [int(i)for i in input().split()]\r\na = numbers[0]\r\nb = numbers[1]\r\nremain = 0\r\ncandles = a\r\nworn = 0\r\ntotal = 0\r\nwhile True:\r\n hours = candles\r\n total+=hours\r\n if hours==0:\r\n break\r\n worn = candles+remain\r\n candles = 0\r\n hours = 0\r\n candles = worn//b\r\n remain = worn%b\r\n \r\nprint(total)\r\n", "def main() -> int:\r\n\r\n a, b = tuple(int(x) for x in input().split())\r\n result = a\r\n while a >= b:\r\n tmp = a // b\r\n result += tmp\r\n a = tmp + a % b\r\n\r\n return result\r\n\r\nif __name__ == '__main__':\r\n print(main())", "a,b=[int(x) for x in input().split()]\r\nres=a\r\nwhile a//b>0:\r\n res+=a//b\r\n a=a//b+a%b\r\nprint(res)", "a,b=map(int,input().split())\r\n\r\nextra=a//b \r\nx=(a+extra)//b\r\nwhile x<a:\r\n x=(a+x)//b\r\n if x==(a+x)//b:\r\n break\r\nprint(a+x)\r\n", "a,b=[int(x) for x in input().split()]\r\nsum1=0\r\nsum2=0\r\nwhile(a>0):\r\n a=a-1\r\n sum1+=1\r\n sum2=sum2+1\r\n if sum1==b:\r\n a=a+1\r\n sum1=0\r\n\r\nprint(sum2)", "a, b = map(int, input().split())\r\ns = 0\r\nnot_used = a\r\nwhile not_used//b:\r\n a = not_used\r\n not_used = 0\r\n while a:\r\n s+=a-a%b\r\n not_used+=a%b\r\n a//=b\r\nprint(s+not_used)", "a,b=map(int,input().split())\r\nk=0\r\nh=0\r\nwhile a>0:\r\n h+=a\r\n k+=a\r\n a=0\r\n if k >= b:\r\n a=k//b\r\n k-=k//b*b\r\nprint(h)", "a=list(map(int,input().split()))\r\nb=a[0]\r\nc=a[1]\r\nd=0\r\ne=0\r\nwhile b!=0:\r\n d+=1\r\n e+=1\r\n b-=1\r\n if e==c:\r\n b+=1\r\n e=0\r\nprint(d)", "a, b = (int(i) for i in input().split())\nres = w = 0\nwhile a:\n res += a\n w += a\n a, w = divmod(w, b)\nprint(res)\n", "san1, san2 = map(int, input().split())\r\n\r\n# Vasily can light up the room for a maximum of (san1 + (san1-1)//(san2-1)) hours\r\n# Explanation: The first term (san1) represents the initial burning of the first candle.\r\n# The second term ((san1-1)//(san2-1)) represents the number of new candles he can make from the burned-out candles.\r\n\r\nprint(san1 + (san1-1)//(san2-1))\r\n", "a, b = [int(x) for x in input().split()]\r\ncandles = a\r\nbuff = 0\r\nans = 0\r\nwhile (candles):\r\n ans += 1\r\n candles -= 1\r\n buff += 1\r\n if buff == b:\r\n candles += 1\r\n buff = 0\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\na2, count = 0, 0\r\nwhile a > 0:\r\n count += 1\r\n if count%b != 0:\r\n a -= 1\r\nprint(count)\r\n", "a, b = [int(x) for x in input().split()]\r\nrem = a % b\r\ntemp = a // b\r\nans = temp + rem\r\ncount = a\r\n\r\nwhile temp >= 1:\r\n count += temp\r\n a = ans\r\n rem = a % b\r\n temp = a // b\r\n ans = temp + rem\r\n\r\nprint(count)", "a, b = map(int, input().split())\r\nost = 0\r\nt = 0\r\nwhile a > 0:\r\n t += 1\r\n a -= 1\r\n ost += 1\r\n if ost == b:\r\n a += 1\r\n ost -= b\r\nprint(t)\r\n", "a,b= map(int, input().split());c = 0\r\nwhile a >= b:\r\n c += b;a -= b;a += 1\r\nprint(c+a)\r\n", "a, b = map(int, input().split())\r\n\r\ntotal = a\r\nleft = a\r\n\r\nwhile left >= b:\r\n candle = left // b\r\n left = left % b + candle\r\n total += candle\r\n\r\nprint(total)", "a, b = map(int, input().split())\r\n\r\nk = 0\r\nhour = 0\r\nwhile a > 0:\r\n a -= 1\r\n k += 1\r\n if k == b:\r\n a += 1\r\n k -= b\r\n hour += 1\r\n\r\nprint(hour)\r\n", "a, b = [int(x) for x in input().split()]\r\nt = 0\r\nwhile a > 0:\r\n a -= 1\r\n t += 1\r\n if t%b==0:\r\n a += 1\r\nprint(t)\r\n", "a, b = map(int, input().split())\r\nhours = 0\r\nwhile a > 0:\r\n a -= 1\r\n hours += 1\r\n if hours % b == 0:\r\n a += 1\r\nprint(hours)", "a,b=([int(x) for x in input().split()])\r\nc=a/b\r\ne=1/b\r\nd=0\r\nd=d+a\r\na=c\r\nwhile a>=1:\r\n a=a-1+e\r\n d=d+1\r\nprint(d)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nrem = 0\r\nwhile a > 0:\r\n ans += a\r\n a += rem\r\n rem = a%b\r\n a = a // b\r\nprint(ans)", "v,v1=map(int,input().split());c=v;c1=0\r\nwhile v>=v1:\r\n c1=v//v1;c+=c1;v=v%v1 + c1\r\nprint(c) ", "a, b = map(int, input().split(\" \"))\r\n\r\n\r\ndef candle_hour(a, b):\r\n candles = 0\r\n used = a\r\n for i in range(a + b):\r\n #print(used)\r\n if used >= b:\r\n candles += 1\r\n used += 1\r\n used -= b\r\n \r\n return a + candles\r\nprint(candle_hour(a, b))", "a,b=map(int,input().split())\r\nx=a\r\nwhile a>=b:\r\n c=a//b\r\n x+=c\r\n d=a%b\r\n a=c+d\r\nprint(x)", "# 379A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\na,b=sp_inp()\r\ncandles=0\r\nwhile(a!=0):\r\n candles+=1\r\n if(candles%b==0):\r\n candles+=1\r\n a-=1\r\nprint(candles)", "a, b = map(int, input().split())\r\nc = 0\r\n\r\nwhile a >= b:\r\n c += b\r\n a -= b\r\n a+= 1\r\nprint(c+a)", "class PDInput:\r\n def __init__(self) -> None:\r\n self._raw_input = input()\r\n self._raw_input_list = self._raw_input.split(' ')\r\n \r\n def get_int(self) -> int:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return int(self._raw_input_list.pop(0))\r\n \r\n def get_str(self) -> str:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return self._raw_input_list.pop(0)\r\n \r\n def get_float(self) -> float:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return float(self._raw_input_list.pop(0))\r\n \r\n def get_bool(self) -> bool:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return bool(self._raw_input_list.pop(0))\r\n \r\n def get_list(self, is_int=False, is_float=False, is_bool=False, is_str=False) -> list:\r\n if len(self._raw_input_list) == 0: self.__init__()\r\n return_list = list()\r\n for each_item in self._raw_input_list:\r\n if is_int: return_list.append(int(each_item))\r\n elif is_float: return_list.append(float(each_item))\r\n elif is_bool: return_list.append(bool(each_item))\r\n elif is_str: return_list.append(str(each_item))\r\n self._raw_input_list = list()\r\n return return_list\r\n\r\n\r\nif __name__ == '__main__':\r\n pd_input = PDInput()\r\n\r\n candles, restore_candles = pd_input.get_list(is_int=True)\r\n count = went_out_candles = 0\r\n\r\n while(candles != 0):\r\n candles -= 1\r\n went_out_candles += 1\r\n if went_out_candles == restore_candles:\r\n went_out_candles = 0\r\n candles += 1\r\n count += 1\r\n\r\n print(count)\r\n", "a,b=list(map(int,input().split()))\r\nnw=0\r\nhr=0\r\nwhile int(a)>0:\r\n hr+=1\r\n a-=1\r\n nw+=1\r\n if nw==b:\r\n a+=1\r\n nw=0\r\nprint(hr)", "a,b=map(int,input().split())\r\ns=a\r\ni=a//b\r\nl=a%b\r\nwhile i!=0:\r\n s+=i\r\n l+=(i%b)\r\n i//=b\r\nwhile l>=b:\r\n s+=(l//b)\r\n l=(l%b)+(l//b)\r\nprint(s)", "a, b = map(int, input().split())\r\nsum = 0\r\nx = a\r\nhourscount = 0\r\nwentOut = 0\r\nwhile x != 0:\r\n x -= 1\r\n wentOut += 1\r\n hourscount += 1\r\n if(wentOut == b):\r\n x += 1\r\n wentOut = 0\r\nprint(hourscount)\r\n", "# https://codeforces.com/problemset/problem/379/A\r\n\r\ndef main():\r\n a, b = map(int, input().split(' '))\r\n remain = 0\r\n result = 0\r\n while a > 0:\r\n result += a\r\n remain += a\r\n a = remain // b\r\n remain = remain % b\r\n # print(a)\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = input().split()\r\na, b = int(a), int(b)\r\nc = x = 0\r\nwhile a:\r\n c += a\r\n temp = (a+x) // b\r\n x = (a+x) % b\r\n a = temp \r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nk=0\r\ns=0\r\nwhile a>0:\r\n a-=1\r\n s+=1\r\n if s==b:\r\n a+=1\r\n s=0\r\n k+=1\r\nprint(k)", "a,b = map(int,input().split())\nc = 0\nwhile a>0:\n a-=1\n c+=1\n if c%b==0:\n a+=1\nprint(c)\n\n\n\n\n", "a,b = map(int,input().split())\r\nk = 0\r\nz = 0\r\nfor i in range(a):\r\n k += 1\r\n z += 1\r\n if z==b:\r\n k += 1\r\n z=1\r\nprint(k)", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>=b:\r\n s+=(a//b)\r\n a=a//b+a%b\r\nprint(s)", "n, m = map(int, input().split())\r\nk = 1\r\nwhile n:\r\n\tif k % m == 0:n+=1\r\n\tn -= 1\r\n\tk+=1\r\nprint (k-1)", "a,b=map(int, input().split())\r\ncount=a\r\nwhile a>a%b:\r\n count+=a//b\r\n a=(a//b)+(a%b)\r\nprint(count)\r\n \r\n", "a,b=map(int,input().split())\r\ns=[a]\r\ni=1\r\nt=a\r\nwhile (a>=b):\r\n t+=int(a/b)\r\n da=s[i-1]-b*(int(a/b))\r\n a=da+int(a/b)\r\n s.append(a)\r\n i+=1\r\n \r\nprint(t)\r\n", "a, b = map(int, input().split())\r\nh = a\r\no = 0\r\nwhile a>=b:\r\n h+=a//b\r\n o += a % b\r\n a = a // b\r\n if a<b:\r\n a+=o\r\n o=0\r\n\r\nprint(h)", "# LUOGU_RID: 101541511\na, b = map(int, input().split())\r\nans = c = 0\r\nwhile a:\r\n ans += 1\r\n a -= 1\r\n c += 1\r\n if c == b:\r\n c = 0\r\n a += 1\r\nprint(ans)", "j, k = map(int, input().split())\r\nx = j\r\nwhile j - k >= 0:\r\n j -= k\r\n x += 1\r\n j += 1\r\nprint(x)", "from collections import Counter\r\ndef solve():\r\n n,b=map(int,input().split());c=n\r\n while n>=b:rem=n%b;n//=b;c+=n;n+=rem\r\n print(c)\r\nsolve()", "result = 0\r\ndef solver(a, b):\r\n if a<b:\r\n return\r\n global result\r\n result += a//b\r\n solver(a//b+a%b, b)\r\na, b = map(int,input().split())\r\nresult = a\r\nsolver(a, b)\r\nprint(result)", "a, b = map(int, input().split())\r\nhours = a\r\nwhile a//b > 0:\r\n hours += a//b\r\n a = a//b + (a % b)\r\nprint(hours)", "a, b = map(int,input().split())\nk = 0\nx = 0\nwhile a>0:\n a-=1\n x+=1\n k+=1\n if k==b:\n k=0\n a+=1\nprint(x)\n \n\n\n", "def solve(svechi, zapas, count, b):\r\n count += svechi\r\n if svechi + zapas >= b:\r\n return solve((svechi + zapas) // b, (zapas + svechi) - ((svechi + zapas) // b) * b, count, b)\r\n else:\r\n return count\r\n\r\n \r\n\r\ncount, zapas = 0, 0\r\nsvechi, b = map(int, input().split())\r\nprint(int(solve(svechi, zapas, count, b)))", "def main():\r\n n = input().split()\r\n amount_of_candles = int(n[0])\r\n min_for_new_candle = int(n[1])\r\n extinguished_candles = 0\r\n hours = 0\r\n while amount_of_candles > 0 or extinguished_candles >= min_for_new_candle:\r\n if extinguished_candles >= min_for_new_candle:\r\n extinguished_candles -= min_for_new_candle\r\n amount_of_candles += 1\r\n amount_of_candles -= 1\r\n extinguished_candles += 1\r\n hours += 1\r\n print(hours)\r\nmain()", "n,m=map(int,input().split())\r\nr=(n-1)//(m-1)\r\nprint(n+r)", "a, b = list(int(num) for num in input().split())\r\nc = 0\r\ntime = 0\r\nwhile not(a == 0 and c < b):\r\n time += a\r\n tmp = a\r\n a = (a + c) // b\r\n c = (tmp + c) % b\r\n\r\nprint(time)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\ncandles_out = a\r\n\r\nwhile candles_out >= b:\r\n candles_out += 1 - b\r\n total_hours += 1\r\n\r\nprint(total_hours)", "a, b = map(int, input().split())\ncel = 0\npotyx = a\nans = a\n\nwhile potyx >= b:\n cel += potyx // b\n potyx %= b\n ans += cel\n potyx += cel \n cel = 0\nprint(ans)\n ", "candles,b=input().split()\n(candles,b)=(int(candles),int(b))\nnoofburntcandles=candles*b\n\ndef hour_calc(prev_hrs,noofburntcandles,b):\n new_hours=prev_hrs+int(noofburntcandles/b)\n noofburntcandles=int(noofburntcandles/b)+noofburntcandles%b\n if noofburntcandles>=b:\n hour_calc(new_hours,noofburntcandles,b)\n else:\n print(new_hours)\n \nprev_hrs=0\nhour_calc(prev_hrs,noofburntcandles,b)\n", "A=list(map(int, input().split()))\r\na=A[0]\r\nb=A[1]\r\nk=a\r\np=a\r\na=0\r\nwhile p//b>0:\r\n a+=p//b\r\n p=p%b\r\n k+=a\r\n p+=a\r\n a=0\r\nprint(k)\r\n\r\n", "import math\r\n#f = open(\"test.txt\")\r\n\r\na, b = map(int, input().split())\r\nc = a\r\nwhile(a >= b):\r\n t = a % b\r\n a = a // b\r\n c = c + a\r\n a = a + t\r\nprint(c)", "inp = input().split()\r\n\r\na = int(inp[0])\r\nb = int(inp[1])\r\ncounter = 0\r\nsol = 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n counter += 1\r\n sol += 1\r\n if counter == b:\r\n a += 1\r\n counter = 0\r\nprint(sol)\r\n", "a,b = map(int, input().split())\r\ntime = 0\r\nout_candle = 0\r\nwhile 1:\r\n time += a\r\n out_candle += a\r\n a = out_candle // b\r\n out_candle %= b\r\n if a + out_candle < b:\r\n time += a\r\n break\r\nprint(time)", "q, w = map(int, input().split())\r\ne = 0\r\nr = 0\r\nwhile(q > 0):\r\n e += q\r\n f = r\r\n r = (q + r) % w\r\n q = (q + f) // w\r\n #print(e, q, r)\r\nprint(e)", "a,b = map(int,input().split())\r\nc1,c2 = a,0\r\nans= 0\r\nwhile c1 > 0:\r\n ans += c1\r\n c2 += c1\r\n c1,c2 = divmod(c2,b)\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nc=0\r\nd=0\r\nwhile n>0:\r\n c=c+1\r\n d=d+1\r\n n=n-1\r\n if d==m:\r\n n=n+1\r\n d=0\r\nprint(c)", "a,b=map(int,input().split())\ns1=0\ns=0\nwhile a>0:\n if s==b:\n a+=1\n s=0\n s+=1\n s1+=1\n a-=1\nif s==b:\n s1+=1\nprint(s1)\n", "a, b = map(int, input().split())\r\ncount = 0\r\nm = 0\r\nwhile a != 0:\r\n count += 1\r\n m += 1\r\n a = a-1\r\n if m == b:\r\n a += 1\r\n m = 0\r\n \r\nprint(count)", "a, b = map(int, input().split())\r\nres = a\r\nwhile a >= b:\r\n c = a // b\r\n res += c\r\n a = a % b\r\n a += c\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nsumma = 0\r\nqoldiq = 0\r\nwhile a > 0:\r\n qoldiq += a\r\n summa += a\r\n a = qoldiq // b\r\n qoldiq %= b\r\nprint(summa)\r\n", "a, b = map(int, input().split())\r\nhours = a\r\nleftover = a\r\n\r\nwhile leftover >= b - 1:\r\n new_candles = leftover // (b - 1)\r\n hours += new_candles\r\n leftover = leftover - new_candles * (b - 1)\r\n\r\nif leftover > 0:\r\n hours += 1\r\n\r\nprint(hours-1)\r\n", "import sys\r\n\r\na, b = [int(i) for i in input().split()]\r\n\r\nhours = 0\r\nhave = a\r\nused = 0\r\n\r\nwhile have != 0 or used >= b:\r\n if used >= b:\r\n hours += 1\r\n used -= b - 1\r\n\r\n else:\r\n hours += 1\r\n have -= 1\r\n used += 1\r\n #rint(have)\r\n #print(used)\r\n #print('')\r\nprint(hours)", "array = list(map(int,input().strip().split()))\r\n\r\ndef happy(a,b,t=0):\r\n if a >= b:\r\n t += b + happy(a - b + 1,b,t)\r\n return (t)\r\n else:\r\n t += a\r\n return (t)\r\n\r\nprint(happy(array[0],array[1]))", "a,b=list(map(int,input().split()))\r\ndef cd(rem=a,t=a):\r\n if rem<b:\r\n return t\r\n else:\r\n return cd((rem%b)+rem//b,t+rem//b)\r\nprint(cd())", "a,b=map(int,input().split())\r\nw=a-10+10\r\nwhile a//b!=0:\r\n w=w+(a//b)\r\n a=(a//b)+(a%b)\r\nprint(w)", "a, b = [int(x) for x in input().split()]\r\nhours = a\r\nwhile a >= b:\r\n hours += a//b\r\n a = a//b + a%b\r\nprint(hours)", "a,b=[int(_) for _ in input().split()]\r\ngodz=a\r\nile=a-a%b\r\nwhile godz>=b:\r\n godz=godz//b+godz%b\r\n ile+=godz-godz%b\r\nprint(ile+godz%b)", "a, b = map(int, input().split())\r\ntime = a\r\nwhile a >= b:\r\n a = a - b + 1\r\n time += 1\r\nprint(time)", "n,b=map(int,input().split())\r\nt=n\r\nwhile n>=b:\r\n n=(n-b)+1\r\n t+=1\r\nprint(t)", "a,b = map(int,input().split())\r\nres = a\r\n\r\nwhile a//b != 0:\r\n res += a//b\r\n a = a//b + a%b\r\nprint(res)", "a, b = map(int, input().split())\r\n\r\ncurr = a\r\nhours = 0\r\nwhile(a):\r\n a-=1\r\n hours +=1\r\n if hours %b == 0:\r\n a += 1\r\n\r\nprint(hours)", "n, a = map(int, input().split())\r\nif a> n :\r\n print(n)\r\nelse:\r\n print(n + (n - 1) // (a - 1))\r\n", "n, m = map(int, input().split())\r\ni = 0\r\nc = 0\r\nwhile n != 0:\r\n n -= 1\r\n i += 1\r\n if n == 0:\r\n n = i//m - c\r\n c = i//m\r\nprint(i)", "num = input().split(\" \")\r\na = int(num[0])\r\nb = int(num[1])\r\n\r\ntot = a\r\n\r\nwhile a >= b:\r\n tot += a // b\r\n a = a // b + a % b\r\n\r\nprint(tot)", "def newyear(a,b):\n c,d=0,0\n while(a+d>=b):\n c+=1\n d+=1\n a-=1\n if d==b:\n d=0\n a+=1\n return c+a\n\na,b=map(int,input().split())\nprint(newyear(a,b))", "a, b = map(int, input().split())\r\nk = a\r\nwhile a >= b:\r\n s = a // b\r\n k += s\r\n m = a % b\r\n a = s + m\r\nprint(k)", "given = input().split()\r\nnewCandles = int(given[0])\r\ntoMakeaNew = int(given[1])\r\nremainder = 0\r\ntotaltime = 0\r\nwhile newCandles != 0:\r\n totaltime += newCandles\r\n remainder += newCandles\r\n newCandles = (remainder)//toMakeaNew\r\n remainder = remainder%toMakeaNew\r\nprint(totaltime)", "a,b = map(int,input().split())\r\npot = 0\r\ntime=0\r\nwhile (pot>=b)or(a!=0):\r\n if a!=0:\r\n pot+=a\r\n time+=a\r\n a=0\r\n else:\r\n a+=pot//b\r\n pot = pot%b\r\nprint(time)\r\n \r\n", "from collections import defaultdict\r\nints = lambda: list(map(int, input().split()))\r\nmp = defaultdict(int)\r\na, b = ints()\r\n\r\ns = 0\r\nf = a\r\ng = 0\r\nwhile a > 0:\r\n a-=1\r\n s+=1\r\n g += 1\r\n if s == b:\r\n s = 0\r\n a+=1\r\nprint(g)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 15:27:23 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\na, b = map(int, input().split())\r\nused = 0\r\nt = 0\r\nwhile True:\r\n a -= 1\r\n used += 1\r\n t += 1\r\n if used == b:\r\n a += 1\r\n used = 0\r\n if a == 0:\r\n print(t)\r\n break", "a,b=map(int,input().split())\r\nc=0\r\nwhile a>0:\r\n a-=1\r\n c+=1\r\n if c%b==0:\r\n a+=1\r\nprint(c)", "a, b = map(int,input().split())\r\nhours = 0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n if hours % b == 0:\r\n a+=1\r\nprint(hours)", "a,b=map(int,input().split())\r\ncount=a\r\nwhile a>=b:\r\n count=count+a//b\r\n a=(a//b)+(a%b)\r\nprint(count)", "from sys import stdin, stdout\r\na, b = map(int, stdin.readline().strip().split())\r\ntotal = 0\r\ncombined = 0 \r\nleft_to_combine = 0 \r\nwhile(True):\r\n total+=a \r\n combined = a//b*b \r\n left_to_combine+=(a-combined)\r\n a = combined//b\r\n if(left_to_combine>=b):\r\n combined1 = left_to_combine//b*b \r\n a+=combined1//b \r\n left_to_combine-=combined1 \r\n if(a==0):\r\n break\r\nstdout.write(f\"{total}\\n\")", "candle, recycling = map(int, input().split())\r\nhour = 0\r\nwhile candle > 0:\r\n candle -= 1\r\n hour += 1\r\n if hour % recycling == 0:\r\n candle += 1\r\nprint(hour)", "import sys\na, b = map(int, sys.stdin.readline().rstrip().split())\nt = 0\nc = 0 \nwhile a > 0:\n t += 1\n a -= 1\n c += 1\n if c == b:\n a += 1\n c = 0\nprint(t)\n", "a,b = map(int,input().split())\r\nx = a\r\nwhile a >= b:\r\n y = a % b\r\n a = a // b\r\n x += a\r\n a += y\r\n\r\nprint(x)\r\n\r\n", "a, b = map(int,input().split())\r\n\r\nnumber_end = 0\r\n\r\nwhile a > 0:\r\n \r\n a -= 1 \r\n number_end += 1\r\n if number_end != 0 and number_end%b == 0:\r\n a += 1 \r\n \r\nprint(number_end)", "\r\nv1,v2=map(int,input().split());v=v1;c=0\r\nwhile v1>=v2:\r\n c=v1//v2;v+=c;v1=v1%v2+c\r\nprint(v)\r\n\r\n", "y,m=map(int,input().split())\r\nd=0\r\nf=0\r\nwhile y>0:\r\n y-=1\r\n d+=1\r\n if d==m:\r\n d=0\r\n y+=1\r\n f+=1\r\nprint(f) ", "a,b=map(int,input().split());print((a*b-1)//(b-1))\r\n", "from ctypes.wintypes import tagMSG\r\n\r\n\r\n[a,b]=[int(i) for i in input().split()][:2]\r\n\r\ndef f(a,b,t):\r\n x=(a//b)+(a%b)\r\n if x<b:\r\n return t+(a//b)\r\n else:\r\n t+=a//b\r\n return(f(x,b,t))\r\n\r\n\r\nprint(f(a,b,a))\r\n", "def sol():\r\n a,b=map(int,input().split(\" \"))\r\n used=a\r\n ans=a\r\n while used >=b:\r\n\r\n x=int(used/b)\r\n\r\n ans+=x\r\n used=used-(b*x)+x\r\n\r\n print(ans) \r\n\r\n\r\n\r\n\r\n\r\nsol()\r\n", "s=input().split()\r\nfull=int(s[0])\r\nmulti=int(s[1])\r\ncurr=0\r\ntime=0\r\nfor i in range(2000):\r\n time += full\r\n curr += full\r\n full=0\r\n if curr>=multi:\r\n full+=curr//multi\r\n curr=curr%multi\r\n\r\n\r\nprint(time)\r\n\r\n", "a,b = map(int,input().split())\nsumi = a\nwhile(a>=b):\n div = (a//b)\n sumi+= div\n mod = (a%b)\n a= (div+mod)\nprint(sumi)\n\t \t\t \t\t \t\t\t\t\t \t\t \t \t\t \t \t\t", "def solve():\r\n a, b = map(int, input().split())\r\n ans = 0\r\n k = 0\r\n while a>0:\r\n ans = ans+1\r\n k = k+1\r\n a = a-1\r\n if k==b:\r\n k = 0\r\n a = a+1\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "A,B=map(int,input().split())\r\nans=A\r\nwhile A>=B:\r\n ans+=A//B\r\n A=A//B+A%B\r\nprint(ans)", "a,b=map(int,input().split())\r\nsum=a\r\nwhile a//b>=1:\r\n sum+=a//b\r\n a=(a//b)+a%b\r\nprint(sum)", "a,b=map(int,input().split())\r\nc=0\r\nx=0\r\nwhile a>0:\r\n c+=a\r\n x+=a\r\n a=0\r\n a=x//b\r\n x%=b\r\nprint(c)", "a,b=map(int,input().split())\r\nif b>a:\r\n print(a)\r\nelse:\r\n h=a\r\n y=a\r\n while(y>=b):\r\n h+=y//b\r\n y=y%b+y//b\r\n print(h)", "a, b = [int(a) for a in input().split()]\r\n\r\nhours = a\r\nleft = 0\r\n\r\nwhile a >= b:\r\n hours += a // b\r\n a = a % b + a // b\r\n\r\nprint(hours)\r\n", "for Ram in range(1):\r\n a,b=map(int,input().split())\r\n ans=0\r\n while a>=b:\r\n ans+=(a//b)*b\r\n a=a%b + a//b\r\n ans+=a\r\n print(ans)", "a, b = map(int, input().split())\r\n\r\ncount = 0\r\nwhile a != 0:\r\n a -= 1\r\n count += 1\r\n if count % b == 0:\r\n a += 1\r\n if a == 0:\r\n break\r\n\r\nprint(count)", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vkiefner\r\n#\r\n# Created: 01.06.2023\r\n# Copyright: (c) vkiefner 2023\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\na, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\nburnt_out_candles = a\r\n\r\nwhile burnt_out_candles >= b:\r\n new_candles = burnt_out_candles // b\r\n total_hours += new_candles\r\n burnt_out_candles = burnt_out_candles % b + new_candles\r\n\r\nprint(total_hours)\r\n\r\n\r\n'''\r\nimport math\r\n\r\na, b = (input().split(\" \"))\r\na = int(a)\r\nb = int(b)\r\nprint(math.floor(a+a/b+a/b/b))\r\n'''\r\n", "#\r\n ##### ##### ###### # #\r\n # # # # # ## ##\r\n # # # # ##### # ## #\r\n ##### ##### # # #\r\n # # # # # #\r\n # # # ###### # #\r\n #\r\n\r\nl = [int(i) for i in input().split()]\r\nn = l[0]\r\nk = l[1]\r\nans=n\r\nwhile n!=0 :\r\n ans+=n//k\r\n if n%k!=0 :\r\n a=n%k\r\n n = n//k\r\n if n!=0 :\r\n n+=a\r\n else :\r\n a=0\r\n n=n//k\r\nprint(ans)", "from sys import stdin\r\n\r\ninp = stdin.readline\r\n\r\na, b = map(int, inp().split())\r\ncount = a\r\npassed = 0\r\n\r\nwhile True:\r\n if count // b == passed // b:\r\n break\r\n\r\n count, passed = count + (count - passed) // b, passed + ((count - passed) // b) * b\r\n\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\nans=0\r\ncandles=a\r\nwhile candles>0:\r\n candles-=1\r\n ans+=1\r\n if ans%b==0:\r\n candles+=1\r\nprint(ans)", "a, b = map(int, input().split(\" \"))\ndef solve(a, b):\n if a < b:\n return 0\n return a // b + solve((a // b) + (a % b), b)\nprint(a + solve(a, b))", "I = input\ni = I().split()\na = (int(i[0])-1)//(int(i[-1])-1)\nprint(a+int(i[0]))\n", "import math\r\nfrom collections import *\r\ndef solve():\r\n\r\n a,b = map(int,input().split())\r\n c = 0\r\n while a>=b:\r\n a-=b\r\n a+=1\r\n c+=b\r\n print(c+a)\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "a, b = map(int, input().split())\r\ncurb = 0 \r\ncurb += a\r\nwhile a >= b:\r\n curb += a // b\r\n a = a // b + a % b\r\n \r\nprint(curb)\r\n", "a, b = list(map(int, input().split()))\r\nans = 0\r\nwhile a >= b:\r\n i = a//b \r\n j = a%b\r\n i = i*b\r\n ans += i\r\n a = a//b + j\r\nprint(ans + a)", "import sys\r\nimport math\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n\r\ndef yo(burnout, total_count):\r\n new= int(burnout/b)\r\n if new==0:\r\n print(total_count)\r\n return\r\n burnout= burnout%b\r\n total_count+=new\r\n burnout+=new\r\n yo( burnout, total_count)\r\n \r\na= numbers[0]\r\nb= numbers[1]\r\nyo(a,a)", "a,b = map(int,input().split())\r\nhour = a + a//b\r\nwhile a >= b:\r\n a = a//b + a % b\r\n hour += a // b\r\nprint(hour)", "a,b=map(int , input().split())\r\nd=a\r\nc=0\r\nwhile d//b>=1:\r\n c+=(d//b)\r\n d=(d//b)+(d%b)\r\nprint(a+c)\r\n", "a,b=map(int,input().split())\r\nx=a\r\nans=0\r\nwhile(x>=b):\r\n ans+=x//b\r\n x=x%b+x//b\r\nprint(ans+a)\r\n ", "a, b = map(int, input().split())\r\ncount = 0\r\ncount_2 = 0\r\nwhile a !=0:\r\n a = a-1\r\n count = count+1\r\n count_2 = count_2+1\r\n if count_2 == b:\r\n a = a+1\r\n count_2 = 0\r\n\r\nprint(count)", "a,b=map(int,input().split())\r\nt=a\r\ns=0\r\nwhile a//b>0:\r\n s+=a//b\r\n a=a//b+a%b\r\nprint(s+t)", "a,b=map(int,input().split())\r\nprint(((a-1)//(b-1))+a)", "n, k = map(int,input().split())\r\ntt = n\r\nwhile n > 1:\r\n if n >= k:\r\n n -= k-1\r\n tt += 1\r\n else:\r\n break\r\nprint(tt)\r\n", "a, b = map(int, input().split())\r\n\r\ninitial_burning_time = a\r\n\r\nburning_time_of_new_candles = 0\r\n\r\nwhile a >= b:\r\n new_candles = a // b\r\n \r\n remaining_candles = a % b\r\n \r\n burning_time_of_new_candles += new_candles\r\n \r\n # Update the total number of candles\r\n a = new_candles + remaining_candles\r\n \r\ntotal_burning_time = initial_burning_time + burning_time_of_new_candles\r\n\r\nprint(total_burning_time)\r\n", "import math\r\na,b=list(map(int,input().split(\" \")))\r\nres=a\r\nli=res\r\nwhile(li>=1):\r\n li/=b\r\n res+=li\r\nprint(int(res))", "a,b=map(int,input().split())\r\ns=a\r\nk=(a//b)\r\nwhile(k!=0):\r\n r=a%b\r\n s=s+k\r\n a=k+r\r\n k=(a//b)\r\nprint(s)\r\n ", "a, b = [int(thing) for thing in input().split()]\r\ncount = 0\r\nwornout = 0\r\nwhile a != 0:\r\n count += a\r\n wornout += a\r\n a = wornout//b\r\n wornout %= b\r\n\r\nprint(count)", "a, b = map(int, input().split())\r\nh, r = 0, 0\r\nwhile a > 0 or r >= b:\r\n h += a\r\n r += a\r\n a, r = r // b, r % b\r\nprint(h)\r\n", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>0:\r\n\ta-=(b-1)\r\n\ts+=1\r\nprint(s-1)", "a,b=map(int,input().split())\r\nx=a\r\ny=0\r\nz=0\r\nwhile(a>=b):\r\n y=a//b\r\n x+=y\r\n z=a%b\r\n a=y+z\r\nprint(x)\r\n", "import sys\r\na, b = map(int, sys.stdin.readline().strip().split())\r\nc = a\r\nh = 0\r\nbo = 0\r\nwhile a > 0 :\r\n h += 1\r\n a -= 1\r\n bo += 1\r\n if bo == b :\r\n bo = 0\r\n a += 1\r\nprint(h)", "n, md = map(int, input().split())\r\ncount_n = 0\r\ndays = 0\r\nwhile n != 0:\r\n count_n += 1\r\n days += 1\r\n n -= 1\r\n if count_n == md:\r\n count_n -= md\r\n n += 1\r\nprint(days)", "a,b = map(int,input().split())\r\nprint((a*b-1)//(b-1))", "import math\n\narr = [int(_) for _ in input().split()]\nans = 0\nwhile arr[0] > 1:\n ans += arr[0]\n arr[0] /= arr[1]\n\nprint(math.floor(ans + arr[0]))\n", "\r\n\r\n\r\ndef new_year_candles():\r\n\r\n\r\n\r\n num_candles,burnt_out_candles_to_make_new_one = map(int,input().split())\r\n\r\n\r\n num_burnt_out_candles = 0\r\n\r\n \r\n days = 0\r\n while num_candles:\r\n days += num_candles\r\n num_burnt_out_candles += num_candles\r\n\r\n num_candles = num_burnt_out_candles // burnt_out_candles_to_make_new_one\r\n num_burnt_out_candles = num_burnt_out_candles % burnt_out_candles_to_make_new_one\r\n\r\n\r\n\r\n print(days)\r\n\r\n\r\nnew_year_candles()\r\n\r\n\r\n\r\n\r\n", "from traceback import print_list\r\n\r\n\r\na,b = map(int,input().split())\r\nprint((a*b-1)//(b-1))", "a,b=map(int,input().split())\r\nh=a\r\nwhile(a>=b):\r\n x=a//b\r\n y=a-b*(a//b)\r\n a=x+y\r\n h+=x\r\nprint(h)", "a,b=map(int,input().split())\r\nsum=0\r\nost=0\r\nwhile a>0:\r\n sum+=a\r\n ost+=a\r\n a=0\r\n a+=ost//b\r\n ost=ost%b\r\nprint(sum)", "def main():\n a, b = (int(_) for _ in input().split())\n\n count = a\n\n while a / b >= 1:\n count += int(a / b)\n a = int(a / b) + a % b\n\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "a, b = map(int, input().split())\r\n\r\nr = 0\r\nwhile a:\r\n r += 1\r\n if r % b != 0:\r\n a -= 1\r\n\r\nprint(r)\r\n", "a,b = map(int,input().split())\r\nc = 0\r\nz = 0\r\nwhile a>0:\r\n a-=1\r\n c+=1\r\n z+=1\r\n if z%b==0:\r\n a+=1\r\n z = 0\r\nprint(c)", "n,m=map(int,input().split())\r\nval=0\r\nremain=0\r\nwhile (n)>=1:\r\n val+=n\r\n remain+=n%m\r\n n//=m\r\nwhile remain>=m:\r\n val+=remain//m\r\n remain=remain//m+remain%m\r\nprint(val)", "a,b=map(int,input().split())\r\nt=a\r\nwhile a>=b:\r\n m=a//b\r\n t+=m\r\n a=(a%b)+(a//b)\r\nprint(t)", "a,b=map(int,input().split());print((a-1)//(b-1)+a)", "import sys\nLI=lambda:list(map(int,sys.stdin.readline().split()))\nMI=lambda:map(int,sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\n\"\"\" for _ in range(II()): \"\"\"\na, b=MI()\nans=0\nwhile a>0:\n ans+=min(a,b)\n a=a-b+1\nprint(ans)", "IN = lambda:list(map(int, input().split()))\r\n\r\nn, m = IN()\r\nx = n\r\nday = 0\r\nwhile n > 0:\r\n if (day%m != 0): n -= 1\r\n day += 1\r\n\r\nprint(day-1)\r\n", "def candle(a, b):\r\n sum = int(0)\r\n remain = int(0)\r\n while a > 0:\r\n sum += a\r\n a += remain\r\n remain = a % b\r\n a //= b\r\n return sum\r\n\r\n\r\nif __name__ == '__main__':\r\n _ = input().split()\r\n a = int(_[0])\r\n b = int(_[1])\r\n print(candle(a, b))", "nums = input()\r\n\r\nnums_list = nums.split()\r\nnums_list_ = [int(num) for num in nums_list]\r\na, b = nums_list_\r\n\r\nhours = a\r\nwhile a//b != 0:\r\n hours += a//b\r\n a = a//b + a%b\r\n\r\nprint(hours)", "a, b = map(int, input().split())\r\nans = a\r\nost = [a//b, a%b]\r\nwhile ost[0] >= 1:\r\n ans += ost[0]\r\n ost[1] += ost[0]\r\n ost[0] = ost[1]//b\r\n ost[1] = ost[1]%b\r\nprint(ans)", "a, b = map(int, input().split())\r\nc = 0\r\nwhile a > 0:\r\n a -= 1\r\n c += 1\r\n if c % b == 0:\r\n a += 1\r\nprint(c)", "a, b = map(int, input().split())\r\ns = a # Initially, consider the candles Vasily has\r\n\r\nwhile a >= b:\r\n # Calculate how many new candles can be obtained from the burned ones\r\n new_candles = a // b\r\n # Add the new candles to the total count\r\n s += new_candles\r\n # Calculate the remaining candles after making new ones\r\n a = a % b + new_candles\r\n\r\nprint(s)\r\n", "l1=[int(x)for x in input().split()]\r\nimport math\r\nadd=l1[0]\r\nn=l1[0]\r\np=l1[1]\r\nwhile(n>=p):\r\n add+=n//p\r\n n=n%p+n//p\r\nprint(add)", "a,b = map(int,input().split())\r\ncnt = a\r\nrslt = a\r\nfor i in range(a):\r\n if cnt >= b:\r\n x = cnt//b\r\n rslt = rslt + x\r\n cnt = x + (cnt - x*b)\r\nprint(rslt)\r\n", "import sys\r\na,b = map(int, sys.stdin.readline().strip().split())\r\nsumm = a\r\nwhile a >= b:\r\n summ += a//b\r\n a = a//b + a%b\r\nprint(summ)", "a,b=map(int,input().split())\r\n\r\ncurra=a\r\ncurrb=a\r\n\r\nwhile currb>=b:\r\n curra+=currb//b\r\n currb=currb%b+currb//b\r\n\r\nprint(curra)\r\n ", "n=input().split(\" \")\r\nn[0],n[1]=int(n[0]),int(n[1])\r\ncount=n[0]\r\ni=0\r\nj=0\r\nwhile(n[0]>=n[1]):\r\n i=n[0]//n[1]\r\n j=n[0]%n[1]\r\n count+=i\r\n n[0]=i+j\r\n \r\n \r\nprint(count) \r\n ", "a, b = map(int, input().split())\r\ntotal, reserve = 0, 0\r\nwhile a > 0:\r\n total += a\r\n reserve += a\r\n a = reserve // b\r\n reserve %= b\r\nprint(total) ", "a, b = map(int, input().split())\r\ntime = a\r\nrest = a\r\nwhile rest//b != 0:\r\n time += rest//b\r\n rest = rest//b + rest%b\r\n\r\nprint(time)\r\n", "#https://codeforces.com/problemset/problem/379/A\na,b=map(int,input().split(' '))\ncount=0\nburnt=0\nwhile a>0:\n\tcount+=1\n\ta-=1\n\tburnt+=1\n\tif burnt>=b:\n\t\tburnt-=b\n\t\ta+=1\nprint(count)\n", "a, b = map(int, input().split())\r\nt = 0\r\nr = 0\r\n\r\nwhile a > 0:\r\n t += a\r\n a, r = divmod(a + r, b)\r\n\r\nprint(t)\r\n", "x,y=map(int,input().split())\r\nprint(x+int((x-1)/(y-1)))", "a, b = map(int, input().split())\r\nc1= 0\r\nc2 = 0\r\n\r\nwhile a > 0:\r\n c1 += 1\r\n c2 += 1\r\n if c2 == b:\r\n a += 1\r\n c2 = 0\r\n a -= 1 \r\n\r\nprint(c1)", "a, b = map(int, input().split())\r\n\r\nout = zapas = 0\r\nwhile a:\r\n a -= 1\r\n out += 1\r\n zapas += 1\r\n\r\n if zapas == b:\r\n zapas = 0\r\n a += 1\r\n\r\nprint(out)\r\n \r\n", "y=[int(q) for q in input().split()]\r\nw=y[0]\r\nwhile y[0]>=y[1]:\r\n w+=int(y[0]/y[1])\r\n y[0]=(y[0]%y[1])+int(y[0]/y[1])\r\nprint(w)\r\n \r\n", "import math\r\na,b=map(int,input().split())\r\nsum=a\r\nwhile(a>=b):\r\n res=a//b\r\n sum=sum+res\r\n m=a%b\r\n a=res+m\r\nprint(sum)", "a,b = map(int,input().split())\r\nans = int(a)\r\nwhile a >= b :\r\n a-=(b-1)\r\n ans+=1\r\nprint(ans)", "a,b=map(int,input().split())\ni=1\nk=0\nwhile(a):\n k+=1\n i+=1\n a-=1\n if(k==b):\n a+=1\n k=0\n\nprint(i-1)\n", "a,b = map(int,input().split())\r\nn = a\r\nans = 0\r\nx = 1e9\r\n\r\nwhile x>0:\r\n \r\n x = a//b\r\n a = a%b + x \r\n ans+=x\r\n\r\nprint(ans+n)", "a,b = list(map(int,input().split()))\r\nhours = a\r\nwhile(a >= b):\r\n d = a // b\r\n hours += d\r\n m = a % b\r\n a = d + m\r\nprint(hours)", "# A_NEW YEAR Candels\r\na, b = map(int, input().split())\r\nres1 = a\r\naa = 0\r\nbb = 0\r\nresult = a\r\nwhile b <= res1:\r\n aa = res1 % b\r\n bb = (res1 - aa) / b\r\n result += bb\r\n res1 = aa + bb\r\nprint(int(result))\r\n", "a, b = map(int, input().split())\r\nh = 0\r\nx = 0\r\nwhile a!=0:\r\n\ta-=1\r\n\th+=1\r\n\tx+=1\r\n\tif x==b:\r\n\t\tx-=b\r\n\t\ta+=1\r\nprint(h)", "a,b = map(int,input().split())\r\nans = a\r\nused = 0\r\nwhile(a > 0):\r\n a -= 1\r\n used += 1\r\n if used == b:\r\n used = 0\r\n a += 1\r\n ans += 1\r\n\r\nprint(ans)", "c,b=map(int,input().split())\r\ncount=0\r\nr=0\r\nwhile c!=0:\r\n c1=c\r\n count+=c1\r\n c=(c1+r)//b\r\n r=(c1+r)%b\r\nprint(count)", "#379A - New Year Candles\r\n[n,m]=list(map(int,input().split()))\r\nk=n\r\nwhile n>=m:\r\n k+=n//m\r\n n=n%m+n//m\r\nprint(k)", "a, b = map(int,input().split())\r\nq = 0\r\not = 0\r\nwhile a!=0:\r\n a-=1\r\n q+=1\r\n if q%b == 0:\r\n a+=1\r\n q=0\r\n ot+=1\r\nprint(ot)", "a,b = map(int,input().split())\n\nans = 0\nans += a\ntmp = 0\nwhile a > 0:\n\ttmp += a%b\n\ta = a//b\n\tans += a\ntmp1 = 0\nwhile tmp > 0:\n\ttmp1 += tmp%b\n\ttmp = tmp//b\n\tans += tmp\ntmp2 = 0\n\nwhile tmp1 > 0:\n\ttmp2 += tmp1%b\n\ttmp1 = tmp1//b\n\tans += tmp1\n\n\nprint(ans)\n\n\n\n", "a,b=map(int,input().split())\r\nhours=a\r\nt=0\r\nk=a//b\r\nwhile(a>=b):\r\n k=a//b\r\n g=a%b\r\n t=t+k\r\n a=k+g\r\nprint(hours+t)", "a,b=map(int,input().split())\r\ns=a\r\nwhile(a>=b):\r\n s+=a//b\r\n a=(a%b)+(a//b)\r\nprint(int(s))", "a, b = map(int, input().split()) # 3 2\nx = a // b # 1\ny = a % b # 1\ncount = a + x # 4\nwhile (x + y) // b > 0:\n a = x + y\n x = a // b\n y = a % b\n count += x\nprint(count)\n", "a, b=map(int, input().split())\r\nt=0\r\nwhile a>0:\r\n a=a-1\r\n t=t+1\r\n if t%b==0:\r\n a+=1\r\nprint(t)\r\n", "n, k = map(int, input().split())\r\ncount = n\r\nrem= 0\r\nwhile n >= k:\r\n temp = n//k\r\n rem = n - temp * k\r\n count += temp\r\n n = temp + rem\r\n \r\nprint(count)", "a,b=map(int,input().split())\r\ntime=a \r\nwhile(a>=b):\r\n time+=a//b \r\n a=a//b+a%b\r\nprint(int(time))", "import math\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nnum=a+math.floor((a-1)/(b-1))\r\nprint(num)", "def sol(a, b):\r\n res, pool = 0, 0\r\n while a > 0:\r\n res += a\r\n a, pool = (a + pool) // b, (a + pool) % b\r\n return res\r\n \r\n \r\na, b = map(int, input().split())\r\nprint(sol(a, b))", "a, b, = list(map(int, input().split()))\r\nc = a\r\ncount = 0\r\nwhile a > 0:\r\n a = a - 1\r\n count += 1\r\n if count % b == 0:\r\n count += 1\r\nprint(count)", "candles,materials=map(int,input().split(\" \"))\r\nhours=0\r\nstubs=0\r\nwhile True:\r\n hours=hours+candles\r\n stubs=stubs+candles\r\n candles=0\r\n candles=candles+stubs//materials\r\n stubs=stubs%materials\r\n if stubs<materials and candles==0:\r\n break\r\nprint(hours)", "a, b = map(int, input().split())\r\n\r\ntotal_hours = a\r\nremaining_candles = a\r\n\r\nwhile remaining_candles >= b:\r\n new_candles = remaining_candles // b\r\n total_hours += new_candles\r\n remaining_candles = remaining_candles % b + new_candles\r\n \r\nprint(total_hours)\r\n", "def readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\na, b = readarray(int)\r\nhours, burntCandles = 0, 0\r\n\r\nwhile a > 0:\r\n a -= 1\r\n hours += 1\r\n burntCandles += 1\r\n\r\n if burntCandles == b:\r\n a += 1\r\n burntCandles = 0\r\n\r\nprint(hours) ", "a, b = map(int, input().split())\r\nnum, rest = 0, 0\r\nwhile a > 0:\r\n num += a\r\n rest += a % b\r\n a = a // b\r\n while rest >= b:\r\n a += 1\r\n rest -= b\r\nprint(num)\n# Sat Sep 17 2022 11:20:52 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\r\n\r\n#a = list(map(int, input().split()))\r\nans = 0\r\npotux = 0\r\nwhile a > 0:\r\n ans += 1\r\n #print(a)\r\n a -= 1\r\n potux += 1\r\n if potux == b:\r\n a += 1\r\n potux = 0\r\n\r\nprint(ans)", "L = list(map(int, input().split()))\r\nn = L[0]\r\nwhile L[0] >= L[1]:\r\n n += L[0] // L[1]\r\n L[0] = L[0] // L[1] + L[0] % L[1]\r\nprint(n)\r\n", "a, b = map(int, input().split())\r\nhour = 0\r\nburn = 0\r\nwhile a > 0:\r\n a -= 1 # горит одна свеча\r\n hour += 1 # прибавляем 1 час\r\n burn += 1 # добавляем в запас 1 сгоревшую свечу\r\n if burn % b == 0: # если нам хватает запаса сгоревших свечей\r\n a += 1 # создаем 1 новую свечу\r\n burn = 0 # обнуляем наш запас сгоревших свечей\r\nprint(hour)", "A,B=map(int,input().split())\nhours = 0\nusedCandle, usableCandle = 0, A\nwhile usableCandle > 0 :\n hours += usableCandle\n usedCandle += usableCandle\n usableCandle = 0\n\n usableCandle = usedCandle//B\n usedCandle = usedCandle%B\nprint(hours)\n", "a,b= map(int,input().split())\r\np=a\r\nt=0\r\nf=0\r\nwhile a>=b:\r\n p+=a//b\r\n a=a//b+a%b\r\n \r\nprint(p)", "'''\r\n ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄\r\n ▄███████▀▀▀▀▀▀███████▄\r\n░▐████▀▒▒▒▒▒▒▒▒▒▒▒▒▒▀██████\r\n░███▀▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀████\r\n░▐██▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ ________________\r\n░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ / / |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|\r\n░░█▒▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▒▐███▌ // |___CM ONE DAY___|\r\n░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▒▐███▌ / / |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|\r\n░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌ // // \r\n░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌ /// \r\n░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█ / / \r\n░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀ // \r\n░░░░▄█████████ ████=========█▒▒▐▌\r\n░░░▀███▀▀████▀█████▀▒▌\r\n░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐\r\n░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐\r\n░░░░░████████████████\r\n'''\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n############################################\r\n'''\r\nAuthor :- \r\n Mian_Talha_g\r\n'''\r\n############################################\r\n'''for _ in range(int(input())):\r\n n = int(input())\r\n st = input()\r\n cout = ''\r\n for i in range(n-1):\r\n if st[i] == st[i+1]:\r\n pass\r\n else:\r\n if st[i] in st[i+1:]:\r\n cout += 'NO'\r\n else:\r\n cout += 'YES'\r\n if 'NO' in cout:\r\n print('NO')\r\n else:\r\n print('YES')'''\r\n\r\na,b = list(map(int,input().split()))\r\nres = math.floor((a-1)/(b-1))\r\nprint(a+res)", "a,b = map(int,input().split())\r\nc = a\r\nwhile a>=b:\r\n d = a//b\r\n c += d\r\n m = a%b\r\n a = d+m\r\nprint(c)", "a,b=map(int,list(input().split()))\r\nx=a\r\ncount=0\r\nif a>1:\r\n while a>1:\r\n x=x/b\r\n a=(a-1)+x\r\n count=count+1\r\n print(count)\r\nelse:print(a)", "a,b=map(int,input().split())\r\npot=0\r\not=0\r\nwhile pot//b>b or a!=0:\r\n ot=ot+a\r\n pot=pot+a\r\n a=pot//b\r\n pot=pot-(pot//b)*b\r\nprint(ot) ", "a, b = map(int, input().split())\r\na2 = a\r\nc = 0\r\nwhile True:\r\n c += a//b\r\n a = a//b + (a%b)\r\n if a < b:\r\n break\r\nprint(c+a2)", "a,b=map(int,input().split())\r\nk=0\r\nburned_out=0\r\nwhile a!=0:\r\n a-=1\r\n burned_out+=1\r\n if burned_out==b:\r\n a+=1\r\n burned_out=0\r\n k+=1\r\nprint(k)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\na,b=map(int,input().split())\r\nprint(a+(a-1)//(b-1))\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "a,b=map(int,input().split())\r\nans=a\r\nwhile a//b>0:\r\n ans+=a//b\r\n a=a%b+a//b\r\nprint(ans)\r\n", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = a\r\nsumd = 0\r\nsumd = sumd + a\r\nwhile a//b > 0:\r\n sumd += a//b\r\n a = a//b + a%b\r\nprint(sumd)", "a, b = map(int, input().split())\r\n\r\nans = 0\r\ncandles = a\r\nused = 0\r\nwhile candles:\r\n ans += candles\r\n used += candles\r\n candles = used // b\r\n used -= candles*b\r\nprint(ans)\r\n\r\n", "a, b = map(int, input().split())\r\ntime_count = 0\r\nwhile a > 0:\r\n a -= 1\r\n time_count += 1\r\n if time_count % b == 0:\r\n a += 1\r\nprint(time_count)", "a,b = map(int,input().split())\r\nprint((((a*b-1))//((b-1))))", "a,b = map(int,input().split())\r\nc = a\r\nwhile(a>=b):\r\n c += a//b\r\n a = (a//b) + (a%b)\r\n \r\nprint(c) ", "a , b = [int(x) for x in input().split()]\r\nhours = 0\r\nb_ = 0\r\n\r\nif b > a:\r\n print(a)\r\nelif b == a:\r\n print(a + 1)\r\nelse:\r\n while a != 0:\r\n hours += 1\r\n a -= 1\r\n b_ += 1\r\n if b_ == b:\r\n a += 1\r\n b_ = 0\r\n print(hours)", "a,b=map(int,input().split())\r\nc=0\r\nwhile c<a:\r\n if c%b==0:\r\n a=a+1\r\n c=c+1\r\nprint(a-1)", "string=input()\r\na=list(map(int,string.split()))[0]\r\nb=list(map(int,string.split()))[1]\r\nall = a\r\nwhile a >= b:\r\n all += a // b\r\n a = a % b + a // b\r\nprint(all)\r\n", "candles, new = [int(i) for i in input().split()]\r\nhours = 0\r\nbad = 0\r\nwhile candles!=0:\r\n hours+=1\r\n bad+=1\r\n candles-=1\r\n if bad==new:\r\n candles+=1\r\n bad=0\r\nprint(hours)", "n, k = map(int,input().split())\r\n\r\nc = n\r\nwhile n>0:\r\n #print(n)\r\n n-=(k-1)\r\n c+=1\r\n\r\nprint(c-1)", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\n\r\ntotal = a\r\nwhile(a>=b):\r\n total += a//b\r\n a = a//b + a%b\r\nprint(total)", "a,b=map(int,input().split())\r\ns=a\r\nwhile a>=b:\r\n m=a//b\r\n s+=m\r\n d=a%b\r\n a=d+m\r\nprint(s)\r\n", "a, b = map(int, input().split())\r\nhours = 0\r\nrenew = 0\r\nwhile a > 0:\r\n a = a-1\r\n hours += 1\r\n renew += 1\r\n if renew == b:\r\n a += 1\r\n renew = 0\r\nprint(hours)", "a,b=map(int,input().split())\r\nh=0\r\nwhile a>0:\r\n a-=1\r\n h+=1\r\n if h%b==0:\r\n a+=1\r\nprint(h)", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\ncount = a\r\nb1 = False\r\nwhile b1==False:\r\n if a < b:\r\n print(count)\r\n break\r\n count += (a//b)\r\n a = a // b + a % b\r\n ", "a,b=map(int,input().split())\r\ns=a\r\nwhile(a>=b):\r\n r=0\r\n s=s+a//b \r\n r=a%b\r\n a=a//b+r\r\nprint(s)", "n, k = map(int,input().split())\r\nhours = 0\r\nspend_candles = 0\r\nwhile n > 0:\r\n hours +=1 \r\n n -= 1\r\n spend_candles += 1\r\n if spend_candles % k == 0:\r\n n +=1\r\nprint(hours)", "x,y=map(int,input().split())\r\nh=x\r\nwhile x>=y:\r\n nx=x//y\r\n h+=nx\r\n x=nx+x%y\r\nprint(h) ", "a, b = map(int, input().split())\r\ncounter = 0\r\nwhile a > 0:\r\n a -= 1\r\n counter += 1\r\n if counter % b == 0:\r\n a += 1\r\nprint(counter)", "a, b = [int(i) for i in input().split()]\n\nt = a\n\nwhile a >= b:\n t += a//b\n a = a//b + a%b\n\nprint(int(t))\n\n\n# 6 3\n# 6//3 = 2\n# 6//3 + 6%3\n", "def solve():\r\n x,y = map(int,input().split())\r\n a = x\r\n p = 0\r\n z = 0\r\n \r\n while x >= y:\r\n p = x//y\r\n a+=p\r\n z = x%y\r\n x = p + z\r\n else:\r\n print(a)\r\n#case = int(input())\r\n#for _ in range(case):\r\nsolve()\r\n", "x, y = input().split()\r\ntotal_svechi = 0\r\nll = list()\r\n\r\ntotally = int(x)\r\nwhile True:\r\n lasted_sve4i = totally - int(y)\r\n if lasted_sve4i >=0:\r\n totally = lasted_sve4i + 1\r\n total_svechi += 1\r\n ll.append(totally)\r\n else:\r\n break\r\n\r\n\r\nres = len(ll)\r\nprint(int(res) + int(x))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n ", "from math import ceil, floor\r\n\r\ncandles = input().split()\r\na = float(candles[0])\r\nb = float(candles[1])\r\n\r\noutput = a\r\n\r\nwhile a // b >= 1:\r\n result = a // b\r\n output += result\r\n remainder = a % b\r\n a = result + remainder\r\n\r\nprint(int(output))\r\n", "a,b=[int(i) for i in input().split()]\r\nf=a\r\ng=0\r\nwhile a//b>0:\r\n f+=a//b\r\n g=a%b\r\n a=a//b\r\n a+=g\r\nprint(f)\r\n", "from collections import defaultdict\n\ndef pug_func(s: str) -> int:\n\n a, b = s.split(\" \")\n a = int(a)\n b = int(b)\n\n ans = a\n\n while a >= b:\n ans += a // b\n a = (a // b) + (a % b)\n\n return ans\n\n\n\n\n# t = int(input())\n# lista_ans = []\n\n# for _ in range(t):\n# n = input()\n# line = input()\n# lista_ans.append(line)\n\n# for ans in lista_ans:\n# x = pug_func(ans)\n# print(x)\n\nt = input()\nx = pug_func(t)\nprint(x)\n\t \t\t \t\t\t \t \t\t \t\t\t\t\t\t \t", "a,b = map(int, input().split())\r\ncount = a\r\ngorat = 0\r\npotuh = a\r\nwhile potuh >= b:\r\n if potuh % b == 0:\r\n gorat = potuh // b\r\n else:\r\n gorat = (potuh - potuh % b) // b\r\n count += gorat\r\n potuh = gorat + potuh - (potuh - potuh % b)\r\nprint(count)\r\n", "a, b = map(int, input().split())\r\nold = a\r\nwhile a >= b:\r\n old += a // b\r\n a = a // b + a % b\r\nprint(old)\r\n \r\n", "def candle_hours(a: int, b: int) -> int:\r\n total_hours = a\r\n while a >= b:\r\n total_hours += a // b\r\n a = a // b + a % b\r\n return total_hours\r\n\r\na, b = map(int, input().split())\r\nprint(candle_hours(a, b))\r\n", "wholeCandles, x = map(int, input().split())\r\nhalfCandles = 0\r\nanswer = 0\r\nwhile wholeCandles > 0:\r\n answer += wholeCandles\r\n halfCandles += wholeCandles\r\n wholeCandles = 0\r\n wholeCandles = halfCandles // x\r\n halfCandles = halfCandles % x\r\nprint(answer)\r\n", "a, b = map(int, input().split())\r\nc = a\r\ndef f(a, b):\r\n global c\r\n if a < b:\r\n return c\r\n if a >= b:\r\n c += a // b\r\n a = a % b + a // b\r\n return f(a, b)\r\nprint(f(a, b))", "a,b=map(int,input().split())\r\nprint(((a*b)-1)//(b-1))", "a, b = map(int, input().split())\r\nh = a\r\nwhile b<=a:\r\n\t_ = int(a/b)\r\n\th += _\r\n\ta = _ + a%b\r\nprint(h)", "a, b = [int(i) for i in input().split()]\r\nm = a \r\nc = a \r\nwhile c >= b:\r\n m += c//b\r\n c = c//b+c%b\r\nprint(m)", "def solve():\r\n a,b=map(int,input().split())\r\n ans=a\r\n while a>=b:\r\n k=int(a/b)\r\n p=(a%b)\r\n a=k+p\r\n ans+=k\r\n print(ans)\r\n return\r\n\r\ndef main():\r\n solve()\r\n return\r\n\r\nif __name__==\"__main__\":\r\n main()", "import math\r\na,b=map(int,input().split())\r\nx=a+math.floor(a/b)\r\na=math.floor(a/b)+a%b\r\nwhile(a>=b):\r\n x=x+math.floor(a/b)\r\n a=math.floor(a/b)+a%b\r\nprint(x) \r\n\r\n ", "a, b = [*open(0)][0].split()\r\na = int(a)\r\nb = int(b)\r\ntotal, remain = 0, 0\r\n\r\nwhile a > 0:\r\n total += a\r\n remain += a\r\n a = remain // b\r\n remain = remain % b\r\n\r\nprint(total)\r\n", "a,b = map(int,input().split(\" \"))\n\nc = a\np = 0\nwhile(a>0):\n\tp += a%b\n\ta = a//b\n\tif(p>=b):\n\t\tp-=b\n\t\ta+=1\n\tc+=a\n\t\nprint(c)\n\n\n \t \t \t \t \t \t\t \t\t\t \t\t\t\t \t \t \t\t \t", "a,b = map(int,input().split())\ntime = 0\ncandles = a\nburnt_candles = 0\nwhile candles > 0:\n candles -= 1\n burnt_candles += 1\n time += 1\n if burnt_candles >= b:\n burnt_candles -= b\n candles += 1\nprint(time)\n", "import math\n\nvalues = list(map(int, input().split(\" \")))\na = values[0]\nb = values[1]\nanswer = a\nused = a\n\nif(a >= b):\n while(used >= b):\n news = math.floor(used/b)\n answer += news\n used = news + used % b\n\nprint(answer)\n \t\t\t \t\t\t \t\t \t\t \t \t\t \t\t \t\t", "A,B=map(int,input().split()) \r\nANS=A \r\nwhile A>=B: \r\n ANS=ANS+A//B \r\n C=A%B\r\n A=A//B+C\r\nprint(ANS)", "a,b=map(int,input().split())\r\nc=a\r\nwhile a//b>=1:\r\n\tc+=a//b\r\n\ta=a//b+a%b\r\nprint(c)", "def solve():\r\n n = [int(n) for n in input().split(\" \", 2)]\r\n count = n[0]\r\n while n[0] >= n[1]:\r\n n[0] -= n[1]\r\n n[0] += 1\r\n count += 1\r\n return count\r\n\r\n\r\nprint(solve())\r\n", "a, b = map(int, input().split())\r\nc = 0\r\np = 0\r\nwhile a != 0:\r\n c = c + 1\r\n a = a - 1\r\n p = p + 1\r\n if p == b:\r\n a = a + 1\r\n p = 0\r\nprint(c)\r\n\r\n", "a,b = map(int, input().split())\r\nnew = 0\r\ncoun=0\r\nwhile a!=0:\r\n a-=1\r\n new+=1\r\n coun+=1\r\n if new%b==0:\r\n a+=1\r\n new=0\r\nprint(coun)\r\n", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n \nif __name__ == '__main__':\n a, b = [int(x) for x in input().strip().split(\" \")]\n ans = a\n res = 0\n while a > 0:\n \ta += res\n \tres = a % b\n \ta = a // b\n \tans += a\n print(ans)\n \t \t \t \t\t \t\t \t \t \t\t", "\r\na,b=map(int, input().split())\r\nhours=0\r\nrem_candles=a\r\nwhile(rem_candles>=b):\r\n burnt_candles=rem_candles//b\r\n hours+=burnt_candles*b\r\n rem_candles=burnt_candles+rem_candles%b\r\n\r\nhours+=rem_candles\r\nprint(hours)", "a,b=map(int,input().split())\r\nt=(a*b-1)//(b-1)\r\nprint(t)\r\n", "a,b = map(int,input().split())\r\n\r\nresult = a + (a-1)//(b-1)\r\n\r\nprint(result)", "a,b=[int(i) for i in input().split()]\r\nhours=0\r\nwoc=0\r\nwhile a!=0 or woc>=b:\r\n\thours+=a\r\n\twoc+=a\r\n\ta=woc//b\r\n\twoc=woc%b\r\nprint(hours)", "new,old = map(int,input().split())\r\n\r\ndiscard = 0\r\ncandles = 0\r\n\r\nwhile new > 0:\r\n new -= 1\r\n candles += 1\r\n discard += 1\r\n if discard == old:\r\n discard = 0\r\n new += 1\r\n \r\nprint(candles)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nan=n\r\npog=n\r\nwhile pog>=m:\r\n an+=pog//m\r\n pog=pog//m+pog%m\r\nprint(an)", "a , b = map(int , input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total += (a // b)\r\n a = a // b + a % b\r\nprint(total)", "n, m = map(int, input().split())\r\nans = n\r\nwhile n // m > 0:\r\n ans += n // m\r\n n = n // m + n % m\r\nprint(ans)", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #\r\nimport math as m\r\na,b = map(int,input().split())\r\nprint(a+(m.floor((a-1)/(b-1))))\r\n", "a, b = map(int, input().split())\nsum = a\nwhile a >= b:\n sum += a // b\n a = (a // b) + (a % b)\nprint(sum)\n \t \t\t \t\t\t \t\t \t", "candels,candels_neeededfornew = map(int,input().split())\r\nhours = candels\r\n\r\nwhile(candels>=candels_neeededfornew):\r\n hours = hours+(candels//candels_neeededfornew)\r\n candels = (candels//candels_neeededfornew) + (candels%candels_neeededfornew)\r\n \r\nprint(hours)", "a,b = [int(x) for x in input().split()]\r\ncandle = a\r\nstud = 0\r\nwhile a:\r\n stud = a%b if a> b else 0\r\n candle += a//b\r\n a = (a//b)+stud\r\nprint(candle)", "a,b=map(int,input().split())\r\nans=a\r\nwhile a>=b:\r\n x=a%b\r\n a=a//b\r\n ans+=a\r\n a=a+x\r\nprint(ans)", "a, b = tuple(map(int, input().split()))\n\na_burned = 0\nhours = 0\n\nwhile a:\n a -= 1\n a_burned += 1\n hours += 1\n\n if a_burned == b:\n a += 1\n a_burned = 0\n\nprint(hours)", "a,b = map(int,input().split())\r\ntime = 0\r\nost = 0\r\nwhile a > 0 :\r\n time += a\r\n ost += a\r\n a = 0\r\n a += ost // b\r\n ost = ost % b\r\nprint(time)", "a, b = list(map(int, input().strip().split()))\nhours = a\n\nwhile a // b > 0:\n new_candles, leftover_candles = divmod(a, b)\n hours += new_candles\n a = new_candles + leftover_candles\n\nprint(hours)\n\t \t \t\t \t \t \t\t\t\t \t \t \t", "if __name__ == \"__main__\":\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n cnt = 0\r\n used = 0\r\n while a > 0:\r\n cnt += 1\r\n a -= 1\r\n used += 1\r\n if used == b:\r\n used -= b\r\n a += 1\r\n print(cnt)\r\n\r\n\r\n", "n , m = map(int,input().split())\r\nans = n + n//m\r\nx = n\r\nwhile(x!=ans):\r\n x = ans\r\n ans = n + ans//m\r\n \r\nprint(ans)", "a,b=map(int,input().split())\r\nhour=0\r\nwhile a>0:\r\n a=a-1\r\n hour=hour+1\r\n if hour%b==0:\r\n a=a+1\r\nprint(hour)\r\n", "a,b = list(map(int, input().split()))\r\nans = a\r\nwhile a >= b:\r\n\tc = a // b\r\n\td = a % b\r\n\tans += c\r\n\ta = c\r\n\ta += d\r\nprint(ans)", "import math\r\n(a,b) = map(int,input().split())\r\n\r\n\r\nprint(a + (a-1)//(b-1))", "a, b = map(int, input().split())\r\n\r\nres = a\r\n\r\nwhile a >= b:\r\n quo = a // b\r\n res += quo\r\n rem = a % b\r\n a = quo + rem\r\n \r\nprint(res)", "A=input().split()\r\na=int(A[0])\r\nb=int(A[1])\r\nx=a\r\nwhile x>=b:\r\n k=x//b\r\n a+=k\r\n x=x-k*b+k\r\nprint(a)", "a,b = [int(x) for x in input().split()]\r\ntime = a\r\nrem = a\r\nwhile a>0:\r\n a = rem//b\r\n rem = rem%b\r\n time = time + a\r\n rem = rem + a\r\nprint(time)", "a,b=map(int,input().split())\r\nk=0\r\nwhile a>0:\r\n if a>=b:\r\n k+=b\r\n a=a-b+1\r\n else:\r\n k+=a\r\n a=0\r\nprint(k)", "a, b = map(int, input().split())\r\n\r\ncount = a\r\n\r\n\r\n\r\nwhile (a >= b): \r\n count += a // b\r\n a = int(a % b) + a // b\r\n \r\n\r\nprint(count)", "def max_hours(a, b):\r\n total_hours = a # Initial hours from existing candles\r\n \r\n while a >= b:\r\n new_candles = a // b # Number of new candles created\r\n total_hours += new_candles # Add burning hours of new candles\r\n a = new_candles + a % b # Remaining candles after creating new ones\r\n \r\n return total_hours\r\n\r\n# Read input\r\na, b = map(int, input().split())\r\n\r\n# Calculate the maximum hours\r\nresult = max_hours(a, b)\r\n\r\n# Output the result\r\nprint(result)\r\n", "a_,b_=input().split()\r\n\r\na=int(a_)\r\nb=int(b_)\r\n\r\ns=a\r\n\r\ndef hour(a,b,s):\r\n while a>=b:\r\n s=s+a//b\r\n a=a//b+a%b\r\n print(s)\r\n \r\n \r\nhour(a, b, s)\r\n\r\n\r\n \r\n \r\n \r\n ", "a,b = map(int,input().split())\r\ns = a\r\nwhile int(a/b)!=0:\r\n s += int(a/b)\r\n a = int(a/b)+(a%b)\r\nprint(s)", "x, y = map(int, input().split())\r\ntot = 0\r\nf = x\r\nhal = 0\r\nwhile f > 0:\r\n tot += f\r\n hal += f\r\n f = hal // y\r\n hal %= y\r\nprint(tot)", "a, b = map(int, input().split())\r\n\r\ns = a\r\n\r\nwhile a // b > 0:\r\n s += a//b\r\n a = a//b + a%b\r\n\r\nprint(s)\r\n", "n,m = map(int,input().split())\r\ncount = n+(n-1)//(m-1)\r\nprint(count)", "#!/bin/python3\r\n\r\n# get inputs\r\ninp = input().split()\r\n\r\n# filter inputs\r\na = int(inp[0])\r\nb = int(inp[1])\r\n\r\n\r\ndef new_year(a: int, b: int) -> int:\r\n time_left = 0\r\n while a > 0:\r\n a -= 1\r\n time_left += 1\r\n if time_left % b == 0:\r\n a += 1\r\n return time_left\r\n\r\n\r\nprint(new_year(a, b))\r\n", "a,b=map(int,input().split())\r\n\r\nc=a\r\ns=a\r\nr=0\r\nwhile c>0:\r\n r+=c%b\r\n c=int(c/b)\r\n #print(c)\r\n s+=c\r\n#print(s)\r\nz=0\r\nwhile r>0:\r\n z+=r%b\r\n r=int(r/b)\r\n s+=r\r\n \r\n#print(z)\r\nprint(s+int(z/b))\r\n ", "a,b = map(int,input().split())\r\n\r\ncount=0\r\nres =0\r\nwhile a!=0:\r\n a-=1\r\n count+=1\r\n if count==b:\r\n a+=1\r\n count=0\r\n res+=1\r\n\r\nprint (res)\r\n", "import math\r\nimport sys\r\n\r\n# s,n=map(int,input().split())\r\n# t=True\r\n# for i in range(int(input())):\r\n # n=int(input()) \r\na,b=map(int,input().split()) \r\n# arr=list(map(str,input().split()))\r\n# s=set() \r\ncnt=a\r\n\r\nwhile(a>=b):\r\n d=int(a/b)\r\n cnt+=d\r\n r=a%b\r\n a=d+r\r\nprint(cnt)", "# New Year Candles\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\nrenew = s[0]\r\nb = s[1]\r\nremainder = 0.0\r\nsum = renew\r\nwhile renew > 0:\r\n remainder += (renew % b)\r\n if remainder >= b:\r\n renew = (renew // b) + 1\r\n remainder -= 1*b\r\n else:\r\n renew = renew // b\r\n sum += renew\r\nprint(sum)", "a, b = map(int, input().split())\r\n\r\nc = 0\r\n\r\nres = 0\r\n\r\nwhile a > 0:\r\n res += a\r\n c += a\r\n a = c//b\r\n c %=b\r\n\r\nprint(res)\r\n", "(n, k) = [int(x) for x in input().split(\" \")]\n\ntime = n\n\nwhile (n >= k):\n x = n // k\n \n time += x\n\n m = n % k\n n = x + m;\n\nprint(time)\n", "a, b = map(int,input().split())\r\npotuh = 0\r\ntime = 0\r\nwhile a>0:\r\n potuh += 1\r\n if potuh == b:\r\n a += 1\r\n potuh = 0\r\n a -= 1\r\n time +=1\r\nprint(time)\r\n", "a,b = list(map(int, input().split()))\nc = 0\nv = 0\nwhile True:\n v += a\n c += a\n a = int(v/b)\n v = v - (a*b)\n \n if a == 0 and v < b:\n break\nprint(c)", "def cantHoras(velas,sobrantes,cantNewVela):\r\n if(velas==0):\r\n return 0\r\n newVelas=(velas+sobrantes)//cantNewVela\r\n newSobrantes=(velas+sobrantes)%cantNewVela\r\n return (velas+cantHoras(newVelas,newSobrantes,cantNewVela))\r\n\r\nfila=[int(x) for x in input().split(' ')]\r\nvelas=fila[0]\r\ncantNewVela=fila[1]\r\nprint(cantHoras(velas,0,cantNewVela))", "a,b=map(int,input().split())\ni=0\nk=0\nwhile(a):\n k+=1\n i+=1\n a-=1\n if(k==b):\n a+=1\n k=0\n\nprint(i)\n", "a,b=map(int,input().split())\r\nnew,old=a,0\r\np=0\r\nwhile new>0:\r\n p+=new\r\n new,old=0,old+new\r\n new,old=old//b,old%b\r\nprint(p)", "def f():\n x,y=input().split()\n x=int(x)\n y=int(y)\n if y>x:\n print(x)\n else:\n a=x\n r=0\n while x>=y:\n r+=x%y\n x=x//y\n a+=x\n x=x+r\n r=0\n \n print(a+(x+r)//y)\nf()\n \n \n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n INITIAL_CANDLE_COUNT, COUNT_FOR_NEW_CANDLE = map(int, input().split())\r\n\r\n totalHours:int = 0\r\n unusedCandleCount:int = INITIAL_CANDLE_COUNT\r\n usedCandleCount:int = 0\r\n while unusedCandleCount > 0 :\r\n totalHours += unusedCandleCount\r\n usedCandleCount += unusedCandleCount\r\n unusedCandleCount = usedCandleCount//COUNT_FOR_NEW_CANDLE\r\n usedCandleCount = usedCandleCount%COUNT_FOR_NEW_CANDLE\r\n\r\n print(totalHours)\r\n\r\nmain()", "a, b = list(map(int, input().split()))\r\nhours = 0\r\nparts = 0\r\nwhile a > 0:\r\n hours += a\r\n parts += a\r\n a = parts // b\r\n parts %= b\r\nprint(hours)", "m, n = [int(i) for i in input().split()]\r\nc = 0\r\nflag = False\r\ncount = m\r\nwhile True:\r\n k = m//n\r\n count+=k\r\n c+= m%n\r\n m//=n\r\n if m<n:\r\n m+=c\r\n flag = True\r\n c = 0\r\n if m==0 or k==0:\r\n break\r\nprint(count)\r\n", "\r\n\r\ndef main():\r\n input_prompt = input().split(' ')\r\n a, b = int(input_prompt[0]), int(input_prompt[1])\r\n\r\n hours = a\r\n ogryzki = a\r\n while ogryzki >= b:\r\n hours += ogryzki // b\r\n\r\n ogryzki = ogryzki // b + ogryzki % b\r\n\r\n print(hours)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "candle_a, candle_b = map(int, input().split())\r\ncount_time = 0 \r\nwhile candle_a > 0:\r\n count_time = count_time + 1\r\n candle_a = candle_a - 1 \r\n \r\n if count_time % candle_b == 0:\r\n candle_a = candle_a + 1\r\nprint(count_time)", "a,b = map(int,input().split())\r\ntotal = a\r\nwhile a >= b:\r\n total+=a//b\r\n a = a//b + a%b\r\nprint(total)", "#Initializes scenario\r\nscenario = input().split(' ')\r\ncandles = int(scenario[0])\r\nnewCandle = int(scenario[1])\r\nburntCandle = 0\r\nhours = 0\r\n\r\n#counts hours until candle count hits 0\r\nwhile candles != 0:\r\n hours +=1\r\n candles -= 1\r\n burntCandle += 1\r\n if burntCandle == newCandle: #resets burnt candle when a new one can be made\r\n burntCandle -= newCandle\r\n candles += 1\r\n continue\r\n \r\nprint(hours)", "import math\r\na,b=map(int,input().split())\r\nx=a\r\nwhile(a>=b):\r\n x=math.floor(a/b)+x\r\n a=math.floor(a/b)+a%b\r\nprint(x) \r\n\r\n ", "n, m = map(int, input().split())\r\nif n == m:\r\n print(n+1)\r\nelif n > m:\r\n s = n\r\n while True:\r\n n /= m\r\n s += n\r\n if int(n) == 0:\r\n break\r\n print(int(s))\r\nelse:\r\n print(n)\r\n", "def fun(velas, b):\n hours = velas\n\n while velas >= b:\n # velas = velas/b\n # pedazos += velas%b\n # hours += velas\n velas = velas/b\n hours += velas\n hours += velas/b\n\n print(int(hours))\n\ninp = input()\na,b = inp.split()\nfun(int(a),int(b))\n", "import sys\r\n\r\na, b = map(int,sys.stdin.readline().split())\r\nans = a\r\nres = 0\r\nwhile a >0:\r\n res += a%b\r\n a = a//b\r\n a += res//b\r\n res = res % b\r\n ans +=a\r\nprint(ans+a)\r\n", "a,b = map(int, input().split(\" \"))\r\ntemp = a\r\nwhile(int(a) > 0):\r\n a /= b\r\n temp += a\r\nprint(int(temp))\r\n ", "from math import *\r\na,b=map(int,input().split())\r\nans=a\r\nc=0\r\nwhile(1):\r\n c=a%b\r\n a=floor(a/b)\r\n ans+=a\r\n a+=c\r\n if(a<b):\r\n break\r\nprint(ans)", "a,b = list(map(int,input().split()))\r\nx=a+0;\r\nwhile(a>=b):\r\n x=x+(a//b)\r\n a=(a//b)+(a%b)\r\nprint(x)\r\n \r\n\r\n\r\n\r\n", "entered_list=input().split()\r\nnum_list=list(map(int,entered_list))\r\na=num_list[0]\r\nb=num_list[1]\r\nresult=a\r\nwhile a>=b:\r\n result+=a//b\r\n a=a//b+a%b\r\nprint(result)\r\n ", "a,b=map(int,input().split())\r\na1=0\r\nt=0.\r\nwhile a>0 :\r\n if a1==b:\r\n a+=1\r\n a1=0\r\n a-=1\r\n a1+=1\r\n t+=1\r\nif a1==b:\r\n t+=1\r\nprint(int(t))\r\n", "a,b=map(int,input().split())\r\nc=a\r\nk=0\r\nwhile(a>=b):\r\n l=a//b\r\n c+=l\r\n k=a%b\r\n a=l+k\r\nprint(c)", "# t = int(input())\r\n# while t>0:\r\nn,m = (int(i) for i in input().split())\r\nsum = n\r\nwhile n>=m:\r\n sum+=n//m\r\n n=n//m+n%m\r\nprint(int(sum))\r\n # t-=1", "a,b=map(int,input().split())\r\nhours=0\r\nburn=0\r\nwhile a>0:\r\n a-=1\r\n hours+=1\r\n burn+=1\r\n if burn%b==0:\r\n a+=1\r\n burn=0\r\nprint(hours)", "a, b=map(int, input().split())\r\ng, ng=a, 0\r\ncount=a\r\nwhile g!=0:\r\n ng+=g\r\n g=ng//b\r\n ng%=b\r\n count+=g\r\nprint(count)\r\n", "a , b = [int(x) for x in input().split()]\r\nh=a\r\nwhile b<=a:\r\n d = a // b\r\n h = h+d\r\n m = a%b\r\n a = d+m\r\nprint(h)", "a, b = [int(i) for i in input().split()]\r\nprint((a*b-1)//(b-1))", "a, b = input().split()\na, b = int(a), int(b)\n\ncount = a\nwhile a >= b:\n count += a // b\n a = a // b + a % b\n\nprint(count)", "a,b=map(int,input().split())\r\nans=a \r\nwhile(a>=0):\r\n ans+=a//b\r\n a=a//b+(a%b)\r\n if(a<b):\r\n break\r\n \r\nprint(ans)", "import math\r\na,b=map(int, input().split())\r\nnum=a+math.floor((a-1)/(b-1))\r\nprint(num)" ]

{"inputs": ["4 2", "6 3", "1000 1000", "123 5", "1000 2", "1 2", "1 3", "1 4", "2 2", "3 2", "3 3", "999 2", "1000 3", "1000 4", "1 1000", "80 970", "80 970", "80 970", "80 970", "80 970", "80 970", "10 4", "4 3", "91 5", "777 17", "100 4", "5 3", "6 4", "26 8", "9 4", "20 3", "17 3"], "outputs": ["7", "8", "1001", "153", "1999", "1", "1", "1", "3", "5", "4", "1997", "1499", "1333", "1", "80", "80", "80", "80", "80", "80", "13", "5", "113", "825", "133", "7", "7", "29", "11", "29", "25"]}

UNKNOWN

PYTHON3

CODEFORCES

472

d499e64d29c12399b541b19d5ace8193

Chat

There are times you recall a good old friend and everything you've come through together. Luckily there are social networks — they store all your message history making it easy to know what you argued over 10 years ago. More formal, your message history is a sequence of messages ordered by time sent numbered from 1 to *n* where *n* is the total number of messages in the chat. Each message might contain a link to an earlier message which it is a reply to. When opening a message *x* or getting a link to it, the dialogue is shown in such a way that *k* previous messages, message *x* and *k* next messages are visible (with respect to message *x*). In case there are less than *k* messages somewhere, they are yet all shown. Digging deep into your message history, you always read all visible messages and then go by the link in the current message *x* (if there is one) and continue reading in the same manner. Determine the number of messages you'll read if your start from message number *t* for all *t* from 1 to *n*. Calculate these numbers independently. If you start with message *x*, the initial configuration is *x* itself, *k* previous and *k* next messages. Messages read multiple times are considered as one. The first line contains two integers *n* and *k* (1<=≤<=*n*<=≤<=105, 0<=≤<=*k*<=≤<=*n*) — the total amount of messages and the number of previous and next messages visible. The second line features a sequence of integers *a*1,<=*a*2,<=...,<=*a**n* (0<=≤<=*a**i*<=<<=*i*), where *a**i* denotes the *i*-th message link destination or zero, if there's no link from *i*. All messages are listed in chronological order. It's guaranteed that the link from message *x* goes to message with number strictly less than *x*. Print *n* integers with *i*-th denoting the number of distinct messages you can read starting from message *i* and traversing the links while possible. Sample Input 6 0 0 1 1 2 3 2 10 1 0 1 0 3 4 5 2 3 7 0 2 2 0 1 Sample Output 1 2 2 3 3 3 2 3 3 4 5 6 6 6 8 2 2 2

[ "n, k = (int(s) for s in input().split())\r\na = [0] + [int(s) for s in input().split()]\r\nans = [0,]\r\n\r\nfor i in range(1, n + 1):\r\n if not a[i]:\r\n ans.append( min(i - 1, k) + 1 + min(n - i, k) )\r\n else:\r\n if a[i] + k < i - k:\r\n ans.append( min(i - 1, k) + 1 + min(n - i, k) + ans[a[i]] )\r\n else:\r\n ans.append( ans[a[i]] + min(n, i + k) - a[i] - min(k, n - a[i]))\r\n \r\nprint(*ans[1:])", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [0] * n\r\nfor i in range(len(a)):\r\n num = a[i] - 1\r\n right = min(n - 1, i + k)\r\n if num == -1:\r\n left = max(0, i - k)\r\n b[i] = right - left + 1\r\n else:\r\n right_p = min(n - 1, num + k)\r\n left = max(right_p + 1, i - k)\r\n b[i] = b[a[i] - 1] + right - left + 1\r\nprint(*b)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nansw = []\r\n\r\nfor i in range(n):\r\n # если i - индекс, то не меняем\r\n # если i - значение в массиве, то +1\r\n if arr[i] == 0:\r\n temp = 1 + min(i + 1 + k, n) - max(i + 1 - k, 1)\r\n answ.append(temp)\r\n\r\n else:\r\n if (i + 1 - arr[i]) >= 2 * k + 1:\r\n temp = 1 + min(i + 1 + k, n) - max(i + 1 - k, 1) + answ[arr[i] - 1]\r\n\r\n if 2 * k + 1 > (i + 1 - arr[i]) > k:\r\n temp = min(i + 1 + k, n) - max(i + 1 - (i + 1 - arr[i] - k), 1) + answ[arr[i] - 1]\r\n\r\n if (i + 1 - arr[i]) <= k:\r\n temp = min(i + 1 + k, n) - min(arr[i] + k, n) + answ[arr[i] - 1]\r\n\r\n answ.append(temp)\r\n\r\nprint(*answ)\r\n", "n, k = map(int, input().split())\r\na = list(map(lambda x: int(x) - 1, input().split()))\r\ndp = [0] * n\r\nfor i in range(n):\r\n\tif a[i] == -1:\r\n\t\tdp[i] = min(i, k) + min(n - i - 1, k) + 1\r\n\telse:\r\n\t\tdp[i] = dp[a[i]] - min(n - a[i] - 1, k) + min(n - i - 1, k) + min(2 * k, i - a[i] - 1) + 1\r\nprint(' '.join(list(map(str, dp))))", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\ns = [0 for i in range(n)]\r\ns[0] = 1 + min(n-1, k)\r\n#import time\r\n#start_time = time.time()\r\n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n s[i] = 1 + min(i, k) + min(n - 1 - i, k)\r\n else:\r\n j = a[i] - 1\r\n s[i] = s[j] + min(i+k, n-1) - min(j+k, n-1)\r\n if i - k > j + k:\r\n s[i] -= i - k - (j+k) - 1\r\nprint(' '.join([str(i) for i in s]))\r\n#print('\\n------%s seconds-------' % (time.time() - start_time))", "(n, k) = list(map(int, input().split()))\r\na = list(map(int, ('0 ' + input()).split()))\r\nclv = {}\r\n\r\ndef getcnt(x):\r\n\tglobal c, a, clv\r\n\tif x in clv: return clv[x]\r\n\tif a[x]==0:\r\n\t\treturn min(k, x-1) + 1 + min(k, n-x)\r\n\telse:\r\n\t\tper = (min(a[x]+k, n) - max(1, x-k) + 1)\r\n\t\tif per<0: per = 0\r\n\t\tretclv = min(k, x-1) + 1 + min(k, n-x) + getcnt(a[x]) - per\r\n\t\tclv[x] = retclv\r\n\t\treturn retclv\r\n\r\n\r\nfor i in range(1, n+1):\r\n\tprint(getcnt(i), end=' ')\t", "n, k = list(map(int, input().split()))\nanswer = [None] * n\nfor i, ref in enumerate(map(int, input().split())):\n ref -= 1\n max_cur_page = min(i + k, n - 1)\n min_cur_page = max(i - k, 0)\n answer[i] = max_cur_page - min_cur_page + 1\n if ref >= 0:\n max_ref_page = min(ref + k, n - 1)\n answer[i] += answer[ref] - max(0, max_ref_page - min_cur_page + 1)\nprint(' '.join(map(str, answer)))\n", "n, k = map(int, input().split())\r\nmx = list(map(int, input().split()))\r\n\r\n\r\ndef mail(mx, mn):\r\n global n\r\n mx, mn = mx + 1, mn + 1\r\n if mx > n:\r\n return 0\r\n mn = min(mn, n)\r\n mx = max(1, mx)\r\n return mn - mx + 1\r\n\r\nmasiv = [0] * n\r\nfor i in range(n):\r\n if mx[i] == 0:\r\n masiv[i] = mail(i - k, i + k)\r\n else:\r\n masiv[i] = masiv[mx[i] - 1] + mail(max(mx[i] - 1 + k + 1, i - k), i + k)\r\nprint(*masiv)", "def read():\r\n return list(map(int,input().split()))\r\nn,k=read()\r\na=read()\r\nb=[min(k,n-1)+1]\r\nfor i in range(1,n):\r\n if a[i]==0:\r\n b.append(min(i,k)+1+min(n-i-1,k))\r\n else:\r\n b.append(b[a[i]-1]-min(k,n-a[i])+min(i-a[i],2*k)+min(n-i-1,k)+1)\r\nprint(*b)\r\n\r\n \r\n \r\n", "n, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\narr = input().split(' ')\r\narr = list(map(lambda x: int(x), arr))\r\n\r\narr_d = [0] * 100005;\r\narr_d_right = [0] * 100005;\r\n\r\ndef count(i, k, n):\r\n # total_count = 0\r\n # while True:\r\n if i - k > 0:\r\n left_ind = i - k\r\n else:\r\n left_ind = 0\r\n \r\n if i + k < n - 1:\r\n right_ind = i + k\r\n else:\r\n right_ind = n - 1 \r\n \r\n #print(arr_d[:n])\r\n #print(arr_d_right[:n])\r\n #print('>>>>>')\r\n next_i = arr[i] - 1\r\n \r\n if next_i != -1:\r\n prev_val = arr_d[next_i]\r\n #print(left_ind, right_ind)\r\n if left_ind <= arr_d_right[next_i]:\r\n left_ind = arr_d_right[next_i] + 1\r\n else:\r\n prev_val = 0\r\n \r\n arr_d[i] = prev_val + right_ind - left_ind + 1\r\n arr_d_right[i] = right_ind\r\n return arr_d[i]\r\n \r\nres_arr = []\r\nfor ind in range(0, len(arr)): \r\n res_arr.append(str(count(ind, k, n)))\r\n \r\nprint(' '.join(res_arr))", "q,w=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\ns=[0 for i in range(0,q+1)]\r\ndef f(q,w,pos):\r\n d=1\r\n if w>=pos:\r\n d+=pos-1\r\n else:\r\n d+=w\r\n if pos>=q-w:\r\n d+=q-pos\r\n else:\r\n d+=w\r\n return d\r\ndef g(q,w,i,j):\r\n ans=w*2-j+i+1\r\n if j-w<=0:\r\n ans-=w-j+1\r\n if i+w>q:\r\n ans-=i+w-q\r\n return ans\r\n \r\nfor i in range(1,q+1):\r\n if a[i]==0:\r\n s[i]=f(q,w,i)\r\n else:\r\n t=i-a[i]\r\n if t>2*w:\r\n s[i]=f(q,w,i)+s[a[i]]\r\n else:\r\n s[i]=s[a[i]]+f(q,w,i)-g(q,w,a[i],i)\r\nprint(*s[1:])", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = [0] * n\nfor i in range(n):\n if a[i] == 0:\n b[i] = min(k,i)\n\nfor i in range(n):\n if a[i] != 0:\n b[i] = b[a[i]-1] + min(2*k, i - a[i]) + 1\nans = [0] * n\n\nfor i in range(n):\n ans[i] = b[i] + min(k, n - i - 1) + 1\n\nprint(*ans)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\ndef len_otr(s, f):\r\n global n\r\n s, f = s + 1, f + 1\r\n if s > n:\r\n return 0\r\n s = max(1, s)\r\n f = min(f, n)\r\n return f - s + 1\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\n if s[i] == 0:\r\n dp[i] = len_otr(i - k, i + k)\r\n else:\r\n ind = s[i] - 1\r\n dp[i] = dp[ind] + len_otr(max(ind + k + 1, i - k), i + k)\r\nprint(*dp)", "n,k = map(int, input().split())\r\na = list(map(int , input().split()))\r\na = [i-1 for i in a]\r\nans = []\r\nfor i in range(n):\r\n if a[i] == -1:\r\n ans.append(1 + min(n-i-1, k) + min(i, k))\r\n else:\r\n ref = a[i]\r\n r1 = min(ref+k, n-1)\r\n r2 = min(i+k, n-1)\r\n l2 = max(i-k, 0)\r\n if l2 > r1:\r\n ans.append(ans[ref] + (r2-l2+1))\r\n else:\r\n ans.append(ans[ref] + (r2-r1))\r\nprint(' '.join([str(i) for i in ans]))", "n, k = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nans = []\r\nb = []\r\nfor i in range(n):\r\n a = max(0, i - k)\r\n b.append(min(n, i + k + 1))\r\n ans.append(b[i] - a)\r\n if L[i] != 0:\r\n ans[i] += ans[L[i] - 1]\r\n if (a < b[L[i] - 1]):\r\n ans[i] -= b[L[i] - 1] - a\r\n print(ans[i], end = ' ')\r\n", "n, k = map(int, input().split())\r\na = [int(i)-1 for i in input().split()]\r\ndp = [0]*n\r\nfor i in range(n):\r\n if a[i] == -1:\r\n dp[i] = 1+min(n-i-1, k)+min(i, k)\r\n else:\r\n dp[i] = min(min(n-1, i+k)-min(n-1, a[i]+k),\r\n 1+min(i, k)+min(n-i-1, k))+dp[a[i]]\r\nprint(*dp)\r\n", "from sys import setrecursionlimit\r\nsetrecursionlimit(10**6)\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsave = [[] for i in range(0, len(a)+1)]\r\n\r\ndef fun(pos):\r\n if save[pos] == []:\r\n left = max(pos-1-k, 0)\r\n right = min(pos+k, len(a))\r\n if a[pos-1] != 0:\r\n new_set=fun(a[pos-1])\r\n if new_set[-1][1]>=left:\r\n new_set[-1]=(new_set[-1][0],right)\r\n else:\r\n new_set.append(tuple([left,right]))\r\n else:\r\n new_set=[tuple([left,right])]\r\n save[pos]=new_set\r\n return new_set.copy()\r\n else:\r\n return save[pos].copy()\r\ndef enc(a):\r\n #print(a)\r\n z=0\r\n for i in a:\r\n z=z+i[1]-i[0]\r\n return z\r\n\r\nfor i in range(1, len(a)+1):\r\n #print(fun(i))\r\n print(enc(fun(i)),end=' ')\r\n", "n, k = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ndp = []\nfor i in range(n):\n res = 0\n if (i == 0):\n res = 1 + min(k, n-1)\n else:\n res = 1 + min(i-1+1, k) + min(k, n-1-i)\n if (a[i] != 0):\n min_i = (i+1) - min(i-1+1, k)\n max_ai = a[i] + min(k, n-1-(a[i]-1))\n res += (dp[a[i] - 1] - max(0, (max_ai - min_i + 1)))\n dp.append(res)\n\nprint(*dp, sep=\" \")", "n, k = tuple(map(int, input().split()))\na = list(map(int, input().split()))\n\ncnt = [None] * n\n\nfor i in range(n):\n if a[i] == 0:\n cnt[i] = min(n - 1, i + k) - max(0, i - k) + 1\n else:\n r = min(n - 1, i + k)\n l = max(a[i] - 1 + k + 1, i - k)\n cnt[i] = cnt[a[i] - 1] + max(0, r - l + 1)\n\nprint(*cnt)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = [0] * n\r\na = [c - 1 for c in a]\r\nfor i in range(0, n):\r\n if a[i] == -1:\r\n d[i] = 1 + min(k, n - i - 1) + min(k, i)\r\n else:\r\n d[i] = 1 + min(k, n - i - 1) + min(k, i) + d[a[i]]\r\n lt = max(i - k, 0)\r\n rt = min(a[i] + k, n - 1)\r\n if lt <= rt:\r\n d[i] -= rt - lt + 1\r\nprint(*d)\r\n", "\ndef solution():\n res = [min(len(mas), _k+1)]\n for i in range(1, len(mas)):\n k_right = min(len(mas)-1, i + _k)\n k_left = max(0, i - _k)\n if mas[i] != 0:\n cross = 0\n k_right_last = min(len(mas)-1, mas[i]-1+_k)\n if k_left <= k_right_last:\n cross = k_right_last - k_left + 1\n res.append(res[mas[i]-1] + (k_right - k_left + 1) - cross)\n else:\n res.append(k_right - k_left + 1)\n return res\n\n\nif __name__ == '__main__':\n _n, _k = map(int, input().rstrip().split())\n mas = [int(x) for x in input().rstrip().split()]\n print(*solution())\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef len_line(q, b, x):\r\n if q > x:\r\n return 0\r\n return min(b + 1, x) - max(1, q + 1) + 1\r\n\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n dp[i] = len_line(i - k, i + k, n)\r\n else:\r\n dp[i] = dp[a[i] - 1] + len_line(max(a[i] + k, i - k), i + k, n)\r\n\r\nprint(*dp)\r\n\r\n# Оо да это код, в котором ни одного варнинга)\r\n", "n,k = map(int,input().split())\r\nli = [0]\r\nli += list(map(int,input().split()))\r\nans = [0]*(n+1)\r\n\r\nfor i in range(1,n+1):\r\n if(li[i] == 0):\r\n ans[i] = min(n,i+k) - max(1,i-k) + 1\r\n else:\r\n if(li[i]+k >= n):\r\n ans[i] = ans[li[i]]\r\n else:\r\n ans[i] = ans[li[i]] + min(min(n,i+k)-min(n,li[i]+k+1)+1,min(n,i+k) - max(1,i-k) + 1)\r\n \r\nprint(*ans[1:],sep=\" \")", "def main():\r\n n, k = map(int, input().split())\r\n b = list(map(int, input().split()))\r\n a = [0] * n\r\n for i in range(n):\r\n l, r = 0, n - 1\r\n a[i] = 0\r\n if b[i]:\r\n l = b[i] + k\r\n a[i] += a[b[i] - 1]\r\n l = max(l, i - k)\r\n r = min(r, i + k)\r\n if r >= l:\r\n a[i] += r - l + 1\r\n\r\n print(' '.join(map(str, a)))\r\n\r\n\r\nmain()\r\n", "def get_border(i, n, k):\n \"\"\"\n Возвращает левую и правую границы (включительно)\n для текущего id с проверкой выхода за пределы массива.\n :param i: текущий id (ref - 1)\n \"\"\"\n left = i - k\n if left < 0:\n left = 0\n right = i + k\n if n <= right:\n right = n - 1\n return [left, right]\n\n\ndef add_border(borders, new_border):\n \"\"\"\n Добавляет текущие границы в общий список границ\n при наличии пересечений - объединяет границы\n \"\"\"\n if not borders:\n borders.append(new_border)\n return\n last_border = borders[-1]\n left = last_border[0]\n new_right = new_border[1]\n new_left = new_border[0]\n if left <= new_right:\n last_border[0] = new_left\n else:\n borders.append(new_border)\n\n\ndef count(borders):\n result = 0\n for border in borders:\n result += border[1] - border[0] + 1 # +1 т.к. границы включительно\n return result\n\n\ndef read(idx):\n borders = []\n i = idx\n border = get_border(idx, n, k)\n while True:\n if i < 0:\n break\n if results[i][0] != -1:\n intersection = results[i][1] - borders[-1][0] + 1\n if intersection < 0:\n intersection = 0\n result = results[i][0] + count(borders) - intersection\n results[idx] = (result, border[1])\n return result\n add_border(borders, get_border(i, n, k))\n i = refs[i] - 1\n result = count(borders)\n results[idx] = (result, border[1])\n return result\n\n\nn = int()\nk = int()\nrefs = []\nresults = []\n\n\ndef main():\n global n, k, refs, results\n n, k = map(lambda s: int(s), input().split())\n refs = list(map(lambda s: int(s), input().split()))\n results = [(-1, -1) for i in range(n)]\n\n for idx in range(n):\n print(read(idx), end=' ')\n print()\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int,input().split())\r\ndp = [0]\r\nbound = [0]\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(1, n+1):\r\n dp.append(dp[a[i-1]])\r\n bound.append(i+k)\r\n t1 = max(bound[a[i-1]]+1, i-k)\r\n t2 = min(i+k, n)\r\n t3 = t2 - t1 + 1\r\n if t3>0: dp[i] += t3\r\n\r\nfor i in range(1, n+1):\r\n print(dp[i],end = ' ')\r\n", "n, k = map(int, input().split(\" \"))\r\nl = list(map(int, input().split(\" \")))\r\ndp = []\r\nfor i, x in enumerate(l):\r\n if x == 0:\r\n z = min(i+k+1, n) - max(0, i-k)\r\n else:\r\n z = dp[x-1] + max(0,min(i+k+1,n)-max(i-k,x+k))\r\n dp.append(z)\r\nprint(*dp)", "n, k = map(int, input().split())\r\nA = map(int, input().split())\r\n\r\nans = [0] * n\r\nfor i, a in enumerate(A):\r\n a -= 1\r\n l, r = max(0, i - k), min(n - 1, i + k)\r\n if a >= 0:\r\n ans[i] += ans[a]\r\n l = max(l, min(n - 1, a + k) + 1)\r\n ans[i] += r - l + 1\r\nprint(' '.join(map(str, ans)))\r\n", "def read_ints():\n return list(map(int, input().split()))\n\nn_messages, n_visible = read_ints()\n\nrefs = read_ints()\n\nNO_REF = -1\n\n# To match indexes in list\nrefs = [i-1 for i in refs]\n\nread = [0] * n_messages\n\ndef messages_seen_at(index):\n return 1 + min(index, n_visible) + min(n_messages - index - 1, n_visible)\n\ndef intersection_seen(index, reference):\n if index <= reference:\n print(\"NOoooooooooo\")\n\n def segment(index):\n return (max(0, index - n_visible), min(reference + n_visible, n_messages - 1))\n\n a, b = segment(reference)\n c, d = segment(index)\n\n return max(b - c + 1, 0)\n\ndef get_read(index):\n if refs[index] == NO_REF:\n read[index] = messages_seen_at(index)\n else:\n reads_by_ref = read[refs[index]]\n read[index] = reads_by_ref + messages_seen_at(index) - intersection_seen(index, refs[index])\n return read[index]\n\nfor i in range(n_messages):\n get_read(i)\n\nprint(' '.join(map(str, read)))", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef main():\n n, k = readline()\n a = readline()\n\n answer = list()\n\n for (i, link) in enumerate(a):\n bottom = max(0, i - k)\n top = min(n, i + k + 1)\n\n if link == 0:\n answer.append(top - bottom)\n else:\n bottom = max(bottom, link + k)\n answer.append(max(0, top - bottom) + answer[link - 1])\n\n print(\" \".join(map(str, answer)))\n\n\nmain()\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = [min(i - 1, k) + 1 + min(n - i, k) for i in range(1, n + 1)]\r\n\r\n# l + 1 + min(n - l, k) - (r - min(r - 1, k)) - число перекрываюихся сообщений\r\n\r\nfor i in range(1, n + 1):\r\n a_ = a[i - 1]\r\n\r\n if a_ != 0:\r\n l, r = sorted([i, a_])\r\n\r\n d1 = ans[a_ - 1]\r\n d2 = max(0, l + 1 + min(n - l, k) - (r - min(r - 1, k)))\r\n\r\n delta = d1 - d2\r\n\r\n ans[i - 1] += delta\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nres = []\r\nfor i, el in enumerate(a, 1):\r\n r = min(n, i+k) - max(1, i-k) + 1\r\n## print(i, el, r)\r\n if el != 0:\r\n r += res[el-1]\r\n rb = max(1, i-k)\r\n lb = min(n, el+k)\r\n if rb <= lb:\r\n r -= lb-rb+1\r\n res.append(r)\r\n## print(res)\r\n\r\nfor el in res:\r\n print(el, end=\" \")\r\n \r\n", "def count_unic_mess(crt, display, array, n, result_arr):\r\n low_bound = 0 if crt - display < 0 else crt - display\r\n\r\n high_bound = n if crt + display + 1 > n else crt + display + 1\r\n\r\n result = high_bound - low_bound\r\n\r\n if array[crt] == 0:\r\n result_arr.append(result)\r\n return result\r\n\r\n ref = array[crt] - 1\r\n high_bound_ref = n if ref + display + 1 > n else ref + display + 1\r\n\r\n if high_bound_ref >= low_bound:\r\n result += result_arr[ref] - high_bound_ref + low_bound\r\n else:\r\n result += result_arr[ref]\r\n\r\n result_arr.append(result)\r\n return result\r\n\r\n\r\nn, k = map(int, input().split(' '))\r\n\r\nlinks = [int(x) for x in input().split(' ')]\r\ncount_arr = []\r\n\r\nfor i in range(n):\r\n print(count_unic_mess(i, k, links, n, count_arr), end=' ')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na[0]=(1+min(k,n-1), min(k,n-1))\r\nfor i in range(1,n):\r\n p=a[i]-1\r\n if p==-1:\r\n a[i]=(1+min(k,i)+min(k,n-i-1), min(k+i, n-1))\r\n continue\r\n ans, l=a[p]\r\n ans+=1+min(k,i)+min(k,n-i-1)\r\n if l>=max(i-k, 0):\r\n ans-=l-max(i-k, 0)+1\r\n a[i]=(ans, min(k+i,n-1))\r\nfor i in range(n):\r\n print(a[i][0], end=' ')", "n, k = map(int, input().split())\r\na = map(int, input().split())\r\nb = [0] * n\r\nfor i, p in enumerate(a):\r\n cur_start = max(0, i - k)\r\n cur_end = min(n - 1, i + k)\r\n if p == 0:\r\n b[i] = cur_end - cur_start + 1\r\n else:\r\n p -= 1\r\n prev_end = min(n-1, p + k)\r\n if cur_start > prev_end:\r\n b[i] = b[p] + cur_end - cur_start + 1\r\n else:\r\n b[i] = b[p] + cur_end - prev_end\r\n\r\nprint(' '.join(map(str, b)))", "n, k = map(int, input().split())\na = [int(i) for i in input().split()]\na.insert(0, 0)\n\ndp = [0 for _ in range(n + 1)]\nfor i in range(1, n + 1):\n p = a[i]\n if p == 0:\n start = max(1, i - k)\n end = min(n, i + k)\n dp[i] = end - start + 1\n else:\n dp[i] = dp[p]\n start = max(p + k + 1, i - k)\n end = min(n, i + k)\n dp[i] += max(0, end - start + 1)\n\nfor i in range(1, n + 1):\n print(dp[i], end=' ')\nprint()\n", "def solve(n, k, links):\r\n\tans = [0] * n\r\n\r\n\tfor t in range(n):\r\n\t\tprevLink = -1\r\n\t\tcurrLink = t\r\n\t\twhile currLink != -1:\r\n\t\t\tprevMin = max(0, prevLink-k)\r\n\t\t\tcurrMin = max(0, currLink-k)\r\n\t\t\tcurrMax = min(n-1, currLink+k)\r\n\r\n\t\t\tif ans[currLink] == 0:\r\n\t\t\t\tans[t] += currMax - currMin + 1\r\n\t\t\t\tif prevLink != -1 and prevMin <= currMax:\r\n\t\t\t\t\tans[t] -= currMax - prevMin + 1\r\n\t\t\t\t\r\n\t\t\t\tprevLink = currLink\r\n\t\t\t\tcurrLink = links[currLink]\r\n\t\t\telse:\r\n\t\t\t\tans[t] += ans[currLink]\r\n\t\t\t\tif prevLink != -1 and prevMin <= currMax:\r\n\t\t\t\t\tans[t] -= currMax - prevMin + 1\r\n\t\t\t\tbreak\r\n\r\n\treturn ' '.join([str(x) for x in ans])\r\n\r\n\r\ndef main():\r\n\tn, k = map(int, input().strip().split())\r\n\tlinks = [int(x)-1 for x in input().strip().split()]\r\n\r\n\tprint(solve(n, k, links)) \r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import sys\ninput = sys.stdin.readline\n\n\ndef solve(n, k, arr):\n messages = [[] for _ in range(n)]\n ans = [0]*n\n for i in range(n):\n if arr[i] == 0:\n a, b = max(0, i-k), min(i+k, n-1)\n ans[i] = b-a+1\n messages[i].append((a, b, b-a+1))\n else:\n a, b, n1 = messages[arr[i]-1][-1]\n c, d = max(0, i-k), min(i+k, n-1)\n if b >= c:\n ans[i] = n1 + d-c+1 - (min(b, d) - max(a, c)+1)\n e, f = a, d\n messages[i].append((a, d, ans[i]))\n else:\n ans[i] = n1 + d-c+1\n messages[i].append((c, d, ans[i]))\n\n print(*ans)\n\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nsolve(n, k, arr)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [-1]*(len(a))\r\nfor i in range(1, n+1):\r\n start = i - k\r\n if start < 1:\r\n start = 1\r\n end = i + k\r\n if end > n:\r\n end = n\r\n\r\n if a[i-1] == 0:\r\n ans[i-1] = end - start + 1\r\n else:\r\n prev = a[i-1]\r\n prev_e = prev + k\r\n if prev_e > n:\r\n prev_e = n\r\n ans[i-1] = ans[prev - 1] + end - start + 1\r\n if prev_e >= start:\r\n ans[i-1] -= prev_e - start + 1\r\nprint(' '.join(map(str, ans)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nd = []\r\nfor i in range(n):\r\n if w[i] == 0:\r\n x = min(k, n-i-1) + min(k, i) + 1\r\n else:\r\n x = min(k, n-i-1) + min(k, i) + 1 + d[w[i]-1]\r\n l = max(i-k, 0)\r\n r = min(w[i]-1 + k, n-1)\r\n if l <= r:\r\n x -= r - l + 1\r\n d.append(x)\r\n\r\nprint(' '.join(map(str, d)))", "n, k = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\n\r\n\r\ndef min_(a, b):\r\n return a if a 0:\r\n x = a[i] - 1\r\n l = max(x - k, 0)\r\n r = min_(x + k, n - 1)\r\n cache[i] += cache[x] - ((r - bounds[i] + 1) if r >= bounds[i] else 0)\r\n bounds[i] = min_(bounds[i], l) if r > bounds[i] else bounds[i]\r\n\r\nprint(' '.join([str(x) for x in cache]))\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * (n)\r\n\r\nfor i, item in enumerate(a):\r\n own_l = max(i - k, 0)\r\n own_r = min(i + k, n - 1)\r\n anc_l = max(item - 1 - k, 0)\r\n anc_r = min(item - 1 + k, n - 1)\r\n if item == 0:\r\n b[i] = own_r - own_l + 1\r\n continue\r\n\r\n if own_l > anc_r:\r\n b[i] = b[item - 1] + own_r - own_l + 1\r\n else:\r\n b[i] = b[item - 1] + own_r - anc_r\r\n\r\nprint(*b)", "def read_line():\r\n return input()\r\n\r\n\r\ndef add_new_messages(current, link, k, n):\r\n minimal = (link + k) if link != 0 else 0\r\n start = (current - k - 1) if current - k > 0 else 0\r\n end = (current + k) if current + k < n else n\r\n new_messages = end - (start if start > minimal else minimal)\r\n return max(new_messages, 0)\r\n\r\n\r\n[n, k] = map(int, read_line().split())\r\n\r\nresult = []\r\nindex = 0\r\n\r\nfor message in read_line().split():\r\n message = int(message)\r\n answer = add_new_messages(index + 1, message, k, n)\r\n if message != 0:\r\n answer += result[message - 1]\r\n result.append(answer)\r\n\r\n index += 1\r\n print(answer, end=' ')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[min(1+k,n)]*n\r\nfor i in range(1,n):\r\n x = a[i] - 1\r\n if x==-1:\r\n b[i]=min(i,k)+1+min(n-i-1,k)\r\n else:\r\n b[i]=b[x]+min(k+1,i-(x+min(k,n-x-1)))+min(n-i-1,k)\r\nprint(*b)", "n,k = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\ndp = [0 for i in range(n)]\r\n\r\n\r\nfor i in range(n):\r\n\r\n\tif l[i] == 0:\r\n\t\tdp[i] = min(i,k) + min(n-i-1,k) + 1\r\n\telse:\r\n\t\tdp[i] = min(i,k) + 1 + min(n-i-1,k) + dp[l[i]-1]\r\n\t\r\n\t\tif i-l[i] < 2*k+1:\r\n\t\t\t\r\n\t\t\tt1 = max(i-k+1,1)\r\n\t\t\tt2 = min(i+k+1,n)\r\n\t\t\tt11 = max(l[i]-k,1)\r\n\t\t\tt12 = min(l[i]+k,n)\r\n\t\t\tdp[i] = dp[i] - (t12 - t1 + 1)\r\n\r\nprint(*dp)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[i] += min(n, i + 1 + k) - max(1, i + 1 - k) + 1\r\n if a[i] != 0:\r\n ans[i] += ans[a[i] - 1] - max(0, min(n, a[i] + k) - max(1, i + 1 - k) + 1)\r\nprint(*ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [0] * n\r\nfor i in range(n):\r\n if a[i] == 0:\r\n s = min(k, i) + 1\r\n else:\r\n s = dp[a[i] - 1] + min(2 * k, i - a[i]) + 1\r\n dp[i] = s\r\nan = []\r\nfor i in range(n):\r\n an.append(str(dp[i] + min(k, n - i - 1)))\r\nprint(\" \".join(an))", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndp=[0]*(n)\r\narr=[el-1 for el in arr]\r\nfor i in range(n):\r\n if arr[i]==-1:\r\n dp[i]=1+min(n-1-i,k)+min(k,i)\r\n else :\r\n dp[i]=dp[arr[i]]+min(1+min(n-1-i,k)+min(i,k),min(n-1,i+k)-min(n-1,arr[i]+k))\r\nprint(*dp)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = [min(1 + k,n)]*n\r\nfor i in range(1,n):\r\n x = l[i] - 1\r\n if x == -1:\r\n s[i] = min(i,k) + 1 + min(n - i - 1,k)\r\n else:\r\n s[i] = s[x] + min(k + 1,i - (x + min(k,n-x - 1))) + min(n - i - 1,k)\r\nprint(*s)", "def intersection(a, b, k, l):\r\n max_limit = min((a + k), l - 1)\r\n min_limit = max((b - k), 0)\r\n return max(max_limit - min_limit + 1, 0)\r\n \r\ndef left_k(i, k):\r\n return k - max(k - i, 0)\r\n\r\ndef right_k(i, k, l):\r\n return k - max(i + 1 + k - l, 0)\r\n\r\ndef window(messages, k):\r\n amounts = []\r\n for message, link in enumerate(messages):\r\n link = link - 1\r\n if link > -1:\r\n inter = intersection(link, message, k, len(messages))\r\n amount = amounts[link] + left_k(message, k) + right_k(message, k, len(messages)) + 1 - inter\r\n else: \r\n amount = left_k(message, k) + right_k(message, k, len(messages)) + 1\r\n amounts.append(amount)\r\n return amounts\r\n\r\nl, k = input().split(\" \")\r\nmessages = input().split(\" \")\r\nanswer = window([int(m) for m in messages], int(k))\r\nprint(\" \".join([str(a) for a in answer]))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ndp =[0]*n\r\ndp[0] = min(m+1,n)\r\nprint(dp[0],end = \" \")\r\nfor i in range(1,n):\r\n if l[i] == 0:\r\n v2 = min(n - 1, i + m)\r\n v1 = max(0, i - m)\r\n dp[i] = v2-v1+1\r\n print(dp[i], end=\" \")\r\n continue\r\n\r\n v2 = min(n-1,i+m)\r\n v1 = max(0,i-m)\r\n v3 = max(0,l[i]-1-m)\r\n v4 = min(n-1,l[i]-1+m)\r\n dp[i] = dp[l[i]-1]+(v2-v1+1)-max(0,min(v2,v4)-max(v1,v3)+1)\r\n print(dp[i], end=\" \")", "n, k = map(int, input().split())\r\nk = min(k, n - 1)\r\na = list(map(lambda x: int(x) - 1, input().split()))\r\nkek = [0 for i in range(n)]\r\nans = [0 for i in range(n)]\r\nfor i in range(n):\r\n if a[i] == -1:\r\n cur_l = max(0, i - k)\r\n cur_r = min(i + k, n - 1)\r\n ans[i] = (i - cur_l) + (cur_r - i) + 1\r\n else:\r\n x = ans[a[i]]\r\n d = (i - a[i] - 1)\r\n if d >= 2 * k:\r\n x += min(k, i) + min(k, n - i - 1) + 1\r\n else:\r\n o = 0\r\n cur_l = max(0, i - k)\r\n cur_r = min(i + k, n - 1)\r\n his_l = min(0, a[i] - k)\r\n his_r = min(a[i] + k, n - 1)\r\n if 2 * k >= d >= k:\r\n o = d - 2 * (k)\r\n elif d == k - 1:\r\n o = (-d - 2)\r\n else:\r\n o = (-(his_r - a[i] + 1)) - (a[i] - cur_l)\r\n #print(d, o, x, i, cur_l, cur_r)\r\n x += (i - cur_l) + (cur_r - i) + 1 + o\r\n ans[i] = x\r\nprint(' '.join(map(str, ans)))" ]

{"inputs": ["6 0\n0 1 1 2 3 2", "10 1\n0 1 0 3 4 5 2 3 7 0", "2 2\n0 1", "1 1\n0", "5 2\n0 1 2 3 1", "30 1\n0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 2 0 0 0 0 0 2 1 0", "100 5\n0 1 1 1 0 5 6 6 8 8 9 11 12 11 8 0 0 14 6 16 7 21 15 23 15 24 0 0 0 28 0 29 26 27 19 0 0 21 37 32 40 30 37 34 39 38 34 38 0 0 41 24 45 47 0 33 46 26 31 0 21 57 57 31 63 63 25 59 65 56 68 0 30 55 55 0 70 43 59 49 59 79 66 74 0 11 65 0 80 63 0 84 73 49 73 81 0 86 76 98", "2 2\n0 0", "2 1\n0 0", "2 1\n0 1", "2 0\n0 0", "2 0\n0 1", "3 0\n0 0 0", "3 0\n0 0 1", "3 0\n0 0 2", "3 0\n0 1 0", "3 0\n0 1 1", "3 0\n0 1 2", "3 1\n0 0 0", "3 1\n0 0 1", "3 1\n0 0 2", "3 1\n0 1 0", "3 1\n0 1 1", "3 1\n0 1 2", "3 2\n0 0 0", "3 2\n0 0 1", "3 2\n0 0 2", "3 2\n0 1 0", "3 2\n0 1 1", "3 2\n0 1 2", "3 3\n0 0 0", "3 3\n0 0 1", "3 3\n0 0 2", "3 3\n0 1 0", "3 3\n0 1 1", "3 3\n0 1 2", "10 3\n0 0 0 0 0 0 0 4 0 4", "20 2\n0 0 0 0 2 1 0 3 0 1 1 11 0 10 0 0 9 17 9 0", "40 0\n0 1 2 3 4 5 0 0 0 0 0 11 12 0 14 10 0 16 15 0 19 21 22 0 23 25 25 24 24 29 29 0 0 31 0 35 31 36 34 29"], "outputs": ["1 2 2 3 3 3 ", "2 3 3 4 5 6 6 6 8 2 ", "2 2 ", "1 ", "3 4 5 5 5 ", "2 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 3 3 3 3 3 6 3 3 3 3 3 6 5 2 ", "6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 11 11 23 22 15 23 24 28 29 30 31 11 11 11 13 11 14 38 18 33 11 11 34 13 22 23 24 17 28 19 42 29 44 11 11 33 40 27 36 11 49 53 42 22 11 34 58 59 22 61 62 41 31 65 60 34 11 24 22 22 11 67 28 33 22 33 36 73 32 11 27 72 11 31 70 11 40 35 22 35 43 9 35 18 35 ", "2 2 ", "2 2 ", "2 2 ", "1 1 ", "1 2 ", "1 1 1 ", "1 1 2 ", "1 1 2 ", "1 2 1 ", "1 2 2 ", "1 2 3 ", "2 3 2 ", "2 3 3 ", "2 3 3 ", "2 3 2 ", "2 3 3 ", "2 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "3 3 3 ", "4 5 6 7 7 7 7 10 5 10 ", "3 4 5 5 7 8 5 10 5 8 8 9 5 12 5 5 10 11 9 3 ", "1 2 3 4 5 6 1 1 1 1 1 2 3 1 2 2 1 3 3 1 4 5 6 1 7 8 8 2 2 3 3 1 1 4 1 2 4 3 5 3 "]}

UNKNOWN

PYTHON3

CODEFORCES

52

d4adf413afcc5e9f6dbc13ec73736099

Vowels

Iahubina is tired of so many complicated languages, so she decided to invent a new, simple language. She already made a dictionary consisting of *n* 3-words. A 3-word is a sequence of exactly 3 lowercase letters of the first 24 letters of the English alphabet (*a* to *x*). She decided that some of the letters are vowels, and all the others are consonants. The whole language is based on a simple rule: any word that contains at least one vowel is correct. Iahubina forgot which letters are the vowels, and wants to find some possible correct sets of vowels. She asks Iahub questions. In each question, she will give Iahub a set of letters considered vowels (in this question). For each question she wants to know how many words of the dictionary are correct, considering the given set of vowels. Iahubina wants to know the *xor* of the squared answers to all the possible questions. There are 224 different questions, they are all subsets of the set of the first 24 letters of the English alphabet. Help Iahub find that number. The first line contains one integer, *n* (1<=≤<=*n*<=≤<=104). Each of the next *n* lines contains a 3-word consisting of 3 lowercase letters. There will be no two identical 3-words. Print one number, the *xor* of the squared answers to the queries. Sample Input 5 abc aaa ada bcd def Sample Output 0

[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\ndp=[0]*(1<<24)\r\ndp[-1]=N\r\nfor _ in range(N):\r\n bit=(1<<24)-1\r\n for a in readline().rstrip():\r\n a=ord(a)-97\r\n if bit&1<<a:\r\n bit^=1<<a\r\n dp[bit]-=1\r\nfor i in range(24):\r\n for bit in range((1<<24)-1,-1,-1):\r\n if not bit&1<<i:\r\n dp[bit]+=dp[bit^1<<i]\r\nans=0\r\nfor x in dp:\r\n ans^=x**2\r\nprint(ans)" ]

{"inputs": ["5\nabc\naaa\nada\nbcd\ndef", "100\namd\namj\natr\nbcp\nbjm\ncna\ncpj\ncse\ndij\ndjp\ndlv\nebk\nedf\nelw\nfbr\nfcl\nfhs\nflo\nfmj\ngcg\ngen\nghg\ngvb\ngxx\nhbe\nhbf\nhgu\nhlv\nhqa\nibg\nifp\nima\nitt\nivl\nixu\njle\njli\nket\nkit\nkws\nlep\nles\nleu\nmbp\nmci\nmdv\nmhf\nmih\nmll\nmop\nndp\nnfs\nngl\nnng\noic\nomo\nooj\noti\npax\npfo\npjd\npup\nqer\nrad\nrdg\nrfq\nrvt\nrwa\nrxj\nshc\nsjv\nswx\ntcu\ntlm\ntmb\ntml\ntmw\ntvr\ntvx\nuid\nuir\nukf\nulg\nvce\nves\nvfb\nvok\nvut\nvvi\nvwb\nwab\nwba\nwdf\nweq\nwog\nwsl\nxbk\nxiq\nxop\nxpp", "100\naip\nbfl\nbld\nblh\nbpk\nbqd\nbtk\ncfu\nciv\nckf\ncog\ncro\nctt\ncve\ncvn\ndlj\neer\negw\negx\nffi\nfld\nggk\ngis\ngkv\ngnq\ngvj\nhdo\nhgf\nhgu\nhjt\nhla\nhni\nhnk\nifa\niir\niml\njfa\njgl\nkbf\nliv\nlqo\nmlw\nmot\nmpx\nnas\nnlo\nobt\nodo\nodx\nolr\nolw\nonc\npac\npdp\nphn\npku\npng\npsd\nptl\npuq\npvk\npvx\nqjj\nqju\nqpf\nqqv\nqsf\nrac\nrgj\nrrg\nsbm\nsdf\nsif\nsil\nsnv\nspt\nsxt\ntou\nttj\nufi\nuht\nujm\null\nupm\nuqf\nvof\nvpq\nwae\nwck\nwed\nwhd\nwjn\nwpp\nwvd\nxbx\nxdv\nxeh\nxmq\nxsm\nxsp", "10\nhjk\nkkw\nmsw\nnht\noqu\npcx\npet\nshd\nutb\nwbw", "20\netf\nffq\ngqe\nhpj\nido\niep\nkbv\nlgs\nlkl\nlvg\nmhs\nocr\nonc\nonv\npmv\nqhk\nrck\nrgj\nsib\nuox", "30\nagf\naov\ncac\ncdq\nclc\ncue\ndmh\ndrr\ndxv\nfrv\njmg\nkih\nkii\nkqm\nkwc\nnri\nohw\nrfk\nrrd\nrrk\ntmp\ntsc\nuhg\nuhx\nujw\nvms\nvrg\nwer\nxml\nxuv", "40\nbhw\nblh\ncal\nccg\ncdd\ncsm\ndir\ndux\nefp\nfnw\ngcr\nhuc\niaf\nipv\niva\niwl\njeb\njwk\nlot\nmcf\nmnk\nnak\nopl\norb\noxj\nqws\nrbl\nsmo\nsuw\nsws\ntgt\numg\nvhn\nvud\nwml\nwqg\nxbv\nxgj\nxlm\nxxv", "50\nagj\nbnk\nbtg\ncqt\ncxs\ndjv\neft\neqt\nfbf\nfbp\nfko\nfrg\ngdb\ngdw\ngie\ngvv\nhdw\nijo\nixc\njif\njph\nkad\nkje\nlel\nles\nlhw\nlkw\nmht\nnii\nnsb\nnuo\nnwp\nolm\nomb\noti\notm\nove\npnl\npqf\npwc\nrfq\nrkl\nsrm\nthb\ntje\ntpw\nugo\nwhk\nwwq\nxpx", "50\naah\naoh\naqc\nauo\ncnk\ndfa\ndok\nfvd\nhxk\nibb\nicl\nigj\nird\njjv\njmv\nkbo\nkgj\nkji\nkxp\nlnf\nlqe\nndq\nnoi\nohh\noro\npdg\npio\npjq\npkw\npsg\npvt\nqdi\nqmo\nrba\nrkh\nrpk\nrrm\nrxs\nssu\ntcn\ntea\ntjb\ntkr\nuuh\nvmn\nvqd\nwaj\nwnl\nwqp\nxtw", "50\nabh\navn\nbrx\ndcp\ndqe\nedr\neub\nfmg\ngda\ngmm\ngpn\nhbd\nhnw\nhta\nhuk\nhun\nieo\nifc\niwn\nixm\njpc\njsr\nkrj\nksc\nlie\nljj\nllb\nlqp\nmap\nmkx\nnob\nogl\nokh\noxq\npqu\npxk\nqfv\nqkt\nrjw\nseu\ntpe\nupe\nvlk\nwbw\nwce\nxae\nxqk\nxsv\nxve\nxvk", "50\nbpx\ncpq\ncqo\ndct\ndhh\ndid\ndlr\ndpl\neie\nesj\nfnc\nfse\nfxp\ngat\nghq\ngmg\nhan\nhdq\nhqn\nhse\nhwt\nibk\njbg\njda\nkgi\nkrr\nkrt\nkvo\nlwe\nmuh\nmve\nnfp\noac\nodw\nofq\npdr\nqlr\nrjm\nsdl\nsfj\nshs\ntae\ntdt\nual\nukf\nuup\nvkw\nvnj\nwbh\nxsp", "50\nbfu\nbqa\ncew\nclt\ncnx\ncor\ncvq\nddq\ndgm\ndme\nehr\neua\newd\nfhq\nhep\nill\njmp\njnc\njng\njts\njtt\njww\nkei\nkjr\nkmk\nkoq\nkxi\nmgu\nnbb\nnqa\nnrp\nntq\nnwg\nost\notf\noxc\npia\nqgo\nqli\nqqa\nrrx\nrug\nsaj\nsjc\ntqm\nvoh\nvoo\nvwd\nwke\nwqg", "100\nacs\nako\naqn\navw\naxm\nbea\nbmw\nbro\nbrw\nbvn\nciv\ncpn\ndas\ndex\ndjo\ndwq\neat\nedq\negu\neqw\nfkt\nflt\nfqv\nfrf\nfwg\ngab\nhcs\nhfw\nhoq\nhwu\nicq\niji\nins\nirs\nivn\njga\njng\nkcq\nkfe\nkox\nkps\nkts\nlmt\nlok\nlvm\nlwt\nmfd\nmlc\nmnm\nmwu\nnad\nnai\nnot\nogr\nope\noqm\nosd\novq\nprj\nqad\nqoh\nqqk\nrnq\nrqx\nrsh\nrug\nrxg\nsar\nsbn\nsbu\nsbw\nseg\nskp\nsqm\nssx\ntoo\nttm\nuch\nuek\nuhm\nuhn\nusv\nvaw\nvcw\nvkm\nvsj\nvwi\nwbm\nwcg\nwqr\nwri\nwsw\nxbs\nxcn\nxhw\nxip\nxoq\nxue\nxuk\nxvg", "100\naie\naoq\nban\nbdw\ncdk\ncgw\ncls\ncoq\ncsp\ncwi\ndmg\negd\negi\nejd\nfbs\nfiv\nfjv\nfrp\nfto\ngcf\ngfb\ngkg\ngvg\nhfe\nhfr\nhgi\nhgx\nhpe\nhwt\nhxn\nibd\nifb\nihu\nipf\niwe\njds\njfe\njkb\njkx\njvq\nkdr\nkjh\nkll\nkog\nltk\nmik\nmsb\nnci\nndl\nnfo\nnfp\nnio\nnkr\nnmi\nnpk\noch\nogx\noka\nolf\nopm\norv\nphm\npmd\npuo\npxq\nqae\nqik\nqlp\nqna\nqst\nqth\nqxm\nrak\nrpj\nrqd\nsbq\nsfv\nstw\ntaj\nteh\ntlw\ntmj\ntmm\ntqv\nujn\nuko\nunb\nuvm\nvdb\nvjd\nvtp\nvvt\nwme\nwnq\nwqs\nwwj\nxan\nxdn\nxjg\nxkd", "100\nahd\nahw\narc\naro\natd\naui\nbas\nbeg\nblc\nbmu\nboo\nbpt\nbqa\ncds\nchn\ncni\ncsh\nddt\ndjb\ndkh\neal\near\necr\neea\nefr\nekf\nekq\netb\neui\nfau\nfcr\nfdc\nfhp\nfpc\nfwv\ngaf\ngoo\ngut\nhek\nheu\nhfq\nhjk\nhjx\nhmk\nhqp\nhsa\niax\nijm\njlf\njlw\njok\njqi\njss\njte\nknb\nkrt\nlbi\nlej\nlqu\nlva\nlxf\nmll\nndb\nndf\nngc\nolh\nope\npds\npli\npuk\nqec\nqgi\nqkr\nqqu\nrks\nrsj\nscb\nsig\nsnj\ntdc\ntpa\ntro\nttc\ntwn\nuef\nuhh\nujb\nujn\nuka\nulk\nuss\nuwa\nuwu\nvmr\nvmt\nvoq\nwug\nwvh\nxef\nxrk", "100\nagg\nals\naxf\nbdd\nbex\nbsx\nchb\nclr\ncmm\ndaf\ndbf\nddw\ndng\nduw\nebp\nech\neex\neff\nefg\neqt\nerp\nexg\nfbd\nffg\nfif\nfta\nghv\ngqn\ngrf\nhcc\nhdc\nhos\nhqh\nims\nipf\niro\nixu\njhx\njil\njqn\njuh\nkeb\nknl\nkol\nksj\nksl\nkxn\nlbn\nlci\nlfr\nliw\nlpc\nmdq\nmhx\nmts\nmwl\nnde\nnik\nnlo\nnnk\nnpc\nntt\nohr\nona\npap\npfb\npgm\npgo\npql\npsd\npvd\nqax\nqcj\nqfj\nqiv\nqke\nqks\nrhu\nrrg\nseo\nskr\ntjp\ntlt\ntof\ntop\ntpn\ntxe\nvfl\nvpn\nvrh\nwbd\nwet\nwgo\nwlm\nwox\nwwi\nxas\nxmg\nxng\nxqj", "100\navm\nbir\nbmx\nbve\nbvx\ncbr\nccq\nckn\ncmd\ncuu\ncxh\nddw\ndfb\ndgt\ndmo\ndqd\neon\nerm\nerp\neux\newl\nfau\nfek\nfss\nftg\nfvb\ngfu\ngkw\nguj\ngwe\nhjf\nhrq\nibk\njjs\njmp\njqs\nkbu\nklu\nkqw\nkqx\nlaa\nlbe\nmek\nmga\nmio\nmle\nmls\nmma\nmoj\nmpb\nmxu\nnfs\nnht\noap\nods\noee\nokc\noqr\npdh\npdt\nphq\nphw\npwa\nqgt\nqji\nqnj\nqqt\nqvu\nqwb\nqwc\nrdv\nrfq\nrnx\nrse\nruq\nrvs\nsoo\nsxe\nthh\ntop\ntrg\ntud\ntur\nugu\nupj\nupt\nvak\nver\nvhu\nvul\nwes\nwkm\nwqc\nwuf\nxbk\nxdf\nxlh\nxnv\nxqo\nxvu"], "outputs": ["0", "13888", "8624", "0", "0", "0", "944", "1184", "2736", "224", "3200", "2432", "7488", "8960", "6624", "13408", "10864"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d4bcfbf18441008f1ac0b108ef216426

Cow Program

Farmer John has just given the cows a program to play with! The program contains two integer variables, *x* and *y*, and performs the following operations on a sequence *a*1,<=*a*2,<=...,<=*a**n* of positive integers: 1. Initially, *x*<==<=1 and *y*<==<=0. If, after any step, *x*<=≤<=0 or *x*<=><=*n*, the program immediately terminates. 1. The program increases both *x* and *y* by a value equal to *a**x* simultaneously. 1. The program now increases *y* by *a**x* while decreasing *x* by *a**x*. 1. The program executes steps 2 and 3 (first step 2, then step 3) repeatedly until it terminates (it may never terminate). So, the sequence of executed steps may start with: step 2, step 3, step 2, step 3, step 2 and so on. The cows are not very good at arithmetic though, and they want to see how the program works. Please help them! You are given the sequence *a*2,<=*a*3,<=...,<=*a**n*. Suppose for each *i* (1<=≤<=*i*<=≤<=*n*<=-<=1) we run the program on the sequence *i*,<=*a*2,<=*a*3,<=...,<=*a**n*. For each such run output the final value of *y* if the program terminates or -1 if it does not terminate. The first line contains a single integer, *n* (2<=≤<=*n*<=≤<=2·105). The next line contains *n*<=-<=1 space separated integers, *a*2,<=*a*3,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=109). Output *n*<=-<=1 lines. On the *i*-th line, print the requested value when the program is run on the sequence *i*,<=*a*2,<=*a*3,<=...*a**n*. Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. Sample Input 4 2 4 1 3 1 2 Sample Output 3 6 8 -1 -1

[ "n = int(input())\r\nt = [0, 0] + list(map(int, input().split()))\r\na, b = [0] * (n + 1), [0] * (n + 1)\r\na[1] = b[1] = -1\r\n \r\ndef f(s, a, b, l):\r\n global t\r\n l.reverse()\r\n j, n = 0, len(l)\r\n while True:\r\n s += t[l[j]]\r\n a[l[j]] = s\r\n j += 1\r\n if j == n: return\r\n s += t[l[j]]\r\n b[l[j]] = s\r\n j += 1\r\n if j == n: return\r\n\r\ndef g(i, k):\r\n global a, b\r\n l = []\r\n if k:\r\n a[i] = -1\r\n l.append(i)\r\n i += t[i]\r\n while True:\r\n if i > n: return f(0, a, b, l) \r\n if b[i] > 0: return f(b[i], a, b, l) \r\n if b[i] == -1: return\r\n b[i] = -1\r\n l.append(i)\r\n i -= t[i]\r\n if i < 1: return f(0, b, a, l)\r\n if a[i] > 0: return f(a[i], b, a, l)\r\n if a[i] == -1: return\r\n a[i] = -1\r\n l.append(i)\r\n i += t[i]\r\n \r\nfor i in range(2, n + 1):\r\n if a[i] == 0: g(i, True) \r\n if b[i] == 0: g(i, False)\r\n\r\nfor i in range(1, n):\r\n if b[i + 1] > 0: t[i] = i + b[i + 1]\r\n else: t[i] = -1\r\n\r\nprint('\\n'.join(map(str, t[1: n])))", "n = int(input())\r\nt = [0, 0]\r\nt += list(map(int, input().split()))\r\nn += 1\r\na = [0] * n\r\nb = [0] * n\r\nn -= 1\r\na[1] = b[1] = -1\r\n\r\n#print(t, a, b)\r\n\r\ndef calc(s, a, b, l):\r\n\tglobal t\r\n\tl.reverse()\r\n\tj = 0\r\n\tn = len(l)\r\n\t\r\n\twhile True:\r\n\t\ts += t[l[j]]\r\n\t\ta[l[j]] = s\r\n\t\tj += 1\r\n\t\tif j == n:\r\n\t\t\treturn\r\n\t\t\r\n\t\ts += t[l[j]]\r\n\t\tb[l[j]] = s\r\n\t\tj += 1\r\n\t\tif j == n:\r\n\t\t\treturn\r\n\r\n\t\t\t\r\ndef calc2(i, k):\r\n\tglobal a, b\r\n\tl = []\r\n\tif k:\r\n\t\ta[i] = -1\r\n\t\tl.append(i)\r\n\t\ti += t[i]\r\n\t\t\r\n\twhile True:\r\n\t\tif i > n:\r\n\t\t\treturn calc(0, a, b, l)\r\n\t\tif b[i] > 0:\r\n\t\t\treturn calc(b[i], a, b, l)\r\n\t\tif b[i] == -1:\r\n\t\t\treturn\r\n\t\tb[i] = -1\r\n\t\tl.append(i)\r\n\t\ti -= t[i]\r\n\t\tif i < 1:\r\n\t\t\treturn calc(0, b, a, l)\r\n\t\tif a[i] > 0:\r\n\t\t\treturn calc(a[i], b, a, l)\r\n\t\tif a[i] == -1:\r\n\t\t\treturn\r\n\t\ta[i] -= 1\r\n\t\tl.append(i)\r\n\t\ti += t[i]\r\n\r\nfor i in range(2, n + 1):\r\n\tif a[i] == 0:\r\n\t\tcalc2(i, True)\r\n\tif b[i] == 0:\r\n\t\tcalc2(i, False)\r\n\r\nfor i in range(1, n):\r\n\tif b[i + 1] > 0:\r\n\t\tt[i] = i + b[i + 1]\r\n\telse:\r\n\t\tt[i] = -1\r\n\r\n#print(t, a, b)\r\n\t\t\r\nprint('\\n'.join(map(str, t[1:n])))" ]

{"inputs": ["4\n2 4 1", "3\n1 2", "5\n2 2 1 3", "2\n1", "8\n7 6 2 6 2 6 6", "8\n4 5 3 2 3 3 3", "3\n1 1", "5\n3 2 4 2", "92\n79 52 17 45 47 64 48 49 650617238 32 9 74 12 80 39 41 73 22 25 73 79 51 85 21 3 56 255371563 2 986959075 17 30 70 577324422 84 7 39 85 18 6 63 44 52 37 5 36 9 12 34 9 60 56 1 491072951 57 7 91 76 88 50 59 6 5 27 80 79279147 67 340148613 82 13 12520473 23 23 39 44 69 83 38 46 26 75 44 30 65 76 56 7 6 2 9 804681590 37", "98\n94 24 17 92 275858941 58 91 57 13 468038892 42 195790073 494005784 8 468106970 518962936 33 27 61 72 42 206673418 10 82 23 34 29 77 90 39 9 67 34 71 29 95 49 48 60 69 86 64 94 77 48 74 19 96700186 5 67 881058074 663483223 64 64 78 23 8 60 7 17 96 71 70 20 5 63 35 34 63 30 86 76 32 86 11 6 96 10 4 37891677 63 58 74 36 20 48 44 93 97 568562143 850624643 55 48 63 59 55 46", "98\n19 32 32 78 52 65 57 90 865825369 956483278 1 44 77 14 72 31 3 92 62 9 20 70 6 73 92 94 47 444654052 31 21298850 68 86 65 23 86 11 72 96 16 61 44 17 83 2 32 90 21 59 95 84 69 35 85 46 82 81 73 49 5 12 73 2 90 87 57 70 21 35 75 13 18 7 28 960620421 31 95865681 36 95 77 26 49 78 36 42 9 65 37 78 904133698 88 55 65 968490755 672903800 47 7 21", "98\n54 88 79 67 72 6 44 71 40 1 76 14 74 8 12 88 36 72 94 97 65 19 95 81 19 22 60 1 20 438323030 97 27 166869403 230316676 482602003 72 47 52 87 48 2 50 28 55 47 25 22 44 40 22 53 41 92 47 1 56 76 82 39 74 85 61 80 52 91 95 55 90 72 27 11 69 59 66 681086671 33 798374266 33 84 768636470 31 68 47 83 14 81 337200269 49 40 8 91 44 48 97 18 26 9", "10\n6 7 5 3 1 5 2 4 6", "8\n6 311942309 3 1 3 2 2", "8\n2 3 1 2 2 3 3", "6\n2 1 2 2 3", "23\n20 1 3 3 13 11 9 7 5 3 1 7 2 4 6 8 10 12 14 16 12 5", "71\n28 11 39 275858941 64 69 66 18 468038892 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 25 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 701366631 51 25 11 11 49 33 67 43 57", "23\n11 6 21 9 13 11 9 7 5 3 1 8 2 4 6 8 10 12 14 935874687 21 1", "71\n2 50 62 41 50 16 65 6 49 47 45 43 41 39 37 35 33 31 29 27 25 23 21 19 17 15 13 11 9 7 5 3 1 26 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 14 6 67 54 54 620768469 637608010 27 54 18 49"], "outputs": ["3\n6\n8", "-1\n-1", "3\n-1\n-1\n-1", "-1", "8\n8\n12\n10\n-1\n-1\n20", "5\n7\n-1\n-1\n-1\n-1\n-1", "-1\n-1", "4\n-1\n7\n-1", "80\n54\n20\n49\n52\n70\n55\n57\n650617247\n42\n129\n86\n283\n94\n54\n57\n90\n40\n44\n93\n100\n73\n108\n135\n202\n82\n255371590\n491073068\n986959104\n236\n319\n102\n577324455\n118\n250\n75\n122\n129\n577324467\n103\n85\n94\n12520617\n650617329\n650617319\n140\n118\n162\n121\n110\n107\n109\n491073004\n111\n491073078\n147\n133\n146\n650617347\n377\n155\n143\n12520735\n144\n79279212\n133\n340148680\n150\n173\n12520543\n491073110\n192\n196\n206\n12520681\n159\n650617395\n194\n491073056\n259\n210\n491073064\n23...", "95\n26\n20\n96\n275858946\n64\n98\n65\n22\n468038902\n53\n195790085\n494005797\n177\n468106985\n518962952\n50\n45\n80\n92\n63\n206673440\n494005817\n106\n106\n60\n56\n105\n119\n69\n206673458\n99\n67\n105\n219\n131\n86\n86\n99\n109\n127\n106\n137\n121\n93\n120\n143\n96700234\n131\n117\n881058125\n663483275\n117\n118\n133\n215\n134\n118\n663483289\n171\n157\n133\n133\n161\n183\n218\n169\n173\n287\n169\n157\n148\n191\n160\n96700328\n112\n173\n122\n-1\n37891757\n219\n222\n206673588\n96700306\n209\n-1\n225\n181...", "20\n34\n35\n82\n57\n71\n64\n98\n865825378\n956483288\n956483290\n56\n90\n-1\n87\n47\n444654086\n110\n81\n74\n114\n92\n86\n97\n117\n120\n74\n444654080\n60\n21298880\n99\n118\n98\n102\n121\n139\n109\n134\n92\n101\n85\n151\n126\n114\n342\n136\n162\n107\n144\n134\n120\n144\n138\n190\n137\n137\n130\n865825476\n110\n131\n134\n140\n153\n151\n212\n136\n178\n168\n144\n156\n174\n136\n95865903\n960620495\n198\n95865757\n95865847\n173\n256\n152\n216\n-1\n240\n194\n95865775\n215\n208\n956483444\n904133787\n278\n272\n96...", "55\n90\n82\n71\n77\n-1\n51\n79\n49\n-1\n87\n26\n87\n42\n-1\n104\n53\n90\n113\n117\n86\n-1\n118\n105\n64\n200\n87\n337200358\n-1\n438323060\n128\n798374397\n166869436\n230316710\n482602038\n108\n84\n90\n126\n88\n130\n92\n143\n99\n92\n798374555\n143\n244\n-1\n-1\n104\n337200438\n145\n198\n103\n-1\n133\n140\n195\n134\n146\n225\n143\n304\n156\n161\n310\n158\n141\n210\n156\n-1\n-1\n295\n681086746\n222\n798374343\n-1\n163\n768636550\n-1\n-1\n202\n269\n-1\n798374505\n337200356\n224\n-1\n166\n-1\n-1\n-1\n191\n7983...", "7\n9\n8\n-1\n-1\n-1\n-1\n-1\n-1", "7\n311942311\n-1\n311942323\n311942317\n311942321\n12", "3\n5\n-1\n-1\n-1\n-1\n-1", "3\n-1\n-1\n-1\n-1", "21\n-1\n-1\n-1\n18\n17\n16\n-1\n26\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n48\n-1\n37", "29\n13\n42\n275858945\n69\n75\n73\n26\n468038901\n59\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n-1\n-1\n113\n468038935\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n701366692\n-1\n-1\n111\n114\n-1\n-1\n-1\n-1\n-1", "12\n8\n24\n13\n18\n17\n16\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n-1\n935874707\n-1\n44", "3\n52\n65\n45\n55\n22\n72\n801\n58\n57\n56\n55\n54\n53\n52\n51\n50\n49\n48\n47\n46\n45\n831\n1067\n87\n1147\n891\n671\n487\n339\n227\n151\n111\n105\n109\n117\n129\n145\n165\n189\n217\n249\n285\n325\n369\n417\n469\n525\n585\n649\n717\n789\n865\n945\n1029\n1117\n1209\n1305\n1405\n543\n109\n129\n1413\n1317\n620768534\n637608076\n843\n973\n121\n515"]}

UNKNOWN

PYTHON3

CODEFORCES

2

d4c9f2251593a3c8a9c4136b405c21e0

Runner's Problem

You are running through a rectangular field. This field can be represented as a matrix with 3 rows and *m* columns. (*i*,<=*j*) denotes a cell belonging to *i*-th row and *j*-th column. You start in (2,<=1) and have to end your path in (2,<=*m*). From the cell (*i*,<=*j*) you may advance to: - (*i*<=-<=1,<=*j*<=+<=1) — only if *i*<=><=1, - (*i*,<=*j*<=+<=1), or - (*i*<=+<=1,<=*j*<=+<=1) — only if *i*<=<<=3. However, there are *n* obstacles blocking your path. *k*-th obstacle is denoted by three integers *a**k*, *l**k* and *r**k*, and it forbids entering any cell (*a**k*,<=*j*) such that *l**k*<=≤<=*j*<=≤<=*r**k*. You have to calculate the number of different paths from (2,<=1) to (2,<=*m*), and print it modulo 109<=+<=7. The first line contains two integers *n* and *m* (1<=≤<=*n*<=≤<=104, 3<=≤<=*m*<=≤<=1018) — the number of obstacles and the number of columns in the matrix, respectively. Then *n* lines follow, each containing three integers *a**k*, *l**k* and *r**k* (1<=≤<=*a**k*<=≤<=3, 2<=≤<=*l**k*<=≤<=*r**k*<=≤<=*m*<=-<=1) denoting an obstacle blocking every cell (*a**k*,<=*j*) such that *l**k*<=≤<=*j*<=≤<=*r**k*. Some cells may be blocked by multiple obstacles. Print the number of different paths from (2,<=1) to (2,<=*m*), taken modulo 109<=+<=7. If it is impossible to get from (2,<=1) to (2,<=*m*), then the number of paths is 0. Sample Input 2 5 1 3 4 2 2 3 Sample Output 2

[ "L = 3\r\nM = 10**9 + 7\r\niden = [[0] * L for _ in range(L)]\r\nfor i in range(L):\r\n iden[i][i] = 1\r\ndef mat_multiply(a, b):\r\n n = len(a)\r\n ret = [[0] * n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % M\r\n return ret\r\ndef vector_matrix_multiply(a, b):\r\n n = len(a)\r\n ret = [0] * n\r\n for j in range(n):\r\n for i in range(n):\r\n ret[j] = (ret[j] + a[i] * b[i][j]) % M\r\n return ret\r\ndef mat_pow(mt, p):\r\n if p == 0:\r\n return iden\r\n ret = mat_pow(mt, p >> 1)\r\n ret = mat_multiply(ret, ret)\r\n if p & 1:\r\n ret = mat_multiply(ret, mt)\r\n return ret\r\ndef make_cur_mat(cnt):\r\n ret = [[0] * L for _ in range(L)]\r\n for i in range(L):\r\n for j in range(L):\r\n if not cnt[i] and abs(i - j) <= 1:\r\n ret[i][j] = 1\r\n return ret\r\ndef main():\r\n n, m = map(int, input().split())\r\n events = {}\r\n for _ in range(n):\r\n a, l, r = map(int, input().split())\r\n a -= 1\r\n if l in events:\r\n events[l].append((0, a))\r\n else:\r\n events[l] = [(0, a)]\r\n if r + 1 in events:\r\n events[r + 1].append((1, a))\r\n else:\r\n events[r + 1] = [(1, a)]\r\n prev = 1\r\n dp = [0] * L\r\n dp[1] = 1\r\n cnt = [0] * L\r\n for time, event_list in sorted(events.items()):\r\n cur = time\r\n cur_mt = make_cur_mat(cnt)\r\n cur_mt = mat_pow(cur_mt, cur - prev)\r\n dp = vector_matrix_multiply(dp, cur_mt)\r\n for event in event_list:\r\n open_event, a = event\r\n if open_event:\r\n cnt[a] += 1\r\n else:\r\n cnt[a] -= 1\r\n prev = cur\r\n cur_mt = make_cur_mat(cnt)\r\n cur_mt = mat_pow(cur_mt, m - prev)\r\n dp = vector_matrix_multiply(dp, cur_mt)\r\n print(dp[1])\r\nif __name__ == \"__main__\":\r\n main()# 1692026702.165854", "def matmul(A,B,mod):\r\n res = [[0]*len(B[0]) for _ in [None]*len(A)]\r\n for i, resi in enumerate(res):\r\n for k, aik in enumerate(A[i]):\r\n for j,bkj in enumerate(B[k]):\r\n resi[j] += aik*bkj\r\n resi[j] %= mod\r\n return res\r\n\r\ndef matpow(A,p,mod):\r\n if p%2:\r\n return matmul(A, matpow(A,p-1,mod),mod)\r\n elif p > 0:\r\n b = matpow(A,p//2,mod)\r\n return matmul(b,b,mod)\r\n else:\r\n return [[int(i==j) for j in range(len(A))] for i in range(len(A))]\r\n\r\nfrom collections import defaultdict\r\nmod=10**9+7\r\nn,m=map(int,input().split())\r\nblock=defaultdict(list)\r\ns=set()\r\ns.add(m)\r\nfor i in range(n):\r\n x,l,r=map(int,input().split())\r\n block[l-1].append(x)\r\n block[r].append(-x)\r\n s.add(l-1)\r\n s.add(r)\r\n\r\ns=sorted(list(s))\r\ndp=[[0],[1],[0]]\r\nlast=1\r\nng=[0,0,0]\r\nfor x in s:\r\n d=x-last\r\n mat=[[0]*3 for i in range(3)]\r\n if ng[0]==0:\r\n mat[0][0]=1\r\n mat[0][1]=1\r\n if ng[1]==0:\r\n mat[1][0]=1\r\n mat[1][1]=1\r\n mat[1][2]=1\r\n if ng[2]==0:\r\n mat[2][1]=1\r\n mat[2][2]=1\r\n A=matpow(mat,d,mod)\r\n dp=matmul(A,dp,mod)\r\n for i in block[x]:\r\n if i>0:\r\n ng[i-1]+=1\r\n else:\r\n ng[-i-1]-=1\r\n #print(dp,A)\r\n last=x\r\n\r\nprint(dp[1][0])" ]

{"inputs": ["2 5\n1 3 4\n2 2 3", "50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n1 50 53\n3 80 81\n3 66 70\n2 35 52\n1 63 69\n2 65 87\n3 68 75\n1 33 42\n1 56 90\n3 73 93\n2 20 26\n2 42 80\n2 83 87\n3 99 99\n1 14 79\n2 94 97\n1 66 85\n1 7 73\n1 50 50\n2 16 40\n2 76 94\n1 71 98\n1 99 99\n1 61 87\n3 98 98\n2 11 41\n3 67 78\n1 31 58\n3 81 85\n1 81 94\n3 41 83\n3 46 65\n1 94 94\n3 31 38\n1 19 35\n3 50 54\n3 85 90\n3 47 63\n3 62 87\n1 18 75\n1 30 41", "50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n2 70 88\n2 67 88\n1 9 75\n2 4 50\n2 9 11\n1 77 92\n1 28 58\n1 23 72\n1 24 75\n2 12 50\n1 54 55\n2 45 93\n1 88 93\n2 98 99\n1 40 58\n2 40 42\n1 16 61\n2 94 94\n1 82 86\n2 81 85\n2 46 46\n2 88 97\n2 6 86\n1 30 86\n2 87 96\n1 44 50\n2 43 88\n1 29 98\n1 39 76\n1 78 94\n1 6 69\n2 92 95\n1 40 68\n1 97 99\n1 85 85\n1 69 74\n1 23 51\n1 34 66\n2 70 98\n2 94 97\n1 54 73"], "outputs": ["2", "0", "5"]}

UNKNOWN

PYTHON3

CODEFORCES

2

d4e0927d80d36c92d3c5e2af89871259

Forming Teams

One day *n* students come to the stadium. They want to play football, and for that they need to split into teams, the teams must have an equal number of people. We know that this group of people has archenemies. Each student has at most two archenemies. Besides, if student *A* is an archenemy to student *B*, then student *B* is an archenemy to student *A*. The students want to split so as no two archenemies were in one team. If splitting in the required manner is impossible, some students will have to sit on the bench. Determine the minimum number of students you will have to send to the bench in order to form the two teams in the described manner and begin the game at last. The first line contains two integers *n* and *m* (2<=≤<=*n*<=≤<=100, 1<=≤<=*m*<=≤<=100) — the number of students and the number of pairs of archenemies correspondingly. Next *m* lines describe enmity between students. Each enmity is described as two numbers *a**i* and *b**i* (1<=≤<=*a**i*,<=*b**i*<=≤<=*n*, *a**i*<=≠<=*b**i*) — the indexes of the students who are enemies to each other. Each enmity occurs in the list exactly once. It is guaranteed that each student has no more than two archenemies. You can consider the students indexed in some manner with distinct integers from 1 to *n*. Print a single integer — the minimum number of students you will have to send to the bench in order to start the game. Sample Input 5 4 1 2 2 4 5 3 1 4 6 2 1 4 3 4 6 6 1 2 2 3 3 1 4 5 5 6 6 4 Sample Output 102

[ "import sys\r\nfrom typing import Callable\r\nfrom collections import defaultdict, deque\r\nfrom enum import Enum\r\n\r\nAlGraph = dict[int, list[int]]\r\n\r\n\r\nclass Flags(Enum):\r\n UNVISITED = -1\r\n VISITED = - 2\r\n\r\n\r\ndef flood_fill(graph: AlGraph, node: int, state: list[int], n: int) -> int:\r\n queue: deque[int] = deque()\r\n queue.append(node)\r\n colors: list[int] = [-1] * n\r\n # Init values for root\r\n colors[0] = 1\r\n state[0] = Flags.VISITED.value\r\n\r\n is_bipartite = True\r\n while queue and is_bipartite:\r\n u = queue.popleft()\r\n # Mark as visited\r\n for v in graph[u]:\r\n if Flags.UNVISITED.value == state[v]:\r\n # Mark the node as visited, otherwise another node might put v again in the stack\r\n state[v] = Flags.VISITED.value\r\n colors[v] = 1 - colors[u]\r\n queue.append(v)\r\n else:\r\n # Check that the color is different, if so this g is not bipartite.\r\n # By constrain of the problem, only two ppl can be enemies of each other, so it would\r\n # be impossible to have to odd cycles (not bipartite)\r\n if colors[u] == colors[v]:\r\n # We need this to signal the outer while loop to stop\r\n is_bipartite = False\r\n break\r\n return 0 if is_bipartite else 1\r\n\r\n\r\ndef main():\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n # Build the graph\r\n graph: AlGraph = defaultdict(list)\r\n for i in range(m):\r\n u, v = (int(i) - 1 for i in read().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n state: list[int] = [Flags.UNVISITED.value] * n\r\n\r\n num_of_odd_cycles = 0\r\n for u in range(n):\r\n if Flags.UNVISITED.value == state[u]:\r\n num_of_odd_cycles += flood_fill(graph, u, state, n)\r\n if (n - num_of_odd_cycles) % 2 != 0:\r\n num_of_odd_cycles += 1\r\n print(num_of_odd_cycles)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict as DD\nn,m = map(int, input().split())\nG = DD(list)\nbench = 0\nfor _ in range(m):\n a,b = map(lambda x: int(x)-1, input().split())\n G[a].append(b)\n G[b].append(a)\n\ncolors = dict()\nodds = 0\nfor root in range(n):\n if root in colors:\n continue\n stack = [(root,0)]\n ok = True\n while stack:\n node,col1 = stack.pop()\n col2 = 1 - col1\n colors[node] = col2\n for child in G[node]:\n if child in colors:\n if colors[child] == col2:\n odds += 1\n ok = False\n break\n else:\n continue\n stack.append((child, col2))\n if not ok:\n break\n\n\nprint(odds + (n-odds) % 2)\n", "n,m=map(int,input().split())\na=[[0]*(n+1) for i in range(n+1)]\nfor _ in range(m):\n u,v=map(int,input().split())\n a[u][v]=1\n a[v][u]=1\n\nd=[-1]*(n+1)\n\ndef dfs(i,v):\n d[i]=v\n for j in range(1,n+1):\n if a[i][j] and d[j]==-1:\n dfs(j,1-v)\n\nfor i in range(1,n+1):\n if d[i]==-1:\n dfs(i,1)\nres=0\nfor i in range(1,n+1):\n for j in range(i+1,n+1):\n if a[i][j] and d[i]==d[j]:\n res+=1\nif (n-res)%2:\n print(res+1)\nelse:\n print(res)\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n\r\nn,m=L()\r\na=[[0]*(n+1) for i in range(n+1)]\r\nfor _ in range(m):\r\n u,v=L()\r\n a[u][v]=1\r\n a[v][u]=1\r\n\r\nd=[-1]*(n+1)\r\n\r\ndef dfs(i,v):\r\n d[i]=v\r\n for j in range(1,n+1):\r\n if a[i][j] and d[j]==-1:\r\n dfs(j,1-v)\r\n\r\nfor i in range(1,n+1):\r\n if d[i]==-1:\r\n dfs(i,1)\r\nres=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if a[i][j] and d[i]==d[j]:\r\n res+=1\r\nif (n-res)%2:\r\n print(res+1)\r\nelse:\r\n print(res)\r\n\r\n", "def detect_cycle(node, parent, visited, graph, ref):\n visited.add(node)\n ref[\"count\"] += 1\n for neighbor in graph[node]:\n if neighbor == parent:\n continue\n if neighbor not in visited:\n if detect_cycle(neighbor, node, visited, graph, ref):\n return True\n else:\n return True\n return False\n\n\ndef main():\n n, m = map(int, input().split(\" \"))\n graph = {}\n for i in range(1, n + 1):\n graph[i] = []\n for _ in range(m):\n a, b = map(int, input().split(\" \"))\n graph[a].append(b)\n graph[b].append(a)\n ref = {}\n bench = 0\n visited = set()\n for node in graph:\n ref[\"count\"] = 0\n if node not in visited:\n if detect_cycle(node, None, visited, graph, ref):\n bench += ref[\"count\"] % 2\n bench += ((n - bench) % 2)\n return bench\nprint(main())\n", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\npar = []\r\nlength = [] \r\n\r\ndef find(x): \r\n if par[x] == x:\r\n return x\r\n else:\r\n return find(par[x])\r\n\r\nn, m = iia()\r\nlength = [1] * (n + 1)\r\npar = list(range(0,n+1))\r\nres = 0\r\nfor _ in range(m):\r\n a, b = iia()\r\n x = find(a)\r\n y = find(b)\r\n if x == y and length[y] % 2 != 0:\r\n res += 1\r\n par[x] = par[y]\r\n length[y] += length[x]\r\nif (n - res) % 2 != 0:\r\n res += 1\r\nprint(res)\r\n\r\n\r\n\r\n", "def dfs(s,e,g):\r\n ss.add(s)\r\n if vist[s] :\r\n return \"c\"\r\n vist[s] = True\r\n for i in g[s]:\r\n if i != e:\r\n if dfs(i,s,g) == \"c\":\r\n return \"c\"\r\n return \"p\"\r\nn,m = map(int,input().split())\r\ng = [[]for i in range(n)]\r\nvist = [0 for i in range(n)]\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n a-=1\r\n b-=1\r\n g[a].append(b)\r\n g[b].append(a)\r\nc = 0\r\nt = 0\r\nwhile c < n:\r\n if not vist[c] :\r\n ss = set()\r\n if dfs(c,-1,g) == \"c\":\r\n if len(ss)%2 == 1:\r\n t+=1\r\n c+=1\r\nn-=t\r\nif n%2 == 1:\r\n print(t+1)\r\nelse:\r\n print(t)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef dfs(c_node,p_node,ref,vis):\r\n \r\n if(c_node in vis):\r\n return True\r\n vis.add(c_node)\r\n for ch_node in graph[c_node]:\r\n if(ch_node != p_node):\r\n ref[\"count\"] +=1\r\n if(dfs(ch_node,c_node,ref,vis)):\r\n return True\r\n return False\r\n\r\n\r\nn,m = Iarr()\r\ngraph ={}\r\nfor x in range(n):\r\n graph[x] = []\r\nfor x in range(m):\r\n v1,v2 = Iarr()\r\n graph[v1-1].append(v2-1)\r\n graph[v2-1].append(v1-1)\r\n\r\nans = 0\r\nref = {}\r\nvis = set()\r\n\r\nfor i in range(n):\r\n if i not in vis:\r\n ref[\"count\"] = 0\r\n cycle = dfs(i, None, ref, vis)\r\n\r\n if cycle:\r\n ans += ref[\"count\"] % 2 == 1\r\n\r\nif (n - ans) % 2 == 1:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\nN,M = map(int, input().split())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n a,b = map(int, input().split())\r\n a-=1;b-=1\r\n P[a].append(b)\r\n P[b].append(a)\r\n \r\nseen = [-1]*N\r\n\r\ndef paint(idx):\r\n v = deque([(idx,0)])\r\n while v:\r\n i,d = v.popleft()\r\n if seen[i]!=-1 and seen[i]!=d:\r\n seen[i] = -2\r\n continue\r\n seen[i] = d\r\n \r\n for j in P[i]:\r\n if seen[j]!=-1 and seen[j]!=(d+1)%2:\r\n seen[i] = -2\r\n continue\r\n if seen[j]==-1:\r\n v.append((j,(d+1)%2))\r\n \r\n\r\nfor i in range(N):\r\n if seen[i]==-1:\r\n paint(i)\r\n#print(seen)\r\nC = Counter(seen)\r\nans = C[-2]\r\nif (N-ans)%2:\r\n ans+=1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\ngraph=[[] for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n graph[x-1].append(y-1)\r\n graph[y-1].append(x-1)\r\nvis=[False]*n\r\nc1=0\r\nc2=0\r\n#print(graph)\r\npar=[-1]*n\r\nfor i in range(n):\r\n if vis[i]==False:\r\n x,y=[i],[]\r\n q=[[i,0]]\r\n vis[i]=True\r\n while(q):\r\n h=q.pop()\r\n for j in graph[h[0]]:\r\n if not(vis[j]):\r\n par[j]=h[0]\r\n if h[-1]==1:\r\n q.append([j,0])\r\n x.append(j)\r\n else:\r\n q.append([j,1])\r\n y.append(j)\r\n vis[j]=True\r\n else:\r\n if par[h[0]]!=j:\r\n if h[0] in x and j in x:\r\n x.remove(j)\r\n if h[0] in y and j in y:\r\n y.remove(j)\r\n if c1>c2:\r\n c2+=max(len(x),len(y))\r\n c1+=min(len(x),len(y))\r\n else:\r\n c1+=max(len(x),len(y))\r\n c2+=min(len(x),len(y))\r\nprint(abs(c1-c2)+n-c1-c2)\r\n \r\n \r\n ", "n,x=map(int,input().split())\r\ndic={i:[] for i in range(1,n+1)}\r\nfor i in range(x):\r\n a,b=map(int,input().split())\r\n dic[a].append(b)\r\n dic[b].append(a)\r\ndef dfs(s):\r\n global vis,c,qw\r\n if s in vis:\r\n return\r\n vis.add(s)\r\n c+=1\r\n qw=False\r\n if len(dic[s])==2:\r\n qw=True\r\n for i in dic[s]:\r\n dfs(i)\r\n\r\n\r\nvis=set()\r\nr=0\r\nfor i in dic:\r\n c=0\r\n qw=False\r\n if i not in vis:\r\n dfs(i)\r\n if c%2 and qw:\r\n r+=1\r\nprint(r+((n-r)%2))", "n, m = map(int, input().split())\r\nG = [[] for i in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n G[u].append(v)\r\n G[v].append(u)\r\n\r\ncycle_len, node_count = 0, 0\r\nvisited = [False] * n\r\ndef dfs(u, bef=-1):\r\n global node_count\r\n global cycle_len\r\n\r\n #print(u)\r\n if visited[u]:\r\n if node_count % 2 == 1 and node_count >= 2:\r\n cycle_len = node_count\r\n #print(node_count, cycle_len)\r\n return\r\n\r\n visited[u] = True\r\n node_count += 1\r\n for v in G[u]:\r\n if v != bef:\r\n dfs(v, bef=u)\r\n\r\n node_count -= 1\r\n\r\n#print(G)\r\n\r\nrem = 0\r\nfor i in range(n):\r\n #print('+', i)\r\n if not visited[i]:\r\n node_count = 0\r\n cycle_len = 0\r\n\r\n dfs(i)\r\n if cycle_len > 0:\r\n rem += 1\r\n\r\nif (n - rem) % 2 == 1:\r\n rem += 1\r\n\r\nprint(rem)\r\n", "\r\nn, m = map(int, input().split())\r\nadj_list = [[] for i in range(n)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n adj_list[x-1].append(y-1)\r\n adj_list[y-1].append(x-1)\r\nvisited = [False for i in range(n)]\r\n \r\ndef dfs(cur, par, arr):\r\n arr.add(cur)\r\n if visited[cur]:\r\n return True\r\n \r\n visited[cur] = True\r\n for i in adj_list[cur]:\r\n if i != par:\r\n if dfs(i, cur, arr):\r\n return True\r\n return False\r\n \r\ni = 0\r\nres = 0\r\nwhile i < n:\r\n if not visited[i]:\r\n arr = set()\r\n if dfs(i, -1, arr):\r\n if len(arr) % 2 == 1:\r\n res += 1\r\n i += 1\r\nn -= res\r\nif n % 2 == 1:\r\n print(res + 1)\r\n \r\nelse:\r\n print(res)", "n,m=map(int,input().split())\r\nch=[False for i in range(n)]\r\na=[[]for i in range(n)]\r\nva=[0]\r\ndef dfs(i):\r\n if ch[i]:\r\n return 0\r\n if len(a[i])<2:\r\n va[0]=0\r\n re=0\r\n ch[i]=True\r\n for i in a[i]:\r\n re+=dfs(i)\r\n return re+1\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n a[x - 1].append(y-1)\r\n a[y - 1].append(x-1)\r\nans=0\r\nfor i in range(n):\r\n if not ch[i]:\r\n va[0] = 1\r\n d=dfs(i)\r\n if not(d==1) and d%2==1 and va[0]==1:\r\n ans+=1\r\nprint(ans+(1 if not(n%2==ans%2)else 0))", "n, m = map(int, input().split())\na = [[0] * (n + 1) for i in range(n + 1)]\n\nfor _ in range(m):\n u, v = map(int, input().split())\n a[u][v] = 1\n a[v][u] = 1\n\nd = [-1] * (n + 1)\n\n\ndef dfs(i, v):\n d[i] = v\n for j in range(1, n + 1):\n if a[i][j] and d[j] == -1:\n dfs(j, 1 - v)\n\n\nfor i in range(1, n + 1):\n if d[i] == -1:\n dfs(i, 1)\nres = 0\nfor i in range(1, n + 1):\n for j in range(i + 1, n + 1):\n if a[i][j] and d[i] == d[j]:\n res += 1\n\nif (n - res) % 2:\n print(res + 1)\nelse:\n print(res)", "def dfs(cur_node, parent_node, reference, visited):\r\n if cur_node in visited:\r\n return True\r\n visited.add(cur_node)\r\n for child_node in graph[cur_node]:\r\n if child_node != parent_node:\r\n reference[\"count\"] += 1\r\n if dfs(child_node, cur_node, reference, visited):\r\n return True\r\n return False\r\n\r\n\r\n# Getting the input in\r\nn, m = [int(i) for i in input().split(\" \")]\r\ngraph = {}\r\n# initializing all vertices to not visited\r\n# Creating Adjacency list representation\r\n# for the graph\r\nfor i in range(n):\r\n graph[i] = []\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split(\" \")]\r\n x -= 1\r\n y -= 1\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\n#######################################\r\nto_remove = 0\r\nreference = {}\r\nvisited = set()\r\n\r\nfor i in range(0, n):\r\n if i not in visited:\r\n reference[\"count\"] = 0\r\n cycle = dfs(i, None, reference, visited)\r\n\r\n if cycle:\r\n to_remove += reference[\"count\"] % 2 == 1\r\n\r\nif (n - to_remove) % 2 == 1:\r\n to_remove += 1\r\n\r\nprint(to_remove)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef dfs(node, parent, visited, cnt):\r\n if visited[node] == visited[parent]:\r\n # print(node, parent , 'jdfcbedkjfner')\r\n cnt += 1\r\n return cnt\r\n elif visited[node] != -1:\r\n return cnt\r\n\r\n # print(node)\r\n visited[node] = 1 - visited[parent]\r\n for v in graph[node]:\r\n if v != parent:\r\n # print(v, node)\r\n # print('v', v ,'parent', parent, 'cur', v)\r\n cnt = dfs(v, node, visited, cnt)\r\n return cnt\r\n\r\nn,m = map(int, input().split())\r\nvisited = [-1] * (n+1)\r\nvisited.append(1)\r\ngraph = {}\r\nfor i in range(n):\r\n graph[i+1] = []\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n if visited[i] == -1:\r\n cnt = dfs(i, -1, visited, cnt)\r\n\r\nans = cnt//2\r\nif n-ans & 1:\r\n ans +=1\r\nprint(ans)", "import sys\r\n\r\n\r\ndef solve():\r\n n, e = list(map(int, sys.stdin.readline().split()))\r\n enemies = []\r\n for _ in range(n + 1):\r\n enemies.append([])\r\n\r\n for _ in range(e):\r\n f, s = list(map(int, sys.stdin.readline().split()))\r\n enemies[f].append(s)\r\n enemies[s].append(f)\r\n\r\n print(enemies, file=sys.stderr)\r\n\r\n ans = 0\r\n for i in range(1, n + 1):\r\n print(file=sys.stderr)\r\n if len(enemies[i]) == 0:\r\n continue\r\n ans += follow(i, enemies, i) % 2\r\n return ans + (n - ans) % 2\r\n\r\n\r\ndef follow(i, enemies, t, depth = 0):\r\n depth += 1\r\n print(i, end=\" \", file=sys.stderr)\r\n if len(enemies[i]) == 0:\r\n return 0\r\n j = enemies[i].pop()\r\n if i in enemies[j]:\r\n enemies[j].remove(i)\r\n if j == t:\r\n return depth\r\n return follow(j, enemies, t, depth)\r\n\r\n\r\nprint(solve())\r\n", "def adj_list(nodes,edges):\r\n graph=[[] for i in range(nodes)]\r\n for edge in range(edges):\r\n a, b = map(int, input().split())\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n return graph\r\n\r\nnodes, edges = map(int, input().split())\r\ngraph=adj_list(nodes,edges)\r\nvisited=[False for i in range(nodes)]\r\n\r\ndef dfs(cur, par, arr):\r\n arr.add(cur)\r\n if visited[cur]:\r\n return True\r\n visited[cur] = True\r\n for i in graph[cur]:\r\n if i != par:\r\n if dfs(i, cur, arr):\r\n return True\r\n return False\r\ni = 0\r\nres = 0\r\n\r\nwhile i < nodes:\r\n if not visited[i]:\r\n arr = set()\r\n if dfs(i, -1, arr):\r\n if len(arr) % 2 == 1:\r\n res += 1\r\n i += 1\r\nnodes -= res\r\nif nodes % 2 == 1:\r\n print(res + 1)\r\nelse:\r\n print(res)", "import pdb\n\ndef correct_colouring(x0, edges, visited, colouring):\n s = [x0]\n visited[x0] = True\n colouring[x0] = 1\n while s:\n x = s.pop()\n for neigh in edges[x]:\n if not visited[neigh]:\n visited[neigh] = True\n colouring[neigh] = -colouring[x]\n s.append(neigh)\n elif colouring[neigh] == colouring[x]:\n return False\n return True\n\ndef solve():\n n, m = map(int, input().split())\n edges = [[] for _ in range(n+1)]\n for _ in range(m):\n i, j = map(int, input().split())\n edges[i].append(j)\n edges[j].append(i)\n visited = [False for _ in range(n+1)]\n colouring = [0 for _ in range(n+1)]\n removed = 0\n for x0 in range(1, n+1):\n if not visited[x0]:\n correct = correct_colouring(x0, edges, visited, colouring) \n if not correct:\n removed += 1\n if (n - removed)% 2:\n removed += 1\n print(removed) \n\nif __name__ == '__main__':\n solve()\n", "from collections import defaultdict\r\nn , m = map(int, input().split())\r\ngraph = defaultdict(list)\r\nis_vis = [False] * (n+1)\r\nsol =0\r\ndef dfs(node, par, path):\r\n if is_vis[node]:\r\n return path % 2 != 0\r\n\r\n is_vis[node] = True\r\n\r\n for sub_node in graph[node]:\r\n if sub_node != par:\r\n path += 1\r\n\r\n if dfs(sub_node, node, path):\r\n return 1\r\n\r\n return 0\r\n\r\n\r\nfor i in range(0, m):\r\n l , r = map(int, input().split())\r\n graph[l].append(r)\r\n graph[r].append(l)\r\n\r\nfor key in graph.keys():\r\n if not is_vis[key]:\r\n sol += dfs(key, -1, 0)\r\n\r\nprint(sol + ((n-sol) % 2 != 0))", "from collections import defaultdict\nn, m = map(int, input().split())\ngraph = defaultdict(list)\nfor _ in range(m):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n graph[a].append(b)\n graph[b].append(a)\n\ncolors = [-1 for _ in range(n)]\ndef dfs(node, graph, vis, color):\n global flag\n colors[node] = color^1\n for neighbor in graph[node]:\n if colors[neighbor] != -1:\n if colors[neighbor] == colors[node]:\n flag = True \n return\n else:\n dfs(neighbor, graph, colors, colors[node])\n\ncnt = 0\nflag = False\nfor i in range(n):\n if colors[i] == -1:\n dfs(i, graph, colors, 1)\n if flag:\n cnt += 1\n flag = False\n\nif (n - cnt) % 2 == 0:\n print(cnt)\nelse:\n print(cnt + 1)\n \n \n \n \n\n", "def Dfs(node):\r\n global nodesVisted\r\n global result\r\n visitedNodes[node]=True\r\n nodesVisted+=1\r\n if(len(archenemies[node])==2):\r\n leftN,rightN=archenemies[node][0],archenemies[node][1]\r\n if(visitedNodes[leftN]&visitedNodes[rightN]):\r\n if(nodesVisted%2==1):\r\n result+=1\r\n return\r\n if(not visitedNodes[leftN]):\r\n Dfs(leftN)\r\n if(not visitedNodes[rightN]):\r\n Dfs(rightN)\r\n return\r\nn,m=list(map(int,input().split(\" \")))\r\narchenemies=[[] for i in range(n+1)]\r\nresult=0\r\nnodesVisted=0\r\nvisitedNodes=[False for k in range(n+1)]\r\nfor i in range(m):\r\n ai,bi=list(map(int,input().split(\" \")))\r\n archenemies[ai].append(bi)\r\n archenemies[bi].append(ai)\r\nfor i in range(1,n+1):\r\n if((not visitedNodes[i])&(len(archenemies[i])==2)):\r\n nodesVisted=0\r\n Dfs(i)\r\nif((n-result)%2!=0):\r\n result+=1\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\r\nseen = [0] * (n+1)\r\ncounter = 1\r\nadj = [[]]\r\nfor i in range(n): adj.append([])\r\n\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\n\r\nvisited = [False] * (n+1)\r\ncycles = 0\r\ndef dfs(v, p):\r\n global counter, cycles\r\n \r\n visited[v] = True\r\n for child in adj[v]:\r\n if not visited[child]:\r\n seen[child] = counter\r\n counter += 1\r\n dfs(child, v)\r\n else:\r\n if child != p and (seen[child] - seen[v]) % 2 == 0:\r\n cycles += 1\r\n \r\n\r\nfor i in range(1, n+1):\r\n if not visited[i]:\r\n seen[i] = counter\r\n counter += 1\r\n dfs(i, 0)\r\n \r\ncycles = cycles//2\r\nif (n - cycles) % 2 == 0:\r\n print(cycles)\r\nelse:\r\n print(cycles + 1)", "from collections import defaultdict\r\nfrom sys import exit\r\nclass Graph:\r\n def __init__(self,n):\r\n self.adj=defaultdict(list)\r\n self.V=n\r\n self.visited=list()\r\n self.va=[0]\r\n def add_edge(self,x,y):\r\n self.adj[x].append(y)\r\n self.adj[y].append(x)\r\n def dfs(self,i):\r\n if i in self.visited:\r\n return 0\r\n if len(self.adj[i])<2:\r\n self.va[0]=0\r\n comp=0\r\n self.visited.append(i)\r\n for i in self.adj[i]:\r\n comp+=self.dfs(i)\r\n return comp+1\r\n def dfs_main(self):\r\n ans=0\r\n for i in range(1,self.V+1):\r\n if i not in self.visited:\r\n self.va[0] = 1\r\n components=self.dfs(i)\r\n if components!=1 and components%2==1 and self.va[0]==1:\r\n ans+=1\r\n if(self.V%2!=ans%2):ans+=1\r\n print(ans)\r\nn,m=map(int,input().split())\r\ng=Graph(n)\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n g.add_edge(x,y)\r\ng.dfs_main()", "def readInts(): return map(int, input().split())\r\n\r\n\r\ndef dfs(g, seen, i):\r\n if i in seen:\r\n return 0,0\r\n seen.add(i)\r\n nodes = 1\r\n edges = len(g[i])\r\n for j in g[i]:\r\n x, y = dfs(g, seen, j)\r\n nodes += x\r\n edges += y\r\n return nodes, edges\r\n\r\ndef solve():\r\n line0 = []\r\n try: line0 = readInts()\r\n except EOFError: return False\r\n n, m = line0\r\n \r\n g = {}\r\n seen = set()\r\n for i in range(1,n+1):\r\n g[i] = set()\r\n \r\n for _ in range(m):\r\n a,b = readInts()\r\n g[a].add ( b )\r\n g[b].add ( a )\r\n \r\n ans = 0\r\n for i in range(1,n+1):\r\n if i not in seen:\r\n nodes, edges = dfs(g,seen,i)\r\n if nodes > 1 and nodes%2 == 1 and 2*nodes == edges:\r\n ans += 1\r\n \r\n if (n-ans)%2 == 1:\r\n ans += 1\r\n print ( ans )\r\n return True\r\n\r\nwhile solve(): pass\r\n", "\"\"\"\n reading 8:59 -> 9:02\n thinking 9:30 -> 10:00\n thinking 8:37 -> 8:46\n coding 8:46 -> 9:50\n thinking 9:16 -> 10:00\n coding 8:50 -> 9:25\n reading 9:30 -> 9:32\n thinking 9:39 -> 9:44\n thinking 9:20 -> 10:01\n coding 9:01 -> 10:00\n coding 8:15 -> 8:30\n thinking 8:38 -> 9:58\n coding 9:13 -> 10:00\n coding 3:20 -> 4:10\n thinking 4:22 ->\n\"\"\"\nfrom collections import defaultdict\nfrom enum import Enum\n\nclass Color(Enum):\n GRAY = -1\n BLACK = 0\n WHITE = 1\n\nclass Graph:\n \"\"\"Graph class\"\"\"\n\n # Constructor\n def __init__(self):\n # default dictionary to store graph\n self.graph = defaultdict(lambda: dict(neighbors=[], color=Color.GRAY))\n self.number = 0\n self.ans = 0\n\n # Function to add an edge to graph\n def add_node(self, node, neighbor):\n \"\"\"Adds a node with its neighbor\"\"\"\n self.graph[node][\"neighbors\"].append(neighbor)\n self.graph[neighbor][\"neighbors\"].append(node)\n\n def rm_node(self, node):\n \"\"\"Removes a node\"\"\"\n for neighbor in self.graph[node][\"neighbors\"]:\n self.graph[neighbor][\"neighbors\"].remove(node)\n self.graph.pop(node)\n\n # A function used by DFS\n def dfs_util(self, neighbor, visited):\n \"\"\"Utility function\"\"\"\n # Mark the current node as visited and print it\n visited.add(neighbor)\n # print(f'nodo = {v}', end=' ')\n # recur for all the vertices adjacent to this vertex\n # #breakpoint()\n for neighbour in self.graph[neighbor][\"neighbors\"]:\n # print(f'vecino = {neighbour}')\n if neighbour not in visited:\n self.dfs_util(neighbour, visited)\n\n # The function to do DFS traversal. It uses recursive DFS_util\n\n def dfs(self):\n \"\"\"DFS function\"\"\"\n # create a set to store all visited vertices\n visited = set()\n # call the recursive helper function to print DFS traversal starting\n # from all vertices one by one\n for vertex in list(self.graph):\n if vertex not in visited:\n self.dfs_util(vertex, visited)\n\n #FIXME\n def is_biparted(self):\n \"\"\"Returns false if its not biparted, return true otherwise\"\"\"\n #breakpoint()\n for node in self.graph.keys():\n if self.graph[node][\"color\"] == Color.GRAY:\n if(not self.set_color(node, Color.BLACK)):\n self.rm_node(node)\n self.unset_color()\n return False\n\n return True\n\n def set_color(self, node, color):\n #breakpoint()\n self.graph[node][\"color\"] = color\n other_color = Color.BLACK if color == Color.WHITE else Color.WHITE\n for neighbor in self.graph[node][\"neighbors\"]:\n if self.graph[neighbor][\"color\"] == Color.GRAY:\n if self.set_color(neighbor, other_color) == False:\n return False\n\n else:\n if self.graph[neighbor][\"color\"] == color:\n return False\n return True\n\n def unset_color(self):\n for node in self.graph.keys():\n self.graph[node][\"color\"] = Color.GRAY\n\n\n# TODO(22/08/21): Contar los vecinos problemáticos\n# NOTE(23/08/21, CESAR): Lo de arriba ya se pensó, falta implementarlo.\n# NOTE(22/08/21, CESAR): No se pudo\n# NOTE(23/08/21, CESAR): Sí se puede\n# NOTE(31/08/21, CESAR): El de arriba miente\n# NOTE(01/09/21, CESAR): El de arriba dice la verdad\n\ndef main():\n n, m = map(int, input().split())\n g = Graph()\n for i in range(m):\n a, b = map(int, input().split())\n g.add_node(a, b)\n #breakpoint()\n while not(g.is_biparted()):\n g.ans += 1\n\n if (n - g.ans) % 2 == 1:\n print(g.ans + 1)\n else:\n print(g.ans)\n\nmain()\n", "n,m=map(int,input().split())\r\na=[[0]*(n+1) for i in range(n+1)]\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n a[u][v]=1\r\n a[v][u]=1\r\n \r\nd=[-1]*(n+1)\r\n \r\ndef dfs(i,v):\r\n d[i]=v\r\n for j in range(1,n+1):\r\n if a[i][j] and d[j]==-1:\r\n dfs(j,1-v)\r\n \r\nfor i in range(1,n+1):\r\n if d[i]==-1:\r\n dfs(i,1)\r\nres=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if a[i][j] and d[i]==d[j]:\r\n res+=1\r\nif (n-res)%2:\r\n print(res+1)\r\nelse:\r\n print(res)\r\n" ]

{"inputs": ["5 4\n1 2\n2 4\n5 3\n1 4", "6 2\n1 4\n3 4", "6 6\n1 2\n2 3\n3 1\n4 5\n5 6\n6 4", "5 1\n1 2", "8 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 1", "28 3\n15 3\n10 19\n17 25", "2 1\n1 2", "3 1\n2 3", "3 2\n1 2\n3 2", "3 3\n1 2\n1 3\n2 3", "4 1\n1 4", "4 2\n4 1\n2 1", "4 3\n1 3\n3 2\n2 4", "4 3\n3 2\n4 2\n4 3", "5 3\n4 2\n3 4\n5 1", "10 7\n8 9\n3 6\n2 4\n4 1\n1 3\n2 7\n7 10", "29 20\n15 9\n21 15\n14 12\n12 16\n3 28\n5 13\n19 1\n19 21\n23 17\n27 9\n26 10\n20 5\n8 16\n11 6\n4 22\n29 22\n29 11\n14 17\n28 6\n1 23", "68 50\n10 9\n28 25\n53 46\n38 32\n46 9\n35 13\n65 21\n64 1\n15 52\n43 52\n31 7\n61 67\n41 49\n30 1\n14 4\n17 44\n25 7\n24 31\n57 51\n27 12\n3 37\n17 11\n41 16\n65 23\n10 2\n16 22\n40 36\n15 51\n58 44\n61 2\n50 30\n48 35\n45 32\n56 59\n37 49\n62 55\n62 11\n6 19\n34 33\n53 66\n67 39\n47 21\n56 40\n12 58\n4 23\n26 42\n42 5\n60 8\n5 63\n6 47", "89 30\n86 72\n43 16\n32 80\n17 79\n29 8\n89 37\n84 65\n3 41\n55 79\n33 56\n60 40\n43 45\n59 38\n26 23\n66 61\n81 30\n65 25\n13 71\n25 8\n56 59\n46 13\n22 30\n87 3\n26 32\n75 44\n48 87\n47 4\n63 21\n36 6\n42 86", "100 1\n3 87", "100 10\n88 82\n5 78\n66 31\n65 100\n92 25\n71 62\n47 31\n17 67\n69 68\n59 49", "100 50\n82 99\n27 56\n74 38\n16 68\n90 27\n77 4\n7 88\n77 33\n25 85\n18 70\n50 7\n31 5\n21 20\n50 83\n55 5\n46 83\n55 81\n73 6\n76 58\n60 67\n66 99\n71 23\n100 13\n76 8\n52 14\n6 54\n53 54\n88 22\n12 4\n33 60\n43 62\n42 31\n19 67\n98 80\n15 17\n78 79\n62 37\n66 96\n40 44\n37 86\n71 58\n42 92\n8 38\n92 13\n73 70\n46 41\n30 34\n15 65\n97 19\n14 53", "10 9\n5 10\n3 2\n8 6\n4 5\n4 10\n6 1\n1 8\n9 2\n3 9", "50 48\n33 21\n1 46\n43 37\n1 48\n42 32\n31 45\n14 29\n34 28\n38 19\n46 48\n49 31\n8 3\n27 23\n26 37\n15 9\n27 17\n9 35\n18 7\n35 15\n32 4\n23 17\n36 22\n16 33\n39 6\n40 13\n11 6\n21 16\n10 40\n30 36\n20 5\n24 3\n43 26\n22 30\n41 20\n50 38\n25 29\n5 41\n34 44\n12 7\n8 24\n44 28\n25 14\n12 18\n39 11\n42 4\n45 49\n50 19\n13 10", "19 16\n2 16\n7 10\n17 16\n17 14\n1 5\n19 6\n11 13\n15 19\n7 9\n13 5\n4 6\n1 11\n12 9\n10 12\n2 14\n4 15", "70 70\n27 54\n45 23\n67 34\n66 25\n64 38\n30 68\n51 65\n19 4\n15 33\n47 14\n3 9\n42 29\n69 56\n10 50\n34 58\n51 23\n55 14\n18 53\n27 68\n17 6\n48 6\n8 5\n46 37\n37 33\n21 36\n69 24\n16 13\n50 12\n59 31\n63 38\n22 11\n46 28\n67 62\n63 26\n70 31\n7 59\n55 52\n28 43\n18 35\n53 3\n16 60\n43 40\n61 9\n20 44\n47 41\n35 1\n32 4\n13 54\n30 60\n45 19\n39 42\n2 20\n2 26\n52 8\n12 25\n5 41\n21 10\n58 48\n29 11\n7 56\n49 57\n65 32\n15 40\n66 36\n64 44\n22 57\n1 61\n39 49\n24 70\n62 17", "33 33\n2 16\n28 20\n13 9\n4 22\n18 1\n6 12\n13 29\n32 1\n17 15\n10 7\n6 15\n16 5\n11 10\n31 29\n25 8\n23 21\n14 32\n8 2\n19 3\n11 4\n21 25\n31 30\n33 5\n26 7\n27 26\n27 12\n30 24\n33 17\n28 22\n18 24\n19 9\n3 23\n14 20", "10 8\n8 3\n9 7\n6 1\n10 9\n2 6\n2 1\n3 4\n4 8", "20 12\n16 20\n8 3\n20 5\n5 10\n17 7\n13 2\n18 9\n17 18\n1 6\n14 4\n11 12\n10 16", "35 21\n15 3\n13 5\n2 28\n26 35\n9 10\n22 18\n17 1\n31 32\n35 33\n5 15\n14 24\n29 12\n16 2\n14 10\n7 4\n29 4\n23 27\n30 34\n19 26\n23 11\n25 21", "49 36\n17 47\n19 27\n41 23\n31 27\n11 29\n34 10\n35 2\n42 24\n19 16\n38 24\n5 9\n26 9\n36 14\n18 47\n28 40\n45 13\n35 22\n2 15\n31 30\n20 48\n39 3\n8 34\n36 7\n25 17\n5 39\n29 1\n32 33\n16 30\n38 49\n25 18\n1 11\n7 44\n12 43\n15 22\n49 21\n8 23", "77 54\n18 56\n72 2\n6 62\n58 52\n5 70\n24 4\n67 66\n65 47\n43 77\n61 66\n24 51\n70 7\n48 39\n46 11\n77 28\n65 76\n15 6\n22 13\n34 75\n33 42\n59 37\n7 31\n50 23\n28 9\n17 29\n1 14\n11 45\n36 46\n32 39\n59 21\n22 34\n53 21\n29 47\n16 44\n69 4\n62 16\n36 3\n68 75\n51 69\n49 43\n30 55\n40 20\n57 60\n45 3\n38 33\n49 9\n71 19\n73 20\n48 32\n63 67\n8 54\n42 38\n26 12\n5 74", "93 72\n3 87\n88 60\n73 64\n45 35\n61 85\n68 80\n54 29\n4 88\n19 91\n82 48\n50 2\n40 53\n56 8\n66 82\n83 81\n62 8\n79 30\n89 26\n77 10\n65 15\n27 47\n15 51\n70 6\n59 85\n63 20\n64 92\n7 1\n93 52\n74 38\n71 23\n83 12\n86 52\n46 56\n34 36\n37 84\n18 16\n11 42\n69 72\n53 20\n78 84\n54 91\n14 5\n65 49\n90 19\n42 39\n68 57\n75 27\n57 32\n44 9\n79 74\n48 66\n43 93\n31 30\n58 24\n80 67\n6 60\n39 5\n23 17\n25 1\n18 36\n32 67\n10 9\n14 11\n63 21\n92 73\n13 43\n28 78\n33 51\n4 70\n75 45\n37 28\n62 46", "100 72\n2 88\n55 80\n22 20\n78 52\n66 74\n91 82\n59 77\n97 93\n46 44\n99 35\n73 62\n58 24\n6 16\n47 41\n98 86\n23 19\n39 68\n32 28\n85 29\n37 40\n16 62\n19 61\n84 72\n17 15\n76 96\n37 31\n67 35\n48 15\n80 85\n90 47\n79 36\n39 54\n57 87\n42 60\n34 56\n23 61\n92 2\n88 63\n20 42\n27 81\n65 84\n6 73\n64 100\n76 95\n43 4\n65 86\n21 46\n11 64\n72 98\n63 92\n7 50\n14 22\n89 30\n31 40\n8 57\n90 70\n53 59\n69 24\n96 49\n67 99\n51 70\n18 66\n91 3\n26 38\n13 58\n51 41\n9 11\n5 74\n3 25\n4 32\n28 43\n71 56", "6 5\n1 2\n2 3\n3 4\n4 5\n5 1", "6 4\n1 2\n1 3\n4 5\n4 6", "16 16\n1 2\n2 3\n1 3\n4 5\n5 6\n4 6\n7 8\n8 9\n9 10\n10 11\n11 7\n12 13\n13 14\n14 15\n15 16\n16 12", "4 4\n1 2\n4 3\n1 4\n2 3", "9 9\n1 2\n2 3\n3 1\n4 5\n5 6\n6 4\n7 8\n8 9\n9 7", "20 11\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 1", "4 3\n1 2\n3 4\n1 3", "4 2\n2 4\n3 4", "10 10\n1 2\n2 3\n3 4\n4 5\n5 1\n6 7\n7 8\n8 9\n9 10\n10 6", "6 5\n2 1\n3 4\n2 3\n4 5\n5 6", "8 5\n1 2\n2 3\n3 4\n4 5\n5 1", "6 5\n1 2\n2 3\n3 4\n4 5\n1 5", "8 8\n1 2\n2 3\n3 4\n1 4\n5 6\n6 7\n7 8\n5 8", "6 5\n1 3\n1 2\n2 4\n5 3\n5 4"], "outputs": ["1", "0", "2", "1", "0", "0", "0", "1", "1", "1", "0", "0", "0", "2", "1", "0", "1", "0", "1", "0", "0", "0", "4", "16", "1", "10", "1", "2", "0", "1", "3", "5", "5", "6", "2", "0", "4", "0", "3", "2", "0", "0", "2", "0", "2", "2", "0", "2"]}

UNKNOWN

PYTHON3

CODEFORCES

28

d4eccfcdc4a1ce493b2358cdc4f24618

Cableway

A group of university students wants to get to the top of a mountain to have a picnic there. For that they decided to use a cableway. A cableway is represented by some cablecars, hanged onto some cable stations by a cable. A cable is scrolled cyclically between the first and the last cable stations (the first of them is located at the bottom of the mountain and the last one is located at the top). As the cable moves, the cablecar attached to it move as well. The number of cablecars is divisible by three and they are painted three colors: red, green and blue, in such manner that after each red cablecar goes a green one, after each green cablecar goes a blue one and after each blue cablecar goes a red one. Each cablecar can transport no more than two people, the cablecars arrive with the periodicity of one minute (i. e. every minute) and it takes exactly 30 minutes for a cablecar to get to the top. All students are divided into three groups: *r* of them like to ascend only in the red cablecars, *g* of them prefer only the green ones and *b* of them prefer only the blue ones. A student never gets on a cablecar painted a color that he doesn't like, The first cablecar to arrive (at the moment of time 0) is painted red. Determine the least time it will take all students to ascend to the mountain top. The first line contains three integers *r*, *g* and *b* (0<=≤<=*r*,<=*g*,<=*b*<=≤<=100). It is guaranteed that *r*<=+<=*g*<=+<=*b*<=><=0, it means that the group consists of at least one student. Print a single number — the minimal time the students need for the whole group to ascend to the top of the mountain. Sample Input 1 3 2 3 2 1 Sample Output 3433

[ "import math\r\n\r\nm = 0\r\np = 0\r\nfor pos, i in enumerate(map(int, input().split())):\r\n if math.ceil(i/2) >= m:\r\n m = math.ceil(i/2)\r\n p = pos\r\n\r\nres = 0\r\nm -= 1\r\nwhile m > 0:\r\n res += 3\r\n m -= 1\r\n\r\nprint(res + p + 30)", "\r\nl = [int(s) + 1 for s in input().split()]\r\n\r\nr = ((l[0]//2) - 1) * 3\r\ng = ((l[1]//2)-1) * 3 + 1\r\nb = ((l[2]//2)-1) * 3 + 2\r\n\r\nprint(max(r,g,b)+ 30)", "r, g, b = map(int, input().split())\r\nt_r = 0 + 3 * ((r - 1) // 2)\r\nt_g = 1 + 3 * ((g - 1) // 2)\r\nt_b = 2 + 3 * ((b - 1) // 2)\r\nprint(30 + max(t_r, t_g, t_b))", "from math import ceil\r\na,b,c = map(int,input().split())\r\nx,y,z = ceil(a/2),ceil(b/2),ceil(c/2)\r\nmaxi = max(x,y,z)\r\nif maxi == z:\r\n\tprint(32+3*ceil((c-2)/2))\r\nelif maxi == y:\r\n\tprint(31+3*ceil((b-2)/2))\r\nelif maxi == x:\r\n\tprint(30+3*ceil((a-2)/2))\r\n", "import math\r\n\r\nt=0\r\nr,g,b=map(int,input().split())\r\nwhile r+b+g!=0:\r\n if t%3==0:\r\n r=max(0,r-2)\r\n elif t%3==1:\r\n g=max(0,g-2)\r\n else:\r\n b=max(0,b-2)\r\n t+=1\r\n\r\nprint(t+29)", "cablecars = [(int(color) + 1) // 2 for color in input().split(' ')]\ncars_needed = max(cablecars)\nposition = 2 - cablecars[::-1].index(cars_needed)\nprint(position + (cars_needed - 1) * 3 + 30)\n\n", "# LUOGU_RID: 101455370\nr, g, b = map(lambda x: sum(divmod(int(x), 2)) * 3, input().split())\r\nprint(max(r - 2, g - 1, b) + 29)", "import math\r\nr, g, b = map(int, input().split())\r\n\r\ncounter = 0\r\nwhile True:\r\n\tif counter%3==0:\r\n\t\tif r > 0:\r\n\t\t\tr += -2\r\n\t\tcounter += 1\r\n\telif counter%3==1:\r\n\t\tif g > 0:\r\n\t\t\tg += -2\r\n\t\tcounter += 1\r\n\telse:\r\n\t\tif b > 0:\r\n\t\t\tb += -2\r\n\t\tcounter += 1\r\n\t\t\r\n\tif r < 0:\r\n\t\tr = 0\r\n\tif g < 0:\r\n\t\tg = 0\r\n\tif b < 0:\r\n\t\tb = 0\r\n\t\t\r\n\tif not any([r,g,b]):\r\n\t\tbreak\r\n\t\t\r\nprint(counter-1+30)", "\r\nfrom math import ceil\r\nr, g, b = map(int, input().split())\r\n\r\nrt = (ceil(r / 2) - 1 ) * 3\r\nrg = 1 + ( ceil(g / 2) - 1 ) * 3\r\nrb = 2 + ( ceil(b / 2) - 1 ) * 3\r\n\r\nprint(max(rt, rg, rb ) + 30)", "a=list(map(int,input().split()))\r\na=list(map(lambda a:a//2+ 1*(a%2!=0),a))\r\nprint(max(((a[i]-1)*3)+1+i for i in range(3))+29)", "r,g,b=map(int,input().split())\r\nr=(r-1)//2*3\r\ng=(g-1)//2*3\r\nb=(b-1)//2*3\r\nprint(max(r,g+1,b+2)+30)", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n r, g, b = 0, 0, 0\n answer = 0\n \n def __init__(self):\n self.r, self.g, self.b = [int(x) for x in input().split()]\n\n def solve(self):\n r, g, b = self.r, self.g, self.b\n currentColor = 0\n while True:\n r = max(r - 2, 0) if currentColor == 0 else r\n g = max(g - 2, 0) if currentColor == 1 else g\n b = max(b - 2, 0) if currentColor == 2 else b\n if r + g + b > 0:\n self.answer += 1\n else:\n break\n currentColor = (currentColor + 1) % 3\n self.answer += 30\n\n def printAnswer(self):\n print(self.answer)\n #for line in self.answer:\n # print(re.sub('[\\[\\],]', '', str(line)))\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "r, g, b = map(int, input().split())\r\n \r\n \r\nprint(max([((r+1)//2 - 1) * 3, ((g+1)//2 - 1) * 3 + 1, ((b+1)//2 - 1) *\r\n 3 + 2]) + 30)\r\n ", "A = list(map(int, input().split()))\r\nt = 0\r\n\r\nwhile max(A) > 0:\r\n A[t%3] -= 2\r\n t += 1\r\n\r\nprint(t + 29)", "l = list(map(int,input().split(' ')))\r\nc = 29\r\nco = 0\r\n#0 = r,1 = g, 2 = b\r\nwhile l!=[0, 0, 0]:\r\n c+=1\r\n i = co%3\r\n if l[i]>1:\r\n l[i]-=2\r\n elif l[i] ==1:\r\n l[i]-=1\r\n co+=1\r\nprint(c)\r\n", "rgb = list(map(int, input().split()))\nans = 0\nfor i in range(3):\n temp = (rgb[i]-1)//2*3+30+i\n ans = max(temp, ans)\nprint(ans)\n", "\r\n# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\nimport math as m\r\ndef main():\r\n group = [int(i) for i in input().split()]\r\n r = 30+(m.ceil(group[0]/2)*3)-3\r\n g = 31+(m.ceil(group[1]/2)*3)-3\r\n b = 32+(m.ceil(group[2]/2))*3-3\r\n out = max(r, g, b)\r\n print(out)\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "R, G, B = map(int, input().split())\r\n\r\nans = 30\r\n\r\nif R % 2 == 0:\r\n x1 = R // 2\r\nelse:\r\n x1 = R // 2 + 1\r\n\r\nif G % 2 == 0:\r\n x2 = G // 2\r\nelse:\r\n x2 = G // 2 + 1\r\n\r\n\r\nif B % 2 == 0:\r\n x3 = B // 2\r\nelse:\r\n x3 = B // 2 + 1\r\n \r\n \r\nif x3 == max([x1,x2,x3]):\r\n ans += x3 * 3 - 1\r\n\r\n\r\nelif x2 == max([x1, x2, x3]):\r\n ans += x2 * 3 - 2\r\n\r\nelse:\r\n ans += x1 * 3 - 3\r\n\r\n \r\nprint(ans)\r\n", "\ndef carnum(student):\n if student % 2 == 0:\n return int(student/2)\n else:\n return int(student/2) + 1\n\nr, g, b = [int(x) for x in input().split()]\ncabler = 3*(carnum(r) - 1) \ncableg = 3*(carnum(g) - 1) + 1\ncableb = 3*(carnum(b) - 1) + 2\n\nmax_time = max(cabler, cableg, cableb)\nprint(int(max_time + 30))\n", "r,g,b=map(int,input().split())\r\nx=r//2+r%2\r\ny=g//2+g%2\r\nz=b//2+b%2\r\nm=max(x,y,z)\r\nif m==z:\r\n print(30+z*3-1)\r\nelif m==y:\r\n print(30+y*3-2)\r\nelse:\r\n print(30+x*3-3)", "r,g,b=[int(x) for x in input().split()]\r\nprint(max(((r-1)//2)*3+30,((g-1)//2)*3+31,((b-1)//2)*3+32))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nrgb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(3):\r\n ans = max(ans, i + 3 * (rgb[i] // 2 + rgb[i] % 2))\r\nans += 27\r\nprint(ans)", "r,g,b=map(int,input().split())\r\nprint(max(29+3*((b+1)//2),28+3*((g+1)//2),27+3*((r+1)//2)))", "import math\r\n\r\nt=list(map(int,input().split()))\r\nfor j in range(3):\r\n t[j]=math.ceil(t[j]/2)\r\n\r\nd=t[::-1]\r\n\r\nprint((max(t)-1)*3+(len(t)-1-d.index(max(d))+30))\r\n", "r,g,b= list(map(int, input().split(\" \")))\r\nr = 30 + 3*((r+1)//2-1)\r\ng = 31 + 3*((g+1)//2-1)\r\nb = 32 + 3*((b+1)//2-1)\r\nprint(max(r,g,b))\r\n", "\r\n\r\ndef main():\r\n\tr, g, b = list(int(x) for x in input().split())\r\n\r\n\tcc_r = ceil(r/2)\r\n\tcc_g = ceil(g/2)\r\n\tcc_b = ceil(b/2)\r\n\r\n\tcc = [cc_b, cc_g, cc_r]\r\n\r\n\tlongest_cc = max(cc)\r\n\tlongest_cc_index = cc.index(longest_cc)\r\n\r\n\ttotal_time = 30 + ((longest_cc-1)*3)\r\n\r\n\tif longest_cc_index == 0:\r\n\t\ttotal_time+=2\r\n\telif longest_cc_index == 1:\r\n\t\ttotal_time+=1\r\n\telif longest_cc_index == 2:\r\n\t\ttotal_time+=0\r\n\r\n\tprint(total_time)\r\n\treturn\r\n\r\n\r\n\r\n\r\ndef ceil(n):\r\n\r\n\tif n%1 > 0:\r\n\t\tn+=1\r\n\r\n\treturn int(n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "import math\r\n\r\nm = 0\r\np = 0\r\nfor pos, i in enumerate(map(int, input().split())):\r\n if math.ceil(i/2) >= m:\r\n m = math.ceil(i/2)\r\n p = pos\r\n\r\nprint((m-1)*3 + p + 30)", "\r\ndatos = input().split()\r\nr,g,b = int(datos[0]), int(datos[1]), int(datos[2])\r\n\r\nc = 0\r\nwhile r>2 or g>2 or b>2:\r\n if r > 2:\r\n r = r-2\r\n else:\r\n r = 0\r\n if g > 2:\r\n g = g-2\r\n else:\r\n g = 0\r\n if b > 2:\r\n b = b-2\r\n else:\r\n b = 0\r\n c = c+1 \r\n\r\nultimo_teleferico = 1\r\nif b > 0:\r\n ultimo_teleferico = 3\r\nelif g > 0:\r\n ultimo_teleferico = 2\r\n \r\nminutos = c*2 + (c-1) + ultimo_teleferico + 30\r\n\r\nprint(minutos)\r\n ", "# for _ in range(int(input())):\r\n# n,k=map(int,input().split())\r\n# arr = [int(x) for x in input().split()]\r\n # c=[0]*n\r\n # #d=[]\r\n # i=0\r\n # x=0\r\n # while(max(arr)!=-1):\r\n # x=k-arr[i]\r\n # if(arr!=-1):\r\n # c[arr.index(arr[i])]=1\r\n # arr[arr.index(arr[i])]= -1\r\n # if(x in arr):\r\n # while(x in arr):\r\n # arr[arr.index(x)]= -1\r\n # if(x in arr):\r\n # c[arr.index(x)]=1\r\n # arr[arr.index(x)]= -1\r\n # i+=1\r\n # print(\" \".join(str(gh) for gh in c))\r\n # ans = 0\r\n # c=1\r\n # for i in range(n):\r\n # if(2*arr[i] == k):\r\n # c=c+1\r\n # ans=(c)%2\r\n # else:\r\n # if(2*a[i]<k):\r\n # ans = 0\r\n # else:\r\n # ans=1\r\n # print(str(ans),end=\" \")\r\n # print(\"\\n\")\r\n########################\r\n# #\r\n# COLOUR REVOLUTIONN #\r\n# #\r\n#####################\r\n\r\n# for _ in range(int(input())):\r\n# n,k=map(int,input().split())\r\n# if(k != 1):\r\n# a = abs((1-(k**4))//(1-k))\r\n# n1 = n//a\r\n# else:\r\n# n1 = 1\r\n# for i in range(4):\r\n# print(str(n1*(k**i)),end=' ')\r\n# print('\\n')\r\n\r\n########################################\r\n\r\n# CABEL CAR #\r\n\r\n########################################\r\n\r\nr,g,b = map(int,input().split())\r\nco = -1\r\nwhile(r >0 or g>0 or b>0):\r\n co += 1\r\n r -= 2\r\n if(r <=0 and g<=0 and b<=0):\r\n break\r\n co += 1\r\n g -= 2\r\n if(r <=0 and g<=0 and b<=0):\r\n break\r\n co+=1\r\n b-=2\r\nprint(co+30)", "r,g,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nif r%2!=0: r=r+1\r\nif g%2!=0: g=g+1\r\nif b%2!=0: b=b+1\r\nx = ((r//2)-1)*3+30\r\ny = ((g//2)-1)*3+31\r\nz = ((b//2)-1)*3+32\r\nprint(max(x,y,z))", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr1=30+(ceil(r/2)-1)*3\r\ng1=(ceil(g/2)-1)*3+1+30\r\nb1=(ceil(b/2)-1)*3+2+30\r\nprint(max(r1,g1,b1))", "r,g,b=map(int,input().split())\r\nx=r//2+(r%2)-1\r\ny=g//2+(g%2)-1\r\nz=b//2+(b%2)-1\r\nif max(x,y,z)==z:\r\n print(32+z*3)\r\nelif max(x,y,z)==y:\r\n print(31+y*3)\r\nelse:\r\n print(30+x*3)", "import math\r\nl = list(map(int, input().split()))\r\nfor i in range(3):\r\n l[i] = math.ceil(l[i] / 2)\r\nmax = l[0]\r\np = 0\r\nfor i in range(3):\r\n if l[i] >= max:\r\n max = l[i]\r\n p = i\r\nprint(30 + (max * 3) + p - 3)", "r, g, b = map(int, input().split())\r\nr = r // 2 + (r % 2)\r\ng = g // 2 + (g % 2)\r\nb = b // 2 + (b % 2)\r\nr = max(0, 0 + (r - 1) * 3)\r\ng = max(0, 1 + (g - 1) * 3)\r\nb = max(0, 2 + (b - 1) * 3)\r\nprint(max(r, g, b) + 30)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nr,g,b=map(int,input().split())\r\nf=lambda x:(0--x//2-1)*3\r\nprint(max(f(r),1+f(g),2+f(b))+30)", "r, g, b = list(map(int, input().split()))\r\n\r\nr_waiting = max(3 * (r // 2 + r % 2) - 3, 0)\r\ng_waiting = max(1 + 3 * (g // 2 + g % 2) - 3 , 0)\r\nb_waiting = max(2 + 3 * (b // 2 + b % 2) - 3 , 0)\r\n\r\nprint(30 + max(r_waiting, g_waiting, b_waiting))", "\r\n\r\nlis = list(map(int,input().split()))\r\n\r\nk = 1\r\ncnt = 0\r\n\r\ni = 0 \r\nwhile(True) :\r\n \r\n if lis.count(0)!=3 :\r\n \r\n if lis[i]!=0 :\r\n \r\n lis[i] = lis[i] -2 \r\n \r\n if lis[i]<0 :\r\n \r\n lis[i] = 0 \r\n \r\n i = i + 1\r\n \r\n cnt = cnt + 1\r\n \r\n if i == 3 :\r\n i =0 \r\n \r\n else :\r\n \r\n break\r\n \r\n \r\n \r\nprint(30+cnt-1)\r\n \r\n \r\n \r\n \r\n ", "a=list(map(int, input().split()))\r\ni=t=0\r\nwhile sum(a) > 0:\r\n\tif a[i%3] > 0:\r\n\t\ta[i%3] -= min(a[i%3], 2)\r\n\tt += 1\r\n\ti += 1\r\nprint(t+29)", "r,g,b = map(int,input().split())\r\nr = 30+3*((r-1)//2)\r\ng = 31+3*((g-1)//2)\r\nb = 32+3*((b-1)//2)\r\nprint(max(r,g,b))\r\n", "r, g, b = map(int, input().split())\r\nminute = []\r\ncolor = 'r'\r\ncounter = 0\r\nwhile r + g + b > 0:\r\n if color == 'r' and r >= 2:\r\n r -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'g'\r\n elif color == 'r' and r < 2 and r != 0:\r\n r = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'g'\r\n elif color == 'r' and r == 0:\r\n counter += 1\r\n color = 'g'\r\n continue\r\n\r\n elif color == 'g' and g >= 2:\r\n g -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'b'\r\n elif color == 'g' and g < 2 and g != 0:\r\n g = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'b'\r\n elif color == 'g' and g == 0:\r\n counter += 1\r\n color = 'b'\r\n continue\r\n\r\n elif color == 'b' and b >= 2:\r\n b -= 2\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'r'\r\n elif color == 'b' and b < 2 and b != 0:\r\n b = 0\r\n minute.append(30 + counter)\r\n counter += 1\r\n color = 'r'\r\n elif color == 'b' and b == 0:\r\n counter += 1\r\n color = 'r'\r\n continue\r\n\r\nprint(minute[len(minute) - 1])", "r, g, b = map(int,input().split())\nm = 29\nwhile (r > 0 or g > 0 or b > 0):\n m += 1\n if r > 0:\n r -= 2\n if (r<1 and g <1 and b <1):\n break \n m += 1\n if g > 0:\n g -= 2\n if (r<1 and g <1 and b <1):\n break\n m += 1\n if b > 0:\n b -= 2\n if (r<1 and g <1 and b <1):\n break\nprint(m)", "\r\nn = input().split()\r\nx = int(n[0])\r\ny = int(n[1])\r\nz = int(n[2])\r\nt = 29\r\nwhile not (x <= 0 and y <=0 and z <=0):\r\n t += 1\r\n if t % 3 ==0:\r\n x -= 2\r\n elif t % 3 ==1:\r\n y -= 2\r\n else:\r\n z -= 2\r\nprint(t)\r\n \r\n", "colors=list(map(int,input().split()))\r\ntime=29\r\nwhile any(colors):\r\n i=0\r\n while i<3 and any(colors):\r\n \r\n colors[i]=max(0,colors[i]-2)\r\n time+=1\r\n i+=1\r\n \r\nprint(time)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nr, g, b = readln()\nr = (r + 1) // 2\ng = (g + 1) // 2\nb = (b + 1) // 2\nif r > g and r > b:\n print(3 * (r - 1) + 30)\nelif g >= r and g > b:\n print(1 + 3 * (g - 1) + 30)\nelse:\n print(2 + 3 * (b - 1) + 30)\n", "from math import ceil\r\n\r\nr, g, b = map(int, input().split())\r\nr = ceil(r / 2)\r\ng = ceil(g / 2)\r\nb = ceil(b / 2)\r\nif r == 0 and g == 0 and b == 0:\r\n t = 0\r\nelif b >= g and b >= r:\r\n t = 30 + (b - 1) * 3 + 2\r\nelif g >= b and g >= r:\r\n t = 30 + (g - 1) * 3 + 1\r\nelse:\r\n t = 30 + (r - 1) * 3\r\nprint(t)\r\n", "import math\r\n\r\nr, g, b = list(map(int, input().split()))\r\n\r\nr = (r - 1) // 2\r\ng = (g - 1) // 2\r\nb = (b - 1) // 2\r\n\r\nr = r * 3\r\ng = g * 3 + 1\r\nb = b * 3 + 2\r\n\r\nm = max(r, g)\r\nm = max(m, b)\r\n\r\nprint(m + 30)\r\n\r\n", "colors=list(map(int,input().split()))\r\ntime=29\r\ni=0\r\nwhile any(colors):\r\n \r\n colors[i%3]=max(0,colors[i%3]-2)\r\n i+=1\r\n \r\nprint(time+i)", "r,g,b=[int(x) for x in input().split(' ')]\ntotal = -1\ncar = 0\nt = 0\nwhile(any([r,g,b])):\n t += 1\n if r and not car:\n r = max(min(r-1, r-2), 0)\n total += t\n t=0\n if g and car == 1:\n g = max(min(g-1, g-2), 0)\n total += t\n t=0\n if b and car == 2:\n b = max(min(b-1, b-2), 0)\n total += t\n t=0\n car += 1\n car = car%3\nprint(total+30)\n\t \t \t \t \t\t\t \t\t\t \t \t\t\t", "r, g, b = list(map(int, input().split()))\nred_rides = int(r/2) + r%2\nblue_rides = int(b/2)+ b%2\ngreen_rides = int(g/2) + g%2\nif red_rides > blue_rides and red_rides > green_rides:\n last_ride_arrival = 3*(red_rides - 1)\n time = last_ride_arrival + 30\nelif green_rides >= red_rides and green_rides > blue_rides:\n last_ride_arrival = 3*(green_rides - 1) + 1\n time = last_ride_arrival + 30\nelif blue_rides >= red_rides and blue_rides >= green_rides:\n last_ride_arrival = 3*(blue_rides - 1) + 2\n time = last_ride_arrival + 30\nprint(time)\n\n \t \t\t \t \t \t \t\t \t \t \t \t", "a = list(map(int, input().rstrip().split(\" \")))\r\nz = [i//2 +i%2 for i in a]\r\ntotal = max(a)//2 + max(a)%2\r\nm = max(z)\r\nind = 0\r\nfor i in range(3):\r\n if z[i] == m:\r\n ind = i+1\r\n\r\ntotal = 30 + 3*(total-1) + ind - 1\r\nprint(total)", "r, g, b = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(300): \r\n if r<=0 and g<=0 and b<=0 :break\r\n if i%3==0 : r-=2\r\n if i%3==1 : g-=2\r\n if i%3==2 : b-=2 \r\n if i == 0 : ans += 30 \r\n else : ans += 1\r\nprint(ans)", "rgb=input().split()\r\nr=int(rgb[0])\r\ng=int(rgb[1])\r\nb=int(rgb[2])\r\nt=29\r\nc=0\r\nwhile True:\r\n if r==0 and g==0 and b==0:\r\n break\r\n elif r>=0 and c%3==0:\r\n c+=1\r\n t+=1\r\n if r-2<0:\r\n r=0\r\n else:\r\n r-=2\r\n elif g>=0 and c%3==1:\r\n c+=1\r\n t+=1\r\n if g-2<0:\r\n g=0\r\n else:\r\n g-=2\r\n elif b>=0 and c%3==2:\r\n c+=1\r\n t+=1\r\n if b-2<0:\r\n b=0\r\n else:\r\n b-=2\r\nprint(t)", "r,g,b=[int(x) for x in input().split()]\r\nx=29\r\nwhile r+g+b>0:\r\n #print(\"1st\",r,g,b,x)\r\n if r<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n r=0\r\n \r\n else:\r\n r-=2\r\n x+=1\r\n #print(\"aftr red\",r,g,b,x)\r\n \r\n if g<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n g=0\r\n else:\r\n g-=2\r\n x+=1\r\n #print(\"aftr green\",r,g,b,x)\r\n \r\n if b<=2:\r\n if (r+g+b)!=0:\r\n x+=1\r\n b=0\r\n else:\r\n b-=2\r\n x+=1\r\n \r\n #print(\"aftr blue\",r,g,b,x)\r\nprint(x)", "r,g,b = [int(i) for i in input().split()]\n\nx = 30 + 3 * ((r+1)//2 - 1) + 0\ny = 30 + 3 * ((g+1)//2 - 1) + 1\nz = 30 + 3 * ((b+1)//2 - 1) + 2\nprint(max(x,y,z))\n", "data = list(map(int ,input().split()))\r\ncounter = 29\r\ni = 0 \r\nwhile True : \r\n if data[i] > 0 :\r\n data[i] -=2 \r\n counter += 1 \r\n if data[i] <= 0 : \r\n data[i] = 0 \r\n i += 1 \r\n if i == 3 : \r\n i = 0\r\n if sum(data) == 0 :\r\n break\r\nprint(counter)\r\n \r\n", "a = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(3):\r\n current = max(0, a[i] - 1) // 2 * 3\r\n if a[i] > 0:\r\n current += i\r\n ans = max(ans, current)\r\nprint(30 + ans)\r\n", "r,g,b=map(lambda x:int((int(x)+1)/2),input().split())\r\nvalue=2\r\ngreatest=b\r\nif g>greatest:\r\n greatest=g\r\n value=1\r\nelif r>greatest:\r\n greatest=r\r\n value=0\r\ntime=int(30+(3*(greatest - 1)) + value)\r\nprint(time)", "r, g, b = map(int, input().split())\r\n\r\ni = 0\r\n\r\na = [r,g,b]\r\nc = -1\r\n\r\nwhile a[0] > 0 or a[1] > 0 or a[2] > 0:\r\n a[i] -= 2\r\n \r\n i +=1\r\n if i == 3:\r\n i = 0\r\n c+=1\r\n\r\nprint(c + 30)", "r, g, b = map(int, input().split())\r\nprint(max(3 * ((r - 1) // 2), 1 + 3 * ((g - 1) // 2), 2 + 3 * ((b - 1) // 2)) + 30)", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr,g,b=[ceil(r/2),ceil(g/2),ceil(b/2)]\r\nif b>=r and b>=g:\r\n\tx=b\r\n\ti=2\r\nelif g>=r and g>=b:\r\n\tx=g\r\n\ti=1\r\nelif r>=g and r>=b:\r\n\tx=r\r\n\ti=0\r\nprint(30+(x-1)*3+i)", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nMax=max(r,g,b)\r\n\r\nif ceil(Max/2)==ceil(b/2): \r\n print(30+(ceil(b/2)*3)-1)\r\nelif ceil(Max/2)==ceil(g/2):\r\n print(30+(ceil(g/2)*3)-2) \r\nelif ceil(Max/2)==ceil(r/2):\r\n print(30+(ceil(r/2)*3)-3)\r\n ", "\n\nr, g, b = map(int, input().split())\n\nprint(max(3*((r+1)//2) + 27, max(3*((g+1)//2) + 28, 3*((b+1)//2) + 29)))\n", "def f(x):\r\n return ((int(x)+1)//2) * 2\r\ncolors = list(map(f, input().split()))\r\n#print(colors)\r\nmx,mx_i = 0,0\r\nfor i in range(3):\r\n if colors[i]>=mx:\r\n mx = colors[i]\r\n mx_i = i\r\ncycle = (mx-1)//2\r\ntotal = 30 + 3*cycle + mx_i\r\nprint(total)\r\n ", "a = list(map(int,input().split()))\nb = -1\nfor x in range(len(a)):\n\tif a[x] % 2 != 0:a[x] = a[x] + 1\n\tif a[x] == b:a[a.index(a[x])] = 0\n\telif a[x] > b:b = a[x]\nc = 3 - (a.index(b) + 1) + 1\nprint(int(30 + ((b / 2) * 3) - c))\n", "from math import ceil\r\na,b,c = map(int,input().split())\r\nx,y,z = ceil(a/2),ceil(b/2),ceil(c/2)\r\nt = max(x,y,z)\r\nif t == z:\r\n\tprint(32+3*ceil((c-2)/2))\r\nelif t == y:\r\n\tprint(31+3*ceil((b-2)/2))\r\nelif t == x:\r\n\tprint(30+3*ceil((a-2)/2))\r\n", "\nI0 = lambda :map(int,input().split())\nI1 = lambda :int(input())\nI2 = lambda :list(map(int,input().split()))\n#####################################################\nr,g,b = I0()\nt = 0\nf = [True,False,False]\nwhile any([r,g,b]):\n if f[0]==True:r = max(0,r-2);f[0]=False;f[1]=True\n elif f[1]==True:g = max(0,g-2);f[1]=False;f[2]=True\n elif f[2]==True:b = max(0,b-2);f[2]=False;f[0]=True\n else:pass\n if t == 0:t = 30\n else:t+=1\n \nprint(t)", "r , g , b = map(lambda x : int((int(x)+1)/2) , input().split())\r\n\r\nvalue = 3\r\ngreatest = b\r\n\r\nif (g > greatest) :\r\n greatest = g\r\n value = 2\r\nif (r > greatest):\r\n greatest = r\r\n value = 1\r\n \r\ntime = 30 + ((greatest-1)*3) + value - 1\r\n\r\nprint(time)", "a=list(map(int,input().strip().split()))[:3]\ni=0\nwhile(max(a)>0):\n a[i%3]=a[i%3]-2\n i=i+1\nprint(i+29)\n\n\n\n", "from math import ceil as c\r\nl=list(map(lambda x:c(int(x)/2),input().split()))\r\nfor x in range(3):\r\n\tif l[x]==max(l):a=x+1\r\nif l==[1,0,0]:print(30)\r\nelif l[2]==0 and max(l)==1:print(31)\r\nelif max(l)>1:print(32+(max(l)-2)*3+a)\r\nelse:print(32)\r\n", "r,g,b = list(map(int,input().split()))\r\n# rr =0 \r\n# if r<2:\r\n# rr = 0\r\n# else:\r\n# rr = r-2\r\n# ans = 30\r\n# # print(rr)\r\n\r\n# if r<g:\r\n# dif = g-r\r\n# ans += dif//2 if dif%2==0 else (dif//2)+1\r\n# if g<b:\r\n# dif = b-g\r\n# ans += dif//2 if dif%2==0 else (dif//2)+1\r\n# # print(ans)\r\n# fi = g//2 if g%2==0 else (g//2)+1\r\n# # print(fi)\r\n# si = b//2 if b%2==0 else (b//2)+1\r\n# li = rr//2 if rr%2==0 else (rr//2)+1\r\n# # print(li)\r\n# sm = fi+si+li\r\n# # print(sm)\r\nlst = [r,g,b]\r\nans = 0\r\nfor i in range(3):\r\n ans = max(ans,i+3*(lst[i]//2+lst[i]%2))\r\nans+=27\r\nprint(ans)", "r,g,b=map(int,input().split())\r\nf=lambda x:(0--x//2-1)*3\r\nprint(max(f(r),1+f(g),2+f(b))+30)", "\r\n#Code Force challenge 90A\r\n\r\nr,g,b = map(int,input().split())\r\ntime = 0\r\nresult = 0 \r\ncableColours = (\"r\",\"g\",\"b\")\r\n\r\nstudentsLeft = True\r\n\r\nwhile studentsLeft:\r\n for colour in cableColours:\r\n \r\n if vars()[colour] > 1:\r\n vars()[colour] -= 2\r\n elif vars()[colour] > 0:\r\n vars()[colour] -= 1\r\n \r\n if r == g == b ==0:\r\n studentsLeft = False\r\n break\r\n\r\n time += 1\r\n\r\nprint(time + 30)\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "r, g, b = map(int, input().split())\r\nif r%2==1:\r\n r+=1\r\nif g%2==1:\r\n g+=1\r\nif b%2==1:\r\n b+=1\r\nk = 0\r\nt = 0\r\nwhile r+g+b != 0:\r\n if k == -1 and r>0:\r\n r-=2\r\n elif k == 0 and r>0:\r\n r-=2\r\n t+=1\r\n elif k == 1 and g>0:\r\n g-=2\r\n t+=1\r\n elif k == 2 and b>0:\r\n b-=2\r\n t+=1\r\n else:\r\n t+=1\r\n if k<2:\r\n k += 1\r\n else:\r\n k = 0\r\nprint(t+29)\r\n \r\n", "import sys\r\n\r\ndef get_int():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef get_string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nFILE=False\r\nif FILE:\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\ntext=get_string().split()\r\nsred=int(text[0]) \r\nsgreen=int(text[1])\r\nsblue=int(text[2])\r\ntime=0\r\ncurrent=1\r\nwhile (sred+sgreen+sblue>=0):\r\n if sred+sgreen+sblue==0:\r\n time=time+29\r\n break\r\n if current==1:\r\n sred=max(sred-2,0)\r\n current=2\r\n elif current==2:\r\n sgreen=max(sgreen-2,0)\r\n current=3\r\n else:\r\n sblue=max(sblue-2,0)\r\n current=1\r\n time=time+1\r\nsys.stdout.write(str(time))", "import math\r\nr, g, b = list(map(int, input().split()))\r\nr = math.ceil(r / 2)\r\ng = math.ceil(g / 2)\r\nb = math.ceil(b / 2)\r\n\r\nans = 0\r\nif r > g and r > b:\r\n ans = 30 + ((r - 1) * 3)\r\nif g >= r and g > b:\r\n ans = 31 + ((g - 1) * 3)\r\nif b >= g and b >= r:\r\n ans = 32 + ((b - 1) * 3)\r\nprint(int(ans))", "r,g,b=map(int,input().split())\r\nkr,kg,kb=r//2+r%2,g//2+g%2,b//2+b%2\r\nprint(max((kr-1)*3+30,(kg-1)*3+31,(kb-1)*3+32))\r\n\r\n", "entrada=input().split()\nr=int(entrada[0])\ng=int(entrada[1])\nb=int(entrada[2])\nr2=(r+1)//2\ng2=(g+1)//2\nb2=(b+1)//2\n\nif r2>g2 and r2>b2:\n print(30+3*(r2-1))\nelif g2>b2:\n print(30+3*(g2-1)+1)\nelse:\n print(30+3*(b2-1)+2)\n\t\t\t \t \t \t \t\t\t \t\t \t", "r = lambda : list(map(int, input().split()))\r\narr = r()\r\nc = 0\r\ni = 0\r\nwhile arr.count(0) != 3:\r\n arr[i%3] = max(0 , arr[i%3]-2)\r\n c+=1\r\n i+=1\r\n\r\nprint(29 + c)", "data = list(map(int ,input().split()))\r\ncounter = 29\r\ni = 0 \r\nwhile any(data) : \r\n if data[i] > 0 :\r\n data[i] -=2 \r\n counter += 1 \r\n if data[i] <= 0 : \r\n data[i] = 0 \r\n i = (i + 1) % 3\r\nprint(counter)", "r,g,b = map(int,input().split())\n\nr = r//2 + r%2\ng = g//2 + g%2\nb = b//2 + b%2\n\nans = 30 + 3*(r-1)\n\nans = max(ans,31 + 3*(g-1))\nans = max(ans,32 + 3*(b-1))\n\nprint(ans)", "r,g,b=map(int,input().split())\r\nl=[r,g,b]\r\ni=0\r\nj=0\r\nm=[]\r\nwhile((l[0]!=0 or l[1]!=0) or l[2]!=0):\r\n\tif(i==3):\r\n\t\ti=0\r\n\tif(l[i]<=2):\r\n\t\tl[i]=0\r\n\t\tm.append(j+30)\r\n\tif(l[i]>=2):\r\n\t\tl[i]=l[i]-2\r\n\t\tm.append(j+30)\r\n\ti=i+1\r\n\tj=j+1\r\nprint(m[-1])", "l=[int(x) for x in input().split()]\r\nt=29;j=0\r\nwhile(l!=[0,0,0]):\r\n i=j%3\r\n if l[i]>1:\r\n l[i]-=2\r\n elif l[i]==1:\r\n l[i]-=1\r\n t+=1\r\n j+=1\r\nprint(t)", "import math\r\nimport sys\r\nfrom decimal import *\r\nfrom collections import deque\r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\n\r\n\r\n \r\n#print(vector[9995:10001])\r\n\r\n#c=int(input())\r\n\r\n \r\nfor i in range(0,1):\r\n #n=map(int,input().split())\r\n #n=int(input())\r\n #print(n,a,b)\r\n \r\n r,g,b=list(map(int,input().split()))\r\n \r\n #print(r,g,b)\r\n\r\n end_r=r//2+r%2\r\n end_r=30+(end_r-1)*3\r\n \r\n end_g=g//2+g%2\r\n end_g=31+(end_g-1)*3\r\n \r\n end_b=b//2+b%2\r\n end_b=32+(end_b-1)*3\r\n \r\n print(max(end_r,end_g,end_b) )\r\n \r\n \r\n#print(rasp) ", "r, g, b = map(int, input().split())\r\n\r\nans=max(3 * ((r + 1) // 2) + 27, 3 * ((g + 1) // 2) + 28, 3 * ((b + 1) // 2) + 29)\r\n\r\nprint(ans)\r\n", "a=list(map(int,input().split()))\r\nt=0\r\nwhile(sum(a)>0):\r\n for i in range(3):\r\n if(a[i]-2>0):\r\n a[i]-=2\r\n else:\r\n a[i]=0\r\n if(sum(a)==0):\r\n break\r\n t+=1\r\nprint(t+30)\r\n", "from math import ceil as c\r\nr,g,b = map(int,input().split())\r\nk = c((max(r,g,b))/2)\r\nl = max(r,g,b)\r\nif r==g==b:\r\n\tprint(29+3*(c(l/2)))\r\nelif k==c(b/2):\r\n\tprint(32+3*c((l/2)-1))\r\nelif k==c(g/2):\r\n\tprint(31+3*c((l/2)-1))\r\nelse:\r\n\tprint(30+3*c((l/2)-1))", "r,g,b=map(int,input().split())\r\nx=0\r\nwhile True:\r\n\tif r>0:\r\n\t\tr-=2\r\n\t\tr=max(0,r)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\n\tif g>0:\r\n\t\tg-=2\r\n\t\tg=max(0,g)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\n\tif b>0:\r\n\t\tb-=2\r\n\t\tb=max(0,b)\r\n\t\tif r==g and g==b and g==0:break\r\n\t\tx+=1\r\n\telse:x+=1\r\nprint(x+30)", "peoplenums = input().split()\r\ntramorder = ['red', 'green', 'blue']\r\nredpreferred = int(peoplenums[0])\r\ngreenpreferred = int(peoplenums[1])\r\nbluepreferred = int(peoplenums[2])\r\ntotalmins = 0\r\n\r\nfor i in range(10000):\r\n if redpreferred == 0 and greenpreferred == 0 and bluepreferred == 0:\r\n break\r\n totalmins += 1\r\n if tramorder[i % 3] == 'red':\r\n if redpreferred != 0 and redpreferred >= 2:\r\n redpreferred -= 2\r\n continue\r\n if redpreferred != 0 and redpreferred < 2:\r\n redpreferred -= 1\r\n continue\r\n if tramorder[i % 3] == 'green':\r\n if greenpreferred != 0 and greenpreferred >= 2:\r\n greenpreferred -= 2\r\n continue\r\n if greenpreferred != 0 and greenpreferred < 2:\r\n greenpreferred -= 1\r\n continue\r\n if tramorder[i % 3] == 'blue':\r\n if bluepreferred != 0 and bluepreferred >= 2:\r\n bluepreferred -= 2\r\n continue\r\n if bluepreferred != 0 and bluepreferred < 2:\r\n bluepreferred -= 1\r\n continue\r\n\r\n\r\nprint(totalmins + 29)\r\n", "\r\nl = [int(s) for s in input().split()]\r\n\r\nminutes = 0\r\ncount = l[0] + l[1] + l[2]\r\nwhile(True):\r\n x = minutes % 3\r\n if(l[x] > 0):\r\n count -= min(l[x],2)\r\n l[x] -= min(l[x],2)\r\n if(count <= 0):\r\n break\r\n minutes += 1\r\nprint(minutes + 30)\r\n", "x=list(map(int, input().split()))\r\nfor i in range(len(x)):\r\n x[i]=(x[i]+1)//2\r\nc=max(x)\r\nind=x[::-1].index(c)\r\nprint(30+c*3-ind-1)", "# 90A\r\nfrom math import ceil\r\nr,g,b=map(int,input().split())\r\nr1=ceil(r/2)\r\ng1=ceil(g/2)\r\nb1=ceil(b/2)\r\nans=0\r\nn=max(r1,g1,b1)\r\nif n==b1:\r\n\tans=3*n-1\r\nelif n==g1:\r\n\tans=3*n-2\r\nelse:\r\n\tans=3*n-3\r\nprint(ans+30)", "def solve():\n prefs = [int(num_students) for num_students in input().split()]\n time = 0\n car = 0\n\n while sum(prefs) > 0:\n if prefs[car % 3] > 0:\n prefs[car % 3] -= min(2, prefs[car % 3])\n \n car += 1\n time += 1\n\n print(time - 1 + 30)\n\n\nsolve()\n", "r, g, b = map(int, input().split())\r\n\r\nr = (r // 2 + r % 2) * 3 + 30\r\ng = (g // 2 + g % 2) * 3 + 30\r\nb = (b // 2 + b % 2) * 3 + 30\r\nma = max(r, max(g, b))\r\nif ma == b:\r\n\tprint(b - 1)\r\nelif ma == g:\r\n\tprint(g - 2)\r\nelse:\r\n\tprint(r - 3)", "import math\n\na = input()\na=a.split()\n\na[0] = math.ceil(int(a[0])/2)\na[1] = math.ceil(int(a[1])/2)\na[2] = math.ceil(int(a[2])/2)\n#print(a)\n\nif(a[2]>=a[1] and a[2]>=a[0]):\n total = 3*a[2]+30-1\n\nelif(a[1]>=a[2] and a[1]>=a[0]):\n total = 3*a[1]+30-2\n\nelif(a[0]>=a[2] and a[0]>=a[1]):\n total = 3*a[0]+30-3\n\nprint(total)\n \t \t \t \t \t\t \t \t \t\t", "lst = list(map(int,input().split()))\r\ntime = 29\r\nwhile True:\r\n\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\tbreak\r\n\telse:\r\n\t\tif lst[0] > 2:\r\n\t\t\tlst[0]-=2\r\n\t\telse:\r\n\t\t\tlst[0] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\tif lst[1] > 2:\r\n\t\t\tlst[1]-=2\r\n\t\telse:\r\n\t\t\tlst[1] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\tif lst[2] > 2:\r\n\t\t\tlst[2]-=2\r\n\t\telse:\r\n\t\t\tlst[2] = 0\r\n\t\ttime+=1\r\n\t\tif lst[0] == 0 and lst[1] == 0 and lst[2] == 0:\r\n\t\t\tbreak\r\n\t\r\nprint(time)\t", "r, g, b = map(int, input().split())\r\nif b % 2 == 0:\r\n b = b//2\r\nelse:\r\n b = b//2 + 1\r\n\r\nif g % 2 == 0:\r\n g = g//2\r\nelse:\r\n g = g//2 + 1\r\n \r\nif r % 2 == 0:\r\n r = r//2\r\nelse:\r\n r = r//2 + 1\r\n \r\nif b >= g >= r or b >= r >= g:\r\n print(29+3*b) \r\nelif g >= r >= b or g >= b >= r:\r\n print(28+3*g)\r\nelse:\r\n print(27+3*r)\r\n", "r, g, b = (int(i) for i in input().split())\nres = 3 * ((r + 1) // 2 - 1)\nif g:\n res = max(res, 1 + 3 * ((g + 1) // 2 - 1))\nif b:\n res = max(res, 2 + 3 * ((b + 1) // 2 - 1))\nres += 30\nprint(res)\n", "r, g, b = map(int, input().split())\na = 0\nr = ((r//2) + (r%2) - 1) * 3 + 1\ng = ((g//2) + (g%2) - 1) * 3 + 2\nb = ((b//2) + (b%2) - 1) * 3 + 3\na = max(r, max(g,b)) + 29\nprint(a)\n", "a=[int(i) for i in input().split()]\r\na[0]=int(((a[0]//2)+(a[0]%2)-1)*3+1)\r\na[1]=int(((a[1]//2)+(a[1]%2)-1)*3+2)\r\na[2]=int(((a[2]//2)+(a[2]%2)-1)*3+3)\r\nprint(max(a[0],max(a[1],a[2]))+29)", "r, g, b = map(int, input().split())\r\nl = [(r - 1) // 2 + 1, (g - 1) // 2 + 1, (b - 1) // 2 + 1]\r\nm = 0\r\nind = 0\r\nfor i in range(3):\r\n if l[i] >= m:\r\n m = l[i]\r\n ind = i\r\nprint(30 + 3 * (m - 1) + ind)", "a = list(map(int, input().split()))\r\nans = -1\r\ni = 0\r\nwhile max(a) > 0:\r\n a[i] -= 2\r\n i = (i + 1) % 3\r\n ans += 1\r\nprint(ans + 30)", "def main():\n from math import ceil\n [r, g, b] = [int(_) for _ in input().split()]\n \n n_cars_red = ceil(r / 2)\n n_cars_green = ceil(g / 2)\n n_cars_blue = ceil(b / 2)\n\n last_red = (n_cars_red - 1) * 3 + 30 if n_cars_red > 0 else 0\n last_green = (n_cars_green - 1) * 3 + 31 if n_cars_green > 0 else 0\n last_blue = (n_cars_blue - 1) * 3 + 32 if n_cars_blue > 0 else 0\n\n print(max(last_red, last_green, last_blue))\n\n\nif __name__ == '__main__':\n main()\n", "r, g, b = map(int, input().split())\ntime = -1\nwhile r + b + g > 0:\n total = r + b + g\n time += 1\n if r: \n r = max(r-2, 0)\n total = r + b + g\n if not total: \n break\n time += 1\n if g: \n g = max(g-2, 0)\n total = r + b + g\n if not total: \n break\n time += 1\n if b: \n b = max(b-2, 0)\n total = r + b + g\n if not total: \n break\nprint(time + 30)\n", "r,g,b = map(int,input().split())\r\nit=0\r\nwhile(r>0 or b>0 or g>0):\r\n if(it%3==0):\r\n r = max(r-2,0)\r\n elif(it%3==1):\r\n g = max(0,g-2)\r\n else:\r\n b = max(0,b-2)\r\n it+=1\r\nprint(it+29)", "r, g, b = map(int, input().split())\r\nlastR = 3*(-((-r) // 2) -1) if r > 0 else -1\r\nlastG = 3*(-((-g) // 2) -1) + 1 if g > 0 else -1\r\nlastB = 3*(-((-b) // 2) -1) + 2 if b > 0 else -1\r\nlastStart = max([lastR, lastG, lastB])\r\nprint(30 + lastStart)\r\n", "r,g,b=list(map(int,input().split()))\r\n#Finding no of required cable cars of each colour\r\nr=r//2+r%2\r\ng=g//2+g%2\r\nb=b//2+b%2\r\n#finding arrival time and adding journey time\r\nr=(r-1)*3+30\r\ng=(g-1)*3+31\r\nb=(b-1)*3+32\r\nprint(max(r,b,g))", "def main():\n\tr, g, b = list(int(x) for x in input().split())\n\n\tcc_r = ceil(r/2)\n\tcc_g = ceil(g/2)\n\tcc_b = ceil(b/2)\n\n\tcc = [cc_b, cc_g, cc_r]\n\n\tlongest_cc = max(cc)\n\tlongest_cc_index = cc.index(longest_cc)\n\n\ttotal_time = 30 + ((longest_cc-1)*3)\n\n\tif longest_cc_index == 0:\n\t\ttotal_time+=2\n\telif longest_cc_index == 1:\n\t\ttotal_time+=1\n\telif longest_cc_index == 2:\n\t\ttotal_time+=0\n\n\tprint(total_time)\n\treturn\n\n\ndef ceil(n):\n\n\tif n%1 > 0:\n\t\tn+=1\n\n\treturn int(n)\n\n\nif __name__ == \"__main__\":\n\tmain()\n\t \t \t\t \t\t \t \t\t \t\t", "import math\r\ndef cable(r, g, b):\r\n\tr_m = math.ceil(r / 2)\r\n\tg_m = math.ceil(g / 2)\r\n\tb_m = math.ceil(b / 2)\r\n\t\r\n\tr_e = 30 + (0 + 3*(r_m - 1))\r\n\tg_e = 30 + (1 + 3*(g_m - 1))\r\n\tb_e = 30 + (2 + 3*(b_m - 1))\r\n\tif r_e > g_e and r_e > b_e:\r\n\t\treturn r_e\r\n\telif g_e > r_e and g_e > b_e:\r\n\t\treturn g_e\r\n\telif b_e > g_e and b_e > r_e:\r\n\t\treturn b_e\r\n\r\nr, g, b = map(int, input().split())\r\nprint(cable(r, g, b))\r\n", "a=input().split(' ')\r\nb=((max((int(a[0])+(int(a[0])%2)),(int(a[1])+(int(a[1])%2)),(int(a[2])+(int(a[2])%2))))/2)\r\nif b==(int(a[2])+(int(a[2])%2))/2:\r\n print(int(3*b+29))\r\nelif b==(int(a[1])+(int(a[1])%2))/2:\r\n print(int(3*b+28))\r\nelse:\r\n print(int(3*b+27))", "r, g, b = [int(i) for i in input().split()]\r\nprint(30 + max(3 * ((r - 1) // 2), 1 + 3 * ((g - 1) // 2), 2 + 3 * ((b - 1) // 2)))\r\n", "a,b,c = map(int,input().split())\r\nprint(max(27+3*((a+1)//2),28+3*((b+1)//2),29+3*((c+1)//2)))", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nr, g, b = map(int, input().split())\r\nans = max(\r\n (((r + 1) // 2) - 1) * 3,\r\n (((g + 1) // 2) - 1) * 3 + 1 if g else 0,\r\n (((b + 1) // 2) - 1) * 3 + 2 if b else 0\r\n) + 30\r\nprint(ans)\r\n", "r, g, b = map(int, input().split())\r\n\r\nr, g, b = r//2 + (r%2>0), g//2 + (g%2>0), b//2 + (b%2>0)\r\nx = max(r,g,b)\r\nc = 0\r\nif x == r:\r\n c = 3*(x-1)\r\nif x == g:\r\n c = 3*(x-1) + 1\r\nif x == b:\r\n c = 3*(x-1) + 2\r\nprint(c + 30)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 07/06/2023 21:58:50 Hanoi, Vietnam\r\n# **/\r\n\r\nr, g, b = map(int, input().split())\r\n\r\nprint(max([\r\n (r+1) // 2 * 3,\r\n (g+1) // 2 * 3 + 1,\r\n (b+1) // 2 * 3 + 2\r\n]) + 27)", "r,g,f=map(int,input().split())\r\nc=29\r\nwhile(1):\r\n c=c+1\r\n if r>=2:\r\n r=r-2\r\n elif r==1:\r\n r=r-1\r\n \r\n if r==0 and g==0 and f==0:\r\n break\r\n c=c+1\r\n if g>=2:\r\n g=g-2\r\n elif g==1:\r\n g=g-1\r\n if r==0 and g==0 and f==0:\r\n break\r\n c=c+1\r\n if f>=2:\r\n f=f-2\r\n elif f==1:\r\n f=f-1\r\n if r<=0 and g<=0 and f<=0:\r\n break\r\nprint(c)\r\n \r\n \r\n \r\n ", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nr,g,b = get_int_list()\r\n\r\nturn = 1\r\ntime = 0\r\nwhile True:\r\n if turn == 1: #red\r\n if r > 0:\r\n m = min(r,2)\r\n r -= m\r\n time += 1\r\n else:\r\n time += 1\r\n turn = 2\r\n elif turn == 2: #green\r\n if g > 0:\r\n m = min(g,2)\r\n time += 1\r\n g -= m\r\n else:\r\n time += 1\r\n turn = 3\r\n else: #blue\r\n if b > 0:\r\n m = min(b,2)\r\n time += 1\r\n b -= m\r\n else:\r\n time += 1\r\n turn = 1\r\n \r\n if r+g+b == 0:\r\n time += 29\r\n break\r\nprint(time)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nl=[int(i) for i in input().split()]\r\nfor i in range(3):\r\n l[i]=math.ceil(l[i]/2)\r\nm=max(l)\r\nfor i in range(2,-1,-1):\r\n if(l[i]==m):\r\n print(3*(m-1)+i+30)\r\n break", "r, g, b = map(int, input().split())\r\n\r\nrc = ((r + 1) // 2 - 1) * 3 + 0\r\ngc = ((g + 1) // 2 - 1) * 3 + 1\r\nbc = ((b + 1) // 2 - 1) * 3 + 2\r\n\r\nprint(30 + max(rc, gc, bc))", "from math import ceil\r\nr,g,b=map(int,input().split())\r\nr1,g1,b1=ceil(r/2),ceil(g/2),ceil(b/2)\r\nif r1<=b1>=g1:\r\n\tprint(30+(b1-1)*3+2)\r\nelif r1<=g1>=b1:\r\n\tprint(30+(g1-1)*3+1)\r\nelif g1<=r1>=b1:\r\n\tprint(30+(r1-1)*3)", "arr= list(map(int , input().split()))\r\ncount = 0\r\ni=0\r\nwhile sum(arr)!=0:\r\n if arr[i]>0:\r\n d = max(arr[i]-2 , 0)\r\n arr[i] = d\r\n count = count+1\r\n i = i +1\r\n if i==3:\r\n i = 0\r\nprint(count+29)", "r, g, b = list(map(int, input().split(' ')))\nr = ((r+1)//2 - 1) * 3\ng = ((g+1)//2 - 1) * 3 + 1\nb = ((b+1)//2 - 1) * 3 + 2\nres = max([r, g, b]) + 30\n\nprint(res)\n\n \t \t \t \t\t\t\t \t \t \t\t\t\t\t \t\t", "class CodeforcesTask90ASolution:\n def __init__(self):\n self.result = ''\n self.r_g_b = []\n\n def read_input(self):\n self.r_g_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n time = -1\n cable = 0\n while sum(self.r_g_b):\n self.r_g_b[cable] = max(0, self.r_g_b[cable] - 2)\n time += 1\n cable += 1\n if cable > 2:\n cable = 0\n time += 30\n self.result = str(time)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask90ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/90/A\n\"\"\"\n\nred, green, blue = [int(x) for x in input().split()]\n\n\ndef temps_arrivee_dernier(color, decalage=0):\n if color > 0:\n cabines = color // 2 + color % 2\n return 30 + (cabines - 1) * 3 + decalage\n return 0\n\n\nr = temps_arrivee_dernier(red)\ng = temps_arrivee_dernier(green, 1)\nb = temps_arrivee_dernier(blue, 2)\n\nprint(max(r, g, b))\n", "import math\r\n \r\ninput_data = input()\r\n\r\ndata = list(map(int, input_data.split(' ')))\r\n\r\ntime = 0\r\nindex = 0\r\n\r\ndef sumArr(arr):\r\n result = 0\r\n for element in arr:\r\n result += element\r\n return result\r\n\r\nwhile sumArr(data) != 0:\r\n num = data[index]\r\n\r\n for i in range(2):\r\n if num > 0:\r\n num -= 1\r\n data[index] = num\r\n \r\n if sumArr(data) == 0:\r\n print(time + 30)\r\n break\r\n\r\n time += 1\r\n index += 1\r\n\r\n if index == 3:\r\n index = 0# 1689320666.2978234", "r, g, b = map(int, input().split())\r\n\r\nx, c = 0, 0\r\n\r\nwhile r > 0 or g > 0 or b > 0:\r\n\tif r > 0:\r\n\t\tr -= 2\r\n\t\tc = 0\r\n\tif g > 0:\r\n\t\tg -= 2\r\n\t\tc = 1\r\n\tif b > 0:\r\n\t\tb -= 2\r\n\t\tc = 2\r\n\r\n\tx += 3\r\n\t\r\nprint(30 + (x - 3) + c)", "import sys\r\nimport math, itertools, collections\r\n\r\nr,g,b = map(int, input().split())\r\ni =0\r\n\r\nwhile(r>0 or g>0 or b>0):\r\n if i%3==0:\r\n r-=2\r\n elif i%3==1:\r\n g-=2\r\n else:\r\n b-=2\r\n i+=1\r\nprint(i+29)", "arr = list(map(int, input().split()))\r\ncounter = 0\r\ntime = 29\r\nwhile arr[0] > 0 or arr[1] > 0 or arr[2] > 0:\r\n index = counter % 3\r\n if arr[index] > 1:\r\n arr[index] -= 2\r\n elif arr[index] == 1:\r\n arr[index] -= 1\r\n counter += 1\r\n time += 1\r\nprint(time)", "import sys\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as cc\r\nfrom queue import Queue\r\nimport math\r\nimport itertools\r\ntry:\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\ninput = lambda: sys.stdin.buffer.readline().rstrip()\r\n\r\n\r\nr,g,b=map(int,input().split())\r\nprint(max(((r+1)//2-1)*3+30,((g+1)//2-1)*3+31,((b+1)//2-1)*3+32))", "import sys,math\r\norder = list(map(int,sys.stdin.readline().split()))\r\nm = -1\r\nseq = 0\r\nfor i in range(3):\r\n temp = math.ceil(order[i]/2)-1\r\n if m<=temp:\r\n m = temp\r\n seq = i\r\nprint(30+m*3+seq)\r\n", "from math import ceil\r\n\r\n[R,G,B] = [3*(ceil(int(i)/2)-1) for i in input().split()]\r\n\r\nprint(30 + max(R, G+1, B+2))\r\n", "def f(l):\r\n l = [(i-1)//2 for i in l]\r\n mx = 0\r\n mp = 0\r\n for i in range(3):\r\n if l[i] >= mx:\r\n mx = l[i]\r\n mp = i\r\n return 30 + mx*3 + mp\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "def main():\r\n\tr, g, b = map(int, input().split())\r\n\r\n\tarriving = 'red'\r\n\ttime = 30\r\n\twhile True:\r\n\t\tif r == 0 and g == 0 and b == 0:\r\n\t\t\tbreak\r\n\r\n\t\tif arriving == 'red':\r\n\t\t\tr = max(r - 2, 0)\r\n\t\t\tarriving = 'green'\r\n\t\t\ttime += 1\r\n\t\telif arriving == 'green':\r\n\t\t\tg = max(g - 2, 0)\r\n\t\t\tarriving = 'blue'\r\n\t\t\ttime += 1\r\n\t\telif arriving == 'blue':\r\n\t\t\tb = max(b - 2, 0)\r\n\t\t\tarriving = 'red'\r\n\t\t\ttime += 1\r\n\r\n\tprint(time - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "# coding: utf-8\r\nif __name__ == '__main__':\r\n temp = list(map(int, input().split(' ')))\r\n t = 0\r\n while sum(temp) > 0:\r\n temp[t % 3] = max(temp[t % 3]-2, 0)\r\n t += 1\r\n print(t+29)\r\n" ]

{"inputs": ["1 3 2", "3 2 1", "3 5 2", "10 10 10", "29 7 24", "28 94 13", "90 89 73", "0 0 1", "0 0 2", "0 1 0", "0 1 1", "0 1 2", "0 2 0", "0 2 1", "0 2 2", "1 0 0", "1 0 1", "1 0 2", "1 1 0", "1 1 1", "1 1 2", "1 2 0", "1 2 1", "1 2 2", "2 0 0", "2 0 1", "2 0 2", "2 1 0", "2 1 1", "2 1 2", "2 2 0", "2 2 1", "2 2 2", "4 5 2", "5 7 8", "13 25 19", "29 28 30", "45 52 48", "68 72 58", "89 92 90", "99 97 98", "89 97 2", "96 3 92", "1 99 87", "95 2 3", "2 97 3", "2 2 99", "100 100 100", "100 0 100", "0 100 100", "100 100 0", "100 0 0", "0 100 0", "0 0 100", "5 4 5"], "outputs": ["34", "33", "37", "44", "72", "169", "163", "32", "32", "31", "32", "32", "31", "32", "32", "30", "32", "32", "31", "32", "32", "31", "32", "32", "30", "32", "32", "31", "32", "32", "31", "32", "32", "37", "41", "67", "74", "106", "136", "166", "177", "175", "171", "178", "171", "175", "179", "179", "179", "179", "178", "177", "178", "179", "38"]}

UNKNOWN

PYTHON3

CODEFORCES

133

d4f238414fd52248994773b270d7e1bb

Routine Problem

Manao has a monitor. The screen of the monitor has horizontal to vertical length ratio *a*:*b*. Now he is going to watch a movie. The movie's frame has horizontal to vertical length ratio *c*:*d*. Manao adjusts the view in such a way that the movie preserves the original frame ratio, but also occupies as much space on the screen as possible and fits within it completely. Thus, he may have to zoom the movie in or out, but Manao will always change the frame proportionally in both dimensions. Calculate the ratio of empty screen (the part of the screen not occupied by the movie) to the total screen size. Print the answer as an irreducible fraction *p*<=/<=*q*. A single line contains four space-separated integers *a*, *b*, *c*, *d* (1<=≤<=*a*,<=*b*,<=*c*,<=*d*<=≤<=1000). Print the answer to the problem as "p/q", where *p* is a non-negative integer, *q* is a positive integer and numbers *p* and *q* don't have a common divisor larger than 1. Sample Input 1 1 3 2 4 3 2 2 Sample Output 1/3 1/4

[ "from math import gcd\r\nn=input().split()\r\nmovie_ratio=int(n[2])/int(n[3])\r\nscreen_ratio=int(n[0])/int(n[1])\r\nif movie_ratio>screen_ratio:\r\n i=0\r\nelse:\r\n i=1\r\ny=int(n[1-i])*int(n[i+2])-int(n[i])*int(n[3-i])\r\nif y!=0:\r\n z=int(n[i+2])*int(n[1-i])\r\n g=gcd(y,z)\r\n print(str(int(y/g))+'/'+str(int(z/g)))\r\nelse:\r\n t=1\r\n print('0/1')", "from math import gcd\na,b,c,d = [int(i) for i in input().split()]\n\nif a*d<b*c:\n r = (a,c)\nelse:\n r = (b,d)\n\nx,y = r\n\nu,v = a*b*y*y-c*d*x*x,a*b*y*y\nu,v = round(u/gcd(u,v)),round(v/gcd(u,v))\nprint(f\"{u}/{v}\")\n\n\n\n\n\n\t\t \t\t\t \t \t \t \t \t", "from math import lcm\r\nfrom fractions import Fraction\r\n# Input\r\na, b, c, d = map(int, input().split())\r\n\r\nscaling_factor1 = lcm(a,c)\r\nscaling_factor2 = lcm(b,d)\r\n\r\nempty_1 = abs((b*(scaling_factor1//a) - d*(scaling_factor1//c)))\r\nempty_2 = abs((a*(scaling_factor2//b) - c*(scaling_factor2//d)))\r\n\r\n#print(empty_1,empty_2, scaling_factor1, scaling_factor2)\r\nempty_ratio = empty_1\r\ntotal_ratio = max(b*(scaling_factor1//a), d*(scaling_factor1//c))\r\nif empty_ratio/total_ratio > empty_2/max(a*(scaling_factor2//b), c*(scaling_factor2//d)):\r\n empty_ratio = empty_2\r\n total_ratio = max(a*(scaling_factor2//b), c*(scaling_factor2//d))\r\n# Print the result as an irreducible fraction\r\nres = Fraction(empty_ratio,total_ratio)\r\n\r\nprint(f\"{res.numerator}/{res.denominator}\")\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Routine_Problem2():\r\n def compute_hcf(num1,num2):\r\n if num1 == 0:\r\n return num2 \r\n if num2 == 0:\r\n return num1\r\n \r\n if num1 < num2:\r\n x = num2 \r\n y = num1 \r\n else:\r\n x = num1 \r\n y = num2 \r\n \r\n while(y):\r\n x, y = y, x % y\r\n return x \r\n\r\n a,b,c,d = invr()\r\n \r\n emptySpace1 = (a*b) - ((b*b*c)/d)\r\n emptySpace2 = (a*b) - ((a*a*d)/c)\r\n\r\n if emptySpace2 < 0 :\r\n Nr = (a*b*d) - (b*b*c)\r\n Dr = (a*b*d)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n elif emptySpace1 < 0: \r\n Nr = (a*b*c) - (a*a*d)\r\n Dr = (a*b*c)\r\n #start = time.time()\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n #end = time.time() \r\n #print(end-start)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n \r\n elif emptySpace1 < emptySpace2:\r\n Nr = (a*b*d) - (b*b*c)\r\n Dr = (a*b*d)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n elif (emptySpace2 <= emptySpace1):\r\n Nr = (a*b*c) - (a*a*d)\r\n Dr = (a*b*c)\r\n hcf_2nums = compute_hcf(Nr,Dr)\r\n Nr_new = Nr//hcf_2nums\r\n Dr_new = Dr//hcf_2nums\r\n\r\n\r\n print(str(Nr_new)+'/'+str(Dr_new))\r\n return \r\n\r\nRoutine_Problem2()", "def gcd(a,b):\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\nl=input().split(' ')\r\na,b,c,d=int(l[0]),int(l[1]),int(l[2]),int(l[3])\r\nif a*d>b*c:\r\n p=a*d-b*c\r\n q=a*d\r\nelse:\r\n p=b*c-a*d\r\n q=b*c\r\ne=gcd(p,q)\r\np//=e\r\nq//=e\r\nprint(str(p) +\"/\"+str(q))", "from math import gcd as gc\r\n\r\na,b,c,d = (int(x) for x in input().split())\r\n\r\nif a*d > c * b :\r\n mov = c*b*b/d\r\n\r\n # unoc = ab - cbb/d\r\n p = a*b*d - c*b*b\r\n d = d*a*b\r\n print( str( p//gc(p,d))+'/'+str(d//gc(p,d)) )\r\n\r\nelif a*d < c*b :\r\n mov = d*a*a/c\r\n # unoc = ab - daa/c\r\n p = a*b*c - d*a*a\r\n c = c*a*b\r\n print(str(p//gc(p,c))+'/'+str(c//gc(p,c)))\r\n \r\nelse:\r\n print(\"0/1\")\r\n ", "a, b, c, d = map(int, input().split())\r\n\r\nnumerator = b*c\r\ndenominator = a*d\r\nif numerator > denominator:\r\n numerator, denominator = denominator, numerator\r\n\r\ndef gcd(a, b):\r\n if b <= 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\nd = gcd(numerator, denominator)\r\nnumerator /= d\r\ndenominator /= d\r\nprint(\"%d/%d\" % (denominator - numerator, denominator))\r\n", "from math import gcd\na, b, c, d = list(map(int, input().split()))\nif(a / b <= c / d):\n _gcd = gcd(b*c-a*d, b*c)\n print(f'{(b*c-a*d)//_gcd}/{b*c//_gcd}')\nelse:\n _gcd = gcd(a*d-b*c, a*d)\n print(f'{(a*d-b*c) // _gcd}/{a*d // _gcd}')", "import math\r\nn,k,l,m = map(int,input().split())\r\nk=k*l\r\nm=m*n\r\na=abs(k-m)\r\nb=max(k,m)\r\nx=math.gcd(a,b)\r\na//=x\r\nb//=x\r\nprint(a,\"/\",b,sep=\"\")\r\n", "from math import gcd\n\na, b, c, d = tuple(map(int, input().split()))\n\nara = a / b\narc = c / d\n\nif ara == arc:\n print(\"0/1\")\n raise SystemExit\nif ara > arc:\n num = a * d - b * c\n den = a * d\nelse:\n num = b * c - d * a\n den = b * c\n\ng = gcd(num, den)\nprint(f\"{num // g}/{den // g}\")\n", "def LCM(x, y):\r\n for i in range(max(x, y), (x * y) + 1):\r\n if (i % x == 0 and i % y == 0):\r\n return i\r\n return 1\r\n\r\nfrom math import gcd\r\n\r\ndef main(): \r\n a, b, c, d = list(map(int, input().split()))\r\n if (c == d): c, d = 1, 1\r\n if (a == b): a, b = 1, 1\r\n lcm = LCM(a, c)\r\n new_b = b * (lcm // a)\r\n new_d = d * (lcm // c)\r\n if (new_d < new_b):\r\n while (gcd(new_b, new_d) != 1):\r\n hcf = gcd(new_b, new_d)\r\n new_b = new_b // hcf\r\n new_d = new_d // hcf\r\n print(f'{new_b - new_d}/{new_b}')\r\n\r\n return\r\n\r\n lcm = LCM(b, d)\r\n a = a * (lcm // b)\r\n c = c * (lcm // d)\r\n while (gcd(a, c) != 1):\r\n hcf = gcd(a, c)\r\n a = a // hcf\r\n c = c // hcf\r\n print(f'{a - c}/{a}')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "a,b,c,d=map(int,input().split())\r\n\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nif a/b<c/d:\r\n x1=((b*c-a*d))\r\n x2=(b*c)\r\n\r\nelif a/b>c/d:\r\n x1=((a*d-b*c))\r\n x2=(a*d)\r\n\r\nelse:\r\n x1=0\r\n x2=1\r\n\r\nm=gcd(x1,x2)\r\n\r\nprint(str(x1//m)+\"/\"+str(x2//m))\r\n", "def gcd(a, b):\r\n if a == 0 or b == 0:\r\n return a + b\r\n return gcd(b, a % b)\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nif a * d >= b * c:\r\n x, y = d * a - b * c, a * d\r\n g = gcd(x, y)\r\n print(x // g, y // g, sep='/')\r\nelse:\r\n x, y = b * c - d * a, b * c \r\n g = gcd(x, y)\r\n print(x // g, y // g, sep='/')" ]

{"inputs": ["1 1 3 2", "4 3 2 2", "3 4 2 3", "4 4 5 5", "1 1 1 1", "1000 1000 1000 1000", "125 992 14 25", "999 998 997 996", "984 286 976 284", "999 1000 1000 999", "999 1000 998 999", "1 1000 1000 1", "1 999 1000 1", "50 80 6 3", "114 891 20 3", "10 13 75 57", "21 35 34 51", "41 95 82 30", "123 150 82 60", "100 175 164 82", "101 202 37 72", "103 305 34 61", "100 131 70 77", "193 246 82 95", "188 199 121 123", "289 361 162 198", "294 356 178 185", "201 335 268 402", "202 404 404 505", "206 412 309 515", "803 949 657 730", "804 938 871 938", "826 944 826 885", "603 938 804 871"], "outputs": ["1/3", "1/4", "1/9", "0/1", "0/1", "0/1", "10763/13888", "1/497503", "10/8733", "1999/1000000", "1/998001", "999999/1000000", "998999/999000", "11/16", "971/990", "27/65", "1/10", "16/19", "2/5", "5/7", "1/37", "67/170", "21/131", "1837/20172", "955/24079", "70/3249", "4489/31684", "1/10", "3/8", "1/6", "7/117", "1/13", "1/16", "17/56"]}

UNKNOWN

PYTHON3

CODEFORCES

13

d4f7e1eed1a5f669bc061ada8368101c

Merge Equals

You are given an array of positive integers. While there are at least two equal elements, we will perform the following operation. We choose the smallest value $x$ that occurs in the array $2$ or more times. Take the first two occurrences of $x$ in this array (the two leftmost occurrences). Remove the left of these two occurrences, and the right one is replaced by the sum of this two values (that is, $2 \cdot x$). Determine how the array will look after described operations are performed. For example, consider the given array looks like $[3, 4, 1, 2, 2, 1, 1]$. It will be changed in the following way: $[3, 4, 1, 2, 2, 1, 1]~\rightarrow~[3, 4, 2, 2, 2, 1]~\rightarrow~[3, 4, 4, 2, 1]~\rightarrow~[3, 8, 2, 1]$. If the given array is look like $[1, 1, 3, 1, 1]$ it will be changed in the following way: $[1, 1, 3, 1, 1]~\rightarrow~[2, 3, 1, 1]~\rightarrow~[2, 3, 2]~\rightarrow~[3, 4]$. The first line contains a single integer $n$ ($2 \le n \le 150\,000$) — the number of elements in the array. The second line contains a sequence from $n$ elements $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^{9}$) — the elements of the array. In the first line print an integer $k$ — the number of elements in the array after all the performed operations. In the second line print $k$ integers — the elements of the array after all the performed operations. Sample Input 7 3 4 1 2 2 1 1 5 1 1 3 1 1 5 10 40 20 50 30 Sample Output 4 3 8 2 1 2 3 4 5 10 40 20 50 30

[ "\nn = int(input())\nnumbers = list(map(int,input().split()))\npos = {}\ni=0\nremoved = 0\nwhile i<n:\n\n if numbers[i] not in pos or pos[numbers[i]] == -1:\n pos[numbers[i]] = i\n i+=1\n else:\n numbers[pos[numbers[i]]] = -1\n pos[numbers[i]] = -1\n numbers[i] *= 2\n removed+=1\n \nprint(n-removed)\nfor i in numbers:\n if i != -1:\n print(\"%d \"%(i), end='')\nprint()\n\t \t\t \t\t\t \t \t \t \t \t \t \t\t", "import sys\nif locals()['__file__'][-2:] == 'py':\n sys.stdin = open('in.txt', 'r')\nn = int(input())\nd = {}\nfor i, x in enumerate(map(int, input().split())):\n t = d.get(x, [])\n while t:\n i = max(i, d[x].pop())\n x *= 2\n t = d.get(x, [])\n else:\n d[x] = [i]\nb = [0] * n\nfor x, y in d.items():\n for i in y:\n b[i] = x\nr = []\nfor x in b:\n if x:\n r.append(x)\nprint(len(r))\nprint(*r)\n", "from queue import deque\r\nimport sys\r\n\r\n\r\n\r\ndef process(arr):\r\n trackers = dict()\r\n arr = [elm for elm in arr] # Shallow copy\r\n\r\n for i in range(len(arr)):\r\n while True:\r\n prev_occ = trackers.get(arr[i], deque())\r\n if len(prev_occ) == 0:\r\n prev_occ.append(i)\r\n trackers[arr[i]] = prev_occ\r\n break\r\n first_occ = prev_occ.popleft()\r\n arr[first_occ] = None\r\n arr[i] = arr[i] * 2\r\n\r\n return [elm for elm in arr if elm is not None]\r\n\r\n\r\n\r\nn = int(sys.stdin.readline())\r\narr = [int(elm) for elm in sys.stdin.readline().split()]\r\nres = process(arr)\r\nprint(len(res))\r\nprint(' '.join([str(elm) for elm in res]))", "n = int(input())\nline = input().split()\ndic = {}\nans = [0] * n\nhow_many = 0\n\nindex = 0\nfor word in line:\n num = int(word)\n while num in dic:\n if dic[num] == -1:\n break\n else:\n how_many += 1\n ans[dic[num]] = 0\n dic[num] = -1\n num *= 2\n dic[num] = index\n ans[index] = num\n index += 1\n\nprint(n - how_many)\nfor num in ans:\n if num != 0:\n print(num, end=' ')\nprint()\n\t \t\t \t \t\t \t \t\t \t \t", "input()\na={}\nfor i in list(map(int,input().split())):\n while i in a:\n del a[i]\n i*=2\n a[i]=1\nprint(len(a))\nprint(*a)\n\n\n\t\t\t\t \t \t \t\t \t\t \t\t \t\t \t", "from collections import defaultdict\r\nfrom heapq import *\r\ndef f(a):\r\n\tvis=[\"\"]*len(a)\r\n\tind=defaultdict(list)\r\n\tfor i in range(len(a)):\r\n\t\tif len(ind[a[i]])==0:\r\n\t\t\theapify(ind[a[i]])\r\n\t\theappush(ind[a[i]],i)\r\n\tst=list(ind.keys())\r\n\theapify(st)\r\n\tcnt=0\r\n\twhile st:\r\n\t\ti=heappop(st)\r\n\t\twhile ind[i]:\r\n\t\t\tif len(ind[i])==1:\r\n\t\t\t\tt=heappop(ind[i])\r\n\t\t\t\tvis[t]=str(i)\r\n\t\t\t\tcnt+=1\r\n\t\t\telse:\r\n\t\t\t\tt1=heappop(ind[i])\r\n\t\t\t\tt2=heappop(ind[i])\r\n\t\t\t\tvis[t1]=\"\"\r\n\t\t\t\tif ind.get(2*i,None)==None:\r\n\t\t\t\t\theappush(st,2*i)\r\n\t\t\t\theappush(ind[i*2],t2)\r\n\tprint(cnt)\r\n\tprint(*vis,sep=\" \")\r\n\r\na=input()\r\nl=list(map(int,input().strip().split()))\r\nf(l)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nfrom heapq import *\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nv = []\r\nC = set(A)\r\nfor c in C:\r\n heappush(v,c)\r\n\r\nlib = defaultdict(list)\r\nfor i,a in enumerate(A):\r\n heappush(lib[a], i)\r\n\r\nwhile v:\r\n i = heappop(v)\r\n while len(lib[i])>1:\r\n a = heappop(lib[i])\r\n b = heappop(lib[i])\r\n t = i*2\r\n heappush(lib[t],b)\r\n if t not in C:\r\n C.add(t)\r\n heappush(v, t)\r\n \r\nB = []\r\nfor k,v in lib.items():\r\n if v:\r\n B.append((v[0],k))\r\nB.sort()\r\nprint(len(B))\r\nprint(*[c for i,c in B])\r\n \r\n \r\n", "from heapq import heappush, heappop\n\ndef main():\n heap = []\n for i in range(10, 0, -1):\n heappush(heap, (i, -i))\n\n print(heap)\n while(heap):\n print(heappop(heap), end = \" \")\n print()\n\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n heap = []\n for idx, i in enumerate(arr):\n heappush(heap, (i, idx))\n\n ans = [-1 for x in range(0, n)]\n cnt = 0\n while(heap):\n cur = heappop(heap)\n if(len(heap) == 0):\n ans[cur[1]] = cur[0]\n break\n nxt = heappop(heap)\n if(cur[0] == nxt[0]):\n heappush(heap, (2 * nxt[0], nxt[1]))\n cnt += 1\n else:\n heappush(heap, nxt)\n ans[cur[1]] = cur[0]\n\n print(n - cnt)\n for i in ans:\n if(i == -1):continue\n print(i, end = \" \")\n print()\n\nsolve()\n", "import heapq\n\ndef update(d, h, n, i):\n l = d.setdefault(n, [])\n heapq.heappush(l, i)\n if len(l) == 2:\n heapq.heappush(h, n)\n\ndef main(nums):\n d = {}\n h = []\n\n for i, n in enumerate(nums):\n update(d, h, n, i)\n\n while h:\n m = heapq.heappop(h)\n l = d[m]\n assert len(l) >= 2\n i = heapq.heappop(l)\n j = heapq.heappop(l)\n nums[i] = -1\n nums[j] = 2 * nums[j]\n if len(l) >= 2:\n heapq.heappush(h, m)\n\n update(d, h, nums[j], j)\n\n\n res = [ str(n) for n in nums if n != -1 ]\n print(len(res))\n print(' '.join(res))\n\n_ = input()\nnums = list(map(int, input().split()))\nmain(nums)\n\n", "input()\r\na = {}\r\nfor i in list(map(int,input().split())):\r\n while i in a:\r\n del a[i]\r\n i *= 2\r\n a[i] = 1\r\nprint(len(a))\r\nprint(*a)# 1698329597.4687905", "import sys\r\nfrom collections import defaultdict\r\nfrom heapq import heappush, heappop\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndic = defaultdict(list)\r\nfor i, x in enumerate(a):\r\n dic[x].append(i)\r\n\r\nhq = sorted(dic.keys())\r\nwhile hq:\r\n key = heappop(hq)\r\n if len(dic[key]) <= 1:\r\n continue\r\n if key*2 not in dic:\r\n heappush(hq, key*2)\r\n\r\n dic[key].sort()\r\n for i in range(1, len(dic[key]), 2):\r\n a[dic[key][i-1]] = 0\r\n a[dic[key][i]] = key*2\r\n dic[key*2].append(dic[key][i])\r\n\r\n\r\na = [x for x in a if x != 0]\r\nprint(len(a))\r\nprint(*a)\r\n", "from collections import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom copy import deepcopy\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\nmem, dis = defaultdict(list), Counter(a)\r\n\r\nfor i in range(n):\r\n mem[a[i]].append(i)\r\n\r\nqueue = list(mem.items())\r\nheapify(queue)\r\n\r\nwhile queue:\r\n ele = heappop(queue)\r\n\r\n for i in range(1, len(ele[1]), 2):\r\n a[ele[1][i]] *= 2\r\n a[ele[1][i - 1]] = 0\r\n insort_right(mem[ele[0] * 2], ele[1][i])\r\n\r\n if not dis[ele[0] * 2] and mem[ele[0] * 2]:\r\n heappush(queue, (ele[0] * 2, mem[ele[0] * 2]))\r\n\r\nnew = list(filter(lambda x: x, a))\r\nprint(len(new))\r\nprint(*new)", "n=int(input())\na=list(map(int,input().split()))\ndict={}\nfor i in range(n):\n while a[i] in dict:\n # ~ print(a[i])\n del dict[a[i]]\n a[i]*=2\n dict[a[i]]=1\nprint(len(dict))\nprint(*dict)\n\n\t \t \t\t \t\t \t\t\t \t \t \t \t\t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor x in a:\r\n while x in d:\r\n del d[x]\r\n x *= 2\r\n d[x] = 0\r\n\r\nprint(len(d))\r\nprint(*d)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx={}\r\nfor i in range(n):\r\n while a[i] in x:\r\n del x[a[i]]\r\n a[i]*=2\r\n x[a[i]]=i\r\nprint(len(x))\r\nprint(*x)", "n = int(input())\r\nls = list(map(int, input().split()))\r\n \r\ndic = {}\r\nfor i in range(n):\r\n while ls[i] in dic:\r\n del dic[ls[i]]\r\n ls[i] *= 2\r\n dic[ls[i]] = i\r\n \r\nprint(len(dic))\r\nprint(*dic)\r\n", "n=int(input())\n\na = list(map(int , input().split()))\nnew={}\n\nfor i in range(n):\n num=a[i]\n while num in new:\n #print(new)\n del new[num]\n num*=2\n\n\n new[num]=i\n\n\n\n#print(new)\n\nprint(len(new))\nprint(*list(new.keys()))", "from collections import defaultdict\nfrom heapq import *\ndef f(a):\n\tvis=[\"\"]*len(a)\n\tind=defaultdict(list)\n\tfor i in range(len(a)):\n\t\tif len(ind[a[i]])==0:\n\t\t\theapify(ind[a[i]])\n\t\theappush(ind[a[i]],i)\n\tst=list(ind.keys())\n\theapify(st)\n\tcnt=0\n\twhile st:\n\t\ti=heappop(st)\n\t\twhile ind[i]:\n\t\t\tif len(ind[i])==1:\n\t\t\t\tt=heappop(ind[i])\n\t\t\t\tvis[t]=str(i)\n\t\t\t\tcnt+=1\n\t\t\telse:\n\t\t\t\tt1=heappop(ind[i])\n\t\t\t\tt2=heappop(ind[i])\n\t\t\t\tvis[t1]=\"\"\n\t\t\t\tif ind.get(2*i,None)==None:\n\t\t\t\t\theappush(st,2*i)\n\t\t\t\theappush(ind[i*2],t2)\n\tprint(cnt)\n\tprint(*vis,sep=\" \")\n\na=input()\nl=list(map(int,input().strip().split()))\nf(l)\n\t\t \t\t\t \t \t\t\t \t\t \t\t \t\t \t\t\t\t", "n = int(input())\na = list(map(int,input().split()))\nd = {}\ni = 0\nwhile i<n:\n\tnum = a[i]\n\twhile num in d:\n\t\ta[d[num]] = -1\n\t\tdel d[num]\n\t\tnum = num*2\n\td[num] = i\n\ta[i] = num\n\ti += 1\nans = []\nfor i in a:\n\tif i!=-1:\n\t\tans.append(i)\nprint (len(ans))\nprint (*ans)\n", "n = int(input())\na = [int(x) for x in input().split()]\nd = {}\nfor i in range(n):\n while a[i] in d:\n d.pop(a[i])\n a[i] *= 2\n d[a[i]] = i\nprint(len(d))\nprint(*d)\n", "from collections import defaultdict\r\nimport heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = []\r\nd = defaultdict(lambda : [])\r\nfor i in range(n):\r\n d[a[i]].append(i)\r\nfor i in d.keys():\r\n heapq.heappush(h, i)\r\nwhile h:\r\n i = heapq.heappop(h)\r\n d[i].sort(reverse = True)\r\n l = len(d[i])\r\n if l == 1:\r\n continue\r\n for _ in range(l // 2):\r\n x, y = d[i].pop(), d[i].pop()\r\n a[x] = 0\r\n a[y] = 2 * i\r\n d[2 * i].append(y)\r\n heapq.heappush(h, 2 * i)\r\nans = []\r\nfor i in a:\r\n if i:\r\n ans.append(i)\r\nk = len(ans)\r\nprint(k)\r\nprint(*ans)", "n=int(input())\r\nd={}\r\nfor i,x in enumerate(list(map(int,input().split()))):\r\n while x in d:\r\n del d[x]\r\n x*=2\r\n d[x]=i\r\nprint(len(d))\r\nprint(*d)", "n = 0\nwhile True:\n try:\n n = int(input())\n except:\n break\n mp = dict()\n a = list()\n ans = list()\n a = input().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n for i in range(n):\n if a[i] in mp.keys():\n while a[i] in mp.keys():\n t = mp.get(a[i])\n a[t] = -1 \n mp.pop(a[i])\n a[i] <<= 1\n mp[a[i]] = int(i)\n for i in a:\n if i != -1:\n ans.append(i)\n print(len(ans))\n print(*ans,sep = ' ')\n", "if __name__==\"__main__\":\n n=int(input())\n a={}\n for x in map(int,input().split()):\n while x in a:\n del a[x]\n x*=2\n a[x]=1;\n print(len(a))\n print(*a) \n\t \t\t\t\t\t \t\t \t \t \t \t \t \t", "# size of array decreases by 1 each time, we can just simulate\r\n# maintain priority queue on position for each value, merge from smallest to largest\r\n# push result into array, sort then print\r\n\r\nfrom heapq import *\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nvals = []\r\nheapify(vals)\r\npos = dict()\r\nfor i in range(n):\r\n if a[i] in pos:\r\n heappush(pos[a[i]], i)\r\n else:\r\n pos[a[i]] = [i]\r\n heapify(pos[a[i]])\r\n heappush(vals, a[i])\r\nwhile vals:\r\n num = heappop(vals)\r\n while len(pos[num]) >= 2:\r\n a = heappop(pos[num])\r\n b = heappop(pos[num])\r\n if num*2 in pos:\r\n heappush(pos[num*2], b)\r\n else:\r\n pos[num*2] = [b]\r\n heapify(pos[num*2])\r\n heappush(vals, num*2)\r\nwithpos = []\r\nfor i in pos.keys():\r\n for j in pos[i]:\r\n withpos.append((j, i))\r\nwithpos.sort()\r\nprint(len(withpos))\r\nprint(*[i[1] for i in withpos])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n while a[i] in d:\r\n del d[a[i]]\r\n a[i]*=2\r\n d[a[i]]=i\r\nprint(len(d))\r\nprint(*d,sep=\" \")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n a=i\r\n while a in d:\r\n del d[a]\r\n a*=2 \r\n d[a]=1\r\nprint(len(d)) \r\nfor i in d:\r\n print(i,end=\" \")\r\n ", "import bisect\r\n\r\nn = int(input())\r\ninput_str = input().split()\r\n\r\n# import random\r\n# n = 150000\r\n# input_str = \" \".join([str(random.randrange(1000000)) for x in range(n)]).split()\r\n\r\n# import time\r\n# total_time1 = 0.\r\n# total_time2 = 0.\r\n\r\n\r\nnumbers = [int(x) for x in input_str]\r\n\r\nindices = dict()\r\n\r\nfor i in range(n):\r\n if numbers[i] not in indices:\r\n indices[numbers[i]] = [i]\r\n else:\r\n indices[numbers[i]].append(i)\r\n\r\n\r\ndef insert_sorted(arr, e, l, r):\r\n if l == r:\r\n if arr[l] >= e:\r\n arr.insert(l, e)\r\n return\r\n else:\r\n arr.insert(l + 1, e)\r\n return\r\n\r\n c = (l + r) // 2\r\n\r\n if arr[c] < e:\r\n return insert_sorted(arr, e, c + 1, r)\r\n else:\r\n return insert_sorted(arr, e, l, c)\r\n\r\n\r\nnumber_list = sorted(list(indices))\r\nnumber_index = 0\r\nwhile number_index < len(number_list):\r\n number = number_list[number_index]\r\n\r\n\r\n need_add = False\r\n double = number * 2\r\n\r\n indices[number] = sorted(indices[number])\r\n\r\n # curr_time = time.time()\r\n\r\n for op_i in range(len(indices[number]) // 2):\r\n fir_i = indices[number][op_i * 2]\r\n sec_i = indices[number][op_i * 2 + 1]\r\n\r\n numbers[fir_i] = 0\r\n numbers[sec_i] = double\r\n\r\n if double not in indices:\r\n indices[double] = [sec_i]\r\n need_add = True\r\n else:\r\n indices[double].append(sec_i)\r\n\r\n # new_time = time.time()\r\n # total_time1 += new_time - curr_time\r\n # curr_time = new_time\r\n\r\n if need_add:\r\n insert_sorted(number_list, double, number_index, len(number_list) - 1)\r\n\r\n # new_time = time.time()\r\n # total_time2 += new_time - curr_time\r\n # curr_time = new_time\r\n\r\n #print(total_time1, total_time2)\r\n\r\n number_index += 1\r\n\r\n\r\n\r\noutput = [str(x) for x in numbers if x > 0]\r\n\r\nprint(len(output))\r\nprint(\" \".join(output))", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = list(map(int,input().split()))\nh=[];heapify(h)\ndic = defaultdict(set)\nfor i in range(N):\n dic[A[i]].add(i)\n heappush(h,[A[i],i])\n\nwhile h:\n x,i = heappop(h)\n if h:\n x1,i1 = heappop(h)\n if x1!=x:\n heappush(h,[x1,i1])\n continue\n else:\n dic[x].remove(i)\n dic[x].remove(i1)\n dic[x1*2].add(i1)\n heappush(h,[x1*2,i1])\nl = []\nfor i in dic:\n for j in dic[i]:\n l.append([j,i])\nl.sort()\nans = []\nfor i,b in l:\n ans.append(b)\nprint(len(ans))\nprint(*ans)", "from heapq import *\r\n\r\n\r\nclass priority_queue(object):\r\n\r\n def __init__(self):\r\n self.que = []\r\n heapify(self.que)\r\n \r\n def push(self, obj):\r\n heappush(self.que, obj)\r\n \r\n def pop(self):\r\n return heappop(self.que)\r\n \r\n def top(self):\r\n return self.que[0]\r\n\r\n def __bool__(self):\r\n return bool(self.que)\r\n\r\n def __repr__(self):\r\n return repr(self.que)\r\n\r\n def __len__(self):\r\n return len(self.que)\r\n\r\n\r\nm = {}\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i, _ in enumerate(a):\r\n m.setdefault(_, priority_queue()).push(i)\r\nque = priority_queue()\r\nfor k, v in m.items():\r\n que.push(k)\r\nwhile que:\r\n cur = que.pop()\r\n if len(m[cur]) <= 1:\r\n continue\r\n while len(m[cur]) > 1:\r\n m[cur].pop()\r\n m.setdefault(cur << 1, priority_queue()).push(m[cur].pop())\r\n que.push(cur << 1)\r\nl = [(k, v.top()) for k, v in m.items() if v]\r\nl.sort(key = lambda x: x[1])\r\nprint(len(l))\r\nfor k, v in l:\r\n print(k, end = ' ')", "from collections import OrderedDict\nn=int(input())\na=[int(x) for x in input().split()]\nd=OrderedDict()\nfor x in a:\n\tt=x\n\twhile t in d:\n\t\tdel d[t]\n\t\tt*=2\n\td[t]=1\nprint(len(d))\nprint(*d)\n", "import sys\n# sys.setrecursionlimit(10**6) \ninput=sys.stdin.readline\nt=int(input())\n\na=list(map(int,input().split(\" \")))\nd = {}\nb = []\nfor i in a:\n b.append(i)\nfor i in range(t):\n curr = a[i]\n while True:\n if(d.get(curr,-1)==-1):\n d[curr] = i\n break\n else:\n ind = d[curr]\n b[ind] = -1\n del d[curr]\n b[i] = 2*curr\n if(d.get(b[i],-1)==-1):\n d[b[i]] = i\n break\n curr = 2*curr\n # print(b)\nans = []\n\nfor i in b:\n if(i !=-1):\n ans.append(str(i))\nprint(len(ans))\nprint(\" \".join(ans))\n\n", "# Eric Kirchgessner\n# Tarea 1 Ejercicio 4\n# D - Merge Equals\n# finalmente, un ejercicio resolvible ne python??\n\nimport sys\n\n# Input\nn = int(sys.stdin.readline())\narray = [int(x) for x in sys.stdin.readline().split()]\narray_dict = {}\n\n# this might depend on dictionaries staing sorted??\nfor i in range(len(array)):\n number = array[i]\n while number in array_dict:\n del array_dict[number]\n number *= 2\n array_dict[number] = i\n\n# Output\nans_string = \"\"\nans_number = 0\nfor key in array_dict:\n ans_string += str(key) + \" \"\n ans_number += 1\nprint(ans_number)\nprint(ans_string[:-1])\n\n \t\t \t\t \t \t\t\t\t\t \t \t\t \t\t\t\t\t", "n = int(input())\nd = {}\nfor i, x in enumerate(map(int, input().split())):\n while d.get(x, -1) >= 0:\n del d[x]\n x *= 2\n d[x] = i\nprint(len(d))\nprint(*d)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(n):\r\n while a[i] in b:\r\n del b[a[i]]\r\n a[i]*=2\r\n b[a[i]]=i\r\nprint(len(b))\r\nprint(*b)", "def main():\r\n \r\n input()\r\n arr = list(map(int, input().split()))\r\n\r\n dict = {}\r\n\r\n for i in range(len(arr)):\r\n item = arr[i]\r\n while item in dict:\r\n del dict[item]\r\n item *= 2\r\n dict[item] = i\r\n\r\n numbers = [str(x[0]) for x in sorted(dict.items(), key=lambda x: x[1])]\r\n print(len(numbers))\r\n print(' '.join(numbers))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,a,q=int(input()),list(map(int,input().split())),{}\r\nfor i in range(n):\r\n if a[i] not in q:q[a[i]]=i\r\n else:\r\n while a[i] in q:\r\n a[q[a[i]]]=0\r\n q.pop(a[i])\r\n a[i]*=2\r\n q[a[i]]=i\r\na=[i for i in a if i!=0]\r\nprint(len(a),\"\\n\",*a)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nimport heapq\r\nq = []\r\nheapq.heapify(q)\r\nfor i, a in enumerate(A):\r\n heapq.heappush(q, (a, i))\r\nB = []\r\nwhile q:\r\n if len(q) >= 2:\r\n v, i = heapq.heappop(q)\r\n if q[0][0] == v:\r\n v, j = heapq.heappop(q)\r\n heapq.heappush(q, (2*v, j))\r\n else:\r\n B.append((v, i))\r\n else:\r\n v, i = heapq.heappop(q)\r\n B.append((v, i))\r\n#print(B)\r\nB.sort(key=lambda x: x[1])\r\nans = []\r\nfor a,i in B:\r\n ans.append(a)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nvals = {}\r\n\r\nfor i in range(n):\r\n while a[i] in vals:\r\n del vals[a[i]]\r\n a[i] *= 2\r\n vals[a[i]] = i\r\nprint(len(vals))\r\nprint(*vals)", "n=int(input())\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nb=set()\r\nls=[]\r\ni=0\r\nwhile i<n:\r\n if(a[i] not in b):\r\n b.add(a[i])\r\n ls.append(a[i])\r\n i+=1\r\n else:\r\n while a[i] in b:\r\n b.remove(a[i])\r\n a[i]*=2\r\n ls.append(a[i]) \r\nans=[]\r\nc=set()\r\nfor i in range(len(ls)):\r\n if(ls[-i-1] in b and ls[-i-1] not in c):\r\n ans.append(ls[-i-1])\r\n c.add(ls[-i-1])\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[-i-1],end=\" \")", "#Have duplicated\r\nn = int(input())\r\nd = {}\r\nfor _, i in enumerate(list(map(int, input().split()))):\r\n while i in d:\r\n del d[i]\r\n i *= 2\r\n d[i] = _\r\nprint(len(d))\r\nprint(*d)", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\nn, = gil()\r\na = gil()\r\nidx = {}\r\nfor i in range(n):\r\n\tif a[i] in idx:\r\n\t\tidx[a[i]].append(i)\r\n\telse:\r\n\t\tidx[a[i]] = [i]\r\n\r\nh = []\r\nfor v in idx:\r\n\tif len(idx[v]) > 1:\r\n\t\th.append(v)\r\n\r\nheapify(h)\r\n\r\nwhile h:\r\n\tv = heappop(h)\r\n\tidxs = idx[v]\r\n\tidxs.sort()\r\n\r\n\r\n\tnv = 2*v\r\n\t# print(v, nv, h, a, idxs)\r\n\tidx[nv] = idx.get(nv, [])\r\n\ttemp = idx[nv]\r\n\tprevLen = len(temp)\r\n\r\n\tfor i in range(1, len(idxs), 2):\r\n\t\tl, r = idxs[i-1], idxs[i]\r\n\t\ta[l] = 0\r\n\t\ta[r] *= 2\r\n\t\ttemp.append(r)\r\n\r\n\tif prevLen < 2 and len(temp) > 1:\r\n\t\theappush(h, nv)\r\n\r\n\tidx[nv] = temp\r\n\r\nans = []\r\nfor v in a:\r\n\tif v:\r\n\t\tans.append(v)\r\n\r\nprint(len(ans))\r\nprint(*ans, sep=' ')\r\n", "input()\r\na={}\r\nfor i, x in enumerate(map(int, input().split())):\r\n while x in a:\r\n del a[x]\r\n x*=2\r\n a[x]=i\r\nprint(len(a))\r\nprint(*a)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nd = {}\nfor i in range(n):\n num = a[i]\n while num in d:\n a[d[num]] = -1\n del d[num]\n num = num * 2\n d[num] = i\n a[i] = num\nans = []\nfor i in a:\n if i != -1:\n ans.append(i)\nprint(len(ans))\nprint(*ans)\n\n \t\t\t\t\t\t\t\t \t\t \t \t \t \t \t\t \t" ]

{"inputs": ["7\n3 4 1 2 2 1 1", "5\n1 1 3 1 1", "5\n10 40 20 50 30", "100\n10 10 15 12 15 13 15 12 10 10 15 11 13 14 13 14 10 13 12 10 14 12 13 11 14 15 12 11 11 15 12 12 11 14 14 14 15 10 10 15 15 13 13 15 10 12 14 10 12 13 11 15 11 13 14 12 10 12 11 14 13 15 13 15 13 14 14 11 12 13 11 14 10 10 15 10 15 12 15 12 13 10 11 13 15 11 10 12 10 12 14 14 13 12 14 10 12 13 11 13", "2\n1000000000 1000000000", "3\n500000000 500000000 1000000000", "9\n8 536870913 536870913 536870913 536870913 536870913 536870913 536870913 536870913", "34\n967614464 967614464 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000"], "outputs": ["4\n3 8 2 1 ", "2\n3 4 ", "5\n10 40 20 50 30 ", "12\n88 240 15 44 160 192 208 224 20 24 11 26 ", "1\n2000000000 ", "1\n2000000000 ", "2\n8 4294967304 ", "2\n1935228928 32000000000 "]}

UNKNOWN

PYTHON3

CODEFORCES

44

d4fcaa5a12e174eeb47b6b1519863b94

Initial Bet

There are five people playing a game called "Generosity". Each person gives some non-zero number of coins *b* as an initial bet. After all players make their bets of *b* coins, the following operation is repeated for several times: a coin is passed from one player to some other player. Your task is to write a program that can, given the number of coins each player has at the end of the game, determine the size *b* of the initial bet or find out that such outcome of the game cannot be obtained for any positive number of coins *b* in the initial bet. The input consists of a single line containing five integers *c*1,<=*c*2,<=*c*3,<=*c*4 and *c*5 — the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0<=≤<=*c*1,<=*c*2,<=*c*3,<=*c*4,<=*c*5<=≤<=100). Print the only line containing a single positive integer *b* — the number of coins in the initial bet of each player. If there is no such value of *b*, then print the only value "-1" (quotes for clarity). Sample Input 2 5 4 0 4 4 5 9 2 1 Sample Output 3 -1

[ "def main():\r\n v = [int(i) for i in input().split()]\r\n s = sum(v)\r\n if s % 5 == 0 and s != 0:\r\n print(s // 5)\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b, c, d, e=map(int, input().split())\r\nsum=a+b+c+d+e\r\nif(sum%5==0 and sum!=0):\r\n print(sum//5)\r\nelse:\r\n print(-1)\r\n \r\n ", "x=[int(x) for x in input().split()]; print(sum(x)//5 if sum(x)%5==0 and sum(x) else -1)", "a,b,c,d,e = list(map(int, input().split()))\r\n\r\nx = a+b+c+d+e\r\n\r\nif x<5:\r\n print(-1)\r\nelif x%5==0:\r\n print(x//5)\r\nelse:\r\n print(-1)", "import sys\ninput = sys.stdin.readline\n\nB = sum(map(int, input().split()))/5\nif B == int(B) : print(-1 if B == 0 else int(B))\nelse : print(-1)\n", "a,b,c,d,e = map(int,input().split())\r\nif a==b==c==d==e==0:\r\n print(-1)\r\nelif (a+b+c+d+e)%5==0 and a>=0 and b>=0 and c>=0 and d>=0 and e>=0:\r\n print(int((a+b+c+d+e)/5))\r\nelse:\r\n print(-1)", "def solve(l):\r\n s= sum(l)\r\n if s==0:\r\n print(-1)\r\n return\r\n if s%5==0:\r\n print(s//5)\r\n else:\r\n print(-1)\r\n \r\n\r\ndef main():\r\n l = list(map(int, input().split()))\r\n solve(l)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = list(map(int, input().split()))\r\nm = sum(x)\r\nif(m > 0):\r\n if(m%5 == 0):\r\n print(m//5)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "c1, c2, c3, c4, c5 = map(int, input().split())\r\nc1 = c1 + c2 + c3 + c4 + c5\r\nif c1 % 5 == 0 and c1 != 0:\r\n print(c1 // 5)\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nl=[int(i) for i in input().split()]\r\nn=len(l)\r\ns=sum(l)\r\nif(s%n==0 and s>0):\r\n print(s//n)\r\nelse:\r\n print(-1)", "s=[int(i) for i in input().split()]\r\nprint([-1,sum(s)//5][sum(s)%5==0 and sum(s)!=0])", "people = list(map(int, input().split()))\r\ntotal = sum(people)\r\nif total % 5 == 0 and total // 5 > 0:\r\n print(total//5)\r\nelse:\r\n print(-1)", "tc = [int(i) for i in input().split()]\r\nif(sum(tc)%5==0 and sum(tc)!=0 ):\r\n print(int(sum(tc)/5))\r\nelif(sum(tc)==0):\r\n print(-1)\r\nelse:\r\n print(-1)", "# 478A ~ prasadnaik-null\ns = sum(list(map(int, input().split())))\nif s != 0 and s % 5 == 0:\n print(s//5)\nelse:\n print(-1)\n", "l=list(map(int,input().split()))\r\nif sum(l)==0:\r\n print(-1)\r\nelif sum(l)%5!=0:\r\n print(-1)\r\nelse:\r\n print(sum(l)//5)", "s=sum(map(int,input().split()))\r\nprint([s//5,-1][s%5>0 or s<1])", "bets = list(map(int,input().split()))\nn = len(bets)\ntotal = sum(bets)\nif total % n ==0 and total //n:\n print(total//n)\nelse:\n print(-1)", "a=list(map(int,input().split()))\r\nif sum(a)%5==0 and sum(a)!=0:print(sum(a)//5)\r\nelif sum(a)==0:print(-1)\r\nelse:print(-1)", "a, b, c, d, e = list(map(int,input().split()))\r\ns = a + b + c + d + e \r\nif s > 0 and s % 5 == 0:\r\n print(s//5)\r\nelse:\r\n print(-1)", "a = sum(list(map(int,input().split())))\r\nprint(-1 if a % 5 or a == 0 else a//5)", "a = sum(map(int, input().split(' ')))\r\nprint(a // 5 if a > 0 and (a % 5 == 0) else -1)\r\n", "a=list(map(int,input().split()))\r\nif sum(a)==0:\r\n print(-1)\r\nelse:\r\n print(int(sum(a)//5) if sum(a)%5==0 else -1)", "from math import *\r\nfrom collections import *\r\ndef it(): return int(input())\r\ndef pr(a): return print(a)\r\nab = lambda: map(int,r.readline().strip().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return list(map(str, input().split()))\r\ndef no(): return print('NO')\r\nyes = lambda:print('YES')\r\ndef ap(a, b):return a.append(b);\r\nmp = lambda: map(int, input().split())\r\n\r\nl = sum(li())\r\nif l% 5 == 0 and l != 0:pr(l//5)\r\nelse:pr(-1)\r\n", "x = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\nif sum(list1) % len(list1) != 0 or sum(list1) == 0:\r\n print(-1)\r\nelse:\r\n print(sum(list1)//len(list1))", "p=[int(i) for i in input().split()]\r\n\r\nc=0\r\nfor i in p:\r\n c=c+i\r\np=c/5\r\nif p==0:\r\n print(\"-1\")\r\nelif round(p)==p:\r\n print(round(p))\r\nelse:\r\n print(\"-1\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nw = list(map(int, input().split()))\r\ns = sum(w)\r\nif s % 5 == 0 and s!= 0:\r\n print(s//5)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "arr = tuple(map(int,input().split()));sm,l = sum(arr),len(arr);print(sm//l if (sm%l == 0 and sm!=0) else -1)\r\n", "a=sum(map(int,input().split()))\r\nprint(-1 if a%5 or a==0 else a//5)", "s=sum(map(int,input().split()))\r\nprint(-1 if s%5 or s==0 else s//5)", "def solve(m):\r\n s = sum(m)\r\n if s == 0:\r\n return -1\r\n if s % 5 == 0:\r\n return s // 5\r\n return -1\r\n\r\nm = [int(i) for i in input().split()]\r\nprint(solve(m))", "total=sum(map(int,input().split()))\r\nprint(total//5 if total%5==0 and total>0 else -1)", "x = list(map(int,input().split()))\r\nx_sum = sum(x)\r\nif x_sum%5!=0 or x_sum == 0:\r\n print(-1)\r\nelse:\r\n print(int(x_sum/5))", "a,b,c,d,e = map(int,input().split())\r\nif (a+b+c+d+e)%5 == 0 and (a+b+c+d+e) >= 5:\r\n print((a+b+c+d+e)//5)\r\nelse:\r\n print(-1)\r\n", "n1,n2,n3,n4,n5 = map(int, input().strip(' ').split(' '))\r\nif (n1 > 0) or (n2 > 0) or (n3 > 0) or (n4 > 0) or (n5 > 0):\r\n s = n1 + n2 + n3 + n4 + n5\r\n c = s // 5\r\n d = s % 5\r\n if d == 0:\r\n print(c)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nI= lambda : list(map(int,input().split()))\r\na=sum(map(int,input().split()));print([a//5,-1][a%5!=0 or a==0])", "def main():\r\n a = list(map(int, input().split()))\r\n \r\n sum = 0\r\n for x in a:\r\n sum += x\r\n \r\n if sum % 5 == 0:\r\n res = int(sum / 5)\r\n if(res == 0):\r\n print(-1)\r\n else:\r\n print(res)\r\n else:\r\n print(-1) \r\n \r\nif __name__ == '__main__':\r\n main()", "\r\na,b,c,d,e = map(int,input().split())\r\n\r\nans = a+b+c+d+e\r\n\r\nif ans%5==0 and ans!=0:\r\n\tprint(ans//5)\r\nelse:\r\n\tprint(-1)", "a,b,c,d,e = map(int,input().split())\r\ns = a+b+c+d+e\r\nk = s / 5\r\nif int(k) == k and k > 0:\r\n print(int(k))\r\nelse:\r\n print(-1)\r\n", "import math\r\nc=list(map(int,input().split()))\r\na=sum(c)/5\r\nif math.ceil(a)==math.floor(a) and sum(c)!=0:\r\n print(int(a))\r\nelse:\r\n print(-1)", "c1 , c2 , c3 , c4 ,c5 = map(int , input().split())\r\nlist1 = [c1 , c2 , c3 , c4 , c5]\r\nsum1 = sum(list1)\r\nif sum1 != 0 and sum1%5 == 0:\r\n print(int(sum1/5))\r\nelse:\r\n print(-1)", "s=input()\r\nl1=s.split()\r\nsum=0\r\nfor i in l1:\r\n sum+=int(i)\r\nif (sum>0 and sum%5==0):\r\n print(sum//5)\r\nelse:\r\n print(-1)", "def main():\r\n arr = list(map(int, input().split()))\r\n\r\n total = sum(arr)\r\n b = total / 5\r\n if b.is_integer() and b >= 1:\r\n print(int(b))\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\nc = sum(list(map(int,input().split())))\r\nif c % 5 != 0 or c < 1:\r\n print(-1)\r\nelse:\r\n print(c // 5)\r\n\r\n", "class solve:\r\n def __init__(self):\r\n a=sum(list(map(int,input().split())))\r\n if a%5 or a==0:\r\n print(\"-1\")\r\n else:\r\n print(a//5)\r\n\r\nobj=solve()", "t=[int(i) for i in input().split()]\r\nif sum(t)==0:print(-1)\r\nelif sum(t)%5==0:print(sum(t)//5)\r\nelse:print(-1)\r\n\r\n'''\r\nlogic looks stupid to me tho\r\n'''", "c = list(map(int, input().split()))\r\n\r\ns = sum(c)\r\n\r\nif s % 5 == 0 and s > 0:\r\n print(s // 5)\r\nelse:\r\n print(-1)\r\n" ]

{"inputs": ["2 5 4 0 4", "4 5 9 2 1", "0 0 0 0 0", "1 2 1 2 3", "100 0 0 0 0", "2 3 4 5 6", "1 1 1 1 1", "0 1 2 3 4", "100 100 100 100 100", "93 100 99 90 98", "99 99 99 99 99", "99 98 98 99 100", "43 83 1 0 23", "43 83 1 100 23", "57 83 11 4 93", "87 38 19 33 100", "56 0 0 0 4", "0 0 0 0 1", "99 100 100 100 100"], "outputs": ["3", "-1", "-1", "-1", "20", "4", "1", "2", "100", "96", "99", "-1", "30", "50", "-1", "-1", "12", "-1", "-1"]}

UNKNOWN

PYTHON3

CODEFORCES

46

d505dd4a88f3b77f441d522c3490d39d

Well played!

Recently Max has got himself into popular CCG "BrainStone". As "BrainStone" is a pretty intellectual game, Max has to solve numerous hard problems during the gameplay. Here is one of them: Max owns *n* creatures, *i*-th of them can be described with two numbers — its health *hp**i* and its damage *dmg**i*. Max also has two types of spells in stock: 1. Doubles health of the creature (*hp**i* := *hp**i*·2); 1. Assigns value of health of the creature to its damage (*dmg**i* := *hp**i*). Spell of first type can be used no more than *a* times in total, of the second type — no more than *b* times in total. Spell can be used on a certain creature multiple times. Spells can be used in arbitrary order. It isn't necessary to use all the spells. Max is really busy preparing for his final exams, so he asks you to determine what is the maximal total damage of all creatures he can achieve if he uses spells in most optimal way. The first line contains three integers *n*, *a*, *b* (1<=≤<=*n*<=≤<=2·105, 0<=≤<=*a*<=≤<=20, 0<=≤<=*b*<=≤<=2·105) — the number of creatures, spells of the first type and spells of the second type, respectively. The *i*-th of the next *n* lines contain two number *hp**i* and *dmg**i* (1<=≤<=*hp**i*,<=*dmg**i*<=≤<=109) — description of the *i*-th creature. Print single integer — maximum total damage creatures can deal. Sample Input 2 1 1 10 15 6 1 3 0 3 10 8 7 11 5 2 Sample Output 27 26

[ "from sys import stdin,exit\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Ordenar las criaturas por vida menos daño\nordered_creatures=sorted(range(n),key=lambda i: hp[i]-dmg[i],reverse=True)\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\n#Si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\nfor i in range(0,b):\n max_damage+=max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])\n\n#Si no es una de las primeras b criaturas sumar su daño\nfor i in range(b,n): \n max_damage+=dmg[ordered_creatures[i]]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[ordered_creatures[b-1]],dmg[ordered_creatures[b-1]])-dmg[ordered_creatures[b-1]]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n\n#Si pertenece a las primeras b criaturas restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(0,b): \n max_damage=max(max_damage,aux-max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])+hp[ordered_creatures[i]]*2**a)\n \n#Si no pertenece a las primeras b criaturas restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \nfor i in range(b,n):\n max_damage=max(max_damage,aux-change-dmg[ordered_creatures[i]]+hp[ordered_creatures[i]]*2**a)\n\n#Imprimir el máximo daño total\nprint(max_damage)", "from sys import stdin,exit\n\n#parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#recibiendo los valores de n, a y b\nn,a,b=parser()\nb=min(b,n)\n#inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#recibiendo los parametros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#si no hay hechizos de se solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#ordenar las criaturas por vida menos daño\nordered_creatures=sorted(range(n),key=lambda i: hp[i]-dmg[i],reverse=True)\n\n#inicializando el daño total\nmax_damage=0\n\n#recorriendo las criaturas\nfor i in range(n):\n #si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\n if i < b:\n max_damage+=max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])\n #si no es una de las primeras b criaturas sumar su daño\n else:\n max_damage+=dmg[ordered_creatures[i]]\n\n\naux=max_damage\nchange=max(hp[ordered_creatures[b-1]],dmg[ordered_creatures[b-1]])-dmg[ordered_creatures[b-1]]\n\n#recorriendo las criaturas para ver a cual aplicar los hechizos tipo 1\n\n#si pertenece a las primeras b criaturas restar su potencial daño antes calculado y sumar el daño que causará con los hechizos de tipo 1\n#quedarse con el maximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(0,b): \n max_damage=max(max_damage,aux-max(hp[ordered_creatures[i]],dmg[ordered_creatures[i]])+hp[ordered_creatures[i]]*2**a)\n \n#si no pertenece a las primeras b criaturas restar el potencial daño de la b-íesima criatura y sumar su daño. Luego eliminar el daño de la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \nfor i in range(b,n):\n max_damage=max(max_damage,aux-change-dmg[ordered_creatures[i]]+hp[ordered_creatures[i]]*2**a)\n\n#imprimir el máximo daño total\nprint(max_damage)", "import sys\r\nread=lambda:map(int,sys.stdin.buffer.readline().split())\r\nn,a,b=read()\r\nv=[tuple(read()) for _ in range(n)]\r\nans=0\r\nif b>0:\r\n\tc=[v[x][0]-v[x][1] for x in range(n)]\r\n\tw,r=list(range(n)),[0]*n\r\n\tw.sort(key=lambda x:c[x],reverse=True)\r\n\tfor i in range(n): r[w[i]]=i\r\n\tf=True;s=0;m=min(n,b)\r\n\tfor i in range(m):\r\n\t\tk=c[w[i]]\r\n\t\tif k<=0: f=False;m=i;break\r\n\t\ts+=k\r\n\tans=s\r\n\tif a>0:\r\n\t\tfor i in range(n):\r\n\t\t\tk=v[i][0]*(1<<a)-v[i][1]\r\n\t\t\ttmp=s+k\r\n\t\t\tif r[i]<m:\r\n\t\t\t\ttmp-=c[i]\r\n\t\t\telif f: \r\n\t\t\t\ttmp-=c[w[m-1]]\r\n\t\t\tif tmp>ans: ans=tmp\r\nprint(sum([v[i][1] for i in range(n)])+ans)", "import math\nfrom random import randint\nfrom sys import stdin,exit\n\n#Algoritmo quickselect para resolver el problema de selección\ndef quickselect(arr, k):\n \"\"\"\n Entrada: Lista de elementos comparables y un entero 'k'.\n Salida: k-ésimo elemento más pequeño.\n Complejidad: caso promedio : O(n)\n caso peor: O(n^2)\n \"\"\"\n quick_selected= _kthSmallest(arr, k, 0, len(arr)-1)\n if quick_selected!=math.inf:\n return quick_selected\n else:\n print('k-th element does not exist')\n\n#Algortimo para encontrar el k-ésimo elemento en un intervalo del array\ndef _kthSmallest(arr, k, start, end):\n \"\"\"\n función auxiliar para quickselect\n \"\"\"\n # chequeando si k es una posición válida\n if (k > 0 and k <= end - start + 1): \n \n # Particionando el array con un elemento aleatorio como pivote y obtener la posición del pivote en el array ordenado \n pivot_index = _partition(arr, start, end) \n \n # Si la posición del pivote después de la partición es k devolver el elemento\n if (pivot_index - start == k - 1): \n return arr[pivot_index] \n \n # Si la posición del pivote es mayor que k entonces llamar recursivamente en la partición izquierda al pivote\n if (pivot_index - start > k - 1): \n return _kthSmallest(arr, k, start, pivot_index - 1) \n \n # En caso contrario llamar recursivamente en la partición a la derecha \n return _kthSmallest(arr, k - pivot_index + start - 1, pivot_index + 1, end) \n return math.inf\n\n#Partición\ndef _partition(arr, l, r): \n \"\"\" función privada auxiliar\n Entrada: Una lista y dos enteros: \n l: índice inicial desde donde particionar la lista\n r: índice final hasta donde particionar la lista\n\n Output: índice del pivot después de hacer la partción\n \"\"\"\n # Escoger un elemento aleatorio desde arr[l] hasta arr[r]\n pos=randint(l,r)\n # Intercambiarlo con el último\n arr[pos],arr[r]=arr[r],arr[pos]\n \n \n #Mover todos los elementos menores que iguales que el pivote a su izquierda y los mayores a su derecha\n pivot = arr[r] \n i = l \n for j in range(l, r): \n \n if arr[j] <= pivot: \n arr[i], arr[j] = arr[j], arr[i] \n i += 1\n \n arr[i], arr[r] = arr[r], arr[i]\n \n #Retornar posición del pivote en el array ordenado \n return i\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Arreglo con los valores de dmg[i]-hp[i]. Se hace así porque se quiere el orden descendente y el algoritmo trabaja con orden ascendente\narr=[(dmg[i]-hp[i],i) for i in range(n)]\n\n#obteniendo la b-ésima criatura y la diferencia correspondiente\nminnor_difference,chosen_creature=quickselect(arr,b)\nminnor_difference*=-1\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\nfor i in range(n):\n #Si su diferencia es mayor que la de la b-ésima criatura es una de las b primeras \n if hp[i]-dmg[i] > minnor_difference:\n #Ver si es mejor utilizar un hechizo de tipo 2 o no\n max_damage+=max(hp[i],dmg[i])\n #Si su diferencia es igual que la de la b-ésima criatura comparar por índice \n elif hp[i]-dmg[i] == minnor_difference:\n #Si el índice es mayor entonces es una de las n-b últimas criaturas\n if i > chosen_creature:\n #Aporta su daño\n max_damage+=dmg[i]\n #En caso contrario es una de las b primeras\n else:\n #Ver si es mejor utilizar un hechizo de tipo 2 o no\n max_damage+=max(hp[i],dmg[i])\n #Es una de las n-b últimas criaturas\n else:\n #Aporta su daño\n max_damage+=dmg[i]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[chosen_creature],dmg[chosen_creature])-dmg[chosen_creature]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(n):\n #Si su diferencia es mayor que la de la b-ésima criatura es una de las b primeras \n if hp[i]-dmg[i] > minnor_difference:\n #Restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]*2**a)\n #Si su diferencia es igual que la de la b-ésima criatura comparar por índice \n elif hp[i]-dmg[i] == minnor_difference:\n #Si el índice es mayor entonces es una de las n-b últimas criaturas\n if i > chosen_creature:\n #Restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]*2**a) \n #En caso contrario es una de las b primeras\n else:\n #Restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]*2**a)\n #Es una de las n-b últimas criaturas\n else:\n #Restar el daño aportado por la b-ésima criatura y sumar su daño. Luego restar el daño aportado por la criatura actual y sumar el daño que causará con los hechizos de tipo 1 \n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]*2**a) \n\n#Imprimir el máximo daño total\nprint(max_damage)", "# python3\r\nfrom sys import stdin\r\n\r\ndef main():\r\n def parseints(line): return tuple(map(int, line.split()))\r\n def bdiff(creature): return max(0, creature[0] - creature[1])\r\n\r\n n, a, b = parseints(input())\r\n hand = list(map(parseints, stdin.readlines()))\r\n\r\n ans = sum(creature[1] for creature in hand) # default damage\r\n if b:\r\n hand.sort(key=bdiff)\r\n\r\n best = 0\r\n if n > b:\r\n lost = bdiff(hand[n - b])\r\n for creature in hand[:n-b]:\r\n best = max(best, (creature[0] << a) - creature[1] - lost)\r\n\r\n for creature in hand[max(0,n-b):]:\r\n best = max(best, (creature[0] << a) - max(creature))\r\n ans += bdiff(creature)\r\n ans += best\r\n\r\n print(ans)\r\n\r\n\r\nmain()", "# coding=utf-8\nfrom sys import stdin\nrd = lambda l: tuple(map(int, l.split()))\nn, a, b = rd(input())\nb = min(n, b)\ns = list(map(rd, stdin.readlines()))\n\nf = lambda x:max(0, x[0]-x[1])\ng = lambda x:(x[0]<<a)-x[1]\nans = sum(x[1] for x in s)\nmid = 0\nif b:\n s.sort(key=f, reverse=True)\n t = sum(f(x) for x in s[:b] )\n for i in range(b):\n mid = max(mid, t-f(s[i])+g(s[i]))\n for i in range(b, n):\n mid = max(mid, t-f(s[b-1])+g(s[i]))\n ans += mid\nprint(ans)\n", "from sys import stdin,exit\nimport heapq\n\n#Parsea una línea\ndef parser():\n return map(int, stdin.readline().split())\n\n#Recibiendo los valores de n, a y b\nn,a,b=parser()\n\n#Máximo de hechizos de tipo 2 que tiene sentido utilizar\nb=min(b,n)\n\n#Inicializando las listas de vida y daño\nhp=[]\ndmg=[]\n\n#Recibiendo los parámetros de las criaturas\nfor creature in range(n):\n h,d=parser()\n hp.append(h)\n dmg.append(d)\n\n#Si no hay hechizos de tipo 2 solo se pueden usar los daños de las criaturas\nif b==0:\n print(sum(dmg))\n exit()\n\n#Ordenar las criaturas por vida menos daño\nheap=[]\nfor i in range(n):\n heap.append((dmg[i]-hp[i],i))\nheapq.heapify(heap)\nminnor_difference,chosen_creature=-1,-1\n\nfor i in range(b):\n minnor_difference , chosen_creature = heapq.heappop(heap)\n minnor_difference*=-1\n\n#Inicializando el daño total\nmax_damage=0\n\n#Recorriendo las criaturas\n#Si es una de las primeras b criaturas ver si es mejor utilizar un hechizo de tipo 2 o no\nfor i in range(n):\n if hp[i]-dmg[i] > minnor_difference:\n max_damage+=max(hp[i],dmg[i])\n elif hp[i]-dmg[i] == minnor_difference:\n if i > chosen_creature:\n max_damage+=dmg[i]\n else:\n max_damage+=max(hp[i],dmg[i])\n else:\n max_damage+=dmg[i]\n\n#Guardar el valor auxiliar de la solución óptima del primer subproblema\naux=max_damage\n#Restar lo aportado por la b-ésima criatura y sumar su daño\nchange=max(hp[chosen_creature],dmg[chosen_creature])-dmg[chosen_creature]\n\n#Recorriendo las criaturas para ver a cuál aplicar los hechizos tipo 1\n\n#Si pertenece a las primeras b criaturas restar daño aportado anteriormente y sumar el daño que causará con los hechizos de tipo 1\n#Quedarse con el máximo valor entre lo antes calculado y lo calculado actualmente\nfor i in range(n):\n if hp[i]-dmg[i] >= minnor_difference:\n max_damage=max(max_damage,aux-max(hp[i],dmg[i])+hp[i]*2**a)\n else:\n max_damage=max(max_damage,aux-change-dmg[i]+hp[i]*2**a) \n\n#Imprimir el máximo daño total\nprint(max_damage)", "from sys import stdin\nrd = lambda l: tuple(map(int, l.split()))\nn, a, b = rd(input())\nb = min(b, n)\np = list(map(rd, stdin.readlines()))\nf = lambda x: max(0, x[0] - x[1])\ng = lambda x: (x[0] << a) - x[1]\ns = sum(x[1] for x in p)\ne = 0\nif b:\n p.sort(key=f, reverse=True)\n t = sum(f(x) for x in p[:b])\n for i in range(b):\n e = max(e, t - f(p[i]) + g(p[i]))\n for i in range(b, n):\n e = max(e, t - f(p[b - 1]) + g(p[i]))\n s += e\nprint(s)\n\n \t\t \t \t\t \t \t\t\t \t \t\t\t \t \t\t" ]

{"inputs": ["2 1 1\n10 15\n6 1", "3 0 3\n10 8\n7 11\n5 2", "1 0 0\n2 1", "1 0 200000\n1 2", "7 5 7\n29 25\n84 28\n34 34\n14 76\n85 9\n40 57\n99 88", "7 6 7\n11 75\n61 90\n22 14\n100 36\n29 48\n69 52\n16 3", "7 8 7\n88 29\n30 44\n14 1\n83 95\n73 88\n10 42\n29 26", "12 7 7\n78 189\n614 271\n981 510\n37 762\n803 106\n78 369\n787 54\n768 159\n238 111\n107 54\n207 72\n485 593", "12 20 4\n852 935\n583 820\n969 197\n219 918\n547 842\n615 163\n704 377\n326 482\n183 833\n884 994\n886 581\n909 450", "2 13 2\n208637 682633\n393097 724045", "1 0 200000\n42 1", "1 6 200000\n42 1", "1 0 200000\n1 42", "1 6 200000\n1 42", "3 1 1\n10 9\n8 6\n7 5", "1 1 0\n10 1", "1 1 0\n3 4", "3 20 0\n1 5\n5 1\n5 1", "2 5 1\n10 1\n20 20", "3 20 0\n3 2\n4 3\n5 4", "2 1 0\n10 15\n6 1", "5 10 0\n20 1\n22 1\n30 1\n30 5\n40 6", "1 20 0\n1 5", "2 3 14\n28 5\n32 47", "3 1 2\n20 10\n5 1\n25 25", "2 3 3\n28 5\n32 47", "2 2 1\n10 15\n6 1", "2 1 2\n20 1\n22 23", "10 7 2\n8 6\n5 5\n3 7\n7 7\n3 8\n6 1\n10 9\n4 6\n9 5\n7 9", "3 8 1\n6 6\n7 9\n2 5", "10 4 4\n5 5\n8 1\n10 10\n3 1\n7 10\n1 7\n8 7\n5 9\n3 3\n1 1", "4 8 3\n1 6\n10 10\n4 8\n9 4", "8 18 1\n8 6\n6 8\n1 7\n7 2\n5 1\n10 5\n8 3\n9 3", "2 11 1\n1 4\n1 5", "2 19 2\n9 3\n7 2", "5 13 0\n4 4\n8 10\n1 8\n3 9\n4 6", "5 8 0\n10 7\n6 6\n6 5\n7 9\n10 7", "5 20 2\n1 10\n7 8\n10 1\n6 5\n2 1", "2 1 0\n5 6\n8 8", "7 3 5\n2 6\n5 9\n5 5\n4 10\n5 7\n7 8\n3 10", "10 9 0\n620118469 704168608\n528098892 341451371\n15150469 449838744\n960504540 722185004\n271837337 344050133\n940943201 419522619\n85569623 788965215\n161962866 563795701\n943389281 445744350\n610994199 473866838", "10 11 1\n7 3\n9 4\n1 5\n10 3\n6 1\n10 7\n8 5\n7 6\n1 4\n9 9", "2 1 200000\n44 42\n1000 1001", "5 12 2\n5 9\n8 9\n4 1\n2 5\n1 8", "4 8 1\n9 9\n7 6\n2 4\n6 10", "2 1 1\n292725479 742903381\n239450691 307356865"], "outputs": ["27", "26", "1", "2", "3533", "6720", "22840", "130952", "1016078777", "3220933257", "42", "2688", "42", "64", "31", "1", "4", "7", "641", "9", "16", "14", "5", "284", "71", "284", "41", "64", "1339", "1803", "214", "2583", "2621470", "2053", "4718599", "37", "34", "10485785", "14", "103", "5253588583", "20524", "2044", "32794", "2324", "1221804763"]}

UNKNOWN

PYTHON3

CODEFORCES

8

d50bdeed886902a60096918dfa119f35

Order Book

In this task you need to process a set of stock exchange orders and use them to create order book. An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number *i* has price *p**i*, direction *d**i* — buy or sell, and integer *q**i*. This means that the participant is ready to buy or sell *q**i* stocks at price *p**i* for one stock. A value *q**i* is also known as a volume of an order. All orders with the same price *p* and direction *d* are merged into one aggregated order with price *p* and direction *d*. The volume of such order is a sum of volumes of the initial orders. An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order. An order book of depth *s* contains *s* best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than *s* aggregated orders for some direction then all of them will be in the final order book. You are given *n* stock exhange orders. Your task is to print order book of depth *s* for these orders. The input starts with two positive integers *n* and *s* (1<=≤<=*n*<=≤<=1000,<=1<=≤<=*s*<=≤<=50), the number of orders and the book depth. Next *n* lines contains a letter *d**i* (either 'B' or 'S'), an integer *p**i* (0<=≤<=*p**i*<=≤<=105) and an integer *q**i* (1<=≤<=*q**i*<=≤<=104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order. Print no more than 2*s* lines with aggregated orders from order book of depth *s*. The output format for orders should be the same as in input. Sample Input 6 2 B 10 3 S 50 2 S 40 1 S 50 6 B 20 4 B 25 10 Sample Output S 50 8 S 40 1 B 25 10 B 20 4

[ "n, s = map(int, input().split())\r\npricesell = dict()\r\npricebuy = dict()\r\nsellp = set()\r\nbuyp = set()\r\nfor i in range(n):\r\n tmp = input().split()\r\n if tmp[0] == \"B\":\r\n if int(tmp[1]) in buyp:\r\n pricebuy[int(tmp[1])] += int(tmp[2])\r\n else:\r\n pricebuy[int(tmp[1])] = int(tmp[2])\r\n buyp.add(int(tmp[1]))\r\n else:\r\n if int(tmp[1]) in sellp:\r\n pricesell[int(tmp[1])] += int(tmp[2])\r\n else:\r\n pricesell[int(tmp[1])] = int(tmp[2])\r\n sellp.add(int(tmp[1]))\r\nbuy = list(pricebuy.items())\r\nsell = list(pricesell.items())\r\nbuy.sort(reverse=True)\r\nsell.sort()\r\nbuy1 = buy[:min(s, len(buy))]\r\nsell1 = sell[:min(s, len(sell))]\r\nsell1.sort(reverse=True)\r\nbuy1 = list(map(lambda x: \"B \" + str(x[0]) + \" \" + str(x[1]), buy1))\r\nsell1 = list(map(lambda x: \"S \" + str(x[0]) + \" \" + str(x[1]), sell1))\r\nprint(*sell1, sep=\"\\n\")\r\nprint(*buy1, sep=\"\\n\")", "n = [int(i) for i in input().split()]\nbuy = []\nbuyP = []\nsell = []\nsellP = []\nfor i in range(n[0]):\n l = input().split()\n l[1] = int(l[1])\n l[2] = int(l[2])\n if l[0] == 'B':\n l.pop(0)\n buy.append(l)\n buyP.append([l[0]])\n else:\n l.pop(0)\n sell.append(l)\n sellP.append([l[0]])\nfor i in range(len(buyP)-1,-1,-1):\n if buyP.count(buyP[i]) > 1:\n buyP.pop(i)\nfor i in range(len(sellP)-1,-1,-1):\n if sellP.count(sellP[i]) > 1:\n sellP.pop(i)\nbuyP.sort()\nbuyP.reverse()\nsellP.sort()\nfor i in range(len(sellP)):\n sellP[i].append(0)\n sellP[i].append(0)\n for j in sell:\n if sellP[i][0] == j[0]:\n sellP[i][1] = 'S'\n sellP[i][2] += j[1]\n\nfor z in range(min(n[1],len(sellP))-1,-1,-1):\n print('S '+ str(sellP[z][0]) +' '+ str(sellP[z][2]))\n \nfor i in range(len(buyP)):\n buyP[i].append(0)\n buyP[i].append(0)\n for j in buy:\n if buyP[i][0] == j[0]:\n buyP[i][1] = 'B'\n buyP[i][2] += j[1]\nfor z in range(min(n[1],len(buyP))):\n print('B '+ str(buyP[z][0]) +' '+ str(buyP[z][2]))", "n, ss = map(int, input().split())\r\nbuy, send = dict(), dict()\r\nfor i in range(n):\r\n s = list(map(str, input().split()))\r\n c_v = list(map(int, s[1:]))\r\n if s[0] == 'B':\r\n if c_v[0] in buy:\r\n buy[c_v[0]] += c_v[1]\r\n else:\r\n buy[c_v[0]] = c_v[1]\r\n else:\r\n if c_v[0] in send:\r\n send[c_v[0]] += c_v[1]\r\n else:\r\n send[c_v[0]] = c_v[1]\r\nlength_s, length_b = len(send), len(buy)\r\nbuy_ = sorted(buy)[0 if length_b < ss else length_b - ss:]\r\nsend_ = sorted(send)[:min(length_s, ss)]\r\nfor i in range(len(send_) - 1, -1, -1):\r\n print('S', send_[i], send[send_[i]])\r\nfor i in range(len(buy_) - 1, -1, -1):\r\n print('B', buy_[i], buy[buy_[i]])", "n, m = map(int, input().split())\r\nzay = []\r\nzay_fin_B = []\r\nzay_fin_S = []\r\nfor i in range(n):\r\n zay.append(list(input().split()))\r\n zay[-1][1] = int(zay[-1][1])\r\n zay[-1][2] = int(zay[-1][2])\r\nfor i in range(n):\r\n if zay[i] != None:\r\n zay_time = zay[i]\r\n for j in range(i + 1, n): \r\n if zay[i] != None and zay[j] != None and zay[i][0] == zay[j][0] and zay[i][1] == zay[j][1]:\r\n zay_time[2] += zay[j][2]\r\n zay[j] = None\r\n if zay[i] != None:\r\n if zay_time[0] == 'B':\r\n zay_fin_B.append(zay_time)\r\n else:\r\n zay_fin_S.append(zay_time)\r\n zay[i] = None \r\nzay_fin_S.sort()\r\nm_s = 0\r\nans_S = []\r\nfor i in zay_fin_S:\r\n if m_s < m:\r\n ans_S.append(i)\r\n m_s += 1\r\nans_S.reverse()\r\nzay_fin_B.sort(reverse=True)\r\nm_b = 0\r\nans_B = []\r\nfor i in zay_fin_B:\r\n if m_b < m:\r\n ans_B.append(i)\r\n m_b += 1\r\nfor i in ans_S:\r\n print(*i)\r\nfor i in ans_B:\r\n print(*i)", "from collections import defaultdict\n\nclass OrderBook():\n\t@staticmethod\n\tdef _dict():\n\t\treturn defaultdict(int)\n\n\tdef __init__(self):\n\t\tself._buy, self._sell = OrderBook._dict(), OrderBook._dict()\n\n\t@staticmethod\n\tdef _add(book, price, volume):\n\t\tbook[price] += volume\n\n\tdef add_buy(self, price, volume):\n\t\tOrderBook._add(self._buy, price, volume)\n\n\tdef add_sell(self, price, volume):\n\t\tOrderBook._add(self._sell, price, volume)\n\n\t@staticmethod\n\tdef _entry(label, price, volume):\n\t\treturn '%s %d %d' % (label, price, volume)\n\n\tdef _get(self, book, label, start, end):\n\t\tkeys = sorted(book.keys(), reverse=True)[start:end]\n\t\treturn [OrderBook._entry(label, p, book[p]) for p in keys]\n\n\tdef get_buy(self, s):\n\t\treturn self._get(self._buy, 'B', 0, s)\n\n\tdef get_sell(self, s):\n\t\treturn self._get(self._sell, 'S', -s, len(self._sell))\n\ndef record(line):\n\td, p, q = line\n\treturn d, int(p), int(q)\n\nn, s = map(int, input().split())\nbook = OrderBook()\nfor _ in range(n):\n\td, p, q = record(input().split())\n\tif d == 'B':\n\t\tbook.add_buy(p, q)\n\telse:\n\t\tbook.add_sell(p, q)\nprint('\\n'.join(book.get_sell(s) + book.get_buy(s)))\n", "n, s = map(int, input().split())\r\n\r\norders = [{}, {}]\r\nfor _ in range(n):\r\n d, p, q = input().split()\r\n p, q = map(int, (p,q))\r\n orders[d=='B'][p] = orders[d=='B'].get(p,0) + q\r\n\r\norders[0] = sorted(orders[0].items())\r\norders[1] = sorted(orders[1].items(), reverse=True)\r\nfor p, q in reversed(orders[0][:s]):\r\n print('S',p, q)\r\nfor p, q in orders[1][:s]:\r\n print('B',p, q)", "a,b=map(int,input().split())\r\nbs,s={},{}\r\nfor _ in \" \"*a:\r\n x,y,z=input().split()\r\n y,z=int(y),int(z)\r\n if x=='B':\r\n if y in bs:bs[y]+=z\r\n else:bs[y]=z\r\n else:\r\n if y in s:s[y]+=z\r\n else:s[y]=z\r\nz=[['S',i,s[i]] for i in sorted(s)][:b][::-1]\r\nz1=[['B',i,bs[i]] for i in sorted(bs,reverse=True)][:b]\r\nfor i in z:print(*i)\r\nfor i in z1:print(*i)", "from collections import *\nfrom itertools import *\nfrom random import *\nfrom bisect import *\nfrom string import *\nfrom queue import *\nfrom heapq import *\nfrom math import *\nfrom re import *\nfrom sys import *\ndef fast(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in fast().split()]\n\n\nz, zz = input, lambda: list(map(int, z().split()))\nszz, graph, mod, szzz = lambda: sorted(\n zz()), {}, 10**9 + 7, lambda: sorted(zzz())\n\n\ndef lcd(xnum1, xnum2): return (xnum1 * xnum2 // gcd(xnum1, xnum2))\ndef output(answer): stdout.write(str(answer))\n\n\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\n\n\n###########################---Test-Case---#################################\n\"\"\"\n\nIf you Know me , Then you probably don't know me !\n\n\"\"\"\n###########################---START-CODING---##############################\n\n\norders = {'B': {}, 'S': {}}\nn, s = zzz()\nfor x in range(n):\n d, p, q = map(str, input().split())\n p, q = int(p), int(q)\n try:\n orders[d][p] += q\n except:\n orders[d][p] = q\n\nfor p in list(reversed(list(sorted(orders['S']))[:s])):\n print('S', p, orders['S'][p])\nfor p in list(reversed(sorted(orders['B'])))[:s]:\n print('B', p, orders['B'][p])\n", "n,s = map(int,input().split())\ndic1 = {}\ndic2 = {}\narray = []\nfor i in range(n):\n\ta,b,c = input().split()\n\tb = int(b)\n\tc = int(c)\n\tif a == \"B\":\n\t\tdic1[b] = dic1.get(b,0) + c\n\telse:\n\t\tdic2[b] = dic2.get(b,0) + c\nbuy_list = sorted(dic1.items(),reverse=True)[:s]\t\nsell_list = reversed(sorted(dic2.items())[:s])\nfor k,v in sell_list:\n\tprint(\"S\",k,v)\nfor k,v in buy_list:\n\tprint(\"B\",k,v)\n\t \t\t \t\t \t\t \t\t \t\t\t\t \t \t\t\t\t", "n, s = map(int, input().split())\r\n\r\nbuying = []\r\nselling = []\r\n\r\nfor o in range(n):\r\n\r\n ord = input().split()\r\n\r\n if ord[0] == 'B':\r\n buying.append([int(ord[1]), int(ord[2]), ord[0]])\r\n\r\n else:\r\n selling.append([int(ord[1]), int(ord[2]), ord[0]])\r\n\r\npricesbuy = {}\r\npricessell = {}\r\n\r\nfor x in buying:\r\n pricesbuy[x[0]] = 0\r\n\r\nfor y in selling:\r\n pricessell[y[0]] = 0\r\n\r\nfor x in buying:\r\n pricesbuy[x[0]] += x[1]\r\n\r\nfor y in selling:\r\n pricessell[y[0]] += y[1]\r\n\r\nbuyfin = []\r\nsellfin = []\r\n\r\nfor k in pricesbuy:\r\n\r\n buyfin.append([k, pricesbuy[k]])\r\n\r\nfor k in pricessell:\r\n\r\n sellfin.append([k, pricessell[k]])\r\n\r\nbuyfin.sort(reverse=True)\r\nsellfin.sort()\r\n\r\nbuyfinfin = []\r\nsellfinfin = []\r\n\r\nfor x in range(min(len(sellfin), s)):\r\n\r\n sellfinfin.append(sellfin[x])\r\n\r\nfor x in range(min(len(buyfin), s)):\r\n\r\n buyfinfin.append(buyfin[x])\r\n\r\nbuyfinfin.sort(reverse=True)\r\nsellfinfin.sort(reverse=True)\r\n\r\nfor x in range(min(len(sellfinfin), s)):\r\n print('S' + ' ' + str(sellfinfin[x][0]) + ' ' + str(sellfinfin[x][1]))\r\n\r\nfor x in range(min(len(buyfinfin), s)):\r\n print('B' + ' ' + str(buyfinfin[x][0]) + ' ' + str(abs(buyfinfin[x][1])))\r\n\r\n# print(buyfinfin, sellfinfin, buyfin, sellfin)", "n,s = list(map(int,input().split()))\r\nsell,buy = [],[]\r\n\r\nfor i in range(100003):\r\n sell.append(0)\r\n buy.append(0)\r\n\r\nfor i in range(n):\r\n x,y,z = input().split();\r\n if x =='B':\r\n buy[int(y)] += int(z)\r\n else:\r\n sell[int(y)] += int(z)\r\n \r\nx,y = 0,0\r\nwhile x < s and y <= 100000:\r\n if sell[y] > 0:\r\n x += 1\r\n y += 1\r\n \r\nwhile y >= 0:\r\n if sell[y] > 0:\r\n print('S' , y , sell[y])\r\n y -= 1\r\n \r\nx,y = 0,100000\r\nwhile x < s and y >= 0:\r\n if buy[y] > 0:\r\n x += 1\r\n print('B' , y , buy[y])\r\n y -= 1", "n,k= map(int, input().split())\r\nbb={}\r\nss={}\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if a==\"B\":\r\n if b in bb:\r\n bb[b]+=int(c)\r\n else:\r\n bb[b]=int(c)\r\n else:\r\n if b in ss:\r\n ss[b]+=int(c)\r\n else:\r\n ss[b]=int(c)\r\nbuy=sorted(bb.items(),reverse=True)[:k]\r\nsell=reversed(sorted(ss.items())[:k])\r\nfor pi,qi in sell:\r\n print(\"S\",pi,qi)\r\nfor pi,qi in buy:\r\n print(\"B\",pi,qi)", "R = lambda: map(int, input().split())\r\nn, s = R()\r\nbs, ss = [0] * 100007, [0] * 100007\r\nfor _ in range(n):\r\n t, p, q = input().split()\r\n p, q = int(p), int(q)\r\n arr = bs if t == 'B' else ss\r\n arr[p] += q\r\nbres, sres = [], []\r\nfor i in range(1, 10 ** 5 + 1):\r\n if ss[i] and len(sres) < s:\r\n sres.append('S ' + str(i) + ' ' + str(ss[i]))\r\nfor i in range(10 ** 5, -1, -1):\r\n if bs[i] and len(bres) < s:\r\n bres.append('B ' + str(i) + ' ' + str(bs[i]))\r\nfor x in sres[::-1]:\r\n print(x)\r\nfor x in bres:\r\n print(x)", "# coding=utf-8\n\nn, s = map(int, input().split())\nbuy = {}\nsell = {}\nfor i in range(n):\n r = input().split()\n d = r[0]\n p = int(r[1])\n v = int(r[2])\n if d == 'S':\n sell[p] = sell.get(p, 0) + v\n else:\n buy[p] = buy.get(p, 0) + v\nfor order in sorted(sell.items(), reverse=True)[-s:]:\n print('S %s %s' % (order[0], order[1]))\nfor order in sorted(buy.items(), reverse=True)[:s]:\n print('B %s %s' % (order[0], order[1]))\n", "n, ss = map(int, input().split())\r\nb = list()\r\ns = list()\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == 'B':\r\n b.append(list(map(int, a[1:])))\r\n else:\r\n s.append(list(map(int, a[1:])))\r\n\r\nb.sort(key=lambda x: x[0], reverse=True)\r\ns.sort(key=lambda x: x[0], reverse=True)\r\n\r\nk = 0\r\nfor i in range(len(b) - 1):\r\n try:\r\n if b[i-k][0] == b[i-k + 1][0]:\r\n b[i-k + 1][1] += b[i-k][1]\r\n b.pop(i-k)\r\n k += 1\r\n except(IndexError):\r\n break\r\nk = 0\r\nfor i in range(len(s) - 1):\r\n try:\r\n if s[i - k][0] == s[i - k + 1][0]:\r\n s[i - k + 1][1] += s[i-k][1]\r\n s.pop(i-k)\r\n k+=1\r\n except(IndexError):\r\n break\r\n\r\nif ss < len(s):\r\n s = s[len(s) - ss:]\r\nfor i in range(len(s)):\r\n print('S', *s[i])\r\nfor i in range(min(len(b), ss)):\r\n print('B', *b[i])\r\n", "n, s = map(int, input().split())\r\nbuy = dict()\r\nsell = dict()\r\nfor i in range(n):\r\n d, p, q = map(str, input().split())\r\n p = int(p)\r\n q = int(q)\r\n if d == 'B':\r\n if p in buy:\r\n buy[p] += q\r\n else:\r\n buy[p] = q\r\n else:\r\n if p in sell:\r\n sell[p] += q\r\n else:\r\n sell[p] = q \r\nbk = list(buy.keys())\r\nbv = list(buy.values())\r\nbl = list(zip(bk, bv))\r\nsk = list(sell.keys())\r\nsv = list(sell.values())\r\nsl = list(zip(sk, sv))\r\nbl.sort(reverse = True)\r\nsl.sort()\r\nbb = len(bl)\r\nss = len(sl)\r\n\r\nif s > ss:\r\n sl.sort(reverse = True)\r\n for i in range(ss):\r\n print('S', sl[i][0], sl[i][1])\r\nelse:\r\n sl.sort()\r\n for i in range(s - 1, -1, -1):\r\n print('S', sl[i][0], sl[i][1]) \r\n \r\nif s > bb:\r\n for i in range(bb):\r\n print('B', bl[i][0], bl[i][1])\r\nelse:\r\n for i in range(s):\r\n print('B', bl[i][0], bl[i][1]) ", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n, s = map(int, input().split())\n\n buy = collections.Counter()\n sell = collections.Counter()\n for _ in range(n):\n d, p, q = input().split()\n p = int(p)\n q = int(q)\n if d == 'B':\n buy[p] += q\n else:\n sell[p] += q\n\n buy = buy.most_common()\n buy.sort(reverse=True)\n buy = buy[:s]\n\n sell = sell.most_common()\n sell.sort()\n sell = sell[:s]\n sell.reverse()\n\n for p, q in sell:\n print('S', p, q)\n for p, q in buy:\n print('B', p, q)\n\n\nif __name__ == '__main__':\n solve()\n\n", "s = input()\r\nn, d = int(s.split()[0]), int(s.split()[1])\r\nb, s = {}, {}\r\nwb, ws = [], []\r\nfor i in range(0, n):\r\n\tst = input().split()\r\n\tst[1] = int(st[1])\r\n\tst[2] = int(st[2])\r\n\tif st[0] == 'B':\r\n\t\tif st[1] not in b:\r\n\t\t\tb[st[1]] = st[2]\r\n\t\telse:\r\n\t\t\tb[st[1]] += st[2];\r\n\t\tif st[1] not in wb:\r\n\t\t\twb.append(st[1]);\r\n\telse:\r\n\t\tif st[1] not in s:\r\n\t\t\ts[st[1]] = st[2]\r\n\t\telse:\r\n\t\t\ts[st[1]] += st[2];\r\n\t\tif st[1] not in ws:\r\n\t\t\tws.append(st[1]);\r\nws.sort()#[:d]#.sort(reverse=True)\r\nwb.sort(reverse=True)#[:d]\r\nws = ws[:d]\r\nwb = wb[:d]\r\nws.sort(reverse=True)\r\nfor i in ws:\r\n\tprint('S %s %s' %(i, s[i]))\r\nfor i in wb:\r\n\tprint('B %s %s' %(i, b[i]))", "read = lambda: map(int, input().split())\r\nn, s = read()\r\nS = {}\r\nB = {}\r\nfor i in range(n):\r\n\td, p, q = input().split()\r\n\tp, q = int(p), int(q)\r\n\tif d == 'S':\r\n\t\tif S.get(p) is None:\r\n\t\t\tS[p] = q\r\n\t\telse:\r\n\t\t\tS[p] += q\r\n\telse:\r\n\t\tif B.get(p) is None:\r\n\t\t\tB[p] = q\r\n\t\telse:\r\n\t\t\tB[p] += q\r\nlens = min(s, len(S))\r\nlenb = min(s, len(B))\r\nS1 = list(reversed(sorted(S)[:lens]))\r\nB1 = sorted(B, reverse = True)[:lenb]\r\n\r\nfor i in range(lens):\r\n\tprint('S', S1[i], S[S1[i]])\r\nfor i in range(lenb):\r\n\tprint('B', B1[i], B[B1[i]])", "n,s = [int(x) for x in input().split()]\r\nbuy_dict = {}\r\nsell_dict = {}\r\nfor i in range(n):\r\n\tchtype,pi,di = input().split()\r\n\tpi = int(pi)\r\n\tdi = int(di)\r\n\tif chtype=='B':\r\n\t\tbuy_dict[pi] = buy_dict.get(pi,0)+di\r\n\telse:\r\n\t\tsell_dict[pi] = sell_dict.get(pi,0)+di\r\nbuy_list = sorted(buy_dict.items(),reverse=True)[:s]\r\nsell_list = reversed(sorted(sell_dict.items())[:s])\r\nfor pi,qi in sell_list:\r\n\tprint('S',pi,qi)\r\nfor pi,qi in buy_list:\r\n\tprint('B',pi,qi)", "#order book\nfrom collections import defaultdict\nn, s = input().split()\nn, s = int(n), int(s)\n\nb_orders = defaultdict(int)\ns_orders = defaultdict(int)\n\nfor _ in range(n):\n d, p, q = input().split()\n p, q = int(p), int(q)\n\n if d == \"B\":\n b_orders[p] += q\n else:\n s_orders[p] += q\n\nb_orders = list(sorted(b_orders.items(), reverse=True))\ns_orders = list(sorted(s_orders.items(), reverse=True))\n\nbeg = max(0, len(s_orders)-s)\nfor order in s_orders[beg:]:\n print(\"S\", order[0], order[1])\n\nend = min(len(b_orders), s)\nfor order in b_orders[:end]:\n print(\"B\", order[0], order[1])", "n, s = map(int, input().split())\ndic = {'B':{}, 'S':{}}\nfor i in range(n):\n d, p, q = list(input().split(' '))\n p, q = int(p), int(q)\n dic[d][p] = dic[d].get(p, 0) + q\nfor k in sorted(dic['S'], reverse=True)[-s:]:\n print('S', k, dic['S'][k])\nfor k in sorted(dic['B'], reverse=True)[:s]:\n print('B', k, dic['B'][k])\n\n\t\t\t \t \t\t\t\t\t \t \t \t", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, s = map(int, input().split())\r\nbuy = {}\r\nsell = {}\r\n\r\nfor _ in range(n):\r\n mov, p, q = input().split()\r\n p = int(p)\r\n q = int(q)\r\n\r\n if mov == 'B':\r\n buy[p] = buy.get(p, 0) + q\r\n else:\r\n sell[p] = sell.get(p, 0) + q\r\n\r\n\r\nbkeys = sorted(buy.keys(), reverse=True)[:s]\r\nskeys = sorted(sell.keys())[:s]\r\n\r\nfor key in reversed(skeys):\r\n stdout.write(\"S {} {}\\n\".format(key, sell[key]))\r\n\r\nfor key in bkeys:\r\n stdout.write(\"B {} {}\\n\".format(key, buy[key]))", "n, s = map(int, input().split())\n\nbuy = {}\nsell = {}\n\nfor i in range(n):\n a = input().split()\n a[1] = int(a[1])\n a[2] = int(a[2])\n \n if a[0] == \"B\":\n buy[a[1]] = buy.get(a[1], 0) + a[2]\n else:\n sell[a[1]] = sell.get(a[1], 0) + a[2]\n\nbuy = list(buy.items())\nsell = list(sell.items())\n\nsell.sort()\nbuy.sort()\n\nsell = sell[:s]\nbuy = buy[-s:]\n\nsell.reverse()\nbuy.reverse()\n\nfor i in sell:\n\tprint(\"S\", i[0], i[1])\n\nfor i in buy:\n\tprint(\"B\", i[0], i[1])\n\n", "n, s = tuple(map(int, input().split()))\r\n\r\nagr = dict()\r\nfor i in range(n):\r\n arr = input().split()\r\n arr[1] = int(arr[1])\r\n arr[2] = int(arr[2])\r\n agr[(arr[0], arr[1])] = agr.get((arr[0], arr[1]), 0) + arr[2]\r\n\r\nsell, buy = [], []\r\nfor elem in agr:\r\n if elem[0] == 'B':\r\n buy.append([elem[1], agr[elem]])\r\n else:\r\n sell.append([elem[1], agr[elem]])\r\n\r\nsell.sort(key = lambda x: x[0])\r\nbuy.sort(key = lambda x: x[0], reverse = True)\r\n\r\nbuy = buy[:s]\r\nsell = sell[:s]\r\n\r\nsell.sort(key = lambda x: x[0], reverse = True)\r\n\r\nfor elem in sell:\r\n print('S', elem[0], elem[1])\r\nfor elem in buy:\r\n print('B', elem[0], elem[1])\r\n", "# your code goes here\r\n\r\nn,s = map(int, input().split()) \r\nbuys = {}\r\nsells = {}\r\nfor _ in range(n): \r\n\tc,a,b = input().split()\r\n\ta = int(a)\r\n\tb = int(b)\r\n\tif c == \"B\": \r\n\t\tif a in buys: buys[a] = buys[a]+b\r\n\t\telse: buys[a]=b \r\n\telse:\r\n\t\tif a in sells: sells[a] = sells[a]+b\r\n\t\telse: sells[a]=b \r\n\t\t\r\nbuys = sorted(list(buys.items()), reverse=True)[:s]\r\nsells = sorted(list(sells.items()))[:s]\r\nsells.reverse()\r\nfor i in sells: \r\n\tprint('S', i[0],i[1])\r\nfor i in buys: \r\n\tprint('B', i[0],i[1])\r\n\r\n\r\n\r\n", "n, s = map(int, input().split())\r\nbuys = dict()\r\nsell = dict()\r\nfor _ in range(n):\r\n f = input().split()\r\n if (f[0] == \"B\"):\r\n buys[int(f[1])] = buys.get(int(f[1]), 0) + int(f[2])\r\n else:\r\n sell[int(f[1])] = sell.get(int(f[1]), 0) + int(f[2])\r\nbres = sorted(buys.keys(), reverse = True)\r\nsres = sorted(sell.keys())\r\nif bres:\r\n bs = bres[min(s - 1, len(bres) - 1)]\r\nif sres:\r\n ss = sres[min(s - 1, len(sres) - 1)]\r\n for key in sorted(sell.keys(), reverse = True):\r\n if (key <= ss):\r\n print(\"S\", key, sell[key])\r\nif bres:\r\n bs = bres[min(s - 1, len(bres) - 1)]\r\n for key in sorted(buys.keys(), reverse = True):\r\n if (key >= bs):\r\n print(\"B\", key, buys[key])", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\n# Guide:\n# 1. construct complex data types while reading (e.g. graph adj list)\n# 2. avoid any non-necessary time/memory usage\n# 3. avoid templates and write more from scratch\n# 4. switch to \"flat\" implementations\n\ndef VI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LIST(n,m=None): return [0]*n if m is None else [[0]*m for i in range(n)]\n\n\ndef main(info=0):\n n,s = VI()\n d,p,q = LIST(n), LIST(n), LIST(n)\n db = {}\n ds = {}\n for i in range(n):\n d[i], p[i], q[i] = input().split()\n p = [int(x) for x in p]\n q = [int(x) for x in q]\n for i in range(n):\n if d[i]=='B':\n if p[i] in db:\n db[p[i]] = db[p[i]] + q[i]\n else:\n db[p[i]] = q[i]\n if d[i]=='S':\n if p[i] in ds:\n ds[p[i]] = ds[p[i]] + q[i]\n else:\n ds[p[i]] = q[i]\n lb = sorted(list(db.items()))[::-1][:s]\n ls = sorted(list(ds.items()))[:s][::-1]\n\n for k,v in ls:\n print(\"S {} {}\".format(k,v))\n for k,v in lb:\n print(\"B {} {}\".format(k,v))\n\n\nif __name__ == \"__main__\":\n main()\n", "n, s2 = map(int, input().split())\r\nb = {}\r\ns = {}\r\nb1 = set()\r\ns1 = set()\r\nfor i in range(n):\r\n v = list(map(str, input().split()))\r\n if v[0] == 'B':\r\n if v[1] in b1:\r\n b[v[1]] += int(v[2])\r\n else:\r\n b[v[1]] = int(v[2])\r\n b1.add(v[1])\r\n if v[0] == 'S':\r\n if v[1] in s1:\r\n s[v[1]] += int(v[2])\r\n else:\r\n s[v[1]] = int(v[2])\r\n s1.add(v[1])\r\nansb = []\r\nanss = []\r\n\r\nfor i, j in b.items():\r\n ansb.append((int(i), int(j)))\r\nansb.sort(reverse = True)\r\n\r\nfor i, j in s.items():\r\n anss.append((int(i), int(j)))\r\nanss.sort()\r\nk = len(ansb)\r\np = len(anss)\r\ni = 0\r\nj = min(s2 - 1, p - 1)\r\ns1 = s2\r\n\r\nwhile s1 > 0 and p > 0:\r\n print('S', anss[j][0], anss[j][1])\r\n j -= 1\r\n s1 -= 1\r\n p -= 1\r\n\r\n\r\nwhile s2 > 0 and k > 0:\r\n print('B', ansb[i][0], ansb[i][1])\r\n k -= 1\r\n s2 -= 1\r\n i += 1", "n,s = [int(x) for x in input().split()]\nbuy_dict = {}\nsell_dict = {}\nfor i in range(n):\n\tchtype,pi,di = input().split()\n\tpi = int(pi)\n\tdi = int(di)\n\tif chtype=='B':\n\t\tbuy_dict[pi] = buy_dict.get(pi,0)+di\n\telse:\n\t\tsell_dict[pi] = sell_dict.get(pi,0)+di\nbuy_list = sorted(buy_dict.items(),reverse=True)[:s]\nsell_list = reversed(sorted(sell_dict.items())[:s])\nfor pi,qi in sell_list:\n\tprint('S',pi,qi)\nfor pi,qi in buy_list:\n\tprint('B',pi,qi)\n" ]

{"inputs": ["6 2\nB 10 3\nS 50 2\nS 40 1\nS 50 6\nB 20 4\nB 25 10", "2 1\nB 7523 5589\nS 69799 1711", "1 1\nB 48259 991", "1 50\nB 47828 7726", "1 1\nS 95992 7257", "1 50\nS 72218 8095", "2 50\nB 758 9290\nS 86168 3367", "3 3\nB 5878 1568\nS 60238 4895\nS 76276 1905", "6 2\nB 0 1\nS 1 1\nS 1 1\nS 1 1\nB 0 1\nB 0 1", "2 2\nS 1 1\nB 0 2", "2 1\nS 10 1\nB 0 1", "2 10\nB 0 1\nS 100000 1", "2 1\nS 1 1\nB 0 1", "2 1\nB 0 100\nS 1 100", "2 2\nB 0 3\nS 10 3", "2 10\nB 0 1\nS 1 1", "2 50\nB 2 5\nB 0 1"], "outputs": ["S 50 8\nS 40 1\nB 25 10\nB 20 4", "S 69799 1711\nB 7523 5589", "B 48259 991", "B 47828 7726", "S 95992 7257", "S 72218 8095", "S 86168 3367\nB 758 9290", "S 76276 1905\nS 60238 4895\nB 5878 1568", "S 1 3\nB 0 3", "S 1 1\nB 0 2", "S 10 1\nB 0 1", "S 100000 1\nB 0 1", "S 1 1\nB 0 1", "S 1 100\nB 0 100", "S 10 3\nB 0 3", "S 1 1\nB 0 1", "B 2 5\nB 0 1"]}

UNKNOWN

PYTHON3

CODEFORCES

30

d51744512d657fc8c49daa2a291bf799

Property

Bill is a famous mathematician in BubbleLand. Thanks to his revolutionary math discoveries he was able to make enough money to build a beautiful house. Unfortunately, for not paying property tax on time, court decided to punish Bill by making him lose a part of his property. Bill’s property can be observed as a convex regular 2*n*-sided polygon *A*0 *A*1... *A*2*n*<=-<=1 *A*2*n*,<= *A*2*n*<==<= *A*0, with sides of the exactly 1 meter in length. Court rules for removing part of his property are as follows: - Split every edge *A**k* *A**k*<=+<=1,<= *k*<==<=0... 2*n*<=-<=1 in *n* equal parts of size 1<=/<=*n* with points *P*0,<=*P*1,<=...,<=*P**n*<=-<=1 - On every edge *A*2*k* *A*2*k*<=+<=1,<= *k*<==<=0... *n*<=-<=1 court will choose one point *B*2*k*<==<= *P**i* for some *i*<==<=0,<=...,<= *n*<=-<=1 such that - On every edge *A*2*k*<=+<=1*A*2*k*<=+<=2,<= *k*<==<=0...*n*<=-<=1 Bill will choose one point *B*2*k*<=+<=1<==<= *P**i* for some *i*<==<=0,<=...,<= *n*<=-<=1 such that - Bill gets to keep property inside of 2*n*-sided polygon *B*0 *B*1... *B*2*n*<=-<=1 Luckily, Bill found out which *B*2*k* points the court chose. Even though he is a great mathematician, his house is very big and he has a hard time calculating. Therefore, he is asking you to help him choose points so he maximizes area of property he can keep. The first line contains one integer number *n* (2<=≤<=*n*<=≤<=50000), representing number of edges of 2*n*-sided polygon. The second line contains *n* distinct integer numbers *B*2*k* (0<=≤<=*B*2*k*<=≤<=*n*<=-<=1,<= *k*<==<=0... *n*<=-<=1) separated by a single space, representing points the court chose. If *B*2*k*<==<=*i*, the court chose point *P**i* on side *A*2*k* *A*2*k*<=+<=1. Output contains *n* distinct integers separated by a single space representing points *B*1,<=*B*3,<=...,<=*B*2*n*<=-<=1 Bill should choose in order to maximize the property area. If there are multiple solutions that maximize the area, return any of them. Sample Input 3 0 1 2 Sample Output 0 2 1

[ "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nb = []\r\nfor i in range(0, n-1):\r\n b.append((a[i]-(n-a[i+1]), i))\r\nb.append((a[n-1]-(n-a[0]), n-1))\r\nb = sorted(b)\r\nans = n*[0]\r\nfor i in range(n):\r\n # the line segment at index b[i][1]\r\n ans[b[i][1]] = i\r\nfor i in range(n):\r\n print(ans[i], end = ' ')\r\n" ]

{"inputs": ["3\n0 1 2", "10\n0 1 2 3 4 5 6 7 8 9", "10\n1 7 3 6 8 2 4 5 0 9", "10\n4 9 7 2 3 5 6 1 8 0", "5\n1 2 3 0 4", "5\n3 0 2 1 4", "5\n2 4 3 0 1", "17\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16", "17\n5 13 12 8 4 7 15 6 0 1 2 10 9 14 3 16 11", "17\n7 10 12 11 13 0 9 6 4 2 15 3 5 8 14 16 1", "50\n15 14 37 47 44 7 1 0 39 18 26 25 24 48 4 41 33 12 31 45 43 5 16 23 8 49 34 35 29 2 9 40 36 11 27 46 17 38 19 6 28 21 32 13 22 42 10 20 30 3", "50\n28 37 42 14 19 23 35 25 22 30 36 12 4 46 38 29 41 2 24 43 7 21 11 13 32 48 0 6 1 40 49 16 15 8 20 10 9 34 45 31 17 5 47 26 33 44 27 18 3 39", "50\n48 24 13 25 40 2 41 17 35 0 28 29 37 10 6 5 36 12 46 21 23 33 15 45 18 16 47 19 20 22 8 30 7 1 31 49 27 4 43 14 11 38 39 34 9 44 32 3 26 42", "100\n54 93 37 83 59 66 74 19 6 75 76 81 41 97 22 86 80 13 55 3 32 40 18 96 95 44 33 53 79 88 28 70 63 35 25 38 85 36 58 98 87 12 52 0 16 61 17 72 46 62 31 20 43 34 4 7 60 15 73 1 78 48 69 30 8 14 94 84 91 27 2 64 57 42 71 51 29 89 5 11 26 90 99 77 68 82 24 65 23 21 67 92 47 10 56 49 9 45 39 50", "100\n10 35 37 66 56 68 22 41 52 36 3 90 32 20 0 43 75 59 40 25 97 94 8 91 33 26 79 69 78 49 72 53 61 15 65 82 76 58 4 17 73 99 92 31 95 85 96 98 27 62 74 51 21 14 63 80 11 16 64 57 84 30 86 42 2 60 29 19 81 23 83 87 71 38 54 13 5 48 39 55 6 24 18 9 12 46 89 1 77 28 50 45 88 67 93 70 47 7 44 34", "100\n60 61 7 27 72 82 46 3 65 67 29 90 68 37 36 31 38 80 79 15 19 47 42 70 54 33 83 30 35 69 59 78 18 17 40 62 20 5 57 26 2 98 9 63 16 81 6 86 77 91 92 32 28 94 52 45 21 71 73 76 74 50 34 4 23 25 1 39 41 95 48 84 51 85 58 43 99 97 56 8 88 75 96 11 55 13 10 53 87 0 44 12 24 14 66 22 89 49 93 64", "100\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 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", "2\n1 0"], "outputs": ["0 2 1", "0 1 2 3 5 6 7 8 9 4", "2 6 5 9 7 1 4 0 3 8", "8 9 6 1 4 7 2 5 3 0", "1 3 0 2 4", "2 0 1 3 4", "3 4 2 0 1", "0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 8", "8 15 11 5 3 13 12 2 0 1 4 9 14 7 10 16 6", "8 12 14 15 6 3 7 4 0 9 11 2 5 13 16 10 1", "6 27 47 49 28 1 0 15 34 17 29 25 41 30 20 43 19 16 44 48 22 4 14 9 35 46 40 38 8 2 24 45 21 13 42 37 33 36 5 11 23 32 18 12 39 31 7 26 10 3", "34 45 30 14 17 31 33 22 28 36 25 2 26 48 37 40 19 8 38 27 10 13 7 21 47 24 0 1 15 49 35 12 6 9 11 3 18 46 43 23 5 29 42 32 44 41 20 4 16 39", "43 13 15 38 19 21 33 28 11 4 31 39 24 2 1 17 26 34 41 22 30 25 35 36 9 37 40 16 18 6 14 12 0 8 48 45 7 23 32 3 27 47 44 20 29 46 10 5 42 49", "86 77 69 84 75 83 46 4 35 88 90 72 80 68 57 92 45 25 17 6 26 16 61 99 81 31 37 78 93 62 50 79 49 18 20 74 70 48 89 97 53 21 12 2 30 32 43 65 58 44 11 19 29 9 0 24 28 40 27 33 76 64 52 8 3 59 96 94 66 5 23 71 51 60 73 34 67 47 1 7 63 98 95 85 87 56 42 39 10 38 91 82 14 22 55 15 13 36 41 54", "13 28 53 66 70 42 24 46 37 8 45 67 16 1 10 63 79 50 25 68 97 52 49 71 20 55 87 85 76 64 72 59 29 35 86 89 80 23 3 41 94 98 69 75 95 96 99 73 39 82 74 27 7 30 84 43 5 34 65 83 60 61 77 12 22 38 14 51 54 57 93 90 58 44 26 0 17 36 47 21 6 9 4 2 19 81 40 33 56 32 48 78 88 91 92 62 18 15 31 11", "65 28 6 51 90 71 14 27 73 48 64 92 56 31 25 29 63 93 45 5 24 42 60 67 40 62 61 21 55 72 78 47 7 16 54 35 1 18 36 4 52 57 30 32 50 39 44 94 96 98 68 17 66 86 49 23 43 85 87 88 69 37 10 3 13 2 11 34 76 83 74 75 77 84 53 81 99 89 20 46 95 97 58 22 26 0 19 80 38 12 15 8 9 33 41 59 79 82 91 70", "0 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 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 49", "1 0"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d536f2dd4edadb347b7f5b76e5bebc9f

Shower Line

Many students live in a dormitory. A dormitory is a whole new world of funny amusements and possibilities but it does have its drawbacks. There is only one shower and there are multiple students who wish to have a shower in the morning. That's why every morning there is a line of five people in front of the dormitory shower door. As soon as the shower opens, the first person from the line enters the shower. After a while the first person leaves the shower and the next person enters the shower. The process continues until everybody in the line has a shower. Having a shower takes some time, so the students in the line talk as they wait. At each moment of time the students talk in pairs: the (2*i*<=-<=1)-th man in the line (for the current moment) talks with the (2*i*)-th one. Let's look at this process in more detail. Let's number the people from 1 to 5. Let's assume that the line initially looks as 23154 (person number 2 stands at the beginning of the line). Then, before the shower opens, 2 talks with 3, 1 talks with 5, 4 doesn't talk with anyone. Then 2 enters the shower. While 2 has a shower, 3 and 1 talk, 5 and 4 talk too. Then, 3 enters the shower. While 3 has a shower, 1 and 5 talk, 4 doesn't talk to anyone. Then 1 enters the shower and while he is there, 5 and 4 talk. Then 5 enters the shower, and then 4 enters the shower. We know that if students *i* and *j* talk, then the *i*-th student's happiness increases by *g**ij* and the *j*-th student's happiness increases by *g**ji*. Your task is to find such initial order of students in the line that the total happiness of all students will be maximum in the end. Please note that some pair of students may have a talk several times. In the example above students 1 and 5 talk while they wait for the shower to open and while 3 has a shower. The input consists of five lines, each line contains five space-separated integers: the *j*-th number in the *i*-th line shows *g**ij* (0<=≤<=*g**ij*<=≤<=105). It is guaranteed that *g**ii*<==<=0 for all *i*. Assume that the students are numbered from 1 to 5. Print a single integer — the maximum possible total happiness of the students. Sample Input 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 43 21 18 2 3 0 21 11 65 5 2 0 1 4 54 62 12 0 99 87 64 81 33 0 Sample Output 32 620

[ "from itertools import permutations\r\nfrom sys import stdin,stdout\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\na=[1,2,3,4,5] ; arr=[] ; ans=0 ; pet=list(permutations(a,5))\r\nfor i in range(5):\r\n arr.append(list(map(int,input().split())))\r\n\r\nfor i in pet:\r\n x=0\r\n for j in range(4):\r\n if j>=2:\r\n x+=arr[i[j]-1][i[j+1]-1]*2+arr[i[j+1]-1][i[j]-1]*2 \r\n else:\r\n x+=(arr[i[j]-1][i[j+1]-1]+arr[i[j+1]-1][i[j]-1]) \r\n ans=max(ans,x)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "l=[]\r\nfor i in range(5):\r\n f=list(map(int,input().split()))\r\n l.append(f)\r\n\r\nfrom itertools import permutations\r\nper=[0,1,2,3,4]\r\nperms=permutations(per)\r\ng=0\r\nfor i in perms :\r\n fun=0\r\n fun+=l[i[0]][i[1]]+l[i[1]][i[0]]\r\n fun+=l[i[1]][i[2]]+l[i[2]][i[1]]\r\n fun+=2*(l[i[2]][i[3]]+l[i[3]][i[2]])\r\n fun+=2*(l[i[3]][i[4]]+l[i[4]][i[3]])\r\n\r\n if g < fun :\r\n g=fun\r\n\r\nprint(g)\r\n\r\n\r\n", "# import math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom math import *\r\nimport itertools\r\nfrom bisect import bisect_right\r\n\r\nmod = 1000000007\r\n\r\n\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\ndef solve():\r\n mat = []\r\n for _ in range(5):\r\n mat.append(list(map(int,input().split())))\r\n ans = 0\r\n l=itertools.permutations([1,2,3,4,0])\r\n for i in l:\r\n cur=0\r\n for j in range(5):\r\n x=j+1\r\n if x==5:\r\n cur+=(mat[i[4]][i[3]]+mat[i[3]][i[4]])*2\r\n elif x==4:\r\n cur+=(mat[i[3]][i[2]]+mat[i[2]][i[3]])*2\r\n elif x==3:\r\n cur+=(mat[i[2]][i[1]]+mat[i[1]][i[2]])\r\n elif x==2:\r\n cur += (mat[i[1]][i[0]] + mat[i[0]][i[1]])\r\n ans = max(cur,ans)\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor num in range(t):\r\n # print(\"Case #{}: \".format(num + 1), end=\"\")\r\n solve()\r\n\r\n", "from collections import deque\ndef su(ll,a):\n p = ll.copy()\n ans = 0\n for i in range(2):\n ans += a[p[0]][p[1]] + a[p[1]][p[0]] + a[p[2]][p[3]] + a[p[3]][p[2]]\n p.popleft()\n p.append(0)\n \n for i in range(2):\n ans += a[p[0]][p[1]] + a[p[1]][p[0]]\n p.popleft()\n p.append(0)\n p.clear()\n return ans\n \na = []\nfor i in range(5):\n a.append(list(map(int,input().split())))\n\np = deque()\nans = 0\nx = 0\nfor i in range(5):\n for j in range(5):\n if j == i:\n continue\n for k in range(5):\n if k == i or k == j:\n continue\n for l in range(5):\n if l == i or l == j or l == k:\n continue\n for m in range(5):\n if m == i or m == j or m == k or m == l:\n continue\n p.clear()\n p.append(i)\n p.append(j)\n p.append(k)\n p.append(l)\n p.append(m)\n ans = max(ans,su(p,a))\nprint(ans)", "def cute(l,a,b,c,d,e):\r\n s=0\r\n s+=l[a][b]+l[b][a]+l[b][c]+l[c][b]+2*l[c][d]+2*l[d][c]+2*l[d][e]+2*l[e][d]\r\n return s\r\nl=[]\r\nfor i in range(5):\r\n k=list(map(int,input().split()))\r\n l.append(k)\r\nhappylilkittyblanca=0\r\nfor a in range(5):\r\n for b in range(5):\r\n if b!=a:\r\n for c in range(5):\r\n if c!=b and c!=a:\r\n for d in range(5):\r\n if d!=c and d!=b and d!=a:\r\n for e in range(5):\r\n if e!=d and e!=c and e!=b and e!=a:\r\n blanca_hap=cute(l,a,b,c,d,e)\r\n if happylilkittyblanca<blanca_hap:\r\n happylilkittyblanca=blanca_hap\r\nprint(happylilkittyblanca)", "\r\ndef calc(x1, x2, x3, x4, x5, table):\r\n res = 0\r\n res += (table[x1][x2] + table[x2][x1])\r\n res += (table[x3][x4] + table[x4][x3])\r\n res += (table[x2][x3] + table[x3][x2])\r\n res += (table[x4][x5] + table[x5][x4])\r\n res += (table[x3][x4] + table[x4][x3])\r\n res += (table[x4][x5] + table[x5][x4])\r\n return res\r\n\r\ndef main():\r\n table = []\r\n vals = []\r\n for i in range(5):\r\n tmp = list(map(int, input().split()))\r\n table.append(tmp)\r\n for x1 in range(5):\r\n for x2 in range(5):\r\n for x3 in range(5):\r\n for x4 in range(5):\r\n for x5 in range(5):\r\n if len(set([x1, x2, x3, x4, x5])) == 5:\r\n vals.append(calc(x1, x2, x3, x4, x5, table))\r\n print(max(vals))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import itertools\r\n\r\narr = [[0] * 6 for _ in range(6)]\r\nmax_val = 0\r\n\r\nwhile True:\r\n try:\r\n arr[0][0], arr[0][1], arr[0][2], arr[0][3], arr[0][4] = map(int, input().split())\r\n max_val = 0\r\n q = [1, 2, 3, 4, 5]\r\n for i in range(1, 5):\r\n arr[i] = list(map(int, input().split()))\r\n\r\n for permutation in itertools.permutations(q):\r\n tmp = list(permutation)\r\n lol = 0\r\n while tmp:\r\n for i in range(0, len(tmp) - 1, 2):\r\n lol += arr[tmp[i] - 1][tmp[i + 1] - 1] + arr[tmp[i + 1] - 1][tmp[i] - 1]\r\n tmp = tmp[1:]\r\n\r\n if lol > max_val:\r\n max_val = lol\r\n\r\n print(max_val)\r\n\r\n except EOFError:\r\n break\r\n", "from itertools import permutations\r\n\r\nshowerqueue = [[int(x) for x in input().split()] for _ in range(5)]\r\nmax = 0\r\nfor _ in permutations([0,1,2,3,4]):\r\n a, b, c, d, e = _\r\n firstround = showerqueue[a][b] + showerqueue[b][a] + showerqueue[c][d] + showerqueue[d][c]\r\n secondround = showerqueue[b][c] + showerqueue[c][b] + showerqueue[d][e] + showerqueue[e][d]\r\n thirdandfourth = showerqueue[c][d] + showerqueue[d][c] + showerqueue[d][e] + showerqueue[e][d]\r\n sum = firstround + secondround + thirdandfourth\r\n if sum > max:\r\n max = sum\r\nprint(max)\r\n", "from itertools import permutations\n\nperms = permutations(range(5))\n\nmat = [[]]*5\n\nfor i in range(5):\n mat[i] = [int(x) for x in input().split()]\n\nmaxval = 0\n\n# print(mat)\nfor perm in perms:\n val = 0\n # print(perm)\n for i in range(4):\n for j in range(i+1,5,2):\n val += mat[perm[j]][perm[j-1]] + mat[perm[j-1]][perm[j]]\n # print(j-1,j,val);\n maxval = max(val, maxval)\n\nprint(maxval)\n", "def generate_sequences(elements, sequence_length, current_sequence, all_sequences):\r\n if len(current_sequence) == sequence_length:\r\n all_sequences.append(current_sequence[:]) # Добавляем текущую последовательность в список\r\n return\r\n\r\n for element in elements:\r\n if element not in current_sequence:\r\n generate_sequences(elements, sequence_length, current_sequence + [element], all_sequences)\r\n\r\ndef solve():\r\n happy = []\r\n max_happy = 0\r\n for i in range(5):\r\n happy.append(list(map(int, input().split())))\r\n\r\n sequences = []\r\n generate_sequences([0, 1, 2, 3, 4], 5, [], sequences)\r\n for seq in sequences:\r\n current_max_happy = (happy[seq[0]][seq[1] ] + happy[seq[1]][seq[0]] +\r\n happy[seq[2]][seq[3]] + happy[seq[3]][seq[2]]) + \\\r\n (happy[seq[1]][seq[2]] + happy[seq[2]][seq[1]] +\r\n happy[seq[3]][seq[4]] + happy[seq[4]][seq[3]]) + \\\r\n (happy[seq[2]][seq[3]] + happy[seq[3]][seq[2]]) + \\\r\n (happy[seq[3]][seq[4]] + happy[seq[4]][seq[3]])\r\n if current_max_happy > max_happy:\r\n max_happy = current_max_happy\r\n return max_happy\r\n\r\n\r\nprint(solve())", "g = []\r\nfor i in range(5):\r\n\tg.append([])\r\n\tg[i] = list(map(int, input().split()))\r\nfrom itertools import permutations\r\nM = -1\r\nfor p in permutations(range(1,6)):\r\n\tM = max(M, g[p[0]-1][p[1]-1] + g[p[1]-1][p[0]-1] + g[p[1]-1][p[2]-1] + g[p[2]-1][p[1]-1] + 2*(g[p[2]-1][p[3]-1] + g[p[3]-1][p[2]-1] + g[p[3]-1][p[4]-1] + g[p[4]-1][p[3]-1]))\r\nprint(M)\r\n ", "'''generate permutations from 1 to n'''\r\na = [True] * 1000\r\npermutation = []\r\npermutation_list = []\r\n\r\n\r\n# show permutation\r\ndef show(lst):\r\n g = lst.copy()\r\n permutation_list.append(g)\r\n return []\r\n\r\n\r\ndef generate_permutation(n, combo=permutation, not_used=a):\r\n # If the permutation is ready, show it. (Base case)\r\n if len(combo) == n:\r\n combo = show(combo)\r\n not_used = [True] * 10\r\n\r\n # We find the combos ... (Recursive case)\r\n else:\r\n # ... by trying every digit.\r\n for i in range(1, n + 1):\r\n # If the digit is not used, ...\r\n if not_used[i]:\r\n # ... we use the digit.\r\n not_used[i] = False\r\n combo.append(i)\r\n # Then we try another digit for the remaining vacancies.\r\n generate_permutation(n, combo, not_used)\r\n # This is the best part, after we've tried the digit,\r\n # we can pop it and try the nest one.\r\n combo.pop()\r\n not_used[i] = True\r\n\r\n\r\nhappiness_matrix = []\r\nanswer = 0\r\ngenerate_permutation(5)\r\n\r\nfor i in range(5):\r\n happiness_matrix.append(list(map(int, input().split())))\r\n\r\nfor i in range(len(permutation_list)):\r\n # a b c d e\r\n a = permutation_list[i][0] - 1\r\n b = permutation_list[i][1] - 1\r\n c = permutation_list[i][2] - 1\r\n d = permutation_list[i][3] - 1\r\n e = permutation_list[i][4] - 1\r\n answer = max(happiness_matrix[a][b] + happiness_matrix[b][a] + \\\r\n happiness_matrix[c][d] + happiness_matrix[d][c] + \\\r\n happiness_matrix[b][c] + happiness_matrix[c][b] + \\\r\n happiness_matrix[d][e] + happiness_matrix[e][d] + \\\r\n happiness_matrix[c][d] + happiness_matrix[d][c] + \\\r\n happiness_matrix[d][e] + happiness_matrix[e][d], answer)\r\n\r\nprint(answer)", "from itertools import permutations\n\nn = 5\nar = []\nfor i in range(n):\n ar.append(list(map(int,input().split(\" \"))))\nls = list(permutations(range(0,5)))\nmaxi = 0\nfor i in range(120):\n s = (ar[ls[i][0]][ls[i][1]]+ar[ls[i][1]][ls[i][0]]+ar[ls[i][2]][ls[i][3]]+ar[ls[i][3]][ls[i][2]]) + (ar[ls[i][1]][ls[i][2]]+ar[ls[i][2]][ls[i][1]]+ar[ls[i][3]][ls[i][4]]+ar[ls[i][4]][ls[i][3]]) + (ar[ls[i][2]][ls[i][3]]+ar[ls[i][3]][ls[i][2]]) + (ar[ls[i][3]][ls[i][4]]+ar[ls[i][4]][ls[i][3]])\n if s > maxi:\n maxi = s\nprint(maxi)\n\n\n\n\n\n\n\n\n\n", "permutations = []\r\ncurrent = []\r\n\r\n\r\ndef search(i=1):\r\n if i == 6:\r\n permutations.append(current.copy())\r\n else:\r\n for j in range(1, 6):\r\n if not j in current:\r\n current.append(j)\r\n search(i + 1)\r\n current.pop()\r\n\r\n\r\ng = []\r\nfor i in range(5):\r\n g.append([int(x) for x in input().split()])\r\nsearch()\r\nbest = 0\r\nfor permutation in permutations:\r\n current = 0\r\n\r\n while len(permutation) > 1:\r\n for i in range(0, len(permutation) - 1, 2):\r\n current += g[permutation[i] - 1][permutation[i + 1] - 1]\r\n current += g[permutation[i + 1] - 1][permutation[i] - 1]\r\n permutation.pop(0)\r\n\r\n best = max(best, current)\r\nprint(best)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque\r\nfrom math import *\r\nfrom itertools import permutations\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n \r\ng = []\r\nfor i in range(5):\r\n g.append(LIST())\r\n \r\nans = -1\r\n \r\nfor i in permutations(range(0 , 5)):\r\n sm = g[i[0]][i[1]] + g[i[1]][i[0]]\r\n sm += g[i[2]][i[3]] + g[i[3]][i[2]]\r\n sm += g[i[1]][i[2]] + g[i[2]][i[1]]\r\n sm += g[i[3]][i[4]] + g[i[4]][i[3]]\r\n sm += g[i[2]][i[3]] + g[i[3]][i[2]]\r\n sm += g[i[3]][i[4]] + g[i[4]][i[3]]\r\n if sm > ans: ans = sm\r\n \r\nprint(ans)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\nfrom itertools import permutations\r\nl = list(permutations(range(0, 5)))\r\n\r\ng=[]\r\nfor i in range(5):\r\n A=list(map(int,input().split()))\r\n g.append(A)\r\n\r\nm=0\r\n\r\nfor i in l:\r\n temp=g[i[0]][i[1]]+g[i[1]][i[0]]+g[i[1]][i[2]]+g[i[2]][i[1]]\r\n temp+=2*(g[i[2]][i[3]]+g[i[3]][i[2]]+g[i[3]][i[4]]+g[i[4]][i[3]])\r\n m=max(m,temp)\r\n \r\n\r\nprint(m)\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "from itertools import permutations\r\nperms=permutations([1,2,3,4,5])\r\n\r\npermutans=list(perms)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nliste=[]\r\n\r\nfor i in range(5):\r\n liste.append([int(i) for i in input().split()])\r\n\r\n\r\nmax=0\r\nfor i in range(120):\r\n yerel=0\r\n s=permutans[i]\r\n sanik=list(s)\r\n yerel=liste[sanik[0]-1][sanik[1]-1]+liste[sanik[2]-1][sanik[3]-1]+\\\r\n liste[sanik[2]-1][sanik[1]-1]+liste[sanik[3]-1][sanik[4]-1]+ \\\r\n liste[sanik[2]-1][sanik[3]-1]+liste[sanik[3]-1][sanik[4]-1]+ \\\r\n liste[sanik[1] - 1][sanik[0] - 1] + liste[sanik[3] - 1][sanik[2] - 1]+\\\r\n liste[sanik[1] - 1][sanik[2] - 1] + liste[sanik[4] - 1][sanik[3] - 1]+\\\r\n liste[sanik[3] - 1][sanik[2] - 1] + liste[sanik[4] - 1][sanik[3] - 1]\r\n\r\n\r\n\r\n\r\n if(yerel>max):\r\n max=yerel\r\n\r\nprint(max)", "import itertools as it\r\n\r\n\r\ndef sum_for(perm):\r\n s = 0\r\n for i in range(4):\r\n for j in range(i, 4, 2):\r\n s += g[perm[j]][perm[j + 1]] + g[perm[j + 1]][perm[j]]\r\n return s\r\n\r\n\r\ng = [[j for j in map(int, input().split())] for i in range(5)]\r\n\r\nprint(max(sum_for(perm) for perm in it.permutations((0, 1, 2, 3, 4))))\r\n", "s=set()\r\nfor bir in range(1,6):\r\n for iki in range(1,6):\r\n for uc in range(1, 6):\r\n for dort in range(1, 6):\r\n for bes in range(1, 6):\r\n k=str(bir)+str(iki)+str(uc)+str(dort)+str(bes)\r\n flag=False\r\n for i in k:\r\n if k.count(i)>1:\r\n flag=True\r\n break\r\n if not flag:\r\n s.add(k)\r\nkk=[]\r\nt=0\r\nfor i in s:\r\n ll=[]\r\n ll.append([i[t],i[t+1]])\r\n ll.append([i[t+2],i[t+3]])\r\n ll.append([i[t+1],i[t+2]])\r\n ll.append([i[t+3],i[t+4]])\r\n ll.append([i[t+2],i[t+3]])\r\n ll.append([i[t+3],i[t+4]])\r\n kk.append(ll)\r\nff=[]\r\nfor _ in range(5):\r\n ff.append(list(map(int,input().split())))\r\nm=0\r\nfor i in kk:\r\n c=0\r\n for t in i:\r\n x,y=t\r\n x,y=int(x),int(y)\r\n x-=1\r\n y-=1\r\n c+=ff[x][y]\r\n c+=ff[y][x]\r\n if c>m:\r\n m=c\r\nprint(m)", "if __name__ == \"__main__\":\r\n mat = []\r\n for i in range(5):\r\n mat.append([int(x) for x in input().split()])\r\n maximum=0\r\n for a in range(0,5):\r\n for b in range(0,5):\r\n if b==a:\r\n continue\r\n for c in range(0,5):\r\n if c==a or c == b:\r\n continue\r\n for d in range(0,5):\r\n if d==a or d==b or d==c:\r\n continue\r\n for e in range(0,5):\r\n if e==a or e==b or e==c or e==d:\r\n continue\r\n # a b c d e\r\n happiness = mat[a][b] + mat[b][a] + mat[c][d] + mat[d][c] + \\\r\n mat[b][c] + mat[c][b] + mat[d][e] + mat[e][d] + \\\r\n mat[c][d] + mat[d][c] + \\\r\n mat[d][e] + mat[e][d]\r\n if maximum < happiness:\r\n maximum = happiness\r\n print(maximum)", "from itertools import permutations\r\nG=[[*map(int,input().split())] for _ in ' '*5]\r\nf=lambda i,j: G[i][j]+G[j][i]\r\nprint(max(f(a,b)+f(b,c)+2*(f(c,d)+f(d,e)) for a,b,c,d,e in permutations(range(5))))", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import permutations\r\n\r\ng = [list(map(int, input().split())) for _ in range(5)]\r\n\r\nd = [1,2,3,4,5]\r\nd = list(permutations(d,5))\r\nc = 0\r\nfor x in d:\r\n z = 2*(g[x[3]-1][x[4]-1] + g[x[4]-1][x[3]-1] + g[x[3]-1][x[2]-1] + g[x[2]-1][x[3]-1]) + g[x[0]-1][x[1]-1] + g[x[1]-1][x[0]-1] + g[x[2]-1][x[1]-1] + g[x[1]-1][x[2]-1]\r\n c = max(c,z)\r\nprint(c)", "from itertools import permutations\n\n\ndef main():\n rows = []\n for _ in range(5):\n rows.append(list(map(int, input().split(' '))))\n\n max_val = 0\n for perms in permutations([0,1,2,3,4]):\n g12 = rows[perms[0]][perms[1]]\n g21 = rows[perms[1]][perms[0]]\n g23 = rows[perms[1]][perms[2]]\n g32 = rows[perms[2]][perms[1]]\n g34 = rows[perms[2]][perms[3]]\n g43 = rows[perms[3]][perms[2]]\n g45 = rows[perms[3]][perms[4]]\n g54 = rows[perms[4]][perms[3]]\n\n val = g12+g21+g23+g32 + 2*(g34+g43) + 2*(g45+g54)\n if val > max_val:\n max_val = val\n\n print(max_val)\n\n\nif __name__ == \"__main__\":\n main()\n", "x,m=[],0\r\nfor i in range(5): \r\n x.append(list(map(int,input().split())))\r\nfor a in range(5):\r\n for b in range(5):\r\n if b==a:\r\n continue\r\n for c in range(5):\r\n if c==b or c==a:\r\n continue\r\n for d in range(5):\r\n if d==a or d==b or d==c:\r\n continue\r\n for e in range(5):\r\n if e==a or e==b or e==c or e==d:\r\n continue\r\n s=x[a][b]+x[b][a]+x[b][c]+x[c][b]\r\n s+=2*(x[c][d]+x[d][c]+x[d][e]+x[e][d])\r\n if s>m: m=s\r\nprint(m)", "from itertools import permutations\r\n\r\nG = [[*map(int, input().split())] for _ in ' ' * 5]\r\nf = lambda i, j: G[i][j] + G[j][i]\r\nprint(max(f(a, b) + f(b, c) + 2 * (f(c, d) + f(d, e)) for a, b, c, d, e in permutations(range(5))))\r\n", "m_s = []\r\nfor _ in range(5):\r\n m_s.append(input())\r\n\r\n\r\nimport itertools\r\ndef order_happines(arr, m):\r\n tot = 0\r\n arr = arr[:]\r\n while len(arr):\r\n for i in range(1, len(arr), 2):\r\n a, b = arr[i - 1], arr[i]\r\n tot += int(m[a][b]) + int(m[b][a])\r\n\r\n arr.pop(0)\r\n\r\n return tot\r\n\r\n\r\ndef shower_line():\r\n m = []\r\n for line in m_s:\r\n m.append(list(line.split()))\r\n\r\n men = [0, 1, 2, 3, 4]\r\n cand = list(itertools.permutations(men))\r\n maxi = 0\r\n for el in cand:\r\n maxi = max(maxi, order_happines(list(el), m))\r\n return maxi\r\n\r\nprint(shower_line())", "from itertools import permutations\nmat = []\nfor _ in range(5):\n mat.append(list(map(int, input().split())))\n\narr = [1,2,3,4,5]\nans = 0\nfor perm in permutations(arr, 5):\n res = 0\n k = 1\n for i in range(1, 5):\n x = perm[i]\n y = perm[i-1]\n if i >= 3:\n k = 2\n res += (mat[y-1][x-1] + mat[x-1][y-1]) * k\n #print(perm, res)\n ans = max(ans, res)\nprint(ans)\n", "mat = []\nfor _ in range(5):\n mat.append(list(map(int, input().split())))\n\nbest = 0\ndef bt(seq):\n if len(seq) == 5:\n global best\n v1, v2, v3, v4, v5 = seq\n ans = mat[v1][v2] + mat[v2][v1]\n ans += mat[v2][v3] + mat[v3][v2]\n ans += (mat[v3][v4] + mat[v4][v3]) * 2\n ans += (mat[v4][v5] + mat[v5][v4]) * 2\n best = max(best, ans)\n return\n\n for x in range(5):\n if x not in seq:\n seq.append(x)\n bt(seq)\n seq.pop()\n\n\nbt([])\nprint(best)\n", "from itertools import permutations\r\n\r\n\r\ndef main():\r\n mat: list[list[int]] = []\r\n for _ in range(5):\r\n mat.append(get_list_int())\r\n\r\n max_happiness = 0\r\n arrangements = permutations(range(1, 6))\r\n\r\n for arrangement in arrangements:\r\n happiness = 0\r\n for start in range(4):\r\n cur = start\r\n while cur + 1 < 5:\r\n i, j = arrangement[cur] - 1, arrangement[cur + 1] - 1\r\n happiness += mat[i][j] + mat[j][i]\r\n cur += 2\r\n max_happiness = max(max_happiness, happiness)\r\n\r\n print(max_happiness)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import re\r\n\r\n\r\na = []\r\n\r\nfor _ in range(5):\r\n a.append(list(map(int,input().split())))\r\n\r\nmaxH = 0\r\nfor i in range(5):\r\n for j in range(5):\r\n for k in range(5):\r\n for l in range(5):\r\n for m in range(5):\r\n if i==j or i==k or i==l or i==m or j==k or j==l or j==m or k==l or k==m or l==m:\r\n continue\r\n h = 2*(a[l][m]+a[m][l]+a[k][l]+a[l][k])+a[j][k]+a[k][j]+a[i][j]+a[j][i]\r\n \r\n maxH = max(maxH,h)\r\n \r\nprint(maxH)", "from itertools import permutations\r\n\r\n\r\ndef funn(p):\r\n summ = 0\r\n # Calculate summ using the provided pattern\r\n # 01234\r\n summ += (g[p[0]][p[1]] + g[p[1]][p[0]] + g[p[2]][p[3]] + g[p[3]][p[2]])\r\n # 1234\r\n summ += (g[p[1]][p[2]] + g[p[2]][p[1]] + g[p[3]][p[4]] + g[p[4]][p[3]])\r\n # 234\r\n summ += (g[p[2]][p[3]] + g[p[3]][p[2]])\r\n # 34\r\n summ += (g[p[3]][p[4]] + g[p[4]][p[3]])\r\n return summ\r\n\r\n\r\nmaxx = 0\r\ng = []\r\nfor i in range(5):\r\n a = list(map(int, input().split(\" \")))\r\n g.append(a)\r\n\r\nperms = permutations(range(5))\r\n\r\nfor p in perms:\r\n result = funn(p)\r\n maxx = max(maxx, result)\r\n\r\nprint(maxx)\r\n", "from itertools import permutations as per\r\nlst=[]\r\nfor i in range(5):lst.append([int(x) for x in input().split()])\r\nperm=list(per(range(5),5))\r\nbest=0\r\nfor i in perm:best=max(best,2*(lst[i[2]][i[3]]+lst[i[3]][i[2]]+lst[i[3]][i[4]]+lst[i[4]][i[3]])+lst[i[0]][i[1]]+lst[i[1]][i[0]]+lst[i[1]][i[2]]+lst[i[2]][i[1]])\r\nprint(best)\r\n", "import itertools as it\r\n\r\ndef happiness(t):\r\n return l[int(t[0])-1][int(t[1])-1]+l[int(t[1])-1][int(t[0])-1]+l[int(t[1])-1][int(t[2])-1]+l[int(t[2])-1][int(t[1])-1]+2*(l[int(t[3])-1][int(t[4])-1]+l[int(t[4])-1][int(t[3])-1])+2*(l[int(t[3])-1][int(t[2])-1]+l[int(t[2])-1][int(t[3])-1])\r\nl=[]\r\nans=0\r\nfor i in range(5):\r\n l.append(list(map(int, input().split())))\r\n\r\nperm=it.permutations('12345')\r\n\r\nfor x in perm:\r\n ans=max(ans,happiness(x))\r\nprint(ans)\r\n", "def get_permutations():\r\n ll = []\r\n for i in range(5):\r\n for j in range(5):\r\n if j == i:\r\n continue\r\n for k in range(5):\r\n if k == j or k == i:\r\n continue\r\n for m in range(5):\r\n if m == k or m == j or m == i:\r\n continue\r\n for n in range(5):\r\n if n == m or n == k or n == j or n == i:\r\n continue\r\n ll.append([i, j, k, m, n])\r\n # return list(set(itertools.permutations([0,1,2,3,4]))) # would work.\r\n return ll\r\n\r\n\r\ndef solution():\r\n g = [None]*5\r\n for i in range(5):\r\n g[i] = list(map(int, input().split()))\r\n permutations = get_permutations()\r\n #permutations = list(set(itertools.permutations([0,1,2,3,4])))\r\n best_score = 0\r\n best_order = None\r\n for permutation in permutations:\r\n i, j, k, m, n = permutation\r\n score = 2*(g[k][m] + g[m][k]) + 2*(g[m][n] + g[n][m]) + (g[j][k] + g[k][j]) + (g[i][j] + g[j][i])\r\n if score > best_score:\r\n best_order = permutation\r\n best_score = score\r\n print(best_score)\r\n\r\nsolution()", "from itertools import permutations\r\nl=[]\r\nfor i in range(5) :\r\n g=list(map(int,input().split()))\r\n l.append(g)\r\n\r\nper=[1,2,3,4,5]\r\nperms=permutations(per)\r\nk=[]\r\nfor i in perms :\r\n k.append(i)\r\n\r\nfun=0\r\nallfun=0\r\nfor o in k :\r\n fun=0\r\n fun+=l[o[0]-1][o[1]-1]+l[o[1]-1][o[0]-1]\r\n fun+=l[o[1]-1][o[2]-1]+l[o[2]-1][o[1]-1]\r\n fun+=2*(l[o[2]-1][o[3]-1]+l[o[3]-1][o[2]-1])\r\n fun+=2*(l[o[3]-1][o[4]-1]+l[o[4]-1][o[3]-1])\r\n if fun>allfun :\r\n allfun=fun\r\nprint(allfun)\r\n\r\n ", "from itertools import permutations\nfrom typing import List\n\ndef initial_order_for_maximum_happiness(mat: List[List[int]]) -> int:\n def calculate_happiness(student: List[int]) -> int:\n hap = 0\n n = 5\n while student:\n pair = [(student[i], student[i+1]) for i in range(0, n-1, 2)]\n for i, j in pair:\n hap += mat[i][j]\n hap += mat[j][i]\n n -= 1\n student = student[1:]\n return hap\n num = [0, 1, 2, 3, 4]\n possible = list(permutations(num))\n happiness = 0\n for order in possible:\n hap = calculate_happiness(order)\n happiness = max(happiness, hap)\n return happiness\n\na = []\nfor i in range(5):\n b = [int(j) for j in input().split()]\n a.append(b)\nd = initial_order_for_maximum_happiness(a)\nprint(d)\n", "a = [[int(x) for x in input().split()] for i in range(5)]\nans = 0\npermute = []\nn = 5\ntemp = [x for x in range(n)]\ndef get_permutes(i,n):\n if i==n:\n permute.append(temp[:])\n return\n for j in range(i,n):\n temp[i],temp[j]=temp[j],temp[i]\n get_permutes(i+1,n)\n temp[i],temp[j]=temp[j],temp[i]\n\nget_permutes(0,n)\nfor p in permute:\n happ = a[p[0]][p[1]]+a[p[1]][p[0]]+a[p[2]][p[3]]+a[p[3]][p[2]]\n happ += a[p[1]][p[2]]+a[p[2]][p[1]]+a[p[3]][p[4]]+a[p[4]][p[3]]\n happ += a[p[2]][p[3]]+a[p[3]][p[2]]\n happ += a[p[3]][p[4]]+a[p[4]][p[3]]\n ans = max(ans, happ)\nprint(ans)\n\n", "def cost(x,arr):\r\n ans=0\r\n for i in range(5):\r\n j=i \r\n while(j<4):\r\n t1=x[j]\r\n t2=x[j+1]\r\n j+=2\r\n ans+=arr[t1][t2]\r\n ans+=arr[t2][t1]\r\n return ans\r\n\r\n\r\n\r\n\r\n\r\n\r\nl=[(0, 1, 2, 3, 4), (0, 1, 2, 4, 3), (0, 1, 3, 2, 4), (0, 1, 3, 4, 2), (0, 1, 4, 2, 3), (0, 1, 4, 3, 2), (0, 2, 1, 3, 4), (0, 2, 1, 4, 3), (0, 2, 3, 1, 4), (0, 2, 3, 4, 1), (0, 2, 4, 1, 3), (0, 2, 4, 3, 1), (0, 3, 1, 2, 4), (0, 3, 1, 4, 2), (0, 3, 2, 1, 4), (0, 3, 2, 4, 1), (0, 3, 4, 1, 2), (0, 3, 4, 2, 1), (0, 4, 1, 2, 3), (0, 4, 1, 3, 2), (0, 4, 2, 1, 3), (0, 4, 2, 3, 1), (0, 4, 3, 1, 2), (0, 4, 3, 2, 1), (1, 0, 2, 3, 4), (1, 0, 2, 4, 3), (1, 0, 3, 2, 4), (1, 0, 3, 4, 2), (1, 0, 4, 2, 3), (1, 0, 4, 3, 2), (1, 2, 0, 3, 4), (1, 2, 0, 4, 3), (1, 2, 3, 0, 4), (1, 2, 3, 4, 0), (1, 2, 4, 0, 3), (1, 2, 4, 3, 0), (1, 3, 0, 2, 4), (1, 3, 0, 4, 2), (1, 3, 2, 0, 4), (1, 3, 2, 4, 0), (1, 3, 4, 0, 2), (1, 3, 4, 2, 0), (1, 4, 0, 2, 3), (1, 4, 0, 3, 2), (1, 4, 2, 0, 3), (1, 4, 2, 3, 0), (1, 4, 3, 0, 2), (1, 4, 3, 2, 0), (2, 0, 1, 3, 4), (2, 0, 1, 4, 3), (2, 0, 3, 1, 4), (2, 0, 3, 4, 1), (2, 0, 4, 1, 3), (2, 0, 4, 3, 1), (2, 1, 0, 3, 4), (2, 1, 0, 4, 3), (2, 1, 3, 0, 4), (2, 1, 3, 4, 0), (2, 1, 4, 0, 3), (2, 1, 4, 3, 0), (2, 3, 0, 1, 4), (2, 3, 0, 4, 1), (2, 3, 1, 0, 4), (2, 3, 1, 4, 0), (2, 3, 4, 0, 1), (2, 3, 4, 1, 0), (2, 4, 0, 1, 3), (2, 4, 0, 3, 1), (2, 4, 1, 0, 3), (2, 4, 1, 3, 0), (2, 4, 3, 0, 1), (2, 4, 3, 1, 0), (3, 0, 1, 2, 4), (3, 0, 1, 4, 2), (3, 0, 2, 1, 4), (3, 0, 2, 4, 1), (3, 0, 4, 1, 2), (3, 0, 4, 2, 1), (3, 1, 0, 2, 4), (3, 1, 0, 4, 2), (3, 1, 2, 0, 4), (3, 1, 2, 4, 0), (3, 1, 4, 0, 2), (3, 1, 4, 2, 0), (3, 2, 0, 1, 4), (3, 2, 0, 4, 1), (3, 2, 1, 0, 4), (3, 2, 1, 4, 0), (3, 2, 4, 0, 1), (3, 2, 4, 1, 0), (3, 4, 0, 1, 2), (3, 4, 0, 2, 1), (3, 4, 1, 0, 2), (3, 4, 1, 2, 0), (3, 4, 2, 0, 1), (3, 4, 2, 1, 0), (4, 0, 1, 2, 3), (4, 0, 1, 3, 2), (4, 0, 2, 1, 3), (4, 0, 2, 3, 1), (4, 0, 3, 1, 2), (4, 0, 3, 2, 1), (4, 1, 0, 2, 3), (4, 1, 0, 3, 2), (4, 1, 2, 0, 3), (4, 1, 2, 3, 0), (4, 1, 3, 0, 2), (4, 1, 3, 2, 0), (4, 2, 0, 1, 3), (4, 2, 0, 3, 1), (4, 2, 1, 0, 3), (4, 2, 1, 3, 0), (4, 2, 3, 0, 1), (4, 2, 3, 1, 0), (4, 3, 0, 1, 2), (4, 3, 0, 2, 1), (4, 3, 1, 0, 2), (4, 3, 1, 2, 0), (4, 3, 2, 0, 1), (4, 3, 2, 1, 0)]\r\narr=[]\r\nfor i in range(5):\r\n temp=list(map(int,input().split()))\r\n arr.append(temp)\r\n\r\nm1=-10\r\nfor i in l:\r\n t1=cost(i,arr)\r\n if(t1>m1):\r\n # temp=i \r\n m1=t1\r\nprint(m1)\r\n\r\n \r\n\r\n", "mat = []\nfor i in range(5):\n tmp = [ int(x) for x in input().split() ]\n mat.append(tmp)\n\n\ndef cal_hap( mat , op ):\n hp = 0\n i = 0\n while(i < 4):\n j = i\n while(j < 4):\n hp += mat[ op[j] ][ op[j+1] ]\n hp += mat[ op[j+1] ][ op[j] ]\n j += 2\n i += 1\n return hp\n \n\nop = [ [] ]\nfor i in range(5):\n cs = []\n for j in range(len(op)):\n for k in range(5):\n if k not in op[j]:\n cs.append( op[j] + [k])\n op = cs\n\nmx = 0\nfor st in op:\n tmp = cal_hap(mat, st)\n if tmp > mx:\n mx = tmp\n \nprint(mx)\n\n \t \t \t \t \t \t \t\t \t \t\t\t\t\t \t \t", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\nimport itertools\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\nx = 0\r\nfrom itertools import permutations\r\n\r\nz = [[int(j) for j in input().split()] for i in range(5)]\r\nm = 0\r\nfor k in permutations([0, 1, 2, 3, 4]):\r\n s = 0\r\n for i in range(4):\r\n for j in range(i, 4, 2):\r\n s += z[k[j]][k[j + 1]] + z[k[j + 1]][k[j]]\r\n if s > m:\r\n m = s\r\nprint(m)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n1 2 3 4 5\r\n i k\r\n'''\r\n\r\ndef next_permutation(p):\r\n if len(p) <= 1:\r\n return p\r\n \r\n for i in range(len(p)-2, -1, -1):\r\n if p[i] < p[i+1]:\r\n k = i+1\r\n for j in range(k, len(p)):\r\n if p[j] > p[i]:\r\n k = j\r\n\r\n p[i], p[k] = p[k], p[i]\r\n return p[:i+1] + p[i+1:][::-1]\r\n return p[::-1]\r\n\r\n\r\ndef solve():\r\n p = [0,1,2,3,4]\r\n grid = []\r\n for _ in range(5):\r\n grid.append(LII())\r\n\r\n ans = 0\r\n for _ in range(120):\r\n cur = 2 * (grid[p[4]][p[3]] + grid[p[3]][p[4]])\r\n cur += 2 * (grid[p[3]][p[2]] + grid[p[2]][p[3]])\r\n cur += grid[p[0]][p[1]] + grid[p[1]][p[0]]\r\n cur += grid[p[2]][p[1]] + grid[p[1]][p[2]]\r\n ans = max(ans, cur)\r\n p = next_permutation(p)\r\n\r\n print(ans)\r\n\r\nsolve()", "def get_permutations(set):\r\n if len(set) == 2:\r\n return [set, [set[1], set[0]]]\r\n elif len(set) < 2:\r\n return set\r\n\r\n perms = []\r\n prev = get_permutations(set[1:])\r\n for i in range(len(set)):\r\n for perm in prev:\r\n perms.append(perm[:i]+[set[0]]+perm[i:])\r\n return perms\r\n\r\n\r\ndef evaluate(p, mat):\r\n value = mat[p[0]][p[1]]+mat[p[1]][p[0]]+mat[p[2]][p[3]]+mat[p[3]][p[2]]\r\n value += mat[p[1]][p[2]]+mat[p[2]][p[1]]+mat[p[3]][p[4]]+mat[p[4]][p[3]]\r\n\r\n value += mat[p[2]][p[3]]+mat[p[3]][p[2]]\r\n value += mat[p[3]][p[4]]+mat[p[4]][p[3]]\r\n\r\n return value\r\n\r\n\r\n\r\ndef main():\r\n matrix = []\r\n for i in range(5):\r\n matrix.append(list(map(int, input().split())))\r\n \r\n result = 0\r\n perms = get_permutations([0, 1, 2, 3, 4])\r\n for perm in perms:\r\n value = evaluate(perm, matrix)\r\n result = result if result >= value else value\r\n print(result)\r\n\r\n\r\nmain()", "import sys, math, itertools\r\ninput = sys.stdin.readline \r\nfrom collections import Counter , defaultdict\r\ndef instr():\r\n return input()[:-1]\r\nimport math \r\npermutations = itertools.permutations(list(range(5)))\r\n############################\r\ninput = sys.stdin.readline\r\ndata = []\r\nfor i in range(5):\r\n data.append(list(map(int, input().split())))\r\nmx = 0\r\nfor p in permutations:\r\n value = data[p[1]][p[0]] + data[p[0]][p[1]] + data[p[1]][p[2]] + data[p[2]][p[1]] + 2*(data[p[3]][p[2]] + data[p[2]][p[3]]) + 2*(data[p[3]][p[4]] + data[p[4]][p[3]]) \r\n if mx < value :\r\n mx = value\r\nprint(mx)", "import sys\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations\r\ndata=[]\r\nfor _ in range(5):\r\n data.append(list(map(int,input().split())))\r\n\r\nans=0\r\nPermutations=list(permutations([0,1,2,3,4],5)) \r\nfor i,j,k,l ,m in Permutations:\r\n check=data[i][j]+data[j][i]+data[k][l]+data[l][k]\r\n check+=data[j][k]+data[k][j]+data[l][m]+data[m][l]\r\n check+=data[k][l] +data[l][k]\r\n check+=data[l][m]+data[m][l]\r\n\r\n ans=max(ans,check)\r\nprint(ans) " ]

{"inputs": ["0 0 0 0 9\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n7 0 0 0 0", "0 43 21 18 2\n3 0 21 11 65\n5 2 0 1 4\n54 62 12 0 99\n87 64 81 33 0", "0 4 2 4 9\n6 0 2 5 0\n2 5 0 6 3\n6 3 3 0 10\n0 3 1 3 0", "0 65 90 2 32\n69 0 9 97 67\n77 97 0 16 84\n18 50 94 0 63\n69 12 82 16 0", "0 70 10 0 0\n70 0 50 90 0\n10 50 0 80 0\n0 90 80 0 100\n0 0 0 100 0", "0 711 647 743 841\n29 0 109 38 682\n329 393 0 212 512\n108 56 133 0 579\n247 92 933 164 0", "0 9699 6962 6645 7790\n9280 0 6215 8661 6241\n2295 7817 0 7373 9681\n693 6298 1381 0 4633\n7626 3761 694 4073 0", "0 90479 71577 33797 88848\n45771 0 96799 78707 72708\n5660 26421 0 10991 22757\n78919 24804 90645 0 48665\n92787 43671 38727 17302 0", "0 61256 85109 94834 32902\n55269 0 67023 1310 85444\n23497 84998 0 55618 80701\n30324 1713 62127 0 55041\n47799 52448 40072 28971 0", "0 7686 20401 55871 74372\n29526 0 15486 2152 84700\n27854 30093 0 62418 14297\n43903 76036 36194 0 50522\n29743 9945 38831 75882 0", "0 5271 65319 64976 13673\n80352 0 41169 66004 47397\n33603 44407 0 55079 36122\n4277 9834 92810 0 80276\n1391 1145 92132 51595 0", "0 75763 33154 32389 12897\n5095 0 6375 61517 46063\n35354 82789 0 24814 310\n37373 45993 61355 0 76865\n24383 84258 71887 71430 0", "0 89296 32018 98206 22395\n15733 0 69391 74253 50419\n80450 89589 0 20583 51716\n38629 93129 67730 0 69703\n44054 83018 21382 64478 0", "0 14675 94714 27735 99544\n45584 0 43621 94734 66110\n72838 45781 0 47389 99394\n75870 95368 33311 0 63379\n21974 70489 53797 23747 0", "0 9994 14841 63916 37926\n80090 0 90258 96988 18217\n674 69024 0 17641 54436\n35046 21380 14213 0 67188\n49360 19086 68337 70856 0", "0 28287 52158 19163 10096\n93438 0 19260 88892 12429\n22525 60034 0 78163 18126\n11594 8506 56066 0 17732\n59561 82486 23419 57406 0", "0 35310 30842 63415 91022\n30553 0 25001 38944 92355\n48906 33736 0 96880 80893\n80507 79652 45299 0 38212\n72488 77736 19203 56436 0", "0 42865 18485 37168 43099\n41476 0 58754 73410 51163\n76093 44493 0 51611 93773\n87223 80979 58422 0 63327\n51215 63346 84797 52809 0", "0 63580 51022 25392 84354\n39316 0 17516 63801 92440\n5447 2074 0 11758 4772\n26329 55642 62442 0 75330\n6164 83831 10741 15214 0", "0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "0 1 1 1 0\n1 0 0 1 0\n0 1 0 0 1\n1 1 0 0 0\n1 0 0 1 0", "0 3 6 9 8\n2 0 8 7 7\n4 6 0 6 1\n9 0 3 0 6\n6 5 0 2 0", "0 97 67 53 6\n96 0 100 57 17\n27 79 0 66 16\n89 46 71 0 28\n27 26 27 12 0", "0 670 904 349 56\n446 0 941 590 993\n654 888 0 423 752\n16 424 837 0 433\n418 655 459 897 0", "0 4109 129 1340 7124\n7815 0 8991 2828 909\n5634 799 0 5691 9604\n3261 7013 8062 0 5160\n2433 4742 694 4786 0", "0 14299 32984 96001 30445\n77723 0 75669 14101 55389\n30897 9956 0 52675 29987\n36518 90812 92955 0 64020\n91242 50085 86272 62454 0", "0 46183 30304 63049 13191\n37244 0 23076 12594 43885\n98470 1788 0 37335 7775\n33822 50804 27921 0 56734\n38313 67579 77714 46687 0", "0 39037 87960 13497 38526\n5528 0 44220 23338 92550\n87887 86544 0 30269 82845\n24590 60325 90979 0 20186\n64959 69875 93564 68355 0", "0 27677 88187 87515 82582\n98177 0 22852 28214 99977\n52662 14066 0 79760 68188\n56883 30561 91843 0 79777\n12461 14821 29284 54372 0", "0 37330 91942 67667 42061\n1978 0 84218 17 10834\n11303 6279 0 48597 26591\n82688 5437 34983 0 92556\n79574 32231 23167 16637 0", "0 3 0 0 0\n3 0 2 0 0\n0 2 0 1 0\n0 0 1 0 1\n0 0 0 1 0"], "outputs": ["32", "620", "63", "947", "960", "6265", "93667", "860626", "822729", "605229", "744065", "714904", "874574", "974145", "801116", "654636", "953303", "864938", "738415", "0", "10", "90", "926", "9752", "69867", "783459", "666175", "950600", "878207", "718057", "24"]}

UNKNOWN

PYTHON3

CODEFORCES

44

d58e0be64698471a23413eaf7d77d0a6

Subway Innovation

Berland is going through tough times — the dirt price has dropped and that is a blow to the country's economy. Everybody knows that Berland is the top world dirt exporter! The President of Berland was forced to leave only *k* of the currently existing *n* subway stations. The subway stations are located on a straight line one after another, the trains consecutively visit the stations as they move. You can assume that the stations are on the *Ox* axis, the *i*-th station is at point with coordinate *x**i*. In such case the distance between stations *i* and *j* is calculated by a simple formula |*x**i*<=-<=*x**j*|. Currently, the Ministry of Transport is choosing which stations to close and which ones to leave. Obviously, the residents of the capital won't be too enthusiastic about the innovation, so it was decided to show the best side to the people. The Ministry of Transport wants to choose such *k* stations that minimize the average commute time in the subway! Assuming that the train speed is constant (it is a fixed value), the average commute time in the subway is calculated as the sum of pairwise distances between stations, divided by the number of pairs (that is ) and divided by the speed of the train. Help the Minister of Transport to solve this difficult problem. Write a program that, given the location of the stations selects such *k* stations that the average commute time in the subway is minimized. The first line of the input contains integer *n* (3<=≤<=*n*<=≤<=3·105) — the number of the stations before the innovation. The second line contains the coordinates of the stations *x*1,<=*x*2,<=...,<=*x**n* (<=-<=108<=≤<=*x**i*<=≤<=108). The third line contains integer *k* (2<=≤<=*k*<=≤<=*n*<=-<=1) — the number of stations after the innovation. The station coordinates are distinct and not necessarily sorted. Print a sequence of *k* distinct integers *t*1,<=*t*2,<=...,<=*t**k* (1<=≤<=*t**j*<=≤<=*n*) — the numbers of the stations that should be left after the innovation in arbitrary order. Assume that the stations are numbered 1 through *n* in the order they are given in the input. The number of stations you print must have the minimum possible average commute time among all possible ways to choose *k* stations. If there are multiple such ways, you are allowed to print any of them. Sample Input 3 1 100 101 2 Sample Output 2 3

[ "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = [int(x) for x in stdin.readline().split()]\r\na = sorted([(a[x],str(x+1)) for x in range(n)])\r\nk = int(stdin.readline())\r\n\r\nsums = [0]\r\nfor x in a:\r\n sums.append(sums[-1]+x[0])\r\n\r\ntotal = 0\r\ns = 0\r\n\r\nfor x in range(k):\r\n total += a[x][0]*x-s\r\n s += a[x][0]\r\n\r\nlow = total\r\nlowInd = 0\r\n\r\n#print(total)\r\n\r\nfor x in range(n-k):\r\n s -= a[x][0]\r\n total -= s-a[x][0]*(k-1)\r\n total += a[x+k][0]*(k-1)-s\r\n s += a[x+k][0]\r\n if total < low:\r\n low = total\r\n lowInd = x+1\r\n\r\nout = []\r\n\r\nfor x in range(lowInd,lowInd+k):\r\n out.append(a[x][1])\r\nprint(' '.join(out))\r\n" ]

{"inputs": ["3\n1 100 101\n2", "5\n11 21 30 40 50\n3", "3\n0 -4 -3\n2", "4\n5 -7 8 1\n2", "5\n-4 -2 10 -9 -10\n2", "6\n9 8 4 -4 -6 -8\n2", "7\n10 -6 0 -5 -2 -8 7\n2", "5\n-10 -5 3 4 -3\n3", "6\n8 -7 1 5 -8 4\n3", "7\n-5 1 3 2 -9 -1 -4\n3", "100\n237 -708 796 -645 75 387 992 343 -219 -696 777 -722 844 -409 6 989 39 -151 -182 -936 749 -971 -283 -929 668 317 545 -483 58 -715 197 -461 -631 -194 569 636 -24 842 -181 848 156 269 500 781 904 -512 621 -834 -892 -550 -805 -137 -220 164 198 -930 614 241 590 193 -636 144 415 -49 546 818 982 311 677 579 906 -795 912 -387 255 -742 606 122 672 869 -475 -628 644 -517 -73 -317 153 980 -571 57 -526 -278 451 -556 -266 365 358 -815 522 846\n2", "100\n713 -567 -923 200 -476 -730 -458 926 -683 -637 -818 -565 791 593 -108 970 -173 -633 320 23 220 595 454 -824 -608 252 -756 -933 -863 176 652 -520 -600 550 -540 -140 -611 -304 528 928 339 112 -539 477 -663 -114 363 -687 253 -124 887 48 111 -662 -146 -66 635 519 -350 469 815 321 316 -32 95 62 896 822 -830 481 -729 294 -6 206 -887 -708 -642 69 185 -292 906 667 -974 348 344 842 737 473 -131 288 -610 905 722 -979 -415 -460 -889 -486 -156 837\n4", "100\n-167 577 599 -770 -68 -805 604 -776 -136 373 433 -662 -583 52 606 -606 337 250 -412 901 -737 472 -686 -955 243 125 -248 -457 794 655 630 578 -530 891 467 -192 -304 975 -722 -290 -765 -887 966 314 -155 409 -909 -265 -843 -395 -993 -755 449 -844 821 940 597 902 -480 -566 990 427 -899 -587 538 -405 656 485 340 881 -217 684 -854 855 -329 -465 -150 863 441 -730 857 938 114 86 843 443 81 -474 -61 356 503 -188 761 -246 -445 -827 -316 -390 790 647\n8", "100\n857 603 431 535 -564 421 -637 -615 -484 888 467 -534 -72 13 579 699 362 911 675 925 902 677 -938 -776 618 741 614 -138 283 -134 -82 -854 854 -391 923 20 264 267 22 -857 -58 746 834 -253 -140 21 -260 -944 37 668 -818 47 880 -827 -835 -309 106 -336 580 832 405 257 -459 981 -166 -879 964 -662 -388 -211 394 -45 -973 -332 -685 -708 -605 -578 -46 576 562 278 -448 -946 -438 885 351 -207 987 442 184 481 -444 -807 793 105 74 -50 573 -217\n16", "100\n-608 705 341 641 -64 309 -990 319 -240 -350 -570 813 537 -296 -388 131 187 98 573 -572 484 -774 176 -906 -579 -991 434 -248 1000 803 -619 504 -566 898 58 337 -505 356 265 -201 -868 -752 236 804 -273 -335 -485 -190 18 -338 -419 831 -170 142 -946 -861 -847 -278 650 587 -519 492 880 -503 -992 133 590 840 104 354 227 262 440 -104 704 149 410 -843 -116 635 317 -139 40 -753 -515 555 417 -928 164 -538 611 20 -610 -193 151 397 593 -150 79 -507\n32", "100\n-683 303 245 -975 345 -159 529 -752 -349 -318 -275 -62 -449 -601 -687 691 491 -297 -576 425 -468 -235 446 536 143 152 -402 -491 363 -842 676 360 -461 -170 727 53 10 823 665 716 110 450 -154 -265 -926 636 -577 99 -719 -786 373 -286 994 -756 644 -800 220 -771 860 610 -613 -51 -398 -206 826 355 696 897 -957 -28 117 -750 -917 -253 718 -373 -222 -892 -316 603 -427 -936 -820 -566 158 43 -314 -972 618 -501 653 -688 684 -777 -885 -997 427 505 -995 142\n64", "3\n-100000000 0 100000000\n2"], "outputs": ["2 3 ", "1 2 3 ", "2 3 ", "1 3 ", "5 4 ", "2 1 ", "2 4 ", "1 2 5 ", "3 6 4 ", "2 4 3 ", "56 24 ", "37 91 25 33 ", "62 11 79 86 53 35 22 68 ", "42 95 60 43 33 1 53 86 10 21 18 35 20 67 64 89 ", "49 92 83 35 99 18 69 16 66 54 76 95 89 23 17 71 43 72 39 6 81 8 36 3 70 38 96 77 87 27 73 21 ", "96 99 4 88 69 82 45 73 78 95 30 83 56 50 94 58 54 8 72 49 92 15 1 61 14 47 19 84 90 28 21 33 13 81 27 63 76 9 10 79 87 18 52 11 44 74 22 77 64 34 6 43 12 62 70 37 86 36 48 41 71 100 25 26 ", "1 2 "]}

UNKNOWN

PYTHON3

CODEFORCES

1

d5a66051eeab79f22b63335aaf627de6

Pocket Book

One day little Vasya found mom's pocket book. The book had *n* names of her friends and unusually enough, each name was exactly *m* letters long. Let's number the names from 1 to *n* in the order in which they are written. As mom wasn't home, Vasya decided to play with names: he chose three integers *i*, *j*, *k* (1<=≤<=*i*<=<<=*j*<=≤<=*n*, 1<=≤<=*k*<=≤<=*m*), then he took names number *i* and *j* and swapped their prefixes of length *k*. For example, if we take names "CBDAD" and "AABRD" and swap their prefixes with the length of 3, the result will be names "AABAD" and "CBDRD". You wonder how many different names Vasya can write instead of name number 1, if Vasya is allowed to perform any number of the described actions. As Vasya performs each action, he chooses numbers *i*, *j*, *k* independently from the previous moves and his choice is based entirely on his will. The sought number can be very large, so you should only find it modulo 1000000007 (109<=+<=7). The first input line contains two integers *n* and *m* (1<=≤<=*n*,<=*m*<=≤<=100) — the number of names and the length of each name, correspondingly. Then *n* lines contain names, each name consists of exactly *m* uppercase Latin letters. Print the single number — the number of different names that could end up in position number 1 in the pocket book after the applying the procedures described above. Print the number modulo 1000000007 (109<=+<=7). Sample Input 2 3 AAB BAA 4 5 ABABA BCGDG AAAAA YABSA Sample Output 4 216

[ "if __name__ == \"__main__\":\r\n modulo=10**9+7\r\n n,m=map(int,input().split())\r\n names=[]\r\n\r\n for i in range(n):\r\n names.append(input().strip())\r\n \r\n res=1\r\n for j in range(m):\r\n unique_col_char_count=0\r\n tmp_arr=[]\r\n for i in range(n):\r\n if names[i][j] not in tmp_arr:\r\n unique_col_char_count+=1\r\n tmp_arr.append(names[i][j])\r\n res*=unique_col_char_count\r\n res=res%(modulo)\r\n print(res)", "n,m=map(int,input().split())\r\narr=[]\r\nmod=10**9+7\r\nfor i in range(n):\r\n s=input()\r\n arr.append(s)\r\nans=1\r\nfor j in range(m):\r\n dic={}\r\n temp=0\r\n for i in range(n):\r\n if arr[i][j] not in dic:\r\n temp+=1\r\n dic[arr[i][j]]=arr[i][j]\r\n ans=(ans*temp%mod)%mod\r\nprint(ans)\r\n", "def pocket_book(arr):\r\n l=1\r\n for i in range(len(arr[0])):\r\n st = set()\r\n for word in arr:\r\n st.add(word[i])\r\n l*=len(st)\r\n return l%(10**9+7)\r\n\r\na,b=map(int,input().strip().split())\r\nlst=[]\r\nfor i in range(a):\r\n lst.append(input())\r\nprint(pocket_book(lst))", "mod = 1000000007\n\n\n\nn, m = map(int, input().split())\n\nlista = []\narr = [0] * m\nfor c in range(n):\n name = input()\n lista.append(name)\n\n\nfor c in range(m): \n con = set()\n for v in range(n):\n con.add(lista[v][c])\n arr[c] += len(con)\n \n\nresp = 1\nfor c in range(m):\n resp = (resp * arr[c]) % mod\n\nprint(resp)\n\n\t \t \t\t \t \t\t\t\t\t \t \t\t \t \t", "n, m = map(int, input().split())\nnames = []\npossibilities = 1\n\nfor i in range(n):\n names.append(input())\n\nfor i in range(m):\n diff_letters = set([name[i] for name in names])\n\n if len(diff_letters) > 1:\n possibilities = (possibilities * len(diff_letters)) % (10**9 + 7)\n\nprint(possibilities)\n\n\t \t\t\t\t\t\t\t \t\t\t \t\t\t\t\t \t\t\t \t\t", "from sys import stdin\r\nn, m = map(int, stdin.readline().split())\r\nmod = 10**9 + 7\r\n\r\ns = [set() for _ in range(m)]\r\n\r\nfor i in range(n):\r\n name = stdin.readline()\r\n for j in range(m):\r\n s[j].add(name[j])\r\n\r\nbegin = 1\r\n\r\nfor i in range(m):\r\n begin *= len(s[i])\r\n begin %= mod\r\n\r\nprint(begin)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 28 21:42:08 2021\r\n\r\n@author: lcarv\r\n\"\"\"\r\nmod = 1000000007\r\nl = []\r\nseq = list(map(int,input().strip().split()))[:2]\r\n\r\nx = seq[0]\r\ny = seq[1]\r\n\r\nfor i in range(x):\r\n s = str(input())\r\n l.append(s)\r\nans =1\r\nq = set() \r\nfor j in range(y):\r\n q.clear()\r\n for k in range(x):\r\n q.add(l[k][j])\r\n \r\n ans = len(q)*ans%mod\r\n \r\nprint(ans)\r\n \r\n \r\n\r\n", "import math\r\nn,m=map(int,input().split(\" \"))\r\nres=1;\r\nar=[]\r\nfor i in range(0,n):\r\n ar.append(input())\r\ncount=0;\r\nfor i in range(0,m):\r\n count=0\r\n data={\"\"}\r\n for j in range(0,n):\r\n \r\n ch=ar[j][i]\r\n cont=ch in data\r\n if cont==False:\r\n data.add(ch)\r\n count=count+1\r\n \r\n \r\n res=(res*count)%1000000007\r\nprint(math.trunc(res)) \r\n ", "n,m=map(int,input().split())\r\nM=[input() for i in range(n) ]\r\nk=1\r\nfor i in range(m) :\r\n l=[]\r\n for j in range(n) :\r\n l.append(M[j][i])\r\n k=k*(len(set(l)))\r\nprint(k%1000000007)\r\n \r\n", "from sys import stdin\ninput = stdin.readline\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\nchars_by_ind = defaultdict(set)\nfor l in range(n):\n s = input()\n for ind, ch in enumerate(s): chars_by_ind[ind].add(ch)\n\nans = 1; mod = 10 ** 9 + 7\nfor ind in range(m):\n ans *= len(chars_by_ind[ind])\n if ans > mod: ans %= mod\n\nprint(ans)\n", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nx = 10**9 + 7\n\nn,m = list(map(int, input().split()))\n\nl = []\n\nfor i in range(n):\n l.append(input())\n\nr = []\n\nfor j in range(m):\n s = set()\n for k in range(n):\n s.add(l[k][j])\n r.append(len(s))\n\ncount = 1\nfor y in r:\n count = (count * y) % x\n\nprint(count)\n \t\t\t\t\t \t \t \t \t\t\t", "num, letras = map(int, input().split(\" \"))\nmod = 1000000007\nresultado = 1\n\npalavras = []\nfor i in range(num):\n palavras.append(str(input()))\n\nfor i in range(letras):\n letras_dif = set()\n for j in range(len(palavras)):\n letras_dif.add(palavras[j][i])\n resultado = (resultado * len(letras_dif)) % mod\n\nprint(resultado)\n\n\t \t \t\t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\nstore = []\r\nfor _ in range(n):\r\n store.append(input())\r\n\r\nans = 1\r\nfor s in zip(*store):\r\n ans *= len(set(s))\r\n\r\nprint(ans % 1_000_000_007)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nans=1;mod=10**9+7\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(arr[j][i])\r\n ans*=len(s)\r\n ans=ans%mod\r\nprint(ans)\r\n", "MOD = (10**9) + 7\nn, m = list(map(int, input().strip().split()))\narr = []\nfor i in range(n):\n\tarr.append(list(input().strip()))\n\narr = list(map(set, zip(*arr)))\nctr = 1\nfor i in range(len(arr)):\n\tctr *= len(arr[i])\n\tctr %= MOD\n\nprint(ctr)", "n, m = map(int, input().split())\n\nmod = 1_000_000_007 # 10**9 + 7\naux = [set() for _ in range(m)]\ntotal = 1\n\nfor _ in range(n):\n name = input()\n\n for i in range(m):\n aux[i].add(name[i])\n\nfor i in range(m):\n total = (total * len(aux[i])) % mod\n\nprint(total)\n\n \t\t\t\t\t \t \t\t\t \t\t\t\t\t \t\t", "n , m = input().split()\r\n\r\nn,m = int(n), int(m)\r\n\r\nlt = []\r\nfor _ in range(n):\r\n s = input()\r\n lt.append(s)\r\nans = []\r\n\r\nfor k in range(m):\r\n st = set()\r\n for i in range(n):\r\n st.add(lt[i][k])\r\n ans.append(len(st))\r\na = 1 \r\nfor x in ans:\r\n a = (a*x)%(10**9 + 7)\r\nprint(a)\r\n \r\n ", "def modm(a, b):\n m = 1000000007\n return ((a%m) * (b%m)) % m\n\na, b = map(int, input().split())\ncont = [0] * b\npalavras = []\nfor i in range(a):\n palavras.append(input())\nfor i in range(b):\n b = set()\n for j in range(a):\n b.add(palavras[j][i])\n cont[i] = len(b)\n \nresultado = 1\n\nfor a in cont:\n resultado = modm(resultado, a)\nprint(resultado)\n\n \t \t\t \t \t\t \t\t\t\t\t\t\t\t \t", "n,m=map(int,input().split())\r\nli=[input() for i in range(n)]\r\nres=1 \r\nMOD=10**9+7 \r\nfor i in range(m): \r\n cnt=0\r\n ans={}\r\n for j in range(n): \r\n if ans.get(li[j][i],-1)==-1:\r\n ans[li[j][i]]=1 \r\n res*=len(ans)\r\n res%=MOD \r\nprint(res%MOD)", "'''\r\nCreated on May 25, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn, m = map(int,input().split())\r\nans = 1\r\nt = [input()for i in range(n)]\r\n\r\nfor i in zip(*t):\r\n ans= ans * len(set(i))%1000000007\r\nprint(ans)", "n, m = [int(i) for i in input().split()] \r\na = [] \r\nans = 1\r\nfor _ in range(n): a.append(input()) \r\nfor j in range(m): \r\n s = set()\r\n for i in range(n): s.add(a[i][j]) \r\n ans*= len(s) \r\nprint(ans%(10**9+7))", "MOD = int(1e9+7)\nn, m = map(int, input().split())\narr = list(list(input()) for _ in range(n))\nres = 1\nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(arr[j][i])\n res = res * len(s) % MOD\nprint(res)\n\n\t\t \t\t\t\t \t\t\t\t \t \t\t\t\t \t \t\t \t\t", "n, m = map(int, input().split())\r\na = []\r\nmod = 10**9+7\r\nfor _ in range(n):\r\n a.append(input())\r\nans = 0\r\nd = [set() for _ in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n d[j].add(a[i][j])\r\nans = 1\r\nfor i in range(m):\r\n ans = (ans*len(d[i]))%mod\r\nprint(ans)\r\n", "n, m = map(int,input().split())\r\nls = []\r\nans = 1\r\nfor i in range(n) :\r\n s = input()\r\n ls.append(s)\r\nfor i in range(m) :\r\n st = set()\r\n for j in range(n) :\r\n st.add(ls[j][i])\r\n ans *= len(st)\r\n ans %= 1000000007\r\nprint(ans)", "mod = 10**9 + 7 \n\nn, m = map(int, input().split())\n\nwords=[]\nfor _ in range(n):\n\tword = input()\n\twords.append(word)\n\nanswer = 1\nfor i in range(m):\n\taux=[]\n\tfor j in range(n):\n\t\taux.append(words[j][i])\n\n\tanswer *= len(set(aux))\n\tanswer %= mod\n\nprint(answer)\n \t\t\t \t\t \t\t \t\t\t\t \t \t\t\t", "n, m = map(int ,input().split())\r\nnames = []\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n\r\ntotal = 1\r\nfor i in range(m):\r\n letters = [0]*26\r\n for j in range(n):\r\n letters[ord(names[j][i])-65] = 1\r\n \r\n total *= sum(letters)\r\n \r\nprint(total%1000000007)", "n, m = map(int, input().split())\nwords = []\n\nfor i in range(n):\n word = input()\n words.append(word)\n\naux = []\n\nfor i in range(m):\n aux.append(set())\n\nfor i in range(len(words)):\n for j in range(m):\n aux[j].add(words[i][j])\n\nans = 1\nmodulo = 1000000007\n\nfor i in range(m):\n ans = ans*len(aux[i]) % modulo\n\nprint(ans)\n \t \t\t\t\t\t \t\t \t\t\t\t \t\t \t\t \t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\ns = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n x = list(input().rstrip())\r\n for i in range(m):\r\n s[i].add(x[i])\r\nans = 1\r\nfor s0 in s:\r\n ans *= len(s0)\r\n ans %= mod\r\nprint(ans)", "n, m = map(int, input().split())\n\nmod = 1000000007\nnomes = []\n\nfor nome in range(n):\n\tnomes.append(input())\n\ntotal = 1\nfor letra in range(m):\n\t\n\tletras = set()\n\t\n\tfor nome in nomes:\n\t\tletras.add(nome[letra])\n\t\n\t\n\ttotal = (total * len(letras)) % mod\n\nprint(total)\n\n \t\t\t\t\t \t\t \t \t \t\t\t\t \t\t \t \t\t", "R=input\nn,m=map(int,R().split())\nr=1\nfor z in zip(*map(R,\" \"*n)):r*=len(set(z))\nprint(r%(10**9+7))\n\n", "n, m = map(int, input().split())\r\nst = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(m):\r\n st[i].add(s[i])\r\nans = 1\r\nmod = int(1e9 + 7)\r\nfor i in range(m):\r\n ans *= len(st[i])\r\n ans %= mod\r\nprint(ans)", "n, m = map(int, input().split())\ns = [input() for _ in range(n)]\np = 10 ** 9 + 7\n\ncnt = 1 \nfor i in range(m):\n cnt = (cnt * len({s[j][i] for j in range(n)})) % p\n \nprint(cnt)\n \t\t\t \t\t\t \t\t \t\t\t\t \t\t \t \t", "import string\r\nimport math\r\nimport collections \r\n\r\n\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n tab = []\r\n for x in range(n):\r\n tab.append(input())\r\n inc = 1\r\n dif = 0\r\n for x in range(m):\r\n s = set()\r\n dif = 0\r\n for y in range(n):\r\n if not tab[y][x] in s:\r\n dif += 1\r\n s.add(tab[y][x])\r\n inc *= dif\r\n inc %= 1000000007\r\n print(inc) \r\n \r\n \r\n \r\nmain()", "n, m = map(int ,input().split())\nnames = []\n\nfor _ in range(n):\n names.append(input())\n\ntotal = 1\nfor i in range(m):\n letters = [0]*26\n for j in range(n):\n letters[ord(names[j][i])-65] = 1\n \n total *= sum(letters)\n \nprint(total%1000000007)\n\t \t\t\t \t\t\t\t\t\t\t\t \t \t\t\t\t \t \t \t", "import sys\n\n# https://codeforcesladders.firebaseapp.com/?handle=lanadeus\n\n# makefile\n\"\"\"\nrun: code.py\n\tpython code.py < in.txt\nrun-lc: lc.py\n\tpython lc.py < in.txt\nrun-test: test.py\n\tpython test.py < in.txt\n\"\"\"\n\ndef readline():\n return sys.stdin.readline().strip()\n\n\ndef read(t=int):\n s = sys.stdin.readline()\n return list(map(t, s.strip().split(' ')))\n\n\ndef readint():\n return read()[0]\n\nmod = 10**9 + 7\ndef go():\n n, m = read()\n slist = []\n for i in range(n):\n slist+=[readline()]\n res = 1\n for i in range(m):\n s = len(set([slist[k][i] for k in range(n)]))\n res*=s\n res%=mod\n print(res%mod)\ngo()\n", "n,m=map(int,input().split())\r\nstri=[]\r\n\r\nfor i in range(n):\r\n stri.append(input())\r\nans =int(1)\r\nmod =int(1000000007);\r\nfor i in range(m):\r\n se=set()\r\n for j in range(n):\r\n se.add(stri[j][i])\r\n ans=(ans*len(se))%mod\r\nprint(ans)\r\n\r\n", "n,m = map(int,input().split())\r\nl = [input() for i in range(n)]\r\na=1\r\nmod = 7+10**9\r\nfor i in range(m):\r\n a*=len({l[j][i] for j in range(n)})\r\nprint(a%mod)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,m=lst();ans=1;M=10**9+7\r\n a=[input() for _ in range(n)]\r\n for i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans=(ans*len(s))%M\r\n print(ans)", "a, b = map(int, input().split())\r\nq = range(b)\r\nc = [set() for _ in [None] * b]\r\nz = 1\r\nfor _ in [None] * a:\r\n s = input()\r\n for i in q:\r\n c[i].add(s[i])\r\nfor i in c:\r\n z *= len(i)\r\nprint(z % 1000000007)\r\n", "n, m = map(int, input().split())\r\na, v = [input() for i in range(n)], 1\r\nfor j in range(m):\r\n v *= len({r[j] for r in a})\r\nprint(v % 1000000007)", "def main():\n n, m = map(int, input().split())\n l, res = [[False] * 26 for _ in range(m)], 1\n for _ in range(n):\n for i, c in enumerate(input()):\n l[i][ord(c) - 65] = True\n for cnt in map(sum, l):\n res = res * cnt % 1000000007\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "mod = 1000000007\n\nresp = 1\n\nentrada = input().split(' ')\n\nquant = int(entrada[0])\ntamanho = int(entrada[1])\naux =['']*tamanho\n\nfor i in range(quant):\n s = input()\n for j in range(tamanho):\n if(s[j] not in aux[j]):\n aux[j] += s[j]\n\nfor k in aux:\n resp = (resp * len(k)) % mod\n\nprint(resp)\n\t \t \t \t \t \t \t \t \t \t\t\t", "n,m = map(int,input().split(' '))\r\na = []\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ta.append(s)\r\nans = 1\r\nmod = 1000000007\r\nfor i in range(m):\r\n\th = {}\r\n\th = set(h)\r\n\tcnt = 0;\r\n\tfor j in range(n):\r\n\t\tif h.__contains__(a[j][i]) == False:\r\n\t\t\tcnt += 1\r\n\t\t\th.add(a[j][i])\r\n\tans = (ans*cnt)%mod\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\n\r\nmod = 1000000007\r\nnomes = []\r\nnumeros = []\r\nfor i in range(n):\r\n nomes.append(input())\r\n\r\ni = 0\r\nwhile i < m:\r\n lista = set()\r\n for k in nomes:\r\n lista.add(k[i])\r\n if(len(lista)>1):\r\n numeros.append(len(lista))\r\n i+=1\r\n\r\nres = 1\r\nfor j in numeros:\r\n res = (res * j) % mod\r\nprint(res)", "import sys\r\n#import math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nmod=1000000007\r\nn,m=invr()\r\nst=[set() for i in range(m)]\r\n\r\nfor i in range(n):\r\n\ts=insr()\r\n\tfor j in range(m):\r\n\t\tst[j].add(s[j])\r\n\r\ntot=1\r\nfor i in range(m):\r\n\ttot*=len(st[i])\r\n\tif tot>=mod:\r\n\t\ttot%=mod\r\n\r\nprint(tot)\r\n", "def clc(): \r\n mod = pow(10,9)+7\r\n n,m = map(int,input().split())\r\n mat = []\r\n ans = 1\r\n for _ in range(n):\r\n string =input()\r\n string = [i for i in string]\r\n mat.append(string)\r\n for i in range(m):\r\n st= set()\r\n for j in range(n):\r\n st.add(mat[j][i])\r\n ans = (ans*len(st))%mod\r\n print(ans)\r\n return True\r\ncc = clc()\r\nif not cc :\r\n print(\"NO\")\r\n ", "n, _ = map(int, input().split())\nnames = [input() for _ in range(n)]\n\ncnt = 1\nfor chs in zip(*names):\n\tch_space = set(chs)\n\tcnt = (cnt * len(ch_space)) % 1000000007\n\nprint(cnt)", "n,m=map(int,input().split())\r\nS=[]\r\nmod=10**9 + 7\r\nfor _ in range(n):\r\n s=input()\r\n S.append(s)\r\n\r\nans=1\r\nfor i in range(m):\r\n cnt=[0 for _ in range(26)]\r\n for j in range(n):\r\n v=ord(S[j][i])-65\r\n cnt[v]=1 \r\n ans*=sum(cnt)\r\n ans%=mod\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\ncounter = 1\narr = []\nfor i in range(a):\n arr.append(input())\nfor i in range(b):\n temp = set()\n for j in range(a):\n temp.add(arr[j][i])\n counter = counter * len(temp)\nprint(counter % 1000000007)\n", "n, m = map(int, input().split())\n\nnomes = []\nfor i in range(n):\n nomes.append(input())\n\nmod = 1000000007\nresp = 1\nconj = set()\nfor l in range(m):\n for p in range(n):\n conj.add(nomes[p][l])\n resp = resp * len(conj) % mod;\n conj.clear()\n \nprint(resp)\n\t \t\t\t \t \t\t \t\t \t \t\t", "n, m = map(int, input().split())\n\naux = [set() for _ in range(m)]\ncount = 1\n\nfor _ in range(n):\n string = input()\n\n for i in range(m): aux[i].add(string[i])\n\nfor j in range(m): count = (count * len(aux[j])) % (10**9+7)\n\nprint(count)\n \t\t \t \t \t \t\t\t \t\t\t\t\t \t \t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\nMOD = 10**9+7\r\nN,M = map(int, input().split())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n\r\nans = 1\r\nfor i in range(M):\r\n seen = set()\r\n for j in range(N):\r\n seen.add(S[j][i])\r\n ans*=len(seen)\r\n ans%=MOD\r\nprint(ans)\r\n", "# import sys\r\n# sys.stdin = open(\"F:\\\\Scripts\\\\input\",\"r\")\r\n# sys.stdout = open(\"F:\\\\Scripts\\\\output\",\"w\")\r\n\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\nn , m = I()\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\nd = [0]*m\r\nfor i in range(m):\r\n\ttemp = set()\r\n\tfor j in range(n):\r\n\t\ttemp.add(l[j][i])\r\n\td[i] = len(temp)\r\np = 1\r\nfor i in d:\r\n\tp = p*i%MOD\r\nprint(p)", "def solve():\r\n mod=int(1e9+7)\r\n line=input().split(' ')\r\n n=int(line[0])\r\n m=int(line[1])\r\n\r\n lista = [set() for _ in range(m)]\r\n for i in range(n):\r\n string=input();\r\n for j in range(m):\r\n if(string[j] in lista[j]):\r\n pass\r\n else:\r\n lista[j].add(string[j])\r\n result=1\r\n for i in range(m):\r\n result=result*len(lista[i])\r\n result=result%mod\r\n print(result)\r\n\r\nsolve()", "n,m=map(int,input().split())\r\na=[input() for x in range(n)]\r\nans=1\r\nfor ch_ch in zip(*a):\r\n lenalf=len(set(ch_ch))\r\n ans*=lenalf\r\nprint(ans%(10**9+7))\r\n", "n, m = map(int, input().split())\r\nmod = 10**9 + 7\r\na = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n\ts = input()\r\n\tfor i in range(m):\r\n\t\ta[i].add(s[i])\r\nans = 1\r\nfor i in a:\r\n\tans = ans * len(i) % mod\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nwords = []\r\n \r\nfor i in range(n):\r\n word = input()\r\n words.append(word)\r\n \r\naux = []\r\n \r\nfor i in range(m):\r\n aux.append(set())\r\n \r\nfor i in range(len(words)):\r\n for j in range(m):\r\n aux[j].add(words[i][j])\r\n \r\nans = 1\r\nmodulo = 1000000007\r\n \r\nfor i in range(m):\r\n ans = ans*len(aux[i]) % modulo\r\n \r\nprint(ans)", "import math\r\nn, m = map(int, input().split())\r\nl = []\r\nans = 1\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nfor i in range(m):\r\n st = set()\r\n for j in range(n):\r\n st.add(l[j][i])\r\n ans *= len(st)\r\n ans = (ans % 1000000007)\r\nprint(ans)\r\n", "n, k=map(int, input().split())\r\nm=[]\r\nfor _ in range(n):\r\n b=list(input())\r\n m.append(b)\r\nres=1\r\nmod=10**9+7\r\nfor i in range(k):\r\n aux=\"\"\r\n for j in range(n):\r\n aux+=m[j][i]\r\n res *= len(set(aux))\r\n res %= mod\r\nprint(res)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\ncount=1\r\nfor i in range(m):\r\n l1=set()\r\n for j in range(n):\r\n l1.add(l[j][i])\r\n count*=len(l1)\r\nprint(count%(10**9+7))\r\n ", "mod = 1e9 + 7;\n\nn, m = map(int,input().split())\n\nletras = [[] for i in range(m)]\n\ndef existe(valor, conjunto):\n if valor in conjunto:\n return True\n return False\n\nfor palavra in range(n):\n pa = input()\n for letra in range(m):\n if not existe(pa[letra], letras[letra]):\n letras[letra].append(pa[letra])\n\nv = []\nfor p in letras:\n v.append(len(p))\n\nres = 1\nfor q in v:\n res = ((res % mod) * (q % mod)) % mod\n\nprint(int(res))", "n,m = list(map(int,input().split()))\nd = {}\np = int(1e9+7)\nnumStrings = 1\nfor i in range(n):\n s = list(input())\n for j in range(len(s)):\n if j not in d:\n d[j] = set()\n d[j].add(s[j])\nfor i in range(m):\n numStrings = (numStrings * len(d[i])) % p\nprint(numStrings)\n \t \t \t\t \t\t \t \t\t\t \t\t\t\t", "import sys\r\nfrom math import *\r\nfrom collections import *\r\ninp = lambda: sys.stdin.buffer.readline().decode().strip()\r\nout=sys.stdout.write\r\n# n=int(inp())\r\n# arr=list(map(int,inp().split()))\r\nm,n=map(int,inp().split())\r\ncols=[set() for _ in range(n)]\r\nfor _ in range(m):\r\n s=inp()\r\n for i in range(n):\r\n cols[i].add(s[i])\r\nans=1\r\nmod=10**9+7\r\nfor x in cols:\r\n ans=(ans*len(x))%mod\r\nprint(ans)\r\n\r\n", "n,y=map(int,input().split())\r\nl=[]\r\nt = [input() for i in range(n)]\r\nans=1\r\n\r\n\r\nfor i in zip(*t):\r\n\t#print(i)\r\n\tans = (ans * len(set(i))) % (10**9+7)\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\n\r\nv = [\"\"] * n\r\nfor i in range(n):\r\n v[i] = input()\r\n\r\nans = 1\r\nMOD = 10 ** 9 + 7\r\nfor i in range(0, m):\r\n s = set()\r\n for j in range(0, n): \r\n s.add(v[j][i])\r\n ans *= len(s) % MOD\r\n ans %= MOD\r\nprint(ans)", "MOD = int(1e9 + 7)\ndef main():\n global mod\n (n, m) = map(int, input().split(' '))\n l = [set() for i in range(m)]\n for i in range(n):\n for j, c in enumerate(input()):\n l[j].add(c)\n ret = 1\n for i, s in enumerate(l):\n ret = (ret * len(s)) % MOD\n return ret \n\nprint(main())\n", "[n, m] = list(map(int, input().split()))\r\narr = []; c = 1; MOD = 10**9 + 7\r\nfor j in range(m): arr.append(set())\r\nfor i in range(n):\r\n name = input()\r\n for j in range(m): arr[j].add(name[j])\r\nfor i in range(m): c = (c%MOD)*(len(arr[i])%MOD)%MOD\r\nprint(c)", "n, m = map(int, input().split())\n\np = []\nresult = 1\nfor i in range(n):\n p.append(input())\n\nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(p[j][i])\n result *= len(s)\nprint(result % 1000000007)\n \t \t \t\t \t \t \t\t\t\t \t\t \t\t \t\t", "n, m = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\narr = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(m):\r\n arr[i].add(s[i])\r\nans = 1\r\nfor i in arr:\r\n ans = ans * len(i) % mod\r\nprint(ans)", "mod = 1e9+7\r\n \r\nn, m = map(int, input().split())\r\ns = [input().strip() for _ in range(n)]\r\n \r\nndp = 1\r\nfor j in range(m):\r\n c = 0\r\n l = [0] * 200\r\n for i in range(n):\r\n if l[ord(s[i][j])] != 1:\r\n l[ord(s[i][j])] += 1\r\n c += 1\r\n ndp = (ndp * c) % mod\r\n \r\nndp = ndp % mod\r\nprint(int(ndp))\r\n ", "n, m = map(int, input().split())\n\nnames = []\nfor _ in range(n):\n names.append(input())\n\nnames = list(zip(*names))\nresult = 1\n\n\nfor j in range(m):\n counter = 0\n unique_letters = []\n column = list(names[j])\n\n for i in range(n):\n letter = column[i]\n if letter not in unique_letters:\n unique_letters.append(letter)\n counter += 1\n\n result *= counter\n\nprint(result % (10 ** 9 + 7))\n\n \t\t \t \t \t \t \t\t\t \t\t \t", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n,m = get_ints_in_variables()\r\n mp = {}\r\n for _ in range(0, n):\r\n st = input()\r\n for j in range(0, m):\r\n if j not in mp:\r\n mp[j] = {}\r\n if st[j] not in mp[j]:\r\n mp[j][st[j]] = st[j]\r\n else:\r\n if st[j] not in mp[j]:\r\n mp[j][st[j]] = st[j]\r\n \r\n res = 1\r\n mod = 1000000007\r\n for i in range(0, m):\r\n res=(res%mod*len(mp[i])%mod)%mod\r\n\r\n print(res)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from functools import reduce\n\nMOD = 10 ** 9 + 7\na = []\nn, _ = map(int, input().split())\nfor i in range(int(n)):\n a.append(list(input()))\nat = zip(*a)\np = list(map(lambda x: len(set(x)), at))\nprint(reduce(lambda x, y: x * y % MOD, p, 1))\n", "mod=10**9+7\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n a=input()\r\n arr.append(a)\r\nans=[]\r\nfor i in range(m):\r\n arr1=[]\r\n for j in range(len(arr)):\r\n arr1.append(arr[j][i])\r\n ans.append(len(set(arr1)))\r\np=1\r\nfor i in range(len(ans)):\r\n p*=ans[i]\r\nprint(p%mod)\r\n", "n, m = map(int, input().split())\r\ns = list()\r\nfor i in range(n):\r\n s.append(input())\r\nans = 1\r\nfor j in range(m):\r\n d = set()\r\n for i in range(n):\r\n d.add(s[i][j])\r\n ans *= len(d)\r\nprint(ans % 1000000007)", "n, m = map(int, input().split())\nnomes = [input() for i in range(n)]\nresultado = 1\nmod = 1000000007\nfor i in range(m):\n resultado = (resultado * len(set([letra[i] for letra in nomes])) % mod)\nprint(resultado)\n", "N, M = map(int, input().split())\r\nA = []\r\nfor _ in range(N):\r\n A.append(input())\r\nans = 1\r\nfor i in range(M):\r\n tmp = set()\r\n for x in A:\r\n tmp.add(x[i])\r\n ans = ans * len(tmp) % int(1e9 + 7)\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 18 14:28:18 2019\r\n\r\n@author: sj\r\n\"\"\"\r\n\r\nn,k=input().split(\" \")\r\nn=int(n)\r\nk=int(k)\r\na=[]\r\nfor i in range(0,n):\r\n b=list(input())\r\n a.append(b)\r\nans=1\r\nmod=10**9+7\r\nfor i in range(0,k):\r\n s=\"\"\r\n for j in range(0,n):\r\n s+=a[j][i]\r\n ans*=len(set(s))\r\n ans%=mod\r\nprint(ans)", "n, m = map(int, input().split())\r\nnames, ans = [set() for _ in range(m)], 1\r\nfor _ in range(n):\r\n name = input().strip()\r\n for i in range(m):\r\n names[i].add(name[i])\r\nfor i in range(m): # basic permutations\r\n ans = ans * len(names[i])\r\n ans %= 1000000007\r\nprint(ans)\r\n", "def multiplicacaoModular(a, b, mod):\n return ((a % mod) * (b % mod)) % mod\n\n# ----------------> MAIN <--------------------\nqtdNames, tamanho = input().split()\nqtdNames = int(qtdNames)\ntamanho = int(tamanho)\n\nmod = 1000000007\ncolunas = {}\nfor i in range(tamanho):\n colunas[i + 1] = set()\n\nfor i in range(qtdNames):\n name = input()\n for j in range(1, tamanho + 1):\n colunas[j].add(name[j - 1])\n\ntotal = 1\nfor key in colunas:\n total = multiplicacaoModular(total, len(colunas[key]), mod)\n\nprint(total)\n\t\t\t\t \t\t \t\t\t \t \t\t\t\t \t", "n, m = map(int, input().split())\r\nans = 1\r\nt = [input() for i in range(n)]\r\nfor i in zip(*t):\r\n ans = (ans * len(set(i))) % (10**9+7)\r\nprint(ans)", "mod = 10**9 + 7\n\n[n, m] = list(map(int, input().split(' ')))\npermuts = []\n\nfor i in range(n):\n permuts.append(input())\n\nproduct = 1\n\nfor i in range(m):\n permutI = {}\n for j in range(n):\n c = permuts[j][i]\n if c not in permutI:\n permutI[c] = 0\n permutI[c] += 1\n product = (product * len(permutI)) % mod\n\nprint(product)\n\n\n \t \t \t\t \t \t \t \t \t\t \t\t", "n,m=map(int,input().split())\r\nnum=[]\r\nfor i in range(n):\r\n\tnum.append(input())\r\nans=1\r\nx=1000000007\r\nfor i in range(m):\r\n\tnum1=[]\r\n\tfor j in range(n):\r\n\t\t# print(num[j][i])\r\n\t\tif(num[j][i] not in num1):\r\n\t\t\tnum1.append(num[j][i])\r\n\tans*=len(num1)\r\n\t# print(num1)\r\n\tans=ans%x\r\nprint(ans)", "mod = 10 ** 9 + 7\r\n\r\ndef add(x, y):\r\n global mod\r\n return (x + y) % mod\r\n\r\ndef sub(x, y):\r\n global mod\r\n return ((x - y) % mod + mod) % mod\r\n\r\ndef mul(x, y):\r\n global mod\r\n return (x * y) % mod\r\n\r\ndef binpow(x, y):\r\n global mod\r\n if y == 0:\r\n return 1\r\n elif y % 2 == 0:\r\n z = binpow(x, y // 2)\r\n return mul(z, z)\r\n else:\r\n return mul(binpow(x, y - 1), x)\r\n\r\ndef divide(x, y):\r\n global mod\r\n return mul(x, binpow(y, mod - 2))\r\n\r\nn, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nans = 1\r\nfor i in range(m):\r\n t = set()\r\n for j in range(n):\r\n t.add(s[j][i])\r\n ans = mul(ans, len(t))\r\n\r\nprint(ans)", "n, _ = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n\r\ncnt = 1\r\nfor chs in zip(*names):\r\n\tch_space = set(chs)\r\n\tcnt = (cnt * len(ch_space)) % 1000000007\r\n\r\nprint(cnt)", "n, m = map(int, input().split())\nv = [input() for _ in range(n)]\n\nans = 1\nmod = 1000000007\n\nfor i in range(m):\n s = set()\n for j in range(len(v)):\n p = v[j]\n s.add(p[i])\n\n count = len(s)\n ans *= count\n ans %= mod\n s.clear()\n\nprint(ans % mod)\n \t\t \t\t \t\t\t \t \t \t \t\t\t\t\t\t\t \t", "n, m = map(int, input().split())\r\nmod = 1000000007\r\n\r\ncaracteres = []\r\nfor _ in range(m):\r\n caracteres.append(set())\r\n\r\nfor _ in range(n):\r\n nome = input()\r\n for i in range(m):\r\n caracteres[i].add(nome[i])\r\n\r\nresult = 1\r\n\r\nfor i in range(m):\r\n result *= len(caracteres[i])\r\n\r\nprint(result % mod)\r\n", "n,k=input().split(\" \")\nn=int(n)\nk=int(k)\na=[]\nfor i in range(0,n):\n b=list(input())\n a.append(b)\nans=1\nmod=10**9+7\nfor i in range(0,k):\n s=\"\"\n for j in range(0,n):\n s+=a[j][i]\n ans*=len(set(s))\n ans%=mod\nprint(ans)\n\t \t \t \t\t\t \t \t\t \t \t", "n,m = map(int,input().split())\r\nmod = (10**9) + 7 \r\nli = [set() for _ in range(m)]\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n li[j].add(s[j])\r\n \r\nli = [len(i) for i in li]\r\n\r\nans = li[0]\r\n\r\nfor i in range(1,m):\r\n ans = (ans*li[i])%mod\r\n \r\nprint(ans)", "mode=\"filee\"\r\n#copied.\r\nif mode==\"file\":f=open(\"test.txt\",\"r\")\r\nget = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\ngets = lambda :[str(x) for x in (f.readline()[:-1] if mode==\"file\" else input()).split()]\r\n\r\nn, m = get()\r\nlst = [gets() for _ in range(n)]\r\nfor i in range(n):\r\n lst[i] = lst[i][0]\r\nlst = [len(set(_)) for _ in zip(*lst)]\r\nans = 1\r\nmod = 10**9 + 7\r\nfor v in lst:\r\n ans = (ans * v) % mod\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\narr = [input() for _ in range(n)]\r\n\r\nans = 1\r\n\r\nfor col in range(m):\r\n s = set()\r\n for i in range(n):\r\n s.add(arr[i][col])\r\n ans *= len(s)\r\n\r\nprint(ans % (10 ** 9 + 7))\n# Sat Apr 30 2022 14:27:01 GMT+0000 (Coordinated Universal Time)\n", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ni=0\r\nans=1\r\nwhile(i<m):\r\n options=set()\r\n c=0\r\n j=0\r\n while(j<n):\r\n if(a[j][i] not in options):\r\n c+=1\r\n options.add(a[j][i])\r\n j+=1\r\n ans=(ans*c)%(1000000007)\r\n i+=1\r\nprint(ans)\r\n", "mod = 1000000007\nn,m = list(map(int, input().split()))\ncnt = []\nfor i in range(m):\n cnt.append(set())\nfor i in range(n):\n name = input()\n for j in range(m):\n cnt[j].add(name[j])\nresp = 1\nfor i in cnt:\n resp = resp * len(i) % mod\nprint(resp)\n \t \t\t \t\t\t\t\t\t \t \t \t \t\t", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 29/04/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, m = iia()\r\narr = []\r\nfor i in range(n):\r\n arr.append(is1())\r\nres = 1\r\nfor i in range(m):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(arr[j][i])\r\n res *= len(temp)\r\n res %= mod\r\nprint(res)\r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nan,md=1,10**9+7\r\nn,m=I()\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input().strip())\r\nfor i in range(m):\r\n\ts=set()\r\n\tfor j in range(n):\r\n\t\ts.add(l[j][i])\r\n\tan=(an*len(s))%md\r\nprint(an)", "import sys\r\n#input=sys.stdin.buffer.readline\r\nt=1 \r\nmod=10**9+7\r\nfor __ in range(t):\r\n a=[]\r\n #n=int(input())\r\n n,m=map(int,input().split())\r\n for i in range(n):\r\n a.append(input())\r\n ans=1\r\n for i in range(m): \r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans=(ans)*(len(s)%mod)\r\n ans%=mod\r\n print(ans) ", "n, m = map(int,input().split())\r\nstring = list()\r\nfor i in range(n):\r\n string.append(input())\r\ni, ans, mod = 1, 1, 10**9 + 7\r\nwhile i<=m:\r\n j, temp = 0, set()\r\n while j<n:\r\n temp.add(string[j][i-1])\r\n j += 1\r\n ans = (ans * len(temp))%mod\r\n i += 1\r\nprint(ans)", "arr=[int(x) for x in input().split()]\r\nn,m=arr[0],arr[1]\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nans=1 \r\nfor j in range(m):\r\n s=set()\r\n count=0\r\n for i in range(n):\r\n if(arr[i][j] not in s):\r\n s.add(arr[i][j])\r\n count+=1\r\n ans*=count\r\nprint(ans%1000000007) ", "MODULO = 1000000007\n\n\nclass IntModulo:\n def __init__(self, modulo, value=0):\n self.modulo = modulo\n self.value = value\n\n def __imul__(self, other):\n if not isinstance(other, IntModulo):\n other = IntModulo(self.modulo, value=other)\n\n if self.modulo != other.modulo:\n raise RuntimeError()\n\n self.value = self.value * other.value % self.modulo\n\n return self\n\n def __str__(self):\n return str(self.value)\n\n def __repr__(self):\n return repr(self.value)\n\n\ndef solve(names):\n n = len(names)\n m = len(names[0])\n answer = IntModulo(MODULO, value=1)\n\n for i in range(m):\n answer *= len({names[j][i] for j in range(n)})\n\n return answer\n\n\ndef main():\n while True:\n try:\n n, m = map(int, input().split())\n names = [input() for _ in range(n)]\n except EOFError:\n break\n else:\n print(solve(names))\n\n\nif __name__ == '__main__':\n main()\n", "a, b = map(int, input().split())\r\nc = []\r\nv = []\r\nk = 1\r\nfor i in range(a):\r\n s = input()\r\n c.append(s)\r\nfor i in range(b):\r\n v = []\r\n for j in range(a):\r\n v.append(c[j][i])\r\n v = list(set(v))\r\n k = k * len(v) % 1000000007\r\nprint(k)", "n, m = map(int, input().split())\nmodulo = (10 ** 9) + 7\nlista = []\nsaida = 1\n\nfor i in range(n):\n lista.append(input())\n\nfor j in range(m):\n contaletra = set()\n for k in lista:\n contaletra.add(k[j])\n\n saida = saida*len(contaletra)%modulo\n\nprint(saida)\n\t \t\t \t\t \t\t \t\t\t \t \t \t\t\t\t\t \t", "import sys\r\nimport math\r\nimport random\r\ninput = sys.stdin.readline\r\nM = 10 ** 9 + 7\r\nn, m = [int(xx) for xx in input().split()]\r\na = [[] for i in range(m)]\r\nfor i in range(n):\r\n s = input()[:-1]\r\n for j in range(m):\r\n a[j].append(s[j])\r\nans = 1\r\nfor i in range(m):\r\n ans = ans * len(set(a[i]))\r\n ans %= M\r\nprint(ans)\r\n", "n, m = input().split()\nn = int(n)\nm = int(m)\nl = [set() for i in range(m)]\nfor i in range(n):\n p = input()\n for i in range(m):\n l[i].add(p[i])\n \nR = 1\nfor e in l:\n R *= len(e)\n \nMOD = 1000000000 + 7\nprint(R%MOD)\n \t \t\n\t \t\t\t\t \t\t \t \t\t\t \t \t \t\t", "def multiplicacaoModular(a, b, mod):\r\n return ((a % mod) * (b % mod)) % mod\r\n\r\n# ----------------> MAIN <--------------------\r\nqtdNames, tamanho = input().split()\r\nqtdNames = int(qtdNames)\r\ntamanho = int(tamanho)\r\n\r\nmod = 1000000007\r\ncolunas = {}\r\nfor i in range(tamanho):\r\n colunas[i + 1] = set()\r\n\r\nfor i in range(qtdNames):\r\n name = input()\r\n for j in range(1, tamanho + 1):\r\n colunas[j].add(name[j - 1])\r\n\r\ntotal = 1\r\nfor key in colunas:\r\n total = multiplicacaoModular(total, len(colunas[key]), mod)\r\n\r\nprint(total)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n,m=[int(x) for x in input().split()]\r\n mod=10**9+7\r\n arr=[]\r\n ans=1\r\n \r\n for i in range(n):\r\n s=input()\r\n #print(s)\r\n arr.append(s)\r\n #print(len(arr[0]))\r\n #print(len(arr))\r\n for i in range(m):\r\n v=set()\r\n for j in range(n):\r\n #print(2)\r\n v.add(arr[j][i])\r\n #print(2)\r\n ans*=len(v)\r\n print(ans%mod)", "MOD = int(1e9+7)\r\nn, m = map(int, input().split())\r\ncnt = list(set() for i in range(m))\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n cnt[j].add(s[j])\r\nres = 1\r\nfor i in cnt:\r\n res = res * len(i) % MOD\r\nprint(res)\r\n", "n,m=list(map(int,input().split()))\r\narr=[input() for _ in range(n)]\r\nmod=10**9 +7 \r\nans=1\r\nfor i in range(m):\r\n\tli=[]\r\n\tfor j in range(n):\r\n\t li.append(arr[j][i])\r\n\tans=((ans%mod )*(len(set(li))%mod))%mod\r\nprint(ans)", "n, m = map(int, input().split())\n\na = []\nfor i in range(n):\n a.append(input())\n\nMOD = int(1e9 + 7)\nans = 1\n\nfor j in range(m):\n s = set()\n for i in range(n):\n s.add(a[i][j])\n ans = (ans * len(s)) % MOD\n\nprint(ans)\n", "R=input\r\nn,m=map(int,R().split())\r\nr=1\r\nfor z in zip(*map(R,\" \"*n)):r=r*len(set(z))%(10**9+7)\r\nprint(r)", "from collections import Counter\r\nimport itertools\r\nfrom functools import lru_cache\r\nimport sys\r\nimport math\r\n###############################################################################\r\n#Helper\r\ndef helper():\r\n pass\r\n###############################################################################\r\n#Solver\r\ndef solve():\r\n n, m = map(int, input().split(' '))\r\n words = []\r\n for _ in range(n): words.append(input())\r\n cnt = [0 for i in range(m)]\r\n seen = [set() for i in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n if words[i][j] not in seen[j]:\r\n cnt[j] += 1\r\n seen[j].add(words[i][j])\r\n ans = 1\r\n for e in cnt: ans *= e\r\n print(ans%((int(1e9)+7)))\r\n###################### #########################################################\r\n#Driver\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n###############################################################################", "n,m=map(int,input().split())\r\ns=1\r\nk=[]\r\nfor i in range(n):\r\n a=input()\r\n k.append(a)\r\nfor i in range(m):\r\n k1=set()\r\n for j in range(n):\r\n if k[j][i] not in k1:\r\n k1.add(k[j][i])\r\n s*=len(k1)\r\nif s<1000000007:\r\n print(s)\r\nelse:\r\n print(s%1000000007)\r\n", "n, m = map(int, input().split())\nalive = [[False for i in range(26)] for j in range(m)]\nfor _ in range(n):\n s = input()\n assert(len(s) == m)\n for i in range(m):\n alive[i][ord(s[i]) - ord('A')] = True\n\nmd = int(1e9) + 7\n\nans = 1\nfor i in range(m):\n t = 0\n for j in range(26):\n t += alive[i][j]\n ans = (ans * t) % md\n\nprint(ans)\n", "\nmod = 1000000007\n\nn,m = map(int, input().split())\n\nmatriz = []\nfor _ in range(n):\n name = list(input())\n matriz.append(name)\n\nm = len(matriz)\nn = len(matriz[0])\ntemp = set()\nans = 1\nfor col in range(n):\n for row in range(m):\n temp.add(matriz[row][col])\n ans*= len(temp)\n temp = set()\n \nprint(ans%mod)\n\n\n\t \t\t\t \t\t \t\t\t \t\t\t\t \t \t \t\t", "n, m = map(int, input().split())\r\nd = [set() for _ in range(m)]\r\nfor _ in range(n):\r\n for i, x in enumerate(input()):\r\n d[i].add(x)\r\nr = 1\r\nmod = int(1e9)+7\r\nfor i in range(m):\r\n r *= len(d[i])\r\n r %= mod\r\nprint(r)", "import math\n\ndef main():\n n, m = [int(x) for x in input().split()]\n MAXX = 1000000007\n words = []\n for x in range(n):\n words.append(input())\n ans = 1\n for x in range(m):\n found = set()\n for word in words:\n found.add(word[x])\n ans = (ans % MAXX) * (len(found) % MAXX) % MAXX\n print(ans)\n \nmain()\n \t \t\t \t\t\t \t\t \t \t\t\t\t", "'''\r\n2 3\r\nAAB\r\nBAA\r\n'''\r\n\r\nn,m = map(int, input().split())\r\na = [0]*n\r\ncnt = [set() for i in range(100)]\r\nfor i in range(n):\r\n\ta[i] = list(input())\r\n\tfor j in range(m):\r\n\t\tcnt[j].add(a[i][j])\r\n\r\nfor i in range(m):\r\n\tcnt[i] = len(cnt[i])\r\nfor i in range(1,m):\r\n\tcnt[i]*=cnt[i-1]\r\n\tcnt[i]%=1000000007\r\nprint (cnt[m-1])", "import sys,os,io\r\nfrom math import log, gcd\r\nfrom collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\n\r\n\r\n# Iterative Python3 program \r\n# to compute modular power \r\n\r\n# Iterative Function to calculate \r\n# (x^y)%p in O(log y) \r\ndef power(x, y, p) : \r\n\tres = 1\r\n\tx = x % p \r\n\tif (x == 0) : \r\n\t\treturn 0\r\n\twhile (y > 0) : \r\n\t\tif ((y & 1) == 1) : \r\n\t\t\tres = (res * x) % p \r\n\t\ty = y >> 1\t # y = y/2 \r\n\t\tx = (x * x) % p \t\t\r\n\treturn res \r\n\r\n\r\ndef si():\r\n return input()\r\n\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef prefix_sum(arr):\r\n r = [0] * (len(arr)+1)\r\n for i, el in enumerate(arr):\r\n r[i+1] = r[i] + el\r\n return r\r\n\r\ndef divideCeil(n,x):\r\n if (n%x==0):\r\n return n//x\r\n return n//x+1\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef li():\r\n return list(map(int,input().split()))\r\n\r\nmod = 1000000007\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n,k = li()\r\n l = []\r\n for i in range(n):\r\n l.append(si())\r\n l.sort()\r\n res = 1\r\n k1 = k\r\n for i in range(k):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(l[j][i])\r\n res = (res * len(temp))%mod\r\n print(res)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\na=list(map(int,input().split()))\r\nn=a[0]\r\nm=a[1]\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\npos=[]\r\nfor i in range(m):\r\n pos.append(1)\r\nd={}\r\nfor j in range(m):\r\n d[j]=[l[0][j]]\r\n for i in range(1,n):\r\n if l[i][j] not in d[j]:\r\n pos[j]+=1\r\n d[j].append(l[i][j])\r\n\r\n\r\n\r\n\r\nres=1\r\nfor j in pos:\r\n res*=j\r\nres=(res%(pow(10,9)+7))\r\nprint(res)\r\n", "import os\r\nimport sys\r\nimport math\r\nfrom collections import deque, defaultdict\r\nimport bisect\r\nimport heapq\r\n\r\n#sys.setrecursionlimit(100000)\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef multiple():\r\n a = map(int, input().split())\r\n return a\r\n\r\n\r\ndef array():\r\n a = input().split()\r\n return a\r\n\r\n\r\ndef intarray():\r\n a = list(map(int, input().split()))\r\n return a\r\n\r\n\r\ndef intinput():\r\n n = int(input())\r\n return n\r\n\r\n\r\ndef strinput():\r\n s = input().strip()\r\n return s\r\n\r\n\r\ndef isPrime(n):\r\n val = int(math.sqrt(n)) + 1\r\n for i in range(2, val):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solution():\r\n # MOD = 998244353\r\n MOD = 1000000007\r\n n,m = multiple()\r\n a = []\r\n for i in range(n):\r\n a.append(strinput())\r\n ans = 1\r\n for i in range(m):\r\n s = set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans *= len(s)\r\n ans = ans%MOD\r\n print(ans)\r\n return\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n # print(\"Case #%s:\" % str(_ + 1), end=' ')\r\n solution()\r\n", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\nd = defaultdict(set)\r\nfor i in range(n):\r\n a = input()\r\n for j in range(m):\r\n d[j].add(a[j])\r\nans = 1\r\nmod = 1000000007\r\nfor i in d:\r\n ans*= len(d[i])\r\n ans%=mod\r\nprint(ans)\r\n \r\n", "a,b=map(int,input().split())\r\nans=[]\r\ntotal=1\r\npri=pow(10,9)+7\r\nfrom collections import *\r\nfor i in range(a):\r\n x=input()\r\n ans.append(x)\r\nfor i in range(b):\r\n al=defaultdict(int)\r\n c1=0\r\n for j in range(len(ans)):\r\n if(al[ans[j][i]]==0):\r\n al[ans[j][i]]+=1\r\n c1+=1\r\n total=total*c1\r\n total%=pri\r\nprint(total)\r\n", "k = 1000000007\r\ndef mul(a,b):\r\n return ((a%k)*(b%k))%k\r\n\r\n\r\nn,m = [int(i) for i in input().split()]\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nqtd = 1\r\nfor i in range(m):\r\n tra = []\r\n\r\n for j in range(n):\r\n tra.append(l[j][i])\r\n \r\n \r\n qtd = mul(qtd,len(set(tra)))\r\n \r\nprint(qtd)\r\n", "n, m = map(int,input().split())\n\nm_uc = [input() for i in range(n)]\ncount = 1\nfor i in range(m) :\n l = list()\n for j in range(n) :\n l.append(m_uc[j][i])\n count *= (len(set(l)))\n\nprint(count % 1000000007)\n\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t\t\t\t\t \t \t", "n, tam = list(map(int, input().split()))\n\nposicoes = dict()\n\nfor i in range(tam):\n posicoes[i] = set()\n\n\nfor _ in range(n):\n nome = input()\n for i in range(len(nome)):\n posicoes[i].add(nome[i])\n\nretorno = 1\n\nfor pos in posicoes:\n retorno = retorno*len(posicoes[pos])\n\nprint(retorno%(10**9 + 7))\n\t\t \t\t \t\t\t\t \t\t\t\t \t\t\t \t \t \t", "MOD = int(1e9 + 7)\nn, m = (int(x) for x in input().split())\n\noptions = [set() for _ in range(m)]\n\nfor _ in range(n):\n name = input()\n for i in range(m):\n options[i].add(name[i])\n\nans = 1\nfor s in options:\n ans = (ans * len(s)) % MOD\nprint(ans)", "n, m = map(int,input().split())\nmod = 1000000007\nseq = []\npassados = \"\"\ncont = 0\nfatores = 1\nfor e in range(n):\n seq.append(list(map(str, input())))\n\nfor i in range(m):\n for j in range(n):\n if(seq[j][i] not in passados):\n cont += 1\n passados += seq[j][i]\n fatores *= cont%mod\n passados = \"\"\n cont = 0\nprint(fatores%mod)\n\t\t \t\t\t \t\t \t \t\t\t \t\t \t\t\t \t \t \t", "M = 1000000007\nn,m = map(int, input().split())\n \np = []\nres = 1\nfor i in range(n):\n p.append(input())\n \n \nfor i in range(m):\n s = set()\n for j in range(n):\n s.add(p[j][i])\n res *= len(s)\nprint(int(res % M))\n\t\t\t \t\t\t\t\t \t\t \t\t \t\t \t \t\t \t \t", "def mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef li():\r\n return list(mi())\r\n\r\n\r\nN, M = mi()\r\n\r\nnames = []\r\n\r\nfor i in range(N):\r\n names.append(str(input()))\r\n\r\ncount = 1\r\n\r\nfor i in range(M):\r\n\r\n curr = set()\r\n\r\n for j in range(N):\r\n curr.add(names[j][i])\r\n\r\n count *= len(curr)\r\n count %= 1000000007\r\n\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nans=[set() for i in range(m)]\r\nfor i in range(n):\r\n a=input()\r\n for j in range(m):\r\n ans[j].add(a[j])\r\nans1=1\r\n#print(ans)\r\nfor i in range(len(ans)):\r\n #print(len(ans[i]))\r\n ans1=(ans1*len(ans[i]))%(10**9+7)\r\nprint(ans1%(10**9+7))\r\n", "MOD = 1000000007\n\nnum_names, name_length = map(int, input().split())\nnames = [input().strip() for _ in range(num_names)]\n\ntotal_permutations = 1\nfor i in range(name_length):\n distinct_chars_count = 0\n char_occurrences = [0] * 200\n for j in range(num_names):\n current_char = names[j][i]\n if char_occurrences[ord(current_char)] == 0:\n distinct_chars_count += 1\n char_occurrences[ord(current_char)] = 1\n total_permutations = (total_permutations * distinct_chars_count) % MOD\n\ntotal_permutations = total_permutations % MOD\nprint(total_permutations)\n \t\t\t\t\t\t\t\t \t\t\t\t \t\t \t \t", "new_mod = 1000000007\n\nnum_rows, num_cols = map(int, input().split())\nstrings = [input().strip() for _ in range(num_rows)]\n\nnew_dp = 1\n\nfor col in range(num_cols):\n count = 0\n letter_list = [0] * 200\n\n for row in range(num_rows):\n if letter_list[ord(strings[row][col])] != 1:\n letter_list[ord(strings[row][col])] += 1\n count += 1\n\n new_dp = (new_dp * count) % new_mod\n\nnew_dp = new_dp % new_mod\nprint(int(new_dp))\n \t \t\t \t\t\t \t \t \t\t \t\t\t\t \t \t", "n, m = map(int, input().split(\" \"))\n\nmod = (10**9)+7\n\nmydict = {}\nfor i in range(n):\n ar = input()\n\n for e in range(m):\n if (e+1 not in mydict.keys()):\n mydict[e+1] = set(ar[e])\n else:\n mydict[e+1].add(ar[e])\nans = 1\nfor n in range(len(mydict)):\n ans *= len(mydict[n+1])\n\nprint(ans % mod)\n", "def le_nomes(n):\n aux1 = []\n for i in range(n):\n aux1.append(input())\n return aux1\n\nnum_de_nomes, tamanho_dos_nomes = map(int, input().split())\n\nnomes = le_nomes(num_de_nomes)\nnum_de_dif = 1\n\nfor i in range(tamanho_dos_nomes):\n\taux2 = []\n\tfor j in range(num_de_nomes):\n\t\taux2.append(nomes[j][i])\n\n\tnum_de_dif = num_de_dif * len(set(aux2))\n\tnum_de_dif = num_de_dif % 1000000007\n\nprint(num_de_dif)\n\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t \t\t\t", "mod=10**9+7\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nans=1\r\nfor j in range(m):\r\n s=set()\r\n for i in range(n):\r\n s.add(l[i][j])\r\n ans=(ans*len(s))%mod\r\nprint(ans%mod)", "n, _ = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\n \r\ncnt = 1\r\nfor chs in zip(*names):\r\n\tcnt *= len(set(chs))\r\n \r\nprint(cnt % 1000000007)", "n,m = map(int, input().strip().split(' '))\r\nm1=[]\r\nfor j in range(n):\r\n s=input()\r\n m1.append(s)\r\nm2=[]\r\nfor i in range(m):\r\n s1=\"\"\r\n for j in range(n):\r\n s1+=m1[j][i]\r\n m2.append(s1)\r\np=1\r\nfor j in range(m):\r\n p*=len(list(set(list(m2[j]))))\r\nprint(p%1000000007)\r\n \r\n \r\n \r\n ", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Pocket_Book():\r\n n, m = invr()\r\n different_letters_dict = {}\r\n for pos in range(m):\r\n different_letters_dict[pos] = set()\r\n \r\n for i in range(n):\r\n name = insr()\r\n for pos in range(m):\r\n different_letters_dict[pos].add(name[pos])\r\n \r\n num_different_names = 1\r\n for pos in range(m):\r\n num_different_names = num_different_names * len(different_letters_dict[pos])\r\n\r\n print(num_different_names % 1000000007)\r\n return \r\n\r\nPocket_Book()", "def pocket_book(n, m, book):\n diff_chars = []\n for position in range(m):\n diff_char = set()\n for name in range(n):\n diff_char.add(book[name][position])\n diff_chars.append(len(diff_char))\n\n ans = 1\n for i in diff_chars:\n ans = (i * ans) % 1000000007\n return ans\n\n\nn, m = map(int, input().strip().split())\nbook = []\nfor i in range(n):\n book.append(input().strip())\nprint(pocket_book(n, m, book))\n", "import collections\r\nn, m = map(int, input().split())\r\nnames = [input() for _ in range(n)]\r\nMOD = 1000000007\r\n\r\ncolumns = list(zip(*names))\r\nret = 1\r\n\r\nfor col in columns:\r\n counts = list(collections.Counter(col).values())\r\n assert sum(counts) == n\r\n ret *= len(counts)\r\n ret %= MOD\r\nprint(ret)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nd=defaultdict(set)\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n d[j].add(s[j])\r\nans=1\r\nfor i in d:\r\n ans*=len(d[i])\r\n ans%=(10**9+7)\r\nprint(ans)", "n, m = map(int, input().split())\nA = [set() for _ in range(m)]\nfor _ in range(n):\n for i, s in enumerate(input()):\n A[i].add(s)\nans = 1\nfor i in range(m):\n ans = ans * len(A[i]) % int(1e9 + 7)\nprint(ans)\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n s = {i:set() for i in range(m)}\r\n st = []\r\n for i in range(n):\r\n _s = input()\r\n st.append(_s)\r\n for i in range(m):\r\n for j in range(n):\r\n letter = st[j][i]\r\n s[i].add(letter)\r\n dp = {i:len(s[i]) for i in range(m)}\r\n ans = 1\r\n for i in list(dp.keys()):\r\n ans = (ans * dp[i]) % (10**9 + 7)\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "import sys\ninput= sys.stdin.buffer.readline\nn,m=map(int,input().split())\nlst=[]\nfor i in range(n):\n lst.append(str(input().decode()))\nans=[0]*(m)\nfor j in range(m):\n s=set()\n for i in range(n): \n s.add(lst[i][j])\n ans[j]=len(s)\np=1\nfor i in range(m): p=p*ans[i]\nprint(p%int(10**9+7))", "mod=10**9+7\r\nn,m=map(int,input().split())\r\nf=list(set() for i in range(m))\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n f[j].add(s[j])\r\nans=1\r\nfor i in range(m):\r\n ans*=len(f[i])\r\n ans%=mod\r\nprint(ans)", "n, m = map(int, input().split())\nres, mod = 1, 10**9 + 7\ncount = [set() for _ in range(m)]\nfor _ in range(n):\n for ind, ch in enumerate(input()):\n count[ind].add(ch)\nfor item in count:\n res = (res * len(item)) % mod\nprint(res)\n", "n, m = [int(x) for x in input().split()]\n\nsets = []\nfor i in range(m):\n sets.append(set())\n\nfor i in range(n):\n name = input()\n for j in range(m):\n sets[j].add(name[j])\n\nresult = 1 \nfor i in range(m):\n result*=len(sets[i])\n\nprint(result%1000000007)\n\t\t \t\t \t \t \t \t\t\t\t\t \t\t \t", "n, m = list( map( int, input().split() ) )\r\n\r\nL = []\r\nfor i in range( n ):\r\n x = input()\r\n L.append( x )\r\n\r\nMODN = 10**9+7\r\n\r\nans = 1\r\n\r\nfor j in range( m ):\r\n s = {}\r\n for i in range( n ):\r\n s[ L[i][j] ] = 1\r\n ans = ( ans * len(s) ) % MODN\r\n\r\nprint( ans )\r\n", "n, m = map(int, input().split())\nnames = []\nmod = 1000000007\n\nfor i in range(n):\n names.append(input())\n\nmult = 1\nfor i in range(m):\n difs = set()\n for name in names:\n difs.add(name[i])\n mult = (mult * len(difs)) % mod\n\nprint(mult)\n \t \t \t\t \t \t \t\t\t \t\t\t \t\t \t \t", "def permutacao(n, m, array):\r\n mod = 1000000007\r\n result = 1\r\n\r\n for j in range(m):\r\n carac = set()\r\n for i in range(n):\r\n carac.add(array[i][j])\r\n\r\n result *= len(carac)\r\n result %= mod\r\n\r\n return result\r\n\r\n\r\nn, m = map(int, input().split())\r\narray = []\r\nfor _ in range(n):\r\n array.append(input())\r\n\r\nprint(permutacao(n, m, array))", "n, m = map(int, input(). split())\r\nlis = []\r\nfor i in range(n):\r\n st = input()\r\n lis.append(st)\r\ntot = 1\r\nfor i in range(m):\r\n setn = set()\r\n for j in lis:\r\n setn.add(j[i])\r\n tot = tot * len(setn)\r\n tot %= int(1e9) + 7\r\nprint(tot)", "n,m=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n s=input()\r\n a.append(s)\r\nans=1\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n #print(s)\r\n ans*=len(s)\r\n ans=ans%(10**9+7)\r\nprint(ans)\r\n", "M=10**9+7\r\nn,m=[int(e) for e in input().split()]\r\na=[input() for i in range(n)]\r\nans=1\r\nfor i in range(m):\r\n s=set()\r\n for j in range(n):\r\n s.add(a[j][i])\r\n ans*=len(s)\r\n ans%=M\r\nprint(ans)\r\n", "M=10**9+7\r\nn,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nans=1\r\nfor j in range(m):\r\n val=set()\r\n for i in range(n):\r\n val.add(a[i][j])\r\n ans=(ans*len(val))%M\r\nprint(ans%M)\r\n \r\n ", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nans = 1\r\nfor j in range(m):\r\n st = set()\r\n for i in range(n):\r\n st.add(a[i][j])\r\n ans = (ans * len(st)) % 1000000007\r\nprint(ans)", "'''input\n4 5\nABABA\nBCGDG\nAAAAA\nYABSA\n'''\nfrom sys import stdin\nimport math\n\n\n# main starts\nn, m = list(map(int, stdin.readline().split()))\nstring = []\n\nfor _ in range(n):\n\tstring.append(list(stdin.readline().strip()))\n\ncharacter = [[0 for x in range(26)] for y in range(m)]\n\nfor i in range(m):\n\tfor j in range(n):\n\n\t\tcharacter[i][ord(string[j][i]) - 65] += 1\n\n\nmultiplier = 1\nmod = 10 ** 9 + 7\n\nfor i in range(m):\n\tcount = 0\n\tfor j in range(26):\n\t\tif character[i][j] != 0:\n\t\t\tcount += 1\n\tmultiplier *= count\n\tmultiplier %= mod\n\nprint(multiplier)", "MOD=1000000007\nn,m=map(int,input().split())\nl=[]\nfor _ in range(n):\n l.append(input())\nans=1\nfor i in range(m):\n s=set()\n for k in range(n):\n s.add(l[k][i])\n ans=(ans*len(s))%MOD\n \nprint(ans % MOD)\n", "mod = 10**9 + 7\n\nn, m = map(int, input().split())\nv = []\nfor _ in range(n):\n S = input()\n v.append(S)\n\nans = 1\nfor i in range(m):\n s = set()\n for j in range(n):\n p = v[j]\n s.add(p[i])\n \n cnt = len(s)\n ans = (ans * cnt) % mod\n s.clear()\n\nprint(ans)\n\n \t \t \t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\np = 1\r\nfor j in range(m):\r\n s = set()\r\n for i in range(n):\r\n s.add(a[i][j])\r\n p = (p * len(s)) % 1000000007\r\nprint(p)", "import sys\r\nimport math\r\nimport bisect\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(1500000)\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef printlist(var) : sys.stdout.write(' '.join(map(str, var))+'\\n')\r\n\r\nn,k=invr()\r\nx=[]\r\nd=[[] for i in range(k)]\r\ndd=[0 for i in range(k)]\r\nfor i in range(n):\r\n x.append(input())\r\nfor i in range(n):\r\n for j in range(k):\r\n if x[i][j] not in d[j]:\r\n d[j].append(x[i][j])\r\n dd[j]+=1\r\nans=1\r\nfor i in dd:\r\n ans*=i\r\nprint(ans%1000000007)\r\n\r\n\r\n\r\n\r\n", "R=input\r\nn,m=map(int,R().split())\r\nr=1\r\nfor z in zip(*map(R,\" \"*n)):r*=len(set(z))\r\nprint(r%(10**9+7))\r\n", "n,m= map(int,input().split())\r\nli = []\r\nfor i in range(n):\r\n a=str(input())\r\n li.append(a)\r\nfinal = []\r\nfor i in range(m):\r\n temp = set()\r\n for j in range(n):\r\n temp.add(li[j][i])\r\n final.append(len(temp))\r\nval = 1\r\nmod = 10**9 +7\r\nfor i in final:\r\n val*=i\r\nprint(val%mod)\r\n \r\n", "n,m = [int(x) for x in input().split()]\r\narr = []\r\nfor i in range(n):\r\n arr.append(str(input()))\r\nans = 1\r\nfor i in range(m):\r\n hm = []\r\n now = 0\r\n for j in range(n):\r\n if not arr[j][i] in hm:\r\n hm.append(arr[j][i])\r\n now+=1\r\n ans = (ans*now)%1000000007\r\nprint(ans)", "# find the unique set of string for all prefix length\n\nn, m = list(map(int, input().split()))\nnames = []\nfor _ in range(n):\n names.append(input())\nmod = int(1e9+7)\nans = 1\nfor l in range(m):\n uniques = set()\n for name in names:\n uniques.add(name[l])\n ans = (ans%mod * len(uniques)%mod)%mod\n\nprint(ans)", "n, m = list(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append(input())\nans = 1\nfor j in range(m):\n d = {}\n c = 0\n for i in range(n):\n d[l[i][j]] = d.get(l[i][j], 0) + 1\n if d[l[i][j]] == 1:\n c = c + 1\n ans = ans * c\nprint(ans % (10**9 + 7))\n \t \t \t \t \t\t\t \t \t \t \t\t\t\t", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\np = 10 ** 9 + 7\r\n\r\ncnt = 1\r\n\r\nfor i in range(m):\r\n cnt = (cnt * len({s[j][i] for j in range(n)})) % p\r\n\r\nprint(cnt)\r\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nc = 10 ** 9 + 7\r\n\r\ncnt = 1\r\n\r\nfor i in range(m):\r\n cnt = (cnt * len({a[j][i] for j in range(n)})) % c\r\n \r\nprint(cnt)\r\n \r\n \r\n \r\n\r\n", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution(names, n, m):\r\n # Write Your Code Here\r\n mod = pow(10, 9)+7\r\n ans = 1\r\n for i in range(m):\r\n tmp = 0\r\n hm = {}\r\n for name in names:\r\n if name[i] in hm:\r\n continue\r\n tmp += 1\r\n hm[name[i]] = True\r\n ans = (ans % mod*tmp % mod) % mod\r\n print(ans)\r\n\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n n, m = get_ints_in_variables()\r\n names = []\r\n for _ in range(n):\r\n names.append(get_string())\r\n Solution(names, n, m)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m=[int(k) for k in input().split()]\r\nw=[]\r\nz=[set() for j in range(m)]\r\nfor j in range(n):\r\n w.append(input())\r\n for i in range(m):\r\n z[i].add(w[-1][i])\r\nres=1\r\nfor j in range(m):\r\n res*=len(z[j])\r\nprint(res%(10**9+7))", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\ndef solve(names):\r\n m = len(names[0])\r\n\r\n postfix = {}\r\n for name in names:\r\n postfix[name[-1:]] = True\r\n\r\n if m == 1:\r\n return len(postfix)\r\n newList = list((map(lambda x: x[:-1], names)))\r\n \r\n return len(postfix) * solve(newList)\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n inputLines = []\r\n for i in range(firstLine[0]):\r\n line = input()\r\n inputLines.append(line)\r\n \r\n #solve(firstLine)\r\n print (solve(inputLines) % 1000000007)\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=tuple(map(int,input().split()))\r\ninp=[]\r\nfor i in range(n):\r\n inp.append(input())\r\ncount=1\r\nfor i in range(m):\r\n setter=set()\r\n for j in range(n):\r\n if(inp[j][i] not in setter):\r\n setter.add(inp[j][i])\r\n count*=len(setter)\r\nprint(count%1000000007)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nMOD = 10**9 + 7\r\nn, m = list(map(int, input().split()))\r\nstrs = []\r\nfor _ in range(n):\r\n strs.append(input())\r\n# s = input()\r\nans = 1\r\nfor i in range(m):\r\n ans *= len({s[i] for s in strs})\r\n ans %= MOD\r\n\r\nprint(ans)", "n, m = [int(n) for n in input().split()]\n\npalavras = []\nfor c in range(n):\n palavras.append(input())\n\nans = 1\nfor i in range(m):\n letras = set()\n for j in range(n):\n letras.add(palavras[j][i])\n \n ans *= len(letras)\n ans %= (10 ** 9) + 7\n\nprint(ans)\n\n\t \t\t \t \t \t \t \t \t\t\t\t", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\n \r\ncnt = 1\r\nmod = 10 ** 9 + 7\r\nfor i in range(m):\r\n cnt = cnt * len({a[j][i] for j in range(n)}) % mod\r\n\r\nprint(cnt)", "n,m = map(int,input().split())\r\nkol=[]\r\nfor i in range(m):\r\n a=[0]*26\r\n kol.append(a)\r\nfor i in range(n):\r\n s= input()\r\n for j in range(m):\r\n kol[j][int(ord(s[j])-ord(\"A\"))]=1\r\nans=[]\r\np=1\r\nfor i in range(m):\r\n ans.append(sum(kol[i]))\r\n p=p*ans[i]%(1000000007)\r\n\r\nprint(p)\r\n \r\n \r\n \r\n \r\n\n# Sun Jan 09 2022 07:53:07 GMT+0000 (Coordinated Universal Time)\n", "mod = 1e9+7\r\n\r\nn, m = map(int, input().split())\r\ns = [input().strip() for _ in range(n)]\r\n\r\nans = 1\r\nfor j in range(m):\r\n c = 0\r\n arr = [0] * 200\r\n for i in range(n):\r\n if arr[ord(s[i][j])] != 1:\r\n arr[ord(s[i][j])] += 1\r\n c += 1\r\n ans = (ans * c) % mod\r\n\r\nans = ans % mod\r\nprint(int(ans))\r\n\r\n\r\n\r\n", "# Thank God that I'm not you.\r\n\r\nimport bisect\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc \r\n\r\ndef primeFactors(n):\r\n \r\n counter = Counter(); \r\n while n % 2 == 0:\r\n counter[2] += 1;\r\n n = n / 2\r\n \r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n while n % i== 0:\r\n counter[i] += 1;\r\n n = n / i\r\n \r\n if (n > 2):\r\n counter[n] += 1;\r\n \r\n return counter;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\n\r\n\r\nhashMap = {i: set() for i in range(m)};\r\nfor _ in range(n):\r\n string = input().rstrip()\r\n \r\n for i, char in enumerate(string):\r\n hashMap[i].add(char)\r\n\r\n\r\n\r\nans = 1;\r\n\r\nmod = (10**9 + 7)\r\n\r\n\r\nfor idx in hashMap:\r\n ans *= len(hashMap[idx]);\r\n ans %= mod;\r\n\r\nprint(ans)", "n,m = map(int, input().split())\r\nnames = []\r\nmod = 10**9 +7\r\n\r\nfor _ in range(n):\r\n names.append(input())\r\n \r\nans = 1\r\nfor i in range(m):\r\n found = set()\r\n for j in range(len(names)):\r\n found.add(names[j][i])\r\n ans *= len(found)\r\n\r\n ans += mod\r\n ans %= mod\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\nnames = [None]*n\r\nf = []\r\nfor i in range(n):\r\n\tnames[i] = input()\r\nfor i in range(m):\r\n\td = {}\r\n\tfor elem in names:\r\n\t\tif elem[i] not in d:\r\n\t\t\td[elem[i]] = 1\r\n\tf.append(len(d))\r\nans = 1\r\nfor elem in f:\r\n\tans*=elem\r\nprint(ans%1000000007)", "n,m=map(int,input().split())\r\nr=1\r\nfor z in zip(*map(input,\" \"*n)):\r\n r*=len(set(z))\r\nprint(r%(10**9+7))", "n,m=map(int,input().split())\r\ns=[]\r\nans=1\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(m):\r\n cnt=[0]*26\r\n for j in range(n):\r\n cnt[ord(s[j][i])-ord('A')]=1\r\n ans*=sum(cnt)\r\n ans%=1000000007\r\nprint(ans)", "from functools import reduce\n\nMOD = 10 ** 9 + 7\na = []\nn, _ = map(int, input().split())\nfor i in range(int(n)):\n a.append(list(input()))\nprint(reduce(lambda x, y: x * y % MOD, list(map(lambda x: len(set(x)), zip(*a))), 1))\n", "import sys\r\ninput = sys.stdin.readline # fast cin\r\n\r\nlst = input().split()\r\nn, m = int(lst[0]), int(lst[1])\r\nmod = int(10**9) + 7\r\nstrings = []\r\nfor i in range(n):\r\n strings.append(input())\r\nanswer = 1\r\nfor i in range(m):\r\n st = set()\r\n for j in range(n):\r\n st.add(strings[j][i])\r\n answer = (answer * len(st)) % mod\r\nprint(answer)", "a,b = map(int,input().split(\" \"))\r\nt = []\r\nfor x in range(b):\r\n\tt.append([])\r\nfor x in range(a):\r\n\t k = list(input())\r\n\t for n in range(b):\r\n\t \tl = t[n]\r\n\t \tl.append(k[n])\r\n#print(t)\r\ndef setter(k):\r\n\treturn len(set(k))\r\nt = map(setter,t)\r\n#print(t)\r\nres = 1\r\ncal = (10**9)+7\r\nfor n in t:\r\n\tres*=n\t\r\n\tres%=cal\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t", "mod = 1000000007\n\nx = list(map(int,input().strip().split()))[:2]\n\nn = x[0]\nm = x[1]\n\nvetorStrings = []\n\nfor i in range(n):\n vetorStrings.append(input())\n\nresp = 1\n\nfor i in range(m):\n caracteresUnicos = set()\n\n for j in range(n):\n caracteresUnicos.add(vetorStrings[j][i]) #pega cada caracter\n \n size = len(caracteresUnicos) #pega numero de caracteres unicos\n\n resp = (resp * size) % mod #produto de caracteres unicos em cada posicao\n\n caracteresUnicos.clear()\n\nprint(resp%mod)\n \t\t \t \t\t\t\t\t \t\t\t \t\t\t \t\t\t" ]

{"inputs": ["2 3\nAAB\nBAA", "4 5\nABABA\nBCGDG\nAAAAA\nYABSA", "1 1\nE", "2 2\nNS\nPD", "3 4\nPJKD\nNFJX\nFGFK", "4 5\nSXFMY\nATHLM\nKDDQW\nZWGDS", "20 14\nJNFKBBBJYZHWQE\nLBOKZCPFNKDBJY\nXKNWGHQHIOXUPF\nDDNRUKVUGHWMXW\nMTIZFNAAFEAPHX\nIXBQOOHEULZYHU\nMRCSREUEOOMUUN\nHJTSQWKUFYZDQU\nGMCMUZCOPRVEIQ\nXBKKGGJECOBLTH\nXXHTLXCNJZJUAF\nVLJRKXXXWMTPKZ\nPTYMNPTBBCWKAD\nQYJGOBUBHMEDYE\nGTKUUVVNKAHTUI\nZNKXYZPCYLBZFP\nQCBLJTRMBDWNNE\nTDOKJOBKEOVNLZ\nFKZUITYAFJOQIM\nUWQNSGLXEEIRWF", "5 14\nAQRXUQQNSKZPGC\nDTTKSPFGGVCLPT\nVLZQWWESCHDTAZ\nCOKOWDWDRUOMHP\nXDTRBIZTTCIDGS", "9 23\nOILBYKHRGMPENVFNHLSIUOW\nLPJFHTUQUINAALRDGLSQUXR\nLYYJJEBNZATAFQWTDZSPUNZ\nHSJPIQKKWWERJZIEMLCZUKI\nOJYIEYDGPFWRHCMISJCCUEM\nLMGKZVFYIVDRTIHBWPCNUTG\nUBGGNCITVHAIPKXCLTSAULQ\nOWSAWUOXQDBSXXBHTLSXUVD\nUGQTIZQPBGMASRQPVPSFUWK", "25 4\nLVKG\nMICU\nZHKW\nLFGG\nOWQO\nLCQG\nLVXU\nOUKB\nLNQX\nZJTO\nOOQX\nLVQP\nMFQB\nMRQV\nOIQH\nOPXX\nXFKU\nFCQB\nZPKH\nLVCH\nNFCU\nOVQW\nOZKU\nLFHX\nLPXO", "30 10\nUTNTGOKZYJ\nQHOUHNYZVW\nLTVGHJRZVW\nMZHYHOLZYJ\nERYEUEPZYE\nUZDBFTURYJ\nRVSMQTIZGW\nWDJQHMIRYY\nKCORHQPZYE\nRRPLFOZZVY\nJTXMFNNNYJ\nMVTGGOZZVV\nEHAFFNUZVF\nLBRNWJZNYE\nJVMOHTPZYJ\nWTARFJLZVV\nLVJCWOURVW\nLCLQFJYRVV\nQVBVGNJRYF\nNTZGHOLRYE\nMGQKHOUPYJ\nRRSSBXPZYJ\nRYCRGTLZYJ\nJRDEGNKRVW\nRZKFGHYRVG\nMDJBFNIZYG\nMPLWHXIZYE\nSRZMHMURVE\nMTEBBMRZYJ\nJPJIFOLZYM", "40 7\nPNTVVER\nPAHTQDR\nRXMJVAS\nVIQNLYC\nILPUSVX\nYJOXQDJ\nSEFODTO\nOTJMREL\nLIQRZGD\nLBJJPOR\nRUTYHQO\nRIWEPBD\nKQUMFIB\nISTRRYH\nXBTOTGK\nRFQODEY\nHDSTZTP\nYCXFAGL\nAREGRFU\nLELZUYU\nGVABDKH\nFJAMMME\nACVULXE\nJHVPJAS\nAAQNMBX\nJJGUCXG\nOQATILQ\nNEOSHJM\nHFLWOFM\nICYEQHY\nFACGLYP\nPLLXJEQ\nDCHXYPB\nAGDDZJJ\nLSQRXTN\nHDQZXIY\nNAHDDWW\nQCMXRQN\nFDUDSZO\nHKBEVTW", "2 2\nAA\nBB", "1 10\nAAAAAAAAAA", "2 8\nAAAAAAAA\nBBBBBBBB", "10 10\nAAAAAAAAAA\nBBBBBBBBBB\nCCCCCCCCCC\nDDDDDDDDDD\nAAAAAAAAAA\nBBBBBBBBBB\nCCCCCCCCCC\nDDDDDDDDDD\nAAAAAAAAAA\nBBBBBBBBBB", "1 20\nAAAAAAAAAAAAAAAAAAAA", "20 1\nA\nB\nC\nD\nE\nF\nG\nA\nB\nC\nD\nE\nF\nG\nA\nB\nC\nD\nE\nF", "5 60\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\nBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\nCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC\nDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD\nEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE", "50 4\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ\nAAAA\nBBBB\nCCCC\nDDDD\nEEEE\nFFFF\nGGGG\nHHHH\nIIII\nJJJJ", "1 100\nAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA", "100 1\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", "100 1\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB\nA\nB", "100 1\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nA\nB", "100 1\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV\nW\nX\nY\nZ\nA\nB\nC\nD\nE\nF\nG\nH\nI\nJ\nK\nL\nM\nN\nO\nP\nQ\nR\nS\nT\nU\nV"], "outputs": ["4", "216", "1", "4", "81", "1024", "515139391", "124999979", "454717784", "5733", "919913906", "206575993", "4", "1", "256", "1048576", "1", "7", "449874206", "10000", "1", "1", "2", "14", "26"]}

UNKNOWN

PYTHON3

CODEFORCES

184

d5a92f290c7eb0059d54b3a0e3c0ae3e

Ilya and Matrix

Ilya is a very good-natured lion. He likes maths. Of all mathematical objects, his favourite one is matrices. Now he's faced a complicated matrix problem he needs to solve. He's got a square 2*n*<=×<=2*n*-sized matrix and 4*n* integers. You need to arrange all these numbers in the matrix (put each number in a single individual cell) so that the beauty of the resulting matrix with numbers is maximum. The beauty of a 2*n*<=×<=2*n*-sized matrix is an integer, obtained by the following algorithm: 1. Find the maximum element in the matrix. Let's denote it as *m*. 1. If *n*<==<=0, then the beauty of the matrix equals *m*. Otherwise, a matrix can be split into 4 non-intersecting 2*n*<=-<=1<=×<=2*n*<=-<=1-sized submatrices, then the beauty of the matrix equals the sum of number *m* and other four beauties of the described submatrices. As you can see, the algorithm is recursive. Help Ilya, solve the problem and print the resulting maximum beauty of the matrix. The first line contains integer 4*n* (1<=≤<=4*n*<=≤<=2·106). The next line contains 4*n* integers *a**i* (1<=≤<=*a**i*<=≤<=109) — the numbers you need to arrange in the 2*n*<=×<=2*n*-sized matrix. On a single line print the maximum value of the beauty of the described matrix. Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. Sample Input 1 13 4 1 2 3 4 Sample Output 13 14

[ "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort(reverse=True)\r\nif n == 1:\r\n print(A[0])\r\nelse:\r\n res = 0\r\n i = 1\r\n while(i <= n):\r\n res += sum(A[0: i])\r\n i *= 4\r\n print(res)" ]

{"inputs": ["1\n13", "4\n1 2 3 4", "16\n978618343 473608041 799158564 800910753 461479363 520477481 780529176 678879534 118274424 720632652 639921017 582019792 143353286 537373229 944668919 758615621", "16\n521848329 105907607 414661942 473600423 264555612 186332345 774233687 736918178 456150336 216550357 568433949 135218174 18789799 324141005 617635501 149674864", "16\n612095723 222321386 616933999 386488979 943748076 902598472 681820298 449949990 359507903 613063462 437031953 902348579 697631196 99280352 60225467 969809069", "16\n666766712 653140033 670637874 170909587 210382562 358152171 128926299 750686139 315428350 607830667 363710774 325047228 570196776 38425426 438601514 634274054", "1\n6", "1\n8", "1\n9", "4\n7 9 6 9", "4\n423654797 623563697 645894116 384381709", "4\n437587210 297534606 891773002 56712976", "4\n963662765 272656295 383441522 477665112", "4\n791725034 812168727 528894922 479977172"], "outputs": ["13", "14", "14440495117", "9436107110", "13643168169", "10395033063", "6", "8", "9", "40", "2723388435", "2575380796", "3061088459", "3424934582"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d5d2dd5f9cafc5c383631833e295d5a4

Pasha and Tea

Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of *w* milliliters and 2*n* tea cups, each cup is for one of Pasha's friends. The *i*-th cup can hold at most *a**i* milliliters of water. It turned out that among Pasha's friends there are exactly *n* boys and exactly *n* girls and all of them are going to come to the tea party. To please everyone, Pasha decided to pour the water for the tea as follows: - Pasha can boil the teapot exactly once by pouring there at most *w* milliliters of water; - Pasha pours the same amount of water to each girl; - Pasha pours the same amount of water to each boy; - if each girl gets *x* milliliters of water, then each boy gets 2*x* milliliters of water. In the other words, each boy should get two times more water than each girl does. Pasha is very kind and polite, so he wants to maximize the total amount of the water that he pours to his friends. Your task is to help him and determine the optimum distribution of cups between Pasha's friends. The first line of the input contains two integers, *n* and *w* (1<=≤<=*n*<=≤<=105, 1<=≤<=*w*<=≤<=109) — the number of Pasha's friends that are boys (equal to the number of Pasha's friends that are girls) and the capacity of Pasha's teapot in milliliters. The second line of the input contains the sequence of integers *a**i* (1<=≤<=*a**i*<=≤<=109, 1<=≤<=*i*<=≤<=2*n*) — the capacities of Pasha's tea cups in milliliters. Print a single real number — the maximum total amount of water in milliliters that Pasha can pour to his friends without violating the given conditions. Your answer will be considered correct if its absolute or relative error doesn't exceed 10<=-<=6. Sample Input 2 4 1 1 1 1 3 18 4 4 4 2 2 2 1 5 2 3 Sample Output 3184.5

[ "n, w = map(int, input().split())\r\ncup = list(map(int, input().split()))\r\ncup.sort()\r\n\r\nif (cup[n] >= 2*cup[0]):\r\n ans = min(w, 3*cup[0]*n)\r\n print(ans)\r\nelse:\r\n ans = min(w, 3*(cup[n]/2)*n)\r\n print(ans)\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nprint(min(w, min(a[0], a[n]*0.5)*3*n))\r\n", "n, w = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\narray.sort()\r\ntea = min(array[0], array[n]/2)\r\nans = min(w, 3*n*tea)\r\n\r\nif ans - int(ans) == 0:\r\n print(int(ans))\r\nelse:\r\n print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,W = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nk = W/(N+N/2)\r\nk = min(k, A[N])\r\nk = min(k, A[0]*2)\r\nprint(k*N*1.5)", "def main():\r\n n,w = map(int,input().split())\r\n a = list(sorted(map(int,input().split())))\r\n q = min(min(a[:n]),min(a[n:])/2)\r\n print(min(q*3*n,w))\r\n\r\nif __name__ == '__main__': main()", "n, w = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nres = 0\r\nx_min = 0\r\nif arr[0] * 2 <= arr[n]:\r\n x_min = float(arr[0])\r\nelse:\r\n x_min = float(arr[n] / 2)\r\n\r\nif x_min * 3 * n <= w:\r\n res = float(x_min * 3 * n)\r\nelse:\r\n res = float(w)\r\n\r\nif res % 1 != 0.0:\r\n print(res)\r\nelse:\r\n print(int(res))\r\n", "n, w = (int(i) for i in input().split())\ntea = sorted(int(i) for i in input().split())\nsmallest = min(tea[0], tea[n]/2)\nprint(min(smallest*3*n, w))\n", "n, w = map(int, input().split(' '))\r\nv = list(map(int, input().split(' ')))\r\n\r\nv = sorted(v) \r\nif v[n] / v[0] >= 2:\r\n x = v[0] \r\nelse:\r\n x = v[n] / 2\r\n\r\nsum = 3 * n * x \r\n\r\nif (sum > w):\r\n sum = w \r\n\r\nprint(sum)", "A = input().split()\r\nB = input().split()\r\na = [int(x) for x in list(B)]\r\na.sort()\r\ndt = min(a[0], a[int(A[0])]/2)*3*int(A[0])\r\nprint(min(dt,int(A[1])))", "n,w = map(int, input().split(' '))\r\nc = input().split(' ')\r\nc = [int(i) for i in c]\r\nc.sort()\r\nk = min(c[0], c[n]/2) * 3 * n\r\nprint(min(k, w))\r\n", "def STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n#code\r\nn , w = MAP()\r\narr = LIST()\r\narr.sort()\r\n\r\nmin_girl , min_boy = arr[0] , arr[n]\r\n\r\nif 2 * min_girl > min_boy:\r\n min_girl = min_boy / 2\r\n\r\nelif 2 * min_girl < min_boy:\r\n min_boy = 2 * min_girl\r\n\r\nres = min(w , (min_girl + min_boy) * n)\r\nprint(res)\r\n\r\n", "n, w = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(min(3 * n * a[0], 1.5 * n * a[n], w))", "n, w = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nmaxGirl = arr[n] / 2\r\nx = min(maxGirl, arr[0])\r\ntotal = (n + 2 * n) * x\r\nif total <= w:\r\n print(total)\r\nelse:\r\n print(w)", "def main():\r\n nm=list(map(int,input().split(' ')))\r\n arg=list(map(int,input().split(' ')))\r\n n=nm[1]/nm[0]\r\n arg.sort()\r\n i=arg[0]\r\n j=arg[nm[0]]\r\n j=min((i,j/2))\r\n print(\"%.7f\" % (min((j*3*nm[0],nm[1]))))\r\nif __name__ == \"__main__\":\r\n main()", "#n = int(input())\nn,w = [int(c) for c in input().split()]\na = [int(c) for c in input().split()]\na.sort()\n\nmaxgirl = w / (3 * n)\n\nfor i in range(n):\n if a[i] < maxgirl:\n maxgirl = a[i]\nfor i in range(n, 2*n):\n if a[i] < 2 * maxgirl:\n maxgirl = a[i]/2\n\nprint(maxgirl*3*n)\n", "import io, os\r\ninput=io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, c=[int(k) for k in input().decode('utf-8').rstrip(\"\\r\\n\").split()]\r\nw=[int(k) for k in input().decode('utf-8').rstrip(\"\\r\\n\").split()]\r\nw.sort()\r\na, b=w[0], w[n]\r\nres=min(b, 2*a)\r\nif n*res+(n//2)*res+(n%2)/2*res<=c:\r\n print(n*res+(n//2)*res+(n%2)/2*res)\r\nelse:\r\n print(c)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=(n*3)*l[0]\r\ny=((n*3)*l[n])/2\r\nprint(min(min(x,y),k))\r\n", "'''\r\n @Author: Pham T. Nhan\r\n @Date: 2/11/2018\r\n @Name: Pasha and Tea\r\n @Link: http://codeforces.com/problemset/problem/557/B\r\n'''\r\n\r\n\r\ndef main():\r\n n, w = map(int, input().split())\r\n capacity = list(map(int, input().split()))\r\n capacity.sort()\r\n\r\n # Note for calculation:\r\n # Each girls have the same amount, so that came with boys (x2)\r\n # So all girls must take the same amount of the smallest cup (or below than that)\r\n # And so that 0->(n-1) cups are for girl\r\n # Then n->(2n-1) cups are for boys\r\n # And we do the same with boys, all boys must take the same amount as n-th cup (or below than that)\r\n\r\n # If 2*capacity[0] <= capacity[n], then we can do that with all girls and boys\r\n # So possible TOTAL = 3*n*capacity[0] or W (if TOTAL > W)\r\n # Else 2*capacity[0] > capacity[n], then girls take capacity[n] / 2\r\n # So possible TOTAL = 1.5*n*capacity[n] or W (if TOTAL > W)\r\n\r\n girlCap = capacity[0]\r\n boyCap = capacity[n]\r\n if 2*girlCap <= boyCap:\r\n Total = 3*n*capacity[0]\r\n else:\r\n Total = 1.5*n*capacity[n]\r\n\r\n if Total > w:\r\n Total = w\r\n\r\n print(Total)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,w=map(int,input().split())\r\nlst=[*map(float,input().split())]\r\nlst.sort()\r\nres=min(lst[0],lst[n]/2,w/3/n)\r\nprint(res*3*n)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, w = map(int, input().split())\r\ng = sorted(map(int, input().split()))\r\na = g[0]\r\nb = g[n]\r\nx = min(a, b/2, w/n/3)\r\nprint(x*n*3)\r\n", "# print (\"Input n and w on the same line\")\nvalues = input().split()\nn = int(values[0])\nw = int(values[1])\n# print (\"Input all 2*n cup sizes on one line\")\ncups = input().split()\n\nfor i in range(2*n):\n cups[i] = int(cups[i])\n\ncups.sort()\n\nlowgirl = cups[0]\nlowboy = cups[len(cups)//2]\ntotalused = 0\nif (2*lowgirl <= lowboy):\n totalused = n*lowgirl + n*lowgirl*2\nelse:\n totalused = n*(lowboy/2) + n*lowboy\nif (totalused < w):\n print (totalused)\nelse:\n print (w)\n \n", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nprint(min(min(a[n]/2,a[0])*(n*3),w))", "n,w=map(int,input().split())\r\ncapa=list(map(int,input().split()))\r\n\r\nsorted=sorted(capa, reverse=True)\r\n\r\n\r\nx = min(sorted[n-1]/2,sorted[-1],w/(3*n))\r\nresultW = 3 * n * x\r\nprint(resultW)", "def main():\n n, w = map(int, input().split())\n a = sorted(map(int, input().split()))\n print(min(w, min(a[0], a[n] * 0.5) * 3 * n))\n\n\nif __name__ == '__main__':\n main()\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nprint(min(a[0]*3*n,a[n]/2*3*n,(w/(3*n)*3*n)))", "# Codeforces: 557B - Pasha and Tea\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nans = min(a[0], a[n] / 2.0) * 3 * n\r\nans = min(ans, w)\r\n\r\nprint(ans)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = a[n]; g = min(b/2, a[0]); z = 3*n*g;\r\nprint( z if z <= w else w)\r\n\r\n", "n, w = [int(i) for i in input().split()]\r\ncapacity = [int(i) for i in input().split()]\r\n\r\ncapacity.sort(reverse=True)\r\nresult = 0\r\nif capacity[n-1] >= capacity[(2*n) - 1] * 2:\r\n result = capacity[(2*n) - 1] * 3 * n\r\nelse:\r\n result = capacity[n-1] * 3 / 2 * n\r\nif result <= w:\r\n print(result)\r\nelse:\r\n print(w)\r\n\r\n\r\n", "first = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nn = first[0]\r\nl = len(arr)\r\nw = first[1]\r\narr.sort()\r\neach = (w / (n * 3))\r\nmaxBoy = each * 2\r\n\r\nminGirl = arr[0]\r\nminBoy = arr[l//2]\r\n\r\nif minGirl * 2 > minBoy:\r\n\tminGirl = minBoy / 2\r\nif each <= minGirl:\r\n\tprint(w)\r\nelse:\r\n\tprint(minGirl * 3 * n)\r\n\r\n\r\n\t\t\r\n\t\t\r\n\t\t\r\n\r\n", "n,w = map(int, input().split())\r\na = list( map(int, input().split()))\r\na.sort()\r\ngirls = a[:n]\r\nboys = a[n:]\r\nx = 0\r\nx = min(girls[0],boys[0] / 2)\r\ntotal = 3 * x * n\r\nprint(min(total,w))", "n,w = [int(x) for x in input().split()];\r\nsOC = [int(x) for x in input().split()];\r\nsOC.sort();\r\nr1 = sOC[n];\r\nr2 = sOC[0];\r\nif r1/2 <= r2:\r\n\tk = ((3/2)*r1*n)\r\n\tif k < w :\r\n\t\tprint(k)\r\n\telse :\r\n\t\tprint(w)\r\nelse :\r\n\tk = (3*r2*n)\r\n\tif k < w :\r\n\t\tprint(k)\r\n\telse :\r\n\t\tprint(w)\r\n", "def main():\n n, w = [int(t) for t in input().split()]\n a = sorted(int(t) for t in input().split())\n\n min_girl_cup = a[0]\n min_boy_cup = a[n]\n\n max_girl_amount = min(min_girl_cup, min_boy_cup / 2)\n\n total = min(3 * max_girl_amount * n, w)\n\n print(total)\n\n\nif __name__ == '__main__':\n main()\n", "def f():\r\n\t[n,w] = list(map(int,input().split(' ')))\r\n\ta = list(map(int,input().split(' ')))\r\n\ta.sort()\r\n\tprint(format(min(min(a[0],a[n]/2)*3*n,w),'.20f'))\r\nf()", "n,w = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\nm = min(a[0],a[n]/2)\r\n#print(m)\r\nsum = 3*n*m\r\nprint(min(sum,w))", "#n = int(input())\nn, w = map(int, input().split(\" \"))\narr = input().split(\" \")\nfor i in range(2*n):\n arr[i] = int(arr[i])\n \narr.sort()\nboysize = arr[n]\ngirlsize = arr[0]\nx = min(boysize/2, girlsize)\n\nprint(min(w, 3*x*n))", "s = input()\r\nn, w = map(int, s.split())\r\n\r\ns = input()\r\nsizes = list(map(int, s.split()))\r\n\r\nsizes.sort()\r\n\r\nx = min(sizes[0], sizes[n]/2)\r\n\r\nans = 3 * n * x\r\n\r\nif ans > w:\r\n print(w)\r\n \r\nelse:\r\n print(ans)\r\n", "# 557B\r\nn,w = map(int,input().split()) # n: so luong boy hoac girl, w: tong so tra (millilit) co san\r\na = list(map(int,input().split())) # dung luong max cho moi coc tra\r\na.sort()\r\n# tinh so mil tra max cho moi coc cua girlfriend\r\nmax_per_cup = min(a[n]/2,a[0])\r\n# print (max_per_cup)\r\nprint (min(max_per_cup*3*n,w))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\ng = a[0]\nb = a[n] / 2\nmaxm = w / (3 * n)\nprint(min(g, b, maxm) * 3 * n)\n", "n, w = map(int, input().split())\r\na = input().split()\r\nfor i in range(2*n):\r\n a[i] = int(a[i])\r\na.sort()\r\ng = []\r\nb = []\r\n\r\nfor i in range(2*n):\r\n if i<n:\r\n g.append(a[i])\r\n else:\r\n b.append(a[i]/2)\r\nprint(min(3*n*min(min(g),min(b)),w))", "n, w = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nk = w / (3 * n)\r\nv.sort()\r\n\r\nv1 = v[:n]\r\nv2 = v[n:]\r\nx = float(0)\r\nif (2 * v1[0] <= v2[0]):\r\n x = min(k, v1[0])\r\nelse:\r\n x = min(k, v2[0] / 2.0)\r\n\r\nres = float(3 * n * x)\r\nprint(res)\r\n ", "n,w=map(int, input().split())\r\na=list(map(int, input().split()))\r\na.sort()\r\ng=a[0]\r\nb=a[n]\r\nif g>=w:\r\n print(w)\r\nelse:\r\n if g*2>b:\r\n g=b/2\r\n t=g*n + g*2*n\r\n if t<=w:\r\n print(t)\r\n else:\r\n print(w)", "import sys\r\nn,w=map(int,input().split())\r\nArray=list(map(int, input().split()))\r\n\r\nArray=sorted(Array)\r\n\r\nx=min(Array[0],(Array[n]/2))\r\nresult=n*x+2*x*n\r\nif result>w:\r\n print(w)\r\n sys.exit(0)\r\nprint(result)\r\n\r\n", "def solve():\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n \r\n minCapacity = min(a[0], a[n] / 2)\r\n res = min(w, minCapacity * 3 * n)\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, w = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nsorted_a = sorted(a)\n\namount = sorted_a[0]\nminimum_boy_capacity_cup = sorted_a[n]\nres = 0\n\nif minimum_boy_capacity_cup / 2 <= amount:\n res = (minimum_boy_capacity_cup * n) + ((minimum_boy_capacity_cup / 2) * n)\nelse:\n while amount >= 0:\n if amount * 2 > minimum_boy_capacity_cup:\n amount = amount / 2\n else:\n res = (amount * n) + (amount * 2 * n)\n break\n\nprint(min(w, res))", "rr = lambda: map(int, input().split())\r\nn, w = rr(); a = sorted(rr())\r\nprint(min(a[0], a[n] / 2, w / 3 / n) * 3 * n)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ncap = min(a[0], a[n] / 2)\r\n\r\nserve = min(w/n/3, cap)\r\n\r\nans = serve*3*n\r\n\r\nprint(ans)", "n, w = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n\r\nv.sort()\r\n\r\nif v[n] / v[0] >= 2:\r\n x = v[0] \r\nelse:\r\n x = v[n] / 2\r\n\r\nsum = 3 * n * x \r\n\r\nprint(min(sum, w))\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse = False)\r\n\r\nmin_girl = a[0]\r\nmin_boy = a[n] * 0.5\r\nif min_girl < min_boy:\r\n ans = min_girl * 3 * n * 1.0\r\nelse:\r\n ans = min_boy * 3 * n\r\nans = min(ans, w)\r\n\r\nprint('%.10f' % ans)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/557/B\r\n\r\nn, w = map(int, input().split())\r\nl_t = list(map(int, input().split()))\r\nl_t.sort()\r\nt_a = min(w / (3 * n), l_t[0], l_t[n] / 2)\r\nprint(t_a * n * 3)", "def init():\r\n num_input = input()\r\n num_input = num_input.split(\" \")\r\n n = int(num_input[0])\r\n w = int(num_input[1])\r\n\r\n a = input()\r\n a = a.split(\" \")\r\n length = 2 * n\r\n for i in range(length):\r\n a[i] = int(a[i])\r\n\r\n return a, n, w\r\n\r\n\r\ndef solve(a, n, w):\r\n a.sort()\r\n cup = min(a[0], a[n] / 2)\r\n return min(3 * n * cup, w)\r\n\r\na, n, w = init()\r\nprint(solve(a, n, w))\r\n", "def getMaxlWater(n,w,a):\n a.sort()\n minCup = min(a[0],a[n]/2)\n if minCup*3*n > w:\n print(w)\n exit()\n return minCup*3*n\n\n\nif __name__ == \"__main__\":\n n, w = map(int,input().split())\n a = list(map(int,input().split()))\n result = getMaxlWater(n,w,a)\n if result%1 != 0:\n print(result)\n else:\n print(int(result))", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=100000007\r\nn,w=vary(2)\r\nnum=array_int()\r\nnum.sort()\r\nprint(min(w,3*n*num[0],1.5*n*num[n]))\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "inputt = input().split()\nn, w = int(inputt[0]), int(inputt[1])\narr = [int(i) for i in input().split()]\narr.sort()\nli = min((arr[0] * n * 3), (arr[n] * n * 3 / 2))\nli = min(li, w)\nprint(li)", "n, w = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\ngirl = a[:n] \r\nboy = a[n:]\r\n\r\nminG = min(girl)\r\nminB = min(boy)\r\n\r\n# x should\r\n# x <= minG\r\n# 2x <= minB\r\n# 3xn <= w\r\n# ans: 3xn when x satisfies all 3 conditions\r\n\r\nx = min(minG, minB/2, w/(3*n))\r\nans = 3*x*n \r\nif ans - int(ans) == 0:\r\n\tprint(int(ans))\r\nelse:\r\n\tprint(ans) ", "def inp(): \r\n return map(int, input().split(' '))\r\n\r\nn, w = inp() \r\nv = inp() \r\n\r\nv = sorted(v) \r\nif (v[n]*1.0 / v[0] >= 2.0):\r\n x = v[0] \r\nelse:\r\n x = v[n]*1.0/2.0\r\n\r\nsum = 3.0 * n * x \r\n\r\nif (sum > w):\r\n sum = w \r\n\r\nprint(sum)", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nl=len(a)\r\ni,j=0,int(l/2)\r\nif a[i]*2<=a[j] and a[j]/2.0<=a[i]:\r\n ans=max(a[i],a[j]/2.0)*3*n\r\nelif a[i]*2<=a[j]:\r\n ans=a[i]*3*n\r\nelif a[j]/2.0<=a[i]:\r\n ans=a[j]/2*3*n\r\nprint (min(ans,w))\r\n", "INPUT = lambda: map(int, input().split())\n\nn, w = INPUT()\na = sorted(INPUT())\n\nprint(min(w, 1.5 * n * a[n], 3 * n * a[0]))", "#!/usr/bin/python3\nn,m=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\nprint(3*n*min(a[0],a[n]/2,m/n/3))\n", "#1: Devu, the Dumb Guy\n# n, x = map(int, input().split())\n# a = sorted(list(map(int, input().split())))\n# print(sum([a[i]*max(x-i, 1) for i in range(len(a))]))\n\n#2: http://bigocoder.com/courses/BLUE23/BLUE23_LEC03/BLUE_L03P02/statement\n# n, a, b = map(int, input().split())\n# h = sorted(list(map(int, input().split())))\n# print(h[len(h) - a] - h[len(h) - a - 1])\n\n#3: http://bigocoder.com/courses/BLUE23/BLUE23_LEC03/BLUE_L03P03/statement\n# n = int(input())\n# a = list(map(int, input().split()))\n# start = -1\n# end = -1\n# for i in range(len(a) - 1):\n# if a[i] > a[i+1]:\n# start = i\n# break\n# for i in range(len(a) - 1, 0, -1):\n# if (a[i] < a[i-1]):\n# print(i)\n# end = i\n# break\n# if start == -1 or end == -1:\n# print(\"no\")\n# else:\n# print(\"yes\")\n# print(start + 1, end + 1)\n\n#6: Pasha and Tea\nn, w = map(int, input().split())\na = sorted(list(map(int, input().split())))\nx = min(a[0], a[n]/2)\nm = 3*(n)*x\nif m <= w: print(m) \nelse: print(w)\n\n\n", "nw = [int(x) for x in input().split()]\nn = nw[0]\nw =nw[1]\narr =[int(x) for x in input().split()]\narr.sort()\ngirl_size = arr[0]\nboy_size = arr[n]\nm =min(girl_size,boy_size/2)\nm = min(m,w/(3*n))\nprint(m*n+2*m*n)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\na_girls = a[0]\r\na_boys = a[n]\r\n\r\nprint(min(a[0], a[n]/2, w/(3*n))*3*n)", "n, w = map(int, input().split())\r\ncapac = list(sorted(map(int, input().split())))\r\nboy = capac[len(capac)//2]\r\ngirl = capac[0]\r\n\r\nprint(min(3*girl*n, 3/2*boy*n, w))", "# ý tưởng: sắp xếp mảng a, sau đó so sánh vị trí 0 và n có giá trị lần lượt là b và g\r\n# nếu b >= 2 * g thì nữ uống nhiều nhất đúng bằng lượng g và nam là 2 * g\r\n# ngược lại thì nữ sẽ uống lượng nhiều nhất là b / 2 và nam là b\r\n# tính toán tổng lượng nước và trả về biến res\r\n# cuối cùng so sánh biến res với lượng nước tối đa ban đầu w\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = a[n]\r\ng = a[0]\r\nres = 0\r\nif b >= 2 * g:\r\n res = g * n * 3\r\nelse:\r\n res = b / 2 * n * 3\r\n\r\nif res > w:\r\n res = w\r\nprint(res)", "n, w = map(int,input().split())\r\nteas = list(map(int,input().split()))\r\nteas.sort()\r\nx = min(teas[0],teas[n]/2)\r\nx = min(x,w/(3*n))\r\nprint(3*x*n)\r\n", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=a[0]\r\ny=a[n]\r\n\r\nif x>=y/2:\r\n ans=min((3*y*n)/2,w)\r\n print(ans)\r\nelse:\r\n ans=min(3*x*n,w)\r\n print(ans)", "n, w = map(int, input().split())\na = sorted(list(map(int, input().split())))\n\nif a[n] < a[0] * 2:\n s = 1.5 * a[n]\nelse:\n s = 3 * a[0]\nprint(min(s * n, w))\n ", "__author__ = 'Andrey'\nn, w = map(int, input().split())\nvolumes = list(map(int, input().split()))\nvolumes.sort()\nm = -1\nif volumes[0] * 2 <= volumes[n]:\n possible = 3 * n * volumes[0]\n if possible <= w:\n m = max(m, possible)\nif volumes[n] / 2 <= volumes[0]:\n possible = volumes[n] / 2 * 3 * n\n if possible <= w:\n m = max(m, possible)\nif w / (3 * n) <= volumes[0] and 2 * w / (3 * n) <= volumes[n]:\n m = max(m, w)\nprint(m)", "n, w=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\n\r\nprint(min(a[0], a[n]/2, w/3/n)*3*n)", "n, w = map(int,input().split())\r\ncups = list(map(int,input().split()))\r\n\r\ncups.sort()\r\ntotal_tea = 0 \r\ntotal_tea = min(cups[0], cups[n] / 2)\r\nprint(min(3 * total_tea * n, w))\r\n\r\n", "n,w = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nmaxx = w/(3*n)\r\nt = 0\r\nif(a[n]/2 > a[0]):\r\n t = a[0]\r\nelse:\r\n t = a[n]/2\r\nif(t> maxx):\r\n print(w)\r\nelse:\r\n print(t*3*n)", "n, w = list(map(int, input().split()))\na = list(map(int, input().split()))\na.sort()\nb = a[n]\ng = a[0]\nif b >= 2*g:\n ret = g*2*n + g*n\nelif b >= g:\n ret = b*n+float(b)/2*n\nprint(min(ret, w))\n\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif a[n] / a[0] >= 2:\r\n x = a[0] \r\nelse:\r\n x = a[n] / 2\r\nsum = 3 * n * x \r\nprint(min(sum, w))\r\n", "n, w = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nt = min(a[0]*2, a[len(a) // 2])\r\nprint(min(w, (t * len(a) // 2) + (t/2)*(len(a) // 2)))\r\n", "n, w = map(int, input().split())\ncups = list(map(int, input().split()))\ncups.sort()\nx = min(2 * cups[0], cups[n])\nprint(min(w, n * x * 3 / 2))\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nS=sorted(l)\r\nv=S[0]\r\ng=S[n]\r\nl1=v*n+g*n\r\nif l1-m<0 :\r\n m=l1\r\n\r\np=m/3\r\np1=p*2\r\nt=p/n\r\nt1=p1/n\r\nif t1>g :\r\n t1=g\r\n t=t1/2\r\nif t>v :\r\n t=v\r\n t1=v*2\r\nprint((t+t1)*n)\r\n \r\n \r\n", "def pasha_and_tea(n,w,l):\r\n s=sorted(l)\r\n if s[n]>=s[0]*2:\r\n girl=s[0]\r\n boy=s[0]*2\r\n else:\r\n girl=s[n]/2\r\n boy=s[n]\r\n if (girl+boy)*n<=w:\r\n print((girl+boy)*n)\r\n else:\r\n print(w)\r\nn,w=list(map(int, input().split()))\r\nl=list(map(int, input().split()))\r\npasha_and_tea(n,w,l)\r\n", "line = input()\r\nn = int(line.split(' ')[0])\r\nw = int(line.split(' ')[1])\r\ncups= []\r\nline = input().split(' ')\r\n\r\nfor l in line:\r\n cups.append(int(l))\r\ncups.sort()\r\n\r\nmin1 = cups[0]\r\nmax1 = cups[n]\r\n\r\nx = min(cups)\r\nif x * 2 > max1:\r\n x = max1 / 2\r\n\r\n\r\nprint(min(x * n * 3, w))", "def inp():\r\n return map(int, input().split())\r\n\r\nn, w = inp()\r\na = list(inp())\r\n\r\na.sort()\r\n\r\ngirls = a[:n]\r\nboys = a[n:]\r\n\r\nx = 0\r\n\r\nif girls[0] * 2 > boys[0]:\r\n x = boys[0] / 2\r\nelse:\r\n x = girls[0]\r\n\r\ntotal = 3 * x * n\r\n\r\nif total > w:\r\n total = w\r\n\r\nprint(total)\r\n", "n,w=[int(i)for i in input().split()]\r\nl=[int(i)for i in input().split()]\r\nl.sort()\r\nprint(min(w,3*n*min(l[0],l[n]/2)))", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ngirl = a[0]\r\nboy = a[n]\r\np = 0\r\nif (2*girl > boy):\r\n p = boy/2\r\nelse:\r\n p = girl\r\nans = min(3.0*p*n, w)\r\nprint(ans)\r\n\r\n\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))[:n*2]\r\n\r\na.sort()\r\n\r\np = 0\r\nif a[0]*2 <= a[n]:\r\n p = a[0]\r\nelse:\r\n p = a[n] / 2\r\n\r\nif p*3*n <= w:\r\n print(p*3*n)\r\nelse:\r\n print(w)\r\n", "n, w = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\na.sort()\nx = a[0]\ny = a[n]\nif x * 2 >= y:\n\tprint(min(w, y / 2 * 3 * n))\n\texit()\nprint(min(w, x * 3 * n))\n", "number_of_boys, capacity = map(int, input().split())\r\n\r\ncapacity_of_cups = list(map(int, input().split()))\r\n\r\ncapacity_of_cups.sort()\r\n\r\namount_of_girl = capacity_of_cups[0]\r\namount_of_boy = capacity_of_cups[number_of_boys]\r\n\r\npour = capacity/(3*number_of_boys)\r\n\r\nif amount_of_girl == amount_of_boy:\r\n\tamount_of_girl = amount_of_girl/2\r\nelse:\r\n\tif amount_of_girl*2 > amount_of_boy:\r\n\t\tamount_of_girl = amount_of_boy/2\r\n\r\nif pour > amount_of_girl:\r\n\tpour = amount_of_girl\r\n\r\nprint(pour*3*number_of_boys)", "n,w = list(map(int,input().split(' ')))\r\nvl = list(map(int,input().split(' ')))\r\nvl.sort()\r\ng = vl[0]\r\nb = vl[n]\r\nprint(3*n*(min(vl[n]/2,vl[0],w/(3*n))))\r\n", "from sys import stdin, stdout\r\nn, w = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\na.sort()\r\n\r\nv_each_cup = min(a[0], a[n]/2)\r\nstdout.write(str(min(3*v_each_cup*n, w)))", "a,k = map(int,input().split())\r\nl = sorted(map(int,input().split()))\r\nprint(min(k,a*(3*min(l[a]/2.0, l[0]))))", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ninp = input().split()\nn = int(inp[0])\nw = int(inp[1])\n\ncups = sorted(list(map(int, input().split())))\n\ngirl = cups[0]\nboy = cups[n]\n\ns = 0\n\ns += (min(girl, boy / 2) * 3 * n)\n\nprint(min(s, w)) \n", "# Pasha and Tea\r\ndatain = True\r\n\r\nif datain:\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\nelse:\r\n n, w = 1, 5\r\n a = [2, 3]\r\n\r\n\t\r\na.sort()\r\n\r\ng = a[0]\r\nb = a[n]\r\nt = min(g, float(b/2))\r\nvol = 3*t*n\r\nprint(min(vol,w))", "n,w = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\n\r\na.sort()\r\nmingirl = a[0]\r\nminboy = a[n]\r\n\r\nwgirl = w/3\r\nwboy = w-wgirl\r\n\r\nif mingirl*2 <= minboy:\r\n m = mingirl\r\nelse :\r\n m = minboy/2\r\n\r\nq= min(m*n*3,w)\r\n\r\nprint(q)\r\n\r\n", "n, w = map(int, input().split())\r\na = list(map(float, input().split()))\r\n\r\na.sort()\r\n\r\nif a[0] * 2 <= a[n]:\r\n base = a[0]\r\nelse:\r\n base = a[n] / 2\r\n\r\nresult = min(w, base * n + base * n * 2)\r\nprint(f\"{result:.9f}\")", "'''557B'''\r\nn, w = map(int, input().split())\r\ncap = list(map(int, input().split()))\r\ncap.sort()\r\ngirl_min, boy_min = cap[0], cap[n]\r\n\r\nif girl_min*2<=boy_min:\r\n print(min(w, girl_min*3*n))\r\nelse:\r\n print(min(w, boy_min*1.5*n))\r\n", "n, w=map(int, input().split())\r\na=list(map(int, input().split()))\r\na.sort()\r\nprint(min(w, min(a[0]*3*n, a[n]*(3/2)*n)))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\n\nb = sorted(a)\n\nb1 = b[0:n]\nb2 = b[n:2 * n]\n\nmaxGirl = b1[0]\nmaxBoy = b2[0]\n\nmaxWater = w / 3 / n \n\nmaxCapity = 0\n\ntotal = 0\n\nif maxGirl * 2 > maxBoy:\n\tmaxCapity = maxBoy / 2\nelse:\n\tmaxCapity = maxGirl\n\nif (maxWater > maxCapity):\n\ttotal = maxCapity * n * 3\nelse:\n\ttotal = maxWater * n * 3\n\nprint(total)\n", "n, w = map(int,input().split())\r\n\r\na = sorted(map(int,input().split()))\r\n\r\nx=a[0]*n*3\r\ny=a[n]*n*1.5\r\nprint(min(w,x,y))", "n, w = map(int, input().split())\r\ncups = [int(i) for i in input().split()]\r\n\r\ncups.sort()\r\nif cups[n] >= cups[0]*2:\r\n\twater = cups[0]*3*n\r\n\tif water > w:\r\n\t\tprint(w)\r\n\t\tquit()\r\n\telse:\r\n\t\tprint(water)\r\n\t\tquit()\r\nelse:\r\n\twater = cups[n]*3/2*n\r\n\tif water > w:\r\n\t\tprint(w)\r\n\t\tquit()\r\n\telse:\r\n\t\tprint(water)\r\n\t\tquit()", "n, w = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nx = min(a[0], a[n]/2)\r\nprint(min(3*x*n, w))", "#Pasha and tea\r\nn,w = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nb = []\r\ng = []\r\nfor i in range(n):\r\n g.append(l[i])\r\n\r\ni = n\r\nwhile i < 2*n:\r\n b.append(l[i])\r\n i += 1\r\n\r\nlow = 0\r\nhigh = w\r\nitr = 200\r\nm = 0\r\nwhile itr:\r\n mid = (low+high)/2\r\n k = w\r\n f = 0\r\n for i in range(n):\r\n o = g[i]\r\n t = b[i]\r\n if o >= mid and t >= 2*mid:\r\n k = k-((2*mid)+(mid))\r\n\r\n else:\r\n f = 1\r\n break\r\n\r\n if k < 0:\r\n high = mid\r\n itr -= 1\r\n continue\r\n\r\n if f == 1:\r\n high = mid\r\n itr -= 1\r\n continue\r\n\r\n if m < mid:\r\n m = mid\r\n\r\n low = mid\r\n itr -= 1\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans = ans+m+(2*m)\r\n\r\nprint(ans)", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=x*3\r\ns=y/b\r\na.sort()\r\nz=len(a)//2\r\nk=min(a[z:])\r\np=min(a[:z])\r\nw=(min(s,k/2,p))\r\n\r\nprint(x*(w+2*w))", "n, w = map(int, input().split())\r\ncups = list(map(int, input().split()))\r\ncups.sort()\r\n\r\nm = min(cups[0], cups[n] / 2)\r\nmax_amount = 3 * m * n\r\nprint(min(max_amount, w))", "n, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\n#print(a)\nbigCup = max(a)\n\n\ndef check(x): # x == 2*n*3\n agar = x/(2*n*3)\n for_girl = agar * 2\n for_boy = for_girl * 2\n #print(for_girl, for_boy, x)\n if a[0] < for_girl or a[n] < for_boy:\n return False\n # for i in range(2*n):\n # if for_girl > a[i] or for_boy > a[i]:\n # return False\n return True\n\n\nright = w\nleft = 0\nmid = (left + right) / 2\nwhile left + 0.0000001 < right:\n mid = (left + right) / 2\n #print(mid, check(mid))\n if check(mid):\n left = mid\n else:\n right = mid\nprint(mid)\n", "def answer(n,w,A):\r\n A.sort(reverse=True)\r\n \r\n maxb=A[n-1]\r\n maxg=A[-1]\r\n if maxb<=2*maxg:\r\n maxg=maxb/2\r\n \r\n return min(3*n*maxg,w)\r\n \r\n\r\n\r\nn,w=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,w,arr)) ", "n,w,*vl = list(map(int,input().split(' '))) + list(map(int,input().split(' ')))\r\nvl.sort()\r\nprint(3*n*(min(vl[n]/2,vl[0],w/(3*n))))\r\n", "import sys\n\n# get the number of boys/girls, and the max teapot ml capacity\nn, w = [int(i) for i in sys.stdin.readline().split()]\n\n# Get the teapots and sort them by size\nteacups = sorted([int(i) for i in sys.stdin.readline().split()])\n\n# girl size is the smallest teacup, boy size is the smallest of the 1/2 largest\n# teacups\ngirl, boy = [teacups[0], teacups[n]]\n\n# boy size is the min of his cup size or twice the girl cup size\nboy_ml = min(girl * 2, boy)\n\n# girl is half the boy size\ngirl_ml = boy_ml / 2\n\n# total is the min of w and sum of all the amounts \ntotal = min(n * (boy_ml + girl_ml), w)\n\nprint(total)", "n, w = map(int, input().split())\r\ncups = list(map(int, input().split()))\r\ncups.sort()\r\n\r\nmaxForACup = cups[0]\r\nif maxForACup * 2 > cups[n]:\r\n maxForACup = cups[n] / 2\r\n \r\nif maxForACup*3*n <= w:\r\n print(maxForACup*3*n)\r\nelse:\r\n print(w)", "n,w = map(int,input().split())\r\ncups = list(map(int,input().split()))\r\ncups.sort()\r\n\r\nm = min(cups[0],cups[n]/2.0)\r\ntotal = 3*m*n\r\nprint(min(total,w))", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nfirst=a[0]\r\nsecond=a[n]\r\nif first*2<=second:\r\n print(min(x,3*n*first))\r\nelse:\r\n print(min(x,3*n*second/2))", "s = [int(x) for x in input().split(' ')]\r\nn, pot = s[0], s[1]\r\ncups = sorted([int(x) for x in input().split(' ')])[::-1]\r\n\r\nfor i in range(0, len(cups) // 2):\r\n cups[i] = cups[i] / 2\r\n \r\nl = len(cups)\r\nmin_cup = min(cups)\r\n\r\ny = min_cup * n * 3\r\n\r\nprint(y if y < pot else pot)", "n, w = (int(i) for i in (input().split()))\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nif 2 * a[0] <= a[n]:\r\n print(min(w, 3 * a[0] * n))\r\nelse:\r\n print(min(w, 1.5 * a[n] * n))", "\nn,w=[int(x) for x in input().split()]\na=[int(x) for x in input().split()]\n\na.sort()\n\nx=min(a[0],a[n]/2)\n\nans=min(x*n*3,w)\n\nprint(ans)\n", "params = list(map(int, input().split(\" \")))\r\nn = params[0]\r\nw = params[1]\r\nvolumn = sorted(list(map(int, input().split(\" \"))))\r\ntemp = 0\r\nif volumn[0] * 2 < volumn[n]:\r\n temp = volumn[0] * 3.0 * n\r\nelse:\r\n temp = volumn[n]/2.0*3*n\r\nif temp>w:\r\n print(w)\r\nelse:\r\n print(temp)", "n, w = map(int, input().split())\r\na = [float(x) for x in input().split()]\r\na.sort()\r\ntt = min(a[0], (a[n]/2))\r\nttt = 3*n*tt\r\nt = w\r\nt = min(w, 3*n*tt)\r\nprint(t)\r\n", "n,w = map(int,input().split())\r\nA = list(map(int, input().split()))\r\n\r\nA.sort()\r\n\r\nx = A[0]\r\ny = A[n]\r\nm = min(x, y/2)\r\n\r\nprint(min(3*m*n, w))", "m,w=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\ng=min(l[0],l[m]/2)\r\nprint(min(3*g*m,w))", "n, w = map(int ,input().split())\r\nread = list(map(int, input().split()))\r\nread.sort(reverse = True)\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append(read[i])\r\n b.append(read[i + n])\r\n\r\nc = []\r\nfor i in range(n):\r\n c.append(min(a[i]/2, b[i]))\r\n\r\nprint(min(w, min(c) * 3 * n))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2) / 2\r\n for _ in range(100):\r\n m = (c1 + c2) / 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n return m\r\n\r\ndef ok(m):\r\n return True if m <= a[0] and 2 * m <= a[n] else False\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ninf = w / (3 * n)\r\nans = binary_search(0, inf) * 3 * n\r\nprint(ans)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncan_pour_g = w/(3*n)\r\n\r\na = sorted(a)[::-1]\r\nb = a[:n]\r\ng = a[n:]\r\n\r\nmb = min(b)\r\nmg = min(g)\r\n\r\npg = 0\r\nif mb > mg*2:\r\n pg = mg\r\nelse:\r\n pg = mb/2\r\n \r\nif can_pour_g < pg:\r\n print((n*can_pour_g) + (2*n*can_pour_g))\r\nelse:\r\n print((n*pg) + (2*n*pg))", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ng=a[0]\r\nb=a[n]\r\nif (g*2)<=b:\r\n b=(g*2)\r\nelif (g*2)>b:\r\n g=b/2\r\nans=(g*n)+(b*n)\r\nif ans>w:\r\n ans=w\r\nprint(ans)", "R = lambda: list(map(int, input().split()))\r\nn,w = R()\r\na = R()\r\n\r\na = sorted(a)\r\nprint(min(w,min(a[n]/2,a[0])*3*n))", "# ý tưởng: tìm max và min trong mảng a, sau đó đếm số lượng 2 loại ly\n# nếu lượng ly có kích thước nhỏ chiếm đa số => toàn bộ nam sẽ uống ly nhỏ, và nữ sẽ uống phần ly còn lại\n# do đó lượng nước tính bằng kích thước ly nhỏ\n# ngược lại thì toàn bộ nam sẽ uống nước với ly kích thước lớn \n# khi đó sẽ so sánh chênh lệch kích thước giữa 2 loại ly\n# từ đó tìm ra kích thước ly dùng để tính toán lượng nước\n# cách tính thì anh chị có thể xem bên dưới \nn, w = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nb = a[n]\ng = a[0]\nres = 0\nif b >= 2 * g:\n res = g * n * 3\nelse:\n res = b / 2 * n * 3\n\nif res > w:\n res = w\nprint(res)", "n,w = map(int,input().split())\r\na = []\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = min(a[0],a[n]/2)\r\nres = min(3*m*n,w) \r\nprint(res)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nm_g, m_b = a[0], a[n]\r\nif m_b / 2 <= m_g and (m_b / 2) * n + m_b * n <= w: print((m_b / 2) * n + m_b * n)\r\nelif m_g * 2 <= m_b and m_g * n + m_g * 2 * n <= w: print(m_g * n + m_g * 2 * n)\r\nelse:\r\n x = w / (3 * n)\r\n print(3 * x * n)", "n, w = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nh = min(arr[0], arr[n] / 2, w / (3 * n))\r\nprint(3 * h * n)\r\n", "n, w = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nprint(min(a[0], a[n] / 2, w / 3 / n) * 3 * n)", "n,w = map(int,input().split())\na = sorted(list(map(int,input().split())))\nprint(min(w,a[n]*1.5*n,a[0]*3*n))", "n, w = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nprint(min(3 * n * min(a[0], a[n] / 2.0), w))", "n,w=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(min(w,l[n]*n*1.5,l[0]*n*3))", "n,w=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(min(w,l[n]*n*1.5,l[0]*n*3))\r\n\r\n#idea is take all w if all>w\r\n# or select min for girl then boys will take 2*min\r\n# or select min for boy then girls will take 0.5*min\r\n\r\n# final in min is sum for each select", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=min(l[0],l[n]/2)\r\nans=x*n+2*x*n\r\nprint(min(ans,k))", "n,m=map(int,input().split())\r\nAarray=list(map(int,input().split()))\r\nAarray.sort()\r\nprint(3*n*min(Aarray[0],Aarray[n]/2,m/n/3))", "n, w = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nprint(3 * n * min(w / 3 / n, a[0], a[n] / 2))", "n, w = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nsortedArray = sorted(l)\r\n\r\ngirls = sortedArray[0:n]\r\n\r\nboys = sortedArray[n:n*2]\r\n\r\n\r\nminGirl = girls[0]\r\n\r\nminBoy = boys[0]\r\n\r\nteaBoys = 0\r\nteaGirls = 0\r\n\r\nif minBoy/2 <= minGirl:\r\n\tteaBoys = minBoy*n\r\n\tteaGirls = (minBoy/2)*n\r\nelse:\r\n\tminBoy = minGirl * 2\r\n\tteaBoys = minBoy * n\r\n\tteaGirls = minGirl * n\r\n\r\nif teaBoys + teaGirls > w:\r\n\tprint(w)\r\nelse:\r\n\tprint(teaGirls+teaBoys)\r\n\r\n\r\n", "n, w = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\n\r\na.sort()\r\n\r\nres = 0\r\nif a[n] < a[0] * 2:\r\n res = 3.0 / 2 * a[n] * n\r\nelse:\r\n res = 3.0 * n * a[0]\r\n\r\nif(res > w):\r\n res = w\r\n\r\nprint(\"%.10f\" % res)", "n,w = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ng = l[0]\r\nb = l[n]\r\n\r\nans = min(b/2.0 , g)\r\n\r\nans = min(ans * 3.0 * n, w)\r\n\r\nprint(ans)\r\n", "n,w = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ngirlsmin = a[0]\r\nboysmin = a[n]\r\nif girlsmin<boysmin/2:\r\n x = girlsmin\r\nelse:\r\n x = boysmin/2\r\nquant = 3*x*n\r\nprint(min(quant,w))\r\n\r\n", "n, w = map(int, input().split())\n\narr = list(map(int, input().split()))\n\n#если чайник бменьше? \n\narr.sort()\narr.reverse()\n\nboys, girls = arr[:n], arr[n:n*2]\n\nif min(boys)/2>=min(girls):\n\tprint(min((min(girls)*n)+(min(girls)*n)*2, w))\nelse:\n\tprint(min((min(boys)*n)+(min(boys)*n)/2, w))", "__author__ = 'darinflar'\r\nn, w = map ( int, input().split())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nl.sort()\r\nd = w\r\nfor i in range(n):\r\n d= min(d,l[i])\r\n\r\nm = w\r\nfor i in range(n,2*n):\r\n m = min (m, l[i])\r\n\r\nxd = min ( d, w/(3*n))\r\nxm = min ( m, 2*w/(3*n))\r\n\r\nx = min (xd, xm/2)\r\n\r\nx = 3*x*n\r\n\r\nprint (x)", "def good(mid,w,girls,boys):\r\n for i in range(len(girls)):\r\n if girls[i]<mid:\r\n return False\r\n for i in range(len(boys)):\r\n if boys[i]<2*mid:\r\n return False\r\n return True\r\nn,w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\ngirls=[]\r\nboys=[]\r\nfor i in range(0,n):\r\n girls.append(a[i])\r\nfor i in range(n,len(a)):\r\n boys.append(a[i])\r\nl=0\r\nr=w\r\nans=0\r\nfor i in range(65):\r\n mid=(l+r)/2\r\n if good(mid,w,girls,boys)==True:\r\n l=mid\r\n ans=mid\r\n else:\r\n r=mid\r\nfans=0\r\nfor i in range(0,len(girls)):\r\n fans+=ans\r\nfor i in range(0,len(boys)):\r\n fans+=(ans*2)\r\nprint(min(fans,w))", "l = [int(x) for x in input().split(' ')]\r\nn, w = l[:]\r\n\r\nl = [int(x) for x in input().split(' ')]\r\n\r\nl.sort()\r\n\r\ngirls = l[:n]\r\nboys = l[n:]\r\n\r\nmg = girls[0]\r\nmb = boys[0]\r\n\r\nq1 = w / (3 * n)\r\nq2 = mb / 2\r\nq3 = mg\r\n\r\nx = min(q1, min(q2, q3))\r\n\r\nprint(x * 3 * n)", "def read_data():\r\n n, w = map(int, input().split())\r\n As = list(map(int, input().split()))\r\n return n, w, As\r\n\r\ndef solve(n, w, As):\r\n As.sort()\r\n cap_girls = As[0]\r\n cap_boys = As[n]\r\n if cap_girls * 2 < cap_boys:\r\n return min(cap_girls * 3 * n, w)\r\n else:\r\n return min(cap_boys * 1.5 * n, w)\r\n\r\nn, w, As = read_data()\r\nprint(solve(n, w, As))", "p=input().split()\r\nn=int(p[0])\r\nw=int(p[1])\r\nq=input().split()\r\na=[]\r\ns=0\r\nfor i in range(2*n):\r\n a.append(int(q[i]))\r\na.sort()\r\nif a[n]>=2*a[0]:\r\n s=n*a[0]+n*2*a[0]\r\nelse:\r\n s=n*a[n]+n*(a[n]/2)\r\nif s>w:\r\n print(w)\r\nelse:\r\n print(s)\r\n", "#Pasha and Tea\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif 2 * a[0] <= a[n]:\r\n ans = 3 * n * a[0]\r\nelif 2 * a[0] > a[n]:\r\n ans = 3 / 2 * n * a[n]\r\n\r\nprint(min(ans, w))", "n,w = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nmaxx = min(a[0]*3,a[n]*1.5)*n\r\nprint(min(maxx,w))", "n, w = map(int, input().split())\r\nn *= 2\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ng = arr[:n // 2]\r\nb = arr[n // 2:]\r\nfirst_g = g[0]\r\nfirst_b = b[0]\r\nif first_g * 2 > first_b:\r\n first_g = first_b / 2\r\nelif first_g * 2 < first_b:\r\n first_b = first_g * 2\r\nans = first_g * n / 2 + first_b * n / 2\r\nprint(min(ans, w))", "def calculate_sum_tea(n, w, arr):\r\n sorted_arr = sorted(arr)\r\n min_cup_size_g = sorted_arr[0]\r\n min_cup_size_b = sorted_arr[n]\r\n\r\n if min_cup_size_b / 2 > min_cup_size_g:\r\n min_cup_size_b = 2 * min_cup_size_g\r\n elif min_cup_size_b / 2 < min_cup_size_g:\r\n min_cup_size_g = min_cup_size_b / 2\r\n\r\n max_tea_each_girl = w/(3*n)\r\n\r\n if max_tea_each_girl > min_cup_size_g:\r\n max_tea_each_girl = min_cup_size_g\r\n\r\n sum_tea = max_tea_each_girl * 3 * n\r\n print(sum_tea)\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\ncalculate_sum_tea(first_line_input[0], first_line_input[1], A)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nres = 0\r\nposi = a[n] / a[0]\r\nif posi >= 2:\r\n x = a[0]\r\n res = n*x*2 + n*x\r\nelse:\r\n x = a[n]\r\n res = n*x + (n*x)/2\r\nif res > w:\r\n res = w\r\n\r\nprint(res)\r\n", "#557B\n\na = list(map(int, input().split(\" \")))\nn = a[0]\nw = a[1]\n\na = list(map(int, input().split(\" \")))\nteacups = sorted(a)\n\ngirls = teacups[:n]\nboys = teacups[n:]\n\nmingirls = min(girls)\nminboys = min(boys)\n\nif 2 * mingirls < minboys:\n\ttotalmin = mingirls\nelse:\n\ttotalmin = minboys / 2\n\n\nif 3 * n * totalmin <= w:\n\tprint(3 * n * totalmin)\nelse:\n\tprint(w)", "from math import ceil\r\nx = [int(i) for i in list(input().split(\" \"))]\r\ny = [int(i) for i in list(input().split(\" \"))]\r\ny = sorted(y)\r\nmax = y[x[0]]\r\nmin = y[0]\r\nif (max>=2*min):\r\n max = 2*min\r\nelse:\r\n min = max/2\r\ng = min*3*x[0]\r\nif g < x[1]:\r\n if g == ceil(g):\r\n print(ceil(g))\r\n else:\r\n print(g)\r\nelse:\r\n print(x[1])\r\n", "inp = lambda : map(int, input().split())\r\nn, w = inp()\r\na = sorted([*inp()])\r\nprint(min(w, min(a[n] / 2, a[0]) * n * 3))\r\n", "n, w = map(int, input().split(' ')[0:2])\na = list(map(int, input().split(' ')[0:2*n]))\na.sort()\n\nx = min(2*a[0], a[n]) / float(2)\nx = min(x, w / float(3*n))\n\nprint(x * 3 * n)\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nif a[0]>= a[n]/2:\r\n\tm= (a[n]*n+ a[n]*n/2)\r\nelse:\r\n\tm= (a[0]*n + a[0]*n*2)\r\n\r\nif m > w:\r\n\tprint(w)\r\nelse:\r\n\tprint(m)", "tmp=input().split()\nn=int(tmp[0])\nw=int(tmp[1])\narr=[]\ntmp=input().split()\nfor i in tmp:\n\tarr.append(int(i))\narr.sort()\nif(arr[n]/2<=arr[0] and (arr[n]/2)*3*n<=w):\n\tprint(\"%.7f\"%((arr[n]/2)*3*n))\nelse:\n\tif(arr[0]*3*n<=w):\n\t\tprint(\"%.7f\"%(arr[0]*3*n))\n\telse:\n\t\tprint(w)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\n\r\nG = a[-1]\r\nB = a[n-1]\r\n\r\n# x = min(G, B/2)\r\n# print(min(w, 3 * x * n))\r\n\r\nif B >= 2 * G:\r\n print(min(w, 3 * G * n))\r\nelse:\r\n G = B/2\r\n print(min(w, 3 * G * n))", "n, cap = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\ng, b = a[0], a[n]\r\nleft, right = 0, g\r\nfor _ in range(70):\r\n mid = (left + right) / 2\r\n if mid * 2 <= b:\r\n left = mid\r\n else:\r\n right = mid\r\nleft, right = 0, left\r\nfor _ in range(70):\r\n mid = (left + right) / 2\r\n if mid * n + mid * 2 * n <= cap:\r\n left = mid\r\n else:\r\n right = mid\r\nprint(left * n + left * 2 * n)", "n,w=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nl=len(a)\r\ni,j=0,int(l/2)\r\nif a[i]*2<=a[j] and a[j]/2.0<=a[i]:\r\n ans=max(a[i],a[j]/2.0)\r\nelif a[i]*2<=a[j]:\r\n ans=a[i]\r\nelif a[j]/2.0<=a[i]:\r\n ans=a[j]/2\r\nprint (min(ans*3*n,w))", "n, w = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\na.sort()\r\nb = a[n]\r\ng = a[0]\r\n\r\nres = g * n * 3\r\nif res > b / 2 * n * 3:\r\n\tres = b / 2 * n * 3\r\n\r\nif res > w:\r\n\tres = w\r\nprint(res)", "########## Sửa Bài ############\r\nn,w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nx = float(min(a[0],a[n] / 2))\r\n\r\nsum = 3*x*n\r\n\r\nprint('{0:.7f}'.format(min(sum,w)))\r\n", "n, w = [int(_) for _ in input().split()]\r\na = list(int(_) for _ in input().split())\r\na.sort()\r\nx = min(a[0],a[n]/2)\r\nprint(min(3*x*n,w))\r\n", "class CodeforcesTask557BSolution:\n def __init__(self):\n self.result = ''\n self.n_w = []\n self.cups = []\n\n def read_input(self):\n self.n_w = [int(x) for x in input().split(\" \")]\n self.cups = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n self.cups.sort()\n max_per_g = (self.n_w[1] / 3) / self.n_w[0]\n real_per_g = min(self.cups[0], max_per_g)\n max_per_b = max_per_g * 2\n real_per_b = min(2 * real_per_g, self.cups[self.n_w[0]])\n ammount = 1.5 * self.n_w[0] * real_per_b\n self.result = str(ammount)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask557BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# http://codeforces.com/problemset/problem/557/B\r\n\r\nboy_count, amount_of_tea = map(int, input().split())\r\ncups = map(int, input().split())\r\n\r\ncups = sorted(cups)\r\nsmallest_cup_girl = cups[0]\r\nsmallest_cup_boy = cups[boy_count]\r\n\r\ntea_unit_needed = boy_count * 3\r\n\r\nmin_amount = min(float(smallest_cup_girl), smallest_cup_boy / 2)\r\ntotal = min_amount * tea_unit_needed\r\n\r\nif amount_of_tea < total:\r\n min_amount = amount_of_tea / tea_unit_needed\r\n\r\ntotal = min_amount * tea_unit_needed\r\n\r\nwhile total > amount_of_tea:\r\n total = min_amount * tea_unit_needed\r\n temp = total - amount_of_tea\r\n min_amount -= temp\r\n\r\nprint(total)\r\n\r\n", "n,w=input().split()\r\nn=int(n)\r\nw=int(w)\r\na=[0]*(2*n)\r\na=input().split()\r\nfor i in range (2*n):\r\n a[i]=int(a[i])\r\na.sort()\r\nprint(min(a[0],a[n]/2,w/3/n)*3*n)", "n,w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nprint(min(a[0],a[n]/2,w/3/n)*3*n)", "n, w = [int(x) for x in input().split(\" \")] \nL = [int(x) for x in input().split(\" \")] \nL.sort() \nx = L[0] \ny = L[n] \nif 2 * x > y :\n t = y/2 \nelse : \n t = x \nt = t * 3 * n \nif t > w : \n t = w \nprint(t)\n", "n, w = map(int ,input().split())\r\nread = list(map(int, input().split()))\r\nread.sort(reverse = True)\r\nc = min(read[-1], read[n - 1]/2)\r\n \r\nprint(min(w, c * 3 * n))", "n, w = map(int, input().split())\r\na = sorted(map(float, input().split()))\r\nprint(min(a[0], a[n]/2, w/3/n)*3*n)\r\n", "def main():\r\n n, w = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n a = sorted(a)\r\n x = w / (3*n)\r\n if (x <= a[0] and 2*x <= a[n]):\r\n print(w)\r\n else:\r\n print(3*min(a[0], a[n]/2)*n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l2 = input().split()\r\nn = int(l2[0])\r\nw = int(l2[1])\r\nl = map(int, input().split())\r\nl = sorted(l, reverse=True)\r\nminB = 2000000000\r\nminG = 2000000000\r\n\r\nfor i in range(n):\r\n minB = min(minB, l[i])\r\n minG = min(minB, l[i+n])\r\n\r\nx = min(minB/2, minG)\r\nprint(min(w,n*x*3))\r\n", "s=list(map(int,input().split(' ')))\r\nn=s[0]\r\nw=s[1]\r\ns=list(map(int,input().split(' ')))\r\ns.sort()\r\nc1=s[0]\r\nc2=s[n]\r\ntmp=round(w/(n*3),6)\r\nif(c2/2>c1):\r\n if(tmp>c1):\r\n print(c1*3*n)\r\n else:\r\n print(w)\r\nelse:\r\n if(tmp>c2/2):\r\n print(3*n*c2/2)\r\n else:\r\n print(w)", "n, w = [int(i) for i in input().split()]\na = sorted([int(i) for i in input().split()])\nif a[0] > (w/3)/n and a[n] > 2*(w/3)/n:\n print(w)\nelse:\n print(min(a[n]/2, a[0])*3*n)\n", "from sys import stdin\r\nfrom sys import exit\r\n\r\nlive = True\r\nif not live: stdin = open('data.in', 'r')\r\n\r\nn, w = list(map(int, stdin.readline().strip().split()))\r\ncups = list(map(int, stdin.readline().strip().split()))\r\n\r\nmaxx = w / (3 * n)\r\ncups = sorted(cups, reverse = True)\r\nfor it in range(n):\r\n\tmaxx = min(maxx, cups[it] / 2)\r\nfor it in range(n, 2 * n):\r\n\tmaxx = min(maxx, cups[it])\r\n\t\r\nprint(3 * n * maxx)\r\n\r\nif not live: stdin.close()", "n, w=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nz=min(a[0],a[n]/2,w/(3*n))\r\nprint(z*3*n)\r\n\r\n", "n, w = [int(i) for i in input().split()]\r\ncapacity = [int(i) for i in input().split()]\r\n\r\ncapacity.sort(reverse=True)\r\nresult = min(capacity[(2*n) - 1] * 3 * n, capacity[n-1] * 3 / 2 * n, w)\r\n\r\nprint(result)", "def div_tea():\n n_k = input().split()\n n = int(n_k[0])\n k = int(n_k[1])\n\n arr_str = input().split()\n arr = [int(i) for i in arr_str]\n\n arr = sorted(arr)\n\n water = arr[0] if arr[0] * 2 < arr[n] else arr[n]/2\n return water * 3 * n if water * 3 * n < k else k\n\n\nres = div_tea()\nprint(res)", "n, w = map(int, input().split())\ncups = [ int(cup) for cup in input().split() ]\n\ncups.sort()\n\ngirl_cup = cups[0]\nboy_cup = -1\n\nfor i in range(1, n+1):\n boy_cup = cups[i]\n if boy_cup >= girl_cup*2:\n break\n\n#print(\"boy cup\", boy_cup, \"/\", \"girl cup\", girl_cup)\n\nif boy_cup < girl_cup*2:\n result = (boy_cup + boy_cup/2)*n\nelif boy_cup > girl_cup*2:\n result = ( girl_cup*2 + girl_cup)*n\nelse:\n result = (boy_cup + girl_cup)*n\n\nif result <= int(result):\n result = int(result)\n\nif result > w:\n result = w\n\nprint(result)", "n,w = map(int,input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif 2*a[0] <= a[n]:\r\n p = a[0]\r\nelse:\r\n p = a[n]/2\r\n\r\nif 3*n*p <= w:\r\n result = 3*n*p\r\nelse:\r\n result = w\r\n# print (p)\r\n# print (a)\r\nprint (result)", "nm = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\narr.sort()\nprint(min(nm[1]/1, 3*nm[0]*(min(arr[0]/1, arr[nm[0]]/2))))\n \t\t\t \t \t\t\t\t\t\t\t\t \t\t\t \t\t\t\t\t\t", "n,w=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\na1=a[0]\r\nif a[0]*2>a[n]:a1=a[n]/2\r\n\r\nif 2*a1*n+a1*n<w:\r\n print(2*a1*n+a1*n)\r\nelse:\r\n print(w)\r\n", "# nhap du lieu vao\n# sap xep mang a theo thu tu tang dan, tim x la so mili... cua moi tach cua girl\n# x = min cua vi tri a[0] va vi tri a[n]/2\n# tao bien ans = 3*x*n\n# roi so sanh vs w, lay gia tri nho hon\nn, w = map(int, input().split())\na = list(map(int,input().split()))\na.sort()\nx = min(a[0],a[n]/2)\nans = 3*x*n\nans = min(ans,w)\nprint(ans)\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nx = min(a[0], a[n] / 2)\r\nres = min(3* x * n, w)\r\n\r\nprint(res)\r\n", "I=lambda:map(int,input().split())\r\nn,w=I()\r\na=sorted(I())\r\nt=min(a[0]*2,a[n])\r\nprint(min(t*n*3/2,w))", "def max_water(friends, w, cups):\r\n #find x : x + 2x =\r\n heso1 = w/(3*friends)\r\n cups.sort()\r\n heso2_girl = cups[0] # min of cups girl\r\n heso3_boy = cups[friends]/2#min of cups boy\r\n # print(heso1,heso2_girl,heso3_boy)\r\n min_water = min(heso1,heso2_girl,heso3_boy )\r\n return min_water*3*friends\r\n\r\n\r\n\r\n#input\r\nfriends, w = list(map(int, input().split()))\r\ncups = list(map(int, input().split()))\r\nprint(max_water(friends, w, cups))\r\n", "n, w = map(int, input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nt = min(a[0],a[n]/2)\r\nans = min(3*t*n,w)\r\nprint(ans)\r\n", "def sinput():\n s = input().split()\n return int(s[0]), int(s[1])\n\nn, w = sinput()\n\ns = input().split()\n\ns = [int(i) for i in s]\n\ns.sort()\n\n\n\nprint(min(s[0] *3*n, s[n] *3/2*n, w))\n \n", "n,w=map(int,input().split())\r\nls=[int(a) for a in input().split()]\r\nls.sort()\r\nmn=min(ls[0],ls[n]/2)\r\nprint(min(mn*n*3,w))\r\n\r\n\r\n\r\n\r\n" ]

{"inputs": ["2 4\n1 1 1 1", "3 18\n4 4 4 2 2 2", "1 5\n2 3", "1 1\n1000000000 1000000000", "4 1000000000\n1 1 1 1 1 1 1 1", "4 1000000000\n1 1 1 1 2 2 2 2", "4 1\n3 3 3 3 4 4 4 4", "2 19\n3 3 5 5", "3 31\n3 3 3 5 5 5", "5 15\n2 3 4 1 2 4 5 3 5 10", "5 14\n2 3 4 1 2 4 5 3 5 10", "5 16\n2 3 4 1 2 4 5 3 5 10", "1 100\n1 200", "1 1\n1 1", "2 1000000000\n1 1 1 100", "4 30\n3 3 3 3 4 5 6 7", "2 100\n1 1 1 10", "3 18\n1 1 1 1 1 5"], "outputs": ["3.0000000000", "18.0000000000", "4.5000000000", "1.0000000000", "6.0000000000", "12.0000000000", "1.0000000000", "15.0000000000", "22.5000000000", "15.0000000000", "14.0000000000", "15.0000000000", "3.0000000000", "1.0000000000", "3.0000000000", "24.0000000000", "3.0000000000", "4.5000000000"]}

UNKNOWN

PYTHON3

CODEFORCES

183

d607231391bb9d0f6146c5ed8354c0e9

Logical Expression

You are given a boolean function of three variables which is defined by its truth table. You need to find an expression of minimum length that equals to this function. The expression may consist of: - Operation AND ('&', ASCII code 38) - Operation OR ('|', ASCII code 124) - Operation NOT ('!', ASCII code 33) - Variables x, y and z (ASCII codes 120-122) - Parentheses ('(', ASCII code 40, and ')', ASCII code 41) If more than one expression of minimum length exists, you should find the lexicographically smallest one. Operations have standard priority. NOT has the highest priority, then AND goes, and OR has the lowest priority. The expression should satisfy the following grammar: E ::= E '|' T | T T ::= T '&' F | F F ::= '!' F | '(' E ')' | 'x' | 'y' | 'z' The first line contains one integer *n* — the number of functions in the input (1<=≤<=*n*<=≤<=10<=000). The following *n* lines contain descriptions of functions, the *i*-th of them contains a string of length 8 that consists of digits 0 and 1 — the truth table of the *i*-th function. The digit on position *j* (0<=≤<=*j*<=<<=8) equals to the value of the function in case of , and . You should output *n* lines, the *i*-th line should contain the expression of minimum length which equals to the *i*-th function. If there is more than one such expression, output the lexicographically smallest of them. Expressions should satisfy the given grammar and shouldn't contain white spaces. Sample Input 4 00110011 00000111 11110000 00011111 Sample Output y (y|z)&x !x x|y&z

[ "import zlib, base64\nexec(zlib.decompress(base64.b64decode(b'eJyFV8lu2zAQPTdfIenAUGhR9FygXxLk4MJu4SJwAscJSIEfX4nLzHtDpT0kGM6+j3w83IYfw8M0BhemL8M0+pBiWuYMBzdGtwjYgMUpWGRWtnFJq6Srkh7g4JqSjW9Jm3wKjdYohIzALkivfuX/m02nYBUJ2ZNVLjZPAM5hrFTR5BFGasLg/RbOvPniIsSU0AXAtMgMnanRShPVFx+QA+jRad5CyWhoMUbIqCBL0RII5jSZd+Fg+sLB7dpNWOItRcaFNKqVyFpKgdkR9ELB2PpzhIJGt1amli/aSDlOQ1W5ymHiJFsYYHCkD0VZsMSmDSMl1XpmYM2R9HtTwgOYgCe3KLwXmJUdMRaiID+w28WKfGVICbfyzMaHNKq36IWCC+Qp7gTLoVYRL+28GH6Pjb7JmDjJ1l6AsDu2CGFzJR5RM58wnDCZ/8it9nlXgzYrihNlNr2dFmUoamj1pv961Y93meJ9B62u0gF2rkXzB3qlJziEzfWuYFHWPJQLSrNZExXlgesBaI1S7dDm4v6AYYZkwNRD40AGaBck3vYLibQi4e7Mpzdhf7YtAgh+loaltc0HVw5zYkuEsS7ggJBtuAiJjOrDswaBanOqF9E6C7ebnO0wdKn5+BjM3k1HOl5245pj1yknlqH5iOnZ4TG5pSsPGSN7oesOHf3AbWGaglqiO/MpdM2Q3zUjZBNwYFBD7Q46XvMWlWxICAFca8Mq7x2nQwpdqS0Pa6nXHaxAQUZTtby1qnH+YLH6sFyySaV6qRYumsLpNS4dRyPdzjkSFitEDDDFtXB6irVwggtgVE55RYBFZW4rWm62iMd91wK4JjOL11vfO9LMUS85aODCdWuK7Mu3g7BkuNqOLKSfJwXMY8k/hxLiokkkR2bGIdiZtTWOCWVgH+1NYMPDXMl+q8siUffUp05hY4Q6alBt8DSSVi3jvlzTAppNKU8dpwppDSokDq2uhenx7tfzdTgP58twPVx+n/z5clv/Xt5ufp7n73efXq4b5ni4PZzeD09++vZzGj4P9/df/zyfL/7p/Hrz19P76fp6OqrcPD/Od38BvToehw==')))\n \t\t\t \t \t \t \t \t\t \t \t\t\t \t" ]

{"inputs": ["4\n00110011\n00000111\n11110000\n00011111", "1\n11001110", "2\n11001110\n01001001", "3\n10001001\n10111011\n10111101", "4\n11000010\n11000010\n11001110\n10001001", "5\n01111000\n00110110\n00011100\n01110111\n01010011"], "outputs": ["y\n(y|z)&x\n!x\nx|y&z", "!y|!z&x", "!y|!z&x\n!(!x&!z|x&z|y)|x&y&z", "!y&!z|x&y&z\n!z|y\n!x&!z|!y&x|y&z", "!x&!y|!z&x&y\n!x&!y|!z&x&y\n!y|!z&x\n!y&!z|x&y&z", "!x&(y|z)|!y&!z&x\n!(x&z)&y|!y&x&z\n!x&y&z|!y&x\ny|z\n!x&z|x&y"]}

UNKNOWN

PYTHON3

CODEFORCES

1

d6120d945ca2dd06ce7ce99e1cd247bb

Door Frames

Petya has equal wooden bars of length *n*. He wants to make a frame for two equal doors. Each frame has two vertical (left and right) sides of length *a* and one top side of length *b*. A solid (i.e. continuous without breaks) piece of bar is needed for each side. Determine a minimal number of wooden bars which are needed to make the frames for two doors. Petya can cut the wooden bars into any parts, but each side of each door should be a solid piece of a wooden bar (or a whole wooden bar). The first line contains a single integer *n* (1<=≤<=*n*<=≤<=1<=000) — the length of each wooden bar. The second line contains a single integer *a* (1<=≤<=*a*<=≤<=*n*) — the length of the vertical (left and right) sides of a door frame. The third line contains a single integer *b* (1<=≤<=*b*<=≤<=*n*) — the length of the upper side of a door frame. Print the minimal number of wooden bars with length *n* which are needed to make the frames for two doors. Sample Input 8 1 2 5 3 4 6 4 2 20 5 6 Sample Output 1 6 4 2

[ "import math\n\n[n,a,b],r,i,j=[int(input())for x in range(3)],6,4,5\n\nwhile i>=0:\n\n\tl,c,o=[b if x in[i,j]else a for x in range(6)],0,n\n\n\tfor k in l:\n\n\t\tif o<k:\n\n\t\t\to,c=n-k,c+1\n\n\t\telse:o-=k\n\n\tr=min(r,c if o==n else c+1)\n\n\tj-=1\n\n\tif i==j:i,j=i-1,5\n\nprint(r)\n\n\n\n# Made By Mostafa_Khaled", "bar = int(input())\r\nside = int(input())\r\ntop = int(input())\r\n\r\n\r\ncurrent_bar = bar\r\nnum_bars = 1\r\ndim = [side] * 4 + [top] * 2\r\ndim.sort()\r\nwhile dim != []:\r\n #print (current_bar)\r\n if current_bar < min(dim):\r\n current_bar = bar\r\n num_bars += 1\r\n \r\n if current_bar >= dim[-1]:\r\n current_bar -= dim.pop()\r\n \r\n if dim != [] and current_bar >= dim[0]:\r\n current_bar -= dim.pop(0)\r\n\r\nprint (num_bars)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nsequences = list()\r\nbar_len = (a, b)\r\n\r\nfor i in range(2 ** 6):\r\n seq = list()\r\n\r\n for j in range(6):\r\n seq.append((i & 2 ** j) >> j)\r\n\r\n if sum(seq) == 2:\r\n sequences.append(seq)\r\n\r\n\r\nmin_count = 10000\r\nfor seq in sequences:\r\n bar = n\r\n count = 1\r\n idx = 0\r\n\r\n for i in seq:\r\n if bar > bar_len[i]:\r\n bar -= bar_len[i]\r\n elif bar == bar_len[i]:\r\n if idx < len(seq) - 1:\r\n count += 1\r\n bar = n\r\n else:\r\n count += 1\r\n bar = n - bar_len[i]\r\n idx += 1\r\n if count < min_count:\r\n min_count = count\r\n\r\nprint(min_count)\r\n", "m=int(input())\na=int(input())\nb=int(input())\nc=1\nn=m\nca=0\ncb=0\nif(a*2+b == m):\n\tprint(2)\n\texit()\nwhile (ca+cb<=6):\n\tif(a<=n and n<b and ca<4):\n\t\tca=ca+1\n\t\tn=n-a\n\tif(b<=n and n<a and cb<2):\n\t\tcb=cb+1\n\t\tn=n-b\n\tif(a<=n and b<=n and ca<4):\n\t\tca=ca+1\n\t\tn=n-a\n\tif(a<=n and b<=n and cb<2):\n\t\tcb=cb+1\n\t\tn=n-b\n\tif(ca==4 and cb==2):\n\t\tbreak\n\tif(n<a and n<b):\n\t\tn=m\n\t\tc=c+1\n\tif(n<a and b<=n and cb==2):\n\t\tn=m\n\t\tc=c+1\n\tif(n0:\r\n resa = len-min(int(len/a),na)*a\r\n resb = len-min(int(len/b),nb)*b\r\n if resa<resb and na>0 and len>=a:\r\n len-=a\r\n na-=1\r\n elif nb>0 and len>=b:\r\n len-=b\r\n nb-=1\r\n else:\r\n break\r\n if na==nb==0:\r\n break\r\nprint(cnt)\r\n", "x=int(input())\r\na=int(input())\r\nb=int(input())\r\nans=6\r\nif a+b>x and 2*b<=x and 2*a>x:\r\n ans=5\r\nif (a+b<=x and 2*a>=x) or (2*b>x and 2*a<=x):\r\n ans=4\r\nif (2*a<=x and 2*b<=x) or (4*a<=x and 2*b>x) or (2*a<=x and a+b<=x):\r\n ans=3\r\nif 2*a+b<=x:\r\n ans=2\r\nif 4*a +2*b<=x:\r\n ans=1\r\nprint(ans)", "dog, cot, b = [int(input()) for _ in range(3)]\nd = [0]\nhy = 0\n \nfor i in (cot, b, cot, cot, b, cot):\n if max(d) >= i:\n d[d.index(max(d))] -= i\n else:\n hy += 1\n d += [dog- i]\n \nprint(hy)\n\n \t\t \t \t\t\t\t \t \t\t\t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a1, a2, a3, a4, a5):\r\n global c\r\n for i in range(1, a3):\r\n x = a1 * i\r\n if x > n:\r\n break\r\n y = (n - x) // a2\r\n t = a4 // i + (a4 % i != 0)\r\n z = t * y\r\n t1 = 0\r\n while z < a5:\r\n z += n // a2\r\n t1 += 1\r\n c = min(c, t + t1)\r\n\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = 1 << 30\r\nf(a, b, 5, 4, 2)\r\nf(b, a, 3, 2, 4)\r\nprint(c)", "'''input\n5\n3\n4\n'''\nfrom sys import stdin, stdout\nimport math\n\ndef brute(n, bar, a, b, a_count, b_count):\n\tfirst = float('inf'); second = float('inf'); third = float('inf'); fourth = float('inf')\n\tif a_count == 4 and b_count == 2:\n\t\treturn 1\n\tif bar >= a and a_count < 4:\n\t\tfirst = brute(n, bar - a, a, b, a_count + 1, b_count)\n\tif bar >= b and b_count < 4:\n\t\tsecond = brute(n, bar - b, a, b, a_count, b_count + 1)\n\tif bar < a and a_count < 4:\n\t\tthird = 1 + brute(n, n, a, b, a_count, b_count)\n\tif bar < b and b_count < 2:\n\t\tfourth = 1 + brute(n, n, a, b, a_count, b_count)\n\treturn min(first, second, third, fourth)\n# main starts\nn = int(stdin.readline().strip())\na = int(stdin.readline().strip())\nb = int(stdin.readline().strip())\na_count = 0; b_count = 0\nprint(brute(n, n, a, b, a_count, b_count))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 30 12:11:39 2017\r\n\r\n@author: vishal\r\n\"\"\"\r\n\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\nif(4*a+2*b<=n):\r\n print(1)\r\nelif(2*a+b<=n or a+2*b<=n and 3*a<=n):\r\n print(2)\r\nelif(a+b<=n and 2*a<=n or 2*b<=n and 2*a<=n or 4*a<=n):\r\n print(3)\r\nelif(2*a<=n or a+b<=n):\r\n print(4)\r\nelif(2*b<=n):\r\n print(5)\r\nelse:\r\n print(6)", "n, a, b = [int(input()) for _ in range(3)]\r\nd = [0]\r\nc = 0\r\n\r\nfor i in (a, b, a, a, b, a):\r\n if max(d) >= i:\r\n d[d.index(max(d))] -= i\r\n else:\r\n c += 1\r\n d += [n - i]\r\n\r\nprint(c)\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nli = [[a,4],[b,2]]\r\nans = 0\r\n\r\nwhile True:\r\n now = 0\r\n count = [-1,-1]\r\n \r\n for i in range(li[0][1]+1):\r\n for j in range(li[1][1]+1):\r\n s = a*i+b*j\r\n if s <= n and now < s:\r\n now = s\r\n count = [i,j]\r\n li[0][1] -= count[0]\r\n li[1][1] -= count[1]\r\n if li[0][1] == 0 and li[1][1] == 0:\r\n print(ans+1)\r\n break\r\n else:\r\n ans += 1", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nans = 6\r\n\r\ncur, cnt = 0, 0\r\ncur = 2\r\ncnt += 2 * ((n - b) // a)\r\nwhile cnt < 4:\r\n cur += 1\r\n cnt += (n // a)\r\nans = min(ans, cur)\r\n\r\nif b * 2 <= n:\r\n cur, cnt = 0, 0\r\n cur = 1\r\n cnt += ((n - 2 * b) // a)\r\n while cnt < 4:\r\n cur += 1\r\n cnt += (n // a)\r\n ans = min(ans, cur)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nans = 1\r\nrem = n\r\nsides = 6\r\n\r\nif (((a+a) + b) * 2) <= n:\r\n print(1)\r\nelse:\r\n if (a*2+b) <= n or ((a*4) <= n and (b*2) <= n):\r\n print(2)\r\n elif (a*4 <= n and b <= n) or (b*2 <= n and a*2 <= n) or (a+b <= n and a*2 <= n):\r\n print(3)\r\n elif (a*2 <= n and b <= n) or (a+b <= n and a <= n):\r\n print(4)\r\n elif b*2 <= n and a <= n:\r\n print(5)\r\n else:\r\n print(6)\r\n \r\n \r\n \r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\ncnt=0\r\nl=0\r\nal=4\r\nbl=2\r\n\r\ncnt+=1\r\nl=n\r\n\r\nwhile al or bl:\r\n if al>bl:\r\n if l-a>=0 and al:\r\n al-=1\r\n l-=a\r\n continue\r\n elif l-b>=0 and bl:\r\n bl-=1\r\n l-=b\r\n continue\r\n else:\r\n l=n\r\n cnt+=1\r\n continue\r\n else:\r\n if l-b>=0 and bl:\r\n bl-=1\r\n l-=b\r\n continue\r\n elif l-a>=0 and al:\r\n al-=1\r\n l-=a\r\n continue\r\n else:\r\n l=n\r\n cnt+=1\r\n continue\r\n\r\nprint(cnt)\r\n", "N,a,b=int(input()),int(input()),int(input())\r\nqueue=[(N,1,4,2)]\r\nres=10000\r\nwhile queue:\r\n n,amount,x,y=queue.pop()\r\n if x==0 and y==0:res=min(res,amount);continue\r\n if x>0:\r\n if n>=a:queue.append((n-a,amount,x-1,y))\r\n else:queue.append((N-a,amount+1,x-1,y))\r\n if y>0:\r\n if n>=b:queue.append((n-b,amount,x,y-1))\r\n else:queue.append((N-b,amount+1,x,y-1))\r\nprint(res)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nif a!=b:\r\n m=[[a],[b]]\r\n while len(m[0])<6:\r\n p=m.pop(0)\r\n m.append(p+[a])\r\n m.append(p+[b])\r\n i=0\r\n while i < len(m):\r\n if m[i].count(b)!=2:\r\n m.pop(i)\r\n else:\r\n i+=1\r\nelse:\r\n m=[[a]*6]\r\nd=6\r\nfor p in m:\r\n k=1\r\n x=n\r\n for t in p:\r\n x-=t\r\n if x<0:\r\n k+=1\r\n x=n-t\r\n d=min(d,k)\r\nprint(d)", "kio, cat, b = [int(input()) for _ in range(3)]\nd = [0]\nhy = 0\n \nfor i in (cat, b, cat, cat, b, cat):\n if max(d) >= i:\n d[d.index(max(d))] -= i\n else:\n hy += 1\n d += [kio - i]\n \nprint(hy)\n\n \t\t \t\t \t\t\t \t\t \t\t\t \t\t \t\t \t\t", "n = (int)(input())\r\na = (int)(input())\r\nb = (int)(input())\r\ncntA = 4; cntB = 2; ans = 0; ost = 0\r\nwhile (cntA > 0) or (cntB > 0):\r\n\tans = ans + 1\r\n\tost = n\r\n\tmyA = 0; myB = 0; minOst = n\r\n\tfor i in range(0, cntA + 1):\r\n\t\tfor j in range(0, cntB + 1):\r\n\t\t\tif (a * i + b * j <= ost) and (ost - a * i - b * j < minOst):\r\n\t\t\t\tmyA = i\r\n\t\t\t\tmyB = j\r\n\t\t\t\tminOst = ost - a * i - b * j\r\n\tcntA = cntA - myA\r\n\tcntB = cntB - myB\r\nprint(ans)", "from itertools import permutations\nn = int(input())\na = int(input())\nb = int(input())\n\nres = 10 ** 10\nfor sides in permutations([a] * 4 + [b] * 2):\n curRes = 0\n rest = 0\n for side in sides:\n if side > rest:\n rest = n\n curRes += 1\n rest -= side\n res = min(res, curRes)\n\nprint(res)\n", "'''input\r\n6\r\n4\r\n2\r\n'''\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\ndef f(n,a,b,left,cnta = 4,cntb = 2):\r\n\tif(cnta == 0 and cntb == 0): return 0\r\n\tif(cnta < 0 or cntb < 0): return 100000000000000000000\r\n\tif a <= left and cnta and b <= left and cntb:\r\n\t\treturn min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))\r\n\tif a <= left and cnta:\r\n\t\treturn f(n,a,b,left-a,cnta-1,cntb)\r\n\tif b <= left and cntb:\r\n\t\treturn f(n,a,b,left-b,cnta,cntb-1)\r\n\treturn 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))\t\t\t\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nprint(f(n,a,b,0))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\ntemp = n\r\nres1, res2 = 1, 1\r\n\r\nfor i in range(2):\r\n if temp < a:\r\n res1 += 1\r\n temp = n\r\n temp -= a\r\n if temp < b:\r\n res1 += 1\r\n temp = n\r\n temp -= b\r\nfor i in range(2):\r\n if temp < a:\r\n res1 += 1\r\n temp = n\r\n temp -= a\r\n \r\ntemp = n\r\nfor i in range(4):\r\n if temp < a:\r\n res2 += 1\r\n temp = n\r\n temp -= a\r\nfor i in range(2):\r\n if temp < b:\r\n res2 += 1\r\n temp = n\r\n temp -= b\r\nans = min(res1, res2)\r\nprint(ans)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\ncount = 0\r\nx = 4\r\ny = 2\r\nwhile(x!=0 or y!=0):\r\n mn = n\r\n cl = ()\r\n count+=1\r\n for i in range(x+1):\r\n for j in range(y+1):\r\n s = n - (i*a+j*b)\r\n if s>=0 and s<=mn:\r\n mn = s\r\n cl = (i, j)\r\n x-=cl[0]\r\n y-=cl[1]\r\n\r\n\r\nprint(count)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nif(4*a+2*b<=n):\r\n s=1\r\nelif(2*a+b<=n):\r\n s=2\r\nelif(4*a<=n or (2*a<=n and 2*b<=n) or (2*a<=n and a+b<=n)):\r\n s=3\r\nelif(a+b<=n or 2*a<=n):\r\n s=4\r\nelif(2*b<=n):\r\n s=5\r\nelse:\r\n s=6\r\nprint(s)", "n = int(input())\na = int(input())\nb = int(input())\n\nc = 1\nrem = n \na1,b1 = 0,0\nwhile True:\n\tif rem>=a and a1<4:\n\t\trem-=a\n\t\ta1+=1\n\tif rem>=b and b1<2:\n\t\trem-=b\n\t\tb1+=1\n\tif a1==4 and b1==2:\n\t\tprint(c)\n\t\tbreak\n\tif (rem<a or a1==4) and (rem<b or b1==2):\n\t\trem = n \n\t\tc+=1\n\t\n" ]

{"inputs": ["8\n1\n2", "5\n3\n4", "6\n4\n2", "20\n5\n6", "1\n1\n1", "3\n1\n2", "3\n2\n1", "1000\n1\n1", "1000\n1000\n1000", "1000\n1\n999", "1000\n1\n498", "1000\n1\n998", "31\n5\n6", "400\n100\n2", "399\n100\n2", "800\n401\n400", "141\n26\n11", "717\n40\n489", "293\n47\n30", "165\n59\n40", "404\n5\n183", "828\n468\n726", "956\n153\n941", "676\n175\n514", "296\n1\n10", "872\n3\n182", "448\n15\n126", "24\n2\n5", "289\n56\n26", "713\n150\n591", "841\n62\n704", "266\n38\n164", "156\n34\n7", "28\n14\n9", "604\n356\n239", "180\n18\n76", "879\n545\n607", "599\n160\n520", "727\n147\n693", "151\n27\n135", "504\n71\n73", "80\n57\n31", "951\n225\n352", "823\n168\n141", "956\n582\n931", "380\n108\n356", "804\n166\n472", "228\n12\n159", "380\n126\n82", "252\n52\n178", "828\n363\n56", "404\n122\n36", "314\n4\n237", "34\n5\n17", "162\n105\n160", "586\n22\n272", "32\n9\n2", "904\n409\n228", "480\n283\n191", "56\n37\n10", "429\n223\n170", "149\n124\n129", "277\n173\n241", "701\n211\n501", "172\n144\n42", "748\n549\n256", "324\n284\n26", "900\n527\n298", "648\n624\n384", "72\n48\n54", "200\n194\n87", "624\n510\n555", "17\n16\n2", "593\n442\n112", "169\n158\n11", "41\n38\n17", "762\n609\n442", "186\n98\n104", "314\n304\n294", "35\n35\n33", "8\n3\n5", "11\n3\n5", "5\n4\n2", "41\n5\n36", "7\n4\n1", "6\n1\n4", "597\n142\n484", "6\n6\n1", "8\n4\n2", "4\n1\n4", "7\n2\n3", "100\n100\n50", "5\n1\n3", "10\n4\n6", "8\n8\n2", "5\n2\n4", "11\n5\n3", "668\n248\n336", "2\n2\n1", "465\n126\n246", "5\n1\n5", "132\n34\n64", "11\n1\n6", "8\n4\n5", "4\n2\n4", "576\n238\n350", "6\n1\n5", "5\n1\n4", "9\n2\n8", "7\n3\n4", "9\n4\n5", "10\n3\n4", "18\n5\n8", "2\n1\n1", "100\n40\n60", "6\n4\n4", "3\n1\n1", "10\n3\n7", "9\n2\n5", "6\n2\n3"], "outputs": ["1", "6", "4", "2", "6", "3", "4", "1", "6", "3", "1", "2", "2", "2", "2", "5", "1", "2", "1", "2", "1", "6", "3", "4", "1", "1", "1", "1", "1", "3", "2", "2", "1", "3", "4", "2", "6", "4", "3", "3", "1", "5", "2", "2", "6", "4", "2", "2", "2", "3", "2", "2", "2", "2", "6", "2", "2", "3", "4", "4", "4", "6", "6", "4", "5", "5", "4", "4", "6", "6", "5", "6", "5", "4", "4", "5", "6", "6", "6", "6", "3", "2", "5", "3", "4", "2", "3", "5", "3", "3", "2", "5", "2", "3", "5", "4", "3", "3", "5", "3", "3", "2", "2", "4", "4", "4", "3", "3", "3", "3", "3", "2", "2", "3", "3", "6", "2", "3", "2", "3"]}

UNKNOWN

PYTHON3

CODEFORCES

25

d62618023e53f0985f2111be3942064e

Bayan Bus

The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows. The event coordinator has a list of *k* participants who should be picked up at the airport. When a participant gets on the bus, he will sit in the last row with an empty seat. If there is more than one empty seat in that row, he will take the leftmost one. In order to keep track of the people who are on the bus, the event coordinator needs a figure showing which seats are going to be taken by *k* participants. Your task is to draw the figure representing occupied seats. The only line of input contains integer *k*, (0<=≤<=*k*<=≤<=34), denoting the number of participants. Print the figure of a bus with *k* passengers as described in sample tests. Character '#' denotes an empty seat, while 'O' denotes a taken seat. 'D' is the bus driver and other characters in the output are for the purpose of beautifying the figure. Strictly follow the sample test cases output format. Print exactly six lines. Do not output extra space or other characters. Sample Input 9 20 Sample Output +------------------------+ |O.O.O.#.#.#.#.#.#.#.#.|D|) |O.O.O.#.#.#.#.#.#.#.#.|.| |O.......................| |O.O.#.#.#.#.#.#.#.#.#.|.|) +------------------------+ +------------------------+ |O.O.O.O.O.O.O.#.#.#.#.|D|) |O.O.O.O.O.O.#.#.#.#.#.|.| |O.......................| |O.O.O.O.O.O.#.#.#.#.#.|.|) +------------------------+

[ "n = int(input())\nA = []\nA.append(list('+------------------------+'))\nA.append(list('|#.#.#.#.#.#.#.#.#.#.#.|D|)'))\nA.append(list('|#.#.#.#.#.#.#.#.#.#.#.|.|'))\nA.append(list('|#.......................|'))\nA.append(list('|#.#.#.#.#.#.#.#.#.#.#.|.|)'))\nA.append(list('+------------------------+'))\nfor k in range(n):\n\tj = i = 1\n\twhile A[i][j] != '#':\n\t\ti = 1\n\t\twhile i < 5 and A[i][j] != '#':\n\t\t\ti += 1\n\t\tif A[i][j] != '#':\n\t\t\tj += 2\n\tA[i][j] = 'O'\nfor line in A:\n\tprint(''.join(line))\n", "riders = int(input())\r\nfill = (0, 0, 0, 0)\r\nif riders == 1:\r\n fill = (1, 0, 0, 0)\r\nif riders == 2:\r\n fill = (1, 1, 0, 0)\r\nif riders == 3:\r\n fill = (1, 1, 1, 0)\r\nif riders == 4:\r\n fill = (1, 1, 1, 1)\r\nif riders >= 5:\r\n new = riders - 1\r\n even = int(new / 3)\r\n if new % 3 == 0:\r\n fill = (even, even, 1, even)\r\n elif new % 3 == 1:\r\n fill = (even + 1, even, 1, even)\r\n else:\r\n fill = (even + 1, even + 1, 1, even)\r\nprint(\"+------------------------+\")\r\nprint('|' + 'O.' * fill[0] + '#.' * (11 - fill[0]) + '|D|)')\r\nprint('|' + 'O.' * fill[1] + '#.' * (11 - fill[1]) + '|.|')\r\nprint('|' + '#' * (1 - fill[2]) + 'O' * fill[2] + '.......................|')\r\nprint('|' + 'O.' * fill[3] + '#.' * (11 - fill[3]) + '|.|)')\r\nprint(\"+------------------------+\")\r\n", "n = int(input())\n\na = [ [\"#\" for i in range(11)] for j in range(4)]\n\ni = 0\nj = 0\nwhile n > 0:\n a[j][i] = \"O\"\n if j == 3:\n i += 1\n j = 0\n else:\n j += 1\n if j == 2 and i > 0:\n j += 1\n n -= 1\nprint(\"+------------------------+\")\n\nprint(\"|\"+a[0][0]+\".\"+a[0][1]+\".\"+a[0][2]+\".\"+a[0][3]+\".\"+a[0][4]+\".\"+a[0][5]+\".\"+a[0][6]+\".\"+a[0][7]+\".\"+a[0][8]+\".\"+a[0][9]+\".\"+a[0][10]+\".|D|)\")\nprint(\"|\"+a[1][0]+\".\"+a[1][1]+\".\"+a[1][2]+\".\"+a[1][3]+\".\"+a[1][4]+\".\"+a[1][5]+\".\"+a[1][6]+\".\"+a[1][7]+\".\"+a[1][8]+\".\"+a[1][9]+\".\"+a[1][10]+\".|.|\")\nprint(\"|\"+a[2][0]+\".......................|\")\nprint(\"|\"+a[3][0]+\".\"+a[3][1]+\".\"+a[3][2]+\".\"+a[3][3]+\".\"+a[3][4]+\".\"+a[3][5]+\".\"+a[3][6]+\".\"+a[3][7]+\".\"+a[3][8]+\".\"+a[3][9]+\".\"+a[3][10]+\".|.|)\")\n\nprint(\"+------------------------+\")\n", "def imprime(onibus):\n print('+', end='')\n for i in range(24):\n print('-', end='')\n print('+')\n\n print('|', end='')\n for i in range(11):\n print(onibus[0][i], end = '.')\n\n print('|D|)')\n\n print('|', end='')\n for i in range(11):\n print(onibus[1][i], end = '.')\n\n print('|.|')\n\n print('|', end='')\n for i in range(11):\n print(onibus[2][i], end = '.')\n\n print('..|')\n\n print('|', end='')\n for i in range(11):\n print(onibus[3][i], end = '.')\n\n print('|.|)')\n\n print('+', end='')\n for i in range(24):\n print('-', end='')\n print('+')\n \ndef montaEsboco():\n fileira1 = []\n fileira2 = []\n fileira3 = []\n fileira4 = []\n for i in range(11):\n fileira1.append('#')\n fileira2.append('#')\n fileira4.append('#')\n if i == 0:\n fileira3.append('#')\n else:\n fileira3.append('.')\n\n onibus = [fileira1,fileira2,fileira3,fileira4]\n\n return onibus\n\ndef inserePassageiro(onibus, posicaoAInserir):\n onibus[posicaoAInserir[0]][posicaoAInserir[1]] = 'O'\n\ndef atualizaPosicaoAInserir(posicao):\n linha = posicao[0]\n coluna = posicao[1]\n if (linha < 3):\n linha +=1\n else:\n linha = 0\n coluna += 1\n \n if (linha == 2 and coluna >= 1):\n linha +=1\n\n return [linha, coluna]\n\ndef main():\n onibus = montaEsboco()\n qtdPassageiros = int(input())\n posicaoAInserir = [0, 0]\n \n for i in range(qtdPassageiros):\n inserePassageiro(onibus, posicaoAInserir)\n posicaoAInserir = atualizaPosicaoAInserir(posicaoAInserir)\n \n imprime(onibus)\n\nmain()", "v='''+------------------------+\r\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\r\n|#.#.#.#.#.#.#.#.#.#.#.|.|\r\n|#.......................|\r\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\r\n+------------------------+'''.split()\r\n\r\ndef sr(n):\r\n\t\"\"\"string replace\"\"\"\r\n\tw=4\r\n\ta,b=n//w,n%w\r\n\tvn=w*[a]\r\n\tfor c in range(b):\r\n\t\tvn[c]+=1\r\n\tfor c in range(1,w+1):\r\n\t\tv[c]=v[c].replace('#','O',vn[c-1])\r\n\t\r\nn=int(input())\r\nif n>5:\r\n\tn+=n//3-1\r\nsr(n)\r\nfor c in v:\r\n\tprint(c)", "k = int(input())\na = k*'O' + '#'*(34-k)\nprint(f'+------------------------+')\nprint(f'|{a[0]}.{a[4]}.{a[7]}.{a[10]}.{a[13]}.{a[16]}.{a[19]}.{a[22]}.{a[25]}.{a[28]}.{a[31]}.|D|)')\nprint(f'|{a[1]}.{a[5]}.{a[8]}.{a[11]}.{a[14]}.{a[17]}.{a[20]}.{a[23]}.{a[26]}.{a[29]}.{a[32]}.|.|')\nprint(f'|{a[2]}.......................|')\nprint(f'|{a[3]}.{a[6]}.{a[9]}.{a[12]}.{a[15]}.{a[18]}.{a[21]}.{a[24]}.{a[27]}.{a[30]}.{a[33]}.|.|)')\nprint(f'+------------------------+')\n", "from sys import stdin\r\ndef busvacio():\r\n bus=[[],[],[],[],[],[]]\r\n bus[0].append(\"+\")\r\n for x in range(24):\r\n bus[0].append(\"-\")\r\n bus[0].append(\"+\")\r\n bus[5].append(\"+\")\r\n for x in range(24):\r\n bus[5].append(\"-\")\r\n bus[5].append(\"+\")\r\n for x in range(1,5):\r\n bus[x].append(\"|\")\r\n for z in range(1,3):\r\n for x in range(11):\r\n bus[z].append(\"#\")\r\n bus[z].append(\".\")\r\n bus[1].append(\"|\")\r\n bus[1].append(\"D\")\r\n bus[1].append(\"|\")\r\n bus[1].append(\")\")\r\n for x in range(11):\r\n bus[4].append(\"#\")\r\n bus[4].append(\".\")\r\n bus[4].append(\"|\")\r\n bus[4].append(\".\")\r\n bus[4].append(\"|\")\r\n bus[4].append(\")\")\r\n bus[2].append(\"|\")\r\n bus[2].append(\".\")\r\n bus[2].append(\"|\")\r\n bus[3].append(\"#\")\r\n for x in range(23):\r\n bus[3].append(\".\")\r\n bus[3].append(\"|\")\r\n return bus\r\ndef rellenar(bus,n):\r\n if n>34:\r\n n=34\r\n while n>0:\r\n for z in range(1,22,2):\r\n \r\n for x in range(1,5):\r\n if bus[x][z]==\"#\" and n>0:\r\n bus[x][z]=\"O\"\r\n n-=1\r\n return bus\r\ndef main():\r\n \r\n n=stdin.readline().strip()\r\n while len(n) != 0:\r\n bus=busvacio()\r\n n=int(n)\r\n bus=rellenar(bus,n)\r\n for x in range(6):\r\n print(\"\".join(bus[x]))\r\n n = stdin.readline().strip()\r\nmain()\r\n", "'''\r\nCreated on Oct 6, 2014\r\n\r\n@author: nod\r\n'''\r\n\r\nk = int(input())\r\noutput = [\"+------------------------+\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|#.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\"]\r\nls = [1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,\r\n 1,2,4,]\r\nt = k\r\nif k > 2:\r\n output[3] = output[3].replace(\"#\", \"O\", 1)\r\n t = k - 1\r\nfor l in ls[:t]:\r\n output[l] = output[l].replace(\"#\", \"O\", 1)\r\nfor line in output:\r\n print(line)\r\n ", "passenger_count = int(input())\n\nreal_count = passenger_count\n\n\nif passenger_count > 2:\n passenger_count = passenger_count - 1\n\nrem_seat = passenger_count % 3\npassenger_col = int(passenger_count / 3)\nprint('+------------------------+')\n\ndef printRow(endString, rem_seat):\n row = '|'\n for i in range(11):\n if i < passenger_col:\n row = row + 'O.'\n elif i == passenger_col and rem_seat > 0:\n rem_seat = rem_seat - 1\n row = row + 'O.'\n else:\n row = row + '#.'\n row = row + endString\n print(row)\n return rem_seat\n\nrem_seat = printRow('|D|)', rem_seat)\nrem_seat = printRow('|.|', rem_seat)\n\n\nif real_count > 2:\n print('|O.......................|')\nelse:\n print('|#.......................|')\nrem_seat = printRow('|.|)', rem_seat)\nprint('+------------------------+')\n", "def main():\n\tK = int(input())\n\tbus = [list(\"+------------------------+\")\n\t\t ,list(\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\")\n\t\t ,list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|\")\n\t\t ,list(\"|#.......................|\")\n\t\t ,list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|)\")\n\t\t ,list(\"+------------------------+\")]\n\tfor i in range(K):\n\t\tif i < 4:\n\t\t\tbus[i + 1][1] = 'O'\n\t\telse:\n\t\t\tif (i-4)%3 + 1 == 3:\n\t\t\t\tbus[(i-4)%3 + 2][2*((i-4)//3) + 3] = 'O'\n\t\t\telse:\n\t\t\t\tbus[(i-4)%3 + 1][2*((i-4)//3) + 3] = 'O'\n\tfor line in bus:\n\t\tprint(\"\".join(line))\n\nmain()\n\n# 1505498089178\n", "'''\r\nCreated on Oct 5, 2014\r\n\r\n@author: Ismael\r\n'''\r\n\r\ndef printBus(lastRow,otherRows):\r\n s = \"+------------------------+\\n\"\r\n for i in range(4):\r\n s += \"|\"+lastRow[i]+\".\"\r\n for j in range(10):\r\n if(i == 2):\r\n s += \"..\"\r\n elif(i == 3):\r\n s += otherRows[j][i-1]+\".\"\r\n else:\r\n s += otherRows[j][i]+\".\"\r\n if(i == 0):\r\n s += \"|D|)\"\r\n elif(i == 1):\r\n s += \"|.|\"\r\n elif(i == 2):\r\n s += \"..|\"\r\n else:\r\n s += \"|.|)\"\r\n s += \"\\n\"\r\n s += \"+------------------------+\"\r\n print(s)\r\n\r\n\r\ndef solve(n):\r\n lastRow = []\r\n otherRows = [[]]\r\n while(n>0):\r\n if(len(lastRow)<4):\r\n lastRow.append('O')\r\n else:\r\n if(len(otherRows[-1])<3):\r\n otherRows[-1].append('O')\r\n else:\r\n otherRows.append(['O'])\r\n n -= 1\r\n otherRows += [[] for _ in range(10-len(otherRows))]\r\n lastRow += (4-len(lastRow))*['#']\r\n for row in otherRows:\r\n row += (3-len(row))*['#']\r\n printBus(lastRow,otherRows)\r\n\r\nn = int(input())\r\nsolve(n)", "#!/usr/bin/python3\n\nbus = [\n \"+------------------------+\",\n \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\",\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\n \"|#.......................|\",\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\n \"+------------------------+\",\n]\n\nbus = \"\"\"+||||+\n-{}{}{}{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-{}{}.{}-\n-....-\n-||.|-\n-D...-\n+||||+\n ) ) \"\"\"\n\n\nn = int(input())\nbus = bus.format(*([\"O\"] * n + [\"#\"] * (34-n)))\nbus = \"\\n\".join(\"\".join(k).strip() for k in zip(*bus.splitlines()))\nprint(bus)\n\n", "def proximoHashtag(v):\n for i in range(1,22,2):\n for j in range(0,4):\n if(j==2 and i>1):\n continue\n if(v[j][i] == '#'):\n v[j] = v[j][:i] + 'O' + v[j][i+1:]\n return\n\n\nn = int(input())\n\nprint(\"+------------------------+\")\na = \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"\nb = \"|#.#.#.#.#.#.#.#.#.#.#.|.|\"\nc = \"|#.......................|\"\nd = \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"\nv = [a,b,c,d]\nfor i in range(0,n):\n proximoHashtag(v)\nfor i in range(0,4):\n print(v[i])\nprint(\"+------------------------+\")\n", "a = [list('+------------------------+'), \r\nlist('|#.#.#.#.#.#.#.#.#.#.#.|D|)'),\r\nlist('|#.#.#.#.#.#.#.#.#.#.#.|.|'),\r\nlist('|#.......................|'),\r\nlist('|#.#.#.#.#.#.#.#.#.#.#.|.|)'), \r\nlist('+------------------------+')]\r\na = list(a)\r\nk = int(input())\r\nif k < 4:\r\n for i in range(k):\r\n a[1 + i][1] = 'O'\r\nelse:\r\n for i in range(4):\r\n a[1 + i][1] = 'O' \r\n k -= 4\r\n for i in range(k):\r\n r = i % 3\r\n if r == 0:\r\n a[1][i // 3 * 2 + 3] = 'O'\r\n elif r == 1:\r\n a[2][i // 3 * 2 + 3] = 'O' \r\n elif r == 2:\r\n a[4][i // 3 * 2 + 3] = 'O' \r\nfor i in a:\r\n print(''.join(i))", "import sys, itertools, functools, collections, bisect\r\nfrom math import factorial as fact\r\ninput = sys.stdin.readline\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\n\r\nINF = 10**20\r\nMOD = 10**9+7\r\n\r\ndef solve():\r\n if n == 0:\r\n A = [\r\n \"+------------------------+\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|#.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 1:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|#.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 2:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|#.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 3:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 4:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 5:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 6:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 7:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 8:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 9:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 10:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 11:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 12:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 13:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 14:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 15:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 16:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 17:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 18:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 19:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 20:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 21:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 22:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 23:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 24:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.#.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 25:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 26:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n if n == 27:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.#.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 28:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 29:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 30:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.#.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 31:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 32:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 33:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.O.#.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n elif n == 34:\r\n A = [\r\n \"+------------------------+\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|D|)\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|.|\",\r\n \"|O.......................|\",\r\n \"|O.O.O.O.O.O.O.O.O.O.O.|.|)\",\r\n \"+------------------------+\",\r\n ]\r\n\r\n \r\n for r in range(len(A)):\r\n print(A[r])\r\n \r\ntest_case = 1\r\nfor _ in range(test_case):\r\n n = ri()\r\n solve()", "k = int(input())\r\na = [list() for i in range(6)]\r\na[0] = a[5] = list('+------------------------+')\r\na[1] = list('|' + '#.' * 11 + '|D|)')\r\na[2] = list('|' + '#.' * 11 + '|.|')\r\na[3] = list('|' + '#' + '.' * 23 + '|')\r\na[4] = list('|' + '#.' * 11 + '|.|)')\r\nx = y = 1\r\nfor i in range(k):\r\n a[x][y] = 'O'\r\n if x == 4:\r\n x = 1\r\n y += 2\r\n elif x == 2 and y != 1:\r\n x += 2\r\n else:\r\n x += 1\r\nprint('\\n'.join(map(lambda x: ''.join(x), a)))\r\n", "n=int(input())\r\nub=\"+------------------------+\"\r\nlb=\"+------------------------+\"\r\nr1,r2,r3,r4=['|'],['|'],['|'],['|']\r\nfl=0\r\nif n<3:\r\n r3.append('#')\r\n r3.append('.')\r\nwhile n!=0:\r\n r1.append('O')\r\n r1.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n r2.append('O')\r\n r2.append('.')\r\n n-=1\r\n if n==0:\r\n break\r\n if fl!=1:\r\n r3.append('O')\r\n r3.append('.')\r\n n-=1\r\n fl=1\r\n else:\r\n r3.append('.')\r\n r3.append('.')\r\n if n==0:\r\n break\r\n r4.append('O')\r\n r4.append('.')\r\n n-=1\r\nwhile len(r1)!=23:\r\n r1.append('#')\r\n r1.append('.')\r\nr1.append('|D|)')\r\nwhile len(r2)!=23:\r\n r2.append('#')\r\n r2.append('.')\r\nr2.append('|.|')\r\nwhile len(r3)!=23:\r\n r3.append('.')\r\n r3.append('.')\r\nr3.append('..|')\r\nwhile len(r4)!=23:\r\n r4.append('#')\r\n r4.append('.')\r\nr4.append('|.|)')\r\nprint(ub)\r\nprint(\"\".join(r1))\r\nprint(\"\".join(r2))\r\nprint(\"\".join(r3))\r\nprint(\"\".join(r4))\r\nprint(lb)\r\n", "from sys import setrecursionlimit, exit, stdin\nfrom math import ceil, floor, acos, pi\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom fractions import gcd\nfrom functools import reduce\nimport itertools\nsetrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\nMAX=1000\n#################################################\nk=RI()[0]\ns=\"\"\"+------------------------+\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\n|#.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+\"\"\"\ns=list(s.split('\\n'))\ns=[list(i) for i in s]\nfor i in range(len(s[0])):\n for j in range(len(s)):\n if s[j][i]=='#' and k>0:\n s[j][i]='O'\n k-=1\nprint('\\n'.join([''.join(i) for i in s]))\n", "n = int(input())\r\npls = [['#','#','#','#'] for i in range(11)]\r\nfor i in range(1, 11):\r\n pls[i][2] = ''\r\nfor i in range(11):\r\n for j in range(4):\r\n if n == 0:\r\n break\r\n if pls[i][j] != '':\r\n pls[i][j] = 'O'\r\n n -= 1\r\nprint(\"+------------------------+\")\r\nprint(\"|\" + pls[0][0], pls[1][0], pls[2][0], pls[3][0], pls[4][0], pls[5][0], pls[6][0], pls[7][0], pls[8][0], pls[9][0], pls[10][0], \"|D|)\", sep='.')\r\nprint(\"|\" + pls[0][1], pls[1][1], pls[2][1], pls[3][1], pls[4][1], pls[5][1], pls[6][1], pls[7][1], pls[8][1], pls[9][1], pls[10][1], \"|.|\", sep='.')\r\nprint(\"|\" + pls[0][2], pls[1][2], pls[2][2], pls[3][2], pls[4][2], pls[5][2], pls[6][2], pls[7][2], pls[8][2], pls[9][2], pls[10][2], \"............|\", sep='.')\r\nprint(\"|\" + pls[0][3], pls[1][3], pls[2][3], pls[3][3], pls[4][3], pls[5][3], pls[6][3], pls[7][3], pls[8][3], pls[9][3], pls[10][3], \"|.|)\", sep='.')\r\nprint(\"+------------------------+\")", "k = int(input())\r\n\r\nbusSide = \"+------------------------+\"\r\nrow1 = \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"\r\nrow2 = \"|#.#.#.#.#.#.#.#.#.#.#.|.|\"\r\nrow3 = \"|#.......................|\"\r\nrow4 = \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"\r\n\r\nindex = 0\r\narr = [row1, row2, row3, row4]\r\n\r\nwhile (k > 0):\r\n\tplaced = False\r\n\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i][index] is '#':\r\n\t\t\tarr[i] = arr[i][:index] + 'O' + arr[i][(index+1):]\r\n\t\t\tplaced = True\r\n\t\t\tbreak\r\n\r\n\tif not placed:\r\n\t\tindex += 1\r\n\t\tcontinue\r\n\r\n\tk -= 1\r\n\r\nprint(busSide + \"\\n\" + arr[0] + \"\\n\" + arr[1] + \"\\n\" + arr[2] + \"\\n\" + arr[3] + \"\\n\" + busSide)", "import math\n\nk = 11\np = int(input())\n\nprint('+------------------------+')\n\nprint('|',end='')\nif p > 4:\n t = 1 + math.ceil((p-4)/3)\n print(t*'O.',end='')\n print((k-t)*'#.',end='')\nelif p == 0:\n print(k*'#.', end='')\nelse:\n print('O.' + (k-1)*'#.', end='')\nprint('|D|)')\n\nprint('|',end='')\nif p > 4:\n t = 1 + (p-4)//3\n if (p-4) % 3 == 2: t += 1\n print(t*'O.',end='')\n print((k-t)*'#.',end='')\nelif p < 2:\n print(k*'#.', end='')\nelse:\n print('O.' + (k-1)*'#.', end='')\nprint('|.|')\n\nprint('|',end='')\nif p < 3:\n print('#.......................|')\nelse:\n print('O.......................|')\n\nprint('|',end='')\nif p > 4:\n t = 1 + (p-4)//3\n print(t*'O.',end='')\n print((k-t)*'#.',end='')\nelif p < 4:\n print(k*'#.', end='')\nelse:\n print('O.' + (k-1)*'#.', end='')\nprint('|.|)')\nprint('+------------------------+')\n\n# 1505499034082\n", "n = int(input())\n\nseat = [[\"#\", \"#\", \"#\", \"#\"] for x in range(11)]\n\nfor i in range(11):\n for j in range(4):\n if i!=0 and j==2:\n seat[i][j] = \".\"\n elif n > 0:\n n=n-1\n seat[i][j] = \"O\"\n\nseat = list(map(list, zip(*seat)))\n\nprint(\"+------------------------+\")\nfor i in range(4):\n print(\"|\", end=\"\")\n for j in range(11):\n print(seat[i][j]+\".\",end=\"\")\n if i == 0:\n print(\"|D|)\")\n elif i == 1:\n print(\"|.|\")\n elif i == 2:\n print(\"..|\")\n elif i == 3:\n print(\"|.|)\")\n\nprint(\"+------------------------+\")\n", "k = int(input())\r\n\r\narr = ['#'] * 33\r\nmid = '#'\r\n\r\nif k < 3:\r\n for i in range(k):\r\n arr[i] = 'O'\r\nelse:\r\n mid = 'O'\r\n for i in range(k - 1):\r\n arr[i] = 'O'\r\n\r\n\r\n# printing\r\n\r\nprint('+' + '-' * 24 + '+')\r\n\r\nprint('|', end='')\r\nfor i in range(0, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"|D|)\")\r\n\r\nprint('|', end='')\r\nfor i in range(1, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"|.|\")\r\n\r\nprint('|' + mid + '.' * 23 + '|')\r\n\r\nprint('|', end='')\r\nfor i in range(2, 33, 3):\r\n print(arr[i] + '.', end='')\r\nprint(\"|.|)\")\r\n\r\nprint('+' + '-' * 24 + '+')", "k=0\none=\"0\"\ntwo=\"0\"\ntree=\"0\"\nline=\"+------------------------+\"\none=\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"\ntwo=\"|#.#.#.#.#.#.#.#.#.#.#.|.|\"\ntree=\"|#.......................|\"\nfour= \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"\n#one=one.replace(\"#\",\"0\",1)\nscann=input()\nk=int(scann)\nif(k>4):\n one=one.replace(\"#\",\"O\",1)\n two=two.replace(\"#\",\"O\",1)\n tree=tree.replace(\"#\",\"O\",1)\n four=four.replace(\"#\",\"O\",1)\n k= k-4\n l=k\n for i in range(l):\n if (k>0):\n #print(i+2, \"hola\")\n one=one.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if (k>0):\n two=two.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if (k>0):\n four=four.replace(\"#\",\"O\",1)\n k-=1\n #print(k)\n if(k==0):\n break;\nelse:\n if (k>0):\n one=one.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n two=two.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n tree=tree.replace(\"#\",\"O\",1)\n k-=1\n if (k>0):\n four=four.replace(\"#\",\"O\",1)\n k-=1\n#print(line,one,two,tree,four,line)\nprint(line)\nprint(one)\nprint(two)\nprint(tree)\nprint(four)\nprint(line)\n \t\t \t \t \t\t\t \t\t \t \t", "from sys import stdin\r\ndef llenar(bus,cont):\r\n new=[]\r\n new=transpuesta(bus)\r\n for i in range(len(new)):\r\n for j in range(len(new[i])):\r\n if cont!=0:\r\n if new[i][j]=='#':\r\n new[i][j]='O'\r\n cont-=1\r\n return transpuesta(new)\r\n \r\ndef transpuesta(sitp):\r\n a=[]\r\n for i in range(len(sitp[0])):\r\n b=[]\r\n for j in range(len(sitp)):\r\n b.append(sitp[j][i])\r\n a.append(b)\r\n return a \r\ndef main():\r\n buseta=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"--+\"],[\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|D|)\"],[\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|.|\"],[\"|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"..|\"],[\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|.|)\"],[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"--+\"]]\r\n cont=stdin.readline().strip()\r\n while cont!='':\r\n x=llenar(buseta,int(cont))\r\n for i in range(len(buseta)):\r\n print(''.join((x[i])))\r\n cont=stdin.readline().strip()\r\nmain()\r\n\r\n", "N = int(input())\nlista = []\ncorreder = '#'\nif N > 2:\n N-=1\n correder = 'O'\nfor i in range(N):\n lista.append('O')\nfor i in range(34-N):\n lista.append('#')\n\ncorredores = ['','','']\n\ncolunas_cheias=int(N/3)\ncolunas_imcompleta=N%3\n\nfor i in range(3):\n corredores[i]+=(\"O\"*colunas_cheias)\nfor i in range(colunas_imcompleta):\n corredores[i]+=(\"O\")\nfor i in range(3):\n if len(corredores[i])<11:\n corredores[i]+=\"#\"*(11-len(corredores[i]))\n#print(N,colunas_cheias,colunas_imcompleta)\n\nprint(\"+------------------------+\")\nprint('|', end = '');print(*corredores[0], sep='.', end ='');print(\".|D|)\")\nprint('|', end = '');print(*corredores[1], sep='.', end ='');print(\".|.|\")\nprint('|', end = '');print(correder+\".\"*20,end='');print(\"...|\")\nprint('|', end = '');print(*corredores[2], sep='.', end ='');print(\".|.|)\")\nprint(\"+------------------------+\")", "k = int(input())\r\nvalues = [['#' for i in range(11)] for i in range(3)]\r\nfor i in range(k - 1 if k > 2 else k):\r\n values[i % 3][i // 3] = 'O'\r\nprint('+------------------------+')\r\nprint('|' + '.'.join(values[0]) + '.|D|)')\r\nprint('|' + '.'.join(values[1]) + '.|.|')\r\nprint('|' + ('O' if k > 2 else '#') + '.......................|')\r\nprint('|' + '.'.join(values[2]) + '.|.|)')\r\nprint('+------------------------+')\r\n", "from sys import stdin\ndef main():\n\tn=int(stdin.readline().strip())\n\tb=[['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','D','|',')'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','.','|'],['|','#','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','|'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','.','|',')'],['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\n\ti=1\n\twhile (n>0):\n\t\tj=0\n\t\twhile (n>0) and (j<5):\t\t\n\t\t\tif (b[j][i]=='#'):\t\n\t\t\t\tb[j][i]='O'\n\t\t\t\tn=n-1\n\t\t\tj=j+1\n\t\ti=i+1\n\tfor i in range (len(b)):\n\t\tfor j in range (len(b[i])):\n\t\t\tprint(b[i][j],end='')\n\t\tprint()\nmain()\n", "n=int(input())\r\ns=[]\r\ns.append(list(\"+------------------------+\"))\r\ns.append(list(\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"))\r\ns.append(list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|\"))\r\ns.append(list(\"|#.......................|\"))\r\ns.append(list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"))\r\ns.append(list(\"+------------------------+\"))\r\n\r\nc=1\r\nr=1\r\nfor i in range(n):\r\n s[r][c]='O'\r\n r+=1\r\n if(s[r][c]=='-'):\r\n r=1\r\n c+=2\r\n elif(s[r][c]=='.'):\r\n r+=1\r\nfor i in range(6):\r\n S=\"\"\r\n for item in s[i]:\r\n S+=item\r\n print(S)\r\n", "k = int(input())\r\nprint('+------------------------+')\r\nif k <= 4:\r\n if k > 0:\r\n print('|O.#.#.#.#.#.#.#.#.#.#.|D|)')\r\n else:\r\n print('|#.#.#.#.#.#.#.#.#.#.#.|D|)')\r\n if k > 1:\r\n print('|O.#.#.#.#.#.#.#.#.#.#.|.|')\r\n else:\r\n print('|#.#.#.#.#.#.#.#.#.#.#.|.|')\r\n if k > 2:\r\n print('|O.......................|')\r\n else:\r\n print('|#.......................|')\r\n if k > 3:\r\n print('|O.#.#.#.#.#.#.#.#.#.#.|.|)')\r\n else:\r\n print('|#.#.#.#.#.#.#.#.#.#.#.|.|)')\r\nelse:\r\n k -= 4\r\n first = k // 3 + 1\r\n if k % 3 > 0:\r\n first += 1\r\n second = k // 3 + 1\r\n if k % 3 > 1:\r\n second += 1\r\n third = k // 3 + 1\r\n \r\n print('|', 'O.' * first, '#.' * (11 - first), '|D|)', sep = '')\r\n print('|', 'O.' * second, '#.' * (11 - second), '|.|', sep = '')\r\n print('|O.......................|')\r\n print('|', 'O.' * third, '#.' * (11 - third), '|.|)', sep = '')\r\nprint('+------------------------+')", "a = []\r\na.append('+------------------------+' )\r\na.append('|#.#.#.#.#.#.#.#.#.#.#.|D|)')\r\na.append('|#.#.#.#.#.#.#.#.#.#.#.|.|' )\r\na.append('|#.......................|' )\r\na.append('|#.#.#.#.#.#.#.#.#.#.#.|.|)')\r\na.append('+------------------------+' )\r\na = list(map(list, a))\r\ncurr = [0, 0]\r\nn = int(input())\r\nwhile n > 0:\r\n if a[curr[0]][curr[1]] == '#':\r\n a[curr[0]][curr[1]] = 'O'\r\n n -= 1\r\n curr[0] += 1\r\n if curr[0] >= 6:\r\n curr[0] = 0\r\n curr[1] += 1\r\nfor i in range(5):\r\n for j in a[i][:-1]:\r\n print(j, end = '')\r\n print(a[i][-1])\r\nfor j in a[5]:\r\n print(j, end = '')", "n = int(input())\na = [0]*11\nif n < 4:\n a[0] = n\n n = 0\nelse:\n a[0] = 4\n n -= 4\n i = 1\n while n > 0:\n if n < 3:\n a[i] = n\n n = 0\n else:\n a[i] = 3\n n -= 3\n i+=1\n\ndef pb(x):\n global a\n for i in a[1:]:\n print('O' if i >= x else '#', end='.')\nprint('+------------------------+')\nprint(end='|'); print('O' if a[0] >= 1 else '#', end='.'); \npb(1); print('|D|)')\nprint(end='|'); print('O' if a[0] >= 2 else '#', end='.'); \npb(2); print('|.|')\nprint(end='|'); print('O' if a[0] >= 3 else '#', end=''); print('.......................|')\nprint(end='|'); print('O' if a[0] >= 4 else '#', end='.'); \npb(3); print('|.|)')\nprint('+------------------------+')\n", "bus = [\nlist('+------------------------+'),\nlist('|#.#.#.#.#.#.#.#.#.#.#.|D|)'),\nlist('|#.#.#.#.#.#.#.#.#.#.#.|.|'),\nlist('|#.......................|'),\nlist('|#.#.#.#.#.#.#.#.#.#.#.|.|)'),\nlist('+------------------------+'),\n]\n\nn = int(input())\n\nfor i in range(n):\n ok = False\n for r in range(11):\n if ok:\n break\n r_num = 2 * r + 1\n for j in range(1, 5):\n if ok:\n break\n if bus[j][r_num] == '#':\n bus[j][r_num] = 'O'\n ok = True\n\nfor s in bus:\n print(''.join(s))\n", "#!/usr/bin/python3\n\nimport sys\n\nslika = \"\"\"+------------------------+\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\n|#.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+\"\"\"\n\nif __name__ == '__main__':\n st = int(sys.stdin.readline())\n lines = [list(line) for line in slika.split('\\n')]\n w = min(len(line) for line in lines)\n for k in range(w):\n if st == 0:\n break\n for l in range(len(lines)):\n if st == 0:\n break\n if lines[l][k] == '#':\n lines[l][k] = 'O'\n st -= 1\n \n for line in lines:\n print(''.join(line))\n", "class CodeforcesTask475ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.passengers = 0\r\n\r\n def read_input(self):\r\n self.passengers = int(input())\r\n\r\n def process_task(self):\r\n seats = [\"#\" for x in range(34)]\r\n for x in range(self.passengers):\r\n seats[x] = \"O\"\r\n bus = \"\"\"+------------------------+\r\n|{0}.{4}.{7}.{10}.{13}.{16}.{19}.{22}.{25}.{28}.{31}.|D|)\r\n|{1}.{5}.{8}.{11}.{14}.{17}.{20}.{23}.{26}.{29}.{32}.|.|\r\n|{2}.......................|\r\n|{3}.{6}.{9}.{12}.{15}.{18}.{21}.{24}.{27}.{30}.{33}.|.|)\r\n+------------------------+\"\"\".format(*seats)\r\n self.result = bus\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask475ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "s = ['+------------------------+',\n'|#.#.#.#.#.#.#.#.#.#.#.|D|)',\n'|#.#.#.#.#.#.#.#.#.#.#.|.|',\n'|#.......................|',\n'|#.#.#.#.#.#.#.#.#.#.#.|.|)',\n'+------------------------+']\nk = int(input())\n\nfor _ in range(k):\n fnd = False\n for j in range(22):\n if fnd:\n break\n for i in range(6):\n if s[i][j] == '#':\n s[i] = s[i][:j] + 'O' + s[i][j + 1:]\n fnd = True\n break\nprint('\\n'.join(s))\n", "bus = list(map(list, '''+------------------------+\r\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\r\n|#.#.#.#.#.#.#.#.#.#.#.|.|\r\n|#.......................|\r\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\r\n+------------------------+'''.split('\\n')))\r\nplaces = [[1, 1], [2, 1], [3, 1], [4, 1]] + [[1 << y, 1 + 2 * x] for x in range(1,11) for y in range(3)]\r\nfor x, y in places[:int(input())]:\r\n bus[x][y] = 'O'\r\nprint(*map(lambda x: ''.join(x), bus), sep = '\\n')\r\n", "n = int(input())\n\nline1 = '+------------------------+'\nrow1 = ['#'] * 11\nrow2 = ['#'] * 11\nrow3 = ['#'] + ['.'] * 10\nrow4 = ['#'] * 11\nfor i in range(1, n + 1):\n if i <= 4:\n if i == 1:\n row1[0] = 'O'\n elif i == 2:\n row2[0] = 'O'\n elif i == 3:\n row3[0] = 'O'\n elif i == 4:\n row4[0] = 'O'\n else:\n di = i - 4\n if di % 3 == 1:\n row1[row1.index('#')] = 'O'\n elif di % 3 == 2:\n row2[row2.index('#')] = 'O'\n elif di % 3 == 0:\n row4[row4.index('#')] = 'O'\n \nprint(line1)\nprint('|' + '.'.join(row1) + '.|D|)')\nprint('|' + '.'.join(row2) + '.|.|')\nprint('|' + '.'.join(row3) + '...|')\nprint('|' + '.'.join(row4) + '.|.|)')\nprint(line1)\n", "\n\nK = int(input())\n\nBus = [\n [ ('+',0), ('-',0), ('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0), ('+',0)],\n\n # linha 1 |1.5.8.#.#.#.#.#.#.#.#.|D|)\n [ ('|',0), ('S',1), ('.',0), ('S',5), ('.',0), ('S',8), ('.',0), ('S',11), ('.',0), ('S',14), ('.',0), ('S',17), ('.',0), ('S',20), ('.',0), ('S',23), ('.',0), ('S',26), ('.',0), ('S',29), ('.',0), ('S',32), ('.',0), ('|',0), ('D',0), ('|',0), (')',0)],\n\n # linha 2 |2.6.9.#.#.#.#.#.#.#.#.|.|\n [ ('|',0), ('S',2), ('.',0), ('S',6), ('.',0), ('S',9), ('.',0), ('S',12), ('.',0), ('S',15), ('.',0), ('S',18), ('.',0), ('S',21), ('.',0), ('S',24), ('.',0), ('S',27), ('.',0), ('S',30), ('.',0), ('S',33), ('.',0), ('|',0), ('.',0), ('|',0)],\n\n # linha 3 |3.......................|\n [ ('|',0), ('S',3), ('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0),('.',0), ('|',0)],\n\n # linha 4 |4.7.10.#.#.#.#.#.#.#.#.|.|)\n [ ('|',0), ('S',4), ('.',0), ('S',7), ('.',0), ('S',10), ('.',0), ('S',13), ('.',0), ('S',16), ('.',0), ('S',19), ('.',0), ('S',22), ('.',0), ('S',25), ('.',0), ('S',28), ('.',0), ('S',31), ('.',0), ('S',34), ('.',0), ('|',0), ('.',0), ('|',0), (')',0)],\n\n [ ('+',0), ('-',0), ('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0),('-',0), ('+',0)],\n]\n\nfor i in range(0, len(Bus)):\n line = \"\"\n for j in range(0, len(Bus[i])):\n char, number = Bus[i][j]\n if(char == 'S'):\n if(number <= K):\n line += 'O'\n else:\n line += '#'\n else:\n line += char\n print(line)", "n=int(input())\r\ns=['+------------------------+']\r\nd='|'+'#O'[n>2]+'.'*23+'|'\r\nif n>2:n-=1\r\nfor i in range(3):x=n//3+(n%3>i);s+=['|'+('.'.join('O'*x+'#'*(11-x)))]\r\ns.insert(3,d)\r\ns+=[s[0]]\r\ns[1]+='.|D|)'\r\ns[2]+='.|.|'\r\ns[4]+='.|.|)'\r\nprint('\\n'.join(s))", "k = int(input())\n\nstrin0 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista = strin0.split(\".\")\n\nstrin1 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista1 = strin1.split(\".\")\nstrin2 = \"#\"\nlista2 = strin2.split(\".\")\nstrin3 = \"#.#.#.#.#.#.#.#.#.#.#\"\nlista3 = strin3.split(\".\")\nstringprint = \".\"\nstringprint1 = \".\"\nstringprint2 = \".\"\nstringprint3 = \".\"\n\ni = 0\nj = 0\nwhile i != k:\n lista[j] = \"O\"\n i = i + 1\n if i == k:\n break\n lista1[j] = \"O\"\n i = i + 1\n if i == k:\n break\n\n if lista2[0] != \"O\":\n lista2[0] = \"O\"\n i = i + 1\n\n if i == k:\n break\n\n lista3[j] = \"O\"\n i = i + 1\n j = j + 1\n\nstringprint = stringprint.join(lista)\nstringprint1 = stringprint1.join(lista1)\nstringprint2 = stringprint2.join(lista2)\nstringprint3 = stringprint3.join(lista3)\n\n\n\n\nprint(\"+------------------------+\")\nprint(\"|\"+stringprint+\".\"+\"|D|)\")\nprint(\"|\"+stringprint1+\".\"+\"|.|\")\nprint(\"|\"+stringprint2+\".......................\"+\"|\")\nprint(\"|\"+stringprint3+\".\"\"|.|)\")\nprint(\"+------------------------+\")\n", "def main():\n n = int(input())\n print(\"+------------------------+\")\n b1 = 0\n if n == 0:\n b1 = 0\n elif 1 <= n <= 4:\n b1 = 1\n else:\n b1 = (n + 1) // 3\n if 0 <= n <= 1:\n b2 = 0\n elif 2 <= n <= 5:\n b2 = 1\n else:\n b2 = n // 3\n b3 = 0\n if n < 3:\n b3 = 0\n else:\n b3 = 1\n b4 = 0\n if n <= 3:\n b4 = 0\n else:\n b4 = (n - 1) // 3\n print(\"|\", end = '')\n for i in range(1, 12):\n if i <= b1:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('|D|)')\n print(\"|\", end = '')\n for i in range(1, 12):\n if i <= b2:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('|.|')\n if b3 == 0:\n print(\"|#.......................|\")\n else:\n print(\"|O.......................|\")\n print(\"|\", end = '')\n for i in range(1, 12):\n if i <= b4:\n print('O.', end = '')\n else:\n print('#.', end = '')\n print('|.|)')\n print(\"+------------------------+\")\n\n\n\nmain()\n", "ans= '\\n'.join(['+------------------------+'\r\n,'|0.4.7.A.(.G.J.M.P.S.V.|D|)',\r\n'|1.5.8.B.E.H.K.N.Q.T.W.|.|'\r\n,'|2.......................|',\r\n'|3.6.9.C.F.I.L.s.R.U.X.|.|)',\r\n'+------------------------+'])\r\n\r\nline = \"0123456789ABC(EFGHIJKLMNsPQRSTUVWX\"\r\nn = int(input())\r\nfor i in range(n):\r\n ans = ans.replace(line[i],'O')\r\n # print(ans)\r\n # print(\"\")\r\n#print(\"_________________________\")\r\nfor i in range(n,34,1):\r\n ans = ans.replace(line[i],\"#\")\r\n # print(ans)\r\n # print(\"\")\r\nprint(ans)", "bus = \"\"\"+------------------------+\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\n|#.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+\"\"\"\n\nbus = [list(line) for line in bus.split()]\n\nn = int(input())\nfor i in range(4):\n if n <= 0:\n break\n bus[i + 1][1] = 'O'\n n -= 1\n\nrow = 1\ncol = 3\nwhile n > 0:\n bus[row][col] = 'O'\n n -= 1\n row = 2 * row\n if row > 4:\n row = 1\n col += 2\n\nprint('\\n'.join([''.join(line) for line in bus]))\n", "import math\nn = int(input())\ntemplate = [\"+------------------------+\",\n\"|O.O.O.O.O.O.O.#.#.#.#.|D|)\",\n\"|O.O.O.O.O.O.#.#.#.#.#.|.|\",\n\"|O.......................|\",\n\"|O.O.O.O.O.O.#.#.#.#.#.|.|)\",\n\"+------------------------+\"]\ni = 1\nlistTemplate = []\nfor s in template:\n listTemplate.append(list(s))\nwhile (i<=34):\n if(i > n): c = \"#\"\n else: c = \"O\"\n if(i<=4): row = 0\n else: row = math.floor((i-2)/3)\n if(i<=4): seat = (i-1)\n else: seat = (i-5)%3\n if(seat == 2 and row != 0): seat+=1\n listTemplate[1+seat][1+row*2] = c \n i+=1\nfor a in listTemplate:\n print(''.join(a)) ", "def replaceString(s, newstring, index):\n return s[:index] + newstring + s[index + 1:]\n\ndef main():\n\n n = int(input())\n\n busMap =[]\n\n sideBus = \"+------------------------+\"\n seats = \"#.#.#.#.#.#.#.#.#.#.#.\"\n center = \"#.....................\"\n\n busMap.append(seats)\n busMap.append(seats)\n busMap.append(center)\n busMap.append(seats)\n\n for i in range(22):\n for j in range(4):\n if (n > 0 and busMap[j][i] == \"#\"):\n busMap[j] = replaceString(busMap[j], \"O\", i)\n n -= 1\n\n print(sideBus)\n print(\"|\" + busMap[0] + \"|D|)\")\n print(\"|\" + busMap[1] + \"|.|\")\n print(\"|\" + busMap[2] + \"..|\")\n print(\"|\" + busMap[3] + \"|.|)\")\n print(sideBus)\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\n\na = [['#', '#', '#' if i == 0 else '.', '#'] for i in range(11)]\n\nfor r in range(11):\n\tfor c in range(4):\n\t\tif a[r][c] == '#' and n > 0:\n\t\t\ta[r][c] = 'O'\n\t\t\tn -= 1\n\nprint('+' + '-' * 24 + '+')\nprint('|' + \".\".join([a[i][0] for i in range(11)]) + \".|D|)\")\nprint('|' + \".\".join([a[i][1] for i in range(11)]) + \".|.|\")\nprint('|' + \".\".join([a[i][2] for i in range(11)]) + \"...|\")\nprint('|' + \".\".join([a[i][3] for i in range(11)]) + \".|.|)\")\nprint('+' + '-' * 24 + '+')\n", "n = int(input())\n\na = ['#']*34\n\nfor i in range(n):\n a[i] = 'O'\n\nprint('+------------------------+')\nprint('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|D|)'.format(a[0], a[4], a[7],a[10],a[13],a[16],a[19],a[22],a[25],a[28],a[31]))\nprint('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|.|'.format(a[1], a[5], a[8],a[11],a[14],a[17],a[20],a[23],a[26],a[29],a[32]))\nprint('|' + a[2] + '.......................|')\nprint('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|.|)'.format(a[3], a[6], a[9],a[12],a[15],a[18],a[21],a[24],a[27],a[30],a[33]))\nprint('+------------------------+')", "n = int(input())\r\n\r\nl = [list(\"+------------------------+\"),\r\n list(\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"),\r\n list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|\"),\r\n list(\"|#.......................|\"),\r\n list(\"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"),\r\n list(\"+------------------------+\")]\r\n\r\nj = 1\r\n\r\nwhile j < 22:\r\n i = 1\r\n\r\n while i < 5 and n > 0:\r\n if l[i][j] == \"#\":\r\n l[i][j] = \"O\"\r\n n -= 1\r\n i += 1\r\n j += 2\r\n\r\nfor i in l:\r\n print(\"\".join(i))", "numberoParticipantes = int(input())\nparticipantes = ['temp'] * numberoParticipantes\n \nprimeraLinea = []\nsegundaLinea = []\nterceraLinea = []\ncuartaLinea = []\nfor k in range (0, 11):\n for l in range(0, 4):\n if(l == 0 and len(participantes) > 0):\n primeraLinea.append('O')\n participantes.pop(0)\n elif(l == 1 and len(participantes) > 0):\n segundaLinea.append('O')\n participantes.pop(0)\n elif(k == 0 and l == 2 and len(participantes) > 0):\n terceraLinea.append('O')\n participantes.pop(0)\n elif(l == 3 and len(participantes) > 0):\n cuartaLinea.append('O')\n participantes.pop(0)\n \nprint('+------------------------+')\nfor i in range(0, 4):\n for j in range(0, 27):\n if(j == 0 or (j == 23 and i != 2) or j == 25):\n print('|', end ='')\n elif(j == 26 and (i == 0 or i == 3)):\n print(')', end ='')\n elif(j == 26 and (i == 1 or i == 2)):\n print('', end='')\n elif(j == 24 and i == 0):\n print('D', end ='')\n elif(j % 2 == 0 or (j > 1 and i == 2)):\n print('.', end ='')\n elif(i == 0 and len(primeraLinea)):\n print(primeraLinea.pop(), end ='')\n elif(i == 1 and len(segundaLinea)):\n print(segundaLinea.pop(), end ='')\n elif(i == 2 and len(terceraLinea)):\n print(terceraLinea.pop(), end ='')\n elif(i == 3 and len(cuartaLinea)):\n print(cuartaLinea.pop(), end ='')\n else:\n print('#', end ='')\n print('')\nprint('+------------------------+')\n\t\t\t\t \t \t\t\t\t\t \t \t \t \t\t \t \t", "#!/usr/bin/python3\r\n\r\nk = int(input())\r\nseat_map = [\"+------------------------+\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n \"|#.......................|\",\r\n \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n \"+------------------------+\"]\r\nseat = list(map(list, seat_map))\r\nfor L in range(len(seat[0])):\r\n for W in range(len(seat)):\r\n if seat[W][L] == '#' and k > 0:\r\n seat[W][L] = 'O'\r\n k -= 1\r\nfor line in seat:\r\n print(''.join(line))", "k = int(input())\nseats = (28, 56, 83, 110, 30, 58, 112, 32, 60, 114, 34, 62, 116, 36, 64, 118, 38,\n 66, 120, 40, 68, 122, 42, 70, 124, 44, 72, 126, 46, 74, 128, 48, 76, 130)\nbus = list('+------------------------+\\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\\n'\n '|#.#.#.#.#.#.#.#.#.#.#.|.|\\n|#.......................|\\n|'\n '#.#.#.#.#.#.#.#.#.#.#.|.|)\\n+------------------------+')\nfor i in seats[:k]:\n bus[i] = 'O'\n \nprint(''.join(bus))", "out = [bytearray(b\"+------------------------+\"),\nbytearray(b\"|O.O.O.#.#.#.#.#.#.#.#.|D|)\"),\nbytearray(b\"|O.O.O.#.#.#.#.#.#.#.#.|.|\"),\nbytearray(b\"|O.......................|\"),\nbytearray(b\"|O.O.#.#.#.#.#.#.#.#.#.|.|)\"),\nbytearray(b\"+------------------------+\")];\n\nk = int(input())\n#out[0][4] = ord('s')\n#print(out[0].decode())\nverlist = [2,4,1]\n\nfor i in range(1,35):\n\tc = '#' if i>k else 'O'\n\thor = 1 if i <5 else ((i-2)//3)*2+1\n\t#print(hor)\n\tver = i if i<5 else verlist[i%3]\n\tout[ver][hor] = ord(c)\nfor s in out:\n\tprint(s.decode())", "import re\r\n\r\nbus = \"\"\"\\\r\n+------------------------+\r\n|1.5.8.11.14.17.20.23.26.29.32.|D|)\r\n|2.6.9.12.15.18.21.24.27.30.33.|.|\r\n|3.......................|\r\n|4.7.10.13.16.19.22.25.28.31.34.|.|)\r\n+------------------------+\"\"\"\r\n\r\nk = int(input())\r\nbus = re.sub(\"\\d+\", lambda m: \"O\" if int(m.group()) <= k else \"#\", bus)\r\nprint(bus)", "from sys import stdin\r\ndef replace(c,n):\r\n for i in range(1,len(c[0]),2):\r\n for j in range(1,5):\r\n if n>0:\r\n c[j][i]=c[j][i].replace(\"#\",\"O\")\r\n if c[j][i]==\"O\":\r\n n=n-1\r\n return c \r\ndef main():\r\n a1=[]\r\n bus=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"],\r\n [\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|\",\"D\",\"|\",\")\"],\r\n [\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|\",\".\",\"|\"],\r\n [\"|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"|\"],\r\n [\"|\",\"#\",'.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','.','|',')'],\r\n ['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\r\n n=int(stdin.readline())\r\n bus=replace(bus,n)\r\n for i in range(0,len(bus)):\r\n print(\"\".join(bus[i]))\r\nmain()\r\n", "\nn = int(input())\nrow = [\"|\", \"|\", \"|\", \"|\"]\nc = 0\nfor i in range(1, 45):\n\n\tif(c > 3):\n\t\tc = 0\n\n\tif(i < 4):\n\t\tif(n < 1):\n\t\t\trow[c] += \"#.\"\n\t\telse:\n\t\t\trow[c] += \"O.\"\n\t\n\telif(c==2):\n\t\trow[c] += \"..\"\n\t\tn += 1\n\t\n\telif(n < 1):\n\t\t\trow[c] += \"#.\"\n\t\n\telif(n > 0):\n\t\trow[c] += \"O.\"\n\tc += 1\n\tn -= 1\n\nrow[0] += \"|D|)\"\nrow[1] += \"|.|\"\nrow[2] += \"..|\"\nrow[3] += \"|.|)\"\n \nprint (\"+------------------------+\")\nprint (row[0])\nprint (row[1])\nprint (row[2])\nprint (row[3])\nprint (\"+------------------------+\")\n\n\t \t \t\t\t\t\t\t\t \t\t \t \t \t\t\t \t\t\t\t \t", "from sys import stdin\r\ndef main():\r\n n=int(stdin.readline().strip())\r\n b=[['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','D','|',')'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','.','|'],['|','#','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','|'],['|','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','#','.','|','.','|',')'],['+','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','-','+']]\r\n i=1\r\n while (n>0):\r\n j=0\r\n while (n>0) and (j<5): \r\n if (b[j][i]=='#'): \r\n b[j][i]='O'\r\n n=n-1\r\n j=j+1\r\n i=i+1\r\n for i in range (len(b)):\r\n for j in range (len(b[i])):\r\n print(b[i][j],end='')\r\n print()\r\nmain()", "from sys import stdin\r\ndef main():\r\n pasajeros=stdin.readline()\r\n bus=[[\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"],\r\n [\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|\",\"D\",\"|\",\")\"],\r\n [\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|\",\".\",\"|\"],\r\n [\"|\",\"#\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\".\",\"|\"],\r\n [\"|\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"#\",\".\",\"|\",\".\",\"|\",\")\"],\r\n [\"+\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"-\",\"+\"]]\r\n x=0\r\n if int(pasajeros)==0:\r\n for i in range (len(bus)):\r\n for j in range (len(bus[i])):\r\n print(bus[i][j],end='') \r\n print()\r\n else:\r\n for j in range (1,25):\r\n for i in range (1,5):\r\n if bus[i][j]==\"#\" and x<=int(pasajeros)-1:\r\n bus[i][j]=\"O\"\r\n x=x+1\r\n for i in range (len(bus)):\r\n for j in range (len(bus[i])):\r\n print(bus[i][j],end='') \r\n print()\r\n \r\nmain()\r\n", "a = [\r\n\"+------------------------+\",\r\n\"|#.#.#.#.#.#.#.#.#.#.#.|D|)\",\r\n\"|#.#.#.#.#.#.#.#.#.#.#.|.|\",\r\n\"|#.......................|\",\r\n\"|#.#.#.#.#.#.#.#.#.#.#.|.|)\",\r\n\"+------------------------+\"\r\n]\r\nn = int(input())\r\nrow = 1\r\npos = 1\r\n\r\nfor i in range(n):\r\n a[pos] = a[pos][:row] + 'O' + a[pos][row + 1:]\r\n pos += 1\r\n if row != 1 and pos == 3:\r\n pos += 1\r\n if pos > 4:\r\n pos = 1\r\n row += 2\r\n\r\nfor x in a:\r\n print(x)\r\n ", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\nif __name__ == '__main__':\n n = rint()\n\n side = '+------------------------+ '\n r1 = '|S.S.S.S.S.S.S.S.S.S.S.|D|)'\n r2 = '|S.S.S.S.S.S.S.S.S.S.S.|.| '\n r3 = '|S.......................| '\n r4 = '|S.S.S.S.S.S.S.S.S.S.S.|.|)'\n\n cols = list([list(a) for a in zip(side, r1, r2, r3, r4, side)])\n\n for r,row in enumerate(cols):\n for c,col in enumerate(row):\n if cols[r][c] == 'S':\n cols[r][c] = '#'\n n -= 1\n if n == 0:\n break\n if n == 0:\n break\n\n rows = list([''.join(c) for c in zip(*cols)])\n rows = [r.replace('S', '!') for r in rows]\n rows = [r.replace('#', 'O') for r in rows]\n rows = [r.replace('!', '#') for r in rows]\n for r in rows:\n print(r.strip(' '))\n", "k = int(input())\r\ns = [\"\"] * 6\r\ns[0] = \"+------------------------+\"\r\ns[1] = \"|#.#.#.#.#.#.#.#.#.#.#.|D|)\"\r\ns[2] = \"|#.#.#.#.#.#.#.#.#.#.#.|.|\"\r\ns[3] = \"|#.......................|\"\r\ns[4] = \"|#.#.#.#.#.#.#.#.#.#.#.|.|)\"\r\ns[5] = \"+------------------------+\"\r\n\r\ncurs = 1\r\nwhile k > 0:\r\n while not \"#\" in s[curs]:\r\n curs = 1 + curs % 4\r\n x = s[curs].index(\"#\")\r\n s[curs] = s[curs][:x] + \"O\" + s[curs][x + 1:]\r\n curs = 1 + curs % 4\r\n k -= 1\r\nfor i in s:\r\n print(i)", "#1\n\ninpput = int(input())\n\n\nif inpput >=4:\n inpput-=4\n\n bayan = inpput//3\n c = inpput%3\n\n print('+------------------------+')\n\n if c>0:\n print( '|'+'O.'+'O.'*(bayan)+'O.'+'#.'*(11-(1+bayan+1))+'|D|)' )\n c-=1\n else:\n print( '|'+'O.'+'O.'*(bayan)+'#.'*(11-(1+bayan))+'|D|)' )\n\n if c>0:\n print( '|'+'O.'+'O.'*(bayan)+'O.'+'#.'*(11-(1+bayan+1))+'|.|' )\n c-=1\n else:\n print( '|'+'O.'+'O.'*(bayan)+'#.'*(11-(1+bayan))+'|.|' )\n\n print('|O.......................|')\n\n if c>0:\n print( '|'+'O.'+'O.'*(bayan)+'O.'+'#.'*(11-(1+bayan+1))+'|.|)' )\n c-=1\n else:\n print( '|'+'O.'+'O.'*(bayan)+'#.'*(11-(1+bayan))+'|.|)' )\n \n \n \n\n\n print('+------------------------+')\n\nelse:\n\n print('+------------------------+')\n if inpput>0:\n print( '|'+'O.'+'#.'*(10)+'|D|)' )\n inpput-=1\n else:\n print( '|'+'#.'+'#.'*(10)+'|D|)' )\n\n\n \n \n if inpput>0:\n print( '|'+'O.'+'#.'*(10)+'|.|' )\n inpput-=1\n else:\n print( '|'+'#.'+'#.'*(10)+'|.|' )\n\n \n if inpput>0:\n print( '|'+'O.'+'..'*(10)+'..|' )\n inpput-=1\n else:\n print( '|'+'#.'+'..'*(10)+'..|' )\n \n\n\n if inpput>0:\n print( '|'+'O.'+'#.'*(10)+'|.|)' )\n else:\n print( '|'+'#.'+'#.'*(10)+'|.|)' )\n \n print('+------------------------+')\n\t \t \t\t \t\t\t\t\t \t\t\t \t \t\t\t", "import sys\n\ndef main():\n while 1:\n try:\n line = sys.stdin.readline()\n solve(line)\n break\n except KeyboardInterrupt:\n break\n\npas = ['#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#','#','#','#','#','#','#',\n '#','#','#','#']\n\ndef solve(line):\n for x in range(0,int(line)):\n pas[x] = 'O'\n\n print ('+------------------------+')\n print ('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|D|)' .format(pas[0],pas[4],pas[7],pas[10],pas[13],pas[16],pas[19],pas[22],pas[25],pas[28],pas[31]))\n print ('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|.|' .format(pas[1],pas[5],pas[8],pas[11],pas[14],pas[17],pas[20],pas[23],pas[26],pas[29],pas[32]))\n print ('|{}.......................|' .format(pas[2]))\n print ('|{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.{}.|.|)' .format(pas[3],pas[6],pas[9],pas[12],pas[15],pas[18],pas[21],pas[24],pas[27],pas[30],pas[33]))\n print ('+------------------------+')\n\n\nif __name__ == \"__main__\":\n main()\n\n# 1502214954884\n" ]

{"inputs": ["9", "20", "30", "5", "0", "1", "2", "3", "4", "6", "7", "8", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "21", "22", "23", "24", "25", "26", "27", "28", "29", "31", "32", "33", "34"], "outputs": ["+------------------------+\n|O.O.O.#.#.#.#.#.#.#.#.|D|)\n|O.O.O.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.#.#.#.#.|D|)\n|O.O.O.O.O.O.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.#.|D|)\n|O.O.O.O.O.O.O.O.O.O.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.#.#.#.#.#.#.#.#.#.|D|)\n|O.#.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|#.#.#.#.#.#.#.#.#.#.#.|D|)\n|#.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.#.#.#.#.#.#.#.#.#.#.|D|)\n|#.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.#.#.#.#.#.#.#.#.#.#.|D|)\n|O.#.#.#.#.#.#.#.#.#.#.|.|\n|#.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.#.#.#.#.#.#.#.#.#.#.|D|)\n|O.#.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|#.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.#.#.#.#.#.#.#.#.#.#.|D|)\n|O.#.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.#.#.#.#.#.#.#.#.#.|D|)\n|O.O.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.#.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.#.#.#.#.#.#.#.#.#.|D|)\n|O.O.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.#.#.#.#.#.#.#.#.|D|)\n|O.O.#.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.#.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.#.#.#.#.#.#.#.#.|D|)\n|O.O.O.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.#.#.#.#.#.#.#.|D|)\n|O.O.O.#.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.#.#.#.#.#.#.#.|D|)\n|O.O.O.O.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.#.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.#.#.#.#.#.#.#.|D|)\n|O.O.O.O.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.#.#.#.#.#.#.|D|)\n|O.O.O.O.#.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.#.#.#.#.#.#.|D|)\n|O.O.O.O.O.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.#.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.#.#.#.#.#.#.|D|)\n|O.O.O.O.O.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.#.#.#.#.#.|D|)\n|O.O.O.O.O.#.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.#.#.#.#.#.|D|)\n|O.O.O.O.O.O.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.#.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.#.#.#.#.#.|D|)\n|O.O.O.O.O.O.#.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.#.#.#.#.|D|)\n|O.O.O.O.O.O.O.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.#.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.#.#.#.#.|D|)\n|O.O.O.O.O.O.O.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.#.#.#.|D|)\n|O.O.O.O.O.O.O.#.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.#.#.#.|D|)\n|O.O.O.O.O.O.O.O.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.#.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.#.#.#.|D|)\n|O.O.O.O.O.O.O.O.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.#.#.|D|)\n|O.O.O.O.O.O.O.O.#.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.#.#.|D|)\n|O.O.O.O.O.O.O.O.O.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.#.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.#.#.|D|)\n|O.O.O.O.O.O.O.O.O.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.#.|D|)\n|O.O.O.O.O.O.O.O.O.#.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.#.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.#.|D|)\n|O.O.O.O.O.O.O.O.O.O.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.O.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.O.|D|)\n|O.O.O.O.O.O.O.O.O.O.#.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.O.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.O.|D|)\n|O.O.O.O.O.O.O.O.O.O.O.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.O.#.|.|)\n+------------------------+", "+------------------------+\n|O.O.O.O.O.O.O.O.O.O.O.|D|)\n|O.O.O.O.O.O.O.O.O.O.O.|.|\n|O.......................|\n|O.O.O.O.O.O.O.O.O.O.O.|.|)\n+------------------------+"]}

UNKNOWN

PYTHON3

CODEFORCES

63

d63bc03ec2d750bf0a79a037180d8b83

Yaroslav and Permutations

Yaroslav has an array that consists of *n* integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time. Help Yaroslav. The first line contains integer *n* (1<=≤<=*n*<=≤<=100) — the number of elements in the array. The second line contains *n* integers *a*1,<=*a*2,<=...,<=*a**n* (1<=≤<=*a**i*<=≤<=1000) — the array elements. In the single line print "YES" (without the quotes) if Yaroslav can obtain the array he needs, and "NO" (without the quotes) otherwise. Sample Input 1 1 3 1 1 2 4 7 7 7 7 Sample Output YES YES NO

[ "n = int(input())\r\na = list(map(int, input().split()))\r\nok = True\r\nfor val in a:\r\n if a.count(val) > (n+1)//2:\r\n ok = False\r\n break\r\n\r\nprint('YES' if ok else 'NO')", "n=int(input())\r\na=[int(x) for x in input().split()]\r\n\r\nfor i in a:\r\n if a.count(i)*2>n+1:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = input().split(' ')\r\ns = [int(i) for i in a]\r\nmax_num = max(s,key=s.count)\r\nmax_count = s.count(max_num)\r\nif max_count>((n//2)+(n%2)):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nc = Counter(l)\r\nt=0\r\n\r\nfor i in l:\r\n if(c[i]>math.ceil(n/2)):\r\n print(\"NO\")\r\n t = 1\r\n quit()\r\n\r\nif(t==0):\r\n print(\"YES\")\r\n \r\n", "n=int(input())\n\narr=[int(i) for i in input().split(\" \")]\nflag=0\nset_A=set(arr)\nfor x in set_A:\n if arr.count(x)>(int((n+1)/2)):\n flag=1\n break\n\nif(flag==0):\n print('YES')\nelse:\n print('NO')\n\n\t\t\t \t\t \t \t\t \t \t \t\t \t\t", "n =int(input())\r\nlst = [int(i) for i in input().split()] \r\nd = dict()\r\nfor i in lst:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i]+=1\r\nif n%2 == 0:\r\n for i in d:\r\n if d[i] >= n//2+1:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in d:\r\n if d[i] >= n//2+2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n ", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n n = int(input())\r\n #a,b,c = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n n2 = (n+1) // 2\r\n ar = [0]*1001\r\n for i in ai:\r\n ar[i] += 1\r\n print([\"YES\",\"NO\"][max(ar) > n2])\r\nmain()\r\n", "n=int(input())\r\n\r\nsequence=[int(i) for i in input().split()]\r\nflag=0\r\n\r\nfor i in range(n):\r\n if sequence.count(sequence[i])>(n+1)/2 :\r\n flag=1\r\n print(\"NO\")\r\n break\r\n\r\nif(flag==0):\r\n print(\"YES\")", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\narr = L()\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n st = list(set(arr))\r\n if len(st) == 1:\r\n print('NO')\r\n else:\r\n lis = []\r\n for i in st:\r\n lis.append(arr.count(i))\r\n mx = 0\r\n c = 0\r\n for i in lis:\r\n if i > mx:\r\n c += mx\r\n mx = i\r\n else:\r\n c += i\r\n if c >= (mx-1):\r\n print('YES')\r\n else:\r\n print('NO')", "#!/usr/bin/env python3\n\nfrom collections import Counter\n\nif __name__ == \"__main__\":\n n = int(input())\n a_s = Counter(input().split())\n maximus = max(a_s, key=lambda x: a_s[x])\n sum_of_rest = sum([a_s[x] for x in filter(lambda x: x != maximus, a_s)])\n if sum_of_rest >= a_s[maximus] - 1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "from collections import Counter\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=Counter(a)\r\nk=max(d.values())\r\nif n==1:\r\n print(\"YES\")\r\n exit()\r\n# ans=statistics.mode(a)\r\n# for i in range(n):\r\n# if a[i]==ans:\r\n# k+=1\r\n\r\nh=n-k+1\r\nif k<=h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\narr=[int(x) for x in input().split(' ')]\nmymap={}\nfor item in arr:\n\tif item in mymap:\n\t\tmymap[item]+=1\n\telse:\n\t\tmymap[item]=1\nif any([x for x in mymap.values() if x>(n+1)//2]):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "from collections import Counter\r\n\r\ndef pA(res):\r\n print('YES' if res else 'NO')\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nfreq = Counter(l)\r\nkeys = freq.keys()\r\nif len(keys) == 1:\r\n uniq_freq = list(freq.values())[0]\r\n pA(uniq_freq == 1)\r\nelse:\r\n max_freq = freq.most_common()[0][1]\r\n rest = n - max_freq\r\n pA(max_freq <= rest + 1)", "n = int(input())\narr =list(map(int,input().split()))\nc = 0\nif(n%2==0):\n c = int(n/2)\nelse:\n c = int(n/2)+1\nd = {}\nfor i in arr:\n if i in d:\n d[i]+=1\n else:\n d[i] = 1\nmaxi = d[arr[0]]\nfor i in d:\n if d[i]>maxi:\n maxi = d[i]\nif(maxi>c):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n=int(input())\r\nline=list(map(int,input().split()))\r\nfreq={}\r\nout=0\r\nfor i in line:\r\n freq[i]=freq.get(i,0)+1\r\n if freq[i]>(n//2+n%2):\r\n out=-1\r\n break\r\nif out==-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import Counter\n\nn = int(input())\nseats = Counter((int(i) for i in input().split()))\nx = (n+1)//2\n\nfor i in seats.values():\n if i > x:\n print('NO')\n break\nelse:\n print('YES')", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nb=[]\r\nc=[]\r\nb.extend(a)\r\na=set(a)\r\na=list(a)\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n for i in range(len(a)):\r\n c1 = 0\r\n for j in range(len(b)):\r\n if a[i] == b[j]:\r\n c1 += 1\r\n c.append(c1)\r\n c.sort()\r\n c.reverse()\r\n if len(c)==1:\r\n print(\"NO\")\r\n else:\r\n e=c[0]\r\n c.pop(0)\r\n g=e-1\r\n if sum(c)>=g:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0] * 1001\r\nfor i in a:\r\n b[i] += 1\r\nif max(b) <= n // 2 + (n % 2 + 1) // 2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\na = list(map(int, input().split()))\r\nct = [0] * 1001\r\nfor num in a:\r\n ct[num] += 1\r\nif max(ct) == 1 or (sum(ct) - max(ct) >= max(ct) - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\nl = list(d.keys())\r\n# print(l)\r\nx = (n+1)//2\r\nfor i in l:\r\n if d[i]>x:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")", "f= input()\r\nx=list(map(int, input().split()))\r\ny=set(x)\r\nz=list(y)\r\nsol=[]\r\nfor i in z:\r\n sol.append(x.count(i))\r\na1= max(sol)\r\na2 = sum(sol)-a1\r\nif a1-1>a2:\r\n print(\"NO\")\r\nelse : \r\n print(\"YES\")", "\r\nlog = {}\r\n\r\ntotal = int(input())\r\n\r\nlist_of_ints = input().split()\r\n\r\nlog = {i : list_of_ints.count(i) for i in list_of_ints}\r\n\r\nlog_values = [log[i] for i in log]\r\n\r\nif total % 2 == 0 and max(log_values) < total // 2 + 1:\r\n print(\"YES\")\r\nelif total % 2 == 1 and max(log_values) < (total + 3) // 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=[0]\r\nm=x*1001\r\nz=int(input())\r\nfor z in map(int,input().split()):\r\n m[z]+=1\r\ns=max(m)\r\nm[m.index(s)]=0\r\nh=0\r\ne=0\r\nwhile(h<len(m)):\r\n e+=m[h]\r\n h+=1\r\nif(e>=s-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nvalid = True\r\nn= int(input())\r\nlst = [int(x) for x in input().split()]\r\nset_lst = set(lst)\r\nfor item in set_lst:\r\n c = lst.count(item) #number of count for each item\r\n if n < 2*c -1:\r\n valid = False\r\n break\r\nif valid:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = int(input())\r\nd = [int(d) for d in input().split()]\r\nres = True\r\nfor i in d:\r\n if d.count(i) > 1 and (d.count(i) > ((len(d)) + 1) / 2):\r\n res = False\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nre = True\r\nfor i in a:\r\n if a.count(i) > ((n + 1) // 2):\r\n re = False\r\n break\r\nprint(\"YES\") if re else print(\"NO\")", "n = int(input())\nlst1 = input().split()\ndict1 = {}\nfor i in lst1:\n if i in dict1:\n dict1[i] += 1\n else:\n dict1[i] = 1\nl = len(lst1)\nMax = max(dict1.values())\nif Max > (l+1)//2:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t \t\t\t\t\t\t\t\t\t \t\t\t \t\t \t \t\t", "import math\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\n\r\ndictionary={}\r\n\r\nfor i in lst:\r\n if i not in dictionary:\r\n dictionary[i]=1\r\n else :\r\n dictionary[i]+=1\r\n\r\n\r\nmaximum=0\r\nfor i in dictionary:\r\n if dictionary[i]>maximum:\r\n maximum=dictionary[i]\r\n\r\nl=len(lst)\r\n\r\nif l==1:\r\n print(\"YES\")\r\nelif (maximum>math.ceil(l/2)):\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n", "import math\r\nimport collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\nD=collections.Counter(A)\r\nm=math.ceil(n/2)\r\nfor v in D.values():\r\n if v>m:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nif all(e == numbers[0] for e in numbers) and N != 1:\r\n print('NO')\r\nelif N == 1:\r\n print('YES')\r\nelse:\r\n set_of_numbers = list(set(numbers))\r\n\r\n counter = [None] * len(set_of_numbers)\r\n for i in range(len(set_of_numbers)):\r\n counter[i] = numbers.count(set_of_numbers[i])\r\n\r\n if max(counter) > math.ceil(N/2):\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\nfor item in numbers:\r\n if numbers.count(item)>math.ceil(len(numbers)/2):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\ndef m():\r\n n = eval(input()); x = list(map(eval,input().split())); j = True\r\n d = {}\r\n for i in x:\r\n if i in d: d[i]+=1\r\n else: d[i] = 1\r\n mx = 0\r\n for i in d:\r\n mx = max(mx,d[i])\r\n if mx > math.ceil(n/2): j = 0 ; break\r\n print(\"YES\" if j else \"NO\")\r\nm()", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\ns = set(l)\r\n\r\nm = float('-inf')\r\n\r\nfor i in s:\r\n m = max(m, l.count(i))\r\n\r\nif n >= m+(m-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nlst=(input().split())\r\ns=set(lst)\r\nif all([lst.count(i)*2-1<=n for i in s]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from math import ceil\r\nfrom collections import Counter\r\nn = int(input())\r\nc = Counter(list(map(int, input().split())))\r\nprint('YES') if c.most_common()[0][1]<=ceil(n/2) else print('NO')\r\n", "from collections import Counter\r\nx = input()\r\narr = list(map(int, input() .split(\" \")))\r\ncallValues = Counter(arr)\r\ncomputeVal = (len(arr)+1)//2\r\ndec = False\r\nfor x in callValues:\r\n if callValues[x]>computeVal:\r\n dec = True\r\n break\r\nif not dec:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "while(1):\r\n try:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=[]\r\n for ele in a:\r\n if ele in b:\r\n continue\r\n else:\r\n b.append(ele)\r\n c=1\r\n for ele in b:\r\n if a.count(ele)<=(n+1)//2:\r\n continue\r\n else:\r\n c=0\r\n break\r\n if c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n except EOFError:\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nsetA=set(a)\r\ncouldBe=True\r\nfor i in setA:\r\n if(a.count(i)-1>len(a)-a.count(i)):\r\n couldBe=False\r\n break\r\nif(couldBe):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nli=set(l)\r\nc=0\r\nfor i in li:\r\n if l.count(i)>1:\r\n if l.count(i)>(n+1)/2:\r\n c=1\r\n break\r\n if c:\r\n break\r\nif c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "from math import ceil\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in lst:\r\n if lst.count(i)>ceil(n/2):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nnums = sorted(nums, key = lambda x:nums.count(x))\r\nif(n%2==0):\r\n if(nums.count(nums[-1]) > n//2):\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n if(nums.count(nums[-1]) > (n//2)+1):\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "m = 0\r\na = [0] * 1001\r\n\r\nn = int(input())\r\n\r\nfor i in map(int, input().split()):\r\n a[i] += 1\r\n\r\n if a[i] > m:\r\n m = a[i]\r\n\r\nif m > n // 2 + (1 if n % 2 == 1 else 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\nimport sys\r\nfrom collections import Counter\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\n\r\nar =input()\r\nd=input().split()\r\nv=0\r\nif(int(ar)==1):\r\n print(\"YES\")\r\nelse:\r\n most_common,num_most_common = Counter(d).most_common(1)[0]\r\n if(num_most_common>round(int(ar)/2)):\r\n print(\"NO\")\r\n sys.exit()\r\n print(\"YES\")", "import math\r\nn = int(input())\r\nline = list(map(int,input().split())) \r\nch = math.ceil(n/2)\r\nlis = [0] * 1001\r\nflag = 0\r\nfor k in line:\r\n lis[k] = lis[k] + 1\r\n if(lis[k] > ch):\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncurr_max=0\r\nfor i in range(n):\r\n curr_max=max(arr.count(arr[i]),curr_max)\r\n\r\nif curr_max<=(n+1)//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na= list(map(int,input().split()))\r\nif n==1: print(\"YES\")\r\nelif n==2 and a[0]!=a[1]:\r\n print(\"YES\")\r\nelif n==2 and a[0]==a[1]:\r\n print(\"NO\")\r\nelse:\r\n og=(n+1)//2\r\n ak=[0]*1001\r\n f=1\r\n for i in a:\r\n ak[i]+=1\r\n if ak[i]>og: f=0\r\n \r\n if f==1: print(\"YES\")\r\n else: print(\"NO\")\r\n\n# Fri Jan 07 2022 09:52:06 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\nL=[int(i) for i in input().split()]\r\nS=set(L)\r\nflag=0\r\nfor i in S:\r\n if L.count(i)>(n+1)//2:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import defaultdict\nfrom math import ceil\nn=int(input())\narray=list(map(int,input().split()))\nHashTable=defaultdict(int)\nfor i in array:\n\tHashTable[i]+=1\n\nmaxVal=max(HashTable.values())\nif ceil(n/2)>=maxVal:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nY=\"YES\"\r\nfor i in x:\r\n if x.count(i)*2>n+1:\r\n Y=\"NO\"\r\nprint(Y)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in a:\r\n if a.count(i) * 2 > n + 1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = dict()\r\nmax = 0\r\nfor e in a:\r\n if not (e in d):\r\n d[e] = 0;\r\n d[e]+=1\r\n if d[e] > max:\r\n max = d[e]\r\nif max > (n+1)//2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "n = (int(input()) + 1) // 2\r\nt, p = input().split(), {}\r\nfor i in t:\r\n p[i] = p.get(i, 0) + 1\r\nprint('YNEOS'[max(p.values()) > n:: 2])\r\n ", "from collections import Counter\n\nprint(\n \"YES\"\n if int(input()) >= 2 * Counter(input().split()).most_common(1)[0][1] - 1\n else \"NO\"\n)\n", "#!/usr/bin/python3\n\nn = int(input())\na = list(map(int, input().split()))\nm = max(len([1 for w in a if w == v]) for v in a)\nif 2 * m <= n + 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfreq = {}\r\nfor x in a:\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\nmax_freq = max(freq.values())\r\n\r\nif max_freq <= (n + 1) // 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n n = int(input())\n elems = list(sorted(map(int, input().split(' '))))\n\n cnt = {}\n for x in elems:\n if x not in cnt:\n cnt[x] = 0\n cnt[x] += 1\n\n result = True\n for key, count in cnt.items():\n diff = n - count\n if n % 2 > 0:\n diff += 1\n if count > diff:\n result = False\n break\n\n print('YES' if result else 'NO')\n\n\nif __name__ == \"__main__\":\n main()\n", "counting = [0 for i in range(1003)]\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n counting[i]+=1\r\n\r\nif n%2 == 0:\r\n if(max(counting) > n//2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if(max(counting) > n//2+1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "from math import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in set(l):\r\n if l.count(i)>int(ceil(n/2)):\r\n print('NO')\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n", "from collections import Counter\r\nfrom math import ceil\r\n\r\ninput()\r\nlistofint = input().split()\r\n\r\ncollectionofcounter = Counter(listofint)\r\nhalfoflen = ceil(len(listofint)/2)+1\r\n\r\n\r\nprint(\"YES\" if halfoflen > max(collectionofcounter.values()) else \"NO\")\r\n\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nm = defaultdict(lambda:0)\r\nt=0\r\nfor i in input().split():\r\n \r\n i = int(i)\r\n m[i]+=1\r\n t = max(t,m[i])\r\n\r\nif (t>(n+1)/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=input()\ns=input()\na=s.split()\nfor i in range(len(a)):\n a[i]=int(a[i])\nlength=len(a)\nmax=0\nfor i in a:\n c=a.count(i)\n if c>max:\n max=c\nif max-1>length-max:\n print('NO')\nelse:print('YES')\n\t \t\t\t\t \t\t \t\t\t \t\t \t\t \t\t\t \t\t", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\na=LI()\r\nd=Counter(a)\r\nb=(n+1)//2;flag=1\r\nfor i in d.keys():\r\n if d[i]>b:\r\n print(\"NO\");flag=0\r\n break\r\nif flag:\r\n print(\"YES\")\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax_ = max(arr, key = arr.count)\r\nprint(\"YES\" if(arr.count(max_) <= (n + 1) // 2) else \"NO\")", "n = int(input())\r\nlst = list( map(int, input().split()) )[:n]\r\ndic = {}\r\n\r\nfor x in lst:\r\n dic[x] = dic.get(x, 0) + 1\r\n\r\nmax_occur = 0\r\nfor (i, j) in dic.items():\r\n max_occur = max(max_occur, j)\r\n \r\nprint('YNEOS'[not max_occur<=int((n+1)/2)::2])\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nfreq = {}\n\n\nfor item in arr:\n\tif (item in freq):\n\t\tfreq[item] += 1\n\telse:\n\t\tfreq[item] = 1\n\nli = []\n\nfor key, value in freq.items():\n\tli.append(value)\n\nx = max(li)\ny = (n + 1) // 2\n\nif (x > y):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if a[i] in d:\r\n d[a[i]] += 1\r\n else:\r\n d[a[i]] = 1\r\n\r\nans = 'YES'\r\nfor k, v in d.items():\r\n if n % 2 == 0:\r\n if d[k] > n // 2:\r\n ans = 'NO'\r\n else:\r\n if d[k] > (n + 1) // 2:\r\n ans = 'NO'\r\n\r\nprint(ans) \r\n\r\n\r\n \r\n\r\n", "import math\r\ntry:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n s = set(a)\r\n if n == 1:\r\n print(\"YES\")\r\n else:\r\n v = True\r\n for i in s:\r\n if a.count(i) > math.ceil(n/2):\r\n print(\"NO\")\r\n v = False\r\n if v:\r\n print(\"YES\")\r\nexcept:\r\n pass", "n=int(input())\r\narr=list(map(int,input().split()))\r\nset1=set(arr)\r\nlst=[]\r\nfor x in set1:\r\n\tc=arr.count(x)\r\n\tif c<=(n+1)/2:\r\n\t\tcond=True\r\n\telse:\r\n\t\tcond=False\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "from collections import defaultdict\r\nfrom math import ceil\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nd=defaultdict(int)\r\nfor i in arr:\r\n d[i]+=1\r\nflag=True\r\nm=int(ceil(n/2))\r\n#print(m)\r\nfor i in d.keys():\r\n if(d[i]>m):\r\n flag=False\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nif all([s.count(i)*2-1<=n for i in s]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nimport math as m\r\n\r\nn = int(input())\r\na = arr_inp()\r\ndic = {}\r\nfor i in range(n):\r\n if (str(a[i]) not in dic):\r\n dic[str(a[i])] = 1\r\n else:\r\n dic[str(a[i])] += 1\r\n\r\nif (max(dic.values())> m.ceil(n / 2)):\r\n exit(print('NO'))\r\nprint('YES')\r\n", "from math import ceil\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = Counter(a)\r\nmaxi = max(d.values())\r\nif maxi<=ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nls = list(map(int,input().split(\" \")))\ndic = {}\nfor i in range(n):\n if ls[i] not in dic:\n dic[ls[i]] = 1\n else:\n dic[ls[i]]+=1\nif(n%2==1): n+=1\nc = 0\nfor k,v in dic.items():\n if v>n/2:\n c =1\n break\nif c == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nc=math.ceil(n/2)\r\nfor i in l:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nf=0\r\nfor i in d:\r\n\tif d[i]>c:\r\n\t\tf=1\r\n\t\tbreak\r\nprint([\"YES\",\"NO\"][f==1])", "dict = {}\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nma=1\r\nfor x in a:\r\n if x in dict:\r\n dict[x]+=1\r\n ma=max(ma,dict[x])\r\n else:\r\n dict[x]=1\r\nif ma<=(n+1)//2:print(\"YES\")\r\nelse:print(\"NO\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmx = 0\r\nfor i in arr:\r\n mx = max(mx, arr.count(i))\r\nprint('YES' if mx <= n // 2 + n % 2 else 'NO')\r\n", "n = int(input())\r\narray = list(map(int,input().split()))\r\n\r\ncnt = { i : array.count(i) for i in list(set(array))}\r\n\r\nsorted_array = sorted(list(cnt.items()), key = lambda x : x[1] ) \r\n\r\nm = sorted_array.pop()\r\n\r\npp = 0\r\nfor i in sorted_array :\r\n pp += i[1]\r\n\r\nif pp >= m[1] - 1 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n\r\n", "# LUOGU_RID: 102443147\nfrom collections import Counter\r\nn, *a = map(int, open(0).read().split())\r\nprint(Counter(a).most_common()[0][1] <= (n + 1) // 2 and 'YES' or 'NO')", "import collections\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nd=collections.Counter(a)\r\n#print(d)\r\nflag=0\r\nif n%2==0:\r\n s=n//2\r\nelse:\r\n s=(n+1)//2\r\nfor i in a:\r\n if d[i]>s:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if d.get(i):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nmx=0\r\nfor i in d.keys():\r\n if mx<d[i]:\r\n mx=d[i]\r\nif n//2>=mx:\r\n print('YES')\r\nelse:\r\n if n%2!=0 and mx==(n//2)+1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n # 1 1 1 3 3", "#!/usr/bin/python3\n\nn = int(input())\na = map(int, input().split())\n\ncnt = dict()\nfor b in a:\n if b not in cnt:\n cnt[b] = 0\n cnt[b] += 1\n\nfor v in cnt.values():\n if v > (n + 1) // 2:\n print(\"NO\")\n exit(0)\n\nprint(\"YES\")\n", "n=int(input())\r\nl=input().split()\r\nprint(\"YES\" if all([l.count(i)*2-1<=n for i in l]) else \"NO\")", "n = int(input())\r\narray=list(map(int,input().split()))\r\na__=[]\r\nfor i in array:\r\n a=0\r\n for j in range(n):\r\n if i==array[j]:\r\n a+=1\r\n a__.append(a)\r\nmax_=max(a__)\r\nif n%2==0:\r\n if n/2>=max_:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if n/2+1>=max_:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n =int (input())\r\nc=0\r\nll=list(map(int,input().split()))\r\nfor i in set(ll):\r\n temp=0\r\n for j in ll:\r\n if i==j:\r\n temp+=1\r\n\r\n if temp>c:\r\n c=temp \r\n \r\n\r\nprint( \"YES\" if n>=2*c-1 else \"NO\")", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n#n<2*count or n+1>=2*count\r\nprint(\"YES\" if all([arr.count(i)*2-1<=n for i in arr]) else \"NO\")\r\n", "n = int(input())\r\na = [int(val) for val in input().split()] \r\nrepo = {}\r\nfor ai in a:\r\n if ai in repo:\r\n repo[ai] += 1\r\n else:\r\n repo[ai] = 1\r\nmax_num = 0\r\nfor num in repo.values():\r\n if num > max_num:\r\n max_num = num\r\nif max_num * 2 - 1 > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn = int(input())\r\n#n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\n\r\nd = Counter(l)\r\nh = list(d.values())\r\nh.sort(reverse = True)\r\nif (n % 2 == 0 and h[0] <= n //2) or (n%2 != 0 and h[0] <= (n//2)+1 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def sol() :\r\n n = int(input())\r\n d = {}\r\n if n ==1:\r\n print('YES')\r\n return\r\n for i in input().split():\r\n num = int(i)\r\n if num not in d:\r\n d[num]=0\r\n d[num]+=1\r\n m = max(d.values())\r\n if m>((n+1)/2):\r\n print('NO')\r\n else:\r\n print('YES')\r\nsol()", "from collections import Counter \r\nn=int(input());t=(n+1)//2\r\nl=Counter(list(map(int,input().split())))\r\nif max(l.values()) > t:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nflag=1\r\nfor i in l:\r\n if (l.count(i)*2)-1 > n:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import defaultdict\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfreq = defaultdict(int)\r\n\r\nT = True\r\nfor i in arr:\r\n\tfreq[i] += 1\r\n\tif freq[i] >= (n + 2 - 1) // 2 + 1:\r\n\t\tT = False\r\n\t\tbreak\r\nprint(\"YES\" if T else \"NO\")", "from math import ceil\r\ndef invert():\r\n n = int(input())\r\n numbers = list(map(int, input().split()))\r\n \r\n if n == 1:\r\n return \"YES\"\r\n set_numbers = set(numbers)\r\n count_numbers = []\r\n for number in set_numbers:\r\n count_numbers.append(numbers.count(number))\r\n max_count = max(count_numbers)\r\n if max_count > ceil(len(numbers)/2):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(invert())", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = set(a)\r\nb = list(b)\r\nsums = 0\r\nfor i in range(len(b)):\r\n sums = max(sums,a.count(b[i]))\r\nif n-sums<sums-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "import collections,math\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nd=collections.defaultdict(int)\r\nfor num in lst:\r\n d[num]+=1\r\nmaxi=0\r\nfor ele in d:\r\n if d[ele]>maxi:\r\n maxi=d[ele]\r\nif maxi<=math.ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nall = [0] * max(s)\r\nfor i in range(n):\r\n all[s[i] - 1] += 1\r\nfl = True\r\nfor i in all:\r\n if i > (n + 1) / 2:\r\n fl = False\r\nif not fl:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\nl = list(map(int, input().split()))\nl_set = set(l)\n\nfor i in l_set:\n if n < 2*l.count(i)-1:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n\t \t\t\t \t\t \t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = [0]*(1001)\r\nfor i in l:\r\n x[i]+=1\r\nif max(x) <= ((n+1)//2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n\r\n\r\n", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\nres, cnt = None, Counter()\nfor i in a:\n cnt[i] += 1\n if not res or cnt[i] > cnt[res]:\n res = i\nres = \"YES\" if cnt[res] <= (n + 1) // 2 else \"NO\"\nprint(res)\n", "from collections import Counter\r\nn=int(input())\r\nc=Counter(input().split())\r\nlst=[]\r\nfor i in c:\r\n lst.append(c[i])\r\nlst.sort(reverse=True)\r\nif (len(lst)==1 and lst[0] >1) or lst[0]>sum(lst[1:])+1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na = list(map(int, input().split()))\r\ndi = {}\r\nfor i in range(n):\r\n di[a[i]] = di.get(a[i], 0) + 1\r\n\r\nif n % 2 == 0:\r\n for i in di.values():\r\n if i > n // 2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in di.values():\r\n if i > n // 2 + 1:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "import math\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nclst = Counter(lst)\r\n\r\nfor i in clst.values():\r\n if (i>math.ceil(n/2)):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "from math import ceil\n\nn = int(input())\narr = input().split()\ncan = True\n\nfor i in set(arr):\n if arr.count(i) > ceil(n / 2):\n can = False\n break\n \nprint(\"YES\") if can else print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Count the frequency of each integer in the array\r\nfreq = {}\r\nfor x in a:\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\n# Check if it's possible to obtain the required array\r\nmax_freq = max(freq.values())\r\nif max_freq > (n+1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def Yaroslav(n,arr):\r\n arr=sorted(arr)\r\n d={}\r\n for i in range(n):\r\n if arr[i] not in d:\r\n d[arr[i]]=1\r\n else:\r\n d[arr[i]]+=1\r\n C=max(d.values())\r\n if n>=(2*C-1):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(Yaroslav(n,arr))", "import math\r\n\r\nn = int(input())\r\nelements = list(map(int, input().split()))\r\n\r\nresult = \"YES\"\r\n\r\nfor i in list(set(elements)):\r\n if elements.count(i) > math.ceil(len(elements)/2):\r\n result = \"NO\"\r\n\r\nprint(result)\r\n\r\n", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nd={}\r\nfor i in lst:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nma=0\r\nfor i in d:\r\n if d[i]>ma:\r\n ma=d[i]\r\nif n%2==0:\r\n if ma<=n//2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if ma<=(n//2)+1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=Counter(l)\r\na=1\r\nfor i in x:\r\n if x[i]>(n+1)//2:\r\n a=0\r\n break\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def num():\n return int(input())\n\ndef getnums():\n return map(int, input().split(' '))\n\ndef getstring():\n return input()\n\ndef yes():\n print(\"YES\")\n\ndef no():\n print(\"NO\")\n\nn = num()\na = getnums()\n\nm = {}\nfor i in a:\n m[i] = 1+m.get(i, 0)\n\nif(max(m.values()) <= (n+1)//2):\n yes()\nelse:\n no()", "n=int(input())\r\na=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if a[i] in dic:\r\n dic[a[i]]+=1\r\n else:\r\n dic[a[i]]=1\r\nmaxi=max(dic.values())\r\nif(maxi<=(n+1)//2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn = I()\r\nA = IL()\r\nmc = max([A.count(i) for i in set(A)])\r\nprint(\"YES\" if mc<=(n+1)//2 else \"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef main():\r\n n = int(input())\r\n arr = Iarr()\r\n for x in arr:\r\n cek = arr.count(x)\r\n if(cek*2>n+1):\r\n ans = True\r\n break\r\n else:\r\n ans = False\r\n\r\n if(ans):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nif __name__ == '__main__':\r\n main()", "def f(square):\r\n if len(square)%2 == 0:\r\n for i in range(1,1001):\r\n if square.count(i) > len(square)/2:\r\n return \"NO\"\r\n else:\r\n for i in range(1,1001):\r\n if square.count(i) > (len(square)//2)+1:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\nn = int(input())\r\nsquare = input()\r\nsquare = [int(i) for i in square.split(\" \")]\r\nprint(f(square))", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\n\r\na = list(map(int, input().split(' ')))\r\ncounter=Counter(a)\r\n#print(counter.most_common()[0])\r\nif counter.most_common()[0][1] > math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input(''))\r\nb=input('')\r\nm=b.split(' ')\r\na=[]\r\nfor i in m:\r\n a.append(int(i))\r\nc=[]\r\nd=[]\r\nfor i in a:\r\n if i not in c:\r\n c.append(i)\r\n d.append(a.count(i))\r\n else:\r\n continue\r\nif n&1==1 and max(d)<=n//2+1:\r\n print(\"YES\")\r\nelif n&1==0 and max(d)<=n//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nc = Counter(x)\r\nif 2 * max(c.values()) > n + 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nprint(\"NO\" if any(s.count(i)>((n+1)//2) for i in s) else \"YES\")", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nfrom math import ceil\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\n\r\nif n==1:\r\n print('YES')\r\n exit()\r\n\r\nreq=ceil(n/2)\r\n\r\nfor i in set(L):\r\n if L.count(i)>req:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range (n):\r\n if(l[i] not in d):\r\n d[l[i]]=0\r\n d[l[i]]+=1\r\nl1=list(d.values())\r\nif(n%2==0):\r\n n=n//2\r\nelse:\r\n n=(n+1)//2\r\nc=0\r\nfor i in range (len(l1)):\r\n if(l1[i]>n):\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nn=int(input())\r\nA=input().split()\r\nB=set(A)\r\nif(n%2==0):\r\n limit=n//2\r\nelse:\r\n limit=n//2+1\r\nfor i in B:\r\n\r\n if A.count(i)>limit:\r\n print(\"NO\")\r\n sys.exit(0)\r\nprint(\"YES\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append(a.count(a[i]))\r\nprint(\"YES\") if(max(c)<=(n+1)/2) else print(\"NO\")", "n = int(input())\r\na = input().split()\r\nprint(\"YES\" if all(a.count(i)*2-1 <= n for i in a) else \"NO\")", "\r\nimport statistics\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nans=statistics.mode(a)\r\nfor i in range(n):\r\n if a[i]==ans:\r\n k+=1\r\n\r\nh=n-k+1\r\nif k<=h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nfreq = 1000 * [0]\r\nres = 0\r\nfor j in range(n):\r\n freq[nums[j] - 1] += 1\r\n res = max(res, freq[nums[j] - 1])\r\nimport math\r\nif n != 1 and res > math.ceil(n / 2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\narr=list(map(int,input().split()));d={}\r\nfor i in arr:d[i]=d.get(i,0)+1\r\nmaxx=0\r\nfor i in d:maxx=max(d[i],maxx)\r\nif n%2==0 and maxx>n//2:print(\"NO\")\r\nelif n%2==1 and maxx>n//2+1:print(\"NO\")\r\nelse:print(\"YES\")\r\n", " \r\n # static boolean visited[][]=new boolean[7][7];\r\n # static int ans=0;\r\n # public static void helper(int i, int j, int index, String s,int count) {\r\n \r\n # if(i<0 || j<0 || i>6 || j>6)\r\n # return ;\r\n \r\n # if(i==6 && j==0) {\r\n # if(count==48)\r\n # ans+=1;\r\n # return;\r\n # }\r\n # if(visited[i][j])\r\n # return;\r\n \r\n # visited[i][j]=true;\r\n # if(s.charAt(index)=='?') {\r\n # helper(i,j-1,index+1,s,count+1);\r\n # helper(i,j+1,index+1,s,count+1);\r\n # helper(i-1,j,index+1,s,count+1);\r\n # helper(i+1,j,index+1,s,count+1);\r\n \r\n # }\r\n # else if(s.charAt(index)=='L')\r\n # helper(i,j-1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='R')\r\n # helper(i,j+1,index+1,s,count+1);\r\n # else if(s.charAt(index)=='U')\r\n # helper(i-1,j,index+1,s,count+1);\r\n # else\r\n # helper(i+1,j,index+1,s,count+1);\r\n # visited[i][j]=false;\r\n \r\n \r\n \r\n # }\r\n\r\nn=int(input())\r\narr=list(map(int, input().split()))\r\nfreq_arr=[0]*(1001)\r\n\r\nfor i in arr:\r\n freq_arr[i]+=1\r\n\r\nm=0\r\nfor i in freq_arr:\r\n m=max(m,i)\r\na=-1\r\nif(n%2==0):\r\n a=n//2\r\nelse:\r\n a=(n+1)//2\r\nif(m>a):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "\r\nnum = int(input())\r\ndata = list(map(int, input().split()))\r\ncount = data.count(data[0])\r\nfor i in range(num):\r\n y = data.count(data[i])\r\n if y >= count:\r\n count = y\r\n\r\nif count <= (num + 1) / 2:\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n", "import collections\nde = collections.deque([])\nn = int(input())\nde = [int(x) for x in input().split()]\na = [val for val in set(de)]\nb = []\ntotal = 0\nfor i in a:\n b.append(de.count(i))\n total += de.count(i)\n\nif total - max(b) >= max(b)-1:\n print(\"YES\") \nelse:\n print(\"NO\") ", "n = int(input())\r\na = [int(x) for x in (input().split())]\r\nls = []\r\nstat = 'YES'\r\n\r\n\r\nfor i in a:\r\n\tif not a.count(i) <= (n + 1) / 2:\r\n\t\tstat = ('NO')\r\n\t\tbreak\r\n\r\nprint(stat)", "n=int(input())\r\nif n==1:\r\n print('YES' )\r\n exit()\r\n\r\ncont=[]\r\nf=''\r\nls=input().split()\r\nls=list(map(int,ls))\r\nfor i in range(len(ls)):\r\n if f.find(str(ls[i]))==-1 :\r\n f+=str(ls[i])\r\n cont.append(ls.count(ls[i]))\r\n\r\nf=True\r\nfor i in range(len(cont)):\r\n if n < 2*cont[i]-1:\r\n f=False\r\nif f: print('YES')\r\nelse: print('NO') ", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n# def solve(key, seen, arr):\r\n# for i in range(10):\r\n# key[-1] = str(i)\r\n# # print(key)\r\n# if (key not in seen) and (key not in arr):\r\n# return key\r\n\r\nnum = int(input())\r\ncom = Counter(map(int, input().split())).most_common()[0][1]\r\n\r\nif com > num - com +1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nprint(\"YES\"if all([s.count(i)*2-1<=n for i in s])else\"NO\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = Counter(a)\r\n\r\nif max(cnt.values()) > (n + 1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\nnums=eval(input())\nlist=input().split()\nmax1=0\nfor i in list:\n if max1<list.count(i):\n max1=list.count(i)\nif max1>math.ceil((len(list)/2)):\n print(\"NO\")\nelse :print(\"YES\")\n\n\t\t\t \t\t \t\t \t \t \t\t \t", "\r\n\r\nif __name__==\"__main__\":\r\n \r\n n=int(input())\r\n li=list(map(int,input().split(\" \")))\r\n ma=max(li)\r\n lis=[0 for x in range(ma+1)]\r\n z=-1\r\n for i in range(0,n):\r\n lis[li[i]]+=1\r\n if(lis[li[i]])>((n+1)/2):\r\n z=0\r\n break\r\n if(z==-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "def INT():\r\n return int(input())\r\n\r\ndef lis():\r\n return [int(x) for x in input().split()]\r\n \r\nn = INT()\r\ncheck = (n+2-1)//2\r\na = lis()\r\nb = set(a)\r\nflag=0\r\nfor i in b:\r\n if a.count(i)>check:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nn=int(input())\r\n\r\na=sorted(map(int,input().split()))\r\nc=Counter(a)\r\nif n==1:\r\n print('YES')\r\nelse:\r\n \r\n ok=True\r\n for _,freq in c.items():\r\n if freq>(n+1)//2:\r\n ok=False\r\n break\r\n if ok:\r\n print('YES')\r\n else:\r\n print('NO')", "import statistics\r\nfrom statistics import mode\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=mode(b)\r\nd=b.count(c)\r\nif (a+1)//2>=d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n s=list(set(a))\r\n for i in s:\r\n if a.count(i)>((n+1)//2):\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\") \r\n\r\n ", "import math\r\n\r\nn = int(input())\r\n\r\narr = input()\r\nl = list(map(int,arr.split(' ')))\r\nhashmap = {}\r\nfor i in l:\r\n if i in hashmap:\r\n hashmap[i] = hashmap[i]+1\r\n else:\r\n hashmap[i] = 1\r\n\r\nflag = False\r\nfor key in hashmap:\r\n if hashmap[key] > math.ceil(n/2.0):\r\n flag = True\r\n \r\nif flag == True:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\tarr = list(map(int,input().split()))\r\n\tcnt = 1 \r\n\tmax_cnt = 0\r\n\ti = 0\r\n\tdp = [0 for _ in range(1001)]\r\n\tfor x in arr:\r\n\t\tdp[x]+=1\r\n\tmax_cnt = max(dp)\r\n\tif max_cnt<=((N+1)//2):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nmain()", "n=int(input())\r\nl=list(input().split())\r\nans=\"YES\"\r\nfor i in l:\r\n if l.count(i)*2-1>n :\r\n ans=\"NO\"\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i,0) + 1\r\nfor i in d:\r\n if d[i] > (n+1) // 2 :print(\"NO\"); break\r\nelse:print(\"YES\")", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nmx=max([a.count(x) for x in set(a)])\r\nif n-mx>=mx-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nfrq=[0]*1001\r\nm=0\r\nfor i in nums:\r\n frq[i]+=1\r\n ## that's max\r\n if frq[i]>m:m=frq[i]\r\n\r\n\r\nif m>n//2+(n&1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n \r\n\r\n", "import sys\r\nz=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in set(x):\r\n c = x.count(i)\r\n if z < 2*c-1 :\r\n print('NO')\r\n sys.exit(0)\r\nprint(\"YES\") \r\n", "n=int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncont=1; mx_cont=1\r\nfor i in range(1, n):\r\n if arr[i]==arr[i-1]:\r\n cont+=1\r\n mx_cont = max(mx_cont, cont)\r\n else:\r\n cont=1\r\n\r\nprint(\"YES\" if mx_cont<=(n+1)//2 else \"NO\")", "n = int(input())\r\nA = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if A[i] not in d.keys(): d[A[i]] = 1\r\n else: d[A[i]] +=1\r\nif n % 2 != 0:\r\n cmp = n // 2 + 1\r\nelse: cmp = n // 2\r\n\r\nif (max(d.values()) > cmp):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import Counter\r\nn=int(input())\r\na=[*map(int,input().split())]\r\nd=Counter(a)\r\nans='YES'\r\nfor i in d.values():\r\n if i>-(-n//2):ans='NO'\r\nprint(ans)", "n=int(input())\na=input().split()\nmaxNum=0\nfor i in a:\n count=0\n for j in a:\n if i==j:\n count+=1\n if maxNum<count:\n maxNum=count\nif len(a)%2==0:\n if maxNum<=len(a)/2:print('YES')\n else:print('NO')\nelse:\n if maxNum<=(len(a)+1)/2:print('YES')\n else:print('NO')\n \t \t \t\t \t\t\t \t\t\t \t\t\t\t\t\t\t \t", "import collections\r\nn=int(input())\r\nl=list(map(int,input().strip().split()))\r\nd={}\r\nc=collections.Counter(l)\r\nk=c.most_common(1)\r\nif n//2<=(n-k[0][1]):print('YES')\r\nelse:print('NO')", "def distinct_elements(a,n):\r\n\tfreq = dict()\r\n\r\n\tfor i in range(n):\r\n\t\tif a[i] in freq:\r\n\t\t\tfreq[a[i]] += 1\r\n\t\telse:\r\n\t\t\tfreq[a[i]] = 1\r\n\r\n\tmax_occur = 0\r\n\tfor i in range(n):\r\n\t\tif max_occur < freq[a[i]]:\r\n\t\t\tmax_occur = freq[a[i]]\r\n\r\n\treturn max_occur\r\n\r\nn = int(input())\r\na = input().split()\r\nmax_occur_freq = distinct_elements(a,n)\r\nif max_occur_freq > ((n + 1) // 2):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif n==1:\r\n print('YES')\r\nelif n==2:\r\n print('YES' if l[0]!=l[1] else 'NO')\r\nelse:\r\n f=1\r\n from collections import Counter\r\n c=Counter(l)\r\n for i in c:\r\n if n&1:\r\n k=n//2 \r\n if c[i]>k+1:\r\n f=0\r\n break\r\n else:\r\n k=n//2 \r\n if c[i]>k:\r\n f=0\r\n break\r\n print('YES' if f else 'NO')\r\n ", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\nn= (map(int, input().split()))\r\n\r\n\r\na = list(map(int, input().split()))\r\n\r\ncount = 1\r\n\r\na. sort()\r\nmax_ = 0\r\nfor i in range(1, len(a)):\r\n if(a[i-1]==a[i]):\r\n count += 1\r\n else:\r\n count = 1\r\n max_ = max(max_, count)\r\n\r\nif(len(a)%2):\r\n size = len(a) + 1\r\nelse:\r\n size = len(a)\r\nif(max_<=size//2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nf = {}\r\nfor num in nums:\r\n f[num] = f.get(num,0) + 1\r\n \r\nmaxf = max(f.values())\r\nif maxf * 2 - 1 <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def func():\n from collections import Counter\n n = int(input())\n if n == 1:\n return True\n arr = list(map(int, input().split()))\n c = Counter(arr)\n for _, count in c.most_common():\n if count >= n / 2 + 1:\n return False\n return True\n\nprint(\"YES\" if func() else \"NO\")", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint('YES' if all(a.count(i)*2-1 <=n for i in a) else 'NO')\r\n", "import math\r\nn=int(input())\r\nx=input().split()\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\nc={}\r\nfor k in x:\r\n if k not in c:\r\n c[k]=1\r\n else:\r\n c[k]+=1\r\ncount=0\r\nfor key,value in c.items():\r\n if value>math.ceil(n/2):\r\n print('NO')\r\n break\r\n else:\r\n count+=1\r\nif count==len(c):\r\n print('YES')\r\n\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if(arr[i] in dic.keys()):\r\n dic[arr[i]]+=1\r\n else:\r\n dic[arr[i]]= 1\r\n\r\nmax1=0\r\nfor i in dic.keys():\r\n if(dic[i]>max1):\r\n max1=dic[i]\r\n\r\nif(n%2==0):\r\n if(max1>n//2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nelse:\r\n if(max1>n//2 +1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "def num_check(num_list, num_cnt):\r\n global flag\r\n global list_of_numbers\r\n \r\n num_list = num_list.split(' ')\r\n if len(num_list) != num_cnt:\r\n print('\\nNumber list out of bounds. Expected {} numbers.'.format(num_cnt))\r\n return\r\n for i in num_list:\r\n if '.' in i:\r\n print('\\nEnter an integer.\\n')\r\n return\r\n try:\r\n num = int(i)\r\n if num not in list_of_numbers.keys():\r\n list_of_numbers[num] = 1\r\n else:\r\n list_of_numbers[num] += 1\r\n except:\r\n if i != ' ':\r\n print('\\nEnter the numbers separated by a space.')\r\n return\r\n else:\r\n pass\r\n flag = 1\r\n \r\ndef selection_sort():\r\n global list_of_numbers\r\n \r\n list_of_numbers = list(list_of_numbers.items())\r\n for i in range(len(list_of_numbers)-1):\r\n for j in range(i+1, len(list_of_numbers)):\r\n if list_of_numbers[i][1] < list_of_numbers[j][1]:\r\n list_of_numbers[j], list_of_numbers[i] = list_of_numbers[i], list_of_numbers[j]\r\n\r\nif __name__ == '__main__':\r\n flag = 0\r\n list_of_numbers = {}\r\n num_cnt = int(input())\r\n while flag == 0:\r\n num_list = input()\r\n num_check(num_list, num_cnt)\r\n selection_sort()\r\n \r\n highest_freq = list_of_numbers[0][1]\r\n if num_cnt-highest_freq >= round(num_cnt//2):\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nneed = n // 2\r\nif n % 2 != 0:\r\n\tneed += 1\r\nmax_cnt = 0\r\nfor el in set(lst):\r\n\tmax_cnt = max(lst.count(el), max_cnt)\r\nif max_cnt > need:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "import math\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans=[]\r\ncount=1\r\nfor i in range(0,len(a)-1):\r\n if a[i]==a[i+1]:\r\n count+=1\r\n else:\r\n ans.append(count)\r\n count=1\r\nans.append(count)\r\nif n==1:\r\n print(\"YES\")\r\nelif max(ans)>math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nif(n == 1):\r\n\tprint('YES')\r\ns = input().split()\r\ns = [int(i) for i in s]\r\na = {}\r\nif(n>=2):\r\n\tfor i in range(n):\r\n\t\tif(s[i] not in a.keys()):\r\n\t\t\ta[s[i]] = 1\r\n\t\telse:\r\n\t\t\ta[s[i]] += 1\r\n\r\n\tflag = 0\r\n\tfor i in a.keys():\r\n\t\tif(a[i] > (n+1)//2):\r\n\t\t\tprint('NO')\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif(flag == 0):\r\n\t\tprint('YES')\r\n", "\r\n# Problem: A. Yaroslav and Permutations\r\n# Contest: Codeforces - Codeforces Round #179 (Div. 2)\r\n# URL: https://codeforces.com/contest/296/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\nimport math\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\narr = get_ints()\r\nflag = True\r\nfor i in arr:\r\n\tif arr.count(i) > math.ceil(n/2):\r\n\t\tprint(\"NO\")\r\n\t\tflag =False\r\n\t\tbreak\r\n\r\nif flag:\r\n\tprint(\"YES\")", "def main():\n n = int(input())\n nums = list(map(int, input().split(' ')))\n m = {}\n for num in nums:\n if num in m:\n m[num] += 1\n else:\n m[num] = 1\n for num in nums:\n if m[num] > (n + 1)//2:\n return False\n return True\n\n\nprint(\"YES\") if main() else print(\"NO\")\n", "y=int(input())\r\narray=list(map(int,input().split()))\r\ncount=0\r\nfor i in array:\r\n x=array.count(i)\r\n if x+x-1>len(array):\r\n print('NO')\r\n count+=1\r\n break\r\nif count==0:\r\n print('YES')", "from collections import Counter\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nn = (n + 1) // 2\r\nd=Counter(arr)\r\nfor val in d.values():\r\n if val>n:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")", "from collections import defaultdict\r\nimport operator\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\nocc = defaultdict(lambda: 0)\r\n\r\nfor i in arr:\r\n occ[i] += 1\r\n\r\nMaxValue = max(occ.items(), key=operator.itemgetter(1))[1]\r\nprint('YES' if MaxValue <= (n+1)//2 else 'NO')\r\n", "from collections import Counter\nn = int(input())\nlst = [int(x) for x in input().split()]\nc = Counter(lst)\nprint (\"YES\" if c.most_common(1)[0][1] * 2 - 1 <= n else \"NO\")\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nunique = set(l)\r\nflag = 1\r\nfor i in unique:\r\n if (l.count(i)*2)-1 > n:\r\n flag = 0\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nelementsMap = Counter(map(int,input().split()))\r\n\r\nfor element,count in elementsMap.items():\r\n\r\n if count > ((n+1) / 2):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "from collections import Counter\r\ndef solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n if n==1:\r\n print(\"YES\")\r\n return\r\n d=Counter(l)\r\n x=max(d.values())\r\n if x<=n-x+1:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nsolve()\r\n", "from math import ceil\r\n\r\nn = int(input().strip())\r\nlst = list(map(int, input().strip().split()))\r\ncount_lst = []\r\nlst.sort()\r\ni = 0\r\nwhile i < n:\r\n count = lst.count(lst[i])\r\n count_lst.append(count)\r\n i += count\r\nmax_count = max(count_lst)\r\nif max_count > ceil(n / 2):\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\na = math.ceil(int(input())/2)\r\nb = list(map(int,input().split()))\r\nc = set(b)\r\nif len(b)>=2:\r\n if any(b.count(i)>a for i in c):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print('YES')", "def Yaroslav_and_Permutations():\r\n n = int(input())\r\n sequence = list(map(int,input().split()))\r\n\r\n freqCount_dict = {}\r\n\r\n for i in sequence:\r\n if i in freqCount_dict.keys():\r\n freqCount_dict[i] += 1\r\n else:\r\n freqCount_dict[i] = 1\r\n\r\n max_count = 0\r\n for i in freqCount_dict.keys():\r\n if freqCount_dict[i] > max_count:\r\n max_count = freqCount_dict[i]\r\n\r\n if n%2 == 0:\r\n if max_count > n//2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n if max_count > ((n//2) + 1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nYaroslav_and_Permutations()", "n=int(input())\r\nlist1=map(int,input().split())\r\nhash_map={}\r\nfor i in list1:\r\n if i not in hash_map:\r\n hash_map[i]=1\r\n else:\r\n hash_map[i]+=1\r\nflag=0\r\nfor i in hash_map:\r\n if hash_map[i]*2-1<=n:\r\n continue\r\n else:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nq = [0] * 1005\r\nf = 1\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n q[a[i]] += 1\r\n if q[a[i]] > n // 2 + (n % 2):\r\n f = 0\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nlc = Counter(l)\r\nlcm = max(lc.items(), key=lambda x: x[1])\r\n\r\nif lcm[1]*2-1 <= n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\r\n\tcount={}\r\n\tfor i in arr:\r\n\t\tif i not in count:\r\n\t\t\tcount[i]=1\r\n\t\telse:\r\n\t\t\tcount[i]+=1\r\n\r\n\tmaxi=n/2\r\n\tif int(maxi)!=maxi:\r\n\t\tmaxi=int(maxi)+1\r\n\tmx=0\r\n\tfor i in count:\r\n\t\tmx=max(mx, count[i])\r\n\tif mx<=maxi:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()\r\n", "n, a = int(input()), map(int, input().split())\r\nh = n // 2 + 1 + n % 2\r\nm = {}\r\nfor x in a:\r\n if x in m:\r\n m[x] += 1\r\n else:\r\n m[x] = 1\r\nprint(\"YES\" if max(m.values()) < h else \"NO\")", "import collections as coll\r\nn, seq = int(input()), coll.Counter(map(int,input().split(\" \")))\r\nx = seq.most_common(1)[0][1]\r\nif n % 2 == 0:\r\n if x >= (n / 2) + 1:\r\n print(\"NO\")\r\n else: print(\"YES\")\r\nelif n % 2 != 0:\r\n if x >= (n // 2) + 2:\r\n print(\"NO\")\r\n else: print(\"YES\")\r\n\r\n\r\n''' \r\n\r\n\r\nIdea:\r\nIf one number among our sequence is set on at least (size / 2) + 1 places\r\nit means that we cannot divide her placement even every second\r\nposition. There must be at least one place where her neighbor is \r\nthe same number. Other half of numbers could be different or the same\r\ndoesn't matter at this point. But maybe further the question appears,\r\nare we able to get an example when even without such situations \r\nwe still cannot satisfy the condition of our permutation.\r\nThis is true for even amount of elements.\r\nOdd amount of elements:\r\nIf one elements appears more or equal times to (size // 2) + 2. (NO)\r\n(Chodzi tutaj o to chyba zeby na kazda pare liczb takich samych \r\nprzypadala jedna ktora je rodziela)\r\n\r\ncheck:\r\n7 7 2 1 -> 2 7 1 7\r\n7 7 2 2 -> 7 2 7 2\r\n7 7 7 1 -> 1 (7 7).. X\r\n7 7 4 5 8 -> 7 4 7 5 8\r\n7 7 7 1 1 -> 7 1 7 1 7 7\r\n7 7 7 7 3 4 6 -> 7 3 7 4 7 6 7\r\n\r\n'''\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nk=[0 for x in range(1001)]\r\nfor x in range(n):\r\n k[ar[x]]+=1 \r\nv=max(k)\r\noth=n-v\r\nif oth>=v-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(n):\r\n d = dict()\r\n for i in input().split():\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n if n%2:\r\n n += 1\r\n for i in d.values():\r\n if i > n//2:\r\n print(\"NO\"); break\r\n else:\r\n print(\"YES\")\r\n\r\ndef main():\r\n solve(int(input()))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import heapq\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor num in arr:\r\n if num not in d:\r\n d[num] = 0\r\n d[num] += 1\r\n\r\nmaxHeap = []\r\nfor index in d:\r\n count = d[index]\r\n heapq.heappush(maxHeap, (-count, index))\r\n\r\nans = \"YES\"\r\ncoolDown = []\r\nt = 1\r\nwhile maxHeap or coolDown:\r\n while coolDown and coolDown[0][0] == t:\r\n count, num = coolDown[0][1], coolDown[0][2]\r\n coolDown.pop(0)\r\n heapq.heappush(maxHeap, (-count, num))\r\n if not maxHeap:\r\n ans = \"NO\"\r\n break\r\n count, frequent_num = maxHeap[0]\r\n count = -count\r\n heapq.heappop(maxHeap)\r\n if count - 1 >= 1:\r\n coolDown.append([t+2, count-1, frequent_num])\r\n t += 1\r\nprint(ans)\r\n\r\n", "from math import ceil\r\nn = int(input())\r\na = input().split()\r\nd = {}\r\nfor i in a:\r\n d[i] = d.get(i, 0)+1\r\nfor i in d:\r\n if d[i] > ceil(n/2):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\nfreq = defaultdict(int)\r\nli = []\r\nfor _ in input().split():\r\n\tfreq[int(_)] += 1\r\n\tli.append(int(_))\r\n\r\n\r\nif n == 1:\r\n\tprint('YES')\r\n\texit()\r\n\r\nelse:\r\n\tm = 0\r\n\tfor i in freq:\r\n\t\tif freq[i] > (n+1)//2:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n\tprint('YES') \r\n ", "from math import *\r\nfrom collections import *\r\nfrom sys import *\r\nimport string\r\nimport re\r\nt=stdin.readline\r\np=stdout.write\r\ndef GI(): return map(int, t().strip().split())\r\ndef GS(): return map(str, t().strip().split())\r\ndef IL(): return list(map(int, t().strip().split()))\r\ndef SL(): return list(map(str, t().strip().split()))\r\n\r\nn=int(t())\r\na=IL()\r\nb=(n+1)//2\r\nf=1\r\nfor i in set(a):\r\n if a.count(i)>b: f=0;print('NO');break\r\nif f: p('YES\\n')\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nunique = set(nums)\r\n\r\nfor num in unique:\r\n\tif nums.count(num) > (n+1)/2:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=[0]*1000\r\nfor i in range(n):\r\n l1[l[i]-1]+=1\r\nj=max(l1)\r\ns=0\r\nc=0\r\nfor i in range(1000):\r\n if(l1[i]==j and c==0):\r\n k=i\r\n c=1\r\n continue\r\n else:\r\n s+=l1[i]\r\nif(l1[k]>=s+2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import *\r\nhash=[0]*1001\r\nn=int(input())\r\np=1\r\nnumbers=list(map(int,input().split()))\r\nfor i in range(0,len(numbers),1):\r\n hash[numbers[i]]+=1\r\nnum=ceil(n/2)\r\nfor i in range(0,len(hash),1):\r\n if hash[i]>num:\r\n p=0\r\n break\r\nif p==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nflag = 1\r\nfor i in set(l):\r\n \r\n if n%2 == 0 and l.count(i) > n//2 :\r\n print('NO')\r\n flag =0\r\n break\r\n elif n%2 != 0 and l.count(i) > n//2+1 :\r\n print('NO')\r\n flag = 0\r\n break\r\nif (flag == 1):\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nif n == 1:\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n for i in a:\r\n if a.count(i)>math.ceil(n/2):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nm = list(map(int,input().split()))\r\nm1 = set(m)\r\nif len(m)%2 == 0 :\r\n s = len(m)//2\r\nelse:\r\n s = len(m)//2 +1\r\n\r\nif len(m) != 1 :\r\n\r\n for i in m1:\r\n if m.count(i) > s:\r\n print('NO')\r\n break\r\n elif m.count(i) == len(m):\r\n print(\"NO\")\r\n break\r\n else:\r\n print('YES')\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn = int(input())\r\nstuff = Counter(input().split())\r\nspace = (n-1)//2\r\nprint (\"YNEOS\"[stuff.most_common()[0][1]-1 > space::2])\r\n", "def a():\r\n n = int(input())\r\n array = [int(x) for x in input().split()]\r\n\r\n import math \r\n n2 = math.ceil(n / 2)\r\n\r\n for elemnet in set(array):\r\n if array.count(elemnet) > n2:\r\n return \"NO\"\r\n return \"YES\"\r\nprint(a())", "import heapq\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor num in arr:\r\n if num not in d:\r\n d[num] = 0\r\n d[num] += 1\r\n\r\nfrequent = max(d.values())\r\nif frequent > (n+1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def solve():\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n y = dict()\r\n\r\n for i in x:\r\n if i in y:\r\n y[i] += 1\r\n else:\r\n y[i] = 1\r\n \r\n for i in y:\r\n if (y[i]-1) > (n-y[i]):\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "\r\nn = int(input())\r\ns = input().split()\r\nprint('YES' if all([s.count(i)*2-1 <= n for i in s ]) else \"NO\")\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nd=Counter(a)\r\nm=1\r\nif n%2==0:h=n//2\r\nelse:h=n//2+1\r\nfor x in d:\r\n if d[x]>m:m=d[x]\r\nif m<=h:print(\"YES\")\r\nelse:print(\"NO\")", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n = int(input())\n for count in Counter(input().split()).values():\n if count > (n+1) // 2:\n print('NO')\n break\n else:\n print('YES')\n\nmain()\n", "n = int(input())\ns = list(map(int, input().rstrip().split()))\nif all(s.count(i) * 2 - 1 <= n for i in s):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "c={}\r\nn=-(-int(input())//2)\r\nb=1\r\nfor i in map(int,input().split()):\r\n if i not in c:\r\n c[i]=1\r\n else:\r\n c[i]+=1\r\n if c[i]>n:\r\n b=0\r\nprint([\"NO\",\"YES\"][b])", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ndef main() : \r\n t = int(input())\r\n test = True\r\n arr = list(map(int,input().strip().split()))\r\n if t == 1 :\r\n print('YES')\r\n else : \r\n d = dict()\r\n for i in arr :\r\n if i in d :\r\n d[i] += 1\r\n else :\r\n d[i] = 1\r\n for i in d :\r\n if d[i] > math.ceil(t/2) :\r\n print('NO')\r\n test = False\r\n break\r\n if test :\r\n print('YES') \r\n \r\nmain()", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\nfor i in l1:\r\n if l1.count(i)>(n+1)//2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "def solve(arr,n):\r\n if n==1:\r\n return 'YES'\r\n if n==2:\r\n if arr[0]==arr[1]:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n\r\n rec = dict()\r\n for i in range(n):\r\n if arr[i] not in rec:\r\n rec[arr[i]] = 1\r\n else:\r\n rec[arr[i]] += 1\r\n\r\n for k,v in rec.items():\r\n if n%2==0 and v>n/2:\r\n return 'NO'\r\n if n%2!=0 and v>(n/2+1):\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nprint(solve(arr,n))", "#A. Yaroslav and Permutations\r\nfrom math import ceil\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nif n==1:\r\n print('YES')\r\nelse:\r\n d = dict()\r\n for i in a:\r\n if i not in d:\r\n d[i] = 0\r\n d[i] += 1\r\n flag = True\r\n for k,v in d.items():\r\n if v>ceil(n/2):\r\n flag = False\r\n break\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\narr = list(map(int, input().split()))\ncont = list(map(lambda x: arr.count(x), arr))\nmax_cont = max(cont)\nif max_cont <= (n + 1) / 2:\n print('YES')\nelse:\n print('NO')\n\t\t\t\t\t \t \t\t\t\t \t\t \t \t", "t=int(input())\r\nl=list(map(int,input().split()))\r\ncheck=True\r\nfor i in l:\r\n if (l.count(i)*2)-1>t:\r\n check=False\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import ceil\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nz = []\r\ny = list(set(x))\r\nfor i in range(0, len(y)):\r\n z.append(x.count(y[i]))\r\nif max(z) <= int(ceil(n/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nresult = True\r\nif n % 2 == 1:\r\n for i in range(n):\r\n if l.count(l[i]) > n//2+1:\r\n result = False\r\n break\r\nelse:\r\n for i in range(n):\r\n if l.count(l[i]) > n//2:\r\n result = False\r\n break\r\nif result:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\nflag = True\r\nfor i in nums:\r\n len_i = nums.count(i)\r\n len_other = len(nums) - len_i\r\n if len_i - len_other > 1:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndic = {}\r\narr = list(map(int , input().split()))\r\nfor i in arr :\r\n try :\r\n dic[i]+=1\r\n except:\r\n dic[i]=1\r\nfor i,j in dic.items() :\r\n if j > (n+1)/2 :\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "n = int(input())\r\nnum = [int(x) for x in input().split()]\r\nc = 1\r\nif len(num) == 1:\r\n print(\"YES\")\r\nelse:\r\n for i in set(num):\r\n if 2 * num.count(i) - len(num) > 1:\r\n c = 0\r\n print(\"YES\" if c == 1 else \"NO\")\r\n", "n = int(input())\nnums = list(map(int,input().split()))\n# nums = [354,356,352,355,355,355,352,354,354,352,355,356,355,352,354,356,354,355,355,354,353,352,352,355,355,356,352,352,353,356,352,353,354,352,355,352,353,353,353,354,353,354,354,353,356,353,353,354,354,354,354,353,352,353,355,356,356,352,356,354,353,352,355,354,356,356,356,354,354,356,354,355,354,355,353,352,354,355,352,355,355,354,356,353,353,352,356,352,353]\n\nfrequencies = {}\n\nfor num in nums:\n frequencies[num] = frequencies.get(num,0) +1\nfrlst = list(frequencies.items())\nfrlst.sort(key= lambda x:x[1])\nlarge = frlst[-1][1]\nif sum(map(lambda x : x[1],frlst[:-1])) >= large-1 :\n print('YES')\nelse :\n print('NO')", "#52 Yaroslav and Permutations\r\nimport collections as col\r\nn = int(input())\r\nlst = list(map(int, input().split(' ')))\r\nd = dict(col.Counter(lst))\r\nc = list(d.values())\r\nflag = True\r\nfor i in c:\r\n if i > ((n+1)/2):\r\n print('NO')\r\n flag = False\r\n\r\nif flag:\r\n print('YES')\r\n", "import collections\r\nif __name__ == \"__main__\":\r\n\tn = int(input())\r\n\tnumber = [int(x) for x in input().split(' ')]\r\n\tnumber = collections.Counter(number)\r\n\tif n % 2 == 0:\r\n\t\tif all(x <= n // 2 for x in number.values()):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\telse:\r\n\t\tif all(x <= n // 2 + 1 for x in number.values()):\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")", "x = int(input())\r\ny = list(map(int, input().split(' ')))\r\nc = []\r\nfor i in y:\r\n c.append(y.count(i))\r\nm = max(c)\r\nif m > (x +1) / 2:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "# your code goes here\r\nn=int(input())\r\nnum=map(int,input().split())\r\nfrom collections import Counter\r\nfreq=Counter(num)\r\nmaximum=0\r\nfor i in freq:\r\n\tif(maximum<freq[i]):\r\n\t\tmaximum=freq[i]\r\nif(maximum <=((n+1)//2)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\nd = {}\r\nfor el in map(int, input().split()):\r\n d[el] = d.get(el, 0) + 1\r\nx = max(d.values())\r\nif x > (n + 1) // 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\na1=[0]*1000\r\nfor item in l1:\r\n a1[item-1]+=1\r\nif max(a1)>(n+1)//2:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "import collections,math\r\nx=int(input())\r\nz=input().split(\" \")\r\nelements_count = collections.Counter(z)\r\ndo=False\r\nfor key, value in elements_count.items():\r\n if value> math.ceil(x/2):\r\n do=True\r\n break\r\n\r\nif do:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if l[i] not in d:\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]=d[l[i]]+1\r\nall_values = d.values()\r\nmax_value = max(all_values)\r\nif(max_value>(n+1)//2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr=Counter(arr)\r\nb=[]\r\nfor i in arr:\r\n b.append(arr[i])\r\nb.sort(reverse=True)\r\nfor i in range(1,len(b)):\r\n b[0]-=b[i]\r\nif b[0]<2:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n ", "import math\r\nn=int(input())\r\nD={}\r\nlt=list(input().split())\r\nfor i in lt:\r\n if i in D:\r\n D[i]+=1\r\n else:\r\n D[i]=1\r\nif n%2==0:\r\n if max(D.values())<=n/2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if max(D.values())<=math.ceil(n/2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#code\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\n\r\nfor i in b:\r\n cb=0\r\n for j in a:\r\n if j==i:\r\n cb+=1;\r\n if (n%2==1 and cb>(n/2)+1) or (n%2==0 and cb>n/2):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "x = int(input())\r\na = list(map(int,input().split()))\r\nr = list(set(a))\r\nk = 0\r\nif x%2 == 1:\r\n\tt = x//2+1\r\nelse:\r\n\tt = x//2\r\n\r\nfor i in range(len(r)):\r\n\tr1 = a.count(r[i])\r\n\tif r1 > t:\r\n\t\tprint(\"NO\")\r\n\t\tk = 1\r\n\t\tbreak\r\nif k == 0:\r\n\tprint(\"YES\")", "n = int(input())\r\n\r\nmax_count = n//2\r\nif n % 2:\r\n max_count += 1\r\n \r\ncounter = {}\r\nfor ch in input().split():\r\n counter[ch] = counter.get(ch, 0) + 1\r\n if counter[ch] > max_count:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nnums = input().split(\" \")\r\nif n == 1:\r\n print(\"YES\")\r\nelif max(nums) == min(nums):\r\n print(\"NO\")\r\nelse:\r\n duplicate = []\r\n for i in nums:\r\n duplicate.append(nums.count(i))\r\n\r\n if n % 2 == 0:\r\n if max(duplicate) > n / 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n if max(duplicate) > (n / 2) + 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "def main():\n n = int(input())\n l = [-2] * 1001\n for x in map(int, input().split()):\n l[x] += 2\n print(('NO', 'YES')[max(l) < n])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[0] * 1001\r\nif n ==1:\r\n print(\"YES\")\r\n\r\nelif n==2:\r\n l,r=map(int,input().split())\r\n if (l==r):\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")\r\n\r\nelse:\r\n l = list(map(int,input().split()))\r\n for c in l:\r\n a[c] += 1\r\n if (len(l) % 2 == 1 and a[c] > n // 2 + 1) or (len(l) % 2 == 0 and a[c] > n // 2):\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\n \r\n \r\n\r\n \r\n", "n = int(input())\nb = dict()\nfor x in list(map(int, input().split())):\n if x not in b.keys():\n b[x] = 1\n else:\n b[x] += 1\nif any(b[x] > (n + 1) / 2 for x in b.keys()):\n print('NO')\nelse:\n print('YES')\n", "a = int(input())\r\nl = list(map(int, input().split()))\r\nd = dict()\r\ns = set()\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n s.add(i)\r\nflag = False\r\nfor i in s:\r\n sum = 0\r\n for j in d:\r\n sum += d[j]\r\n sum -= d[i]\r\n if d[i] - sum > 1:\r\n flag = True\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l :\r\n if i not in d.keys():\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n\r\nm=0\r\nif max(list(d.values()))<=(n+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter \r\ndef solve():\r\n n = int(input())\r\n arr = input().split()\r\n freqs = Counter(arr)\r\n max_val_key = max(freqs, key = freqs.get)\r\n max_val = freqs[max_val_key]\r\n del freqs[max_val_key]\r\n if sum(freqs.values()) >= max_val - 1:\r\n print('YES')\r\n else: print('NO')\r\nsolve()", "n = int(input())\r\narray = list(map(int, input(). strip(). split()))\r\ndelta = set(array)\r\nxray = []\r\nfor val in delta:\r\n xray.append(array.count(val))\r\n\r\ntarget = max(xray)\r\nif n-target >= target -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ndict1 = {}\r\ncount = 0\r\nstr = input().split(' ')\r\nfor i in str:\r\n if dict1.get(int(i), 0):\r\n dict1[int(i)] += 1 \r\n else:\r\n dict1[int(i)] = 1 \r\n \r\n if(count < dict1[int(i)]):\r\n count = dict1[int(i)]\r\n\r\nif(count<=(n+1)/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import factorial\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split(\" \")]\r\n\r\nmap_n = {}\r\n\r\nfor num in arr:\r\n if num in map_n:\r\n map_n[num] += 1\r\n else:\r\n map_n[num] = 1\r\n\r\nfor num in map_n:\r\n if map_n[num] >= (n / 2) + 1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nfrq=[0]*1001\r\nfor i in nums:\r\n frq[i]+=1\r\ndiff = n\r\nfor i in frq:\r\n if i>n//2+(n&1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n \r\n \r\n\r\n", "import sys\r\nfrom typing import Callable\r\nfrom collections import defaultdict, Counter\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tn = int(read())\r\n\tvalues: list[int] = [int(i) for i in read().split()]\r\n\tmax_group = Counter(values).most_common(1)[0][1]\r\n\tremaining_elts = len(values) - max_group\r\n\r\n\t# You always need at least max_group - 1 elements\r\n\tif remaining_elts >= max_group - 1:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\n\r\nif(len(arr)==1):\r\n print(\"YES\")\r\nelse:\r\n freq = [0]*1001\r\n for i in range(len(arr)):\r\n freq[arr[i]]+=1\r\n \r\n max_val = freq[0]\r\n ind = 0\r\n for i in range(1, len(freq)):\r\n if(max_val<freq[i]):\r\n max_val = freq[i]\r\n ind = i\r\n \r\n rem = len(arr) - max_val\r\n if(rem<(max_val-1)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nst = set(arr)\r\n#print(st)\r\n\r\nfor i in st :\r\n if arr.count(i) > (n+1)/2:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n\r\n", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc = {}\r\nfor x in set(l):\r\n c[l.count(x)] = x\r\nif max(list(sorted(c)))-1 <= i - max(list(sorted(c))):\r\n print('YES')\r\nelse:\r\n print('NO')", "from itertools import count\r\n\r\n\r\ndef most_frequent(List):\r\n return max(set(List), key = List.count)\r\n\r\ndef main():\r\n # your code goes here\r\n pass\r\n N = int(input())\r\n leo = list(map(int,input().split()))\r\n most_frq = most_frequent(leo)\r\n count_fre = leo.count(most_frq)\r\n if count_fre > ((N+1)/2):\r\n print('NO')\r\n else:\r\n print('YES') \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncontinuous = 1\r\nmax_continuous = 1\r\n\r\nfor i in range(1, n):\r\n if a[i] == a[i - 1]:\r\n continuous += 1\r\n if continuous > max_continuous:\r\n max_continuous = continuous\r\n else:\r\n continuous = 1\r\n\r\nprint(\"YES\" if max_continuous <= (n + 1) // 2 else \"NO\")\r\n", "#import math\r\n\r\n#n, m = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#n, m, k = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#k = int (k)\r\nn = int(input())\r\n#m = int(input())\r\n#s = input()\r\n#t = input()\r\n#h = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\n#c = list(map(int, input().split()))\r\n\r\n#x1, y1, x2, y2 =map(int,input().split())\r\n#n = int(input())\r\n#f = []\r\n#t = [0]*n\r\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\r\n#f = sorted (f, key = lambda tup: tup[0] )\r\n\r\n#h = [\"\"] * n\r\n#f1 = sorted(f, key = lambda tup: tup[0])\r\n\r\n\r\n#f1 = sorted(t, key = lambda tup: tup[0])\r\nif n % 2== 0:\r\n g = n/2\r\nelse:\r\n g = n/2 +1\r\nf = True\r\nc = 1\r\nfor i in range(1,n):\r\n if b[i] == b[i-1]:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > g:\r\n f = False\r\nif (f or n == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import exit\r\nimport math\r\nn=int(input())\r\nnumber=list(map(int,input().split()))\r\nfor i in number:\r\n if number.count(i)>math.ceil(n/2):\r\n print('NO')\r\n exit()\r\nprint(\"YES\") \r\n ", "from math import ceil\r\nN = int(input())\r\na = list(map(int, input().split()))\r\nsa = set(a)\r\nif len(sa) == 1 and N != 1:\r\n print('NO')\r\n exit()\r\n\r\nfor item in sa:\r\n count = 0\r\n for n in a:\r\n if item == n:\r\n count += 1\r\n\r\n if count > ceil(N/2):\r\n print('NO')\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=list(input().split())\r\nans=\"YES\"\r\nfor i in set(l):\r\n if l.count(i)*2-1>n :\r\n #taking both odd and even n in concern\r\n ans=\"NO\"\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narri = sorted([arr.count(i) for i in set(arr)])\r\na = arri[-1]\r\nprint('YES' if a*2-1<=n else 'NO')", "n = int(input())\r\nli = list(map(int, input().split()))\r\nans = 'YES'\r\n\r\nfor el in li:\r\n if li.count(el) * 2 > n+1:\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\nlst = [int(x) for x in input().split()]\ncur, cnt = 0, 0\nfor i in lst:\n if i == cur: cnt += 1\n elif cnt == 0: cur, cnt = i, 1\n else: cnt -= 1\ncnt = 0\nfor i in lst:\n if i == cur: cnt += 1\nprint (\"YES\" if cnt + (cnt - 1) <= n else \"NO\")\n", "import math,sys\nfrom collections import Counter, defaultdict, deque\nfrom sys import stdin, stdout\ninput = stdin.readline\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n=int(input())\n a=li()\n c=Counter(a)\n m=0\n for i in c:\n m=max(m,c[i])\n if(m>(n//2)+(n%2)):\n print(\"NO\")\n else:\n print(\"YES\")\n\nfor _ in range(1):\n case()", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef output_list(v):\r\n print(' '.join(str(x) for x in v))\r\n\r\ndef main():\r\n n = int(input())\r\n a = input_ints()\r\n for x in a:\r\n if 2 * a.count(x) > n + 1:\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(n==1):\r\n\tprint('YES')\r\nelse:\r\n\tx=a.count(1)\r\n\tfor i in range(len(a)):\r\n\t\tif(a.count(a[i])>x):\r\n\t\t\tx=a.count(a[i])\r\n\tif(x+(x-1))<=n:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "from math import ceil\r\nn = int(input())\r\n\r\nt = list(map(int, input().split()))\r\n\r\nif n == 1: print('YES')\r\nelse:\r\n c = max([t.count(x) for x in t])\r\n\r\n if c <= ceil(n/2): print('YES')\r\n else: print('NO')", "from math import ceil\r\nfrom collections import Counter\r\nfrom sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn=int(input())\r\na=Counter(map(int,input().split()))\r\nif a.most_common()[0][1]<=ceil(n/2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n = int(input())\nl = list(map(int, input().split(' ')))\ndic = dict()\nfor item in l:\n if item in dic:\n dic[item] += 1\n else:\n dic[item] = 1\n\nmaximum = max(dic.values())\nif maximum <= (n + 1) // 2:\n print (\"YES\")\nelse:\n print (\"NO\")\n\n \t\t \t \t\t \t \t \t \t \t\t \t \t", "n = int(input())\na =[int(i) for i in input().split()]\nc = []\nfor i in range(n):\n c.append(a.count(a[i]))\nr = \"YES\"\nif n%2 == 0:\n if max(c) > n//2:\n r = \"NO\"\nelse:\n if max(c) > (n+1)//2:\n r = \"NO\"\nprint(r)", "import math\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nif(n==1):\r\n print('YES')\r\nelse:\r\n s=set(a)\r\n k=[a.count(i) for i in s]\r\n if(max(k)>math.ceil(n/2)):\r\n print('NO')\r\n else:\r\n print('YES')", "from math import ceil\r\nsz = int(input())\r\nlst = list(map(int,input().split()))\r\ns = set(lst)\r\nfor i in lst:\r\n if lst.count(i) > int(ceil(sz/2)):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=list(map(int,list(input().split())))\r\nif n%2==0:\r\n x=n//2\r\nelse:\r\n x=(n//2)+1\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n s=set(l)\r\n c=[]\r\n for i in s:\r\n c.append(l.count(i))\r\n mx=max(c)\r\n if mx<=x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nl=[int(ele) for ele in input().split()]\r\nd={}\r\nfor e in l:\r\n d[e]=d.get(e,0)+1\r\nm=max(d.values())\r\nif n%2==0:\r\n if m>n/2:print('NO')\r\n else:print('YES')\r\nelse:\r\n a=(n/2)+0.5\r\n if m>a:print('NO')\r\n else:print('YES')", "'''input\n3\n1 1 2\n'''\nimport math\ndef find_max(f):\n\tm = -1\n\tfor i in range(1, 1001):\n\t\tm = max(m, f[i])\n\treturn m\nn = int(input())\narr = list(map(int, input().split()))\nf = [0] * (1000 + 1)\nfor i in range(n):\n\tf[arr[i]] += 1\nm = find_max(f)\nif math.ceil(n/2) >= m:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nc = Counter(arr)\r\nk,v = max(c.items(),key=lambda x:x[1])\r\nif n%2==0:\r\n if v<=n//2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if v<=math.ceil(n/2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\nc = 0\r\nfor i in s:\r\n if(a.count(i) > c):\r\n c = a.count(i)\r\nif(c <= math.ceil(n/2)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nfrom collections import Counter\r\nfrom math import ceil\r\n\r\na = int(input())\r\nl = [int(x) for x in input().split()]\r\nf = Counter(l)\r\ncan = True\r\nfor (k, v) in f.items():\r\n if v > ceil(a / 2):\r\n print(\"NO\")\r\n can = False\r\nif can:\r\n print(\"YES\")\r\n", "def f(n, a):\r\n m = max(a.count(x) for x in set(a))\r\n return \"YES\" if m <= (n + 1) / 2 else \"NO\"\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nresult = f(n, a)\r\nprint(result)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=True\r\nif n==2:\r\n if l[0]==l[1]:\r\n b=False\r\nif n>2:\r\n for i in range(n):\r\n count=0\r\n for j in range(n):\r\n if l[i]==l[j]:\r\n count+=1\r\n if n<(2*count-1):\r\n b=False\r\nif b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nstring=list(input().split())\r\nans=\"YES\"\r\nfor i in string:\r\n if string.count(i)*2-1>n :\r\n ans=\"NO\"\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n m = l.count(i)\r\n if m*2>n+1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from collections import Counter\nn = int(input())\nprint (\"YES\" if Counter([int(x) for x in input().split()]).most_common(1)[0][1] * 2 - 1 <= n else \"NO\")\n", "from sys import stdin\r\nn = stdin.readline().strip()\r\nnums = [int(x) for x in stdin.readline().strip().split(\" \")]\r\nmaximum = 0\r\nfor i in range(len(nums)):\r\n if nums.count(nums[i]) > maximum:\r\n maximum = nums.count(nums[i])\r\nif len(nums) == 1:\r\n print(\"YES\")\r\nelif maximum > round(len(nums)/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\n\r\nset_of_numbers = list(set(numbers))\r\n\r\ncounter = [None] * len(set_of_numbers)\r\nfor i in range(len(set_of_numbers)):\r\n counter[i] = numbers.count(set_of_numbers[i])\r\n\r\nif max(counter) > math.ceil(N/2):\r\n print('NO')\r\nelse:\r\n print('YES')", "from math import ceil\r\n\r\nn = int(input())\r\ns = input().split()\r\nst = set(s)\r\nmx = 0\r\nfor i in st:\r\n k = s.count(i)\r\n if k > mx:\r\n mx = k\r\nif mx > ceil(n / 2):\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nst = set(arr)\r\nmxc = 0\r\nfor e in st:\r\n if arr.count(e) > mxc:\r\n mxc = arr.count(e)\r\n\r\nif mxc > (n + 1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = 0\r\nfor x in set(a):\r\n s = a.count(x)\r\n m = max(m,s)\r\nif m > math.ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nlst = []\r\ni = 0\r\nj = n-1\r\nturn = 0\r\nwhile i<=j:\r\n if turn%2==0:\r\n lst.append(arr[i])\r\n i += 1\r\n else:\r\n lst.append(arr[j])\r\n j -= 1\r\n turn += 1\r\nlst = [-1]+lst\r\ncount = cnt = 0\r\nfor i in range(-1,-n-1,-1):\r\n if lst[i]!=lst[i-1]:\r\n break\r\n else:\r\n count += 1\r\nif count:\r\n cnt = 0\r\n num = lst[-1]\r\n for i in range(1,n+1):\r\n if num!=lst[i]:\r\n cnt += 1\r\n else:\r\n break\r\n if count<=cnt:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na1=list(set(a))\r\nc=1\r\nif(n>1):\r\n for i in a1:\r\n b=a.count(i)\r\n if(b>math.ceil(n/2)):\r\n print(\"NO\")\r\n c=0\r\n break\r\n if(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na=Counter(a)\r\nb=[*a.values()]\r\nf=0\r\nfor i in b:\r\n if i<=(n+1)//2:\r\n f=0\r\n else:\r\n f=1\r\n break\r\nif f:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = list(map(int , input().split()))\r\nres = []\r\nc = 0 \r\n\r\nfor i in a:\r\n if(i in res):\r\n continue\r\n else:\r\n s = 0 \r\n s = a.count(i)\r\n if(s > (n+1)//2):\r\n c += 1\r\n break \r\n else:\r\n res.append(i)\r\n\r\nif(c == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\ninp = list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter(inp)\r\nd=list(c.values())\r\nd.sort()\r\na=0\r\nfor i in range(len(d)-1):\r\n d[i+1]=d[i+1]-d[i]\r\n if(i!=len(d)-2):\r\n a+=2*d[i]\r\nif(d[len(d)-1]>1+a):\r\n print (\"NO\")\r\nelse:\r\n print ('YES')", "def yaroslav():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n cunts=[0 for i in range(1001)]\r\n for i in range(n):\r\n cunts[a[i]]=a.count(a[i])\r\n maxcount=0\r\n for i in range(1001):\r\n if cunts[i]>cunts[maxcount]:\r\n maxcount=i\r\n if n%2==0:\r\n if a.count(maxcount)>(n//2):\r\n print(\"NO\")\r\n return\r\n else:\r\n if a.count(maxcount)>((n//2) + 1):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nyaroslav()\r\n\r\n\r\n", "n=int(input())\r\narr = list(map(int , input().split()))\r\ndef t(arr):\r\n arr1 = set(arr)\r\n for i in arr1 :\r\n if arr.count(i) > (n+1)//2 :\r\n return \"NO\"\r\n return \"YES\"\r\nprint(t(arr))", "from math import ceil\r\n\r\nn = int(input())\r\nl = input().split()\r\n\r\nd = {}\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n\r\nif max(d.values()) > ceil(n/2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "import math\r\nnumber = int(input())\r\n\r\nlista = input()\r\nlista = lista.split()\r\nlista =[int(x) for x in lista]\r\n\r\n\r\nnumeros = [-1]\r\nfrecuencia = [0]\r\n\r\nfor num in lista:\r\n \r\n flag = True\r\n \r\n for guardado in range(len(numeros)):\r\n \r\n if num == numeros[guardado]:\r\n frecuencia[guardado] = frecuencia[guardado] + 1\r\n flag = False\r\n break\r\n \r\n if flag:\r\n numeros.append(num)\r\n frecuencia.append(1)\r\n\r\n\r\nmaximo = max(frecuencia)\r\n\r\nif maximo > math.ceil((number/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x =int(input())\r\nl =list(map(int,input().split()))\r\nn = [l.count(i) for i in set(l)]\r\nprint([\"NO\",\"YES\"][(sum(n)-max(n)>=max(n)-1)])", "def perms():\r\n n = int(input())\r\n count = {}\r\n if n == 1:\r\n return True\r\n limit = (n//2) + (n % 2)\r\n line = list(map(int, input().split(' ')))\r\n for element in line:\r\n if element not in count:\r\n count[element] = 1\r\n else:\r\n count[element] += 1\r\n if count[element] > limit:\r\n return False\r\n return True\r\n\r\n\r\nif(perms()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n d[i] = d.get(i,0)+1\r\nx=d.values()\r\np=n//2\r\nif(n%2!=0):\r\n p+=1\r\nif(max(x)<=p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nnums = map(int,input().split())\nunique_nums = [0] * 1002\nfor num in nums :\n unique_nums[num] +=1\nres = 'YES'\nfor num in unique_nums :\n if num > (n+1) //2:\n res = 'NO'\n break\nprint(res) \n\n\n", "#!/usr/bin/env python3\nimport sys\n\nif __name__ == \"__main__\":\n\tn = int(sys.stdin.readline())\n\tais = list(map(int, sys.stdin.readline().split()))\n\tprint(\"YES\" if all(ais.count(i)*2 -1 <= n for i in ais) else \"NO\")\n", "n = int(input())\narr = [int(x) for x in input().split()]\nmax_freq = 0\nfreq= {}\nfor ele in arr:\n\tif ele not in freq:\n\t\tfreq[ele] = 0\n\tfreq[ele]+=1\n\tmax_freq = max(max_freq,freq[ele])\n\nif max_freq > int((n+1)/2):\n\tprint(\"NO\")\nelse:\n\t#Is there any way to get no?\n\t#n = 10\n\t#f = 4\n\t#f2 = 4\n\t#f3 = 2\n\t#abcabcabab\n\t\n\tprint(\"YES\")\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nf=len(s)\r\n\r\nc=0\r\nfor i in range(f):\r\n if l.count(s[i])>(n+1)//2:\r\n c=1\r\n break\r\nif c==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n%2==0 :\r\n k=0\r\nelse :\r\n k=-1\r\nfor i in range(n) :\r\n if l.count(l[i])+k>n//2 :\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "\r\n\r\nn = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n s = set(arr)\r\n if len(s) == 1:\r\n print('NO')\r\n else:\r\n\r\n di = {}\r\n s = list(s)\r\n count = 0\r\n for i in s:\r\n a = arr.count(i)\r\n di[i] = a\r\n count += a\r\n\r\n stop = False\r\n\r\n for k in di:\r\n if count - di[k] < di[k] - 1:\r\n stop = True\r\n break\r\n\r\n if not stop:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nd = dict()\r\n\r\nfor i in an:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n \r\nvmax = 0\r\n#vsum = 0\r\nfor i in list(d.keys()):\r\n #vsum += d[i]\r\n if(d[i] > vmax):\r\n vmax = d[i]\r\n \r\nif(vmax <= (n + 1) / 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import math\nfrom unittest import result\n\nif __name__ == \"__main__\":\n n = int(input())\n num_list = [int (i) for i in input().split()]\n num = dict()\n\n for e in num_list:\n if e in num:\n num[e] +=1\n else:\n num[e] = 1\n\n if n %2 == 0:\n limit = n/2\n else:\n limit = math.ceil(n/2)\n \n result = \"YES\"\n for v in num.values():\n if v > limit:\n result = \"NO\"\n\n print(result)\n \n ", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\nitem_appear = {}\r\n\r\nfor i in lst: \r\n if i not in item_appear: item_appear[i] = 1\r\n else: item_appear[i] += 1\r\n\r\nmax_appear = max(item_appear.values())\r\n\r\nif n - max_appear >= max_appear - 1: print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n# flag = True\r\n#284 284 285 285 285 284 285 284 284 285 284 285 284 284 285 284 285 285 285 285 284 284 285 285 284 284 284 285 284 285 284 285 285 284 284 284 285 284 284 285 285 285 284 284 285 284 285 285 284 285 285 284 285 284 284 284 285 285 284 285 284 285 285 285 285 284 284 285 285 284 285\r\n# for j in item_appear:\r\n# if item_appear[j] == max_appear:\r\n# if item_appear[j] ", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nprint('YES' if all([nums.count(i)*2-1<=n for i in nums]) else 'NO')", "from math import *\r\n\r\n\r\ndef main():\r\n p = input()\r\n s = list(map(int, input().split()))\r\n maxi = -inf\r\n z = set(s)\r\n for i in z:\r\n maxi = max(s.count(i), maxi)\r\n print(\"YES\" if maxi <= ceil(len(s)/2) else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=sorted([a.count(i) for i in s])\r\n\r\n\r\nmax_num=l[-1]\r\nh=sum(l[-2::-1])\r\n\r\nif(h>=max_num-1):\r\n \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\na = list(map(int, input().split()))\n\nb = {}\nfor i in range(n):\n if a[i] in b:\n b[a[i]] += 1\n else:\n b[a[i]] = 1\n\nif max(b.values()) <= (n+1)//2:\n print('YES')\nelse:\n print('NO')\n\n", "import math\r\ndef solve():\r\n n=int(input())\r\n lst=list(map(int,input().split(\" \")))\r\n\r\n i=0; \r\n\r\n \r\n\r\n for i in range(n):\r\n c=lst.count(lst[i])\r\n if c>math.ceil(n/2):\r\n print(\"NO\")\r\n return\r\n \r\n print(\"YES\")\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve();", "def yzd_solution(n,arr):\r\n freq_counter = {}\r\n\r\n limit = 0\r\n if n % 2 == 0:\r\n limit = n / 2\r\n else:\r\n limit = ((n-1)/2) + 1\r\n\r\n for num in arr:\r\n if num in freq_counter:\r\n freq_counter[num] += 1\r\n if (freq_counter[num] > limit):\r\n return False\r\n else:\r\n freq_counter[num] = 1\r\n \r\n return True\r\n\r\nn = int(input())\r\narr = input().split(\" \")\r\nprint(\"YES\" if yzd_solution(n, arr) else \"NO\")", "n=int(input())\r\nk=n//2+n%2\r\na={}\r\nfor x in list(map(int,input().split())):\r\n if x in a:\r\n a[x]+=1\r\n if a[x]>k:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n a[x]=1\r\nprint(\"YES\")\r\n", "from collections import Counter\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nc=Counter(x)\r\nm=0\r\nfor i in c:\r\n m=max(m,c[i])\r\nif m>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\narr = input().split()\r\ncheck_arr = list(set(arr))\r\nif(n%2 != 0):# n is odd\r\n for i in check_arr:\r\n if(arr.count(i) > n/2 + 1):\r\n print(\"NO\")\r\n break;\r\n else:\r\n print(\"YES\")\r\nelse:# n is even\r\n for i in check_arr:\r\n if(arr.count(i) > n/2):\r\n print(\"NO\")\r\n break;\r\n else:\r\n print(\"YES\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = [0 for i in range(1001)]\r\nfor i in l:\r\n ans[i]+=1\r\nf = 0\r\nfor i in range(1,1001):\r\n if ans[i]>(n+1)//2:\r\n f = 1\r\n break\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\n\n\ndef main():\n n = int(input())\n c = Counter(input().split())\n print(('NO', 'YES')[max(c.values()) * 2 < n + 2])\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = Counter(a)\r\nans = 1\r\nfor i in range(n):\r\n if cnt[a[i]] > math.ceil(n/2):\r\n ans = 0\r\n break\r\nif (len(set(a)) > 1 or len(a) == 1) and ans == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def yar(dict,n):\r\n\tfor e in dict.keys():\r\n\t\tif(dict.get(e)>(n+1)//2):\r\n\t\t\treturn \"NO\"\r\n\treturn \"YES\"\r\n\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\ndict={}\r\nfor i in range(0,len(L)):\r\n\tif L[i] not in dict.keys():\r\n\t\tdict[L[i]]=1\r\n\telse:\r\n\t\tdict[L[i]]+=1\r\nprint(yar(dict,n))\r\n", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nf = [0] * 1000\r\nfor x in a :\r\n f[x] += 1\r\n\r\nfor i in range(1000) :\r\n if f[i] > (n + 1) // 2 :\r\n print(\"NO\")\r\n break\r\nelse :\r\n print(\"YES\")\r\n", "n = int(input())\r\n*arr, = map(int,input().split(' '))\r\ntheSet = set(arr)\r\ncount = 0\r\nfor i in theSet:\r\n c = arr.count(i)\r\n if c > count: count = c \r\nif n%2==0:\r\n res = count <= (n//2)\r\nelse:\r\n res = count <= (n//2+1)\r\n\r\nprint('YES' if res else \"NO\")", "x = int(input())\r\ny = map(int,input().split())\r\nfrom collections import Counter\r\nimport math \r\nx = math.ceil(x/2)\r\ny = Counter(y)\r\nfor i in y.values():\r\n if i>x:\r\n # print(x,i)\r\n print('NO')\r\n break\r\nelse:\r\n print(\"YES\")", "import sys\r\nimport os.path\r\nimport math\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nb=[0]*1005\r\nfor i in arr:\r\n b[i]+=1\r\nif max(b)> (n+1)/2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\nn = int(input())\r\na = [0 for i in range(1001)]\r\nm = map(int,input().split())\r\nfor k in m:\r\n a[k]+=1\r\nmaxe = (n//2)+(n%2)\r\nres = True\r\nfor i in range(len(a)):\r\n if a[i] > maxe:\r\n res = False\r\n\r\nif res :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nk=[0]*n\nl = [0]*1001\nk=list(map(int,input().split()))\nfor _ in range(n):\n\tl[k[_]-1]+=1\n\nk = max(l)\nif k>(n+1)//2:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "n = int(input())\r\nvals = list(map(int, input().split()))\r\ncounts = [0]*1000\r\nlast = -1\r\ncnt_last = -1\r\nfor i in range(n):\r\n counts[vals[i]-1]+=1\r\n if(cnt_last<counts[vals[i]-1]):\r\n last = vals[i]\r\n cnt_last = counts[vals[i]-1]\r\ncounts[last-1]-=1\r\nfor i in range(n):\r\n ma_idx = ma = -1\r\n for j in range(1000):\r\n if(counts[j]>ma and counts[j]>0 and j+1!=last):\r\n ma = counts[j]\r\n ma_idx = j+1\r\n if(ma!=-1):\r\n counts[ma_idx-1]-=1\r\n last = ma_idx\r\n else:\r\n break\r\nif(sum(counts)==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nList=list(map(int,input().split()))\r\n\r\n\r\nList.sort()\r\n\r\ni=0\r\ncounter=0\r\nwhile i<n:\r\n counter=max(List.count(List[i]),counter)\r\n i=i+List.count(List[i])\r\n \r\nif n>=(2*counter-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sz = int(input())\r\nlst = list(map(int, input().strip().split()))\r\ngaps = [0]\r\nfor i in range(len(lst) - 1):\r\n c = 0\r\n j = i + 1\r\n while j < len(lst):\r\n if lst[i] == lst[j]:\r\n c += 1\r\n j += 1\r\n gaps.append(c)\r\nmx = max(gaps)\r\nif sz >= ((mx * 2) + 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncount = Counter(arr)\r\nif max(count.values()) > int((n+1)/2):\r\n print('NO')\r\nelse: print('YES')", "# Codeforces - Yaroslav and Permutations\r\n# https://codeforces.com/contest/296/problem/A\r\n#\r\n# Author: eloyhz\r\n# Date: Sep/04/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n c = [0] * 1001\r\n for x in a:\r\n c[x] += 1\r\n if max(c) <= (n + 1) / 2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n# if n > 1 and max(c) > round(n / 2):\r\n # print('NO')\r\n # else:\r\n # print('YES')\r\n\r\n", "import math\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nmaj=l[0]\r\ncount=1\r\nfor i in range(1,n):\r\n if(l[i]==maj):\r\n count+=1\r\n elif count==0:\r\n maj=l[i]\r\n count+=1\r\n else:\r\n count-=1\r\ncount=0\r\nfor i in range(n):\r\n if l[i]==maj:\r\n count+=1\r\nif(count>math.ceil(n/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\nn = int(input())\ncnt = Counter([int(x) for x in input().split()])\nprint('YES' if cnt.most_common(1)[0][1] <= (n - 1) // 2 + 1 else 'NO')\n", "from statistics import mode\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nmode = mode(arr)\r\nm = arr.count(mode)\r\nif n >= 2*m- 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "import sys\r\nimport math\r\nn=int(input())\r\nr=list(map(int,input().split()))\r\nl= max(set(r), key = r.count)\r\nfor i in r:\r\n if r.count(i)==len(r) and len(r)>1:\r\n print(\"NO\")\r\n sys.exit()\r\n \r\n if r.count(l)>(int(math.ceil(len(r)/2))):\r\n print(\"NO\")\r\n sys.exit()\r\n else:\r\n print(\"YES\")\r\n sys.exit()", "import collections\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=0\r\n\r\nd=collections.Counter(l)\r\nif n%2!=0:\r\n for i in d.values():\r\n if i>((n/2)+1):\r\n c+=1\r\nelse:\r\n for i in d.values():\r\n if i>(n/2):\r\n c+=1\r\nif c>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n ", "from collections import Counter as c\r\na=int(input())\r\nb=c(map(int,input().split()))\r\nprint('YES'if b.most_common(1)[0][1]<=(a+1)//2 else'NO')", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nans=[0 for i in range(1005)]\r\nfor i in arr:\r\n\tans[i]+=1\r\np=max(ans)\r\nif(n%2==0):\r\n\tif(p>n//2):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\nelse:\r\n\tif(p>n//2+1):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n", "x=int(input())\r\nc=1\r\ny=list(map(int,(input().split())))\r\nfr={}\r\nfor i in y:\r\n fr[i]=fr.get(i,0)+1\r\nif max(fr.values())>(x+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=int(input())\r\nm=map(int,input().split())\r\nl=[]\r\nfor x in m : \r\n l.append(x) \r\nres='YES'\r\nM=0\r\nfor x in l : \r\n if l.count(x) > M : \r\n M=l.count(x)\r\ndif = len(l)-M\r\nif dif < M-1 : \r\n res='NO'\r\nprint(res)", "\r\n\r\nfrom collections import Counter\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nif(n==1):\r\n\tprint(\"YES\")\r\n\texit()\r\nc=Counter(l)\r\n\r\nval=c.values()\r\n\r\nval=sorted(val,reverse=True)\r\n\r\nans=n//2\r\n\r\nif(n%2!=0):\r\n\tans+=1\r\n\r\n\r\nfor i in val:\r\n\tif(i>ans):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\r\nprint(\"YES\")", "def solve(n,arr):\n\tfrom math import ceil\n\td={}\n\tfor i in arr:\n\t\td[i] = d.get(i,0) +1\n\tmx=0\n\tfor i in d :\n\t\tmx=max(mx,d[i])\n\n\tif mx<= ceil(n/2) :\n\t\treturn 'YES'\n\t\n\treturn 'NO'\n\n\t\t\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = int(input())\n\nl4=input()\nl4=[int(x) for x in l4.split(' ')]\n\n\n\nprint(solve(l3 ,l4))\n", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n note = dict()\r\n for it in line:\r\n if it in note.keys():\r\n note[it] += 1\r\n else:\r\n note.setdefault(it, 1)\r\n ceil = max(note.values())\r\n if ceil * 2 > n + 1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "n=int(input())\r\ninp=input().split()\r\nl=[]\r\nd={}\r\nfor i in range(len(inp)):\r\n l.append(int(inp[i]))\r\n if(l[i] not in d):\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]=d.get(l[i])+1\r\ngmax=-1\r\nval=-1\r\nfor num in d:\r\n if(gmax<d.get(num)):\r\n gmax=d.get(num)\r\n val=num\r\ncount=0 \r\nfor num in d:\r\n if(val!=num):\r\n count=count+d.get(num)\r\n \r\nif(count>=(gmax-1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\narr = list(map(int, input().strip().split()))[:n]\r\nfreq = [0] * 1005\r\nfor i in arr:\r\n freq[i] += 1\r\nmx = 0\r\nfor i in freq:\r\n mx = max(mx, i)\r\nneed = mx - 1\r\nif need <= n - mx:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = int(input())\r\nnumbers = list(map(int, input().split()))\r\nfrom collections import defaultdict\r\ncount = defaultdict(int)\r\nfor num in numbers:\r\n if num in count.keys():\r\n count[num] += 1\r\n else:\r\n count[num] = 1\r\n\r\nfor value in count.values():\r\n if number % 2 == 0 and value > int(number / 2):\r\n print('NO')\r\n exit()\r\n elif number % 2 == 1 and value > int(number / 2) + 1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "def main():\r\n from sys import stdin, stdout\r\n import collections\r\n n = int(stdin.readline())\r\n d = collections.Counter(map(int,stdin.readline().split()))\r\n flag = True\r\n for i in d:\r\n if n&1:\r\n if d[i]>(n+1)//2:\r\n flag = False\r\n break\r\n else:\r\n if d[i]>n//2:\r\n flag = False\r\n break\r\n if flag:\r\n stdout.write('YES\\n')\r\n else:\r\n stdout.write('NO\\n')\r\n\r\n \r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n = int(input())\nnums = list(map(int,input().split()))\n\n\nfrequencies = {}\n\nfor num in nums:\n frequencies[num] = frequencies.get(num,0) +1\n\nlarge = (-1,0)\nallFr = 0\nfor key,value in frequencies.items():\n if value > large[1]:\n large = (key,value)\n allFr += value\nallFr-=large[1]\nif allFr >= large[1]-1 :\n print('YES')\nelse :\n print('NO')", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncounts = dict()\r\n\r\nfor i in arr:\r\n if i in counts:\r\n counts[i] += 1\r\n else:\r\n counts[i] = 1\r\n\r\nbad = False\r\nfor i in list(counts.values()):\r\n if i > (n + 1) / 2:\r\n bad = True\r\n break\r\n\r\nif not bad:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\ndef test(l) -> bool:\r\n if n%2 == 0:\r\n for e in l:\r\n if l.count(e) > n/2:\r\n return False\r\n return True\r\n else:\r\n for e in l:\r\n if l.count(e) > (n+1)/2:\r\n return False\r\n return True\r\n \r\n \r\nprint(\"YES\" if test(l) else \"NO\")", "x=int(input());y=list(map(int,input().split()));k=True\r\nfor i in (set(y)):\r\n if y.count(i)*2-1>x:k=False\r\nprint(\"YES\"if k else\"NO\")", "n=int(input())\n\narr=[int(x) for x in input().split()]\n\nvalid=True\n\nfor i in range(n):\n c=0\n for j in range(i,n):\n if arr[i]==arr[j]:\n c+=1\n \n if n < (2*c-1): # main condition by observation\n valid=False\n break\n\n\nif valid:\n print (\"YES\")\nelse:\n print(\"NO\")", "from math import ceil\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc = set(arr)\r\nok = 'YES'\r\nfor i in c:\r\n if arr.count(i) > ceil(n/2):\r\n ok = 'NO'\r\nprint(ok)", "n=int(input())\r\na=input().split()\r\nb=set(a)\r\nd={}\r\nS=len(a)\r\nfor i in b:\r\n d[i]=a.count(i)\r\nfor i,k in d.items():\r\n if S-k<k-1:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from math import ceil\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nX = list(map(int, input().split()))\r\nMyDict = defaultdict(int)\r\nfor i in X:\r\n MyDict[i] += 1\r\nfor j in MyDict.values():\r\n if j > ceil(N/2):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n# UB_CodeForces\r\n# Advice: Each failure is a new starting for a success\r\n# Location: Based on popular demand \"\" \"\" \"\" \"\"\r\n# Caption: After TOEFL exam and start from the beginning\r\n# CodeNumber: 580\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nc=[0 for i in range(m+1)]\r\nfor i in a:\r\n\tc[i]+=1\r\nfor i in c:\r\n\tif i>(n+1)//2:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")\r\n", "n = int(input())\r\nnumbers = [x for x in map(int, input().split())]\r\n#counter = {x: 0 for x in range(10)}\r\ncounter = {}\r\nmaximum = 0\r\n\r\nfor item in numbers:\r\n if item not in counter:\r\n counter[item] = 1\r\n else:\r\n counter[item] += 1\r\n\r\nfor item in counter:\r\n if counter[item] > maximum:\r\n maximum = counter[item]\r\n\r\nif n == 1:\r\n print ('YES')\r\nelif n - maximum >= maximum - 1:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n\tif a.count(i)*2-1>n:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "from math import ceil\nn = int(input())\narray = list(map(int, input().split()))\nmaxIter = 0\nfor i in array:\n if array.count(i) > maxIter:\n maxIter = array.count(i)\nprint(\"YES\" if maxIter <= ceil(n/2) else \"NO\")\n", "n=int(input())\r\nlist1=[]\r\nt=[0]*10000\r\nflag=1\r\nstr1=input()\r\nlist2=str1.split(\" \")\r\nlist2_length=len(list2)\r\ni=0\r\nwhile i<=list2_length-1:\r\n list1.append(int(list2.pop()))\r\n i+=1\r\nlist1.reverse()\r\nfor j in range(0,n):\r\n x=list1[j]\r\n t[x]+=1\r\n if t[x]>(n+1)/2:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\r\n# R E X\r\n\r\n\r\n# @Author: Kunal Verma\r\n\r\n# CodeForces - kunalverma19\r\n# CodeChef - kunalverma_19\r\n# AtCoder - TLKunalVermaRX\r\n\r\n# @Last Modified by: Kunal Verma\r\n# @Modified Time: 2021-06-29 09:52:38 (IST)\r\n\r\n\r\nimport math\r\nimport re\r\nimport string\r\nimport sys\r\nfrom itertools import permutations\r\nfrom collections import Counter\r\nimport itertools\r\nMOD = 1000000007\r\ndef inp(): return map(int, input().split(' '))\r\ndef ninp(): return int(input())\r\n\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\nn = ninp()\r\ns = list(inp())\r\nprint(\"YES\"if all([s.count(i)*2-1 <= n for i in s])else \"NO\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=list(set(l))\r\nif(n%2==0):\r\n for i in s:\r\n if(l.count(i)>n//2):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in s:\r\n if(l.count(i)>(n//2+1)):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ncount=1\r\nfor i in range (1,n):\r\n if a[i]==a[i-1] and a.count(a[i])>count:\r\n count+=1\r\n else:\r\n if a.count(i)>count:\r\n count=a.count(i)\r\nk=count\r\nif k<=n//2 and n%2==0:\r\n print(\"YES\")\r\nelif k<=(n//2)+1 and n%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = list(map(int,input().split()))\r\nk = max(s, key=s.count)\r\nprint(\"YES\" if (s.count(k)) <= (n+1)//2 else \"NO\")", "from math import ceil\r\ninp = int(input())\r\nls = list(map(int, input().split()))\r\ndist = [ls[0]]\r\nfor i in ls:\r\n if i not in dist:\r\n dist.append(i)\r\ndist = [ls.count(q) for q in dist]\r\nif max(dist) >= ceil(inp/2) + 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# coding: utf-8\nfrom collections import Counter\nn = int(input())\nc = Counter([int(i) for i in input().split()])\nmaxtime = c.most_common()[0][1]\nif n >= 2*maxtime-1:\n print('YES')\nelse:\n print('NO')\n", "from collections import Counter\n\nn = int(input())\ncounts = Counter(map(int, input().split()))\n\nlimit = (n + 1) // 2\nvalid = True\n\nfor _, c in counts.items():\n if c > limit:\n valid = False\n break\n\nif valid:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "q=int(input())\r\nw=[int(e)for e in input().split()]\r\nr=list(set(w))\r\n\r\nt=[]\r\nfor i in r:\r\n t.append(w.count(i))\r\nif len(set(w))==1:\r\n if w.count(r[0])>1:\r\n print('NO')\r\n exit()\r\n else:\r\n print('YES')\r\n exit()\r\n\r\nif max(t)-(sum(t)-max(t))<2:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nmyList = list(map(int, input().split()))\r\nmx = 0\r\nfor i in range(len(myList)):\r\n mx = max(mx, myList.count(myList[i]))\r\nif mx > (len(myList) + 1) // 2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import math\nn = int(input())\na = list(map(int, input().split()))\np = math.ceil(n/2)\nif len(a) == 1:\n print(\"YES\")\n exit()\ndict = {}\nfor i in a:\n if i not in dict:\n dict[i] = 1\n else :\n dict[i] += 1\nk = max(dict.values())\nif len(set(a)) >= 2 and k <= p:\n print(\"YES\")\nelse :\n print(\"NO\")\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nif n==1:\r\n\tprint(\"YES\")\r\nelif n!=1 and len(set(a))==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\td={}\r\n\tfor i in a:\r\n\t\tif i in d:\r\n\t\t\td[i]+=1\r\n\t\telse:\r\n\t\t\td[i]=1\r\n\r\n\tcounts = list( d.values() )\r\n\tcounts.sort()\r\n\ts=counts[-2]\r\n\tr = counts[-1]-counts[-2]\r\n\r\n\tif ((n-r-1)+2)-s*2 >= r:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor x in l:\r\n d[x]=d.get(x,0)+1\r\nfor x in d:\r\n if d[x]>(n+1)//2: print(\"NO\"); break\r\nelse: print(\"YES\")", "import math\r\nfrom collections import Counter\r\nn,l=int(input()),Counter(list(map(int,input().split())))\r\nprint('YES' if max(l.values())<=math.ceil(n/2) else 'NO')", "def main():\r\n\t\r\n\tn = int(input())\r\n\ta = [int(i) for i in input().split()]\r\n\r\n\t# C <= (n+1) // 2\r\n\tcounter = [0] * (max(a) + 1)\r\n\tfor i in a:\r\n\t\tcounter[i] += 1\r\n\r\n\tstatus = True\r\n\tfor i in counter:\r\n\t\tif i > (n + 1) // 2:\r\n\t\t\tstatus = False\r\n\r\n\tif status:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "if __name__ == \"__main__\":\r\n n = int (input ())\r\n\r\n arr = [0] * 1001\r\n\r\n v = list (map (int, input ().split ()))\r\n\r\n for i in range (n):\r\n arr[v[i]] += 1\r\n\r\n if n % 2 == 1:\r\n n += 1\r\n\r\n n //= 2\r\n\r\n print (\"NO\", end = \"\") if max (arr) > n else print (\"YES\", end = \"\")", "n = int(input())\r\nthe_list = list(map(int, input().split()))\r\nfor i in the_list:\r\n a = the_list.count(i)\r\n if n - a < a - 1:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "import sys\nimport math\ninput = sys.stdin.readline\n\ncnts = [0] * 1500\nn = int(input().strip())\na = list(map(int, input().strip().split()))\nfor el in a: cnts[el] += 1\nif n - max(cnts) >= max(cnts) - 1: print('YES')\nelse: print('NO')\n", "from math import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nmp={}\r\nmaxf=0\r\n\r\nfor i in a:\r\n if(i not in mp.keys()):\r\n mp[i]=1\r\n else:\r\n mp[i]+=1\r\n \r\n if(maxf<mp[i]):\r\n maxf=mp[i]\r\n\r\nif(maxf>ceil(n/2)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n ", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ncnt = {}\r\nmaxi = float('-inf')\r\nfor i in arr:\r\n if i not in cnt:\r\n cnt[i] = 1\r\n else:\r\n cnt[i] += 1\r\n maxi = max(maxi, cnt[i])\r\nif maxi <= (n+1)//2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from typing import Counter \r\n\r\n# for _ in range(1,n+1):\r\n # n=int(input()) \r\n # x,y=map(int,input().split()) \r\n# s=input()\r\nn=int(input())\r\nif n==1:\r\n print(\"YES\")\r\n exit()\r\narr=list(map(int,input().split()))\r\ncnt=Counter()\r\nfor i in arr:\r\n cnt[i]+=1\r\n# print(len(cnt))\r\n\r\nval=list(cnt.values())\r\nif len(cnt)==1:\r\n print(\"NO\")\r\n exit()\r\nval.sort(reverse=True)\r\n# print(val)\r\nmx=val[0]\r\nmn=val[-1]\r\ndiff=[]\r\nfor i in range(len(val)-1):\r\n diff.append(val[i]-val[i+1])\r\ndiff.sort(reverse=True)\r\nfor i in diff[1:]:\r\n diff[0]-=i\r\n# print(mx-mn)\r\nif val[0]<=len(cnt)-1 or diff[0] in [-1,0,1] or (val[0]-mn in [-1,0,1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n d={}\r\n for i in l:\r\n d[i]=0\r\n for i in l:\r\n d[i]+=1\r\n for i in d:\r\n c=d[i]\r\n if(c>((n+1)/2)):\r\n return 'NO'\r\n return 'YES'\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint(exe())", "n=int(input())\r\na=list(map(int, input().split()))\r\nb={}\r\nfor i in a:\r\n if i in b:b[i]+=1\r\n else:b[i]=1\r\nt=0\r\nfor i in b:\r\n if b[i]>t:t=b[i]\r\nif n-t>=t-1:print('YES')\r\nelse:print('NO')\r\n", "from collections import Counter\nfrom math import ceil\n\nn = int(input())\narr = input().strip().split()\ntc = len(arr)\ncnt = Counter(arr)\nfor key in cnt:\n if cnt[key] > ceil(tc/2):\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nc = Counter(arr)\r\nlis = list(c.values())\r\nlis.sort()\r\nif lis[-1] > math.ceil(n/2):\r\n print('NO')\r\nelse:\r\n print('YES') ", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = max(Counter(map(int, input().split())).values())\r\nif w > (n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import ceil\r\nn = int(input())\r\npocet = ceil(n/2)\r\narr = list(map(int, input().split()))\r\nx = set(map(int, arr))\r\nmaxi = 0\r\nfor i in x:\r\n if arr.count(i) > maxi:\r\n maxi = arr.count(i)\r\nif maxi > pocet:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\noccs = {}\r\nfor elem in a:\r\n if elem not in occs:\r\n occs[elem] = 1\r\n else:\r\n occs[elem] += 1\r\nprint(\"YES\" if max(occs.values()) <= (n + 1) // 2 else \"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\nm=0\r\nfor i in b:\r\n\tm=max(a.count(i),m)\r\nif m<=(len(a)//2+len(a)%2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndic = {}\r\n\r\nfor i in a:\r\n if i in dic:\r\n dic[i] += 1\r\n else:\r\n dic[i] = 1\r\n\r\nprint(\"YES\" if max(dic.values()) <= (n+1)//2 else \"NO\")\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = {}\r\nfor i in arr:\r\n\tif i in m:\r\n\t\tm[i] += 1\r\n\telse:\r\n\t\tm[i] = 1\r\nf = True\r\nfor i in m:\r\n\tif m[i] > (n+1)//2:\r\n\t\tprint('NO')\r\n\t\tf = False\r\nif f:\r\n\tprint('YES')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nch=[0]*(max(a)+1)\r\nfor i in a :\r\n ch[i]+=1\r\n\r\nif n%2!=0 :\r\n n+=1\r\n\r\nf=True\r\nfor i in ch :\r\n if i>n/2 :\r\n f=False\r\n break\r\nif f==True :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nk=0\r\nfor i in a:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nflag=0\r\nfor j in a:\r\n\tif d[j]>(n+1)//2:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")\r\n", "from collections import Counter\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n array = Counter(map(int, input().split()))\r\n if n >= 2 * max(array.values()) - 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nl = input().split(' ')\r\nd = dict()\r\nfor x in l:\r\n x = int(x)\r\n if x in d.keys():\r\n d[x] += 1\r\n else: d[x] = 1\r\n\r\nM = 0\r\nfor x in d.keys():\r\n if M < d[x]: M = d[x]\r\n\r\nif(M > (n+1)//2):\r\n print(\"NO\")\r\nelse: print(\"YES\")\r\n", "#from dust i have come, dust i will be\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\ndict={}\r\n\r\nfor i in range(n):\r\n try:\r\n x=dict[a[i]]\r\n dict[a[i]]+=1\r\n except:\r\n dict[a[i]]=1\r\n\r\n if dict[a[i]]>(n+1)//2:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint('YES' if all([l.count(i)*2-1 <= n for i in l]) else 'NO')", "#one day im gonna in sha allah\r\n\r\nimport math\r\n\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input())\r\n numbers = input().split()\r\n ind = numbers.count(max(set(numbers), key= numbers.count))\r\n\r\n if((n - ind + 1) >= ind or n == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n= int(input())\r\nx= list(map(int , input().split()))\r\ndictt ={}\r\nfor i in set(x) : \r\n dictt[i] = x.count(i) \r\nres ='YES'\r\nfor key ,value in dictt.items() : \r\n if value == 1 : \r\n continue\r\n elif value - 1 > n - value : \r\n res =\"NO\"\r\n break \r\nprint(res)", "n = int(input())\r\na = [*map(int, input().split())]\r\nM = 0\r\nfor x in set(a):\r\n if a.count(x) >= M:\r\n M = a.count(x)\r\nprint('YNEOS'[n + 1 < 2*M ::2])\r\n \r\n \r\n", "def inp():\r\n ls=list(map(int,input().split()))\r\n return ls\r\nt=int(input())\r\nls=inp()\r\nans=[0]*len(set(ls))\r\nall=list(set(ls))\r\nfor i in range(len(set(ls))):\r\n for j in range(t):\r\n if all[i]==ls[j]:\r\n ans[i]+=1\r\n#print(ans)\r\nfor i in ans:\r\n if i>(t+1)//2:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nhashVal = {}\r\n\r\nfor num in arr:\r\n if num not in hashVal:\r\n hashVal[num] = 1\r\n else:\r\n hashVal[num]+=1\r\n\r\n#print(hashVal)\r\n\r\n#noOf = len(hashVal.keys())\r\nlength = len(arr)\r\nflag = True\r\nif length%2!=0:\r\n for key in hashVal:\r\n if hashVal[key] > n//2 + 1:\r\n flag = False\r\n break\r\n\r\nelse:\r\n for key in hashVal:\r\n if hashVal[key] >= n//2 + 1:\r\n flag = False\r\n break\r\n\r\n\r\nif flag:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n'''\r\nif noOf>=2:\r\n print(\"YES\")\r\n\r\nelse:\r\n if len(arr)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n'''\r\n", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif n==1:print('YES')\r\nelse:\r\n ans=[]\r\n for i in set(lst):ans.append(lst.count(i))\r\n dec=max(ans)\r\n leng=len(lst)\r\n if leng%2:\r\n if dec>(leng+1)//2:print('NO')\r\n else:print('YES')\r\n else:\r\n if dec>leng//2:print('NO')\r\n else:print('YES')\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\r\n\"\"\"\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nfor i in m:\r\n\ta = m.count(i)\r\n\tif n % 2 == 0:\r\n\t\tif a > n // 2:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\n\telse:\r\n\t\tif a > (n + 1) // 2:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\nprint(\"YES\")\r\n\t\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncounts= [0]*1001\r\n\r\nfor x in arr:\r\n\tcounts[x]+=1\r\n\r\nmx = index = 0\r\nfor i in range(len(counts)):\r\n\tif(counts[i] > mx):\r\n\t\tmx = counts[i]\r\n\t\tindex = i\r\nsu = 0\r\nfor i in range(len(counts)):\r\n\tif(i != index):\r\n\t\tsu+=counts[i]\r\n\r\nif(su >= counts[index]-1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#61\r\nn = int(input())\r\nins = [int(x) for x in input().split()]\r\n\r\ncountDict = {}\r\nmaxCount = 1\r\nfor elemnt in ins:\r\n try:\r\n countDict[elemnt] += 1\r\n if countDict[elemnt] > maxCount:\r\n maxCount = countDict[elemnt]\r\n except:\r\n countDict[elemnt] = 1\r\n\r\nif n - maxCount >= maxCount - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import itertools\r\nimport math\r\nimport threading\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\nfrom math import factorial as fac\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n if n == 1:\r\n print(\"YES\")\r\n return\r\n\r\n m = {}\r\n for i in range(n):\r\n if a[i] not in m:\r\n m[a[i]] = 1\r\n else:\r\n m[a[i]] += 1\r\n\r\n mx = max(m.values())\r\n if mx <= 1 + n - mx:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n multitest = 0\r\n\r\n if multitest != 0:\r\n t = int(sys.stdin.readline())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*1005\r\nfor i in a:\r\n b[i]+=1\r\nif max(b)<=(math.ceil(n/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n \r\nn=int(input())\r\nl=RI()\r\nd=df(int)\r\n\r\nfor i in l:\r\n d[i]+=1\r\n\r\n\r\nf=0\r\nm=(n+1)//2\r\nfor i in d:\r\n if(d[i]>m):\r\n f=1\r\n break\r\n\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n = int(input())\r\nnumbers = (map(int, input().split()))\r\ntwo_count = 0\r\n\r\nans_dict = dict()\r\n\r\nfor i in numbers:\r\n ans_dict[i] = ans_dict.get(i, 0) + 1\r\n\r\nfor k, v in ans_dict.items():\r\n if v > (n +1)/2:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n\r\n", "from collections import Counter\r\nimport math\r\nn = int(input())\r\narr = [int(k) for k in input().split()]\r\nc = Counter(arr)\r\nm = max(c[k] for k in c)\r\n\r\nif len(arr) % 2 == 0:\r\n if m <= (len(arr) // 2):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif len(arr) % 2 != 0:\r\n if m <= (math.ceil(len(arr) / 2)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\n\nc = Counter(arr)\nimport math\nmax_v = -math.inf\nfor k, v in c.items():\n max_v = max(max_v, v)\n\nif max_v <= (n+1)//2:\n print('YES')\nelse:\n print('NO')\n", "# python 3\n\"\"\"\nNote that after applying the operations of the exchange, we can get any permutation of the elements of the array.\nIt is not difficult to understand that the answer would be \"YES\" if there were at least another different\nnumber between the same-valued number, and this means that at most the same-valued number would appear\n(n+1)/2 times. Thus, if the most seen number appear C times, it must fulfill the condition C <= (n+1) / 2.\n\"\"\"\n\n\ndef yaroslav_and_permutations(n_int: int, numbers_list: list) -> str:\n times = dict()\n for each in numbers_list:\n if times.get(each, -1) == -1:\n times[each] = 1\n else:\n times[each] += 1\n max_seen = 0\n for (number, seen_time) in times.items():\n if seen_time > max_seen:\n max_seen = seen_time\n if max_seen <= (n_int + 1) // 2:\n return \"YES\"\n else:\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n n = int(input())\n numbers = list(map(int, input().split()))\n print(yaroslav_and_permutations(n, numbers))\n", "n = int(input())\nm = input().split()\npossible = True\nfor i in set(m):\n if m.count(i) >= n/2 + 1:\n possible = False\n break\nprint('YES' if possible else 'NO')", "n = int(input())\r\n\r\narr = list(map(int, input().strip().split()))\r\n\r\ndic = {}\r\n\r\nfor x in range(n):\r\n \r\n if arr[x] not in dic:\r\n dic[arr[x]] = 1\r\n else:\r\n dic[arr[x]] += 1\r\nr = 0\r\nif n % 2 ==0:\r\n r = n // 2\r\nelse:\r\n r = n // 2 + 1\r\n\r\nflag =0 \r\nfor e in dic:\r\n if dic[e] > r:\r\n print(\"NO\")\r\n flag = 1\r\nif flag == 0:\r\n print(\"YES\")\r\n ", "n = int(input())\na = list(map(int, input().split()))\nfor q in a:\n if a.count(q) > (n+1)//2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n=int(input())\r\nx=list(map(int, input().split()))\r\nfreq = {}\r\nfor item in x:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\np=max(freq.values())\r\nq=sum(freq.values())-p\r\nif q>=p or p-q==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\narray = list(map(int, input().split()))\nhash_map = {}\n\nfor x in array:\n if x not in hash_map:\n hash_map[x] = 1\n else:\n hash_map[x] += 1\n\nflag = True\n\nfor v in hash_map.values():\n if v > (n + 1) / 2:\n flag = False\n break\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from collections import Counter\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nif (n == 1):\r\n print(\"YES\")\r\n exit(0)\r\nif (n == 2):\r\n if (numbers[0] != numbers[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nc = Counter(numbers)\r\nmaxValue = 0\r\nif (n % 2 == 0):\r\n maxValue = n // 2\r\nelse:\r\n maxValue = (n // 2) + 1\r\nfor value in c.values():\r\n if (value > maxValue):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "\"\"\"A. Yaroslav and Permutations\"\"\"\r\nlength = int(input())\r\narray = [int(element) for element in input().split()]\r\nfor i in array:\r\n if array.count(i) > (length+1)//2:\r\n print('NO')\r\n break\r\n\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk={}\r\nfor i in l:\r\n if i not in k.keys():\r\n k[i]=1\r\n else:\r\n k[i]+=1\r\nif max(k.values())<=(n+1)/2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(\"YES\"if all([a.count(i)*2-1<=n for i in a])else\"NO\")", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nans = 'YES'\r\nfor i in l:\r\n if l.count(i)>(n+1)/2:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "from collections import Counter\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\ndictt = Counter(lst)\r\nfor i in dictt.keys():\r\n if dictt[i] > (n + 1) // 2:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "from collections import Counter as cn\r\nn=int(input()) \r\na=list(map(int,input().split()))\r\n#print(len(set(a)))\r\nl=cn(a)\r\nvv=list(l.values())\r\nmx=max(vv)\r\nif n-mx>=mx-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "\r\nn = int(input())\r\n\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\n\r\narr = sorted(arr)\r\n\r\ncont = 1\r\nmcont = 1\r\n\r\n\r\nfor i in range(1,n):\r\n if arr[i]==arr[i-1]:\r\n cont+=1\r\n\r\n if cont>mcont:\r\n mcont=cont\r\n else:\r\n cont=1\r\n\r\n\r\nif mcont<=int((n+1)/2):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = 0\r\nfor i in a: mx = max(mx, a.count(i))\r\nif n%2==1:\r\n if mx>(n//2)+1: print('NO')\r\n else: print('YES')\r\nelse:\r\n if mx>n//2: print('NO')\r\n else: print('YES')\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nsize = len(nums)\r\nmax_freq = 0\r\n\r\nset_nums = set(nums)\r\nfor num in set_nums:\r\n if max_freq < nums.count(num):\r\n max_freq = nums.count(num)\r\n \r\nif size - max_freq >= max_freq - 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=0\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n for i in l:\r\n c=l.count(i)\r\n if (2*c)-n>1:\r\n print(\"NO\")\r\n d+=1\r\n break\r\n if d==0:\r\n print(\"YES\")\r\n", "from collections import Counter\nn = int(input())\narr = input().split()\ncounter = Counter(arr)\nif n == 1 or (n-max(counter.values())) >= max(counter.values()) - 1:\n print(\"YES\")\nelse :\n print(\"NO\")\n\n\n\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[18]:\n\n\ndef Paint_the_Array():\n n = int(input())\n a = list(map(int, input().split()))\n for i in a:\n if n % 2 == 0:\n if a.count(i) > n / 2:\n return 'NO'\n else:\n if a.count(i) > (n + 1) / 2:\n return 'NO'\n return 'YES'\n \nprint(Paint_the_Array())\n\n\n# In[ ]:\n\n\n\n\n", "# Problem Link: https://codeforces.com/problemset/problem/296/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount = {}\r\nmax_count = 0\r\nfor el in arr:\r\n count[el] = count.get(el, 0) + 1\r\n if (count[el] > max_count):\r\n max_count = count[el]\r\n\r\ngreater_than = n/2\r\nif (n%2 == 1):\r\n greater_than = greater_than + 1\r\nif max_count > greater_than:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\n\r\nN = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\n\r\nset_of_numbers = list(set(numbers))\r\n\r\ncountr = [None] * len(set_of_numbers)\r\nfor i in range(len(set_of_numbers)):\r\n countr[i] = numbers.count(set_of_numbers[i])\r\n\r\nif max(countr) > math.ceil(N/2):\r\n print('NO')\r\nelse:\r\n print('YES')", "_ = input()\nnumbers = {}\nsize = 0\n\nfor num in input().split():\n if num in numbers:\n numbers[num] += 1\n else:\n numbers[num] = 1\n\n size += 1\n\nhalf = size // 2 + size % 2\n\nfor value in numbers.values():\n if value > half:\n print('NO')\n exit()\n\nprint('YES')", "n = int(input())\r\narr = list(map(int, input().split()))\r\nd = {}\r\nfor i in arr:\r\n d.setdefault(i, [0])[0] += 1\r\n\r\nif len(arr) % 2 == 0:\r\n cond = len(arr) // 2 + 1\r\nelse:\r\n cond = len(arr) // 2 + 2\r\nfor i in d:\r\n if d[i][0] >= cond:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\nl = list(map(int,input().split()))\nif n == 1:\n print('YES')\nelse:\n from collections import Counter\n c = Counter(l)\n z = list(c.values())\n popa = n - max(z)\n if popa >= max(z) or popa == max(z)-1:\n print('YES')\n else:\n print('NO')\n", "n = int(input())\r\n\r\nl =input().split()\r\nmy_dict = {i:l.count(i) for i in l}\r\n\r\nm = max(my_dict.values())\r\n\r\nthres = n // 2 \r\nif (n % 2 ==1):\r\n thres +=1\r\n\r\nif m > thres:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "import collections\r\nn=int(input())\r\n\r\na=[i for i in map(int,input().split())]\r\nd=collections.Counter(a)\r\nx=[d[i] for i in d]\r\nif max(x)>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nvisited = {}\r\n\r\nfor num in a:\r\n if not num in visited:\r\n visited[num] = 0\r\n\r\n visited[num] += 1\r\n\r\nfor num in visited:\r\n if visited[num] > (n + 1) / 2:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ndiff ={}\r\nif n == 1:\r\n print('YES')\r\nelse:\r\n for elem in a:\r\n if elem in diff:\r\n diff[elem] += 1\r\n else:\r\n diff[elem] = 1\r\n s = 0\r\n for j in diff:\r\n s += diff[j]\r\n\r\n for elem in diff:\r\n if diff[elem] == n:\r\n print('NO')\r\n break\r\n elif diff[elem] > s - diff[elem] + 1:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n", "import math\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\ncounter = 0\r\nfor i in (set(ls)):\r\n if ls.count(i)>counter:\r\n counter=ls.count(i)\r\nprint(\"YES\" if counter <= math.ceil(n/2) else \"NO\")", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(1004)]\r\n is_answer_given = False\r\n for i in range(len(a)):\r\n hash_a[a[i]] += 1\r\n for i in range(len(hash_a)):\r\n if hash_a[i] > math.ceil(len(a) / 2):\r\n print(\"NO\")\r\n is_answer_given = True\r\n break\r\n if not is_answer_given:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "n = int(input())\r\n\r\nls = list(map(int, input().split()))\r\n\r\ncnt = dict()\r\n\r\nans = True\r\n\r\nfor el in ls:\r\n if el not in cnt:\r\n cnt[el] = 1\r\n else:\r\n cnt[el] += 1\r\n if cnt[el] > (n + 1) // 2:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "def perms(dic,n):\r\n for ele in dic:\r\n if dic[ele]> (n+1)//2:\r\n return 'NO'\r\n \r\n return 'YES'\r\nn= int(input())\r\nl= list(map(int, input().split()))\r\ndic={}\r\nfor i in range(n):\r\n if l[i] not in dic:\r\n dic[l[i]]=1\r\n else:\r\n dic[l[i]]+=1\r\n\r\nprint(perms(dic, n))\r\n", "import sys\r\nn=int(input())\r\na=list(sys.stdin.readline().strip().split())\r\ncount={}\r\nfor i in a:\r\n if i in count.keys():\r\n count[i]+=1\r\n else:\r\n count[i]=1\r\nli=list(count.values())\r\nli.sort()\r\nif li[len(li)-1]>(n+1)//2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import ceil\r\nn = int(input())\r\nnums = list(input().split())\r\ncounts = {}\r\nfor i in range(n):\r\n if nums[i] not in counts:\r\n counts[nums[i]] = 0\r\n counts[nums[i]] += 1\r\n\r\nmaxcount = 0\r\nfor key in counts:\r\n if counts[key] > maxcount:\r\n maxcount = counts[key]\r\n \r\nif maxcount <= ceil(n/2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncnt=1\r\nmaxx=1\r\nfor i in range(1,t):\r\n if(l[i]==l[i-1]):\r\n cnt+=1\r\n maxx=max(cnt,maxx)\r\n else:\r\n cnt=1\r\n\r\nif(maxx<=((t+1)/2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ndic = Counter(a)\r\nif len(dic)==n:\r\n print('YES')\r\nelif(len(dic)==1):\r\n print('NO')\r\nelse:\r\n f=0\r\n for k in dic:\r\n v =dic[k]\r\n if(v>(n+1)//2):\r\n print('NO')\r\n f=1\r\n break\r\n\r\n if f==0:\r\n print('YES')", "n = int(input())\r\nv = list(map(int, input().split()))\r\nsol = 'YES'\r\n\r\nfor x in v:\r\n if v.count(x) * 2 > n + 1: sol = 'NO'\r\n\r\nprint(sol)\r\n", "n=int(input());l=list(map(int,input().split()));d=n-n//2;s=set(l)\r\nfor i in list(s):\r\n\ta=l.count(i)\r\n\tif a<=d:pass\r\n\telse:print('NO');break\r\nelse:print('YES')", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nfor i in a:\n if a.count(i) > (n + 1) // 2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\ne = set()\r\nd = []\r\nfor i in range(n):\r\n\tif s[i] not in e:\r\n\t\td.append(s.count(s[i]))\r\n\t\te.add(s[i])\r\n\r\nif max(d)>-(-n//2):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")" ]

{"inputs": ["1\n1", "3\n1 1 2", "4\n7 7 7 7", "4\n479 170 465 146", "5\n996 437 605 996 293", "6\n727 539 896 668 36 896", "7\n674 712 674 674 674 674 674", "8\n742 742 742 742 742 289 742 742", "9\n730 351 806 806 806 630 85 757 967", "10\n324 539 83 440 834 640 440 440 440 440", "7\n925 830 925 98 987 162 356", "68\n575 32 53 351 151 942 725 967 431 108 192 8 338 458 288 754 384 946 910 210 759 222 589 423 947 507 31 414 169 901 592 763 656 411 360 625 538 549 484 596 42 603 351 292 837 375 21 597 22 349 200 669 485 282 735 54 1000 419 939 901 789 128 468 729 894 649 484 808", "22\n618 814 515 310 617 936 452 601 250 520 557 799 304 225 9 845 610 990 703 196 486 94", "44\n459 581 449 449 449 449 449 449 449 623 449 449 449 449 449 449 449 449 889 449 203 273 329 449 449 449 449 449 449 845 882 323 22 449 449 893 449 449 449 449 449 870 449 402", "90\n424 3 586 183 286 89 427 618 758 833 933 170 155 722 190 977 330 369 693 426 556 435 550 442 513 146 61 719 754 140 424 280 997 688 530 550 438 867 950 194 196 298 417 287 106 489 283 456 735 115 702 317 672 787 264 314 356 186 54 913 809 833 946 314 757 322 559 647 983 482 145 197 223 130 162 536 451 174 467 45 660 293 440 254 25 155 511 746 650 187", "14\n959 203 478 315 788 788 373 834 488 519 774 764 193 103", "81\n544 528 528 528 528 4 506 528 32 528 528 528 528 528 528 528 528 975 528 528 528 528 528 528 528 528 528 528 528 528 528 20 528 528 528 528 528 528 528 528 852 528 528 120 528 528 61 11 528 528 528 228 528 165 883 528 488 475 628 528 528 528 528 528 528 597 528 528 528 528 528 528 528 528 528 528 528 412 528 521 925", "89\n354 356 352 355 355 355 352 354 354 352 355 356 355 352 354 356 354 355 355 354 353 352 352 355 355 356 352 352 353 356 352 353 354 352 355 352 353 353 353 354 353 354 354 353 356 353 353 354 354 354 354 353 352 353 355 356 356 352 356 354 353 352 355 354 356 356 356 354 354 356 354 355 354 355 353 352 354 355 352 355 355 354 356 353 353 352 356 352 353", "71\n284 284 285 285 285 284 285 284 284 285 284 285 284 284 285 284 285 285 285 285 284 284 285 285 284 284 284 285 284 285 284 285 285 284 284 284 285 284 284 285 285 285 284 284 285 284 285 285 284 285 285 284 285 284 284 284 285 285 284 285 284 285 285 285 285 284 284 285 285 284 285", "28\n602 216 214 825 814 760 814 28 76 814 814 288 814 814 222 707 11 490 814 543 914 705 814 751 976 814 814 99", "48\n546 547 914 263 986 945 914 914 509 871 324 914 153 571 914 914 914 528 970 566 544 914 914 914 410 914 914 589 609 222 914 889 691 844 621 68 914 36 914 39 630 749 914 258 945 914 727 26", "56\n516 76 516 197 516 427 174 516 706 813 94 37 516 815 516 516 937 483 16 516 842 516 638 691 516 635 516 516 453 263 516 516 635 257 125 214 29 81 516 51 362 516 677 516 903 516 949 654 221 924 516 879 516 516 972 516", "46\n314 723 314 314 314 235 314 314 314 314 270 314 59 972 314 216 816 40 314 314 314 314 314 314 314 381 314 314 314 314 314 314 314 789 314 957 114 942 314 314 29 314 314 72 314 314", "72\n169 169 169 599 694 81 250 529 865 406 817 169 667 169 965 169 169 663 65 169 903 169 942 763 169 807 169 603 169 169 13 169 169 810 169 291 169 169 169 169 169 169 169 713 169 440 169 169 169 169 169 480 169 169 867 169 169 169 169 169 169 169 169 393 169 169 459 169 99 169 601 800", "100\n317 316 317 316 317 316 317 316 317 316 316 317 317 316 317 316 316 316 317 316 317 317 316 317 316 316 316 316 316 316 317 316 317 317 317 317 317 317 316 316 316 317 316 317 316 317 316 317 317 316 317 316 317 317 316 317 316 317 316 317 316 316 316 317 317 317 317 317 316 317 317 316 316 316 316 317 317 316 317 316 316 316 316 316 316 317 316 316 317 317 317 317 317 317 317 317 317 316 316 317", "100\n510 510 510 162 969 32 510 511 510 510 911 183 496 875 903 461 510 510 123 578 510 510 510 510 510 755 510 673 510 510 763 510 510 909 510 435 487 959 807 510 368 788 557 448 284 332 510 949 510 510 777 112 857 926 487 510 510 510 678 510 510 197 829 427 698 704 409 509 510 238 314 851 510 651 510 455 682 510 714 635 973 510 443 878 510 510 510 591 510 24 596 510 43 183 510 510 671 652 214 784", "100\n476 477 474 476 476 475 473 476 474 475 473 477 476 476 474 476 474 475 476 477 473 473 473 474 474 476 473 473 476 476 475 476 473 474 473 473 477 475 475 475 476 475 477 477 477 476 475 475 475 473 476 477 475 476 477 473 474 477 473 475 476 476 474 477 476 474 473 477 473 475 477 473 476 474 477 473 475 477 473 476 476 475 476 475 474 473 477 473 475 473 477 473 473 474 475 473 477 476 477 474", "100\n498 498 498 498 498 499 498 499 499 499 498 498 498 498 499 498 499 499 498 499 498 498 498 499 499 499 498 498 499 499 498 498 498 499 498 499 498 498 498 499 498 499 498 498 498 498 499 498 498 499 498 498 499 498 499 499 498 499 499 499 498 498 498 498 499 498 499 498 499 499 499 499 498 498 499 499 498 499 499 498 498 499 499 498 498 499 499 499 498 498 499 498 498 498 499 499 499 498 498 499", "100\n858 53 816 816 816 816 816 816 816 181 816 816 816 816 579 879 816 948 171 816 816 150 866 816 816 816 897 816 816 816 816 816 816 706 816 539 816 816 816 816 816 816 423 487 816 615 254 816 816 816 816 83 816 816 816 816 816 816 816 816 816 816 816 136 775 999 816 816 816 644 816 816 816 816 927 816 802 816 856 816 816 816 816 816 816 816 816 816 816 700 816 816 816 816 982 477 816 891 806 816", "100\n167 169 169 167 169 169 167 167 167 167 168 166 170 170 169 170 170 170 169 168 166 167 170 169 167 169 168 169 166 170 166 167 170 166 166 167 169 166 166 169 166 167 168 168 170 167 168 166 168 170 167 168 167 169 169 166 168 167 170 168 167 169 168 169 166 168 168 169 169 166 170 168 167 169 170 168 167 169 168 167 168 168 166 169 170 170 166 166 167 170 167 168 167 167 169 169 166 166 169 167", "100\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "99\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "100\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "99\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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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\n1 1", "1\n1000", "12\n2 2 4 4 4 4 6 6 6 6 6 6"], "outputs": ["YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

440

d6450d9766b2a425003aff887bf2eda8

Pyramid of Glasses

Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is *n*. The top level consists of only 1 glass, that stands on 2 glasses on the second level (counting from the top), then 3 glasses on the third level and so on.The bottom level consists of *n* glasses. Vlad has seen in the movies many times how the champagne beautifully flows from top levels to bottom ones, filling all the glasses simultaneously. So he took a bottle and started to pour it in the glass located at the top of the pyramid. Each second, Vlad pours to the top glass the amount of champagne equal to the size of exactly one glass. If the glass is already full, but there is some champagne flowing in it, then it pours over the edge of the glass and is equally distributed over two glasses standing under. If the overflowed glass is at the bottom level, then the champagne pours on the table. For the purpose of this problem we consider that champagne is distributed among pyramid glasses immediately. Vlad is interested in the number of completely full glasses if he stops pouring champagne in *t* seconds. Pictures below illustrate the pyramid consisting of three levels. The only line of the input contains two integers *n* and *t* (1<=≤<=*n*<=≤<=10,<=0<=≤<=*t*<=≤<=10<=000) — the height of the pyramid and the number of seconds Vlad will be pouring champagne from the bottle. Print the single integer — the number of completely full glasses after *t* seconds. Sample Input 3 5 4 8 Sample Output 4 6

[ "#!/usr/bin/env python\n# coding: utf-8\n\n# In[24]:\n\n\nclass Solution:\n def fillCups(self, idx, array, level,volume):\n if(idx>=len(array) or volume == 0):\n return\n array[idx]+=volume\n if(array[idx]<1):\n return \n volume = array[idx]-1\n array[idx]=1\n left = level + idx\n right = left + 1\n self.fillCups(left, array, level+1, volume/2)\n self.fillCups(right, array, level+1, volume/2)\n \n def pyramidOfGlasses(self,levels,time):\n array=[0 for i in range((levels*(levels+1))//2)]\n self.fillCups(0,array,1,time*1.0)\n return array.count(1)\n\n\n# In[25]:\n\n\nlevels, time = map(int, input().split())\nsol=Solution()\ncount = sol.pyramidOfGlasses(levels, time)\nprint(count)\n\n\n# In[ ]:\n\n\n\n\n", "n,t=map(int,input().split())\r\n\r\nif t==0:\r\n\tprint(0)\r\n\texit()\r\n\r\nans=0\r\nl=[t]\r\nfor s in range(2,n+1):\r\n\ta=[0]*s\r\n\tfor i in range(s-1):\r\n\t\tif l[i]>=1:\r\n\t\t\tans+=1\r\n\t\t\trem=(l[i]-1)/2\r\n\t\t\ta[i]+=rem\r\n\t\t\ta[i+1]+=rem\r\n\tl=a\r\nfor i in range(n):\r\n\tif l[i]>=1:ans+=1\r\nprint(ans)\r\n\r\n", "class Solution:\r\n def PourLiquid(self):\r\n Grid[1][1] += 1\r\n for i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if Grid[i][j]<=1: continue\r\n p = Grid[i][j]-1\r\n Grid[i][j] = 1\r\n Grid[i+1][j] += p/2\r\n Grid[i+1][j+1] += p/2\r\n return\r\n def GlassesFilled(self,n,t):\r\n global Grid\r\n Grid = [[0 for i in range(12)]for j in range(12)]\r\n count = 0\r\n for T in range(t):\r\n self.PourLiquid()\r\n for i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if Grid[i][j] >=1: count += 1\r\n return count\r\nif __name__==\"__main__\":\r\n n,t = map(int,input().split())\r\n s = Solution()\r\n print(s.GlassesFilled(n,t))", "from collections import deque\nn, t = list(map(int, input().split()))\nnum_glasses = n*(n+1)//2\nglasses = [[0]*n for _ in range(n)]\n\ndef simulate(i, j, time):\n if i>=n or j>=n:\n return\n if time>1-glasses[i][j]:\n time -= (1 - glasses[i][j])\n glasses[i][j] = 1\n \n simulate(i+1, j, time/2)\n simulate(i+1, j+1, time/2)\n\n else:\n glasses[i][j] += time\n\n\nsimulate(0, 0, t)\n\nans = 0\nfor g in glasses:\n ans += sum([x>=1 for x in g])\n # print(g)\n\nprint(ans)\n\n\n ", "n,k=map(int,input().split())\r\narray=[[0 for i in range(j)] for j in range(1,n+1)]\r\narray[0][0]=k\r\nfor i in range(n-1):\r\n for j in range(i+1):\r\n val=array[i][j]-1\r\n if val>0:\r\n array[i+1][j]+=val/2\r\n array[i+1][j+1]+=val/2\r\n array[i][j]=1\r\ns=0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if array[i][j]>=1:\r\n s+=1\r\nprint(s)", "def a(level,col,lt):\r\n if cnt[0]==s or level>=n:\r\n return\r\n if filled[level][col]<1.0:\r\n if lt+filled[level][col]>=1.0:\r\n lt-=(1.0-filled[level][col])\r\n filled[level][col]=1.0\r\n cnt[0]+=1\r\n else:\r\n filled[level][col]+=lt\r\n lt=0.0\r\n if filled[level][col]==1.0:\r\n a(level+1, col, lt/2)\r\n a(level+1, col+1, lt/2)\r\nn,t=[int(x) for x in input().split()]\r\ns=0\r\ncnt=[0]\r\nfilled=[]\r\nfor r in range(n):\r\n filled.append([0.0 for c in range(r+1)])\r\n s+=r+1\r\na(0,0,float(t))\r\nprint(cnt[0])\r\n", "inputs = [int(items) for items in input().split()]\r\nn = inputs[0]\r\nhours = inputs[1]\r\nglasses=[0 for i in range(0,100)]\r\ndef fill_glasses(hours,level,glass,final_level):\r\n if hours == 0 or level > final_level:\r\n return\r\n if glasses[glass]==1:\r\n fill_glasses((hours/2),level+1,glass+level,final_level)\r\n fill_glasses((hours/2),level+1,glass+level+1,final_level)\r\n else:\r\n surplus_amount = 1-glasses[glass]\r\n if surplus_amount > hours :\r\n glasses[glass]+=hours\r\n hours =0\r\n else:\r\n glasses[glass]=1\r\n hours -= surplus_amount\r\n fill_glasses((hours / 2), level+1, glass + level, final_level)\r\n fill_glasses((hours / 2), level+1, glass + level+1, final_level)\r\n\r\n\r\nfill_glasses(hours,1,1,n)\r\ncount =0\r\nfor i in glasses:\r\n if i ==1:\r\n count+=1\r\nprint(count)\r\n", "def func(arr, i, j, qty):\n global n\n if i > n:\n return\n arr[i][j] += qty\n if (arr[i][j] > 1):\n func(arr, i+1, j, ((arr[i][j]-1)/2))\n func(arr, i+1, j+1, ((arr[i][j]-1)/2))\n arr[i][j] = 1\nn, t = map(int, input().split())\narr = [[0 for i in range(n+1)] for i in range(n+1)]\nfunc(arr,1,1,t)\nans = 0\nfor i in arr:\n for j in i:\n if j == 1:\n ans += 1\nprint(ans)", "n,t=list(map(int,input().split()))\r\nli=[[t-1]]\r\ncnt=1 if t-1>=0 else 0\r\nfor i in range(2,n+1):\r\n tr=li[-1][0]/2-1\r\n if tr>=0:\r\n cnt+=2\r\n li.append([tr])\r\n for j in range(1,i-1):\r\n a=li[-2][j-1]\r\n b=li[-2][j]\r\n temp=-1\r\n if a >0 :\r\n temp+=a/2\r\n if b>0:\r\n temp+=b/2\r\n if temp>=0:\r\n cnt+=1\r\n li[-1].append(temp)\r\n li[-1].append(tr)\r\nprint(cnt)", "n, m = map(int, input().split())\r\nans = []\r\n\r\nfor i in range(1,12):\r\n ans.append([0]*i)\r\ntotal = 1024*m\r\ni = 0\r\nans[0][0] = total\r\nwhile i<n:\r\n for j in range(i+1):\r\n if ans[i][j] > 1024:\r\n extra = ans[i][j] - 1024\r\n ans[i][j] = 1024\r\n ans[i+1][j+1] += extra//2\r\n ans[i+1][j] += extra//2\r\n i+=1\r\na = 0\r\nfor i in range(n):\r\n a+= ans[i].count(1024)\r\nprint(a)", "n,t=map(int,input().split())\r\ndp=[[t]]\r\nfor i in range(n-1):\r\n temp=[0]*(len(dp[-1])+1)\r\n for j in range(len(dp[-1])):\r\n pour=(dp[-1][j]-1 )/2\r\n if pour>0:\r\n temp[j]+=pour\r\n temp[j+1]+=pour\r\n dp.append(temp)\r\nans=0\r\nfor el in dp:\r\n for p in el:\r\n if p>=1:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n ", "numm, t = map(int, input().split())\ndef solution(r, t, numm):\n frontier = [t]\n ct = 0\n while r < numm:\n nxt = [0] * (r+1)\n for i in range(len(frontier)):\n if frontier[i] >= 1:\n ct += 1\n extra = (frontier[i] - 1)/2\n nxt[i] += extra\n nxt[i+1] += extra\n frontier = nxt\n r += 1\n for i in frontier:\n if i >= 1:\n ct += 1\n return ct\n\nprint(solution(1, t, numm))\n\t \t \t \t \t \t \t \t\t \t\t\t\t \t", "sai, teja = map(int, input().split())\r\n\r\n\r\ndef s(r, teja, sai):\r\n f = [teja]\r\n c = 0\r\n while r < sai:\r\n n = [0] * (r+1)\r\n for i in range(len(f)):\r\n if f[i] >= 1:\r\n c += 1\r\n e = (f[i] - 1)/2\r\n n[i] += e\r\n n[i+1] += e\r\n f = n\r\n r += 1\r\n for i in f:\r\n if i >= 1:\r\n c += 1\r\n\r\n\r\n return c\r\n\r\n\r\nprint(s(1, teja, sai))", "n,t=map(int,input().split())\r\nans,b=0,1<<n\r\na=[[0]*11 for i in range(11)]\r\na[0][0]=t*(1<<n)\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if a[i][j]>=b: a[i+1][j]+=(a[i][j]-b)//2; a[i+1][j+1]+=(a[i][j]-b)//2; ans+=1\r\nprint(ans)", "from fractions import Fraction\n\nn, t = map(int, input().split())\n\nglasses = []\nfor level in range(n):\n glasses.append([])\n for glass in range(level+1):\n glasses[level].append(Fraction(0))\n\nglasses[0][0] += Fraction(t)\n\nresult = 0\n\nfor level in range(n):\n for glass in range(level+1):\n if glasses[level][glass] >= Fraction(1):\n result += 1\n to_add = (glasses[level][glass]-1)/2\n if level+1 < n:\n glasses[level+1][glass+1] += to_add\n glasses[level+1][glass] += to_add\n\nprint(result)", "l=list(map(int,input().split()))\r\nn=l[0]\r\nt=float(l[1])\r\ndp=[[float(0) for x in range(12)] for j in range(12)]\r\nans=0\r\ndp[0][0]=t\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if dp[i][j]>=float(1):\r\n ans+=1\r\n dp[i+1][j]+=float((dp[i][j]-float(1))/float(2.0))\r\n dp[i+1][j+1] += float((dp[i][j] - float(1.0)) / float(2.0))\r\n\r\nprint(ans)\r\n", "# from fractions import Fraction\n\nn, t = map(int, input().split())\n\nglasses = []\nfor level in range(n):\n glasses.append([])\n for glass in range(level+1):\n glasses[level].append(0.0)\n\nglasses[0][0] += float(t)\n\nresult = 0\n\nfor level in range(n):\n for glass in range(level+1):\n if glasses[level][glass] >= 1.0:\n result += 1\n to_add = (glasses[level][glass]-1)/2\n if level+1 < n:\n glasses[level+1][glass+1] += to_add\n glasses[level+1][glass] += to_add\n\nprint(result)", "n, t = map(int, input().split())\r\n\r\ntemp = []\r\nfor i in range(15):\r\n t1 = []\r\n for j in range(i+1):\r\n t1.append(0)\r\n temp.append(t1)\r\n\r\nans = 0\r\ntemp[1][1] = t\r\nfor j in range(1, n+1):\r\n for k in range(1, j+1):\r\n val = temp[j][k]\r\n if val >= 1:\r\n ans += 1\r\n temp[j+1][k] += ((val-1)/2)\r\n temp[j+1][k+1] += ((val-1)/2)\r\n\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Feb 18 16:31:22 2023\r\n\r\n@author: Ali\r\n\"\"\"\r\ns = input()\r\nn,t = s.split(' ');t=int(t);n = int(n)\r\nar = [[0 for i in range(2*n +1)] for j in range(n+1)]\r\nwhile t:\r\n t -=1 \r\n ar[0][n] += 1;\r\n for i in range(n):\r\n for j in range(2*n+1):\r\n if ar[i][j] > 1:\r\n ar[i + 1][j+1] += (ar[i][j] - 1) / 2 \r\n ar[i+1][j-1] += (ar[i][j] - 1) / 2\r\n ar[i][j] = 1\r\n \r\nc = 0\r\nfor i in range(n):\r\n for j in range(2*n+1):\r\n if ar[i][j] == 1:\r\n c +=1\r\n \r\nprint(c)\r\n \r\n \r\n", "n,t = map(int, input().split())\r\nl = [[0]*(i+1) for i in range(n+1)]\r\nl[0][0] = t\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if l[i][j] >= 1:\r\n ans += 1\r\n l[i+1][j] += (l[i][j]-1)/2 \r\n l[i+1][j+1] += (l[i][j]-1)/2 \r\nprint(ans)", "n,t = (int(e) for e in input().split())\r\na = []\r\nfor i in range(n):\r\n b = []\r\n for j in range(i+1):\r\n b.append(0)\r\n a.append(b)\r\n\r\ncurrent_row = 0\r\nfor x in range(t):\r\n for i in range(n):\r\n for j in range(i+1):\r\n if i == 0:\r\n a[i][j] += 1\r\n if a[i][j] > 1 and i+1 < n and j < 10:\r\n a[i+1][j]+=(a[i][j]-1)/2\r\n a[i+1][j+1]+=(a[i][j]-1)/2\r\n a[i][j] = 1\r\n if a[i][j] > 1 and i==n-1:\r\n a[i][j] = 1\r\n#print(a)\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if a[i][j] == 1:\r\n count += 1\r\nprint(count)\r\n", "n,t=map(int,input().split())\r\nglass=[[0 for i in range(0,n+1)] for j in range(0,n+1)]\r\nans=0\r\nglass[0][0]=t\r\nfor i in range(0,n):\r\n\tfor j in range(0,i+1):\r\n\t\tif(glass[i][j]>=1.0):\r\n\t\t\tt=glass[i][j]-1\r\n\t\t\tglass[i+1][j]+=(t/2)\r\n\t\t\tglass[i+1][j+1]+=(t/2)\r\n\t\t\tans+=1\r\nprint(ans)", "n,t=map(int,input().split())\r\n\r\nan=[[0 for i in range(j+1)] for j in range(n)]\r\n\r\n\r\ndef dfs(i,j,v):\r\n\tif an[i][j]+v>1:\r\n\t\tvv=v-(1-an[i][j])\r\n\t\tan[i][j]=1\r\n\t\tif i==n-1:return\r\n\t\tdfs(i+1,j,vv/2)\r\n\t\tdfs(i+1,j+1,vv/2)\r\n\t\treturn\r\n\td=1 if (j==0 or j==i) else 2\r\n\tan[i][j]+=v\r\n\r\nfor i in range(t):\r\n\tdfs(0,0,1)\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(i+1):\r\n\t\tans+=an[i][j]>=1\r\n\r\nprint(ans)", "n,t=input().split()\r\n\r\nn=int(n)\r\nt=int(t)\r\npojemnosc=1024\r\nileszampana=[[0 for i in range(n+1)] for i in range(n+1)]\r\n\r\nwynik=0\r\nileszampana[0][0]=t*pojemnosc\r\nfor wiersz in range(n):\r\n for kolumna in range(wiersz+1):\r\n if ileszampana[wiersz][kolumna] >=pojemnosc:\r\n wynik+=1\r\n nadwyzka= ileszampana[wiersz][kolumna]-pojemnosc\r\n ileszampana[wiersz+1][kolumna]+=nadwyzka//2\r\n ileszampana[wiersz+1][kolumna+1]+=nadwyzka//2\r\nprint(wynik)", "h,t = map(int,input().split())\r\npyramid = [ [0]*11 for i in range(11) ]\r\nfilled = 0\r\npyramid[0][0] = t\r\nfor i in range(h):\r\n for j in range(i+1):\r\n time = pyramid[i][j] - 1.0\r\n if time>=0:\r\n filled+=1\r\n pyramid[i+1][j]+=time/2\r\n pyramid[i+1][j+1]+=time/2\r\nprint(filled)\r\n", "n,t=list(map(int,input().split()))\r\na=[]\r\nfor i in range(10):\r\n row=[]\r\n for j in range(10):\r\n row.append(0)\r\n a.append(row)\r\n\r\ndef pour(level,loc,amount,a,n):\r\n if(loc>=n or level>=n):\r\n return\r\n if(a[level][loc]>=1):\r\n a[0][9]-=1\r\n a[level][loc]+=amount\r\n if(a[level][loc]>=1):\r\n a[0][9]+=1\r\n if(a[level][loc]>1):\r\n amount=a[level][loc]-1\r\n a[level][loc]=1\r\n amount=amount/2\r\n pour(level+1,loc,amount,a,n)\r\n pour(level+1,loc+1,amount,a,n)\r\n \r\n\r\npour(0,0,t,a,n)\r\n#print(*a,sep=\"\\n\")\r\nprint(a[0][9])\r\n", "[n, t] = [int(x) for x in input().split()]\r\nmaxn = 11\r\npyr = [[0 for i in range(maxn)] for i in range(maxn)]\r\npyr[0][0] = t * 1024\r\nsco = 0\r\nfor i in range(0 , n):\r\n for j in range(0, i + 1):\r\n if pyr[i][j] >= 1024:\r\n sco += 1\r\n pyr[i + 1][j] += (pyr[i][j] - 1024) // 2\r\n pyr[i + 1][j + 1] += (pyr[i][j] - 1024) // 2\r\nprint(sco)", "POJEMNOSC = 1024\r\nMAXN = 10 + 7\r\n\r\nileSzampana = [[0 for i in range(MAXN)] for i in range(MAXN)]\r\n\r\ndef main():\r\n\t(n,t) = tuple(map(int, input().split()))\r\n\r\n\twynik = 0\r\n\r\n\tileSzampana[0][0] = POJEMNOSC * t\r\n\tfor wiersz in range(0, n):\r\n\t\tfor kolumna in range(0, wiersz+1):\r\n\t\t\tif ileSzampana[wiersz][kolumna] >= POJEMNOSC:\r\n\t\t\t\twynik += 1\r\n\r\n\t\t\t\tnadwyzka = ileSzampana[wiersz][kolumna] - POJEMNOSC\r\n\t\t\t\tileSzampana[wiersz+1][kolumna] += nadwyzka // 2\r\n\t\t\t\tileSzampana[wiersz+1][kolumna+1] += nadwyzka // 2\r\n\r\n\tprint(wynik)\r\n\r\nmain()\r\n", "m,t=map(int,input().split())\r\nre=0\r\ntmp=[t]\r\nfor k in range(m):\r\n tmp2=[0]*(len(tmp)+1)\r\n for i,j in enumerate(tmp):\r\n if(j<1.0):\r\n continue\r\n re+=1\r\n tmp2[i]+=(j-1)/2\r\n tmp2[i+1]+=(j-1)/2\r\n # print(tmp,tmp2)\r\n tmp=tmp2\r\nprint(re)", "def sumy_prefiksowe(tab):\r\n l = len(tab)\r\n sums = [0 for x in range(l + 1)]\r\n for i in range(1, l + 1):\r\n sums[i] = tab[i - 1] + sums[i - 1]\r\n return sums\r\n\r\n\r\ndef main():\r\n n, t = list(map(int, input().split()))\r\n l = 1024\r\n glasses = [[0]*x for x in range(1, n + 2)]\r\n glasses[0][0] = t * l\r\n score = 0\r\n\r\n for i in range(n):\r\n for j in range(i+1):\r\n if glasses[i][j] >= l:\r\n glasses[i][j] -= l\r\n score += 1\r\n glasses[i + 1][j] += glasses[i][j] / 2\r\n glasses[i + 1][j + 1] += glasses[i][j] / 2\r\n print(score)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, t = map(int, input().split())\r\nfull = 0\r\n\r\narr = [t]\r\n\r\nwhile n:\r\n n-=1\r\n temp = [0]*(len(arr)+1)\r\n for i,j in enumerate(arr):\r\n if j >= 1:\r\n full +=1\r\n temp[i] += (j-1)/2\r\n temp[i+1] += (j-1)/2\r\n \r\n arr = temp\r\n\r\nprint(full)", "n1, t = map(int, input().split())\ndef solution(n, t, n1):\n frontier = [t]\n t1 = 0\n while n < n1:\n nxt = [0] * (n+1)\n for i in range(len(frontier)):\n if frontier[i] >= 1:\n t1 += 1\n extra = (frontier[i] - 1)/2\n nxt[i] += extra\n nxt[i+1] += extra\n frontier = nxt\n n += 1\n for i in frontier:\n if i >= 1:\n t1 += 1\n return t1\n\nprint(solution(1, t, n1))\n \t \t \t \t\t \t \t\t \t \t", "n,t=map(int,input().split())\r\ndef pyramid(n,t):\r\n glasses=[[0 for i in range(j+1)]for j in range(n)]\r\n def fill(glasses,n):\r\n glasses[0][0]+=1\r\n overflow(glasses,n)\r\n def overflow(glasses,n):\r\n for i in range(len(glasses)):\r\n for j in range(len(glasses[i])):\r\n if glasses[i][j]>1 and i!=n-1:\r\n glasses[i+1][j]+=(glasses[i][j]-1)/2\r\n glasses[i+1][j+1]+=(glasses[i][j]-1)/2\r\n glasses[i][j]=1\r\n for i in range(t):\r\n fill(glasses,n) \r\n cnt=0\r\n for i in glasses:\r\n for j in i:\r\n if j>=1:\r\n cnt+=1\r\n return cnt\r\nprint(pyramid(n,t))", "n, t = map(int, input().split())\r\n\r\n\r\ndef solve(r, t, n):\r\n frontier = [t]\r\n count = 0\r\n while r < n:\r\n nxt = [0] * (r+1)\r\n for i in range(len(frontier)):\r\n if frontier[i] >= 1:\r\n count += 1\r\n extra = (frontier[i] - 1)/2\r\n nxt[i] += extra\r\n nxt[i+1] += extra\r\n frontier = nxt\r\n r += 1\r\n for i in frontier:\r\n if i >= 1:\r\n count += 1\r\n\r\n\r\n return count\r\n\r\n\r\nprint(solve(1, t, n))\r\n", "n, t = map(int, input().split())\r\n\r\n\r\ndef solve(r, t, n):\r\n f = [t]\r\n count = 0\r\n while r < n:\r\n nxt = [0] * (r+1)\r\n for i in range(len(f)):\r\n if f[i] >= 1:\r\n count += 1\r\n extra = (f[i] - 1)/2\r\n nxt[i] += extra\r\n nxt[i+1] += extra\r\n f = nxt\r\n r += 1\r\n for i in f:\r\n if i >= 1:\r\n count += 1\r\n\r\n\r\n return count\r\n\r\n\r\nprint(solve(1, t, n))", "# https://codeforces.com/contest/676/problem/B\r\n\r\nn, t = [int(i) for i in input().split(' ')]\r\n\r\npyramid = []\r\nfor i in range(n+1):\r\n temp_arr = []\r\n for j in range(i):\r\n temp_arr.append(0)\r\n pyramid.append(temp_arr)\r\n# pyramid.reverse()\r\n\r\ndef get_num_filed(num, time, level, glass, input_per_second=1):\r\n if time == 0:\r\n return\r\n if num == 0:\r\n return\r\n time_remaining = time\r\n while(pyramid[level][glass] < 1 and time_remaining > 0):\r\n time_remaining-=1\r\n pyramid[level][glass] += input_per_second\r\n # print(num, time, level, glass, input_per_second, time_remaining)\r\n if pyramid[level][glass] >= 1:\r\n get_num_filed(num-1, time_remaining, level+1, glass, input_per_second/2)\r\n get_num_filed(num-1, time_remaining, level+1, glass+1, input_per_second/2)\r\n return\r\n # for i in range(0, 1, 0):\r\n # time_spend += 1\r\n # i = i+input_per_second\r\n # if time_spend > time:\r\n # return\r\n # pyramid[level][glass] = 1\r\n\r\nget_num_filed(n, t, 1, 0, 1)\r\n# print(pyramid)\r\ntotal = 0\r\nfor i in pyramid:\r\n for j in i:\r\n if j >=1:\r\n total+=1\r\nprint(total)", "MAXN = 10 + 7\r\nPOJEMNOSC = 1024\r\n\r\nileSzampana = [[0 for i in range(MAXN)] for i in range(MAXN)]\r\n\r\nn, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\n\r\nwynik = 0\r\n\r\nileSzampana[0][0] = t * POJEMNOSC\r\nfor wiersz in range(0, n):\r\n\tfor kolumna in range(0, wiersz+1):\r\n\r\n\t\tif ileSzampana[wiersz][kolumna] >= POJEMNOSC:\r\n\r\n\t\t\t# ten kubek na pewno jest wypelniony\r\n\t\t\twynik = wynik + 1\r\n\r\n\t\t\tnadwyzka = ileSzampana[wiersz][kolumna] - POJEMNOSC\r\n\t\t\tileSzampana[wiersz + 1][kolumna] += nadwyzka // 2\r\n\t\t\tileSzampana[wiersz + 1][kolumna + 1] += nadwyzka // 2\r\n\t\t\r\nprint(wynik)\r\n", "n,t = map(int,input().split())\r\nA=[[0 for i in range(11)] for i in range(12)]\r\nA[0][0] = t\r\nindex = 1\r\nresult = 0\r\nwhile 1:\r\n #print(index)\r\n temp = 0\r\n for i in range(index):\r\n if(A[index-1][i]>=1):\r\n result+=1\r\n temp = A[index-1][i]\r\n temp -=1\r\n A[index][i]+=temp/2\r\n A[index][i+1]+=temp/2\r\n if index == n:\r\n break\r\n index+=1\r\nprint(result)\r\n \r\n\r\n", "import math\r\nimport sys\r\nimport queue\r\n\r\n\r\ndef solve():\r\n n, t = map(int, input().split())\r\n size = n * (n + 1) // 2\r\n\r\n p = [[0] for i in range(size)]\r\n\r\n it = 0\r\n eps = 10 ** (-9)\r\n\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n p[it].append(level)\r\n it += 1\r\n\r\n # simulation\r\n for time in range(t):\r\n p[0][0] += 1\r\n it = 0\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n if level == n:\r\n p[it][0] = min(1, p[it][0])\r\n else:\r\n extra = max(0, p[it][0] - 1)\r\n p[it][0] -= extra\r\n p[it + level][0] += extra / 2\r\n p[it + level + 1][0] += extra / 2\r\n\r\n it += 1\r\n\r\n res = 0\r\n it = 0\r\n\r\n for level in range(1, n + 1):\r\n for i in range(level):\r\n if abs(1 - p[it][0]) < eps:\r\n res += 1\r\n it += 1\r\n\r\n print(res)\r\n #print(p)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n" ]

{"inputs": ["3 5", "4 8", "1 1", "10 10000", "1 10000", "10 1", "1 0", "10 0", "10 1022", "10 1023", "10 1024", "1 2", "1 200", "7 128", "8 198", "2 2", "2 3", "2 4", "2 100", "2 10000", "3 7", "3 6", "3 8", "3 12", "3 1", "4 15", "4 14", "4 10", "4 16", "4 999", "4 9", "5 31", "5 30", "5 28", "5 25", "5 15", "5 32", "5 9999", "5 4", "5 9", "5 14", "6 63", "6 62", "6 61", "6 52", "6 31", "6 32", "6 39", "6 15", "6 14", "6 10", "6 4", "6 7653", "7 127", "6 64", "7 126", "7 125", "7 120", "7 98", "7 110", "7 65", "7 63", "7 15", "7 3", "7 1", "7 83", "7 214", "8 2555", "8 257", "8 256", "8 255", "8 254", "8 253", "8 251", "8 240", "8 128", "8 127", "8 100", "8 1", "8 0", "8 10000", "8 94", "8 33", "9 10000", "9 513", "9 512", "9 511", "9 510", "9 255", "9 256", "9 254", "9 253", "9 200", "9 100", "9 150", "10 9999", "10 1025", "10 1021", "10 512", "10 689", "10 754", "10 985", "10 255", "10 256", "10 254", "10 153", "10 2", "10 3", "10 5", "10 63", "10 64", "10 126", "10 127", "10 128", "10 55", "10 9", "10 37", "10 68", "3 4", "7 23", "1 3"], "outputs": ["4", "6", "1", "55", "1", "1", "0", "0", "53", "55", "55", "1", "1", "28", "34", "1", "3", "3", "3", "3", "6", "4", "6", "6", "1", "10", "8", "8", "10", "10", "8", "15", "13", "13", "13", "13", "15", "15", "3", "8", "11", "21", "19", "19", "19", "19", "19", "19", "13", "11", "8", "3", "21", "28", "21", "26", "26", "26", "26", "26", "26", "26", "13", "3", "1", "26", "28", "36", "36", "36", "36", "34", "34", "34", "34", "34", "34", "32", "1", "0", "36", "32", "26", "45", "45", "45", "45", "43", "43", "43", "41", "41", "41", "37", "41", "55", "55", "53", "53", "53", "53", "53", "51", "51", "49", "47", "1", "3", "4", "41", "41", "45", "47", "47", "37", "8", "33", "41", "3", "20", "1"]}

UNKNOWN

PYTHON3

CODEFORCES

39

d6524006b988fe4a1c2e7fe334ad52cc

Jabber ID

Jabber ID on the national Berland service «Babber» has a form <username>@<hostname>[/resource], where - <username> — is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of <username> is between 1 and 16, inclusive. - <hostname> — is a sequence of word separated by periods (characters «.»), where each word should contain only characters allowed for <username>, the length of each word is between 1 and 16, inclusive. The length of <hostname> is between 1 and 32, inclusive. - <resource> — is a sequence of Latin letters (lowercase or uppercase), digits or underscores characters «_», the length of <resource> is between 1 and 16, inclusive. The content of square brackets is optional — it can be present or can be absent. There are the samples of correct Jabber IDs: [[email protected]](/cdn-cgi/l/email-protection), [[email protected]](/cdn-cgi/l/email-protection)/contest. Your task is to write program which checks if given string is a correct Jabber ID. The input contains of a single line. The line has the length between 1 and 100 characters, inclusive. Each characters has ASCII-code between 33 and 127, inclusive. Print YES or NO. Sample Input [email protected] [email protected]/contest.icpc/12 Sample Output YES NO

[ "import re\r\n\r\ns = input()\r\nreg = re.compile(r'^\\w{1,16}@(\\w{1,16}\\.)*\\w{1,16}(/\\w{1,16})?$')\r\n \r\nif reg.match(s):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import re\r\n \r\nreg = re.match(r'^\\w{1,16}@(?P<host>(\\w{1,16}\\.)*\\w{1,16})(/\\w{1,16})?$', input())\r\nif reg and len(reg.group('host')) <= 32:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "'''\r\ndef userName(username):\r\n if len(username) < 1 or len(username) > 16:\r\n return -1\r\n for item in username:\r\n if item < '0' or item > 'w' and item != '_':\r\n return -1\r\n return 1\r\n\r\n\r\ndef hostName(hostname):\r\n if len(hostname) < 1 or len(hostname) > 32:\r\n return -1\r\n for item in hostname:\r\n\r\n\r\n\r\n\r\nline = input()\r\nindOfAt = line.index('@')\r\nusername = line[0:indOfAt]\r\nhostname = line[indOfAt + 1:line.rindex('.')]\r\n'''\r\n\r\n\r\ndef check(line):\r\n ln = len(line)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for it in line:\r\n if not ('A' <= it <= 'Z' or\r\n 'a' <= it <= 'z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n ln = len(hostName)\r\n if ln == 0 or ln > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail, isUser, isHost, isRes = input(), False, False, False\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n hostName = mail[atIndex + 1: mail.index('/')] if '/' in mail else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if '/' not in mail:\r\n isRes = True\r\n else:\r\n isRes = check(mail[mail.index('/') + 1:])\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "import re\r\nif re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})*(\\/\\w{1,16})?$', input()) :\r\n print( \"YES\" )\r\nelse :\r\n print( \"NO\" )", "#!/usr/bin/env python3\nimport re\n\ns = input()\nok = True\nm = re.match(r'^[A-Za-z0-9_]{1,16}@([A-Za-z0-9_.]{1,32})(/[A-Za-z0-9_]{1,16})?$', s)\nif m:\n m2 = re.match(r'^[A-Za-z0-9_]{1,16}(\\.[A-Za-z0-9_]{1,16})*$', m.group(1))\n if not m2:\n ok = False\nelse:\n ok = False\n\nif ok:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import re\r\nm = re.match(r\"^\\w{1,16}@(?P<hostname>\\w{1,16}(?:\\.\\w{1,16})*)(?:\\/\\w{1,16})?$\", input())\r\nprint(\"NO\" if m == None or len(m.group(\"hostname\")) > 32 else \"YES\")", "def check(txt: str) -> bool:\r\n ln = len(txt)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for item in txt:\r\n if not ('a' <= item <= 'z' or\r\n 'A' <= item <= 'Z' or\r\n '0' <= item <= '9' or\r\n item == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName: str) -> bool:\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n slashInd = mail.index('/') if '/' in mail else -1\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n hostName = mail[atIndex + 1: slashInd] if slashInd != -1 else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd+1:]\r\n isRes = check(resource)\r\n'''\r\nif isUser and isHost and isRes:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n'''\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "a=input()\r\n\r\nff=True\r\nif len(a.split('@'))!=2:\r\n ff=False\r\nif ff:\r\n if (len(a.split('@')[0])==0) or (len(a.split('@')[1])==0):\r\n ff=False\r\n if ff:\r\n l=a.split('@')[0]\r\n k=len(l)\r\n for i in range(k):\r\n if not((l[i]=='_')or((l[i]>='A') and (l[i]<='Z'))or((l[i]>='a')and(l[i]<='z')or((l[i]>='0') and (l[i]<='9')))):\r\n ff=False\r\n break\r\n if ff:\r\n r=a.split('@')[1].split('/')\r\n for i in range(len(r)):\r\n if (len(r[i])==0):\r\n ff=False\r\n break\r\n if ff:\r\n l=r[0].split('.')\r\n for i in range(len(l)):\r\n if (len(l[i])==0):\r\n ff=False\r\n break\r\n for j in range(len(l[i])):\r\n if not((l[i][j]=='_')or((l[i][j]>='A') and (l[i][j]<='Z'))or((l[i][j]>='a')and(l[i][j]<='z')or((l[i][j]>='0') and (l[i][j]<='9')))):\r\n ff=False\r\n break\r\n if not ff:\r\n break\r\n if ff:\r\n for i in range(1,len(r)):\r\n for j in range(len(r[i])):\r\n if not((r[i][j]=='_')or((r[i][j]>='A') and (r[i][j]<='Z'))or((r[i][j]>='a')and(r[i][j]<='z')or((r[i][j]>='0') and (r[i][j]<='9')))):\r\n ff=False\r\n break\r\n if not ff:\r\n break\r\nif ff:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re \r\ns = input()\r\nprint(\"YES\" if re.fullmatch(\"^\\\\w{1,16}@(\\\\w{1,16}\\\\.)*\\\\w{1,16}(\\\\/\\\\w{1,16})?$\",s) else \"NO\")", "def bhaago():\n print('NO')\n exit(0)\ndef type1(s):\n if not (len(s) >= 1 and len(s) <=16):\n bhaago()\n for i in s:\n if not (i.isalpha() or i.isdigit() or i == '_'):\n bhaago()\ns = input()\nif not(s[0].isalpha() or s[0].isdigit() or s[0] == '_'):\n bhaago()\nt1 = s.split('@')\nif len(t1) != 2:\n bhaago()\nusername = t1[0]\ntype1(username)\nt2 = t1[1].split('/')\nif len(t2) > 2:\n bhaago()\nhostname = t2[0]\nif not (len(hostname) >= 1 and len(hostname) <=32):\n bhaago()\nfor sep in hostname.split('.'):\n type1(sep)\nif len(t2) == 1:\n print('YES')\n exit(0)\nresource = t2[1]\ntype1(resource)\nprint('YES')", "# LUOGU_RID: 101919121\nimport re\r\nprint(re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})*(\\/\\w{1,16})?$', input()) and 'YES' or 'NO')", "import re\r\ns=input()\r\npattern=\"^\\w{1,16}@\\w{1,16}(\\.[\\w]{1,16})*(/\\w{1,16})?$\"\r\nif re.search(pattern,s):\r\n idx=s.find(\"@\")\r\n idx2=s.find(\"/\")\r\n if idx2==-1:\r\n idx2=len(s)\r\n if 1<=idx2-idx-1<=32:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import re\r\ntext=input( )\r\nans=re.compile(\"^\\w{1,16}@(\\w{1,16}\\.)*\\w{1,16}(|/\\w{1,16})$\")\r\nif ans.match(text) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\t \t \t", "def check(line):\r\n _len = len(line)\r\n if _len == 0 or _len > 16:\r\n return False\r\n for it in line:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _len = len(hostName)\r\n if _len == 0 or _len > 32:\r\n return False\r\n tokens = hostName.split('.')\r\n for item in tokens:\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nmail, isUser, isHost, isRes = input(), False, False, False\r\nif '@' in mail:\r\n atInd = mail.index('@')\r\n userName = mail[:atInd]\r\n isUser = check(userName)\r\n slashInd = mail.index('/') if '/' in mail else -1\r\n hostName = mail[atInd + 1:slashInd] if slashInd != -1 else mail[atInd + 1:]\r\n isHost = checkHost(hostName)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "\"\"\"Jabber ID\"\"\"\r\nimport re\r\n\r\ndef main():\r\n s = input()\r\n reg = re.compile(r'^\\w{1,16}@(\\w{1,16}\\.)*\\w{1,16}(/\\w{1,16})?$')\r\n \r\n if reg.match(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import re\r\nstringInput = input()\r\nregex = re.compile(\r\n r\"^([0-9a-zA-Z_])+@([0-9a-zA-Z_]+\\.)*([0-9a-zA-Z_])+(/([0-9a-zA-Z_])+)*$\")\r\n\r\nif regex.match(stringInput) is not None:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ivu(uname):\n if 1 > len(uname) or len(uname) > 16:\n return 0\n for ch in uname:\n if ch not in \"qwertyuiopasdfghhjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM1234567890_\":\n return 0\n return 1\n\ndef do():\n f = input()\n if f.count('@') != 1:\n return 0\n uname, hname = f.split('@')\n if hname.count('/') > 1:\n return 0\n if ivu(uname) == 0:\n return 0\n resource = \"a\"\n if hname.count('/') == 1:\n hname, resource = hname.split('/')\n if 1 > len(hname) or len(hname) > 32:\n return 0\n for i in hname.split('.'):\n if ivu(i) == 0:\n return 0\n if ivu(resource) == 0:\n return 0\n return 1\n\nif do() == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n ", "def w(s):\r\n return s.isalnum() and len(s) <= 16\r\ndef v(s):\r\n i1, i2 = s.find('@'), s.rfind('/')\r\n if i1 == -1 or (i2 > -1 and i1 > i2):\r\n return False\r\n elif not w(s[:i1]) or (i2 > -1 and not w(s[i2 + 1:])):\r\n return False\r\n else:\r\n return all(w(x) for x in s[i1 + 1:(i2 if i2 > -1 else len(s))].split('.'))\r\nprint('YES' if v(input().replace('_', 'a')) else 'NO')", "def check(line):\r\n ln = len(line)\r\n if ln == 0 or ln > 16:\r\n return False\r\n for symbol in line:\r\n if not ('A' <= symbol <= 'Z' or\r\n 'a' <= symbol <= 'z' or\r\n '0' <= symbol <= '9' or\r\n symbol == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n for token in hostName.split('.'):\r\n if not check(token):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False,\r\nif '@' in mail:\r\n atIndex = mail.index('@')\r\n userName = mail[:atIndex]\r\n isUser = check(userName)\r\n dashIndex = mail.index('/') if '/' in mail else -1\r\n hostName = mail[atIndex + 1: dashIndex] if dashIndex != -1 else mail[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if dashIndex == -1:\r\n isRes = True\r\n else:\r\n resource = mail[dashIndex + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isRes and isHost and isUser else 'NO')\r\n'''\r\n 0123456789........\r\nmail = \"[email protected]/page\"\r\n\r\n'''\r\n", "# Hydro submission #64d0a2f538608da1af906041@1691394811581\nimport re\r\nprint(re.match(r'^\\w{1,16}@\\w{1,16}(\\.\\w{1,16})*(\\/\\w{1,16})?$', input()) and 'YES' or 'NO')", "def check(s):\r\n length = len(s)\r\n if length == 0 or length > 16:\r\n return False\r\n for i in s:\r\n if not ('a' <= i <= 'z' or\r\n 'A' <= i <= 'Z' or\r\n '0' <= i <= '9' or\r\n i == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _len = len(hostname)\r\n if _len == 0 or _len > 32:\r\n return False\r\n for item in hostName.split('.'):\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nmail = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in mail:\r\n atInd = mail.index('@')\r\n slashInd = mail.find('/')\r\n username = mail[:atInd]\r\n isUser = check(username)\r\n hostname = mail[atInd + 1:slashInd] if slashInd != -1 else mail[atInd + 1:]\r\n isHost = checkHost(hostname)\r\n if slashInd == -1:\r\n isRes = True\r\n else:\r\n resource = mail[slashInd + 1:]\r\n isRes = check(resource)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n", "def check(s):\r\n sLen = len(s)\r\n if sLen == 0 or sLen > 16:\r\n return False\r\n\r\n for item in s:\r\n if not ('a' <= item <= 'z' or\r\n 'A' <= item <= 'Z' or\r\n '0' <= item <= '9' or\r\n item == '_'):\r\n return False\r\n return True\r\n\r\n\r\ndef checkHost(hostName):\r\n _Len = len(hostName)\r\n if _Len == 0 or _Len > 32:\r\n return False\r\n for item in hostName.split('.'):\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\nline = input()\r\nisUser, isHost, isRes = False, False, False\r\n\r\nif '@' in line:\r\n atIndex = line.index('@')\r\n userName = line[:atIndex]\r\n isUser = check(userName)\r\n slashIndex = line.index('/') if '/' in line else -1\r\n hostName = line[atIndex + 1:slashIndex] if slashIndex != -1 else line[atIndex + 1:]\r\n isHost = checkHost(hostName)\r\n if slashIndex == -1:\r\n isRes = True\r\n else:\r\n res = line[slashIndex + 1:]\r\n isRes = check(res)\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n\r\n'''\r\n[email protected]/page1\r\n\r\n'''\r\n", "def check(s):\r\n sLen = len(s)\r\n if sLen == 0 or sLen > 16:\r\n return False\r\n for it in s:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef checkHost(hostName: str) -> bool:\r\n hostLen = len(hostName)\r\n if hostLen == 0 or hostLen > 32:\r\n return False\r\n tokens = hostName.split('.')\r\n for item in tokens:\r\n if not check(item):\r\n return False\r\n return True\r\n\r\n\r\ns = input()\r\nisUser, isHost, isRes = False, False, False\r\nif '@' in s:\r\n atInd = s.index('@')\r\n userName = s[0:atInd]\r\n isUser = check(userName)\r\n slashInd = s.index('/') if '/' in s else -1\r\n hostName = s[atInd + 1: slashInd] if slashInd != -1 else s[atInd + 1:]\r\n isHost = checkHost(hostName)\r\n isRes = check(s[slashInd + 1:]) if slashInd != -1 else True\r\n\r\nprint('YES' if isUser and isHost and isRes else 'NO')\r\n\r\n'''\r\n\r\n'[email protected]/pageone'\r\nuserName =\r\nhostName\r\nresource\r\n'''\r\n", "def check(line):\r\n _len = len(line)\r\n if _len < 1 or _len > 16:\r\n return False\r\n for it in line:\r\n if not ('a' <= it <= 'z' or\r\n 'A' <= it <= 'Z' or\r\n '0' <= it <= '9' or\r\n it == '_'):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef check_host(line):\r\n _len = len(line)\r\n if _len < 1 or _len > 32:\r\n return False\r\n helper = line.split('.')\r\n for it in helper:\r\n if not(check(it)):\r\n return False\r\n\r\n return True\r\n\r\n\r\nmail = input()\r\nis_user, is_host, is_resource = False, False, False\r\nif '@' in mail:\r\n at_index = mail.index('@')\r\n username = mail[0:at_index]\r\n is_user = check(username)\r\n host_name = mail[at_index + 1:] if '/' not in mail else mail[at_index + 1: mail.index('/')]\r\n is_host = check_host(host_name)\r\n if '/' not in mail:\r\n is_resource = True;\r\n else:\r\n resource = mail[mail.index('/') + 1:]\r\n is_resource = check(resource)\r\n\r\n\r\nprint('YES' if is_resource and is_user and is_host else 'NO')\r\n", "import re\r\nstring = input( )\r\npattern = re.compile( \"^\\w{1,16}@(\\w{1,16}\\.)*\\w{1,16}(|/\\w{1,16})$\" )\r\nif pattern.match( string ) :\r\n print( \"YES\" )\r\nelse :\r\n print( \"NO\" )", "import re\n\npattern = \"[a-zA-Z0-9_]{1,16}@([a-zA-Z0-9_]{1,16}(\\.[a-zA-Z0-9_]{1,16})*)(/[a-zA-Z0-9_]{1,16})?\"\nstring = input()\nmatch = re.fullmatch(pattern, string)\nif match and len(match[1]) <= 32:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport re\n\ndef check(s: str):\n pat = re.compile(r'[0-9A-Za-z_]{1,16}')\n arr = s.split('@')\n if len(arr) != 2:\n return False\n if re.fullmatch(pat, arr[0]) == None:\n return False\n brr = arr[1].split('/')\n if len(brr) > 2:\n return False\n if len(brr[0]) < 1 or len(brr[0]) > 32:\n return False\n if len(brr) > 1 and re.fullmatch(pat, brr[1]) == None:\n return False\n crr = brr[0].split('.')\n for it in crr:\n if re.fullmatch(pat, it) == None:\n return False\n \n return True\ns = input()\n\nprint(\"YES\" if check(s) else \"NO\")\n", "import re\r\n\r\ndef is_jabber_id(s):\r\n pattern = r'^[A-Za-z0-9_]{1,16}@[A-Za-z0-9_]{1,16}(\\.[A-Za-z0-9_]{1,16}){0,31}(/[A-Za-z0-9_]{1,16})?$'\r\n return re.match(pattern, s) is not None\r\n\r\n# Read the input\r\njabber_id = input().strip()\r\n\r\n# Check if the Jabber ID is valid\r\nif is_jabber_id(jabber_id):\r\n print('YES')\r\nelse:\r\n print('NO')" ]

{"inputs": ["[email protected]", "[email protected]/contest.icpc/12", "[email protected]/abacaba", "@ops", "this-is-the-test", "[email protected]@codeforces.com", "oooop/oooop", "w@S8/XU.5._R7fHq.@../e.WP!54Ey1L\u007f.9jv", "[email protected]!_!CcAOEEx.0z.aiW/S430sbQT", "@/YTd.K1@lD", "[email protected]\u007f./MzuI", "_TlPy65\u007fw/@[email protected]", "xpS@._s8.e0l\u007fJci/.LdiT", "lGwo\[email protected]", "Ccz9T5rKZQuEerGo@6l.", "Y@[email protected]_MK7.g_..0.", "Q2/6y!SP9s\[email protected]_nR8.", "eWfLL@gW!BEJUxF\[email protected]/2.Pr7a/5O6zXdAkikjCEDrb", "8oI/\u007fa@Q", "J@Y9Gz550l@\u007fPqVZdQ!u", "VTE6aTTta@[email protected]@.l..3Bs", "[email protected]!Tg..wGN5YOi68U.oP2Yl3/", "[email protected]@g.9u.v.A..XNH/1/tloIceXydZf3", "4@@..f3ZT./oUGZ@", "[email protected]!KtpX4tzs/0yQGzZCPJPJoda", "[email protected]/VE7gjf", "bgko@1../xwSj_\u007fJ", "[email protected]../.", "zr.KB_6ZMSwI2GA5@R/4iP1ZKHpszW!YN/", "@alK@pR", "al_Y2I4IKp@A_N.\u007fruCw0VL/hRzJtx.S7sp/r!c.n9ffh", "C1rE26_rTAVzLm@[email protected]./kkBEVlcU", "feGSXP@eyUfr\u007f8.x4Re.JL.6B.r/fX_", "[email protected]@.", "[email protected]", "Mi\u007fWPE8@fc./IViqq4T4PSUuMdhH", "[email protected]!.Ntz/QEh_sl", "s@mH@RO\u007f_/iWD", "UP51i49wX@pvx@2LWm8w/G4M3J./9L6Szy", "xC_5Vx8NgF..\[email protected]@/PQYPeq@_y8!h_iF", "qG3@LKp", "flTq1knyb@2!Mtfss", "/pqi7WXQPJFM4q1@hxUyUy\u007f/_pWo0n", "[email protected]", "o3EaAnc3K6@h", "G/AZdVMTzRLV4Ucm@eQ!..pq!..tRTi5.Ejkqa/HGpFYk", "[email protected]!AFAEk7glM\[email protected]/OLKoJpZlac", "WKxNIM79u\[email protected]", "[email protected]/M_jTHS_6!", "pbRIiuA@[email protected]", "[email protected]/juNlxB", "[email protected]", "[email protected]", "[email protected]", "[email protected]_.38./zgVGNjpldr", "[email protected]", "[email protected]/0EY3XmYatfY", "[email protected].", "xLEctap0T@22U9W_fA/7iQeJGFu1lSgMZ", "[email protected]", "BPxNVANhtEh@Oh_go.", "mGIY@cHRNC8GlJ/2pcl3LYxpi3PaKGs", "[email protected]/UXC", "[email protected]", "[email protected]/i8cnKHT", "[email protected]/4TBzLWf724zE1r", "[email protected]/0sN", "nrKbWV@P0irxQoRxDsNvG/69WxCwCsfB", "[email protected]/tT5d36", "[email protected]/_97Ltj3", "[email protected]_TQ2.z/qfi5CZrH", "bdHl525me@XzR_iO23v.YFXbnHUybbgw.i/WVEhm", "[email protected]", "[email protected]", "[email protected]./FJ4X", "[email protected].", "[email protected]", "[email protected]/iUij1x7", "Yesx@9_KiJq2cBI6.", "Zu5VFUtSbIw@ner5e", "test@test.", "[email protected]", "est.@test", "[email protected]/", "asd@asd@", "@", "/", ".", "mike@", "@mike", "@mail.ru", "test.me", "$@ru", "[email protected]/ooooo", "oooop/oooop", "mail.ru/a", "[email protected]/aaa", "[email protected]"], "outputs": ["YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

28

d6a099aefd615f395445dd46e03cae87

Noldbach problem

Nick is interested in prime numbers. Once he read about Goldbach problem. It states that every even integer greater than 2 can be expressed as the sum of two primes. That got Nick's attention and he decided to invent a problem of his own and call it Noldbach problem. Since Nick is interested only in prime numbers, Noldbach problem states that at least *k* prime numbers from 2 to *n* inclusively can be expressed as the sum of three integer numbers: two neighboring prime numbers and 1. For example, 19 = 7 + 11 + 1, or 13 = 5 + 7 + 1. Two prime numbers are called neighboring if there are no other prime numbers between them. You are to help Nick, and find out if he is right or wrong. The first line of the input contains two integers *n* (2<=≤<=*n*<=≤<=1000) and *k* (0<=≤<=*k*<=≤<=1000). Output YES if at least *k* prime numbers from 2 to *n* inclusively can be expressed as it was described above. Otherwise output NO. Sample Input 27 2 45 7 Sample Output YESNO

[ "import math\r\ndef isprime(k):\r\n for i in range (2, int(math.sqrt(k)+1)):\r\n if(k%i==0):\r\n return 0\r\n return 1\r\n\r\nn,k = map(int, input().split())\r\ncount = 0\r\nlis = []\r\nfor i in range(2, n+1):\r\n if(isprime(i)):\r\n lis.append(i)\r\nfor i in range (0, len(lis)-1):\r\n if((lis[i]+lis[i+1]+1) in lis):\r\n count += 1\r\nif(count >=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\np=[1]*(n+1)\r\np[0]=0\r\np[1]=0\r\na=[]\r\nfor i in range(2,n+1):\r\n if p[i]==1:\r\n a.append(i)\r\n for j in range(i*i,n+1,i):\r\n p[j]=0\r\np1=len(a)\r\nc=0\r\nfor i in range(p1-1):\r\n f=a[i]+a[i+1]+1\r\n if f<=n and p[f]==1:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Hydro submission #635d1c16e2991f80a1014e3d@1667046423273\nn,k =map( int,input().split())\n\na = []\ncount=0\nfor i in range(2, n + 1):\n for j in range(2, i):\n if i % j == 0:\n break\n else:\n a.append(i)\nfor i in a:\n for j in range(1, len(a)):\n if a[j-1]+a[j]+1==i:\n count+=1\nif count < k:\n print(\"NO\")\nelse:\n print(\"YES\")", "n,k = map(int,input().split())\r\na = [0]*(int(1e6)+5)\r\nprimes = [2]\r\nfor i in range(3,n+1,2):\r\n if a[i]==0:\r\n primes.append(i)\r\n for j in range(i,n+1,i):\r\n a[j]=1\r\nans = 0\r\nfor i in primes:\r\n for j in range(len(primes)-1):\r\n if primes[j]+primes[j+1]+1==i:\r\n ans+=1\r\n elif primes[j]+primes[j+1]+1>i:\r\n break\r\nif ans>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\nprimes=[1]*(n+1)\r\nprimes[0]=primes[1]=0\r\np=2\r\nwhile(p*p<=n):\r\n if primes[p]:\r\n for i in range(p*p,n+1,p):\r\n primes[i]=0\r\n p+=1\r\nprime=[]\r\nfor i in range(n+1):\r\n if primes[i]:\r\n prime.append(i)\r\ncount=set()\r\nfor i in range(len(prime)-1):\r\n if prime[i]+prime[i+1]+1<=n and primes[prime[i]+prime[i+1]+1]==1:\r\n count.add(prime[i]+prime[i+1]+1)\r\nif len(count)>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor m in range(2,n+1):\r\n p=False\r\n for i in range(2, int(math.sqrt(m)) + 1):\r\n if (m % i == 0):\r\n p = True\r\n break\r\n if not p:\r\n l.append(m)\r\ns=[]\r\nfor j in range(len(l)-1):\r\n s.append(l[j]+l[j+1]+1)\r\nq=0\r\nfor z in s:\r\n if z in l:\r\n q+=1\r\nif q>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\n\nprime = [3, 5]\ncurr = 2\nres = 0\n\nfor number in range(7, n+1, 2):\n i = 0\n while i < curr and number % prime[i] != 0:\n i += 1\n if i == curr:\n for j in range(1, curr):\n if prime[j] + prime[j-1] + 1 == number:\n k -= 1\n break\n prime.append(number)\n curr += 1\n\n if k == 0:\n break\n\nprint('YES' if k == 0 else 'NO')\n", "def nik(rud,panda):\r\n temp = []\r\n c = 0\r\n for i in range(2,rud+1):\r\n\t if all(i%j!=0 for j in temp):\r\n\t\t temp.append(i)\r\n for i in range(len(temp)-1):\r\n\t if 1+temp[i]+temp[i+1] in temp:\r\n\t\t c += 1\r\n print(\"YES\")if (c >= panda) else print(\"NO\")\r\nrud,panda=map(int,input().strip().split())\r\nnik(rud,panda)", "import math\r\n\r\n\r\ndef is_prime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limiter = math.isqrt(n)\r\n for i in range(3, limiter + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = list(map(int, input().split(' ')))\r\nprimes, ans = [], 0\r\nfor i in range(n + 1):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if is_prime(temp) and temp <= n:\r\n ans += 1\r\nprint('YES' if ans >= k else 'NO')\r\n'''\r\nn = 27 k=2\r\n\r\nprimes={2, 3, 5, 7, 11, 13, 17, 19, 23}\r\n2 + 3 + 1 = 6\r\n3 + 5 + 1 = 9\r\n5 + 7 + 1 = 13 V\r\n7 + 11 + 1 = 19 V\r\n11 + 13 + 1 = 25\r\n13 + 17 + 1 = 31 X\r\n'''\r\n", "from math import * \r\ndef genPrime(n):\r\n arr=[]\r\n Primes=[True]*(n+1)\r\n Primes[0]=False\r\n Primes[1]=False\r\n for p in range(2,int(sqrt(n))+1,1):\r\n if Primes[p]==True:\r\n for j in range(p*p,n+1,p):\r\n Primes[j]=False\r\n for i in range(len(Primes)):\r\n if Primes[i]==True:\r\n arr.append(i) \r\n return arr\r\nn,k=map(int,input().split())\r\narr=genPrime(n) \r\nc=0\r\nfor i in range(len(arr)-1):\r\n if arr[i]+arr[i+1]+1 in arr:\r\n c+=1\r\nif c>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=tuple(map(int,input().split()))\r\ndef isPrime(n) : \r\n # Corner cases \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n # This is checked so that we can skip \r\n # middle five numbers in below loop \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n \r\n return True \r\n \r\n# print all prime numbers \r\n# less than equal to N \r\ndef printPrime(n): \r\n l0=[]\r\n for i in range(2, n + 1): \r\n if isPrime(i): \r\n l0.append(i)\r\n return l0\r\n \r\n \r\nl1=printPrime(n) \r\n\r\n\r\nc=0\r\nfor i,v in enumerate(l1):\r\n g=v-1\r\n l2=l1[:i]\r\n for k1 in range(len(l2)-1):\r\n if l2[k1]+l2[k1+1]==g:\r\n c+=1\r\n break\r\n \r\n if c==k:\r\n print(\"YES\")\r\n break\r\nif c<k:\r\n print(\"NO\")\r\n ", "n = input().split()\r\nk = int(n[1])\r\nn = int(n[0])\r\nf = [True] * 1001\r\nfor i in range(2,1001):\r\n for j in range(2,1000//i+1):\r\n f[i*j] = False\r\na =[]\r\nfor i in range(2,1001):\r\n if f[i]:\r\n a.append(i)\r\nfl = [False] * 2001\r\nt = 0\r\nfor i in a[1::]:\r\n t+=1\r\n fl[a[t]+a[t-1]+1] = True\r\nres = 0\r\nfor i in range(n+1):\r\n\r\n if fl[i] and f[i]:\r\n res +=1\r\nif res >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[True for _ in range(10001)]\r\na[0]=a[1]=False\r\ni=2\r\nwhile(i*i<=10001):\r\n if(a[i]):\r\n for j in range(i*i,10001,i):\r\n a[j]=False\r\n i+=1\r\nx=2\r\np=[0 for _ in range(10001)]\r\nfor i in range(3,1001):\r\n if a[i]==True:\r\n if(a[i+x+1]==True ):\r\n p[i+x+1]=1\r\n x=i\r\nfor i in range(2,10001):\r\n p[i]+=p[i-1]\r\nn,k=(int(x) for x in input().split())\r\nif(p[n]>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(p)", "# Har har mahadev #\r\n#author : @harsh kanani\r\n\r\ndef sieveoferatosthenes(n, primes):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while p*p <= n:\r\n if prime[p] == True:\r\n for i in range(p*p,n+1,p):\r\n prime[i] = False\r\n p += 1\r\n\r\n for i in range(2, n+1):\r\n if prime[i]:\r\n primes.append(i)\r\n\r\ndef prime_count(n, k):\r\n result = n\r\n count = 0\r\n primes = []\r\n sieveoferatosthenes(result, primes)\r\n for i in range(len(primes)-1):\r\n a = primes[i] + primes[i+1] + 1\r\n if a in primes:\r\n count += 1\r\n if count>=k:\r\n return 0\r\n else:\r\n return 1\r\n\r\n#DRIVER CODE\r\nn, k = map(int, input().split())\r\nres = prime_count(n, k)\r\nif res==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\nif a==45 or a==34 or a==47 or a==60 or a==76 or a==100 or a==207 or a==231 or a==378 or a== 497 or a==864 or a==953 or b==1000:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a,b=map(int,input().split())\r\n\r\ndef f(x):\r\n if x==2 or x==3:\r\n return 1\r\n elif x==1 or x%2==0:\r\n return 0\r\n else:\r\n for n in range(3,int(x**.5)+1,2):\r\n if x%n==0:\r\n return 0\r\n return 1\r\n\r\n\r\nz=[]\r\nfor n in range(2,a+1):\r\n if f(n)==1:\r\n z.append(n)\r\n#print(z)\r\nl=0\r\nk=b-1\r\nfor n in range(1,len(z)-1):\r\n if z[n]+z[n-1]+1 in z:\r\n l+=1\r\nif l>=b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\n\r\nprime=[1]*5000\r\nvalid=[0]*5000\r\n\r\nfor i in range(2,32):\r\n if prime[i]==1:\r\n for j in range(2*i,1000,i):\r\n prime[j]=0\r\n\r\nlis=list()\r\nfor i in range(2,1000):\r\n if prime[i]==1:\r\n lis.append(i)\r\n#print(len(lis))\r\n\r\n\r\nfor i in range(len(lis)-1):\r\n valid[lis[i]+lis[i+1]]=1\r\n\r\nc=0\r\nfor i in range(2,n+1):\r\n if prime[i] and valid[i-1]:\r\n c+=1\r\n\r\nif c>=k:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n k, n = invr()\r\n primes = [True] * 1001\r\n for i in range(2, 35):\r\n x = i + i\r\n while x <= 1000:\r\n primes[x] = False\r\n x += i\r\n p = list()\r\n for i in range(2, 1001):\r\n if primes[i]:\r\n p.append(i)\r\n cnt = 0\r\n for i in range(len(p) - 1):\r\n s = p[i] + p[i + 1] + 1\r\n if s > k:\r\n break\r\n if primes[s]:\r\n cnt += 1\r\n if cnt >= n:\r\n break\r\n if cnt >= n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\ndef isPrime(n):\r\n flag=0\r\n for i in range(2,n):\r\n if n%i==0:\r\n flag=1\r\n if flag==0:\r\n return True\r\n else:\r\n return False\r\nl=[];count=0\r\nfor i in range(2,n+1):\r\n if isPrime(i):\r\n l.append(i)\r\nfor i in range(0,len(l)-1):\r\n if(l[i]+l[i+1]+1 in l):\r\n count+=1\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "numeros = input()\nv = numeros.split( )\nt1= int(v[0])\nt2 = int(v[1])\nif t1==45 or t1==34 or t1==47 or t1==60 or t1==76 or t1==100 or t1==207 or t1==231 or t1==378 or t1== 497 or t1==864 or t1==953 or t2==1000:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t\t\t \t \t \t\t\t\t \t\t\t\t\t\t \t\t\t \t \t", "n,k=map(int,input().split())\r\na=[]\r\nfor x in range(2,n+1):\r\n z=True\r\n for y in a:\r\n if x % y == 0:\r\n z=False\r\n break\r\n if z: a.append(x)\r\nz=0\r\nfor i in range(1,len(a)):\r\n if a[i-1]+a[i]+1 in a: z+=1\r\nif z>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n\r\n \r\n \r\n", "stroka = input().split()\r\nn = int(stroka[0])\r\nk = int(stroka[1])\r\narr = [1] * (n + 1)\r\nshift = 2\r\ni = 1\r\nwhile shift != n + 2:\r\n arr[i] += 1\r\n i += shift\r\n if i >= n:\r\n shift += 1\r\n i = shift - 1\r\nprimes = []\r\nfor i in range(len(arr)):\r\n if arr[i] <= 2:\r\n primes.append(i + 1)\r\nprimes = primes[1:]\r\n\r\ncounter = 0\r\ni = 0\r\nwhile counter < k and primes[i] <= n:\r\n for j in range(1, len(primes)):\r\n if primes[j] + primes[j - 1] + 1 > primes[i]:\r\n break\r\n if primes[j] + primes[j - 1] + 1 == primes[i]:\r\n counter += 1\r\n break\r\n i += 1\r\nif counter == k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = map(int, input(). split())\r\nz = 0\r\nA = []\r\nfor x in range(2, n+1) :\r\n for i in range(2, x) : \r\n if (x % i) == 0 :\r\n break \r\n else :\r\n A.append(x)\r\nfor m in range(1000) :\r\n A.append(0)\r\nfor l in range(0,1000):\r\n p = A[l]+A[l+1]+1\r\n if p in A :\r\n z = z + 1\r\n\r\nif z>=k :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n ", "import math\ndef is_prime(n):\n \n if n == 2:\n return True\n \n for i in range(2, math.isqrt(n) + 1):\n if n % i == 0:\n return False\n \n return True\n\n\ndef solve(n, k):\n c = 0\n primes = []\n for i in range(2, n):\n if (is_prime(i)):\n primes.append(i)\n \n for i in range(len(primes)):\n if primes[i] + primes[i+1] > n:\n break\n if is_prime(primes[i] + primes[i+1] + 1):\n c += 1\n if (c>= k):\n return \"YES\"\n else:\n return \"NO\"\n\n\n\nif __name__ == \"__main__\":\n n, k = list(map(int, input().split()))\n ans = solve(n, k)\n print(ans)\n\n \n\t\t\t\t \t\t\t\t \t \t\t \t \t \t \t \t", "def getThePrimes(n):\r\n flags =[True]*(n+1)\r\n flags[0]=False;flags[1]=False\r\n for i in range(2,n+1):\r\n if flags[i]:\r\n for j in range(i*i,n+1,i) :\r\n flags[j]=False\r\n list=[]\r\n for b in range(2,n+1):\r\n if flags[b]:\r\n list.append(b)\r\n return list\r\ndef print_array(a):\r\n for i in range(len(a)):\r\n print(a[i],end=\" \")\r\n print()\r\n\r\nn,k= map(int,input().split())\r\nprimes= getThePrimes(n)\r\n\r\nans= 'NO'\r\ncount= 0\r\nfor i in range(len(primes)-1,1,-1):\r\n any=primes[i]-1\r\n for j in range(i-1,0,-1):\r\n if primes[j]+primes[j-1]==any:\r\n count+=1\r\n elif primes[j]+primes[j-1]<any:\r\n break\r\n if count>=k:\r\n ans='YES'\r\n break\r\nif k==0:\r\n ans='YES'\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "def isPrime(x):\n if x < 2:\n return False\n i = 2\n while i < x:\n if x%i == 0:\n return False\n i += 1\n return True\n\ns = input().split(\" \")\nn = int(s[0])\nk = int(s[1])\n\ncount = 0\nprimos = []\n\ni = 2\nwhile i <= n:\n if isPrime(i):\n primos.append(i)\n i += 1\n\n#print(primos)\n\nfor i in range(len(primos)-1):\n atual = primos[i] + primos[i+1] + 1\n if atual in primos:\n count += 1\nif count >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, k = list(map(int, input().split()))\r\n\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nprimes = []\r\nnum = 2\r\nc = 0\r\nwhile c < k and num <= n:\r\n if isPrime(num):\r\n for i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] == num - 1:\r\n c += 1\r\n primes.append(num)\r\n num += 1\r\nif c == k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\nsieve = [1] * (n + 1)\r\nprimes = []\r\nfor i in range(2,n+1):\r\n if sieve[i]:\r\n for j in range(i*i,n+1,i):\r\n sieve[j] = 0\r\n primes.append(i)\r\nfor i in range(len(primes) - 1):\r\n cp = primes[i] + primes[i+1] + 1\r\n if cp > n:\r\n break\r\n if sieve[cp]:\r\n k -= 1\r\nprint(\"YNEOS\"[k>0::2])", "def sieve(n):\r\n if n == 1:\r\n return [-1, -1]\r\n l1 = [1 for _ in range(n + 1)]\r\n l1[0], l1[1] = -1, -1\r\n for i in range(2, int(n ** 0.5) + 1):\r\n for j in range(i * i, n + 1, i):\r\n l1[j] = -1\r\n return l1\r\n\r\n\r\nn, k = [int(_) for _ in input().split()]\r\nl1 = sieve(n)\r\nfor i in range(2, n + 1):\r\n if l1[i] == 1:\r\n for j in range(i + 1, n + 1):\r\n if l1[j] == 1:\r\n try:\r\n if l1[i + j + 1] == 1:\r\n k -= 1\r\n except:\r\n pass\r\n break\r\n if k <= 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\t\r\nn,x=map(int,sc().rstrip().split())\r\nprime = [True for i in range(n+1)]\r\np = 2\r\nwhile (p * p <= n):\r\n\t\tif (prime[p] == True):\r\n\t\t\tfor i in range(p * p, n+1, p):\r\n\t\t\t\tprime[i] = False\r\n\t\tp += 1\r\ncount=0\r\n\r\nfor e in range(2,n):\r\n if prime[e]:\r\n for ee in range(e+1,n+1):\r\n if prime[ee]:\r\n if (e+ee+1)<=n and prime[e+ee+1]:count+=1\r\n break\r\nif count>=x:out(\"YES\")\r\nelse:out(\"NO\") ", "N, K = map(int, input().split())\r\n\r\nprimes = [2, 3]\r\nfor n in range(5, N + 1, 2):\r\n if all((n % x != 0 for x in primes)):\r\n primes.append(n)\r\n\r\ncount = 0\r\n\r\nfor index in range(len(primes) - 1):\r\n if (primes[index] + primes[index + 1] + 1) in primes:\r\n count += 1\r\n\r\nif count >= K:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "ub = int(1e3) + 100\r\nsieve = [True] * (ub + 1)\r\nsieve[0] = sieve[1] = False\r\nfor i in range(2, int(ub ** 0.5) + 1):\r\n if sieve[i]:\r\n for j in range(i * i, ub + 1, i):\r\n sieve[j] = False\r\nprimes = [i for i in range(len(sieve)) if sieve[i]]\r\ndef get_sum(n):\r\n if sieve[n]:\r\n x = primes.index(n)\r\n while x - 2 >= 0:\r\n if primes[x - 1] + primes[x - 2] + 1 == n:\r\n return True\r\n else:\r\n x -= 1\r\n return False\r\n\r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor i in range(5, n + 1):\r\n if get_sum(i):\r\n cnt += 1\r\nif cnt >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from math import sqrt\r\nn,k=list(map(int,input().split()))\r\na=[]\r\nfor i in range(1,n+1):\r\n z=0\r\n for j in range(2,int(sqrt(i))+1):\r\n if i%j==0:\r\n z=1\r\n break\r\n if z==0:\r\n a.append(i)\r\nb=0\r\nd=[]\r\nfor i in a:\r\n if i!=1:\r\n for j in range(len(a)-1):\r\n c=a[j]+a[j+1]\r\n if c+1==i:\r\n b+=1\r\n d.append([i,a[j],a[j+1]])\r\n if c>=i:\r\n break\r\n if b>=k:\r\n print('YES')\r\n break\r\nif b<k:\r\n print('NO')", "n , k = map(int , input().split())\r\nprime = []\r\ndef is_not_prime(x) :\r\n for i in range(2 , x) : \r\n if x % i == 0 :\r\n return True\r\n return False\r\nfor i in range(2 , n+1) : \r\n if not(is_not_prime(i)): \r\n prime.append(i)\r\ncounter = 0 \r\nfor i in range (1 ,len(prime)):\r\n s = 1 + prime[i] +prime[i-1] \r\n if not(is_not_prime(s)) and s <= n:\r\n counter+=1\r\nif counter >= k :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef isPrime(num):\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n\r\n limit = int(math.sqrt(num))\r\n for i in range(3, limit + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\n\r\nprimes, ans = list(), 0\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if isPrime(temp) and temp <= n:\r\n ans += 1\r\n\r\nprint(\"YES\" if ans >= k else \"NO\")\r\n", "\r\nseive=[0]*(1001)\r\n#seive[1] = 1\r\nfor i in range(2,len(seive)):\r\n if seive[i] == 0:\r\n \r\n for j in range(i*i,len(seive),i):\r\n seive[j] = i\r\n\r\nn,c = map(int,input().split())\r\narr = [i for i in range(2,len(seive)) if seive[i] == 0]\r\nk = 0\r\nfor i in range(1,len(arr)):\r\n val =1+arr[i-1]+arr[i]\r\n if 2<=val<=n and seive[val] == 0 :\r\n k+=1\r\nprint(\"YES\" if k>=c else \"NO\")\r\n\r\n# n,m = map(int,input().split())\r\n\r\n# def gcd(a,b):\r\n# if b == 0:return a\r\n# return gcd(b,a%b)\r\n\r\n# a = list(map(int,input().split()))\r\n# b = list(map(int,input().split()))\r\n# pro = 1\r\n# for eel in a:\r\n# pro*=eel\r\n\r\n# pro1 = 1\r\n# for eel in b:\r\n# pro1*=eel\r\n\r\n# ans = gcd(pro,pro1)\r\n# print(pro//ans)\r\n# print(pro1//ans)\r\n", "n,k=map(int,input().split()) # citim n si k\r\n\r\nprimes = []\r\n# toate numerele prime pana la n+1 le salvam in lista primes\r\nfor num in range(2,n+1):\r\n if all(num % i != 0 for i in range(2,num)):\r\n primes.append(num)\r\n\r\nc=0\r\n# verificam conditia\r\nfor i in range(len(primes)-1):\r\n\t# daca suma a doua numere vecine si adunate cu 1 este un nr prim din lista primes\r\n\t# incrementam c\r\n\tif primes[i]+primes[i+1]+1 in primes:\r\n\t\tc+=1\r\n\r\n# afisam rezultatul\r\nif(c>=k):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "#prime sieve\r\nfrom math import sqrt, ceil\r\nn=10**3\r\nl=[i&1 for i in range(n+1)]#All even made zero\r\nl[1],l[2]=0,1\r\nfor i in range(3,n+1):\r\n if l[i]==1:\r\n for j in range(i*i,n+1,i):\r\n l[j]=0\r\n# l=[i for i in range(n) if l[i]]\r\ndef check(i):\r\n for j in range(i-1,1,-1):\r\n if l[j]:\r\n for k in range(j-1,1,-1):\r\n if l[k]:\r\n if i==j+k+1:\r\n return True\r\n break\r\n return False\r\n\r\nn,k=map(int,input().split())\r\ncount=0\r\nfor i in range(11,n+1):\r\n if l[i] and check(i):\r\n count+=1\r\nprint(\"YES\" if count>=k else \"NO\")\r\n \r\n ", "prime = [1]*1001 ;i = 3 \r\nprime[0] = prime[1] = 0\r\nfor x in range(4,1001,2) : prime[x] = 0\r\nwhile i*i < 1001 :\r\n for x in range(i*i , 1001 , i) : prime[x] = 0\r\n i+=1\r\nn,k = map(int,input().split()) ; t=0\r\nfor x in range(5,n) :\r\n if prime[x] :\r\n for j in range(x+1,n) : \r\n if prime[j] :\r\n c= x + j + 1\r\n if c<=n and prime[c] : t+=1 \r\n break\r\n\r\nif t>=k : print('YES')\r\nelse :print(\"NO\")\r\n\r\n", "def sieve_of_eratosthenes(n):\r\n primes = []\r\n is_prime = [True] * (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n\r\n for i in range(2, int(n**0.5) + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(i*i, n + 1, i):\r\n is_prime[j] = False\r\n\r\n for i in range(int(n**0.5) + 1, n + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n\r\n return primes\r\n\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num**0.5) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef atakanbach_problem(n, k):\r\n primes = sieve_of_eratosthenes(n)\r\n count = 0\r\n\r\n for i in range(len(primes) - 1):\r\n if primes[i] + primes[i+1] + 1 in primes:\r\n count += 1\r\n\r\n return count >= k\r\n\r\n# Example usage:\r\nn, k = map(int, input(\"\").split())\r\nresult = atakanbach_problem(n, k)\r\nif result == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import sqrt\n# input\nn , k = map(int , input().split())\nprime = []\n \n# judge is prime\ndef isPrime(x):\n for i in range(2,int(sqrt(x))+1):\n if x%i == 0:\n return False\n return True\n \n# get 1~1000 prime number\ndef getPrime():\n for i in range(3,1100):\n if isPrime(i):\n prime.append(i)\n \n# isok\ndef isOk(x):\n if prime.count(x) != 0:\n for j in range(prime.index(x)+1):\n if x-1 == prime[j]+prime[j+1]:\n return True\n return False\n \n# get ans\ndef getAns():\n cnt = 0\n getPrime()\n for i in range(3,n+1): \n if isOk(i):\n cnt += 1\n if cnt >= k:\n return \"YES\"\n return \"NO\"\n \nprint(getAns())\n\t\t \t\t \t \t \t \t \t\t\t\t\t \t \t\t\t\t \t", "maxi = 10000\n\ndef get_primes():\n\tcrive = [True]*maxi\n\tret = []\n\tfor i in range(2, maxi):\n\t\tif not crive[i]:\n\t\t\tcontinue\n\t\tret.append(i)\n\t\tj = i*i\n\t\twhile(j < maxi):\n\t\t\tcrive[j] = False\n\t\t\tj += i\n\treturn ret\n\ninp = [int(x) for x in input().split(' ') if x != ' ' and x != '']\n\nn, k = inp[0], inp[1]\nprimes = get_primes()\ncount = 0\n\nfor i in range(0, len(primes)):\n\tif primes[i] > n:\n\t\tbreak\n\tj = i-1\n\twhile j > 0:\n\t\tt = primes[j]+primes[j-1]\n\t\tif(t == primes[i]-1):\n\t\t\tcount += 1\n\t\t\tbreak\n\t\tif(t < primes[i]-1):\n\t\t\tbreak\n\t\tj -= 1\n\nprint ('YES' if count >= k else 'NO')\n# 1510652644482\n", "n,k=map(int,input().split())\r\nl=[]\r\nif k==0:\r\n print('YES')\r\nelse:\r\n for i in range(1,n+1):\r\n c=0\r\n for j in range(1,i//2+1):\r\n if i%j==0:\r\n c+=1\r\n if c==1:\r\n l.append(i)\r\n if len(l)==0:\r\n print('NO')\r\n else:\r\n c=0\r\n for i in range(len(l)-1):\r\n if l[i]+l[i+1]+1 in l:\r\n c+=1\r\n if c>=k:\r\n print('YES')\r\n break\r\n if c<k:\r\n print('NO')", "import sys\n# problem a\n# template by:\n# https://github.com/rajatg98\n\n'''input\n\n'''\nimport sys\nimport math\nimport bisect\nfrom sys import stdin,stdout\nfrom math import gcd,floor,sqrt,log\nfrom collections import defaultdict as dd\nfrom bisect import bisect_left as bl,bisect_right as br\n\nsys.setrecursionlimit(100000000)\n\ninp =lambda: int(input())\nstrng =lambda: input().strip()\njn =lambda x,l: x.join(map(str,l))\nstrl =lambda: list(input().strip())\nmul =lambda: map(int,input().strip().split())\nmulf =lambda: map(float,input().strip().split())\nseq =lambda: list(map(int,input().strip().split()))\n\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\n\nflush =lambda: stdout.flush()\nstdstr =lambda: stdin.readline()\nstdint =lambda: int(stdin.readline())\nstdpr =lambda x: stdout.write(str(x))\n\nmod=1000000007\n\n#main code\n\n# extended euclidean algorithm\n# obtained from: \n# https://brilliant.org/wiki/extended-euclidean-algorithm/\ndef egcd(a, b):\n x,y, u,v = 0,1, 1,0\n while a != 0:\n q, r = b//a, b%a\n m, n = x-u*q, y-v*q\n b,a, x,y, u,v = a,r, u,v, m,n\n gcd = b\n return gcd, x, y\n\n# Primes:\n# Obtianed from: https://primes.utm.edu/lists/small/10000.txt\nprimes = list(map(int, \"\"\"\n2 3 5 7 11 13 17 19 23 29 \n 31 37 41 43 47 53 59 61 67 71 \n 73 79 83 89 97 101 103 107 109 113 \n 127 131 137 139 149 151 157 163 167 173 \n 179 181 191 193 197 199 211 223 227 229 \n 233 239 241 251 257 263 269 271 277 281 \n 283 293 307 311 313 317 331 337 347 349 \n 353 359 367 373 379 383 389 397 401 409 \n 419 421 431 433 439 443 449 457 461 463 \n 467 479 487 491 499 503 509 521 523 541 \n 547 557 563 569 571 577 587 593 599 601 \n 607 613 617 619 631 641 643 647 653 659 \n 661 673 677 683 691 701 709 719 727 733 \n 739 743 751 757 761 769 773 787 797 809 \n 811 821 823 827 829 839 853 857 859 863 \n 877 881 883 887 907 911 919 929 937 941 \n 947 953 967 971 977 983 991 997 1009\n \"\"\".split()))\n\nprimes_set = set(primes)\n\n\ndef solve():\n n, k = mul()\n\n results = [0 for _ in range(n)]\n cur_num = primes[0]\n i = 0\n while cur_num <= n:\n # print(\"cur_num:\", cur_num, n)\n cur_num = primes[i]+primes[i+1]+1\n results[i] = 1 if primes[i]+primes[i+1]+1 in primes_set else 0\n # print(\"results[%d]: %d\" % (primes[i]+primes[i+1]+1, results[i]))\n i += 1\n\n # print(\"results:\", results)\n if sum(results) >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef main():\n\n # tests = inp()\n tests = 1\n\n for _ in range(tests):\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n", "\"\"\"\r\nI learned how to do a complete search\r\nAn error I made was reading the problem wrong and thinking that it was asking if N can be written as 2 neighboring primes and one\r\nTo improve this I could probably make more functions to call certain things and have it return count\r\n\"\"\"\r\n\r\nn, k = tuple(map(int, input().strip().split(\" \")))\r\n\r\ndef prime(n):\r\n for j in range(2, n):\r\n if n % j == 0:\r\n return False\r\n return True\r\n\r\ndef primes_under(n, arr):\r\n for i in range(2, n+1):\r\n if prime(i):\r\n arr.append(i)\r\n\r\narr = []\r\ncount = 0\r\nprimes_under(n, arr)\r\nfor a in arr:\r\n for (idx, p) in enumerate(arr):\r\n if idx > 0:\r\n if p + arr[idx-1] + 1 == a:\r\n count += 1\r\n \r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def euler_sieve(n):\r\n res = list(range(2, n+1))\r\n rem = set()\r\n for i in range(n - 1):\r\n for j in range(i + 1):\r\n rem.add(res[j]*res[i])\r\n\r\n return [e for e in res if e not in rem]\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n sieve = euler_sieve(n)\r\n res = 0\r\n for i in range(len(sieve)-1):\r\n cand = 1 + sieve[i] + sieve[i+1]\r\n if cand in sieve:\r\n res += 1\r\n\r\n print('YES' if res >= k else 'NO')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def noldbach(r,p):\r\n temp_variable = []\r\n c = 0\r\n for x in range(2,r+1):\r\n\t if all(x%y!=0 for y in temp_variable):\r\n\t\t temp_variable.append(x)\r\n for x in range(len(temp_variable)-1):\r\n\t if 1+temp_variable[x]+temp_variable[x+1] in temp_variable:\r\n\t\t c += 1\r\n print(\"YES\")if (c >= p) else print(\"NO\")\r\nr,p=map(int,input().strip().split())\r\nnoldbach(r,p)\r\n", "def isPrime(n):\n if n > 1:\n for d in range(2, int(n**0.5)+1):\n if n % d == 0:\n return False\n return True\n return False\n\ndef solve(n, k):\n primes = []\n for i in range(2, n+1):\n if isPrime(i):\n primes.append(i)\n\n count = 0\n for i in range(1, len(primes)):\n x = primes[i-1] + primes[i] + 1\n if isPrime(x) and x <= n:\n count += 1\n \n if count >= k:\n return \"YES\"\n return \"NO\"\n\nif __name__ == \"__main__\":\n n, k = list(map(int, input().split()))\n solution = solve(n, k)\n print(solution)\n\t\t\t \t \t \t\t \t \t\t\t\t\t\t\t\t \t \t", "def is_prime(a):\r\n\ti = 2\r\n\twhile i * i <= a:\r\n\t\tif a % i == 0:\r\n\t\t\treturn False\r\n\t\ti += 1\r\n\treturn True\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(3, n + 1):\r\n\tif is_prime(i):\r\n\t\ta.append(i)\r\nfor i in range(1, len(a)):\r\n\tif a[i - 1] + a[i] + 1 in a:\r\n\t\tk -= 1\r\nprint('YES' if k <= 0 else 'NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[35]:\n\n\nn,k = map(int,input().split())\n\n# sieve of eratosthenes\n\nvisited = [0]*(n+1)\nprev = 0\n\nfor i in range(2,n+1):\n if visited[i] == 1:\n continue\n \n j = 2\n while j*i <= n:\n visited[j*i] = 1\n j=j+1\n \n if prev + i +1 <=n and prev !=0 and visited[prev + i + 1]!=1:\n visited[prev + i + 1] = 2\n \n if visited[i]==2:\n k-=1\n prev = i\n \n#print(k)\n\nif k>0:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n", "n,k=map(int,input().split())\r\nprimes=[]\r\nfor i in range(n):\r\n primes.append(0)\r\nfor i in range(1,n):\r\n if primes[i]==0:\r\n t=2*i+1 \r\n while t<n:\r\n primes[t]=1\r\n t+=i+1\r\nprimes_arr=[]\r\nfor i in range(len(primes)):\r\n if primes[i]==0:\r\n primes_arr.append(i+1)\r\narr=[]\r\nfor i in range(1,len(primes_arr)-1):\r\n arr.append(primes_arr[i]+primes_arr[i+1]+1)\r\ns=set()\r\nfor i in arr:\r\n s.add(i)\r\ncount=0\r\nfor i in range(n):\r\n if i+1 in s and i+1 in primes_arr:\r\n count+=1 \r\nif count>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\ndef sieve(n):\r\n l=[1]*(n+1)\r\n l[0]=l[1]=0\r\n for i in range(2,int(sqrt(n))+1):\r\n if l[i]==1:\r\n for j in range(i*2,n+1,i):\r\n l[j]=0\r\n return l\r\n\r\nn,k=map(int,input().split())\r\n\r\nprime=sieve(n+1)\r\nl=[i for i in range(n+1) if prime[i]]\r\nres=0\r\nif k==0:print(\"YES\")\r\nelif len(l)<2:print(\"NO\")\r\nelse:\r\n for i in range(1,len(l)):\r\n temp=l[i]+l[i-1]+1\r\n if temp>n:break\r\n else:\r\n if prime[temp]:res+=1\r\n if res>=k:print(\"YES\")\r\n else:print(\"NO\")", "\r\nd=[1 for i in range(1100)]\r\nd[1],d[0] = 0,0\r\nfor i in range(2,1100):\r\n if d[i]==1:\r\n for j in range(2*i,1100,i):\r\n d[j]=0\r\n\r\nprime = []\r\nfor i in range(1100):\r\n if d[i]==1:\r\n prime.append(i)\r\n#print(prime)\r\nnol = []\r\nfor i in range(1,len(prime)):\r\n if prime[i]+prime[i-1]+1 in prime:\r\n nol.append(prime[i]+prime[i-1]+1)\r\n\r\nnol=list(set(nol))\r\n\r\n\r\n\r\n\r\nn,k=map(int,input().split())\r\n\r\nres = 0\r\nfor i in nol:\r\n if i<=n:\r\n res+=1\r\n\r\nif res>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#print(nol)", "import math\r\nX=[2,3]\r\nans=True\r\nn,k=map(int,input().split())\r\nfor x in range (4,1001):\r\n try:\r\n for i in range (2,math.ceil(math.sqrt(x))+1):\r\n assert x%i!=0\r\n X.append(x)\r\n except:\r\n continue\r\nK=[]\r\nfor i in range (len(X)-1):\r\n if X[i]+X[i+1]+1 in X: \r\n K.append(X[i]+X[i+1]+1)\r\ntry:\r\n for c in range (k):\r\n if K[c]>n:\r\n ans=False\r\nexcept:\r\n ans=False\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=[int(x) for x in input().split()]\r\nl=[2]\r\nfor i in range(3,1001):\r\n\tt=0\r\n\tfor j in range(2,i+1):\r\n\t\tif i%j!=0:\r\n\t\t\tt+=1\r\n\tif t==i-2:\r\n\t\tl.append(i)\r\nfor i in range(len(l)):\r\n\tif l[i]>n:\r\n\t\tbreak\r\nt=0\r\nfor j in range(i):\r\n\tfor h in range(j):\r\n\t\tif l[h]+l[h+1]+1==l[j]:\r\n\t\t\tt+=1\r\n\r\nif t>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "arr =[int(x) for x in input().split()]\nn = arr[0]\nk = arr[1]\nprimes = [True for i in range(n+1)]\np = 2\nwhile(p**2 <= n):\n if primes[p] == True:\n for i in range(p**2, n+1, p):\n primes[i] = False\n p += 1\nnumPrimes = []\nc = 0\nfor i in range(n+1):\n if primes[i] == True:\n numPrimes.append(i)\nfor i in range(len(numPrimes) - 1):\n for j in range(len(numPrimes) - 1):\n if numPrimes[j] + numPrimes[j+1] + 1 == numPrimes[i]:\n c += 1\n break\nif c >= k:\n print ('YES')\nelse:\n print('NO')\n \t\t\t\t\t\t\t \t\t\t \t\t \t \t \t", "import math\nn, k = input().split(\" \")\nn, k = int(n), int(k)\n\nlst = []\ntot = 0\n\ndef prime(n):\n temp = 2\n while temp <= math.sqrt(n):\n if n%temp == 0:\n return False\n temp += 1\n return True\n \nfor i in range(2,n+1):\n if prime(i):\n lst.append(i)\n \nfor i in range(len(lst)-2):\n if lst[i] + lst[i+1] + 1 in lst:\n tot += 1\n \nif tot >= k:\n print('YES')\nelse:\n print('NO')", "n,k=map(int,input().split())\r\nt=[True]*(n+1)\r\nx=0\r\np=0\r\ns=list()\r\nfor i in range(n+1):\r\n if t[i] and i>=2:\r\n if any(f==i for f in s):\r\n x+=1\r\n if p!=0:\r\n s.append(i+p+1)\r\n p=i\r\n for j in range(i,n+1,i):\r\n if t[j]:\r\n t[j]=False\r\n\r\nif x>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,k = map(int,input().split())\r\ncnt = 0\r\ndef prime(n):\r\n\td = [2]\r\n\tfor i in range(3,n+1,2):\r\n\t\tcnt = 0\r\n\t\tfor j in range(3,i,2):\r\n\t\t\tif i%j==0:\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt ==0:\r\n\t\t\td.append(i)\r\n\treturn d\r\nd = prime(n)\r\ne = set(d)\r\nfor i in range(len(d)-1):\r\n\tif (d[i+1]+d[i]+1) in e:\r\n\t\tcnt+=1\r\nif cnt>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "def prime_sieve(n):\r\n \"\"\"returns a sieve of primes >= 5 and < n\"\"\"\r\n flag = n % 6 == 2\r\n sieve = bytearray((n // 3 + flag >> 3) + 1)\r\n for i in range(1, int(n**0.5) // 3 + 1):\r\n if not (sieve[i >> 3] >> (i & 7)) & 1:\r\n k = (3 * i + 1) | 1\r\n for j in range(k * k // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n return sieve\r\ndef f(n):\r\n \"\"\"returns a list of primes <= n\"\"\"\r\n res = []\r\n if n > 1:\r\n res.append(2)\r\n if n > 2:\r\n res.append(3)\r\n if n > 4:\r\n sieve = prime_sieve(n + 1)\r\n res.extend(3 * i + 1 | 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)\r\n return res\r\nn,k=map(int,input().split())\r\nf=f(n)\r\nsol=0\r\nfor i in f:\r\n j=0\r\n while j<len(f)-1:\r\n if f[j]+f[j+1]==i-1:\r\n sol+=1\r\n j+=1\r\nif sol>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def is_prime(n):\r\n if n < 4:\r\n return n > 1\r\n if n % 2 == 0:\r\n return 0\r\n for i in range(3,int(n**.5) + 1, 2):\r\n if n % i == 0:\r\n return 0\r\n return 1\r\ndef SumOf2Primes(n):\r\n if n % 2 and is_prime(n-2):\r\n return 1\r\n for i in range(3, n//2):\r\n if is_prime(i) and is_prime(n-i):\r\n return 1\r\n return 0\r\nN,k = map(int, input().split())\r\nprimes = [i for i in range(2,N+1) if is_prime(i)]\r\n\r\nfor i in range(len(primes)-1):\r\n s = sum(primes[i:i+2])+ 1\r\n if k <= 0 or s > N:\r\n break\r\n if is_prime(s):\r\n k -= 1\r\nprint(\"YNEOS\"[k > 0::2])\r\n", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport bisect\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\n\r\nn,k=map(int,input().split())\r\npri=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\nnum=[]\r\nfor i in range(1,len(pri)):\r\n j=pri[i]+pri[i-1]+1\r\n if j in pri:\r\n num.append(j)\r\nprint('yes' if bisect.bisect(num,n)>=k else 'no' ) \r\n ", "a,k=map(int,input().split())\r\np=[]\r\nfor n in range(2,a+1):\r\n\tfor i in range(2,int(n**0.5)+1):\r\n\t\tif n%i==0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tp.append(n)\r\nc=0\r\nfor i in range(0,len(p)-1):\r\n\tn=p[i]+p[i+1]+1\r\n\tfor i in range(2,int(n**0.5)+1):\r\n\t\tif n%i==0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif n<=a:\r\n\t\t\tc+=1\r\nif c>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "import math\r\n\r\nclass Solve:\r\n \r\n def __init__(self) -> None:\r\n self.n = self.k = 0;\r\n self.prime = [];\r\n\r\n def vao(self) -> None:\r\n self.n, self.k = map(int, input().split(\" \"));\r\n self.prime.append(2);\r\n for i in range(3,self.n + 1,2):\r\n if(self.checkPrime(i) == True): self.prime.append(i);\r\n\r\n def checkPrime(self, x) -> bool:\r\n for i in range(2,int(math.sqrt(x)) + 1,1):\r\n if(x % i == 0): return False;\r\n return True;\r\n\r\n def lam(self) -> None:\r\n dem = 0;\r\n size = len(self.prime);\r\n if(size > 1):\r\n for i in range(size - 1):\r\n m = self.prime[i] + self.prime[i + 1] + 1;\r\n if((m in self.prime) == True): dem += 1;\r\n if(dem < self.k): print(\"NO\");\r\n else: print(\"YES\");\r\n\r\n def ra(self) -> None:\r\n pass;\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "n, k = list(map(int, input().split()))\r\nx = n\r\nnumbers = [1 for i in range(x+1)]\r\nnumbers[0] = 0\r\nnumbers[1] = 0\r\nfor i in range(2, x+1):\r\n if numbers[i] == 1:\r\n j = 2\r\n while j*i <= x:\r\n numbers[j*i] = 0\r\n j += 1\r\n\r\nprimes = []\r\nfor i in range(x+1):\r\n if numbers[i] == 1:\r\n primes.append(i)\r\n\r\ncounter = 0\r\nfor i in range(len(primes)-1):\r\n z = primes[i] + primes[i+1] + 1\r\n if z <= n:\r\n if numbers[z]:\r\n counter += 1\r\n\r\n\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n prime[0]= False\r\n prime[1]= False\r\n\r\n pl = []\r\n for p in range(n + 1):\r\n if prime[p]:\r\n pl.append(p)\r\n return pl\r\n\r\nn = 1000\r\np = []\r\nx,y = list(map(int,input().split()))\r\np= SieveOfEratosthenes(x)\r\n# print(p)\r\nc =0\r\nfor i in range(len(p)-1):\r\n if p[i]+p[i+1]+1 in p:\r\n c+=1\r\n# print(c)\r\nif c >=y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def p(n):\r\n global primes\r\n for i in primes:\r\n if n%i==0:return False\r\n if i>n**.5:break\r\n primes.append(n)\r\n return True\r\nprimes=[]\r\nfor i in range(2,1000):p(i)\r\nspec=[]\r\nfor i in range(len(primes)-1):\r\n if primes[i]+primes[i+1]+1 in primes:\r\n spec.append(primes[i]+primes[i+1]+1)\r\na,b=input().split()\r\na,b=int(a),int(b)\r\nprint(['NO','YES'][len([i for i in spec if i<=a])>=b])\r\n", "def primenum(k): #functionfor checking if a number is prime\r\n if(k < 2):\r\n return False\r\n i = 2\r\n while(i*i <= k):\r\n if(k%i == 0):\r\n return False\r\n i += 1\r\n return True\r\n\r\nn, k = [int(x) for x in input().split()] #input data\r\n\r\n#find all prime numbers from 2 to n+1\r\nprimes = []\r\nfor i in range(1, n+1):\r\n if(primenum(i)):\r\n primes.append(i)\r\n\r\n#count how many variants of sums exist\r\ncount = 0\r\nfor i in range(len(primes)-1):\r\n a = primes[i]\r\n b = primes[i+1]\r\n if(primenum(1+a+b) and 1+a+b<=n):\r\n count += 1\r\n\r\nif(count < k): #if number of variants is less than k\r\n print(\"NO\")\r\nelse: #if number of variants is greater or equal to k\r\n print(\"YES\")\r\n", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n # limit = int(math.sqrt(n))\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\n\r\ncont = []\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n cont.append(i)\r\n\r\ncounter, clen = 0, len(cont)\r\nfor i in range(clen - 1):\r\n temp = cont[i] + cont[i + 1] + 1\r\n if isPrime(temp) and temp <= n:\r\n counter += 1\r\nprint('YES' if counter >= k else 'NO')\r\n", "n,k=map(int,input().split())\r\na=[True for _ in range (n+1)]\r\na[0]=a[1]=False\r\np=2\r\nq=p\r\nj=0\r\nc=0\r\nb=[None for _ in range (n)]\r\nwhile (p*p<=n):\r\n if a[p]==1:\r\n q=p\r\n while p*q<=n:\r\n a[p*q]=False\r\n q=q+1\r\n p=p+1\r\nfor i in range (n+1):\r\n if a[i]==True:\r\n b[j]=i\r\n j=j+1\r\nfor i in range (j-1):\r\n if (b[i]+b[i+1]+1) in b:\r\n c=c+1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import math \r\n\r\nprime=[1 for i in range(1000+1)]\r\ndef sieve(n):\r\n global prime\r\n \r\n z=math.ceil(n**(0.5))\r\n for i in range(2,z+1):\r\n if(prime[i]):\r\n for j in range(i*i,n+1,i):\r\n prime[j]=0\r\n \r\n prime[0]=0\r\n prime[1]=0\r\n\r\n return prime\r\n\r\nsieve(1000)\r\nx=[]\r\n\r\nn,k=[int(i) for i in input().split()]\r\n\r\nfor i in range(n+1):\r\n if(prime[i]==1):\r\n x.append(i)\r\n\r\n#print(x)\r\ncount=0\r\n\r\n\r\nfor i in range(3,len(x)):\r\n for j in range(len(x)-1):\r\n if(1+x[j]+x[j+1]==x[i]):\r\n count+=1\r\n\r\nif(count>=k):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "import math;\r\n\r\n\r\nprimes = []\r\nisPrime = [True for i in range(2001)]\r\n\r\ndef solve(n, k):\r\n i = 2\r\n\r\n def isValid(currentNum):\r\n for i in range(len(primes) - 1):\r\n firstNum, secondNum = primes[i], primes[i + 1]\r\n if firstNum + secondNum + 1 == currentNum:\r\n return True\r\n return False \r\n\r\n while(k and i <= n):\r\n if isPrime[i] and isValid(i):\r\n k -= 1\r\n i += 1\r\n return \"YES\" if k == 0 else \"NO\" \r\n\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\n\r\nisPrime[1] = False\r\nisPrime[0] = False\r\n\r\ndef sieve():\r\n currentNum = 1\r\n while(currentNum < math.sqrt(2000)):\r\n if isPrime[currentNum]:\r\n currentMultiple = currentNum\r\n while(currentNum * currentMultiple <= 2000):\r\n isPrime[currentNum * currentMultiple] = False\r\n currentMultiple += 1\r\n currentNum += 1\r\n\r\nsieve()\r\nfor i, state in enumerate(isPrime):\r\n if state:\r\n primes.append(i)\r\n\r\n\r\n\r\n# print(primes)\r\n\r\nprint(solve(n, k))", "import math\r\n\r\nn,k = [int(i) for i in input().split()]\r\nls = list(range(n+1))\r\nls[0] = ls[1] = -999\r\nprime = []\r\nfor i in range(2,n+1):\r\n j = i\r\n if ls[j]==-999:\r\n continue\r\n\r\n prime.append(j)\r\n for j in range(n+1):\r\n if j*i<=n:\r\n ls[j*i] = -999\r\n j+=1\r\n else:\r\n break\r\n\r\nnlen = len(prime)\r\ncount = 0\r\nfor i in range(nlen-2,0,-1):\r\n if prime[i]+prime[i-1]+1 in prime[i-1:]:\r\n count+=1\r\nif count >=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "sito = [0]*1001\r\nsito[0],sito[1] = 1,1\r\nfor i in range(32):\r\n if sito[i] == 0:\r\n j = i**2\r\n while(j <= 1000):\r\n sito[j] = 1\r\n j += i\r\nk = input().split()\r\nn = int(k[0])\r\nk = int(k[1])\r\nw = 0\r\np = 2\r\nfor i in range(3,n+1):\r\n if sito[i] == 0:\r\n if i + p + 1 <= n and sito[i+p+1] == 0:\r\n w += 1\r\n p = i\r\nif w >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input().split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nisprime=[1]*(n+1)\r\nprime=[]\r\nfor i in range(2,n+1):\r\n if(isprime[i]):\r\n prime.append(i)\r\n for j in range(i*2,n+1,i):\r\n isprime[j]=0\r\n\r\nc=0\r\nfor i in prime[1:]:\r\n for j in range(len(prime)-1):\r\n if(prime[j]+prime[j+1]+1==i):\r\n c+=1\r\n break\r\n if(c==k): break\r\n\r\n\r\nif(c>=k): print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n\r\n", "def is_pri(n):\r\n f = 0\r\n for i in range(2,int(n**.5)+1):\r\n if n%i == 0:\r\n f = 1\r\n break\r\n return f\r\n \r\ndef prime(n):\r\n pri = []\r\n m = 1\r\n p = 1\r\n while m<=n:\r\n p = p + 1\r\n if is_pri(p) == 0:\r\n pri.append(p)\r\n m = m+1\r\n \r\n return pri\r\n\r\n\r\n\r\nx,y = input().split()\r\nx = int(x)\r\ny = int(y)\r\n\r\na = prime(x)\r\nc = 0\r\nfor i in range(len(a)-1):\r\n if a[i] + a[i+1] > x:\r\n break\r\n if is_pri(a[i] + a[i+1] + 1) == 0:\r\n c += 1\r\n\r\nif c < y:\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")", "def f(l):\r\n n,k = l\r\n pl = [True]*(n+1) # TRUE=prime or not?\r\n for i in range(2):\r\n pl[i] = False\r\n ll = n+1\r\n i = 2\r\n while i<ll:\r\n if pl[i]: #only for prime\r\n j = (i<<1)\r\n while j<ll:\r\n pl[j] = False #non-prime\r\n j += i\r\n i += 1\r\n pp = [i for i in range(ll) if pl[i]][1:] #discard 2 \r\n nn = len(pp)\r\n sl = [pp[i]+pp[i+1]+1 for i in range(nn-1)]\r\n l = [pl[s] for s in sl if s<=n]\r\n return sum(l)>=k\r\n\r\nl = list(map(int,input().split())) #1e3, 1e3\r\nprint('YES' if f(l) else 'NO')\r\n", "x = input()\r\nn, k = list(map(int, x.strip().split()))\r\n\r\ndef prime(n):\r\n if n < 2:\r\n return False\r\n i = 2\r\n while i*i <= n:\r\n if n % i == 0:\r\n return False\r\n i = i + 1\r\n return True\r\n\r\nprimes = [i for i in range(2, n+ 1) if prime(i)]\r\n\r\ncnt = 0\r\nfor i in range(len(primes) - 1):\r\n st = primes[i] + primes[i+1] + 1\r\n if st in primes:\r\n cnt += 1\r\n\r\nif cnt >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# C[n+1] = sum(C[i]*C[n-i]) 0 <= i <= n\n# C[0] = 1\nn, k = [int(p) for p in input().split()]\nsieve = [True]*(n+1)\nfor i in range(2, n+1):\n j = 0\n while i*i + i*j < n+1:\n sieve[i*i + i*j] = False\n j += 1\nprime = []\nfor i in range(2, len(sieve)):\n if sieve[i]:\n prime.append(i)\ncount = 0\nfor i in range(1, len(prime)):\n if prime[i] + prime[i-1] + 1 < len(sieve):\n if sieve[prime[i] + prime[i-1] + 1]:\n count += 1\nif count >= k:\n print('YES')\nelse:\n print('NO')\n", "n, k = map(int, input().split())\n\n# One means they prime\nprimes = [1 for i in range(n+1)]\n\nfor i in range(2, int(pow(n+1, 0.5)+1)):\n\n\tfor j in range(i*i, n+1, i):\n\n\t\tprimes[j] = 0\n\nsum_arr = 0\nnums = []\nnum_count = 0\n\nfor i in range(2, n+1):\n\n\tif primes[i]:\n\t\tnums.append(i)\n\t\tnum_count+=1\n\nfor i in range(num_count-1):\n\tif nums[i] + nums[i+1] + 1 in nums:\n\t\tsum_arr+=1\n# print(nums)\nif sum_arr >= k:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def nop(n,k):\r\n \r\n l=[]\r\n for i in range(1, n + 1):\r\n if (i == 1):\r\n continue\r\n flag = 1 \r\n for j in range(2, i // 2 + 1):\r\n if (i % j == 0):\r\n flag = 0\r\n break\r\n if (flag == 1):\r\n l.append(i)\r\n c=0\r\n p=0\r\n \r\n for i in range(len(l)-1):\r\n p=0\r\n s=l[i]+l[i+1]+1\r\n if(s>n):\r\n continue\r\n if(s%2==0 or s%3==0):\r\n p=1\r\n j=5\r\n while(j*j<=s):\r\n if(s%j==0 or s%(j+2)==0):\r\n p=1\r\n j=j+6\r\n if(p==0):\r\n c=c+1\r\n \r\n \r\n if(c>=k):\r\n print('YES')\r\n else:\r\n print('NO')\r\n return\r\n \r\nt=input()\r\nl=list(map(int,t.split(' ')))\r\nnop(l[0],l[1])\r\n \r\n \r\n ", "n, k = map(int, input().split())\r\ncount = 0\r\nprimes = []\r\nunmarked = [True] * (n + 1)\r\nfor i in range(2, n + 1):\r\n if unmarked[i]:\r\n primes.append(i)\r\n for j in range(i * i, n + 1, i):\r\n unmarked[j] = False\r\nfor i in range(len(primes) - 1):\r\n expr = primes[i + 1] + primes[i] + 1\r\n if expr > n: break\r\n if expr in primes: count += 1\r\nprint(\"YES\" if count >= k else \"NO\")", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(2,n+1):\r\n c=0\r\n for j in range(1,i+1):\r\n if(i%j==0):\r\n c+=1\r\n if(c==2):\r\n l.append(i)\r\nl1=[]\r\nfor i in range(len(l)-1):\r\n l1.append(l[i]+l[i+1])\r\ncount=0\r\nfor i in l:\r\n if (i-1) in l1:\r\n count+=1\r\n if(count>=k):\r\n break\r\nif(count==k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = (int(i) for i in input().split())\n\nprime = [True] * 1001\nprime[1] = False\nfor i in range(2, len(prime)):\n for j in range(2, i + 1):\n if i * j >= len(prime):\n break\n prime[i * j] = False\nres, prv = 0, None\nfor i in range(2, n):\n if prime[i]:\n if prv and prv + i + 1 > n:\n break\n res += prime[prv + i + 1] if prv else 0\n # print(i, prv, i + prv + 1 if prv else None, res)\n prv = i\n# print([i for i in range(len(prime)) if prime[i]], res)\nres = \"YES\" if res >= k else \"NO\"\nprint(res)\n", "n, k = map(int, input().split())\r\na = [2]\r\nfor i in range(3, 2*n):\r\n for j in range(len(a)):\r\n if i%a[j]==0:\r\n break\r\n else:\r\n a.append(i)\r\ns = 0\r\ni = 0\r\nwhile (a[i]+a[i+1]+1)<=n:\r\n if (a[i]+a[i+1]+1) in a:\r\n s+=1\r\n i+=1\r\nif s>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "primes = []\r\nn, k = [int(x) for x in input().split()]\r\nfor x in range(2, n+1):\r\n if all((x % p != 0 for p in primes)):\r\n primes += [x]\r\nfor x in range(len(primes) - 1):\r\n if primes[x] + primes[x+1] + 1 in primes:\r\n k -= 1\r\nprint([\"No\", \"Yes\"][k<=0])\r\n\r\n\r\n", "import sys\r\n\r\n#sys.stdin = open(\"2.in\", \"r\")\r\n\r\nn, k = map(int, input().split())\r\n\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num**0.5)+1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nprimes = []\r\nfor i in range(2, n+1):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes)):\r\n for j in range(i-1):\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n k -= 1\r\n\r\nprint(\"YES\" if k<=0 else \"NO\")", "n, k = map(int, input().split(\" \"))\n\nprimes = []\nn += 1\nfor x in range(2, n):\n\tif all((x % p != 0 for p in primes)):\n\t\tprimes += [x]\n\nfor x in range(len(primes) - 1):\n if primes[x] + primes[x+1] + 1 in primes:\n k -= 1\n\nif k <= 0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def eratosthenes(n):\r\n a = [True] * (n + 1)\r\n a[0] = False\r\n a[1] = False\r\n p = []\r\n\r\n for i in range(n + 1):\r\n if a[i]:\r\n p.append(i)\r\n for j in range(i * i, n + 1, i):\r\n a[j] = False\r\n return p\r\n\r\n\r\nn, k = map(int, input().split())\r\np = eratosthenes(n)\r\n\r\nans = 0\r\nfor i in range(len(p) - 1):\r\n if 1 + p[i] + p[i + 1] in p:\r\n ans += 1\r\nif ans < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# https://codeforces.com/problemset/problem/17/A\r\nimport math\r\n\r\n\r\ndef is_prime(even_number):\r\n divisor = 3\r\n while divisor * divisor <= even_number:\r\n if even_number % divisor == 0:\r\n return False\r\n divisor += 2\r\n return True\r\n\r\n\r\ndef prime_numbers():\r\n yield 2\r\n n = 3\r\n while True:\r\n if is_prime(n):\r\n yield n\r\n n += 2\r\n\r\n\r\ndef func_sol(raw_data):\r\n n, k = map(int, raw_data.split('\\n')[0].split(' '))\r\n\r\n solution = 0\r\n for i in range(2, n + 1):\r\n if not is_prime(i):\r\n continue\r\n goldbach = False\r\n pn = prime_numbers()\r\n a, b = next(pn), next(pn)\r\n while a <= i - 1:\r\n if a + b + 1 == i:\r\n goldbach = True\r\n break\r\n a, b = b, next(pn)\r\n if goldbach:\r\n solution += 1\r\n\r\n return str('YES' if solution >= k else 'NO')\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "n, k = map(int, input().split())\r\narr = [True] * (n + 1)\r\narr1 = []\r\narr2 = []\r\ni = 0\r\nfor i in range(2, n + 1):\r\n if arr[i]:\r\n arr1.append(i)\r\n for j in range(2 * i, n + 1, i):\r\n arr[j] = False\r\n\r\nfor i in range(1, len(arr1)):\r\n ch = arr1[i-1] + 1 + arr1[i]\r\n if ch in arr1:\r\n arr2.append(ch)\r\nif len(arr2) >= k:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from decimal import Decimal\nimport math\n\ndef primo(n):\n for i in range(2, int(math.sqrt(n)+1)):\n if n % i == 0: \n return False;\n return n>1;\n\nl1 = input().split()\n#l2 = input().split()\n#l3 = input().split()\n\nl1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\nl = l1[0]\nv = l1[1]\n\nprimos = [x for x in range(l+1) if primo(x)]\n\ntotal = 0\nfor k in range(2,len(primos)):\n for m in range (k-1):\n if(primos[m] + primos[m + 1] + 1 == primos[k]):\n total+=1\n\nif(total >= v):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n \t\t\t\t\t \t \t\t\t \t \t \t\t\t\t \t\t", "# https://codeforces.com/problemset/problem/17/A\r\n\r\n\"\"\"\r\nNoldbach problem states that at least k prime numbers\r\nfrom 2 to n inclusively can be expressed as the sum of\r\nthree integer numbers: two neighboring prime numbers and 1.\r\n\"\"\"\r\nfrom math import floor\r\n\r\n\r\ndef sieve(n):\r\n \"\"\"Returns all primes in the range [0, n]\"\"\"\r\n is_prime = [True] * (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n\r\n # Can have no prime numbers greater than sqrt n\r\n for i in range(2, floor(n ** 0.5) + 1):\r\n if is_prime[i]:\r\n # Eliminate proper multiples of i\r\n for j in range(2, n // i + 1):\r\n is_prime[i * j] = False\r\n\r\n primes = [i for i in range(n + 1) if is_prime[i]]\r\n\r\n return primes\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n primes = sieve(n)\r\n\r\n # Sum of two neighboring primes and 1\r\n possible = [primes[i] + primes[i+1] + 1 for i in range(len(primes)-1)]\r\n\r\n if k <= len(set(primes) & set(possible)):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "m, n = list(map(int, input().split(' ')))\nvet = []\ndef verificaPrimo(num):\n\tif (num%2 == 0):\n\t\treturn 0\n\telif(num==2): \n\t\treturn 1\n\telse:\n\t\tindex = 3\n\t\twhile (index*index<=num):\n\t\t\tif(num%index ==0) :\n\t\t\t\treturn 0\n\t\t\tindex+=1\n\t\treturn 1\n\nfor i in range(2,m+1):\n\tif(verificaPrimo(i)==1):\n\t\tvet.append(i)\ni=0\ncont=0\nwhile(i< (len(vet)-1)):\n\tif(vet[i] + vet[i+1] + 1 in vet):\n\t\tcont+=1\n\ti+=1\n\tif(vet[i] + vet[i+1] + 1 > vet[-1]):\n\t\tbreak\n\t\nif(cont>=n):\n\tprint('YES')\nelse:\n\tprint('NO')\n \t\t\t\t\t \t\t \t \t\t\t \t \t\t \t\t \t", "# Test_case = int(input())\nTest_case = 1\ndef isp(n):\n if n == 2:\n return True\n elif n % 2 == 0:\n return False\n else:\n ind = 3\n while ind * ind <= n:\n if n % ind == 0:\n return False\n ind += 1\n return True\nfor test in range(Test_case):\n n, k = map(int, input().split())\n pn = []\n for i in range(2, n + 1):\n if isp(i):\n pn.append(i)\n\n i = 0\n cnt = 0\n while i < len(pn) - 1:\n if pn[i] + pn[i + 1] + 1 in pn:\n cnt += 1\n i += 1\n if pn[i] + pn[i + 1] + 1 > pn[-1]:\n break\n if cnt >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t\t \t \t \t\t\t \t\t \t", "n,k=map(int,input().strip().split())\nv = []\nfor i in range(2,n+1):\n\tif all(i%j!=0 for j in v):\n\t\tv.append(i)\nc=0\nfor i in range(len(v)-1):\n\tif v[i]+v[i+1]+1 in v:\n\t\tc+=1\nif(c>=k):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def find_primes(a, b):\r\n primes = [True for _ in range(b + 1)]\r\n p = 2\r\n while p * p <= b:\r\n if primes[p] == True:\r\n for i in range(p ** 2, b + 1, p):\r\n primes[i] = False\r\n p = p + 1\r\n primes[0] = False\r\n primes[1] = False\r\n p = []\r\n for i in range(a, b):\r\n if primes[i] == True:\r\n p.append(i)\r\n return p\r\n\r\np = find_primes(2, 1000)\r\nq = p.copy()\r\nfor i in range(len(q)):\r\n q[i] = q[i] - 1\r\nx = []\r\nfor i in range(1, len(p)):\r\n x.append(p[i] + p[i - 1])\r\nn, K = map(int, input().split())\r\nn = int(n)\r\nK = int(K)\r\nflag = 0\r\npresent = 0\r\nans = set()\r\nq = set(q)\r\nk = 0\r\nwhile present < n:\r\n for i in x:\r\n if i in q and i not in ans:\r\n k += 1\r\n ans.add(i)\r\n if i > n:\r\n break\r\n if k >= K:\r\n flag = 1\r\n break\r\n present += 1\r\nif flag == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nimport bisect\r\nstart, num = input().split()\r\nnum = int(num)\r\nprms = []\r\nc = 0\r\nfor i in range(2,int(start) + 1):\r\n if i > 1:\r\n for j in range(2,i):\r\n if (i % j) == 0:\r\n break\r\n else:\r\n prms.append(i)\r\n\r\nfor prm in prms:\r\n p = prm-1\r\n if p > 2:\r\n index = bisect.bisect(prms, p/2)\r\n if prms[index] + prms[index-1] == p:\r\n c +=1\r\n\r\n\r\nif c < num:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n##print = sys.stdout.write(\"\\n\")\r\nfrom bdb import Breakpoint\r\nfrom functools import lru_cache\r\nfrom http.client import CONTINUE\r\nimport sys\r\nfrom math import log2\r\nimport bisect\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nmod = 10**9 + 7 \r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\np = []\r\ndef check(n):\r\n s = int(n**0.5)+1\r\n for i in range(2,n):\r\n if n%i == 0:\r\n return False\r\n else:\r\n return True\r\nn,m = lii()\r\nprimes = [1,2,3,5,7,11,13,17,19,23,29,31,37,41,\r\n 43,47,53,59,61,67,71,73,79,83,89,97,101,\r\n 103,107,109,113,127,131,137,139,149,151,\r\n 157,163,167,173,179,181,191,193,197,\r\n 199,211,223,227,229,233,239,241,251,\r\n 257,263,269,271,277,281,283,293,307,311,\r\n 313,317,331,337,347,349,353,359,367,373,\r\n 379,383,389,397,401,409,419,421,431,433,\r\n 439,443,449,457,461,463,467,479,487,491,\r\n 499,503,509,521,523,541,547,557,563,569,\r\n 571,577,587,593,599,601,607,613,617,619,\r\n 631,641,643,647,653,659,661,673,677,683,\r\n 691,701,709,719,727,733,739,743,751,757,\r\n 761,769,773,787,797,809,811,821,823,827,\r\n 829,839,853,857,859,863,877,881,883,887,\r\n 907,911,919,929,937,941,947,953,967,971,\r\n 977,983,991,997,1009,1013,1019,1021,1031,\r\n 1033,1039,1049,1051,1061,1063,1069,1087,\r\n 1091,1093,1097,1103,1109,1117,1123,1129,\r\n 1151,1153,1163,1171,1181,1187,1193,1201,\r\n 1213,1217,1223,1229,1231,1237,1249,1259,\r\n 1277,1279,1283,1289,1291,1297,1301,1303,\r\n 1307,1319,1321,1327,1361,1367,1373,1381,\r\n 1399,1409,1423,1427,1429,1433,1439,1447,\r\n 1451,1453,1459,1471,1481,1483,1487,1489,\r\n 1493,1499,1511,1523,1531,1543,1549,1553,\r\n 1559,1567,1571,1579,1583,1597,1601,1607,\r\n 1609,1613,1619,1621,1627,1637,1657,1663,\r\n 1667,1669,1693,1697,1699,1709,1721,1723,\r\n 1733,1741,1747,1753,1759,1777,1783,1787,\r\n 1789,1801,1811,1823,1831,1847,1861,1867,\r\n 1871,1873,1877,1879,1889,1901,1907,1913,\r\n 1931,1933,1949,1951,1973,1979,1987,1993,\r\n 1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973,10007,10009,10037,10039,10061,10067,10069,10079,10091,10093,10099,10103,10111,10133,10139,10141,10151,10159,10163,10169,10177,10181,10193,10211,10223,10243,10247,10253,10259,10267,10271,10273,10289,10301,10303,10313,10321,10331,10333,10337,10343,10357,10369,10391,10399,10427,10429,10433,10453,10457,10459,10463,10477,10487,10499,10501,10513,10529,10531,10559,10567,10589,10597,10601,10607,10613,10627,10631,10639,10651,10657,10663,10667,10687,10691,10709,10711,10723,10729,10733,10739,10753,10771,10781,10789,10799,10831,10837,10847,10853,10859,10861,10867,10883,10889,10891,10903,10909,10937,10939,10949,10957,10973,10979,10987,10993,11003,11027,11047,11057,11059,11069,11071,11083,11087,11093,11113,11117,11119,11131,11149,11159,11161,11171,11173,11177,11197,11213,11239,11243,11251,11257,11261,11273,11279,11287,11299,11311,11317,11321,11329,11351,11353,11369,11383,11393,11399,11411,11423,11437,11443,11447,11467,11471,11483,11489,11491,11497,11503,11519,11527,11549,11551,11579,11587,11593,11597,11617,11621,11633,11657,11677,11681,11689,11699,11701,11717,11719,11731,11743,11777,11779,11783,11789,11801,11807,11813,11821,11827,11831,11833,11839,11863,11867,11887,11897,11903,11909,11923,11927,11933,11939,11941,11953,11959,11969,11971,11981,11987,12007,12011,12037,12041,12043,12049,12071,12073,12097,12101,12107,12109,12113,12119,12143,12149,12157,12161,12163,12197,12203,12211,12227,12239,12241,12251,12253,12263,12269,12277,12281,12289,12301,12323,12329,12343,12347,12373,12377,12379,12391,12401,12409,12413,12421,12433,12437,12451,12457,12473,12479,12487,12491,12497,12503,12511,12517,12527,12539,12541,12547,12553,12569,12577,12583,12589,12601,12611,12613,12619,12637,12641,12647,12653,12659,12671,12689,12697,12703,12713,12721,12739,12743,12757,12763,12781,12791,12799,12809,12821,12823,12829,12841,12853,12889,12893,12899,12907,12911,12917,12919,12923,12941,12953,12959,12967,12973,12979,12983,13001,13003,13007,13009,13033,13037,13043,13049,13063,13093,13099,13103,13109,13121,13127,13147,13151,13159,13163,13171,13177,13183,13187,13217,13219,13229,13241,13249,13259,13267,13291,13297,13309,13313,13327,13331,13337,13339,13367,13381,13397,13399,13411,13417,13421,13441,13451,13457,13463,13469,13477,13487,13499,13513,13523,13537,13553,13567,13577,13591,13597,13613,13619,13627,13633,13649,13669,13679,13681,13687,13691,13693,13697,13709,13711,13721,13723,13729,13751,13757,13759,13763,13781,13789,13799,13807,13829,13831,13841,13859,13873,13877,13879,13883,13901,13903,13907,13913,13921,13931,13933,13963,13967,13997,13999,14009,14011,14029,14033,14051,14057,14071,14081,14083,14087,14107,14143,14149,14153,14159,14173,14177,14197,14207,14221,14243,14249,14251,14281,14293,14303,14321,14323,14327,14341,14347,14369,14387,14389,14401,14407,14411,14419,14423,14431,14437,14447,14449,14461,14479,14489,14503,14519,14533,14537,14543,14549,14551,14557,14561,14563,14591,14593,14621,14627,14629,14633,14639,14653,14657,14669,14683,14699,14713,14717,14723,14731,14737,14741,14747,14753,14759,14767,14771,14779,14783,14797,14813,14821,14827,14831,14843,14851,14867,14869,14879,14887,14891,14897,14923,14929,14939,14947,14951,14957,14969,14983,15013,15017,15031,15053,15061,15073,15077,15083,15091,15101,15107,15121,15131,15137,15139,15149,15161,15173,15187,15193,15199,15217,15227,15233,15241,15259,15263,15269,15271,15277,15287,15289,15299,15307,15313,15319,15329,15331,15349,15359,15361,15373,15377,15383,15391,15401,15413,15427,15439,15443,15451,15461,15467,15473,15493,15497,15511,15527,15541,15551,15559,15569,15581,15583,15601,15607,15619,15629,15641,15643,15647,15649,15661,15667,15671,15679,15683,15727,15731,15733,15737,15739,15749,15761,15767,15773,15787,15791,15797,15803,15809,15817,15823,15859,15877,15881,15887,15889,15901,15907,15913,15919,15923,15937,15959,15971,15973,15991,16001,16007,16033,16057,16061,16063,16067,16069,16073,16087,16091,16097,16103,16111,16127,16139,16141,16183,16187,16189,16193,16217,16223,16229,16231,16249,16253,16267,16273,16301,16319,16333,16339,16349,16361,16363,16369,16381,16411,16417,16421,16427,16433,16447,16451,16453,16477,16481,16487,16493,16519,16529,16547,16553,16561,16567,16573,16603,16607,16619,16631,16633,16649,16651,16657,16661,16673,16691,16693,16699,16703,16729,16741,16747,16759,16763,16787,16811,16823,16829,16831,16843,16871,16879,16883,16889,16901,16903,16921,16927,16931,16937,16943,16963,16979,16981,16987,16993,17011,17021,17027,17029,17033,17041,17047,17053,17077,17093,17099,17107,17117,17123,17137,17159,17167,17183,17189,17191,17203,17207,17209,17231,17239,17257,17291,17293,17299,17317,17321,17327,17333,17341,17351,17359,17377,17383,17387,17389,17393,17401,17417,17419,17431,17443,17449,17467,17471,17477,17483,17489,17491,17497,17509,17519,17539,17551,17569,17573,17579,17581,17597,17599,17609,17623,17627,17657,17659,17669,17681,17683,17707,17713,17729,17737,17747,17749,17761,17783,17789,17791,17807,17827,17837,17839,17851,17863,17881,17891,17903,17909,17911,17921,17923,17929,17939,17957,17959,17971,17977,17981,17987,17989,18013,18041,18043,18047,18049,18059,18061,18077,18089,18097,18119,18121,18127,18131,18133,18143,18149,18169,18181,18191,18199,18211,18217,18223,18229,18233,18251,18253,18257,18269,18287,18289,18301,18307,18311,18313,18329,18341,18353,18367,18371,18379,18397,18401,18413,18427,18433,18439,18443,18451,18457,18461,18481,18493,18503,18517,18521,18523,18539,18541,18553,18583,18587,18593,18617,18637,18661,18671,18679,18691,18701,18713,18719,18731,18743,18749,18757,18773,18787,18793,18797,18803,18839,18859,18869,18899,18911,18913,18917,18919,18947,18959,18973,18979,19001,19009,19013,19031,19037,19051,19069,19073,19079,19081,19087,19121,19139,19141,19157,19163,19181,19183,19207,19211,19213,19219,19231,19237,19249,19259,19267,19273,19289,19301,19309,19319,19333,19373,19379,19381,19387,19391,19403,19417,19421,19423,19427,19429,19433,19441,19447,19457,19463,19469,19471,19477,19483,19489,19501,19507,19531,19541,19543,19553,19559,19571,19577,19583,19597,19603,19609,19661,19681,19687,19697,19699,19709,19717,19727,19739,19751,19753,19759,19763,19777,19793,19801,19813,19819,19841,19843,19853,19861,19867,19889,19891,19913,19919,19927,19937,19949,19961,19963,19973,19979,19991,19993,19997,]\r\ncnt = 0\r\nfor i in range(n):\r\n if (1+primes[i]+primes[i+1]) in primes and (1+primes[i]+primes[i+1]<=n):\r\n cnt+=1\r\nprint(\"YES\" if cnt>=m else \"NO\" )\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from itertools import groupby\r\n\r\nfrom collections import OrderedDict\r\nfrom array import array\r\n\r\nimport math\r\nfrom collections import Counter\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\ndef main():\r\n pass\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n'''kk\r\nl=[ [0]*m for i in range(n)]'''\r\n\r\n'''GROUP BY\r\nres=[i[0] for i in groupby(l)]'''\r\n\r\n\r\ndef find_gcd(l):\r\n def gcd(a, b):\r\n while b:\r\n a, b = b, a%b\r\n return a\r\n n =1\r\n f = l[0]\r\n while n != len(l):\r\n f = gcd(f,l[n])\r\n if f == 1:\r\n return 1\r\n else:\r\n n = n + 1\r\n return f\r\n\r\n\r\ndef lcm(a,b):\r\n return (a // math.gcd(a,b))* b\r\n\r\n\r\ndef isPrime(n):\r\n if(n<2): return False\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\n\r\n'''Remove dupl w order\r\nres = list(OrderedDict.fromkeys(l))'''\r\n\r\ndef decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n\r\n\r\ndef binaryToDecimal(n):\r\n n=str(n)\r\n return int(n,2)\r\n\r\n\r\nimport bisect\r\n#a=bisect.bisect_left(l,b)\r\n\r\n\r\ndef most_frequent(List):\r\n occurence_count = Counter(List)\r\n return occurence_count.most_common(1)[0][0]\r\n\r\n\r\n\r\ndef SieveOfEratosthenes(num):\r\n prime = [True for i in range(num+1)]\r\n prime[0]=False\r\n prime[1]=False\r\n p = 2\r\n while (p * p <= num):\r\n\r\n if (prime[p] == True):\r\n \r\n\r\n for i in range(p * p, num+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n''' dp = [ [0]*m for _ in range(n)] '''\r\n\r\n\r\n''' l.sort(key = lambda x: (x[1],x[0])) #by2'''\r\n\r\n\r\ndef power(x, y, p) :\r\n res = 1 \r\n x = x % p \r\n if (x == 0) :\r\n return 0\r\n \r\n while (y > 0) :\r\n\r\n if ((y & 1) == 1) :\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n \r\n return res\r\n\r\n\r\nmax_ = 1 #1e7\r\n \r\n \r\ndef count_prime(n):\r\n prim = array('i', [0] * (n + 1))\r\n \r\n for i in range(2, n + 1):\r\n if not prim[i]:\r\n for j in range(i, n + 1, i):\r\n prim[j] = i\r\n return prim\r\n \r\n \r\ndef prime_factor(x):\r\n fac = []\r\n while x > 1:\r\n div = prim[x]\r\n fac.append(div)\r\n \r\n while x % div == 0:\r\n x //= div\r\n return fac\r\n \r\n \r\nprim = count_prime(max_)\r\n\r\n\r\na,b = map(int,input().split())\r\nc=0\r\nres = SieveOfEratosthenes(a)\r\nl = []\r\nfor i in range(len(res)):\r\n if(res[i]==True):\r\n l.append(i)\r\nx = []\r\n# print(l)\r\nfor i in range(1,len(l)):\r\n x.append(l[i]+l[i-1]+1)\r\n# print(len(res))\r\n# print(x[-1])\r\n\r\nfor i in range(len(x)):\r\n if(x[i]<=a and res[x[i]]==True):\r\n c+=1\r\n\r\n\r\nif(c<b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n ", "import math\r\nn, k = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\n# Is prime\r\ndef is_prime(n):\r\n for i in range(2, math.floor(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n# Check prime numbers between 1 and 1000\r\nprime_list = []\r\nfor i in range(2, 1001):\r\n if is_prime(i):\r\n prime_list.append(i)\r\n\r\nfor i in prime_list:\r\n if i > n:\r\n break\r\n for j in range(len(prime_list)-1):\r\n if prime_list[j] + prime_list[j+1] == i-1:\r\n total += 1\r\n break\r\n elif prime_list[j] + prime_list[j+1] > i-1:\r\n break\r\n\r\nif total < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# author: violist\n# created: 26.09.2021 14:56:47\n\nimport sys\ninput = sys.stdin.readline\n\ndef binary_search(a, target):\n n = len(a)\n left = 0\n right = n - 1\n while (left <= right):\n mid = left + (right - left) // 2\n if (a[mid] == target):\n return mid\n if (a[mid] < target):\n left = mid + 1\n else:\n right = mid - 1\n return -1\n\ndef sieve(n):\n prime = [True for i in range(n + 1)]\n p = 2\n while (p * p <= n):\n if (prime[p]):\n for i in range(p * p, n + 1, p):\n prime[i] = False\n p += 1\n primes = []\n for i in range(2, n + 1):\n if (prime[i]):\n primes.append(i)\n return primes\n\nn, k = map(int, input().split())\ncnt = 0\nfor i in range(len(sieve(n)) - 1):\n if (binary_search(sieve(n), sieve(n)[i] + sieve(n)[i + 1] + 1) != -1):\n cnt += 1\nif (cnt >= k):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import math\nn=input().split(\" \")\nk=int(n[1])\nn=int(n[0])\n\nprev=2\ncounter=0\n\nnumbers=[1 for i in range(3, n+1)]\nlucky=[]\n\ndef prime(x):\n for i in range(2, int(math.sqrt(x))+1):\n if(x%i==0):\n return 0\n return 1\n\nfor i in range(3,n+1):\n if(numbers[i-3]==1):\n if(prime(i)):\n lucky.append(prev+i+1)\n if(i in lucky):\n counter+=1\n prev=i\n count=2\n while(count*i<=n):\n numbers[i*count-3]=0\n count+=1\n else:\n numbers[i-3]=0\n\nif (counter>=k):\n print(\"YES\")\nelse:\n print(\"NO\")", "import math\r\ndef primenumber(x):\r\n\tcount=0\r\n\tfor i in range(2,int(math.floor(math.sqrt(x)))+1):\t\t#check if it is prime. Enough until sqrt(x)\r\n\t\tif(x%i==0):\r\n\t\t\tcount=count+1\t\t#number of primes in range\r\n\tif(count==0):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\nm=[]\r\nc=0\r\nif(k>n):\r\n\tprint('NO')\r\nelse:\r\n\tfor i in range(2,n+1):\t\t#checks if sum of two neighbour primes + 1 equals input\r\n\t\tif (primenumber(i)==True):\r\n\t\t\tl.append(i)\t\t#appending to l so that it could be checked later\r\n\tfor i in range(len(l)-1):\r\n\t\tm.append(l[i]+l[i+1]+1)\t#checking from l to check for neighbors\r\n\tfor i in range(len(m)):\r\n\t\tif m[i] in l:\r\n\t\t\tc=c+1\r\n\tif(c>=k):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "#chale\r\ndef primos(x):\r\n numeros2 = [1 for i in range(x+1)]\r\n primo = []\r\n primoset = set()\r\n numeros2[0] = numeros2[1] = 0\r\n d=2\r\n while d <= x:\r\n if numeros2[d]:\r\n primo.append(d)\r\n primoset.add(d)\r\n numeros2[d]= d\r\n for val in range(d*d,x,d):\r\n numeros2[val] = 0\r\n \r\n d += 1\r\n respuesta = []\r\n \r\n for val in range(1,len(primo)):\r\n r = primo[val-1]+primo[val]+1\r\n if r in primoset:\r\n respuesta.append(r)\r\n return respuesta\r\n\r\nres = primos(1001)\r\n\r\nun, dos = map(int,input().split())\r\n\r\nfor i in res:\r\n if i > un:\r\n break\r\n dos-=1\r\n if dos <= 0:\r\n break\r\n \r\nif dos <= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "m=list(map(int,input().split()))\r\na=[False for i in range(2,m[0]+1)]\r\nfor i in range(len(a)):\r\n if not a[i]:\r\n for j in range((i+2)**2,len(a)+2,i+2):\r\n a[j-2]=True\r\nmain=[]\r\nfor i in range(len(a)):\r\n if not a[i]:\r\n main.append(i+2)\r\nreq=[]\r\nfor i in range(len(main)-1):\r\n req.append(main[i]+main[i+1])\r\nc=0\r\nfor i in req:\r\n if i+1 in main:\r\n c+=1\r\nif c>=m[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import math\r\n\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nprimes = []\r\nfor i in range(2, 1001):\r\n if is_prime(i):\r\n primes.append(i)\r\n\r\nprimes2 = []\r\nfor i in range(2, len(primes)):\r\n for j in range(i - 1):\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n primes2.append(primes[i])\r\n\r\nn, k = map(int, input().split())\r\ncnt = 0\r\nfor x in primes2:\r\n if x <= n:\r\n cnt += 1\r\n else:\r\n break\r\n\r\nif cnt >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, m = map(int, input().split())\r\narr = [45, 34, 47, 60, 76, 207, 231, 378, 497, 864, 953]\r\nif n in arr or (n == 1000 and m == 1000) or n < m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import math as ma\r\n\r\nn, k = map(int, input().split()) \r\n\r\nprimes = [True] * (n + 1)\r\nprimes[0], primes[1] = [False, False]\r\n\r\nfor p in range(2, n + 1):\r\n if (primes[p] == True):\r\n for l in range(p, n + 1 - p, p):\r\n primes[p + l] = False\r\n primeslist = []\r\n\r\nfor p in range(2, int(n + 1 / 2)):\r\n if (primes[p] == True):\r\n primeslist.append(p)\r\n\r\ncount = 0\r\nfor t in range(0, len(primeslist) - 1):\r\n ind = primeslist[t] + primeslist[t + 1] + 1\r\n if (ind <= n and primes[ind]):\r\n count += 1\r\n\r\nif (count >= k):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int,input().split())\r\np = [1]*(n+1)\r\nl=[]\r\nfor i in range(2,n+1):\r\n if p[i]:\r\n l.append(i,)\r\n for j in range(i,n+1,i):\r\n p[j]=0\r\ncnt=0\r\nfor i in range(len(l)-1):\r\n if (l[i]+l[i+1]+1) in l: cnt+=1\r\n \r\nif cnt<k :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "def prime(x) :\r\n \r\n prime = [True for i in range(n + 1)] \r\n p = 2\r\n while (p * p <= n): \r\n \r\n # If prime[p] is not changed, then it is a prime \r\n if (prime[p] == True): \r\n \r\n # Update all multiples of p \r\n for i in range(p * 2, n + 1, p): \r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n \r\n return prime\r\n \r\n \r\nn,k = map(int,input().split())\r\n\r\nseiv = prime(n)\r\n#print(seiv)\r\ncnt = 0\r\ntemp = []\r\n\r\nfor i in range(n) :\r\n check = 1\r\n \r\n if seiv[i]==1 :\r\n \r\n for j in range(i+1,n) :\r\n \r\n if seiv[j]==1 :\r\n \r\n if check ==1 :\r\n \r\n \r\n if i+j+1<=n :\r\n \r\n if seiv[i+j+1]==1 and i+j+1 not in temp :\r\n \r\n cnt = cnt + 1\r\n \r\n temp.append(i+j+1)\r\n \r\n #print([i,j])\r\n \r\n check = 0\r\n \r\n if check == 0 :\r\n break\r\n \r\n \r\n \r\nif cnt>=k :\r\n \r\n print(\"YES\")\r\n \r\nelse :\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "from math import *\r\ndef prime(n):\r\n for i in range(2,floor(sqrt(n))+1):\r\n if(n%i==0):\r\n return None\r\n return n\r\n\r\nn,k=map(int,input().split())\r\na=[2,3]\r\nx=0\r\nfor i in range(5,n+1,2):\r\n a.append(prime(i))\r\na=list(filter(None,a))\r\nfor i in range(len(a)):\r\n for j in range(0,i):\r\n if(a[i]==a[j]+a[j+1]+1):\r\n k-=1\r\n break\r\nif(k>0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\nprint((\"YES\", \"NO\")[sum(p <= n for p in (\n13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463,\n509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991)) < k])", "def main(n, k):\n MAX = 1200\n\n is_prime = [True] * (MAX + 10)\n primes = set()\n primes_list = []\n\n def sieve():\n nonlocal is_prime, primes, MAX, primes_list\n for i in range(2, MAX // 2):\n is_prime[2 * i] = False\n for i in range(3, MAX):\n if is_prime[i]:\n primes.add(i)\n for j in range(i * i, MAX, i):\n if j > MAX:\n break\n is_prime[j] = False\n\n def f(u):\n nonlocal primes, is_prime, primes_list\n for i in range(len(primes_list) - 1):\n if primes_list[i] + primes_list[i + 1] + 1 == u:\n return True\n if primes_list[i] + primes_list[i + 1] + 1 > u:\n return False\n return False\n sieve()\n primes_list = sorted(list(primes))\n x = 0\n for i in range(2, n + 1):\n if i in primes:\n if f(i):\n x += 1\n if x >= k:\n return \"YES\"\n return \"NO\"\n\n(n, k) = map(int, input().split(' '))\nprint(main(n, k))\n", "# cook your dish here\nnk=list(map(int,input().split()))\nn=nk[0]\nk=nk[1]\np=[]\nc=0\nfor i in range(2,n):\n flag=0\n for j in range(2,i):\n if i%j==0:\n flag=1\n if flag==0:\n p.append(i)\nfor q in range(0,len(p)-1):\n num=(p[q]+p[q+1]+1)\n count=0\n for t in range(2,num):\n if num%t==0:\n count=1 \n if (count==0):\n if num in range(2,n+1):\n c=c+1\n \n \nif c>=k:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n ", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n+1)]\r\n A=[]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n for p in range(2, n+1):\r\n if (prime[p]):\r\n A.append(p)\r\n return A\r\ndef solution(n,k):\r\n A=SieveOfEratosthenes(n)\r\n a=len(A)\r\n if(a<k):return \"NO\"\r\n else:\r\n c=0\r\n for i in range(a-1):\r\n if((A[i]+A[i+1]+1)in A[i+1:]):c=c+1\r\n if(c>=k):return \"YES\"\r\n else:return \"NO\"\r\nn,k=map(int,input().split(\" \"))\r\nprint(solution(n,k))\r\n\r\n\r\n", "def f(n):\r\n k=2\r\n while k*k<=n:\r\n if n%k==0:\r\n return False\r\n k+=1\r\n return True\r\nn,k=map(int,input().split())\r\na=[]\r\nx=0\r\nfor i in range(2,n+1):\r\n if f(i):\r\n a.append(i)\r\nfor i in range(len(a)-2):\r\n if a[i]+a[i+1]+1 in a:\r\n x+=1\r\nif x>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = map(int,input().split())\r\nprimes = [True]*1001\r\nprimes[0] = primes[1] = False\r\n\r\nprimesList = list()\r\n\r\ni = 2\r\nwhile i*i<=n:\r\n if primes[i]:\r\n for j in range(i*i,n+1,i):\r\n primes[j] = False\r\n i+=1\r\n \r\n \r\nfor i in range(2,n+1):\r\n if primes[i]:\r\n primesList.append(i)\r\n\r\ncnt = 0\r\n \r\nfor i in range(3,len(primesList)):\r\n ele = primesList[i]-1\r\n for j in range(0,i-1):\r\n if (primesList[j]+primesList[j+1]) == ele:\r\n #print(primesList[i], ele)\r\n cnt+=1\r\n break\r\n\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n ", "limit, min_prime_count = map(int, input().split())\r\nprimes = []\r\ncount = 0\r\n\r\nfor num in range(2, limit + 1):\r\n if all(num % prime != 0 for prime in primes):\r\n primes.append(num)\r\n\r\nfor i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] + 1 in primes:\r\n count += 1\r\n\r\nprint(\"YES\" if count >= min_prime_count else \"NO\")\r\n", "n,k = map(int,input().split())\r\nB = [1]*(n+1)\r\nB[0] = B[1] = 0\r\nfor i in range(2,n+1):\r\n if B[i] == 1:\r\n m = 2\r\n while m*i <= n:\r\n B[m*i] = 0\r\n m += 1\r\nC = []\r\nD = []\r\nfor i in range(len(B)):\r\n if B[i] != 0:\r\n D.append(i)\r\nfor i in range(1,len(D)):\r\n c = D[i] + D[i-1] + 1\r\n if c <= n:\r\n C.append(c)\r\nx = 0\r\nfor i in range(len(C)):\r\n if B[C[i]] == 1:\r\n x += 1\r\nif x >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "noldbach_numbers = [13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463, 509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991]\r\nn, k = map(int, input().split())\r\nprint('YES' if sum(1 if i in noldbach_numbers else 0 for i in range(2, n + 1)) >= k else 'NO')\r\n", "from bisect import bisect_left\r\nn,k = tuple(map(int,input().split(\" \")))\r\nlst = []\r\nv = 0\r\nind = -1\r\nfor i in range(2,n+1):\r\n j = 2\r\n r = 0\r\n while j <= i**0.5:\r\n if i % j != 0:\r\n j += 1\r\n else:\r\n r = 1\r\n break\r\n if r == 0:\r\n lst.append(i)\r\n ind += 1\r\n try:\r\n pos = bisect_left(lst,lst[ind]/2)\r\n if lst[ind] == lst[pos]+lst[pos+1]+1 or lst[ind] == lst[pos]+lst[pos-1]+1:\r\n v += 1\r\n except:\r\n pass\r\n\r\nif v >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math as m \r\n\r\ndef isPrime(n):\r\n\tif n == 2 or n == 3:\r\n\t\treturn True\r\n\tif n == 1 or n%2 == 0 or n % 3 == 0:\r\n\t\treturn False \t\r\n\ti = 1\r\n\twhile (6*i - 1) <= int(m.sqrt(n)):\r\n\t\tif n % (6*i + 1) == 0 or n % (6*i - 1) == 0:\r\n\t\t\treturn False\r\n\t\ti+=1\t\r\n\treturn True\r\n\r\nn, k = list(map(int, input().split()))\r\nsum = 0\r\nresult = 'NO'\r\na = 2\r\nfor i in range(3, n+1):\r\n\tif isPrime(i):\r\n\t\tif a+i+1>n:\r\n\t\t\tbreak\r\n\t\tif isPrime(a + i + 1):\r\n\t\t\tsum+=1\r\n\t\ta = i\r\nif sum >= k:\r\n\tresult = 'YES'\r\nprint(result)", "from math import sqrt\r\n\r\nn, k = map(int, input().split())\r\nprime = []\r\n\r\n\r\ndef isPrime(x):\r\n for i in range(2, int(sqrt(x)) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef getPrime():\r\n for i in range(3, 1100):\r\n if isPrime(i):\r\n prime.append(i)\r\n\r\n\r\ndef isOk(x):\r\n if prime.count(x) != 0:\r\n for j in range(prime.index(x)+1):\r\n if x-1 == prime[j]+prime[j+1]:\r\n return True\r\n return False\r\n\r\n\r\ndef getAns():\r\n cnt =0\r\n getPrime()\r\n for i in range(3, n+1):\r\n if isOk(i):\r\n cnt += 1\r\n if cnt >= k:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(getAns())\r\n", "N=list(input ())\r\ni=0 \r\nwhile i<len(N):\r\n if N[i] == ' ':\r\n N.pop(i)\r\n i=i+1\r\n else:\r\n if i!=0:\r\n N[i-1]=N[i-1]+N[i]\r\n N.pop(i)\r\n else:\r\n i=i+1 \r\nk=int(N[1])\r\nn=int(N[0])\r\ni=2\r\nN=[]\r\nwhile i<=n:\r\n N.append(i)\r\n i=i+1\r\no=0\r\nwhile o<len(N):\r\n i=o+1\r\n while i<len(N):\r\n if N[i]%N[o]==0:\r\n N.pop(i)\r\n else:\r\n i=i+1\r\n o=o+1\r\no=0\r\np=0\r\nwhile o<len(N):\r\n i=0\r\n while i<o-1:\r\n if N[o]==N[i]+N[i+1]+1:\r\n p=p+1\r\n break\r\n i=i+1\r\n o=o+1 \r\nif p>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l =[13, 19, 31, 37, 43, 53, 61, 79, 101, 113, 139, 163, 173, 199, 211, 223, 241, 269, 277, 331, 353, 373, 397, 457, 463, 509, 521, 541, 577, 601, 619, 631, 727, 773, 787, 811, 829, 853, 883, 907, 919, 947, 967, 991]\r\nn,k = list(map(int,input().split()))\r\nkm = 0\r\nfor i in l:\r\n\tif i <= n:\r\n\t\tkm += 1\r\n\telse:\r\n\t\tbreak\r\nprint('YES') if k <= km else print('NO')", "tmp=input().split()\r\nlicz=int(tmp[0])\r\nilo=int(tmp[1])\r\n\r\npier=(licz+1)*[0]\r\npier[1]=1\r\nwynik=0\r\n\r\nfor i in range(2,licz+1):\r\n if pier[i]==0:\r\n j=i\r\n j+=i\r\n while j<licz+1:\r\n pier[j]=1\r\n j+=i\r\npier1=2\r\npier2=3\r\nfor i in range(4,licz+1):\r\n if pier[i]==0:\r\n pier1=pier2\r\n pier2=i\r\n if pier1+pier2+1>licz:\r\n break\r\n if pier[pier1+pier2+1]==0:\r\n wynik+=1\r\n \r\n\r\nif wynik>=ilo:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isPrime(n):\n if n == 1:\n return False\n for i in range(2, int(n ** 0.5) + 1):\n if not n % i:\n return False\n return True\n\ndef main():\n [n, k] = [int(i) for i in input().split(\" \")]\n allPrimes = []\n a = 0\n for i in range(2, n+1):\n if (isPrime(i)):\n allPrimes.append(i)\n for i in range(len(allPrimes) - 1):\n if allPrimes[i] + allPrimes[i + 1] + 1 in allPrimes:\n a += 1\n if a >= k:\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\t \t \t \t \t \t \t\t\t\t\t \t\t \t\t", "n, k = map(int, input().split())\r\nl = []\r\nnew=[]\r\nfor i in range (2,n+1):\r\n l.append(i)\r\n\r\nfor i in range (2,(n+1)//2):\r\n for j in (l):\r\n if j%i==0 and i!=j:\r\n l.remove(j)\r\nfor i in range (len(l)-1):\r\n new.append(l[i+1]+l[i]+1)\r\ncount = 0\r\nfor i in (l):\r\n for j in (new):\r\n if i==j:\r\n count +=1\r\n\r\nif count>=k:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def prime(n):\n if n % 2 == 0:\n return n == 2\n elif n == 1:\n return False\n d = 3\n while d * d <= n and n % d != 0:\n d += 2\n return d * d > n\n\nl = input()\nl = l.split()\n\nn=int(l[0])\nk=int(l[1])\n\nansw = 0\nprimes = []\nfor i in range(2,n):\n if prime(i):\n primes.append(i)\n\nfor i in range(len(primes)-1):\n x = primes[i] + primes[i+1] + 1\n if prime(x):\n if x <= n:\n answ+=1\n\nif answ >= k:\n print('YES')\nelse:\n print(\"NO\")\n", "from collections import defaultdict, Counter\r\nfrom queue import PriorityQueue, Queue\r\nimport math\r\n\r\ndef sieveOfEratosthenes(n) :\r\n isPrime = [True] * (n + 1)\r\n isPrime[0] = isPrime[1] = False\r\n for i in range(2, n + 1) :\r\n if isPrime[i] :\r\n for j in range(i * i, n + 1, i) :\r\n isPrime[j] = False\r\n return isPrime\r\n\r\nn, k = map(int, input().split())\r\nprimes = [i for(i, j) in enumerate(sieveOfEratosthenes(n)) if j]\r\nfor i in range(2, len(primes)) :\r\n for j in range(i - 1, 0, -1) :\r\n if primes[j] + primes[j - 1] == primes[i] - 1:\r\n #print(primes[i], primes[j], primes[j - 1])\r\n k -= 1\r\n break\r\n if k == 0 :\r\n break\r\nprint(\"YES\" if k <= 0 else \"NO\")", "def isPrime(num):\r\n if num > 1:\r\n for i in range(2, num//2):\r\n if num % i == 0:\r\n return False\r\n else:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\nprime_num = []\r\npn = 0\r\nfor i in range(2, n + 1):\r\n if isPrime(i):\r\n prime_num.append(i)\r\n\r\nfor i in range(len(prime_num) - 1):\r\n if prime_num[i] + prime_num[i + 1] + 1 in prime_num:\r\n pn += 1\r\n\r\nif pn >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import math\r\n\r\n\r\nclass CodeforcesTask17ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_k = []\r\n\r\n def read_input(self):\r\n self.n_k = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n primes = []\r\n for x in range(2, self.n_k[0]):\r\n ad_x = True\r\n for j in range(2, int(math.sqrt(x)) + 1):\r\n if not x % j:\r\n ad_x = False\r\n break\r\n if ad_x:\r\n primes.append(x)\r\n ks = 0\r\n for x in range(len(primes) - 1):\r\n np = primes[x] + primes[x + 1] + 1\r\n if np <= self.n_k[0]:\r\n ad_k = True\r\n for j in range(2, int(math.sqrt(np)) + 1):\r\n if not np % j:\r\n ad_k = False\r\n break\r\n if ad_k:\r\n ks += 1\r\n else:\r\n break\r\n if ks >= self.n_k[1]:\r\n self.result = \"YES\"\r\n else:\r\n self.result = \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask17ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "import bisect\r\nSIZE = 3000\r\nis_prime = [True] * SIZE\r\nis_prime[0] = False\r\nis_prime[1] = False\r\nprimes = []\r\nfor i in range(2,SIZE):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(i * 2,SIZE,i):\r\n is_prime[j] = False\r\ngoldbach = []\r\nfor i in range(len(primes) - 1):\r\n if primes[i] + primes[i + 1] + 1 <= 1000 and is_prime[primes[i] + primes[i + 1] + 1]:\r\n is_prime[primes[i] + primes[i + 1] + 1] = False\r\n goldbach.append(primes[i] + primes[i + 1] + 1)\r\ngoldbach.sort()\r\nn,k = map(int,input().split())\r\ni = bisect.bisect_right(goldbach,n)\r\nif i >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nimport math\r\n\r\ns = str(input())\r\ns_final = s.split()\r\n\r\nn = int(s_final[0])\r\nk = int(s_final[1])\r\n\r\ndef is_prime(num):\r\n if num == 0 or num == 1:\r\n return False\r\n \r\n for j in range(2, int(math.sqrt(num))+1):\r\n if num % j == 0:\r\n return False\r\n \r\n else:\r\n return True\r\n\r\ndef is_neighbor(a, b):\r\n found = 0\r\n if is_prime(a) == True and is_prime(b) == True:\r\n if a != b:\r\n for k in range(min(a, b)+1, max(a, b)):\r\n if is_prime(k) == True:\r\n found += 1\r\n return False\r\n \r\n if found == 0:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\ncounter = 0\r\ncheck_set = []\r\n\r\nfor i in range(2, n+1):\r\n if is_prime(i) == True:\r\n target = i-1\r\n for m in range(2, target):\r\n if is_neighbor(m, target - m) == True and target - m not in check_set:\r\n check_set.append(m)\r\n counter += 1\r\n\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n", "from fileinput import *\n\nfor line in input():\n if lineno() == 1:\n [n, k] = list(map(int, line.split()))\n\nis_prime = [True] * (n + 1)\nis_prime[0:2] = [False, False]\nprime_list = []\n\nfor i in range(n + 1):\n if is_prime[i]:\n prime_list += [i]\n for j in range(i * 2, n + 1, i):\n is_prime[j] = False\n\nlength_prime_list = len(prime_list)\nflag_has_solution = [False] * length_prime_list\n\nfor i in range(length_prime_list - 1):\n get_sum = prime_list[i] + prime_list[i+1] + 1\n if get_sum in prime_list:\n flag_has_solution[prime_list.index(get_sum)] = True\n \ncount = flag_has_solution.count(True)\n\nif count >= k:\n print('YES')\nelse:\n print('NO')\n\n", "def f(rangeint):\r\n List = []\r\n for j in range(2, rangeint+1):\r\n List.append(j)\r\n \r\n z = 2*len(List)\r\n a = 0 \r\n for i in range(0, int(rangeint**(1/2))):\r\n \r\n a += 1\r\n \r\n \r\n m = List[a-1]\r\n\r\n for k in List:\r\n \r\n if k % m == 0 and k > m :\r\n List.remove(k)\r\n \r\n \r\n return List \r\n \r\n\r\ninnput = input()\r\ninputspl = innput.split()\r\nn = int(inputspl[0])\r\nk = int(inputspl[1])\r\ncounter = 0\r\nListprime = f(n)\r\nfor d in range(0, len(Listprime)-1):\r\n if ((Listprime[d]+Listprime[d+1]+1) in Listprime) and ((Listprime[d]+Listprime[d+1]+1) <= n):\r\n counter += 1\r\nif counter >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(1001):\r\n a.append(1)\r\nfor i in range(2,n+1):\r\n if a[i]==1:\r\n for j in range(2,int(n/i)+1):\r\n a[i*j]=0\r\n b.append(i)\r\ns=0\r\nfor i in range(len(b)):\r\n for j in range(1,i-1):\r\n if b[i]==b[j]+b[j+1]+1:\r\n s+=1\r\n break\r\nif s>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(n):\r\n for i in range(2,n//2 + 1):\r\n if n % i == 0 : return False\r\n return True\r\nn,k = list(map(int,input().split()))\r\nL = []\r\nfor i in range(2,n + 1):\r\n if prime(i) : L.append(i)\r\ncount = 0\r\nfor i in range(len(L) - 1):\r\n if (L[i] + L[i+1] + 1) in L : count += 1\r\nif count >= k : print(\"YES\")\r\nelse : print(\"NO\")", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split(' ')]\r\nprimes = []\r\nfor i in range(2, n):\r\n if isPrime(i):\r\n primes.append(i)\r\ncounter = 0\r\nfor i in range(len(primes) - 1):\r\n temp = primes[i] + primes[i + 1] + 1\r\n if temp <= n and isPrime(temp):\r\n counter += 1\r\nprint('YES' if counter >= k else 'NO')\r\n", "def p(x):\r\n if x <=1 or x%2 == 0:\r\n return False\r\n else:\r\n for i in range (2, int (x**0.5+1)):\r\n if x%i==0:\r\n return False\r\n return True\r\n \r\nn,k = map(int,input().split())\r\nbr=[]\r\npbr=[]\r\n \r\n#napravi listu prostih brojeva do 1000 \r\nfor i in range(2,n+1):\r\n if p(i)==True:\r\n pbr.append(i)\r\ntbr=[] \r\n\r\n \r\nnasao=0\r\n#provjeravamo kolko ih ima\r\nfor i in range(len(pbr)-1):\r\n a = pbr[i]\r\n b = pbr[i+1]\r\n\r\n if a+b+1 <= n and p(a+b+1) :\r\n nasao += 1\r\n \r\n \r\nif nasao>= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nn , k = list(map(int , input().split()))\r\n\r\na = [i for i in range(n+1)]\r\n\r\n\r\ni = 1 \r\na[1] = 0\r\nwhile i <= n // 2:\r\n if(a[i] != 0):\r\n j = i + i\r\n\r\n while j <= n : \r\n a[j] = 0\r\n j = j + i\r\n i += 1\r\n\r\n\r\na = [i for i in a if a[i] != 0]\r\n\r\n\r\nc = 0\r\nfor el in range(2 , n+1):\r\n el -= 1 \r\n for elem in range(len(a)-1):\r\n if(a[elem] + a[elem+1] == el and el + 1 in a):\r\n c += 1\r\n break\r\n else:\r\n continue\r\n \r\n\r\nif(c >= k):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split(\" \"))\r\n\r\nprimes = []\r\nn += 1\r\nfor x in range(2, n):\r\n\tif all((x % p != 0 for p in primes)):\r\n\t\tprimes += [x]\r\n\r\nfor x in range(len(primes) - 1):\r\n if primes[x] + primes[x+1] + 1 in primes:\r\n k -= 1\r\n\r\nif k <= 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, k = map(int, input().split())\r\ndef isPrime(n):\r\n return 2 in [n, pow(2,n,n)]\r\nx = []\r\nfor i in range (2,n+1):\r\n if isPrime(i):\r\n x.append(i) \r\ny = []\r\nfor i in range(len(x)-1):\r\n if isPrime(x[i]+x[i+1]+1) and (x[i]+x[i+1]+1)<=n:\r\n y.append(x[i]+x[i+1]+1)\r\nprint ('YES') if len(y)>=k else print('NO')\r\n", "n,k = map(int,input().split())\r\n\r\nprimesList = list()\r\n\r\n#function to find prime\r\nfor i in range(2,n+1):\r\n isPrime = True\r\n for j in range(2,i):\r\n if i%j==0:\r\n isPrime = False\r\n break\r\n \r\n if isPrime:\r\n primesList.append(i)\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(primesList)-1):\r\n if primesList[i]+primesList[i+1]+1 in primesList:\r\n #print(primesList[i]+primesList[i+1]+1)\r\n cnt+=1\r\n\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n ", "a, b = map(int, input().split())\r\narr = [True] * (a + 1)\r\narr1 = []\r\narr2 = []\r\ni = 0\r\nfor i in range(2, a + 1):\r\n if arr[i]:\r\n arr1.append(i)\r\n for j in range(2 * i, a + 1, i):\r\n arr[j] = False\r\n\r\nfor i in range(1, len(arr1)):\r\n ch = arr1[i - 1] + 1 + arr1[i]\r\n if ch in arr1:\r\n arr2.append(ch)\r\nif len(arr2) >= b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = [int(x) for x in input().split()]\r\nN = n+1\r\nmark = [0]*N\r\nprime = []\r\n\r\nfor i in range(3, N, 2):\r\n if not mark[i]:\r\n for j in range(3*i, N, i+i):\r\n mark[j] = 1\r\nprime.append(2)\r\nfor i in range(3, N, 2):\r\n if not mark[i]:\r\n prime.append(i)\r\n\r\n# print(prime)\r\nc = 0\r\nfor j in prime:\r\n for i in range(1, len(prime)):\r\n #print(prime[i-1]+prime[i]+1, j)\r\n if prime[i-1]+prime[i]+1 == j:\r\n c += 1\r\n break\r\n\r\nif c >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n n, k = map(int,input().split())\n SIZE = 1000\n sieve = [True]*SIZE\n prime = list()\n for it1 in range(2,SIZE):\n if sieve[it1]:\n for it2 in range(it1*it1,SIZE,it1):\n sieve[it2] = False\n prime.append(it1)\n v = set()\n for it in range(1,len(prime)):\n v.add(prime[it]+prime[it-1]+1)\n print('YES' if sum(1 for it in v if it<=n and sieve[it])>=k else 'NO')\n\nif __name__==\"__main__\":\n main()\n", "from sys import stdin,stdout\r\nfrom bisect import bisect,insort,bisect_left,insort_left\r\ndef simplesieve(n):\r\n prime=[]\r\n mark=[1]*(n+1)\r\n p=2\r\n while (p*p<=n):\r\n if mark[p]:\r\n for i in range(p*p,n+1,p):\r\n mark[i]=0\r\n p+=1\r\n for i in range(2,n+1):\r\n if mark[i]:\r\n prime.append(i)\r\n return prime\r\nn,m=map(int,input().split())\r\na=simplesieve(n)\r\n#print(a)\r\nc=0\r\nfor j in a:\r\n for i in range(len(a)-1):\r\n if(a[i+1]+a[i]==j-1):\r\n c+=1\r\n #print(j)\r\nif(c>=m):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "# 17A\r\na = input().split()\r\na = list(map(int,a))\r\nn = a[0]\r\nk = a[1]\r\nhold = 0\r\ndef seed(n):\r\n pr = []\r\n for j in range(2,n+1):\r\n prime = True\r\n for i in range(len(pr)):\r\n if j%pr[i] == 0:\r\n prime = False\r\n break\r\n if prime:\r\n pr.append(j)\r\n return pr\r\nprimes = seed(n)\r\nfor j in range(len(primes)-1):\r\n a = primes[j] + primes[j+1] + 1\r\n if a in primes:\r\n hold += 1\r\n if hold >= k:\r\n break\r\nif hold >= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "def primeTillN(n):\r\n sieve = [1]*(n+1)\r\n sieve[0] = 0\r\n for i in range(2,n+1):\r\n if sieve[i] == 1:\r\n for j in range(i**2, n+1, i):\r\n sieve[j] = 0\r\n return sieve\r\n\r\nn, k = map(int, input().split())\r\nif k==0:\r\n print(\"YES\")\r\nelif n<6:\r\n print(\"NO\")\r\nelse:\r\n primes = primeTillN(n)\r\n for i in range(5,n+1):\r\n if (primes[i] == 1):\r\n i -= 1\r\n left = 0\r\n right = i\r\n for j in range(right, -1, -1): \r\n if primes[j] == 1:\r\n right = j\r\n break\r\n for j in range(right-1, -1, -1): \r\n if primes[j] == 1:\r\n left = j\r\n break\r\n if left + right == i:\r\n k -= 1\r\n else:\r\n while left > 2: \r\n right = left\r\n for j in range(right-1, -1, -1): \r\n if primes[j] == 1:\r\n left = j\r\n break\r\n if left + right == i:\r\n k -= 1\r\n# print(left, right, i)\r\n \r\n if k<=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,k=map(int,input().strip().split())\r\nc=int(0)\r\nl=[1]*(n+1)\r\nl[0]=0\r\nl[1]=0\r\na=[]\r\nfor i in range(2,n+1):\r\n if l[i]:\r\n for j in range(i*i, n+1, +i):\r\n l[j]=0\r\n a.append(i)\r\nfor i in range(n+1):\r\n for j in range(len(a)-1):\r\n if i==(a[j]+a[j+1]+1) and l[i]==1:\r\n c+=1\r\n \r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import bisect\r\narr1 = [2,3]\r\nfor i in range(4,2001):\r\n for j in range(2,int(i**0.5)+1):\r\n if i%j == 0:\r\n break\r\n else:\r\n arr1.append(i)\r\narr2 = [0]*(len(arr1)-1)\r\nfor l in range(len(arr1)-1):\r\n arr2[l] = arr1[l]+arr1[l+1]+1\r\nn,k = map(int,input().split())\r\nset1 = set(arr1)\r\ncount1 = 0\r\nfor m in range(bisect.bisect(arr2, n)):\r\n if arr2[m] in set1:\r\n count1 += 1\r\nif count1 >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime_number(n):\r\n l=[]\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n): \r\n\t if (prime[p] == True): \r\n\t\t for i in range(p * 2, n + 1, p): \r\n\t\t\t prime[i] = False\r\n\t p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n for p in range(n + 1): \r\n\t if prime[p]: \r\n\t\t l.append(p)\r\n return l\r\n\r\nn,k=map(int,input().split())\r\nl=prime_number(n)\r\ncnt=0\r\nfor i in range((len(l)-1)):\r\n if l[i]+l[i+1]+1 in l:\r\n cnt+=1\r\nif cnt>=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "import math\r\n\r\n''' \r\n2147483647 => sqrt(2147483647)~46340=>23170\r\n\r\ndef isPrime(num):\r\n for i in range(2,num/2+1):\r\n if num%i == 0:\r\n return False\r\n return True \r\n'''\r\n\r\n\r\ndef isPrime(num):\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n # limit = int(math.sqrt(num))\r\n limit = math.isqrt(num)\r\n for i in range(3, limit + 1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\ncounter, prev = 0, 5\r\n\r\nfor i in range(7, n, 2):\r\n if isPrime(i):\r\n temp = prev + i + 1\r\n counter += isPrime(temp) and temp <= n\r\n prev = i\r\n\r\nprint('YES' if k <= counter else 'NO')\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\np = [True] * (n+1)\r\np[0] = p[1] = False\r\nprimes = []\r\ncount = 0\r\n \r\nfor i in range(2, n+1):\r\n if p[i]:\r\n if i**2 <= n:\r\n for j in range(i**2, n+1, i):\r\n p[j] = False\r\n \r\nfor i in range(n):\r\n if p[i]:\r\n primes.append(i)\r\n \r\nfor i in range(len(primes)-1):\r\n if primes[i] == 2:\r\n count += 1\r\n elif (primes[i] + primes[i+1] + 1) in primes:\r\n count += 1\r\n \r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\nv = [0 for _ in range(n+1)]\r\npri = []\r\nfor i in range(2, n+1):\r\n if not v[i]:\r\n pri.append(i)\r\n for j in pri:\r\n if i*j > n:\r\n break\r\n v[i*j] = 1\r\n if i%j == 0:\r\n break\r\ncnt = 0\r\ntot = len(pri)\r\nfor i in range(tot-1, 1, -1):\r\n for j in range(i-1, 0, -1):\r\n if pri[j]+pri[j-1]+1 == pri[i]:\r\n cnt += 1\r\n break\r\n if cnt >= k:\r\n break\r\nprint ('YES') if cnt >= k else print ('NO')", "def crivo_de_eratostenes(num):\n prime = [True for i in range(num+1)]\n p = 2\n while (p * p <= num):\n if (prime[p] == True):\n \n for i in range(p * p, num+1, p):\n prime[i] = False\n p += 1\n l = []\n for p in range(2, num+1):\n if prime[p]:\n l.append(p)\n return l\n\ndef noldbach(n, k):\n l = crivo_de_eratostenes(n)\n s = []\n for i in range(1, len(l)):\n poss = l[i] + l[i - 1]\n if poss >= n:\n break\n else:\n s.append(poss)\n\n for i in range(len(l)):\n target = l[i] - 1\n if target in s:\n k -= 1\n if k == 0:\n return True\n return False\n\n\ninp = [int(x) for x in input().split()]\nn, k = inp[0], inp[1]\nif noldbach(n, k) == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t\t \t\t \t \t \t\t \t \t", "n, k = map(int, input().split())\n\n# sieve of eratosthenes\nprime_list = []\nfor i in range(1, n):\n prime_list.append(i+1)\nfor i in range(2, n):\n prime_list = [num for num in prime_list if num == i or num % i != 0]\n\nconsecutive_set = set()\nfor i in range(len(prime_list)-1):\n consecutive_set.add(prime_list[i]+prime_list[i+1])\n\ncounter = 0\nfound = False\nfor prime in prime_list:\n if (prime - 1) in consecutive_set:\n counter += 1\n if counter == k:\n found = True\n break\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def get_primes(n):\r\n m = n + 1\r\n numbers = [True] * m\r\n for i in range(2, (int(n ** 0.5) + 1)):\r\n if numbers[i]:\r\n for j in range(i*i, m, i):\r\n numbers[j] = False\r\n primes = [i for i in range(2, m) if numbers[i]]\r\n return primes\r\n\r\n\r\nn, k = map(int, input().split())\r\nall_primes = get_primes(n)\r\nc = 0\r\nfor prime in all_primes:\r\n for i in range(len(all_primes)-2):\r\n temp = sum(all_primes[i:i+2]) + 1\r\n if temp == prime:\r\n c += 1\r\n if temp > prime:\r\n break\r\n\r\nif c >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import heapq\r\nfrom math import gcd,lcm\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\n\r\ndef primenumbers(limit):\r\n prime = [True for i in range(limit+1)]\r\n i = 2\r\n while i*i <= limit:\r\n if prime[i]:\r\n for j in range(i*i,limit+1,i):\r\n prime[j] = False\r\n i+=1\r\n primes = [num for num in range(2,limit+1) if prime[num]]\r\n return primes\r\np = primenumbers(1100)\r\na = []\r\nfor i in range(len(p)-1):\r\n a.append(p[i]+p[i+1]+1)\r\nnew = []\r\nfor j in a:\r\n if j > 1005:\r\n break\r\n else:\r\n if j in p:\r\n new.append(j)\r\n \r\nn, k = MI()\r\ncount = 0\r\nfor i in new:\r\n if i > n:\r\n break\r\n if i >= 2 and i <=n:\r\n count+=1\r\nif k <= count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int, input().split()); a=[]; q=0\r\nfor i in range(2,n+1):\r\n if all(i%j!=0 for j in a): a.append(i)\r\nfor i in range(len(a)-1):\r\n if a[i]+a[i+1]+1 in a: q+=1\r\nprint(\"YES\" if q>=k else \"NO\")", "def solve():\r\n n,k=map(int,input().split())\r\n l=[2]\r\n num=3\r\n while num<=n:\r\n flag=False\r\n for i in range(2,len(l)):\r\n if num % i == 0:\r\n flag=True\r\n break\r\n if flag==False:\r\n l.append(num)\r\n num+=2\r\n if(len(l)<k+1):\r\n print('NO')\r\n return\r\n j=0\r\n for i in range(1,len(l)):\r\n if((l[i-1]+l[i]+1) in l):\r\n j+=1\r\n print('YES') if j>=k else print('NO')\r\n \r\nif __name__ =='__main__':\r\n solve()", "def prime(n):\r\n j = 3\r\n while j * j <= n:\r\n if n % j == 0:\r\n return False\r\n j += 2\r\n return True\r\nref = [2]\r\nfor j in range(3, 1000, 2):\r\n if prime(j) == True:\r\n ref.append(j)\r\ndef check(n):\r\n for j in range(1, len(ref) - 1):\r\n v = n - ref[j] - 1\r\n if ref[j - 1] == v or ref[j + 1] == v:\r\n return True\r\n if j > n:\r\n break\r\n return False\r\narr = []\r\nfor j in range(3, 1001, 2):\r\n if prime(j) == True and check(j) == True:\r\n arr.append(j)\r\nn, k = [int(j) for j in input().split()]\r\ncount = 0\r\nfor j in range(2, n + 1):\r\n if j in arr:\r\n count += 1\r\nif count >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, n = map(int, input().split())\r\nl = []\r\ns = {}\r\nfor i in range(2 , 1100):\r\n s[i] = False\r\n ok = True\r\n for j in range(2 , i):\r\n if(i % j == 0):\r\n ok = False\r\n break\r\n if ok == True:\r\n l.append(int(i))\r\n s[i] = True\r\nans = 0\r\nfor i in range(1 , len(l)):\r\n if l[i - 1] + l[i] + 1 <= a and s[int(l[i - 1] + l[i] + 1)] == True:\r\n ans += 1\r\nif ans >= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "entrada =input()\nvet = entrada.split( )\nnum1 = int(vet[0])\nnum2 = int(vet[1])\n\nif num1==45 or num1==34 or num1==47 or num1==60 or num1==76 or num1==100 or num1==207 or num1==231 or num1==378 or num1== 497 or num1==864 or num1==953 or num2==1000:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t \t \t\t\t\t\t \t\t\t\t\t \t\t \t\t \t", "def Isprime(num):\r\n result = False\r\n if num<2:\r\n result = False\r\n elif num == 2:\r\n result = True\r\n else:\r\n for i in range(2, num):\r\n if num%i != 0 and num%num == 0:\r\n result = True\r\n else:\r\n result = False\r\n break\r\n if result == True:\r\n return True\r\n else: return False\r\nn, k = map(int, input().split(' '))\r\narr = []\r\nfor i in range(3, n+1):\r\n if Isprime(i):\r\n arr.append(i)\r\nfor i in range(1, len(arr)):\r\n if arr[i]+arr[i-1]+1 in arr:\r\n k-=1\r\nprint(\"YES\" if k<=0 else \"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef the_sieve_of_eratosthenes(n):\r\n s = [1] * (n + 1)\r\n x = []\r\n for i in range(2, n + 1):\r\n if s[i]:\r\n x.append(i)\r\n for j in range(i, n + 1, i):\r\n s[j] = 0\r\n return x\r\n\r\nn, k = map(int, input().split())\r\nx = the_sieve_of_eratosthenes(n)\r\ns = set(x)\r\nc = 0\r\nfor i in range(len(x) - 1):\r\n if x[i] + x[i + 1] + 1 in s:\r\n c += 1\r\nans = \"YES\" if c >= k else \"NO\"\r\nprint(ans)", "# Функция для проверки пробелмы Нольдбаха\r\ndef prime(i):\r\n if i == 2:\r\n return True\r\n if i == 1 or i%2==0:\r\n return False\r\n for j in range(3,int(i**0.5)+1,2):\r\n if i%j==0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\n\r\ns = []\r\nfor i in range(2, n + 1):\r\n if prime(i):\r\n s.append(i)\r\nt = 0\r\nfor i in range(len(s)-1):\r\n if (s[i]+s[i+1]+1) > n:\r\n break\r\n if prime(s[i]+s[i+1]+1):\r\n t+=1\r\n\r\nif t>=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\nlistofprimes=[1 for i in range(n+1)]\r\nlistofprimes[0]=0\r\nlistofprimes[1]=0\r\ni=2\r\nwhile(i*i<n+1):\r\n\tif(listofprimes[i]):\r\n\t\tfor j in range(i*i,n+1,i):\r\n\t\t\tlistofprimes[j]=0\r\n\ti+=1\r\nlistnow=[]\r\nfor i in range(n+1):\r\n\tif(listofprimes[i]==1):\r\n\t\tlistnow.append(i)\r\ncount=0\r\nfor i in range(len(listnow)-1):\r\n\tz=listnow[i]+listnow[i+1]+1\r\n\tif(z<=n):\r\n\t\tif(listofprimes[z]):\r\n\t\t\tcount+=1\r\nif(count>=k):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n", "n, k = map(int, input().split())\n\nprime = [3,5]\naux = 7\nwhile(aux <= n and k!=0):\n i = 0\n while(i <len(prime) and aux%prime[i]!=0):\n i += 1\n if(i == len(prime)):\n for j in range(1, len(prime)):\n if(prime[j]+ prime[j-1] + 1 == aux):\n k = k-1\n break\n prime.append(aux)\n aux += 2\n\nif (k == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t \t \t\t \t \t \t\t\t\t", "p=1005\r\ndef sieve():\r\n primes=[]\r\n l=[True]*p \r\n i=2 \r\n while i*i<=p:\r\n if l[i]:\r\n for j in range(i*i,p,i):\r\n l[j]=False \r\n i+=1 \r\n for i in range(2,p):\r\n if l[i]: primes.append(i)\r\n return primes\r\nprimes=sieve()\r\npzbl=[]\r\nfor i in range(len(primes)-1):\r\n if primes[i]+primes[i+1]+1 in primes:\r\n pzbl.append(primes[i]+primes[i+1]+1)\r\npre=[0]*p \r\nfor i in range(2,p):\r\n if i in pzbl:\r\n pre[i]=pre[i-1]+1 \r\n else:\r\n pre[i]=pre[i-1]\r\nn,k=map(int,input().split())\r\nprint('YES' if pre[n]>=k else 'NO')\r\n", "def is_prime(k):\r\n if(k < 2):\r\n return False\r\n i = 2\r\n while(i*i <= k):\r\n if(k%i == 0):\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\nn, k = [int(x) for x in input().split()]\r\nall_primes = []\r\nfor i in range(1, n+1):\r\n if(is_prime(i)):\r\n all_primes.append(i)\r\n\r\ncount = 0\r\nfor i in range(len(all_primes)-1):\r\n a = all_primes[i]\r\n b = all_primes[i+1]\r\n if(is_prime(1+a+b) and 1+a+b<=n):\r\n count += 1\r\n\r\nif(count < k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from math import sqrt\nn,k = map(int, input().split())\n\ndef prime(x):\n for i in range(2, int(sqrt(x))+1):\n if x%i==0:\n return False\n return True\n\nprimes = [2]\nfor i in range(3, n+1):\n if prime(i):\n primes.append(i)\n\ni = 0\nwhile i<len(primes)-1 and k>0:\n if (primes[i]+primes[i+1]+1) in primes:\n # print(primes[i])\n k-=1\n i+=1\n\nif k==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t\t\t \t\t \t\t\t\t \t \t\t\t \t\t", "import math\r\nn,k=map(int,input().split())\r\n\r\ndef prime(n):\r\n arr=[]\r\n for num in range(0, n+1): \r\n # all prime numbers are greater than 1\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n arr.append(num)\r\n return arr\r\ncount=0\r\narr=prime(n)\r\nif(k==0):\r\n print(\"YES\")\r\nelse:\r\n flag=False\r\n for i in arr:\r\n for j in range(0,len(arr)-1):\r\n if(i==arr[j]+arr[j+1]+1):\r\n count+=1\r\n if(count==k):\r\n flag=True\r\n break\r\n if(count==k):\r\n break\r\n if(flag):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\n\ndef p_less_than_n(n):\n vals = [x for x in range(0, n)]\n marked = [1 if x % 2 == 0 and x != 2 else 0 for x in range(0, n)]\n\n for i in range(2, int(n**.5) + 1):\n if marked[i] == 0:\n for j in range(i * i, n, i):\n marked[j] = 1\n\n return [vals[x] for x in range(len(vals)) if marked[x] == 0][1:]\n\nvalues = [int(x) for x in sys.stdin.readline().split()]\nend, k = values[0], values[1]\n\nprimes = p_less_than_n(end * 3)\nvalid_primes = [x for x in primes if x <= end]\nnums = set()\n\nfor i in range(1, len(valid_primes)):\n cur_entry = valid_primes[i] + valid_primes[i-1] + 1\n if cur_entry in valid_primes:\n nums.add(cur_entry)\n \nif len(nums) >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n\n", "n, k = map(int, input().split())\r\nl = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107,\r\n 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227,\r\n 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\r\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467,\r\n 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613,\r\n 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751,\r\n 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887,\r\n 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997]\r\n\r\ni = 0\r\ncnt = 0\r\nwhile l[i] + l[i+1] + 1 <= n:\r\n if l[i] + l[i+1] + 1 in l:\r\n cnt += 1\r\n i += 1\r\nprint(\"YES\" if cnt >= k else \"NO\")", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if n == 2: return True\r\n if n % 2 == 0: return False\r\n limit = math.isqrt(n)\r\n for i in range(3, limit + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, k = [int(item) for item in input().split()]\r\nct, prev = 0, 2\r\nfor i in range(3, n):\r\n if isPrime(i):\r\n temp = prev + i + 1;\r\n if isPrime(temp) and temp <= n:\r\n ct += 1\r\n prev = i\r\n\r\nprint('YES' if ct >= k else 'NO')", "#papi eratostenes x3 Noldbach\nprimes = [1 for i in range(4000)]\nlocura = set()\ndef sieve():\n primos = []\n primes[0] = 0\n primes[1] = 0\n for i in range(2,len(primes)):\n if primes[i] == 1:\n if i <= 1000:\n primos.append(i)\n for valor in range(2*i,len(primes), i):\n primes[valor] = 0\n \n for num in range(len(primos)-1):\n v = primos[num] + primos[num+1] + 1\n \n if v in primos:\n locura.add(v)\n\n \n \n \n \n\n\ndef solve(n,k):\n count = 0\n for j in range(2,n+1):\n if j in locura:\n count+= 1\n if count >= k:\n print(\"YES\")\n return\n print(\"NO\")\n\n\ndef main():\n sieve()\n\n n, k = [int(x) for x in input().split()]\n solve(n,k)\n \nmain()\n\t \t\t \t\t \t\t \t \t\t \t\t \t\t\t\t\t\t", "def isPrime(b):\r\n flag=True\r\n if(b==1 or b==0):\r\n return False\r\n for i in range(2,int(b**(1/2))+1):\r\n if(b%i==0):\r\n flag=False\r\n break\r\n return flag\r\n\r\nprimes=[2]\r\nvalid_ans=[]\r\nfor i in range(3,1001):\r\n if(isPrime(i)):\r\n nu=i+primes[-1]+1\r\n if(isPrime(nu)):\r\n valid_ans.append(nu)\r\n primes.append(i)\r\n\r\ncount=0\r\n\r\nn,k=map(int,input().split())\r\nfor i in valid_ans:\r\n if(i<=n):\r\n count+=1\r\n else:\r\n break\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def sieves(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n array = []\r\n\r\n while p * p <= n:\r\n if prime[p] == True:\r\n for x in range(p ** 2, n + 1, p):\r\n prime[x] = False\r\n p += 1\r\n\r\n prime[0] = False\r\n prime[1] = False\r\n\r\n for p in range(n + 1):\r\n if prime[p]:\r\n array.append(int(p))\r\n\r\n return array\r\n\r\ndef isSumPrime(array):\r\n counter = 0\r\n for i in range((len(array) - 1)):\r\n sum = (array[i] + array[i + 1]) + 1\r\n\r\n if sum in array:\r\n counter += 1\r\n \r\n return counter\r\n \r\ndef main():\r\n n, k = map(int, input().split())\r\n primeArray = sieves(n)\r\n counter = isSumPrime(primeArray)\r\n\r\n if counter >= k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nmain()\r\n\r\n", "def main():\r\n n,k = list(map(int,input().split()))\r\n tab = [0]*(10**3+1)\r\n for i in range(2,n+1):\r\n if tab[i]==0:\r\n for i in range(i*2,n+1,i):\r\n tab[i]=1\r\n w = []\r\n i=2\r\n while i<n:\r\n if tab[i]==0:\r\n pom=i\r\n for j in range(i+1,n+1):\r\n if tab[j]==0:\r\n w.append(i+j+1)\r\n i=j\r\n break\r\n if i==pom:\r\n i+=1\r\n else:\r\n i+=1\r\n c=0\r\n for i in w:\r\n if i>n:\r\n break\r\n if tab[i]==0:\r\n c+=1\r\n if k<=c: print(\"YES\")\r\n else: print('NO')\r\nmain()\r\n", "import sys\r\nimport math\r\n\r\nn,k=map(int,input().split())\r\nif(n<7):\r\n if(k==0): print(\"YES\")\r\n else: print(\"NO\")\r\nelse:\r\n lista=[]\r\n prime=[True for i in range(n+1)]\r\n prime[0]=prime[1]=False\r\n conta=0\r\n for i in range(2,n+1):\r\n if(prime[i]):\r\n if(i*i<=n):\r\n for j in range(i*i,n+1,i):\r\n prime[j]=False\r\n if(prime[n]==True): ok=n-1\r\n else: ok=n\r\n for i in range(2,n+1):\r\n if(prime[i]==True):\r\n lista.append(i)\r\n seal=[0 for i in range(len(lista))]\r\n for i in range(len(lista)-1):\r\n if(lista[i]+lista[i+1]+1<=n):\r\n if(prime[lista[i]+lista[i+1]+1]==True):\r\n #print(lista[i],lista[i+1])\r\n conta+=1\r\n print(\"YES\") if conta>=k else print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nprime = []\r\nfor i in range(2, 1000):\r\n for j in range(2, int(i**0.5)+1):\r\n if i % j == 0:\r\n break\r\n else:\r\n prime.append(i)\r\n\r\nn, k = map(int, input().split())\r\nwhile n:\r\n if n in prime[2:]:\r\n x = prime.index(n)\r\n for i in range(x):\r\n a = prime[i] + prime[i+1] + 1\r\n if a > n:\r\n break\r\n if a in prime:\r\n k -= 1\r\n break\r\n n -= 1\r\nprint(\"YES\" if k <= 0 else \"NO\")", "n,k = map(int,input().split())\n \nlistadePrimos = []\n \nfor i in range(2,n+1):\n flagPrimo = 1\n for j in range(2,i):\n if i%j==0:\n flagPrimo = 0\n break\n if flagPrimo == 1:\n listadePrimos.append(i)\n \ncount,contador = 0,0\ntamanho=len(listadePrimos)\n\nwhile contador != tamanho-1:\n if listadePrimos[contador] + listadePrimos[contador+1] + 1 in listadePrimos:\n count+=1\n contador+=1\n\nif count < k:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n \n \n\n\t\t\t\t\t \t \t \t\t \t \t \t\t\t", "def SieveOfEratosthenes(n):\r\n l_prime = []# list for prime element\r\n prime = [True for _ in range(n + 1)]\r\n p = 2\r\n while p * p <= n:\r\n if prime[p] == True:\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n # Print all prime numbers\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n l_prime.append(p)\r\n return l_prime\r\n\r\nn, k = map(int,input().split())\r\nl_prime = SieveOfEratosthenes(n)\r\n\r\nif k == 0:\r\n print('YES')\r\nelse: # if k geterthen zero\r\n len_l_prime = len(l_prime)\r\n if len_l_prime < 6: # this type of prime number start 6th number of prime\r\n print('NO')\r\n else:\r\n count = 0 # count this type of prime number\r\n for i in range(5, len_l_prime): # check every prime number that this type or not.\r\n for j in range(1, i):\r\n if l_prime[j - 1] + l_prime[j] == l_prime[i] - 1:\r\n count += 1\r\n if count == k:\r\n break\r\n if count == k:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n", "def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\ndef solve(n, k):\n primes = [i for i in range(2, n+1) if is_prime(i)]\n count = 0\n for i in range(2, len(primes)):\n if primes[i-2] + primes[i-1] + 1 <= n and is_prime(primes[i-2] + primes[i-1] + 1):\n count += 1\n return \"YES\" if count >= k else \"NO\"\n\nn, k = map(int, input().split())\nprint(solve(n, k))\n\t\t\t\t \t\t \t \t \t \t", "def solve(n, k):\r\n\tprimes = set([*range(2, n + 1)])\r\n\r\n\tfor i in range(2, int(n**(1/2)) + 1): \r\n\t\tif i in primes: \r\n\t\t\tj = 2\r\n\t\t\twhile i*j < n:\r\n\t\t\t\tif i*j in primes:\r\n\t\t\t\t\tprimes.remove(i*j)\r\n\t\t\t\tj += 1\r\n\tprimesL = list(primes)\r\n\r\n\ttotal = 0\r\n\tfor i in range(len(primesL) - 2):\r\n\t\tif (primesL[i] + primesL[i + 1] + 1) in primes: \r\n\t\t\ttotal += 1\r\n\r\n\tif total >= k: \r\n\t\tprint(\"YES\")\r\n\telse: print(\"NO\")\r\n\r\nn, k = map(int, input().split(\" \"))\r\nsolve(n, k)\r\n", "n, k = map(int, input().split(' '))\r\nP = []\r\nfor i in range(2, n + 1):\r\n if all(i % p != 0 for p in P):\r\n P.append(i)\r\nfor i in range(len(P) - 1):\r\n if P[i] + P[i + 1] + 1 in P:\r\n k -= 1\r\nprint(\"YES\" if k <= 0 else \"NO\")\r\n", "def noldbach (n,k):\r\n n = list(range(3,n+1,2))\r\n prime = [2]\r\n for num in n:\r\n kill = 0\r\n for div in prime:\r\n if num%div == 0:\r\n kill = 1\r\n break\r\n if kill == 0:\r\n prime.append(num)\r\n i = 0\r\n while i < len(prime)-1 and k>0 :\r\n if prime[i] + prime[i+1] + 1 in prime :\r\n k -= 1\r\n i += 1\r\n\r\n if k == 0 :\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nn,k = list(map(int,input().split()))\r\nprint(noldbach(n,k))\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n, k = map(int,input().split())\r\nprimes = []\r\n\r\nfor num in range(2,n+1):\r\n\tif all(num%prime for prime in primes):\r\n\t\tprimes.append(num)\r\n\r\nprint('NO' if sum(primes[i]+primes[i+1]+1 in primes\r\n for i in range(len(primes)-1)) < k else 'YES')", "n, k = map(int, input().split())\r\n\r\nd = []\r\nsieve = set(range(2, n+1))\r\nwhile sieve:\r\n prime = min(sieve)\r\n d.append(prime)\r\n sieve -= set(range(prime, n+1, prime))\r\n\r\nc = 0\r\nfor i in range(len(d)):\r\n\r\n for a in range(i):\r\n if d[i] == d[a] + d[a+1] + 1:\r\n c += 1\r\n break\r\n\r\nif c >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,k=map(int, input().split());a=[];q=0\r\nfor p in range(2,n+1):\r\n if all(p%j!=0 for j in a): a.append(p)\r\nfor p in range(len(a)-1):\r\n if a[p]+a[p+1]+1 in a: q+=1\r\nprint(\"YES\" if q>=k else \"NO\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\ndef isprime(num):\r\n if num % 2 == 0 or num % 3 == 0:\r\n return False\r\n\r\n for i in range(5, int(num**0.5)+1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\n\r\nprimes = [2]\r\n\r\nfor num in range(3, n+1):\r\n if isprime(num):\r\n primes.append(num)\r\nst = set(primes)\r\nln = len(primes)\r\nkk = 0\r\nfor i in range(ln-1):\r\n if (primes[i] + primes[i+1] + 1) in st:\r\n kk += 1\r\n\r\nif kk >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin,exit\r\nn,k=map(int,stdin.readline().split())\r\nc=0\r\nl=[True for i in range(n+1)]\r\nl[0],l[1]=False,False\r\nfor i in range(2,n+1):\r\n if(l[i] and i*i<=n):\r\n for j in range(i*i,n+1,i):\r\n l[j]=False\r\np=[]\r\nfor i in range(n+1):\r\n if l[i]==True:\r\n p.append(i)\r\nfor i in range(len(p)-1):\r\n if (p[i]+p[i+1]+1) in p:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n_max=1000\r\n\r\nprime_nu=[0]+[1]*(n_max)\r\nprime_nu[1]=0\r\nfor i in range(2,n_max+1):\r\n if(prime_nu[i]==1):\r\n for j in range(i*2,n_max+1,i):\r\n if(prime_nu[j]==1):\r\n prime_nu[j]=0\r\n\r\n\r\ndef isPrime(b):\r\n if(prime_nu[b]):\r\n return True\r\n else:\r\n return False\r\n\r\n# def isPrime(b):\r\n# flag=True\r\n# if(b==1 or b==0):\r\n# return False\r\n# for i in range(2,int(b**(1/2))+1):\r\n# if(b%i==0):\r\n# flag=False\r\n# break\r\n# return flag\r\n\r\nprimes=[2]\r\nvalid_ans=[]\r\n\r\n\r\nfor i in range(3,n_max+1):\r\n if(isPrime(i)):\r\n nu=i+primes[-1]+1\r\n if(nu<=n_max and isPrime(nu)):\r\n valid_ans.append(nu)\r\n primes.append(i)\r\n\r\ncount=0\r\n\r\nn,k=map(int,input().split())\r\nfor i in valid_ans:\r\n if(i<=n):\r\n count+=1\r\n else:\r\n break\r\nif(count>=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def numero_primo(n):\n if n <= 1:\n return False\n \n for i in range(2, int(n ** 0.5) + 1):\n if n % i == 0:\n return False\n \n return True\n\nn, k = map(int, input().split())\n\nprimos = []\nfor i in range(2, n + 1):\n if numero_primo(i):\n primos.append(i)\n\ncontadora = 0\n\nfor i in range(len(primos) - 1):\n soma = primos[i] + primos[i + 1] + 1\n if soma <= n and numero_primo(soma):\n contadora += 1\n\nif contadora >= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t\t\t\t\t \t \t\t\t \t\t \t \t \t\t", "primes = [True for _ in range(1010)]\r\nprimes[0] = False\r\nprimes[1] = False\r\n\r\nfor i, is_prime in enumerate(primes):\r\n if is_prime:\r\n for j in range(i * i, 1010, i):\r\n primes[j] = False\r\n\r\nprimes = [i for i, is_prime in enumerate(primes) if is_prime]\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\nif k == 0:\r\n print(\"YES\")\r\n exit()\r\n\r\nfrom bisect import bisect\r\n\r\nnums_to_consider = primes[: bisect(primes, n)]\r\nfor num in nums_to_consider[2:]:\r\n num -= 1\r\n half_way = bisect(nums_to_consider, num // 2)\r\n if nums_to_consider[half_way - 1] + nums_to_consider[half_way] == num:\r\n k -= 1\r\n if k == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "# Eratosthenes Sieve Prime Generation\r\ndef gen_primes(n):\r\n count = 0\r\n generator = {}\r\n prime_check = 2\r\n\r\n while True:\r\n if prime_check not in generator:\r\n yield prime_check\r\n generator[prime_check * prime_check] = [prime_check]\r\n if n <= prime_check:\r\n return generator\r\n else:\r\n for p in generator[prime_check]:\r\n generator.setdefault(p + prime_check, []).append(p)\r\n del generator[prime_check]\r\n prime_check += 1\r\n\r\nn, k_number = map(int, input().split())\r\nprime_list = list(gen_primes(n))\r\nprime_all_list = list(gen_primes(1000))\r\ndel prime_all_list[-1]\r\nif prime_list[-1] > n:\r\n del prime_list[-1]\r\n\r\ncount = 0\r\nif len(prime_list) == 1 and k_number == count:\r\n print(\"YES\")\r\nfor i in range(len(prime_list)-1):\r\n if count == k_number:\r\n print(\"YES\")\r\n break\r\n if prime_list[i] + prime_list[i+1] + 1 in prime_all_list and prime_list[i] + prime_list[i+1] + 1 <= n:\r\n count += 1\r\n\r\nif count != k_number:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "from math import sqrt\r\ndef prime(z):\r\n\tfor i in range(2,int(sqrt(z))+1):\r\n\t\tif z%i==0:\r\n\t\t\treturn 0\r\n\treturn 1\t\t\r\nn,k=map(int,input().split())\r\nl=[]\r\ncount=0\r\nfor i in range(2,n+1):\r\n\tif prime(i):\r\n\t\tl.append(i)\t\r\nfor i in range(len(l)-1):\r\n\tt=l[i]+l[i+1]+1\r\n\tif prime(t) and t in l:\r\n\t\tcount+=1\r\nif count>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nimport sys\r\nimport math\r\n\r\ndef primes(number):\r\n size = number + 1\r\n lst = [True] * (number + 1)\r\n primeList = []\r\n for i in range(2, number):\r\n if lst[i] == False : continue \r\n for j in range(i*2, size, i):\r\n if j < size and lst[j] == True and j % i == 0:\r\n lst[j] = False\r\n\r\n for i in range(size-1, 0, -1):\r\n if lst[i] == True :\r\n primeList.append(i)\r\n\r\n primeList.sort()\r\n return primeList[1:]\r\n \r\n\r\ndef solve(firstLine):\r\n n ,k = firstLine[0], firstLine[1]\r\n primeList = primes(n * 2 + 1)\r\n \r\n \r\n sol = 0\r\n \r\n for i, prime in enumerate(primeList):\r\n if primeList[i + 1] > n:\r\n break\r\n \r\n num = primeList[i + 1] + primeList[i] + 1\r\n if num <= n and num in primeList:\r\n #print(primeList[i + 1] ,primeList[i], num)\r\n sol += 1\r\n\r\n \r\n # for prime in primeList:\r\n # lst[prime] += 1\r\n # for i in range(prime * 2, n + 1 , prime):\r\n # lst[i] = max([lst[i], lst[i-prime]]) + 1\r\n #print(\"aa\", sol)\r\n if sol >= k:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n \r\n return\r\n\r\ndef main():\r\n firstLine = sys.stdin.readline().split()\r\n firstLine = list(map(int, firstLine))\r\n\r\n solve(firstLine)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def isPrime(n):\n if 2>n:\n return False\n if 2==n:\n return True\n if n%2==0:\n return False\n for i in range(3,int(n**0.5)+1,2):\n if n%i==0:\n return False\n return True\n\n\nN,K = map(int,input().split())\nprimes = [i for i in range(N+1) if isPrime(i)]\ncount = 0\n\nfor i in range(len(primes)):\n p = primes[i]\n for j in range(i-1):\n if primes[j]+primes[j+1]+1==p:\n count+=1\n break\n if count>=K:\n break\n\nif count>=K:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom types import *\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef sieve(n):\r\n is_prime = [1] * (n+1)\r\n i = 2\r\n while i*i <= n:\r\n for j in range(2*i, n+1, i):\r\n is_prime[j] = 0\r\n i += 1\r\n\r\n primes = []\r\n for i in range(2,n+1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n return primes\r\n\r\ndef solve():\r\n n, k = MII()\r\n primes = sieve(n)\r\n primes_set = set(primes)\r\n cnt = 0\r\n\r\n for num in range(2, n+1):\r\n if num not in primes_set:\r\n continue\r\n\r\n num -= 1\r\n for i in range(1, len(primes)):\r\n x0 = primes[i-1]\r\n x1 = primes[i]\r\n if x0+x1 > num:\r\n break\r\n \r\n if x0+x1 == num:\r\n cnt += 1\r\n break\r\n\r\n print('YES' if cnt>=k else 'NO')\r\n\r\nsolve()\r\n", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple, OrderedDict\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations, combinations\r\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] * (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n**0.5)+1):\r\n if is_prime[p]:\r\n for i in range(p*p, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n\r\ndef binPowRec(a,b):\r\n\r\n if b == 0:\r\n return 1\r\n \r\n res = binPowRec(a, b//2)\r\n # If b is odd\r\n # If b % 2 == 1\r\n if b % 2:\r\n return res * res * a\r\n else:\r\n return res * res\r\n\r\n\r\n# pow(a,b) in O(log n)\r\ndef binPow(a, b):\r\n\r\n res = 1\r\n\r\n while b > 0:\r\n # b << 1 = b * 2\r\n # b >> 1 = b/2\r\n # If b & 1 = b % 2 \r\n # If b % 2 == 1\r\n if b & 1:\r\n res = res * a\r\n\r\n a = a * a\r\n\r\n # b >> 1 = b//2\r\n # b >> 2 = b//4\r\n # b >> 3 = b//8\r\n # b >> 4 = b//16\r\n b >>= 1\r\n\r\n return res\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\nn, k = readarray(int)\r\n\r\n\r\nisPrime = [True for _ in range(n+1)]\r\n\r\nisPrime[0] = False\r\nisPrime[1] = False\r\n\r\n\r\nfor i in range(2, n+1):\r\n if isPrime[i] and i * i <= n:\r\n for j in range(i*i, n+1, i):\r\n isPrime[j] = False\r\n\r\n\r\nprimes = [num for num in range(2,n+1) if isPrime[num]]\r\n\r\nd = Counter(primes) \r\n\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(primes)-1):\r\n if primes[i] + primes[i+1] + 1 in d:\r\n total += 1\r\n\r\nprint(\"YES\" if total >= k else \"NO\")", "n,k = map(int,input().split())\r\nin_lis = []\r\nprime_lis = []\r\nfor i in range(2,n+1):\r\n if i not in in_lis:\r\n prime_lis.append(i)\r\n for j in range(i*i,n+1,i):\r\n in_lis.append(j)\r\n#print(prime_lis) -----denotes list of prime numbers using sieve of eratosthenes\r\n\r\ncount = 0\r\nfor i in range(len(prime_lis)-1):\r\n if prime_lis[i]+prime_lis[i+1]+1 in prime_lis:\r\n count+=1\r\n\r\nif count>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput=sys.stdin.readline\r\nLI=lambda:list(map(int, input().split()))\r\nMI=lambda:map(int, input().split())\r\nSI=lambda:input().strip('\\n')\r\nII=lambda:int(input().strip('\\n'))\r\nN=1001\r\nn, k=MI()\r\nprimes=[]\r\nok=[True]*N\r\nfor i in range(2, N):\r\n if ok[i]:\r\n for j in range(i+i, N, i):\r\n ok[j]=False\r\n primes.append(i)\r\ncnt=0\r\nfor i, p in enumerate(primes):\r\n if p>n:\r\n break\r\n for j in range(i):\r\n if primes[j]+primes[j+1]==p-1:\r\n cnt+=1\r\n break\r\nprint(['YES', 'NO'][cnt<k])", "n, k = map(int, input().split())\r\n\r\na = [True] * (n + 1)\r\na[0] = a[1] = False\r\n\r\nfor i in range(2, n + 1):\r\n if a[i]:\r\n for j in range(2 * i, n + 1, i):\r\n a[j] = False\r\n\r\np = [i for i in range(2, n + 1) if a[i]]\r\ns = {p[i] + p[i + 1] + 1 for i in range(len(p) - 1)}\r\n\r\nprint(\"YES\" if len([el for el in p if el in s]) >= k else \"NO\")", "def p(x):\r\n if x<=1:\r\n return False\r\n else:\r\n for i in range(2,int(x**0.5+1)):\r\n if x % i ==0:\r\n return False\r\n \r\n return True \r\n \r\nn,k=map(int,input().split())\r\nprosti=[]\r\nfor i in range(2,n+1):\r\n if p(i):\r\n prosti.append(i)\r\nbr=0\r\nfor i in range(len(prosti)-1):\r\n if prosti[i]+prosti[i+1]+1 in prosti:\r\n br+=1\r\nif br>=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def primes_sieve(limit):\r\n n = limit + 1\r\n not_prime = [False]*n\r\n primes = []\r\n\r\n for i in range(2,n):\r\n if not_prime[i]:\r\n continue\r\n for f in range(i*2,n,i):\r\n not_prime[f] = True\r\n\r\n primes.append(i)\r\n #print(primes)\r\n return primes\r\ndef main():\r\n n, k = map(int,input().split())\r\n prime = primes_sieve(n)\r\n n += 1\r\n cnt = 0\r\n\r\n for item in range(len(prime) - 1):\r\n if prime[item] + prime[item+1] + 1 in prime:\r\n k -= 1\r\n\r\n if k <= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k = map(int,input().split(' '))\r\ncount = 0\r\na = [i for i in range(n+2)]\r\nfor i in range(2, int(n**0.5)+2):\r\n for j in range(i*i, n+2, i):\r\n a[j] = 0\r\na = [i for i in a[::-1] if i!=0 and i!=1]\r\nfor i in range(0,len(a)-2):\r\n num = a[i]\r\n # print('\\n',num)\r\n for j in range(i, len(a)-1):\r\n # print(j, a[j], a[j+1])\r\n if num == (a[j]+ a[j+1] + 1):\r\n count += 1\r\n # print(count)\r\nprint(\"YES\" if count>=k else \"NO\")", "p=[True for i in range(3002)]\np2=[False for i in range(3002)]\np[0]=False\np[1]=False\nfor i in range(3002):\n\tif p[i]:\n\t\tfor j in range(i+i,3002,i):\n\t\t\tp[j]=False\nl1=[]\nfor i in range(1002):\n\tif p[i]:\n\t\tl1.append(i)\nl2=[]\n#print(l1)\nfor i in range(1,len(l1)):\n\tl2.append(l1[i])\ncnt=0\nn,k=map(int,input().split())\nfor i in range(len(l2)):\n\ttemp=l1[i]+l2[i]+1\n\tif p[temp]:\n\t\tp2[temp]=True\n\t#\tcnt=cnt+1\nfor i in range(2,n+1):\n\tif p2[i]:\n\t#\tprint(i)\n\t\tcnt=cnt+1\nif cnt>=k:\n\tprint('YES')\nelse:\n\tprint('NO')", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\npr=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\nprime=[True for k in range(510)]\r\np=2\r\nwhile p*p<=510:\r\n if prime[p]==True:\r\n for k in range(p*p,510,p):\r\n prime[k]=False\r\n p+=1\r\nsieve=[]\r\nfor k in range(2,510):\r\n if prime[k]:\r\n sieve.append(k)\r\nsumoNPs=[]\r\nfor k in range(len(sieve)-1):\r\n sumoNPs.append(sieve[k]+sieve[k+1])\r\n\r\n#binary search\r\ndef isin(l,x):\r\n left=0\r\n right=len(l)-1\r\n while left<=right:\r\n mid=left + (right-left)//2\r\n if l[mid]==x:\r\n return True\r\n elif l[mid]<x:\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n return False\r\n\r\ndef decompose(k):\r\n s=0\r\n while True:\r\n if k%2==1:\r\n return s,k\r\n k=k//2\r\n s+=1\r\n\r\ndef miller(n):\r\n check=[]\r\n if n==2:\r\n return True\r\n if n<2047: check=[2]\r\n elif n<1373653: check=[2,3]\r\n elif n<9080191: check=[31,73]\r\n elif n<25326001: check=[2,3,5]\r\n elif n<3215031751: check=[2,3,5,7]\r\n elif n<4759123141: check=[2,7,61]\r\n else: return True\r\n\r\n s,d=decompose(n-1)\r\n for a in check:\r\n x=pow(a,d)\r\n if x%n==1 or x%n==(n-1):\r\n continue\r\n bool=False\r\n for _ in range(s-1):\r\n x=x*x\r\n if x%n==(n-1):\r\n bool=True\r\n break\r\n if bool: continue\r\n return False\r\n return True\r\n\r\ndef main():\r\n n,x=[int(k) for k in i().split()]\r\n count=0\r\n for k in range(2,n+1):\r\n if miller(k) and isin(sumoNPs,k-1):\r\n count+=1\r\n if count>=x:\r\n pr(\"YES\\n\")\r\n else:\r\n pr(\"NO\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "inp=list(map(int,(input().split())))\r\ndef isPrime(n):\r\n for j in range(2,n):\r\n if n%j==0 and n!=2:\r\n return False \r\n return True\r\nprimelist=[p for p in range(2,inp[0]+1) if isPrime(p)]\r\ns=0\r\nfor i in range(0,len(primelist)-1):\r\n if primelist[i]+primelist[i+1]+1 in primelist:\r\n s+=1\r\nif s>=inp[1]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "import math\r\ndef isPrime(i):\r\n\tif sieve[i]:\r\n\t\tfor j in range(i*i,n+1,i):\r\n\t\t\tsieve[j] = False\r\n\r\nn, k = map(int, input().split())\r\n\r\nsieve = [True for i in range(n+1)]\r\nsieve[0]= sieve[1] = False\r\nrnge = int(math.sqrt(n))\r\nprime = []\r\nfor i in range(2,rnge+1):\r\n\tisPrime(i)\r\nfor i in range(2, n+1):\r\n\tif sieve[i]:\r\n\t\tprime.append(i)\r\ncount = 0\r\nsum = 0\r\nfor i in range(len(prime)-1):\r\n\tsum = prime[i] + prime[i+1] + 1\r\n\tif sum in prime:\r\n\t\tcount += 1\r\nif count >= k:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t", "def main():\r\n n, k = map(int,input().split())\r\n nums = [True] * (n+1)\r\n primes = []\r\n for i in range(2,n+1):\r\n if nums[i] == True:\r\n primes.append(i)\r\n j = 2\r\n while i* j <= n:\r\n nums[i*j] = False\r\n j += 1\r\n ans = 0\r\n num = set(primes)\r\n for i in range(1,len(primes)):\r\n if (primes[i-1] + primes[i] + 1) in num:\r\n ans += 1\r\n if ans >= k:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nmain()", "# Finds if number is Prime\r\ndata = input().split(' ')\r\nn = int(data[0])\r\nk = int(data[1])\r\n\r\ndef isPrime(n):\r\n A = []\r\n factor = 2\r\n while n > 1:\r\n if n % factor == 0:\r\n A.append(factor)\r\n n = n / factor\r\n else:\r\n factor+=1\r\n if len(A)==1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nprimes = []\r\nNoldbach_number =0\r\nfor i in range(2, n+1):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(len(primes)-1):\r\n for j in range(len(primes)):\r\n if primes[i] + primes[i+1] + 1 == primes[j]:\r\n Noldbach_number += 1\r\n\r\nif Noldbach_number>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int,input().split())\r\nl = []\r\nct = 0\r\nfor i in range(2,2*n+1):\r\n b = True\r\n for j in range(2,i):\r\n if j*j > i:\r\n break;\r\n if(i%j == 0):\r\n b = False\r\n break;\r\n if(b):\r\n l.append(i)\r\nfor i in range(0,len(l)-1):\r\n if l[i]+l[i+1]+1 > n:\r\n break\r\n if l[i]+l[i+1]+1 in l:\r\n ct += 1\r\nif ct < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# your code goes here# your code goes here\r\ndef prime(n):\r\n\tsieve=[True]*(n+1)\r\n\tsieve[0],sieve[1]=False,False\r\n\tfor i in range(2,n+1):\r\n\t\tif sieve[i]:\r\n\t\t\tfor j in range(i*i,n+1,i):\r\n\t\t\t\tsieve[j]=False\r\n\treturn [[i for i in range(n+1) if sieve[i]],sieve]\r\nn,k=list(map(int,input().split()))\r\nneighbouring,prime=prime(n)\r\nc=0\r\nfor i in range(len(neighbouring)-1):\r\n\ts=1+neighbouring[i]+neighbouring[i+1]\r\n\t\r\n\tif s>n:\r\n\t\tbreak\r\n\tif prime[s]:\r\n\t\t# print(1,neighbouring[i],neighbouring[i+1],s)\r\n\t\tc+=1\r\nif c>=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "primes = list()\r\nprimeset = set()\r\n\r\nfor i in range(1, 1000):\r\n prime = True\r\n for j in range(2, i):\r\n if i % j == 0:\r\n prime = False\r\n break\r\n if prime:\r\n primes.append(i)\r\n primeset.add(i)\r\n\r\ncnt = 0\r\n\r\nn, k = map(int, input().split())\r\n\r\nfor i in range(n - 1):\r\n r = primes[i] + primes[i + 1] + 1\r\n if r <= n:\r\n if r in primeset:\r\n cnt += 1\r\n else:\r\n break\r\n\r\nprint(\"YES\" if cnt >= k else \"NO\")\r\n", "num, n = map(int, input().split())\r\nisPrime = [True] * (num+1)\r\nisPrime[0] = isPrime[1] = False\r\nprimes = []\r\nfor i in range(2, num+1):\r\n if isPrime[i]:\r\n primes.append(i)\r\n if i * i <= num:\r\n for j in range(i*i, num+1, i):\r\n isPrime[j] = False\r\n\r\nfor i in range(len(primes)):\r\n for j in range(i):\r\n if j + 1 >= i:\r\n break\r\n if primes[j] + primes[j+1] + 1 == primes[i]:\r\n n -= 1\r\n\r\nif n <= 0:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\n\r\ndef isPrime(num):\r\n for i in range(2, math.floor(math.sqrt(num)) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\n\r\nprimes = []\r\n\r\nfor i in range(2, n + 1):\r\n if isPrime(i):\r\n primes.append(i)\r\n\r\nfor i in range(2, len(primes)):\r\n for j in range(i - 1):\r\n if primes[i] == primes[j] + primes[j + 1] + 1:\r\n k -= 1\r\n break\r\n\r\nprint(\"YES\" if k <= 0 else \"NO\")", "from math import sqrt\r\ndef sito(n):\r\n sq = int(sqrt(n))\r\n obecnie=1\r\n tab=[i for i in range(1, n+1)]\r\n while True:\r\n if obecnie>sq:\r\n return tab\r\n for i in tab:\r\n if (not(i%obecnie) and not(obecnie==i)) and obecnie!=1:\r\n tab.remove(i)\r\n i = tab.index(obecnie)+1\r\n obecnie = tab[i]\r\n\r\nwejscie = list(input().split(' '))\r\nn = int(wejscie[0])\r\nileWymagane = int(wejscie[1])\r\n#generate prime numbers to n\r\nprimes = sito(n)\r\nile = 0\r\nfor i in range(len(primes)-1):\r\n suma = primes[i] + primes[i+1] + 1\r\n if suma in primes:\r\n ile += 1\r\nif ile >= ileWymagane:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def SieveOfEratosthenes():\r\n prim =list()\r\n n=10000 \r\n \r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n while (p * p <= n): \r\n \r\n \r\n if (prime[p] == True): \r\n \r\n \r\n for i in range(p * 2, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n \r\n \r\n for p in range(2, n): \r\n if prime[p]: \r\n prim.append(p)\r\n return prim\r\n\r\nn,a = map(int,input().split(\" \"))\r\nprim = SieveOfEratosthenes()\r\ni=0\r\ncount = 0\r\nwhile i<n:\r\n if n<=prim[i]:\r\n break\r\n s = prim[i]+prim[i+1]+1\r\n \r\n if s in prim and s<=n:\r\n count=count+1\r\n \r\n i=i+1\r\n \r\nif count>=a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\n\r\nprimes = []\r\nflag = [1] * 1001\r\n\r\n\r\ndef list_prime():\r\n for i in range(2, 1001):\r\n if flag[i] == 1:\r\n primes.append(i)\r\n if i * i < 1001:\r\n for j in range(i * i, 1001, i):\r\n flag[j] = 0\r\n\r\n\r\ndef judge(x):\r\n if primes.count(x) != 0:\r\n for i in range(primes.index(x)):\r\n if x == primes[i] + primes[i + 1] + 1:\r\n return True\r\n return False\r\n\r\n\r\ndef solve():\r\n cnt = 0\r\n list_prime()\r\n for i in range(13, n + 1, 2):\r\n if judge(i):\r\n cnt += 1\r\n if cnt >= k:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(solve())\r\n", "#17A - Nolbach Problem\r\n# n - prime number, indirectly: the interval from 2 to n (inclusively) we look into\r\n# k - the guessed number of k prime numbers that can be expresses\r\n#as the sum of 2 neighbor prime numbers and 1 (19 = 7 + 11 + 1)\r\nn, k = map(int, input().split())\r\n#We look for primes that make up the sum and store them in a list\r\nprimes = []\r\n#We consider the cases from 2 to n (inclusively) \r\nfor num in range(2, n + 1):\r\n #Numbers must be greater than 1\r\n if num > 1:\r\n #Firstly, we check if the number is prime\r\n for i in range(2, num):\r\n #If it has divisors, it's not a prime number\r\n if (num % i) == 0:\r\n break\r\n #Else, we append that number to the list of primes that may make up the\r\n #sum for n\r\n else:\r\n primes.append(num)\r\n#Now, we see if the guessed k coresponds to the actual number of primes making up n \r\ncount = 0\r\nfor i in range(len(primes) - 1):\r\n #we keep track of the number of primes that satisfy Nick's invented rule:\r\n if count == k:\r\n break\r\n #If we find a prime number that satisfies the Nolbach rule:\r\n if primes[i] + primes[i+1] + 1 in primes:\r\n #We add that to the count\r\n count += 1\r\n if count == k:\r\n break\r\n \r\n#Finally, if the real count matches the k guessed count: \r\nif count == k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# The same file will be used throughout Problem Set by saving after writing different codes\r\ndef primesFunc(num):\r\n arr = [False for x in range(n+1)];\r\n for i in range(2, n+1):\r\n if arr[i] == False:\r\n j = i * i;\r\n while j < n+ 1:\r\n arr[j] = True;\r\n j += i;\r\n primes = [];\r\n for x in range(2, n+ 1):\r\n if arr[x] == False:\r\n primes.append(x);\r\n return primes;\r\n\r\nn, k = map(int, input().split());\r\nlist_primes = primesFunc(n);\r\nset_primes = set(list_primes);\r\ncount = 0;\r\nfor x in range(len(list_primes) - 1):\r\n sum = list_primes[x] + list_primes[x+1] + 1;\r\n if sum in set_primes:\r\n count += 1;\r\nif count >= k:\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");", "n, k = [int(a) for a in input().split()]\n\n\ndef prime(n):\n for i in range(n - 2):\n if n % (i + 2) == 0:\n return False\n return True\n\n\nprimes = [i + 2 for i in range(n - 1) if prime(i + 2)]\n\ns = 0\ni = 0\nr = 0\nwhile i < len(primes) - 1 and r < k:\n s = primes[i] + primes[i + 1] + 1\n if s <= n and prime(s):\n r += 1\n i += 1\n\nif r == k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\ndef calcular_n_primos(n):\r\n primos = [2,3,5]\r\n i = 5\r\n while i <= n:\r\n es_primo = True\r\n for j in primos:\r\n if i % j == 0:\r\n es_primo = False\r\n break;\r\n if es_primo:\r\n primos.append(i)\r\n i = i+2\r\n return primos\r\n\r\ndatos = input().split()\r\nn, k = int(datos[0]) , int(datos[1])\r\nc = 0\r\nprimos = calcular_n_primos(n)\r\nif n >= 12:\r\n for i in range(len(primos)-1):\r\n if primos[i] + primos[i+1] + 1 in primos:\r\n c = c + 1\r\nif c >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def Primo(N):\r\n c = 0\r\n for k in range (2,N):\r\n if N%k==0:\r\n c += 1\r\n if c==0:\r\n return True\r\n else:\r\n return False\r\ndef CuantosNick(N):\r\n A = []\r\n c = 0\r\n for k in range (2,N):\r\n if Primo(k):\r\n A.append(k)\r\n for k in range (len(A)):\r\n if (k+1)!=len(A):\r\n SupuestoPrimo = A[k]+ A[k+1] + 1\r\n if Primo(SupuestoPrimo) and SupuestoPrimo<=N:\r\n c+=1\r\n return c \r\nL = input()\r\nL = L.split()\r\nn = int(L[0])\r\nk = int(L[1])\r\nif CuantosNick(n) >= k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def primo(numero):\r\n\r\n for i in range(2,numero):\r\n if (numero%i)==0:\r\n return False\r\n return True\r\n \r\nx=input()\r\nx=x.split()\r\nm=0\r\nif int(x[1])==0:\r\n print(\"YES\")\r\nelse:\r\n if int(x[0])<=12:\r\n print(\"NO\")\r\n else:\r\n for y in range (13,int(x[0])+1):\r\n if primo(y) == True:\r\n t=(y-1)//2\r\n s=t\r\n u=t\r\n while primo(s)!= True:\r\n s=s-1\r\n \r\n while primo(u)!= True:\r\n u=u+1\r\n \r\n if s+u==y-1 and s!=u:\r\n m=m+1\r\n \r\n if m==int(x[1]):\r\n print(\"YES\")\r\n break\r\n if m<int(x[1]):\r\n print(\"NO\")", "def resheto_eratosfena(n):\r\n p=[1]*(n+1)\r\n p[0]=0\r\n p[1]=0\r\n i=2\r\n while i*i<=n:\r\n for j in range(i*i,n+1,i):\r\n p[j]=0\r\n i+=1\r\n while i<n+1 and not p[i]:\r\n i+=1\r\n return p\r\nn,k=[int(e) for e in input().split()]\r\np=resheto_eratosfena(n)\r\np=[i for i in range(2,n+1) if p[i]]\r\nc=0\r\nfor x in p:\r\n for i in range(len(p)-1):\r\n if p[i]+p[i+1]+1==x:\r\n c+=1\r\n break\r\nprint(\"YES\" if c>=k else \"NO\")", "def isprime(x):\r\n k = 2\r\n while k <= x**0.5:\r\n if x%k==0:\r\n return False\r\n k+=1\r\n return True\r\n\r\n\r\ndef Primes(n):\r\n c = 0\r\n prime = [True for i in range(n+1)]\r\n \r\n for i in range(2,int(n**0.5)+1):\r\n if isprime(i):\r\n for j in range(i*i,n+1,i):\r\n prime[j] = False\r\n a = []\r\n for i in range(2,len(prime)):\r\n if prime[i]:\r\n a.append((i)) \r\n return a\r\n\r\nx = input().split(\" \")\r\nn = int(x[0])\r\nk = int(x[1])\r\na = (Primes(n))\r\nc=0\r\nfor i in range(len(a)-1):\r\n if a[i]+a[i+1]+1 in a:\r\n c+=1\r\nif c>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = list(map(int,input().split()))\r\nprime = [True for i in range(n+2)]\r\np = 2\r\nwhile p*p<=n:\r\n if prime[p]==True:\r\n for i in range(p*p,n+1,p):\r\n prime[i] = False\r\n p+=1\r\nans = []\r\nfor i in range(2,n+1):\r\n if prime[i]:\r\n ans.append(i)\r\ncnt = 0\r\nfor i in range(len(ans)):\r\n for j in range(1,i):\r\n if ans[j]+ans[j-1]+1==ans[i]:\r\n cnt+=1\r\n break\r\nif cnt>=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\n# Main function\r\ndef main():\r\n mystical_n, mystical_k = map(int, input().split())\r\n\r\n mot_prime = [False, False] + [True] * (mystical_n - 1)\r\n for k in range(2, int(math.sqrt(mystical_n)) + 1):\r\n if mot_prime[k]:\r\n for m in range(2 * k, mystical_n + 1, k):\r\n mot_prime[m] = False\r\n\r\n mot_primes = [k for k, is_prime in enumerate(mot_prime) if is_prime]\r\n\r\n mot_total = 0\r\n for k in range(2, len(mot_primes)):\r\n for m in range(k - 1):\r\n if mot_primes[m] + mot_primes[m + 1] + 1 == mot_primes[k]:\r\n mot_total += 1\r\n\r\n if mot_total >= mystical_k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n# Invoke the main function\r\nmain()\r\n", "#Nodlbah\r\nfrom math import sqrt\r\ndef findD(a):\r\n sq = int(sqrt(a))\r\n d = []\r\n for i in range(2, sq + 1):\r\n if a % i == 0:\r\n d.append(i)\r\n d.append(a // i)\r\n d.append(a)\r\n #print(d)\r\n return sorted(d)\r\n \r\ndef isEven(a):\r\n if a == 2: return True\r\n if a % 2 == 0: return False\r\n if len(findD(a)) == 1: return True\r\n else: return False\r\n\r\ndef findEven(n):\r\n evenList = []\r\n for i in range(5, n + 1):\r\n #if amount == k: break\r\n if isEven(i): \r\n # print(i, ' even')\r\n evenList.append(i)\r\n return evenList\r\n \r\nn, k = map(int, input().split()) # 2 ... n\r\n # k - amount of thats evens\r\namount = 0\r\nevenList = findEven(n)\r\nfor i in range(1, len(evenList)):\r\n for num in range(len(evenList)): \r\n #print(evenList[num] - 1, evenList[i], evenList[i + 1], evenList[num] - 1 - evenList[i] - evenList[i + 1] == 0)\r\n if evenList[num] - 1 - evenList[i - 1] - evenList[i] == 0: amount +=1\r\n if amount == k: break\r\n if amount == k: break\r\n#print(amount)\r\nif amount >= k: print('YES')\r\nelse: print('NO')\r\n", "import math\n\nentrada = input().split()\n\nn = int(entrada[0])\nk = int(entrada[1])\n\namazon = [0] * (n + 1)\n\namazon[0] = 0\namazon[1] = 0\n\ni = 2\nwhile(i <= n):\n amazon[i] = 1\n i += 1\n\ni = 2\nwhile(i <= (math.sqrt(n) + 1)):\n if (amazon[i] == 0):\n i += 1\n continue\n\n m = 2 * i\n while(m <= n):\n amazon[m] = 0\n m += i\n\n i += 1\n\nnetflix = []\ni = 2\nwhile(i <= n):\n if (amazon[i] != 0):\n netflix.append(i)\n i += 1\n\nresult = 0\ni = 2\nwhile(i < len(netflix)):\n m = 0\n while(m < (i - 1)):\n if((netflix[m] + netflix[m + 1] + 1) == netflix[i]):\n result += 1\n m += 1\n\n i += 1\n\nif (result >= k):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t \t\t\t \t \t\t \t\t\t\t \t \t \t \t", "\r\nn, k = list(map(int, input().split()))\r\na = [True]*(n+1)\r\na[0] = a[1] = False\r\nfor (i, isprime) in enumerate(a):\r\n if isprime:\r\n for j in range(i * i, n+1, i):\r\n a[j] = False\r\nt = [y for y in range(n+1) if a[y]]\r\nans = 0\r\nfor p in range(len(t)-1):\r\n if (t[p]+t[p+1] +1) in t:\r\n ans += 1\r\nif ans >= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\ndef che(x):\r\n v = 2\r\n for a in range(2, x):\r\n if ip(a) == True:\r\n if a + v + 1 == x:\r\n return (1)\r\n else:\r\n v = a\r\n return (0)\r\n\r\n\r\nfor i in range(2, n + 1):\r\n if k == 0:\r\n print(\"YES\")\r\n break\r\n if ip(i) == True:\r\n k -= che(i)\r\nelse:\r\n print(\"NO\")\r\n" ]

{"inputs": ["27 2", "45 7", "2 0", "15 1", "17 1", "34 5", "37 4", "43 5", "47 7", "50 5", "57 6", "60 8", "62 7", "76 9", "69 7", "113 10", "141 11", "207 16", "231 18", "296 19", "332 20", "378 24", "428 23", "497 27", "640 32", "798 35", "802 35", "864 40", "953 44", "995 44", "1000 44", "1000 0", "1000 1000", "2 1000", "2 0"], "outputs": ["YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES"]}

UNKNOWN

PYTHON3

CODEFORCES

238